Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "def solve(arr):\r\n arr.sort(key=lambda q: q[1] - q[0])\r\n m = sum(si for a, b, si in arr)\r\n k = s * (m // s)\r\n n = m - k\r\n x, y, z = 0, 0, 0\r\n for a, b, si in arr:\r\n if k >= si:\r\n k -= si\r\n z += si * a\r\n elif k > 0:\r\n z += k * a\r\n x = (si - k) * a\r\n y = (si - k) * b\r\n k = 0\r\n else:\r\n x += si * a\r\n y += si * b\r\n return x, y, z, n\r\n\r\nn, s = map(int, input().split())\r\narr1, arr2 = [], []\r\nfor i in range(n):\r\n\tsi, ai, bi = map(int, input().split())\r\n\tif ai > bi: arr1.append((ai, bi, si))\r\n\telse: arr2.append((bi, ai, si))\r\nx1, y1, z1, n1 = solve(arr1)\r\nx2, y2, z2, n2 = solve(arr2)\r\nd = x1 + x2 if n1 + n2 > s else max(x1 + y2, x2 + y1)\r\nprint(z1 + z2 + d)", "def solve(ls):\n\n ls.sort(key=lambda q: q[1] - q[0])\n\n m = sum(si for a, b, si in ls)\n\n k = s * (m // s)\n\n n = m - k\n\n x = y = z = 0\n\n for a, b, si in ls:\n\n if k >= si:\n\n k -= si\n\n z += si * a\n\n elif k:\n\n z += k * a\n\n x = (si - k) * a\n\n y = (si - k) * b\n\n k = 0\n\n else:\n\n x += si * a\n\n y += si * b\n\n return x, y, z, n\n\n\n\nn,s = map(int,input().split())\n\nfirst=[]\n\nsecond=[]\n\nfor i in range(n):\n\n\tsi, ai, bi = map(int,input().split())\n\n\tif ai>bi:\n\n\t\tfirst.append((ai,bi,si))\n\n\telse:\n\n\t\tsecond.append((bi,ai,si))\n\nx1,y1,z1,n1 = solve(first)\n\nx2,y2,z2,n2 = solve(second)\n\nd = x1+x2 if n1+n2>s else max(x1+y2,x2+y1)\n\nprint(z1+z2+d)\n\n\n\n\n\n# Made By Mostafa_Khaled" ]

[ "c=input();n,s,d=int(c[:-1]),c[-1],{'a':4,'b':5,'c':6,'d':3,'e':2,'f':1}\r\nx=(n//4*2+(n-1)%2-2*(n%4==0))*6+d[s]+n\r\nprint(x-1 if (n-1)%4<2 else x-3)", "s=input()\r\na=int(s[:-1])-1\r\nprint(a//4*16+(a%2)*7+' fedabc'.index(s[-1]))", "given = input()\nrow = int(given[:-1])\naisle = given[-1]\n\nresult = 16 * ((row - 1) // 4)\nif row % 2 == 0:\n result += 7\nif aisle == 'f':\n result += 1\nif aisle == 'e':\n result += 2\nif aisle == 'd':\n result += 3\nif aisle == 'a':\n result += 4\nif aisle == 'b':\n result += 5\nif aisle == 'c':\n result += 6\nprint(result)\n\n\t \t \t\t \t \t\t\t \t\t\t \t\t\t", "n=list(input())\r\nl=['','f','e','d','a','b','c']\r\nans=l.index(n[-1])\r\nn=int(''.join(n[:-1]))\r\nans+=(n-1)//4*16\r\nn=(n-1)%4+1\r\nif n%2==0: ans+=7\r\nprint(ans)", "ns = input()\nn, s = int(ns[:-1]) - 1, ns[-1]\nans = n // 4 * 16\nn %= 4\nif n % 2:\n ans += 7\nans += '_fedabc'.index(s)\nprint(ans)\n", "tmp = input()\r\nn = int(tmp[:-1])\r\nr = tmp[-1]\r\nmap = {\r\n 'f':1,\r\n 'e':2,\r\n 'd':3,\r\n 'a':4,\r\n 'b':5,\r\n 'c':6\r\n}\r\nprint(((n-1)//4)*16+((n+1)%2)*7+map[r])", "a=input()\r\nnum=int(a[:len(a)-1])\r\nchr=a[len(a)-1]\r\nif num%4==0:\r\n time=16*((num//4)-1)\r\nelse:\r\n time=16*(num//4)\r\nc={'f':1,'e':2,'d':3,'a':4,'b':5,'c':6}\r\nnum=num%4\r\nif num==0:\r\n num=4\r\n\r\nif num==2 or num==4:\r\n time+=7\r\n time+=c[chr]\r\nelse:\r\n time+=c[chr]\r\nprint(time)", "s = input()\r\nide = \"fedabc\"\r\na = int(s[:-1])\r\nb = s[-1]\r\nmoves = (a - 1)\r\nif (a - 1) % 4 > 1:\r\n moves -= 2\r\nmoves += (a - 1) // 4 * 12\r\nif a % 2 == 0:\r\n moves += 6\r\nfor i in range(6):\r\n if ide[i] == b:\r\n moves += i + 1\r\n break\r\nprint(moves)\r\n\r\n\r\n\r\n", "s = input()\r\nn = int(s[:len(s) - 1])\r\nn -= 1\r\nans = (n // 4) * 16\r\nn %= 4\r\nif n % 2 == 1:\r\n ans += 6 + 1\r\nd = {'a':4,'f':1,'e':2,'d':3,'b':5,'c':6}\r\nprint(ans + d[s[-1]])\r\n", "import sys\r\nimport collections\r\n\r\ninput = sys.stdin.readline\r\nMOD = int(1e9 + 7)\r\n\r\ndef solve():\r\n a = input().strip()\r\n N = int(a[:len(a) - 1]) - 1\r\n col = a[-1]\r\n timeToForward = N // 4\r\n move = N % 4\r\n servingTime = {\r\n 'a': 4,\r\n 'b': 5,\r\n 'c': 6,\r\n 'd': 3,\r\n 'e': 2,\r\n 'f': 1\r\n }\r\n if move % 2 == 0:\r\n print(servingTime[col] + 16 * timeToForward)\r\n else:\r\n print(servingTime[col] + 16 * timeToForward + 7)\r\n\r\n\r\nsolve()\r\n\"\"\"\r\n11f\r\n\"\"\"", "def main():\r\n a = input()\r\n x1 = int(a[:len(a)-1])\r\n x2 = a[len(a)-1:]\r\n if x1%4==0:\r\n t = (x1//4-1)*12+x1+3\r\n elif x1%4==2:\r\n t = (x1//4)*12 + 5 +x1\r\n else:\r\n t = (x1//4)*12 + x1 - x1%4\r\n lst = [\"\",\"f\",\"e\",\"d\",\"a\",\"b\",\"c\"]\r\n t += lst.index(x2)\r\n return t\r\nprint(main())\r\n\"\"\"1#\r\n 2##\r\n 3#\r\n 4##\r\n 5#\r\n 6##\r\n 7#\"\"\"", "S=input()\nR=int(S[:-1])\nC=S[-1]\nT=((R-1)//4)*16+((R-1)%2)*7\nif C=='f':\n T+=1\nif C=='e':\n T+=2\nif C=='d':\n T+=3\nif C=='a':\n T+=4\nif C=='b':\n T+=5\nif C=='c':\n T+=6\nprint(T)\n", "s = input()\r\np = s[-1]\r\ns = int(s[:-1])\r\nans1 = 0\r\nif p == 'f':\r\n\tans1 = 1\r\nif p == 'e':\r\n\tans1 = 2\r\nif p == 'd':\r\n\tans1 = 3\r\nif p == 'a':\r\n\tans1 = 4\r\nif p == 'b':\r\n\tans1 = 5\r\nif p == 'c':\r\n\tans1 = 6\r\nans = 16 * ((s - 1) // 4)\r\ntemp = s\r\nwhile s % 4 != 0:\r\n\ts -= 1\r\ntemp -= s\r\ns = temp\r\nif s == 1 or s == 3:\r\n\tprint(ans + ans1)\r\nelse:\r\n\tprint(ans + 6 + 1 + ans1)", "s = input()\nn = int(s[:-1]) - 1\ns = s[-1]\n\nres = n // 4 * (6 * 2 + 4)\nif n % 2 == 1:\n res += 7\nres += {'f': 1, 'e': 2, 'd': 3, 'a': 4, 'b': 5, 'c': 6}[s]\nprint(res)\n", "seat = input()\r\nrow, seat = int(seat[:-1]), seat[-1]\r\nrow -= 1\r\nshift = {'f': 1, 'e': 2, 'd': 3, 'a': 4, 'b': 5, 'c': 6}\r\ntime = shift[seat]\r\nif row % 4 == 2:\r\n row -= 1\r\nelif row % 4 == 1:\r\n row += 1\r\nrow //= 2\r\ntime += 6 * row\r\ntime += row\r\ntime += 2 * (row // 2)\r\nprint(time)", "kalimat = input()\ns = kalimat[-1]\nn = int(kalimat[:-1])\nhasil = ((n - 1) // 4) * 16\nif s == 'a':\n\thasil += 4\nelif s == 'b':\n\thasil += 5\nelif s == 'c':\n\thasil += 6\nelif s == 'd':\n\thasil += 3\nelif s == 'e':\n\thasil += 2\nelif s == 'f':\n\thasil += 1\nif n % 2 == 0:\n\thasil += 7\nprint(hasil)", "\r\n\r\nplace=input()\r\ncolonne=place[-1]\r\nrang=int(place[:-1])\r\nrangs=[4,5,6,3,2,1]\r\nreste=rang%4\r\nif reste==1:\r\n nbSecondes=(rang//4)*16\r\nelif reste==2:\r\n nbSecondes=(rang//4)*16+7\r\nelif reste==3:\r\n nbSecondes=(rang//4)*16\r\nelse:\r\n nbSecondes=(rang//4-1)*16+7\r\nnbSecondes+=rangs[ord(colonne)-ord(\"a\")]\r\n\r\nprint(nbSecondes)\r\n", "def find(str):\r\n if (str == 'f'):\r\n return 1\r\n if (str == 'e'):\r\n return 2\r\n if (str == 'd'):\r\n return 3\r\n if (str == 'a'):\r\n return 4\r\n if (str == 'b'):\r\n return 5\r\n if (str == 'c'):\r\n return 6\r\n\r\ndef main():\r\n str = input(\"\")\r\n row = 0\r\n tmp = 0\r\n while str[tmp] in ['0','1','2','3','4','5','6','7','8','9']:\r\n row = row * 10 + eval(str[tmp])\r\n tmp += 1\r\n time = 0\r\n\r\n if (row % 4 == 0):\r\n time += row - 1 - 2 + 6 * ((row - 2) // 2);\r\n elif (row % 4 == 2):\r\n time += row - 1 + 6 * (row // 2)\r\n elif(row % 4 == 1):\r\n time += row - 1 + 6 * (row // 2)\r\n elif(row % 4 == 3):\r\n time += row - 2 - 1 + 6 * ((row - 2) // 2)\r\n\r\n #print(str[-1])\r\n time += find(str[-1])\r\n\r\n print(time)\r\n\r\nmain()\r\n", "#!/usr/bin/python3\n\ns = input()\nseat = s[-1]\nn = int(s[:-1])\n\nt = 1 + 16 * ((n - 1) // 4)\n\nn = (1 - (n % 4) % 2)\nt += n * 7\n\na = ['f', 'e', 'd', 'a', 'b', 'c']\nt += a.index(seat)\n\nprint(t)\n", "a = input()\r\nn = int(a[:-1])\r\ns = a[-1]\r\nans = ((n-1)//4)*16\r\nn -= ((n-1)//4)*4\r\nd = {'f':1, 'e':2, 'd':3, 'a':4, 'b':5, 'c': 6}\r\nif n in (1, 3):\r\n ans += d[s]\r\nelse: ans += 7 + d[s]\r\nprint(ans)", "# link: https://codeforces.com/problemset/problem/725/B\r\n\r\nimport sys\r\n\r\ndef solve(info):\r\n row = int(info[:len(info)-1])\r\n seat = info[-1]\r\n seat_memo = {'a':4,'b':5,'c':6,'d':3,'e':2,'f':1}\r\n seat_seconds = seat_memo[seat]\r\n time = (((row-1)//4) * 16) + (((row-1)%2) * 7) + seat_seconds\r\n return time\r\n\r\n\r\nif __name__ == \"__main__\":\r\n info = input()\r\n result = solve(info)\r\n print(result)", "a=input()\r\nnum=int(a[:-1])-1\r\nmdfr=num%4\r\ntime=(num//4)*16\r\norder=[0,'f','e','d','a','b','c']\r\ntime+=order.index(a[-1])\r\nif mdfr==1 or mdfr==3:time+=7\r\nprint(time)\r\n", "str = input()\r\n\r\ns = str[len(str)-1]\r\n\r\nn = int(str[0:(len(str)-1)])\r\n\r\nd = n // 4;\r\nif (n % 4 == 0):\r\n\td -= 1\r\nd = d * 16;\r\n\r\nr = (n % 4) % 2;\r\nif (r == 0):\r\n\td = d + 7\r\n\r\nif (s == 'f'):\r\n\td += 1\r\nif (s == 'e'):\r\n\td += 2\r\nif (s == 'd'):\r\n\td += 3\r\nif (s == 'a'):\r\n\td += 4\r\nif (s == 'b'):\r\n\td += 5\r\nif (s == 'c'):\r\n\td += 6\r\n\r\nprint(d)", "s = input()\r\nrow = int(s[:-1])\r\nplace = s[-1]\r\n\r\nrow_divided = row // 4 - 1\r\nrow_ost = row % 4\r\n\r\nrow -= 1\r\n\r\ntime_till_get = 0\r\nif (row % 4 < 2):\r\n place_of_tel = row + 1\r\n time_till_get += place_of_tel\r\n time_till_get += (((row) // 4) * 2 + (row) % 2) * 6\r\n time_till_get += \"fedabc\".index(place)\r\nelse:\r\n place_of_tel = row - 1\r\n time_till_get += place_of_tel\r\n time_till_get += (((row) // 4) * 2 + (row) % 2) * 6\r\n time_till_get += \"fedabc\".index(place)\r\n \r\nprint(time_till_get)", "time_in_row = [4, 5, 6, 3, 2, 1]\n\ns_in = input()\nn = int(s_in[:-1]) - 1\ns = ord(s_in[-1]) - ord('a')\n\nk = n // 4\nans = k * 16\nans += time_in_row[s]\nif n % 2 == 1:\n ans += 7\nprint(ans)\n", "place = input()\nr = int(place[:-1])\np = place[-1]\nans = (r - 1) // 4 * 16 + ((r + 1) % 2) * 7\nif (p == \"e\"):\n\tans += 1\nif (p == \"d\"):\n\tans += 2\nif (p == \"a\"):\n\tans += 3\nif (p == \"b\"):\n\tans += 4\nif (p == \"c\"):\n\tans += 5\nprint(ans + 1)", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nz=input()\nM='fedabc'\nn=int(z.rstrip(M))-1\nprint(1+M.find(z[-1])+7*(1&n)|n>>2<<4)\n", "ns=input()\r\nn=int(ns[:-1])\r\ns=ns[-1]\r\n\r\nmod=n%4\r\nseat='fedabc'\r\nif mod==1 or mod==3:\r\n\tprint((n//4)*16+seat.index(s)+1)\r\nelif mod==2:\r\n\tprint((n//4)*16+seat.index(s)+1+7)\r\nelse:\r\n\tprint(((n//4)-1)*16+seat.index(s)+1+7)", "s = input()\r\nl = s[-1]\r\ns = int(s[:-1])\r\nez = '=fedabc'\r\nif (s%4 == 3 or s%4 == 0):\r\n s -= 2\r\nif s%4 == 1:\r\n print(16*(s//4)+ez.index(l))\r\nelif s%4 == 2:\r\n print(7+16*(s//4)+ez.index(l))\r\n", "def foo(seat):\n if seat <= 2:\n return 4 + seat\n else:\n return 6 - seat\n \ns = str(input())\nnum = int(s[0:-1])\nseat = int(ord(s[-1]) - ord('a'))\n\nnum -= 1\n\nprev = num // 4\nk = num % 2\n\nans = prev * 16 + k * 7 + foo(seat)\nprint(ans)\n", "c=input();n,s,d=int(c[:-1]),c[-1],{'a':4,'b':5,'c':6,'d':3,'e':2,'f':1}\r\nprint((n//4*2+(n-1)%2-2*(n%4==0))*6+d[s]+n-3+2*((n-1)%4<2))", "def fn(n,c):\r\n l=['f','e','d','a','b','c']\r\n if n==1 or n==3:\r\n return 1+l.index(c)\r\n else:\r\n return 8+l.index(c)\r\ns=str(input())\r\nn=int(s[:-1])\r\nc=str(s[-1])\r\n#print(n,c)\r\nt=(n//4)*16\r\nif n%4==0:\r\n t-=16\r\n t+=fn(4,c)\r\nelse:\r\n t+=fn(n%4,c)\r\nprint(t)", "s = input()\r\nn = int(s[:len(s) - 1])\r\nseat = s[-1:]\r\nn -= 1\r\n\r\nres = 16*(n//4)\r\nif n % 2 == 1:\r\n res += 7\r\n\r\nif seat == 'f':\r\n res += 1\r\n\r\nif seat == 'e':\r\n res += 2\r\n\r\nif seat == 'd':\r\n res += 3\r\n\r\nif seat == 'a':\r\n res += 4\r\n\r\nif seat == 'b':\r\n res += 5\r\n\r\nif seat == 'c':\r\n res += 6\r\n\r\nprint(res)", "import sys\r\nimport math\r\n\r\nm = {'f' : 1, 'e' : 2, 'd' : 3, 'a' : 4, 'b' : 5, 'c' : 6}\r\nns = sys.stdin.readline().split()[0]\r\n\r\nletter = ns[-1]\r\nns = ns[:-1]\r\nrow = int(ns)\r\n\r\nans = 16 * ((row - 1) // 4)\r\n\r\nif row % 2 == 0:\r\n\tans += 7\r\n\r\nans += m[letter]\r\n\r\nprint(ans)\r\n\r\n", "places = {'f':1,'e':2,'d':3,'a':4,'b':5,'c':6}\r\nplace = input()\r\nrow = int(place[:-1])\r\ncolumn = places[place[-1]]\r\nif (row-1)%4 == 2 or (row-1)%4 == 3:\r\n if row%2 == 0:\r\n stops = row//2 - 1\r\n else:\r\n stops = (row-1)//2 - 1\r\n time = stops*6 + row-2 + column-1\r\nelse:\r\n stops = row//2\r\n time = stops*6 + row + column-1\r\nprint(time)", "n = input()\ns = n[-1]\nn = int(n[:-1])\n\nif s == 'f':\n\ts = 1\nelif s == 'e':\n\ts = 2\nelif s == 'd':\n\ts = 3\nelif s == 'a':\n\ts = 4\nelif s == 'b':\n\ts = 5\nelif s == 'c':\n\ts = 6\n\nn -= 1\n\nans = 16 * (n // 4)\n\nn %= 4\n\nans += s\nif n & 1:\n\tans += 7\n\nprint(ans)", "pos = input()\nrow = int(pos[:-1]) - 1\nplace = pos[-1]\n\nres = 0\nres += (row // 4) * 16\n\nif row % 2 != 0:\n res += 7\n\nres += 'fedabc'.index(place) + 1\n\nprint(res)\n", "x=input().strip();\r\nn=int(x[:len(x)-1]);\r\nc=x[len(x)-1];\r\n#print(n);\r\n#print(c);\r\nans=0;\r\nans+=((n-1)//4) * 16;\r\nn%=4;\r\n\r\ncolVal=0;\r\nif(c=='a'):\r\n colVal=4;\r\nif(c=='b'):\r\n colVal=5;\r\nif(c=='c'):\r\n colVal=6;\r\nif(c=='d'):\r\n colVal=3;\r\nif(c=='e'):\r\n colVal=2;\r\nif(c=='f'):\r\n colVal=1;\r\n\r\nif n==1 or n==3:\r\n ans+=colVal;\r\nif n==2 or n==0:\r\n ans+=7;\r\n ans+=colVal;\r\nprint(ans);", "from math import *\r\nns = input()\r\nn = int(ns[:-1])\r\ns = 'fedabc'.index(ns[-1]) + 1\r\nn1 = n\r\nif not n % 4:\r\n n1 -= 1\r\nlvl = n1 // 4\r\nans = lvl * 16\r\nif not n % 2:\r\n ans += 7\r\nprint(ans + s)", "def main():\n ns = input()\n n, s = int(ns[:-1]) - 1, \" fedabc\".find(ns[-1])\n print(n // 4 * 16 + (n & 1) * 7 + s)\n\n\nif __name__ == '__main__':\n main()\n", "m = input()\r\n\r\nc = m[-1]\r\nn = int(m[:len(m) - 1])\r\n# разрезаем число от буквы, число в n, букву в c\r\n\r\nif (n % 2 == 0):\r\n\tif ((n // 2) % 2 == 0):\r\n\t\tst = n // 2\r\n\telse:\r\n\t\tst = (n // 2) + 1\r\nelse:\r\n\tif ((n // 2) % 2 == 1):\r\n\t\tst = n // 2\r\n\telse:\r\n\t\tst = (n // 2) + 1\r\n\r\nif (st % 2 == 0):\r\n\ttmp = 1 * (st // 2) + 3 * (st // 2 - 1)\r\nelse:\r\n\ttmp = 1 * (st // 2) + 3 * (st // 2)\r\n\t\r\nsec = (st - 1) * 6 + tmp\r\n\r\nif c == 'f':\r\n\tsec += 1\r\nelif c == 'e':\r\n\tsec += 2\r\nelif c == 'd':\r\n\tsec += 3\r\nelif c == 'a':\r\n\tsec += 4\r\nelif c == 'b':\r\n\tsec += 5\r\nelif c == 'c':\r\n\tsec += 6\r\nprint(sec)\r\n", "s = input()\r\nn, p = int(s[:-1]), s[-1]\r\nT = 16 * ((n - 1) // 4)\r\nk = (n - 1) % 4 + 1\r\nif k in (2, 4): T += 7\r\nD = {'f': 1, 'e': 2, 'd': 3, 'a': 4, 'b': 5, 'c': 6}\r\nT += D[p]\r\nprint(T)\r\n", "s = input()\nn, s = int(s[:-1]) - 1, ord(s[-1]) - ord('a')\n\nblocks = n // 4\nn = n % 4\noffs = (n % 2)\n\nlocOffs = [4, 5, 6, 3, 2, 1][s]\n\nans = blocks * 16 + offs * 7 + locOffs\nprint(ans)", "line = input()\ns = line[-1]\nn = int(line[:-1]) - 1\n\nD = {'a': [4, 11], 'b': [5, 12], 'c': [6,13], 'd': [3, 10], 'e':[2, 9], 'f':[1, 8]}\n\nprint( (n//4) * 16 + D[s][(n % 4) % 2])\n", "s = input()\nl = s[-1]\nn = int(s[:-1])\ntot = 16 * ((n - 1) // 4)\nseats = {\n 'f': 1,\n 'e': 2,\n 'd': 3,\n 'a': 4,\n 'b': 5,\n 'c': 6,\n}\nif n % 2 == 0:\n tot += 7\ntot += seats[l]\nprint (tot)", "s = input()\r\nn = int(s[:-1])\r\ns = s[-1]\r\n\r\nn -= 1\r\nans = n // 4 * 16 + n % 2 * 7\r\n\r\nfor i in \"fedabc\":\r\n ans += 1\r\n if s == i: break\r\n\r\nprint(ans)", "s,c=input(),'@fedabc'\r\nn=int(s[:-1])-1\r\nprint(n%2*7+n//4*16+c.index(s[-1]))", "def ryad(n):\r\n if n % 4 == 1 or n % 4 == 2:\r\n n=n+2\r\n rd=n//2-1 \r\n return rd\r\nc=input()\r\nn=int(c[0:len(c)-1])\r\ns=c[-1]\r\nobsl=\"fedabc\"\r\nx=ryad(n)\r\ntime=x*6+x//2*3+x-x//2+obsl.index(s)+1\r\nprint(time)\r\n", "seat_secs = {'f': 1, 'e': 2, 'd': 3, 'a': 4, 'b': 5, 'c': 6}\n\nvasya = input()\nrow = int(vasya[:-1]) - 1\nseat = vasya[-1]\nseconds = 0\nif row % 4 == 0 or row % 4 == 2: seconds += (row//4) * 16\nelse: seconds += (row//4) * 16 + 7\nseconds += seat_secs[seat]\nprint(seconds)\n\n", "s=input()\nn=int(s[:-1])\ns=s[-1]\nprint((n-1)//4*16+(1-n%2)*7+'1fedabc'.find(s))\n\t\t\t\t\t\t \t\t \t\t \t\t\t\t \t \t \t\t\t \t", "def cal(n,op):\r\n\tpor = n//4\r\n\tnow = n%4\r\n\tcnt = por*4 + (por*12)\r\n\t\r\n\tif(now==2 or now==0):\r\n\t\tcnt += 7\r\n\tx='fedabc'\r\n\t\r\n\tm = 0\r\n\tfor l in x:\r\n\t\tm += 1\r\n\t\tif op==l:\r\n\t\t\tcnt +=m\r\n\t\t\tbreak\r\n\treturn cnt\r\n\t\r\ndef cal2(n,op):\r\n\tans = 16*int(n//4)\r\n\tif n&1 :\r\n\t\tans += 7\r\n\tx = 'fedabc'\r\n\tans += x.find(op) + 1\r\n\treturn ans\r\n \r\ns = input()\r\nn = len(s)\r\nop = s[n-1]\r\nnum = int(s[0:n-1])\r\n#print (cal(num,op))\r\nprint (cal2(num-1,op))", "def main():\n\ts = input()\n\tn = int(s[:len(s) - 1]) - 1\n\n\ttime = (n // 4) * 16\n\n\tk = n % 4 \n\n\tif k in [1,3]:\n\t\ttime += 7\n\n\ta = [4, 5, 6, 3, 2, 1]\n\n\ttime += a[ord(s[-1]) - ord('a')]\n\n\tprint(time)\n\n\nif __name__ == '__main__':\n\tmain()", "import sys\r\ninput = lambda: sys.stdin.buffer.readline().strip().decode()\r\n# 13,24,57,68,911,1012 -> divide and mod 4\r\norder=\"fedabc\"\r\nthing=input()\r\nn=thing[:-1]\r\ns=thing[-1]\r\nn=int(n)\r\nnum1,num2=(n-1)//4,n%4\r\nisles=num1*2\r\nif num2==2 or num2==0:\r\n isles+=1\r\nprint(isles*7+num1*2+order.index(s)+1)", "s = input()\r\nn = int(s[:-1])\r\ns = s[-1]\r\nn -= 1\r\nans = (16) * (n // 4) \r\nn %= 4\r\nif n == 0:\r\n ans += 0\r\nif n == 1:\r\n ans += 7\r\nif n == 2:\r\n ans += 0\r\nif n == 3:\r\n ans += 7\r\n#print(ans)\r\nif s in 'f':\r\n ans += 1\r\nif s in 'e':\r\n ans += 2\r\nif s in 'd':\r\n ans += 3\r\nif s in 'a':\r\n ans += 4\r\nif s in 'b':\r\n ans += 5\r\nif s in 'c':\r\n ans += 6\r\n\r\nprint(ans)\r\n", "s = input()\r\nn, p = int(s[:-1]), s[-1]\r\nans = ((n - 1) // 4) * 16 + 7 * (n % 2 == 0)\r\nans += {'a': 4, 'b': 5, 'c': 6, 'd': 3, 'e': 2, 'f': 1}[p]\r\nprint(ans)\r\n", "# cook your dish here\r\nfrom math import * \r\n#for _ in range(int(input().strip())):\r\n\r\ns=input()\r\nn=int(s[:-1])\r\nch=s[-1]\r\nif n%4==1 or n%4==3:\r\n if n%4==3:\r\n n=n-2\r\n n=6*(n//2)+(n)\r\nelse:\r\n if n%4==2:\r\n n=n-1\r\n if n%4==0:\r\n n=n-3\r\n n=6*(n//2)+(n)+7\r\n#n=(n+1)//2\r\nif ch>='d':\r\n # n=6*(n-1)+n \r\n n+=(ord('f')-ord(ch))\r\nelse:\r\n n+=(ord(ch)-ord('a'))\r\n n+=3\r\nprint(n)", "def fly(n, elem):\r\n lst = ['f', 'e', 'd', 'a', 'b', 'c']\r\n if n == 1 or n == 3:\r\n return 1 + lst.index(elem)\r\n return 8 + lst.index(elem)\r\n\r\n\r\ndef eat(t):\r\n n, elem = int(t[:-1]), t[-1]\r\n z = (n // 4) * 16\r\n if n % 4 == 0:\r\n z -= 16\r\n z += fly(n, elem)\r\n else:\r\n z += fly(n % 4, elem)\r\n return z\r\n\r\n\r\nprint(eat(input()))\r\n", "def get_ans(start):\n t = (start - 1) // 4\n ret = t * 16\n\n if (start - 1) % 4 in (1, 3):\n ret += 7\n\n return ret\n\ns = input()\n\nseat = int(s[:-1])\np = s[-1]\n\nans = get_ans(seat)\n\nif p == 'f':\n ans += 0\nelif p == 'e':\n ans += 1\nelif p == 'd':\n ans += 2\nelif p == 'a':\n ans += 3\nelif p == 'b':\n ans += 4\nelif p == 'c':\n ans += 5\nans += 1\n\nprint(ans)\n", "def offset(n, m):\r\n if n % 2 == 1:\r\n if (m == 'f'):\r\n return 1\r\n elif (m == 'e'):\r\n return 2\r\n elif (m == 'd'):\r\n return 3\r\n elif (m == 'a'):\r\n return 4\r\n elif (m == 'b'):\r\n return 5\r\n elif (m == 'c'):\r\n return 6\r\n else:\r\n if (m == 'f'):\r\n return 8\r\n elif (m == 'e'):\r\n return 9\r\n elif (m == 'd'):\r\n return 10\r\n elif (m == 'a'):\r\n return 11\r\n elif (m == 'b'):\r\n return 12\r\n elif (m == 'c'):\r\n return 13\r\n\r\ndef do(n, m):\r\n block = (n-1) // 4 + 1\r\n timesofar = 16 * (block - 1)\r\n time = timesofar + offset(n,m)\r\n return time\r\n\r\ninp = input()\r\nm = inp[-1]\r\nn = int(inp[:-1])\r\nprint(do(n,m))\r\n", "def find_food(n,m):\r\n ans = 16 * int(n // 4)\r\n if n & 1:\r\n ans += 7\r\n \r\n chars = \"fedabc\"\r\n ans += chars.find(m) + 1\r\n return ans\r\n \r\nstring_take = input()\r\nstring_length = len(string_take)\r\noption = string_take[string_length-1]\r\nnum = int(string_take[0:string_length-1])\r\nprint(find_food(num-1, option))", "d = {\"f\":1,\"e\":2,\"d\":3,\"a\":4,\"b\":5,\"c\":6}\r\nt = input()\r\nt1 = t[:len(t)-1]\r\nif int(t1)%4 == 3 or int(t1)%4 == 0:\r\n\tt1 = str(int(t1) - 2)\r\nnum1 = (int(t1)-1)//4\r\nnum2 = (int(t1)-1)%4\r\nif num2 > 2:\r\n\tnum2 = num2 - 2\r\nprint(16*num1+6*num2+d[t[-1]]+num2)", "ns = input()\nn = int(ns[:len(ns) - 1])\ns = ns[-1]\nt = 0\nn -= 1\nt = (n // 4) * 16 + n % 2 * 7\nfor i in \"fedabc\":\n t += 1\n if i == s:\n break\nprint(t)", "s = input()\r\nn, ch = int(s[:-1]), s[-1]\r\n\r\nD = {'a':4, 'b':5, 'c':6, 'd':3, 'e':2, 'f':1}\r\n\r\nif n % 4 == 0 or (n+1) % 4 == 0:\r\n x = n//2\r\n x = x if x != 0 else 1\r\n res = n-3 + (x-1)*6 + D[ch]\r\nelse:\r\n x = n//2\r\n res = n-1 + (x)*6 + D[ch]\r\n\r\nprint(res)", "str = input()\r\nn = int(str[0:len(str)-1])\r\nch = str[len(str)-1]\r\nl = (n-1)%4\r\nans = (n-1)//4\r\nans = 2*6*ans\r\nif l<2:\r\n ans += (n-1)\r\nelse:\r\n ans += (n-3)\r\n\r\nif l%2:\r\n ans+=6\r\n\r\nif ch=='f':\r\n ans+=1\r\nelif ch=='e':\r\n ans+=2\r\nelif ch=='d':\r\n ans+=3\r\nelif ch=='a':\r\n ans+=4\r\nelif ch=='b':\r\n ans+=5\r\nelse:\r\n ans+=6\r\n\r\nprint(ans)\r\n", "\r\ns = input()\r\nn = int(s[:len(s) - 1]) - 1\r\n\r\ntime = (n // 4) * 16\r\n\r\nk = n % 4 \r\n\r\nif k in [1,3]:\r\n\ttime += 7\r\n\r\na = [4, 5, 6, 3, 2, 1]\r\n\r\ntime += a[ord(s[-1]) - ord('a')]\r\n\r\nprint(time)\r\n\t\r\n", "s = input().strip();\r\nnum = int(s[:-1]);\r\nletter = s[-1:];\r\n\r\nletterTime = { \"f\" : 1, \"e\" : 2, \"d\" : 3, \"a\" : 4, \"b\" : 5, \"c\" : 6 };\r\n\r\ntime = 0;\r\nif num % 4 == 0:\r\n time = ((num - 1) // 4) * 16;\r\nelse:\r\n time = (num // 4) * 16;\r\n\r\nif num % 2 == 0:\r\n time += 7;\r\n\r\ntime += letterTime[letter];\r\n\r\nprint(time);\r\n", "# You lost the game.\ns = str(input())\nl = s[len(s)-1]\nr = int(s[:len(s)-1]) - 1\n\nD = {}\nD[\"f\"] = 1\nD[\"e\"] = 2\nD[\"d\"] = 3\nD[\"a\"] = 4\nD[\"b\"] = 5\nD[\"c\"] = 6\n\nq = r // 4\nb = r % 4\n\nif b % 2 == 0:\n print(D[l]+16*q)\nelse:\n print(D[l]+16*q+7)\n", "inp = input()\r\npan = len(inp)\r\nc = inp[pan-1]\r\nr = int(inp[:-1])\r\ntambah = 0\r\nif (c == 'a'):\r\n\ttambah = 4\r\nelif (c == 'b'):\r\n\ttambah = 5\r\nelif (c == 'c'):\r\n\ttambah = 6\r\nelif (c == 'd'):\r\n\ttambah = 3\r\nelif (c == 'e'):\r\n\ttambah = 2\r\nelif (c == 'f'):\r\n\ttambah = 1\r\n\r\nr = r-1\r\ndiv = r // 4\r\nmod = r % 4\r\nans = div * 16\r\nif (mod == 1):\r\n\tans += 7\r\nelif (mod == 3):\r\n\tans += 7\r\n\r\nans += tambah\r\nprint(ans)", "s=input()\r\nn=int(s[:-1])\r\ns=s[-1]\r\nprint((n-1)//4*16+(1-n%2)*7+'1fedabc'.find(s))", "a = input()\r\nnum = int(a[:-1])-1\r\nmdfr = num%4\r\ntime = (num//4)*16\r\norder = [0,'f','e','d','a','b','c']\r\ntime+=order.index(a[-1])\r\nif mdfr==1 or mdfr==3:time+=7\r\nprint(time)", "string = input()\r\nn = len(string)\r\nbuk = string[n-1]\r\nr = int(string [:-1])\r\nspec = 0\r\n\r\nrsec = 0\r\nbukl = 0\r\nif (r % 4 == 0):\r\n rsec = r // 2 - 1\r\n spec = r - 3\r\nelif (r % 2 == 0):\r\n rsec = (r + 2) // 2 - 1\r\n spec = r - 1\r\nelif ((r + 1) % 4 == 0):\r\n rsec = (r + 1) // 2 - 2\r\n spec = r - 3\r\nelse:\r\n rsec = (r + 3) // 2 - 2\r\n spec = r - 1\r\nrsec *= 6\r\nrsec += spec\r\n\r\nif (buk == \"f\"):\r\n bukl = 1\r\nelif (buk == \"e\"):\r\n bukl = 2\r\nelif (buk == \"d\"):\r\n bukl = 3\r\nelif (buk == \"a\"):\r\n bukl = 4\r\nelif (buk == \"b\"):\r\n bukl = 5\r\nelse:\r\n bukl = 6\r\nprint (rsec + bukl)\r\n", "tmp = input()\r\nrow = int(tmp[:-1])-1\r\nplace = tmp[-1]\r\n\r\n\r\nans = (row//4)*(6+1+6+3);\r\npos = row%4\r\nif pos == 1 or pos == 3 :\r\n ans += 7\r\n\r\nans += ([\"f\", \"e\", \"d\", \"a\", \"b\", \"c\"].index(place))+1\r\n\r\nprint (ans)\r\n", "l = input()\nn = int(l[:-1])\ns = l[-1]\n\nd = {'a':4, 'b':5, 'c':6, 'd':3, 'e':2, 'f':1}\n\nk = (n - 1) // 4\nres = 16 * k\nif n % 4 in [0, 2]:\n res += 7\nres += d[s]\nprint(res)\n", "import math\r\nans = int(0)\r\ns = input()\r\ns1 = s[:-1]\r\ns = s[-1:]\r\nn = int(s1)\r\n#print( math.floor(n/4) )\r\nans += 16*( (n-1)//4 ) + 7*( (n-1)%2 ) \r\n# // -> integer quotient\r\n# / -> decimal quotient\r\n# % -> remainder\r\n#print(ans)\r\nif s==\"f\":\r\n ans+=1\r\nelif s==\"e\":\r\n ans+=2\r\nelif s==\"d\":\r\n ans+=3\r\nelif s==\"a\":\r\n ans+=4\r\nelif s==\"b\":\r\n ans+=5\r\nelif s==\"c\":\r\n ans+=6\r\nprint( int(ans) )", "seatposition=input()\nrownumber = int(seatposition[0:-1])\ncolnumber = seatposition[-1]\ncolorder = {'f': 1, 'e':2, 'd':3, 'a':4, 'b':5, 'c': 6}\nblocknumber = (rownumber-1)//4\ndetailnumber = rownumber%4\nwaitnumber = 0\nif detailnumber %2 == 0:\n waitnumber = 7\nprint(16*blocknumber + waitnumber + colorder[colnumber])\n", "c = input()\r\nn = int(c[0:len(c) - 1])\r\nc = c[-1]\r\nans = (n - 1) // 4 * 16;\r\nif n % 4 != 0:\r\n n = n % 4\r\nelse:\r\n n = 4\r\nif n == 2 or n == 4:\r\n ans += 7\r\nif c == 'f':\r\n ans += 1\r\nif c == 'e':\r\n ans += 2\r\nif c == 'd':\r\n ans += 3\r\nif c == 'a':\r\n ans += 4\r\nif c == 'b':\r\n ans += 5\r\nif c == 'c':\r\n ans += 6\r\nprint(ans)\r\n ", "#import sys\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n\r\ns = input()\r\nx = int(s[:len(s) - 1])\r\nr = s[len(s) - 1]\r\nx -= 1\r\nkv = x // 4\r\nans = kv * 16\r\nx -= kv * 4\r\nif (x % 2 == 1):\r\n ans += 7\r\nif (r == 'f'):\r\n ans += 1\r\nif (r == 'e'):\r\n ans += 2\r\nif (r == 'd'):\r\n ans += 3\r\nif (r == 'a'):\r\n ans += 4\r\nif (r == 'b'):\r\n ans += 5\r\nif (r == 'c'):\r\n ans += 6\r\nprint(ans);\r\n", "def solve(s):\r\n #a=int(s[-1])-1\r\n a=ord(s[-1])-ord('a')\r\n n=int(s[:-1])\r\n od=[4,5,6,3,2,1]\r\n ad=[0,7,0,7]\r\n c=16\r\n\r\n ktmp=(n-1)//4\r\n ttmp=(n-1)%4\r\n ans=ktmp*16+ad[ttmp]+od[a]\r\n return ans\r\n\r\ns=input()\r\nprint(solve(s))\r\n", "s = input()\r\nr = int(s[:-1]) - 1\r\nc = s[-1]\r\n\r\nans = (r // 4) * (12 + 4)\r\nr -= r // 4 * 4\r\nif r % 2 == 1:\r\n ans += 6 + 1\r\nans += \"fedabc\".index(c) + 1\r\nprint(ans)\r\n", "s = input()\r\n\r\nliteral = s[-1]\r\nn = int(s[:-1:]) - 1\r\n\r\nd = {\r\n 'a': 4,\r\n 'b': 5,\r\n 'c': 6,\r\n 'd': 3,\r\n 'e': 2,\r\n 'f': 1\r\n}\r\n\r\nans = 0\r\n\r\nans += (n // 4) * 16\r\n\r\nans += d[literal]\r\n\r\nans += (n % 2) * 7\r\n\r\nprint(ans)\r\n", "seat = input()\ntime_to = {'a': 4, 'f': 1, 'b': 5, 'e': 2, 'c': 6, 'd': 3}\ncol = seat[-1]\nrow = int(seat[:-1])\nrow -= 1\n\nblocks_to_serve = row // 4\ntime = (6 * 2 + 4) * blocks_to_serve\n\nif row % 2 == 1:\n time += 6 + 1\n\ntime += time_to[col]\n\nprint(time)\n", "import sys\r\ninp = lambda: sys.stdin.readline()[:-1]\r\nmass = lambda: list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n = input()\r\n c = int(n[:-1]) - 1\r\n n = n[-1]\r\n res = c // 4 * 16\r\n c %= 4\r\n if c % 2:\r\n res += 7\r\n if n == \"f\":\r\n res += 1\r\n if n == \"e\":\r\n res += 2\r\n if n == \"d\":\r\n res += 3\r\n if n == \"a\":\r\n res += 4\r\n if n == \"b\":\r\n res += 5\r\n if n == \"c\":\r\n res += 6\r\n print(res)\r\n\r\n\r\n#for _ in range(int(input())):\r\nsolve()", "dic={'a':4,'b':5,'c':6,'d':3,'e':2,'f':1}\r\nq=input()\r\nn=int(q[:len(q)-1])\r\ns=q[-1]\r\nq=(n-1)//4\r\nans=q*16\r\nn%=4\r\nif n%2==0:\r\n ans+=7\r\nprint(ans+dic[s])\r\n\r\n\r\n", "s = input()\r\nn = int(s[:-1])\r\nlast = s[-1]\r\nif n % 4 in (1, 2):\r\n t = (n + 2) // 2\r\n b = 0\r\nelse:\r\n t = n // 2\r\n b = -2\r\nbereza = {'f': 0, 'e': 1, 'd': 2, 'a': 3, 'b': 4, 'c': 5}\r\nprint((t - 1) * 6 + n + b + bereza[last])", "s = input()\nans = 0\nd = {'f': 1, 'e': 2, 'd': 3, 'a': 4, 'b': 5, 'c': 6}\nif int(s[:-1]) % 4 == 0:\n ans = (int(s[:-1]) // 4 - 1) * 16\nelif int(s[:-1]) % 4 != 0:\n ans = (int(s[:-1]) // 4) * 16\nif int(s[:-1]) % 2 == 0:\n ans += 7 + d[s[-1]]\nelif int(s[:-1]) % 2 != 0:\n ans += d[s[-1]]\nprint(ans)\n\n", "s = input()\ndct = {'a': 4, 'b': 5, 'c': 6, 'd': 3, 'e': 2, 'f': 1}\nn, s = int(s[:len(s) - 1:]), s[-1]\nbox = n // 4\nn %= 4\nret = 0\nif n == 0:\n ret += 16 * (box - 1)\n ret += dct[s] + 7\nelse:\n ret = 16 * box\n if n == 1 or n == 3:\n ret += dct[s]\n else:\n ret += dct[s] + 7\nprint(ret)\n", "D = dict(zip('fedabc', range(1,7)))\r\n\r\nns = input()\r\nx, y = divmod(int(ns[:-1])-1, 4)\r\nprint(16*x + 7*(y%2) + D[ns[-1]])", "s=input()\r\nn=int(s[0:len(s)-1])\r\nc=s[len(s)-1]\r\no=16*(n//4)\r\nd={'f':1,'e':2,'d':3,'a':4,'b':5,'c':6}\r\nif n%4==1 or n%4==3:\r\n o+=d[c]-1\r\nelif n%4==2:\r\n o+=7+d[c]-1\r\nelse:\r\n o-=16\r\n o+=7+d[c]-1\r\nprint(o + 1)\r\n", "s=input()\r\nl1=['a','b','c']\r\nl2=['f','e','d']\r\nn=int(s[:-1])\r\nr=s[-1]\r\nt=n//4\r\nif n%4==0 :\r\n t-=1\r\nn-=t*4\r\nans=t*4+t*6*2\r\nif n%2==0 :\r\n ans+=1+6\r\n\r\nif r in l2 :\r\n ans+=l2.index(r)+1\r\nelse :\r\n ans+=l1.index(r)+4\r\nprint(ans)\r\n \r\n \r\n \r\n", "# your code goes here\r\nstrn=input()\r\nn=int(strn[:-1])\r\nseat=strn[len(strn)-1]\r\ndict1={'f':1,'e':2,'d':3,'c':6,'b':5,'a':4}\r\nsum=0\r\ntemp=(n-1)//4\r\nsum+=(temp*16)\r\nif n%2==0:\r\n\tsum+=7\r\nsum+=dict1[seat]\r\nprint(sum)\r\n\r\n", "ns = input()\r\n\r\ntrantab = str.maketrans('abcdef', '456321')\r\n\r\nn = int(ns[:-1])\r\ns = ns[-1]\r\nm = int(s.translate(trantab))\r\n\r\nans = 0\r\n\r\nif n % 4 == 1 or n % 4 == 3:\r\n ans += (n // 4) * 16 + m\r\nelif n % 2 == 2:\r\n ans += (n // 4) * 16 + 7 + m\r\nelse:\r\n ans += ((n - 1) // 4) * 16 + 7 + m\r\n\r\n\r\nprint(ans)\r\n ", "\r\ndef f(a):\r\n if a==\"a\":\r\n return 4\r\n if a==\"b\":\r\n return 5\r\n if a==\"c\":\r\n return 6\r\n if a==\"d\":\r\n return 3\r\n if a==\"e\":\r\n return 2\r\n if a==\"f\":\r\n return 1\r\n \r\na=input()\r\nb=int(a[:-1])\r\nc=a[-1]\r\ns=((b-1)//4)*16\r\nb=b%2\r\nif b==1:\r\n print(s+f(c))\r\nelse:\r\n print(7+s+f(c))", "def switch(c):\r\n if c=='f': return 1\r\n if c=='e': return 2\r\n if c=='d': return 3\r\n if c=='a': return 4\r\n if c=='b': return 5\r\n if c=='c': return 6\r\n\r\ns = input()\r\nrow = int(s[:-1])\r\ncol = s[-1]\r\n\r\nans = ((row-1)//4)*16\r\nans = ans + (7 if (row%2==0) else 0) + switch(col)\r\nprint(ans)", "a = list(input())\r\nletter = a.pop()\r\nnum = int(''.join(a))\r\nh = [4, 5, 6, 3, 2, 1];\r\nb = 0 if num & 1 else 7\r\nresult = ((num - 1) >> 2) * 16 + b + h[ord(letter) - ord('a')]\r\nprint(result)", "s = input()\r\nr = int(s[:-1]) - 1\r\nst = s[-1]\r\n\r\nif st == 'f':\r\n st = 1\r\nif st == 'e':\r\n st = 2\r\nif st == 'd':\r\n st = 3 \r\nif st == 'a':\r\n st = 4\r\nif st == 'b':\r\n st = 5\r\nif st == 'c':\r\n st = 6\r\nans = r // 4 * 16\r\nr = r % 4\r\nif r == 0 or r == 2:\r\n ans += st\r\nelse:\r\n ans += st + 7\r\nprint(ans)", "n = input()\r\ns = n[-1]\r\nn = int(n[:-1])\r\nif n % 2 == 1:\r\n if (n - 1) // 2 % 2 == 1:\r\n numb = (n - 1) // 2\r\n else:\r\n numb = (n + 1) // 2\r\nelse:\r\n if n // 2 % 2 == 0:\r\n numb = n // 2\r\n else:\r\n numb = (n + 2) // 2\r\nif (numb - 1) % 2 == 0:\r\n ans = (numb - 1) * 6 + (numb - 1) // 2 * 4\r\nelse:\r\n ans = (numb - 1) * 6 + (numb - 2) // 2 * 4 + 1\r\nif s == 'f': ans += 1\r\nelif s == 'e': ans += 2\r\nelif s == 'd': ans += 3\r\nelif s == 'a': ans += 4\r\nelif s == 'b': ans += 5\r\nelif s == 'c': ans += 6\r\nprint(ans)", "import sys\r\nimport math\r\n\r\nar=list(input())\r\nn=(int(''.join(ar[:len(ar)-1])))\r\nl=(''.join(ar[len(ar)-1:]))\r\n\r\nmp={'f':0,'e':1,'d':2,'a':3,'b':4,'c':5}\r\ni=n-1\r\nj=mp[l]\r\nprint(i%2*6+i//4*12+j+i-i//2%2*2+1)\r\n \r\n", "from sys import setrecursionlimit\r\nimport re\r\nsetrecursionlimit(1000000000)\r\nfrom math import sqrt\r\n\r\n\r\ndef main():\r\n str=input()\r\n place=0;\r\n if(str[-1]=='a'):\r\n place=4;\r\n if(str[-1]=='b'):\r\n place=5;\r\n if(str[-1]=='c'):\r\n place=6;\r\n if(str[-1]=='d'):\r\n place=3;\r\n if(str[-1]=='e'):\r\n place=2;\r\n if(str[-1]=='f'):\r\n place=1;\r\n way = int(str[:-1])\r\n print(((way-1)//4)*16+(1-way%2)*7+place)\r\n\r\n\r\nmain()\r\n\r\n# ^R\\d*C\\d*$", "m='0fedabc'\r\nt=input()\r\nn=int(t[:-1])\r\ns=t[-1]\r\nn=n-1\r\nk1=m.find(s)\r\nk2=(7 if n%4==1 or n%4==3 else 0)\r\nk3=16*(n//4)\r\nprint(k1+k2+k3)", "s = input()\r\nn = int(s[:-1])\r\np = s[-1]\r\n\r\nans = 0\r\nb = [' ', 'f', 'e', 'd', 'a', 'b', 'c']\r\ni = b.index(p)\r\n\r\nif n % 4 == 1 or n % 4 == 3:\r\n ans = (n // 4) * 16 + i\r\nelif n % 4 == 2:\r\n ans = (n // 4) * 16 + i + 7\r\nelse:\r\n ans = ((n - 1) // 4) * 16 + i + 7\r\n \r\n\r\nprint(ans)", "x = input()\r\nn = int(x[:-1]) - 1\r\ns = [4, 5, 6, 3, 2, 1][ord(x[-1]) - ord('a')]\r\nprint(n // 4 * 16 + n % 2 * 7 + s)" ]

[ "s=input()\r\nn=len(s)\r\nprint((n+1)*26-n)", "\na = input()\n\nprint((len(a)+1) * 25 + 1)\n\n\n", "s = input()\r\nn = len(s)\r\nans = n * 25 + 26\r\nprint(ans)", "def main():\n st = input()\n print(solve(st))\n\ndef solve(st):\n return len(st)*25 + 26\n\nmain()\n \t \t \t \t \t\t \t\t\t \t\t \t \t", "#in the name of god\r\n#Mr_Rubick\r\nprint(25*len(input())+26)", "def solve(s):\r\n n = len(s)\r\n total = (n + 1) * 26\r\n return total - duplicadas(s)\r\n\r\ndef duplicadas(s):\r\n s += '?'\r\n ans = 0\r\n count = 0\r\n prev = s[0]\r\n for c in s:\r\n if c == prev:\r\n count += 1\r\n else:\r\n ans += count\r\n count = 1\r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n print(solve(s))", "l=list(input())\r\ncount=0\r\nans=26+25\r\nfor i in range(len(l)-1):\r\n if l[i]==l[i+1]:\r\n # coun\r\n ans+=25\r\n if l[i]!=l[i+1]:\r\n count+=1\r\n ans+=25\r\nprint(ans)", "s = input()\r\nl = len(s)\r\nprint(26+25*l)\r\n", "s = input()\r\nn = len(s)\r\no = (26*(n+1))-n\r\nprint(o)\r\n", "a = input()\r\nprint(26+25*(len(a)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n s = input().strip()\r\n ans = set()\r\n\r\n for i in range(len(s)+1):\r\n for x in range(26):\r\n ans.add(s[:i] + chr(ord('a') + x) + s[i:])\r\n\r\n print(len(ans))\r\n\r\nsolve()\r\n", "s = input()\r\nans = 26 * (len(s) + 1) - len(s)\r\nprint(ans)", "print(25*len(input())+26)", "s = input()\r\n\r\nprint(25*(len(s)+1)+1)", "a = input()\r\nprint((26*(len(a)+1))-len(a))", "n = input()\r\nprint ((len(n) + 1) * 25 + 1);", "s=input()\r\nprint(26*(len(list(s))+1)-len(list(s)))", "x=input()\r\nprint((len(x)+1)*26-len(x))", "s=input()\r\na=list(s)\r\nb=list()\r\nc=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\r\nfor i in range(len(s)+1):\r\n for j in c:\r\n a.insert(i,j)\r\n if \"\".join(a) not in b:\r\n b.append(\"\".join(a))\r\n a=list(s)\r\nprint(len(b))", "#\"from dust i have come, dust i will be\"\r\n\r\ns=input()\r\nprint(26+25*len(s))\r\n\r\n\r\n\r\n", "s = input()\r\nn = len(s)\r\nprint(26 + 25 * n)", "s = input()\nD = set()\nch = 'abcdefghijklmnopqrstuvwxyz'\nfor i in range(len(s)+1):\n\tfor j in ch:\n\t\tD.add(s[:i]+j+s[i:])\n\nprint(len(D))\n\n\n", "#https://codeforces.com/problemset/problem/554/A\n\n\n\ns = input()\nresult = 26\nfor l in s:\n result += 25\nprint(result)\n\n# or print(len(input()) * 25 + 26)\n", "s = input()\r\nprint(len(s) * 26 - len(s) + 26)", "a=list(input())\r\nn=len(a)\r\nprint((n+1)*26-n)", "# I know it's messy\n\nd = {}\ns = input()\nfor i in range(0, len(s)+1):\n for a in \"abcdefghijklmnopqrstuvwxyz\":\n d[\"%s%s%s\" % (s[:i], a, s[i:])] = True\n\nprint(len(d))\n", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint\r\n\r\ns = input()\r\nn = len(s)\r\nss = set()\r\n\r\nfor i in range(n + 1):\r\n for j in range(26):\r\n temp = s[0:i] + str(chr(ord('a') + j)) + s[i:]\r\n ss.add(temp)\r\n\r\nprint(len(ss))\r\n", "s=str(input())\r\nprint(len(s)*26-len(s)+26)", "g=input()\r\ndef func(g):\r\n if (len(g)==1):\r\n return 51\r\n sum=(len(g)+1)*26-len(g)\r\n return sum\r\nprint(func(g))\r\n", "print(26 + 25*len(input()))\r\n", "text=input()\nlength=len(text)\npossible=0\nletters=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\nfor char in letters:\n if text.count(char)==0:\n possible+=length+1\n else:\n possible+=(length+1)-text.count(char)\nprint(possible)", "x = input()\nprint (25 * len (x) + 26)\n", "print((len(input()) + 1) * 25 + 1)", "str = input()\ncnt = 1;\nans = 25;\nlength = len(str)\nfor i in range(1,length):\n if str[i] != str[i-1]:\n \tcnt += 1\nfor i in range(1,length):\n ans += 24\n if str[i] == str[i-1]:\n \tans += 1\nans += 25;\nprint(ans + cnt)\n\t\t\t\t\t\t\t\t \t \t \t\t \t \t\t\t\t \t\t\t\t\t", "x = input()\nprint(26 + 25 * len(x))\n", "# print (\"Input the string\")\nst = input()\nn = len(st)\nprint (26 + 25*n)\n", "\r\ns=input()\r\nx=len(s)\r\nn=(26*(x+1))-x\r\nprint(n)", "s = input()\r\nn = len(s)\r\nss = set()\r\na = 'abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(n + 1):\r\n for j in range(26):\r\n ss.add(s[:i] + a[j] + s[i:])\r\nprint(len(ss))", "q=input()\r\nprint((26*(len(q)+1))-len(q))", "s = input()\r\npossible = set()\r\nfor i in range(len(s)+1):\r\n for j in range(26):\r\n possible.add(s[0:i] + chr(j + ord('a')) + s[i:])\r\nprint(len(possible))", "s = input().strip()\r\nn = len(s)\r\n\r\n# Create a set to store the distinct photobooks\r\nphotobooks = set()\r\n\r\n# Iterate over all possible positions to insert the new photo\r\nfor i in range(n+1):\r\n # Iterate over all possible new photos\r\n for c in 'abcdefghijklmnopqrstuvwxyz':\r\n # Create the new photobook by inserting the new photo\r\n new_photobook = s[:i] + c + s[i:]\r\n # Add the new photobook to the set\r\n photobooks.add(new_photobook)\r\n\r\n# Print the number of distinct photobooks\r\nprint(len(photobooks))\r\n", "\nstring = input()\nans = set();\n\nfor i in range(len(string) + 1):\n for j in range(0, 26):\n string_new = string[:i] + chr(ord(\"a\") + j) + string[i:]\n ans.add(string_new)\nprint(len(ans))\n\n\n\n", "s = input()\r\nprint(len({s[:i] + c + s[i:] for i in range(len(s) + 1) for c in 'qwertyuioplkjhgfdsazxcvbnm'}))", "s = input()\r\nprint((26 * (len(s) + 1))-len(s))\r\n", "firstLine = str(input());\r\n\r\ntotal = 26;\r\n\r\nfor l in firstLine:\r\n total += 25;\r\n \r\nprint(total);", "s = input()\nx = len(s)\n\nprint((26 * (x + 1)) - x)\n\n", "S=input()\r\nprint(((len(S)+1)*26)-len(S))\r\n\r\n \r\n \r\n", "s = input()\r\nprint(25 * len(s) + 26)", "\r\n\r\ndef main_function():\r\n s = input()\r\n length = len(s)\r\n return 26 * (length + 1) - length\r\n\r\n\r\nprint(main_function())", "a = input()\nprint(26 * (len(a) + 1) - len(a))", "n = input()\r\nprint((len(n)+1)*26-len(n))", "n = len(input())\r\n\r\nprint(26*(n+1) - n)\r\n", "s = input()\r\ncnt = 1\r\nans = 25*(len(s)+1)+1\r\nprint(ans)\r\n", "s = input()\r\nall = set()\r\nfor i in range(len(s)+1):\r\n\tfor z in range(26):\r\n\t\tc = chr(ord('a')+z)\r\n\t\tall.add(s[:i]+c+s[i:])\r\nprint(len(all))\r\n", "LettersString = input(\"\")\r\nAlfabet = \"abcdefghijklmnopqrstuvwxyz\"\r\nCombinaties = [] \r\n\r\n\r\nfor x in range(0,len(LettersString)+1):\r\n for y in range(0, 26):\r\n Combinaties.append(LettersString[0:x]+Alfabet[y]+LettersString[x:len(LettersString)])\r\n\r\nprint (len(set(Combinaties)))\r\n", "s = input()\r\n\r\nprint(26 + len(s)*25)", "s=str(input())\r\nprint(26*(len(s)+1) - len(s))", "import sys\r\ns=sys.stdin.readline().strip()\r\nprint(26+len(s)*25)", "ans = 25\r\ns = input()\r\nfor i in range(len(s)):\r\n if (i == len(s)-1):\r\n ans += 26\r\n else:\r\n ans += 25\r\nprint(ans)", "k=input()\r\nprint(((len(k)+1)*26)-len(k))", "a=input();print(26*(len(a)+1)-len(a))", "##row, col, order = input().split(' ') \r\n##row = int(row)\r\n##col = int(col)\r\n##\r\n##init_list = []\r\n##\r\n##for i in range(row):\r\n## init_list.append(input().split(' '))\r\n##\r\n##if order=='0':\r\n## for i in range(row):\r\n## print()\r\n## for j in range(col,0,-1):\r\n## print(init_list[i][j-1], end = ' ')\r\n##else:\r\n## for i in range(row,0,-1):\r\n## print()\r\n## for j in range(col):\r\n## print(init_list[i-1][j], end = ' ')\r\n\r\n\r\ninput_letter = input()\r\nlength = len(input_letter)\r\n\r\nresult = 25*length + 26\r\n\r\nprint(result)\r\n", "ss = input()\nprint(26*(len(ss)+1)-len(ss))", "s = input()\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\npossible = []\r\nans = 0\r\n\r\nfor letter in alpha:\r\n for i in range(len(s)+1):\r\n seq = [s[:i], letter, s[i:]]\r\n #print(seq)\r\n word = \"\".join(seq)\r\n if word not in possible:\r\n ans += 1\r\n possible.append(word)\r\n#print(possible)\r\nprint(ans)", "a = input()\r\nprint((len(a) + 1)*26 - (len(a)))", "data = input()\nresult = 26\nfor l in data:\n result += 25\nprint(result)\n\n \t \t \t\t\t \t\t\t\t\t\t \t\t\t\t\t\t", "s = input()\nn, d = len(s), dict()\nfor i in range(n+1):\n for j in range(26):\n d[s[0:i]+chr(j+97)+s[i:n]] = 1\nprint(len(d))\n", "a=input()\r\nprint(25*(len(a)+1)+1)", "n = input()\r\nspaces= len(n)+1\r\nprint(spaces*26-len(n))", "s = list(input())\r\nprint((len(s)+1)*25+1)", "a = input();\r\nsumm = 26;\r\nsumm += 25 * (len(a))\r\nprint(summ)\r\n", "s = str(input())\r\nn = len(s)\r\nprint(( n + 1) * 26 - n )", "n=input()\r\nprint(26*(len(n) +1)- len(n))", "import string\n\ns = input()\nwords = set()\nfor i in range(len(s)+1):\n for letter in string.ascii_lowercase:\n words.add(s[:i] + letter + s[i:])\nprint(len(words))\n", "# LUOGU_RID: 112642943\ns = str(input())\nn = len(s)\nprint(26 * (n + 1) - n)", "album = input()\r\ntamAlbum = len(album)\r\n\r\nresp = (26 * (tamAlbum + 1)) - tamAlbum\r\nprint(resp)", "s = input()\r\nprint(26*len(s)+26-len(s))\r\n", "s = input()\nprint(((len(s) + 1) * 25) + 1)", "S = len(input())\r\nprint(S*26+26-S)", "s = input()\r\nnum = 51\r\nprint((len(s)-1)*25 + num)", "s=len(input())\r\nprint(26*(s+1) - s)", "a = len(input())+1\r\nprint(a*25+1)", "s=input()\r\nt=len(s)\r\nprint((26*(t+1))-t)", "s = input()\r\nprint(((len(s) + 1) * 26) - len(s))", "n=input()\r\nl=len(n)\r\nprint(26*(l+1)-l)", "s = input()\r\nl = len(s) + 1\r\nans = (l * 25) + 1\r\nprint (ans)\r\n", "import string\ns = input().strip()\nens = set()\nls = len(s)\nfor l in string.ascii_lowercase:\n ens.add(l+s)\n ens.add(s+l)\nfor i in range(1,ls):\n a = s[:i]\n b = s[i:]\n for l in string.ascii_lowercase:\n ens.add(a+l+b)\nprint(len(ens))\n", "s = input().strip()\r\nprint((len(s)+1)*26-len(s))\r\n", "s=input().strip('\\n')\nn=len(s)\nprint(26*(n+1)-n)\n", "s = str(input())\r\nt = len(s)\r\nn = (((len(s) +1) * 26) - len(s)) \r\nprint(n)\r\n", "s = input()\r\naz = [chr(i) for i in range(ord('a'), ord('z') + 1)]\r\nsets = set()\r\nfor i in range(len(s)):\r\n for c in az:\r\n sets.add(s[:i] + c + s[i:])\r\nfor c in az:\r\n sets.add(s + c)\r\nprint(len(sets))", "print(len(input()) * 25 + 26)", "# LUOGU_RID: 112614184\ns = str(input())\nn = len(s)\nprint(26 * (n + 1) - n)", "#!/usr/bin/env python3\n\nif __name__ == '__main__':\n s = input()\n print(26 + 26*len(s) - len(s))\n\n\n", "import string\n\ns = input().strip()\nchars = list(s)\nwords = set()\nfor i in range(len(chars)+1):\n for char in string.ascii_lowercase:\n word = ''.join(chars[:i] + [char] + chars[i:])\n words.add(word)\nprint(len(words))\n", "a=input()\r\nprint((len(a)+1)*26-len(a))", "s = input()\r\nl = len(s)\r\n\r\nprint(26*(l+1) - l)", "s = input()\r\n\r\nprint(26 + (len(s)* 25))", "s=input().strip()\nans=0\nd={}\nfor x in range(len(s)):\n\tfor c in \"qwertyuiopasdfghjklzxcvbnm\":\n\t\ta=s[:x]+c+s[x:]\n\t\tif a not in d:\n\t\t\td[a]=True\n\t\t\tans+=1\nfor c in \"qwertyuiopasdfghjklzxcvbnm\":\n\ta=s+c\n\tif a not in d:\n\t\td[a]=True\n\t\tans+=1\nprint(ans)", "n=input()\n#length of charecter and add 1 \nl=len(n)+1\nprint(26*l-len(n))\n\t \t \t \t\t\t\t\t\t\t \t \t \t \t \t", "s = input()\r\n\r\n# the number of substring is always (len(s)+1)*25 + 1\r\n\r\nprint((len(s) + 1)*25 + 1)", "n = input()\r\nl = len(n)\r\na = l+1\r\nprint(a*25 + 1)", "n=list(str(input()))\r\ns=((len(n)+1)*26)-len(n)\r\nprint(s)", "import string\n\n\nS = input()\nans = set([])\nN = len(S)\n\nfor i in range(N + 1):\n for s in string.ascii_lowercase:\n new = S[:i] + s + S[i:]\n ans.add(new)\n# print(ans)\nprint(len(ans))\n", "setx = []\r\nx = input()\r\na = 'abcdefghijklmnopqrstuvwxyz'\r\nt = ''\r\nfor i in range(len(x)+1):\r\n for j in a:\r\n t = x[:i] + j + x[i:]\r\n setx.append(t)\r\n\r\nprint(len(set(setx)))\r\n", "letras = len(input())\r\nprint((letras * 25) + 26)", "s=set()\r\na=input()\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in range(len(a)+1):\r\n\tfor letter in alph:\r\n\t\ts.add(a[:i]+letter+a[i:])\r\nprint(len(s))", "a = input()\r\nprint((len(a) + 1) * 25 + 1)\r\n", "n=input()\r\ni=(len(n)+1)*25\r\nprint(i+1) \r\n", "##############################\nprint(25*len(input())+26)\n \t \t \t\t\t\t \t \t\t \t \t\t\t", "st = input()\r\nans = (len(st)+1)*25\r\nprint(ans+1)", "s = input().strip()\nls = len(s)\n\ninsertion_pts = ls + 1\nideal_num = 26 * insertion_pts\n\nct = 1\nfor i in range(ls-1):\n if s[i] == s[i+1]:\n ct += 1\n else:\n ideal_num -= ct\n ct = 1\n\nideal_num -= ct\n \nprint(ideal_num)\n", "s = input()\n\nspaces = len(s) - 1 + 2\n\nans = 26*spaces - len(s)\n\nprint (ans)\n", "b = input()\r\na = len(b)\r\nc = []\r\nfor x in range(len(b)+1):\r\n for i in range(ord('a'), ord('z') + 1):\r\n c.append(b[:x]+chr(i)+b[x:])\r\nd = set(c)\r\nprint(len(d))\r\n", "s=input()\r\na=set(s)\r\ns=\"\".join(s)\r\nprint((len(s)+1)*25+1)", "\r\ndef distinctPhotobooks(str_):\r\n combinations_adding_one_letter = 26*(len(str_) + 1) \r\n repeated_words = len(str_)\r\n return combinations_adding_one_letter - repeated_words\r\n \r\ninput_ = str(input())\r\nprint(distinctPhotobooks(input_))", "l = list( input() )\nlen_l = len( l )\n\nc = 26 + 25 * len_l\n\nprint ( c )\n", "# LUOGU_RID: 101592403\ns = input()\r\nst = set()\r\nfor i in range(len(s) + 1):\r\n for ch in range(26):\r\n st.add(s[:i] + chr(ord('a') + ch) + s[i:])\r\nprint(len(st))", "s=input()\na=set()\nfor c in 'qwertyuiopasdfghjklzxcvbnm':\n for i in range(len(s)+1):\n a.add(s[:i]+c+s[i:])\nprint(len(a))\n", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\ns=str(input())\r\nprint(26*len(s+\"s\")-len(s))", "from sys import stdin\r\n\r\ns = len(stdin.readline())\r\n\r\nprint(26 * s - (s - 1))", "str = input()\r\nprint (25*len(str)+26)", "photobook = str(input())\n\nprint(26 * (len(photobook) +1) - len(photobook))\n", "print(25*(len(input())+1)+1)", "# coding=utf-8\r\n\r\n\r\nif __name__ == '__main__':\r\n\ts = len(str(input()))\r\n\tprint(26 * (s + 1) - s)\r\n", "st = input()\r\ns = set(st)\r\nprint((len(st)+1)*26 -len(st))", "a= len(str(input()))\r\nprint(26*(a+1)-a)", "a=input()\nprint(26*(len(a)+1)-len(a))\n#Source code should be longer than 50 characters\n \t\t\t \t\t \t \t \t \t \t \t\t\t\t \t\t", "s=input()\r\nprint(len(s)*25+26)", "s = input()\r\nprint(len(s) * 25 + 26)", "s=input()\r\nprint((26-len(s))*(len(s)+1)+len(s)**2)\r\n", "d=len(input())\nprint((d+1)*26-d)", "#! /usr/bin/env python\n# -*- coding: utf-8 -*-\n# vim:fenc=utf-8\n#\n# Copyright © 2015 missingdays <missingdays@missingdays>\n#\n# Distributed under terms of the MIT license.\n\n\"\"\"\n\n\"\"\"\n\nprint(len(input())*25+26)\n", "s = input()\r\nprint(25 * (len(s) + 1) + 1)", "ip=str(input())\r\nn=len(ip)\r\nprint((26*(n+1))-n)\r\n", "s=input()\r\ns1=len(s)\r\nprint((s1+1)*26-s1)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip().decode())\r\nu = set()\r\nfor i in range(len(s) + 1):\r\n for j in range(26):\r\n t = list(s)\r\n t.insert(i, chr(j + 97))\r\n u.add(\"\".join(t))\r\nans = len(u)\r\nprint(ans)", "s=input();print(len(s)*25+26)", "s = input()\r\nprint(26+len(s)*25)", "# t = int(input())\nt = 1\n# import math\n\n# n, m = map(int, input().split())\n# a = list(map(int, input().split()))\n\n# a.sort()\n\n\nwhile t != 0:\n n = input()\n # k, n = map(int, input().split())\n # a = list(map(int, input().split()))\n print(26 * (len(n)) + (26 - len(n)))\n t -= 1\n", "def photograph(s):\r\n print((len(s)+1)*26-len(s))\r\n\r\n\r\ns=input('')\r\nphotograph(s)", "n = len(input())+1\r\n\r\nprint(n*26-n+1)", "import sys\r\nimport inspect\r\nimport re\r\nimport math\r\nfrom pprint import pprint as pp\r\nmod = 998244353\r\nMAX = 10**15\r\n\r\n\r\ndef deb(p):\r\n for line in inspect.getframeinfo(inspect.currentframe().f_back)[3]:\r\n m = re.search(r'\\bdeb\\s*\\(\\s*([A-Za-z_][A-Za-z0-9_]*)\\s*\\)', line)\r\n print('%s %d' % (m.group(1), p))\r\n\r\n\r\ndef vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\ndef main():\r\n s = input()\r\n n = len(s)\r\n ss = set()\r\n\r\n for i in range(n + 1):\r\n for j in range(26):\r\n temp = s[0:i] + str(chr(ord('a') + j)) + s[i:]\r\n ss.add(temp)\r\n\r\n print(len(ss))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\n\ns = input()\n\nbooklets = set()\nfor i in range(0, 1+len(s)):\n for c in range(ord(\"a\"), ord(\"z\")+1):\n news = s[0:i] + chr(c) + s[i:]\n booklets.add(news)\n\nprint(len(booklets))\n", "s=input()\r\nprint(26 + len(s) * 25)", "s = input()\r\nse = set()\r\n\r\nfor j in \"qwertyuiopasdfghjklzxcvbnm\":\r\n for i in range(len(s)+1):\r\n se.add(s[:i]+j+s[i:])\r\nprint(len(se))\r\n", "s = input()\r\nprint(len(set([s[:i] + chr(j) + s[i:] for i in range(len(s) + 1) for j in range(ord('a'), ord('z') + 1)])))", "def main():\r\n n = len(input())\r\n print((n + 1) * 26 - n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a=input()\r\nprint(25*len(a)+26)", "s=input()\r\na=set(s)\r\nprint(25*(len(s))+26)\r\n", "text = len(input())\nprint((text + 1) * 25 + 1)", "print (len(input())*25+26)\n", "s = list(input())\r\nn = len(s)\r\ndef haz(a):\r\n a = a.copy()\r\n for i in range(len(a)):\r\n if a.count(a[i])>1:\r\n a[i] = 0\r\n return a\r\ndef ins(a,b):\r\n a = a.copy()\r\n d = a.copy()\r\n b = h(haz(b))\r\n b = b.copy()\r\n f = []\r\n for i in range(len(a)+1):\r\n for l in range(len(b)):\r\n a = d.copy()\r\n a.insert(i,b[l])\r\n f+=[a]\r\n return f\r\ndef h(a):\r\n i = 0\r\n a = a.copy()\r\n while 0 in a:\r\n a.remove(0)\r\n return a\r\nk = (n+1)*26\r\nf = ins(s,s)\r\nb = len(f)\r\nf = h(haz(f))\r\nc = len(f)\r\nk = k-(b-c)\r\nprint(k)\r\n", "booklet = input()\n\nprint((25 * len(booklet)) + 26)\n", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\ns = input()\r\nl = len(s)\r\nprint(25*l + 26)\r\n", "a=input()\r\nif len(a)==1:\r\n print(51)\r\nelse:\r\n print(51+(len(a)-1)*25)", "s = str(input()); print(26+len(s)*25)", "n=input()\r\na=(25*(len(n)+1))+1\r\nprint(a)", "a=input()\r\nx=len(a)\r\ny=len(a)+1\r\nprint(y*26-x)", "from string import ascii_lowercase\n\n\ndef solve(r):\n r = list(r)\n s = 0\n x = set()\n for nl in ascii_lowercase:\n for i in range(len(r) + 1):\n k = r[:i] + [nl] + r[i:]\n x.add(tuple(k))\n return len(x)\n\n\ndef main():\n s = input()\n print(solve(s))\n\n\nmain()\n", "st = set()\ns = input()\nfor i in range(26):\n\tfor j in range(len(s) + 1):\n\t\ttemp = s[:j] + chr(i + ord('a')) + s[j:]\n\t\tst.add(temp)\nprint(len(st))", "instr = input()\nlength = len(instr)\nprint((length+1)*26-length)", "s = input()\r\nprint((len(s)+1)*25 + 1)", "import math\r\ns = list(input())\r\nn = len(s)\r\nans = (n+1)*25+1\r\nprint(ans)\r\n", "s = input()\r\na2z = sorted(\"qwertyuiopasdfghjklzxcvbnm\")\r\nst = set()\r\nfor i in range(len(s)):\r\n first = s[:i]\r\n second = s[i:]\r\n for c in a2z:\r\n st.add(first + c + second)\r\nfor c in a2z:\r\n st.add(s + c)\r\nprint(len(st))", "s = input()\r\nd = set()\r\nfor i in range(len(s)):\r\n for a in range(26):\r\n c = chr(ord('a') + a)\r\n d.add(s[:i] + c + s[i:])\r\nfor a in range(26):\r\n c = chr(ord('a') + a)\r\n d.add(s + c)\r\nprint(len(d))\r\n", "a=input()\r\nn=len(a)\r\nif n==1:\r\n\tprint(51)\r\nelse:\r\n\tprint((26*(n+1))-(n))", "s = input()\r\nq= (len(s)+1)*26 - (len(s))\r\nprint(q)", "s = input()\n#teste teste teste teste teste teste\nprint(26*(len(s)+1)-len(s))\n\n\t\t\t \t\t\t \t \t\t \t\t\t\t \t\t\t\t\t", "s = input()\n\nres = ((26 - len(s))*(len(s)+1)) + (len(s)*len(s))\n\nprint(res)\n\t\t\t \t \t \t \t \t \t \t \t\t\t \t\t\t\t\t\t", "#!/usr/bin/python3\n\nimport itertools as ittls\nfrom collections import Counter\n\nimport re\nimport math\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\nfrom string import ascii_lowercase\n\ns = input()\n\ndictx = {s: 1}\n\nfor i in range(len(s) + 1):\n for j in ascii_lowercase:\n dictx[s[:i] + j + s[i:]] = 1\n\nprint(len(dictx) - 1)\n", "a = str(input())\r\nprint(26 + 25*len(a))", "s=input()\r\ny=((len(s)+1)*26)-len(s)\r\nprint(y)", "n = input()\r\nprint((len(n) + 1) * 26 - len(n))\r\n", "s=input()\r\nn=len(s)+1\r\nl=n-1\r\nprint(n*26-l)\r\n", "alphabet = [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\", \"g\", \"h\", \"i\", \"j\", \"k\", \"l\", \"m\", \"n\", \"o\", \"p\", \"q\", \"r\", \"s\", \"t\", \"u\", \"v\", \"w\", \"x\", \"y\", \"z\"]\r\nstring = input()\r\nn = len(string)\r\nletters = list(string)\r\nunique = []\r\nfor x in range(n + 1):\r\n for y in range(26):\r\n temp = letters[:]\r\n temp.insert(x, alphabet[y])\r\n unique.append(\"\".join(temp))\r\nunique = set(unique)\r\nprint(len(unique))", "#!/usr/bin/python3\ns=input()\nn=len(s)\nmemo=set()\nfor i in range (0,(n+1)):\n for j in \"abcdefghijklmnopqrstuvwxyz\":\n memo.add(s[0:i]+j+s[i:])\nprint(len(memo)) \n \n", "string = str(input())\r\nx = len(string)\r\nprint(25 * x + 26)\r\n", "st=input()\r\na=len(st)\r\nprint(((a+1)*25)+1)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/554/A\r\n\r\ns = input()\r\n\r\nprint(26 + len(s)*25)", "s = input()\r\nprint(len(s)*26+26-len(s))", "n=len(input())\r\nprint(26*(n+1)-n)", "n=input()\r\na=26\r\nfor i in range(len(n)):\r\n\ta+=25\r\nprint(a)\t", "s = input()\r\n\r\nprint(26+len(s)*25)\r\n", "s = input(\"\")\nl = len(s)\nx = (l*26)-l\nprint(x+26)\n", "chars = list(input())\r\nl = len(chars)\r\nprint(26 * (l + 1) - l)", "def main():\r\n s = len(input())\r\n return s*26 +26-s\r\nprint(main())\r\n", "s = input()\r\nx = len(s)\r\nprint(x*25+26)", "s=input()\r\n\r\nres=set()\r\n\r\nfor i in range(len(s)+1):\r\n for ch in range(ord('a'),ord('z')+1):\r\n res.add(s[:i]+chr(ch)+s[i:])\r\n\r\nprint(len(res))", "word = input()\r\nprint((26*(len(word)+1))-len(word))", "s = input()\r\nn = len(s)\r\nans = 26 * (n + 1) - n\r\nprint(ans)", "s=input()\r\nprint((26*(len(s)+1))-len(s))", "a = input()\r\n\r\nc = len(a)+1\r\n\r\nprint(c*25+1)\r\n", "# https://codeforces.com/problemset/problem/554/A\ns = input()\nresult = 26\nfor l in s:\n result += 25\nprint(result)", "n = input()\r\nans = 26;\r\nfor i in n:\r\n ans += 25\r\nprint(ans)", "s = input()\nl = len(s)\nprint(26*(l+1)-l)", "import sys\r\n\r\n#while True:\r\n \r\n #x = input(\"Eneter a string please\\n\")\r\nx = sys.stdin.readline().rstrip()\r\ny = len(x)\r\n\r\nif 21 <= y :\r\n print(\"Enter a lower number\")\r\nelif y==0:\r\n print(\"Enter a higher number\")\r\nelse:\r\n print((y+1)*26-y)\r\n \r\n", "booklet = str(input())\r\ni = 0\r\nlength = len(booklet)\r\nalpha = 'abcdefghijklmnopqrstuvwxyz'\r\nhashset = set()\r\nwhile i<=length:\r\n\tfor c in alpha:\r\n\t\thashset.add(booklet[0:i]+c+booklet[i:])\r\n\ti+=1\r\nprint(len(hashset))", "alpha = \"abcdefghijklmnopqrstuvwxyz\"\r\ns = set()\r\nst = input()\r\nfor i in range(0, len(st) + 1):\r\n temp = \"\"\r\n for j in alpha:\r\n s.add(st[0:i] + j + st[i: len(st)])\r\nprint(len(s))\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ns = input()\r\nva = ord('a')\r\nss = set()\r\n\r\nfor i in range(len(s)):\r\n for j in range(va, va+26):\r\n temp = s[:i]+chr(j)+s[i:]\r\n ss.add(temp)\r\n\r\nprint(len(ss))\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\ns = input()\n\nstart = time.time()\nans = 1+25*(len(s)+1)\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "print(((len(input())+1)*25)+1)", "s=input()\r\ntedad = 26*(1+len(s))-len(s)\r\nprint(tedad)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\n\r\n\r\ndef main():\r\n s = set()\r\n t = input()\r\n n = len(t)\r\n for i in range(n + 1):\r\n for j in range(26):\r\n tmp = t[0:i] + chr(ord('a') + j) + t[i:]\r\n s.add(tmp)\r\n print(len(s))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/env python3\n\"\"\"\nCodeforces Round #309 (Div. 2)\n\nProblem 554 A. Kyoya and Photobooks\n\n@author yamaton\n@date 2015-08-17\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(s):\n letters = set(s)\n letter_count = len(letters)\n size = len(s)\n\n distinct_count = (26 - letter_count) * (size + 1)\n\n duplicates = {s[:i] + let + s[i:] for let in letters for i in range(0, size+1)}\n duplicate_count = len(duplicates)\n return distinct_count + duplicate_count\n\n\ndef print_stderr(*args, **kwargs):\n print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n s = input().strip()\n result = solve(s)\n print(result)\n\n\nif __name__ == '__main__':\n main()", "print(len(input())*25+26)\r\n \r\n \r\n \r\n", "a = input()\nprint((len(a)+1)*25+1)\n", "def photobooks(s):\r\n return (len(s) + 1) * 26 - len(s)\r\n\r\n\r\nprint(photobooks(input()))\r\n", "print(26+(len(input())*25))", "s=input()\r\nprint(((len(s)+1)*26)-len(s))\r\n", "p = input()\r\nprint((len(p)+1)*26 -len(p))", "a=input()\r\nprint(((len(a)+1)*26)-len(a)) ", "#include<bits/stdc++.h>\n#using namespace std;\n#char a[1005];\n#int main(){\n# int len;\n#\tcin>>a;\n#\tlen=strlen(a);\n#\tcout<<25*(len+1)+1;\n#}\n\ns=input()\na=len(s)\nprint(26*(a+1)-a)", "x=input()\r\nprint(26*len(x)+(26-len(x)))", "import sys\r\n\r\nstrInput = sys.stdin.readline().rstrip()\r\n\r\nnumberOfSpecialPhotos = len(strInput)\r\n\r\nprint((numberOfSpecialPhotos + 1) * 26 - numberOfSpecialPhotos)\r\n", "n = input()\r\nl = len(n)\r\nprint(25*(l+1)+1)\r\n", "s = input()\nl = s.__len__()\nans = 26 + l*25\nprint (ans)\n", "p=input()\r\nl=len(p)\r\nans=(l+1)*26-l\r\nprint(ans)\r\n", "print((len(input())+1)*25 + 1)\r\n", "print(25 * (len(input()) + 1) + 1)", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\ns = str(input())\r\nprint(25*len(s) + 26)", "def f(a):\n l = len(a)\n rem = 26-l\n spaces = l\n extra = spaces*l\n\n poss = rem*(spaces+1)\n\n return poss+extra\n\n\n\n# arr = list(map(int,input().split()))\na = input()\n# arr.sort()\n\nprint(f(a))\n", "__author__ = 'Adam'\r\nimport sys\r\n\r\na_z = [chr(i) for i in range(ord('a'), ord('z')+1)]\r\n\r\n\r\ns_in = sys.stdin.readline().replace('\\n', '')\r\n\r\na_z1 = []\r\n\r\nfor i in range(len(s_in)):\r\n for ch in a_z:\r\n s_in1 = list(s_in)\r\n s_in2 = list(s_in)\r\n s_in1.insert(i, ch)\r\n s_in2.insert(i+1, ch)\r\n\r\n #print(s_in1)\r\n a_z1.append(''.join(s_in1))\r\n a_z1.append(''.join(s_in2))\r\n\r\nprint(len(set(a_z1)))", "l = input()\nprint(51+25*(len(l)-1))", "def main():\n s = input()\n distinct = 50\n for i in range(1, len(s)):\n distinct += 24\n if s[i - 1] == s[i]:\n distinct += 1\n\n same_set = set()\n same_set |= {s[0] + s}\n\n same_set |= {s + s[len(s) - 1]}\n\n for i in range(1, len(s)):\n same_set |= {s[:i] + s[i - 1] + s[i:]}\n same_set |= {s[:i] + s[i] + s[i:]}\n\n distinct += len(same_set)\n\n print(distinct)\n\n\nif __name__ == '__main__':\n main()", "\r\ns = input()\r\nprint((26 * (len(s) + 1)) - len(s))\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# حرفت سند", "s = input()\r\nn = len(s)\r\n\r\nif(n==1):\r\n print(51)\r\nelse:\r\n print((n+1)*26 - n)", "#code\r\n\r\nR = lambda:map(int,input().split())\r\n\r\ns = input()\r\nn = len(s)\r\nprint((26 * (n+1)) - n)", "def solve():\r\n print((len(input()) + 1) * 25 + 1)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "pb = input()\nl = len(pb)\nrep = [1]*l\n\nfor i in range(1, l):\n\tif pb[i] == pb[i-1]:\n\t\trep[i] = rep[i-1]+1\n\t\trep[i-1] = 0\n\nprint(26*(l+1) - sum(rep))\n", "import string\r\nalphabet = string.ascii_lowercase\r\nstring_ = input()\r\nvariations = set()\r\nstr_size = len(string_)\r\nfor i in range(str_size+1):\r\n for letter in alphabet:\r\n new_variation = string_[0:i] + letter + string_[i:str_size]\r\n variations.add(new_variation)\r\n\r\nprint(len(variations))\r\n", "s = input()\r\noutList = []\r\nout = 0\r\nalph = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', \\\r\n 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', \\\r\n 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nif len(s) == 1:\r\n out = 51\r\nelse:\r\n for i in range(len(s)+1):\r\n sList = list(s)\r\n for x in alph:\r\n if i == len(s):\r\n sList.append(x)\r\n sNew = ''\r\n for e in sList:\r\n sNew += e\r\n if not sNew in outList:\r\n outList.append(sNew)\r\n sList = list(s)\r\n else:\r\n sList.insert(i, x)\r\n sNew = ''\r\n for e in sList:\r\n sNew += e\r\n if not sNew in outList:\r\n outList.append(sNew)\r\n sList = list(s)\r\n out = len(outList)\r\nprint(out)\r\n \r\n", "print(26+25*(len(input())))\r\n", "s = input()\r\nn = len(s)\r\nprint((n + 1) * 25 + 1)", "__author__ = 'Andrey'\ns = input()\npossibilities = set()\nfor i in range(97, 97 + 26):\n char = chr(i)\n for j in range(0, len(s) + 1):\n option = s[:j] + char + s[j:]\n possibilities.add(option)\nprint(len(possibilities))", "s = input()\n\nn = 26 + len(s)*25\nprint(n)\n", "print(26+25*len(input()))\r\n", "s = str(input())\nprint(25*len(s)+26)", "s=input()\r\nprint(25*len(s)+26)", "s = input()\r\np = 26\r\np += (25 * len(s))\r\nprint(p)", "k = 51\ns = input()\nk += (len(s) -1) * 25\nprint(k)\n", "s=input()\r\nm=len(s)\r\nprint(26*(m+1)-m)", "st=input()\r\nn=len(st)\r\nprint((n+1)*25+1)", "word = input()\r\nlen_word = len(word)\r\nn_possib = (len_word * 25) + 26\r\n\r\nprint(n_possib)", "s=input()\r\nans=26*(len(s)+1)-len(s)\r\nprint(ans)", "S = input()\r\nprint(26 * (len(S)+1) -len(S) )", "n = len(input())\r\nres = 26 * (n+1) - n\r\nprint(res)", "s = input()\r\nn = len(s)\r\nprint (26*(n+1)-n)\r\n", "\"\"\"m=[]\r\nfor l in range(3):\r\n s=['h','h']\r\n s.insert(l,' ')\r\n for i in range(97,123):\r\n s[l]=chr(i)\r\n k=''.join(s)\r\n m.append(k)\r\n if k=='hhh':\r\n print(k,\"*\")\r\n else:\r\n print(k)\r\noop=0\r\nculp=[]\r\nfor i in range(len(m)):\r\n for j in range(len(m)):\r\n if i!=j and m[i]==m[j]:\r\n oop+=1\r\n culp.append(m[i])\r\nprint(oop)\r\nprint(culp)\"\"\"\r\na=input()\r\nl=len(a)\r\nprint((l+1)*26-l)\r\n", "n = input()\r\nres = (len(n)+1)*26 - len(n)\r\nprint(res)", "#!/usr/bin/env python3\n\nl = input()\n\ndef insert_before(s, c, i):\n\tif i == len(s):\n\t\treturn s + c\n\telse:\n\t\treturn s[0:i] + c + s[i:]\n\nbooks = set()\n\nfor i in range(len(l) + 1):\n\tfor c in 'abcdefghijklmnopqrstuvwxyz':\n\t\ts = insert_before(l, c, i)\n\t\tbooks.add(s)\n\nprint(len(books))", "a = input()\r\nb = len(a)\r\nprint(26*(b+1)-b)", "print(len(input())*25+26)", "s = input()\r\n\r\nprint( (len(s) + 1) * (26 - len(s)) + len(s) ** 2 )\r\n\r\n\r\n\r\n", "if __name__ == '__main__':\r\n s = input()\r\n print(int((len(s) + 1) * 26 - len(s)))\r\n", "s = input()\nmest = len(s) + 1\n\nhave = []\n\nimport string\nalphabet = string.ascii_lowercase\n\nfor el in alphabet:\n have.append(el + s)\n\nfor i in range(1, mest + 1):\n for el in alphabet:\n have.append(s[0:i] + el + s[i:])\n\nprint(len(set(have)))\n", " ####\r\n ####\r\n ####\r\n ####\r\n\r\n #### #### ####\r\n #### #### #### \r\n #### #### ####\r\n #### #### #### \r\n \r\n #### #### #### \r\n \r\n #### #### #### \r\n \r\n #### #### #### \r\n ####################################### \r\n #######################################\r\n\r\n\r\n\r\n\r\n \r\n ####################///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n #### #///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n ####################///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///# \r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\n #///# #///# #///# #///#\r\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 = (input())\r\nlis = list(n)\r\nprint(((len(lis)+1)*25)+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", "s = input()\nl = len(s)\nans = (l+1) * 26 - l\nprint(ans)", "n=input()\r\nprint(26+len(n)+24*len(n))", "import sys\r\n\r\n\r\ndef main():\r\n data = sys.stdin.readline().strip()\r\n s = set()\r\n for i in range(len(data)):\r\n for j in range(97,123):\r\n s.add(data[:i]+chr(j)+data[i:])\r\n\r\n for j in range(97,123):\r\n s.add(data+chr(j))\r\n\r\n print(len(s))\r\n\r\nmain()\r\n", "parsa=input()\r\na=len(parsa)\r\nprint(26*(a+1)-a)", "l=list(input());print(26*(len(l)+1)-len(l))", "n=input()\r\nprint(26*(len(n)+1)-len(n))", "letters = input()\r\n\r\nprint(26 * (len(letters) + 1) - len(letters))", "a = input()\r\nprint(len(a)*25+26)", "a = input()\r\nn = len(a)\r\nprint(26*(n+1) - n)", "# coding: utf-8\r\n\r\ntam = len(input())\r\n\r\nprint(26 + tam * 25)\r\n\r\n", "s=input()\r\ndef chrnum(s,a):\r\n ans=0\r\n for i in s:\r\n if i==a:ans+=1\r\n return ans\r\ndef fn(s):\r\n temp='abcdefghijklmnopqrstuvwxyz'\r\n ans=0\r\n for i in temp:\r\n ans+=len(s)+1-chrnum(s,i)\r\n return ans\r\nprint(fn(s))\r\n", "from string import ascii_lowercase as ascii\n\ns = input()\nres = set()\nfor i in range(len(s) + 1):\n\tfor c in ascii:\n\t\tres.add(s[:i] + c + s[i:])\nprint(len(res))\n", "x=(input())\r\ns=len(x)\r\ns+=1\r\nprint(25*s+1)\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\n\ns = input()\nres = 26 * (len(s) + 1) - sum(Counter(s).values())\nprint(res)\n", "s = input()\r\nprint(26 + 25 * len(s))\r\n", "a = list(input())\r\nk = set()\r\nfor i in range(len(a)+1):\r\n for l in range(ord(\"a\"),ord(\"z\")+1):\r\n t = a[:]\r\n t.insert(i,chr(l))\r\n k.add(\"\".join(t))\r\nprint(len(k))\r\n", "print(26 + 25 * len(input()))", "s=input()\r\nx=((len(s)+1)*26)-len(s)\r\nprint(x)", "astring = input()\r\nn = len(astring)\r\nprint((n+ 1)*26 - n)", "s = input()\r\nresult = 26\r\nfor l in s:\r\n result += 25\r\nprint(result)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nprint(25*(len(input())+1)+1)", "s = input()\nl = len(s)\nprint(26 * (l + 1) - l)", "print((len(input())+1)*25+1)\n", "l=len(input())\r\nprint(1+(l+1)*25)", "s = input()\r\nprint(25*(len(s) + 1) + 1)", "s = input()\n\nprint((len(s) + 1) * 26 - len(s))\n", "a = input()\r\nb = len(a)\r\nprint(26 + 25 * b)", "print(25 * len(input()) + 26)", "s = input()\r\n\r\nc = []\r\n\r\nfor i in range(len(s)+1):\r\n for l in range(26):\r\n c += [\"\".join(s[:i] + \"abcdefghijklmnopqrstuvwxyz\"[l] + s[i+1:])]\r\n\r\n\r\nprint(len(set(c))-1)", "string = input()\r\n\r\nprint((len(string) + 1) * 26 - len(string) )", "\"\"\"\r\n Kyoya and Photobooks\r\n\"\"\"\r\nstring = input()\r\nlength = len(string)\r\nPhotobooks = 26 * (length+1) - length\r\nprint(Photobooks)", "#n = int(input())\n#n, m = map(int, input().split())\ns = input()\n#c = list(map(int, input().split()))\nl = len(s)\nprint((l + 1) * 26 - l)", "print(len(input())*25 + 26)\r\n", "s = input()\r\nl = len(s)\r\nc = ((l + 1) * 26) - l\r\nprint(c)", "\r\n\r\nn = input()\r\n\r\nprint((len(n) + 1) * 26 - len(n))", "a=input()\r\np=set([])\r\nfor i in range(ord('a'),ord('z')+1):\r\n for j in range(len(a)+1):\r\n x=a[:j]+chr(i)+a[j:]\r\n p.add(x)\r\nprint(len(p))\r\n", "s=input()\r\nprint((len(s)+1)*25+1)\r\n\r\n\r\n\r\n\r\n", "x = input()\r\nt = len(x)\r\nprint((t+1)*(26)-t)", "s=input()\r\nx=len(s)\r\nans=\"YES\"\r\nfor i in range(0,x-1):\r\n if s[i]!=s[i+1]:\r\n y=1+(x+1)*25\r\n print(y)\r\n ans=\"NO\"\r\n break\r\nif ans==\"YES\":\r\n z=1+(x+1)*25\r\n print(z)\r\n\r\n \r\n \r\n ", "s = input()\r\n\r\nn = 26 + len(s)*25\r\nprint(n)\r\n", "suka = input();\r\n\r\nkak = {}\r\nsko = 0\r\n\r\nfor i in range(0, len(suka) + 1):\r\n for c in range(ord('a'), ord('z') + 1):\r\n st = suka[:i] + chr(c) + suka[i:]\r\n if not st in kak:\r\n sko += 1\r\n kak[st] = 1\r\n \r\n \r\nprint(str(sko) + \"\\n\");", "s = input()\r\nn = len(s)\r\nprint(n*25+26)\r\n", "s = list(input())\r\nprint(26*(len(s)+1)-len(s))\r\n", "def from_same_letters(word):\r\n\tif len(word) == 0:\r\n\t\treturn True\r\n\r\n\tchar = word[0]\r\n\r\n\tfor letter in word:\r\n\t\tif letter != char:\r\n\t\t\treturn False\r\n\r\n\treturn True\r\n\r\nletters = input()\r\nresult = int(51)\r\n\r\nfor i in range(len(letters) - 1):\r\n\tresult += 25;\r\n\r\n\tif letters[i + 1] != letters[i]:\r\n\t\t++result;\r\n\r\nprint(result)\r\n", "s= str(input())\r\nprint((len(s)+1)*26 - len(s))\r\n", "s=input()\r\nx=len(s)\r\nprint((x+1)*26-x)", "s = list(input())\r\na = []\r\ndef listmerge(l):\r\n s = \"\"\r\n for el in l:\r\n s += el\r\n return s\r\n\r\nfor i in range(len(s)+1):\r\n for j in list(\"abcdefghijklmnopqrstuvwxyz\"):\r\n S = list(s)\r\n S.insert(i,j)\r\n #print(S)\r\n a.append(S)\r\nb = []\r\nfor el in a:\r\n b.append(listmerge(el))\r\nprint(len(set(b)))\r\n", "st=(input())\r\nif st.islower():\r\n n=len(st)\r\n photos=(26*(n+1)-n)\r\n print(photos)\r\nelse:\r\n print(\"pleas enter lower case string\")", "s=input()\r\nl=len(s)\r\nprint(26*(l+1)-l)", "#!/usr/bin/env python3\n\ns = input()\n\nprint(sum(len(s) + 1 - s.count(chr(ord('a') + i)) for i in range(26)))\n", "s=input()\r\nprint(26+len(s)*26-len(s))", "s=input()\r\nl=len(s)\r\nprint((26-l)+(26)*l)", "alpha=list(map(chr,range(97,123)))\r\ns = input()\r\npossible = set()\r\nans = 0\r\n \r\nfor letter in alpha:\r\n for i in range(len(s)+1):\r\n seq = [s[:i], letter, s[i:]]\r\n word = \"\".join(seq)\r\n possible.add(word)\r\nprint(len(possible))\r\n", "s = input()\r\nprint(26*(len(s)+1) - len(s))", "a = input() + \" \"\r\nn = len(a) -1 \r\n'''c = 'abcdefghijklmnopqrstuvwxyz'\r\ns = 0\r\nd = len(a)\r\ne = ''\r\nfor i in c:\r\n if i not in a:\r\n s+=d\r\n else:\r\n for j in a:\r\n if e==i:\r\n continue\r\n s+=1\r\n e = j\r\nprint(s)\r\n'''\r\nprint(25 *n + 26 )\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ns = input().rstrip()\r\n\r\nprint((len(s) + 1) * 26 - len(s))", "l = list(map(str, input()))\r\naux = list(l)\r\ns = set()\r\nfor i in range(len(l)+1):\r\n for j in range(97, 123):\r\n aux.insert(i, chr(j))\r\n s.add(str(aux))\r\n aux = list(l)\r\nprint(len(s))", "s=input()\r\nprint( ((len(s)+1)*25)+1 )", "def main():\n ab, s = input(), set()\n for i in range(len(ab) + 1):\n a_b = (ab[:i], ab[i:])\n for c in \"abcdefghijklmnopqrstuvwxyz\":\n s.add(c.join(a_b))\n print(len(s))\n\n\nif __name__ == '__main__':\n main()\n", "n=input()\r\nprint(len(n)*25 + 26)", "s = input()\r\nprint(26*(len(s) + 1) - len(s))", "str = input()\na = len(str)\nprint(a*25+26)\n", "s = input()\r\na = set()\r\nk = ord('a')\r\nfor i in range(k, k + 26):\r\n for j in range(len(s) + 2):\r\n a.add(s[0:j]+chr(i)+s[j:len(s)])\r\nprint(len(a)) ", "s = list(input())\r\nn = len(s)\r\nprint((n+1)*26-n)", "x = input()\r\nprint(25*len(x)+26)", "import sys\r\n\r\ninp = sys.stdin.read().strip().split(\"\\n\")\r\nphoto = str(inp[0])\r\nleng = len(photo)\r\n\r\nres = ((leng+1)*26)-leng\r\n\r\nprint(res, end=\"\")", "l = len(input())\r\nprint((l+1)*26 - l)", "n = len(input())\r\nprint(25 * n + 26)", "inp = input()\r\nprint(26+len(inp)*25)", "a = 26\r\nfor i in input():\r\n a += 25\r\nprint(a)", "a=input();print(((len(a)+1)*26)-len(a))", "print (25*len(input()) + 26) ", "l = len(input().strip())\r\nprint((l+1)*26-l)\r\n", "a = input()\r\nprint(26*(len(a)+1)-len(a))", "__author__ = 'v-biguo'\r\n\r\ncnt = 0\r\nss = set()\r\n\r\nline = input()\r\n\r\nfor i in range(len(line)+1):\r\n for j in range(26):\r\n cur = line[:i]+chr(j+ord('a'))+line[i:]\r\n if cur not in ss:\r\n ss.add(cur)\r\n cnt+=1\r\n\r\nprint(cnt)\r\n", "s = input()\nprint(len(s)*25+26)", "s=input(\"\")\r\nb=len(s)\r\np=26*(b+1)-b\r\nprint(p)# your code goes here", "s=len(input())\r\nprint((s+1)*26-(s))\r\n", "sentence = input()\r\nlength = len(sentence) + 1\r\nanswer = (26*length+1) - length\r\nprint(answer)", "# Read input\r\ns = input()\r\nn = len(s)\r\ndistinct_photobooks = set()\r\n\r\n# Iterate through all possible positions to insert the extra photo\r\nfor i in range(n + 1):\r\n for char in 'abcdefghijklmnopqrstuvwxyz':\r\n new_photobook = s[:i] + char + s[i:]\r\n distinct_photobooks.add(new_photobook)\r\n\r\n# Calculate and print the number of distinct photobooks\r\nresult = len(distinct_photobooks)\r\nprint(result)\r\n", "print (25*len(input())+26)\r\n", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\ns = input()\r\nprint((len(s)+1) * 25 + 1)\r\n", "LettersString = input(\"\")\r\nAlfabet = \"abcdefghijklmnopqrstuvwxyz\"\r\nCombinaties = set()\r\n\r\n\r\nfor x in range(0,len(LettersString)+1):\r\n for y in range(0, 26):\r\n Combinaties.add(LettersString[0:x]+Alfabet[y]+LettersString[x:len(LettersString)])\r\n\r\nprint (len(Combinaties))\r\n", "Q = set()\r\nT = input()\r\nfor P in range(len(T)+1):\r\n for L in range(26):\r\n Q.add(T[:P]+str(chr(L+97))+T[P:])\r\nprint(len(Q))\r\n", "t=input()\r\nprint((len(t)*25)+26)", "a=input()\r\nprint(26*(len(a)+1)-len(a))\r\n", "s=list(input())\r\nif(len(s)==1):\r\n\tprint(51)\r\nelse:\r\n\tprint(26*(len(s)+1)-len(s))", "b = []\r\ns = input()\r\nb += s\r\nans = set()\r\nfor i in range(len(s) + 1):\r\n for j in range(26):\r\n b.insert(i, chr(ord('a') + j))\r\n now = 0\r\n y = 37\r\n for h in range(len(b)):\r\n now += (ord(b[h]) - ord('a') + 1) * y\r\n y *= 37\r\n del b[i]\r\n ans.add(now)\r\nprint(len(ans))", "#abcdefghijklmnopqrstuvwxyz\n\ns=input()\nl=len(s)\nres=(26*(l+1))-(l)\nprint(res)\n", "s=input()\r\nn=len(s)\r\nans=(n+1)*(26-n)+(n*n);\r\nprint(ans)\r\n ", "t=input()\r\ni=len(t)\r\nprint(26*(i+1)-i)", "string = len(input())+1\r\n\r\nprint(string*26-string+1)", "s = input()\r\nprint((len(s)+1)*26-len(s))", "s = input()\r\nprint(26 * (len(s) + 1) - len(s))", "s = input()\r\na = []\r\nfor i in s:\r\n if i not in a:\r\n a.append(i)\r\nprint(len(s)*25+26)", "import sys\r\n\r\ny = sys.stdin.readline().rstrip()\r\n\r\nx = len(y)\r\n\r\nprint((x + 1) * 26 - x)\r\n", "from collections import Counter\n\narr = list('abcdefghijklmnopqrstuvwxyz')\n\ns = input()\n\nn = len(s)\n\nd = Counter(s)\n\ntotal = 0\n\nfor i in arr:\n\ttotal += (n+1)\n\tif i in d:\n\t\ttotal -= d[i]\n\nprint(total)", "n=input()\r\nprint(25*len(n)+26)", "str = input()\r\na = len(str)\r\n\r\nprint(a * 25 + 26)\r\n", "s=input()\nprint(26*(len(s)+1)-len(s))", "l=input()\r\nprint((len(l)+1)*26-len(l))", "s = input()\r\nprint((len(s) + 1) * 25 + 1)", "assd=input()\r\nprint(((len(assd)+1)*26-len(assd)))\r\n", "book=input()\r\nprint((len(book)*26)+(26-len(book)))", "s = (input())\r\n\r\nprint((len(s)+1)*25+1)", "st = input()\r\nl = len(st)\r\n\r\nprint(26 * (l+1) - l)", "s=input()\r\nprint(len(s)*25 + 26)\r\n\r\n", "a = str(input())\r\nb = len(a)\r\nprint((b + 1) * 25 + 1)", "st = input()\r\nl = len(st)\r\nprint((l+1) * 26 - l)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 30 15:37:38 2020\r\n\r\n@author: PREET MODH\r\n\"\"\"\r\n\r\n\r\ns=list(input())\r\nprint(str(26 + len(s)*25))", "n=input()\r\ns=len(n)\r\nw=(s+1)*26\r\nprint(w-s)\r\n", "s = len(input())\r\nprint((s+1)*26-s)", "print(len(input().strip())*25+26);", "s=input()\r\na=set()\r\nfor i in range(len(s)+1):\r\n k=s\r\n for j in range(97,97+26):\r\n k=s[:i]+chr(j)+s[i:]\r\n a.add(k)\r\nprint(len(a))\r\n \r\n \r\n \r\n\r\n \r\n \r\n", "s = input()\r\npos = len(s) + 1\r\nprint(26*(pos) - len(s))", "a=input()\r\nb=[0]*26\r\nfor i in range(len(a)):\r\n b[ord(a[i])-97]+=1\r\nc=0\r\nr=0\r\nfor i in range(26):\r\n if b[i]==0:\r\n c+=1\r\n else:\r\n r+=(len(a)+1-b[i])\r\n#print(r) \r\nr+=(c*(len(a)+1))\r\nprint(r)\r\n", "x = input()\r\ns = set()\r\nfor i in range(len(x)+1):\r\n for j in 'abcdefghijklmnopqrstuvwxyz':\r\n v = x[:i] + j + x[i:]\r\n s.add(v)\r\nprint(len(s))", "n = input()\r\nlength = len(n)\r\np = 26*(length+1)\r\nprint(p-length)", "s=input()\r\nprint(26+25*(len(s)))", "s=list(input())\na=len(s)\nans=25*(a+1)+1\nprint(ans)\n \t\t \t\t\t \t\t \t \t\t \t \t\t", "\r\nx = input()\r\nprint(26 * (len(x) + 1) - len(x))", "a = input()\r\nprint(26 * (len(a) + 1) - (1 * len(a)))", "letra = input()\n\nans = 26*(len(letra)+1) - len(letra)\n\nprint(ans)\n\t \t \t\t \t\t \t\t\t \t \t \t", "s = input()\r\n\r\na =set()\r\nfor i in range(len(s)+1):\r\n for x in 'qwertyuiop[lkjhgfdsazxcvbnm':\r\n y = s[:i]+x+s[i:]\r\n a.add(y)\r\nprint(len(a)-len(s)-1)", "a=input()\r\nprint(len(a)*25 + 26)\r\n", "s=input()\r\nn=len(s)\r\nans=(n+1)*(26-n)\r\nans+=pow(n,2)\r\nprint(ans)", "s = input().lower()\r\nn = len(s) \r\n\r\ntotal_booklets = ((26*(n+1))-n)\r\nprint(total_booklets)", "print(str(26 + len(input())*25))", "\ndef main():\n s = input()\n n = len(s)\n strings = set()\n chk = ord('a')\n for i in range(n+1):\n for j in range(26):\n new = s[0:i]+chr(chk+j)+s[i:]\n strings.add(new)\n print(len(strings))\n\n\n return\n\nmain()", "s=input()\nfactor = len(s)*25\nshifter = 26\nprint(shifter + factor)\n\t \t\t\t \t \t \t \t\t \t \t\t\t\t \t\t\t\t\t\t", "s = input()\r\nn = len(s)\r\nprint(n * 25 + 26)\r\n", "# your code goes here\r\ns=input()\r\nl=len(s)+1\r\nprint(l*26-(l-1))\r\n", "__author__ = 'taras-sereda'\n\ndef a():\n s = input()\n return (len(s)+1)*26-len(s)\n\nif __name__ == \"__main__\":\n print(a())", "n=input()\r\nprint(25*(len(n))+26)\r\n\r\n", "print(26+len(str(input()))*25)", "s = input()\r\nk = len(s)\r\nprint(((k+1)*25)+1)", "outputs = []\ns = input()\n# problem wants us to find all possible combinations that result after inserting an extra element\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\nalpha = [i for i in alphabet]\ncombs = []\ncomb = 0\nfor i in range(0, len(s)+1):\n for j in alpha:\n temp = s[:i] + j + s[i:]\n if temp not in combs:\n combs.append(temp)\n\nprint(len(combs))\n", "print(26 + len(input()) * 25)\r\n", "s = input()\r\nprint(len(s)*25 + 26)\r\n", "s = len((input()))\r\nprint(26*(s+1)-s)", "s=input()\r\nprint(26*(len(s)+1)-(len(s)))\r\n" ]

[ "def getSum(BiTree, i, n):\n sum = 0\n while i > 0:\n sum += BiTree[i]\n i -= i & (-i)\n return sum\nfrom sys import stdin, stdout\n \ndef update(BiTree, i, n, val):\n while i <n:\n BiTree[i] += val\n i += i & (-i)\n \n \n \n \ndef construct(a, BiTree, a2, a3, n):\n lcount = [0 for i in range(n)]\n for i in range(0, n):\n lcount[i] = getSum(BiTree, a3[i], n)\n update(BiTree, a3[i] + 1, n, 1) \n \n rcount = [0 for i in range(n)]\n BiTree = [0 for i in range(0, n+1)]\n for i in range(n-1, -1, -1):\n rcount[i] = getSum(BiTree, a2[i], n)\n update(BiTree, a2[i] +1, n, 1)\n \n s = 0\n for i in range(0, n):\n s += rcount[i]*lcount[i]\n return s\n \n \nn = int(stdin.readline())\na = [int(i) for i in stdin.readline().split()]\n \nBiTree = [0 for i in range(0, n+1)]\n \ntemp = sorted(a)\ntemp2 = temp[::-1]\n \nd = {temp[i]: i for i in range(0, n)}\na2 = [d[a[i]] for i in range(0, n)]\n \nd2 = {temp2[i]: i for i in range(0, n)}\na3 = [d2[a[i]] for i in range(0, n)]\n \nstdout.write(str(construct(a, BiTree, a2, a3, n)))\n \t\t\t\t\t \t \t \t \t \t", "from sys import stdin,stdout\r\n\r\ndef binarysearch(x,first,last,b):\r\n mid=(first+last)/2\r\n mid=int(mid)\r\n if(b[first]==x):\r\n return first\r\n if(b[last]==x):\r\n return last\r\n if(b[mid]==x):\r\n return mid\r\n if(b[mid]<x):\r\n return binarysearch(x,mid,last,b)\r\n return binarysearch(x,first,mid,b)\r\nn=int(stdin.readline())\r\na=[0]\r\na.extend(list(map(int,stdin.readline().strip().split())))\r\nb=[]\r\nfor i in range(1,n+1):\r\n b.append(a[i])\r\nb.sort()\r\nfor i in range(1,n+1):\r\n a[i]=binarysearch(a[i],0,n-1,b)+1\r\nfen1=[]\r\nfor i in range(0,n+1):\r\n fen1.append(0)\r\ndef update1(it,val):\r\n while(it<=n):\r\n fen1[it]+=val\r\n it+=(it&-it)\r\ndef getsum1(l,r):\r\n if(r<l):\r\n return 0\r\n s=0\r\n l-=1\r\n while(r>0):\r\n s+=fen1[r]\r\n r-=(r&-r)\r\n while(l>0):\r\n s-=fen1[l]\r\n l-=(l&-l)\r\n return s\r\nans=0\r\ncnt=[]\r\nfor i in range(0,n+1):\r\n cnt.append(0)\r\nfor i in range(1,n+1):\r\n update1(a[i],1)\r\n cnt[i]=getsum1(a[i]+1,n)\r\nfor i in range(0,n+1):\r\n fen1[i]=0\r\nfor i in range(1,n+1):\r\n update1(a[i],cnt[i])\r\n ans+=getsum1(a[i]+1,n)\r\nprint(ans)\r\n\r\n \r\n\r\n \r\n \r\n\r\n", "# UCSD fa22 Week 7\n# pyright: strict\n\nimport sys\n# from typing import Counter\n# from collections import Counter\ninput = sys.stdin.readline\nflush = sys.stdout.flush\niil = lambda: [int(x) for x in input().split()]\nINF = 10 **9 + 1\nfrom math import log\n\ndef next_p_2(i:int):\n if i < 10:\n return 16\n return 2 ** (int(log(i-1, 2)) + 1)\n\n\ndef lsb(i:int):\n return i & (-i)\n\n\ndef prefix_sum(tree: list[int], i:int):\n sum = tree[0]\n j = i\n while j:\n sum += tree[j]\n j -= lsb(j)\n return sum\n\n\ndef add(tree: list[int],i:int, delta:int):\n if i == 0:\n tree[0] += delta\n return \n j = i\n while j < len(tree):\n tree[j] += delta\n j += lsb(j)\n\ndef countLess(aa: list[int], v_dict: dict[int, int]):\n count:list[int] = []\n tree = [0] * (next_p_2(len(aa)))\n for a in aa:\n # print(a, v_dict[a])\n if v_dict[a]-1 < 0:\n count.append(0)\n else:\n count.append(prefix_sum(tree, v_dict[a]-1))\n add(tree, v_dict[a], 1)\n return count\n\ntests, = 1,\nfor _ in range(tests):\n n, = iil()\n aa = iil()\n sorted_aa = sorted(aa, reverse=True)\n v_dict = {v:i for i,v in enumerate(sorted_aa)}\n v2_dict = {v:len(aa) - i - 1 for i,v in enumerate(sorted_aa)}\n left = countLess(aa, v_dict)\n right = list(reversed(countLess(list(reversed(aa)), v2_dict)))\n # print(left, right)\n res:int = sum(i * j for i,j in zip(left, right))\n print(res)\n\n\n\n\t \t\t\t \t \t \t\t\t \t\t \t\t \t", "\"\"\"\nApproach:\n for every element:\n a = no of elements greater in left\n b = no of elements smaller in right\n ans is sigma(a*b) for all elements\nNow to efficiently calculate no of such elements for every\nelement we use BIT\n\"\"\"\nimport os\nimport sys\nfrom io import BytesIO, IOBase\n\n\ndef main():\n\n n = int(input())\n lis = list(map(int, input().split()))\n ma = n + 1\n mp = {}\n for i, elem in enumerate(sorted(lis), start=1):\n mp[elem] = i\n gBIT = [0] * (ma + 1)\n\n def update(BIT, i, x):\n while i <= ma:\n BIT[i] += x\n i += i & -i\n\n def query(BIT, i):\n su = 0\n while i > 0:\n su += BIT[i]\n i -= i & -i\n return su\n\n Larr = [0] * (n)\n for i in range(n):\n curElem = mp[lis[i]]\n cur = query(gBIT, ma) - query(gBIT, curElem - 1)\n Larr[i] = cur\n update(gBIT, curElem, 1)\n\n lBIT = [0] * (ma + 1)\n Rarr = [0] * n\n for i in reversed(range(n)):\n curElem = mp[lis[i]]\n cur = query(lBIT, curElem) - query(lBIT, 0)\n Rarr[i] = cur\n update(lBIT, curElem, 1)\n print(sum([x * y for x, y in zip(Larr, Rarr)]))\n\n\n# region fastio\n# Credits\n# # template credits to cheran-senthil's github Repo\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\n# endregion\n\nif __name__ == \"__main__\":\n main()\n", "# If you win, you live. You cannot win unless you fight.\r\nfrom sys import stdin,setrecursionlimit\r\ninput=stdin.readline\r\nimport heapq\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nfrom collections import defaultdict as unsafedict,deque,Counter as unsafeCounter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom random import randint\r\nfrom math import gcd, floor,log2,factorial,radians,sin,cos\r\nrandom = randint(1, 10 ** 9)\r\nmod=998244353\r\ndef ceil(a,b):\r\n return (a+b-1)//b\r\nclass myDict:\r\n def __init__(self,func):\r\n self.RANDOM = randint(0,1<<32)\r\n self.default=func\r\n self.dict={}\r\n def __getitem__(self,key):\r\n myKey=self.RANDOM^key\r\n if myKey not in self.dict:\r\n self.dict[myKey]=self.default()\r\n return self.dict[myKey]\r\n def get(self,key,default):\r\n myKey=self.RANDOM^key\r\n if myKey not in self.dict:\r\n return default\r\n return self.dict[myKey]\r\n def __setitem__(self,key,item):\r\n myKey=self.RANDOM^key\r\n self.dict[myKey]=item\r\n def getKeys(self):\r\n return [self.RANDOM^i for i in self.dict]\r\n def __str__(self):\r\n return f'{[(self.RANDOM^i,self.dict[i]) for i in self.dict]}'\r\n\r\nclass bit:\r\n def __init__(self,n):\r\n self.n=n\r\n self.tree=[0]*(n+1)\r\n def set(self,idx,val):\r\n i=idx+1\r\n while i<=self.n:\r\n self.tree[i]+=val\r\n i+=(i&(-i))\r\n def get(self,idx):\r\n i=idx+1\r\n ans=0\r\n while i>0:\r\n ans+=self.tree[i]\r\n i-=(i&(-i))\r\n return ans\r\n\r\n\r\nn=ri()\r\na=list(rd())\r\nmp=myDict(int)\r\nst=set()\r\nfor i in a:\r\n st.add(i)\r\nbase=1\r\nfor i in sorted(st):\r\n mp[i]=base\r\n base+=1\r\nbt=[bit(base) for i in range(3)]\r\nfor i in range(n-1,-1,-1):\r\n val=mp[a[i]]\r\n val2=val-1\r\n q1=bt[0].get(val2)\r\n bt[1].set(val,q1)\r\n q2=bt[1].get(val2)\r\n bt[2].set(val,q2)\r\n bt[0].set(val,1)\r\nprint(bt[2].get(base-1))\r\n", "import sys\n\nclass BIT:\n def __init__(self, n: int) -> None:\n self.data = [0] * (n + 1)\n \n def low_bit(self, n: int):\n return n & (n ^ (n - 1))\n\n def update(self, i: int, inc: int):\n while i < len(self.data):\n self.data[i] += inc\n i += self.low_bit(i)\n \n def query(self, i: int) -> int:\n result = 0\n while i > 0:\n result += self.data[i]\n i -= self.low_bit(i)\n return result\n \ndef read_input() -> list:\n readline = sys.stdin.readline\n n = int(readline().rstrip())\n return [int(w) for w in readline().split()]\n\ndef solve(data: list)->int:\n n, result = len(data), 0\n bit = BIT(n)\n table = {num:(i + 1) for i, num in enumerate(sorted(data))}\n for i, num in enumerate(data):\n m = bit.query(table[num])\n result += (i - m) * (table[num] - 1 - m)\n bit.update(table[num], 1)\n # print(f'result = {result}, m = {m}, b = {(table[num] - 1 - m)}')\n # print(f'bits = {bit.data}')\n return result\n\n\nprint(solve(read_input()))\n", "def update(bit ,i ) :\r\n while(i < len(bit)) :\r\n bit[i] += 1\r\n i += (i & (-i))\r\ndef getsum(bit, i ) :\r\n res = 0 \r\n while (i >0 ) :\r\n res += bit[i]\r\n i -= (i & (-i))\r\n return res\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nl = sorted(arr)\r\nd = {}\r\nind =1\r\nfor i in range(n) :\r\n if not d.get(l[i] , 0) :\r\n d[l[i]] = ind\r\n ind +=1\r\n\r\nfor i in range(n) :\r\n arr[i] = d[arr[i]]\r\n\r\n\r\nsmall = [0]*n\r\nmaxel = max(arr)\r\nbit = [0]*(maxel +1)\r\nfor i in range(n) :\r\n c = getsum(bit, arr[i]-1)\r\n small[i] = i -c\r\n update(bit,arr[i])\r\n\r\nbit = [0]*(maxel+1)\r\nlarge = [0]*n\r\nfor i in range(n-1,-1,-1) :\r\n k = getsum(bit,arr[i] -1)\r\n update(bit,arr[i])\r\n large[i] = k\r\n\r\ncount = 0\r\nfor i in range(n) :\r\n count += small[i]*large[i]\r\n\r\nprint(count)\r\n \r\n\r\n\r\n \r\n \r\n\r\n \r\n", "import sys\ninput = sys.stdin.readline\n\n\nclass Tree:\n def __init__(self, n):\n self.base = 1\n while self.base < n:\n self.base *= 2\n self.freq = [0] * (2 * self.base)\n\n def add(self, i, d):\n i += self.base\n self.freq[i] += d\n i //= 2\n while i >= 1:\n self.freq[i] = self.freq[2 * i] + self.freq[2 * i + 1]\n i //= 2\n\n def count(self, l, r):\n l += self.base\n r += self.base\n res = 0\n while l <= r:\n if l % 2 == 1:\n res += self.freq[l]\n l += 1\n if r % 2 == 0:\n res += self.freq[r]\n r -= 1\n l //= 2\n r //= 2\n return res\n\n\nn = int(input())\na = list(map(int, input().split()))\ntr = {x: pos for pos, x in enumerate(sorted(a))}\nb = [tr[e] for e in a]\nltree = Tree(n)\nrtree = Tree(n)\nfor e in b:\n rtree.add(e, 1)\nres = 0\nfor e in b:\n rtree.add(e, -1)\n res += ltree.count(e + 1, n - 1) * rtree.count(0, e - 1)\n ltree.add(e, 1)\nprint(res)", "n = int(input())\r\nfrom bisect import bisect_left\r\narr = list(map(int,input().split()))\r\nMAX = pow(10,6)+50\r\n\r\nb = [ele for ele in arr]\r\nb =sorted(b)\r\n\r\nfor i in range(len(arr)):\r\n arr[i] = bisect_left(b,arr[i])\r\nfor i in range(len(arr)):\r\n arr[i]+=1\r\n\r\n#print(arr)\r\n\r\nfenwick = [0]*MAX\r\n\r\ncnt1 = [0]*(MAX)\r\ncnt2= [0]*(MAX)\r\n\r\n\r\ndef add(i):\r\n while(i<=MAX):\r\n fenwick[i]+=1\r\n i+=(i&(-i))\r\n\r\ndef calc(i):\r\n ans = 0\r\n while(i>0):\r\n ans+=fenwick[i]\r\n i-=(i&(-i))\r\n return ans\r\n\r\nfor i in range(len(arr)-1,-1,-1):\r\n ele = arr[i]\r\n cnt2[i] = calc(ele-1)\r\n add(ele)\r\n\r\nfenwick = [0]*MAX\r\n\r\nfor i in range(len(arr)):\r\n ele = arr[i]\r\n cnt1[i] = (i-calc(ele-1))\r\n add(ele)\r\n\r\nans = 0\r\nfor i in range(MAX):\r\n ans+=(cnt1[i]*cnt2[i])\r\nprint(ans)\r\n\r\n\r\n\r\n", "import sys\r\n\r\n# FASTEST IO\r\n\r\nfrom io import BytesIO, IOBase\r\nfrom types import GeneratorType\r\n\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\n\r\n# End of FASTEST IO\r\n\r\nclass fen_tree:\r\n def __init__(self,n):\r\n self.tree=[0 for i in range(n+1)]\r\n self.n=n\r\n\r\n def query(self,q):\r\n s=0\r\n while q>0:\r\n s+=self.tree[q]\r\n q-=(q&-q)\r\n return s\r\n\r\n def update(self,q,upd):\r\n while q<self.n:\r\n self.tree[q]+=upd\r\n q+=(q&-q)\r\n\r\n\r\ninput=sys.stdin.readline\r\ndef main():\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n for i in range(n):\r\n arr[i]=(arr[i],i)\r\n arr.sort(key=lambda x:x[0],reverse=True)\r\n\r\n obj=fen_tree(n)\r\n gre_before=[0 for i in range(n)]\r\n for _,i in arr:\r\n gre_before[i]=obj.query(i)\r\n obj.update(i+1,1)\r\n\r\n res=0\r\n obj2=fen_tree(n)\r\n for _,i in arr[::-1]:\r\n res+=(obj2.query(n-i-1)*gre_before[i])\r\n obj2.update(n-i,1)\r\n\r\n sys.stdout.write(str(res)+'\\n')\r\n\r\n\r\nmain() ", "def inlt():\r\n return(list(map(int,input().split())))\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom math import sqrt, ceil,floor,factorial,log,log2\r\nfrom bisect import bisect_left , bisect_right\r\nfrom io import BytesIO, IOBase, StringIO\r\nfrom heapq import merge\r\ninput = lambda : sys.stdin.readline().rstrip()\r\nt=int(input())\r\nlis=inlt()\r\ndic=defaultdict(int)\r\nfor j in range(0,t):\r\n if not dic[lis[j]]:\r\n dic[lis[j]]=j+1\r\nx=sorted(lis)\r\nnew=[dic[j] for j in x]\r\nbit=[0]*(len(new)+1)\r\ndef update(ind):\r\n while ind<len(bit):\r\n bit[ind]+=1\r\n ind+= ind & (-ind)\r\ndef rang(ind):\r\n ans=0\r\n while ind>0:\r\n ans+=bit[ind]\r\n ind-=ind & (-ind)\r\n return ans\r\nleft=[]\r\nright=[]\r\nfor j in new:\r\n left.append(rang(len(new)) - rang(j))\r\n update(j)\r\nbit=[0]*(len(new)+1)\r\nfor j in range(len(new)-1,-1,-1):\r\n right.append(rang(new[j]-1))\r\n update(new[j])\r\nright.reverse()\r\nans=0\r\nfor j in range(0,len(left)):\r\n ans=ans+left[j]*right[j]\r\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef fenwick_tree(n):\r\n tree = [0] * (n + 1)\r\n return tree\r\n\r\ndef get_sum(i):\r\n s = 0\r\n while i > 0:\r\n s += tree[i]\r\n i -= i & -i\r\n return s\r\n\r\ndef add(i, x):\r\n while i <= n:\r\n tree[i] += x\r\n i += i & -i\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = dict()\r\nb = list(set(a))\r\nb.sort()\r\nfor i in range(len(b)):\r\n d[b[i]] = i + 1\r\nfor i in range(n):\r\n a[i] = d[a[i]]\r\nn = len(b) + 1\r\ntree = fenwick_tree(n)\r\nc = [0] * len(a)\r\nfor i in range(len(a)):\r\n u = n - a[i]\r\n c[i] += get_sum(u - 1)\r\n add(u, 1)\r\nans = 0\r\ntree = fenwick_tree(n)\r\nfor i in range(len(a) - 1, -1, -1):\r\n u = a[i]\r\n ans += get_sum(u - 1) * c[i]\r\n add(u, 1)\r\nprint(ans)", "from sys import stdin\r\n\r\n\r\nclass order_tree:\r\n def __init__(self, n):\r\n self.tree, self.n = [[0, 0] for _ in range(n << 1)], n\r\n\r\n # get interval[l,r)\r\n def query(self, r, col):\r\n res = 0\r\n l = self.n\r\n r += self.n\r\n\r\n while l < r:\r\n if l & 1:\r\n res += self.tree[l][col]\r\n l += 1\r\n\r\n if r & 1:\r\n r -= 1\r\n res += self.tree[r][col]\r\n\r\n l >>= 1\r\n r >>= 1\r\n\r\n return res\r\n\r\n def update(self, ix, val, col):\r\n ix += self.n\r\n\r\n # set new value\r\n self.tree[ix][col] += val\r\n\r\n # move up\r\n while ix > 1:\r\n self.tree[ix >> 1][col] = self.tree[ix][col] + self.tree[ix ^ 1][col]\r\n ix >>= 1\r\n\r\n\r\ndef fast3():\r\n import os, sys, atexit\r\n from io import BytesIO\r\n sys.stdout = BytesIO()\r\n _write = sys.stdout.write\r\n sys.stdout.write = lambda s: _write(s.encode())\r\n atexit.register(lambda: os.write(1, sys.stdout.getvalue()))\r\n return BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\ninput = fast3()\r\nn, a = int(input()), [int(x) for x in input().split()]\r\ntree, ans = order_tree(n), 0\r\nmem = {i: j for j, i in enumerate(sorted(a))}\r\n\r\nfor i in range(n - 1, -1, -1):\r\n cur = mem[a[i]]\r\n ans += tree.query(cur, 1)\r\n tree.update(cur, 1, 0)\r\n tree.update(cur, tree.query(cur, 0), 1)\r\n\r\nprint(ans)\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n_print = print\r\nBUFSIZE = 8192\r\n\r\n\r\ndef dbg(*args, **kwargs):\r\n _print('\\33[95m', end='')\r\n _print(*args, **kwargs)\r\n _print('\\33[0m', end='')\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\n# from ACgenerator.Y_Testing import get_code\r\n# 2020/12/5\r\nclass FenwickTree:\r\n def __init__(self, x: list):\r\n \"\"\" transform list into BIT \"\"\"\r\n self.bit = x\r\n for i in range(len(x)):\r\n j = i | (i + 1)\r\n if j < len(x):\r\n x[j] += x[i]\r\n\r\n def update(self, idx, x):\r\n \"\"\" updates bit[idx] += x \"\"\"\r\n while idx < len(self.bit):\r\n self.bit[idx] += x\r\n idx |= idx + 1\r\n\r\n def query(self, end):\r\n \"\"\" calc sum(bit[:end]) \"\"\"\r\n x = 0\r\n while end:\r\n x += self.bit[end - 1]\r\n end &= end - 1\r\n return x\r\n\r\n def findkth(self, k):\r\n \"\"\"\r\n Find largest idx such that sum(x[:idx]) <= k\r\n all of the element in x have to be non-negative\r\n \"\"\"\r\n idx = -1\r\n for d in reversed(range(len(self.bit).bit_length())):\r\n right_idx = idx + (1 << d)\r\n if right_idx < len(self.bit) and k >= self.bit[right_idx]:\r\n idx = right_idx\r\n k -= self.bit[idx]\r\n return idx + 1\r\n\r\n\r\ndef discretization(iterable):\r\n \"\"\"[1, 2, 4, 2, 5] -> [0, 1, 2, 1, 3]\"\"\"\r\n iterable = tuple(iterable)\r\n restore = sorted(frozenset(iterable))\r\n return list(map(dict(zip(restore, range(len(restore)))).__getitem__, iterable))\r\n\r\n\r\ndef inversion(iterable, discretized=False):\r\n \"\"\"\r\n the number of j s.t (a[i] > a[j]) and (i < j) for each i\r\n Example:\r\n inversion([2, 3, 4, 2, 1])\r\n [1, 2, 2, 1, 0]\r\n \"\"\"\r\n if not discretized:\r\n iterable = discretization(iterable)\r\n index = len(iterable)\r\n fen = FenwickTree([0] * index)\r\n result = [0] * index\r\n for item in reversed(iterable):\r\n index -= 1\r\n result[index] = fen.query(item)\r\n fen.update(item, 1)\r\n return result\r\n\r\n\r\n# ############################## main\r\ndef main():\r\n n = itg()\r\n arr = discretization(mpint())\r\n inv1 = inversion(arr, True)\r\n inv2 = inversion([-a for a in arr[::-1]])[::-1]\r\n print(sum([inv2[i] * inv1[i] for i in range(1, n - 1)]))\r\n\r\n\r\nDEBUG = 0\r\nURL = 'https://codeforces.com/contest/61/problem/E'\r\n\r\nif __name__ == '__main__':\r\n # 0: normal, 1: runner, 2: debug, 3: interactive\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 != 2:\r\n dbg = lambda *args, **kwargs: ...\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n if DEBUG == 3:\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", "def and_i(i):\r\n return i & (i + 1)\r\n\r\ndef or_i(i):\r\n return i | (i + 1)\r\n\r\n\r\nclass Tree:\r\n def __init__(self, n):\r\n self.n = n\r\n self.tree = [0] * n\r\n\r\n def get_sum(self, i):\r\n ans = 0\r\n while i >= 0:\r\n ans += self.tree[i]\r\n i = and_i(i) - 1\r\n return ans\r\n\r\n def update_tree(self, i, x=1):\r\n while i < self.n:\r\n self.tree[i] += x\r\n i = or_i(i)\r\n\r\n\r\nn = int(input())\r\nheights = list(map(int, input().split()))\r\npos = {x: i for i, x in enumerate(heights)}\r\nfor ind, x in enumerate(sorted(heights, reverse=True)):\r\n heights[pos[x]] = ind\r\ntree1 = Tree(n)\r\ntree2 = Tree(n)\r\ncount = 0\r\nfor h in heights:\r\n count += tree2.get_sum(h - 1)\r\n tree1.update_tree(h)\r\n v = tree1.get_sum(h - 1)\r\n tree2.update_tree(h, v)\r\nprint(count)", "from heapq import heapify, heappop, heappush\r\nfrom math import sqrt,ceil\r\nimport os\r\nimport sys\r\nfrom collections import defaultdict,deque\r\nfrom io import BytesIO, IOBase\r\n# prime = [True for i in range(5*10**5 + 1)]\r\n# def SieveOfEratosthenes(n):\r\n \r\n# p = 2\r\n# while (p * p <= n):\r\n \r\n# # If prime[p] is not changed, then it is a prime\r\n# if (prime[p] == True):\r\n \r\n# # Update all multiples of p\r\n# for i in range(p ** 2, n + 1, p):\r\n# prime[i] = False\r\n# p += 1\r\n# prime[0]= False\r\n# prime[1]= False\r\n# SieveOfEratosthenes(5*10**5)\r\n# print(sum(el==True for el in prime))\r\n# MOD = 998244353\r\n# nmax = (2*(10**5))+2\r\n \r\n# fact = [1] * (nmax+1)\r\n# for i in range(2, nmax+1):\r\n# fact[i] = fact[i-1] * i % MOD\r\n \r\n# inv = [1] * (nmax+1)\r\n# for i in range(2, nmax+1):\r\n# inv[i] = pow(fact[i], MOD-2, MOD)\r\n \r\n \r\n# def C(n, m):\r\n# return fact[n] * inv[m] % MOD * inv[n-m] % MOD if 0 <= m <= n else 0\r\n \r\n# import sys\r\n# import math\r\n# mod = 10**7+1\r\n \r\n \r\n# LI=lambda:[int(k) for k in input().split()]\r\n# input = lambda: sys.stdin.readline().rstrip()\r\n# IN=lambda:int(input())\r\n# S=lambda:input()\r\n# r=range\r\n \r\n# fact=[i for i in r(mod)]\r\n# for i in reversed(r(2,int(mod**0.5))):\r\n# i=i**2\r\n# for j in range(i,mod,i):\r\n# if fact[j]%i==0:\r\n# fact[j]//=i\r\n \r\nfrom collections import Counter\r\nfrom functools import lru_cache\r\nfrom collections import deque\r\ndef main():\r\n # class SegmentTree:\r\n # def __init__(self, data, default=0, func=max):\r\n # self._default = default\r\n # self._func = func\r\n # self._len = len(data)\r\n # self._size = _size = 1 << (self._len - 1).bit_length()\r\n\r\n # self.data = [default] * (2 * _size)\r\n # self.data[_size:_size + self._len] = data\r\n # for i in reversed(range(_size)):\r\n # self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n\r\n # def __delitem__(self, idx):\r\n # self[idx] = self._default\r\n\r\n # def __getitem__(self, idx):\r\n # return self.data[idx + self._size]\r\n\r\n # def __setitem__(self, idx, value):\r\n # idx += self._size\r\n # self.data[idx] = value\r\n # idx >>= 1\r\n # while idx:\r\n # self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n # idx >>= 1\r\n\r\n # def __len__(self):\r\n # return self._len\r\n\r\n # def query(self, start, stop):\r\n # \"\"\"func of data[start, stop)\"\"\"\r\n # start += self._size\r\n # stop += self._size\r\n # if start==stop:\r\n # return self._default\r\n # res_left = res_right = self._default\r\n # while start < stop:\r\n # if start & 1:\r\n # res_left = self._func(res_left, self.data[start])\r\n # start += 1\r\n # if stop & 1:\r\n # stop -= 1\r\n # res_right = self._func(self.data[stop], res_right)\r\n # start >>= 1\r\n # stop >>= 1\r\n\r\n # return self._func(res_left, res_right)\r\n\r\n # def __repr__(self):\r\n # return \"SegmentTree({0})\".format(self.data)\r\n import bisect,math\r\n# ---------------------------------------------------------\r\n import os,sys\r\n from io import BytesIO, IOBase\r\n \r\n class SortedList:\r\n def __init__(self, iterable=None, _load=200):\r\n \"\"\"Initialize sorted list instance.\"\"\"\r\n if iterable is None:\r\n iterable = []\r\n values = sorted(iterable)\r\n self._len = _len = len(values)\r\n self._load = _load\r\n self._lists = _lists = [values[i:i + _load] for i in range(0, _len, _load)]\r\n self._list_lens = [len(_list) for _list in _lists]\r\n self._mins = [_list[0] for _list in _lists]\r\n self._fen_tree = []\r\n self._rebuild = True\r\n \r\n def _fen_build(self):\r\n \"\"\"Build a fenwick tree instance.\"\"\"\r\n self._fen_tree[:] = self._list_lens\r\n _fen_tree = self._fen_tree\r\n for i in range(len(_fen_tree)):\r\n if i | i + 1 < len(_fen_tree):\r\n _fen_tree[i | i + 1] += _fen_tree[i]\r\n self._rebuild = False\r\n \r\n def _fen_update(self, index, value):\r\n \"\"\"Update `fen_tree[index] += value`.\"\"\"\r\n if not self._rebuild:\r\n _fen_tree = self._fen_tree\r\n while index < len(_fen_tree):\r\n _fen_tree[index] += value\r\n index |= index + 1\r\n \r\n def _fen_query(self, end):\r\n \"\"\"Return `sum(_fen_tree[:end])`.\"\"\"\r\n if self._rebuild:\r\n self._fen_build()\r\n \r\n _fen_tree = self._fen_tree\r\n x = 0\r\n while end:\r\n x += _fen_tree[end - 1]\r\n end &= end - 1\r\n return x\r\n \r\n def _fen_findkth(self, k):\r\n \"\"\"Return a pair of (the largest `idx` such that `sum(_fen_tree[:idx]) <= k`, `k - sum(_fen_tree[:idx])`).\"\"\"\r\n _list_lens = self._list_lens\r\n if k < _list_lens[0]:\r\n return 0, k\r\n if k >= self._len - _list_lens[-1]:\r\n return len(_list_lens) - 1, k + _list_lens[-1] - self._len\r\n if self._rebuild:\r\n self._fen_build()\r\n \r\n _fen_tree = self._fen_tree\r\n idx = -1\r\n for d in reversed(range(len(_fen_tree).bit_length())):\r\n right_idx = idx + (1 << d)\r\n if right_idx < len(_fen_tree) and k >= _fen_tree[right_idx]:\r\n idx = right_idx\r\n k -= _fen_tree[idx]\r\n return idx + 1, k\r\n \r\n def _delete(self, pos, idx):\r\n \"\"\"Delete value at the given `(pos, idx)`.\"\"\"\r\n _lists = self._lists\r\n _mins = self._mins\r\n _list_lens = self._list_lens\r\n \r\n self._len -= 1\r\n self._fen_update(pos, -1)\r\n del _lists[pos][idx]\r\n _list_lens[pos] -= 1\r\n \r\n if _list_lens[pos]:\r\n _mins[pos] = _lists[pos][0]\r\n else:\r\n del _lists[pos]\r\n del _list_lens[pos]\r\n del _mins[pos]\r\n self._rebuild = True\r\n \r\n def _loc_left(self, value):\r\n \"\"\"Return an index pair that corresponds to the first position of `value` in the sorted list.\"\"\"\r\n if not self._len:\r\n return 0, 0\r\n \r\n _lists = self._lists\r\n _mins = self._mins\r\n \r\n lo, pos = -1, len(_lists) - 1\r\n while lo + 1 < pos:\r\n mi = (lo + pos) >> 1\r\n if value <= _mins[mi]:\r\n pos = mi\r\n else:\r\n lo = mi\r\n \r\n if pos and value <= _lists[pos - 1][-1]:\r\n pos -= 1\r\n \r\n _list = _lists[pos]\r\n lo, idx = -1, len(_list)\r\n while lo + 1 < idx:\r\n mi = (lo + idx) >> 1\r\n if value <= _list[mi]:\r\n idx = mi\r\n else:\r\n lo = mi\r\n \r\n return pos, idx\r\n \r\n def _loc_right(self, value):\r\n \"\"\"Return an index pair that corresponds to the last position of `value` in the sorted list.\"\"\"\r\n if not self._len:\r\n return 0, 0\r\n \r\n _lists = self._lists\r\n _mins = self._mins\r\n \r\n pos, hi = 0, len(_lists)\r\n while pos + 1 < hi:\r\n mi = (pos + hi) >> 1\r\n if value < _mins[mi]:\r\n hi = mi\r\n else:\r\n pos = mi\r\n \r\n _list = _lists[pos]\r\n lo, idx = -1, len(_list)\r\n while lo + 1 < idx:\r\n mi = (lo + idx) >> 1\r\n if value < _list[mi]:\r\n idx = mi\r\n else:\r\n lo = mi\r\n \r\n return pos, idx\r\n \r\n def add(self, value):\r\n \"\"\"Add `value` to sorted list.\"\"\"\r\n _load = self._load\r\n _lists = self._lists\r\n _mins = self._mins\r\n _list_lens = self._list_lens\r\n \r\n self._len += 1\r\n if _lists:\r\n pos, idx = self._loc_right(value)\r\n self._fen_update(pos, 1)\r\n _list = _lists[pos]\r\n _list.insert(idx, value)\r\n _list_lens[pos] += 1\r\n _mins[pos] = _list[0]\r\n if _load + _load < len(_list):\r\n _lists.insert(pos + 1, _list[_load:])\r\n _list_lens.insert(pos + 1, len(_list) - _load)\r\n _mins.insert(pos + 1, _list[_load])\r\n _list_lens[pos] = _load\r\n del _list[_load:]\r\n self._rebuild = True\r\n else:\r\n _lists.append([value])\r\n _mins.append(value)\r\n _list_lens.append(1)\r\n self._rebuild = True\r\n \r\n def discard(self, value):\r\n \"\"\"Remove `value` from sorted list if it is a member.\"\"\"\r\n _lists = self._lists\r\n if _lists:\r\n pos, idx = self._loc_right(value)\r\n if idx and _lists[pos][idx - 1] == value:\r\n self._delete(pos, idx - 1)\r\n \r\n def remove(self, value):\r\n \"\"\"Remove `value` from sorted list; `value` must be a member.\"\"\"\r\n _len = self._len\r\n self.discard(value)\r\n if _len == self._len:\r\n raise ValueError('{0!r} not in list'.format(value))\r\n \r\n def pop(self, index=-1):\r\n \"\"\"Remove and return value at `index` in sorted list.\"\"\"\r\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\r\n value = self._lists[pos][idx]\r\n self._delete(pos, idx)\r\n return value\r\n \r\n def bisect_left(self, value):\r\n \"\"\"Return the first index to insert `value` in the sorted list.\"\"\"\r\n pos, idx = self._loc_left(value)\r\n return self._fen_query(pos) + idx\r\n \r\n def bisect_right(self, value):\r\n \"\"\"Return the last index to insert `value` in the sorted list.\"\"\"\r\n pos, idx = self._loc_right(value)\r\n return self._fen_query(pos) + idx\r\n \r\n def count(self, value):\r\n \"\"\"Return number of occurrences of `value` in the sorted list.\"\"\"\r\n return self.bisect_right(value) - self.bisect_left(value)\r\n \r\n def __len__(self):\r\n \"\"\"Return the size of the sorted list.\"\"\"\r\n return self._len\r\n \r\n def __getitem__(self, index):\r\n \"\"\"Lookup value at `index` in sorted list.\"\"\"\r\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\r\n return self._lists[pos][idx]\r\n \r\n def __delitem__(self, index):\r\n \"\"\"Remove value at `index` from sorted list.\"\"\"\r\n pos, idx = self._fen_findkth(self._len + index if index < 0 else index)\r\n self._delete(pos, idx)\r\n \r\n def __contains__(self, value):\r\n \"\"\"Return true if `value` is an element of the sorted list.\"\"\"\r\n _lists = self._lists\r\n if _lists:\r\n pos, idx = self._loc_left(value)\r\n return idx < len(_lists[pos]) and _lists[pos][idx] == value\r\n return False\r\n \r\n def __iter__(self):\r\n \"\"\"Return an iterator over the sorted list.\"\"\"\r\n return (value for _list in self._lists for value in _list)\r\n \r\n def __reversed__(self):\r\n \"\"\"Return a reverse iterator over the sorted list.\"\"\"\r\n return (value for _list in reversed(self._lists) for value in reversed(_list))\r\n \r\n def __repr__(self):\r\n \"\"\"Return string representation of sorted list.\"\"\"\r\n return 'SortedList({0})'.format(list(self))\r\n \r\n\r\n # --------------------------------------------------------------\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n s=SortedList(arr)\r\n p=SortedList([])\r\n ans=0\r\n for el in arr:\r\n s.remove(el)\r\n ind=s.bisect_right(el)\r\n ind1=p.__len__()-p.bisect_right(el)\r\n ans+=ind1*ind\r\n p.add(el)\r\n print(ans)\r\n \r\n \r\n \r\n \r\n# region fastio\r\n \r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._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# endregion\r\n \r\nif __name__ == '__main__':\r\n main()", "# 61E\r\nimport sys\r\n\r\nclass BIT():\r\n def __init__(self, n):\r\n self.n = n\r\n self.tree = [0] * n\r\n \r\n def _F(self, i):\r\n return i & (i + 1)\r\n \r\n def _get_sum(self, r):\r\n '''\r\n sum on interval [0, r]\r\n '''\r\n result = 0\r\n while r >= 0:\r\n result += self.tree[r]\r\n r = self._F(r) - 1\r\n return result\r\n \r\n def get_sum(self, l, r):\r\n '''\r\n sum on interval [l, r]\r\n '''\r\n return self._get_sum(r) - self._get_sum(l - 1)\r\n \r\n def _H(self, i):\r\n return i | (i + 1)\r\n \r\n def add(self, i, value=1):\r\n while i < self.n:\r\n self.tree[i] += value\r\n i = self._H(i)\r\n\r\n# inf = open('input.txt', 'r')\r\n# reader = (line.rstrip() for line in inf)\r\nreader = (line.rstrip() for line in sys.stdin)\r\ninput = reader.__next__\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\n \r\n# inf.close()\r\n\r\npos = {val:i for i, val in enumerate(A)}\r\nfor i, val in enumerate(sorted(A, reverse=True)):\r\n A[pos[val]] = i\r\n# print(A)\r\n \r\nmet = BIT(n)\r\nmetPairs = BIT(n)\r\nans = 0\r\nfor i in A:\r\n ans += metPairs._get_sum(i-1)\r\n met.add(i, 1)\r\n less = met._get_sum(i-1)\r\n metPairs.add(i, less)\r\n \r\nprint(ans)\r\n", "import math\r\n\r\nclass FenwikTree:\r\n def construction(arr):\r\n \"\"\"\r\n param: arr: input array\r\n param: n: size of fenwik tree\r\n return: fenwik tree\r\n \"\"\"\r\n fenwik = [0] + arr[:]\r\n n = len(fenwik)\r\n for i in range(1, n):\r\n j = i + (i & -i)\r\n if j < n:\r\n fenwik[j] += fenwik[i]\r\n\r\n return fenwik\r\n\r\n def updateAdd(fenwik, i, val):\r\n \"\"\"\r\n param: fenwik: fenwik tree\r\n param: i: index to be updated\r\n param: val: value to be added\r\n \"\"\"\r\n i += 1\r\n while i < len(fenwik):\r\n fenwik[i] += val\r\n i += i & -i\r\n\r\n def querySum(fenwik, i):\r\n \"\"\"\r\n param: fenwik: fenwik tree\r\n param: i: index to be queried\r\n return: sum of elements till i (i included); if i == -1, will return 0\r\n \"\"\"\r\n i += 1\r\n ans = 0\r\n while i > 0:\r\n ans += fenwik[i]\r\n i -= i & -i\r\n\r\n return ans \r\n \r\n def rangeSum(fenwik, l, r):\r\n \"\"\"\r\n param: fenwik: fenwik tree\r\n param: l: left index\r\n param: r: right index\r\n return: sum of elements from l to r (both inclusive)\r\n \"\"\"\r\n return FenwikTree.querySum(fenwik, r) - FenwikTree.querySum(fenwik, l-1)\r\n\r\n\r\ndef sol(strength):\r\n convertedStrength = {}\r\n for i, s in enumerate(sorted(strength)):\r\n convertedStrength[s] = i\r\n\r\n n = len(arr)\r\n fenwik = [0]*(n+1)\r\n strongerLeftSide = [0]*n\r\n for i, s in enumerate(strength):\r\n strongerLeftSide[i] = FenwikTree.rangeSum(fenwik, convertedStrength[s], n-1)\r\n FenwikTree.updateAdd(fenwik, convertedStrength[s], 1)\r\n\r\n weakerRightSide = [0]*len(arr) \r\n fenwik = [0]*(len(arr)+1)\r\n for i, s in enumerate(reversed(strength)):\r\n weakerRightSide[n-1-i] = FenwikTree.rangeSum(fenwik, 0, convertedStrength[s])\r\n FenwikTree.updateAdd(fenwik, convertedStrength[s], 1)\r\n \r\n ans = 0\r\n for i in range(len(arr)):\r\n ans += strongerLeftSide[i]*weakerRightSide[i]\r\n \r\n print(ans)\r\n \r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n sol(arr)\r\n\r\n", "import sys\r\ninput=sys.stdin.readline\r\nclass Bit:\r\n def __init__(self, n):\r\n self.size = n\r\n self.tree = [0] * n\r\n def sum(self, i):\r\n s = 0\r\n while i >= 0:\r\n s += self.tree[i]\r\n i = (i & (i+1)) -1\r\n return s\r\n def add(self, i, x=1):\r\n while i < self.size:\r\n self.tree[i] += x\r\n i = (i | (i+1))\r\nn=int(input())\r\na=list(map(int,input().split()))\r\npos={}\r\nfor i,val in enumerate(a):\r\n pos[val]=i\r\nfor i,val in enumerate(sorted(a,reverse=True)):\r\n a[pos[val]]=i\r\nfenwick=Bit(n)\r\npairs=Bit(n)\r\nans=0\r\nfor i in a:\r\n ans+=pairs.sum(i-1)\r\n fenwick.add(i, 1)\r\n less=fenwick.sum(i-1)\r\n pairs.add(i,less)\r\nprint(ans)", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\r\nmod = 1000000007\r\nINF = float('inf')\r\ndef st(): return list(sys.stdin.readline().strip())\r\ndef li(): return list(map(int, sys.stdin.readline().split()))\r\ndef mp(): return map(int, sys.stdin.readline().split())\r\ndef inp(): return int(sys.stdin.readline())\r\ndef pr(n): return sys.stdout.write(str(n)+\"\\n\")\r\ndef prl(n): return sys.stdout.write(str(n)+\" \")\r\n\r\n\r\nif os.path.exists('input.txt'):\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n\r\n\r\ndef update(index, delta):\r\n while index <= n:\r\n BIT[index] += delta\r\n index += index & -index\r\n\r\n\r\ndef query(index):\r\n s = 0\r\n while index > 0:\r\n s += BIT[index]\r\n index -= index & -index\r\n return s\r\n\r\n\r\nn = inp()\r\nl = [0]+li()\r\nx = sorted(l)\r\nd = {x[i]: i for i in range(n+1)}\r\nleft = [0]\r\nright = [0]\r\nBIT = [0]\r\nfor i in range(n+1):\r\n l[i] = d[l[i]]\r\n left.append(0)\r\n right.append(0)\r\n BIT.append(0)\r\nfor i in range(1, n+1):\r\n update(l[i], 1)\r\n left[i] = query(n)-query(l[i])\r\nBIT = [0 for i in range(n+2)]\r\nfor i in range(n, 0, -1):\r\n update(l[i], 1)\r\n right[i] = query(l[i]-1)\r\nans = 0\r\nfor i in range(1, n+1):\r\n ans += left[i]*right[i]\r\npr(ans)\r\n", "# ﷽\r\nfrom bisect import bisect_left, bisect_right, insort\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\nimport math\r\nfrom bisect import bisect_left, bisect_right, insort\r\nfrom typing import Generic, Iterable, Iterator, TypeVar, Union, List\r\nT = TypeVar('T')\r\n\r\nclass SortedMultiset(Generic[T]):\r\n BUCKET_RATIO = 50\r\n REBUILD_RATIO = 170\r\n\r\n def _build(self, a=None) -> None:\r\n \"Evenly divide `a` into buckets.\"\r\n if a is None: a = list(self)\r\n size = self.size = len(a)\r\n bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))\r\n self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]\r\n \r\n def __init__(self, a: Iterable[T] = []) -> None:\r\n \"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)\"\r\n a = list(a)\r\n if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):\r\n a = sorted(a)\r\n self._build(a)\r\n\r\n def __iter__(self) -> Iterator[T]:\r\n for i in self.a:\r\n for j in i: yield j\r\n\r\n def __reversed__(self) -> Iterator[T]:\r\n for i in reversed(self.a):\r\n for j in reversed(i): yield j\r\n \r\n def __len__(self) -> int:\r\n return self.size\r\n \r\n def __repr__(self) -> str:\r\n return \"SortedMultiset\" + str(self.a)\r\n \r\n def __str__(self) -> str:\r\n s = str(list(self))\r\n return \"{\" + s[1 : len(s) - 1] + \"}\"\r\n\r\n def _find_bucket(self, x: T) -> List[T]:\r\n \"Find the bucket which should contain x. self must not be empty.\"\r\n for a in self.a:\r\n if x <= a[-1]: return a\r\n return a\r\n\r\n def __contains__(self, x: T) -> bool:\r\n if self.size == 0: return False\r\n a = self._find_bucket(x)\r\n i = bisect_left(a, x)\r\n return i != len(a) and a[i] == x\r\n\r\n def count(self, x: T) -> int:\r\n \"Count the number of x.\"\r\n return self.index_right(x) - self.index(x)\r\n\r\n def add(self, x: T) -> None:\r\n \"Add an element. / O(√N)\"\r\n if self.size == 0:\r\n self.a = [[x]]\r\n self.size = 1\r\n return\r\n a = self._find_bucket(x)\r\n insort(a, x)\r\n self.size += 1\r\n if len(a) > len(self.a) * self.REBUILD_RATIO:\r\n self._build()\r\n\r\n def discard(self, x: T) -> bool:\r\n \"Remove an element and return True if removed. / O(√N)\"\r\n if self.size == 0: return False\r\n a = self._find_bucket(x)\r\n i = bisect_left(a, x)\r\n if i == len(a) or a[i] != x: return False\r\n a.pop(i)\r\n self.size -= 1\r\n if len(a) == 0: self._build()\r\n return True\r\n\r\n def lt(self, x: T) -> Union[T, None]:\r\n \"Find the largest element < x, or None if it doesn't exist.\"\r\n for a in reversed(self.a):\r\n if a[0] < x:\r\n return a[bisect_left(a, x) - 1]\r\n\r\n def le(self, x: T) -> Union[T, None]:\r\n \"Find the largest element <= x, or None if it doesn't exist.\"\r\n for a in reversed(self.a):\r\n if a[0] <= x:\r\n return a[bisect_right(a, x) - 1]\r\n\r\n def gt(self, x: T) -> Union[T, None]:\r\n \"Find the smallest element > x, or None if it doesn't exist.\"\r\n for a in self.a:\r\n if a[-1] > x:\r\n return a[bisect_right(a, x)]\r\n\r\n def ge(self, x: T) -> Union[T, None]:\r\n \"Find the smallest element >= x, or None if it doesn't exist.\"\r\n for a in self.a:\r\n if a[-1] >= x:\r\n return a[bisect_left(a, x)]\r\n \r\n def __getitem__(self, x: int) -> T:\r\n \"Return the x-th element, or IndexError if it doesn't exist.\"\r\n if x < 0: x += self.size\r\n if x < 0: raise IndexError\r\n for a in self.a:\r\n if x < len(a): return a[x]\r\n x -= len(a)\r\n raise IndexError\r\n\r\n def index(self, x: T) -> int:\r\n \"Count the number of elements < x.\"\r\n ans = 0\r\n for a in self.a:\r\n if a[-1] >= x:\r\n return ans + bisect_left(a, x)\r\n ans += len(a)\r\n return ans\r\n\r\n def index_right(self, x: T) -> int:\r\n \"Count the number of elements <= x.\"\r\n ans = 0\r\n for a in self.a:\r\n if a[-1] > x:\r\n return ans + bisect_right(a, x)\r\n ans += len(a)\r\n return ans\r\nfrom bisect import bisect_left as lower_bound\r\nfrom bisect import bisect_right as upper_bound\r\n\r\n\r\nclass FenwickTree:\r\n def __init__(self, x):\r\n bit = self.bit = list(x)\r\n size = self.size = len(bit)\r\n for i in range(size):\r\n j = i | (i + 1)\r\n if j < size:\r\n bit[j] += bit[i]\r\n\r\n def update(self, idx, x):\r\n \"\"\"updates bit[idx] += x\"\"\"\r\n while idx < self.size:\r\n self.bit[idx] += x\r\n idx |= idx + 1\r\n\r\n def __call__(self, end):\r\n \"\"\"calc sum(bit[:end])\"\"\"\r\n x = 0\r\n while end:\r\n x += self.bit[end - 1]\r\n end &= end - 1\r\n return x\r\n\r\n def find_kth(self, k):\r\n \"\"\"Find largest idx such that sum(bit[:idx]) <= k\"\"\"\r\n idx = -1\r\n for d in reversed(range(self.size.bit_length())):\r\n right_idx = idx + (1 << d)\r\n if right_idx < self.size and self.bit[right_idx] <= k:\r\n idx = right_idx\r\n k -= self.bit[idx]\r\n return idx + 1, k\r\n\r\n\r\nclass SortedList:\r\n block_size = 700\r\n\r\n def __init__(self, iterable=()):\r\n self.macro = []\r\n self.micros = [[]]\r\n self.micro_size = [0]\r\n self.fenwick = FenwickTree([0])\r\n self.size = 0\r\n for item in iterable:\r\n self.insert(item)\r\n\r\n def insert(self, x):\r\n i = lower_bound(self.macro, x)\r\n j = upper_bound(self.micros[i], x)\r\n self.micros[i].insert(j, x)\r\n self.size += 1\r\n self.micro_size[i] += 1\r\n self.fenwick.update(i, 1)\r\n if len(self.micros[i]) >= self.block_size:\r\n self.micros[i:i + 1] = self.micros[i][:self.block_size >> 1], self.micros[i][self.block_size >> 1:]\r\n self.micro_size[i:i + 1] = self.block_size >> 1, self.block_size >> 1\r\n self.fenwick = FenwickTree(self.micro_size)\r\n self.macro.insert(i, self.micros[i + 1][0])\r\n\r\n def pop(self, k=-1):\r\n i, j = self._find_kth(k)\r\n self.size -= 1\r\n self.micro_size[i] -= 1\r\n self.fenwick.update(i, -1)\r\n return self.micros[i].pop(j)\r\n\r\n def __getitem__(self, k):\r\n i, j = self._find_kth(k)\r\n return self.micros[i][j]\r\n\r\n def count(self, x):\r\n return self.upper_bound(x) - self.lower_bound(x)\r\n\r\n def __contains__(self, x):\r\n return self.count(x) > 0\r\n\r\n def lower_bound(self, x):\r\n i = lower_bound(self.macro, x)\r\n return self.fenwick(i) + lower_bound(self.micros[i], x)\r\n\r\n def upper_bound(self, x):\r\n i = upper_bound(self.macro, x)\r\n return self.fenwick(i) + upper_bound(self.micros[i], x)\r\n\r\n def _find_kth(self, k):\r\n return self.fenwick.find_kth(k + self.size if k < 0 else k)\r\n\r\n def __len__(self):\r\n return self.size\r\n\r\n def __iter__(self):\r\n return (x for micro in self.micros for x in micro)\r\n\r\n def __repr__(self):\r\n return str(list(self))\r\n \r\ndef inlst():return [int(i) for i in input().split()]\r\ndef getpf(lst):\r\n tmp=SortedList()\r\n ans=[-1]*n\r\n for i,j in enumerate(lst):\r\n # ans[i]=len(tmp)-bisect_right(tmp,j)\r\n ans[i]=tmp.__len__()-tmp.upper_bound(j)\r\n # insort(tmp,j)\r\n tmp.insert(j)\r\n \r\n return ans\r\ndef getsf(lst):\r\n tmp=SortedList()\r\n ans=[-1]*n\r\n for i in range(n-1,-1,-1):\r\n j=lst[i]\r\n # ans[i]=bisect_right(tmp,j)\r\n ans[i]=tmp.upper_bound(j)\r\n # insort(tmp,j)\r\n tmp.insert(j)\r\n return ans \r\n \r\n\r\ndef solve():\r\n global n\r\n n=int(input())\r\n lst=inlst()\r\n pf=getpf(lst)\r\n sf=getsf(lst)\r\n # print(pf,sf)\r\n tot=0\r\n for i in range(n):\r\n tot+=pf[i]*sf[i]\r\n print(tot)\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n" ]

[ "b,power,mod = 0,3,10**9+7\r\nfor i in range(int(input())-1): b=(power-b)%mod; power=(power*3)%mod\r\nprint(b)", "n=int(input())\r\nMOD=int(1e9+7)\r\nprint(int(((pow(3, n, 4*MOD)+3*pow(-1,n))/4))%MOD)", "\nmod = 10**9+7\nn = int(input())\n\n# A, B, C, D = 0, 0, 0, 1\n# for i in range(1, n+1):\n# new_A = (B + C + D) % mod\n# new_B = (A + C + D) % mod\n# new_C = (A + B + D) % mod\n# new_D = (A + B + C) % mod\n# A, B, C, D = new_A, new_B, new_C, new_D\n\nD, not_D = 1, 0\nfor i in range(1, n+1):\n new_D = (not_D * 3) % mod\n new_not_D = (not_D * 2 + D) % mod\n D, not_D = new_D, new_not_D\nprint(D)\n\n", "# _166e\r\n#####################################################################################################################\r\n\r\nfrom math import ceil, log\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n if n%2:\r\n return ((finalRemainderOf(3, n-1) - 1)*750000006)%1000000007\r\n\r\n return ((finalRemainderOf(3, n) - 1)*250000002 + 1)%1000000007\r\n\r\n\r\ndef finalRemainderOf(base, power):\r\n if not power:\r\n return 1\r\n\r\n p = ceil(log(1000000007, base))\r\n div, rem = divmod(power, p)\r\n return (base**rem%1000000007*finalRemainderOf(base**p%1000000007, div))%1000000007\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n # open('output.txt', 'w').write(main())\r\n", "n=int(input())\r\nmod=1000000007\r\nmul=1\r\nans=0\r\nif n%2!=0:\r\n mul=-mul\r\ns=3\r\nfor i in range(1,n):\r\n ans=(ans+s*mul)%mod\r\n s=(s*3)%mod\r\n # print(ans)\r\n mul=-mul\r\nprint(ans%mod)", "n=int(input());print(250000002*(pow(3,n,1000000007)+3-6*(n%2))%1000000007)", "\nn=int(input())\nprint((pow(3,n,4*10**9+28)+3*(-1)**n)//4)\n\t\t \t \t \t \t \t \t \t\t\t\t", "n = int(input())\r\nif n % 2 == 0:\r\n print((pow(3, n, 4000000028) + 3) // 4)\r\nelse:\r\n print(pow(3, n, 4000000028) // 4)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nm=1000000007\r\nn=int(input())\r\nansa=0\r\nansb=0\r\nansc=0\r\nansd=1\r\ni=0\r\nwhile(i<n):\r\n ansa,ansb,ansc,ansd=(ansb+ansc+ansd)%m,(ansa+ansc+ansd)%m,(ansa+ansb+ansd)%m,(ansa+ansb+ansc)%m\r\n i+=1\r\nansd=ansd%m\r\nif n==1:\r\n print(0)\r\nelse:\r\n print(ansd)", "# https://codeforces.com/contest/4/problem/A\nmod = 10**9+7\nn = int(input())\n\nA, B, C, D = 0, 0, 0, 1\nfor i in range(1, n+1):\n new_A = (B + C + D) % mod\n new_B = (A + C + D) % mod\n new_C = (A + B + D) % mod\n new_D = (A + B + C) % mod\n A, B, C, D = new_A, new_B, new_C, new_D\nprint(D)\n\n", "import sys\r\ninpu = sys.stdin.buffer.readline\r\nprin = sys.stdout.write\r\nmod = int(1e9 + 7)\r\nn = int(inpu())\r\na = [0]*(n + 1)\r\nd = [0]*(n + 1)\r\na[1] = 1\r\nd[1] = 0\r\nfor i in range(2, n + 1):\r\n d[i] = 3*a[i - 1]\r\n a[i] = 2*a[i - 1] + d[i - 1]\r\n d[i] %= mod\r\n a[i] %= mod\r\nprin(str(d[n]) + '\\n')", "\r\nn = int(input())\r\n\r\nABC = [0,1]\r\nD = [0,0]\r\n\r\nindex = 2\r\nwhile index <= n:\r\n ABC[(int)(index%2)] = ((2 * ABC[(int)((index-1)%2)])%1000000007 + D[(int)((index-1)%2)])%1000000007;\r\n D[(int)(index%2)] = ((ABC[(int)((index-1)%2)] + ABC[(int)((index-1)%2)]) % 1000000007 + ABC[(int)((index-1)%2)])%1000000007;\r\n index+=1\r\n\r\n\r\nprint(D[(int)(n%2)])", "'''input\r\n10000000\r\n'''\r\nimport sys\r\nfrom math import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom heapq import *\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n\r\nmod=1000000007\r\nn = getint()\r\nv0=0\r\nv1=1\r\nfor _ in range(n-1):\r\n\told = v0\r\n\tv0 = (3*v1)%mod\r\n\tv1 = (2*v1+old)%mod\r\nprint(v0%mod)", "m=int(1e9+7)\r\n#n=int(1e7+2)\r\n#dp=[0 for i in range(n)]\r\n# dp[1]=0\r\n# dp[2]=3\r\n# for i in range(3,n):\r\n# dp[i+2]=(dp[i+1]*2+dp[i])%m\r\n\r\n# x=int(input())\r\n# print(dp[x])\r\ndp1=0\r\ndp2=3\r\ndp=0\r\nx=int(input())\r\nif x==1:\r\n print(dp1)\r\nelif x==2:\r\n print(3)\r\nelse:\r\n for i in range(3,x+1):\r\n dp=(dp2*2+3*dp1)%m\r\n dp1=dp2\r\n dp2=dp\r\n print(dp)\r\n", "\"\"\"\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\"\"\"\r\n\r\nMOD = 10**9 + 7\r\n\r\ndef matrix_mul(A, B):\r\n\ttemp = [[None]*len(B) for i in range (len(A))]\r\n\tfor i in range (len(A)):\r\n\t\tfor j in range (len(B[0])):\r\n\t\t\tnum = 0\r\n\t\t\tfor k in range (len(A[0])):\r\n\t\t\t\tnum += A[i][k]*B[k][j]\r\n\t\t\t\r\n\t\t\ttemp[i][j] = num % MOD\r\n\r\n\treturn temp\r\n\r\n\r\nA = [\r\n\t[0, 1, 1, 1],\r\n\t[1, 0, 1, 1],\r\n\t[1, 1, 0, 1],\r\n\t[1, 1, 1, 0]\r\n]\r\n\r\nn = int(input())\r\n\r\ndp = [A]\r\n\r\nstart = 1\r\nwhile (start <= n):\r\n\tdp.append(matrix_mul(dp[-1], dp[-1]))\r\n\tstart = 2 * start\r\n\r\n\r\nbin_num = str(bin(n))[2:][::-1]\r\nnew = [\r\n\t[1, 0, 0, 0],\r\n\t[0, 1, 0, 0],\r\n\t[0, 0, 1, 0],\r\n\t[0, 0, 0, 1]\r\n]\r\n\r\nfor i in range(len(bin_num)):\r\n\tif bin_num[i] == '1':\r\n\t\tnew = matrix_mul(new, dp[i])\r\n\r\nprint(new[-1][-1])\r\n\r\n", "MOD = int(1e9+7)\r\n\r\ndef invmod(n):\r\n return pow(n,MOD-2,MOD)\r\n\r\ndef ciclos(n):\r\n return ((pow(3,n,MOD) + (3 if n%2==0 else -3)) *(invmod(4)))%MOD\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n print(ciclos(n))", "\r\ndef main():\r\n n = int(input())\r\n MOD = 1_000_000_007\r\n\r\n res = 0\r\n x = 1\r\n for _ in range(2, n+1):\r\n res = (res + x) * 3\r\n res %= MOD\r\n x *= -1\r\n\r\n print(res)\r\n\r\n\r\ndef input(): return next(test).strip()\r\ndef read_ints(): return [int(c) for c in input().split()]\r\ndef print_lines(lst): print('\\n'.join(map(str, lst)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys\r\n from os import environ as env\r\n if 'COMPUTERNAME' in env and 'L2A6HRI' in env['COMPUTERNAME']:\r\n sys.stdout = open('out.txt', 'w')\r\n sys.stdin = open('in.txt', 'r')\r\n\r\n test = iter(sys.stdin.readlines())\r\n\r\n main()\r\n", "p = 10**9+7\r\nn = int(input()) \r\n# print((3**n + (-1)**(n)*3)//4)\r\nprint(((pow(3,n,4*p) + ((-1)**n)*3)//4)%(10**9+7))", "n=int(input())\r\ndp=[1,1,1,0]\r\nfor i in range(2,n+1):\r\n s=sum(dp)\r\n for j in range(4):dp[j]=(s-dp[j])%int(1e9+7)\r\nprint(dp[3])\r\n", "import sys\r\n#sys.setrecursionlimit(10**7)\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Tetrahedron3():\r\n n = inp()\r\n dp_matrix = []\r\n\r\n for pos_index in range(2):\r\n row = [-1]*(n+1)\r\n dp_matrix.append(row)\r\n \r\n dp_matrix[0][0] = 0\r\n dp_matrix[1][0] = 1\r\n dp_matrix[0][1] = 1\r\n dp_matrix[1][1] = 0\r\n\r\n for steps in range(2,n+1):\r\n dp_matrix[0][steps] = ((2*dp_matrix[0][steps-1]) + (dp_matrix[1][steps-1])) % 1000000007\r\n dp_matrix[1][steps] = (3*dp_matrix[0][steps-1]) % 1000000007\r\n \r\n total_number_ways = dp_matrix[1][n] % 1000000007\r\n print(total_number_ways)\r\n return \r\n\r\nTetrahedron3()", "d, abc, mod = 1, 0, 1000000007\r\nn = int(input())\r\nwhile n > 0:\r\n d, abc = 3 * abc % mod, (2 * abc + d) % mod\r\n n -= 1\r\nprint(d)\r\n", "MOD = int(1e9+7)\n\n\ndef main():\n n = int(input())\n\n ans = (pow(3, n, 4*MOD) + 3 * pow(-1, n)) / 4\n\n print(int(ans%MOD))\n\n\nif __name__ == '__main__':\n main()\n\n\t \t\t\t\t\t\t\t\t \t \t \t\t\t", "\r\nn = int(input())\r\nmod = 10 ** 9 + 7\r\nv, a = 1, 0\r\nfor i in range(1, n + 1):\r\n prev_v = v\r\n v = (3 * a) % mod\r\n a = (prev_v + 2 * a) % mod\r\nprint(v)", "if __name__ == \"__main__\":\r\n Mod = 1000000007\r\n n = int(input())\r\n zD = 1\r\n zABC = 0\r\n\r\n for i in range(1, n+1):\r\n nzD = zABC * 3 % Mod\r\n nzABC = (zABC * 2 + zD) % Mod\r\n zD = nzD\r\n zABC = nzABC\r\n print(zD)", "\"\"\"\nhttps://codeforces.com/problemset/problem/166/E\n\n输入正整数 n(n<=1e7)。\n一只蚂蚁站在一个四面体的某个顶点 D 上，沿着四面体的棱行走。\n输出它走了恰好 n 条棱后，又重新回到顶点 D 的路径数，模 1e9+7 的结果。\n路径中间可以经过 D。\n\n样例：\n输入 2\n输出 3\n解释 有 3 条路径：DAD, DBD, DCD\n\n输入 4\n输出 21\n\"\"\"\n\n\ndef function166E():\n n = int(input())\n mod = 10**9 + 7\n\n\n d = 1 # 初始的时候，经过0条棱，一种方法\n a = 0\n b = 0\n c = 0\n\n for i in range(1, n+1): # 经过i条棱后\n tmp_d = (a + b + c) % mod\n tmp_a = (d + b + c) % mod\n tmp_b = (d + a + c) % mod\n tmp_c = (d + a + b) % mod\n\n a, b, c, d = tmp_a, tmp_b, tmp_c, tmp_d\n \n print(tmp_d % mod)\n \n\n\nif __name__ == '__main__':\n\n function166E()\n", "def solve(n):\r\n\r\n nABC = 0\r\n nD = 1\r\n\r\n for i in range(n):\r\n nABC_ = (nD + (2*nABC)) % 1000000007\r\n nD_ = (3 * nABC) % 1000000007\r\n\r\n nABC = nABC_\r\n nD = nD_\r\n\r\n print(nD)\r\n\r\nn = int(input())\r\nsolve(n)\r\n\r\n", "n=int(input())\r\nM=1000000007\r\na=1\r\ni=0\r\nwhile (i<n-1):\r\n a=(a*3)%M\r\n i+=1\r\nstep=1\r\ncount=1\r\nwhile(step<n):\r\n if (step%2):\r\n count=3*(count-1)\r\n else:\r\n count=3*(count+1)\r\n count=count%M\r\n step+=1\r\nprint((a-count)%M)\r\n", "import math\r\n \r\nmod=10**9+7\r\nn=int(input())\r\n\r\nd = 0\r\nabc = 3\r\n \r\nfor i in range(2,n+1):\r\n d,abc = abc%mod, (3*d+2*abc)%mod\r\n\r\nprint(d%mod)", "b,power,mod=0,3,10**9+7\r\nfor _ in range(int(input())-1):b=(power-b)%mod;power=(power*3)%mod\r\nprint(b)", "m=int(1e9)+7\r\nn=int(input())\r\na,b=1,0\r\nfor i in range(n):\r\n a,b=(b*3)%m,(a+b*2)%m\r\nprint(a)", "n=int(input())\n\n# def mod1(a,mod):\n\n# \treturn a%mod\n\n# def mult(a,b,mod):\n\n# \treturn mod1((mod1(a,mod)*mod1(b,mod)),mod)\n\n# def sumd(a,b,mod):\n\n# \treturn mod1((mod1(a,mod)+mod1(b,mod)),mod)\n\n# def main(n):\n\n# \tprev123 = 0\n# \tprev4 = 1\n# \tfor i in range(1,n+1):\n# \t\tprevx = mod1(prev123,1000000007)\n# \t\tprev123 = sumd(mult(prev123,2,1000000007),prev4,1000000007)\n# \t\tprev4 = mult(prevx,3,1000000007)\n# \tprint(prev4%1000000007)\n\n\nprev123 = 0\nprev4 = 1\nfor i in range(1,n+1):\n\tprevx = prev123%1000000007\n\tprev123 = ((prev123*2)+prev4)%1000000007\n\tprev4 = (prevx*3)%1000000007\nprint(prev4%1000000007)\n", "n=int(input())\r\nm=1000000007\r\nf=0\r\ng=1\r\nfor i in range(1,n):\r\n t=f+0\r\n f=(3*g)%m\r\n g=(2*g+t)%m\r\nprint(f)", "def main():\r\n\tn = int(input())\r\n\r\n\tMOD = 10 ** 9 + 7\r\n\r\n\tABC = 0\r\n\tZ = 1\r\n\r\n\tfor i in range(0, n):\r\n\t\tABC, Z = (2 * ABC + Z) % MOD, (3 * ABC) % MOD\r\n\r\n\tprint(Z)\r\n\t\t\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n=int(input())-1\r\nk=1\r\nr=1000000007\r\ndp=0\r\nfor i in range(n):\r\n dp=(3*k-dp)\r\n k*=3\r\n k%=r\r\nprint(dp%r)", "import math\n\nn = int(input())\nprev = 0\nm = 1000000007\nfor i in range(2, n+1):\n prev = 3*(prev*1 + int(math.cos(i*math.pi))) % m\n\nprint(prev)\n\n", "dp = [1, 0, 0, 0]\r\nmod = 1000000007\r\nn = int(input())\r\nfor i in range(1, n+1):\r\n dp1 = [0, 0, 0, 0]\r\n dp1[0] = ((dp[1] + dp[2])%mod + dp[3])%mod\r\n dp1[1] = ((dp[0] + dp[2])%mod + dp[3])%mod\r\n dp1[2] = ((dp[0] + dp[1])%mod + dp[3])%mod\r\n dp1[3] = ((dp[0] + dp[1])%mod + dp[2])%mod\r\n dp = dp1\r\nprint(dp[0]%mod)\r\n\n# Sat Mar 13 2021 09:39:12 GMT+0300 (Москва, стандартное время)\n", "n=int(input())\r\nmod = 10**9+7\r\nif n==1:\r\n print(0)\r\n\r\nelse: \r\n p,q = 1,0\r\n \r\n for i in range(2,n+1):\r\n r = (2*q+3*p)%mod\r\n p=q\r\n q=r\r\n \r\n print(r%1000000007)", "n = int(input())\r\n\r\na, b, c, d = 1, 0, 0, 0\r\nfor p in range(1, n + 1):\r\n a, b, c, d = b + c + d, a + c + d, a + b + d, a + b + c\r\n if a > 1000000007:\r\n a %= 1000000007\r\n if b > 1000000007:\r\n b %= 1000000007\r\n if c > 1000000007:\r\n c %= 1000000007\r\n if d > 1000000007:\r\n d %= 1000000007\r\nprint(a)", "import os\r\nline_number = 1\r\ncurrent_working_dir = os.getcwd()\r\nmy_local_machine = current_working_dir.find('rachel')\r\n# print(my_local_machine)\r\n\r\ndef myinput():\r\n global line_number, lines, my_local_machine\r\n if line_number == 1:\r\n lines = lines.split('\\n')\r\n\r\n # print(len(lines))\r\n if my_local_machine > 0:\r\n line = lines[line_number]\r\n else:\r\n line = input()\r\n \r\n line_number += 1\r\n return(line)\r\n\r\nlines = '''\r\n2\r\n'''\r\n\r\nn = int(myinput())\r\nmod = (10 ** 9) + 7\r\nx = ((3 * ((-1) ** n)) + pow(3, n, mod * 4))*(1/4)\r\nprint(int(x))", "import sys\r\nimport math\r\nimport collections\r\nfrom heapq import heappush, heappop\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\nn = int(input())\r\nk = 1\r\nans = 0\r\nfor i in range(n - 1):\r\n k *= 3\r\n ans = k - ans\r\n ans = ans % (10 ** 9 + 7)\r\n k = k % (10 ** 9 + 7)\r\nprint(ans)\r\n\r\n\r\n", "MOD = 1000000007\r\nN = 10000002\r\n\r\ndef main():\r\n n = int(input())\r\n dp = [[0] * N for _ in range(2)]\r\n dp[1][0] = 1\r\n\r\n for steps in range(1, N):\r\n dp[1][steps] = (3 * dp[0][steps - 1]) % MOD\r\n dp[0][steps] = (2 * dp[0][steps - 1] + dp[1][steps - 1]) % MOD\r\n\r\n print(dp[1][n])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "mod = 1000000007\r\ndef mult(a, b):\r\n\tres = [[0] * 4 for i in range(4)]\r\n\tfor i in range(4):\r\n\t\tfor j in range(4):\r\n\t\t\tfor k in range(4):\r\n\t\t\t\tres[i][j] += a[i][k] * b[k][j]\r\n\t\t\tres[i][j] %= mod\r\n\treturn res\r\n \r\nn = int(input())\r\na = [[0, 1, 1, 1],\r\n [1, 0, 1, 1],\r\n [1, 1, 0, 1],\r\n [1, 1, 1, 0]]\r\nres = [[1, 0, 0, 0],\r\n [0, 1, 0, 0],\r\n [0, 0, 1, 0],\r\n [0, 0, 0, 1]]\r\nwhile n:\r\n\tif n % 2:\r\n\t\tres = mult(res, a)\r\n\ta = mult(a, a)\r\n\tn //= 2\r\nprint(res[3][3])", "import math\r\nimport sys\r\n#from collections import deque, Counter, OrderedDict, defaultdict\r\n#import heapq\r\n#ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#import bisect\r\n#from bisect import bisect_left,bisect_right\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nmx=10**9+7\r\nn=inp()\r\nstrt=1\r\nprev=0\r\nother=0\r\nfor i in range(n):\r\n prev=strt\r\n strt=(3*other)%mx\r\n other=(2*other+prev)%mx\r\nprint(strt)", "mod = 1000000007\r\nn = int(input())\r\n\r\na = 1\r\nbcd = 0\r\nfor i in range(n):\r\n a, bcd = (\r\n (bcd * 3) % mod,\r\n (2 * bcd + a) % mod\r\n )\r\nprint(a)", "n=int(input())\nc=1\na=True\nfor x in range(n):\n if a:\n c-=1\n c*=3\n else:\n c+=1\n c*=3\n c%=1000000007\n a=not a\nprint(c)", "a,b,power,mod = 1,0,3,10**9+7\r\nfor i in range(1,int(input())+1):\r\n a=b\r\n b=(power-a)%mod\r\n power=(power*3)%mod\r\nprint(a)", "n=int(input())\r\nmod = int(1e9+7)\r\n\r\n#No. of ways to reach top position from this positions in n steps\r\ntop = 1\r\nbottom = 0\r\nwhile n>0:\r\n n -= 1\r\n top, bottom = (3*bottom)%mod, (2*bottom+top)%mod\r\nprint(top)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).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] % mod\r\n c.append(x % mod)\r\n return c\r\n\r\nn = int(input())\r\nmod = pow(10, 9) + 7\r\na = [min(i % 5, 1) for i in range(16)]\r\nx = [i ^ 1 for i in a]\r\np = 1\r\nwhile n:\r\n if n & p:\r\n x = matmul(a, x, 4)\r\n n ^= p\r\n a = matmul(a, a, 4)\r\n p *= 2\r\nans = x[0]\r\nprint(ans)", "MOD = 10**9 + 7\r\n\r\ndef ant_paths(n):\r\n if n == 1:\r\n return 0\r\n else:\r\n num_d = 3\r\n num_nd = 6\r\n for i in range(n-2):\r\n num_d, num_nd = num_nd, ((num_d*3)%MOD + (num_nd*2)%MOD)%MOD\r\n return num_d%MOD\r\n \r\nn = int(input())\r\nprint(ant_paths(n))\r\n", "import sys\nimport math\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\n\n\n# Output for list\n# sys.stdout.write(\" \".join(map(str, final)) + \"\\n\")\n\n# Output for int or str\n# sys.stdout.write(str(best) + \"\\n\")\n\n\ndef solve():\n n = get_int()\n \n d = 0\n a = 1\n\n for i in range(2, n+1):\n tD = (3*a)%(10**9 + 7)\n tA = (d + 2*a)% (10**9 + 7)\n\n d = tD\n a = tA\n \n print(d)\n\n\n\n\n\n\n\n\n\n\n\n\n\nsolve()\n", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\nprevD = 0\r\nprevA = 1\r\nmod = 10**9 + 7\r\nfor i in range(1, n):\r\n curD = (3 * prevA) % mod\r\n curA = prevD + (2 * prevA) % mod\r\n prevA = curA\r\n prevD = curD\r\nstdout.write(str(prevD))", "n = int(input())\r\nm = 10**9 + 7\r\n\r\n# dp = [1,0,0,0]\r\n\r\n# for i in range(n):\r\n# temp = [0,0,0,0]\r\n# for j in range(4):\r\n# sum = 0\r\n# for k in range(4):\r\n# if k!= j:\r\n# sum = (sum + dp[k]) %m\r\n# temp[j] = sum\r\n# dp = temp\r\n\r\n# print(dp[0])\r\n\r\nbs = 0\r\n\r\nadd3 = True\r\nfor i in range(n-1):\r\n bs = (bs*3)%m\r\n if add3:\r\n bs+=3\r\n else:\r\n bs-=3\r\n add3 = not add3\r\n\r\nprint(bs)", "def binpow(a, n):\r\n res = 1\r\n while n != 0:\r\n if n & 1:\r\n res = res * a\r\n a = a * a \r\n n >>=1\r\n return res \r\n\r\nn = int(input())\r\nif n < 2:\r\n print(0)\r\nelse: \r\n s = 0\r\n t = 1\r\n l = 3\r\n for i in range(n - 1):\r\n s = (l - s) % 1000000007\r\n l = (l * 3) % 1000000007\r\n t *= (-1)\r\n print(s) ", "M = 10**9 + 7\r\nN = int(input())\r\nd = 1\r\na = 0\r\nfor i in range(N):\r\n a,d = a*2 + d, a*3\r\n d%=M\r\n a%=M\r\nprint(d)", "n=int(input())\r\na=1\r\nb=0\r\nm=10**9+7\r\nfor i in range(n):\r\n na=(3*b)%m\r\n nb=(2*b+a)%m\r\n a=na\r\n b=nb\r\nprint(na)", "n=int(input())\r\nmod=1000000007\r\nprint(((3*pow(-1,n)+pow(3,n,4*mod))//4)%mod)\r\n", "n=int(input())\r\nabc=1\r\nd=0\r\nM=1000000000+7\r\nfor i in range(n-1):\r\n temp=(2*abc+d)%M\r\n d=(3*abc)%M\r\n abc=temp\r\n\r\nprint(d)", "n = int(input())\r\nmod = 10 ** 9 + 7\r\na, b, c, d = 1, 0, 0, 0\r\nfor i in range(1, n + 1):\r\n a, b, c, d = (b + c + d) % mod, (a + c + d) % mod, (a + b + d) % mod, (a + b + c) % mod\r\n\r\nprint(a)\r\n", "n=int(input())\r\nmod=1000000007\r\ninv=250000002\r\ndef pow(a,n):\r\n if n==1: return a\r\n if n%2==0: return pow(a,n//2)**2%mod\r\n else: return pow(a,n//2)**2*a%mod\r\n# import pdb\r\n# pdb.set_trace()\r\nif n%2==0: \r\n r=((pow(3,n)-9)*inv+3)%mod\r\n print(r)\r\nelse:\r\n r=(pow(3,n)-3)*inv%mod\r\n print(r)\r\n\r\n\r\n\r\n", "n = int(input())\r\nmod = 10**9 + 7 \r\nA = [[0,1,1,1],[1,0,1,1],[1,1,0,1],[1,1,1,0]]\r\ndef multiply(a, b): \r\n \r\n # Creating an auxiliary matrix \r\n # to store elements of the \r\n # multiplication matrix \r\n mul = [[0 for x in range(4)] \r\n for y in range(4)]\r\n for i in range(4): \r\n for j in range(4): \r\n mul[i][j] = 0\r\n for k in range(4): \r\n mul[i][j] = (mul[i][j] + a[i][k] * b[k][j])%mod \r\n \r\n # storing the multiplication \r\n # result in a[][] \r\n return mul \r\ndef power(x, y) : \r\n res = [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]] # Initialize result \r\n \r\n # Update x if it is more \r\n # than or equal to p \r\n \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 = multiply(res,x) \r\n \r\n # y must be even now \r\n y = y >> 1 # y = y/2 \r\n x = multiply(x,x) \r\n \r\n return res \r\n \r\nans = power(A,n)\r\n\r\nprint(ans[3][3])", "L = int(input()) \r\nmod = 10**9 + 7 \r\ndp = [[0,0] for _ in range(2) ] \r\n\r\ndp[0][0] = 1 \r\nfor l in range(1, L + 1):\r\n for curr in range(2):\r\n res = 0 \r\n if curr:\r\n res = 2 * dp[0][1] + dp[0][0] \r\n else:\r\n res = 3 * dp[0][1] \r\n res %= mod \r\n dp[1][curr] = res \r\n dp[0][0] = dp[1][0]\r\n dp[0][1] = dp[1][1]\r\nprint(dp[0][0])", "n = int(input())\r\nmod = int(1e9+7)\r\na,b = 0,1\r\nfor i in range(2,n+1):\r\n a,b = (3*b)%mod,(a+2*b)%mod\r\n\r\nprint(a)\r\n", "mod=pow(10,9)+7\r\nn=int(input())\r\na=1\r\nb=0\r\nfor i in range(1,n+1):\r\n x=(3*b)%mod\r\n y=((2*b)+a)%mod\r\n a=x\r\n b=y\r\nprint(a)", "\r\nn=int(input())\r\nabc=0\r\nd=0\r\npabc=0\r\npd=1\r\nfor i in range(n):\r\n d=(3*pabc) % 1000000007\r\n abc=(2*pabc + pd) % 1000000007\r\n pd=d\r\n pabc=abc\r\nprint(d)\r\n", "n=int(input());m=10**9+7\r\nprint(((pow(3,n,m*4)^2)+2)//4%m)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 26 19:07:34 2020\r\n\r\n@author: marit\r\n\"\"\"\r\n \r\n \r\ndef main():\r\n n_pasos = int(input())\r\n k = 0\r\n \r\n for i in range(2, n_pasos + 1):\r\n if(i%2 == 0):\r\n k = (3*(k + 1))%1000000007\r\n else:\r\n k = (3*(k - 1))%1000000007\r\n \r\n print(k)\r\n \r\n \r\nif __name__ ==\"__main__\":\r\n main()", "from sys import stdin, stdout\r\ndef rd(): return stdin.readline().strip()\r\ndef wtl(x): stdout.write(str(x) + '\\n')\r\n\r\nn = int(rd())\r\nx, y, z, w, a, b, c, d, md = 1, 0, 0, 0, 0, 0, 0, 0, 1000000007\r\nfor i in range(1, n + 1):\r\n a = (y + z + w) % md\r\n b = (x + z + w) % md\r\n c = (x + y + w) % md\r\n d = (x + y + z) % md\r\n x, y, z, w = a, b, c, d\r\nwtl(a)", "import traceback\r\nimport math\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\n\r\n\r\ndef main():\r\n N = int(input())\r\n mod = 10**9+7\r\n dp = [1, 0]\r\n for i in range(N):\r\n nxt = [0, 0]\r\n nxt[1] = (3 * dp[0] + 2*dp[1]) % mod\r\n nxt[0] = dp[1] % mod\r\n dp = nxt\r\n return dp[0]\r\n\r\ntry:\r\n ans = main()\r\n print(ans)\r\nexcept Exception as e:\r\n print(e)\r\n traceback.print_exc()", "n = int(input())\nmod = (10 ** 9) + 7\nx = ((3 * ((-1) ** n)) + pow(3, n, mod * 4))*(1/4)\nprint(int(x))\n\t\t \t\t\t \t \t \t \t\t \t\t\t \t \t\t\t\t", "MOD = int(1e9+7)\n\nn = int(input())\nans = pow(3, n, 4*MOD) + 3 * pow(-1, n)\nprint((ans// 4) % MOD)\n\n\t \t\t \t \t\t \t \t\t\t\t \t\t\t", "n=int(input())\nprint(3*250000002*(pow(3,n-1,1000000007)-(-1)**(n-1))%1000000007)", "mod = 1000000007\ndef paths(n):\n ways = 1\n new = 0\n for i in range(n):\n aux = new\n new = ((ways*3)%mod + (aux*2)%mod)%mod\n ways = aux\n return ways\n\nn = int(input())\nprint(paths(n))\n \t \t \t\t \t\t\t \t \t\t\t \t\t \t", "MOD = 10**9 + 7\n \n \ndef mul_mat(A, B):\n n = len(A)\n result = [[0] * n for _ in range(n)]\n for i in range(n):\n for j in range(n):\n for k in range(n):\n result[i][j] = (result[i][j] + A[i][k] * B[k][j]) % MOD\n \n return result\n \n \ndef pow_mat(A, exp):\n n = len(A)\n if exp == 0:\n result = [[0] * n for _ in range(n)]\n for i in range(n):\n result[i][i] = 1\n return result\n elif exp % 2 == 0:\n tmp = pow_mat(A, exp // 2)\n return mul_mat(tmp, tmp)\n else:\n return mul_mat(pow_mat(A, exp - 1), A)\n \n \nn = int(input())\n \nmatrix = [[1] * 4 for _ in range(4)]\nfor i in range(4):\n matrix[i][i] = 0\n \nbig_result = pow_mat(matrix, n)\nprint(big_result[0][0])\n\t\t\t\t \t\t\t\t \t\t\t \t\t \t \t", "import sys\r\nmod=pow(10,9)+7\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nif n==1:print(0)\r\nelse:\r\n pdt,pdnt=0,3\r\n for i in range(n-2):\r\n cdt=pdnt%mod\r\n cdnt=(pdt*3)%mod+(pdnt*2)%mod\r\n pdnt=cdnt%mod\r\n pdt=cdt%mod\r\n sys.stdout.write(str(pdnt%mod)+'\\n')", "n=int(input())\r\nprint((pow(3,n,4000000028)+(-1)**n*3)//4)", "b,power,mod = 0,3,10**9+7\r\nfor i in range(1,int(input())+1):\r\n b=(power-b)%mod\r\n power=(power*3)%mod\r\nprint((power*333333336-b)%mod)", "import sys\r\nimport math\r\nfrom collections import deque\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod = 1000000007\r\n#map(int,input().split())\r\n#int(input())\r\nt=1\r\n\r\nfor _ in range(t):\r\n n=int(input())\r\n dp=[0]*4\r\n dp[0]=1\r\n ans=1\r\n fac=1\r\n for i in range(n):\r\n ans=(fac-ans)%mod\r\n fac=fac*3\r\n if fac>mod:\r\n fac%=mod\r\n print(ans)\r\n", "MOD = 1000000007\r\n\r\ndef matrix_mult(A, B):\r\n C = [[0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0], [0, 0, 0, 0]]\r\n for i in range(4):\r\n for j in range(4):\r\n for k in range(4):\r\n C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % MOD\r\n return C\r\n\r\ndef matrix_power(M, n):\r\n if n == 1:\r\n return M\r\n if n % 2 == 0:\r\n X = matrix_power(M, n // 2)\r\n return matrix_mult(X, X)\r\n else:\r\n X = matrix_power(M, (n - 1) // 2)\r\n return matrix_mult(matrix_mult(X, X), M)\r\n\r\nM = [[0, 1, 1, 1], [1, 0, 1, 1], [1, 1, 0, 1], [1, 1, 1, 0]]\r\nn = int(input().strip())\r\nresult = matrix_power(M, n)[3][3]\r\nprint(result)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nM = 1000000007\r\n\r\na = 1\r\nb = 0\r\nwhile n > 0:\r\n n -= 1\r\n a, b = (3*b)%M, (2*b+a)%M\r\nprint(a)", "n = int(input())\r\nMOD = 1000000007\r\nprint((pow(3, n, MOD) + pow(-1, n, MOD)*3) * pow(4, MOD - 2, MOD) % MOD)", "n = int(input())\r\nm = 1000000007\r\n\r\ndef matMul(a,b):\r\n t = [[0,0],[0,0]]\r\n t[0][0] = ((a[0][0]*b[0][0])%m + (a[0][1]*b[1][0])%m)%m\r\n t[0][1] = ((a[0][0]*b[0][1])%m + (a[0][1]*b[1][1])%m)%m\r\n t[1][0] = ((a[1][0]*b[0][0])%m + (a[1][1]*b[1][0])%m)%m\r\n t[1][1] = ((a[1][0]*b[0][1])%m + (a[1][1]*b[1][1])%m)%m\r\n\r\n return t\r\n\r\n\r\ndef matPow(mat,pow):\r\n if pow==1:\r\n return mat\r\n if pow%2==0:\r\n val = matPow(mat,pow//2)\r\n return matMul(val,val)\r\n else:\r\n val=matPow(mat,pow-1)\r\n return matMul(val,mat)\r\n\r\n\r\n\r\nx = [[0,3],[1,2]]\r\n\r\ny = matPow(x,n)\r\n\r\nprint(y[0][0])\r\n\r\n", "MOD = 10 ** 9 + 7\n\n\ndef mul(a, b):\n n = len(a)\n m = len(a[0])\n l = len(b[0])\n assert m == len(b)\n res = []\n for r in range(n):\n row = []\n for c in range(l):\n row.append(sum(a[r][i] * b[i][c] % MOD for i in range(m)) % MOD)\n res.append(row)\n return res\n\n\ndef power(a, e):\n if e == 1:\n return a\n if e % 2 == 0:\n return power(mul(a, a), e // 2)\n else:\n return mul(power(mul(a, a), e // 2), a)\n\n\ndef solve(n):\n m = [\n [0, 1, 1, 1],\n [1, 0, 1, 1],\n [1, 1, 0, 1],\n [1, 1, 1, 0]\n ]\n x = power(m, n)\n return x[0][0]\n\n\nn = int(input())\nprint(solve(n))", "global val\r\nval=1000000007\r\ndef mm(list1,list2):\r\n a1=list1[0][0]\r\n a2=list1[0][1]\r\n a3=list1[1][0]\r\n a4=list1[1][1]\r\n a5=list2[0][0]\r\n a6=list2[0][1]\r\n a7=list2[1][0]\r\n a8=list2[1][1]\r\n b1=(a1*a5+a2*a7)%val\r\n b2=(a1*a6+a2*a8)%val\r\n b3=(a3*a5+a4*a7)%val\r\n b4=(a3*a6+a4*a8)%val\r\n return [[b1,b2],[b3,b4]]\r\nMatrix=[[2,3],[1,0]]\r\ndef Matrixe(M,n):\r\n if n==1:\r\n return M\r\n elif n%2==0:\r\n return Matrixe(mm(M,M),n//2)\r\n else:\r\n return mm(Matrixe(mm(M,M),n//2),M)\r\n \r\nx=int(input())\r\nif x == 1:\r\n print(0)\r\nelse:\r\n print(Matrixe(Matrix,x-1)[0][1])", "MOD = 1000000007\r\nn = int(input())\r\n\r\nprint((pow(3, n, 4*MOD) + 3*pow(-1,n))//4%MOD)\r\n\r\n", "\r\nn=int(input())-1\r\nif n==0:\r\n print(0)\r\n exit()\r\n#exit()\r\ndef mult(a,b):\r\n\t\tdp=[[0 for i in range(len(b[0]))]for i in range(len(a))]\r\n\t\tfor i in range(len(a)):\r\n\t\t for j in range(len(b[0])):\r\n\t\t for k in range(len(a[0])):\r\n\t\t dp[i][j]+=(a[i][k]*b[k][j])%(10**9+7)\r\n\t\treturn dp\r\npower=n \r\nbase=[[0,1,1,1],[1,0,1,1],[1,1,0,1],[1,1,1,0]]\r\nres=[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]\r\nwhile power!=1:\r\n\t\tif power%2==0:\r\n\t\t base=mult(base,base)\r\n\t\t power=power//2\r\n\t\telif power%2==1:\r\n\t\t power=power-1\r\n\t\t res=mult(res,base)\r\nans=mult(res,base)\r\n#print(ans)\r\n#print(ans)\r\nans=mult(ans,[[0],[1],[1],[1]])\r\n#print(ans)\r\nprint(ans[0][0]%(10**9+7))", "n= int(input().strip())\r\nif n%2 == 0:\r\n print(((3 + pow(3,n,10**9 + 7))* (25*(10**7)+2))%(10**9 + 7))\r\nelse : print (((-3 + pow(3,n,10**9 + 7)) * (25*(10**7)+2))%(10**9 + 7))", "n = int(input())\nm = int(1e9 + 7)\na, b = 0, 3\nn -= 2\n\nwhile n > 0:\n n -= 1\n a, b = b, (3 * a + 2 * b) % m\n\nif n < 0:\n print(a)\nelse:\n print(b)\n\t \t \t\t \t\t \t\t\t\t\t \t \t\t \t", "\r\nn=int(input())\r\nif n==0 or n==1:\r\n print(0)\r\n exit()\r\nbase=[[0,1,1,1],[1,0,1,1],[1,1,0,1],[1,1,1,0]]\r\npower=n\r\nidentity=[[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]\r\n\r\ndef recr(matrix1,matrix2):\r\n matrix=[[0 for i in range(len(matrix2[0]))]for i in range(len(matrix1))]\r\n #print(matrix)\r\n for i in range(len(matrix1)):\r\n for j in range(len(matrix2[0])):\r\n for k in range(len(matrix2[0])):\r\n matrix[i][j]=(matrix[i][j]+matrix1[i][k]*matrix2[k][j])%(10**9+7)\r\n return matrix\r\nwhile power!=1:\r\n if power%2==0:\r\n power=power//2\r\n base=recr(base,base)\r\n \r\n else:\r\n power=power-1\r\n identity=recr(identity,base)\r\nbase=recr(identity,base)\r\n#print(base)\r\nbase=recr(base,[[1],[1],[1],[0]])\r\nprint(base[0][0])", "import sys \n#from math import gcd\n#from bisect import bisect_left, bisect_right\n\nread_line = lambda: sys.stdin.readline().strip()\nread_intmap = lambda: map(int, read_line().split())\n\npmod = int(1e9+7)\ndef testCase():\n memory = {}\n def dp(a,b,n):\n if n == 1:\n return 0 if a == b else 1\n\n x = (a,b,n)\n\n if not x in memory:\n tmp = 0\n for i in 'ABCD':\n n2, n1 = n >> 1, n & 1\n tmp += dp(a,i,n2) * dp(i,b,n2 + n1)\n memory[x] = tmp % pmod\n \n return memory[x]\n\n print(dp('D','D',int(input()) ))\n\nt = 1\n#t = int(input())\nfor i in range(t):\n testCase()\n\n \n", "n=int(input())\r\nm=1000000007\r\nprint(int((pow(3,n,4*m)+3*(-1)**n)/4)%(4*m))", "n = int(input())\n\nmodval = 10**9+7\n\n#val = (((3**n) + (-1)**(n%2) *3) //4 ) % modval \n\nval = ((pow(3,n,modval*4) + (-1)**(n%2)*3)//4) % modval\n\nprint(val)\n", "n = int(input())\r\n\r\na, b = 0, 1\r\n\r\nmod = 1_000_000_007\r\n\r\nfor _ in range(n):\r\n a, b = (2 * a + b) % mod, (3 * a) % mod\r\n\r\nprint(b)", "MOD = 1000000007\r\n\r\ndef matrix_mult(A, B):\r\n C = [[0]*4 for _ in range(4)]\r\n for i in range(4):\r\n for j in range(4):\r\n for k in range(4):\r\n C[i][j] = (C[i][j] + A[i][k]*B[k][j]) % MOD\r\n return C\r\n\r\ndef matrix_pow(A, n):\r\n if n == 1:\r\n return A\r\n elif n % 2 == 0:\r\n B = matrix_pow(A, n//2)\r\n return matrix_mult(B, B)\r\n else:\r\n B = matrix_pow(A, n//2)\r\n C = matrix_mult(B, B)\r\n return matrix_mult(C, A)\r\n\r\ndef count_cycles(n):\r\n M = [[1]*4 for _ in range(4)]\r\n for i in range(4):\r\n M[i][i] = 0\r\n A = matrix_pow(M, n)\r\n return A[0][0]\r\n\r\nn = int(input())\r\nprint(count_cycles(n))", "n=int(input())\r\na,b=1,0\r\nmod=10**9+7\r\nfor i in range(n):\r\n na=(3*b)%mod\r\n nb=(2*b+a)%mod\r\n a=na\r\n b=nb\r\nprint(na)", "\r\nn = int(input())\r\nmod = 10**9+7\r\nd=0\r\nk=1\r\nans=0\r\nfor i in range(2,n+1):\r\n k=(k*3)%mod\r\n ans=(k-ans)%mod\r\nprint(int(ans))", "import sys\r\nimport io, os\r\nimport math\r\ngcd=math.gcd\r\nceil=math.ceil\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n#arr=list(map(int, input().split()))\r\np=(10**9)+7\r\ndef MatMult(a,b):\r\n assert (len(a[0]) == len(b))\r\n c=[[0 for j in range(len(b[0]))] for i in range(len(a))]\r\n for i in range(len(a)):\r\n for j in range(len(b[0])):\r\n for k in range(len(a[0])):\r\n c[i][j]+=a[i][k]*b[k][j]\r\n c[i][j]=c[i][j]%p\r\n return c\r\n# Matrix exponentiation\r\ndef MatExp(l,p):\r\n if(p==1):\r\n return l\r\n if(p%2==1):\r\n return MatMult(l,MatExp(l,p-1))\r\n else:\r\n c=MatExp(l,(p//2))\r\n return MatMult(c,c)\r\ndef main():\r\n n=int(input())\r\n mat=[[0,1,1,1],[1,0,1,1],[1,1,0,1],[1,1,1,0]]\r\n if(n==1):\r\n print(0)\r\n sys.exit()\r\n mat=MatExp(mat,n-1)\r\n print((mat[3][0]+mat[3][1]+mat[3][2])%p)\r\nif __name__ == '__main__':\r\n main()", "\r\n#from sys import stdin,stdout\r\n#input=stdin.readline \r\n#import math,bisect\r\n#from itertools import permutations\r\n#from collections import Counter\r\n\r\n\r\nn=int(input())\r\ndp=[0]*(n+1)\r\nmod=1000000007\r\nif n==1:\r\n\tprint(0)\r\nelif n==2:\r\n\tprint(3)\r\nelif n==3:\r\n\tprint(6)\r\nelse:\r\n\tp2=3\r\n\tp1=6\r\n\tfor i in range(4,n+1):\r\n\t\ttemp=((p2*3)+(p1*2)) %mod\r\n\t\tp2=p1\r\n\t\tp1=temp\r\n\tprint(p1)\r\n\r\n", "#!/usr/bin/env python3\r\n# created : 2021\r\n\r\nfrom sys import stdin, stdout\r\n\r\nMOD = int(1e9+7)\r\n\r\n\r\ndef matMul(A, B):\r\n C = [[0 for i in range(len(B[0]))] for j in range(len(A))]\r\n for i in range(len(A)):\r\n for j in range(len(A[0])):\r\n for k in range(len(B[0])):\r\n C[i][k] += A[i][j] * B[j][k]\r\n C[i][k] %= MOD\r\n return C\r\n\r\n\r\ndef matPower(A, k):\r\n C = [[0 for i in range(len(A))] for j in range(len(A))]\r\n for i in range(4):\r\n C[i][i] = 1\r\n\r\n Base = A\r\n while k:\r\n if k & 1:\r\n C = matMul(Base, C)\r\n Base = matMul(Base, Base)\r\n k //= 2\r\n return C\r\n\r\n\r\ndef solve(tc):\r\n n = int(stdin.readline().strip())\r\n\r\n M = [[1 for j in range(4)] for i in range(4)]\r\n for i in range(4):\r\n M[i][i] = 0\r\n\r\n M = matPower(M, n)\r\n ans = matMul(M, [[0],[0],[0],[1]])\r\n print(ans[3][0])\r\n\r\ntcs = 1\r\ntc = 1\r\nwhile tc <= tcs:\r\n solve(tc)\r\n tc += 1\r\n", "import math\n\ndef power(L,n,p):\n\tif(n==1):\n\t\treturn L\n\telse:\n\t\tA=power(L,n//2,p)\n\t\tif(n%2==0):\n\t\t\treturn multiply(A,A,p)\n\t\telse:\n\t\t\tB=multiply(A,L,p)\n\t\t\treturn multiply(A,B,p)\n\ndef multiply(A,B,p):\n\tl=len(A)\n\tif(len(B)==len(A[0])):\n\t\tm=len(B)\n\t\tn=len(B[0])\n\t\tC=[[0 for i in range(n)]for j in range (l)]\n\t\tfor i in range (0,l):\n\t\t\tfor j in range(0,n):\n\t\t\t\tsum=0\n\t\t\t\tfor k in range(0,m):\n\t\t\t\t\tsum+=(A[i][k]*B[k][j])%p\n\t\t\t\tC[i][j]=sum%p\n\t\treturn C\n\telse:\n\t\treturn \"Invalid Inputs\"\n\n\ndef f(n,p):\n\tif(n==1):\n\t\treturn 0\n\telif(n==2):\n\t\treturn 3\n\telif(n==3):\n\t\treturn 6\n\telse:\n\t\tA=[[2,3],[1,0]]\n\t\tB=power(A,n-3,p)\n\t\treturn (6*B[0][0]+3*B[0][1])%p\n\n\n\nn=int(input())\nprint(f(n,10**9+7))\n \t \t\t\t\t \t\t \t\t \t \t \t \t", "n = int(input())\r\nl = [0]*(n+10)\r\nl[2] = 3\r\nl[3] = 6\r\nfor i in range(4,n+1):\r\n l[i] = 3 * l[i-2] + 2 * l[i-1]\r\n l[i] %= 1000000007\r\nprint(l[n])", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nMOD = 10**9+7\r\nN = int(input())\r\na,b,c,d = 1,0,0,0\r\nfor _ in range(N):\r\n a,b,c,d = (b+c+d)%MOD,(a+c+d)%MOD,(a+b+d)%MOD,(a+b+c)%MOD\r\nprint(a)", "from copy import deepcopy\r\n\r\nmod = 1000000007\r\nn = int(input())\r\n\r\nbase = [\r\n [0, 1, 1, 1],\r\n [1, 0, 1, 1],\r\n [1, 1, 0, 1],\r\n [1, 1, 1, 0]\r\n]\r\n\r\ndef mul(a, b):\r\n sol = [[0 for j in range(4)] for i in range(4)]\r\n \r\n for i in range(4):\r\n for j in range(4):\r\n for k in range(4):\r\n sol[i][j] = (\r\n (sol[i][j] + a[i][k] * b[k][j]) % mod\r\n )\r\n\r\n return sol\r\n\r\n#m = deepcopy(base)\r\n#for i in range(n-1):\r\n# m = mul(m, base)\r\n\r\ndef fast_pow(a, e):\r\n if e == 1:\r\n return a\r\n \r\n if e % 2 == 1:\r\n return mul(fast_pow(a, e-1), a)\r\n else:\r\n tmp = fast_pow(a, e//2)\r\n return mul(tmp, tmp)\r\n\r\nm = fast_pow(base, n)\r\n\r\nprint(m[0][0])\r\n\r\n\r\n", "from os import path\r\nimport sys,time, collections as c , math as m , pprint as p\r\nmaxx , localsys , mod = float('inf'), 0 , int(1e9 + 7) \r\nif (path.exists('input.txt')):\tsys.stdin=open('input.txt','r') ; \tsys.stdout=open('output.txt','w')\r\nn = int(input())\r\na = 3*pow(-1,n) ; b= pow(3, n , 4*mod)\r\nprint((a + b)//4)", "n=int(input())\r\nprint((pow(3,n,4000000028)+((-1)**n)*3)//4)", "n = int(input())\n\n\nmod = 10 ** 9 + 7\nd, a = 1, 0\nfor i in range(1, n + 1):\n prev_d = d\n d = (3 * a) % mod\n a = (prev_d + 2 * a) % mod\n\n\nprint(d)", "mod = 10**9+7\r\nn = int(input())\r\n \r\nprint((pow(3, n, 4*mod) + 3*pow(-1,n))//4%mod)\r\n \r\n", "n=int(input())\r\nlisteD=[-1]*(n+1)\r\nlisteA=[-1]*(n+1)\r\nlisteD[0]=1\r\nlisteA[0]=0\r\nfor i in range(1,n+1):\r\n listeD[i]=(3*listeA[i-1])%1000000007\r\n listeA[i]=(2*listeA[i-1]+listeD[i-1])%1000000007\r\nprint(listeD[n])", "from functools import lru_cache\n\nMOD = 1000000007\n\n@lru_cache(None)\ndef f(p, i):\n if i == 0:\n if p == 0:\n return 1\n else:\n return 0\n\n if p == 0:\n return (f(1, i-1) + f(2, i-1) + f(3, i-1)) % MOD\n if p == 1:\n return (f(0, i-1) + f(2, i-1) + f(3, i-1)) % MOD\n if p == 2:\n return (f(0, i-1) + f(1, i-1) + f(3, i-1)) % MOD\n if p == 3:\n return (f(0, i-1) + f(1, i-1) + f(2, i-1)) % MOD\n\n\nn = int(input())\ndp = [1, 0, 0, 0]\nfor _ in range(n):\n n_dp = [0, 0, 0, 0]\n n_dp[0] = (dp[1] + dp[2] + dp[3]) % MOD\n n_dp[1] = (dp[0] + dp[1] + dp[2]) % MOD\n n_dp[2] = (dp[0] + dp[1] + dp[3]) % MOD\n n_dp[3] = (dp[0] + dp[1] + dp[2]) % MOD\n dp = n_dp\n\nprint(dp[0])\n\n", "import traceback\r\nimport math\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\n\r\n\r\ndef main():\r\n N = int(input())\r\n mod = 10**9+7\r\n dp = [0, 0]\r\n dp[1] = 1\r\n for n in range(1, N+1):\r\n t = dp[1]\r\n dp[1] = (3 * dp[0]) % mod\r\n dp[0] = (2 * dp[0] + t) % mod\r\n return dp[1]\r\n\r\ntry:\r\n ans = main()\r\n print(ans)\r\nexcept Exception as e:\r\n print(e)\r\n traceback.print_exc()", "n = int(input())\r\nmod = 1000000007\r\nprint(int((pow(3, n, 4 * mod) + 3 * (-1)**n) / 4) % (4 * mod))", "n = int(input())\r\na,b = 1,0\r\nmod = 10**9+7\r\npower = 3\r\nfor i in range(1,n+1):\r\n a=b\r\n a%=mod\r\n b=power-a\r\n b%=mod\r\n power*=3\r\n power%=mod\r\nprint(a)", "import sys,random,bisect\r\nfrom collections import deque,defaultdict,Counter\r\nfrom heapq import heapify,heappop,heappush\r\nfrom math import gcd\r\nfrom types import GeneratorType\r\n#from functools import cache 3.9\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\n\r\n\r\nn=ii()\r\n\r\narr=[[0, [0, 0, 0, 1]], [1000000, [266233855, 266233855, 266233855, 266233856]], [2000000, [740458790, 740458790, 740458790, 740458791]], [3000000, [8248929, 8248929, 8248929, 8248930]], [4000000, [882155932, 882155932, \r\n882155932, 882155933]], [5000000, [522227583, 522227583, 522227583, 522227584]], [6000000, [333180769, 333180769, 333180769, 333180770]], [7000000, [286640604, 286640604, 286640604, 286640605]], [8000000, [425892029, 425892029, 425892029, 425892030]], [9000000, [295060536, 295060536, 295060536, 295060537]], [10000000, [192336613, 192336613, 192336613, 192336614]]]\r\n\r\nfor i,a in arr[::-1]:\r\n if i<=n:\r\n n-=i\r\n f=a\r\n break\r\n\r\nfor i in range(n):\r\n t=sum(f)\r\n f[0],f[1],f[2],f[3]=(t-f[0])%mod,(t-f[1])%mod,(t-f[2])%mod,(t-f[3])%mod\r\nprint(f[-1])", "import math\r\n\r\nmod=10**9+7\r\nn=int(input())\r\ng=3;t=3;m=0\r\n\r\nif n==1:print(0)\r\nelse:\r\n for i in range(n-2):\r\n g=g*3%mod\r\n m=t\r\n t=g-m\r\n \r\n print(t%mod)", "n = int(input())\r\nif n == 1:\r\n print(0)\r\n exit(0)\r\nans = 3\r\nfor i in range(3, n + 1):\r\n ans = (3 * ans + (-3 if i % 2 else 3)) % 1000000007\r\nprint(ans % 1000000007)\r\n", "\r\ndef main():\r\n fpp = 0\r\n fp = 0\r\n f = 3\r\n n = int(input())\r\n if n == 1:\r\n print(0)\r\n return\r\n for i in range(3, n + 1):\r\n fpp = fp\r\n fp = f\r\n f = (2 * fp + 3 * fpp) % 1000000007\r\n print(f)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "MOD = 1000000007\nn = int(input())\n\nif n == 0:\n print(1)\nelif n == 1:\n print(0)\nelse:\n on = 0\n off = 3\n spot = 1\n while spot < n:\n temp = off\n off = (on*3)%MOD + (off*2)%MOD\n on = temp%MOD\n spot += 1\n print(on%MOD)\n\n", "n = int(input())\r\na,b = 1,0\r\nfor _ in range(1,n):\r\n c = (2*a+b)%1000000007\r\n b = (3*a)%1000000007\r\n a=c\r\nprint(b)", "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\nN = int(input())\nif N==1:exit(print(0))\ndp = [1,1,1,0]\nmod = 10**9+7\nfor i in range(1,N-1):\n cur = [0,0,0,0]\n cur[0]=(cur[0]+dp[1]+dp[2]+dp[3])%mod\n cur[1]=(cur[1]+dp[0]+dp[2]+dp[3])%mod\n cur[2]=(cur[2]+dp[1]+dp[0]+dp[3])%mod\n cur[3]=(cur[3]+dp[1]+dp[2]+dp[0])%mod\n dp = cur\nprint(sum(dp[:3])%mod)", "n = int(input())\n\nif n == 1:\n print(0)\nelif n == 2:\n print(3)\nelif n == 3:\n print(6)\nelse:\n n1 = 3\n n2 = 6\n\n for i in range(3, n):\n a = (n1 * 3 + n2*2) % 1000000007\n\n n1 = n2\n n2 = a\n\n print(a)\n", "# author: cholebhature lover\r\nfrom collections import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\nimport sys\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip('\\r\\n')\r\n\r\n\r\ndef countPaths(N):\r\n o, a, b, c = 0, 1, 1, 1\r\n i = 0\r\n while i != N-1:\r\n oo, aa, bb, cc = a+b+c, o+b+c, o+c+a, o+a+b\r\n o, a, b, c = oo, aa, bb, cc\r\n o %= 10**9+7\r\n a %= 10**9+7\r\n b %= 10**9+7\r\n c %= 10**9+7\r\n i += 1\r\n return o\r\n\r\n\r\nn = int(input())\r\nprint(countPaths(n))\r\n", "tamanho_requerido = int(input())\n\nmod = (10**9)+7\n\npotencia = pow(3, tamanho_requerido, (mod*4) )\npotencia_mod_bit = (potencia^2) + 2\n\nnum_de_formas = potencia_mod_bit//4\n\nprint(num_de_formas % mod)\n \t \t\t\t\t\t\t \t\t \t \t\t \t \t \t\t\t\t", "n = int(input())\r\nmod = 10**9 + 7\r\n \r\nres = ((pow(3, n, mod) - (-1)**n) * pow(4, -1, mod) + (-1)**n) % mod\r\n\r\nprint(res)\r\n", "mod = 1000000007\r\n\r\n# Returns a m x n matrix with all elements = 0\r\n\r\ndef emptybox ( m , n ) :\r\n\r\n a = []\r\n\r\n for i in range ( 0 , m ) :\r\n\r\n x = []\r\n\r\n for j in range ( 0 , n ) :\r\n\r\n x += [ 0 ]\r\n\r\n a += [ x ]\r\n\r\n return a\r\n\r\n\r\n\r\n# Returns a deep copy of the matrix\r\n\r\ndef copy ( A ) :\r\n\r\n a = []\r\n\r\n for i in range ( 0 , len ( A ) ) :\r\n\r\n x = []\r\n\r\n for j in range ( 0 , len ( A[0] ) ) :\r\n\r\n x += [ A [ i ] [ j ] ]\r\n\r\n a += [ x ]\r\n\r\n return a\r\n\r\n\r\n\r\n# Returns the transpose of the matrix\r\n\r\ndef transpose ( A ) :\r\n\r\n if len ( A ) == 0 :\r\n\r\n return A\r\n\r\n a = emptybox ( len( A [ 0 ] ) , len( A ) )\r\n\r\n for i in range ( 0 , len ( A ) ) :\r\n\r\n for j in range ( 0 , len ( A [ 0 ] ) ) :\r\n\r\n a [ j ] [ i ] = A [ i ] [ j ]\r\n\r\n return a\r\n\r\n\r\n\r\n# Returns a matrix with ith row and jth column removed\r\n\r\ndef trim ( A , icut , jcut ) :\r\n\r\n if len ( A ) == 0 :\r\n\r\n return A\r\n \r\n a = []\r\n\r\n for i in range ( 0 , len ( A ) ) :\r\n\r\n if i == icut :\r\n\r\n continue\r\n\r\n x = []\r\n\r\n for j in range ( 0 , len ( A [ 0 ] ) ) :\r\n\r\n if j == jcut :\r\n\r\n continue\r\n\r\n x += [ A [ i ] [ j ] ]\r\n\r\n a += [ x ]\r\n\r\n return a\r\n\r\n\r\n\r\n# Returns the determinant of the matrix or 'x' if it is not a square matrix\r\n\r\ndef determinant ( A ) :\r\n\r\n if len ( A ) == 0 :\r\n\r\n return 0\r\n\r\n if len ( A ) != len ( A [ 0 ] ) :\r\n\r\n return 'x'\r\n\r\n if len ( A ) == 1 and len ( A [ 0 ] ) == 1 :\r\n\r\n return A [ 0 ] [ 0 ]\r\n\r\n Determinant = 0\r\n\r\n for j in range ( len ( A [ 0 ] ) ) :\r\n\r\n Determinant += ( 1 if j%2 == 0 else -1 ) * A[0][j] * determinant ( trim ( A , 0 , j ) )\r\n\r\n return Determinant\r\n\r\n\r\n\r\n# Returns of the minor matrix of the given matrix\r\n\r\ndef minor ( A ) :\r\n\r\n a = emptybox ( len( A [ 0 ] ) , len( A ) )\r\n\r\n for i in range ( 0 , len ( A ) ) :\r\n\r\n for j in range ( 0 , len ( A [ 0 ] ) ) :\r\n \r\n a [ i ] [ j ] = determinant ( trim ( A , i , j ) )\r\n\r\n return a\r\n\r\n\r\n\r\n# Returns of the cofactor matrix of the given matrix\r\n\r\ndef cofactor ( A ) :\r\n\r\n a = emptybox ( len( A [ 0 ] ) , len( A ) )\r\n\r\n b = minor ( A )\r\n\r\n for i in range ( 0 , len ( A ) ) :\r\n\r\n for j in range ( 0 , len ( A [ 0 ] ) ) :\r\n \r\n a [ i ] [ j ] = ( 1 if ( i + j ) % 2 == 0 else -1 ) * ( b [ i ] [ j ] )\r\n\r\n return a\r\n\r\n\r\n\r\n# Returns of the adjoint matrix of the given matrix\r\n\r\ndef adjoint ( A ) :\r\n\r\n a = cofactor ( A )\r\n\r\n a = transpose ( a )\r\n\r\n return a\r\n \r\n\r\n\r\n# Returns of the adjoint matrix of the given matrix\r\n\r\ndef inverse ( A ) :\r\n\r\n Determinant = determinant ( A )\r\n\r\n if Determinant == 0 :\r\n\r\n return 'X'\r\n\r\n a = adjoint ( A )\r\n\r\n for i in range ( 0 , len ( A ) ) :\r\n\r\n for j in range ( 0 , len ( A [ 0 ] ) ) :\r\n\r\n if a [ i ] [ j ] % Determinant == 0 :\r\n\r\n a [ i ] [ j ] = a [ i ] [ j ] // Determinant\r\n\r\n else :\r\n\r\n a [ i ] [ j ] = a [ i ] [ j ] / Determinant\r\n \r\n return a\r\n\r\n\r\n\r\n# Returns the product of the two given matrices\r\n\r\ndef multiply ( A , B ) :\r\n\r\n if len ( A ) == 0 or len ( B ) == 0 :\r\n\r\n return []\r\n\r\n if len ( A [ 0 ] ) != len ( B ) :\r\n\r\n return 'X'\r\n\r\n a = emptybox ( len ( A ) , len ( B [ 0 ] ) )\r\n\r\n for j in range ( 0 , len ( B [ 0 ] ) ) :\r\n\r\n for i in range ( 0 , len ( A ) ) :\r\n\r\n for h in range ( 0 , len ( A [ 0 ] ) ) :\r\n\r\n a [ i ] [ j ] += A [ i ] [ h ] * B [ h ] [ j ]\r\n \r\n for i in range ( 0 , len ( a ) ) :\r\n \r\n for j in range ( 0 , len ( a [ 0 ] ) ) :\r\n \r\n a[i][j] %= mod\r\n\r\n return a\r\n\r\n\r\n\r\n# Returns the sum of the two given matrices\r\n\r\ndef add ( A , B ) :\r\n\r\n if len ( A ) == 0 or len ( B ) == 0 :\r\n\r\n return []\r\n\r\n if len ( A ) != len ( B ) or len ( A [ 0 ] ) != len ( B [ 0 ] ) :\r\n\r\n return 'X'\r\n\r\n a = emptybox ( len ( A ) , len ( A [ 0 ] ) )\r\n\r\n for i in range ( 0 , len ( A ) ) :\r\n\r\n for j in range ( 0 , len ( A [ 0 ] ) ) :\r\n\r\n a [ i ] [ j ] = A [ i ] [ j ] + B [ i ] [ j ]\r\n \r\n return a\r\n\r\n\r\n\r\n# Returns the difference of the two given matrices\r\n\r\ndef subtract ( A , B ) :\r\n\r\n if len ( A ) == 0 or len ( B ) == 0 :\r\n\r\n return []\r\n\r\n if len ( A ) != len ( B ) or len ( A [ 0 ] ) != len ( B [ 0 ] ) :\r\n\r\n return 'X'\r\n\r\n a = emptybox ( len ( A ) , len ( A [ 0 ] ) )\r\n\r\n for i in range ( 0 , len ( A ) ) :\r\n\r\n for j in range ( 0 , len ( A [ 0 ] ) ) :\r\n\r\n a [ i ] [ j ] = A [ i ] [ j ] - B [ i ] [ j ]\r\n \r\n return a\r\n\r\n\r\nn = int ( input ( ) )\r\n\r\nP = [ [ 0 , 3 ] , [ 1 , 2 ] ]\r\n\r\nA = [ [1] , [0] ]\r\n\r\nmod = 1000000007\r\n\r\ndef power ( P , n ) :\r\n\r\n ans = [ [ 1 , 0 ] , [ 0 , 1 ] ]\r\n \r\n temp = P\r\n\r\n while n :\r\n \r\n if n&1 :\r\n \r\n ans = multiply ( ans , temp )\r\n \r\n n >>= 1\r\n \r\n temp = multiply ( temp , temp )\r\n \r\n return ans\r\n \r\nAns = multiply ( power ( P , n ) , A )\r\n\r\nprint(Ans[0][0])\r\n ", "m=1000000007\r\ndef f(n):\r\n if n%2==0:\r\n ans = (pow(3, n, m) + 3) * pow(4, m - 2, m)\r\n return ans % m\r\n else:\r\n return (pow(3,n,m)-f(n+1))%m\r\nn=int(input())\r\nprint(f(n))", "M = int(10**9 + 7)\r\n\r\nn=int(input())\r\n\r\ndp = [[0]*(n+1) for _ in range(2)]\r\ndp[0][0] = 1\r\nfor i in range(1, n+1):\r\n dp[0][i] = (3*dp[1][i-1] ) % M\r\n dp[1][i] = (2*dp[1][i-1] + dp[0][i-1]) % M\r\n\r\nprint(dp[0][n])\r\n\r\n", "n = int(input())\nm = 1000000007\np = pow(3, n, m)\ni = pow(4, -1, m)\nd = 3 if (n % 2 == 0) else -3\nprint((i * (p + d)) % m)\n", "d = [1, 0]\r\nmod = 10 ** 9 + 7\r\nfor _ in range(int(input())):\r\n d[0], d[1] = d[1], (((d[0] + d[1]) << 1) + d[0]) % mod\r\nprint(d[0])", "n=int(input())\r\ndp=[[0]*(n+1) for i in range(2)]\r\ndp[1][0]=1\r\nh=10**9+7\r\nfor i in range(1,n+1):\r\n dp[1][i]=(3*dp[0][i-1])%h\r\n dp[0][i]=((2*dp[0][i-1])+dp[1][i-1])%h\r\nprint(dp[1][n])\r\n \r\n", "def dp_f(n, M):\r\n\r\n dp = (1, 0)\r\n\r\n for i in range(1, n + 1):\r\n dp = ((dp[-1]) % M, (3 * dp[0] + 2 * dp[-1]) % M)\r\n\r\n return dp[0]\r\n\r\n\r\nn = int(input())\r\nprint(dp_f(n, 10 ** 9 + 7))" ]

[ "n = int(input() )\r\ns = input()\r\n\r\npos = s.find(\"><\")\r\nif pos == -1 :\r\n print(n)\r\nelse :\r\n ans = 0\r\n for i in s :\r\n if i == '>' :\r\n break;\r\n else :\r\n ans += 1;\r\n for i in range(n-1,-1,-1) :\r\n t = s[i]\r\n if t==\"<\" :\r\n break;\r\n else :\r\n ans += 1;\r\n print(ans)", "n = int(input())\r\ns = input()\r\nl = 0\r\npos = 0\r\nfor i in range(len(s)):\r\n if s[i] == '>':\r\n l += 1\r\n if l == 1:\r\n pos = i\r\nr = s.rfind(\"<\")\r\nans = 0\r\nif l > 0 and pos < r:\r\n ans = r - pos + 1\r\nprint(len(s) - ans)\r\n", "n=int(input())\r\ns=input()\r\nx=s.lstrip('<').rstrip('>')\r\nprint(n-len(x))", "a = int(input())\r\nb = input()\r\not = 0\r\nfor i in range(a):\r\n if b[i] == '<' and '>' not in b[:i] or b[i] == '>' and '<' not in b[i + 1:]:\r\n ot += 1\r\nprint(ot)\r\n\r\n", "# your code goes here\r\nimport sys\r\nimport math\r\nx=0\r\nl = int(input())\r\ns=input()\r\ni=0\r\nwhile i<l:\r\n if s[i] == '<':\r\n x+=1\r\n i+=1\r\n else:\r\n i=l\r\ni=l-1\r\nwhile i>=0:\r\n if s[i] == '>':\r\n x+=1\r\n i-=1\r\n else:\r\n i=-1\r\nprint(x)\r\nsys.exit()", "n = int(input())\r\ns = input()\r\nif s[0] != '<' and s[-1] != '>':\r\n print(0)\r\nelif s[0] != '<':\r\n if '<' in s:\r\n print(len(s) - s.rindex('<') - 1)\r\n else:\r\n print(len(s))\r\nelif s[-1] != '>':\r\n if '>' in s:\r\n print(s.index('>'))\r\n else:\r\n print(len(s))\r\nelse:\r\n print(s.index('>') + len(s) - s.rindex('<') - 1)\r\n", "input()\r\ns = input()\r\nn = len(s)\r\nrs = 0\r\nfor i in range(n):\r\n if s[i] == '<':\r\n rs+=1\r\n else:\r\n break\r\nfor i in range(n - 1,-1,-1):\r\n if s[i] =='>':\r\n rs+=1\r\n else:\r\n break\r\nprint(rs)", "#!/bin/python3\n\ndef JumpingBall(n, bumpers):\n #Thus, the answer is the number of '<' bumpers in the beginning plus the number of '>' bumpers in the end.\n leftCount = 0\n rigCount = 0\n isBeginLeft = 1\n isBeginRig = 1\n for i in range(n):\n if isBeginLeft:\n if bumpers[i] == '<':\n leftCount += 1\n else:\n isBeginLeft = 0\n if isBeginRig:\n if bumpers[(n-1)-i] == '>':\n rigCount += 1\n else:\n isBeginRig = 0\n\n \n print(int(leftCount + rigCount))\n\nn = input()\nbumpers = input()\nn = int(n)\nbumpers = str(bumpers)\n\nJumpingBall(n, bumpers)\n", "import math\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n s = input()\r\n counter = 0\r\n i = 0\r\n j = len(s) - 1\r\n while True:\r\n if i >= j:\r\n if i == j:\r\n counter += 1\r\n break\r\n if s[i] == \"<\" and s[j] == \">\":\r\n counter += 2\r\n i += 1\r\n j -= 1\r\n elif s[i] == \"<\" and s[j] ==\"<\":\r\n counter += 1\r\n i += 1\r\n elif s[i] == \">\" and s[j] == \">\":\r\n counter += 1\r\n j -= 1\r\n else:\r\n break\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "n = int(input())\r\ns = input()\r\n\r\nc = ['<', '>']\r\nans = 0\r\nfor j in range(2):\r\n i = 0\r\n while i < n:\r\n if s[i] == c[j]:\r\n i += 1\r\n else:\r\n break\r\n ans += i\r\n s = s[::-1]\r\n\r\nprint(ans)", "def main():\r\n x = int(input())\r\n lst = input()\r\n count = 0\r\n for i in range(len(lst)):\r\n if lst[i] == \">\":\r\n break\r\n count += 1\r\n for i in range(len(lst)-1,-1,-1):\r\n if lst[i] == \"<\":\r\n break\r\n count += 1 \r\n return count\r\nprint(main())\r\n", "n=int(input())\r\nl=input()\r\nans=0\r\nfor i in range(n):\r\n if l[i]==\"<\": ans+=1\r\n else: break\r\nfor i in range(n-1,-1,-1):\r\n if l[i]=='>': ans+=1\r\n else: break\r\nprint(ans)", "n = int(input())\r\nl = input()\r\nans = 0\r\nfor i in range(n):\r\n if l[i] == '<':\r\n ans += 1\r\n else:\r\n break\r\nfor i in range(n - 1, -1, -1):\r\n if l[i] == '>':\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)\r\n", "n = int(input())\r\nstring = input()\r\n\r\nleft = 0\r\nright = 0\r\ni=0\r\nwhile i<n and string[i]==\"<\":\r\n left+=1\r\n i+=1\r\n\r\nj =0\r\nwhile j<n and string[-1-j]==\">\":\r\n right+=1\r\n j+=1\r\n\r\nprint(left+right)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn = input()\r\ns = input()\r\n\r\nans = 0\r\nfor char in s:\r\n if char == \">\":\r\n break\r\n else:\r\n ans += 1\r\n\r\nfor char in s[::-1]:\r\n if char == \"<\":\r\n break\r\n else:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n", "from sys import stdin\nn=int(input())\nli=input()\na = li.find('>')\nb = li.rfind('<')\nif a == -1 or b==-1:\n print(n)\nelse:\n \n print(a+n-b-1)\n ", "def main():\n\tn = int(input())\n\ts = input()\n\tcount = 0\n\ti = 0\n\n\twhile i < n and s[i] == '<' :\n\t\tcount += 1\n\t\ti += 1\n\n\ti = n - 1\n\twhile i > -1 and s[i] == '>':\n\t\tcount += 1\n\t\ti -= 1\n\n\tprint(count)\n\n\nif __name__ == '__main__':\n\tmain()", "n = int(input())\r\n\r\nl = input().lstrip(\"<\").rstrip(\">\")\r\n\r\nprint(n-len(l))\r\n", "n = int(input())\r\np = 0;\r\ns = input()\r\nfor i in range(len(s)):\r\n if s[i] == '<':\r\n p += 1;\r\n else:\r\n break;\r\nfor i in range(len(s)-1, -1, -1):\r\n if s[i] == '>':\r\n p += 1;\r\n else:\r\n break;\r\nprint(p);", "n = int(input());\r\ns = input();\r\n\r\ni = 0;\r\nans = 0;\r\nwhile i < n and s[i] == \"<\":\r\n ans += 1;\r\n i += 1;\r\n\r\ni = n - 1;\r\nwhile i >= 0 and s[i] == \">\":\r\n ans += 1;\r\n i -= 1;\r\n\r\nprint(ans);\r\n", "N = int(input())\r\n\r\nS = input()\r\n\r\nans = 0\r\n\r\ni = 0\r\n\r\nwhile i < N and S[i] == '<':\r\n ans += 1\r\n i += 1\r\n\r\ni = N - 1\r\n\r\nwhile i >= 0 and S[i] == '>':\r\n ans += 1\r\n i -= 1\r\n\r\nprint(ans) ", "n = int(input())\r\ns = input()\r\na, res, c = s[0], 0, 0\r\nfor i in range(n):\r\n if s[i] == '<':\r\n res += 1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if s[i] == '>':\r\n res += 1\r\n else:\r\n break\r\nprint(res)", "n = int(input())\r\na = list(input())\r\nleft = 0\r\nright = 0\r\nfor i in range(0, n):\r\n if (a[i] == '<'):\r\n left += 1\r\n else:\r\n break\r\n\r\nfor i in reversed(range(0, n)):\r\n if (a[i] == '>'):\r\n right += 1\r\n else:\r\n break\r\n\r\nprint(left + right)", "n=int(input())\r\ns=input()\r\nnn=0\r\nwhile nn==0:\r\n\ttry:\r\n\t\tl=s.index(\"><\")\r\n\t\tl1=0\r\n\t\tfor i in range(l+2,len(s)):\r\n\t\t\tif s[i]==\"<\":\r\n\t\t\t\tl1+=1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\tl2=0\r\n\t\tfor i in range(l-1,-1,-1):\r\n\t\t\tif s[i]==\">\":\r\n\t\t\t\tl2+=1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\ts=s[0:l-l2]+s[l+2+l1:]\r\n\texcept:\r\n\t\tbreak\r\nprint(len(s))", "import sys\n\nn = int(sys.stdin.readline())\nfield = sys.stdin.readline()\n\ncount = 0\nfor i in range(n):\n if field[i] == '<':\n count += 1\n else:\n break\nfor i in range(n-1,-1,-1):\n if field[i] == '>':\n count += 1\n else:\n break\n\nprint(count)\n \t\t \t \t \t \t\t \t\t\t\t\t \t \t\t", "n = int(input())\r\n\r\ndaf = input()\r\n\r\ncount = 0\r\n\r\n# kiri\r\n\r\nfor i in range(n):\r\n if daf[i] == '<':\r\n count += 1\r\n else:\r\n break\r\n\r\nfor i in range(n):\r\n if daf[n - i - 1] == '>':\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(count)\r\n", "import math\r\nansw=0\r\nb=input()\r\na=input()\r\ncount_1_total=a.count('<')\r\ncount_2_total=a.count('>')\r\ncount_1=count_2=0\r\nfor i in range(len(a)):\r\n if(a[i] is '<'):\r\n count_1=count_1+1\r\n if(abs(count_1-count_2)>=i+1):\r\n answ=answ+1\r\n elif(a[i] is '>'):\r\n count_2=count_2+1\r\n if(abs((count_1_total-count_1)-(count_2_total-count_2+1)) >= len(a)-i):\r\n answ=answ+1\r\nprint (answ)\r\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ninp = sys.stdin.readline\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn = ii()\r\ns = inp().strip()\r\ncnt = 0\r\nfor bumper in s:\r\n if bumper == \">\":\r\n break\r\n cnt += 1\r\nfor bumper in s[::-1]:\r\n if bumper == \"<\":\r\n break\r\n cnt += 1\r\nprint(cnt)\r\n", "n=int(input())\r\ns=input()\r\nx,y=0,0\r\nfor i in range(n):\r\n if s[i]=='<':\r\n x+=1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if s[i]=='>':\r\n y+=1\r\n else:\r\n break\r\nprint(x+y)", "n = int(input())\r\ns = input().lstrip('<').rstrip('>')\r\nprint(n - len(s))\r\n", "n = int(input())\nletts = input()\ntot = 0\nfor i in range(n):\n if(letts[i]!=\"<\"):\n break\n tot+=1\ncur = tot\nfor i in range(n-cur):\n if letts[n-i-1]!= \">\":\n break\n tot+=1\nprint(tot)\n\n \t \t \t\t \t\t\t \t\t \t \t\t\t \t\t\t", "def pinball(n, s):\r\n result, i = 0, 0\r\n while i < n and s[i] == '<':\r\n result += 1\r\n i += 1\r\n i = n - 1\r\n while i >= 0 and s[i] == '>':\r\n result += 1\r\n i -= 1\r\n return result\r\n\r\n\r\nm = int(input())\r\nt = input()\r\nprint(pinball(m, t))\r\n", "n = int(input())\r\ns = list(input())\r\nl = 0\r\nr = 0\r\np = 0\r\nq = 0\r\nfor i in range(len(s)):\r\n if(s[i]=='>'):\r\n p+=1\r\n break\r\nif(p==0):\r\n l+=n\r\nelse:\r\n l+=i\r\ns.reverse()\r\nfor i in range(len(s)):\r\n if(s[i]=='<'):\r\n q+=1\r\n break\r\nif q==0:\r\n r+=n\r\nelse:\r\n r+=i\r\nprint(l+r)\r\n", "n=int(input())\r\ns=input()\r\ni=0\r\nforwards=[]\r\nc=0\r\nwhile i<n:\r\n if s[i]==\">\":\r\n forwards.append(\">\")\r\n else:\r\n if not forwards:\r\n c+=1\r\n else:\r\n forwards=[]\r\n try:\r\n i+=s[i:].index(\">\")\r\n forwards.append(\">\")\r\n except:\r\n break\r\n i+=1\r\nc+=len(forwards)\r\nprint(c)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn=int(input())\r\ns=[]\r\nr=1\r\nu=0\r\nfor x in input():\r\n if x=='>':\r\n s.append(0)\r\n else:\r\n s.append(1)\r\nfor i in range(n):\r\n r*=s[i]\r\n if r!=0:\r\n u+=1\r\n else:\r\n break\r\nr=1\r\nfor i in range(n):\r\n if s[n-i-1]==0:\r\n r=1\r\n else:\r\n r=0\r\n if r==1:\r\n u+=1\r\n else:\r\n break\r\nprint(u)", "n = int(input())\na = input()\nx = 0\nfor i in a:\n if i == '>':\n break\n x += 1\nfor i in a[::-1]:\n if i == '<':\n break\n x += 1\nprint(x)\n", "n = int(input())\r\ns = input()\r\nresult = 0\r\ni = 0\r\n\r\nwhile i < n and s[i] == '<' :\r\n\tresult += 1\r\n\ti += 1\r\n\r\ni = n - 1\r\nwhile i > -1 and s[i] == '>':\r\n\tresult += 1\r\n\ti -= 1\r\n\r\nprint(result)# 1689256557.4477978", "n = int(input())\nb = str(input().strip())\n\ncount = 0\nleft_end = -1\nfor i in range(len(b)):\n if b[i] == '<':\n count += 1\n left_end = i\n else:\n break\nfor i in range(len(b) - 1, -1, -1):\n if b[i] == '>' and i > left_end:\n count += 1\n else:\n break\nprint(count)\n", "n = int(input())\r\nbumpers = input()\r\n\r\nizquierda = 0\r\nderecha = 0\r\n\r\ni = 0\r\nwhile i < n:\r\n if bumpers[i] == '<':\r\n izquierda = izquierda + 1\r\n else:\r\n break\r\n i = i+1\r\n \r\ni = 0\r\nwhile i < n:\r\n if bumpers[n-i-1] == '>':\r\n derecha = derecha + 1\r\n else:\r\n break\r\n i = i+1\r\n \r\nrespuesta = izquierda+derecha\r\n\r\nprint(respuesta)", "n = int(input())\r\ns = input()\r\nprint(n-len(s.lstrip('<').rstrip('>')))", "n=int(input())\r\ns=input()\r\nk=s.find('><')\r\nwhile k!=-1:\r\n beg=k\r\n end=k+1\r\n while beg>0 and s[beg-1]=='>':\r\n beg-=1\r\n while end<len(s) and s[end]=='<':\r\n end+=1\r\n s=s[:beg]+s[end:]\r\n k=s.find('><')\r\nprint(len(s))", "n=int(input(\"\"))\np=input(\"\")\ni=0\nj=n-1\nans=0\nans=int(ans)\na='<'\nb='>'\nwhile (p[i]==a):\n i=i+1\n if (i == n):\n ans=ans+1\n break\n ans=ans+1\nwhile (p[j]==b):\n j=j-1\n if (j<0):\n ans=ans+1\n break\n ans=ans+1\nprint(ans)", "a = int(input())\nst = [x for x in input()]\ntotal = 0\nj = 0\n\nwhile j <= len(st)-1:\n if st[j] == '<':\n total += 1\n j += 1\n else:\n break\n\nj = len(st)-1\n\nwhile j >= 0:\n if st[j] == '>':\n total += 1\n j -= 1\n else:\n break\n\nprint(total)\n", "n = int(input())\nbumpers = input()\n\nleftCount = 0\nfor n in range(0, len(bumpers)):\n if(bumpers[n] is '<'):\n leftCount += 1\n else:\n break\n\nrightCount = 0\nfor n in range(len(bumpers) - 1, -1, -1):\n if(bumpers[n] is '>'):\n rightCount += 1\n else:\n break\n\nprint(rightCount + leftCount)", "input()\r\nc=list(input())\r\ncount=0\r\nfor i in c:\r\n\tif '>' in i:\r\n\t\tbreak\r\n\tcount+=1\r\nfor i in reversed(c):\r\n\tif '<' in i:\r\n\t\tbreak\r\n\tcount+=1\r\nprint(str(count))", "n = int(input())\r\ns = input()\r\n \r\nind1 = 0; ind2 = n - 1\r\ncont = 0\r\n \r\nwhile (s[ind1] == '<') : \r\n cont+=1\r\n ind1+=1\r\n if (ind1 == n) :\r\n break\r\n \r\nwhile (s[ind2] == '>' and ind2 >= 0) : \r\n cont+=1\r\n ind2-=1\r\n \r\n \r\nprint(cont)", "n = int(input())\ns = input()\n\nresult = 0\nfor ch in s:\n if ch == '<':\n result += 1\n else:\n break\n\nfor ch in s[::-1]:\n if ch == '>':\n result += 1\n else:\n break\n\nprint(result)\n", "import math\r\nimport sys\r\n\r\nn = input()\r\nn = int(n)\r\na = input()\r\n\r\ncount = 0\r\nmcount = 0\r\nfor i in range(n):\r\n if (a[i] == '<'):\r\n count += 1\r\n else :\r\n break \r\n\r\nfor i in range(n-1,-1,-1):\r\n if (a[i] == '>'):\r\n count += 1\r\n else :\r\n break\r\n\r\n\r\nprint (count)", "'''input\n6\n<<><>>\n'''\n\nn = int(input())\ns = input()\n\n\ndef solve():\n off = 0\n for i, c in enumerate(s):\n if c == '>':\n off = i\n break\n else:\n return len(s)\n\n for i, c in enumerate(reversed(s)):\n if c == '<':\n off += i\n break\n else:\n return len(s)\n return off\n\nprint(solve())\n\n", "n=int(input())\r\ns=input()\r\ns=s.lstrip('<')\r\ns=s.rstrip('>')\r\nprint(n-len(s))", "n = int(input())\r\ns = input()\r\npos = None\r\nrights = 0\r\nlefts = 0\r\nfor i in range(n-1):\r\n if s[i] == '>' and s[i+1] == '<':\r\n pos = i\r\n break\r\n elif s[i] == '<':\r\n lefts += 1\r\n\r\nif pos != None:\r\n for i in range(n-1, pos+1, -1):\r\n if s[i] == '<' and s[i-1] == '>':\r\n break\r\n elif s[i] == '>':\r\n rights += 1\r\n\r\n print(lefts+rights)\r\nelse:\r\n print(n)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter, deque\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\ndef solve():\r\n n = inp()\r\n s = insr()\r\n spots = 0\r\n for i in range(n + 1):\r\n if i == n:\r\n spots += n\r\n elif s[i] == \">\":\r\n spots += i\r\n break\r\n for i in range(n - 1, -2, -1):\r\n if i == -1:\r\n spots += n\r\n elif s[i] == \"<\":\r\n spots += n - 1 - i\r\n break\r\n print(spots)\r\n\r\ndef main():\r\n for _ in range(1):\r\n solve()\r\nmain()\r\n", "def solve(x):\n\n if '>' in x:\n s = x.index('>')\n else:\n return len(x)\n \n if '<' in x:\n f = len(x) - x[::-1].index('<') - 1\n else:\n return len(x)\n \n return len(x) - max(0, f - s + 1)\n\n\nn = int(input())\n\nx = input() # STRING\nprint(solve(x))\n\t\t\t\t\t\t \t\t\t\t \t \t\t\t \t \t\t \t\t\t\t", "n = int(input())\r\ns = input()\r\nr = 0\r\nl = 0\r\nans = 0\r\nf = False\r\nif s[0] == '>': r += 1\r\nelse: l += 1 \r\n\r\nfor i in range(1, n):\r\n if s[i] == s[i - 1] == '>':\r\n r += 1\r\n elif s[i] == s[i - 1] == '<':\r\n l += 1\r\n elif s[i] == '>':\r\n if f:\r\n ans += l\r\n l = 0\r\n r += 1\r\n f = False\r\n else:\r\n l = 0\r\n r += 1\r\n else:\r\n ans += r\r\n r = 0\r\n f = True\r\n l += 1\r\n \r\nif f:\r\n ans += l\r\nprint(n - ans)", "import sys\nsize=int(sys.stdin.readline())\nboard=sys.stdin.readline()\nrevboard=board[::-1]\ngood=0\n\nfor i in board:\n if i=='<':\n good+=1\n elif i=='>':\n break\nfor i in revboard:\n if i=='>':\n good+=1\n elif i=='<':\n break\n \nprint(good) \n\t \t\t\t \t\t\t \t \t\t\t\t \t \t \t", "n = int(input())\ns = input()\nans = 0\ni = 0\nwhile i < n and s[i] == \"<\":\n\tans += 1\n\ti += 1\ni = n - 1\nwhile i > -1 and s[i] == \">\":\n\tans += 1\n\ti -= 1\nprint(ans)", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor x in s:\r\n if x == '<':\r\n ans += 1\r\n else:\r\n break\r\n\r\nfor x in s[::-1]:\r\n if x == '>':\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nprint(int(input())-len(input().lstrip('<').rstrip('>')))\n", "n, s = int(input()), input()\r\nif '<' not in s or '>' not in s:\r\n print(n)\r\nelse:\r\n print(s.find('>') + (n - 1 - s.rfind('<')))", "n = int(input())\r\ndata = list(input())\r\ncnt = 0\r\nfor i in range(0, n):\r\n if data[i] == '>':\r\n break\r\n cnt += 1\r\nfor i in range(n - 1, -1, -1):\r\n if data[i] == '<':\r\n break\r\n cnt += 1\r\n\r\nprint(cnt)", "n=int(input())\r\nS=input()\r\nk=0\r\nv=0\r\nd=0\r\nfor i in range(n) :\r\n if S[i]=='<' and v==0 :\r\n k=k+1\r\n else :\r\n v=1\r\n if v==1 and S[i]=='>' :\r\n d=d+1\r\n else :\r\n d=0\r\nprint(d+k)\r\n \r\n", "N = int(input())\r\nlisty = input()\r\ncount = 0\r\nfor x in listy:\r\n\tif x == '<':\r\n\t\tcount += 1\r\n\telse:\r\n\t\tbreak\r\nfor x in listy[::-1]:\r\n\tif x == '>':\r\n\t\tcount += 1\r\n\telse:\r\n\t\tbreak\r\n\r\nprint(count)", "import sys\n\nn = int(input())\na = input()\nif len(set(a)) == 1:\n print(n)\n sys.exit(0)\nres = 0\ni = 0\nwhile i < n and a[i] == '<':\n res += 1\n i += 1\ni = n - 1\nwhile i >= 0 and a[i] == '>':\n res += 1\n i -= 1\nprint(res)\n", "n=int(input())\r\ns=input()\r\nc=0\r\nfor i in s:\r\n if i=='<': c+=1\r\n else: break\r\nfor i in s[::-1]:\r\n if i=='>': c+=1\r\n else: break\r\n\r\nprint(c)", "n = int(input())\r\ns = input().lstrip(\"<\").rstrip(\">\")\r\nprint(n-len(s))", "n = int(input())\ndirections = input()\ntempcount = 0\nfor i in range(n):\n if directions[i]==\"<\":\n tempcount+=1\n else:\n break\nfor i in range(n-1,-1,-1):\n if directions[i]==\">\":\n tempcount+=1\n else:\n break\nprint(tempcount)", "n = int(input())\nv = input()\ncount = 0\nright = 0\nleft = 0\nsecond = 0\nfor i in range(0,len(v)):\n if v[i]=='<' and right==0:\n count+=1\n if v[i] == '<' and right == 1:\n second = 0\n if v[i]=='>' :\n second+=1\n right=1\nprint(max(count+second,0))", "n = int(input())\r\ns = input()\r\nind1 = s.find('>')\r\nind2 = s.rfind('<')\r\n\r\nprint(n if ind1 == -1 or ind2 == -1 else n - (ind2 - ind1 + 1) )", "input()\r\ns = input()\r\nc = 0\r\nfor x in s:\r\n if x == '>': break\r\n c += 1\r\nfor x in s[::-1]:\r\n if x == '<': break\r\n c += 1\r\nprint(c)", "n = int(input())\n\ns = input()\n\nans = 0\n\nfor c in s:\n if c == '<':\n ans += 1\n else:\n break\n\nfor c in reversed(s):\n if c == '>':\n ans += 1\n else:\n break\n\nprint(ans)\n", "#Jumping Ball\nN = int(input())\ncomm = input()\ntot = 0\nfor i in range(N):\n if comm[i] == '<':\n tot += 1\n else:\n break\nfor i in range(N-1,-1,-1):\n if comm[i] == '>':\n tot += 1\n else:\n break\nprint(tot)\n\n\t\t \t\t\t\t\t \t\t\t\t \t \t \t \t", "n = int(input())\r\ns = input()\r\ncnt = 0\r\nfor i in s:\r\n if i != '<': break\r\n cnt += 1\r\nfor i in s[::-1]:\r\n if i != '>': break\r\n cnt += 1\r\nprint(cnt)\r\n", "n=int(input())\r\ns=input()\r\ni=0\r\nc1,c2=0,0\r\nwhile i<n and s[i]==\"<\":\r\n c1+=1\r\n i+=1\r\ni=n-1\r\nwhile i>=0 and s[i]==\">\":\r\n c2+=1\r\n i-=1\r\nprint(c1+c2)\r\n", "n = int(input())\r\ns = input()\r\ncnt = 0\r\nfor i in s:\r\n if i == '<':\r\n cnt += 1\r\n else:\r\n break\r\n\r\nfor i in s[::-1]:\r\n if i == '>':\r\n cnt += 1\r\n else:\r\n break\r\n \r\nprint(cnt)", "n = int(input())\nbumper = input()\ncount = 0\n\nfor i in range(n):\n if bumper[i] == '<':\n count += 1\n else:\n break\n \nfor i in range(n-1, -1, -1):\n if bumper[i] == '>':\n count += 1\n else:\n break\n \nprint(count)\n \t \t \t \t\t\t\t \t \t\t\t\t \t\t", "print(int(input())-len(input().rstrip('>').lstrip('<')))\r\n", "N = int(input())\r\nBumper = input()\r\nChecked = [False for i in range(N)]\r\ni = 0\r\nwhile i < N and Bumper[i] == '<':\r\n Checked[i] = True\r\n i += 1\r\ni = N - 1\r\nwhile i >= 0 and Bumper[i] == '>' and Checked[i] != True:\r\n Checked[i] = True\r\n i -= 1\r\nprint(Checked.count(True))\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: At Grandma's house\r\n# Caption: Start for new exam\r\n# CodeNumber: 592\r\n", "n=int(input())\r\na=input()\r\nb=n\r\nc=n\r\nif \">\" in a:\r\n b=a.index(\">\")\r\nif \"<\" in a:\r\n c=a[::-1].index(\"<\")\r\nprint(b+c)", "n = int(input())\r\nt = input()\r\nd = {\"<\":0,\">\":0}\r\ncount = 0\r\nfor i in range(n):\r\n\tif t[i] == \"<\":\r\n\t\tcount = count + 1\r\n\telse:\r\n\t\tbreak\r\nfor i in range(n-1,-1,-1):\r\n\tif t[i] == \">\":\r\n\t\tcount = count + 1\r\n\telse:\r\n\t\tbreak\r\nprint(count)", "\r\nn=int(input())\r\n\r\ns=input()\r\nb=0\r\nc=0\r\n\r\nif s[0]==\"<\":\r\n\r\n for i in range(n):\r\n if s[i]==\"<\":\r\n b+=1\r\n else:\r\n break\r\n\r\nif s[n-1]==\">\":\r\n \r\n \r\n \r\n i=n-1\r\n while i>-1:\r\n \r\n\r\n if s[i]==\">\":\r\n \r\n c+=1\r\n\r\n else:\r\n \r\n break\r\n i-=1\r\n\r\nprint(b+c)\r\n \r\n\r\n\r\n \r\n \r\n", "__author__ = 'Think'\r\nn=int(input())\r\nbumpers=input()\r\ntotal=0\r\nfor i in bumpers:\r\n\tif i==\"<\":\r\n\t\ttotal+=1\r\n\telse:\r\n\t\tbreak\r\nfor i in reversed(bumpers):\r\n\tif i==\">\":\r\n\t\ttotal+=1\r\n\telse:\r\n\t\tbreak\r\nprint(total)", "n=int(input())\r\na=input()\r\nprint(n-len(a.lstrip('<').rstrip('>')))", "__author__ = 'Alexander'\r\nimport sys\r\nn = int(sys.stdin.readline().strip())\r\na = sys.stdin.readline().strip()\r\ncounter = 0\r\nfor i in range(len(a)):\r\n if a[i] == '<': counter += 1\r\n else: break\r\nfor i in range(1, len(a)+1):\r\n if a[-i] == '>': counter += 1\r\n else: break\r\nsys.stdout.write(str(counter))", "n=int(input())\r\ns=str(input())\r\nans=0\r\nfor i in range(n):\r\n if s[i]==\">\":\r\n break\r\n else:\r\n ans+=1\r\nfor i in range(n-1,-1,-1):\r\n if s[i]==\"<\":\r\n break\r\n else:\r\n ans+=1\r\nprint(ans)", "n,st = int(input()),input()\r\n\r\ni = 0\r\nans = 0\r\nwhile i<n and st[i] == '<':\r\n ans += 1\r\n i += 1\r\n\r\ni = n-1\r\nwhile i>=0 and st[i] == '>':\r\n ans += 1\r\n i -= 1\r\n\r\nprint(ans)\r\n", "n=int(input())\r\ns=input()\r\nans=0\r\ni=0\r\nwhile i<len(s) and s[i]==\"<\":\r\n ans+=1\r\n i+=1\r\ni=len(s)-1\r\nwhile i>=0 and s[i]==\">\":\r\n ans+=1\r\n i-=1\r\nprint(ans)", "from sys import stdin, stdout\n\nn = int(stdin.readline().replace('\\n', ''))\nbumps = list(stdin.readline().replace('\\n', ''))\ntotal = 0\nfor bump in bumps:\n if bump == '<':\n total += 1\n else:\n break\nfor bump in bumps[::-1]:\n if bump == '>':\n total += 1\n else:\n break\nstdout.write(str(total))\n", "n = int(input())\r\na = list(input())\r\nres = 0\r\nleft = 0\r\nright = 0\r\n\r\nfor i in range(n):\r\n if a[i] == \"<\":\r\n left += 1\r\n else:\r\n break\r\n\r\n\r\nres += left\r\nleft = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if a[i] == \">\":\r\n right += 1\r\n else:\r\n break\r\nres += right\r\n\r\nprint(res)\r\n", "n=int(input())\r\nw=input()\r\nc=0\r\nfor i in w:\r\n if (i=='<'):\r\n c=c+1\r\n else:\r\n break\r\n\r\nn=n-1\r\nwhile (n>=0):\r\n if (w[n]=='>'):\r\n c=c+1\r\n n=n-1\r\n else:\r\n break\r\n\r\nprint(c)\r\n", "def solve():\r\n n = int(input())\r\n s = input()\r\n c = 0\r\n for ch in s:\r\n if ch == \"<\":\r\n c += 1\r\n else:\r\n break\r\n for ch in s[::-1]:\r\n if ch == \">\":\r\n c += 1\r\n else:\r\n break\r\n print(c)\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "# your code goes here\r\nn=int(input())\r\nstrn=input()\r\nsum=0\r\nfor i in range (0,n):\r\n\tif strn[i]=='<':\r\n\t\tsum+=1\r\n\telse:\r\n\t\tbreak;\r\nfor i in reversed(strn):\r\n\t\r\n\tif i=='>':\r\n\t\tsum+=1\r\n\telse:\r\n\t\tbreak; \r\nprint(sum)", "n = int(input())\ns = input()\nans = 0\n\nfor i in s:\n if i == \">\":\n break\n ans+=1\nfor i in s[::-1]:\n if i == \"<\":\n break\n ans+=1\nprint(ans)", "n = int(input())\r\ns = input()\r\npas = 0\r\nfor i in s:\r\n if i == '>':\r\n break\r\n else:\r\n pas += 1\r\nfor i in range(n-1,-1,-1):\r\n if s[i] == '<':\r\n break\r\n else:\r\n pas += 1\r\n \r\nprint(pas)", "n=int(input())\r\ns=input()\r\nk=s[0]\r\nres=i=0\r\nwhile i<=n-1 and s[i]==k:\r\n i+=1\r\nelse:\r\n if k=='<':\r\n res+=i \r\nk='>'\r\ni=n-1\r\nwhile i>=0 and s[i]==k:\r\n i-=1\r\nelse:\r\n res+=n-i-1\r\nprint(res)", "n=int(input())\r\ns=input()\r\nif(len(set(s))==1):\r\n print(n)\r\nelse:\r\n a=s.index('<')\r\n b=s.index('>')\r\n s1=s[::-1]\r\n c=s1.index('>')\r\n d=s1.index('<')\r\n p=0\r\n if(s[0]=='<'):\r\n p=len(s[:b])\r\n if(s[-1]=='>'):\r\n p+=len(s1[:d])\r\n print(p)\r\n \r\n", "n = input()\r\nstr = input()\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(str)):\r\n if str[i] == '>' and i+1 < len(str) and str[i + 1] == '<':\r\n k = i+1\r\n while k < len(str) and str[k] == '<':\r\n count2 -= 1\r\n k += 1\r\n count1 = 0\r\n continue\r\n\r\n if str[i] == '>':\r\n count1 += 1\r\n else:\r\n count2 += 1\r\n\r\nprint(count1 + count2)", "n = int(input())\r\nbumpers = input()\r\n\r\npos = 0\r\nif bumpers[0] == '<':\r\n\tfor i in range(len(bumpers)):\r\n\t\tif bumpers[i] == '<':\r\n\t\t\tpos += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\nif bumpers[-1] == '>':\r\n\tfor i in range(len(bumpers)-1,-1,-1):\r\n\t\tif bumpers[i] == '>':\r\n\t\t\tpos += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\nprint(pos)", "t=int(input())\nx=input()\na=x.find('>')\nb=x.rfind('<')\nif((a==-1)or(b==-1)):\n print(t)\nelse:\n print(a-b+t-1)\n", "n = int(input())\ns = input()\nans = 0\nfor i in s:\n if i == \"<\":\n ans += 1\n else:\n break\nfor i in s[-1::-1]:\n if i == \">\":\n ans += 1\n else:\n break\nprint(ans)", "n = int(input())\nbumpers = input()\nright = bumpers.find(\">\")\nleft = bumpers[::-1].find(\"<\")\nif right == -1 or left == -1:\n print(n)\nelse:\n print(n+right-(n-left))\n\t \t\t \t \t\t \t\t\t \t\t \t\t\t\t\t\t\t \t", "n = int(input())\r\nw = input()\r\nans = 0\r\n\r\nfor i in range(n):\r\n if w[i] == \"<\":\r\n ans += 1\r\n else:\r\n break\r\nfor i in range(n):\r\n if w[-i-1] == \">\":\r\n ans += 1\r\n else:\r\n break\r\n \r\nprint(ans)\r\n", "n=int(input())\r\ns=input()\r\ncnt=0\r\nfor i in range(n):\r\n if(s[i]=='<'):\r\n cnt+=1\r\n else:\r\n break\r\nfor i in range(n):\r\n if(s[n-i-1]=='>'):\r\n cnt+=1\r\n else:\r\n break\r\nprint(cnt)", "n=int(input())\r\ns=str(input())\r\nans1=0\r\nans2=0\r\ni=0\r\nwhile s[i]=='<' and i<n:\r\n ans1+=1\r\n i+=1\r\n if i==n:\r\n break\r\ni=n-1\r\nwhile s[i]=='>' and i>=0:\r\n ans2+=1\r\n i-=1\r\n if i==-1:\r\n break\r\nprint(min(n,ans1+ans2))", "n = int(input())\r\ns = input()\r\n\r\nans = 0\r\n\r\nfor i in s:\r\n if i == '<':\r\n ans += 1\r\n else:\r\n break\r\n\r\nfor i in reversed(s):\r\n if i == '>':\r\n ans += 1\r\n else:\r\n break\r\n\r\nprint(ans)", "n=int(input())\ns = input()\nres=0\nfor c in s:\n\tif c == '<': res += 1\n\telse: break\n\nfor c in s[::-1]:\n\tif c == '>': res += 1\n\telse:break\nprint(res)", "n = int(input())\r\nboard = input()\r\nans = 0\r\nfor i in range(n):\r\n if board[i] == '>':\r\n break\r\n ans += 1\r\nfor i in range(n):\r\n if board[-i-1] == '<':\r\n break\r\n ans += 1\r\nprint(ans)", "count = 0\nn = int(input())\ns = input()\n\nfor i in range(n):\n if s[i] == \">\":\n break\n count+=1\n \nfor i in range(n):\n if s[n-i-1] == \"<\":\n break\n count+=1\n\nprint(count)\n \t \t \t\t \t \t \t \t\t \t \t\t \t \t \t", "n = int(input())\r\na = input()\r\nprint(n- len(a.lstrip(\"<\").rstrip(\">\")))\r\n", "n, a = int(input()), input()\nres, lo, hi = 0, 0, n - 1\nwhile lo < n and a[lo] == \"<\":\n res += 1\n lo += 1\nwhile hi >= 0 and a[hi] == \">\":\n res += 1\n hi -= 1\nprint(res)\n", "n = int(input())\ns = input()\ns1 = 0\nfor i in s:\n if i==\"<\":\n s1+=1\n else:\n break\nfor i in range(n-1,-1,-1):\n if s[i]==\">\":\n s1+=1\n else:\n break\nprint(s1)", "n = int(input())\r\narr = input()\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if arr[i] == '>' :\r\n break\r\n count += 1\r\n\r\nfor i in range(n-1,-1,-1):\r\n if arr[i] == '<':\r\n break\r\n count += 1\r\n\r\nprint(count)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/725/A\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nt_l = 0\r\nt_r = 0\r\n\r\nfor c in s:\r\n if c == \"<\":\r\n t_l += 1\r\n else:\r\n break\r\nfor c in s[::-1]:\r\n if c == '>':\r\n t_r += 1\r\n else:\r\n break\r\nprint(t_l + t_r)", "\r\nn=int(input())\r\nplateau=input()\r\n\r\ni=0\r\nwhile n>i and plateau[i]==\"<\":\r\n i+=1\r\n\r\nj=n-1\r\nwhile j>=0 and plateau[j]==\">\":\r\n j-=1\r\n\r\nif i>j:\r\n print(n)\r\nelse:\r\n print(i+(n-1-j))\r\n", "def solve():\r\n n = int(input())\r\n s = input()\r\n \r\n ans = 0\r\n for i in s:\r\n if i == \"<\":\r\n ans += 1\r\n else:\r\n break\r\n for i in s[::-1]:\r\n if i == \">\":\r\n ans += 1\r\n else:\r\n break\r\n print(ans)\r\n \r\nsolve()\r\n", "n=int(input())\r\ns=input()\r\nresl,resr=0,0\r\nfor i in range(0,n):\r\n if s[i]=='<':\r\n resl+=1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if s[i]=='>':\r\n resr+=1\r\n else:\r\n break\r\nprint(resl+resr)", "n = int(input())\r\ns = input()\r\nprev = s[0]\r\nk = 0\r\np = 0\r\nres = []\r\nfor i in range(n):\r\n if s[i] != prev:\r\n res.append(k)\r\n prev = s[i]\r\n k = 1\r\n else:\r\n k += 1\r\nif k:\r\n res.append(k)\r\nfor i in range(1, len(res) - 1):\r\n p += res[i]\r\nif len(res) > 1 and s[0] == '>':\r\n p += res[0]\r\nif len(res) > 1 and s[len(s) - 1] == '<':\r\n p += res[len(res) - 1]\r\nprint(n - p)\r\n", "n = int (input())\r\ns = input()\r\n\r\ni = 0\r\nwhile i < n and s[i] != '>':\r\n i += 1\r\n\r\nj = n - 1\r\nwhile j >= 0 and s[j] != '<':\r\n j -= 1\r\n i += 1\r\n \r\nprint (i)", "n=int(input())\r\ns=input().lstrip(\"<\").rstrip(\">\")\r\nprint(n-len(s))", "n = int(input())\n\nline = list(str(input()))\n\nfirst_right = n+1\nlast_left = -1\n\nfor i in range(n):\n character = line[i]\n if (character == '>'):\n first_right = min (first_right, i)\n if (character == '<'):\n last_left = max(i, last_left)\n\nif (first_right == n+1 or last_left ==-1):\n print (n)\nelse:\n print(first_right + (n-last_left-1))\n \n \n\t \t\t \t\t \t \t\t \t \t\t\t \t \t \t \t", "n = int(input())\r\ns = input()\r\n\r\nwyn = 0\r\nl = 0\r\nwhile l<n:\r\n if s[l] == \"<\":\r\n wyn += 1\r\n l += 1\r\n else:\r\n break\r\nl = n-1\r\nwhile l>=0:\r\n if s[l] == \">\":\r\n wyn += 1\r\n l -= 1\r\n else:\r\n break\r\nprint(wyn)", "import re\nn=int(input())\ns=input()\nprefix,ending=0,0\nif s[0]==\"<\":\n prefix=len(re.findall(r\"[<]+\",s)[0])\nif s[-1]==\">\":\n ending=len(re.findall(r\"[>]+\",s[::-1])[0])\nprint(prefix+ending)\n\n \t \t\t \t\t \t \t\t\t\t \t\t \t\t", "n = int(input())\nbumps = input()\n\nans = 0\n\nfor i in range(n):\n if bumps[i] == \">\":\n ans += i\n break\nelse:\n ans += n\n\nfor i in range(n):\n if bumps[n - 1 - i] == \"<\":\n ans += i\n break\nelse:\n ans += n\n\nprint(ans)", "n = int(input())\ncnt1 = 0\ns = input()\nfor i in range(n):\n if s[i] == '<':\n cnt1 += 1\n else:\n break\nfor i in range(n - 1, -1, -1):\n if s[i] == '>':\n cnt1 += 1\n else:\n break\nprint(cnt1)", "n = int(input())\ns = input()\ncount = 0\nfor l in s:\n if l == '<':\n count += 1\n else:\n break\nfor l in s[::-1]:\n if l == '>':\n count += 1\n else:\n break\nprint(count)", "def main():\n n = int(input())\n s = input()\n ans = 0\n f = True\n for c in s:\n if c == '>':\n f = False\n if f:\n ans += 1\n f = True\n for c in reversed(s):\n if c == \"<\":\n f = False\n if f:\n ans += 1\n print( ans )\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\na = list(input())\r\n\r\ncount = 0\r\n\r\ni = 0\r\nwhile i != n:\r\n if a[i] =='<':\r\n count += 1\r\n else:\r\n break\r\n i += 1\r\n\r\nif i != n:\r\n i = n-1\r\n while i != -1:\r\n if a[i] == '>':\r\n count += 1\r\n else:\r\n break\r\n i -= 1\r\n \r\nprint(count)", "# 725 A\r\nn, x = int(input()), input();\r\nprint(n-len(x.lstrip('<').rstrip('>')))", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nn=int(input())\r\ns=input()\r\ns=s.lstrip('<')\r\ns=s.rstrip('>')\r\nprint(n-len(s))", "n = int(input())\r\ns = input()\r\n\r\nx, y = 0, 0\r\n\r\nfor i in range(n):\r\n\tif s[i] == \"<\":\r\n\t\tx += 1\r\n\t\t\r\n\tif s[i] == \">\":\r\n\t\tbreak\r\n\t\t\r\nfor i in range(n - 1, -1, -1):\r\n\tif s[i] == \">\":\r\n\t\ty += 1\r\n\t\t\r\n\tif s[i] == \"<\":\r\n\t\tbreak\r\n\t\t\r\nprint(x + y)", "n=int(input())\r\ns=input()\r\nc1=0\r\nc2=0\r\nfor i in range(n):\r\n if (s[i]==\"<\"):\r\n c1+=1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if (s[i]==\">\"):\r\n c2+=1\r\n else:\r\n break\r\nprint(c1+c2)\r\n", "from collections import defaultdict\r\nimport math\r\n\r\ndef pug_func(s: str) -> int:\r\n\r\n if \"<\" not in s or \">\" not in s:\r\n return len(s)\r\n \r\n else:\r\n cond1 = s.find(\">\")\r\n cond2 = len(s) - s.rfind(\"<\") - 1\r\n \r\n return cond1 + cond2\r\n\r\n\r\n\r\n\r\n\r\nt = int(input())\r\nline = input()\r\n\r\nx = pug_func(line)\r\nprint(x)\r\n\r\n\r\n\r\n\r\n# t = int(input())\r\n# lista_ans = []\r\n\r\n# for _ in range(t):\r\n# n = input()\r\n# line = input()\r\n# lista_ans.append(line)\r\n\r\n# for ans in lista_ans:\r\n# x = pug_func(ans)\r\n# print(x)\r\n", "def main():\n n, s = int(input()), input()\n l, v, m = [0] * n, [False] * (n + 1), 1\n for i, f in enumerate(l):\n if not f:\n while not l[i]:\n l[i] = m\n i += (-1, 1)[s[i] == '>']\n if not 0 <= i < n:\n v[m] = True\n break\n else:\n v[m] = v[l[i]]\n m += 1\n print(sum(1 for f in l if v[f]))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\ns = input()\r\ns = list(s)\r\ncount = 0\r\nfor i in range(len(s)):\r\n if(s[i]=='<'):\r\n count += 1\r\n else:\r\n break \r\nfor i in range(len(s)-1,-1,-1):\r\n if(s[i]=='>'):\r\n count += 1\r\n else:\r\n break \r\nprint(count) ", "#!/usr/bin/env python3\n\nfrom sys import stdin\n\n\ndef main():\n n, = stdin_get_ints_from_line()\n s = stdin_get_string_from_line()\n\n res = 0\n\n for x in s:\n if x == '<':\n res += 1\n else:\n break\n\n for x in reversed(s):\n if x == '>':\n res += 1\n else:\n break\n\n print(res)\n return\n\n\ndef stdin_get_ints_from_line():\n return (int(x) for x in stdin.readline().strip().split(' '))\n\n\ndef stdin_get_ints_list_from_line():\n return list(int(x) for x in stdin.readline().strip().split(' '))\n\n\ndef stdin_get_string_from_line():\n return stdin.readline().strip()\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\ns=input();\r\nf=0\r\nl=0\r\nfor i in range(0,n):\r\n if(s[i]=='<'):\r\n f=f+1\r\n else:\r\n break\r\nfor i in range (0,n):\r\n if(s[n-1-i]=='>'):\r\n l=l+1\r\n else:\r\n break\r\nprint(l+f)\r\n\r\n", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor i in s:\r\n if i=='<': ans+=1\r\n else: break\r\ns = s[::-1]\r\nfor i in s:\r\n if i=='>': ans+=1\r\n else: break\r\n\r\nprint(ans)", "n = int(input())\r\nbumpers = input()\r\na = n\r\nfor x in range(n):\r\n if bumpers[x] != \"<\":\r\n a = x\r\n break\r\nbumpers = bumpers[::-1]\r\nb = n\r\nfor x in range(n):\r\n if bumpers[x] != \">\":\r\n b = x\r\n break\r\nprint(a + b)", "def solve(s):\r\n ans=0\r\n tmp=0\r\n n=len(s)\r\n while tmp<n and s[tmp]=='<':\r\n ans+=1\r\n tmp+=1\r\n tmp=n-1\r\n while tmp>=0 and s[tmp]=='>':\r\n ans+=1\r\n tmp-=1\r\n return ans\r\n\r\nn=input()\r\ns=input()\r\nprint(solve(s))\r\n", "if __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n s = input()\r\n l, r, ans = 0, 0, 0\r\n\r\n if not (s[0] == '>' and s[len(s) - 1] == '<'):\r\n l = s.find('>')\r\n r = s[::-1].find('<')\r\n ans = n if l == -1 or r == -1 else l + r\r\n print(ans)", "input()\ns = input()\nj = 0\nwhile j < len(s) and s[j] == '<':\n j += 1\nk = len(s) - 1\nwhile k >= 0 and s[k] == '>':\n k -= 1\nprint(j + len(s) - k - 1)", "n = int(input())\r\ns = input()\r\nl = True\r\nk = 0\r\nk1 = 0\r\nfor i in s:\r\n if i == '<' and l:\r\n k += 1\r\n if i == '>':\r\n k1 += 1\r\n l = False\r\n if i == '<' and not l:\r\n k1 = 0\r\n\r\nprint(k + k1)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(s):\r\n n = len(s)\r\n ans = 0\r\n for i in range(n):\r\n if s[i] == '<':\r\n ans += 1\r\n else:\r\n break\r\n for i in range(n - 1, -1, -1):\r\n if s[i] == '>':\r\n ans += 1\r\n else:\r\n break\r\n return ans\r\n\r\ndef main():\r\n n = int(input())\r\n s = input()\r\n ans = solve(s)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math,sys,re,itertools,pprint\r\nri,rai=lambda:int(input()),lambda:list(map(int, input().split()))\r\n\r\nn = ri()\r\na = input()\r\nres = i = 0\r\nwhile i < n and a[i] == '<':\r\n res += 1\r\n i += 1\r\ni = n-1\r\nwhile i >= 0 and a[i] == '>':\r\n res += 1\r\n i -= 1\r\nprint(res)\r\n", "##attacking the problem from a simpler angle\r\n##catch the falling positions from the edges\r\n\r\nnum = int(input())\r\n\r\nbumper = str(input())\r\n\r\nbumperlist = list(bumper)\r\n\r\nfallright = 0\r\nfallleft = 0 \r\n\r\nfor i in range(num):\r\n if bumperlist[i] == '<':\r\n fallleft += 1\r\n else:\r\n break\r\nfor i in reversed(range(num)):\r\n if bumperlist[i] == '>':\r\n fallleft += 1\r\n else:\r\n break\r\n\r\n\r\nprint(str(fallright + fallleft))", "if __name__ == '__main__':\r\n n = int(input())\r\n line = str(input())\r\n num = 0\r\n for it in line:\r\n if it == '<':\r\n num += 1\r\n else:\r\n break\r\n for it in line[::-1]:\r\n if it == '>':\r\n num += 1\r\n else:\r\n break\r\n print(num)\r\n", "n = int(input())\r\ns = input()\r\nleft, right = [0] * n, [0] * n\r\ncur = 0\r\nfor i in range(n):\r\n if s[i] == '<':\r\n cur -= 1\r\n else:\r\n cur += 1\r\n left[i] = cur\r\ncur = 0\r\nfor i in reversed(range(n)):\r\n if s[i] == '<':\r\n cur -= 1\r\n else:\r\n cur += 1\r\n right[i] = cur\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == '<':\r\n if -left[i] == i + 1:\r\n ans += 1\r\n else:\r\n if right[i] == n - i:\r\n ans += 1\r\nprint(ans)", "print(int(input())-len(input().lstrip(\"<\").rstrip(\">\")))", "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n\nif __name__ == '__main__':\n x = int(input().strip())\n s = input().strip()\n p = \"\"\n a = 0\n t = 0\n drop = True\n for c in s:\n \tif p == \">\" and c == \"<\":\n \t\tt = 0\n \t\tdrop = False\n \tif drop and c == \"<\":\n \t\ta += 1\n \tif c == \">\":\n \t\tt += 1\n \tp = c\n a += t\n print(a)\n \n\t\t\t\t \t\t \t\t \t\t\t\t \t\t\t\t", "n=int(input())\r\na=input()\r\nx=-1\r\nfor i in range(0,n):\r\n if a[i]=='>':\r\n x=i\r\n break\r\nif x==-1:\r\n print(n)\r\n exit(0)\r\ni=n-1\r\ny=-1\r\nwhile i>x:\r\n if a[i]=='<':\r\n y=i\r\n break\r\n i-=1\r\nif y==-1:\r\n print(n)\r\n exit(0)\r\nprint(x+n-y-1)", "import sys\r\n\r\nfin = sys.stdin\r\nfout = sys.stdout\r\nn = int(fin.readline())\r\ncount = 0\r\ns = fin.readline().strip()\r\ntemp = 0\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == '>':\r\n temp = 0\r\n else:\r\n temp += 1\r\ncount += temp\r\ntemp = 0\r\nfor i in range(len(s)):\r\n if s[i] == '<':\r\n temp = 0\r\n else:\r\n temp += 1\r\ncount += temp\r\nfout.write(str(count))\r\n", "import sys\r\nimport math\r\n\r\ninput()\r\nar=list(input())\r\nsuma=0\r\nar=ar+['?']\r\nfor n,i in enumerate( ar):\r\n if i!='<':\r\n suma+=n\r\n break;\r\nar=ar[:len(ar)-1]\r\nar=['?']+ar\r\n\r\nar=reversed(ar)\r\nfor n,i in enumerate(ar):\r\n if i!='>':\r\n suma+=n\r\n break;\r\nprint(suma)\r\n", "input()\r\n\r\ns = input()\r\nfirst = s[0]\r\nlast = s[-1]\r\nansw = 0\r\nif first == '<':\r\n for i in range(len(s)):\r\n if s[i] == first:\r\n answ += 1\r\n else:\r\n break\r\nif last == '>':\r\n for i in range(len(s)-1, -1, -1):\r\n if s[i] == last:\r\n answ += 1\r\n else:\r\n break\r\n\r\nprint(answ)\r\n", "n = int(input())\r\ns = input()\r\nans = 0\r\ni = n - 1\r\nwhile i != -1 and s[i] == \">\":\r\n ans += 1\r\n i -= 1\r\ni = 0\r\nwhile i != n and s[i] == \"<\":\r\n ans += 1\r\n i += 1\r\nprint(ans)", "n = int(input())\r\ns = input()\r\n\r\nbegin = True\r\ncounter = 0\r\nans = 0\r\n\r\nfor i in range(n):\r\n if begin and s[i] == \"<\":\r\n ans += 1\r\n elif s[i] == \">\":\r\n counter += 1\r\n begin = False\r\n else:\r\n counter = 0\r\nprint(ans + counter)", "#!/usr/bin/env python3\n\n\"\"\"\nn : num of bumper\n\"\"\"\n\ncnt = 0\nn = int(input())\nbumps = input()\nfor i in range(n):\n if bumps[i] == \">\":\n break\n cnt += 1\n\nfor i in range(n):\n if bumps[n-i-1] == \"<\":\n break\n cnt += 1\n\nprint(cnt)\n", "def main():\r\n num = input()\r\n signal = list(input())\r\n len_signal = len(signal)\r\n if signal[0] == '<':\r\n try:\r\n left_num = signal.index('>')\r\n except ValueError:\r\n return len_signal\r\n else:\r\n left_num = 0\r\n signal.reverse()\r\n if signal[0] == '>':\r\n try:\r\n right_num = signal.index('<')\r\n except ValueError:\r\n return len_signal\r\n else:\r\n right_num = 0\r\n return left_num + right_num\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main())\r\n", "n = int(input())\r\ns = input()\r\ncnt = 0 \r\nfor i in range(n):\r\n\tif s[i]==\"<\":\r\n\t\tcnt+=1\r\n\telse:\r\n\t\tbreak\r\ns = s[::-1]\r\nfor j in range(n):\r\n\tif s[j]==\">\":\r\n\t\tcnt+=1\r\n\telse:\r\n\t\tbreak\r\nprint(cnt)", "n = int(input())\r\nst = input()\r\n\r\npos = 0\r\nfor i in range(n):\r\n\tif st[i] == '<':\r\n\t\tpos += 1\r\n\telse: \r\n\t\tbreak\r\nfor i in range(n):\r\n\tif st[(n-1) - i] == '>':\r\n\t\tpos += 1\r\n\telse: \r\n\t\tbreak\r\nprint(pos)\r\n", "input()\r\ns=input()\r\nans=0\r\nfor i in s:\r\n if i=='<':ans+=1\r\n else:break\r\nfor i in s[::-1]:\r\n if i=='>':ans+=1\r\n else:break\r\nprint(ans)", "n = int(input())\ns = input()\nl = 0\nans = 0\nwhile l < len(s) and s[l] == '<':\n ans += 1\n l += 1\n\nr = n - 1\nwhile r >= 0 and s[r] == '>':\n ans += 1\n r -= 1\n\nprint(ans)\n", "# You lost the game.\nn = int(input())\ns = str(input())\n\ni = 0\nwhile i < n and s[i] ==\"<\":\n i += 1\n\nif i == n:\n print(n)\nelse:\n j = n-1\n while j >= 0 and s[j] == \">\":\n j -= 1\n print(i+(n-j-1))\n", "n = int(input())\ndata = [i for i in input()]\nret = 0\nind = 0\nif data[ind] == '<':\n while 1:\n if ind < n and data[ind] == '<':\n ret += 1\n ind += 1\n else:\n break\nind = n - 1\nif data[ind] == '>':\n while 1:\n if ind > -1 and data[ind] == '>':\n ret += 1\n ind -= 1\n else:\n break\nprint(ret)\n ", "n = int(input())\r\ns = input()\r\nt = 0\r\ni = 0\r\nif s[0] == '<':\r\n while s[i] == '<':\r\n t = t + 1\r\n i += 1\r\n if i == n:\r\n break\r\ni = n-1\r\nif s[n-1] == '>':\r\n while s[i] == '>':\r\n t = t + 1\r\n i -= 1\r\n if i < 0:\r\n break\r\nprint(t)\r\n" ]

[ "\nsticks = input().split()\n\nfour = False\ntwo = False\n\nfor stick in sticks:\n\tif sticks.count(stick) >= 4:\n\t\tfour = True \n\tif sticks.count(stick) == 2 or sticks.count(stick) == 6:\n\t\ttwo = True\n\nif four:\n\tif two:\n\t\tprint(\"Elephant\")\n\telse:\n\t\tprint(\"Bear\")\nelse:\n\tprint(\"Alien\")", "a = list(map(int, input().split()))\r\nx = set(a)\r\n\r\no1 = False\r\no2 = False\r\n\r\nfor i in x:\r\n if a.count(i) >= 4:\r\n for _ in range(4):\r\n a.remove(i)\r\n o1 = True\r\n break\r\nif o1:\r\n if a[0]==a[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")", "a = list(map(int, input().split()))\r\nh = {}\r\nfor n in a:\r\n if n not in h:\r\n h[n] = 1\r\n else:\r\n h[n] += 1\r\n \r\nk = 4\r\nif len(h)==1:\r\n print('Elephant')\r\nelif k+1 in h.values():\r\n print('Bear')\r\nelif k in h.values():\r\n if len(h)==2:\r\n print('Elephant')\r\n elif len(h)==3:\r\n print('Bear')\r\nelse:\r\n print('Alien')\r\n ", "\r\nsticks = list(map(int, input().split()))\r\n#print(sticks)\r\nsticks.sort()\r\n\r\nhb = [(0, 5), (4, 5), (0, 1)]\r\n\r\nfor head, body in hb:\r\n cur = sticks[3]\r\n flag = True\r\n for i in range(6):\r\n if i != head and i != body:\r\n if sticks[i] != cur:\r\n flag = False\r\n break\r\n \r\n if not flag:\r\n continue\r\n \r\n if sticks[head] < sticks[body]:\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")\r\n exit()\r\nprint(\"Alien\")\r\n", "l = [int(x) for x in input().split()]\r\nl.sort()\r\ntemp = l[0]\r\nindex = 0\r\ncount = 1\r\nfor i in range(1, 6):\r\n if(l[i] == temp):\r\n count += 1\r\n else:\r\n temp = l[i]\r\n index = i+1\r\n count = 1\r\n if count == 4:\r\n break\r\nif(count == 4):\r\n l = l[0:index]+l[index+4:]\r\n if(l[0]!=l[1]):\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Alien\")\r\n", "l = list(map(int, input().split()))\r\nok=True\r\nfor i in range(6):\r\n if l.count(l[i])>=4:\r\n ok = False\r\n f=l[i]\r\nif ok:\r\n print(\"Alien\")\r\nelse:\r\n for i in range(4):\r\n l.pop(l.index(f))\r\n print([\"Bear\", \"Elephant\"][l[0]==l[1]])\r\n ", "from collections import Counter\r\n\r\nc = Counter(input().split()).values()\r\n\r\nif max(c) < 4:\r\n print('Alien')\r\nelif min(c) in (2, 6):\r\n print('Elephant')\r\nelse:\r\n print('Bear')", "data = [int(i) for i in input().split()]\r\ndata.sort()\r\nif data.count(data[3]) < 4:\r\n print(\"Alien\")\r\nelse:\r\n t = data[3]\r\n for i in range(4):\r\n data.remove(t)\r\n if data[0] == data [1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "x=[int(a) for a in input().split()]\r\nx=sorted(x)\r\ny=[0]*10\r\nfor i in range(6):\r\n y[x[i]]+=1\r\ny.sort(reverse=True)\r\nif y[0]==6:\r\n print(\"Elephant\")\r\nelif y[0]==5:\r\n print(\"Bear\")\r\nelif y[0]==4:\r\n if y[1]==2:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "lis=list(map(int,input().split()))\r\ns=set()\r\ndict={}\r\nfor i in lis:\r\n if i not in dict:\r\n dict[i]=1\r\n s.add(i)\r\n else:\r\n dict[i]+=1\r\nif len(s)!=3 and len(s)!=2 and len(s)!=1:\r\n print('Alien')\r\nelif len(s)==1 and lis.count(lis[0])==6:\r\n print('Elephant')\r\nelse:\r\n lis2=list(s)\r\n ele=False\r\n ani=False\r\n for i in lis2:\r\n if lis.count(i)==2:\r\n ele=True\r\n if lis.count(i)>=4:\r\n ani=True\r\n if ani and ele:\r\n print('Elephant')\r\n elif ani:\r\n print('Bear')\r\n elif not ani:\r\n print('Alien')", "\nl = [int(a) for a in input().strip().split()]\nassert len(l) == 6\n\n# first, determine whether legs can be made\nf = False\nfor i in range(6):\n if l.count(l[i]) >= 4:\n f = True\n c = l[i]\n for _ in range(4):\n l.remove(c)\n\n assert len(l) == 2\n if l[0] != l[1]:\n print(\"Bear\")\n break\n else:\n print(\"Elephant\")\n break\n\nif not f:\n print(\"Alien\")\n", "a = [int(x) for x in input().split(' ')]\r\na.sort()\r\nfor x in range(0,4):\r\n if a.count(a[x])>=4:\r\n c = a[x]\r\n break\r\n else:\r\n c = 0 \r\ni = 0\r\nwhile i<4 and c!=0:\r\n a.remove(c)\r\n i+=1\r\nif c!=0:\r\n if a[0]==a[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\n\r\n\r\nelse:\r\n print('Alien')", "import sys\r\nfrom collections import Counter\r\n\r\nnums = list(map(int, sys.stdin.readline().split()))\r\ncn = Counter(nums)\r\nx = cn.most_common(1)\r\nif x[0][1] < 4:\r\n print('Alien')\r\nelse:\r\n for _ in range(4):\r\n nums.remove(x[0][0])\r\n if nums[0] == nums[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')", "dic = {}\nar = [int(i)for i in input().split(' ')]\nfrom collections import Counter\ndic = Counter(ar)\n\nlegs = 0\nbody = 0\nfor i in dic:\n\tif dic[i]>=4:\n\t\tlegs = 4\n\t\tdic[i]-=4\n\t\tbreak\n\nfor i in dic:\n\tif dic[i]>0:\n\t\tbody+=1\n\nif legs ==4 and body ==1:\n\tprint('Elephant')\nelif legs==4 and body ==2:\n\tprint('Bear')\nelse:\n\tprint('Alien')\n\n\n\n", "n = list(map(int,input().split()))\r\nn.sort()\r\nif n[1] == n[2] == n[3] == n[4] and n[5] > n[4]:\r\n print(\"Bear\")\r\nelif n[0] == n[1] == n[2] == n[3] and n[5] > n[4] :\r\n print(\"Bear\")\r\nelif n[2] == n[3] == n[4] == n[5] and n[1] > n[0] :\r\n print(\"Bear\")\r\nelif n[0] == n[1] == n[2] == n[3] and n[4] == n[5] :\r\n print(\"Elephant\")\r\nelif n[2] == n[3] == n[4] == n[5] and n[1] == n[0] :\r\n print(\"Elephant\")\r\nelse :\r\n print(\"Alien\")\r\n ", "a=[int(i) for i in input().split()]\na.sort()\nif a[0]==a[5] or (a[0]==a[1] and a[2]==a[5]) or (a[0]==a[3] and a[4]==a[5]):\n \n print('Elephant')\nelif (a[0]==a[3]) or (a[1]==a[4]) or (a[2]==a[5]):\n print('Bear')\nelse:\n print('Alien')\n", "a, b, c, d, e, f = map(int, input().split())\r\ni=[a,b,c,d,e,f]\r\ni_same=[]\r\ni.sort()\r\nif i[0]==i[1]==i[2]==i[3]:\r\n i_same=[i[0],i[1],i[2],i[3],i[4],i[5]]\r\nelif i[1]==i[2]==i[3]==i[4]:\r\n i_same=[i[1],i[2],i[3],i[4],i[0],i[5]]\r\nelif i[2]==i[3]==i[4]==i[5]:\r\n i_same=[i[2],i[3],i[4],i[5],i[0],i[1]]\r\n \r\nif i_same==[]:\r\n print('Alien')\r\nelif i_same[4]==i_same[5]:\r\n print('Elephant')\r\nelse:\r\n print('Bear')\r\n \r\n", "a=list(map(int,input().split()))\r\nd=dict()\r\nfor i in a:\r\n d[i]=d.get(i,0)+1\r\nz=0\r\nif len(d)<=3:\r\n l=list(d.values())\r\n l.sort()\r\n if len(d)==2:\r\n if l[0]==1:\r\n z=1\r\n elif l[0]==2:\r\n z=2\r\n elif len(l)==3:\r\n if l[0]==1 and l[1]==1 and l[2]==4:\r\n z=1\r\n else:\r\n z=2\r\nif z==1:\r\n print(\"Bear\")\r\nelif z==2:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Alien\")\r\n\r\n", "L=[0]*10\r\nfor k in map(int,input().split()):\r\n L[k]+=1\r\nif(max(L)>=4):\r\n if((4 in L and 2 in L) or 6 in L):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")\r\n", "s = [int(i) for i in input().split()]\r\n\r\ns.sort()\r\n\r\nif s[0] == s[3]:\r\n if s[4] == s[5]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelif s[1] == s[4]:\r\n if s[0] == s[5]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelif s[2] == s[5]:\r\n if s[0] == s[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelse:\r\n print('Alien')\r\n", "l=list(map(int,input().split()))\r\na=[]\r\nfor i in range(1,10):\r\n a.append(l.count(i))\r\nm=max(a)\r\nif(m>=4):\r\n if(m==6):\r\n print(\"Elephant\")\r\n elif(2 in a):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")\r\n", "from sys import stdin\n\n\ndef main():\n l = [0] * 10\n for x in map(int, stdin.readline().strip().split()):\n l[x] += 1\n l.sort()\n x = l[9] * 3 + l[8]\n if x in (18, 14):\n return 'Elephant'\n elif x in (16, 13):\n return 'Bear'\n else:\n return 'Alien'\n\n\nprint(main())\n", "a = list(map(int, input().split()))\r\n\r\ndef bear(a):\r\n\tfor x in set(a):\r\n\t\tif a.count(x) >= 4:\r\n\t\t\tfor _ in range(4):\r\n\t\t\t\ta.remove(x)\r\n\t\t\treturn a[0] != a[1]\r\n\treturn False\r\n\r\ndef eleph(a):\r\n\tfor x in set(a):\r\n\t\tif a.count(x) >= 4:\r\n\t\t\tfor _ in range(4):\r\n\t\t\t\ta.remove(x)\r\n\t\t\treturn a[0] == a[1]\r\n\treturn False\t\r\n\r\nif bear(a[:]):\r\n\tprint('Bear')\r\nelif eleph(a[:]):\r\n\tprint ('Elephant')\r\nelse:\r\n\tprint ('Alien')\r\n", "if __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n\r\n a = Y()\r\n a = sorted(a, key=a.count)\r\n\r\n if a[2] != a[-1]:\r\n print(\"Alien\")\r\n elif a[0] == a[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "tokens = [int(x) for x in input().split()]\r\ntokens.sort()\r\nfor i in range(3):\r\n state = True\r\n for j in range(3):\r\n if tokens[i + j] != tokens[j + i + 1]:\r\n state = False\r\n if state:\r\n for j in range(4):\r\n del tokens[i]\r\n break\r\n\r\nif len(tokens) == 6:\r\n print(\"Alien\")\r\nelif tokens[0] == tokens[1]:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Bear\")", "x=input().split(\" \")\r\ny=set(x)\r\nans=\"Alien\"\r\n\r\nfor i in y:\r\n if x.count(i)>=4:\r\n if x.count(i)==4:\r\n if len(y)==3:\r\n ans=\"Bear\"\r\n \r\n else: \r\n ans=\"Elephant\";\r\n \r\n else :\r\n if len(y)==1:\r\n ans=\"Elephant\";\r\n else :\r\n ans=\"Bear\";\r\n break;\r\n \r\n \r\n \r\nprint(ans)", "l=list(map(int,input().split()))\r\np=[0]*10\r\nfor i in range(len(l)):\r\n p[l[i]]+=1\r\nt=0 \r\nfor i in range(len(p)):\r\n if(p[i]>=4):\r\n if(p[i]==6):\r\n print('Elephant')\r\n elif(p[i]==5):\r\n print('Bear')\r\n else:\r\n s=set(l)\r\n o={i}\r\n s=list(s-o)\r\n if(len(s)==1):\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\n break\r\n t+=1\r\nif(t==len(p)):\r\n print('Alien')\r\n \r\n ", "list=input().split()\r\nfor i in range(len(list)):\r\n list[i]=int(list[i])\r\nlist.sort()\r\ntab=[ 0 for loop in range(10)]\r\nfor i in range(len(list)):\r\n tab[list[i]]+=1\r\ne=0\r\nb=0\r\nfor i in range(10):\r\n if tab[i]>=4:\r\n e=1\r\n b=1\r\nfor i in range(10):\r\n if tab[i]==2 or tab[i]==6:\r\n if e==1:e=2\r\nfor i in range(10):\r\n if tab[i]==1:\r\n if b==1:b=2\r\nif b==2:\r\n print(\"Bear\")\r\nelif e==2:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Alien\")", "arr=list(map(int,input().split()))\r\nhul=0\r\nbiy=0\r\nfor i in range(0,len(arr)):\r\n if(arr.count(arr[i])>3):\r\n hul=arr[i]\r\nif(hul==0):\r\n print(\"Alien\")\r\nelse:\r\n for i in range(0,4):\r\n arr.remove(hul)\r\n if(arr[0]==arr[1]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/24 18:24\r\n\r\n\"\"\"\r\n\r\nA = [int(x) for x in input().split()]\r\n\r\nwc = collections.Counter(A)\r\n\r\nleg = [k for k, v in wc.items() if v >= 4]\r\n\r\nif not leg:\r\n print(\"Alien\")\r\n exit(0)\r\n\r\nleg = leg[0]\r\n\r\nother = []\r\n\r\nc = 0\r\nfor v in A:\r\n if v == leg and c < 4:\r\n c += 1\r\n else:\r\n other.append(v)\r\n\r\nif other[0] == other[1]:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Bear\")\r\n\r\n\r\n", "a = list(map(int,input().split()))\r\nk = sorted([a.count(c) for c in a])\r\nprint((('Bear','Elephant')[k[0]!=1],'Alien')[k[-1] < 4])", "__author__ = 'myduomilia'\n\narr = list(map(int, input().split()))\narr.sort()\nans = False\nfor val in arr:\n if arr.count(val) >= 4:\n ans = True\n for i in range(4):\n arr.remove(val)\nif not ans:\n print(\"Alien\")\nelse:\n if arr.count(arr[0]) == 1:\n print(\"Bear\")\n else:\n print(\"Elephant\")\n", "import math\r\n\r\n\r\ndef main_function():\r\n a = [int(i) for i in input().split(\" \")]\r\n hash_a = [0 for i in range(15)]\r\n legs_are_found = False\r\n is_given = False\r\n for i in a:\r\n hash_a[i] += 1\r\n for i in range(len(hash_a)):\r\n if hash_a[i] >= 4:\r\n hash_a[i] -= 4\r\n legs_are_found = True\r\n if not legs_are_found:\r\n print(\"Alien\")\r\n is_given = True\r\n if not is_given:\r\n new = []\r\n for i in range(len(hash_a)):\r\n if hash_a[i] == 1:\r\n new.append(i)\r\n if hash_a[i] == 2:\r\n new.append(i)\r\n new.append(i)\r\n if new[0] == new[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "import itertools\r\nimport sys\r\nfrom collections import defaultdict, Counter\r\nfrom math import sqrt\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\ndef s(d):\r\n dis = 1 + 4 * 2 * 3 * d\r\n ds = sqrt(dis)\r\n return (-1 + ds) / 6\r\n\r\n\r\ndef main():\r\n v = inlt()\r\n d = dict(Counter(v))\r\n l = None\r\n for k,v in d.items():\r\n if v >=4:\r\n l = k\r\n if l:\r\n d[l]-=4\r\n r = itertools.chain.from_iterable([[k]*v for k,v in d.items()])\r\n if len(set(r)) == 1:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\n else:\r\n print(\"Alien\")\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # sys.setrecursionlimit(10 ** 6)\r\n # threading.stack_size(10 ** 8)\r\n # t = threading.Thread(target=main)\r\n # t.start()\r\n # t.join()\r\n main()\r\n", "a = dict()\r\nb = list(map(int, input().split()))\r\nfor i in range(6):\r\n if b[i] in a.keys():\r\n a[b[i]] += 1\r\n else:\r\n a[b[i]] = 1\r\nan = False\r\nfor i in a.keys():\r\n if a[i] >= 4:\r\n an = True\r\nif an:\r\n for i in a.keys():\r\n if a[i] == 6 or a[i] == 2:\r\n print('Elephant')\r\n break\r\n elif a[i] != 4:\r\n print('Bear')\r\n break\r\nelse:\r\n print('Alien')", "#471A\r\n\r\nl = sorted(input().split())\r\n\r\nfor i in range(3):\r\n if l[i] == l[i+1] == l[i+2] == l[i+3]:\r\n l.pop(i)\r\n l.pop(i)\r\n l.pop(i)\r\n l.pop(i)\r\n break\r\n\r\nif len(l) == 2:\r\n if l[0] == l[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n\r\nelse:\r\n print(\"Alien\")\r\n", "a,b,c,d,e,f=sorted(map(int,input().split()))\r\nif a==d and e==f or a==b and c==f: print(\"Elephant\")\r\nelif a<b and (b==e or c==f) or e<f and (b==e or a==d): print(\"Bear\")\r\nelse: print(\"Alien\")\r\n ", "# HEY STALKER\r\nfrom collections import Counter\r\nl = list(map(int, input().split()))\r\nd = Counter(l)\r\nlg = -1\r\nfor t in d:\r\n if d[t] >= 4:\r\n lg = d[t]\r\nif lg == -1:\r\n print(\"Alien\")\r\nelif lg == 6:\r\n print(\"Elephant\")\r\nelif lg == 5:\r\n print(\"Bear\")\r\nelse:\r\n if len(d) == 2:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "if __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n\r\n a = Y()\r\n d = dict()\r\n\r\n for i in a:\r\n d[i] = d.get(i, 0) + 1\r\n mx = max(d.values())\r\n if mx >= 4:\r\n a = [i for i in d.keys() if d[i] != mx]\r\n print([\"Bear\", \"Elephant\"][not len(a) or d[a[-1]] == 2])\r\n else:\r\n print(\"Alien\")", "#Codeforces 471A\r\n#MUH and Sticks\r\n\r\nlengths=input().split()\r\nlengths=[int(i) for i in lengths]\r\n\r\nlegs=False\r\nfor i in lengths:\r\n if lengths.count(i)>=4:\r\n legs=True\r\n break\r\n\r\nif legs:\r\n lengths=[j for j in lengths if j!=i]\r\n if len(lengths)==0:\r\n print(\"Elephant\")\r\n elif len(lengths)==1:\r\n print(\"Bear\")\r\n elif lengths[0]==lengths[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")\r\n", "inp = list(map(int, input().split()))\r\nlst = list(set(inp))\r\nt = inp\r\nfor i in lst:\r\n if inp.count(i) >= 4:\r\n for __ in range(4):\r\n t.remove(i)\r\n if t[0] == t[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\n break\r\nelse:\r\n print('Alien')\r\n", "d={};a,b,c,t=0,0,0,0\r\nfor i in map(int,input().split()):\r\n\tif i in d:d[i]+=1\r\n\telse:d[i]=1\r\nfor i in d:\r\n\tif d[i]==1:a+=1\r\n\telif d[i]==4 :b+=4\r\n\telif d[i]==5:c+=5\r\n\telif d[i]==2:t+=2\r\nm=len(d)\r\nif m==1:print('Elephant')\r\nelse:\r\n\tif (a==2 and b==4) or (a==1 and c==5):print('Bear')\r\n\telif (t==2 and b==4) or (a==2 and b==4):print('Elephant')\r\n\telse:print('Alien')", "l=list(map(int,input().split()))\r\nz=set(l)\r\ncnt=0\r\nfor i in z:\r\n if l.count(i)>=4:\r\n for j in range(4):\r\n l.remove(i)\r\nl.sort()\r\nif len(l)>2:\r\n print(\"Alien\")\r\nelse:\r\n if l[0]<l[1]:\r\n print(\"Bear\")\r\n elif l[0]==l[1]:\r\n print(\"Elephant\")", "ar=list(map(int,input().split()))\r\nk=[0 for x in range(9)]\r\nfor x in range(6):\r\n k[ar[x]-1]+=1\r\nleg=False\r\nfor x in range(9):\r\n if k[x]>=4:\r\n leg=True\r\n k[x]-=4\r\n break\r\nif leg==False:\r\n print(\"Alien\")\r\nelse:\r\n v=[]\r\n for m in range(9):\r\n if k[m]>1:\r\n v.append(m+1)\r\n v.append(m+1)\r\n break\r\n elif k[m]==1:\r\n v.append(m+1)\r\n if min(v)==max(v):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n", "a1, a2, a3, a4, a5, a6 = map(int, input().split())\r\nsticks = sorted([a1, a2, a3, a4, a5, a6])\r\ns_s = list(set(sticks))\r\nfor i in s_s:\r\n if sticks.count(i) >= 4:\r\n for _ in range(4):\r\n sticks.remove(i)\r\n break\r\nif len(sticks) != 2:\r\n print('Alien')\r\n exit()\r\nhead, body = sorted(sticks)\r\nif body > head:\r\n print('Bear')\r\n exit()\r\nif body == head:\r\n print('Elephant')\r\n exit()\r\nprint('Alien')\r\n", "s = sorted(int(x) for x in input().split())\r\nfor i in range(3):\r\n if s[i] == s[i + 3]:\r\n s[i:i + 4] = []\r\n print('Elephant' if s[0] == s[1] else 'Bear')\r\n exit()\r\nprint('Alien')", "str1 = input()\r\nlist1 = str1.split(\" \")\r\nset1 =set(list1)\r\njud11= {2,4}\r\njud12 = {6}\r\njud21 = {4,1,1}\r\njud22 = {5,1}\r\nget = set()\r\nfor sti in set1:\r\n get.add(list1.count(sti))\r\nif (get == jud11) or (get == jud12):print(\"Elephant\")\r\nelif get == jud21 or (get == jud22):print(\"Bear\")\r\nelse:print(\"Alien\")", "arr=[int(x) for x in input().split()]\r\ntemp=[0 for i in range(9)]\r\nfor i in arr:\r\n temp[i-1]+=1\r\nlegs=False\r\ne=False\r\nfor i in temp:\r\n if i>=4:\r\n legs=True\r\n i-=4\r\n if i==2:\r\n e=True\r\n elif i==2:\r\n e=True\r\nif legs==False:\r\n print('Alien')\r\nelif e:\r\n print('Elephant')\r\nelse:\r\n print('Bear')\r\n \r\n", "sticks = list(map(int, input().split()))\ncnt = dict()\nfor i in sticks:\n if i not in cnt:\n cnt[i] = 0\n cnt[i] += 1\ncnt = sorted(list(cnt.values()))\nif cnt in ([2, 4], [6]):\n print('Elephant')\nelif cnt in ([1, 1, 4], [1, 5]):\n print('Bear')\nelse:\n print('Alien')", "l = [int(i) for i in input().split()]\r\npossible = True\r\ns = []\r\nd = {}\r\nfor i in range(6):\r\n if l[i] in d:\r\n d[l[i]] += 1\r\n else:\r\n d[l[i]] = 1\r\n s.append(l[i])\r\n\r\nfor j in range(len(s)):\r\n if d[s[j]]>=4:\r\n s.remove(s[j])\r\n break\r\nelse:\r\n possible = False\r\n print('Alien')\r\nif possible:\r\n if len(s) == 0:\r\n print('Elephant')\r\n elif len(s) == 2:\r\n print('Bear')\r\n elif d[s[0]] == 2:\r\n print('Elephant')\r\n elif d[s[0]] == 1:\r\n print('Bear')\r\n", "l=list(map(int,input().split()))\r\nl=sorted(l,key=l.count)\r\nif l[2]!=l[-1]:print(\"Alien\")\r\nelif l[0]==l[1]:print(\"Elephant\")\r\nelse:print(\"Bear\")", "a = list(sorted(map(int, input().split())))\r\nfor y in range(len(a) - 3):\r\n if a[y] == a[y + 1] and a[y] == a[y + 2] and a[y] == a[y + 3]:\r\n for x in range(4):\r\n del a[y]\r\n if a[0] == a[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n exit()\r\nprint(\"Alien\")", "x=input().split()\r\nd={}\r\nb=0\r\na=0\r\nq=0\r\np=0\r\nc=0\r\nfor i in x:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1 \r\nfor j in set(x):\r\n if d[j]==4:\r\n c=1\r\n elif d[j]==5:\r\n p=1\r\n elif d[j]==6:\r\n q=1\r\n elif d[j]==2:\r\n a=1\r\n elif d[j]==1:\r\n b+=1\r\nif (c==1 and a==1) or q==1:\r\n print('Elephant')\r\nelif (c==1 and b==2) or (p==1 and b==1):\r\n print('Bear')\r\nelse:\r\n print('Alien')", "l=[0]*10\r\nfor i in input().split():\r\n l[int(i)]+=1\r\nprint([['Elephant','Bear'][1 in l],'Alien'][max(l) < 4])", "l = list(map(int, input().split()))\n\nl.sort()\n\nk = -1\n\nfor i in l:\n c = 0\n for j in l:\n if i == j:\n c += 1\n if c >= 4:\n k = i\n break\n\nif k == -1:\n print('Alien')\nelse:\n for i in range(4):\n l.remove(k)\n if l[0] == l[1]:\n print('Elephant')\n else:\n print('Bear')\n", "def main():\r\n arr = list(map(int, input().split()))\r\n\r\n required_element = -1\r\n for element in arr:\r\n if arr.count(element) >= 4:\r\n required_element = element\r\n break\r\n\r\n if required_element == -1:\r\n print(\"Alien\")\r\n return\r\n\r\n counter = 4\r\n remaining_sticks = []\r\n for element in arr:\r\n if element == required_element:\r\n if counter > 0:\r\n counter -= 1\r\n continue\r\n else:\r\n remaining_sticks.append(element)\r\n else:\r\n remaining_sticks.append(element)\r\n\r\n if remaining_sticks[0] == remaining_sticks[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = list(map(int, input().split()))\r\nlegs = False\r\nleg = 0\r\nfor i in range(len(a)):\r\n\tif a.count(a[i]) >= 4:\r\n\t\tlegs = True\r\n\t\tleg = a[i]\r\n\t\tbreak\r\nif legs == False:\r\n\tprint (\"Alien\")\r\n\texit()\r\nfor i in range(len(a)):\r\n\tif a[i] == leg:\r\n\t\ta[i] = 0\r\na.sort()\r\n#print (a)\r\nif a[len(a)-1] == a[len(a)-2]:\r\n\tprint (\"Elephant\")\r\nelse:\r\n\tprint (\"Bear\")\r\n\t\r\n\r\n ", "l = list((map(int, input().split())))\r\ncount = [l.count(i) for i in set(l)]\r\nif sorted(count)[-1] < 4 :\r\n print('Alien')\r\nelif 1 in count:\r\n print('Bear')\r\nelse :\r\n print('Elephant')", "sticks = [int(asd) for asd in input().split()]\r\nif len(set(sticks)) > 3:\r\n print(\"Alien\")\r\n exit()\r\nres = max(set(sticks), key=sticks.count)\r\nif sticks.count(res) < 4:\r\n print(\"Alien\")\r\n exit()\r\nsticks2 = []\r\ncnt = 4\r\nfor x in range(sticks.count(res) - 4):\r\n sticks2.append(res)\r\n\r\nfor bruh in sticks:\r\n if bruh != res:\r\n sticks2.append(bruh)\r\n\r\nif len(set(sticks2)) == 1:\r\n print(\"Elephant\")\r\nelif len(set(sticks2)) == 2:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")\r\n", "l=list(map(int,input().split()))\r\ns=list(set(l))\r\nf=0\r\nfor i in s:\r\n if l.count(i)>=4:\r\n f=1\r\n break\r\nif f==1:\r\n if len(s)==1:\r\n print('Elephant')\r\n elif len(s)==2 and l.count(s[0])%2==0:\r\n print('Elephant')\r\n elif len(s)==2 and l.count(s[0])%2!=0:\r\n print('Bear')\r\n elif len(s)==3:\r\n print('Bear')\r\n else:\r\n print('Alien')\r\nelse:\r\n print('Alien')", "def checkLegs(arr):\r\n res = 0\r\n for i in arr:\r\n cnt = 0\r\n for j in arr:\r\n if i == j:\r\n cnt += 1\r\n if cnt >= 4:\r\n res = i\r\n return res\r\n\r\ndef findHead(leg, l):\r\n res = l\r\n for i in range(4):\r\n res.remove(leg)\r\n return res\r\n \r\n\r\nl = list(map(int, input().split()))\r\n\r\nres = \"+\"\r\n\r\nlegs = checkLegs(l)\r\n\r\nif legs > 0:\r\n head = findHead(legs, l)\r\n if head[0] != head[1]:\r\n res = \"Bear\"\r\n else:\r\n res = \"Elephant\"\r\nelse:\r\n res = \"Alien\"\r\n\r\nprint(res)\r\n", "data = [int(i) for i in input().split()]\r\n\r\nd = [0 for i in range(10)]\r\n\r\nfor x in data:\r\n d[x] += 1\r\n\r\npos = [i for i in range(10) if d[i] >= 4]\r\n\r\nif not pos:\r\n print('Alien')\r\nelse:\r\n d[pos[0]] -= 4\r\n rest = [i for i in range(10) if d[i] > 0]\r\n if len(rest) == 1:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\n", "x=list(map(int,input().split()))\r\ny=set(x)\r\nif len(y)==1:\r\n # all 6 same makes an Elephant\r\n print(\"Elephant\")\r\nelif len(y)==2:\r\n # only 2 distinct elements\r\n # if 4-2 combination make it a Elephant\r\n c1=0\r\n c2=0\r\n y=list(y)\r\n for i in x:\r\n if i==y[0]:\r\n c1+=1\r\n elif i==y[1]:\r\n c2+=1\r\n #Now check\r\n if (c1==4 and c2==2) or (c2==4 and c1==2):\r\n print(\"Elephant\")\r\n elif (c1==5 and c2==1) or (c2==5 and c1==1):\r\n print(\"Bear\")\r\n elif c1==3 and c2==3:\r\n print(\"Alien\")\r\nelif len(y)==3:\r\n #only 4 1 1 will make some\r\n c=[0,0,0]\r\n y=list(y)\r\n for i in x:\r\n if i==y[0]:\r\n c[0]+=1\r\n elif i==y[1]:\r\n c[1]+=1\r\n else:\r\n c[2]+=1\r\n if 4 in c:\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")\r\nelif len(y)>=4:\r\n print(\"Alien\")\r\n", "a = list(map(int,input().split()))\r\nk = sorted(list(zip([a.count(c) for c in a],a)))\r\nif k[5][0] < 4:\r\n print('Alien')\r\nelse:\r\n print(('Bear','Elephant')[k[0][1] == k[1][1]])\r\n\r\n", "a,b,c=sorted(list(map(int,input().split()))),0,-1\r\nfor i in [0,1,2]:\r\n if a[i]==a[i+1]==a[i+2]==a[i+3]:\r\n b,c=1,i\r\nif c==-1:print('Alien')\r\nelse:\r\n if a[c-1]!=a[c-2]:print('Bear')\r\n else:print('Elephant')", "a = list(map(int, input().split()))\r\na.sort()\r\n\r\nn1, n2 = None, None\r\n\r\nif a[0] == a[1] == a[2] == a[3]:\r\n n1 = a[4]\r\n n2 = a[5]\r\nelif a[1] == a[2] == a[3] == a[4]:\r\n n1 = a[0]\r\n n2 = a[5]\r\nelif a[2] == a[3] == a[4] == a[5]:\r\n n1 = a[0]\r\n n2 = a[1]\r\nelse:\r\n print(\"Alien\")\r\n exit(0)\r\n\r\nif n1 == n2:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Bear\")\r\n", "inp = list(map(int, input().split()))\r\ninp.sort()\r\nif inp[0] == inp[1] == inp[2] == inp[3]:\r\n m = \"Bear\" if inp[4] < inp[5] else \"Elephant\"\r\nelif inp[1] == inp[2] == inp[3] == inp[4]:\r\n m = \"Bear\" if inp[0] < inp[5] else \"Elephant\"\r\nelif inp[2] == inp[3] == inp[4] == inp[5]:\r\n m = \"Bear\" if inp[0] < inp[1] else \"Elephant\"\r\nelse:\r\n m = \"Alien\"\r\nprint(m)\r\n", "l = list(map(int, input().split()))\n\nd = {}\nfor v in l: d[v] = d.get(v, 0) + 1\n\nis_valid = False\nfor v in d.values():\n is_valid |= v >= 4\n\nif is_valid:\n for v in d.values():\n if v >= 4:\n if v == 4:\n if len(d) == 2: answer = \"Elephant\"\n else: answer = \"Bear\"\n elif v == 5: answer = \"Bear\"\n else: answer = \"Elephant\"\nelse:\n answer = \"Alien\"\n\nprint(answer)", "x=list(map(int,input().split()))\r\nx.sort()\r\nif len(set(x))>3 :\r\n print(\"Alien\")\r\nelif len(set(x))==1:\r\n print(\"Elephant\")\r\nelif len(set(x))==2:\r\n if x.count(x[0])==1 or x.count(x[0])==5:\r\n print(\"Bear\")\r\n elif x.count(x[0])==2 or x.count(x[0])==4:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Alien\")\r\nelif len(set(x))==3:\r\n c=1\r\n for i in range(1,6):\r\n if x[i]==x[i-1]:\r\n c+=1\r\n if c==4:\r\n break\r\n else:\r\n c=1\r\n if c==4:\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")", "#!/usr/bin/env python3\nfrom collections import Counter\nsticks = list(map(int, input().split()))\ncnt_list = Counter(sticks).most_common()\n\nif cnt_list[0][1] == 6:\n print(\"Elephant\")\n exit()\nif cnt_list[0][1] == 5:\n print(\"Bear\")\n exit()\nif cnt_list[0][1] < 4:\n print(\"Alien\")\n exit()\n\nif cnt_list[1][1] == 2:\n print(\"Elephant\")\nelse:\n print(\"Bear\")\n", "A = list(map(int,input().split()))\r\nA.sort()\r\nconf=0\r\nif(A[0]==A[1] and A[1]==A[2] and A[2]==A[3]):\r\n conf=1\r\n if(A[4]==A[5]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelif(A[1]==A[2] and A[2]==A[3] and A[3]==A[4]):\r\n conf=1\r\n if(A[0]==A[5]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelif(A[2]==A[3] and A[3]==A[4] and A[4]==A[5]):\r\n conf=1\r\n if(A[0]==A[1]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n\r\n\r\nif(conf==0):\r\n print(\"Alien\")", "a=[int(x) for x in input().split()]\r\na.sort()\r\nif a[0]!=a[3] and a[1]!=a[4] and a[2]!=a[5]:\r\n print('Alien')\r\nelse:\r\n if len(list(set(a))) >= 4:\r\n print('Alien')\r\n elif len(list(set(a))) == 3:\r\n print('Bear')\r\n elif len(list(set(a))) == 2:\r\n if a.count(max(a)) == 5 or a.count(max(a)) == 1:\r\n print('Bear')\r\n else:\r\n print('Elephant')\r\n else:\r\n print('Elephant')", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\nw = Counter(map(int, input().split()))\r\nif max(w.values()) == 6 or (max(w.values()) == 4 and min(w.values()) == 2) :\r\n print('Elephant')\r\nelif max(w.values()) < 4:\r\n print('Alien')\r\nelse:\r\n print('Bear')", "l = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(6):\r\n if l.count(l[i]) >= 4:\r\n c = l[i]\r\n break\r\nif c:\r\n for i in range(4):\r\n l.remove(c)\r\n if l[0] == l[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelse:\r\n print('Alien')\r\n \r\n \r\n", "s = input().split()\r\na = [0]*9\r\n\r\nfor i in range(6):\r\n a[int(s[i])-1] += 1\r\ni = 0\r\nwhile (i < 8) and (a[i] < 4):\r\n i += 1\r\n \r\nif a[i] >= 4:\r\n if a[i] == 5:\r\n print('Bear')\r\n if a[i] == 6:\r\n print('Elephant')\r\n if a[i] == 4:\r\n j = 0\r\n while (j < 8) and (a[j] != 1) and (a[j] != 2):\r\n j += 1\r\n if a[j] == 1:\r\n print('Bear')\r\n if a[j] == 2:\r\n print('Elephant')\r\n \r\nelse:\r\n print('Alien')", "sticks = list(map(int,input().split()))\r\nhashmap = {}\r\n_max = 0\r\n_min = float('+inf')\r\nfor stick in sticks:\r\n if stick not in hashmap:\r\n hashmap[stick] = 1\r\n else:\r\n hashmap[stick] += 1\r\nfor val in hashmap.values():\r\n _max = max(val,_max)\r\n _min = min(val,_min)\r\nif _max < 4:\r\n print('Alien')\r\nelif _max == 6 or (_max==4 and _min == 2) or (_max==2 and _min == 4):\r\n print('Elephant')\r\nelse:\r\n print('Bear')", "a = list(map(int, input().split()))\na.sort()\nif a[0] == a[1] == a[2] == a[3]:\n s = \"Bear\" if a[4] < a[5] else \"Elephant\"\nelif a[1] == a[2] == a[3] == a[4]:\n s = \"Bear\" if a[0] < a[5] else \"Elephant\"\nelif a[2] == a[3] == a[4] == a[5]:\n s = \"Bear\" if a[0] < a[1] else \"Elephant\"\nelse:\n s = \"Alien\"\nprint(s)\n", "sticks = [int(y) for y in input().split()]\r\n#4 2 5 4 4 4\r\nout = ''\r\nlegs = 0\r\nfor x in sticks[0:3]:\r\n if sticks.count(x) == 6:\r\n out = 'Elephant'\r\n break\r\n elif sticks.count(x)==5:\r\n out = 'Bear'\r\n break\r\n elif sticks.count(x)==4:\r\n legs = x\r\n break\r\nelse:\r\n out = 'Alien'\r\nif not out:\r\n stick1, stick2 = 0,0\r\n for x in sticks:\r\n if x != legs:\r\n if stick1:\r\n stick2 = x\r\n else:\r\n stick1 = x\r\n out = 'Elephant' if stick1 == stick2 else 'Bear'\r\nprint (out)", "inp = list(map(int,input().split()))\r\nr = sorted([inp.count(i) for i in set(inp)])\r\nif (len(r) == 2 and r[0]==2) or len(r) == 1: print(\"Elephant\")\r\nelif (len(r) == 2 and r[1]==5) or (len(r)==3 and r[2]==4): print(\"Bear\")\r\nelse: print(\"Alien\")", "def solve(legs):\r\n\r\n legs.sort()\r\n\r\n\r\n leg_starting_index = -1\r\n for i in range(0,len(legs)-3):\r\n if legs[i] == legs[i+1] == legs[i+2] == legs[i+3]:\r\n leg_starting_index = i\r\n break\r\n\r\n\r\n #3 possibilities if leg_starting_index is found\r\n if leg_starting_index == 1:\r\n return bear_or_elephant_decider(legs,0,5)\r\n elif leg_starting_index == 2:\r\n return bear_or_elephant_decider(legs,0,1)\r\n elif leg_starting_index == 0:\r\n return bear_or_elephant_decider(legs,4,5)\r\n else:\r\n return \"Alien\"\r\n\r\n\r\n\r\ndef bear_or_elephant_decider(legs, index1, index2):\r\n if legs[index1] != legs[index2]:\r\n return \"Bear\"\r\n else:\r\n return \"Elephant\"\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n legs = list(map(int,input().split(\" \")))\r\n print(solve(legs))", "import math\r\ndef fact(n):\r\n ans = 1\r\n for i in range(2, n+1):\r\n ans*= i\r\n return ans\r\ndef comb(n, c):\r\n return fact(n)//(fact(n-c)*c)\r\n\r\nl = list(map(int, input().split()))\r\nd = {}\r\ntwo = 0\r\nfor i in range(6):\r\n if(l[i] in d):\r\n d[l[i]]+=1\r\n else:\r\n d[l[i]] = 1\r\nif(len(d)==1):\r\n if(list(d.values())[0]==6):\r\n print('Elephant')\r\n else:\r\n print('Alien')\r\nelif(len(d) > 3 or len(d)< 2):\r\n print('Alien')\r\nelse:\r\n s = list(d.values())\r\n n = len(s)\r\n if(n==2 and 1 in s or n==3 and 4 in s):\r\n print('Bear')\r\n elif(n==2 and 2 in s):\r\n print('Elephant')\r\n else:\r\n print('Alien')\r\n ", "li = list(map(int, input().split()))\r\nli1 = set(li)\r\nfor i in li1:\r\n\tif li.count(i) >=4:\r\n\t\tbreak\r\nelse:\r\n\tprint('Alien')\r\n\texit()\r\nli2 = []\r\nfor i in li1:\r\n\tif li.count(i) != 4:\r\n\t\tli2.append(i)\r\n \r\nprint('Elephant' if len(li2) ==1 else 'Bear')", "sticks = [int(i) for i in input().split()]\r\nsticks = sorted(sticks)\r\nif sticks[0] == sticks [1] == sticks[2] == sticks[3]:\r\n\tif sticks[4] == sticks[5]:\r\n\t\tprint(\"Elephant\")\r\n\telse:\r\n\t\tprint(\"Bear\")\r\nelif sticks [1] == sticks[2] == sticks[3] == sticks[4]:\r\n\tprint(\"Bear\")\r\nelif sticks [2] == sticks[3] == sticks[4] == sticks[5]:\r\n\tif sticks[0] == sticks[1]:\r\n\t\tprint(\"Elephant\")\r\n\telse:\r\n\t\tprint(\"Bear\")\r\nelse:\r\n\tprint(\"Alien\")", "t = [0]*10\nfor i in input().split():\n\tt[int(i)] += 1\nf=1\nfor i in range(1,10):\n\tif(t[i]==6):\n\t\tprint(\"Elephant\")\n\t\tf=0\n\tif(t[i]==5):\n\t\tprint(\"Bear\")\n\t\tf=0\n\tif(t[i]==4):\n\t\tfor j in range(1,10):\n\t\t\tif(t[j]==1):\n\t\t\t\tprint(\"Bear\")\n\t\t\t\tf=0\n\t\t\t\tbreak\n\t\t\tif(t[j]==2):\n\t\t\t\tprint(\"Elephant\")\n\t\t\t\tf=0\nif(f):\n\tprint(\"Alien\")\n\t\t\t\t\n", "#!python3\n\"\"\"\nAuthor: w1ld [dog] inbox [dot] ru\n\"\"\"\n\nfrom collections import deque, Counter\nimport array\nfrom itertools import combinations, permutations\nfrom math import sqrt\n# import unittest\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_int_array():\n return [int(i) for i in input().strip().split(' ')]\n\n######################################################\n\na = read_int_array()\n\ncounter = [0] * 10\nfor e in a:\n counter[e] += 1\n\nlegs = 0\na = 0\nb = 0\nfor i in range(1, 10):\n if counter[i] >= 4:\n legs = i\n counter[i] -= 4\n\n if counter[i] > 0 and a == 0:\n a = i\n counter[i] -= 1\n\n if counter[i] > 0:\n b = i\n counter[i] -= 1\n\nif legs == 0:\n print('Alien')\nelse:\n print('Bear' if a != b else 'Elephant')\n \n\n", "def main():\r\n val = input()\r\n list = []\r\n list = val.split(\" \")\r\n \r\n list.sort()\r\n \r\n if list[0] == list[5]:\r\n print(\"Elephant\")\r\n elif (list[0] == list[3] and list[4] != list[5]):\r\n print(\"Bear\")\r\n elif (list[1] == list[4] and list[0] != list[5]):\r\n print(\"Bear\")\r\n elif (list[2] == list[5] and list[1] != list[0]):\r\n print(\"Bear\")\r\n elif (list[0] == list[3] and list[4] == list[5]):\r\n print(\"Elephant\")\r\n elif (list[1] == list[4] and list[0] == list[5]):\r\n print(\"Elephant\")\r\n elif (list[2] == list[5] and list[1] == list[0]):\r\n print(\"Elephant\") \r\n else:\r\n print(\"Alien\")\r\n \r\nif __name__ == '__main__':\r\n main()", "\r\nl=list(map(int,input().split()))\r\ns=[l.count(i) for i in l]\r\nprint( 'Alien' if max(s)<4 else 'Bear' if 1 in s else 'Elephant')", "l = list(map(int,input().split()))\r\ns = [l.count(i) for i in l]\r\nprint( 'Alien' if max(s)<4 else 'Bear' if 1 in s else 'Elephant')", "import sys\r\n\r\na=list(map(int,input().split()))\r\na.sort()\r\ns=set(a)\r\nans=\"Alien\"\r\nlegs=0\r\nfor i in s:\r\n if a.count(i)>=4:\r\n legs=i\r\n break\r\nelse:\r\n print(ans)\r\n sys.exit()\r\nfor i in range(4): a.remove(legs)\r\nif a[0]==a[1]:\r\n ans=\"Elephant\"\r\nelse:\r\n ans=\"Bear\"\r\nprint(ans)\r\n", "a = sorted(list(input().split()))\r\n\r\nif a.count(a[0]) >= 4:\r\n if a[-1] > a[-2]:\r\n print('Bear')\r\n else:\r\n print('Elephant')\r\nelif a.count(a[1]) >= 4:\r\n if a[-1] > a[0]:\r\n print('Bear')\r\n else:\r\n print('Elephant')\r\nelif a.count(a[2]) >= 4:\r\n if a[1] > a[0]:\r\n print('Bear')\r\n else:\r\n print('Elephant')\r\nelse:\r\n print('Alien')\r\n", "l1=list(map(int,input().split()))\r\ndic={}\r\nfor item in l1:\r\n dic.setdefault(item,0)\r\n dic[item]+=1\r\nif 4 in dic.values():\r\n if len(dic)==3: print(\"Bear\")\r\n elif len(dic)<3: print(\"Elephant\")\r\nelif 5 in dic.values(): print(\"Bear\")\r\nelif 6 in dic.values(): print(\"Elephant\")\r\nelse: print(\"Alien\")", "from collections import defaultdict\na = defaultdict(int)\nfor i in map(int, input().split()):\n a[i] += 1\nd = defaultdict(int)\nfor v in a.values():\n d[v] += 1\nif d[6] or (d[4] and d[2]):\n print('Elephant')\nelif d[5] or (d[4] and d[1] == 2):\n print('Bear')\nelse:\n print('Alien')\n", "li= list(map(int, input().split()))\r\nli.sort()\r\na,b,c,d,e,f= li\r\n#print(a,b,c,d,e,f)\r\nif a==b and b==c and c==d:\r\n if e==f:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelif b==c and c==d and d==e:\r\n if a==f:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelif c==d and d==e and e==f:\r\n if a==b:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelse:\r\n print('Alien')\r\n", "# author: ankan2526\r\n\r\nimport math, bisect, heapq, random, sys, itertools\r\ninput=sys.stdin.readline\r\nints = lambda : list(map(int,input().split()))\r\n\r\np = 10**9+7\r\n\r\na=ints()\r\nstore={}\r\nfor i in a:\r\n if i not in store:\r\n store[i]=0\r\n store[i]+=1\r\nlegs=False\r\nfor i in store:\r\n if store[i]>=4:\r\n store[i]-=4\r\n if store[i]==0:\r\n store.pop(i)\r\n legs=True\r\n break\r\nif legs==False:\r\n print('Alien')\r\nelse:\r\n if len(store)==1:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "x=input().split()\nd={}\nb=0\na=0\nq=0\np=0\nc=0\nfor i in x:\n if i not in d:\n d[i]=1\n else:\n d[i]+=1 \nfor j in set(x):\n if d[j]==4:\n c=1\n elif d[j]==5:\n p=1\n elif d[j]==6:\n q=1\n elif d[j]==2:\n a=1\n elif d[j]==1:\n b+=1\nif (c==1 and a==1) or q==1:\n print('Elephant')\nelif (c==1 and b==2) or (p==1 and b==1):\n print('Bear')\nelse:\n print('Alien')\n \t \t\t\t\t \t \t\t\t \t\t \t\t \t", "l = [0] * 10\r\nfor i in input().split():\r\n l[int(i)] += 1\r\nl.sort()\r\nif l[-1] >= 4:\r\n if l[-1] == 6 or l[-2] == 2:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")", "bear = 'Bear'\r\nelephant = 'Elephant'\r\nnot_both = 'Alien'\r\n\r\nsticks = [int(x) for x in input().split()]\r\nanimal = {sticks.count(stick) for stick in set(sticks)}\r\n\r\nif animal == {6} or animal == {2, 4}:\r\n\tprint(elephant)\r\nelif animal == {1, 4} or animal == {1, 5}:\r\n\tprint(bear)\r\nelse:\r\n\tprint(not_both)", "m=[0]*10\r\nfor i in map(int,input().split()):m[i]+=1\r\nfor i in range(10):\r\n if m[i]>=4:\r\n m[i]-=4\r\n print([\"Elephant\",\"Bear\"][max(m)%2])\r\n break\r\nelse:print(\"Alien\")", "stick=[]\r\nIN=input()\r\nstick=list(map(int,IN.split()))\r\nstick.sort()\r\ncount=0\r\nrem=0\r\nfor k in range(0,6):\r\n if(stick.count(stick[k])>=4):\r\n rem=stick[k]\r\nif (rem==0):\r\n print(\"Alien\")\r\nelse:\r\n for k in range(0,4):\r\n stick.remove(rem)\r\n if(stick[0]==stick[1]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n\r\n\"\"\"\r\n if stick[k-1]!=stick[k]:\r\n count=count+1\r\n #print(\"I have compared\",stick[k-1],\"and\",stick[k],\"::: count+1 ::: k =\",k)\r\nif (count==0):\r\n print(\"Elephant\")\r\nelif (count==1):\r\n if(stick.count(stick[0])==1):\r\n print(\"Bear\")\r\n elif (stick.count(stick[0])==2):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Alien\")\r\nelif (count==2):\r\n if (stick.count(stick[0])==1 and stick.count(stick[1])==1) or (stick.count(stick[0])==1 and stick.count(stick[5])==1):\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")\r\n #print(count)\r\nelse:\r\n print(\"Alien\")\r\n #print(count)\r\n\"\"\"\r\n\r\n \r\n \r\n", "arr = list(map(int, input().strip().split()))\n# arr = [4, 2, 5, 4, 4, 4]\narr.sort()\nfreq = [0]*10\nfor i in arr:\n\tfreq[i] += 1\nif max(freq) < 4:\n\tprint('Alien')\nelse:\n\tif 1 not in freq:\n\t\tprint('Elephant')\n\telse:\n\t\tprint('Bear')", "n = input().split()\r\nx = \"\" \r\nfor item in n:\r\n if int(n.count(item)) < 4:\r\n x += item\r\nif len(x) > 2:\r\n print(\"Alien\")\r\nelif len(x) < 2:\r\n if len(x) == 1:\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")\r\nelse:\r\n if x[0] == x[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "\ndef solve():\n\ta = set(eins)\n\tb = []\n\tfor el in a:\n\t\tcount = 0\n\t\tfor el_2 in eins:\n\t\t\tif el == el_2:\n\t\t\t\tcount += 1\n\t\tb.append(count)\n\tif max(b) < 4:\n\t\treturn 'Alien'\n\telse:\n\t\tif len(a) == 3:\n\t\t\treturn 'Bear'\n\t\telif len(a) == 1:\n\t\t\treturn 'Elephant'\n\t\telif len(a) == 2:\n\t\t\tif max(b) == 4:\n\t\t\t\tans = 'Elephant'\n\t\t\telif max(b) == 5:\n\t\t\t\tans = 'Bear'\n\t\t\treturn ans\n\t\telse:\n\t\t\treturn 'Alien'\n\t\t\t\ndummy_1 = input().split()\neins = list(map(int,dummy_1))\nprint(solve())\n", "\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\nf = list(set(t))\r\n\r\n\r\nleg=0\r\nbody=[]\r\nfor k in f:\r\n if t.count(k)>=4:\r\n leg+=1\r\n for j in range(t.count(k)-4):\r\n body.append(k)\r\n else:\r\n for i in range(t.count(k)):\r\n body.append(k)\r\n\r\nif leg>0:\r\n if len(body)>=2:\r\n body.sort()\r\n if body[0]<body[1]:\r\n print('Bear')\r\n elif body[0]==body[1]:\r\n print('Elephant')\r\n else:\r\n print('Alien')\r\nelse:\r\n print('Alien')\r\n \r\n \r\n\r\n", "import sys\na = [int(_) for _ in input().split()]\na.sort()\nfor i in range(len(a)):\n if a.count(a[i]) >= 4:\n for j in range(4):\n del a[i]\n break\nelse:\n print(\"Alien\")\n sys.exit(0)\nif a[0] == a[1]:\n print(\"Elephant\")\nelse:\n print(\"Bear\")\n", "line = input().split(' ')\narr = sorted([int(a) for a in line])\n\nco = {}\nfor a in arr:\n\tco[a] = co.get(a, 0) + 1\n\nfound = None\nfor k, c in co.items():\n\tif c >= 4:\n\t\tfound = k\n\nif found is None:\n\tprint('Alien')\nelse:\n\tfor i in range(4):\n\t\tarr.remove(found)\n\tif arr[1] > arr[0]:\n\t\tprint('Bear')\n\telse:\n\t\tprint('Elephant')", "L = list(map(int, input().split()))\r\nt = 0\r\na = 1\r\nfor i in L:\r\n if L.count(i) >= 4:\r\n t = i\r\n a = 0\r\n break\r\nif a == 1:\r\n print('Alien')\r\n quit()\r\nfor i in range(4):\r\n del L[L.index(t)]\r\nif L[0] != L[1]:\r\n print('Bear')\r\nelse:\r\n print('Elephant')\r\n", "A=[]\r\nA=list(map(int,input().split()))\r\nA.sort()\r\nx=A[0]\r\nB=[]\r\nB.append(x)\r\nfor i in range(1,6):\r\n if(x!=A[i]):\r\n x=A[i]\r\n B.append(x)\r\nm=0\r\nC=[]\r\nfor i in range(len(B)):\r\n if(A.count(B[i])>=4):\r\n v=B[i]\r\n m=1\r\n if(A.count(B[i])==6):\r\n C.append(A[0])\r\n C.append(A[0])\r\n if(A.count(B[i])==5):\r\n if(A[0]==A[1]):\r\n C.append(A[0])\r\n C.append(A[5])\r\n else:\r\n C.append(A[0])\r\n C.append(A[1])\r\n \r\n if(A.count(B[i])==4):\r\n if(A[0]==A[1] and A[1]==A[2]):\r\n C.append(A[5])\r\n C.append(A[4])\r\n if(A[1]==A[2] and A[2]==A[3]):\r\n C.append(A[0])\r\n C.append(A[5])\r\n if(A[3]==A[4] and A[4]==A[5]):\r\n C.append(A[0])\r\n C.append(A[1])\r\nif(m==0):\r\n print(\"Alien\")\r\nelse:\r\n x=C[0]\r\n y=C[1]\r\n if(x==y):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n \r\n", "l=list(map(int,input().split()))\r\np=[]\r\nfor i in set(l):\r\n p=p+[l.count(i)]\r\nq=1\r\nif 4 in p or 6 in p or 5 in p:\r\n if 1 in p:\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Alien\")", "l=list(map(int,input().split()))\r\na=set(l)\r\nif(len(a)==1):\r\n print('Elephant')\r\nelse:\r\n for i in a:\r\n if l.count(i)==4:\r\n if len(a)==3:\r\n print('Bear')\r\n break\r\n \r\n elif len(a)==2:\r\n print('Elephant')\r\n break\r\n \r\n elif l.count(i)==5:\r\n if(len(a)==2):\r\n print('Bear')\r\n break\r\n else:\r\n print('Alien')", "from collections import Counter\r\n\r\ndef solve(c):\r\n if c.most_common()[0][1] >= 4:\r\n mc = []\r\n for x, n in c.most_common():\r\n mc += [x] * n\r\n for _ in range(4):\r\n mc.pop(0)\r\n x = mc.pop(0)\r\n y = mc.pop(0)\r\n return \"Elephant\" if x == y else \"Bear\"\r\n return \"Alien\"\r\n\r\nl = [int(s) for s in input().split()]\r\nc = Counter(l)\r\nprint(solve(c))\r\n", "l_s = list(map(int, input().split()))\r\ns_s = set(l_s)\r\n\r\nf = False\r\nc = 0\r\n\r\nfor s in s_s:\r\n t_c = l_s.count(s)\r\n if t_c >= 4:\r\n f = True\r\n c = t_c\r\n break\r\n\r\nif not f:\r\n print(\"Alien\")\r\nelse:\r\n if len(s_s) == 3 or c == 5:\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\") ", "l=list(map(int,input().split()))\r\nc={}\r\nfor i in l:\r\n c[i]=c.get(i,0)+1\r\n\r\nk=len(c.keys())\r\nv=max(c.values())\r\nif v<4:\r\n print(\"Alien\")\r\nelse:\r\n if k==3 or v==5:\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")\r\n", "arr = [int(x) for x in input().split()]\r\narr.sort()\r\nf=0\r\nfor i in range(3):\r\n if arr[i] == arr[i+3]:\r\n f=1\r\n if i==0:\r\n if arr[4]==arr[5]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n if i==1:\r\n if arr[0]==arr[5]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n if i==2:\r\n if arr[0]==arr[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n break;\r\nif f==0:\r\n print(\"Alien\")\r\n \r\n \r\n \r\n ", "string = input()\r\nsticks = string.split(\" \")\r\nfor x in range(6):\r\n sticks[x] = int(sticks[x])\r\nx = 0\r\nwhile x < 6:\r\n a = sticks.count(sticks[x])\r\n if a >= 4:\r\n break\r\n x += 1\r\nif x < 6:\r\n a = sticks[x]\r\n for y in range(4):\r\n sticks.remove(a)\r\n if sticks[0] == sticks[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")", "a=sorted(list(map(int,input().split())))\r\nif a[0]==a[1]==a[2]==a[3]:b,c,d=4,5,1\r\nelif a[2]==a[3]==a[4]==a[5]:b,c,d=0,1,1\r\nelif a[1]==a[2]==a[3]==a[4]:b,c,d=0,5,1\r\nelse:print('Alien');d=0\r\nif d:\r\n if a[b]==a[c]:print('Elephant')\r\n else:print('Bear')\r\n", "t={}\r\nfor i in input().split():t[i]=t.get(i,0)+1\r\nt=t.values()\r\nprint([['Alien']*2,['Elephant','Bear']][max(t)>=4][1 in t])", "l = [int(x) for x in input().split()]\r\ntable = {}\r\nres = 'Alien'\r\ncheck = 0\r\nfor x in l:\r\n if x in table:\r\n table[x] += 1\r\n else:\r\n table[x] = 1\r\n\r\nfor key,value in table.items():\r\n if value == 6:\r\n res = 'Elephant'\r\n elif value == 5:\r\n res = 'Bear'\r\n elif value == 4:\r\n check = 1\r\nfor key,value in table.items():\r\n if check == 1 and value ==2 :\r\n res = 'Elephant'\r\n elif check == 1 and value ==1:\r\n res = 'Bear'\r\n#print(table)\r\nprint(res)\r\n#print(\"check=\",check)\r\n \r\n", "from collections import Counter\r\nc=list(map(int,input().split()))\r\nd=Counter(c).most_common()\r\n\r\nif d[0][1]==6:\r\n\tprint(\"Elephant\")\r\nelif d[0][1]==5:\r\n\tprint(\"Bear\")\r\nelse:\r\n\tif d[0][1]==4 and d[1][1]==2:\r\n\t\tprint(\"Elephant\")\r\n\telif d[0][1]==4 and d[1][1]==1:\r\n\t\tprint(\"Bear\")\r\n\telse:\r\n\t\tprint(\"Alien\")\r\n\t\t\r\n", "a=[int(i) for i in input().split(\" \")]\r\ndif=[]\r\nk=0\r\nn=0\r\nfor i in range(len(a)):\r\n if dif.count(a[i])==0:\r\n dif.append(a[i])\r\n\r\na=sorted(a)\r\nif a.count(a[3])>=4:\r\n n=a[3]\r\n for i in range(4):\r\n del a[a.index(n)]\r\n if a[0]==a[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")\r\n", "arr = [int(i) for i in input().split()]\nfor i in arr:\n r = 0\n for j in arr:\n if i == j:\n r += 1\n if r >= 4:\n z = i\n break\nif r < 4:\n print('Alien')\nelse:\n a, b = 0, 0\n for i in arr:\n if i != z:\n if a == 0:\n a = i\n else:\n b = i\n if r == 6 or a == b:\n print('Elephant')\n else:\n print('Bear')\n", "p=input().split()\r\nl=[]\r\ni=0\r\nwhile i<6:\r\n l.append(int(p[i]))\r\n i=i+1\r\nl.sort()\r\nflag=0\r\ni=0\r\nwhile i<3:\r\n if l[i]==l[i+1]and l[i+1]==l[i+2]and l[i+2]==l[i+3]:\r\n flag=1\r\n break\r\n i=i+1\r\nif flag==0:\r\n print(\"Alien\")\r\nelse:\r\n if i==0:\r\n if l[4]==l[5]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n elif i==1:\r\n if l[0]==l[5]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n else:\r\n if l[0]==l[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n", "x=input().split()\r\nca=0\r\nflag=0\r\nst=0\r\nen=0\r\nfor i in range (0,6):\r\n z=x.count(x[i])\r\n if ( z >= 4 ):\r\n flag=1\r\n else :\r\n if ca==0 :\r\n st=x[i]\r\n ca=1\r\n else :\r\n en=x[i]\r\nif not flag :\r\n print(\"Alien\")\r\nelse :\r\n if ( st == en ):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n", "numbers = [int(x) for x in input().split()]\r\namounts = sorted(set(numbers.count(x) for x in numbers))\r\nif (amounts == [1,4]) or (amounts == [1,5]): print('Bear')\r\nelif (amounts == [2,4]) or (amounts == [6]) : print('Elephant')\r\nelse: print('Alien');", "l=[int(i) for i in input( ).split( )]\r\nfq=10*[0]\r\nflag=False\r\nfor i in range(len(l)):\r\n fq[l[i]]+=1\r\nre=0\r\nfor i in range(10):\r\n if fq[i]>=4:\r\n re=i\r\n flag=True\r\n\r\nif not flag:\r\n print('Alien')\r\n exit( )\r\nelse:\r\n for i in range(4):\r\n l.remove(re)\r\n if l[0]==l[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\n \r\n", "matches = list(input().split())\r\namount = len(matches)\r\ncount_list = [0] * 10\r\nfor match in matches:\r\n count_list[int(match) - 1] += 1\r\nmost_often = max(count_list)\r\nif most_often >= 6:\r\n print('Elephant')\r\nelif most_often >= 4:\r\n flag = 0\r\n for count in count_list:\r\n if count >= 2 and count != most_often:\r\n flag = 1\r\n if flag == 1:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelse:\r\n print('Alien')\r\n", "lengths = [0] * 10\r\nfor i in input().split():\r\n lengths[int(i)] += 1\r\nif 4 in lengths and 1 in lengths or 5 in lengths:\r\n print(\"Bear\")\r\nelif 4 in lengths and 2 in lengths or 6 in lengths:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Alien\")\r\n", "l=list(map(int,input().split()))\r\nl1=list(set(l))\r\nif(len(l1)==1):\r\n print(\"Elephant\")\r\nelif(len(l1)==2):\r\n a=l.count(l1[0])\r\n b=l.count(l1[1])\r\n if(a==4 or b==4):\r\n print(\"Elephant\")\r\n elif(a==5 or b==5):\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")\r\nelif(len(l1)==3):\r\n a=l.count(l1[0])\r\n b=l.count(l1[1])\r\n c=l.count(l1[2])\r\n if(a==4 or b==4 or c==4):\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")\r\nelse:\r\n print(\"Alien\")", "a = input()\nA = []\nfor i in a.split():\n A.append(i)\nB = list(set(A))\nC = []\nfor j in range(0,len(B)):\n C.append(0)\nfor k in range(0,len(B)):\n for l in range(0,6):\n if A[l] == B[k]:\n C[k] = C[k]+1\nif len(C)>3:\n print('Alien')\nelif len(C) == 1:\n print('Elephant')\nelif len(C) == 2:\n if C[0] == 4 or C[1] == 4:\n print('Elephant')\n elif C[1] == 1 or C[0] == 1:\n print('Bear')\n else:\n print('Alien')\nelif len(C) == 3:\n if C[0] == 4 or C[1] == 4 or C[2] == 4:\n print('Bear')\n else:\n print('Alien')", "n=list(map(int,input().split()))\r\nm=set(n)\r\nflag=0\r\nlista=[]\r\nfor i in m:\r\n if n.count(i)>=4:\r\n flag=1\r\n j=0\r\n count=0\r\n while(count!=4):\r\n n.remove(i)\r\n count=count+1\r\n break\r\nmini=min(n)\r\nmaxi=max(n)\r\nif flag==0:\r\n print('Alien')\r\nelif mini==maxi:\r\n print('Elephant')\r\nelif mini<maxi:\r\n print('Bear')\r\nelse:\r\n print('Alien')\r\n \r\n\r\n \r\n ", "a=list(map(int,input().split()))\r\na.sort()\r\nif a[0]==a[1] and a[0]==a[2] and a[0]==a[3]:\r\n\tif a[4]==a[5]:\r\n\t\tans=\"Elephant\" \r\n\telse:\r\n\t\tans=\"Bear\"\r\nelif a[1]==a[4] and a[1]==a[2] and a[1]==a[3]:\r\n\tif a[0]==a[5]:\r\n\t\tans=\"Elephant\" \r\n\telse:\r\n\t\tans=\"Bear\"\r\nelif a[2]==a[5] and a[2]==a[4] and a[2]==a[3]:\t\r\n\tif a[0]==a[1]:\r\n\t\tans=\"Elephant\" \r\n\telse:\r\n\t\tans=\"Bear\"\r\nelse:\r\n\tans=\"Alien\"\r\nprint(ans)", "from collections import Counter\r\n\r\narr=list(map(int,input().split()))\r\nmp=list(Counter(arr).values())\r\nmp.sort(reverse=True)\r\nif mp[0]<4:\r\n print(\"Alien\")\r\nelse:\r\n if mp==[4,2] or mp==[6]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "lis=input().split()\r\nnlis=sorted(lis)\r\nif nlis[0]==nlis[1]==nlis[2]==nlis[3]:\r\n\tif nlis[4]==nlis[5]:\r\n\t\tprint('Elephant')\r\n\telse:\r\n\t\tprint('Bear')\r\nelif nlis[4]==nlis[1]==nlis[2]==nlis[3]:\r\n\tif nlis[0]==nlis[5]:\r\n\t\tprint('Elephant')\r\n\telse:\r\n\t\tprint('Bear')\r\nelif nlis[4]==nlis[5]==nlis[2]==nlis[3]:\r\n\tif nlis[0]==nlis[1]:\r\n\t\tprint('Elephant')\r\n\telse:\r\n\t\tprint('Bear')\r\nelse:\r\n\tprint('Alien')", "l = list(map(int,input().split()))\r\nd = dict()\r\nfor i in l:\r\n if not (i in d) :\r\n d[i] = 1\r\n else :\r\n d[i] +=1\r\ns = []\r\nfor i in d :\r\n s.append(d[i])\r\ns.sort()\r\nif s == [2,4] or s == [6]:\r\n print(\"Elephant\")\r\nelif s == [1,1,4] or s == [1,5]:\r\n print(\"Bear\")\r\nelse :\r\n print(\"Alien\")", "a = [int(x) for x in input().split()]\r\na.sort()\r\ncek = False\r\nif(a[2]==a[3]):\r\n\tif(a[2]!=a[1]):\r\n\t\tif(a[3]==a[4] and a[4]==a[5]):\r\n\t\t\tif(a[1]==a[0]):\r\n\t\t\t\tprint ('Elephant')\r\n\t\t\telse:\r\n\t\t\t\tprint ('Bear')\r\n\t\telse:\r\n\t\t\tprint ('Alien')\r\n\telse:\r\n\t\tif(a[1]==a[0]):\r\n\t\t\tif(a[4]==a[5]):\r\n\t\t\t\tprint ('Elephant')\r\n\t\t\telse:\r\n\t\t\t\tprint ('Bear')\r\n\t\telse:\r\n\t\t\tif(a[3]==a[4]):\r\n\t\t\t\tif(a[0]==a[5]):\r\n\t\t\t\t\tprint ('Elephant')\r\n\t\t\t\telse:\r\n\t\t\t\t\tprint ('Bear')\r\n\t\t\telse:\r\n\t\t\t\tprint ('Alien')\r\nelse:\r\n\tprint ('Alien')", "# LUOGU_RID: 111792305\na, d = input().split(), {}\r\nt = (\"Elephant\", \"Bear\", \"Alien\")\r\n\r\nfor x in a:\r\n if x in d: d[x] += 1\r\n else: d[x] = 1\r\n\r\nx = max(d.values())\r\nif x < 4: f = 2\r\nelif x == 4: f = len(d) > 2\r\nelse: f = x == 5\r\nprint(t[f])", "data=list(map(int,input().split()))\r\ndi={}\r\nfor z in data:\r\n if z in di:\r\n di[z]+=1\r\n else:\r\n di[z]=1\r\n\r\nval=list(di.values())\r\n\r\nif 4 in val or 5 in val or 6 in val:\r\n if len(val)==1:\r\n print('Elephant')\r\n elif len(val)==2 and 2 in val:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelse:\r\n print('Alien')", "l = list(map(int, input().split()))\r\ng = [l.count(v) for v in set(l)]\r\nif max(g) < 4:\r\n print('Alien')\r\nelse:\r\n if (len(g) == 3) or (len(g) == 2 and max(g) == 5):\r\n print('Bear')\r\n else:\r\n print('Elephant')\r\n\r\n", "a = list(map(int, input().split()))\r\nb = [0] * 10\r\nfor i in a:\r\n b[i] += 1\r\nf = 0\r\nfor i in range(10):\r\n if b[i] >= 4:\r\n b[i] -= 4\r\n f = 1\r\n break\r\nif f == 0:\r\n print('Alien')\r\nelse:\r\n if max(b) == 2:\r\n print('Elephant')\r\n else:\r\n print('Bear')", "a=list(map(int,input().split()))\r\na=sorted(a,key=a.count)\r\nif a[2]!=a[-1]:\r\n print(\"Alien\")\r\nelif a[0]==a[1]:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Bear\")\r\n", "import sys\r\na=[int(i) for i in input().split(\" \")]\r\nb=[]\r\nc=[]\r\nfor i in range(10):\r\n b.append(0)\r\nfor i in range(6):\r\n b[a[i]]+=1\r\nfor i in range(10):\r\n if b[i]>0:\r\n c.append(b[i])\r\n else:\r\n c.append(7)\r\nprint(\"Elephant\" if max(b)==6 else (\"Elephant\" if (max(b)==4 and min(c)==2) else (\"Bear\" if (max(b)==4 and min(c)==1) else (\"Bear\" if max(b)==5 else \"Alien\"))))\r\n", "l = list(map(int, input().split(\" \")))\ns = list(set(l))\nm = max(list(map(lambda x: l.count(x), s)))\nif m < 4:\n print(\"Alien\")\nelif m == 5 or len(s) == 3:\n print(\"Bear\")\nelse:\n print(\"Elephant\")\n", "l=list(map(int,input().split()))\r\ns=list(set(l))\r\nd=-1\r\nf=0\r\nfor i in range(len(s)):\r\n x=l.count(s[i])\r\n if(x>=4):\r\n d=s[i]\r\n f=1\r\nif(f==0):\r\n print(\"Alien\")\r\nelse:\r\n for i in range(0,4):\r\n l.remove(d)\r\n if(l[0]==l[-1]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "data = list(map(int,input().split()))\r\nflag = 0\r\nelementR = -1\r\nfor element in data:\r\n if data.count(element) >= 4:\r\n elementR = element\r\n flag = 1\r\n break\r\n\r\nif flag == 0:\r\n print('Alien')\r\nelse:\r\n for i in range(0,4):\r\n data.remove(elementR)\r\n if data[0] == data[-1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')", "if __name__ == '__main__':\r\n Y = lambda: list(map(int, input().split()))\r\n P = lambda: map(int, input().split())\r\n\r\n a = Y()\r\n a = sorted(a, key=a.count)\r\n \r\n print(\"Alien\" if a[2] != a[-1] else \"Elephant\" if a[0] == a[1] else \"Bear\")", "a = input().split()\nk = [a.count(c) for c in a]\nprint((('Elephant','Bear')[1 in k],'Alien')[max(k) < 4])", "arr = list(map(int,input().split()))\r\ndic = {}\r\nfor i in arr:\r\n if i not in dic:\r\n dic[i] = 1\r\n else:\r\n dic[i] += 1\r\nlength = len(dic)\r\nif length==1:\r\n print('Elephant')\r\nelif length==2:\r\n checkk = 0\r\n for i in dic:\r\n if dic[i] == 4:\r\n checkk = 1\r\n break\r\n elif dic[i]==5:\r\n checkk = 2\r\n break\r\n if checkk == 1:\r\n print('Elephant')\r\n elif checkk == 2:\r\n print('Bear')\r\n else:\r\n print('Alien')\r\nelif length==3:\r\n check = 0\r\n for i in dic:\r\n if dic[i]==4:\r\n check = 1\r\n break\r\n if check==1:\r\n print('Bear')\r\n else:\r\n print('Alien')\r\nelse:\r\n print('Alien')\r\n", "ls = [0] * 9\nfor i in input().split():\n ls[int(i) - 1] += 1\nx = [i for i in ls if i > 0]\nif x == [6] or x == [2, 4] or x == [4, 2]:\n print(\"Elephant\")\nelif x == [1,1,4] or x == [1,4,1] or x == [4,1,1] or x == [1,5] or x == [5,1]:\n print(\"Bear\")\nelse:\n print(\"Alien\")\n", "l=list(map(int,input().split()))\r\nsl=list(set(l))\r\nt=l\r\nfor i in sl:\r\n if l.count(i)>=4:\r\n for __ in range(4):\r\n t.remove(i)\r\n if t[0]==t[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\n break\r\nelse:\r\n print('Alien')\r\n", "L = list(map(int, input().split(' ')))\r\nD = {}\r\nfor i in L :\r\n if i in D : D[i] += 1\r\n else : D[i] = 1\r\n\r\nL2 = []\r\nfor i in D :\r\n L2.append([i,D[i]])\r\n\r\nL2.sort(key = lambda x : -x[1])\r\n\r\nBear = False\r\nElephant = False\r\nAlien = False\r\n\r\nif len(L) < 6 or L2[0][1] < 4: Alien = True\r\nelif len(L2) == 1 : Elephant = True\r\nelif len(L2) == 2 and L2[0][1] == 4 : Elephant = True\r\nelse : Bear = True\r\n \r\n\r\nif Bear : print(\"Bear\")\r\nif Elephant : print(\"Elephant\")\r\nif Alien : print(\"Alien\")\r\n", "a = list(map(int,input().split()))\r\na.sort()\r\nif a[0] == a[3] and a[4] == a[5] or a[0] == a[1] and a[2] == a[5] or a[1] == a[4] and a[0] == a[5]: print(\"Elephant\")\r\nelif a[0] == a[3] and a[4] != a[5] or a[0] != a[1] and a[2] == a[5] or a[1] == a[4] and a[0] != a[5]: print(\"Bear\")\r\nelse: print(\"Alien\")", "x = list(map(int,input().split()))\r\n\r\ny = max(x,key=x.count)\r\nz = x.count(y)\r\n\r\nwhile(y in x):\r\n x.remove(y)\r\na = len(x)\r\nif(z < 4):\r\n print(\"Alien\")\r\nelif(a == 0 or a == 2 and x[0] == x[1]):\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Bear\")\r\n", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif l[2]!=l[3]:\r\n print(\"Alien\")\r\nelse:\r\n k=l[2];t=l.count(k)\r\n if t>=4:\r\n for i in range(4):\r\n del(l[l.index(k)])\r\n if l[0]==l[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")\r\n\r\n", "a = [int(x) for x in input().split()]\r\nfinish = False\r\na.sort()\r\nfor i in range (0, 3):\r\n if (a[i] == a[i + 3]):\r\n left = i\r\n hf = []\r\n for j in range (0, 6):\r\n if j < left or j > left + 3:\r\n hf.append(a[j])\r\n if hf[0] != hf[1]:\r\n print(\"Bear\")\r\n finish = True\r\n else:\r\n print(\"Elephant\")\r\n finish = True\r\n break\r\n\r\nif not finish:\r\n print(\"Alien\")", "a = map(int,input().split())\r\nb = {}\r\nfor i in a:\r\n\tif i not in b:\r\n\t\tb[i]=1\r\n\telse:\r\n\t\tb[i]=b[i]+1\r\nflag = 0\r\nfor i in b:\r\n\tif b[i]>3:\r\n\t\tflag = 1\r\n\t\tbreak\t\r\nif flag==0:\r\n\tprint (\"Alien\")\r\nelse:\r\n\tb[i] = b[i]-4\r\n\tif(b[i]==0):\r\n\t\tdel b[i]\r\n\tif len(b)==1:\r\n\t\tprint (\"Elephant\")\r\n\telse:\r\n\t\tprint (\"Bear\")", "L=list(map(int,input().split()))\r\nL.sort()\r\n\r\nif(L[0]==L[3]):\r\n if(L[4]<L[5]):\r\n print(\"Bear\")\r\n elif(L[4]==L[5]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Alien\")\r\nelif(L[5]==L[2]):\r\n if(L[0]<L[1]):\r\n print(\"Bear\")\r\n elif(L[0]==L[1]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Alien\")\r\nelif(L[1]==L[4]):\r\n if(L[0]<L[5]):\r\n print(\"Bear\")\r\n elif(L[0]==L[5]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Alien\")\r\nelse:\r\n print(\"Alien\")\r\n \r\n", "sticks=[int(x) for x in input().split()]\r\nflag=True\r\nfor i in sticks:\r\n num=0\r\n for j in sticks:\r\n if j==i:\r\n num=num+1\r\n if num>=4:\r\n flag=False\r\n leg=i\r\n break\r\nif flag:\r\n print('Alien')\r\nelse:\r\n sticks.remove(leg)\r\n sticks.remove(leg)\r\n sticks.remove(leg)\r\n sticks.remove(leg)\r\n if sticks[0]==sticks[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\n \r\n", "def bear_elephant(a, b):\r\n print(\"Bear\" if a != b else \"Elephant\")\r\n\r\n\r\nl = sorted(map(int, input().split()))\r\nif l[0] == l[1] == l[2] == l[3]:\r\n bear_elephant(l[4], l[5])\r\nelif l[1] == l[2] == l[3] == l[4]:\r\n bear_elephant(l[0], l[5])\r\nelif l[2] == l[3] == l[4] == l[5]:\r\n bear_elephant(l[0], l[1])\r\nelse:\r\n print(\"Alien\")", "ls = list(map(int, input().split()))\r\nfreq = {}\r\nfor x in ls:\r\n if not x in freq:\r\n freq[x] = 0\r\n freq[x] += 1\r\nflag = None\r\nfor (k, v) in freq.items():\r\n if v >= 4:\r\n flag = k\r\n break\r\nif not flag:\r\n print('Alien')\r\nelse:\r\n if freq[k] == 4:\r\n freq.pop(k)\r\n else:\r\n freq[k] -= 4\r\n if len(freq) == 2:\r\n print('Bear')\r\n else:\r\n print('Elephant')\r\n", "s = [int(x) for x in input()[::2]]\r\nn = 0\r\nfor x in set(s):\r\n if s.count(x) > 3:\r\n n = int(x)\r\n s.remove(n)\r\n s.remove(n)\r\n s.remove(n)\r\n s.remove(n)\r\nif n == 0:\r\n print(\"Alien\")\r\nelif len(set(s)) == 1:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Bear\")\r\n", "a, b, c, d, e, f = map(int, input().split(' '))\r\nsticks = [a, b, c, d, e, f]\r\nwant = -1\r\nfor i in set(sticks):\r\n if sticks.count(i)>=4:\r\n want = i\r\n\r\n\r\nif want == -1:\r\n print(\"Alien\")\r\nelse:\r\n for i in range(4):\r\n sticks.remove(want)\r\n if sticks[0] == sticks[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n", "b = list(map(int, input().split()))\r\nb.sort()\r\nif b[0] == b[1] and b[2] == b[3] and b[3] == b[4] and b[4] == b[5]:\r\n print(\"Elephant\")\r\nelif (b[0] == b[1] and b[2] == b[3] and b[3] == b[0] and b[4] == b[5]):\r\n print(\"Elephant\")\r\nelif (b[0] == b[3]) or (b[2] == b[5]) or (b[1] == b[4]):\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")\r\n", "a=[int(i) for i in input().split()]\r\na=sorted(a)\r\nk=[a[0]]\r\nfor i in range(1,6):\r\n if(a[i]!=a[i-1]):\r\n k.append(a[i])\r\nif(len(k)>3):\r\n print(\"Alien\")\r\nelif(len(k)==3):\r\n if(a[0]==a[3] or a[1]==a[4] or a[2]==a[5]):\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")\r\nelif(len(k)==2):\r\n if(a[0]==a[3]):\r\n if(a[3]==a[4]):\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")\r\n elif(a[2]==a[5]):\r\n if(a[1]==a[2]):\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Alien\")\r\nelse:\r\n print(\"Elephant\")", "from collections import*\r\nx=list(map(int,input().split()))\r\nx.sort()\r\nif len(set(x))==1:\r\n print(\"Elephant\")\r\nelse:\r\n ct=[]\r\n for i,j in Counter(x).items():\r\n ct.append(j)\r\n ct.sort()\r\n if ct[-1]==5:\r\n print(\"Bear\")\r\n elif ct[-1]==4 and len(ct)==2:\r\n print(\"Elephant\")\r\n elif ct[-1]==4 and len(ct)==3:\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")\r\n \r\n", "from collections import Counter\r\nl=list(map(int,input().strip().split()))\r\nd=Counter(l)\r\nmx=0\r\nfor x in d:\r\n if d[x]>mx:mx=d[x]\r\nif mx<4:print(\"Alien\")\r\nelse:\r\n if mx==4:\r\n s=set(l)\r\n if len(s)==2:print(\"Elephant\")\r\n else:print(\"Bear\")\r\n elif mx==5:\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")", "from sys import stdin\r\nl=list(map(int,stdin.readline().split()))\r\nd={}\r\nfor i in range(len(l)):\r\n if l[i] not in d:\r\n d[l[i]]=1\r\n else:\r\n d[l[i]]+=1\r\nf=0\r\np=0\r\nfor i in d.keys():\r\n if d[i]>=4:\r\n f=1\r\n p=i\r\n break\r\nif f==0:\r\n print(\"Alien\")\r\nelse:\r\n k=[]\r\n c=4\r\n for i in range(6):\r\n if l[i]!=p or c==0:\r\n k.append(l[i])\r\n else:\r\n c-=1\r\n if k[0]==k[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "l = list(map(int, input().split()))\r\nd = {}\r\nfor i in l:\r\n d[i] = d.get(i, 0) + 1\r\nif len(d) >= 4:\r\n print('Alien')\r\nelif len(d) == 3:\r\n if [1,1,4] == sorted(d.values()):\r\n print('Bear')\r\n else:\r\n print('Alien')\r\nelif len(d) == 2:\r\n if [2,4] == sorted(d.values()):\r\n print('Elephant')\r\n elif [1,5] == sorted(d.values()):\r\n print('Bear')\r\n else:\r\n print('Alien')\r\nelse:\r\n print('Elephant')\r\n ", "l=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if not i in d:\r\n d[i]=0\r\n d[i]+=1\r\nflag = None\r\nfor (k, v) in d.items():\r\n if v >= 4:\r\n flag = k\r\n break\r\nif not flag:\r\n print('Alien')\r\nelse:\r\n if d[k] == 4:\r\n d.pop(k)\r\n else:\r\n d[k] -= 4\r\n if len(d) == 2:\r\n print('Bear')\r\n else:\r\n print('Elephant')", "data = [int(i) for i in input().split()]\r\ndata.sort()\r\ndic = {k:data.count(k) for k in set(data)}\r\n\r\nisAlien = True\r\nlegKey = 0\r\nheadAndBody = []\r\nfor key in dic:\r\n if(dic[key] >= 4):\r\n legKey = key \r\n isAlien = False\r\nfor key in dic:\r\n if key != legKey:\r\n headAndBody.append(key)\r\n\r\nif(isAlien):\r\n print(\"Alien\")\r\nelse:\r\n if(len(headAndBody) == 2):\r\n if(headAndBody[0] == headAndBody[1]):\r\n print(\"Elephant\")\r\n else:\r\n print( \"Bear\" )\r\n else:\r\n if(len(headAndBody) == 0 or dic[headAndBody[0]] == 2):\r\n print(\"Elephant\")\r\n else:\r\n if(legKey == headAndBody[0]):\r\n print(\"Elephant\")\r\n else:\r\n print( \"Bear\" )\r\n\r\n\r\n", "s2=input().split()\r\noutput1=\"Alien\"\r\nfor s_ in s2:\r\n sounter=s2.count(s_)\r\n if sounter>=4:\r\n for re in range(4):\r\n s2.remove(s_)\r\n s2.sort()\r\n x1=int(s2[0])\r\n x2=int(s2[1])\r\n if x2>x1:\r\n output1=\"Bear\"\r\n elif x2==x1:\r\n output1=\"Elephant\"\r\n break\r\nprint (output1)\r\n", "ll = list(map(int,input().split()))\r\nmik = [0]*10\r\nfor i in ll:\r\n mik[i] += 1\r\nkk = []\r\nfor i in mik:\r\n if i != 0:\r\n kk.append(i)\r\nt = False\r\nkk = sorted(kk)\r\nif kk[-1] >= 4:\r\n if kk[-1] == 6:\r\n print('Elephant')\r\n elif kk[-1] == 5:\r\n print('Bear')\r\n else:\r\n if len(kk) == 3:\r\n print('Bear')\r\n else:\r\n print('Elephant')\r\nelse:\r\n print('Alien')", "lst=list(map(int,input().split()))\r\ns=list(set(lst))\r\nflag=0\r\nfor i in s:\r\n if lst.count(i)>=4:\r\n flag=1\r\n break\r\nif flag==1:\r\n if len(s)==1:\r\n print('Elephant')\r\n elif len(s)==2 and lst.count(s[0])%2==0:\r\n print('Elephant')\r\n elif len(s)==2 and lst.count(s[0])%2!=0:\r\n print('Bear')\r\n elif len(s)==3:\r\n print('Bear')\r\n else:\r\n print('Alien')\r\nelse:\r\n print('Alien')", "a = input().split()\r\nk = [a.count(c) for c in a]\r\nprint((('Elephant','Bear')[1 in k],'Alien')[max(k) < 4])\r\n", "\n\ndef solve(nums):\n leg = -1\n for i in nums:\n if nums.count(i) >= 4:\n leg = i\n if leg == -1:\n return \"Alien\"\n\n for i in range(4):\n nums.remove(leg)\n\n if nums[0] == nums[1]:\n return \"Elephant\"\n else:\n return \"Bear\"\n\n\nprint(solve(list(map(int, input().split(' ')))))\n", "t = {}\r\nfor i in input().split(): t[i] = t.get(i, 0) + 1\r\nt = t.values()\r\nprint('Alien' if max(t) < 4 else 'Bear' if 1 in t else 'Elephant')", "v=[int(i) for i in input().split()]\r\nv.sort()\r\ncount=[0 for i in range(9)]\r\nfor i in v:\r\n count[i-1] += 1\r\nf=0\r\nfor i in range(9):\r\n if(count[i]>=4):\r\n f=i+1\r\n break\r\n\r\nif(f==0):\r\n print(\"Alien\")\r\nelse:\r\n c=0\r\n v2=[]\r\n for i in range(6):\r\n if(c==4):\r\n v2.append(v[i])\r\n elif(v[i]!=f):\r\n v2.append(v[i])\r\n else:\r\n c=c+1\r\n if(v2[0]==v2[1]):\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n \r\n \r\n", "a = list(map(int, input().split()))\r\na = list(sorted(a))\r\nok = 0\r\nfor y in range(len(a) - 3):\r\n if a[y] == a[y + 1] and a[y] == a[y + 2] and a[y] == a[y + 3]:\r\n ok = 1\r\n for x in range(4):\r\n del a[y]\r\n break\r\nif ok == 0:\r\n print(\"Alien\")\r\nelse:\r\n if a[0] == a[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "sticks=[int(x) for x in input().split()]\r\n\r\nfor x in sticks:\r\n if sticks.count(x)>=4:\r\n for i in range(4):\r\n sticks.remove(x)\r\n break\r\nelse:\r\n print('Alien')\r\n exit()\r\n\r\nif sticks[0]==sticks[1]:\r\n print('Elephant')\r\nelse:\r\n print('Bear')", "s=[int(n) for n in input().split()]\r\nj=0\r\nfor n in s:\r\n if s.count(n)>=4:\r\n j=n\r\n break\r\nif j==0:\r\n print('Alien')\r\nelse:\r\n s.sort()\r\n del s[s.index(j):s.index(j)+4]\r\n if s[0]==s[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')", "a = list(map(int,input().split()))\n\nx = set(a)\n\nz = 0\nfor i in x:\n\tif(a.count(i) > z):\n\t\tz = a.count(i)\n\nif(z < 4):\n\tprint(\"Alien\")\nelse:\n\tfor i in x:\n\t\ty = a.count(i)\n\t\tif(y != 4):\n\t\t\tif(y == 2 or y == 6):\n\t\t\t\tprint(\"Elephant\")\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tprint(\"Bear\")\n\t\t\t\tbreak", "def main():\n l = [0] * 10\n for x in map(int, input().split()):\n l[x] += 1\n l.sort()\n x = l[9] * 3 + l[8]\n if x in (18, 14):\n print('Elephant')\n elif x in (16, 13):\n print('Bear')\n else:\n print('Alien')\n\n\nif __name__ == '__main__':\n main()\n", "def muh_and_sticks(values):\r\n a = list(map(lambda val: (val, len([i for i in range(len(values)) if values[i] == val])),values,))\r\n b = list(set(list(zip(*a))[1]))\r\n if b == [6] or b == [2, 4]:\r\n return \"Elephant\"\r\n elif b == [1, 5] or b == [1, 4]:\r\n return \"Bear\"\r\n else:\r\n return \"Alien\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n a = list(map(int, input().split()))\r\n print(muh_and_sticks(a))", "sticks = [int(x) for x in input().split()]\r\n\r\nalien = True\r\n\r\nfor stick in sticks:\r\n if sticks.count(stick) >= 4:\r\n for i in range(4):\r\n sticks.remove(stick)\r\n alien = False\r\n break\r\n\r\nif not alien:\r\n if abs(sticks[0] - sticks[1]) > 0:\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")\r\nelse:\r\n print(\"Alien\")\r\n", "line = input().split()\r\nline = ''.join(line)\r\ndup = []\r\nfor i in line:\r\n dup.append(line.count(i))\r\nleg = False\r\nele = False\r\nfor i in dup:\r\n if i >= 4:\r\n leg = True\r\n if i == 2:\r\n ele = True\r\n if i == 6:\r\n ele = True\r\nif not leg:\r\n print('Alien')\r\nif leg and not ele:\r\n print('Bear')\r\nif leg and ele:\r\n print('Elephant')\r\n", "def main():\r\n n=list\r\n #n=[0,1,1,1,5,9]\r\n \r\n n=list(map(int,input().split()))\r\n for j in range(6):\r\n for i in range(5):\r\n if n[i]>n[i+1]:\r\n a=n[i]\r\n b=n[i+1]\r\n n[i]=b\r\n n[i+1]=a\r\n \r\n if n[2]==n[3]:\r\n \r\n if int(n[0])-int(n[3])==0 or int(n[5]-n[3])==0:\r\n \r\n if int(n[0])-int(n[1])==0 and int(n[5])-int(n[4])==0:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")\r\n \r\n \r\n else:\r\n if int(n[1])-int(n[2])==0 and int(n[3])-int(n[4])==0 and (int(n[5])-int(n[0]))>0:\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")\r\n \r\n else:\r\n print(\"Alien\")\r\n \r\n \r\n\r\n \r\n\r\nif __name__=='__main__':\r\n main()\r\n\r\n \r\n \r\n", "a_list = [int(x) for x in input().split()]\n\nmaxx = -1\n\na_set = set()\n\nfor i in a_list:\n a_set.add(i)\n c = a_list.count(i)\n if c > maxx:\n maxx = c\n \nif maxx <= 3:\n print('Alien')\nelif maxx == 4:\n if len(a_set) == 2:\n print('Elephant')\n else:\n print('Bear')\nelif maxx == 5:\n print('Bear')\nelif maxx == 6:\n print('Elephant')\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Dec 24 15:51:42 2017\r\n\r\n@author: admin\r\n\"\"\"\r\n\r\nsticks = [int(x) for x in input().split()]\r\nlength = set(sticks)\r\nif len(length) > 3:\r\n print('Alien')\r\nif len(length)==1:\r\n print('Elephant')\r\nif len(length)==2:\r\n for x in length:\r\n if sticks.count(x)==3:\r\n print('Alien')\r\n break\r\n elif sticks.count(x) == 1:\r\n print('Bear')\r\n break\r\n else:\r\n print('Elephant')\r\n \r\nif len(length)==3:\r\n for x in length:\r\n if sticks.count(x) not in [1,4]:\r\n print('Alien')\r\n break\r\n else:\r\n print('Bear')\r\n\r\n", "ar = sorted(list(map(int,input().split())))\nd = {}\nrel = 0\ngood = False\nfor a in ar:\n\tif a in d:\n\t\td[a] += 1\n\telse:\n\t\td[a] = 1\n\nfor k,v in d.items():\n\tif v >= 4:\n\t\td[k]-=4\n\t\tgood = True\n\t\tif d[k] == 0:\n\t\t\tdel d[k]\n\t\tbreak\n\n\nif not good:\n\tprint('Alien')\nelse:\n\tprint('Elephant' if len(d) == 1 else 'Bear')", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2018-10-17 19:41:42\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\nfrom collections import Counter\r\n\r\nalls = Counter(read_ints())\r\nlens = len(alls)\r\nmaxs = max(alls.values())\r\nif maxs < 4:\r\n print(\"Alien\")\r\nelif lens == 3 or maxs == 5:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Elephant\")\r\n", "m = [int(i) for i in input().split()]\r\nd = dict()\r\nfor i in m:\r\n d[i] = d.get(i, 0) + 1\r\nc = 0\r\nk = 0\r\nfor i in d:\r\n if d[i] >= 4: c = 1\r\n if d[i] == 5: k = 1\r\nif len(d) <= 2 and c and not k: print(\"Elephant\")\r\nelif len(d) <= 3 and c: print(\"Bear\")\r\nelse: print(\"Alien\")", "import sys\n\nns = [ int(a) for a in input().split() ]\n\nns.sort()\n\nfor i in range(3):\n if ns[0] == ns[1] and ns[1] == ns[2] and ns[2] == ns[3]:\n if ns[4] == ns[5]:\n print('Elephant')\n else:\n print('Bear')\n sys.exit()\n ns = ns[1:] + [ns[0]]\nprint('Alien')", "a = sorted(map(int, input().split()))\r\np = -1\r\nfor i in range(0, 3):\r\n if a[i] == a[i + 1] and a[i + 1] == a[i + 2] and a[i + 2] == a[i + 3]:\r\n p = a[i]\r\n break\r\nif p == -1:\r\n print(\"Alien\")\r\nelse:\r\n r = list()\r\n for i in a:\r\n if i != p:\r\n r.append(i)\r\n if len(r) == 0 or len(r) == 2 and r[0] == r[1]:\r\n print(\"Elephant\")\r\n else:\r\n print(\"Bear\")", "'''a=[int(i) for i in input().split()]\r\nx=a[0]\r\ny=a[1]\r\nz=a[2]\r\nif y==x and z==0:\r\n print('0')\r\nelif x>y+z:\r\n print('+')\r\nelif y>x+z:\r\n print('-')\r\nelse:\r\n print('?')\r\nn=int(input())\r\nz=[int(i) for i in input().split()]\r\nx=[]\r\nd=0\r\nv=''\r\nfor i in range(n):\r\n c=0\r\n e=0\r\n for f in range(len(z)):\r\n if z[f]>c and f+1 not in x:\r\n c=z[f]\r\n e=f+1\r\n d+=(i*c)+1\r\n x.append(e)\r\nprint(d)\r\nfor i in x:\r\n v+=str(i)\r\n v+=' '\r\nprint(v)\r\n\r\nf=int(input())\r\ng=[int(i) for i in input().split()]\r\nfor i in range(len(g)-1):\r\n for f in range(len(g)-1-i):\r\n if g[f]>g[f+1]:\r\n g[f],g[f+1]=g[f+1],g[f]\r\nif g[0]*g[1]>g[-2]*g[-3] and g[-1]>0:\r\n print(g[-1]*g[0]*g[1])\r\nelse:\r\n print(g[-1]*g[-2]*g[-3])\r\nfor u in range(int(input())):\r\n z=int(input())\r\n y=[int(f) for f in input().split()]\r\n y.sort()\r\n d=0\r\n for i in y:\r\n d+=i\r\n if d<2048:\r\n print('No')\r\n continue\r\n if 2048 in y:\r\n print('yes')\r\n continue\r\n for x in range(z+1):\r\n if 2048 in y:\r\n print('yes')\r\n break\r\n for i in range(len(y)-1):\r\n if y[i]==y[i+1]:\r\n y[i+1]=y[i]*2\r\n y.pop(i)\r\n if i>len(y)-3:\r\n break\r\n y.sort()\r\n else:\r\n print('no')\r\nn=int(input())\r\nx=[]\r\nfor i in range(1,((n**2)//2)+1):\r\n x.append(n**2+1-i)\r\n x.append(i)\r\n if len(x)==n:\r\n print(*x)\r\n x=[]\r\nfor z in range(int(input())):\r\n z=int(input())\r\n x=[int(i) for i in input().split()]\r\n f=0\r\n o=0\r\n t=0\r\n for i in range(z):\r\n if x[i]%3==0:\r\n f+=1\r\n elif x[i]%3==1:\r\n o+=1\r\n else:\r\n t+=1\r\n if o<t:\r\n print(f+o+(t-o)//3)\r\n else:\r\n print(f+t+(o-t)//3)\r\nn=int(input())\r\nif n%2==1:\r\n print(0)\r\nelif n%4==0:\r\n print((n//4)-1)\r\nelse:\r\n print(n//4)\r\nn=[int(i) for i in input().split()]\r\nif n[2]>=0 and n[0]>n[1]:\r\n print('NO')\r\nelif n[2]<=0 and n[0]<n[1]:\r\n print('NO')\r\nelif n[2]==0:\r\n if n[0]==n[1]:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif (n[1]-n[0])%n[2]==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\nfor f in range(int(input())):\r\n f=[int(i) for i in input().split()]\r\n a=f[0]\r\n b=f[1]\r\n c=f[2]\r\n r=f[3]\r\n a,b=min(a,b),max(a,b)\r\n if c+r<=a or c-r>=b:\r\n print(b-a)\r\n elif c<=a:\r\n print(max(b-c-r,0))\r\n elif c>=b:\r\n print(max(c-a-r,0))\r\n else:\r\n v=max(b-c-r,0)\r\n print(v+max(c-a-r,0))\r\ndef bt(p,c):\r\n if c%p+c//p==0:\r\n return ''\r\n else:\r\n return bt(p,c//p)+str(c%p)\r\nprint(bt(int(input()),int(input())))\r\nfor t in range(int(input())):\r\n t=[int(i) for i in input().split()]\r\n n=t[0]\r\n m=t[1]\r\n x=t[2]\r\n y=t[3]\r\n d=0\r\n for f in range(n):\r\n e=input()\r\n c=0\r\n for i in range(m):\r\n if c==0 and i==m-1:\r\n if e[i]=='.':\r\n d+=x\r\n break\r\n elif c==1:\r\n c=0\r\n continue\r\n else:\r\n if e[i]=='.' and e[i+1]=='.' and y<2*x:\r\n c=1\r\n d+=y\r\n elif e[i]=='.':\r\n d+=x\r\n else:\r\n continue\r\n print(d)\r\nx=[int(i) for i in input().split()]\r\nd=x[3]\r\nx.pop(3)\r\nx.sort()\r\na=x[0]\r\nb=x[1]\r\nc=x[2]\r\nprint(max(d-b+a,0)+max(d+b-c,0))\r\nd=int(input())\r\ns=input()\r\nx=s.count('0')\r\ny=s.count('1')\r\nif y!=x:\r\n print(1)\r\n print(s)\r\nelse:\r\n print(2)\r\n print(s[0:-1],s[-1],sep=' ')\r\nfrom random import choice\r\ndef qs(y):\r\n if len(y)<2:\r\n return y\r\n d=choice(y)\r\n s=[]\r\n e=[]\r\n l=[]\r\n for i in y:\r\n if i<d:\r\n s.append(i)\r\n elif i>d:\r\n l.append(i)\r\n else:\r\n e.append(i)\r\n return qs(l)+e+qs(s)\r\nn=int(input())\r\nm=int(input())\r\na=[]\r\nd=0\r\nfor i in range(n):\r\n a.append(int(input()))\r\nc=qs(a)\r\nfor i in range(n):\r\n d+=c[i]\r\n if d>=m:\r\n print(i+1)\r\n break\r\nn=int(input())\r\nif n%2==0:\r\n print((n**2)//2)\r\nelse:\r\n print(((n**2)//2)+1)\r\nfor f in range(n):\r\n c=''\r\n for i in range(n):\r\n if f%2==0:\r\n if i%2==0:\r\n c+='C'\r\n else:\r\n c+='.'\r\n else:\r\n if i%2==1:\r\n c+='C'\r\n else:\r\n c+='.'\r\n print(c)\r\nn=int(input())\r\nc=''\r\nfor i in range(1,n+1):\r\n c+=str(i)\r\nprint(c[n-1])\r\nc=[int(i) for i in input().split()]\r\nd=[int(i) for i in input().split()]\r\ne=[int(i) for i in input().split()]\r\ny=0\r\nx=0\r\nfor i in d:\r\n if i%2==0:\r\n x+=1\r\nfor i in e:\r\n if i%2==0:\r\n y+=1\r\nf=c[0]-x\r\ng=c[1]-y\r\nprint(min(x,g)+min(y,f))\r\nfor i in range(int(input())):\r\n n=int(input())\r\n a=[int(i) for i in input().split()]\r\n a.sort()\r\n c=a[0]*a[-1]\r\n for i in range(0,4*n,2):\r\n if a[i]!=a[i+1]:\r\n print('NO')\r\n break\r\n elif a[i]*a[4*n-i-1]!=c:\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\nc=[int(i) for i in input().split()]\r\nn=c[0]\r\nm=c[1]\r\na=c[2]\r\nb=c[3]\r\nif b/m>=a:\r\n print(n*a)\r\nelif (n%m)*a<b:\r\n print((n//m)*b+(n%m)*a)\r\nelse:\r\n print(((n//m)+1)*b)\r\na=input().split()\r\nn=int(a[0])\r\nl=int(a[1])\r\nc=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n for f in range(n-i-1):\r\n if c[f]>c[f+1]:\r\n c[f],c[f+1]=c[f+1],c[f]\r\nd=0\r\nfor i in range(n-1):\r\n if (c[i+1]-c[i])/2>d:\r\n d=(c[i+1]-c[i])/2\r\nif d<max(c[0],l-c[-1]):\r\n d=max(c[0],l-c[-1])\r\nprint(d)\r\nd=input().split()\r\ns=int(d[0])\r\nn=int(d[1])\r\nv=[]\r\nfor i in range(n):\r\n v.append([int(i) for i in input().split()])\r\nfor i in range(n):\r\n for f in range(n-i-1):\r\n if v[f][0]>v[f+1][0]:\r\n v[f],v[f+1]=v[f+1],v[f]\r\nfor i in v:\r\n if i[0]>=s:\r\n print('NO')\r\n break\r\n else:\r\n s+=i[1]\r\nelse:\r\n print('YES')\r\na=int(input())\r\nc={}\r\nfor i in range(a):\r\n i=input()\r\n if i in c:\r\n c[i]+=1\r\n v=i+str(c[i])\r\n print(v)\r\n else:\r\n c[i]=0\r\n print('OK')'''\r\nfrom math import sqrt\r\nfrom random import randint\r\ndef ip(n):\r\n if n==1:\r\n return False\r\n for i in range(2,int(sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n'''n=int(input())\r\nv=[randint(1,n)for i in range(n)]\r\nfor i in v:\r\n if ip(i):\r\n print(i)\r\ndef s1(m,n):\r\n c=list(range(2,n+1))\r\n p=[]\r\n for i in range(n-1):\r\n if c[i]>1 and c[i]>=m:\r\n p.append(c[i])\r\n for f in range(i+1,n-1):\r\n if c[f]%c[i]==0:\r\n c[f]=1\r\n elif c[i]>1:\r\n for f in range(i+1,n-1):\r\n if c[f]%c[i]==0:\r\n c[f]=1\r\n return p'''\r\ndef s2(n):\r\n a=list(range(n))\r\n a[1]=0\r\n for i in a:\r\n if i>1:\r\n for j in range(i*2, len(a), i):\r\n a[j] = 0\r\n return {i**2 for i in a}\r\n'''print(s2(1111))\r\ndef pn(n):\r\n c=''\r\n for i in range(n-1,1,-1):\r\n if ip(i):\r\n c+=str(i)\r\n c+=','\r\n break\r\n for i in range(n+1,100000000000000):\r\n if ip(i):\r\n c+=str(i)\r\n return c\r\nprint(pn(5))\r\nv=int(input())\r\na=s2(v+400)\r\nfor i in range(len(a)-1):\r\n if a[i]<v and a[i+1]>v:\r\n print(a[i],a[i+1])\r\n break\r\n elif a[i]<v and a[i+1]==v:\r\n print(a[i],a[i+2])\r\n break\r\nk=int(input())\r\na=s2(38000)\r\nc=[]\r\nfor i in range(len(a)):\r\n if i+1 in a:\r\n c.append(a[i])\r\nprint(c[k-1])\r\nc=0\r\na=s2(1024)\r\nv=int(input())\r\nd=[int(i) for i in input().split()]\r\nd.sort()\r\nfor i in range(len(d)):\r\n e=0\r\n for j in range(len(a)):\r\n if d[i]%a[j]==0:\r\n e+=1\r\n if e>c:\r\n c=e\r\n v=i\r\nprint(d[v])\r\na=[int(i) for i in input().split()]\r\nc=0\r\nf=-1\r\nfor i in range(a[0],a[1]+1):\r\n e=0\r\n if ip(i):\r\n v=str(i)\r\n for j in v:\r\n e+=int(j)\r\n if e>=c:\r\n f=int(v)\r\n c=e\r\nprint(f)\r\na=int(input())\r\nv=s2(1000)\r\nfor i in v:\r\n if a-i in v:\r\n c=str(i)+' '+str(a-i)\r\n print(c)\r\n break'''\r\n'''a=int(input())\r\nv=s2(10000)\r\nc=0\r\nfor i in v:\r\n if a-i in v:\r\n c+=1\r\nc//=2\r\nif a%2==0 and a//2 in v:\r\n c+=1\r\nprint(c)\r\nfrom math import sqrt\r\ns=int(input())\r\nd=[int(i) for i in input().split()]\r\nv=s2(1000000)\r\nfor i in d:\r\n if i in v:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nx=input().split()\r\nc=int(x[0])\r\nt=int(x[1])\r\ne=[0]*c\r\nfor i in range(t):\r\n i=[int(i) for i in input().split()]\r\n r=0\r\n g=0\r\n for f in range(len(i)):\r\n if i[f]>r:\r\n r=i[f]\r\n g=f\r\n e[g]+=1\r\nr=0\r\ng=0\r\nfor f in range(len(e)):\r\n if e[f]>r:\r\n r=e[f]\r\n g=f\r\nprint(g+1)\r\nx=int(input())\r\ny=[(int(i))%2 for i in input().split()]\r\ne=0\r\no=0\r\nfor i in y:\r\n if i==1:\r\n o+=1\r\n else:\r\n e+=1\r\nprint(min(e,o))'''\r\nx=[int(i) for i in input().split()]\r\nx.sort()\r\nif x[0]==x[3]:\r\n if x[4]==x[5]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelif x[1]==x[4]:\r\n if x[0]==x[5]:\r\n print('Elephant')\r\n else:\r\n print('Bear') \r\nelif x[2]==x[5]:\r\n if x[0]==x[1]:\r\n print('Elephant')\r\n else:\r\n print('Bear')\r\nelse:\r\n print('Alien')\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "t = list(map(int, input().split()))\r\n\r\nc_max = 0\r\nc_min = 6\r\nfor x in range(6): \r\n c_max = max(c_max, t.count(t[x]))\r\n c_min = min(c_min, t.count(t[x]))\r\n\r\nif c_max < 4: print('Alien')\r\nelif c_max == 4:\r\n if c_min == 1: print('Bear')\r\n else: print('Elephant')\r\nelif c_max == 5: print('Bear')\r\nelif c_max == 6: print('Elephant')", "n=input().split()\r\nf=1\r\na=[n.count(c) for c in n]\r\n#print(a)\r\n#print(max(a))\r\nif(max(a)<4):\r\n print(\"Alien\")\r\nelse:\r\n for i in (a):\r\n if(i==1):\r\n f=0\r\n break\r\n if(f==0):\r\n print(\"Bear\")\r\n else:\r\n print(\"Elephant\")", "d={};w=1\nfor x in map(int,input().split()):\n\td[x]=d[x]+1 if x in d else 1\nif max(d.values())>=4:\n\tw=0\n\tif len(d)==3 or len(d)==2 and max(d.values())==5:\n\t\tw=2\nprint('EABlleeiaperhn a n t'[w::3])\n", "a=list(map(int,input().split()))\r\nb=set(a)\r\nl=len(b)\r\nj=list(b)\r\no=a.count(min(a))\r\nc=a.count(max(a))\r\nif l==3:\r\n i=a.count(j[0])\r\n u=a.count(j[1])\r\n y=a.count(j[2])\r\n w=max(i,u)\r\n w=max(w,y)\r\n r=min(i,u)\r\n r=min(r,y)\r\n if w==4 and r==1:\r\n print(\"Bear\")\r\n else:\r\n print(\"Alien\")\r\nelif l<=2 and l>0:\r\n if o==2 or c==2:\r\n print(\"Elephant\")\r\n elif max(a)==min(a):\r\n print(\"Elephant\")\r\n elif o==3 or c==3:\r\n print(\"Alien\")\r\n else:\r\n print(\"Bear\")\r\nelse:\r\n print(\"Alien\")\r\n", "from collections import Counter\n\na = Counter(input().split(' '))\nlegs = False\nfor num in a:\n if a[num] >= 4:\n a[num] -= 4\n if a[num] == 0:\n del a[num]\n legs = True\n break\nif not legs:\n print('Alien')\nelse:\n b = list(a)\n print('Elephant' if len(b) == 1 else 'Bear')\n", "arr = [int(x) for x in input().split()]\nd = {}\nfor x in arr:\n if x in d:\n d[x] += 1\n else:\n d[x] = 1\nfor k, v in d.items():\n if v >= 4:\n arr.remove(k)\n arr.remove(k)\n arr.remove(k)\n arr.remove(k)\nif len(arr) > 2:\n print('Alien')\nelif arr[0] == arr[1]:\n print('Elephant')\nelse:\n print('Bear')\n", "def inp(s):\r\n j = 0\r\n a = []\r\n for i in range(len(s)):\r\n if s[i] == \" \":\r\n a.append(int(s[j:i]))\r\n j = i+1\r\n if i == len(s)-1:\r\n a.append(int(s[j:]))\r\n return sorted(a)\r\n\r\ns = input()\r\na = inp(s)\r\nif a[0] == a[1] and a[1] == a[2] and a[2] == a[3]:\r\n if a[4] == a[5]:\r\n print (\"Elephant\")\r\n else:\r\n print (\"Bear\")\r\nelif a[3] == a[4] and a[1] == a[2] and a[2] == a[3]:\r\n if a[0] == a[5]:\r\n print (\"Elephant\")\r\n else:\r\n print (\"Bear\")\r\nelif a[4] == a[5] and a[3] == a[4] and a[2] == a[3]:\r\n if a[0] == a[1]:\r\n print (\"Elephant\")\r\n else:\r\n print (\"Bear\")\r\n\r\nelse:\r\n print (\"Alien\")\r\n", "from sys import stdin\r\n\r\n\r\nA = list(map(int,stdin.readline().split()))\r\nB = set(A)\r\n\r\n\r\nif len(B)==1:\r\n print('Elephant')\r\nelif len(B)==2:\r\n count = 0\r\n\r\n for t in B:\r\n count = max(count,A.count(t))\r\n\r\n if count==4:\r\n print('Elephant')\r\n elif count==5:\r\n print('Bear')\r\n else:\r\n print('Alien')\r\nelif len(B)>=4:\r\n print('Alien')\r\nelse:\r\n count = 0\r\n\r\n for t in B:\r\n count = max(count,A.count(t))\r\n\r\n if count==4:\r\n print('Bear')\r\n else:\r\n print('Alien')" ]

[ "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 * n + v\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 s, t = get_root(s), get_root(t)\r\n if s == t:\r\n return\r\n if rank[s] < rank[t]:\r\n s, t = t, s\r\n if rank[s] == rank[t]:\r\n rank[s] += 1\r\n root[t] = s\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_segment(s, t):\r\n s, t = s + l1, t + l1\r\n u, v = [], []\r\n while s <= t:\r\n if s & 1:\r\n u.append(s)\r\n s += 1\r\n s >>= 1\r\n if not t & 1:\r\n v.append(t)\r\n t -= 1\r\n t >>= 1\r\n return u + v[::-1]\r\n\r\nn, m, q = map(int, input().split())\r\nl1 = pow(2, (m + 1).bit_length())\r\nl2 = 2 * l1\r\na = [0] * (n * l2)\r\nfor i in range(n):\r\n a0 = list(map(int, input().split()))\r\n for j in range(m):\r\n a[f(j, i)] = a0[j]\r\nroot = [i for i in range(n * l1)]\r\nrank = [1 for _ in range(n * l1)]\r\nl0, r0 = [0] * l2, [0] * l2\r\nll, rr = [0] * (n * l2), [0] * (n * l2)\r\ncnt = [0] * l2\r\nfor i in range(l1):\r\n c = n\r\n for j in range(n - 1):\r\n u, v = f(i, j), f(i, j + 1)\r\n if a[u] == a[v] and not same(u, v):\r\n unite(u, v)\r\n c -= 1\r\n for j in range(n):\r\n u, v = f(i + l1, j), get_root(f(i, j))\r\n ll[u], rr[u] = v, v\r\n l0[i + l1], r0[i + l1] = i, i\r\n cnt[i + l1] = c\r\nfor i in range(l1 - 1, 0, -1):\r\n c = cnt[2 * i] + cnt[2 * i + 1]\r\n l, r = r0[2 * i], l0[2 * i + 1]\r\n for j in range(n):\r\n u, v = f(l, j), f(r, j)\r\n if a[u] == a[v] and not same(u, v):\r\n unite(u, v)\r\n c -= 1\r\n l, r = l0[2 * i], r0[2 * i + 1]\r\n for j in range(n):\r\n u = f(i, j)\r\n ll[u], rr[u] = get_root(f(l, j)), get_root(f(r, j))\r\n l0[i], r0[i] = l, r\r\n cnt[i] = c\r\nans = [0] * q\r\nroot = [i for i in range(n * l1)]\r\nrank = [1 for _ in range(n * l1)]\r\nfor q0 in range(q):\r\n l, r = map(int, input().split())\r\n x = get_segment(l - 1, r - 1)\r\n ans0 = cnt[x[0]]\r\n for i in range(len(x) - 1):\r\n l, r = x[i], x[i + 1]\r\n ans0 += cnt[r]\r\n for j in range(n):\r\n u, v = rr[f(l, j)], ll[f(r, j)]\r\n if a[u] == a[v] and not same(u, v):\r\n unite(u, v)\r\n ans0 -= 1\r\n ans[q0] = ans0\r\n for i in x:\r\n for j in range(n):\r\n u, v = ll[f(i, j)], rr[f(i, j)]\r\n root[u], root[v] = u, v\r\n rank[u], rank[v] = 1, 1\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "import bisect\r\nimport copy\r\nimport decimal\r\nimport fractions\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport sys\r\nfrom collections import Counter,deque,defaultdict\r\nfrom functools import lru_cache,reduce\r\nfrom heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max\r\ndef _heappush_max(heap,item):\r\n heap.append(item)\r\n heapq._siftdown_max(heap, 0, len(heap)-1)\r\ndef _heappushpop_max(heap, item):\r\n if heap and item < heap[0]:\r\n item, heap[0] = heap[0], item\r\n heapq._siftup_max(heap, 0)\r\n return item\r\nfrom math import gcd as GCD\r\nread=sys.stdin.read\r\nreadline=sys.stdin.readline\r\nreadlines=sys.stdin.readlines\r\n\r\nclass Prime:\r\n def __init__(self,N):\r\n assert N<=10**8\r\n self.smallest_prime_factor=[None]*(N+1)\r\n for i in range(2,N+1,2):\r\n self.smallest_prime_factor[i]=2\r\n n=int(N**.5)+1\r\n for p in range(3,n,2):\r\n if self.smallest_prime_factor[p]==None:\r\n self.smallest_prime_factor[p]=p\r\n for i in range(p**2,N+1,2*p):\r\n if self.smallest_prime_factor[i]==None:\r\n self.smallest_prime_factor[i]=p\r\n for p in range(n,N+1):\r\n if self.smallest_prime_factor[p]==None:\r\n self.smallest_prime_factor[p]=p\r\n self.primes=[p for p in range(N+1) if p==self.smallest_prime_factor[p]]\r\n\r\n def Factorize(self,N):\r\n assert N>=1\r\n factorize=defaultdict(int)\r\n if N<=len(self.smallest_prime_factor)-1:\r\n while N!=1:\r\n factorize[self.smallest_prime_factor[N]]+=1\r\n N//=self.smallest_prime_factor[N]\r\n else:\r\n for p in self.primes:\r\n while N%p==0:\r\n N//=p\r\n factorize[p]+=1\r\n if N<p*p:\r\n if N!=1:\r\n factorize[N]+=1\r\n break\r\n if N<=len(self.smallest_prime_factor)-1:\r\n while N!=1:\r\n factorize[self.smallest_prime_factor[N]]+=1\r\n N//=self.smallest_prime_factor[N]\r\n break\r\n else:\r\n if N!=1:\r\n factorize[N]+=1\r\n return factorize\r\n\r\n def Divisors(self,N):\r\n assert N>0\r\n divisors=[1]\r\n for p,e in self.Factorize(N).items():\r\n A=[1]\r\n for _ in range(e):\r\n A.append(A[-1]*p)\r\n divisors=[i*j for i in divisors for j in A]\r\n return divisors\r\n\r\n def Is_Prime(self,N):\r\n return N==self.smallest_prime_factor[N]\r\n\r\n def Totient(self,N):\r\n for p in self.Factorize(N).keys():\r\n N*=p-1\r\n N//=p\r\n return N\r\n\r\n def Mebius(self,N):\r\n fact=self.Factorize(N)\r\n for e in fact.values():\r\n if e>=2:\r\n return 0\r\n else:\r\n if len(fact)%2==0:\r\n return 1\r\n else:\r\n return -1\r\n\r\nN,Q=map(int,readline().split())\r\nP=Prime(5*10**5)\r\nmebius=[0]+[P.Mebius(i) for i in range(1,5*10**5+1)]\r\ncnt=[0]*(5*10**5+1)\r\nans=0\r\nA=list(map(int,readline().split()))\r\nused=[False]*(N)\r\nfor _ in range(Q):\r\n q=int(readline())-1\r\n prime=list(P.Factorize(A[q]).keys())\r\n l=len(prime)\r\n for bit in range(1<<l):\r\n s=1\r\n for i in range(l):\r\n if bit>>i&1:\r\n s*=prime[i]\r\n if used[q]:\r\n cnt[s]-=1\r\n ans-=cnt[s]*mebius[s]\r\n else:\r\n ans+=cnt[s]*mebius[s]\r\n cnt[s]+=1\r\n if used[q]:\r\n used[q]=False\r\n else:\r\n used[q]=True\r\n print(ans)", "import sys\r\ninput = sys.stdin.readline\r\nzo = [[] for i in range(500003)]\r\nfor i in range(2, len(zo)):\r\n if not len(zo[i]):\r\n for j in range(i, len(zo), i):\r\n zo[j].append(i)\r\ndd = [[] for i in range(500003)]\r\nfor i in range(500003):\r\n dd[i] = zo[i][:]\r\nfor i in range(2, len(dd)):\r\n t = len(dd[i])\r\n for kk in range(2, 2 ** t):\r\n y = kk\r\n r0 = 1\r\n f = 0\r\n for j in range(t):\r\n if y % 2: \r\n r0 = r0 * dd[i][j]\r\n f += 1\r\n y = y // 2\r\n if f >= 2:\r\n dd[i].append(r0)\r\nn, q = [int(xx) for xx in input().split()]\r\na = [int(xx) for xx in input().split()]\r\nz = [0] * (5 * 10 ** 5 + 3)\r\nd = [0] * n\r\nans = 0\r\nsize = 0\r\nfor _________ in range(q):\r\n c = int(input())\r\n c -= 1\r\n if d[c]:\r\n ans -= (size - 1)\r\n for j in dd[a[c]]:\r\n z[j] -= 1\r\n if a[c] - 1:\r\n s = zo[a[c]]\r\n for j in range(2 ** len(s)):\r\n t = 1\r\n st = j\r\n f = 0\r\n for k in range(len(s)):\r\n if st % 2:\r\n t *= s[k]\r\n f += 1\r\n st = st // 2\r\n if f % 2:\r\n ans += z[t]\r\n else:\r\n ans -= z[t]\r\n d[c] = 0\r\n size -= 1\r\n else:\r\n ans += size\r\n if a[c] - 1:\r\n s = zo[a[c]]\r\n for j in range(2 ** len(s)):\r\n t = 1\r\n st = j\r\n f = 0\r\n for k in range(len(s)):\r\n if st % 2:\r\n t *= s[k]\r\n f += 1\r\n st = st // 2\r\n if f % 2:\r\n ans -= z[t]\r\n else:\r\n ans += z[t]\r\n for j in dd[a[c]]:\r\n z[j] += 1\r\n d[c] = 1\r\n size += 1\r\n print(ans)\r\n\r\n" ]

[ "import random\r\ng = {}\r\nn, m, q = map(int, input().split())\r\nc = [[0] * 2520 for _ in range(2520)]\r\ndef R(x, y, z):\r\n i = x\r\n while i <= n:\r\n j = y\r\n while j <= m:\r\n c[i][j] += z\r\n j += j & -j\r\n i += i & -i\r\ndef G(x, y):\r\n re = 0\r\n i = x\r\n while i > 0:\r\n j = y\r\n while j > 0:\r\n re += c[i][j]\r\n j -= j & -j\r\n i -= i & -i\r\n return re\r\ndef rd():\r\n return random.randint(0, (1 << 30) - 1)\r\nfor _ in range(11):\r\n random.seed(rd())\r\nfor _ in range(q):\r\n o, xa, ya, xb, yb = map(int, input().split())\r\n if o == 1:\r\n u = rd()\r\n g[((xa, ya), (xb, yb))] = u\r\n R(xa, ya, u)\r\n R(xa, yb + 1, -u)\r\n R(xb + 1, ya, -u)\r\n R(xb + 1, yb + 1, u)\r\n elif o == 2:\r\n u = g.get(((xa, ya), (xb, yb)), 0)\r\n R(xa, ya, -u)\r\n R(xa, yb + 1, u)\r\n R(xb + 1, ya, u)\r\n R(xb + 1, yb + 1, -u)\r\n else:\r\n va = G(xa, ya)\r\n vb = G(xb, yb)\r\n if va == vb:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")# 1693743640.2748132" ]

[ "def main():\r\n s = input()\r\n\r\n l = len(s)\r\n for i in range(l, 0, -1):\r\n substring_dict = {}\r\n for j in range(l - i + 1):\r\n substring = s[j: j + i]\r\n if substring in substring_dict:\r\n print(i)\r\n return\r\n substring_dict[substring] = None\r\n\r\n print(0)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\n\nn=len(s)\ndone=False\nfor length in range(n-1,0,-1):\n if(done):\n break\n for start in range(n):\n if(start+length-1>=n):\n break\n x=s.count(s[start:start+length])\n if(x>1):\n print(length)\n done=True\n break\n if(x==1):\n i=s.index(s[start:start+length])\n h=s[i+1:].count(s[start:start+length])\n if(h>0):\n print(length)\n done=True\n break\nif(not done):\n print(0)\n\n \n", "name = input()\nfor i in range(len(name), 0, -1):\n\tfor j in range(len(name) - i + 1):\n\t\tif name[j: j + i] in name[j + 1:]:\n\t\t\tprint(i)\n\t\t\texit()\nprint(0)\n \t\t\t\t \t \t \t \t\t\t \t\t\t \t\t\t \t", "string = input()\r\nn = len(string)\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if string[i : j] in string[i + 1 : ]:\r\n count = max(count, len(string[i : j]))\r\nprint(count)\r\n", "s = input() # input the string\nn = len(s) # length of the string\n\nres = 0 # length of the longest substring that appears at least twice\n\n# iterate over all possible substrings of length at least 2\nfor i in range(n-1):\n for j in range(i+1, n):\n # check if the substring s[i:j] appears at least twice in s\n if s[i:j] in s[i+1:]:\n res = max(res, j-i) # update the length of the longest substring found\n\nprint(res) # output the length of the longest substring that appears at least twice\n\n\t\t \t \t \t\t \t\t\t \t\t \t\t\t\t\t", "# http://codeforces.com/contest/23/problem/A\n\nstring = input()\nsize = len(string)\n\nans_got = 0\nfor s in range(1,size)[::-1]:\n dic = {}\n for i in range(0,size-s+1):\n if(string[i:i+s] in dic):\n print(s)\n ans_got = 1\n break\n else:\n dic[string[i:i+s]] = 1\n if(ans_got == 1):\n break\nif(ans_got == 0):\n print(0)", "n=input()\r\nm={}\r\ndef podstroka(s:str):\r\n for i in range(0,len(s)):\r\n for j in range(i+1,len(s)+1):\r\n if s[i:j] in m:\r\n m[s[i:j]] +=1\r\n else:\r\n m[s[i:j]] = 1\r\n return m \r\n\r\n\r\n\r\npodstroka(n)\r\n\r\n\r\nmaxlen = 0\r\nfor x in m:\r\n if m[x]>=2 and len(x)>maxlen:\r\n maxlen=len(x) \r\nprint(maxlen)", "str=input()\r\nm=0\r\nn=len(str)\r\nfor i in range(n):\r\n for j in range(i,n+1) :\r\n if str[i:j] in str[i+1:n] and len(str[i:j])>m:\r\n m=len(str[i:j])\r\nprint(m)", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\nss=input()\r\nn=len(ss);ans=0;f=0;dic={}\r\nfor i in range(n-1,0,-1):\r\n for j in range(n-i+1):\r\n # print(i,j,ss[i:i+j])\r\n s=ss[j:i+j]\r\n dic[s]=dic.get(s,0)+1\r\n if dic[s]>1:\r\n f=1;ans=i;break\r\n if f:break \r\nprint(ans) \r\n ", "def longest_repeated_substring(s):\n n = len(s)\n longest = 0\n for i in range(n):\n for j in range(i+1, n):\n k = 0\n while j+k < n and s[i+k] == s[j+k]:\n k += 1\n if k > 0:\n # check if this substring appears at least twice\n for m in range(i+1, n-k+1):\n if s[m:m+k] == s[i:i+k]:\n longest = max(longest, k)\n break\n return longest\ns = input()\nprint(longest_repeated_substring(s))\n\n\t \t\t\t \t \t \t\t \t \t \t\t\t\t\t \t\t", "a=input()\r\nn=len(a)\r\nfor l in range(n,0,-1):\r\n for i in range(n-l+1):\r\n if a[i:i+l] in a[i+1:]:\r\n print(l)\r\n exit(0)\r\nprint(0)", "x=input()\r\na=0\r\nfor i in range(len(x)):\r\n for j in range(i,len(x)):\r\n if x[i:j] in x[i+1:]:\r\n if len(x[i:j])>a:\r\n a=len(x[i:j])\r\nprint(a)\r\n", "s=input()\nl=[]\nfor i in range(len(s)-1):\n for j in range(1,len(s)):\n st=s[i:j]\n if(s.find(st,i+1)!=-1):\n l.append(len(st))\n\nl.sort()\nif(len(l)==0):\n print('0')\nelse:\n print(l[len(l)-1])\n\t \t\t \t \t \t\t\t \t\t\t \t\t\t", "# https://codeforces.com/problemset/problem/23/A\r\n\r\ndef func_sol(raw_data):\r\n a = raw_data.strip()\r\n n = len(a)\r\n m = 0\r\n for l in range(n - 1, 0, -1):\r\n for s in range(0, n - l):\r\n if a[s:s + l] in a[s + 1:]:\r\n m = max(m, l)\r\n return str(m)\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "S = input()\r\nbest = 0\r\nfor i in range(len(S)):\r\n for j in range(i+1, len(S)+1):\r\n s = S[i:j]\r\n c = 0\r\n for k in range(len(S)):\r\n if S[k:].startswith(s): c += 1\r\n if c >= 2: \r\n best = max(best, len(s))\r\nprint(best)", "st = input()\nli = []\nk = 2\nready = False\n\nfor i in range(len(st)-1, 0, -1):\n li.clear()\n for j in range(k):\n li.append(st[j:i+j])\n for t in range(len(li)):\n if li.count(li[t]) > 1:\n print(i)\n ready = True\n break\n if ready:\n break\n k += 1\n\nif not ready:\n print(0)\n", "for ctr in range(1):\r\n s=input().strip()\r\n for l in range(len(s),0,-1):\r\n k=[]\r\n for i in range(0,len(s)-l+1):\r\n k.append(s[i:i+l])\r\n if len(k)!=len(list(set(k))):\r\n print(l)\r\n exit()\r\n print(0)\r\n \r\n", "s = input()\r\nres = 0\r\nsolve = 0\r\nfor pos in range(1,len(s)):\r\n for i in range(len(s) - pos):\r\n if s[i:i+pos] in s[i+1:]:\r\n if solve < pos:\r\n solve = pos\r\nprint(solve)\r\n", "st = input()\nstart = 0\nli = []\nfor i in range(len(st)-1):\n for j in range(1,len(st)):\n s1 = st[i:j]\n if st.find(s1,i+1)!=-1:\n li.append(len(s1))\nif len(li) == 0:\n print(0)\nelse:\n print(max(li))\n\n\t \t\t\t\t\t\t\t \t\t \t\t \t \t", "def build_suffix_array(string):\n length = len(string)\n suffix_array = [i for i in range(length)]\n rank = [ord(string[i]) for i in range(length)]\n k = 1\n while k < length:\n suffix_array.sort(key=lambda i: (rank[i], rank[i+k] if i+k < length else -1))\n new_rank = [0] * length\n r = 0\n for i in range(length):\n if i > 0 and rank[suffix_array[i]] == rank[suffix_array[i-1]] and rank[suffix_array[i]+k if suffix_array[i]+k < length else -1] == rank[suffix_array[i-1]+k if suffix_array[i-1]+k < length else -1]:\n new_rank[suffix_array[i]] = r\n else:\n r += 1\n new_rank[suffix_array[i]] = r\n rank = new_rank\n k *= 2\n return suffix_array\n\ndef lcp_array(string, suffix_array):\n length = len(string)\n rank = [0] * length\n for i in range(length):\n rank[suffix_array[i]] = i\n lcp = [0] * (length-1)\n h = 0\n for i in range(length):\n if rank[i] < length-1:\n j = suffix_array[rank[i]+1]\n while i+h < length and j+h < length and string[i+h] == string[j+h]:\n h += 1\n lcp[rank[i]] = h\n if h > 0:\n h -= 1\n return lcp\n\ninput_string = input()\nlength = len(input_string)\nsuffix_array = build_suffix_array(input_string)\nlcp = lcp_array(input_string, suffix_array)\nanswer = max(lcp) if lcp else 0\nprint(answer)\n\n \t \t\t \t \t\t \t\t\t\t \t \t\t \t\t\t", "# import re\r\n\r\ndef occurrences(string, sub):\r\n count = start = 0\r\n while True:\r\n start = string.find(sub, start) + 1\r\n if start > 0:\r\n count+=1\r\n else:\r\n return count\r\n\r\ns = input()\r\n\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(s) + 1):\r\n sub_str = s[i:j]\r\n temp = occurrences(s, sub_str)\r\n # print(sub_str, temp)\r\n if temp >= 2:\r\n ans = max(len(sub_str), ans)\r\n \r\n\r\nprint(ans)", "def II():\r\n return(int(input()))\r\ndef LMI():\r\n return(list(map(int,input().split())))\r\ndef I():\r\n return(input())\r\ndef MII():\r\n return(map(int,input().split()))\r\n# import sys\r\n# input=sys.stdin.readline\r\n# import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# from collections import Counter\r\n# int(math.log(len(L)))\r\n# import math\r\n# from collections import defaultdict\r\n# mod=10**9+7\r\nfrom collections import deque\r\n# import math\r\ndef half(a):\r\n if a%2==0:\r\n return a//2\r\n return a//2+1\r\n\r\ns=I()\r\nn=len(s)\r\nX={}\r\nfor i in range(n):\r\n for j in range(n):\r\n if s[i:j+1] not in X:\r\n X[s[i:j+1]]=0\r\n X[s[i:j+1]]+=1\r\nma=2\r\nans=0\r\nfor i in X:\r\n if X[i]>=ma and len(i)>ans:\r\n ans=len(i)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n # return\r\n\r\n\r\n\r\n# if __name__==\"__main__\":\r\n\r\n # for _ in range(II()):\r\n # t()\r\n # t()\r\n", "s = input()\r\nn = len(s)\r\nm = n - 1;\r\nwhile m > 0:\r\n find = False\r\n for i in range(0, n - m):\r\n for j in range(i + 1, n - m + 1):\r\n match = True\r\n for k in range(0, m):\r\n if s[i+k] != s[j+k]:\r\n match = False\r\n break\r\n if match:\r\n find = True\r\n break\r\n if find:\r\n break\r\n if find:\r\n break\r\n m -= 1\r\nprint(m)", "str=input()\nl=len(str)\ntemp=\"\"\nmax=\"\"\n\nfor i in range(0,l-1,1):\n for j in range(i,l,1):\n temp=temp+str[j]\n if temp in (str[i+1:]):\n if(len(temp)>len(max)):\n max=temp\n temp=\"\"\n \nprint(len(max))\n \t\t \t\t\t \t\t\t\t \t \t \t \t \t", "word = input(\"\")\nk = []\nn = 0\n\nfor x in range(len(word)):\n for y in range(x + 1, len(word) + 1):\n k.append(word[x:y])\n\nfor x in k:\n if k.count(x) >= 2:\n if len(x) > n:\n n = len(x)\n\nprint(n)\n\t\t\t \t\t\t \t\t\t \t \t \t\t\t \t", "\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\ns = STR()\r\n\r\nif len(set(s)) == len(s):\r\n print('0')\r\n exit(0)\r\n\r\nd = []\r\n\r\nfor i in range(len(s)):\r\n for j in range(i+1 , len(s)):\r\n x = ''\r\n for k in range(i , j+1):\r\n x += s[k]\r\n\r\n d.append(x)\r\n\r\nv = {}\r\nfor i in range(len(s)):\r\n if s[i] not in v :\r\n v[s[i]] = 1\r\n else:\r\n v[s[i]] +=1\r\n\r\n\r\nfor i in d :\r\n if i not in v :\r\n v[i] = 1\r\n else:\r\n v[i]+=1\r\n\r\n#print(v)\r\nmx = -1\r\nans = ''\r\n\r\nfor i in v :\r\n if v[i] >= 2 :\r\n if len(i) > mx :\r\n mx = max(mx , len(i))\r\n\r\nprint(mx)\r\n\r\n", "n = input()\r\nans = 0\r\nfor i in range(len(n)-1):\r\n for x in range(i, len(n)):\r\n a = n[i:x+1]\r\n if n.count(a,i+1, len(n)) > 0 and len(a) > ans:\r\n ans = len(a)\r\nprint(ans)\r\n", "from collections import Counter\r\nstr = input() + \"x\"\r\nsbstr = []\r\n\r\nfor i in range(len(str)-1):\r\n for j in range(i, len(str)):\r\n \r\n \r\n \r\n \r\n sbstr.append(str[i:j])\r\n \r\n\r\n\r\nsbstr = list(filter(None, sbstr))\r\n\r\nsbstr = [len(k)for k,v in Counter(sbstr).items() if v>1]\r\nif len(sbstr)!=0:\r\n print(max(sbstr))\r\nelse:\r\n print(0)\r\n \r\n\r\n\r\n\r\n\r\n \r\n ", "s = input()\nss = []\nl = 0\nfor i in range(len(s)):\n for j in range(i+1, len(s)+1):\n ss.append(s[i:j])\n \nfor i in ss:\n if (ss.count(i) >= 2):\n if (len(i) > l):\n l = len(i)\nprint(l)\n\t \t\t \t\t \t\t\t \t \t\t\t\t \t\t \t \t", "a = input()\n\ns_l =[]\nn = 0\nfor i in range(len(a)):\n for j in range(i+1,len(a)+1):\n s_l.append(a[i:j])\n\nfor i in s_l:\n if s_l.count(i)>=2:\n if len(i)>n:\n n = len(i)\nprint(n)\n \n\t \t\t \t\t \t\t \t\t\t\t\t \t \t\t\t\t \t\t\t", "import sys\nfrom random import *\nfrom bisect import *\nfrom heapq import *\n#from collections import deque\npl=1\nfrom math import gcd,sqrt,ceil\nfrom copy import *\nsys.setrecursionlimit(10**5)\nif pl:\n\tinput=sys.stdin.readline\nelse:\t\n\tsys.stdin=open('input.txt', 'r')\n\tsys.stdout=open('outpt.txt','w')\n\ndef li():\n\treturn [int(xxx) for xxx in input().split()]\ndef fi():\n\treturn int(input())\ndef si():\n\treturn list(input().rstrip())\t\ndef mi():\n\treturn \tmap(int,input().split())\t\n\n\t\t\nt=1\n\nwhile t>0:\n\tt-=1\n\ts=input().rstrip()\n\tn=len(s)\n\td={}\n\tfor i in range(n):\n\t\tr=\"\"\n\t\tfor j in range(i,n):\n\t\t\tr+=s[j]\n\t\t\tif r not in d:\n\t\t\t\td[r]=1\n\t\t\telse:\n\t\t\t\td[r]+=1\n\tmaxi=0\t\t\t\n\tfor i in d:\n\t\tif d[i]>=2:\n\t\t\tmaxi=max(maxi,len(i))\n\tprint(maxi)\t\t\n \t \t\t \t\t \t \t\t\t\t \t\t \t \t\t \t \t\t\t", "string = input()\r\ntotalmax = 0;\r\nfor x in range(len(string)):\r\n curr = \"\"\r\n for y in string[x:]:\r\n curr +=y;\r\n if string[x:].rfind(curr) != string[x:].find(curr):\r\n totalmax = max(totalmax, len(curr))\r\n continue\r\nprint(totalmax)", "s = input().strip()\r\nmx = 0\r\nfor i in range(len(s)):\r\n for j in range(i+1, len(s)):\r\n k = 0\r\n while ((j+k) < len(s) and s[i+k] == s[j+k]):\r\n k += 1\r\n mx = max(mx, k)\r\nprint(mx)\r\n", "s = input(); \nlength = len(s); \nstr = []; \nfor i in range(0,length): \n for j in range(i,length): \n str.append(s[i:(j+1)]); \nx={}\ny=[]\nfor i in str: \n if(i in x.keys()):\n x[i]+=1\n else:\n x[i]=1\n if(x[i]>=2):\n if(i not in y):\n y.append(i)\nnum=0\nfor i in y:\n le=len(i)\n if(le>=num):\n num=le\nprint(num)\n \t \t \t \t\t\t\t\t \t \t \t\t\t\t", "s = input()\r\nleng = 0\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(s) + 1):\r\n sub = s[i:j]\r\n if s.count(sub) >= 2 and len(sub) > leng:\r\n leng = len(sub)\r\n elif s.count(sub) == 1:\r\n for k in range(1, len(sub)):\r\n if s[i - k:j - k] == sub and len(sub) > leng:\r\n leng = len(sub)\r\n\r\nprint(leng)", "s=input()\r\nn=len(s)\r\nm=n-1;\r\nwhile m>0:\r\n f=False\r\n for i in range(0,n-m):\r\n for j in range(i+1,n-m+1):\r\n x=True\r\n for k in range(0,m):\r\n if s[i+k]!=s[j+k]:\r\n x=False\r\n break\r\n if x:\r\n f=True\r\n break\r\n if f:\r\n break\r\n if f:\r\n break\r\n m -= 1\r\nprint(m)", "def longest_substring(st):\n a = {}\n\n for i in range(len(st)):\n for j in range(1, len(st) - i + 1):\n a[st[i:i + j]] = a.get(st[i:i + j], 0) + 1\n\n ans = 0\n for k, v in a.items():\n if v >= 2:\n ans = max(ans, len(k))\n\n return ans\n\n\nst = input(\"\")\nprint(longest_substring(st))\n \t \t \t\t\t \t \t\t\t \t \t", "s = input()\r\nn = len(s)\r\nc = 0\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if s[i:j] in s[i + 1:]:\r\n c = max(c, len(s[i:j]))\r\nprint(c)\r\n", "str = input(); \nn = len(str); \narr = []; \nfor i in range(0,n): \n for j in range(i,n): \n arr.append(str[i:(j+1)]); \nd={}\nl=[]\nfor i in arr: \n if(i in d.keys()):\n d[i]+=1\n else:\n d[i]=1\n if(d[i]>=2):\n if(i not in l):\n l.append(i)\nmax=0\nfor i in l:\n le=len(i)\n if(le>=max):\n max=le\nprint(max)\n \t \t\t\t\t\t \t \t \t \t \t", "inp = input()\r\nlista = list()\r\nkeyList = list()\r\n\r\nans = 0;\r\nmaxLen = 0;\r\n\r\nocc = dict()\r\n\r\n\r\nfor x1 in range(len(inp)):\r\n for x2 in range(x1, len(inp)):\r\n substr = inp[x1:x2+1]\r\n numOfocc = occ.get(substr, 0)\r\n occ[substr] = numOfocc+1\r\n\r\n if (occ[substr] > 1 and len(substr) > maxLen):\r\n maxLen = len(substr)\r\n\r\nprint(maxLen)\r\n\r\n\r\n", "s = input()\r\nk = []\r\nfor i in range(len(s)):\r\n for j in range(i+1,len(s)+2):\r\n x = s[i:j]\r\n for t in range(i+1,len(s)):\r\n if x == s[t:t+j-i]:\r\n k += [j-i]\r\nprint(max(k) if k != [] else 0)", "def run():\r\n s = input()\r\n r = 0\r\n n = len(s)\r\n st = set()\r\n for i in range(n):\r\n for j in range(i, n):\r\n if s[i:j+1] in st:\r\n r = max(r, j - i + 1)\r\n st.add(s[i:j+1])\r\n print(r)\r\n\r\n\r\ndef read_ln(): return input().split()\r\ndef int_ln(): return int(input())\r\ndef ints_ln(): return map(int, read_ln())\r\ndef yes_or_no(b): return \"YES\" if b else \"NO\"\r\n\r\n\r\ndef even(x): return x % 2 == 0\r\ndef odd(x): return x % 2 == 1\r\n\r\n\r\nrun()\r\n# [run() for _ in range(int_ln())]\r\n", "s = input()\r\nd = {}\r\nfor i in range(len(s)):\r\n for j in range(i,len(s)):\r\n if s[i:j+1] not in d:\r\n d[s[i:j+1]] = 1\r\n else:\r\n d[s[i:j+1]] += 1\r\nml = 0\r\nfor i in d:\r\n if d[i] >= 2:\r\n ml = max(ml,len(i))\r\nprint(ml)", "import collections\r\nimport itertools\r\n\r\ns = input()\r\n\r\nc = collections.Counter()\r\n\r\nfor start, end in itertools.combinations(range(len(s)+1), 2):\r\n c[s[start:end]] += 1\r\n\r\nprint(max(map(len, [x for x, r in c.items() if r > 1]), default=0))\r\n", "from collections import Counter\r\ndef Youre_Given_a_String():\r\n String = input()\r\n pos_substrings = []\r\n \r\n for i in range(len(String)):\r\n sub_String = String[i]\r\n pos_substrings.append(sub_String)\r\n for j in range(i+1,len(String)):\r\n sub_String += String[j]\r\n pos_substrings.append(sub_String)\r\n \r\n repeat = Counter(pos_substrings)\r\n max_val = 0\r\n # print(repeat)\r\n for i in repeat.keys():\r\n if repeat[i] >= 2:\r\n if len(i) > max_val:\r\n max_val = len(i)\r\n \r\n\r\n return max_val \r\n \r\n\r\n \r\n \r\n \r\nremaing_test_cases = 1 \r\n# remaing_test_cases = int(input())\r\nwhile remaing_test_cases > 0:\r\n print(Youre_Given_a_String())\r\n remaing_test_cases = remaing_test_cases - 1 \r\n", "S = input()\r\nsLen, ans = len(S), 0\r\nfor i in range(sLen):\r\n for till1 in range(i + 1, sLen):\r\n till2 = till1 + 1\r\n for j in range(i + 1, sLen):\r\n if till2 > sLen:\r\n break\r\n sub1 = S[i:till1]\r\n sub2 = S[j:till2]\r\n subLen = len(sub1)\r\n if sub1 == sub2 and ans < subLen:\r\n ans = subLen\r\n till2 += 1\r\n\r\nprint(ans)\r\n", "\"\"\"\n$ pylint calderonsin.py\nGlobal evaluation\n-----------------\nYour code has been rated at 10.00/10 (previous run: 10.00/10, +0.00)\n\n\"\"\"\ndef maxlen():\n string = input()\n maxi = 0;\n for x in range(len(string)):\n substring = \"\"\n for y in string[x:]:\n substring +=y;\n if string[x:].rfind(substring) != string[x:].find(substring):\n maxi = max(maxi, len(substring))\n continue\n print(maxi)\n\nmaxlen()\n# $ python3 calderonsin.py build\n# remember the output\n", "s=input()\nm=0\nl=[]\nfor i in range (0,len(s)):\n for j in range (i+1,len(s)+1):\n l.append(s[i:j])\nfor i in l:\n if(l.count(i)>=2):\n if(len(i)>m):\n m=len(i)\nprint(m)\n\t\t \t \t \t\t\t\t \t\t\t\t \t \t \t", "s=input()\na,b=[],[]\nfor i in range(0,len(s)):\n for j in range(i+1,len(s)+1):\n a.append(s[i:j])\nfor i in a:\n c=a.count(i)\n if(c>=2):\n b.append(i)\nif(len(b)==0):\n print(0)\nelse:\n\tprint(len(max(b, key=len)))\n\t \t \t\t\t\t \t\t\t \t\t \t \t \t\t", "S = input()\r\n\r\nans = 0\r\nmet = set()\r\n\r\nfor i in range(len(S)):\r\n for j in range(i, -1, -1):\r\n if S[j:i+1] in met:\r\n ans = max(ans, i - j + 1)\r\n else:\r\n met.add(S[j:i+1])\r\n \r\nprint(ans)", "s = input()\r\nn = len(s)\r\nmax_len = 0\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n+1):\r\n substring = s[i:j]\r\n if substring in s[i+1:] and len(substring) > max_len:\r\n max_len = len(substring)\r\n\r\nprint(max_len)\r\n", "str_given = input()\r\nlength = len(str_given)\r\nwhile length >=1:\r\n global freqs\r\n freqs = {}\r\n for i in range(0,len(str_given)-length+1):\r\n if str_given[i:i + length] in freqs.keys():\r\n p_i = freqs[str_given[i:i+length]]\r\n freqs[str_given[i:i+length]] = p_i + 1\r\n elif str_given[i:i+length] not in freqs.keys():\r\n freqs[str_given[i:i+length]] = 1\r\n if sum(freqs.values()) > len(freqs.keys()) and length != 1:\r\n break\r\n elif sum(freqs.values()) == len(freqs.keys()) and length != 1:\r\n pass\r\n elif length == 1:\r\n break\r\n length -= 1\r\nl = freqs.keys()\r\nif len(l) < sum(freqs.values()):\r\n print(length)\r\nelse:\r\n print(0)", "import collections as col\r\ns = input()\r\ntup = ()\r\ndtup = ('',0)\r\nfor i in range(1, len(s)):\r\n x = [s[j:j+i] for j in range(0,len(s)-i+1)]\r\n if(col.Counter(x).most_common(1)[0][1] > 1):\r\n tup = col.Counter(x).most_common(1)[0]\r\n x,y = tup\r\n if(len(x) > len(dtup[0]) and y > 1):\r\n dtup = tup\r\nprint(len(dtup[0]))", "import sys\nimport logging\nlogging.root.setLevel(level=logging.DEBUG)\nimport re\n\ns = sys.stdin.readline().strip()\n\nfrom collections import defaultdict\nsubstr = defaultdict(int)\nfor left in range(len(s)):\n for right in range(left+1,len(s)+1):\n substr[s[left:right]] += 1\nmax_len = 0\nfor segment,times in substr.items():\n if times >= 2:\n max_len = max(max_len,len(segment))\nprint(max_len)\n\n", "def longest_repeated_substring(st):\n mp = {}\n\n for i in range(len(st)):\n for j in range(1, len(st) - i + 1):\n mp[st[i:i + j]] = mp.get(st[i:i + j], 0) + 1\n\n ans = 0\n for k, v in mp.items():\n if v >= 2:\n ans = max(ans, len(k))\n\n return ans\n\n\nst = input()\nprint(longest_repeated_substring(st))\n\t\t \t \t\t \t\t\t\t \t\t \t\t \t\t \t \t", "\r\nstring = str(input())\r\nlength = len(string)\r\n\r\ncounter = 0\r\nli = []\r\nmatch_li = []\r\n\r\nfor i in range(length):\r\n letter = string[i]\r\n letters = letter\r\n if letter in li:\r\n match_li.append(letter)\r\n li.append(letter)\r\n for j in range(i+1, length):\r\n letters += string[j]\r\n if letters in li:\r\n match_li.append(letters)\r\n li.append(letters)\r\n\r\nlongest = 0\r\nfor k in match_li:\r\n if len(k) > longest:\r\n longest = len(k)\r\n\r\nprint(longest)\r\n \r\n", "s = input()\nn = len(s)\nans = 0\nfor i in range(n):\n for j in range(i, n):\n sub = s[i: j + 1]\n if s.count(sub, i + 1):\n ans = max(ans, j - i + 1)\nprint(ans)\n", "def solve(s: str):\r\n subs = list()\r\n for i in range(1, len(s) + 1):\r\n subs.append(s[i:])\r\n subs.append(s[:-i])\r\n for j in range(1, len(s) + 1):\r\n subs.append(s[j:-i])\r\n while '' in subs:\r\n subs.remove('')\r\n\r\n dictionary = {}\r\n for i in subs:\r\n dictionary.update({i: dictionary.get(i, 0) + 1})\r\n\r\n candidates = list()\r\n printed = False\r\n for i in dictionary:\r\n if dictionary.get(i, 0) >= 2:\r\n candidates.append(i)\r\n printed = True\r\n\r\n if not printed:\r\n print(f'{0}')\r\n else:\r\n max_len = 0\r\n for i in candidates:\r\n if len(i) > max_len:\r\n max_len = len(i)\r\n print(f'{max_len}')\r\n\r\n\r\nif __name__ == '__main__':\r\n inp = str(input())\r\n solve(inp)\r\n", "x=input();l=len(x);m=0\nfor i in range(l-1):\n f=i\n while 1 : \n idx = x[f+1:].find(x[f]) \n if idx == -1 :\n break\n else:\n idx += f+1 ; c=ans=0\n for j in range(idx , l) :\n if x[j] == x[i+c]:\n ans+=1\n c+=1 \n else:\n break\n \n if m < ans :\n m=ans\n f = idx \nprint(m)\n\n \t\t\t\t \t\t\t \t \t\t\t\t\t\t \t\t", "s = input().strip()\r\nres = 0\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(s)):\r\n tmp = 0\r\n for k in range(len(s) - j):\r\n if s[i + k] == s[j + k]:\r\n tmp += 1\r\n else:\r\n break\r\n res = max(tmp, res)\r\n\r\nprint(res)", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import *\r\nfrom itertools import accumulate, count\r\n\r\ninf = float(\"inf\")\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\narr = ip()\r\nn = len(arr)\r\nms = \"\"\r\nmn = 0\r\n\r\n\r\ndef counter(s, x):\r\n p = len(x)\r\n px = 0\r\n for i in range(len(s)):\r\n if s[i : i + p] == x:\r\n px += 1\r\n\r\n return px\r\n\r\n\r\nfor i in range(n):\r\n s = \"\"\r\n for j in range(i, n):\r\n s += arr[j]\r\n c = counter(arr, s)\r\n if c > 1 and len(s) > mn:\r\n ms = s\r\n mn = len(s)\r\n\r\nprint(mn)", "a1=input()\n\nl=[]\nn=0\nfor i in range(len(a1)):\n for j in range(i+1,len(a1)+1):\n l.append(a1[i:j])\nfor i in l:\n if l.count(i)>=2:\n if len(i)>n:\n n=len(i)\nprint(n)\n\t\t \t \t\t\t \t \t \t\t\t \t\t", "def check(string):\r\n n = len(string)\r\n dp = [[0] * (n + 1) for i in range(n + 1)]\r\n\r\n max_length = 0\r\n\r\n for i in range(1, n + 1):\r\n for j in range(i + 1, n + 1):\r\n if string[i - 1] == string[j - 1]:\r\n dp[i][j] = dp[i - 1][j - 1] + 1\r\n max_length = max(max_length, dp[i][j])\r\n\r\n return max_length\r\n\r\nstring = input()\r\nresult = check(string)\r\nprint(result)", "def cnt(s,t):\r\n i,c=0,0\r\n while(s.count(t)):\r\n s=s[s[i:].index(t)+1:]\r\n c+=1\r\n return c\r\ns=(input())\r\nn=len(s)\r\nln=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if(j-i+1<=ln):\r\n continue\r\n if(cnt(s,s[i:j+1])>=2):\r\n ln=max(ln,j-i+1)\r\nprint(ln)\r\n", "s = input()\r\n\r\nmc = -1\r\n\r\nfor i in range(len(s)):\r\n\tfor j in range(i+1, len(s)):\r\n\t\tcu = 0\r\n\t\tfor cu in range(len(s)-max(i, j)):\r\n\t\t\tif s[i+cu] == s[j+cu]:\r\n\t\t\t\tmc = max(mc, cu)\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\t\r\n\r\nprint(mc + 1)\r\n\t\t\t\r\n", "# -*- coding: utf-8 -*-\r\n\r\ns = input()\r\nn,m = len(s),0\r\n\r\nfor i in range(n-1):\r\n for j in range(i,n+1):\r\n if len(s[i:j]) > m and s[i:j] in s[i+1:n]: m = len(s[i:j])\r\n \r\nprint(m)\r\n", "str=input()\r\nn=len(str)\r\nans=0\r\namap={}\r\ndef fun():\r\n global ans\r\n for strLen in range(n,0,-1):\r\n mark=0\r\n for t in range(0,n):\r\n if t+strLen>n:\r\n break\r\n s=str[t:t+strLen]\r\n if s in amap:\r\n amap[s]+=1\r\n else:\r\n amap[s]=1\r\n if amap[s]>=2:\r\n mark=1\r\n ans=len(s)\r\n print(ans)\r\n break\r\n if mark==1:\r\n break\r\nfun()\r\nif ans==0:\r\n print(ans)", "s=input()\r\nm=0\r\nn=len(s)\r\nfor i in range(n-1):\r\n for j in range(i,n+1) :\r\n if s[i:j] in s[i+1:n] and len(s[i:j])>m:\r\n m=len(s[i:j])\r\nprint(m)", "string=input()\nn=len(string)\nlistaUtil=[]\nflag=0\nfor i in range(n):\n for j in range(i+1,n+1):\n concatenacao=string[i:j]\n \n if concatenacao in listaUtil:\n if len(concatenacao)>flag:\n flag=len(concatenacao)\n else:\n listaUtil.append(concatenacao)\n \n \n \n \nprint(flag) \n \n \t\t\t\t \t\t \t\t \t \t \t\t \t\t\t\t", "'''\r\n\r\n\n\n15.07.2021\n\n\r\n\r\nCF 023 A\r\n\r\n\n\n\n'''\r\n\r\n\n\ns = input (); \nn = len (s); \n\nmax = 0\r\n\r\n\n\ndef F () :\r\n\n mx = 0\r\n\n for i in range (n) :\r\n\n for j in range (i+1, n) :\r\n\n for k in range (n-j+1) :\r\n\n if s [i:i+k] == s [j:j+k] :\r\n\n if k > mx :\n\r\n mx = k\n\r\n return mx\r\n\r\n\n\nmax = F (); \n\nprint (max);\n", "s = input()\r\nN = len(s)\r\ndp = [0] * N\r\n\r\ndef count_sliding(string, substring):\r\n N = len(string)\r\n N_sub = len(substring)\r\n c = 0\r\n for i in range(len(string)):\r\n if string[i:i+N_sub] == substring:\r\n c += 1\r\n return c\r\nfor i in range(N):\r\n actual_string = \"\"\r\n sub_dp = [0] * N\r\n for j in range(i, N):\r\n letter = s[j]\r\n actual_string += letter\r\n c = count_sliding(s, actual_string)\r\n if c >= 2:\r\n if j == 0:\r\n sub_dp[j] = 1\r\n else:\r\n sub_dp[j] = sub_dp[j-1] + 1\r\n else: \r\n dp[i] = max(sub_dp)\r\n break\r\nprint(max(dp))", "s = input()\r\nls = len(s)\r\nmx = 0\r\nfor l in range(1, ls):\r\n for i in range(ls-l+1):\r\n j = i+l-1\r\n idx = s.find(s[i:j+1], i+1)\r\n if idx != -1:\r\n mx = max(mx, l)\r\nprint (mx)", "from collections import Counter\n\ns = input()\na = [s[i:j] for i in range(len(s)) for j in range(i + 1, len(s) + 1)]\nres = 0\nb = Counter(a)\nfor i in b.items():\n if i[1] > 1:\n if len(i[0]) > res:\n res = len(i[0])\nprint(res)\n\n \t \t\t \t\t\t\t \t\t \t\t \t \t\t \t\t", "def long_repeat_ss(str1):\n n = len(str1)\n longest = 0\n for i in range(n):\n for j in range(i+1, n):\n k = 0\n while j+k < n and str1[i+k] == str1[j+k]:\n k += 1\n if k > 0 and k > longest:\n longest = k\n return longest\n\ns = input()\nprint(long_repeat_ss(s))\n \t \t\t \t\t \t \t\t \t \t\t\t\t\t\t\t", "s = input()\r\nsLen, ans = len(s), 0\r\n\r\nfor i in range(sLen - 1):\r\n for till1 in range(i + 1, sLen):\r\n till2 = till1 + 1\r\n for j in range(i + 1, sLen):\r\n if till2 > sLen:\r\n break;\r\n sub1 = s[i:till1]\r\n sub2 = s[j:till2]\r\n subLen = len(sub1)\r\n if sub1 == sub2 and subLen > ans:\r\n ans = subLen\r\n till2 += 1\r\n\r\nprint(ans)\r\n", "# import sys\r\n# input = 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\ns = input()\r\nif (len(set(s)) == len(s)):\r\n print(\"0\")\r\nelif (len(set(s)) == 1):\r\n print(len(s) - 1)\r\nelse:\r\n d = {}\r\n for i in range(len(s)):\r\n for j in range(1, len(s)-i+1):\r\n if (s[i:i+j] in d.keys()):\r\n d[s[i:i+j]] += 1\r\n else:\r\n d[s[i:i+j]] = 1\r\n ans = 0\r\n for i,j in d.items():\r\n if (j >= 2):\r\n ans = max(ans, len(i))\r\n print(ans)\r\n", "t = input()\r\n\r\nn = len(t)\r\n\r\nmaxi = 0\r\n\r\nfor i in range(n):\r\n s = t[i]\r\n if t.count(s) > 1:\r\n maxi = max(maxi, 1)\r\n nr = 1\r\n for j in range(i + 1, n):\r\n s += t[j]\r\n nr += 1\r\n g = 0\r\n for h in range(n - nr + 1):\r\n if s == t[h:h + nr]:\r\n g += 1\r\n if g > 1:\r\n maxi = max(nr,maxi)\r\n\r\nprint(maxi)", "s = input()\r\npb = 0\r\nlenght = len(s)-1\r\nw = []\r\nwhile(lenght!=0):\r\n ss = s[pb:pb+lenght]\r\n w.append(ss)\r\n if pb+lenght==len(s):\r\n pb = 0\r\n lenght -= 1\r\n else:\r\n pb+=1\r\nfor i in range(0,len(w)-1):\r\n for j in range(i+1,len(w)):\r\n if (w[i]==w[j]):\r\n print(len(w[i]))\r\n exit(0)\r\nprint(0)\r\n\r\n \r\n", "s = input()\r\nn = len(s)\r\n\r\nfor L in range(n-1, 0, -1):\r\n if len({s[i:i+L] for i in range(n-L+1)}) < n-L+1:\r\n print(L)\r\n break\r\nelse:\r\n print(0)", "s = input()\nstart = 0\nl = []\nfor i in range(len(s) - 1):\n for j in range(1, len(s)):\n s1 = s[i:j]\n if s.find(s1,i+1) != -1:\n l.append(len(s1))\nif len(l) == 0:\n print(0)\nelse:\n print(max(l))\n \n\n \t\t \t \t \t \t \t\t\t\t\t \t \t \t\t \t\t", "s=input()\ndic = {}\nfor i in range(len(s)):\n for j in range(i+1,len(s)+1):\n if(dic.get(s[i:j])==None):\n dic[s[i:j]]=1\n else:\n dic[s[i:j]]+=1\n \nlength= 0\n\nfor i,j in dic.items():\n if j>=2:\n if(len(i)>length):\n length=len(i)\nprint(length)\n\t\t \t \t\t\t\t\t\t \t\t \t \t\t\t\t\t \t\t\t\t", "string = input(\"\")\nsub_str = []\nlength = 0\nfor i in range(len(string)):\n for j in range(i+1, len(string)+1):\n sub_str.append(string[i:j])\n\nfor i in sub_str:\n if (sub_str.count(i) >= 2):\n if (len(i) > length):\n length = len(i)\nprint(length)\n \t\t\t \t \t\t \t\t\t\t \t", "s = input()\r\nn = len(s)\r\nd = {}\r\nfor i in range(n):\r\n for j in range(i + 1, n + 1):\r\n sub = s[i:j]\r\n d[sub] = 1 + d.get(sub, 0)\r\nans = 0\r\nfor sub,val in d.items():\r\n if val >= 2:\r\n ans = max(ans, len(sub))\r\nprint(ans)\r\n", "s=input()\r\no=len(s)\r\nk=0\r\nfor i in range(o):\r\n r={0}\r\n for j in range(o-i+1):\r\n if s[j:j+i] in r:k=max(i,k)\r\n else:r.add(s[j:j+i])\r\nprint(k)", "line = input()\r\nn = len(line)\r\ntemp = [0]\r\nfor i in range(1, n):\r\n for j in range(n-i):\r\n for k in range(1, n-i-j+1):\r\n # print(line[j:j+i+1])\r\n # print(line[j+k:j+k+i+1])\r\n if line[j:j+i] == line[j+k:j+k+i]:\r\n temp.append(i)\r\nprint(max(temp))", "s = input()\r\n\r\n\r\ndef check_x(mid):\r\n ans = 'no'\r\n d = {}\r\n for i in range(len(s)-mid+1):\r\n #print(s[i:i+mid])\r\n if s[i:i+mid] in d.keys():\r\n ans = 'yes'\r\n break\r\n d[s[i:i+mid]] = 1\r\n \r\n return ans\r\n\r\n \r\nl = 0\r\nr = len(s) - 1\r\nwhile r-l > 1:\r\n mid = (r+l) // 2\r\n\r\n ans = check_x(mid)\r\n if ans == 'yes':\r\n l = mid\r\n else:\r\n r = mid\r\n \r\nif check_x(r) == 'yes':\r\n print(r)\r\nelse:\r\n print(l)\r\n ", "s = input()\nm = 0\nfor i in range(1,len(s)):\n for j in range(0,len(s)-i):\n if(s.count(s[j:j+i],j+1)>=1):\n m = max(m,i)\nprint(m)\n \t \t\t\t \t \t \t\t \t \t \t\t\t\t\t", "s = input()\nans = 0\nfor i in range(len(s)):\n for j in range(i + 1, len(s)):\n cur = s[i:j]\n if cur in s[:(j - 1)] or cur in s[(i + 1):]:\n ans = max(ans, j - i)\nprint(ans)\n", "s = input()\r\nn = len(s)\r\nC = 0\r\nfor i in range(n - 1):\r\n for j in range(1, n - i):\r\n if s[i:i + j] in s[i + 1:]:\r\n if j > C:\r\n C = j\r\nprint(C)", "s = input()\n\nd = dict()\nfor i in range(len(s)):\n for j in range(len(s)):\n sub = s[i:j+1]\n if sub in d:\n d[sub] += 1\n else:\n d[sub] = 1\n\nres = []\nfor key in d:\n if d[key] > 1:\n res.append(len(key))\nif not res: print(0)\nelse: print(max(res))\n\n \t \t \t\t \t \t\t\t\t \t\t\t\t\t\t", "string=input()\nd = {}\nfor i in range(len(string)):\n for j in range(i+1,len(string)+1):\n if(d.get(string[i:j])==None):\n d[string[i:j]]=1\n else:\n d[string[i:j]]+=1\na= 0\nfor i,j in d.items():\n if j>=2:\n if(len(i)>a):\n a=len(i)\nprint(a)\n \t \t\t\t \t \t\t \t \t \t\t\t \t \t\t", "from collections import defaultdict\r\ns = input() \r\nd = defaultdict(int) \r\nfor i in range(len(s)): \r\n for j in range(i,len(s)): \r\n t = s[i:j+1] \r\n d[t] += 1\r\nans = 0 \r\nfor i in d : \r\n if d[i] >= 2 : ans = max(ans, len(i)) \r\nprint(ans)", "from collections import Counter\r\ns = input()\r\nl = []\r\nfor i in range(len(s)):\r\n for j in range(i, len(s)):\r\n l.append(s[i:j+1])\r\nl = Counter(l)\r\nmax_length = 0\r\nfor k,v in l.items():\r\n if v >= 2:\r\n max_length = max(max_length,len(k))\r\nprint(max_length)", "s = input()\r\nsubs = {}\r\nfor i in range(1,len(s)+1):\r\n for j in range(len(s)-i+1):\r\n if s[j:j+i] in subs:\r\n subs[s[j:j+i]] += 1\r\n else:\r\n subs[s[j:j+i]] = 0\r\n\r\nsub_2 = []\r\nfor k,v in subs.items():\r\n if v > 0 :\r\n sub_2.append(k)\r\nif len(sub_2) > 0:\r\n print(max([len(i) for i in sub_2]))\r\nelse: print(0)", "s = input()\nl = 0\nsub = []\nmax = []\nfor i in range(len(s)):\n for j in range(i+1, len(s)+1):\n sub.append(s[i:j])\nfor i in range(len(sub)):\n if(sub.count(sub[i])>1):\n max.append(sub[i])\nfor i in range(len(max)):\n if(len(max[i]) > l):\n l = len(max[i])\nprint(l)\n \t \t \t\t\t\t\t\t\t\t \t\t\t\t\t\t \t", "sum = input()\r\nfor k in range(len(sum), 0, -1):\r\n\tfor l in range(len(sum) - k + 1):\r\n\t\tif sum[l: l + k] in sum[l + 1:]:\r\n\t\t\tprint(k)\r\n\t\t\texit()\r\nprint(0)", "x = input()\ndic = {}\n\nfor i in range(len(x)):\n for j in range(i+1,len(x)+1):\n if(dic.get(x[i:j])==None):\n dic[x[i:j]]=1\n else:\n dic[x[i:j]]+=1\n \nl = 0\n\nfor i,j in dic.items():\n if j>=2:\n if(len(i)>l):\n l = len(i)\nprint(l)\n \t\t \t\t \t \t \t\t \t \t\t\t \t \t\t\t", "def count_overlapping_substrings(haystack, needle):\r\n count = 0\r\n i = -1\r\n while True:\r\n i = haystack.find(needle, i+1)\r\n if i == -1:\r\n return count\r\n count += 1\r\n\r\nk = str(input())\r\nmx = 0\r\nfor i in range(len(k) - 1):\r\n for j in range(i + 1, len(k)):\r\n if count_overlapping_substrings(k,k[i:j]) >= 2 and j-i > mx:\r\n mx = j-i\r\nprint(mx)\r\n", "str = input().strip()\nn = len(str)\nresult = 0\nfor i in range(n):\n for j in range(i + 1, n):\n k = 0\n while j + k < n and str[i + k] == str[j + k]:\n k += 1\n result = max(result, k)\nprint(result)\n\t\t\t\t\t \t\t\t\t\t \t\t \t \t \t\t\t \t\t", "s=input()\r\nls=len(s)\r\nj=2\r\nfor i in range(ls-1,0,-1):\r\n q=[]\r\n for k in range(j):\r\n w=s[k:k+i]\r\n if w in q:\r\n print(i)\r\n exit()\r\n else:\r\n q.append(w)\r\n j+=1\r\nprint(0)\r\n", "s=input()\r\nfor ln in range(len(s),0,-1):\r\n for L in range(len(s)-ln+1):\r\n if s[L:L+ln] in s[L+1:]:\r\n print(ln)\r\n exit()\r\nprint(0)\r\n \r\n", "a=input()\r\nn=len(a)\r\nfor i in range(n-1,-1,-1):\r\n b=sorted([a[j:j+i] for j in range(n-i+1)])\r\n if True in [b[j]==b[j-1] for j in range(1,n-i+1)]:\r\n print(i)\r\n break", "def build_suffix_array(s):\n n = len(s)\n sa = [i for i in range(n)]\n rank = [ord(s[i]) for i in range(n)]\n k = 1\n while k < n:\n sa.sort(key=lambda i: (rank[i], rank[i+k] if i+k < n else -1))\n new_rank = [0] * n\n r = 0\n for i in range(n):\n if i > 0 and rank[sa[i]] == rank[sa[i-1]] and rank[sa[i]+k if sa[i]+k < n else -1] == rank[sa[i-1]+k if sa[i-1]+k < n else -1]:\n new_rank[sa[i]] = r\n else:\n r += 1\n new_rank[sa[i]] = r\n rank = new_rank\n k *= 2\n return sa\n\ndef lcp_array(s, sa):\n n = len(s)\n rank = [0] * n\n for i in range(n):\n rank[sa[i]] = i\n lcp = [0] * (n-1)\n h = 0\n for i in range(n):\n if rank[i] < n-1:\n j = sa[rank[i]+1]\n while i+h < n and j+h < n and s[i+h] == s[j+h]:\n h += 1\n lcp[rank[i]] = h\n if h > 0:\n h -= 1\n return lcp\n\ns = input()\nn = len(s)\nsa = build_suffix_array(s)\nlcp = lcp_array(s, sa)\nans = max(lcp) if lcp else 0\nprint(ans)\n\n \t\t\t\t\t\t\t \t \t\t\t\t\t\t\t \t\t \t", "def longest_repeating_substring(s):\n n=len(s)\n max_len=0\n for i in range(n):\n for j in range(i+1, n):\n k=0\n while j+k<n and s[i+k]==s[j+k]:\n k+=1\n if k>0 and k>max_len:\n max_len=k\n return max_len\n\ns=input()\nprint(longest_repeating_substring(s))\n\n \t \t\t\t \t\t \t\t \t \t", "s=(input())\nn = len(s)\nss = 0\nfor i in range(n):\n for j in range(i+1, n):\n k = 0\n while j+k < n and s[i+k] == s[j+k]:\n k += 1\n if k > 0 and ss < k:\n ss = k\n\nprint(ss)\n\t \t\t \t \t\t \t \t \t\t \t\t\t\t\t\t \t", "'''\r\ns = input()\r\nsLen = len(s)\r\nwhile sLen != 0:\r\n for i in range(sLen):\r\n print(s[i])\r\n sLen = sLen - 1\r\n'''\r\n\r\n'''\r\n 012345\r\ns='abcdef'\r\ns[0:1] =='a'\r\ns[0:2]=='ab'\r\n........\r\ns[1:2]=='b'\r\ns[1:3]=='bc'\r\ns[1:4]=='bcd'\r\n.......\r\ns[2:3]=='c'\r\ns[2:4]=='cd'\r\n......\r\n'''\r\ns = input()\r\nsLen, ans = len(s), 0\r\n\r\nfor i in range(sLen):\r\n for till1 in range(i + 1, sLen + 1):\r\n till2 = till1 + 1\r\n for j in range(i + 1, sLen):\r\n if till2 > sLen:\r\n break\r\n sub1 = s[i:till1]\r\n sub2 = s[j:till2]\r\n subLen = len(sub1)\r\n if sub1 == sub2 and ans < subLen:\r\n ans = subLen\r\n till2 += 1\r\n\r\nprint(ans)", "str=input(\"\")\nn=len(str)\nm=n-1\nwhile m>0:\n find=False\n for i in range(0,n-m):\n for j in range(i+1,n-m+1):\n match=True\n for k in range(m):\n if str[i+k]!=str[j+k]:\n match=False\n break\n if match:\n find=True\n break\n if find:\n break\n if find:\n break\n m-=1\nprint(m)\n \n \n\t \t \t\t\t\t\t \t\t\t\t\t\t\t \t\t\t\t\t \t\t", "s = input()\r\nres = 0\r\nfor i in range(len(s)):\r\n for j in range(i,len(s)):\r\n for f in range(i+1,len(s)):\r\n if len(s) >= f + j-i:\r\n if (s[i:j]== s[f:f+j-i]):\r\n res = max(res,j - i)\r\n \r\nprint(res)", "string = input()\nsub_string = []\nlength = 0\nfor i in range(len(string)):\n for j in range(i+1, len(string)+1):\n sub_string.append(string[i:j])\n\nfor i in sub_string:\n if (sub_string.count(i) >= 2):\n if (len(i) > length):\n length = len(i)\nprint(length)\n\n\t \t\t \t\t \t \t \t\t \t\t\t\t\t\t\t \t \t\t\t", "\r\nn = input()\r\n\r\nm = 0\r\nfor i in range(len(n)):\r\n\r\n for j in range(i,len(n)+1):\r\n\r\n if len(n[i:j])>m and n[i:j] in n[i+1:len(n)]:\r\n\r\n m = len(n[i:j])\r\n\r\nprint(m)\r\n", "s=input();\r\n\r\nf=0;\r\nfor i in range(len(s)-1,-1,-1):\r\n subs=set([]);\r\n for j in range(len(s)-i+1):\r\n sub=s[j:j+i];\r\n if sub in subs:\r\n f=1;\r\n break;\r\n subs.add(sub);\r\n if f:\r\n break;\r\n\r\nprint(i);\r\n", "inputS=input()\r\nans=0\r\n\r\nfor i in range (0,len(inputS)-1):\r\n for count in range(1,len(inputS)):\r\n for j in range(i+1, len(inputS)-count+1):\r\n A=inputS[i: i+count]\r\n B=inputS[j: j+count]\r\n if A==B:\r\n ans=count if count>ans else ans\r\n\r\nprint(ans)", "s = input().strip()\nn = len(s)\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n k = 0\n while j + k < n and s[i + k] == s[j + k]:\n k += 1\n ans = max(ans, k)\nprint(ans)\n\n \t \t\t \t\t \t\t\t\t \t\t\t", "word = input(\"\")\nl = []\nn = 0\n\nfor x in range(len(word)):\n for y in range(x + 1, len(word) + 1):\n l.append(word[x:y])\n\nfor x in l:\n if l.count(x) >= 2:\n if len(x) > n:\n n = len(x)\n\nprint(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", "import sys,math,bisect\r\ns=sys.stdin.readline().strip()\r\nn=len(s)\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if s[i:j] in s[i+1:]:\r\n ans=max(ans,j-i)\r\nprint(ans)", "L=input()\r\nm=0\r\nn=len(L)\r\nfor i in range(n-1):\r\n for j in range(i,n+1) :\r\n if L[i:j] in L[i+1:n] and len(L[i:j])>m:\r\n m=len(L[i:j])\r\nprint(m)", "\r\nclass Solve:\r\n\r\n def __init__(self) -> None:\r\n self.dauVao = input();\r\n\r\n def out(self):\r\n size = len(self.dauVao);\r\n ketQua = 0;\r\n for i in range(size - 1):\r\n check = \"\";\r\n for j in range(i,size):\r\n check += self.dauVao[j]\r\n if((check in self.dauVao[i + 1:]) == True):\r\n ketQua = max(len(check), ketQua);\r\n else:\r\n break;\r\n print(ketQua);\r\n\r\n\r\ndef main():\r\n p = Solve();\r\n p.out();\r\n\r\n\r\nmain();\r\n", "s, ans, = input(), 0\r\nsLen = len(s)\r\n\r\nfor i in range(sLen):\r\n for till1 in range(i + 1, sLen + 1):\r\n till2 = till1 + 1\r\n for j in range(i + 1, sLen + 1):\r\n if till2 > sLen:\r\n break\r\n sub1 = s[i:till1]\r\n sub2 = s[j:till2]\r\n subLen = len(sub1)\r\n if sub1 == sub2 and ans < subLen:\r\n ans = subLen\r\n till2 += 1\r\n\r\nprint(ans)\r\n", "s = input()\r\nfor i in range(len(s), 0, -1):\r\n\tfor j in range(len(s) - i + 1):\r\n\t\tif s[j: j + i] in s[j + 1:]:\r\n\t\t\tprint(i)\r\n\t\t\texit()\r\nprint(0)\r\n", "# Proctcode Week 1\\E\n# find the length of its longest substring that can be met in the string at least twice.\n\ns = input().strip()\nn = len(s)\nans = 0\nfor i in range(n):\n for j in range(i + 1, n):\n k = 0\n while j + k < n and s[i + k] == s[j + k]:\n k += 1\n ans = max(ans, k)\nprint(ans)\n \t \t \t\t\t \t\t \t\t \t\t \t\t", "string = input()\nlst= []\nfor i in range(len(string) - 1):\n for j in range(1, len(string)):\n string1 = string[i:j]\n if string.find(string1,i+1) != -1:\n lst.append(len(string1))\nif len(lst) == 0:\n print(0)\nelse:\n print(max(lst))\n \n \n \t\t \t\t \t \t\t\t \t\t \t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nn = len(s)\r\nk = n\r\nans = -1\r\nwhile k:\r\n k -= 1\r\n for i in range(n-k):\r\n x = s[i:k+i]\r\n if s.find(x, i+1) != -1:\r\n ans = k\r\n break\r\n if ans != -1:\r\n break\r\n\r\nif ans == -1:\r\n print(0)\r\nelse:\r\n print(k)", "string=input().strip()\r\nn=len(string)\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1,n+1):\r\n sub=string[i:j]\r\n sub_len=j-i\r\n if string[i+1:].count(sub):\r\n ans=max(ans,sub_len)\r\nprint(ans)\r\n", "string = input()\r\nsubstrings = {}\r\nmax = 0\r\n\r\nfor i in range(len(string)):\r\n j = 0\r\n while j < (len(string)):\r\n substring = string[i:j+1]\r\n if substring in substrings.keys():\r\n substrings[substring] += 1\r\n else:\r\n substrings[substring] = 1\r\n j += 1\r\n\r\nfor substring in substrings.keys():\r\n if substrings[substring] >= 2 and len(substring) > max:\r\n max = len(substring)\r\n\r\nprint(max)", "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\nx = []\r\ns = input() ; t = 0\r\nfor i in range(len(s)) : \r\n for j in range(i+1 , len(s)+1) : \r\n z = s[i:j]\r\n x.append(z)\r\nfor i in x : \r\n if x.count(i) > 1 and t < len(i) : \r\n t = len(i)\r\nprint(t)\r\n'''\r\n⢸⣿⣿⣿⣿⣿⡇⠀⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀\r\n⠘⣿⣿⣿⣿⣿⡇⠀⣿⣿⣿⣿⣿⠛⠛⠛⠛⠛⠛⠛⠛⠛⠋⠁⠀⠀ \r\n⠀⠈⠛⠻⠿⠿⠇⠀⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⣿⡇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣧⣀⣀⣿⠇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠘⢿⣿⣿⣿⣿⣿⣿⣿⡿⠋⠀⠀⠀⠀⠀⠀⠀\r\n'''\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# li = [0]\r\n# for j in range(1, 11):\r\n# for i in product(range(2), repeat=j):\r\n# x = []\r\n# for k in i:\r\n# if k:x.append(\"7\")\r\n# else:x.append(\"4\")\r\n# li.append(int(\"\".join(x)))\r\n# li.sort()\r\n\r\n# print(li.index(I()))", "s = input()\nn = len(s)\nans = 0\n\nfor i in range(n):\n for j in range(i+1, n):\n k = 0\n while i+k < n and j+k < n and s[i+k] == s[j+k]:\n k += 1\n if k > 0:\n ans = max(ans, k)\n\nprint(ans)\n \t\t \t\t \t\t \t\t \t\t \t\t \t \t", "def l_r_s(s):\n l = len(s)\n longest_length = 0\n for i in range(l):\n for j in range(i+1, l):\n k = 0\n while j + k < l and s[i + k] == s[j + k]:\n k += 1\n longest_length = max(longest_length, k)\n return longest_length\n\n# Example usage:\ns = input()\nt = l_r_s(s)\nprint(t)\n\n\t\t \t\t \t \t \t\t\t \t\t\t \t \t \t \t", "strg = input().strip()\nn = len(strg)\nresult = 0\nfor i in range(n):\n for j in range(i + 1, n):\n k = 0\n while j + k < n and strg[i + k] == strg[j + k]:\n k += 1\n result = max(result, k)\nprint(result)\n \t \t \t\t \t \t\t\t \t \t \t\t\t\t\t", "s=input()\r\nans=0\r\nm=set()\r\nfor i in range(len(s)):\r\n for j in range(i,-1,-1):\r\n if(s[j:i+1] in m):\r\n ans=max(ans,i-j+1)\r\n else:\r\n m.add(s[j:i+1])\r\nprint(ans)\r\n ", "a=input()\n\nl=[]\nn=0\nfor i in range(len(a)):\n for j in range(i+1,len(a)+1):\n l.append(a[i:j])\nfor i in l:\n if l.count(i)>=2:\n if len(i)>n:\n n=len(i)\nprint(n)\n \t\t\t\t\t\t \t\t \t\t \t\t \t\t", "s1=input()\ndic = {}\nfor i in range(len(s1)):\n for j in range(i+1,len(s1)+1):\n if(dic.get(s1[i:j])==None):\n dic[s1[i:j]]=1\n else:\n dic[s1[i:j]]+=1\n \nlength= 0\n\nfor i,j in dic.items():\n if j>=2:\n if(len(i)>length):\n length=len(i)\nprint(length)\n\n \t\t\t \t \t \t\t\t \t\t \t \t \t", "s = input()\nn = len(s)\nmax_len = 0\nfor i in range(n):\n for j in range(i+1, n):\n k = 0\n while j + k < n and s[i + k] == s[j + k]:\n k += 1\n if k > 0 and k > max_len:\n max_len = k\nprint(max_len)\n\n \t\t \t \t\t\t\t\t \t \t\t\t\t \t \t \t\t", "def main():\r\n s = input()\r\n n = len(s)\r\n mp = {}\r\n\r\n for i in range(n):\r\n for j in range(1, n + 1):\r\n if i + j <= n:\r\n t = s[i:i + j]\r\n mp[t] = mp.get(t, 0) + 1\r\n\r\n ans = 0\r\n for key, value in mp.items():\r\n if value >= 2:\r\n ans = max(ans, len(key))\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "ansp=[]\r\ndef main():\r\n s = input()\r\n for i in range(len(s) - 1, 0, -1):\r\n for j in range(len(s) - i):\r\n t = s[j:j+i]\r\n if s.find(t, j+1) != -1:\r\n ansp.append(i)\r\n return\r\n print(0)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n for i in ansp:\r\n print(i)", "s = input() \nn = len(s) \nlast_seen = {} \nmax_len = 0 \n\n\nfor len_sub in range(n, 0, -1):\n \n for i in range(n - len_sub + 1):\n substring = s[i:i+len_sub] \n if substring in last_seen: \n \n if last_seen[substring] < i:\n max_len = len_sub \n break \n else:\n last_seen[substring] = i \n if max_len > 0:\n break \n\nprint(max_len) \n \t\t \t \t\t \t\t \t\t \t\t \t", "st=input()\r\nm=0\r\nn=len(st)\r\nfor i in range(n):\r\n for j in range(i,n+1) :\r\n if st[i:j] in st[i+1:n] and len(st[i:j])>m:\r\n m=len(st[i:j])\r\nprint(m)", "s = input()\nans = 0\nn = len(s)\nfor i in range(n):\n for j in range(i+1,n):\n if s[i:j] not in s[i+1:]:\n break\n else:\n ans = max(ans,j-i)\nprint(ans) \n \n", "st = input()\nsubs = [st[i: j] for i in range(len(st))\n for j in range(i + 1, len(st) + 1)]\nlength = []\nfor i in subs:\n if subs.count(i) > 1:\n length.append(len(i))\nif len(length) == 0 :\n print(0)\nelse:\n print(max(length))\n\n \t \t \t\t \t\t\t \t \t \t", "s=input()\r\nlength=len(s)\r\nanswer=[ ]\r\nfor i in range (0,length):\r\n for j in range(i+1,length+1):\r\n k=s[i:j]\r\n co=0\r\n for u in range (0,length):\r\n if(s[u:].startswith(k)):\r\n co+=1\r\n if(co>=2):\r\n #answer=max(answer,len(k))\r\n answer.append(len(k))\r\nif(len(set(s))==length):\r\n print('0')\r\nelse:\r\n print(max(answer))\r\n\r\n", "#!/usr/bin/python3\n\n# kkikkkkiii\n\ns = input()\n\nmaxx = 0\n\na = [0] * len(s)\n\nfor j in range(len(s)):\n k = j\n i = j\n while i < len(s) - 1:\n i += 1\n if s[i] == s[k]:\n k += 1\n a[i] = k\n maxx = max(maxx, a[i] - j)\n continue\n i -= k - j\n k = j\n\n a = [0] * len(s)\n\nprint(maxx)\n", "s = input()\r\ncount = []\r\nfor i in range(len(s),0,-1):\r\n\tfor j in range(len(s)-i+1):\r\n\t\tif s[j:j+i] in s[j+1:]:\r\n\t\t\tcount.append(i)\r\nif len(count) == 0:\r\n print(0)\r\nelse:\r\n print(max(count))\r\n", "string = input().strip()\r\nmx = 0\r\n\r\nfor i in range(len(string)):\r\n for j in range(i+1, len(string)):\r\n m = 0\r\n while(j+m < len(string) and string[i+m] == string[j+m]):\r\n m += 1\r\n mx = max(mx, m)\r\n\r\nprint(mx)", "s = input()\r\nm = dict()\r\nfor i in range(len(s)):\r\n for j in range(len(s)):\r\n t = s[i:j+1];\r\n if t in m:\r\n m[t] += 1\r\n else:\r\n m[t] = 1\r\nmx = 0\r\nfor k, v in m.items():\r\n if v >= 2:\r\n mx = max(mx, len(k))\r\nprint(mx)", "s = input()\r\nn = len(s)\r\nfor k in range(n - 1, 0, -1):\r\n if len({s[i:i + k] for i in range(n - k + 1)}) < n - k + 1:\r\n print(k)\r\n exit()\r\nprint(0)", "from collections import Counter\r\n\r\nS=input()\r\nC=Counter()\r\n\r\nfor i in range(len(S)):\r\n for j in range(i+1,len(S)+1):\r\n C[S[i:j]]+=1\r\n \r\nANS=0\r\nfor x in C:\r\n if C[x]>=2:\r\n ANS=max(ANS,len(x))\r\n\r\nprint(ANS)\r\n", "str=input()\n\nx=0\ny=0\n\nfor i in range(len(str)):\n for j in range(i+1,len(str)+1):\n count=0\n temp=-1\n while True:\n l=str.find(str[i:j],temp+1)\n temp=l\n \n if temp==-1:\n break\n else:\n count+=1\n if count>1 and abs(i-j)>abs(x-y):\n x=i\n y=j\n\nif abs(x-y)>0:\n print(abs(x-y))\nelse:\n print(0)\n\t \t\t \t \t \t\t \t\t\t\t\t", "s = input()\nn = len(s)\nr = 0\nwhile 1:\n\tif len({s[i - r : i + 1] for i in range(r, n)}) < n - r:\n\t\tr += 1\n\telse:\n\t\tbreak\nprint (r)\n \t\t \t\t \t\t \t \t\t\t\t\t\t \t\t \t" ]

[ "from sys import stdin #Bibliotecas para optimizar la entrada/salida\r\nfrom sys import stdout\r\n\r\nMOD = 1000000007 #Modulo\r\nMAXA = 1000007 #Maximo valor posible en A\r\nMAXN = 200007 #Suma de maximos valores posibles de n y q\r\n\r\np = [0 for i in range(MAXA)] #Para cada i me guarda 0 si i es primo o 1 en otro caso\r\nphi = [i for i in range(MAXA)] #Para cada i conserva phi(i)\r\ncant = [0 for _ in range(MAXA)] #Guarda por cada indice j la cantidad de valores en A_i que son multiplos de j\r\ncombin = [0 for _ in range(MAXA)] #Guarda por cada indice j combinatoria de cant[j] en k\r\n\r\n#Computamos la funcion phi para cada numero\r\ndef ComputePhi():\r\n p[1] = p[0] = 1\r\n for i in range(1,MAXA): #Pasamos por cada numero\r\n for j in range(i,MAXA,i): #y por cada uno de sus multiplos\r\n if p[i] == 0: #Si el numero es primo damos un paso en la computacion de phi de su multiplo\r\n if i != j: \r\n p[j] = 1 #Su multiplo no sera primo\r\n phi[j] = (phi[j]//i)*(i-1)\r\n if dt.get(j) != None: #Si este multiplo esta en A_q\r\n div[dt[j]].append(i) #Guardo i como uno de sus divisores (al final va a tener todos sus divisores)\r\n\r\ndef qp(a,p): #Exponenciacion binaria O(log p)\r\n a = int(a)\r\n p = int(p)\r\n if p == 0:\r\n return 1\r\n x = qp(a,p//2)\r\n x = (x*x)%MOD\r\n if p%2 == 1:\r\n x = (x*a)%MOD\r\n return x\r\n\r\ndef inv(a): #inverso multiplicativo, ya que el modulo es primo usamos el pequeño teorema de fermat para hallarlo\r\n return qp(a,MOD-2)\r\n\r\ninputs = list(map(int,stdin.readline().split())) #lee la entrada\r\nn,k,q= inputs[0],inputs[1],inputs[2] \r\n\r\nfact = [0 for i in range(MAXN)] #Lista que va a mantener para cada valor entre 0 y MAXN el factorial de ese numero (modulado)\r\nifact = [0 for i in range(MAXN)] #Lista que va a mantener para cada valor entre 0 y MAXN el inverso multiplicativo del factorial de ese numero.\r\n\r\n#Coeficientes binomiales:\r\ndef comb(a,b): \r\n if a-b < 0:\r\n return 0\r\n return ((fact[a]*ifact[b])%MOD*ifact[a-b])%MOD\r\n\r\n#Computamos el factorial recursivamente:\r\nfact[0] = 1\r\nfor i in range(1,MAXN):\r\n fact[i] = (fact[i-1]*i)%MOD\r\n\r\n#Computamos el inverso multiplicativo del factorial recursivamente teniendo en cuenta que (k!)^(-1) = ((k+1)!^(-1))*k+1\r\nifact[MAXN-1] = inv(fact[MAXN-1])\r\nfor i in range(MAXN-2,-1,-1):\r\n ifact[i] = (ifact[i+1]*(i+1))%MOD\r\n\r\ndt = {} #Diccionario que mapea cada numero en A_q diferente a una posicion diferente en el array div\r\nln = [] #Lista que guarda $A$\r\nc = 0\r\nfor j in range(n):\r\n a = int(stdin.readline())\r\n if dt.get(a) == None:\r\n c+=1\r\n dt[a] = c\r\n ln.append(a)\r\nlq = [] #Lista que guarda todos los w_i\r\nfor _ in range(q):\r\n a = int(stdin.readline())\r\n if dt.get(a) == None:\r\n c+=1\r\n dt[a] = c\r\n lq.append(a)\r\n\r\n#El mismo guardara los divisores de cada numero en A_q\r\ndiv = [[] for _ in range(c+1)] #Crear el array div con tantas posiciones como numeros diferentes en A_q\r\nComputePhi()\r\n\r\nfor a in ln:\r\n for i in div[dt[a]]:\r\n cant[i]+=1 #por cada divisor x de a suma 1 en la posicion x\r\nans = 0\r\nfor i in range(1,MAXA): #Calcula la respuesta para A (ver informe)\r\n combin[i] = comb(cant[i],k)\r\n ans += (phi[i]*combin[i])%MOD\r\n ans%=MOD\r\n\r\nfor a in lq: #por cada w_i calcula la respuesta para A_i...\r\n for i in div[dt[a]]: #Pasando por cada divisor de w_i\r\n ans -= (combin[i]*phi[i])%MOD\r\n ans%=MOD\r\n if ans < 0:\r\n ans+=MOD\r\n cant[i]+=1 #Mantenemos por limpieza actualizado los valores de cant\r\n combin[i] = comb(cant[i],k) #y de combin\r\n ans += (combin[i]*phi[i])%MOD\r\n ans%=MOD\r\n print(ans)" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nfrom collections import Counter\r\n\r\nmod = 10**9 + 7\r\n\r\ndef fpow(a, p):\r\n if p == 0:\r\n return 1\r\n t = fpow(a, p // 2)\r\n res = t * t % mod\r\n if p & 1:\r\n res = res * a % mod\r\n return res\r\n\r\n\r\nm = int(input())\r\ncnt = Counter(map(int, input().split()))\r\ncnt = sorted(cnt.items())\r\n\r\npf = []\r\nfor v, c in cnt:\r\n x = pf[-1] if pf else 1\r\n x *= c + 1\r\n x %= mod - 1\r\n pf.append(x)\r\n\r\nsf = []\r\nfor v, c in cnt[::-1]:\r\n x = sf[-1] if sf else 1\r\n x *= c + 1\r\n x %= mod - 1\r\n sf.append(x)\r\nsf = sf[::-1]\r\n\r\nss = [0]\r\nfor i in range(1, 200001):\r\n ss.append((ss[-1] + i) % (mod - 1))\r\n\r\nres = 1\r\nfor i, (v, c) in enumerate(cnt):\r\n tot = ss[c]\r\n tot *= pf[i - 1] if i else 1\r\n tot *= sf[i + 1] if i < len(cnt) - 1 else 1\r\n tot %= mod - 1\r\n res *= fpow(v, tot)\r\n res %= mod\r\n\r\nprint(res)\r\n", "from collections import *\r\ninput()\r\nd = 1000000007\r\nc = Counter(map(int, input().split()))\r\ns = n = 1\r\nfor k in c.values(): n *= k + 1\r\nfor p, k in c.items(): s = (s * pow(p, n * k // 2 % (d - 1), d)) % d\r\nprint(s)", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import Counter\r\nm=int(input())\r\np=list(map(int,input().split()))\r\nmod=10**9+7\r\ncnt=Counter(p)\r\nans=x=1\r\nfor k in cnt.values():\r\n x*=k+1\r\nfor a,b in cnt.items():\r\n q=(x*b//2)%(mod-1)\r\n ans=(ans*pow(a,q,mod))%mod\r\nprint(ans)", "mod=10**9+7\r\n\r\ndef pow(a,b): #Algoritmo de Exponenciacion binaria modular\r\n exp=1 # Caso base a^1=a\r\n x=a % mod \r\n b=b%(mod-1) # para a^b % p hacemos a^{b%(p-1)} %p\r\n while b > 0: \r\n if b % 2 == 1:# En caso que b sea impar a^b=a*a^b-1\r\n exp=(exp*x)%mod # cada operacion de mult la hacemos modulo mod pues lo numeros pueden ser bastante grandes \r\n x=(x*x)%mod # En caso que b sea par a^b=(a^b/2)^2 \r\n b=b//2 # al hacerlo de forma iterativa y con parte entera de b/2 es este caso este caso es el caso par pues el caso impar habria sido visto en el if primero y ahora\r\n return exp%mod \r\n\r\nm=input() # el numeros de primos en la factorizacion de n\r\nprimes=map(int,input().split())# se captura la entrada del problema con map \r\nprimesDicc=dict() # inicializo un diccionario para guardar la descomposicion en primos de la forma <pi,e1>donde e1 es el exponente con que aparece pi en la descomposicion\r\nn=1;\r\nfor p in primes: # Recorro cada primo generado de la entrada \r\n n=(n*p)%mod # calculo n a traves de la multiplicacion de sus factores primos\r\n if p not in primesDicc: # en caso que sea la primera aparicion de ese primo pi agrego la llave pi a mi diccionario con valor 1 \r\n primesDicc[p]=1\r\n else:\r\n primesDicc[p]+=1 # en caso que ya ese primo haya aparecido en el recorrido de la descomposicion es porque al menos aparece mas de una vez por lo que actualizo el exponente +1\r\n\r\ncountdiv =1 # variable que va a guardar la cantidad de divisores de n\r\nraiz=1 # variable que va a guardar en caso que n sea un cuadrado perfecto\r\nfor p in primesDicc: #Hago un recorrido por todos las llaves de mi diccionario para generar el numero de divisores\r\n countdiv *= primesDicc[p]+1 # el numero de divisores de n es igual a (e1+1)*(e2+1)*...(ek+1) por lo que en cada iteracion primesDicc[p] me da un e_i y actualiza *(e_i+1)\r\nresult=0 # variable que va guardar la solucion del problema\r\nif countdiv % 2 == 0: # En caso que la cantidad de divisores sea par \r\n result=pow(n,countdiv//2) # la respuesta es n^{cantidad de divisores/2}\r\nelse: # En caso que la cantidad de divisores sea impar\r\n for p in primesDicc: # Dado que la raiz de n si es entera = al producto de la descomposicion en primos de n con exponente/2 para cada factor \r\n raiz=(raiz*pow(p,primesDicc[p]//2)) # la raiz se calcula como p1^e1/2*p2^e2/2*...*pk^ek/2 \r\n result=(raiz*pow(n,countdiv//2))%mod # en caso de ser impar la cantidad de divisores de n la respuesta es sqrt(n)*n^{|_d(x)/2_|}\r\n\r\nprint(result) # Se imprime en pantalla la solucion", "mbase = 10**9+7\r\nnof = int(input())\r\nfacts = [int(x) for x in input().split()]\r\n\r\npmap = {}\r\nfor p in facts:\r\n\tpmap[p] = pmap.get(p, 0) + 1\r\n\t\r\nonepprod = 1\r\nfor (p, q) in pmap.items():\r\n\tonepprod*= q+1\r\n\tonepprod%= 2*(mbase-1)\r\n\r\nres = 1\r\nfor (p, q) in pmap.items():\r\n\tres*= pow(p, (q*onepprod)//2, mbase)\r\n\tres%= mbase\r\n\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nmod = 10**9 + 7\r\n\r\ndef fpow(a, p):\r\n if p == 0:\r\n return 1\r\n t = fpow(a, p // 2)\r\n res = t * t % mod\r\n if p & 1:\r\n res = res * a % mod\r\n return res\r\n\r\n\r\nm = int(input())\r\np = sorted(list(map(int, input().split())))\r\ns = list(set(p))\r\ncnt = [0] * 200001\r\n\r\nfor x in p:\r\n cnt[x] += 1\r\n\r\npf = []\r\nfor x in s:\r\n if pf:\r\n pf.append(pf[-1] * (cnt[x] + 1) % (mod - 1))\r\n else:\r\n pf.append(cnt[x] + 1)\r\n\r\nsf = []\r\nfor x in s[::-1]:\r\n if sf:\r\n sf.append(sf[-1] * (cnt[x] + 1) % (mod - 1))\r\n else:\r\n sf.append(cnt[x] + 1)\r\n\r\nsf = sf[::-1]\r\n\r\nss = []\r\nfor i in range(200001):\r\n if ss:\r\n ss.append((ss[-1] + i) % (mod - 1))\r\n else:\r\n ss.append(i % (mod - 1))\r\n\r\nres = 1\r\nfor i, x in enumerate(s):\r\n r = ss[cnt[x]]\r\n if i > 0:\r\n r *= pf[i - 1] \r\n if i < len(s) - 1:\r\n r *= sf[i + 1]\r\n r %= (mod - 1)\r\n res *= fpow(x, r)\r\n res %= mod\r\n\r\nprint(res)\r\n", "from collections import Counter #importamos la libreria Counter para contar los elementos repetidos en el array de factores primos\r\n\r\nm = input() #leemos la cantidad de fatores primos que se nos va a pasar\r\nvalues = Counter(map(int, input().split())) #leemos y a la vez contamos todos los factores primos repetidos\r\n #values seria como un diccionario donde las llaves seria los factores y los valores la cantidad de veces que se repite cada factor\r\nM = 1000000007\r\n\r\nd = 1 #representa nuestra funcion d(n) la cual contiene va a se la cantidad divisores que va a tener n\r\nn = 1 #entero n\r\n\r\nfor x in values.values(): #recorremos todas las repeticiones de cada valor para hallar el valor de la funcion d(n)\r\n d *= x + 1\r\n\r\nif d % 2: #verificamos si n es un cuadrado perfecto\r\n for x, y in values.items(): #recorremos nuestro counter para hallar el valor de n\r\n #en este caso como n es un cuadrado perfecto n va ser la raiz cuadrada de la multiplicacion de todos los factores\r\n n = (n * pow(x, y//2, M)) % M\r\n print(pow(n, d, M)) #se imprime el valor de de la funcion f(n) modulo M\r\nelse:\r\n for x, y in values.items(): #recorremos nuestro counter para hallar el valor de n\r\n #en este caso como n no es un cuadrado perfecto n va set la multiplicacion de todos los factores\r\n n = (n * pow(x, y, M)) % M\r\n print(pow(n, d//2, M)) #se imprime el valor de la funcion f(n) modulo M\r\n\r\n", "import sys\r\n\r\nN, mod = 2 * 10 ** 5 + 1, 10 ** 9 + 7\r\nadd = lambda a, b: (a + b) % mod\r\nmult = lambda a, b: (a * b) % mod\r\nsum_n = lambda n: (n * (n + 1)) // 2\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n\r\nn, primes, ans, num = int(input()), [0] * N, 1, 1\r\nfor i in [int(x) for x in input().split()]:\r\n primes[i] += 1\r\n\r\nfor p in range(2, N):\r\n if primes[p]:\r\n nprod = pow(ans, primes[p], mod)\r\n ans = mult(mult(ans, nprod), pow(p, (num * sum_n(primes[p])) % (mod - 1), mod))\r\n num = (num * (primes[p] + 1)) % (mod - 1)\r\nprint(ans)\r\n", "import sys\r\n\r\nM = int(input())\r\nP0 = list(map(int, input().split()))\r\nP0 = sorted(P0)\r\nP = []\r\nQ = []\r\ntemp = 0\r\nfor i in range(M):\r\n if(temp != P0[i]):\r\n temp = P0[i]\r\n P.append(temp)\r\n Q.append(1)\r\n else:\r\n Q[len(Q)-1] += 1\r\nmod = 10**9 + 7\r\nM = len(Q)\r\n\r\nT = [1] * M\r\nT1 = [1] * (M + 1)\r\nT2 = [1] * (M + 1)\r\nfor i in range(M):\r\n T[i] = ((Q[i] * (Q[i] + 1)) // 2) % (mod - 1)\r\n T1[i+1] = (T1[i] * (Q[i] + 1)) % (mod - 1)\r\n T2[M - i - 1] = (T2[M - i] * (Q[M - i - 1] + 1)) % (mod - 1)\r\nans = 1\r\nfor i in range(M):\r\n temp = pow(P[i], T[i], mod)\r\n t = (T1[i] * T2[i + 1]) % (mod - 1)\r\n a = pow(temp, t, mod)\r\n ans = (ans * a) % mod\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfrom collections import Counter\r\n\r\nmod = 10**9 + 7\r\n\r\nm = int(input())\r\ncnt = Counter(map(int, input().split()))\r\n\r\nnd = 1\r\nfor v, c in cnt.items():\r\n nd *= (c + 1)\r\n\r\nres = 1\r\nfor v, c in cnt.items():\r\n tot = (nd * c // 2) % (mod - 1)\r\n res = res * pow(v, tot, mod) % mod\r\n\r\nprint(res)\r\n", "MOD = 10 ** 9 + 7\r\nans = 1\r\ntau = 1\r\nN = 200005\r\ncnt = [0] * N\r\n \r\nn = int(input())\r\nfor x in input().split() :\r\n\tcnt[int(x)] += 1\r\n \r\nfor i in range(1, N) :\r\n\tif cnt[i] == 0 : continue\r\n\ttmp = pow (i, cnt[i] * (cnt[i] + 1) // 2 % (MOD - 1), MOD)\r\n\tans = pow (ans, cnt[i] + 1, MOD) * pow (tmp, tau, MOD) % MOD\r\n\ttau = tau * (cnt[i] + 1) % (MOD - 1)\r\n \r\nprint (ans)", "import sys\r\n\r\n#Library Info(ACL for Python/Pypy) -> https://github.com/not522/ac-library-python\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\nDXY = [(0, -1), (1,0), (0, 1), (-1,0)] #L,D,R,Uの順番\r\n\r\nmod = int(1e9 + 7)\r\nfrom collections import defaultdict\r\n\r\ndef main():\r\n n = int(input()) \r\n d = defaultdict(int) \r\n a = list(map(int,input().split()))\r\n for v in a:d[v] += 1\r\n\r\n group_product = 1\r\n group_size = 1 # modulo mod - 1\r\n \r\n\r\n for p,ord in d.items():\r\n group_product = pow(group_product,ord + 1,mod)\r\n group_product *= pow(p,ord * (ord + 1) // 2 * group_size,mod)\r\n group_product %= mod\r\n group_size *= (ord + 1) \r\n group_size %= (mod - 1)\r\n\r\n print(group_product % mod)\r\n return 0\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n, m, k, A):\r\n if k==0:\r\n sys.stdout.write(f'{m*(m-1)//2}\\n')\r\n for smaller in range(1, m+1):\r\n for larger in range(smaller+1, m+1):\r\n sys.stdout.write(f'{smaller} {larger}\\n')\r\n return\r\n else:\r\n sys.stdout.write(f'{m*(m-1)//2}\\n')\r\n for larger in range(1, m+1):\r\n for smaller in range(larger+1, m+1):\r\n sys.stdout.write(f'{smaller} {larger}\\n')\r\n return\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\nA = []\r\nfor i in range(n):\r\n row = [int(x) for x in input().split()]\r\n A.append(row)\r\nprocess(n, m, k, A)", "n, m, k = map(int, input().split())\r\nprint(m * (m - 1) // 2)\r\nfor i in range(1, m):\r\n for j in range(i + 1, m + 1):\r\n if k == 0:\r\n print (i,j)\r\n else:\r\n print(j,i)\n# Mon Jul 04 2022 09:29:45 GMT+0000 (Coordinated Universal Time)\n", "n, m, k = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nprint(m * (m - 1) // 2)\r\nfor i in range(1, m):\r\n for j in range(i + 1, m + 1):\r\n if k == 0:\r\n print(i, j)\r\n else:\r\n print(j, i)\n# Mon Jul 04 2022 09:33:42 GMT+0000 (Coordinated Universal Time)\n", "from collections import *\r\nfrom math import *\r\n\r\nn,m,k = map(int,input().split())\r\na = []\r\nif(k == 0):\r\n\tfor i in range(m):\r\n\t\tfor j in range(i+1,m):\r\n\t\t\ta.append([i+1,j+1])\r\nelse:\r\n\tfor i in range(m-1,-1,-1):\r\n\t\tfor j in range(i-1,-1,-1):\r\n\t\t\ta.append([i+1,j+1])\r\nprint(len(a))\r\nfor i in a:\r\n\tprint(*i)\r\n", "from bisect import *\r\nfrom collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nimport random\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nmaxint=10**21\r\ndef ceil(a, b):\r\n if(b==0):\r\n return maxint\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n\r\n# n,m=map(int,input().split())\r\n# arr=list(map(int, input().split()))\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n\r\n\r\ndef main():\r\n n,m,t=map(int,input().split())\r\n arr=[0]*n\r\n for i in range(n):\r\n arr[i]=list(map(int, input().split()))\r\n print((m*(m-1))//2)\r\n for i in range(m):\r\n for j in range(i+1,m):\r\n if(t==0):\r\n print(i+1,j+1)\r\n else:\r\n print(j+1,i+1)\r\n \r\nmain()", "def main():\r\n n, m, k = [int(i) for i in input().split()]\r\n p = (m - 1) * m // 2\r\n print(p)\r\n if k == 0:\r\n for i in range(m - 1):\r\n for j in range(i + 1, m):\r\n print(i + 1, j + 1)\r\n else:\r\n for i in range(m - 1, 0, -1):\r\n for j in range(i - 1, -1, -1):\r\n print(i + 1, j + 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m, k = map(int, input().split())\r\nprint(m * (m - 1) // 2)\r\nfor i in range(m - 1):\r\n for j in range(1, m - i): print('{} {}'.format(*((j + 1, j)) if k else (j, j + 1)))", "n,m,k = map(int, input().split())\nprint (m*(m-1)//2)\nfor i in range(m):\n\tfor j in range(i+1, m):\n\t\tprint (j+1, i+1) if k else print (i+1, j+1)\n\n\n\t \t \t\t \t \t \t \t \t \t\t \t", "def s(n,m,k):\r\n\tprint(m*(m-1)//2)\r\n\tfor i in range(1,m):\r\n\t\tfor j in range(i+1,m+1):\r\n\t\t\tif k:\r\n\t\t\t\tprint(j,i)\r\n\t\t\telse:\r\n\t\t\t\tprint(i,j)\r\ns(*map(int,input().split()))", "n, m, k = map(int, input().split())\r\nX = []\r\nfor i in range(n):\r\n temp = list(map(int, input().split()))\r\n X.append(temp)\r\n\r\nprint(m*(m-1)//2)\r\nfor i in range(1, m):\r\n for j in range(i+1, m+1):\r\n if k == 0:\r\n print(i, j)\r\n else:\r\n print(j, i)\r\n", "n, m, k = map(int, input().split())\r\nif m == 1:\r\n print(0)\r\nelse:\r\n q = (m - 1) * m // 2\r\n print(q)\r\n if k == 0:\r\n for i in range(1, m+1):\r\n for j in range(i+1, m+1):\r\n print(i, j)\r\n else:\r\n for i in range(1, m+1):\r\n for j in range(i+1, m+1):\r\n print(j, i)", "n,m,k = map(int, input().split())\r\nprint(m*(m-1)//2)\r\nfor i in range(m):\r\n for j in range(i+1, m):\r\n if k:\r\n print (j+1, i+1)\r\n else:\r\n print (i+1, j+1)", "# ls.sort(key=lambda x: (x[0], x[1]))\r\nimport sys\r\n\r\ninf = float(\"inf\")\r\nmod = 1000000007\r\n\r\n\r\ndef array(): return list(map(int, sys.stdin.readline().split()))\r\ndef intt(): return map(int, sys.stdin.readline().split())\r\nfrom bisect import bisect_left\r\nimport sys\r\n#n, k = map(int, sys.stdin.readline().split())\r\n#arr = list(map(int, sys.stdin.readline().split()))\r\n#arr=[(int(x),i) for i,x in enumerate(input().split())]\r\n# ls=list(map(int,input().split()))\r\n# for i in range(m):\r\n#print(s[i],end=\"\")\r\n#n=int(sys.stdin.readline())\r\nn,m,k=map(int, sys.stdin.readline().split())\r\nls=[]\r\nfor i in range(n):\r\n arr = list(map(int, sys.stdin.readline().split()))\r\n ls.append(arr)\r\nprint(m*(m-1)//2)\r\nfor i in range(1,m):\r\n for j in range(i+1,m+1):\r\n if k==0:\r\n print(i, j)\r\n else:\r\n print(j, i)\r\n", "n,m,k=map(int,input().split())\r\nprint((m*(m-1))//2)\r\nfor i in range(1,m):\r\n for j in range(i+1,m+1):\r\n if k:\r\n print(j,i)\r\n else:\r\n print(i,j) \r\n", "n, m, k = [int(i) for i in input().split()]\r\np = (m - 1) * m // 2\r\nprint(p)\r\nif k == 0:\r\n for i in range(m - 1):\r\n for j in range(i + 1, m):\r\n print(i + 1, j + 1)\r\nelse:\r\n for i in range(m - 1, 0, -1):\r\n for j in range(i - 1, -1, -1):\r\n print(i + 1, j + 1)# 1698348805.8155658", "from sys import stdin, setrecursionlimit, stdout\nfrom itertools import permutations\n#setrecursionlimit(1000000) #use \"python\" instead of \"pypy\" to avoid MLE\nfrom io import BytesIO\nimport os\nfrom functools import cmp_to_key\nfrom collections import deque, Counter, defaultdict, OrderedDict\nfrom math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\nfrom heapq import heapify, heappop, heappush, heapreplace, heappushpop\n#\tto use maxheap, invert all the number.. that means, multyply with -1\nfrom bisect import bisect_right, bisect_left\n#\tnumber of elements in a range is bisect_right(a, el)-bisect_left(a, el)\nfrom string import ascii_letters, ascii_lowercase, ascii_uppercase, digits, hexdigits, whitespace, punctuation\n\n\ndef ii(): return int(input().decode()) if not DEBUG else int(input())\n\n\ndef fi(): return float(input().decode()) if not DEBUG else float(input())\n\n\ndef mi(): return map(int, input().decode().split()) if not DEBUG else map(int, input().split())\n\n\ndef fmi(): return map(float, input().decode().split()) if not DEBUG else map(float, input().split())\n\n\ndef li(): return list(mi())\n\n\ndef si(): return input().decode().rstrip() if not DEBUG else input().rstrip()\n\n\ndef msi(): return map(str, input().decode().split()) if not DEBUG else map(str, input().split())\n\n\ndef lsi(): return list(si())\n\n\n#######################################################################################\n########################### M Y F U N C T I O N S ###########################\n#######################################################################################\n\n\n\n\n\n\n#######################################################################################\n########################### M A I N P R O G R A M ###########################\n#######################################################################################\n\ndef main():\n\tn, m, t=mi()\n\tfor _ in range(n):\n\t\tli()\n\tres=[]\n\tfor i in range(1, m+1):\n\t\tfor j in range(i+1, m+1):\n\t\t\tres.append([i, j])\n\tprint(len(res))\n\tif not t:\n\t\tfor i in res:\n\t\t\tprint(*i)\n\telse:\n\t\tfor i in res:\n\t\t\tprint(i[1], i[0])\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n#######################################################################################\n########################### S T A R T E R P A C K ###########################\n#######################################################################################\n\nif __name__ == \"__main__\":\n\tDEBUG = os.environ.get(\"__DEBUG__\")\n\n\tif DEBUG:\n\t\tif os.stat(\"input.txt\").st_size == 0:\n\t\t\tinput = stdin.readline\n\t\telse:\n\t\t\tinput = open('input.txt', 'r').readline\n\telse:\n\t\tinput = BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\n\tvow = {'A', 'E', 'I', 'O', 'U'}\n\tmod = 1000000007\n\n\tmod1 = 100000110709\n\tmod2 = 100000110719\n\tres = ['NO', 'YES']\n\tadj4 = [[-1, 0], [0, -1], [0, 1], [1, 0]]\n\tadj8 = [[-1, -1], [-1, 0], [-1, 1], [0, -1], [0, 1], [1, -1], [1, 0], [1, 1]]\n\n\ttest, test_case = 0, 1\n\t#test_case = int(input())\n\n\twhile test < test_case:\n\t\ttest += 1\n\t\tif DEBUG:\n\t\t\tprint('>>>>>>>>>>>>> Case #{} >>>>>>>>>>>>>'.format(test))\n\t\t\tpass\n\t\t#print('Case ', test, ': ', sep='', end='')\n\t\tmain()\n \t\t \t\t \t\t \t\t \t \t\t \t \t \t", "def Sol(n, m, k):\n pairs = list()\n if k == 0:\n for i in range(m - 1):\n for k in range(m - 1, i, -1):\n pairs.append((k - 1, k))\n else:\n for i in range(m - 2, -1, -1):\n for k in range(i + 1):\n pairs.append((k + 1, k))\n\n return pairs\n\n\nn, m, k = map(int, input().split())\nA = list()\nfor i in range(n):\n a = list(map(int, input().strip().split()))\n A.append(a)\n\npairs = Sol(n, m, k)\nprint(len(pairs))\nfor a, b in pairs:\n print(f\"{a + 1} {b + 1}\")", "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\nprint(m*(m-1)//2)\r\nif k == 0:\r\n for i in range(m):\r\n for j in range(i+1, m):\r\n print(i+1, j+1)\r\nelse:\r\n for i in range(m):\r\n for j in range(i+1, m):\r\n print(j+1, i+1)\r\n", "from collections import *\nimport sys \ninput=sys.stdin.readline\n\n# \"\". join(strings) \n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \nn, m, k = rl()\nAA = []\nfor _ in range(n):\n\n\tAA.append(rl())\nprint((m * (m- 1))//2)\nif k == 0:\n\tfor i in range(1, m + 1):\n\t\tfor j in range(i + 1, m + 1):\n\t\t\tprint(i, j)\nelse:\n\tfor i in range(1, m + 1):\n\t\tfor j in range(i + 1, m + 1):\n\t\t\tprint(j, i)\n\n\n", "n, m, k = map(int, input().split())\r\nprint(str(m * (m - 1) // 2))\r\nfor i in range(1, m):\r\n for j in range(i + 1, m + 1):\r\n if k == 0:\r\n print (str(i) + \" \" + str(j))\r\n else:\r\n print(str(j) + \" \" + str(i))", "n,m,k = map(int,input().split())\r\nprint(str(m*(m-1)//2))\r\nfor i in range(m):\r\n for j in range(m-i-1):\r\n if k == 0:\r\n print(str(i+1)+' '+str(i+j+2))\r\n else:\r\n print(str(i+j+2)+' '+str(i+1))", "_, m, k = map(int, input().split())\r\nprint(m * (m-1) // 2)\r\nfor i in range(m):\r\n for j in range(i+1, m):\r\n print(j+1, i+1) if k else print(i+1, j+1)\r\n", "#in the name of god\r\n#Mr_Rubick\r\nn,m,k=map(int,input().split())\r\nprint(str(m*(m-1)//2))\r\nfor i in range(1,m):\r\n for j in range(i+1,m+1):\r\n if k==0:\r\n print(str(i)+\" \"+str(j))\r\n else:\r\n print(str(j)+\" \"+str(i))", "n,m,k = map(int,input().split())\r\nfor i in range(n):\r\n li = list(map(int,input().split()))\r\nans=[]\r\nfor i in range(1,m+1):\r\n for j in range(i+1,m+1):\r\n ans.append([i,j])\r\nif k==0:\r\n print(len(ans))\r\n for i in ans:\r\n print(*i)\r\nelse:\r\n print(len(ans))\r\n for i in ans[::-1]:\r\n print(*i[::-1])\r\n\r\n\r\n", "from sys import stdin,stdout\r\nimport math \r\nfrom collections import Counter,deque\r\nL=lambda:list(map(int, stdin.readline().strip().split()))\r\nM=lambda:map(int, stdin.readline().strip().split())\r\nI=lambda:int(stdin.readline().strip())\r\nIN=lambda:stdin.readline().strip()\r\nC=lambda:stdin.readline().strip().split()\r\nmod=1000000007\r\n#Keymax = max(Tv, key=Tv.get)\r\ndef s(a):print(\" \".join(list(map(str,a))))\r\n#______________________-------------------------------_____________________#\r\n#I_am_pavan\r\ndef solve():\r\n n,m,k=M()\r\n print(m*(m-1)//2)\r\n for i in range(1,m+1):\r\n for j in range(i+1,m+1):\r\n if k:\r\n print(j,i)\r\n else:print(i,j)\r\nfor i in range(1):\r\n solve()\r\n", "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\nfrom sys import stdin\r\nfrom itertools import *\r\n\r\nn, m, k = arr_inp(1)\r\narr, ans = [arr_inp(1) for i in range(n)], list(combinations(range(1, m + 1), 2))\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n if k:\r\n print(ans[i][1], ans[i][0])\r\n else:\r\n print(ans[i][0], ans[i][1])\r\n", "def main():\n n, m, k = map(int, input().split())\n print(m * (m - 1) // 2)\n for i in range(1, m):\n for j in range(i + 1, m + 1):\n print(j, i) if k else print(i, j)\n\n\nif __name__ == '__main__':\n main()\n", "n,m,k = map(int,input().split())\r\nfor i in range(n):\r\n a = [int(x) for x in input().split()]\r\nd = []\r\nfor i in range(1,m):\r\n\tfor j in range(i+1,m+1):\r\n\t\tif k == 0:\r\n\t\t\td.append((i,j))\r\n\t\telse:\r\n\t\t\td.append((j,i))\r\nprint(len(d))\r\nfor i in d:\r\n\tprint(*i)" ]

[ "n = int(input())\r\n\r\nroad = [map(int,input().split()) for i in range(n)]\r\n\r\ngraf = [[] for i in range(n + 1)]\r\n\r\ns = 0\r\nfor a,b,c in road:\r\n\tgraf[a].append((b,0))\r\n\tgraf[b].append((a,c))\r\n\ts += c\r\n\r\nvis = [0] * (n + 1)\r\n\r\ndef dfs(u,p):\r\n\td = 0\r\n\tfor v,c in graf[u]:\r\n\t\tif v != p and vis[v] == 0:\r\n\t\t\tvis[v] = 1\r\n\t\t\td += dfs(v,u) + c\r\n\treturn d\r\n\t\t\t\r\nd = dfs(1,-1)\r\n\r\nprint(min(d,s - d))", "source=set()\r\ndest=set()\r\nc1=0\r\nc2=0\r\nfor i in range(int(input())):\r\n s,d,w=map(int,input().split())\r\n if s in source or d in dest:\r\n c1=c1+w\r\n s,d=d,s\r\n else:\r\n c2=c2+w\r\n source.add(s)\r\n dest.add(d)\r\nprint(min(c1,c2))", "n = int(input())\r\narr = [[0 for j in range(n+1)] for i in range(n+1)]\r\ntot = 0\r\nfor i in range(n):\r\n start, end, price = map(int, input().split())\r\n arr[start][end] = price\r\n tot += price\r\ncost1 = 0\r\nstart = 1\r\n\r\n\r\ndef find(a):\r\n for j in range(1, n+1):\r\n if arr[j][a] != 0:\r\n return j\r\n\r\n\r\nwhile True:\r\n for i in range(1, n+1):\r\n if arr[start][i] > 0:\r\n arr[start][i] = 0\r\n start = i\r\n break\r\n if i == n:\r\n temp = find(start)\r\n cost1 += arr[temp][start]\r\n arr[temp][start] = 0\r\n start = temp\r\n if start == 1:\r\n break\r\nprint(min(cost1, (tot - cost1)))\r\n", "n=int(input())\r\nmas=[]\r\nfor i in range(n):\r\n\ts=input().split()\r\n\ts[0]=int(s[0])\r\n\ts[1]=int(s[1])\r\n\ts[2]=int(s[2])\r\n\tmas.append(s)\r\n\r\nS=mas[0][1]\r\n\r\nindex=0\r\nA=mas[0][2]\r\nB=0\r\n\r\nfor i in range(n-1):\r\n\tfor y in range(n):\r\n\t\tif mas[y][0]==S and y!=index:\r\n\t\t\tS=mas[y][1]\r\n\t\t\tindex=y\r\n\t\t\tA=A+mas[y][2]\r\n\t\t\t#print(mas[y][2],\"T\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\t\tfor XX in range(n):\r\n\t\t\t\tif mas[XX][1]==S and XX!=index:\r\n\t\t\t\t\tB=B+mas[XX][2]\r\n\t\t\t\t\tS=mas[XX][0]\r\n\t\t\t\t\tindex=XX\r\n\t\t\t\t\t#print(mas[XX][2],\"R\")\r\n\t\t\t\t\tbreak\r\n\r\nif A<B:\r\n\tprint(A)\r\nelse:\r\n\tprint(B)", "amount = int(input())\r\narray = [[] for i in range(amount)]\r\nused = [0] * amount\r\ncs = []\r\nfor i in range(amount):\r\n a,b,c = [int(s) for s in input().split()]\r\n a -= 1\r\n b -= 1\r\n if not b in array[a]:\r\n array[a].append(b)\r\n if not a in array[b]:\r\n array[b].append(a)\r\n cs.append((a,b,c))\r\npath = [0]\r\nused[0] = 1 \r\ncurr = path[-1]\r\n#print(array)\r\nwhile len(path) != amount:\r\n for i in range(len(array[curr])):\r\n if not used[array[curr][i]]:\r\n path.append(array[curr][i])\r\n used[array[curr][i]] = 1\r\n curr = path[-1]\r\n break\r\ncounter_1 = 0\r\ncounter_2 = 0\r\nfor i in range(len(path) - 1):\r\n for j in range(len(cs)):\r\n if path[i] == cs[j][1] and path[i + 1] == cs[j][0]:\r\n counter_1 += cs[j][2]\r\nfor j in range(len(cs)):\r\n if path[-1] == cs[j][1] and path[0] == cs[j][0]:\r\n counter_1 += cs[j][2]\r\npath = path[::-1]\r\nfor i in range(len(path) - 1):\r\n for j in range(len(cs)):\r\n if path[i] == cs[j][1] and path[i + 1] == cs[j][0]:\r\n counter_2 += cs[j][2]\r\nfor j in range(len(cs)):\r\n if path[-1] == cs[j][1] and path[0] == cs[j][0]:\r\n counter_2 += cs[j][2]\r\n \r\nprint(min(counter_1,counter_2))\r\n ", "\r\nd,s,cont1,cont2 = [],[],0,0\r\n\r\nfor i in range(int(input())):\r\n x,y,z = map(int,input().split())\r\n if x in s or y in d: x,y = y,x; cont1 += z\r\n else: cont2 += z\r\n s.append(x)\r\n d.append(y)\r\n\r\nprint(min(cont1,cont2))\r\n \r\n", "n=int(input())\r\nA=[list(map(int,input().split())) for i in range(n)]\r\n\r\nE=[[] for i in range(n)]\r\n\r\nfor a,b,c in A:\r\n E[a-1].append((b-1,c))\r\n E[b-1].append((a-1,-c))\r\n\r\nANS1=0\r\nANS2=0\r\nUSE=[0]*n\r\n\r\nNOW=0\r\nUSE[NOW]=1\r\nwhile True:\r\n #print(NOW)\r\n for to,c in E[NOW]:\r\n if USE[to]==0:\r\n USE[to]=1\r\n if c>0:\r\n ANS1+=c\r\n else:\r\n ANS2+=c\r\n NOW=to\r\n break\r\n else:\r\n for to,c in E[NOW]:\r\n if to==0:\r\n if c>0:\r\n ANS1+=c\r\n else:\r\n ANS2+=c\r\n NOW=to\r\n break\r\n break\r\n\r\nprint(min(ANS1,-ANS2))\r\n", "n = int(input())\r\np = [tuple(map(int, input().split())) for i in range(n)]\r\nt = [[] for i in range(n + 1)]\r\nfor a, b, c in p:\r\n t[a].append(b)\r\n t[b].append(a)\r\nt[1], x = t[1][0], 1\r\nfor i in range(1, n):\r\n y = t[x]\r\n t[y], x = t[y][t[y][0] == x], y\r\nt[x] = 1\r\ns = d = 0\r\nfor a, b, c in p:\r\n if t[a] == b: d += c\r\n s += c\r\nprint(min(d, s - d))", "\ndef solve():\n\tn = int(input())\n\tadj = [[]for i in range(n+1)]\n\tfor i in range(n):\n\t\ta,b,c = map(int,input().split())\n\t\tadj[a].append((b,c,0))\n\t\tadj[b].append((a,c,1))\n\tans = 0\n\tans+=adj[1][0][1]*adj[1][0][2]\n\ts = adj[1][0][0]\n\tpar = 1\n\twhile s!=1:\n\t\tfor i in adj[s]:\n\t\t\tif i[0]!=par:\n\t\t\t\tans+=i[1]*i[2]\n\t\t\t\tpar = s\n\t\t\t\ts = i[0]\n\t\t\t\tbreak\n\tans2 = 0\n\tans2+=adj[1][1][1]*adj[1][1][2]\n\ts = adj[1][1][0]\n\tpar = 1\n\twhile s!=1:\n\t\tfor i in adj[s]:\n\t\t\tif i[0]!=par:\n\t\t\t\tans2+=i[1]*i[2]\n\t\t\t\tpar = s\n\t\t\t\ts = i[0]\n\t\t\t\tbreak\n\tprint(min(ans,ans2))\n\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", "import sys\r\nimport collections\r\n\r\n\r\n# class TreeNode:\r\n# def __init__(self,i=0,left=None,leftCost = 0, right=None, rightCost=0):\r\n# self.idx = i\r\n# self.left = left\r\n# self.right = right\r\n# self.leftCost = leftCost\r\n# self.rightCost = rightCost\r\n\r\ndef get_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\ndef get_ints():\r\n return map(int,sys.stdin.readline().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int,sys.stdin.readline().strip().split()))\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\n# for _ in range(get_int()):\r\n\r\nn = get_int()\r\n\r\ngraph = [[] for _ in range(n)]\r\n# print(graph)\r\nfor _ in range(n):\r\n a,b,c = get_ints()\r\n a-=1\r\n b-=1\r\n graph[a].append([c,b,0])\r\n graph[b].append([c,a,1]) # 3rd index for direction\r\n\r\n\r\n# print(graph)\r\nq1 = collections.deque()\r\n\r\n\r\n# visited = [False]*n\r\n\r\ncost0 = 0\r\ncost1 = 0\r\n\r\nq1.append(0)\r\npar = -1\r\nwhile q1:\r\n node= q1.popleft()\r\n \r\n\r\n for c,nbr,dir in graph[node]:\r\n if nbr==par:\r\n continue\r\n \r\n if dir==0:\r\n cost0+=c\r\n else:\r\n cost1+=c\r\n break\r\n \r\n\r\n if nbr==0:\r\n break\r\n par = node\r\n q1.append(nbr)\r\n \r\n\r\nprint(min(cost0,cost1))\r\n\r\n\r\n\r\n\r\n\r\n# #!/usr/bin/python\r\n# import sys\r\n\r\n# # direction: 0 - to, 1 - from\r\n# class Edge:\r\n# \tdef __init__(self, nextNode, direc, cost):\r\n# \t\tself.nextNode = nextNode\r\n# \t\tself.direc = direc\r\n# \t\tself.cost = cost\r\n\r\n# def pickNext(i, prev, nodes):\r\n# \tfor e in nodes[i]:\r\n# \t\tif e.nextNode != prev:\r\n# \t\t\treturn e\r\n# \tassert(False)\r\n\r\n# n = int(sys.stdin.readline())\r\n\r\n# nodes = {}\r\n# for i in range(1,n+1):\r\n# \tnodes[i] = []\r\n\r\n# for i in range(n):\r\n# \t(a, b, c) = map(int, sys.stdin.readline().split())\r\n# \tnodes[a].append(Edge(b, 0, c))\r\n# \tnodes[b].append(Edge(a, 1, c))\r\n\r\n# i = 1\r\n# prev = 0\r\n# saving = 0\r\n# cost = 0\r\n# while True:\r\n# \te = pickNext(i, prev, nodes)\r\n# \tif e.direc == 0:\r\n# \t\tsaving += e.cost\r\n# \telse:\r\n# \t\tcost += e.cost\r\n# \tprev = i\r\n# \ti = e.nextNode\r\n# \tif i == 1:\r\n# \t\tbreak\r\n\r\n# print (min(saving, cost))", "n=int(input())\r\npnts=[]\r\nfor i in range(n):\r\n pnts.append(list(map(int,input().split())))\r\nsum1,sum2=0,0\r\ncur=1\r\nlast=[-1,-1,-1]\r\nfor i in range(n): # обход цепи\r\n for pnt in pnts:\r\n if pnt!=last:\r\n if pnt[0]==cur:\r\n sum1+=pnt[2]; cur=pnt[1]; last=pnt; break\r\n if pnt[1]==cur:\r\n sum2+=pnt[2]; cur=pnt[0]; last=pnt; break\r\nprint(min(sum1,sum2))\r\n", "def connectionIndex(rel, ind, path):\r\n for i in range(len(rel)):\r\n if ((rel[i][ind] == 1 or rel[ind][i] == 1) and i not in path):\r\n return i\r\n return -1\r\n\r\n\r\nn = int(input())\r\nrelations = [[0 for y in range(n)] for x in range(n)]\r\ncosts = [[0 for y in range(n)] for x in range(n)]\r\n\r\nfor i in range(n):\r\n temp = list(map(int, input().split()))\r\n point1 = temp[0]\r\n point2 = temp[1]\r\n cost = temp[2]\r\n relations[point1 - 1][point2 - 1] = 1\r\n costs[point2 - 1][point1 - 1] = cost\r\n\r\npath = list()\r\npath.append(0)\r\nfor i in range(n - 1):\r\n path.append(connectionIndex(relations, path[i], path))\r\n\r\nCLW = 0\r\nACLW = 0\r\n\r\n'''for i in range(len(path)-1):\r\n CLW += costs[path[i]][path[i + 1]]\r\n \r\nj=len(path)-1\r\nwhile j>0:\r\n ACLW += costs[path[j]][path[j-1]]\r\n j-=1\r\n '''\r\ni = 0\r\nj = len(path) - 1\r\nwhile i < len(path) - 1:\r\n CLW += costs[path[i]][path[i + 1]]\r\n ACLW += costs[path[j]][path[j - 1]]\r\n i += 1\r\n j -= 1\r\n\r\nCLW += costs[path[len(path) - 1]][path[0]]\r\nACLW += costs[path[0]][path[len(path) - 1]]\r\n\r\nprint(min(CLW, ACLW))\r\n", "def main():\r\n n = int(input())\r\n graph = {}\r\n for _ in range(n):\r\n inp = input().split()\r\n u = int(inp[0])\r\n v = int(inp[1])\r\n w = int(inp[2])\r\n if u not in graph:\r\n graph[u] = []\r\n\r\n if v not in graph:\r\n graph[v] = []\r\n\r\n graph[u].append([v,0])\r\n graph[v].append([u,w])\r\n\r\n # print(graph)\r\n\r\n visited1 = set()\r\n visited2 = set()\r\n\r\n visited1.add(1)\r\n visited2.add(1)\r\n\r\n current1 = graph[1][0][0]\r\n current2 = graph[1][1][0]\r\n\r\n cost1 = graph[1][0][1]\r\n cost2 = graph[1][1][1]\r\n \r\n while(current1 not in visited1):\r\n # print(current1)\r\n visited1.add(current1)\r\n if graph[current1][0][0] not in visited1:\r\n cost1 += graph[current1][0][1]\r\n # print(cost1)\r\n # print(cost1)\r\n current1 = graph[current1][0][0]\r\n elif graph[current1][1][0] not in visited1:\r\n cost1 += graph[current1][1][1]\r\n # print(cost1)\r\n current1 = graph[current1][1][0]\r\n\r\n if(graph[current1][0][0] == 1):\r\n cost1 += graph[current1][0][1]\r\n else:\r\n cost1 += graph[current1][1][1]\r\n\r\n while(current2 not in visited2):\r\n # print(current2)\r\n visited2.add(current2)\r\n if graph[current2][0][0] not in visited2:\r\n cost2 += graph[current2][0][1]\r\n # print(cost2)\r\n # print(cost2)\r\n current2 = graph[current2][0][0]\r\n elif graph[current2][1][0] not in visited2:\r\n cost2 += graph[current2][1][1]\r\n # print(cost2)\r\n current2 = graph[current2][1][0]\r\n\r\n if(graph[current2][0][0] == 1):\r\n cost2 += graph[current2][0][1]\r\n else:\r\n cost2 += graph[current2][1][1]\r\n\r\n\r\n print(min(cost1, cost2))\r\n # print(cost1)\r\n\r\n return 0\r\n \r\n\r\nif __name__==\"__main__\":\r\n main()\r\n ", "def find_next_path(matrix, n, path, ind):\r\n for i in range(n):\r\n if matrix[ind][i] != 0 and i not in path or \\\r\n matrix[i][ind] != 0 and i not in path:\r\n return i\r\n\r\n return -1\r\n\r\n\r\nn = int(input())\r\nmatrix = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n a, b, price = [int(item) for item in input().split()]\r\n matrix[a - 1][b - 1] = price\r\n\r\npath = [0]\r\nind = find_next_path(matrix, n, path, 0)\r\n\r\nwhile ind != -1:\r\n path.append(ind)\r\n ind = find_next_path(matrix, n, path, path[len(path) - 1])\r\n\r\ncw = matrix[path[n - 1]][0]\r\nacw = matrix[0][path[n - 1]]\r\ni, j = 0, n - 1\r\n\r\nwhile i < n - 1:\r\n cw += matrix[path[i]][path[i + 1]]\r\n acw += matrix[path[j]][path[j - 1]]\r\n i += 1\r\n j -= 1\r\n\r\nprint(cw if cw < acw else acw)\r\n", "\r\ndef find_next_path(cont, n, path, ind):\r\n for i in range(n):\r\n if cont[ind][i] != 0 and i not in path or \\\r\n cont[i][ind] != 0 and i not in path:\r\n return i\r\n\r\n return -1\r\n\r\n\r\nn = int(input())\r\ncont = [[0] * n for i in range(n)]\r\n\r\nfor i in range(n):\r\n a, b, price = [int(item) for item in input().split()]\r\n cont[a - 1][b - 1] = price\r\n\r\npath = [0]\r\nnind = find_next_path(cont, n, path, 0)\r\n\r\nwhile nind != -1:\r\n path.append(nind)\r\n nind = find_next_path(cont, n, path, nind)\r\n\r\ncw = cont[path[n - 1]][0]\r\nacw = cont[0][path[n - 1]]\r\ni, j = 0, n - 1\r\nwhile i < n - 1:\r\n cw += cont[path[i]][path[i + 1]]\r\n acw += cont[path[j]][path[j - 1]]\r\n i += 1\r\n j -= 1\r\n\r\nprint(cw if cw < acw else acw)", "def main():\r\n n = int(input())\r\n road_cost = {}\r\n road_dict = {i: [] for i in range(1, n + 1)}\r\n total_cost = 0\r\n for _ in range(n):\r\n ai, bi, ci = map(int, input().split())\r\n road_dict[ai].append(bi)\r\n road_dict[bi].append(ai)\r\n road_cost[(ai, bi)] = ci\r\n total_cost += ci\r\n\r\n cost = 0\r\n current_city = 0\r\n while current_city != 1:\r\n if current_city == 0:\r\n current_city = 1\r\n next_city = road_dict[1][0]\r\n else:\r\n road_dict[current_city].remove(prev_city)\r\n next_city = road_dict[current_city][0]\r\n if (current_city, next_city) not in road_cost:\r\n cost += road_cost[(next_city, current_city)]\r\n prev_city = current_city\r\n current_city = next_city\r\n\r\n print(min(cost, total_cost - cost))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#region Header\r\n#!/usr/bin/env python3\r\n# from typing import *\r\n\r\nimport sys\r\nimport io\r\nimport math\r\nimport collections\r\nimport decimal\r\nimport itertools\r\nimport bisect\r\nimport heapq\r\n\r\ndef input():\r\n return sys.stdin.readline()[:-1]\r\n\r\nsys.setrecursionlimit(1000000)\r\n#endregion\r\n\r\n# _INPUT = \"\"\"3\r\n# 1 3 1\r\n# 1 2 1\r\n# 3 2 1\r\n# \"\"\"\r\n# sys.stdin = io.StringIO(_INPUT)\r\n\r\ndef main():\r\n N = int(input())\r\n G = [list() for _ in range(N)]\r\n total = 0\r\n for _ in range(N):\r\n a, b, c = list(map(int, input().split()))\r\n total += c\r\n G[a-1].append((b-1, c))\r\n G[b-1].append((a-1, -c))\r\n\r\n p_prev = -1\r\n p = 0\r\n cost = 0\r\n while True:\r\n if G[p][0][0] != p_prev:\r\n p_next, c = G[p][0]\r\n else:\r\n p_next, c = G[p][1]\r\n if c < 0:\r\n cost += -c\r\n p_prev = p\r\n p = p_next\r\n if p == 0:\r\n break\r\n\r\n ans = min(cost, total - cost)\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\ng = []\r\nfor i in range(n):\r\n\tr = []\r\n\tg.append(r)\r\nfor i in range(n):\r\n\ta,b,s = map(int,input().split())\r\n\ta -=1\r\n\tb -=1\r\n\tt1 = [a,0]\r\n\tt2 = [b,s]\r\n\tg[b].append(t1)\r\n\tg[a].append(t2)\r\nstart = 0\r\nst1 = 0\r\np = [0] * n\r\np[start] = 1\r\nv = g[start][0][0]\r\nst1 +=g[start][0][1]\r\nwhile p[v] != 1:\r\n\tp[v] = 1\r\n\tif p[g[v][0][0]] == 0:\r\n\t\t\r\n\t\tst1 += g[v][0][1]\r\n\t\tv = g[v][0][0]\r\n\t\t\r\n\telif p[g[v][1][0]] == 0:\r\n\t\t\r\n\t\tst1 += g[v][1][1]\r\n\t\tv = g[v][1][0]\r\np[start] = 0\r\nif p[g[v][0][0]] == 0:\r\n\tst1+=g[v][0][1]\r\n\t\r\nelse:\r\n\tst1 +=g[v][1][1]\r\n\r\n\r\n\r\n\r\n\r\nstart = 0\r\nst2 = 0\r\np = [0] * n\r\np[start] = 1\r\nv = g[start][1][0]\r\nst2 +=g[start][1][1]\r\n\r\nwhile p[v] != 1:\r\n\tp[v] = 1\r\n\tif p[g[v][0][0]] == 0:\r\n\t\t\r\n\t\tst2 += g[v][0][1]\r\n\t\tv = g[v][0][0]\r\n\t\t\r\n\telif p[g[v][1][0]] == 0:\r\n\t\t\r\n\t\tst2 += g[v][1][1]\r\n\t\tv = g[v][1][0]\r\n\t\t\r\n\t\r\np[start] = 0\r\nif p[g[v][0][0]] == 0:\r\n\tst2+=g[v][0][1]\r\n\t\r\nelse:\r\n\tst2 +=g[v][1][1]\r\n\r\nprint(min(st1,st2))\r\n\t\t\r\n\t\t\r\n\t\r\n", "from collections import deque\n\n# ingest\nn = int(input())\ncost_list = dict()\nneighbor_list = dict()\n\nfor _ in range(n):\n splits = input().split()\n v1_id = int(splits[0])\n v2_id = int(splits[1])\n cost = int(splits[2])\n\n if v1_id not in cost_list:\n cost_list[v1_id] = dict()\n\n if v2_id not in cost_list:\n cost_list[v2_id] = dict()\n\n cost_list[v1_id][v2_id] = 0 \n cost_list[v2_id][v1_id] = cost\n\ndef find_neighbor(curr, visited, neighbor_list, cost_list):\n found_neighbor = None\n cost = None\n path1_add = False \n if len(visited) == n - 1:\n found_neighbor = 1\n else:\n for neighbor in cost_list[curr]:\n if neighbor not in visited:\n found_neighbor = neighbor\n break\n\n cost = cost_list[curr][found_neighbor]\n if cost == 0:\n cost = cost_list[found_neighbor][curr]\n else:\n path1_add = True\n\n return found_neighbor, cost, path1_add\n\ncurr = 1\nvisited = set()\npath1_cost = 0\npath2_cost = 0\n\nwhile len(visited) != n:\n # print(curr)\n next, cost, path1_add = find_neighbor(curr, visited, neighbor_list, cost_list)\n if path1_add:\n path1_cost += cost\n else:\n path2_cost += cost\n visited.add(curr)\n curr = next\n\n# print(path1_cost)\n# print(path2_cost)\nprint(min(path1_cost, path2_cost))\n", "# n is the number of roads, aswell as bridges\r\nn = int(input())\r\n\r\n# we know that there are n cities and n bridges, and we can translate this into a graph theory problem\r\n# with n verticies and n edges\r\n# lets think about the undirected graph first, which would be the two way roads\r\n# if we have n, verticies, edges, and each verticies has 2 edges, then thats just a fricking cycle graph,\r\n# we can prove this, but it makes intuitive sense\r\n\r\n# if the graph is directed all we need to do to make sure u can get from 1 point to every other point is just to make sure\r\n# that all of the roads face the same direction, and you dont have 2 roads leading into the same point, this makes sense if you\r\n# think about the euler's circuit\r\n\r\n# so therefore inorder to make sure the road work we can just choose 1 of 2 directions\r\n# and make sure to flip every road not in that direction\r\n# using this we can obtain 2 costs\r\n# the cost of flipping all the roads facing one way\r\n# and the cost of the other way\r\n# we'll just return the smallest cost the lower the cost the better\r\n\r\n# a useful helper function, which just returns the sign or a number\r\ndef sign(n):\r\n if n > 0:\r\n return 1\r\n if n < 0:\r\n return -1\r\n return 0\r\n\r\n# this list represents the edges, each index tells us all the verticies connected the verticie with the index number and the sign\r\n# if a road leads away from the index, its positive\r\n# if it leads towards its negative\r\n\r\nnodes = []\r\n\r\nfor i in range(n):\r\n nodes.append([])\r\n\r\n\r\n# the total road cost is the cost of flipping every single road\r\n# this is a useful number because \r\n\r\ntotalRoadCost = 0\r\n\r\nfor i in range(n):\r\n a,b,c = list(map(int,input().split(\" \")))\r\n nodes[a-1].append((b,c))\r\n nodes[b-1].append((a,-c))\r\n\r\n totalRoadCost += c\r\n\r\n\r\n# We start with a a node n1 which leads to n2\r\n# we then find the 2 nodes connected to n2\r\n# one of them will be n1 so we take the other one, which will be n3\r\n# if the direction of n1->n2 is different from n2->n3 we'll correct n2->n3 and add that cost to our total\r\n# this will ofc be the cost for one dircection and well do the other direction by subtracting this cost from the total of flipping every road\r\n# well repeat this until we get back to n1, in which we'll know that out road works and is good and complete\r\n\r\n\r\nprevNode = 1\r\ncurrentNode = nodes[0][0][0]\r\ndirsign = sign(nodes[0][0][1]) \r\ntotal = 0\r\n\r\nwhile currentNode != 1:\r\n if nodes[currentNode-1][0][0] != prevNode:\r\n if sign(nodes[currentNode-1][0][1]) != dirsign:\r\n total += abs(nodes[currentNode-1][0][1])\r\n prevNode = currentNode\r\n currentNode = nodes[currentNode-1][0][0]\r\n \r\n else:\r\n if sign(nodes[currentNode-1][1][1]) != dirsign:\r\n total += abs(nodes[currentNode-1][1][1])\r\n prevNode = currentNode\r\n currentNode = nodes[currentNode-1][1][0]\r\n \r\nprint(min(total, totalRoadCost - total))", "n=int(input())\r\nx=[]\r\ny=[]\r\nz=[]\r\nm=0\r\nk=0\r\nfor i in range(n):\r\n a,b,c=[int(i) for i in input().split()]\r\n if a in x:\r\n t=a\r\n a=b\r\n b=t\r\n k=k+c\r\n elif b in y:\r\n t=a\r\n a=b\r\n b=t\r\n k=k+c\r\n m=m+c\r\n x.append(a)\r\n y.append(b)\r\n z.append(c)\r\nprint(min(k,m-k))", "n = int(input())\n\ns = [0]*110\ne = [0]*110\n\n\nr = 0\nans = 0\nfor i in range(n):\n a,b,c = map(int,input().split())\n if s[a] == 1 or e[b] == 1:\n r += c\n s[b] = 1\n e[a] = 1\n else:\n s[a] = 1\n e[b] = 1\n\n ans += c\nprint(min(r , ans - r))\n\n", "num = int(input())\r\nlist_a = []\r\nlist_b = []\r\ntotal_x = total_y = 0\r\n\r\nfor i in range(num):\r\n value_a, value_b, value_c = map(int, input().split())\r\n \r\n if (value_a in list_a or value_b in list_b):\r\n value_a, value_b = value_b, value_a\r\n total_y += value_c\r\n \r\n total_x += value_c\r\n list_a.append(value_a)\r\n list_b.append(value_b)\r\n\r\nprint(min(total_y, total_x - total_y))\r\n", "n=int(input())\r\nar=[]\r\nbr=[]\r\np,y=0,0\r\nfor _ in range(n):\r\n a,b,c=map(int,input().split())\r\n if (a in ar or b in br):\r\n a,b=b,a\r\n y+=c\r\n p+=c\r\n ar.append(a)\r\n br.append(b)\r\nprint(min(y,p-y))", "n = int(input())\r\nsource, dest = [], []\r\nsum1, sum2 = 0, 0\r\nfor i in range(n):\r\n\tt, s , w= map(int, input().split())\r\n\tif(t in source or s in dest):\r\n\t\tt, s = s, t\r\n\t\tsum1 +=w\r\n\telse:\r\n\t\tsum2+=w\r\n\tsource.append(t)\r\n\tdest.append(s)\r\nprint(min(sum2, sum1))", "n = int(input())\r\ntotal = 0\r\nanswer= 0\r\ncoming = {}\r\ngoing = {}\r\nfor _ in range(n):\r\n x,y,c = map(int,input().split())\r\n total+=c\r\n if coming.get(x) or going.get(y):\r\n coming[y] = going[x] = 1\r\n answer+=c\r\n else:\r\n coming[x] = going[y] = 1\r\nprint(min(total-answer,answer))\r\n\r\n\r\n\r\n", "n=int(input())\r\ngraph=[[] for i in range(n)]\r\nfor _ in range(n):\r\n s,e,w=map(int,input().split())\r\n graph[s-1].append([e-1,0])\r\n graph[e-1].append(([s-1,w]))\r\ndef get(graph):\r\n def dfs(s,i,p,temp):\r\n if i==s and s in visited:\r\n nonlocal ans\r\n ans=min(ans,temp)\r\n return\r\n visited.add(i)\r\n for j, w in graph[i]:\r\n if j !=p:\r\n dfs(s, j,i, temp+w)\r\n visited.remove(i)\r\n visited=set()\r\n ans=9999\r\n dfs(0,0,0,0)\r\n return ans\r\nprint(get(graph))", "n = int(input())\r\nar=[]\r\nbr=[]\r\nx=y=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if (a in ar or b in br):\r\n a,b=b,a\r\n y+=c\r\n x+=c\r\n ar.append(a)\r\n br.append(b)\r\nprint(min(y,x-y)) ", "\r\nn=int(input())\r\n\r\nrep = {}\r\ng=[[] for i in range(n)]\r\n\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n rep[str(a-1)+\"-\"+str(b-1)] = c\r\n g[a-1].append(b-1)\r\n g[b-1].append(a-1)\r\n\r\nres = 10**9\r\nfor i in range(2):\r\n e=0 if \"0-\"+str(g[0][i]) not in rep else rep[\"0-\"+str(g[0][i])]\r\n cur = g[0][i]; pref = 0\r\n while cur!=0:\r\n if g[cur][0]!=pref:\r\n to = g[cur][0]\r\n else:\r\n to = g[cur][1]\r\n e += 0 if str(cur)+\"-\" + str(to) not in rep else rep[str(cur)+\"-\" + str(to)]\r\n cur,pref = to,cur\r\n\r\n res = min(res, e)\r\n\r\nprint(res)\r\n", "n = int(input())\r\nsum1 = 0\r\nsum2 = 0\r\nog = [[0]*n for q in range(n)]\r\nopl = [[0]*n for q in range(n)]\r\nopr = [[0]*n for q in range(n)]\r\nq = [[0]*n for i in range(n)]\r\nfor _ in range(n):\r\n a = list(map(int,input().split()))\r\n q[a[0]-1][a[1]-1] = a[2]\r\n og[a[0]-1][a[1]-1] = 1\r\n og[a[1]-1][a[0]-1] = -1\r\n opl[a[0]-1][a[1]-1] = opl[a[1]-1][a[0]-1] = 1\r\n opr[a[0] - 1][a[1] - 1] = opr[a[1] - 1][a[0] - 1] = 1\r\n\r\nvisited = [0]\r\nstack = [0]\r\nwhile stack:\r\n s = stack.pop()\r\n for i in range(n):\r\n if opl[s][i] == 1 and i not in visited:\r\n visited.append(i)\r\n stack.append(i)\r\n opl[i][s] = -1\r\n opr[s][i] = -1\r\n break\r\n elif opl[s][i] == 1 and i in visited:\r\n opl[i][s] = -1\r\n opr[s][i] = -1\r\nfor i in range(n):\r\n for j in range(n):\r\n if og[i][j] != opl[i][j]:\r\n sum1 += q[i][j]\r\n if og[i][j] != opr[i][j]:\r\n sum2 += q[i][j]\r\nprint(min(sum1,sum2))", "n = int(input())\r\nm = [[j, [int(i) for i in input().split()]] for j in range(n)]\r\nk = m\r\nh = [k[0]]\r\nk.pop(0)\r\nend = h[0][1][1]\r\n\r\n\r\ndef search_for_next(end):\r\n for j in range(len(k)):\r\n if end == k[j][1][0]:\r\n h.append(k[j])\r\n k.pop(j)\r\n break\r\n elif end == k[j][1][1]:\r\n k[j][1][2] = k[j][1][2] * (-1)\r\n k[j][1][1] = k[j][1][0]\r\n k[j][1][0] = end\r\n h.append(k[j])\r\n k.pop(j)\r\n break\r\n\r\n\r\nfor i in range(n):\r\n search_for_next(end)\r\n end = h[i][1][1]\r\n\r\nonesidecost = 0\r\nothersidecost = 0\r\n\r\nfor i in range(n):\r\n if h[i][1][2] > 0:\r\n onesidecost += h[i][1][2]\r\n else:\r\n othersidecost += h[i][1][2] * (-1)\r\n\r\nprint(min(onesidecost, othersidecost))\r\n", "n = int(input())\nmp = {i: [] for i in range(1, n + 1)}\ninvertcost = {}\nfor _ in range(n):\n a, b, c = (int(x) for x in input().split())\n mp[a].append(b)\n mp[b].append(a)\n invertcost[(a, b)] = 0\n invertcost[(b, a)] = c\nx, y = mp[1][0], mp[1][1]\np, c = 1, x\ncost = invertcost[(1, x)]\nfor j in range(n - 1):\n h = mp[c]\n f = c\n c = h[0] + h[1] - p\n p = f\n cost += invertcost[(p, c)]\ncost1 = invertcost[(1, y)]\np, c = 1, y\nfor j in range(n - 1):\n h = mp[c]\n f = c\n c = h[0] + h[1] - p\n p = f\n cost1 += invertcost[(p, c)]\nprint(min(cost, cost1))", "from collections import defaultdict\r\n\r\n\r\ndef dfs(src, par, g):\r\n total = 0\r\n if src == 1:\r\n return total\r\n for child, cost in g[src]:\r\n if child != par:\r\n if cost > 0:\r\n total += dfs(child, src, g)\r\n else:\r\n total += -cost + dfs(child, src, g)\r\n return total\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n g = defaultdict(list)\r\n\r\n for _ in range(n):\r\n a, b, c = [int(x) for x in input().split(\" \")]\r\n g[a].append((b, c))\r\n g[b].append((a, -c))\r\n\r\n a = []\r\n\r\n for child, cost in g[1]:\r\n a.append(dfs(child, 1, g) + (-cost if cost < 0 else 0))\r\n\r\n print(min(a))\r\n\r\n\r\nmain()", "import sys\n\n\ndef main():\n n = int(sys.stdin.readline())\n\n adj = dict() # key: [neighours, ]\n weights = dict() # (a, b): w\n\n # Initialize adj list with no neighbours\n for i in range(n):\n adj[i] = []\n\n # Read input, populating adj list and weights\n for line in sys.stdin:\n a, b, w = [int(x) for x in line.split()]\n a, b = a - 1, b - 1 # map [1,N] to [0,N-1]\n adj[a].append(b)\n adj[b].append(a)\n weights[(a, b)] = 0\n weights[(b, a)] = w\n\n # Initialize costs of forward and reverse travel, and traversal variables\n fwdcost = revcost = 0\n curr_node = 0\n next_node = adj[curr_node][0] # Just pick the first neighbour to start\n visited = set()\n\n # Perform a single linear pass around the ring\n while curr_node not in visited:\n # print(f\"On node {curr_node}, next is {next_node}\")\n visited.add(curr_node)\n fwdcost += weights[(curr_node, next_node)]\n revcost += weights[(next_node, curr_node)]\n curr_node = next_node\n unvisited_neighbours = [x for x in adj[next_node] if x not in visited]\n # print(f\"Unvisited neighbours of {next_node}: {unvisited_neighbours}\")\n next_node = unvisited_neighbours[0] if unvisited_neighbours else 0\n\n # print(f\"Costs {fwdcost} to go forward and {revcost} to go backwards\")\n print(min(fwdcost, revcost))\n\n\nmain()\n", "import math\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\nfrom collections import deque\r\nimport bisect\r\nsys.setrecursionlimit(1000000)\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\n\r\nG = defaultdict(list)\r\n\r\nPath = []\r\n\r\ndef DFSUtil(node,vis):\r\n vis[node] = True\r\n Path.append(node)\r\n \r\n for child in G.get(node,[]):\r\n if vis[child] == False:\r\n DFSUtil(child,vis)\r\n\r\ndef dfs(N):\r\n vis = [False for i in range(N+1)]\r\n DFSUtil(1,vis)\r\n\r\n\r\nN = int(input())\r\nmark = {};C = [];price = {}\r\nfor i in range(N):\r\n a,b,c = ilele()\r\n price[(b,a)] = c\r\n G[a].append(b)\r\n G[b].append(a)\r\ndfs(N)\r\nPath.append(Path[0])\r\n#print(Path)\r\ncost1,cost2= 0,0\r\npath2 = Path[::-1]\r\nfor i,j in zip(Path,Path[1:]):\r\n cost1 += price.get((i,j),0)\r\nfor i,j in zip(path2,path2[1:]):\r\n cost2 += price.get((i,j),0)\r\nprint(min(cost1,cost2))\r\n", "dic,tcost,ncost = {}, 0,0\nfor line in range(int(input())):\n\ta,b,c = list(map(int, input().split(\" \")))\n\tif a not in dic:\n\t\tdic[a] = {b: 0}\n\telse: dic[a][b] = 0\n\tif b not in dic:\n\t\tdic[b] = {a: c}\n\telse: dic[b][a] = c\n\ttcost +=c\ncurr = b\nprev = a\nnext = None\nwhile curr != a:\n\tfor x in dic[curr].keys()-[prev]: next = x\n\tncost += dic[curr][next]\n\tprev, curr = curr,next\nif ncost < tcost/2:\n\tprint(ncost)\nelse: print(tcost - ncost)\n\n", "n = int(input())\n\nconnectivity_list = [[] for x in range(n)]\n\nfor _ in range(n):\n start, end, cost = map(int, input().split())\n start -= 1\n end -= 1\n connectivity_list[start].append([end, 0])\n connectivity_list[end].append([start, cost])\n\n\npos_left = connectivity_list[0][0][0]\ncost_left = connectivity_list[0][0][1]\nprev_pos = 0\nwhile pos_left != 0:\n if connectivity_list[pos_left][0][0] != prev_pos:\n prev_pos = pos_left\n cost_left += connectivity_list[pos_left][0][1]\n pos_left = connectivity_list[pos_left][0][0]\n else:\n prev_pos = pos_left\n cost_left += connectivity_list[pos_left][1][1]\n pos_left = connectivity_list[pos_left][1][0]\n \n\npos_right = connectivity_list[0][1][0]\ncost_right = connectivity_list[0][1][1]\nprev_pos = 0\n\nwhile pos_right != 0:\n if connectivity_list[pos_right][0][0] != prev_pos:\n prev_pos = pos_right\n cost_right += connectivity_list[pos_right][0][1]\n pos_right = connectivity_list[pos_right][0][0]\n else:\n prev_pos = pos_right\n cost_right += connectivity_list[pos_right][1][1]\n pos_right = connectivity_list[pos_right][1][0]\n \nprint(min(cost_left, cost_right))", "n=int(input())\r\ng=[[] for _ in range(n+1)]\r\nans=float('inf')\r\ndef dfs(u,pr,cst=0):\r\n global ans\r\n if(u==1 and pr!=-1):\r\n ans=min(ans,cst)\r\n return\r\n for el in g[u]:\r\n v,w=el[0],el[1]\r\n if(v==pr):continue\r\n dfs(v,u,w+cst)\r\nfor _ in range(n):\r\n a,b,c=map(int,input().split())\r\n g[a].append([b,0])\r\n g[b].append([a,c])\r\ndfs(1,-1)\r\nprint(ans)\r\n", "lines = [w.rstrip() for w in open(0).readlines()]\r\nn, data = int(lines[0]), dict()\r\n\r\nfor line in lines[1:]:\r\n h, t, c = map(int, line.split())\r\n data[(h,t)] = c\r\n\r\nh1, t1, _ = map(int, lines[1].split())\r\nlst = [h1, t1]\r\nwhile len(lst) < n:\r\n h, t = lst[-2], lst[-1]\r\n x = next(d for d in data if t in [d[0],d[1]] and h not in [d[0],d[1]])\r\n lst.append(x[0] if x[0] != t else x[1])\r\n\r\nlst.append(h1)\r\n\r\nc1, c2 = 0, 0\r\nfor a, b in zip(lst, lst[1:]):\r\n if (a,b) in data:\r\n c1 += data[(a,b)]\r\n else: \r\n c2 += data[(b,a)]\r\n\r\nprint(min(c1, c2))", "def findNextPath(cont, path, ind):\r\n for i in range(len(cont)):\r\n if cont[ind][i] != 0 and i not in path or \\\r\n cont[i][ind] != 0 and i not in path:\r\n return i\r\n return -1\r\n\r\n\r\nN = int(input())\r\ncont = [[0] * N for i in range(N)]\r\nfor i in range(N):\r\n city1, city2, price = [int(item) for item in input().split(' ')]\r\n cont[city1 - 1][city2 - 1] = price\r\n\r\npath = [0]\r\nind = findNextPath(cont, path, 0)\r\nwhile ind != -1:\r\n path.append(ind)\r\n ind = findNextPath(cont, path, ind)\r\n\r\ncw = cont[path[N - 1]][0]\r\nacw = cont[0][path[N - 1]]\r\ni, j = 0, N - 1\r\nwhile i < N - 1:\r\n cw += cont[path[i]][path[i + 1]]\r\n acw += cont[path[j]][path[j - 1]]\r\n i += 1\r\n j -= 1\r\n\r\nprint(min(cw, acw))", "n = int(input())\r\nG = [ [0]*(n+1) for _ in range(n+1)]\r\n\r\ncircle = []\r\n\r\ndone = set()\r\n\r\nfor _ in range(n):\r\n a,b,c = map(int,input().split())\r\n G[a][b] = c\r\n\r\n\r\n\r\ndef dfs(x):\r\n done.add(x)\r\n circle.append(x)\r\n #print(x)\r\n\r\n for i in range(1,n+1):\r\n if not i in done and (G[x][i] != 0 or G[i][x] != 0):\r\n dfs(i)\r\n\r\n\r\ndfs(1)\r\nleft=0\r\nright=0\r\n\r\n#print(circle,n)\r\ncircle.append(1)\r\n\r\nfor i in range(n):\r\n right+=G[circle[i]][circle[i+1]]\r\n\r\ncircle = circle[::-1]\r\n\r\nfor i in range(n):\r\n left+=G[circle[i]][circle[i+1]]\r\n\r\nprint(min(left,right))", "def process(A):\r\n n = len(A)\r\n d = [[] for i in range(n+1)]\r\n total = 0\r\n for i in range(n):\r\n a, b, c = A[i]\r\n\r\n d[a].append([b, c])\r\n d[b].append([a, -1*c])\r\n total+=c\r\n a1, b1 = d[1][0]\r\n a2, b2 = d[1][1]\r\n start = [1, a1]\r\n while len(start) < n:\r\n x = start[-1]\r\n a1, b1 = d[x][0]\r\n a2, b2 = d[x][1]\r\n if a1 != start[-2]:\r\n start.append(a1)\r\n else:\r\n start.append(a2)\r\n answer = 0\r\n for i in range(n):\r\n a = start[i]\r\n b = start[(i+1) % n]\r\n flip = 0\r\n for x, y in d[a]:\r\n if x==b and y < 0:\r\n answer+=(-1*y)\r\n print(min(answer, total-answer))\r\n \r\nn = int(input())\r\nA = []\r\nfor i in range(n):\r\n a, b, c = [int(x) for x in input().split()]\r\n A.append([a, b, c])\r\nprocess(A)\r\n ", "n = int(input())\r\np,c,ss = [[] for _ in range(n+1)],[[0]*(n+1) for _ in range(n+1)], 0\r\nfor x,y,z in [map(int,input().split()) for _ in range(n)]:\r\n p[x].append(y),p[y].append(x)\r\n c[x][y],ss= z,ss+z\r\ntmp ,vis,cir = 1,[0 for _ in range(n+1)],[]\r\nwhile 1:\r\n ok = 0\r\n cir.append(tmp)\r\n vis[tmp] = 1\r\n if not vis[p[tmp][0]] :tmp,ok = p[tmp][0],1\r\n elif not vis[p[tmp][1]]: tmp,ok = p[tmp][1],1\r\n if not ok : break\r\nns = sum(c[cir[i]][cir[i+1]] for i in range(-1,n-1))\r\nprint(min(ns,ss-ns))", "class CodeforcesTask24ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.roads = []\n\n def read_input(self):\n self.n = int(input())\n for x in range(self.n):\n self.roads.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n connections = [[] for x in range(self.n)]\n costs = {}\n for road in self.roads:\n r_name = \"{0}_{1}\".format(road[0], road[1])\n r_name_alt = \"{1}_{0}\".format(road[0], road[1])\n costs[r_name] = 0\n costs[r_name_alt] = road[2]\n connections[road[0] - 1].append(road[1])\n connections[road[1] - 1].append(road[0])\n to_visit = [1]\n visited = []\n cost = 0\n visiting = 1\n while to_visit:\n visiting = to_visit.pop(0)\n visited.append(visiting)\n if connections[visiting - 1][0] not in visited:\n to_visit.append(connections[visiting - 1][0])\n cost += costs[\"{0}_{1}\".format(visiting, to_visit[-1])]\n elif connections[visiting - 1][1] not in visited:\n to_visit.append(connections[visiting - 1][1])\n cost += costs[\"{0}_{1}\".format(visiting, to_visit[-1])]\n cost += costs[\"{0}_1\".format(visiting)]\n cost2 = sum([x[2] for x in self.roads]) - cost\n self.result = str(min(cost, cost2))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask24ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "# -*- coding: utf-8 -*-\n\"\"\"ring road.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ls2CdNi1Ub6YeK8uXmt2CMSuZ16jdAlK\n\"\"\"\n\nn, ans, src=0, 99999999, 0\nDATA=visited=adj=cost=[]\n\ndef isAllConnected():\n s=0\n for i in range(1,n+1):\n if visited[i]==1:\n s+=1\n return s\n\ndef dfs(here) :\n visited[here]=1\n if isAllConnected()==n :\n return cost[here][src]\n ret=0\n for there in range(1,n+1):\n if adj[here][there]==1 and visited[there]==0 :\n ret=dfs(there)+cost[here][there]\n return ret\n\ndef main():\n global src, ans, n, ans, visited, adj, cost\n n = int(input())\n DATA = [list(map(int, input().split())) for i in range(n)]\n\n visited = [0 for i in range(n+1)]\n adj = [[0 for i in range(n+1)] for j in range(n+1)]\n cost = [[0 for i in range(n+1)] for j in range(n+1)]\n ans=99999999\n src=0 #출발지점\n\n for i in range(n) : #간선\n here=DATA[i][0]\n there=DATA[i][1]\n val=DATA[i][2]\n adj[here][there]=1\n adj[there][here]=1\n cost[here][there]=0\n cost[there][here]=val\n\n for i in range(1,n+1) :\n for j in range(1,n+1) :\n visited[j]=0\n src=i\n ans=min(ans, dfs(i))\n print(ans)\n\nif __name__ == \"__main__\":\n main()\n\nglobals()", "n = int(input())\r\n\r\nl = []\r\ng = [1]\r\n\r\ndef li(x1,x2): \r\n\tfor i in range(len(g)):\r\n\t\tif x1 == g[i]:\r\n\t\t\tif x2 == g[i-1]:\r\n\t\t\t\treturn True\r\n\t\t\telse:\r\n\t\t\t\treturn False\r\n\r\ndef find(x):\r\n\tfor y in l: \r\n\t\tif (y[0]==x)&(g.count(y[1])==0):\r\n\t\t\treturn y[1]\r\n\t\tif (y[1]==x)&(g.count(y[0])==0):\r\n\t\t\treturn y[0]\r\n\r\nfor i in range(n):\r\n\ts = input()\r\n\ts = s.split()\r\n\tfor i in range(3):\r\n\t\ts[i] = int(s[i])\r\n\tl.append(s.copy())\r\n\r\nfor i in range(n-1):\r\n\tg.append(find(g[i]))\r\n\r\nsum = 0\r\nfor h in l:\r\n\tsum = sum+h[2]\r\n\r\nsum2 = 0\r\nfor h in l:\r\n\tif (li(h[0],h[1])):\r\n\t\tsum2 = sum2 + h[2]\r\n\r\nsum3 = sum - sum2 \r\n\r\nprint(min(sum2,sum3))", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\ngraph=[[] for _ in range(n)]\r\ncost=[[float(\"inf\")]*n for _ in range(n)]\r\nfor _ in range(n):\r\n a, b, w = map(int, input().split())\r\n a-=1\r\n b-=1\r\n cost[a][b]=0\r\n cost[b][a]=w\r\n graph[a].append(b)\r\n graph[b].append(a)\r\nparent=[-1]*n\r\norder=[0]\r\nnode=graph[0][0]\r\nparent[node]=0\r\norder.append(node)\r\nwhile node!=0:\r\n for child in graph[node]:\r\n if child!=parent[node]:\r\n parent[child]=node\r\n node=child\r\n order.append(node)\r\n break\r\nans1=0\r\nans2=0\r\nfor i in range(len(order)-1):\r\n ans1+=cost[order[i]][order[i+1]]\r\nfor i in range(len(order)-1,0,-1):\r\n ans2+=cost[order[i]][order[i-1]]\r\nprint(min(ans1,ans2))\r\n\r\n\r\n", "from collections import defaultdict\r\nclass Graph:\r\n def __init__(self):\r\n self.graph = defaultdict(list)\r\n self.Config = defaultdict(int)\r\n self.visited = defaultdict(bool)\r\n self.anon = defaultdict(bool)\r\n self.clock = 0\r\n self.total = 0\r\n def addEdge(self,fr,to,w):\r\n self.graph[fr].append(to)\r\n self.graph[to].append(fr)\r\n self.Config[(fr,to)] = w\r\n self.total += w\r\n def solve(self):\r\n for i in self.graph[1]:\r\n if(self.anon[(1,i)]==False):\r\n if(self.Config[(i,1)]==0):\r\n self.clock+=self.Config[(1,i)]\r\n print(min(self.clock,self.total-self.clock))\r\n def DFS(self,root):\r\n self.visited[root] = True\r\n for i in self.graph[root]:\r\n if(self.visited[i] == False):\r\n self.anon[(root,i)] = True\r\n self.anon[(i,root)] = True\r\n if(self.Config[(root,i)]==0):\r\n self.clock+=self.Config[(i,root)]\r\n self.DFS(i)\r\nn = int(input())\r\nG = Graph()\r\nfor _ in range(n):\r\n fr,to,w = map(int, input().split())\r\n G.addEdge(fr,to,w)\r\nG.DFS(1)\r\nG.solve()\r\n\r\n", "n=int(input())\r\ndef graph_undirected(n,e):\r\n cost=[[0 for x in range(n+1)] for x in range(n+1)]\r\n\r\n #n,e=[int(x) for x in input().split()]\r\n graph={} #####adjecancy list using dict\r\n for i in range(e):\r\n vertex,neighbour,c=[int(x) for x in input().split()]\r\n cost[vertex][neighbour]=c\r\n if vertex in graph:\r\n graph[vertex].append(neighbour)\r\n else:\r\n graph[vertex]=[neighbour]\r\n if neighbour in graph: #####for undirected part remove to get directed\r\n graph[neighbour].append(vertex)\r\n else:\r\n graph[neighbour]=[vertex]\r\n return graph,cost\r\ngraph,cost=graph_undirected(n,n)\r\n\r\n###### undirected\r\ndef dfs(graph,n,currnode):\r\n visited=[False for x in range(n+1)]\r\n stack=[currnode]\r\n arr=[]\r\n while stack:\r\n currnode=stack[-1]\r\n if visited[currnode]==False:\r\n visited[currnode]=True\r\n arr.append(currnode)\r\n for neighbour in graph[currnode]:\r\n if visited[neighbour]==False:\r\n visited[neighbour]=True\r\n stack.append(neighbour)\r\n arr.append(neighbour)\r\n break\r\n else:\r\n stack.pop() ####we are backtracking to previous node which is in our stack\r\n return arr\r\n\r\narr=dfs(graph,n,1)\r\ntotal=0\r\nfor i in range(n+1):\r\n for j in range(n+1):\r\n total+=cost[i][j]\r\nans=0\r\nfor i in range(len(arr)-1):\r\n if cost[arr[i]][arr[i+1]]==0:\r\n ans+=cost[arr[i+1]][arr[i]]\r\nif cost[arr[-1]][arr[0]]==0:\r\n ans+=cost[arr[0]][arr[-1]]\r\n\r\nprint(min(total-ans,ans))\r\n", "n = int(input())\r\n\r\ncost = [[-1 for _ in range(101)] for _ in range(101)]\r\n\r\n# cost[i][j] -> cena, lai nokļūt no i uz j\r\nfor _ in range(n):\r\n a, b, c = [int(x) for x in input().split()]\r\n cost[a][b] = 0\r\n cost[b][a] = c\r\n\r\nvisited = [False] * 101\r\n\r\n# returns the cost to go from v to 0 without returning to p\r\ndef dfs(i, p):\r\n if visited[i]:\r\n return 0\r\n visited[i] = True\r\n res = 1e9\r\n for j in range(n+1):\r\n if j == p or cost[i][j]==-1:\r\n continue\r\n res = min(res,cost[i][j]+dfs(j,i))\r\n visited[i] = False\r\n return res\r\n\r\nprint(dfs(1,1))\r\n", "'''arr = {}\r\narr2 = {}\r\ncost = 0\r\ncost2 = 0\r\nn = int(input())\r\narr3 = [False]*n\r\nfor _ in range(n):\r\n a, b, c = list(map(int, input().split()))\r\n cost2 += c\r\n if a in arr:\r\n arr[a].append(b)\r\n else:\r\n arr[a] = [b]\r\n if b in arr:\r\n arr[b].append(a)\r\n else:\r\n arr[b] = [a]\r\n arr2[a, b] = c\r\nprint(arr)\r\nprint(arr2)\r\ncount = 0\r\narr100 = []\r\nfor k in arr:\r\n if len(arr[k]) > 1:\r\n for kk in arr[k]:\r\n if kk not in arr:\r\n #print(kk)\r\n cost += arr2[k, kk]\r\nprint(min(cost, cost2-cost))'''\r\n\r\n\r\n'''n = int(input())\r\ncnt1 = [0] * (n + 1)\r\ncnt2 = [0] * (n + 1)\r\nss = 0\r\ns1 = 0\r\nd1 = {}\r\nd2 = {}\r\nfor _ in range(n):\r\n aa, bb, cc = list(map(int, input().split()))\r\n print(d1)\r\n print(d2)\r\n if (aa in d1) or (bb in d2):\r\n aa, bb = bb, aa\r\n s1 += cc\r\n d1[aa] = 1\r\n d2[bb] = 1\r\n ss += cc\r\n\r\nprint(min(s1, ss - s1))'''\r\n\r\n'''5 \r\n1 4 1\r\n4 2 1\r\n2 3 1\r\n5 3 1\r\n1 5 3\r\n\r\n6\r\n1 6 1\r\n1 5 1\r\n5 3 1\r\n2 3 1\r\n2 4 1\r\n4 6 1'''\r\n'''arr = {}\r\narr2 = {}\r\ncost = 0\r\ncost2 = 0\r\nn = int(input())\r\narr1000 = [0]*n\r\nfor _ in range(n):\r\n a, b, c = list(map(int, input().split()))\r\n arr1000[b - 1] += 1\r\n cost2 += c\r\n if a in arr:\r\n arr[a].append(b)\r\n else:\r\n arr[a] = [b]\r\n arr2[a, b] = c\r\nprint(arr)\r\nprint(arr2)\r\ncount = 0\r\nfor k in arr:\r\n if len(arr[k]) > 1:\r\n for kk in arr[k]:\r\n if kk not in arr:\r\n print(kk)\r\n cost += arr2[k, kk]\r\nprint(min(cost, cost2-cost))'''\r\nimport math\r\ndef dfs(u, cur):\r\n global ans\r\n vis[u] = True\r\n #print(vis)\r\n flag = True\r\n #print(vec[u], u)\r\n for x in vec[u]:\r\n #print(x)\r\n z = x\r\n #print(u, z)\r\n if not vis[z]:\r\n if (u, z) in arr100:\r\n #print(u, z, 100000)\r\n cur += arr100[u, z]\r\n dfs(z, cur)\r\n flag = False\r\n if flag:\r\n vis2 = vis.copy()\r\n vis2.pop(0)\r\n #print(vis2, [True]*(n-1))\r\n #print(u, 1, 99999999999)\r\n if vis2 == [True]*(n):\r\n #print(\"YEs\")\r\n if (u, 1) in arr100:\r\n cur += arr100[u, 1]\r\n ans = min(cur, ans)\r\n #print(ans)\r\n\r\n\r\nans = math.inf\r\nass = 0\r\nvec = []\r\nvis = []\r\ni = 0\r\narr100 = {}\r\nn = int(input())\r\nwhile i < n + 1:\r\n vec.append([])\r\n vis.append(False)\r\n i += 1\r\ni = 1\r\nwhile i <= n:\r\n u, v, c = (int(x) for x in input().split(' '))\r\n ass += c\r\n vec[u].append(v)\r\n vec[v].append(u)\r\n arr100[u, v] = c\r\n i += 1\r\n#print(vec)\r\n\r\ndfs(1, 0)\r\n#print(ass - ans)\r\n#print(vec)\r\nprint(min(ass - ans, ans))", "def II():\r\n return(int(input()))\r\ndef LMI():\r\n return(list(map(int,input().split())))\r\ndef I():\r\n return(input())\r\ndef MII():\r\n return(map(int,input().split()))\r\n# import sys\r\n# input=sys.stdin.readline\r\n# import io,os\r\n# input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n# from collections import Counter\r\n# int(math.log(len(L)))\r\n# import math\r\n# from collections import defaultdict\r\n# mod=10**9+7\r\n# from collections import deque\r\n# import math\r\n\r\n\r\n\r\n\r\nn=II()\r\nG=[[] for _ in range(n+1)]\r\nfor _ in range(n):\r\n a,b,c=MII()\r\n G[a].append((b,0))\r\n G[b].append((a,c))\r\np=1\r\na=G[1][0][0]\r\nans=G[1][0][1]\r\nwhile a!=1:\r\n for j,c in G[a]:\r\n if j==p:continue\r\n ans+=c\r\n p=a\r\n a=j\r\n break\r\nans2=G[1][1][1]\r\na=G[1][1][0]\r\np=1\r\nwhile a!=1:\r\n for j,c in G[a]:\r\n if j==p:continue\r\n ans2+=c\r\n p=a\r\n a=j\r\n break\r\nprint(min(ans,ans2)) \r\n\r\n \r\n # return\r\n\r\n\r\n\r\n# if __name__==\"__main__\":\r\n\r\n # for _ in range(II()):\r\n # t()\r\n # t()", "import sys\r\nread=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x)+\"\\n\")\r\nN = int(read())\r\nG = {i:{\"in\":set(), \"out\":set()} for i in range(1, N+1)}\r\nfor i in range(N):\r\n a, b, c = map(int, read().split())\r\n G[a][\"out\"].add((b, c))\r\n G[b][\"in\"].add((a, c))\r\n\r\n\r\nc1, c2, flag = 0,0,0\r\ncur, prev = 1, 0\r\nreverse = None\r\nwhile True:\r\n for nxt, cost in G[cur][\"out\"]:\r\n if nxt != prev:\r\n flag = 1\r\n prev = cur\r\n reverse = (nxt, cost)\r\n cur = nxt\r\n c1 += cost\r\n break\r\n\r\n else:\r\n for nxt, cost in G[cur][\"in\"]:\r\n if nxt != prev:\r\n flag = 0\r\n prev = cur\r\n reverse = (nxt, cost)\r\n cur = nxt\r\n c2 += cost\r\n break\r\n if flag:\r\n G[prev][\"out\"].remove(reverse)\r\n G[prev][\"in\"].add(reverse)\r\n else:\r\n G[prev][\"in\"].remove(reverse)\r\n G[prev][\"out\"].add(reverse)\r\n if cur == 1:\r\n break\r\n\r\nans = min(c1, c2)\r\nwrite(ans)", "def findNextPath(matrix, path, index):\r\n for i in range(len(matrix)):\r\n if matrix[index][i] != 0 and i not in path or \\\r\n matrix[i][index] != 0 and i not in path:\r\n return i\r\n return -1\r\n\r\n\r\nn = int(input())\r\nmatrix = [[0] * n for i in range(n)]\r\nfor i in range(n):\r\n city1, city2, price = [int(item) for item in input().split(' ')]\r\n matrix[city1 - 1][city2 - 1] = price\r\npath = [0]\r\nindex = findNextPath(matrix, path, 0)\r\nwhile index != -1:\r\n path.append(index)\r\n index = findNextPath(matrix, path, index)\r\ncw = matrix[path[n - 1]][0]\r\nacw = matrix[0][path[n - 1]]\r\ni, j = 0, n - 1\r\nwhile i < n - 1:\r\n cw += matrix[path[i]][path[i + 1]]\r\n acw += matrix[path[j]][path[j - 1]]\r\n i += 1\r\n j -= 1\r\nprint(cw if cw < acw else acw)\r\n", "import sys; R = sys.stdin.readline\r\nS = lambda: map(int,R().split())\r\n\r\nn = int(R())\r\nd,e,r,p = [[] for _ in range(n+1)],[],0,0\r\nfor i in range(n):\r\n u,v,w = S()\r\n r += w; e += (u,v,w),\r\n d[u] += i,; d[v] += i,\r\nu,j = e[0][0],0\r\nfor _ in range(n):\r\n u = e[j][1]+e[j][0]-u\r\n d[u].remove(j)\r\n try: j = d[u][0]\r\n except: break\r\n if e[j][0]!=u: p += e[j][2]\r\nprint(min(p,r-p))", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\nn=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(list(map(int,input().split())))\r\nd={}\r\nadj=[[] for t in range(n+1)]\r\nfor ele in l:\r\n a , b , val= ele\r\n adj[a].append([b,val])\r\n adj[b].append([a,val])\r\n d[(a,b)]=val\r\nvisited=[0 for t in range(n+1)]\r\nvisited[1]=1\r\n\r\n'''print(d)\r\nprint(adj)'''\r\ncost1=0\r\ncurrent=1\r\nnxt=adj[1][0][0]\r\nwhile 1:\r\n #print(type((current,nxt)),type(current),type(nxt))\r\n if (current,nxt) not in d:\r\n cost1+=d[(nxt,current)]\r\n visited[nxt]=1\r\n flag=0\r\n for ele in adj[nxt]:\r\n nei=ele[0]\r\n if visited[nei]==0:\r\n flag=1\r\n current=nxt\r\n nxt=nei\r\n if flag==0:\r\n if (nxt,1) not in d:\r\n cost1+=d[(1,nxt)]\r\n break\r\n \r\n \r\nvisited=[0 for t in range(n+1)]\r\nvisited[1]=1 \r\ncost2=0\r\ncurrent=1\r\nnxt=adj[1][1][0]\r\nwhile 1:\r\n if (current,nxt) not in d:\r\n cost2+=d[(nxt,current)]\r\n visited[nxt]=1\r\n flag=0\r\n for ele in adj[nxt]:\r\n nei=ele[0]\r\n if visited[nei]==0:\r\n flag=1\r\n current=nxt\r\n nxt=nei\r\n if flag==0:\r\n if (nxt,1) not in d:\r\n cost2+=d[(1,nxt)]\r\n break \r\nprint(min(cost2,cost1))\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\ne = [[] for i in range(n + 1)]\r\ndef s(x, c):\r\n p = 1\r\n for i in range(n - 1):\r\n j = p == e[x][0][0]\r\n p = x\r\n x, c = e[x][j][0], c + e[x][j][1]\r\n return c\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n e[a].append((b, 0))\r\n e[b].append((a, c))\r\nprint(min(s(*e[1][0]), s(*e[1][1])))", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\n#def input(): return sys.stdin.readline().strip()\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nN = int(input())\r\nA = []\r\ncost = {}\r\nfor i in range(N):\r\n a,b,c = ilele()\r\n cost[(b,a)] = c\r\n A.append((a,b))\r\n\r\nB = [*A[0]]\r\ni = 1\r\nwhile True:\r\n f = 0\r\n for j in range(len(A)):\r\n if A[j][0] == B[i]:\r\n B.append(A[j][1])\r\n i+=1;f = 1\r\n del A[j]\r\n break\r\n elif A[j][1] == B[i]:\r\n B.append(A[j][0])\r\n i+=1;f = 1\r\n del A[j]\r\n break\r\n if not f:\r\n break\r\ni = 0\r\nwhile True:\r\n f = 0\r\n for j in range(len(A)):\r\n if A[j][0] == B[i]:\r\n B.insert(0,A[j][1])\r\n f = 1\r\n del A[j]\r\n break\r\n elif A[j][1] == B[i]:\r\n B.insert(0,A[j][0])\r\n f = 1\r\n del A[j]\r\n break\r\n if not f:\r\n break\r\nB = B[1:]\r\n#print(B)\r\nans1 = 0;ans2 = 0\r\nfor i in range(1,len(B)):\r\n ans1 += cost.get((B[i],B[i-1]),0)\r\n ans2 += cost.get((B[i-1],B[i]),0)\r\nprint(min(ans1,ans2))\r\n", "n = int(input())\r\nroads = []\r\nfor i in range(n):\r\n roads.append(list(map(int,input().split())))\r\nfor i in range(len(roads)):\r\n for j in range(i+1,len(roads)):\r\n if roads[i][0]==roads[j][0] or roads[i][0]==roads[j][1] or \\\r\n roads[i][1]==roads[j][0] or roads[i][1]==roads[j][1]:\r\n roads[i+1], roads[j] = roads[j], roads[i+1]\r\n break\r\nf,c1,c2 = False,roads[0][2],0\r\nfor r in range(1,len(roads)):\r\n if roads[r][0] == roads[r-1][1] or roads[r][1] == roads[r-1][0]:\r\n if f == False:\r\n c1 += roads[r][2]\r\n #print('1',roads[r])\r\n else:\r\n c2 += roads[r][2]\r\n #print('2',roads[r])\r\n else:\r\n if f == False:\r\n c2 += roads[r][2]\r\n #print('2',roads[r])\r\n f = True\r\n else:\r\n c1 += roads[r][2]\r\n #print('1',roads[r])\r\n f = False\r\nprint(min(c1,c2))", "############ ---- Input Functions and Setup ---- ############\r\nimport sys\r\nimport math\r\nfrom collections import Counter, defaultdict, deque\r\nfrom functools import cmp_to_key\r\n\r\ndef inp(): # int input\r\n return(int(input()))\r\ndef inlt(): # int list input\r\n return(list(map(int,input().split())))\r\ndef insr(): # string input -> char list\r\n s = input()\r\n return(list(s[:len(s)]))\r\ndef invr(): # a b c input\r\n return(map(int,input().split()))\r\n####################################################\r\nn=inp()\r\nreversed=defaultdict(list)\r\nadjList=defaultdict(list)\r\ntotCost=0\r\nstart=-1\r\nfor _ in range(n):\r\n a,b,c=invr()\r\n if start==-1:start=a\r\n adjList[a].append((b,c))\r\n reversed[b].append((a,c))\r\n totCost+=c\r\n\r\ncostA=0\r\ndone=False\r\nstack=[(start,-1)]\r\nvisited=0\r\nwhile stack:\r\n #visited+=1\r\n #print(stack,adjList[stack[0][0]],reversed[stack[0][0]],costA,visited)\r\n node,parent = stack.pop()\r\n \r\n children = adjList[node]\r\n childVisited=False\r\n for c,cost in children:\r\n if c!=parent:\r\n childVisited=True\r\n stack.append((c,node))\r\n break\r\n if not childVisited:\r\n parents = reversed[node]\r\n for p,cost in parents:\r\n if p != parent:\r\n costA+=cost\r\n stack.append((p,node))\r\n break\r\n if node==start and done:break\r\n if node==start:done=True\r\n\r\n#print(costA,totCost)\r\nprint(min(costA,totCost-costA))\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\nforward = [False]*n\nbackward = [False]*n\nclock = 0\nantiClock = 0\nfor i in range(n):\n a, b, c = map(int,input().split())\n \n if forward[a-1] or backward[b-1]:\n clock+=c\n forward[b-1]=True\n backward[a-1]=True\n else:\n antiClock+=c\n forward[a-1]=True\n backward[b-1]=True\n\n\nprint(min(clock,antiClock))\n\n\n\t\t\t\t \t\t \t\t\t \t\t \t \t \t \t \t \t", "from collections import defaultdict\n\nn = int(input())\ngraph = defaultdict(dict)\n\ndef count(a, b, graph):\n result = 0\n\n used = set()\n for _ in range(n):\n used.add((a, b))\n used.add((b, a))\n\n result += graph[a][b]\n\n a = b\n for b in graph[a].keys():\n if (a, b) not in used:\n break\n\n return result\n\n\nfor _ in range(n):\n a, b, c = [int(e) for e in input().split()]\n\n graph[a][b] = 0\n graph[b][a] = c\n\n\nprint(min(count(a, b, graph), count(b, a, graph)))\n", "n = int(input())\n\ncnt1 = [0] * (n + 1)\ncnt2 = [0] * (n + 1)\nss = 0\ns1 = 0\nd1 = {}\nd2 = {}\nfor _ in range(n):\n aa,bb,cc = list(map(int, input().split()))\n \n if (aa in d1 or bb in d2):\n aa,bb = bb,aa\n s1 += cc\n d1[aa] = 1\n d2[bb] = 1\n ss += cc\n\nprint(min(s1, ss - s1))\n", "s, e = [0] * 101, [0] * 101\r\nsum, val = (0, 0)\r\nfor _ in range(int(input())):\r\n a, b, c = map(int,input().split())\r\n if s[a] or e[b]: val += c; s[b] = e[a] = 1\r\n else: s[a] = e[b] = 1\r\n sum += c\r\nprint(min(val, sum - val))\r\n", "n=int(input())\r\nq=[]\r\n\r\nfor t in range(n):\r\n q.append(list(map(int,input().split())))\r\npor=[q[0][0],q[0][1]]\r\nz=[1]\r\nprice=[q[0][2]]\r\nq.pop(0)\r\nfor x in range(n):\r\n for y in range(len(q)):\r\n if q[y][0]==por[len(por)-1]:\r\n por.append(q[y][1])\r\n z.append(1)\r\n price.append(q[y][2])\r\n q.pop(y)\r\n break\r\n if q[y][1]==por[len(por)-1]:\r\n por.append(q[y][0])\r\n z.append(0)\r\n price.append(q[y][2])\r\n q.pop(y)\r\n break\r\nedin=0\r\nnol=0\r\n \r\nfor x in range(n):\r\n if z[x]==1:\r\n edin=edin+price[x]\r\n else:\r\n nol=nol+price[x]\r\nprint(min(nol,edin))", "from collections import *\r\n# from math import ceil, gcd,inf\r\nfrom functools import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip() # faster!\r\n\r\nZ=int(input());f=1;stack=deque()\r\nfor _ in range(Z):\r\n a,b,c=map(int,input().split())\r\n if f:\r\n f=0;arr=deque([a,b]);dir=deque([1]);cos=deque([c])\r\n else:stack.append((a,b,c)) \r\nwhile stack: \r\n a,b,c=stack.popleft() \r\n if arr[-1]==a:arr.append(b);dir.append(1);cos.append(c)\r\n elif arr[-1]==b:arr.append(a);dir.append(0);cos.append(c)\r\n elif arr[0]==b: arr.appendleft(a);dir.appendleft(1);cos.appendleft(c)\r\n elif arr[0]==a: arr.appendleft(b);dir.appendleft(0);cos.appendleft(c)\r\n else:stack.append((a,b,c))\r\ncos1=0;cos2=0\r\nfor i in range(len(dir)):\r\n if dir[i]:cos1+=cos[i]\r\n else:cos2+=cos[i] \r\n# print(arr,dir,cos) \r\nprint(min(cos1,cos2)) ", "# author \r\n# Kidus Guade\r\n\r\nimport sys\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log, ceil,lcm\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\ndef ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef li(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef li_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n \r\ndef solve():\r\n n = get_int()\r\n cost = Counter()\r\n graph = defaultdict(list)\r\n for i in range(n):\r\n a, b, c = ints()\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n cost[(a, b)] = c\r\n par = 1\r\n cur = graph[1][0]\r\n ans1 = 0\r\n\r\n if (par, cur) not in cost:\r\n ans1 = cost[(cur, par)]\r\n\r\n for i in range(n - 1):\r\n if graph[cur][0] == par:\r\n par = cur\r\n cur = graph[cur][1]\r\n elif graph[cur][1] == par:\r\n par = cur\r\n cur = graph[cur][0]\r\n \r\n if (par, cur) not in cost:\r\n ans1 += cost[(cur, par)]\r\n par = graph[1][0]\r\n cur = 1\r\n ans2 = 0\r\n \r\n if (par, cur) not in cost:\r\n ans2 = cost[(cur, par)]\r\n \r\n for i in range(n - 1):\r\n \r\n if graph[cur][0] == par:\r\n par = cur\r\n cur = graph[cur][1]\r\n else:\r\n par = cur\r\n cur = graph[cur][0]\r\n \r\n if (par, cur) not in cost:\r\n ans2 += cost[(cur, par)]\r\n return min(ans1, ans2)\r\n \r\n\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n \r\n print(solve())", "n=int(input())\r\ns1,s2=0,0\r\nl1,l2=[],[]\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if(a in l1 or b in l2):\r\n a,b=b,a\r\n s1+=c\r\n else:\r\n s2+=c\r\n l1.append(a)\r\n l2.append(b)\r\nprint(min(s1,s2))", "# our function\r\ndef find_next_path(cont, N, path, indx):\r\n for i in range(N):\r\n if cont[indx][i] != 0 and i not in path or \\\r\n cont[i][indx] != 0 and i not in path:\r\n return i\r\n\r\n return -1\r\n\r\n\r\n# end of fuction\r\nN = int(input())\r\ncont = [[0] * N for i in range(N)]\r\nfor i in range(N):\r\n a, b, price = [int(item) for item in input().split()]\r\n cont[a - 1][b - 1] = price\r\n\r\npath = [0]\r\nnindx = find_next_path(cont, N, path, 0)\r\nwhile nindx != -1:\r\n path.append(nindx)\r\n nindx = find_next_path(cont, N, path, path[len(path) - 1])\r\n\r\nCW = cont[path[N - 1]][0]\r\nACW = cont[0][path[N - 1]]\r\ni, j = 0, N - 1\r\nwhile i < N - 1:\r\n CW += cont[path[i]][path[i + 1]]\r\n ACW += cont[path[j]][path[j - 1]]\r\n i += 1\r\n j -= 1\r\n\r\nprint(CW if ACW > CW else ACW)\r\n\r\n", "A = set()\r\nB = set()\r\ncost1 = 0\r\ncost2 = 0\r\ndef swap(a,b):\r\n a,b = b,a\r\n return a,b\r\nn = int(input())\r\nfor i in range(n):\r\n a,b,c = map(int,input().split())\r\n if (a in A) or (b in B):\r\n a,b = swap(a,b)\r\n cost1 += c\r\n else:\r\n cost2 += c\r\n A.add(a)\r\n B.add(b)\r\nprint(min(cost1,cost2))", "def count(origin,parent,check,roads,tree):\r\n # print(\"parent is\",parent)\r\n if check == origin:\r\n return 0 \r\n else:\r\n if tree[check - 1][0] != parent:\r\n return roads[check-1][tree[check-1][0]-1] + count(origin,check,tree[check-1][0],roads,tree)\r\n else:\r\n return roads[check-1][tree[check-1][1]-1] + count(origin,check,tree[check-1][1],roads,tree)\r\n \r\n \r\n \r\n \r\n \r\ndef Ring_road():\r\n cities = int(input())\r\n roads = [[0 for i in range(cities)] for i in range(cities)]\r\n tree = [[] for i in range(cities)]\r\n for i in range(cities):\r\n start,end,cost = map(int,input().split())\r\n roads[end-1][start-1] = cost\r\n tree[start-1].append(end)\r\n tree[end-1].append(start)\r\n # print(roads)\r\n # print(tree)\r\n return min(roads[0][tree[0][0]-1] + count(1,1,tree[0][0],roads,tree),roads[0][tree[0][1]-1] + count(1,1,tree[0][1],roads,tree))\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\nremaing_test_cases = 1 \r\n# remaing_test_cases = int(input())\r\nwhile remaing_test_cases > 0:\r\n print(Ring_road())\r\n remaing_test_cases = remaing_test_cases - 1 \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\nd = [[] for i in range(n+1)]\r\nw = []\r\nl, r = 0, 0\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n d[a].append((b, i))\r\n d[b].append((a, i))\r\n w.append((a, b, c))\r\n\r\nq = w[0][0]\r\nx = w[0][1]\r\nl += w[0][2]\r\na = q\r\nwhile 1:\r\n a1 = 0\r\n x1 = 0\r\n for (i, j) in d[x]:\r\n if i != a:\r\n s1, s2, s3 = w[j]\r\n if s1 == x:\r\n l += s3\r\n else:\r\n r += s3\r\n\r\n a1, x1 = x, i\r\n a, x = a1, x1\r\n if x == q:\r\n break\r\nprint(min(l, r))", "\n\nn = int(input())\n\nG = [[] for _ in range(n)]\ntotal_cost = 0\n\nfor _ in range(n):\n a, b, c = map(int, input().split())\n total_cost += c\n G[a - 1] += [(b - 1, 0)]\n G[b - 1] += [(a - 1, c)]\n\ntravel_cost = 0\nstart = 0\nprev = start\ncurrent = G[prev][0][0]\ntravel_cost += G[prev][0][1]\n\nwhile current != start:\n if G[current][0][0] == prev:\n travel_cost += G[current][1][1]\n prev, current = current, G[current][1][0]\n else:\n travel_cost += G[current][0][1]\n prev, current = current, G[current][0][0]\n\nprint(min([travel_cost, total_cost - travel_cost]))\n", "def solve():\r\n\tn = int(input())\r\n\tx = 0\r\n\ty = 0\r\n\td = {}\r\n\tg = [[] for _ in range(n + 1)]\r\n\tfor i in range(n):\r\n\t\ta, b, c = map(int, input().split())\r\n\t\td[(a, b)] = 0\r\n\t\td[(b, a)] = c\r\n\t\tg[a].append(b)\r\n\t\tg[b].append(a)\r\n\ts = 1\r\n\tpre = g[1][0]\r\n\tseen = set()\r\n\twhile s not in seen:\r\n\t\tseen.add(s)\r\n\t\tnex = g[s][0]\r\n\t\tif nex == pre:\r\n\t\t\tnex = g[s][1]\r\n\t\tx += d[(s, nex)]\r\n\t\ty += d[(nex, s)]\r\n\t\tpre, s = s, nex\r\n\tprint(min(x, y))\r\n\r\n\r\nsolve()", "# -*- coding: utf-8 -*-\n\"\"\"ring road.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ls2CdNi1Ub6YeK8uXmt2CMSuZ16jdAlK\n\"\"\"\n\nn = int(input())\nsrc=0\nvisited = [0 for i in range(n+1)]\nDATA = [list(map(int, input().split())) for i in range(n)]\n\nadj = [[0 for i in range(n+1)] for j in range(n+1)]\ncost = [[0 for i in range(n+1)] for j in range(n+1)]\n\nfor i in range(n) :\n here=DATA[i][0]\n there=DATA[i][1]\n val=DATA[i][2]\n adj[here][there]=1\n adj[there][here]=1\n cost[here][there]=0\n cost[there][here]=val\n\ndef isAllConnected():\n s=0\n for i in range(1,n+1):\n if visited[i]==1:\n s+=1\n return s\n\ndef dfs(here) :\n visited[here]=1\n if isAllConnected()==n :\n return cost[here][src]\n ret=0\n for there in range(1,n+1):\n if adj[here][there]==1 and visited[there]==0 :\n ret=dfs(there)+cost[here][there]\n return ret\n\nans=99999999\n\nfor i in range(1,n+1) :\n for j in range(1,n+1):\n visited[j]=0\n src=i\n ans=min(ans, dfs(i))\n\nprint(ans)", "n=int(input())\nsuma,cost=0,0\nx,y=[0 for i in range(n)],[0 for j in range(n)]\n\nfor i in range(n):\n a,b,c=map(int,input().split())\n suma+=c\n a,b=a-1,b-1\n if x[a] or y[b]:\n x[b]=1\n y[a]=1\n cost+=c\n else:\n x[a]=1\n y[b]=1\n\nif suma-cost>=cost:\n print(cost)\n\nelse:\n print(suma-cost)\n\n\n\n\n \t\t\t\t \t \t\t\t\t \t\t \t\t \t\t\t \t\t", "n = int(input())\r\nlst = []\r\n\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n lst.append([a,b,c])\r\npos1, pos2, f1, f2 = lst[0][1], lst[0][0], lst[0][0], lst[0][1]\r\nsc1, sc2 = 0, lst[0][2]\r\ndel lst[0]\r\nlst2 = lst*1\r\nwhile pos1 != f1:\r\n for x in range(len(lst)):\r\n if lst[x][0] == pos1:\r\n pos1 = lst[x][1]\r\n del lst[x]\r\n break\r\n if lst[x][1] == pos1:\r\n pos1 = lst[x][0]\r\n sc1 += lst[x][2]\r\n del lst[x]\r\n break\r\n\r\nwhile pos2 != f2:\r\n for x in range(len(lst2)):\r\n if lst2[x][0] == pos2:\r\n pos2 = lst2[x][1]\r\n del lst2[x]\r\n break\r\n if lst2[x][1] == pos2:\r\n pos2 = lst2[x][0]\r\n sc2 += lst2[x][2]\r\n del lst2[x]\r\n break\r\nprint(min(sc1, sc2))\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nm = [[0 for i in range(n+1)] for j in range(n+1)]\ndef fcost(m):\n node = 1\n f_c = 0\n f_b = 0\n while True:\n for i in range(1, n+1):\n if m[node][i]:\n f_b += m[node][i]\n m[node][i] = 0\n node = i\n break\n else:\n for i in range(1, n+1):\n if m[i][node]:\n f_c += m[i][node]\n m[i][node] = 0\n node = i\n break\n else:\n break\n return min(f_c, f_b)\n\nfor i in range(n):\n u, v, w = map(int, input().split())\n m[u][v] = w\n\nprint(fcost(m))\n\n \t\t\t\t\t\t \t \t\t\t \t \t\t\t \t", "n = int(input())\nl = []\nfor _ in range(n):\n a,b,c = input().split()\n l.append((int(a),int(b),int(c)))\n(a,b,c) = l[0]\nl.pop(0)\ndef f(b,x,y):\n if l!=[]:\n for (p,q,t) in l:\n if p==b:\n l.remove((p,q,t))\n return f(q,x+t,y)\n if q==b:\n l.remove((p,q,t))\n return f(p,x,y+t)\n else:\n return min(x,y)\nprint(f(b,c,0))\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\ni=0\r\nb=[]\r\nc=0\r\nfor k in range(n):\r\n b.append(a[i][c])\r\n for j in range(n):\r\n if i!=j and a[i][1-c] in a[j][:2]:\r\n if a[i][1-c]==a[j][0]:\r\n c=0\r\n else:\r\n c=1\r\n i=j\r\n break\r\nb+=[b[0]]\r\nc1,c2=0,0\r\nfor i in range(1,n+1):\r\n for j in range(n):\r\n if a[j][:2]==[b[i],b[i-1]]:\r\n c1+=a[j][2]\r\n elif a[j][:2]==[b[i-1],b[i]]:\r\n c2+=a[j][2]\r\nprint(min(c1,c2))", "import re\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\n\r\nP = [[-1]*N for _ in range(N)]\r\nlinks = [[] for _ in range(N)]\r\n\r\ndef paint(v):\r\n ans = 0\r\n seen = set()\r\n while v:\r\n i,p = v.pop()\r\n if i in seen:continue\r\n seen.add(i)\r\n ans+=P[p][i]\r\n\r\n for j in links[i]:\r\n if j==p:continue\r\n v.append((j,i))\r\n return ans\r\n\r\nfor _ in range(N):\r\n a,b,c = map(int, input().split())\r\n a-=1;b-=1\r\n P[a][b]=0\r\n P[b][a]=c\r\n links[a].append(b)\r\n links[b].append(a)\r\n\r\nans = float('inf')\r\nfor i in links[0]:\r\n v = [(i,0)]\r\n ans = min(ans, paint(v))\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nset1 = set()\r\nset2 = set()\r\ncost = 0\r\ns = 0\r\nfor i in range(n):\r\n a,b,c = map(int,input().split())\r\n s+=c\r\n if a in set1:\r\n a,b = b,a\r\n cost+=c\r\n elif b in set2:\r\n a,b = b,a\r\n cost+=c\r\n set1.add(a)\r\n set2.add(b)\r\n\r\nprint(min(cost,s-cost))\r\n", "n=int(input())\r\nd=[[] for i in range(n+1)]\r\n\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n d[a].append([b,1,c])\r\n d[b].append([a,-1,c])\r\n\r\n\r\ns=[1]\r\nv=[0]*(n+1)\r\nr=0\r\nx=0\r\nwhile(s):\r\n m=s.pop()\r\n v[m]=1\r\n if v[d[m][0][0]]==1 and v[d[m][1][0]]==1:\r\n pass\r\n elif v[d[m][0][0]]==0:\r\n s.append(d[m][0][0])\r\n if d[m][0][1]==-1:\r\n r+=d[m][0][2]\r\n else:\r\n x+=d[m][0][2]\r\n elif v[d[m][1][0]] == 0:\r\n s.append(d[m][1][0])\r\n if d[m][1][1] == -1:\r\n r += d[m][1][2]\r\n else:\r\n x+=d[m][1][2]\r\nif d[m][0][0]==1:\r\n if d[m][0][1] == -1:\r\n r += d[m][0][2]\r\n else:\r\n x += d[m][0][2]\r\n\r\n\r\nelse:\r\n if d[m][1][1] == -1:\r\n r += d[m][1][2]\r\n else:\r\n x += d[m][1][2]\r\n\r\n\r\n\r\nprint(min(r,x))\r\n\r\n\r\n", "def findpath(psgs, cNum, path, n):\r\n for col in range(n):\r\n if psgs[cNum][col] !=0 and col not in path :\r\n return col\r\n\r\n for row in range(n):\r\n if psgs[row][cNum] !=0 and row not in path :\r\n return row\r\n\r\n return -1\r\n\r\n\r\n\r\nN = int(input())\r\npassages = []\r\nfor i in range(N):\r\n '''localarr = []\r\n for j in range(N):\r\n localarr.append(0)\r\n passages.append(localarr)'''\r\n passages.append([0 for j in range(N)])\r\n\r\n\r\nfor j in range(N):\r\n temp = [int(i) for i in input().split(' ')]\r\n passages[temp[0] - 1][temp[1] - 1] = temp[2]\r\n\r\npath = [0]\r\nfor i in range(N-1):\r\n path.append(findpath(passages,path[len(path)-1],path,N))\r\n\r\nclockwise = 0\r\nanticlockwise = 0\r\nfor i in range(N-1):\r\n clockwise += passages[path[i]][path[i+1]]\r\n\r\nclockwise = clockwise + passages[path[N-1]][0]\r\nanticlockwise += passages[0][path[N-1]]\r\nfor i in range(N-1,0,-1):\r\n anticlockwise += passages[path[i]][path[i-1]]\r\n\r\nprint(min(clockwise,anticlockwise))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys,math\r\nn=int(sys.stdin.readline())\r\nstart =[]\r\nend=[]\r\nans1=0\r\nans2=0\r\nfor i in range(n):\r\n a,b,c=map(int,sys.stdin.readline().split())\r\n if (a in start) or (b in end):\r\n ans1+=c\r\n start.append(b)\r\n end.append(a)\r\n else:\r\n ans2+=c \r\n start.append(a)\r\n end.append(b)\r\nprint(min(ans1,ans2)) \r\n ", "\r\n\r\ndef dfs(node):\r\n global total\r\n marked[node] = True\r\n for n in graph[node]:\r\n if not marked[n[0]]:\r\n if n[2]:\r\n total += n[1]\r\n dfs(n[0])\r\n \r\n\r\n\r\nN = int(input())\r\ngraph = [[] for i in range(100)]\r\n\r\nfor i in range(N):\r\n a, b, c = [int(x) for x in input().split()]\r\n graph[a-1].append([b-1,c, False])\r\n graph[b-1].append([a-1,c, True])\r\n\r\n\r\n\r\ntemp = graph[0].pop(0)\r\nmarked = [False] * 100\r\nif not temp[2]:\r\n total = temp[1]\r\nelse:\r\n total = 0\r\ndfs(0)\r\nleft = total\r\n\r\ngraph[0].append(temp)\r\ntemp = graph[0].pop(0)\r\nmarked = [False] * 100\r\nif not temp[2]:\r\n total = temp[1]\r\nelse:\r\n total = 0\r\ndfs(0)\r\nright = total\r\n\r\nprint(min(left, right))", "def dfs(road):\n global visited, pos, neg, roads\n visited[road[0]] = True\n if road[1] >= 0:\n pos += road[1]\n else:\n neg -= road[1]\n for childRoad in roads[road[0]]:\n if not visited[childRoad[0]]:\n dfs(childRoad)\n\n\n\nn = int(input())\n\ndic = {}\nroads = [[] for _ in range(n)]\nvisited = [False] * n\n\n\nfor _ in range(n):\n a, b, cost = map(int, input().split())\n roads[a-1].append((b-1, cost))\n roads[b-1].append((a-1, -cost))\n\npos, neg = 0, 0\nvisited[0] = True\ndfs(roads[0][0])\n\nif roads[0][1][1] >= 0:\n neg += roads[0][1][1]\nelse:\n pos -= roads[0][1][1]\nprint(min(pos, neg))\n\n\n\t \t \t \t \t\t \t\t \t \t\t\t \t \t\t", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\nI = lambda : int(sys.stdin.buffer.readline())\r\nNeo = lambda : list(map(int, sys.stdin.buffer.readline().split()))\r\nn = I()\r\ncost = defaultdict(list)\r\nG = defaultdict(list)\r\nC = defaultdict(list)\r\nfor _ in range(n):\r\n a,b,c = Neo()\r\n cost[(a,b)] += [0,c]\r\n cost[(b,a)] += [1,c]\r\n G[a].append(b)\r\n G[b].append(a)\r\nvis = [0]*(n+1)\r\npath = []\r\ndef hello(node):\r\n path.append(node)\r\n vis[node] = 1\r\n for i in G[node]:\r\n if not vis[i]:\r\n hello(i)\r\nhello(1)\r\npath.append(path[0])\r\nAns1,Ans2 = 0,0\r\nfor i,j in zip(path,path[1:]):\r\n if cost[(i,j)][0] == 0:\r\n Ans1 += cost[(i,j)][1]\r\n else:\r\n Ans2 += cost[(i,j)][1]\r\nprint(min(Ans1,Ans2)) \r\n\r\n", "n=int(input())\r\narr=[]\r\nbrr=[]\r\nx=0\r\ny=0\r\nfor i in range(n):\r\n a,b,c=[int(i) for i in input().split()]\r\n if a in arr:\r\n k=a\r\n a=b\r\n b=k\r\n y=y+c\r\n elif b in brr:\r\n k=b\r\n b=a\r\n a=k\r\n y=y+c\r\n x=x+c\r\n arr.append(a)\r\n brr.append(b)\r\nprint(min(y,x-y))\r\n", "from sys import stdin\nfrom collections import defaultdict\ninput = stdin.readline\n\nnode_size = int(input())\n# cost = [defaultdict(lambda: float('inf')) for i in range(node_size+1)]\ncost = [{} for i in range(node_size+1)]\nfor _ in range(node_size):\n u,v,c = map(int,input().split())\n cost[u][v] = 0\n cost[v][u] = c\n\nhas_visited = [False for _ in range(node_size+1)]\nhas_visited[0] = True # dumb node\n\ndef find_node(node:int,cur_cost:int,origin_node:int)-> int : \n # print(f\"node={node}\") # debug \n has_visited[node] = True\n if all(has_visited):\n has_visited[node] = False\n return cur_cost + cost[node][origin_node]\n min_cost = float('inf')\n for next_node in cost[node]:\n if not has_visited[next_node]:\n min_cost = min(min_cost,\n find_node(next_node,cur_cost+cost[node][next_node],origin_node)\n )\n has_visited[node] = False\n return min_cost\n\n# scheme_cost = float('inf')\n# for begin in range(1,node_size+1):\n # scheme_cost = min(scheme_cost,\n # find_node(begin,0,begin)\n # )\nscheme_cost = find_node(1,0,1)\nprint(scheme_cost)\n\n\n\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, s = map(int, input().split())\r\ndata = [dict() for _ in range(n)]\r\n\r\nfor i in range(n):\r\n k, *a = map(int, input().split())\r\n cur = 0\r\n for j in range(0, 2 * k, 2):\r\n data[i][cur] = a[j]\r\n cur += a[j + 1]\r\n\r\n data[i][cur] = 0\r\n\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n state1 = 0\r\n dist_i, dist_j = 0, 0\r\n speed_i, speed_j = 0, 0\r\n time = sorted(set(data[i].keys()) | set(data[j].keys()))\r\n for t1, t2 in zip(time, time[1:]):\r\n if t1 in data[i]:\r\n speed_i = data[i][t1]\r\n if t1 in data[j]:\r\n speed_j = data[j][t1]\r\n\r\n dist_i += (t2 - t1) * speed_i\r\n dist_j += (t2 - t1) * speed_j\r\n state2 = 0 if dist_i == dist_j else 1 if dist_i > dist_j else 2\r\n\r\n if state2 != 0:\r\n if state1 | state2 == 3:\r\n ans += 1\r\n state1 = state2\r\n if dist_i == s or dist_j == s:\r\n break\r\n\r\nprint(ans)\r\n", "import sys\n\nreadline = sys.stdin.readline\n\nN, S = 0, 0\ncars = []\n\n# input \ndef read():\n global N, S\n N, S = list(map(int, readline().split()))\n for i in range(N):\n nums = list(map(int, readline().split()))\n cars.append([])\n carid = len(cars)\n t0 = 0\n for i in range(1, len(nums), 2):\n v, t = nums[i], nums[i + 1]\n cars[-1].append((t0, v, carid))\n t0 += t\n cars[-1].append((t0, 0, carid))\n\n# solve\ndef solve(cars:list) -> int:\n def calc(car1:list, car2:list) -> int:\n result = 0\n car1_id = car1[0][-1]\n v1, v2 = car1[0][1], car2[0][1]\n ahead = -1\n t = p1 = p2 = 0\n que = car1[1:] + car2[1:]\n que.sort()\n for t0, v, i in que:\n p2 += (t0 - t) * v2\n p1 += (t0 - t) * v1\n t = t0\n if i == car1_id:\n v1 = v\n else:\n v2 = v\n if p1 > p2:\n result += int(ahead == 2)\n ahead = 1\n elif p1 < p2:\n result += int(ahead == 1)\n ahead = 2\n return result\n result = 0\n for i in range(N):\n for j in range(i + 1, N):\n result += calc(cars[i], cars[j])\n return result\n\nread()\nprint(solve(cars))" ]

[ "def main():\r\n t = int(input())\r\n for _ in range(t):\r\n n, m, x1, y1, x2, y2 = map(int, input().split())\r\n rect_x, rect_y = n - abs(x2 - x1), m - abs(y2 - y1)\r\n area = n * m - 2 * rect_x * rect_y + max(0, rect_x * 2 - n) * max(0, rect_y * 2 - m)\r\n print(area)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys; R = sys.stdin.readline\r\nfor _ in range(int(R())):\r\n n,m,x1,y1,x2,y2 = map(int,R().split())\r\n a,b = n-abs(x1-x2),m-abs(y1-y2)\r\n print(n*m-2*a*b+(2*a-n if 2*a>n else 0)*(2*b-m if 2*b>m else 0))", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n t = int(input())\r\n while t:\r\n run()\r\n t -= 1\r\n\r\n\r\ndef run():\r\n n, m, x1, y1, x2, y2 = map(int, input().split())\r\n width, height = abs(x1 - x2), abs(y1 - y2)\r\n count = width * height * 2\r\n x, y = width * 2 - n, height * 2 - m\r\n if not (x < 0 and y < 0):\r\n count -= x * y\r\n print(count)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "#codeforces 15b laser, math\r\n\r\ndef readGen(transform):\r\n\twhile (True):\r\n\t\tn=0\r\n\t\ttmp=input().split()\r\n\t\tm=len(tmp)\r\n\t\twhile (n<m):\r\n\t\t\tyield(transform(tmp[n]))\r\n\t\t\tn+=1\r\n\r\nreadint=readGen(int)\r\n\r\ndef work():\r\n\tn,m=next(readint),next(readint)\r\n\tx1,y1=next(readint),next(readint)\r\n\tx2,y2=next(readint),next(readint)\r\n\tl=min(x1-1,x2-1)\r\n\tr=min(n-x1,n-x2)\r\n\tu=min(y1-1,y2-1)\r\n\td=min(m-y1,m-y2)\r\n\t\r\n\tw=l+r-abs(x1-x2)+1\r\n\th=u+d-abs(y1-y2)+1\r\n\tif (w<=0 or h<=0): a=0\r\n\telse: a=h*w\r\n\t\r\n\tcover=2*(l+r+1)*(u+d+1)-a\r\n\tprint(m*n-cover)\r\n\t\r\nn=next(readint)\r\nfor i in range(n):\r\n\twork()\r\n", "for i in range(int(input())):\r\n n, m, x1, y1, x2, y2 = map(int, input().split())\r\n w,h=abs(x2-x1),abs(y2-y1)\r\n if w*2>n or h*2>m:\r\n print(n*m-2*(n-w)*(m-h))\r\n else:\r\n print(2*w*h) \r\n", "\n\n\nn = int(input())\n\nfor i in range(n):\n n, m, x1, y1, x2, y2 = map(int, input().split())\n\n #print(n, m, x1, y1, x2, y2)\n\n if x1 <= x2 and y1 <= y2:\n pass\n elif x1 >= x2 and y1 >= y2:\n x1, y1, x2, y2 = x2, y2, x1, y1\n else:\n x1, y1, x2, y2 = x2, y1, x1, y2\n\n if x1 <= x2 and y1 <= y2:\n pass\n elif x1 >= x2 and y1 >= y2:\n x1, y1, x2, y2 = x2, y2, x1, y1\n \n #print(n, m, x1, y1, x2, y2)\n\n\n print(n*m - ((n - (x2 - x1)) * (m - (y2 - y1)) * 2 - max(0, (n - (x2 - x1)) * 2 - n) * max(0, (m - (y2 - y1)) * 2 - m)))\n\n\n\t\n#printf(\"%d\\n\", ($n * $m) - (($n - ($x2 - $x1)) * ($m - ($y2 - $y1)) * 2 \n#- max(0, ($n - ($x2 - $x1)) * 2 - $n) * max(0, ($m - ($y2 - $y1)) * 2 - $m)));\n\n\n\n\n\n", "t = int(input())\r\nfor _ in range(t):\r\n n, m, x1, y1, x2, y2 = map(int, input().split())\r\n x, y = n - abs(x1 - x2), m - abs(y1 - y2)\r\n print(n * m - x * y * 2 + max(x + x - n, 0) * max(y + y - m, 0))# 1690331581.0917072", "I = lambda : map(int,input().split())\r\nfor _ in range (int(input())) :\r\n n , m , x1 , y1 , x2 , y2 = I()\r\n if y1 > y2 :\r\n x1 , y1 , x2 , y2 = x1 , y2 , x2 , y1\r\n if x1 <= x2 :\r\n xmin = x1 \r\n xmax = x2 \r\n xmin = x1 + max(0,n-x2)\r\n xmax = x2 - (x1-1)\r\n ymin = y1 + m-y2\r\n ymax = y2 - (y1-1)\r\n #print(xmin , xmax)\r\n rect = n*m\r\n a1 = xmin * ymin\r\n a2 = (n-xmax+1)*(m-ymax+1)\r\n com = max(xmin - xmax + 1 , 0) * max(ymin - ymax + 1 , 0)\r\n #print(rect , a1 ,a2 ,com)\r\n print(rect - a1 - a2 + com)\r\n else :\r\n x1 = n+1 - x1\r\n x2 = n+1 - x2\r\n xmin = x1 \r\n xmax = x2 \r\n xmin = x1 + max(0,n-x2)\r\n xmax = x2 - (x1-1)\r\n ymin = y1 + m-y2\r\n ymax = y2 - (y1-1)\r\n #print(xmin , xmax)\r\n rect = n*m\r\n a1 = xmin * ymin\r\n a2 = (n-xmax+1)*(m-ymax+1)\r\n com = max(xmin - xmax + 1 , 0) * max(ymin - ymax + 1 , 0)\r\n #print(rect , a1 ,a2 ,com)\r\n print(rect - a1 - a2 + com)\r\n \r\n ", "from sys import stdin\r\ninp = stdin.readline\r\n\r\nt = int(inp())\r\n\r\nfor _ in range(t):\r\n arr = [int(x) for x in inp().split()]\r\n x = abs(arr[2]-arr[4])\r\n y = abs(arr[3]-arr[5])\r\n\r\n if arr[0] >= 2*x and arr[1] >= 2*y:\r\n print(x*y*2)\r\n else:\r\n print(arr[0]*arr[1] - (arr[0] - x)*(arr[1] - y)*2)\r\n\r\n", "# LUOGU_RID: 101629793\nfrom math import *\nfrom collections import *\n\nt = int(input())\n\nwhile t:\n t -= 1\n n,m,x1,y1,x2,y2 = map(int, input().split())\n x1, x2 = min(x1, x2), max(x1, x2)\n y1, y2 = min(y1, y2), max(y1, y2)\n\n # print(n,m)\n dx,dy = x1 - x2, y1 - y2\n ct = m * n\n x1,y1,x2,y2 = [i - 1 for i in [x1,y1,x2,y2]]\n x1, x2 = min(x1, x2), max(x1, x2)\n y1, y2 = min(y1, y2), max(y1, y2)\n\n\n a = 2 * x1 - 2 * x2 + n\n b = 2 * y1 - 2 * y2 + m\n\n s = (x1 + n - x2) * (y1 + m - y2) + (n - x2 + x1) * (m - y2 + y1)\n\n if a > 0 and b > 0:\n print(ct - s + a * b)\n else:\n print(ct - s)\n ", "\r\nfor _ in range(int(input())):\r\n n,m,x1,y1,x2,y2=map(int,input().split())\r\n a=abs(x1-x2)\r\n b=abs(y1-y2)\r\n print(n*m - 2*(n-a)*(m-b) + max(0,n-2*a)*max(0,m-2*b))", "for z in range(int(input())):\r\n n,m,a,b,c,d=[int(i) for i in input().split()]\r\n l=min(a,c)\r\n o=min(b,d)\r\n r=min(n-a,n-c)\r\n u=min(m-b,m-d)\r\n if a<=c:\r\n h=a+r-c+l\r\n else:\r\n h=c+r-a+l\r\n h=max(h,0)\r\n if b<=d:\r\n v=b+u-d+o\r\n else:\r\n v=d+u-b+o\r\n v=max(v,0)\r\n print(n*m-2*(l+r)*(o+u)+h*v)\r\n", "for _ in range(int(input())):\n n, m, x1, y1, x2, y2 = map(int, input().split())\n ans = abs(x1 - x2) * abs(y1 - y2) * 2\n if 2 * abs(x1 - x2) > n:\n if 2 * abs(y1 - y2) > m:\n ans -= max(0, 2 * abs(x1 - x2) - n) * max(0, 2 * abs(y1 - y2) - m)\n else:\n ans += max(0, 2 * abs(x1 - x2) - n) * max(0, m - 2 * abs(y1 - y2))\n else:\n if 2 * abs(y1 - y2) > m:\n ans += max(0, n - 2 * abs(x1 - x2)) * max(0, 2 * abs(y1 - y2) - m) \n print(ans)", "t=int(input());\r\n\r\nfor _ in range(t):\r\n n,m,x1,y1,x2,y2=map(int,input().split());\r\n\r\n uptol=min(y1,y2)-1;\r\n downtol=m-max(y1,y2);\r\n lefttol=min(x1,x2)-1;\r\n righttol=n-max(x1,x2);\r\n\r\n melted=(uptol+downtol+1)*(lefttol+righttol+1)*2;\r\n\r\n if max(y1,y2)-min(y1,y2)-uptol-downtol<=0:\r\n overlapy=-max(y1,y2)+min(y1,y2)+uptol+downtol+1;\r\n else:\r\n overlapy=0;\r\n\r\n if max(x1,x2)-min(x1,x2)-lefttol-righttol<=0:\r\n overlapx=-max(x1,x2)+min(x1,x2)+lefttol+righttol+1;\r\n else:\r\n overlapx=0;\r\n\r\n melted-=(overlapx*overlapy);\r\n\r\n print(n*m-melted);\r\n", "t = int(input())\r\nfor _ in range(t):\r\n n, m, a, b, c, d = map(int, input().split())\r\n x, y = n - abs(a - c), m - abs(b - d)\r\n print(n * m - x * y * 2 + max(x + x - n, 0) * max(y + y - m, 0))\r\n" ]

[ "def rotate_90(a):\r\n b=[]\r\n for x in range(len(a)):\r\n l=[]\r\n for y in range(len(a)-1,-1,-1):\r\n l.append(a[y][x])\r\n b.append(l)\r\n return b\r\ndef flip(a):\r\n b=[]\r\n for x in range(len(a)):\r\n l=[]\r\n for y in range(len(a)-1,-1,-1):\r\n l.append(a[x][y])\r\n b.append(l)\r\n return b\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n a=input()\r\n l2=[]\r\n for i2 in a:\r\n l2.append(i2)\r\n l.append(l2)\r\nl2=[]\r\nfor i in range(n):\r\n a=input()\r\n l3=[]\r\n for i2 in a:\r\n l3.append(i2)\r\n l2.append(l3)\r\nd='no'\r\nfor i in range(4):\r\n l = rotate_90(l)\r\n if l==l2:\r\n d='yes'\r\nl=flip(l)\r\nfor i in range(4):\r\n l = rotate_90(l)\r\n if l==l2:\r\n d='yes'\r\nprint(d)\r\n", "n=int(input())\r\nM1=[]; M2=[]; N1=[]; N2=[]\r\nN90=[]; N180=[]; N270=[]; S=[]; S90=[]; S180=[]; S270=[]\r\nfor k in range(n):\r\n N1.append([])\r\n N2.append([])\r\n N90.append([])\r\n N180.append([])\r\n N270.append([])\r\n S.append([])\r\n S90.append([])\r\n S180.append([])\r\n S270.append([])\r\n \r\nfor k in range(n):\r\n M1.append(input())\r\nfor k in range(n):\r\n M2.append(input())\r\n\r\nfor y in range(n):\r\n for x in range(n):\r\n if M1[y][x]=='X':\r\n N1[y].append(1)\r\n else:\r\n N1[y].append(0)\r\n \r\nfor y in range(n):\r\n for x in range(n):\r\n if M2[y][x]=='X':\r\n N2[y].append(1)\r\n else:\r\n N2[y].append(0)\r\n\r\nfor y in range(n):\r\n for x in range(n):\r\n N90[y].append(N1[x][n-1-y])\r\n N180[y].append(N1[n-1-y][n-1-x])\r\n N270[y].append(N1[n-1-x][y])\r\n S[y].append(N1[y][n-1-x])\r\n S90[y].append(N1[n-1-x][n-1-y])\r\n S180[y].append(N1[n-1-y][x])\r\n S270[y].append(N1[x][y])\r\n \r\nif N2==N1 or N2==N90 or N2==N180 or N2==N270 or N2==S or N2==S90 or N2==S180 or N2==S270:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ng = [list(input()[:-1]) for _ in range(n)]\r\nw = [list(input()[:-1]) for _ in range(n)]\r\nfor i in range(4):\r\n g = [[g[i][j] for i in range(n-1, -1, -1)] for j in range(n)]\r\n if g == w:\r\n print('Yes')\r\n exit(0)\r\n\r\n x = [g[n-1-i] for i in range(n)]\r\n if x == w:\r\n print('Yes')\r\n exit(0)\r\n\r\n y = [[g[i][n-1-j] for i in range(n)] for j in range(n)]\r\n if y == w:\r\n print('Yes')\r\n exit(0)\r\n\r\nprint('No')\r\n", "N = int(input())\nm1 = []\nm2 = []\nms = []\nfor n in range(N):\n m1.append(input())\nfor n in range(N):\n m2.append(input())\n\nms = [\n m2,\n [x[::-1] for x in m2],\n [x for x in reversed(m2)],\n]\n\na = []\nfor m in ms:\n a.append(m)\n a.append([x[::-1] for x in reversed(m)])\n a.append([''.join(m[j][i] for j in range(N - 1, -1, -1)) for i in range(N)])\n a.append([''.join(m[j][i] for j in range(N)) for i in range(N - 1, -1, -1)])\n\nms = a\nprint(['NO', 'YES'][m1 in ms])\n", "# Function to rotate the matrix \r\n# 90 degree clockwise \r\ndef rotate90Clockwise(A): \r\n N = len(A[0]) \r\n for i in range(N // 2): \r\n for j in range(i, N - i - 1): \r\n temp = A[i][j] \r\n A[i][j] = A[N - 1 - j][i] \r\n A[N - 1 - j][i] = A[N - 1 - i][N - 1 - j] \r\n A[N - 1 - i][N - 1 - j] = A[j][N - 1 - i] \r\n A[j][N - 1 - i] = temp \r\ndef check(A,B):\r\n c1=0\r\n c2=0\r\n for i in range(N):\r\n for j in range(N):\r\n if(A[i][j]==B[N-1-i][j]):\r\n c1+=1\r\n if(A[i][j]==B[i][N-1-j]):\r\n c2+=1\r\n if(c1==N**2 or c2==N**2):return True\r\n else:return False\r\nN=int(input())\r\nA=[]\r\nfor i in range(N):\r\n a=input()\r\n aa=[]\r\n for j in range(N):\r\n aa.append(a[j])\r\n A.append(aa)\r\nB=[] \r\nfor j in range(N):\r\n b=input()\r\n bb=[]\r\n for j in range(N):\r\n bb.append(b[j])\r\n B.append(bb)\r\nflag=False \r\nif(A==B):flag=True\r\nif(check(A,B)):flag=True\r\nrotate90Clockwise(A)\r\nif(A==B):flag=True\r\nif(check(A,B)):flag=True\r\nrotate90Clockwise(A)\r\nif(A==B):flag=True\r\nif(check(A,B)):flag=True\r\nrotate90Clockwise(A)\r\nif(A==B):flag=True\r\nif(check(A,B)):flag=True\r\nif(flag):print(\"Yes\")\r\nelse:print(\"No\")", "N = int(input())\r\nmap_1 = [list(input()) for i in range(N)]\r\nmap_2 = [list(input()) for i in range(N)]\r\n\r\nmaps = list()\r\n\r\nmaps.append([[map_2[i][j] for j in range(N)] for i in range(N)])\r\nmaps.append([[map_2[i][N - 1 - j] for j in range(N)] for i in range(N)])\r\nmaps.append([[map_2[N - 1 - i][j] for j in range(N)] for i in range(N)])\r\nmaps.append([[map_2[N - 1 - i][N - 1 - j] for j in range(N)] for i in range(N)])\r\nmaps.append([[map_2[j][i] for j in range(N)] for i in range(N)])\r\nmaps.append([[map_2[j][N - 1 - i] for j in range(N)] for i in range(N)])\r\nmaps.append([[map_2[N - 1 - j][i] for j in range(N)] for i in range(N)])\r\nmaps.append([[map_2[N - 1 - j][N - 1 - i] for j in range(N)] for i in range(N)])\r\n\r\nprint(('No', 'Yes')[any(map_1 == el for el in maps)])\r\n", "from copy import deepcopy\r\n \r\ndef GenerateMap(n):\r\n positions = []\r\n for i in range(0,n):\r\n positions.append([])\r\n return positions\r\n \r\ndef Rotate(a, times):\r\n rotated = []\r\n for i in range(0,n):\r\n rotated.append([])\r\n counter = len(a)\r\n for i in rotated:\r\n counter-=1\r\n for j in a:\r\n i.append(j[counter])\r\n for i in range(0, times-1):\r\n counter = len(a)\r\n x = deepcopy(rotated)\r\n for j in rotated:\r\n j.clear()\r\n counter-=1\r\n for k in x:\r\n j.append(k[counter])\r\n return rotated\r\n \r\ndef Flip(a):\r\n flipped = []\r\n for i in reversed(a):\r\n flipped.append(i)\r\n return flipped\r\n \r\ndef CheckMaps(a,b):\r\n if a == b:\r\n return \"Yes\"\r\n elif Rotate(a, 1) == b:\r\n return \"Yes\"\r\n elif Rotate(a, 2) == b:\r\n return \"Yes\"\r\n elif Rotate(a, 3) == b:\r\n return \"Yes\"\r\n elif Flip(a) == b:\r\n return \"Yes\"\r\n elif Flip(Rotate(a, 1)) == b:\r\n return \"Yes\"\r\n elif Flip(Rotate(a, 2)) == b:\r\n return \"Yes\"\r\n elif Flip(Rotate(a, 3)) == b:\r\n return \"Yes\"\r\n else:\r\n return \"No\"\r\n \r\n \r\nn = int(input())\r\n \r\na = GenerateMap(n)\r\nb = GenerateMap(n)\r\n \r\nfor i in range(0,n):\r\n x = []\r\n x[:] = input()\r\n a[i] = x\r\nfor i in range(0,n):\r\n x = []\r\n x[:] = input()\r\n b[i] = x\r\n \r\nprint(CheckMaps(a,b))\r\n", "#def pr():\n#\tprint()\n#\tfor i in range(n):\n#\t\tfor j in range(n):\n#\t\t\tprint(map1[i][j], end = \"\")\n#\t\tprint()\n#\tprint()\n#-----------------------------------------------\ndef check():\n\tf = True\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif map1[i][j] != map2[i][j]:\n\t\t\t\tf = False\n\t\t\t\tbreak\n\tif f:\n\t\treturn True\n\t\n\tf = True\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif map1[i][j] != map2[n - 1 - i][j]:\n\t\t\t\tf = False\n\t\t\t\tbreak\n\tif f:\n\t\treturn True\n\t\n\tf = True\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif map1[i][j] != map2[i][n - 1 - j]:\n\t\t\t\tf = False\n\t\t\t\tbreak\n\tif f:\n\t\treturn True\n\t\n\ndef rotate():\n\twk1=[]\n\tfor i in range(n):\n\t\twk1.append([])\n\t\tfor j in range(n):\n\t\t\twk1[i].append(map1[i][j])\n\t\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tmap1[i][j] = wk1[j][n - 1 - i]\n\n\nn = int(input())\nmap1 = []\nfor i in range(n):\n\tst = input()\n\tmap1.append([])\n\tfor j in st:\n\t\tmap1[i].append(j)\n\nmap2 = []\nfor i in range(n):\n\tst = input()\n\tmap2.append([])\n\tfor j in st:\n\t\tmap2[i].append(j)\n\n\nf = False\nfor k in range(4):\n\tif check():\n\t\tf = True\n\t\tbreak\n\trotate()\n\nif f:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n", "n=int(input())\r\nns=[]\r\nfor i in range(n):\r\n s=input()\r\n ns.append(s)\r\nns2=[]\r\nfor i in range(n):\r\n s=input()\r\n ns2.append(s)\r\n\r\n\r\ndef rotate(i,j):\r\n return j,n-1-i\r\ndef flip(i,j):\r\n return j,i\r\n\r\ndef main():\r\n same=True\r\n for i in range(n): # 0\r\n for j in range(n):\r\n if ns[i][j]!=ns2[i][j]:\r\n same=False\r\n break\r\n if same==False:\r\n break\r\n if same:\r\n return True\r\n\r\n same=True\r\n for i in range(n): # 1\r\n for j in range(n):\r\n a, b = rotate(i, j)\r\n if ns[i][j] != ns2[a][b]:\r\n same = False\r\n break\r\n if same == False:\r\n break\r\n if same:\r\n return True\r\n\r\n same=True\r\n for i in range(n): # 2\r\n for j in range(n):\r\n a, b = rotate(i, j)\r\n a, b = rotate(a, b)\r\n if ns[i][j] != ns2[a][b]:\r\n same = False\r\n break\r\n if same == False:\r\n break\r\n if same:\r\n return True\r\n\r\n same=True\r\n for i in range(n):\r\n for j in range(n): # 3\r\n a, b = rotate(i, j)\r\n a, b = rotate(a, b)\r\n a, b = rotate(a, b)\r\n if ns[i][j] != ns2[a][b]:\r\n same = False\r\n break\r\n if same == False:\r\n break\r\n if same:\r\n return True\r\n\r\n same=True\r\n for i in range(n): # 0\r\n for j in range(n):\r\n a,b=flip(i,j)\r\n if ns[a][b]!=ns2[i][j]:\r\n same=False\r\n break\r\n if same==False:\r\n break\r\n if same:\r\n return True\r\n\r\n same=True\r\n for i in range(n): # 1\r\n for j in range(n):\r\n a, b = rotate(i, j)\r\n a, b = flip(a, b)\r\n if ns[i][j] != ns2[a][b]:\r\n same = False\r\n break\r\n if same == False:\r\n break\r\n if same:\r\n return True\r\n\r\n same=True\r\n for i in range(n): # 2\r\n for j in range(n):\r\n a, b = rotate(i, j)\r\n a, b = rotate(a, b)\r\n a, b = flip(a, b)\r\n if ns[i][j] != ns2[a][b]:\r\n same = False\r\n break\r\n if same == False:\r\n break\r\n if same:\r\n return True\r\n\r\n same=True\r\n for i in range(n):\r\n for j in range(n): # 3\r\n a, b = rotate(i, j)\r\n a, b = rotate(a, b)\r\n a, b = rotate(a, b)\r\n a, b = flip(a, b)\r\n if ns[i][j] != ns2[a][b]:\r\n same = False\r\n break\r\n if same == False:\r\n break\r\n if same:\r\n return True\r\n else:\r\n return False\r\n\r\nif main():\r\n print('Yes')\r\nelse:\r\n print('No')\r\n\r\n\r\n\r\n", "def rotate(L):\r\n L1 = ['' for i in range(n)]\r\n for i in range(n):\r\n for j in range(n):\r\n L1[n - j - 1] += L[i][j]\r\n return L1\r\n\r\ndef flip_v(L):\r\n L1 = []\r\n for i in range(n):\r\n L1.append(L[i][::-1])\r\n return L1\r\n\r\ndef flip_h(L):\r\n L1 = []\r\n for i in range(n):\r\n L1.append(L[n - i - 1])\r\n return L1\r\n\r\nn = int(input())\r\nL = []\r\nM = []\r\nfor i in range(n):\r\n L.append(input())\r\nfor i in range(n):\r\n M.append(input())\r\nL1 = rotate(L)\r\nL2 = rotate(L1)\r\nL3 = rotate(L2)\r\nL4 = flip_v(L)\r\nL5 = flip_h(L)\r\nL6 = rotate(L4)\r\nL7 = rotate(L6)\r\nL8 = rotate(L7)\r\nL9 = rotate(L5)\r\nL10 = rotate(L9)\r\nL11 = rotate(L10)\r\nif L == M or L1 == M or L2 == M or L3 == M or L4 == M or L5 == M or L6 == M or L7 == M or L8 == M or L9 == M or L10 == M or L11 == M:\r\n print('Yes')\r\nelse:\r\n print('No')", "n=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n b.append(input())\r\n\r\ndef h(d):\r\n c=[]\r\n for i in range(n):\r\n c.append(d[n-i-1])\r\n return c\r\ndef r(d):\r\n c=[]\r\n for i in range(n):\r\n temp=\"\"\r\n for j in range(n):\r\n temp+=d[j][n-i-1]\r\n c.append(temp)\r\n return c\r\nyes=0\r\nfor i in range(4):\r\n if a==b:\r\n print('YES')\r\n yes=1\r\n break\r\n a=r(a)\r\nif yes==0:\r\n a=h(a)\r\n for i in range(4):\r\n if a==b:\r\n print('YES')\r\n yes=1\r\n break\r\n a=r(a)\r\nif yes==0:\r\n print('NO')\r\n \r\n ", "# /**\r\n# * author: brownfox2k6\r\n# * created: 16/05/2023 21:38:11 Hanoi, Vietnam\r\n# **/\r\n\r\ndef solve():\r\n n = int(input())\r\n\r\n g = [[c for c in input()] for _ in range(n)]\r\n a = [[c for c in input()] for _ in range(n)]\r\n\r\n for _ in range(4):\r\n if g == a:\r\n return \"Yes\"\r\n\r\n if g == a[::-1]:\r\n return \"Yes\"\r\n\r\n if sum(g[i] == a[i][::-1] for i in range(n)) == n:\r\n return \"Yes\"\r\n \r\n g = [list(x[::-1]) for x in zip(*g)]\r\n \r\n return \"No\"\r\n\r\nprint(solve())", "N = int(input())\ns1 = [list(input()) for i in range(N)]\ns2 = [list(input()) for i in range(N)]\n\ndef rotate(s):\n ret = [[None for i in range(N)] for j in range(N)]\n for i in range(N):\n for j in range(N):\n ret[i][j] = s[j][N-1-i]\n return ret\n\ndef v_mirror(s):\n return list(reversed(s))\n\ndef h_mirror(s):\n return [list(reversed(row)) for row in s]\n\ndef solve():\n global s1\n for i in range(4):\n if s1 == s2: return True\n if v_mirror(s1) == s2: return True\n if h_mirror(s1) == s2: return True\n if v_mirror(h_mirror(s1)) == s2: return True\n s1 = rotate(s1)\n return False\n\nprint('Yes' if solve() else 'No')\n", "def solve(board):\r\n n=len(board)\r\n ans=0\r\n for i in range(n):\r\n for j in range(n):\r\n if board[i][j] is 'X':\r\n ans+=2**(i*n+j)\r\n return ans \r\n\r\ndef reverse_array(arr):\r\n for i in range(len(arr)):\r\n arr[i].reverse()\r\n\r\ndef rotate(matrix, degree):\r\n if degree == 0:\r\n return matrix\r\n elif degree > 0:\r\n return rotate(zip(*matrix[::-1]), degree-90)\r\n else:\r\n return rotate(zip(*matrix)[::-1], degree+90)\r\n\r\ndef make_list(board):\r\n board=list(board)\r\n arr=[]\r\n for i in range(len(list(board))):\r\n arr.append(list(board[i]))\r\n return arr\r\n\r\ndef add_rotations(board,st):\r\n for i in range(4):\r\n st.add(solve(board))\r\n reverse_array(board)\r\n st.add(solve(board))\r\n reverse_array(board)\r\n board=make_list(rotate(board, 90))\r\n \r\n\r\nn=int(input())\r\narr1=[]\r\narr2=[]\r\nfor _ in range(n):\r\n arr1.append(list(input().strip()))\r\nfor _ in range(n):\r\n arr2.append(list(input().strip()))\r\ns=set()\r\ns.add(solve(arr1))\r\nadd_rotations(arr1,s)\r\nl1=len(s)\r\n#print(s,arr1,arr2)\r\ns.add(solve(arr2))\r\nadd_rotations(arr2,s)\r\n#print(s)\r\nl2=len(s)\r\nif l1==l2:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "\r\n\r\n\r\ndef rotate(li):\r\n newli = []\r\n for x in range (0,n):\r\n newli.append([])\r\n newli[x] = li[x].copy()\r\n\r\n for x in range (0,n):\r\n for y in range (0,n):\r\n newli[x][y] = li[n-1-y][x]\r\n return newli\r\n\r\ndef flipV(li):\r\n newli = []\r\n for x in range (0,n):\r\n newli.append([])\r\n newli[x] = li[x].copy()\r\n newli.reverse()\r\n return newli\r\n\r\ndef flipH(li):\r\n newli = []\r\n for x in range (0,n):\r\n newli.append([])\r\n newli[x] = li[x].copy()\r\n\r\n for x in range (0,n):\r\n newli[x].reverse()\r\n return newli\r\n\r\n\r\n\r\nn = int(input())\r\n#print((s+1)*s//2-s+1)\r\n#print('Ehab' if s%2==1 else 'Mahmoud')\r\n\r\nli1, li2, li3, templi = [], [], [], []\r\n\r\nfor x in range (0,n):\r\n li1.append([])\r\n li2.append([])\r\n li3.append([])\r\n templi.append([])\r\n li1[x]=list(input())\r\n\r\nfor x in range (0,n):\r\n li2[x]=list(input())\r\n\r\n#identical\r\nif ( li1 ==li2 ):\r\n print('Yes')\r\n exit()\r\n\r\n#flip horizontal\r\ntempli = flipH(li2)\r\nif ( li1 ==templi ):\r\n print('Yes')\r\n exit()\r\n\r\n#flip vertical\r\ntempli = flipV(li2)\r\nif ( li1 ==templi ):\r\n print('Yes')\r\n exit()\r\n\r\n#rotate1\r\ntempli = rotate(li2)\r\nif ( li1 ==templi ):\r\n print('Yes')\r\n exit()\r\n\r\n#rotate2\r\ntempli = rotate(templi)\r\nif ( li1 ==templi ):\r\n print('Yes')\r\n exit()\r\n\r\n#rotate3\r\ntempli = rotate(templi)\r\nif ( li1 ==templi ):\r\n print('Yes')\r\n exit()\r\n\r\n#flip\r\ntempli = flipH(li2)\r\ntempli = rotate(templi)\r\nif ( li1 ==templi ):\r\n print('Yes')\r\n exit()\r\n\r\ntempli = rotate(templi)\r\nif ( li1 ==templi ):\r\n print('Yes')\r\n exit()\r\n\r\ntempli = rotate(templi)\r\nif ( li1 ==templi ):\r\n print('Yes')\r\n exit()\r\n\r\nprint('No') \r\n", "n = int(input())\r\nmap1 = [list(input()) for i in range(n)]\r\nmap2 = [list(input()) for i in range(n)]\r\n\r\ndef vFlip (m):\r\n return([list(reversed(i)) for i in m])\r\n \r\ndef hFlip(m):\r\n return(list(reversed(m)))\r\n \r\ndef rotate(m):\r\n return(list(zip(*reversed(m))))\r\n \r\ndef check(): \r\n global map1\r\n for i in range(4):\r\n if map1 == map2:\r\n return(True)\r\n if vFlip(map1)==map2:\r\n return(True)\r\n if hFlip(map1)==map2:\r\n return(True)\r\n if vFlip(hFlip(map1))==map2:\r\n return(True)\r\n map1 = rotate(map1)\r\n return(False)\r\n \r\nprint('YES' if check() else 'NO')", "from sys import stdin\n\n\nn = int(stdin.readline())\n\n\ndef eq(m1, m2):\n for i in range(n):\n if m1[i] != m2[i]:\n return False\n return True\n\n\ndef fleq(m1, m2):\n return eq(m1, m2) or eq(m1, fliph(m2)) or eq(m1, flipv(m2))\n\n\ndef fliph(m):\n return [row[::-1] for row in m]\n\n\ndef flipv(m):\n return m[::-1]\n\n\ndef rot(m):\n mr = ['' for _ in range(n)]\n for i in range(n):\n x = ''\n for j in range(n):\n x = x + m[j][n-i-1]\n mr[i] = x\n return mr\n\n\nu = [stdin.readline()[:-1] for _ in range(n)]\nv = [stdin.readline()[:-1] for _ in range(n)]\nv90 = rot(v)\nv180 = rot(v90)\nv270 = rot(v180)\n\nif fleq(u, v) or fleq(u, v90) or fleq(u, v180) or fleq(u, v270):\n print('Yes')\nelse:\n print('No')\n", "#!/usr/bin/python3\n\nimport copy\n\n\ndef rotate90(n, f):\n return [[f[n - j - 1][i] for j in range(n)] for i in range(n)]\n\ndef fliphor(n, f):\n return [[f[i][n - j - 1] for j in range(n)] for i in range(n)]\n\ndef flipver(n, f):\n return [[f[n - i - 1][j] for j in range(n)] for i in range(n)]\n\ndef eq(n, f, g):\n for i in range(n):\n for j in range(n):\n if f[i][j] != g[i][j]:\n return False\n return True\n\n\nn = int(input())\nf = [list(input()) for i in range(n)]\ng = [list(input()) for i in range(n)]\n\nfor doflipv in range(2):\n for dofliph in range(2):\n for nrot in range(4):\n h = copy.deepcopy(f)\n if dofliph == 1:\n h = fliphor(n, h)\n if doflipv == 1:\n h = flipver(n, h)\n for i in range(nrot):\n h = rotate90(n, h)\n if eq(n, h, g):\n print(\"Yes\")\n exit(0)\n\nprint(\"No\")", "def check(x, y):\r\n return ''.join([''.join(s) for s in x]) == ''.join([''.join(s) for s in y])\r\n\r\nn = int(input())\r\na = [list(input()) for i in range(n)]\r\nb = [list(input()) for i in range(n)]\r\nfor i in range(4):\r\n for j in range(2):\r\n if check(a, b):\r\n print('Yes')\r\n exit(0)\r\n b = b[::-1]\r\n for j in range(2):\r\n if check(a, b):\r\n print('Yes')\r\n exit(0)\r\n b = [s[::-1] for s in b]\r\n c = [['' for t in range(n)] for u in range(n)]\r\n for t in range(n):\r\n for u in range(n):\r\n c[t][u] = b[u][n - t - 1]\r\n b = c[:]\r\n if check(a, b):\r\n print('Yes')\r\n exit(0)\r\nprint('No')\r\n", "import copy\r\nn = int(input())\r\nflg=0\r\nmat1 = []\r\nmat2 = []\r\n\r\nmats = []\r\nfor i in range(0, n): mat1.append(tuple(input().strip()))\r\nfor i in range(0, n): mat2.append(tuple(input().strip()))\r\nmats.append(mat2)\r\nmatu = copy.copy(mat2)\r\nmatv = copy.copy(mat2)\r\nmatv = list(zip(*matv))\r\nmats.append(matv)\r\n\r\nmattem = copy.copy(matu)\r\nfor i in range(0, 3):\r\n\tmattem = list(zip(*list(reversed(mattem))))\r\n\tmats.append(mattem)\r\nmattem = copy.copy(matv)\r\nfor i in range(0, 3):\r\n\tmattem = list(zip(*list(reversed(mattem))))\r\n\tmats.append(mattem)\r\n\r\nflg = 0\r\nfor cmat in mats:\r\n\tflg2 = 1\r\n\tfor ri in range(0, n):\r\n\t\tif cmat[ri]!=mat1[ri]:\r\n\t\t\tflg2=0\r\n\t\t\tbreak\r\n\tif flg2==1:\r\n\t\tflg=1\r\n\t\tbreak\r\nif flg==1: print(\"Yes\")\t\t\t\r\nelse: print(\"No\")\r\n\r\n", "N = int(input())\r\nfirst = []\r\nsecond = []\r\nfor i in range(N):\r\n first.append([s for s in input()])\r\nfor i in range(N):\r\n second.append([s for s in input()])\r\n\r\ndef rotate_90(matrix):\r\n return list(zip(*matrix[::-1]))\r\n\r\ndef flip(matrix):\r\n return matrix[::-1]\r\n\r\ndef compare_matrices(first, second):\r\n for i in range(N):\r\n for j in range(N):\r\n if first[i][j] != second[i][j]:\r\n return False\r\n return True\r\n\r\ndef wrap(first, second):\r\n if compare_matrices(first, second) == True:\r\n return 'Yes'\r\n hold_first = first[::]\r\n for _ in range(3):\r\n first = rotate_90(first)\r\n if compare_matrices(first, second) == True:\r\n return 'Yes'\r\n first = hold_first\r\n first = flip(first)\r\n if compare_matrices(first, second) == True:\r\n return 'Yes'\r\n for _ in range(3):\r\n first = rotate_90(first)\r\n if compare_matrices(first, second) == True:\r\n return 'Yes'\r\n return 'No'\r\n\r\nprint(wrap(first, second))", "n = int(input())\nm1 = [list(input()) for _ in range(n)]\nm2 = [list(input()) for _ in range(n)]\n\ndef rotate(map_):\n rotated = [[0]*n for _ in range(n)]\n for i in range(n):\n for j in range(n):\n rotated[j][n-1-i] = map_[i][j]\n return rotated\n\ndef reflect_vertically(map_):\n\treturn map_[::-1]\n\ndef reflect_horizontally(map_):\n\treturn [row[::-1] for row in map_]\n\ndef solve(map1, map2):\n\tfor _ in range(4):\n\t\tif map1 == map2 or reflect_vertically(map1) == map2 or reflect_horizontally(map1) == map2 or reflect_horizontally(reflect_vertically(map1)) == map2:\n\t\t\treturn True\t\n\t\tmap1 = rotate(map1)\n\treturn False\n\nprint(\"Yes\" if solve(m1, m2) else \"No\")\n" ]

[ "import sys, threading\ninput = sys.stdin.readline\nfrom collections import defaultdict\ninput = sys.stdin.readline\n\n# returns the first number where key becomes true for a given delegate type key\ndef bs(low=1, high=1, key = lambda x: True):\n\n while low <= high:\n mid = (low + high)//2\n if key(mid):\n high = mid-1\n else:\n low = mid+1\n return low\n\ndef good(x, n, m):\n res = 0\n x -= 1\n for i in range(1, n + 1):\n res += min(m, x // i)\n return res\n\n\n\ndef main():\n n,m, k = map(int, input().split())\n low, high = 1, n * m + 1\n print(bs(low, high, lambda x: good(x, n, m) >= k)-1)\n\n\nmain()", "n, m, k = list(map(int, input().split()))\r\n\r\ndef find_pos(num):\r\n return sum([num // i if num//i < m else m for i in range(1, n + 1)])\r\nl, r = 0, n * m + 1\r\nwhile(l + 1 < r):\r\n num = (l + r) // 2\r\n if find_pos(num) >= k:\r\n r = num \r\n else:\r\n l = num\r\nprint(l+1)", "import sys\r\ninput = sys.stdin.readline\r\nn, m, k = tuple(map(int, input().split()))\r\ndef findposition(number):\r\n position = 0\r\n for i in range(1,n+1): position += min(m, number//i)\r\n return position\r\nleft, right = 1, n*m\r\nwhile left != right:\r\n mid = (left+right)//2\r\n if findposition(mid) >= k: right = mid\r\n else: left = mid+1\r\nprint(left)", "\nif __name__ == '__main__':\n n, m, k = map(int, input().split())\n l, r = 1, n * m\n while l < r:\n mid = (l + r) // 2\n if sum([min(mid // i, m) for i in range(1, n + 1)]) >= k:\n r = mid\n else:\n l = mid + 1\n print(l)\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "n,m_,k = map(int,input().split())\r\n\r\n\r\nl, r = 1, n*m_+1\r\nwhile r>l+1:\r\n m = (l + r)//2\r\n s=sum(min(m_,(m-1)//i) for i in range(1,n+1))\r\n if s<k:\r\n l = m\r\n else:\r\n r = m\r\n\r\nprint(l)", "n,m,k=map(int, input().split())\ndef check(val:int) -> int:\n count = 0\n for i in range(1,n+1):\n count+=min(m,val//i)\n return count\nlowlimit = 1\nhighlimit = n*m\nmid = (lowlimit + highlimit)//2\nans = int(1e18)\nwhile lowlimit <= highlimit:\n count = check(mid)\n if count >= k:\n highlimit = mid - 1\n ans = min(ans,mid)\n if count < k:\n lowlimit = mid + 1\n mid = (lowlimit + highlimit)//2\nprint(ans)\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\n# from math import gcd as gcd\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound\r\n\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n n, m, k = map(int, input().split())\r\n ans = 0\r\n l, r = 0, n*m\r\n while(l <= r):\r\n mid = (l + r) // 2\r\n cnt = 0\r\n for i in range(1,n+1):\r\n cnt += (min((mid - 1)//i, m))\r\n if (cnt < k):\r\n ans = mid\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n print(ans)", "n,m,k = map(int,input().split())\r\n\r\ndef below(x):\r\n ans = 0\r\n for i in range(1,n+1):\r\n ans +=min(m, x//i)\r\n return ans >= k\r\n\r\nstart = 1\r\nend = n*m\r\n\r\nwhile(start < end):\r\n cur = (start+end)//2\r\n if below(cur):\r\n end = cur\r\n else:\r\n start = cur +1\r\nprint(start)\r\n", "\r\nn, m, k = map(int, input().split())\r\n\r\nl = 1\r\nr = n * m + 1\r\n\r\nwhile l < r:\r\n x = (l + r) // 2\r\n multiple = 0\r\n y = x - 1\r\n for i in range(1, n + 1):\r\n multiple += min(m, y // i)\r\n if multiple < k:\r\n l = x + 1\r\n else:\r\n r = x\r\n\r\nprint(l - 1)\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\nfrom copy import deepcopy\r\nimport itertools\r\nimport datetime\r\nfrom itertools import permutations\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef IS():\r\n return sys.stdin.readline().replace('\\n', '')\r\n\r\n\r\ndef main():\r\n m, n, k = map(int, input().split())\r\n if m > n:\r\n m, n = n, m\r\n lo, hi = 1, m * n\r\n while lo < hi:\r\n mid = lo + hi >> 1\r\n if sum(min(mid // r, n) for r in range(1, m + 1)) < k:\r\n lo = mid + 1\r\n else:\r\n hi = mid\r\n\r\n print(lo)\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "def check(n, m, k, v):\r\n res = 0\r\n for i in range(1, n + 1):\r\n res += min(m, v // i)\r\n return res >= k\r\n\r\ndef find_kth_largest(n, m, k):\r\n l = 1\r\n r = n * m\r\n while l < r:\r\n mid = (l + r) // 2\r\n if check(n, m, k, mid):\r\n r = mid\r\n else:\r\n l = mid + 1\r\n return r\r\n\r\nn, m, k = map(int, input().split())\r\nresult = find_kth_largest(n, m, k)\r\nprint(result)\r\n", "m,n,k=list(map(int,input().split()))\r\ni=0\r\nj=k+1\r\nwhile i+1<j:\r\n mid=(i+j)//2\r\n count=0\r\n for y in range(1,m+1):\r\n count=count+min(n,mid//y)\r\n if count>=k:\r\n j=mid\r\n else:\r\n i=mid\r\nprint(j)", "import sys\r\nfrom bisect import bisect_left,bisect_right\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque\r\nfrom functools import cache\r\nfrom heapq import heappop,heappush,heapify\r\nfrom itertools import permutations, accumulate\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\ndef solve():\r\n n,m,k=map(int,input().split())\r\n l,r=1,n*m;res=-1\r\n def f(v):\r\n count=0\r\n for i in range(1,n+1):\r\n count+=min((v-1)//i,m)\r\n return count\r\n while l<=r:\r\n mid=l+(r-l)//2\r\n if f(mid)<k:\r\n res=mid\r\n l=mid+1\r\n else:\r\n r=mid-1\r\n print(res)\r\nif __name__==\"__main__\":\r\n solve()", "import math\r\ndef ans(x,a,b,c):\r\n cnt = 0\r\n for i in range(1,b+1):\r\n cnt+= min(a,x//i)\r\n return(cnt>=c)\r\n\r\ndef slove():\r\n \r\n a,b,c = map(int,input().split())\r\n l = 0\r\n r = a*b+1\r\n while(l<r-1):\r\n mid = (l+r)//2\r\n if(ans(mid,a,b,c)):\r\n r = mid\r\n else:\r\n l = mid \r\n print(r)\r\n\r\n\r\nif '__main__'==__name__:\r\n slove()", "def good(mid,k,n,m):\r\n mid-=1\r\n ans=0\r\n for i in range(n):\r\n less=mid//(i+1)\r\n ans+=min(less,m)\r\n if ans<k:\r\n return True\r\n return False\r\n \r\nn,m,k=list(map(int,input().split()))\r\nl,r=0,n*m+10\r\nans=l\r\nwhile l<=r:\r\n mid=(l+r)//2\r\n if good(mid,k,n,m):\r\n ans=mid\r\n l=mid+1\r\n else:\r\n r=mid-1\r\nprint(ans)", "# https://codeforces.com/problemset/problem/448/D/\nn, m, k = map(int, input().split())\nlow, high, mid, ans, = 1, n*m+1, 0, 0\nwhile low < high:\n mid = int((low+high)/2)\n cnt = 0\n for i in range(1, n+1):\n cnt += min((mid-1)//i, m)\n if cnt < k:\n low = mid+1\n ans = mid\n else:\n high = mid\nprint(ans)", "import sys\r\nimport collections\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nints = lambda: list(map(int, input().split()))\r\n\r\nm, n, k = ints()\r\n\r\ndef cnt(x):\r\n res = 0\r\n for i in range(1, m + 1):\r\n upper_bound = min(i * n + 1, x)\r\n if upper_bound > i:\r\n res += (upper_bound - 1) // i\r\n return res\r\n\r\nl, r = 0, m * n\r\nwhile l <= r:\r\n mid = (l + r) // 2\r\n if cnt(mid) < k:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\nprint(l - 1)", "'''I = lambda: [int(i) for i in input().split()]\r\nimport io, os, sys\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline'''\r\n\r\n#n,k = map(int,input().split())\r\n#n,m = map(int,input().split())\r\n\r\n\r\n\r\n#---------tutorial_solution-------------\r\n\r\n\r\nn,m,k = map(int,input().split())\r\nl= 1\r\nr = n*m\r\nmid=0\r\ndef f(mid):\r\n count=0\r\n global m\r\n for i in range(1,n+1):\r\n a = min((mid-1)//i,m)\r\n if a==0:\r\n break\r\n else:\r\n count+= a\r\n return count\r\n \r\n \r\n\r\n\r\nans=0\r\nwhile(l<=r):\r\n mid = l +(r-l)//2\r\n if f(mid) <k:\r\n ans = mid\r\n l=mid+1\r\n else:\r\n r =mid-1\r\n \r\nprint(ans) \r\n", "from math import sqrt\r\n\r\nm, n, k = map(int, input().split())\r\nif n < m:\r\n n, m = m, n\r\nleft, right = 1, k + 1\r\nwhile left + 1 < right:\r\n mid = (left + right) // 2\r\n t = mid - 1\r\n v = min(int(sqrt(t)), m)\r\n tn, tm = (t - 1) // m, t // n\r\n ccc = [t // i for i in range(tm + 1, v + 1)]\r\n if t // n * (n + m) + sum(ccc) * 2 + max(min((tn - tm), len(ccc)) * m, 0) - v * v - sum(\r\n ccc[:max(min(tn - tm, len(ccc)), 0)]) < k:\r\n left = mid\r\n else:\r\n right = mid\r\n \r\nprint(left)\r\n", "\r\ndef solve():\r\n n, m, k = map(int, input().split())\r\n \r\n def lessEq(x):\r\n return sum([min(x//i, m) for i in range(1, n+1)]) >= k\r\n\r\n beg, end = 1, m*n\r\n \r\n while beg < end:\r\n mid = (beg + end)//2\r\n if not lessEq(mid):\r\n beg = mid + 1\r\n else:\r\n end = mid\r\n \r\n print(beg)\r\nsolve()\r\n", "if __name__ == '__main__':\r\n (n, m, k) = map(int, input().split(\" \"))\r\n left = 0\r\n right = n * m + 1\r\n\r\n\r\n def nums_less(num):\r\n less = 0\r\n for row in range(1, n + 1):\r\n less += min(num // row, m)\r\n return less\r\n\r\n\r\n while right - left > 1:\r\n mid = left + (right - left) // 2\r\n if nums_less(mid) < k:\r\n left = mid\r\n else:\r\n right = mid\r\n\r\n print(right)\r\n", "\r\ndef multiplicationTable(n, m, k):\r\n low, high = 1, n * m\r\n while low < high:\r\n mid = (low + high) // 2\r\n count = 0\r\n for i in range(1, n + 1):\r\n count += min(m, mid // i)\r\n if count < k:\r\n low = mid + 1 \r\n else: \r\n high = mid\r\n return low\r\n\r\nn, m, k = map(int, input().split())\r\nresult = multiplicationTable(n, m, k)\r\nprint(result)", "n, m, k = map(int, input().split())\r\nlo = 1\r\nhi = n * m\r\n\r\nwhile lo < hi:\r\n mid = (lo + hi) // 2\r\n count = 0\r\n for i in range(1, n + 1):\r\n count += min(m, mid // i)\r\n if count < k:\r\n lo = mid + 1 \r\n else:\r\n hi = mid\r\nprint(lo)", "# author: ankan2526\r\n\r\nimport sys,math,heapq,bisect,random,itertools\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(10**5)\r\n\r\nints = lambda : list(map(int,input().split()))\r\n#def gprint(ans=''):global t;print(f\"Case #{t+1}:\",*ans)\r\np = 10**9+7\r\ninf = 10**20+7\r\nALPHA = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\n#p2 = [1]\r\n#for i in range(70):p2.append(p2[-1]*2)\r\n\r\n\"\"\"\r\n\"\"\"\r\n\r\nn,m,k = ints()\r\n\r\nl,r = 1,n*m\r\n\r\nwhile l<=r:\r\n mid = (l+r)//2\r\n c = 0\r\n for i in range(1,n+1):\r\n x = mid//i\r\n if x>m:\r\n c += m\r\n else:\r\n c += x\r\n if c>=k:\r\n ans = mid\r\n r = mid-1\r\n else:\r\n l = mid+1\r\nprint(ans)\r\n", "n, m, k = [int(x) for x in input().split()]\r\n\r\nleft, right = 1, n*m\r\nwhile left < right:\r\n mid = (left + right) // 2\r\n # count the number of elements <= mid\r\n count = sum(min(mid // i, m) for i in range(1, n+1))\r\n if count < k:\r\n left = mid + 1\r\n else:\r\n right = mid\r\n\r\n# the kth largest element is left\r\nprint(left)\r\n", "def count(x, n, m):\r\n c = 0 \r\n x -= 1 \r\n for i in range(1, n + 1):\r\n c += min(m, x // i)\r\n return c\r\n\r\nn, m, k = map(int, input().split())\r\nl = 1\r\nr = n * m + 1 \r\nwhile(l < r):\r\n x = (l + r) // 2 \r\n if(count(x, n, m) < k):\r\n l = x + 1 \r\n else:\r\n r = x \r\nprint(l - 1)\r\n", "def works(X,N,M,K):\r\n #in each row, how many numbers are < X\r\n res = 0\r\n n = 1\r\n div = X/M\r\n while n < div:\r\n res += M\r\n n += 1\r\n while n < N+1:\r\n res += (X-1)//n\r\n n += 1\r\n return res\r\n \r\ndef solve():\r\n N, M, K = [int(s) for s in input().split()]\r\n left = 1\r\n right = K+1\r\n #we want the smallest smallest such that there are AT LEAST K-1 smaller numbers\r\n while right - left > 1:\r\n middle = (left+right)//2\r\n if works(middle,N,M,K) < K:\r\n left = middle\r\n else:\r\n right = middle\r\n #if there are exactly K-1 elements less than right, then this is our answer\r\n return left\r\n \r\n#for _ in range(getInt()): \r\nprint(solve())", "def countNumbers(x, n, m):\r\n count = 0\r\n for i in range(1, n+1):\r\n count += min(x // i, m)\r\n return count\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nlow, high = 1, n * m\r\n\r\nwhile low < high:\r\n mid = (low + high) // 2\r\n count = countNumbers(mid, n, m)\r\n if count < k:\r\n low = mid + 1\r\n else:\r\n high = mid\r\n\r\nprint(low)", "import math\r\narr = input().split()\r\nn = int(arr[0]) #rows\r\nm = int(arr[1]) #cols\r\nk = int(arr[2])\r\n\r\ndef numElemsBelow(mid):\r\n num = mid - 1\r\n i = m\r\n total = 0\r\n while (i > 0 and num / i < n):\r\n total += int(num / i)\r\n i -= 1\r\n total += i * n\r\n return total\r\n\r\nleft = 1\r\nright = n*m + 1\r\n# left, right, and mid are actual number values of elems in mult table\r\n# numElemsBelow returns number of indices and k is in terms of number of indices\r\nwhile (left < right):\r\n mid = (left + right) >> 1\r\n if (numElemsBelow(mid) < k):\r\n left = mid + 1\r\n else:\r\n right = mid\r\nprint(left - 1)", "from sys import stdin\r\ninput = stdin.readline\r\n \r\ninp = lambda : list(map(int,input().split()))\r\n\r\n\r\ndef check(x):\r\n\r\n count = 0\r\n for i in range(1 , n + 1):\r\n count += min(m , x // i)\r\n\r\n\r\n return (count >= k)\r\n \r\n\r\ndef answer():\r\n\r\n\r\n l , h = 1 , n * m\r\n while(l <= h):\r\n\r\n mid = (l + h) // 2\r\n if(check(mid)):\r\n ans = mid\r\n h = mid - 1\r\n else:\r\n l = mid + 1\r\n\r\n\r\n return ans\r\n\r\n\r\nfor T in range(1):\r\n\r\n n , m , k = inp()\r\n\r\n print(answer())\r\n", "# Your problem was that you tried to do something complicated with the binary search\n# technique, notice how n,m are small enough so that we could possible do some\n# O(n) technique. Instead of trying to preform a log technique, we could do a \n# binary search on your answer, we are allowed to iterate through rows or cols\n# a log number of times.\n\nn, m, k = map(int, input().split())\ndef works(x):\n num = 0\n for i in range(1, n+1):\n num += min(m, x//i)\n return num >= k\n\nleft = 1\nright = n*m\nans = right\n\nwhile left<=right:\n mid = left + (right-left)//2\n if works(mid):\n ans = mid\n right = mid-1\n else:\n left = mid+1\n\nprint(ans)\n", "n,m,k = [int(i) for i in input().strip().split()]\r\nlo = 1\r\nhi = n*m\r\nwhile lo<=hi:\r\n mid = (lo+hi)//2\r\n count = 0\r\n for i in range(1,n+1):\r\n val = mid//i\r\n count+=min(val,m)\r\n if val==0:\r\n break\r\n if count<k:\r\n lo = mid+1\r\n else:\r\n hi = mid-1\r\n ans = mid\r\nprint(ans)", "n, m, k = map(int, input().split())\r\nr, l = n * m + 1, 1\r\nwhile l < r:\r\n x = (l + r) // 2\r\n if sum(min(m, (x - 1) // i) for i in range(1, n + 1)) < k:\r\n l = x + 1\r\n else:\r\n r = x\r\nprint(l - 1)\r\n", "n, m, k = map(int, input().split())\r\nl, r = 1, n*m+1\r\nwhile l < r:\r\n mid = (l + r) // 2\r\n sm = sum(min(m, (mid-1)//i) for i in range(1, n+1))\r\n if sm < k:\r\n l = mid+1\r\n else:\r\n r = mid\r\nprint(l-1)" ]

[ "print(\"012102120210201021\"[int(input())%6*3+int(input())])\n\t\t \t\t\t \t \t\t \t\t \t\t \t \t \t\t\t\t", "n = int(input())\nx = int(input())\na = [[0, 1, 2], [1, 0, 2], [1, 2, 0], [2, 1, 0], [2, 0, 1], [0, 2, 1]]\n\nprint(a[n % 6][x])\n", "n=int(input())\r\nn%=6\r\na=[0,1,2]\r\nfor i in range(n):\r\n if i%2==0:\r\n a[0],a[1]=a[1],a[0]\r\n else:\r\n a[1],a[2]=a[2],a[1]\r\nprint(a[int(input())])", "\r\n\r\nl = '122100'\r\nm = '001221'\r\nr = '210012'\r\n\r\nn = int(input())\r\nb = input()\r\n\r\n\r\nn = n%6-1\r\n\r\n\r\n\r\nif l[n]==b:\r\n print(0)\r\nelif m[n]==b:\r\n print(1)\r\nelif r[n]==b:\r\n print(2)\r\n", "a = [1 , 2 , 2 , 1 , 0 , 0]\r\nb = [0 , 0 , 1 , 2 , 2 , 1]\r\nc = [2 , 1 , 0 , 0 , 1 , 2]\r\n\r\n\r\nn = int(input())\r\nn = n%6\r\n\r\nif not n: n = 6\r\n\r\nx = int(input())\r\nif a[n-1] == x: print(0)\r\nelif b[n-1] ==x: print(1)\r\nelse: print(2)", "# Bismillahir Rahmanir Rahim\r\n# @UTH0R :- A |-| |\\| A F\r\n\r\nn = int(input())\r\nx = int(input())\r\nans0, ans1, ans2 = [0,1,2,2,1,0], [1,0,0,1,2,2], [2,2,1,0,0,1]\r\nmod = n % 6\r\nif ans0[mod] == x: print(0)\r\nelif ans1[mod] == x: print(1)\r\nelse: print(2)\r\n", "n, l=int(input()), int(input())\r\na=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\"]\r\nprint(a[n%6][l])", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\n#\n# @Filename : 401_DIV2_A\n# @Date : 2017-09-18 16:08\n# @Author : LunaFire\n# @Mail : [email protected]\n\n\nif __name__ == \"__main__\":\n ret_map = [\n [0, 1, 2],\n [1, 0, 2],\n [1, 2, 0],\n [2, 1, 0],\n [2, 0, 1],\n [0, 2, 1]\n ]\n n = int(input())\n x = int(input())\n print(ret_map[n % 6][x])\n\n", "n = int(input())\r\nx = int(input())\r\nboards = [[0, 1, 2],\r\n [1, 0, 2],\r\n [1, 2, 0],\r\n [2, 1, 0],\r\n [2, 0, 1],\r\n [0, 2, 1]]\r\nprint(boards[n % 6][x])", "n = int(input())\r\nx = int(input())\r\nn = n % 6\r\na = [1, 2, 2, 1, 0, 0]\r\nb = [0, 0, 1, 2, 2, 1]\r\nc = [2, 1, 0, 0, 1, 2]\r\nif a[n - 1] == x:\r\n print(0)\r\nelif b[n - 1] == x:\r\n print(1)\r\nelse:\r\n print(2)", "n=int(input())%6\nx=int(input())\nfor i in range(n,0,-1):\n if i%2 == 1 and x < 2:\n x = 1 - x\n elif i%2 == 0 and x > 0:\n x = 3 - x\nprint(x)\n", "n = int(input())\r\nball = int(input())\r\n\r\nn = n % 6\r\n\r\nwhile n > 0:\r\n\tif n % 2 == 1:\r\n\t\tif ball == 0:\r\n\t\t\tball = 1\r\n\t\telif ball == 1:\r\n\t\t\tball = 0\r\n\telif n % 2 == 0:\r\n\t\tif ball == 1:\r\n\t\t\tball = 2\r\n\t\telif ball == 2:\r\n\t\t\tball = 1\r\n\tn -= 1\r\n\r\nprint(ball)", "a = [[1, 2, 3],\n [2, 1, 3],\n [2, 3, 1],\n [3, 2, 1],\n [3, 1, 2],\n [1, 3, 2]]\n\nn = int(input())\nx = int(input())\n\nn = n % 6\nprint(a[n][x] - 1)\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn,x=int(input())%6,int(input())\r\np=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\"]\r\nprint(p[n][x])", "n=int(input())\nx=int(input())\na=[0,1,2]\nfor i in range(1,int(n%6)+1):\n if(i%2==0):\n a[1],a[2]=a[2],a[1]\n else:\n a[0],a[1]=a[1],a[0]\nprint(a[x])\n", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n initial_position = int(input())\r\n rem = n % 6\r\n last_move = n % 2\r\n if last_move == 0:\r\n first_move = False\r\n else:\r\n first_move = True\r\n f = [0, 0, 0]\r\n f[initial_position] = 1\r\n for i in range(rem):\r\n if first_move:\r\n f[0], f[1] = f[1], f[0]\r\n else:\r\n f[1], f[2] = f[2], f[1]\r\n first_move = not first_move\r\n for i in range(len(f)):\r\n if f[i] == 1:\r\n print(i)\r\n\r\n\r\n\r\nmain_function()", "n=int(input())\nd=n%6\nx=int(input())\nans=[[0, 1, 2], [1, 0, 2], [1, 2, 0], [2, 1, 0], [2, 0, 1], [0, 2, 1]]\nprint(ans[d][x])\n\t", "\n\nn = int(input())\nx = input()\n\nans = '012210'\nfuck = -1\nfor i, k in enumerate(ans):\n if n % 2 == i % 2 and k == x: fuck = i\n\nans = 2 * ans\nprint(ans[fuck+6 - n%6])\n", "x=int(input())\r\ny=int(input())\r\nlst=[[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1]]\r\nx=x%6\r\nprint(lst[x][y])", "n=int(input())\r\nm=int(input())\r\nh=n%6\r\na=[2,1,1,2,3,3]\r\nb=[1,2,3,3,2,1]\r\nc=[3,3,2,1,1,2]\r\nif(a[h]==(m+1)):\r\n print(\"1\")\r\nelif(b[h]==(m+1)):\r\n print(\"0\")\r\nelse:\r\n print(\"2\")", "def comb(n):\n\tif n == 1:\n\t\treturn [0, 1, 2]\n\telif n == 2:\n\t\treturn [1, 0, 2]\n\telif n == 3:\n\t\treturn [1, 2, 0]\n\telif n == 4:\n\t\treturn [2, 1, 0]\n\telif n == 5:\n\t\treturn [2, 0, 1]\n\telse:\n\t\treturn [0, 2, 1]\n\n\nn = int(input())\nx = int(input())\n\nn = n % 6 + 1\nc = comb(n)\nprint(c[x])\n\n\n", "n = int(input())\r\ns = int(input())\r\nm = [(0,1,2), (1,0,2), (1,2,0), (2,1,0), (2,0,1), (0,2,1)]\r\nprint(m[n%6][s])", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n m = int(input())\r\n n %= 6\r\n A = [0, 1, 2]\r\n for i in range(n):\r\n if i % 2 == 0:\r\n A[0], A[1] = (A[1], A[0])\r\n else:\r\n A[1], A[2] = (A[2], A[1])\r\n print(A[m])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def f(l):\r\n n,x = l\r\n h0 = [0,1,1,2,2,0]\r\n h1 = [1,0,2,1,0,2]\r\n h2 = [2,2,0,0,1,1]\r\n hs = [h0,h1,h2]\r\n return hs[x][n%6]\r\n\r\nl = [int(input()) for _ in range(2)]\r\nprint(f(l))\r\n", "arr = [[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1]]\r\nn = int(input())\r\nk = int(input())\r\nx = n%6\r\nprint(arr[x][k])", "def solve(s,p):\r\n s%=6\r\n for i in range(s,0,-1):\r\n if i&1:\r\n if p==1 or p==0:\r\n p=1-p\r\n else:\r\n if p==2 or p==1:\r\n p=3-p\r\n return p\r\n\r\n\r\ns=int(input())\r\np=int(input())\r\nprint(solve(s,p))\r\n", "def main():\n n = int(input()) % 6\n x = int(input())\n\n for y in range(n):\n if (n - y) % 2 == 0:\n if x == 0:\n x = 0\n elif x == 1:\n x = 2\n elif x == 2:\n x = 1\n else:\n if x == 0:\n x = 1\n elif x == 1:\n x = 0\n elif x == 2:\n x = 2\n\n print(x)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input()) % 6\r\na = int(input())\r\nB = [0, 0, 0]\r\nB[a] = 1\r\n\r\nfor i in range(n, 0, -1):\r\n if (i % 2 == 0):\r\n B[1], B[2] = B[2], B[1]\r\n else:\r\n B[0], B[1] = B[1], B[0]\r\nprint(B.index(1))\r\n", "n = int(input())\r\n\r\nx = int(input())\r\n\r\n\r\nn = n % 6\r\n\r\ninp = [0, 1, 2]\r\n\r\nfor i in range(n):\r\n\tif i % 2 == 0:\r\n\t\tinp[0], inp[1] = inp[1], inp[0]\t\t\r\n\telse:\r\n\t\tinp[1], inp[2] = inp[2], inp[1]\r\n\t\t\r\nprint(inp[x])\r\n\r\n", "zero = [0, 1, 2, 2, 1, 0]\none = [1, 0, 0, 1, 2, 2]\ntwo = [2, 2, 1, 0, 0, 1]\nn = int(input())\nx = int(input())\nif(zero[n%6] == x):\n\tprint(0)\nelif(one[n%6] == x):\n\tprint(1)\nelse:\n\tprint(2)", "n=int(input())\r\nx=int(input())\r\na=n%6\r\nif(a==0):\r\n print(x)\r\nelif(a==1):\r\n if(x==2):\r\n print(x)\r\n else:\r\n print(1-x)\r\nelif(a==2):\r\n if(x==2):\r\n print(0)\r\n else:\r\n print(x+1)\r\nelif(a==3):\r\n if(x==1):\r\n print(1)\r\n else:\r\n print(2-x)\r\nelif(a==4):\r\n if(x==0):\r\n print(2)\r\n else:\r\n print(x-1)\r\nelse:\r\n if(x==0):\r\n print(0)\r\n elif(x==1):\r\n print(2)\r\n else:\r\n print(1)", "g = [[0,1,2], [1,0,2], [1,2,0], [2,1,0], [2,0,1], [0,2,1]]\r\nn = int(input())\r\ns = int(input())\r\nn = n%6\r\nprint(g[n][s])", "n=int(input())\r\nx=int(input())\r\np=[[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1],[0,1,2]]\r\nprint(p[int(n%6)][x])", "from sys import stdin\n\nN = int(stdin.readline().rstrip())\nX = int(stdin.readline().rstrip())\nmoves = N % 6\nshells = [False, False, False]\nshells[X] = True\nfor m in range(moves):\n if moves % 2 == 0 and m % 2 == 0\\\n or moves % 2 == 1 and m % 2 == 1:\n temp = shells[2]\n shells[2] = shells[1]\n shells[1] = temp\n else:\n temp = shells[0]\n shells[0] = shells[1]\n shells[1] = temp\nfor s in range(0, 3):\n if shells[s]:\n print(s)", "s = ['012', '102', '120', '210', '201', '021']\r\nn, x = int(input()), int(input())\r\nprint(s[n % 6][x])", "\r\np=['012','102','120','210','201','021']\r\nx=int(input())%6\r\nz=int(input())\r\nprint(p[x][z])", "n = int(input())\r\nx = int(input())\r\ndic0 = {1:1,2:2,3:2,4:1,5:0,0:0}\r\ndic1 = {1:0,2:0,3:1,4:2,5:2,0:1}\r\ndic2 = {1:2,2:1,3:0,4:0,5:1,0:2}\r\nt = n%6\r\nif dic0[t]==x:\r\n print(0)\r\nelif dic1[t]==x:\r\n print(1)\r\nelse:\r\n print(2)", "index=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\",\"012\"]\r\nn=int(input())\r\nx=int(input())\r\nprint(index[n%6][x])", "n=eval(input())\r\nx=eval(input())\r\nn=n%6\r\nif(n==0):\r\n n=6\r\na=[0]*3\r\na[1]=1\r\na[2]=2\r\nfor i in range(1,n+1):\r\n if(i%2==1):\r\n a[0],a[1]=a[1],a[0]\r\n else:\r\n a[1],a[2]=a[2],a[1]\r\nprint(a[x])\r\n", "N = int(input())\r\nend = int(input()) \r\nleft = [1, 2, 3, 3, 2, 1]\r\nmiddle = [2, 1, 1, 2, 3, 3]\r\n\r\n\r\nif left[N % 6] - 1 == end :\r\n print(0)\r\nelif middle[N % 6] - 1 == end :\r\n print(1) \r\nelse :\r\n print(2)\r\n", "a1=\"102\"\r\na2=\"120\"\r\na3=\"210\"\r\na4=\"201\"\r\na5=\"021\"\r\nn=int(input())\r\nx=int(input())\r\nif n%6==1: print(a1[x])\r\nelif n%6==2: print(a2[x])\r\nelif n%6==3: print(a3[x])\r\nelif n%6==4: print(a4[x])\r\nelif n%6==5: print(a5[x])\r\nelse: print(x)", "n=int(input())\r\nx=int(input())\r\na=[0,1,2]\r\nfor i in range(n%6):\r\n\tif i%2==0:\r\n\t\ta[0],a[1]=a[1],a[0]\r\n\telse:\r\n\t\ta[2],a[1]=a[1],a[2]\r\nprint(a[x])", "n=int(input())%6\r\nx=int(input())\r\nl=[[0,1,2], [1,0,2], [1,2,0], [2,1,0], [2,0,1], [0,2,1]]\r\nprint(l[n][x])", "n = int(input())\r\nx = int(input())\r\nlst = ['012', '102', '120', '210', '201', '021']\r\nprint(lst[n % 6][x])", "n = int(input())\nx = int(input())\n\nif n%2 == 0:\n x = (x + (n//2))%3\n print(x)\n\nelse:\n x = (x - (n//2))%3\n if x == 1:\n x = 0\n elif x == 0:\n x = 1\n print(x)\n", "n = int(input())\r\nl = int(input())\r\nif l == 0:\r\n k = 'oxx'\r\nelif l == 1:\r\n k = 'xox'\r\nelse:\r\n k = 'xxo'\r\nfor i in range(n%6+1,7):\r\n if i%2 == 0:\r\n k = k[0]+k[2]+k[1]\r\n else:\r\n k = k[1]+k[0]+k[2]\r\nprint(k.find('o'))", "a=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\"]\r\nn = int(input()) % 6\r\np = int(input())\r\ns = a[n]\r\nprint(s[p])\r\n", "nb_moves = int(input())\r\nball_at = int(input())\r\n\r\nball = [0, 0, 0]\r\nnb_moves %= 6\r\nball[ball_at] = 1\r\nfor i in range(nb_moves, 0, -1):\r\n if i % 2 == 0:\r\n ball[2], ball[1] = ball[1], ball[2]\r\n else:\r\n ball[1], ball[0] = ball[0], ball[1]\r\nprint(ball.index(1))\r\n", "n=int(input())\r\nx=int(input())\r\nn=n%6\r\npr=[[0,1,1,2,2,0],[1,0,2,1,0,2],[2,2,0,0,1,1]]\r\nprint(pr[x][n])", "l = [ [0,1,2], [1,0,2], [1,2,0], [2,1,0], [2,0,1], [0,2,1]]\r\nprint(l[int(input())%6][int(input())])", "N = int(input())\nX = int(input())\n\nN %= 6\n\nL = [0, 1, 2]\nflg = True\nfor i in range(N):\n if flg:\n L[0], L[1] = L[1], L[0]\n else:\n L[1], L[2] = L[2], L[1]\n flg = not flg\nprint(L[X])\n", "print(['012','102','120','210','201','021'][int(input())%6][int(input())])\n\n\n\t\t\t\t\t\t \t\t\t\t\t\t \t\t\t\t\t \t \t \t \t", "n=int(input())\r\nx=int(input())\r\nl1=[2,3,3,2,1,1]\r\nl2=[1,1,2,3,3,2]\r\nl3=[3,2,1,1,2,3]\r\nif l1[n%len(l1)-1]==x+1:\r\n print(0)\r\nelif l2[n%len(l2)-1]==x+1:\r\n print(1)\r\nelse:\r\n print(2)\r\n", "\r\nmovements = int(input())\r\nposition = int(input())\r\nlis = ['012','102','120','210','201','021']\r\nprint (lis[movements % 6][position])", "n = int(input())\r\nx = int(input())\r\n\r\nprint([\"012\", \"102\", \"120\", \"210\", \"201\", \"021\"][n%6][x])", "# print(\"Input n\")\nn = int(input())\n\n# print(\"Input x\")\nx = int(input())\n\nn = n % 6\n\nif (n==5 and x == 0) or (n==4 and x==1) or (n==3 and x==2) or (n==2 and x==2) or (n==1 and x==1) or (n==0 and x==0):\n print (0)\nelif (n==5 and x == 2) or (n==4 and x==2) or (n==3 and x==1) or (n==2 and x==0) or (n==1 and x==0) or (n==0 and x==1):\n print(1)\nelse:\n print(2)\n \n \n", "n = int(input())\r\nx = int(input())\r\nans = ['012', '102', '120', '210', '201', '021']\r\nprint(ans[n%6][x])", "def main():\r\n n = int(input())\r\n x = int(input())\r\n\r\n states = [\r\n (0, 1, 2),\r\n (1, 0, 2),\r\n (1, 2, 0),\r\n (2, 1, 0),\r\n (2, 0, 1),\r\n (0, 2, 1),\r\n\r\n ]\r\n\r\n print(states[n % 6][x])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "n = int(input())\nx = int(input())\n\nlef = [0,1,2,2,1,0,0]\nmid = [1,0,0,1,2,2,1]\nrig = [2,2,1,0,0,1,2]\n\ndef solve(n,x):\n n = n % 6\n if lef[n] == x:\n return 0\n if mid[n] == x:\n return 1\n return 2\n\nx = solve(n,x)\nprint(x)\n\n", "def main():\n n = int(input()) % 6\n x = int(input())\n data = [\n [0, 1, 2],\n [1, 0, 2],\n [1, 2, 0],\n [2, 1, 0],\n [2, 0, 1],\n [0, 2, 1],\n ]\n print(data[n][x])\n\nmain()\n", "n=int(input())\r\nx=int(input())\r\nn=n%6\r\na=[0,0,0]\r\na[x]=1;\r\nfor i in range(n,0,-1):\r\n if i%2:\r\n a[0],a[1]=a[1],a[0]\r\n else:\r\n a[1],a[2]=a[2],a[1]\r\nif(a[0]==1):\r\n print(0)\r\nif(a[1]==1):\r\n print(1)\r\nif(a[2]==1):\r\n print(2)", "n = int(input())\r\nx = int(input())\r\nl=['s','s']\r\nl.insert(x,x)\r\nif n<6:\r\n for i in range(n,0,-1):\r\n if i%2 == 0:\r\n l[1] ,l[2] = l[2] , l[1]\r\n if i%2 != 0:\r\n l[0] ,l[1] = l[1] , l[0]\r\nelse:\r\n if x==0:\r\n n = n%6\r\n if x==1:\r\n n = n%3\r\n if x==2:\r\n n = n%6\r\n for i in range(n, 0, -1):\r\n if i % 2 == 0:\r\n l[1], l[2] = l[2], l[1]\r\n if i % 2 != 0:\r\n l[0], l[1] = l[1], l[0]\r\nprint(l.index(x))\r\n", "#RAVENS #TEAM_2 #ESSI-DAYI_MOHSEN-LORENZO\nn = int(input())\nx = int(input())\ndef Print(x):print(x);exit()\n#0X0\nif (n % 3 == 0 and x == 1) or ((((n+5)/6 == (n+5)//6)or((n-1+5)/6 == (n-1+5)//6)) and x == 0) or ((((n+2)/6 == (n+2)//6)or((n-1+2)/6 == (n-1+2)//6)) and x== 2):Print(1)\n#X00\nif ((n+2)/3==(n+2)//3 and x == 1)or((((n+4)/6==(n+4)//6)or((n-1+4)/6==(n-1+4)//6)) and x==2)or((((n+1)/6==(n+1)//6)or((n-1+1)/6==(n-1+1)//6)) and x==0):Print(0)\nPrint(2)\n\n", "def solve(s,f):\r\n if s<0:\r\n return -1\r\n if not f in [0,1,2]:\r\n return -1\r\n s%=6\r\n for i in range(s,0,-1):\r\n if i&1:\r\n if f==1 or f==0:\r\n f=1-f\r\n else:\r\n if f==2 or f==1:\r\n f=3-f\r\n return f\r\n\r\n\r\ns=int(input())\r\np=int(input())\r\nprint(solve(s,p))\r\n", "n = int(input())\r\nx = int(input())\r\nn %= 6\r\nans = [[0, 1, 2], [1, 0, 2], [1, 2, 0], [2, 1, 0], [2, 0, 1], [0, 2, 1]]\r\nprint(ans[n][x])", "t = int(input())\r\npos = int(input())\r\n\r\ns = [False,False,False]\r\n\r\ns[pos] = True\r\n\r\n\r\n\r\nfor i in range(3) :\r\n\tp = t - i \r\n\trem = p % 3\r\n\tif(rem == 1 and pos == 1) :\r\n\t\tans = 0\r\n\t\tbreak\r\n\tif(rem == 0 and pos == 1) :\r\n\t\tans = 1\r\n\t\tbreak\r\n\tif(rem == 2 and pos == 1) :\r\n\t\tans = 2\r\n\t\tbreak\r\n\tif ( p % 2 == 0) : \r\n\t\tif(s[1] == 1 or s[2] == 1):\r\n\t\t\ts[1] = not(s[1])\r\n\t\t\ts[2] = not(s[2])\r\n\t\t\tif(s[1] == True) :\r\n\t\t\t\tpos = 1\r\n\t\t\telse :\r\n\t\t\t\tpos = 2\r\n\telse :\r\n\t\tif (s[0] == 1 or s[1] == 1) :\r\n\t\t\ts[0] = not(s[0])\r\n\t\t\ts[1] = not(s[1])\r\n\t\t\tif(s[0] == True) :\r\n\t\t\t\tpos = 0\r\n\t\t\telse :\r\n\t\t\t\tpos = 1\r\n\r\nprint (ans)\r\n\r\n", "n = int(input())\r\nx = int(input())\r\npossibleCombinations = ['012', '102', '120', '210', '201', '021']\r\ny = n % 6\r\nprint(possibleCombinations[y][x])", "n=int(input())\r\nx=int(input())\r\nif(n%2==0):\r\n\tif((n-2)%6==0):\r\n\t\tl=[1,2,0]\r\n\telif((n-4)%6==0):\r\n\t\tl=[2,0,1]\r\n\telif(n%6==0):\r\n\t\tl=[0,1,2]\r\n\tprint(l[x])\r\nelif(n%2!=0):\r\n\tif((n-1)%6==0):\r\n\t\tl=[1,0,2]\r\n\telif((n-3)%6==0):\r\n\t\tl=[2,1,0]\r\n\telse:\r\n\t\tl=[0,2,1]\r\n\tprint(l[x])", "ans=[[0,1,2,2,1,0],[1,0,0,1,2,2],[2,2,1,0,0,1]]\r\nn=int(input())\r\nn%=6\r\nx=int(input())\r\nfor i in range(3):\r\n\tif(ans[i][n]==x):\r\n\t\tprint(i)\r\n\t\texit(0)", "moves=int(input())%6\r\nposition=int(input())\r\nzeros=[0,1,2,2,1,0,]\r\nones=[1,0,0,1,2,2,]\r\ntwos=[2,2,1,0,0,1,]\r\nif zeros[moves]==position:\r\n\tprint(\"0\")\r\nif ones[moves]==position:\r\n\tprint(\"1\")\r\nif twos[moves]==position:\r\n\tprint(\"2\")", "\"\"\"\r\nhttps://codeforces.com/problemset/problem/777/A\r\nA. Shell Game\r\ntime limit per test0.5 seconds\r\nmemory limit per test256 megabytes\r\ninputstandard input\r\noutputstandard output\r\nBomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Operator takes three similar opaque shells and places a ball beneath one of them. Then he shuffles the shells by swapping some pairs and the player has to guess the current position of the ball.\r\n\r\nBomboslav noticed that guys are not very inventive, so the operator always swaps the left shell with the middle one during odd moves (first, third, fifth, etc.) and always swaps the middle shell with the right one during even moves (second, fourth, etc.).\r\n\r\nLet's number shells from 0 to 2 from left to right. Thus the left shell is assigned number 0, the middle shell is 1 and the right shell is 2. Bomboslav has missed the moment when the ball was placed beneath the shell, but he knows that exactly n movements were made by the operator and the ball was under shell x at the end. Now he wonders, what was the initial position of the ball?\r\n\r\nInput\r\nThe first line of the input contains an integer n (1 ≤ n ≤ 2·109) — the number of movements made by the operator.\r\n\r\nThe second line contains a single integer x (0 ≤ x ≤ 2) — the index of the shell where the ball was found after n movements.\r\n\r\nOutput\r\nPrint one integer from 0 to 2 — the index of the shell where the ball was initially placed.\r\n\r\nExamples\r\ninputCopy\r\n4\r\n2\r\noutputCopy\r\n1\r\ninputCopy\r\n1\r\n1\r\noutputCopy\r\n0\r\nNote\r\nIn the first sample, the ball was initially placed beneath the middle shell and the operator completed four movements.\r\n\r\nDuring the first move operator swapped the left shell and the middle shell. The ball is now under the left shell.\r\nDuring the second move operator swapped the middle shell and the right one. The ball is still under the left shell.\r\nDuring the third move operator swapped the left shell and the middle shell again. The ball is again in the middle.\r\nFinally, the operators swapped the middle shell and the right shell. The ball is now beneath the right shell.\r\n\r\n\"\"\"\r\nn = int(input())\r\nx = int(input())\r\nn=n%6\r\nstate = [0,1,2,2,1,0]\r\nif x==0 and n%2:pos=5\r\nif x==0 and not n%2:pos=0\r\nif x==1 and n%2:pos=1\r\nif x==1 and not n%2:pos=4\r\nif x==2 and n%2:pos=3\r\nif x==2 and not n%2:pos=2\r\nprint(state[(6+pos-n)%6])\r\n\r\n", "n = int(input())\r\nx = int(input())\r\nif(x==1):\r\n if(n%2==0):\r\n n-=1\r\n x=2\r\n else:\r\n x=0\r\n n-=1\r\nif(x==0):\r\n num = n%6\r\n if(num == 1 or num == 2):\r\n print(1)\r\n elif(num == 3 or num == 4):\r\n print(2)\r\n else:\r\n print(0)\r\nelif(x==2):\r\n num = n%6\r\n if(num == 4 or num == 5):\r\n print(1)\r\n elif(num == 3 or num == 2):\r\n print(0)\r\n else:\r\n print(2)", "n = int(input())\r\nx = int(input())\r\n\r\nn %= 6\r\narr = [0, 1, 2]\r\n\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n # unpacking\r\n arr[0], arr[1] = arr[1], arr[0]\r\n # rhs is same as tuple (arr[1], arr[0])\r\n else:\r\n arr[1], arr[2] = arr[2], arr[1]\r\n\r\n\r\nprint(arr[x])", "m = int(input())\r\np = int(input())\r\n\r\nif p == 0:\r\n print ((m+1)//2 % 3)\r\nelif p == 1:\r\n print ((0,2,1)[(m-1)%3])\r\nelse:\r\n print ((2,0,1)[(m%6)//2])", "n=int(input())\r\nx=int(input())\r\na = [[0,1,1,2,2,0],[1,0,2,1,0,2],[2,2,0,0,1,1]]\r\nprint(a[x][n%6])", "n=int(input(\"\"))\r\nx=int(input(\"\"))\r\nv=[1,2,3]\r\na1=[2,1,3,2,3,1,3,2,1,3,1,2,1,3,2,1,2,3]\r\nn1=n%6\r\nb=a1[(n1-1)*3+x]\r\nprint(v.index(b))\r\n\r\n \r\n", "n=int(input())%6\r\nx=int(input())\r\nl=[0,0,0]\r\nl[x]=1\r\nfor x in range(n,0,-1):\r\n if x%2!=0:\r\n l[0],l[1]=l[1],l[0]\r\n else:\r\n l[1],l[2]=l[2],l[1]\r\nprint(l.index(1))", "turns = int(input())\r\nend_pos = int(input())\r\nif end_pos == 0 and (turns % 6 == 5 or turns % 6 == 0):\r\n print(0)\r\nif end_pos == 0 and (turns % 6 == 1 or turns % 6 == 2):\r\n print(1)\r\nif end_pos == 0 and (turns % 6 == 3 or turns % 6 == 4):\r\n print(2)\r\nif end_pos == 1 and (turns % 6 == 1 or turns % 6 == 4):\r\n print(0)\r\nif end_pos == 1 and (turns % 6 == 3 or turns % 6 == 0):\r\n print(1)\r\nif end_pos == 1 and (turns % 6 == 2 or turns % 6 == 5):\r\n print(2)\r\nif end_pos == 2 and (turns % 6 == 2 or turns % 6 == 3):\r\n print(0)\r\nif end_pos == 2 and (turns % 6 == 4 or turns % 6 == 5):\r\n print(1)\r\nif end_pos == 2 and (turns % 6 == 1 or turns % 6 == 0):\r\n print(2)\r\n", "a = [0, 1, 2]\r\nb = [1, 0, 2]\r\nc = [1, 2, 0]\r\nd = [2, 1, 0]\r\ne = [2, 0, 1]\r\nf = [0, 2, 1]\r\ng = [0, 1, 2]\r\n\r\nz = [a, b, c, d, e, f, g]\r\n\r\nn = int(input())\r\nx = int(input())\r\n\r\nprint(z[n % 6][x])", "n = int(input())\nx = int(input())\nn %= 6\narr = [\n \"012\",\n \"102\",\n \"120\",\n \"210\",\n \"201\",\n \"021\"\n ]\nprint(arr[n][x])\n", "# L R L R L R L R L R L R\n# 0 1 2 2 1 0 0 1 2 2 1 0 ...\n# 1 0 0 1 2 2 1 0 0 1 2 2 ...\n# 2 2 1 0 0 1 2 2 1 0 0 1 ...\n\n\n\ndef main():\n n = int(input())\n x = int(input())\n\n patterns = [ [0, 1, 2, 2, 1, 0], [1, 0, 0, 1, 2, 2], [2, 2, 1, 0, 0, 1] ]\n\n n %= 6\n for i, pattern in enumerate(patterns):\n if pattern[n] == x:\n print(i)\n\nmain()\n", "n = int(input())\r\nk = int(input())\r\n\r\narr = [\"012\", \"102\", \"120\", \"210\", \"201\", \"021\"]\r\n\r\nn %= len(arr)\r\n\r\nprint(arr[n][k])", "n = int(input())\r\nx = int(input())\r\nlst = [\r\n [1,2,3],\r\n [2,1,3],\r\n [2,3,1],\r\n [3,2,1],\r\n [3,1,2],\r\n [1,3,2]\r\n]\r\nn %= 6\r\nprint(lst[n][x] - 1)", "n = int(input())\r\nx = int(input())\r\n\r\nnl = [0, 1, 2]\r\nk = n%6\r\nfor i in range(k):\r\n if i % 2 == 0:\r\n nl[0], nl[1] = nl[1], nl[0]\r\n else:\r\n nl[1], nl[2] = nl[2], nl[1]\r\n\r\nprint(nl[x])", "n, x = int(input()), int(input())\r\nprint([[0, 1, 2], [1, 0, 2], [1, 2, 0], [2, 1, 0], [2, 0, 1], [0, 2, 1]][n % 6][x])", "def solve():\r\n\r\n n = int(input())\r\n num = n%6\r\n k = int(input())\r\n arr = [[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1]]\r\n print(arr[num][k])\r\n\r\n\r\nsolve()\r\n", "n = int(input())\r\nx = int(input())\r\nans = 0\r\nif x == 1:\r\n if n%2!=0:\r\n x=0\r\n else:\r\n x=2\r\n n-=1\r\nif x == 2:\r\n if n%2==0:\r\n p=n//3\r\n if p%2!=0:\r\n ans = n%3\r\n else:\r\n ans=2-n%3\r\n else:\r\n p=(n-1)//3\r\n if p%2!=0:\r\n ans = (n-1)%3\r\n else:\r\n ans=2-(n-1)%3\r\nif x==0:\r\n if n%2==0:\r\n p=(n-1)//3\r\n if p%2!=0:\r\n ans=2-(n-1)%3\r\n else:\r\n ans=(n-1)%3\r\n else:\r\n p=n//3\r\n if p%2!=0:\r\n ans = 2-n%3\r\n else:\r\n ans=n%3\r\nprint(ans)", "n = int(input())\r\nx = int(input())\r\nif x == 0:\r\n if (n-1)%6 == 0 or (n-2)%6 == 0:\r\n print('1')\r\n elif (n-3)%6 == 0 or (n-4)%6 == 0:\r\n print('2')\r\n else:\r\n print('0')\r\nelif x == 1:\r\n if n%3 == 1:\r\n print('0')\r\n elif n%3 == 2:\r\n print('2')\r\n else:\r\n print('1')\r\nelse:\r\n if (n-2)%6 == 0 or (n-3)%6 == 0:\r\n print('0')\r\n elif (n-5)%6 == 0 or (n-4)%6 == 0:\r\n print('1')\r\n else:\r\n print('2')", "N = int( input() ) % 6\r\nX = int( input() )\r\nfor i in range( N, 0, -1 ) :\r\n if i & 1 and X < 2 :\r\n X = 1 - X\r\n elif ~i & 1 and X :\r\n X = 3 - X\r\nprint( X )\r\n", "n = int(input())\r\nm = int(input())\r\ns = [0,0,0]\r\ns[m]=1\r\nfor i in range(n%6,0,-1) :\r\n if i % 2 == 0 :\r\n s[1],s[2]=s[2],s[1]\r\n else :\r\n s[0],s[1]=s[1],s[0]\r\nfor i in range(3) :\r\n if s[i] :\r\n print(i)", "n=int(input())%6\r\nx=int(input())\r\np=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\"]\r\nprint(p[n][x])\r\n", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint as pp\r\nmod = 1000000007\r\n\r\n\r\ndef vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\nn, x = int(input()), int(input())\r\nn %= 6\r\n\r\nwhile n > 0:\r\n if n % 2 == 0:\r\n if x == 2:\r\n x = 1\r\n elif x == 1:\r\n x = 2\r\n else:\r\n if x == 0:\r\n x = 1\r\n elif x == 1:\r\n x = 0\r\n n -= 1\r\nprint(x)\r\n", "n=int(input())\r\nx=int(input())\r\nn%=6\r\na=[[0,1,1,2,2,0],[1,0,2,1,0,2],[2,2,0,0,1,1]]\r\nprint(a[x][n])", "import sys\nimport math\nimport time\n\n\ndef main():\n lines = list(map(str.strip, sys.stdin.readlines()))\n indices = [[0, 1, 2],\n [1, 0, 2],\n [1, 2, 0],\n [2, 1, 0],\n [2, 0, 1],\n [0, 2, 1]]\n\n n = int(lines[0])\n x = int(lines[1])\n\n print(indices[n % 6][x])\n\nif __name__ == \"__main__\":\n main()\n", "n,x=int(input())%6,int(input())\r\nwhile n>0:\r\n if n%2!=0:\r\n if x==0:x=1\r\n elif x==1:x=0\r\n else:\r\n if x==1:x=2\r\n elif x==2:x=1\r\n n-=1\r\nprint(x)", "def main():\n read = lambda: tuple(map(int, input().split()))\n n, k = read()[0], read()[0]\n n %= 6\n l = [0, 1, 2]\n def swap(a, b):\n tmp = l[a]\n l[a] = l[b]\n l[b] = tmp\n for i in range(1,n+1):\n if i % 2 == 0:\n swap(1, 2)\n else:\n swap(0, 1)\n print(l[k])\nmain()\n", "n, m = int(input()), int(input());\r\nn = (n - 1) % 6 + 1;\r\na = [0, 1, 2];\r\nfor i in range(1, n + 1) :\r\n if (i & 1) : a[0], a[1] = a[1], a[0];\r\n else : a[1], a[2] = a[2], a[1];\r\nprint(a[m]);\r\n", "I = lambda: list(map(int, input().split()))\r\nn = int(input())\r\nx = int(input())\r\nn -= n//6*6\r\n\r\nw = [i==x for i in [0,1,2]]\r\nfor i in range(n, 0, -1):\r\n if i%2:\r\n w = [w[1], w[0], w[2]]\r\n else:\r\n w = [w[0], w[2], w[1]]\r\nprint(w.index(True))", "from sys import stdin\r\nfrom collections import Counter\r\n\r\nrd = stdin.readline\r\n\r\nn = int(rd())\r\nx = int(rd())\r\n\r\n#012 -> 102 -> 120 -> 210 -> 201 -> 021 -> 012\r\n\r\ns1 = [1, 0, 2]\r\ns2 = [1, 2, 0]\r\ns3 = [2, 1, 0]\r\ns4 = [2, 0, 1]\r\ns5 = [0, 2, 1]\r\n\r\nif n % 6 == 0: print(x)\r\nelif n % 6 == 1: print(s1[x])\r\nelif n % 6 == 2: print(s2[x])\r\nelif n % 6 == 3: print(s3[x])\r\nelif n % 6 == 4: print(s4[x])\r\nelse: print(s5[x])\r\n", "a = [0,1,2]\nb = []\n#print(a)\nb.append(a.copy())\nfor x in range(1,6):\n\tif x % 2 == 1:\n\t\ta[0], a[1] = a[1], a[0]\n\telse:\n\t\ta[1], a[2] = a[2], a[1]\n\t\tpass\n\t#print(x, a)\n\tb.append(a.copy())\n\t#print(b)\nn = int(input())\nxx = int(input())\n\nn %= 6\n\nprint(b[n][xx])", "Check, N = [False] * 3, int(input()) % 6\r\nCheck[int(input())] = True\r\nwhile N != 0:\r\n if N % 2 == 0:\r\n Check[2], Check[1] = Check[1], Check[2]\r\n else:\r\n Check[0], Check[1] = Check[1], Check[0]\r\n N -= 1\r\nprint(Check.index(True))\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Mashhad for few days\r\n# Caption: New rank has been achieved\r\n# CodeNumber: 705\r\n", "print(('012', '102', '120', '210', '201', '021')[int(input())%6][int(input())])", "n=int(input(\"\"))\r\nx=int(input(\"\"))\r\nnums=[0,1,2,2,1,0]\r\nif nums[n%6]==x: print(0)\r\nelif nums[(n-2)%6]==x: print(1)\r\nelse: print(2)", "n = int(input())\r\nx = int(input())\r\nn %= 6\r\nsrc = [0, 1, 2]\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n src[0], src[1] = src[1], src[0]\r\n else:\r\n src[1], src[2] = src[2], src[1]\r\nprint(src[x])", "steps = int(input())\r\nresult = int(input())\r\ncicle = [0, 0, 1, 2, 2, 1]\r\nif steps > 6:\r\n\tsteps = steps%6\r\nif steps % 2== 0:\r\n\tfor i in (1, 3, 5):\r\n\t\tif cicle[i] == result:\r\n\t\t\tindex_of_last_step = i + 1\r\n\t\t\tbreak\r\n\tvalue_of_begin = cicle[index_of_last_step - (steps+1)]\r\nelse:\r\n\tfor i in (0, 2, 4):\r\n\t\tif cicle[i] == result:\r\n\t\t\tindex_of_last_step = i\r\n\t\t\tbreak\r\n\tvalue_of_begin = cicle[index_of_last_step - steps]\r\nprint(value_of_begin)", "x = int(input())\ny = int(input())\n\ntable = [ [1,1,2,2,0,0], [0,2,1,0,2,1], [2,0,0,1,1,2] ]\n\nif x == 0:\n print(y)\nelse:\n x = x % 6\n print(table[y][x - 1])\n \n \n ", "n = int(input())\nx = int(input())\n\nt = n % 6\n\nif t == 0:\n print(x)\nelif t == 1:\n if x == 0:\n print(1)\n elif x == 1:\n print(0)\n else:\n print(2)\nelif t == 2:\n if x == 0:\n print(1)\n elif x == 1:\n print(2)\n else:\n print(0)\nelif t == 3:\n if x == 0:\n print(2)\n elif x == 1:\n print(1)\n else:\n print(0)\nelif t == 4:\n if x == 0:\n print(2)\n elif x == 1:\n print(0)\n else:\n print(1)\nelse:\n if x == 0:\n print(0)\n elif x == 1:\n print(2)\n else:\n print(1)", "n=int(input())\r\nx=int(input())\r\nans=[ [1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1],[0,1,2] ]\r\np=n%6\r\nif p==0:p=6\r\nprint(ans[p-1][x])", "n, x = int(input()) % 6, int(input())\r\ndata = [0, 0, 0]\r\ndata[x] = 1\r\n\r\nwhile n > 0:\r\n step = n % 2\r\n data[2 - step], data[1 - step] = data[1 - step], data[2 - step]\r\n n -= 1\r\nprint(data.index(1))\r\n", "n = int(input())\r\nx = int(input())\r\na = [0] * 3\r\na[x] = 1\r\nfor i in range(n % 6 + 1, 7):\r\n if i % 2 == 1:\r\n a[0], a[1] = a[1], a[0]\r\n else:\r\n a[1], a[2] = a[2], a[1]\r\nfor i in range(3):\r\n if a[i] == 1:\r\n print(i)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\nn=int(input())%6\r\nx=int(input())\r\na=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\"]\r\nprint(a[n][x])", "n = int(input())\nf = int(input())\n\nn %= 6\ninitial = [0, 1, 2]\n\nk = 0\nfor _ in range(n):\n initial[k], initial[k + 1] = initial[k + 1], initial[k]\n k = (k + 1) % 2\n\nprint(initial[f])", "n,x=int(input())%6,int(input())\r\np=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\"]\r\nprint(p[n][x])", "n = int(input())\r\nt = int(input())\r\nn%=6\r\ne = [0,1,2]\r\nfor i in range(n):\r\n if(i%2==0):\r\n e[0],e[1] = e[1],e[0]\r\n else:\r\n e[1],e[2] = e[2],e[1]\r\nprint(e[t])\r\n ", "n = int(input())\r\nx = int(input())\r\ns = ['012', '102', '120', '210', '201', '021']\r\nprint(s[n % 6][x])", "n = int(input())\r\nn = n%6\r\npos = int(input())\r\narr=[[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1]]\r\nif(pos == 0):\r\n\tprint(arr[n][pos])\r\nelif(pos == 1):\r\n\tprint(arr[n][pos])\r\nelse:\r\n\tprint(arr[n][pos])\r\n\r\n", "x = int(input())\r\nn = int(input())\r\nst = n\r\nif x % 4 == 1:\r\n if n == 1:\r\n st = 0\r\n if n == 2:\r\n st = 2\r\n if n == 0:\r\n st = 1\r\nif x % 4 == 2:\r\n if n == 1:\r\n st = 2\r\n if n == 2:\r\n st = 0\r\n if n == 0:\r\n st = 1\r\nif x % 4 == 3:\r\n if n == 1:\r\n st = 1\r\n if n == 2:\r\n st = 0\r\n if n == 0:\r\n st = 2\r\nsts = x // 4\r\nif sts % 3 == 0:\r\n print(st)\r\nif sts % 3 == 1:\r\n print((st - 1) % 3)\r\nif sts % 3 == 2:\r\n print((st - 2) % 3)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = int(input())\r\n\r\nn = n%6\r\nwhile n:\r\n if n % 2 == 0:\r\n if x == 1:\r\n x = 2\r\n elif x == 2:\r\n x = 1\r\n else:\r\n x = 0\r\n else:\r\n if x == 1:\r\n x = 0\r\n elif x == 2:\r\n x = 2\r\n else:\r\n x = 1\r\n n-= 1\r\nprint(x)\r\n", "#problem81\r\na=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\"]\r\nprint(a[(int(input()))%6][int(input())])", "n = int(input())\r\nx = int(input())\r\nmatrix = {0:[0, 1, 2], 1:[1, 0, 2], 2:[1, 2, 0], 3:[2, 1, 0], 4:[2, 0, 1], 5:[0, 2, 1]}\r\nprint(matrix[n%6][x])", "l = [[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1]]\nn = int(input())\nx = int(input())\na = n%6\n#print (a)\nprint (l[a][x])\t\t\n\n", "\nans=((0,1,2),(1,0,2),(1,2,0),(2,1,0),(2,0,1),(0,2,1));\nn=input()\nx=input()\na=int(n)\nb=int(x)\na=a%6\nprint(ans[a][b])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nx = int(input())\r\n\r\nn %= 6\r\n\r\nif n == 0:\r\n print(x)\r\nelif n == 1:\r\n if x == 2:\r\n print(x)\r\n else:\r\n print(1-x)\r\nelif n == 2:\r\n print((x + 1) % 3)\r\nelif n == 3:\r\n if x == 1:\r\n print(x)\r\n else:\r\n print(2-x)\r\nelif n == 4:\r\n print((x-1) % 3)\r\nelse:\r\n if x == 0:\r\n print(x)\r\n else:\r\n print(3-x)\r\n\r\n#print('\\n'.join(map(str, out)))\r\n", "def nap(y):\r\n if y==0:\r\n p=[0,1,2]\r\n return p\r\n if y==1:\r\n p=[1,0,2]\r\n return p\r\n if y==2:\r\n p=[1,2,0]\r\n return p\r\n if y==3:\r\n p=[2,1,0]\r\n return p\r\n if y==4:\r\n p=[2,0,1]\r\n return p\r\n if y==5:\r\n p=[0,2,1]\r\n return p\r\nn=int(input())\r\nx=int(input())\r\nn=n%6\r\nm=nap(n)\r\nprint(m[x])\r\n", "if __name__ == \"__main__\":\n n = int(input())\n index = int(input())\n\n n = n % 6\n\n boxes = [False] * 3\n boxes[index] = True\n\n while n > 0:\n if n % 2 != 0:\n boxes[0], boxes[1] = boxes[1], boxes[0]\n else:\n boxes[1], boxes[2] = boxes[2], boxes[1]\n n -= 1\n \n print(boxes.index(True))", "numb = [0, 0, 1, 2, 2, 1]\r\n#odd, then even\r\nchart = [1, 0, 5, 2, 3, 4]\r\nadd = int(input())\r\nstart = int(input())\r\nstart = 2*start\r\nif add % 2 == 0:\r\n start += 1\r\nadd = (add+chart[start])%6\r\nprint(numb[add])", "n=int(input())\r\nx=int(input())\r\ns=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\"]\r\nprint(s[n%6][x])", "n = int(input())\nx = int(input())\n\n#n%6 to get remainder\n\nif 1 <= n <= 6:\n if n==1:\n if x == 0:\n print (\"1\")\n elif x == 1:\n print (\"0\")\n elif x == 2:\n print (\"2\")\n\n if n==2:\n if x == 0:\n print (\"1\")\n elif x == 1:\n print (\"2\")\n elif x == 2:\n print (\"0\")\n\n if n==3:\n if x == 0:\n print (\"2\")\n elif x == 1:\n print (\"1\")\n elif x == 2:\n print (\"0\")\n\n if n==4:\n if x == 0:\n print (\"2\")\n elif x == 1:\n print (\"0\")\n elif x == 2:\n print (\"1\")\n\n if n==5:\n if x == 0:\n print (\"0\")\n elif x == 1:\n print (\"2\")\n elif x == 2:\n print (\"1\")\n\n if n==6:\n print (x)\n \nelse:\n if n%6 == 0: #6\n print (x)\n\n elif n%6 == 1:\n if x == 0:\n print (\"1\")\n elif x == 1:\n print (\"0\")\n elif x == 2:\n print (\"2\")\n\n elif n%6 == 2:\n if x == 0:\n print (\"1\")\n elif x == 1:\n print (\"2\")\n elif x == 2:\n print (\"0\")\n\n elif n%6 == 3:\n if x == 0:\n print (\"2\")\n elif x == 1:\n print (\"1\")\n elif x == 2:\n print (\"0\")\n\n elif n%6 == 4:\n if x == 0:\n print (\"2\")\n elif x == 1:\n print (\"0\")\n elif x == 2:\n print (\"1\")\n\n elif n%6 == 5:\n if x == 0:\n print (\"0\")\n elif x == 1:\n print (\"2\")\n elif x == 2:\n print (\"1\")\n", "n=int(input())\r\nx=int(input())\r\nif n%6==0:\r\n print(x)\r\nelif n%6==1:\r\n if x==0:\r\n print(1)\r\n elif x==1:\r\n print(0)\r\n else:\r\n print(2)\r\nelif n%6==2:\r\n if x==0:\r\n print(1)\r\n elif x==1:\r\n print(2)\r\n else:\r\n print(0)\r\nelif n%6==3:\r\n if x==0:\r\n print(2)\r\n elif x==1:\r\n print(1)\r\n else:\r\n print(0)\r\nelif n%6==4:\r\n if x==0:\r\n print(2)\r\n elif x==1:\r\n print(0)\r\n else:\r\n print(1)\r\nelse:\r\n if x==0:\r\n print(0)\r\n elif x==1:\r\n print(2)\r\n else:\r\n print(1)", "from sys import stdin\n\nN = int(stdin.readline())\nX = int(stdin.readline())\n\nmoves = [\n [0, 1, 2],\n [1, 0, 2],\n [1, 2, 0],\n [2, 1, 0],\n [2, 0, 1],\n [0, 2, 1]\n]\n\nprint(moves[N % len(moves)][X])\n", "n=int(input())\r\nx=int(input())\r\nwhile n%6:\r\n n+=1\r\n if n%2:\r\n if x<2:x^=1\r\n else:\r\n if x>0:x=(x-1^1)+1\r\nprint(x)", "l=[\"012\",\"102\",\"120\",\"210\",\"201\",\"021\"]\r\nn=int(input())\r\nx=int(input())\r\nr=n%6\r\na=l[r]\r\nprint(a[x])", "n = int(input())\r\nx = int(input())\r\n\r\nif n % 6 == 0:\r\n print(x)\r\nelif n % 6 == 5:\r\n if x == 0:\r\n print(0)\r\n if x == 1:\r\n print(2)\r\n if x == 2:\r\n print(1)\r\nelif n % 6 == 4:\r\n if x == 0:\r\n print(2)\r\n if x == 1:\r\n print(0)\r\n if x == 2:\r\n print(1)\r\nelif n % 6 == 3:\r\n if x == 0:\r\n print(2)\r\n if x == 1:\r\n print(1)\r\n if x == 2:\r\n print(0)\r\nelif n % 6 == 2:\r\n if x == 0:\r\n print(1)\r\n if x == 1:\r\n print(2)\r\n if x == 2:\r\n print(0)\r\nelif n % 6 == 1:\r\n if x == 0:\r\n print(1)\r\n if x == 1:\r\n print(0)\r\n if x == 2:\r\n print(2)", "n = int(input()) % 6\r\nx = int(input())\r\na = [0, 0, 0]\r\na[x] = 1\r\nfor i in range(n, 0, -1):\r\n if i % 2:\r\n a[0], a[1] = a[1], a[0]\r\n else:\r\n a[1], a[2] = a[2], a[1]\r\nif a[0] == 1:\r\n print(0)\r\nelif a[1] == 1:\r\n print(1)\r\nelse:\r\n print(2)\r\n", "n = int(input())\r\nx = int(input())\r\na = [0,1,2]\r\ndef swap(t1,t2):\r\n return t2,t1\r\nn%=6\r\nfor i in range(n):\r\n if i%2==0:\r\n a[0],a[1] = swap(a[0],a[1])\r\n else:\r\n a[1],a[2] = swap(a[1],a[2])\r\n\r\nprint(a[x])\r\n", "n = int(input())\r\nx = int(input())\r\n\r\nd = {\r\n 0: [0, 1, 2],\r\n 1: [1, 0, 2],\r\n 2: [2, 0, 1],\r\n 3: [2, 1, 0],\r\n 4: [1, 2, 0],\r\n 5: [0, 2, 1]\r\n}\r\n\r\nmove = n % 6\r\narr = d.get(move)\r\nstart = arr.index(x)\r\n\r\nprint(start)\r\n", "n, x = (int(input()) for _ in range(2))\n# for i in range(3):\n# p = [0] * 3\n# p[i] = 1\n# for k in range(20):\n# if k & 1 == 0:\n# p[0], p[1] = p[1], p[0]\n# else:\n# p[1], p[2] = p[2], p[1]\n# print(f\"start={i}, k={k + 1}: {p}\")\nm = [\n [0, 1, 2],\n [1, 0, 2],\n [1, 2, 0],\n [2, 1, 0],\n [2, 0, 1],\n [0, 2, 1],\n]\nres = m[n % 6][x]\nprint(res)\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\nn = int(input())\r\nx = int(input())\r\n\r\nn = n%6\r\na = [i for i in range(3)]\r\nfor i in range(n):\r\n if i%2 == 0:\r\n a[0], a[1] = a[1], a[0]\r\n else:\r\n a[1], a[2] = a[2], a[1]\r\nprint(a[x])", "print([[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1],[0,1,2]][int(input())%6][int(input())])", "n=int(input())\r\nm=int(input())\r\nsumm=n%6\r\nif summ==0:\r\n print(m)\r\nelif summ==1:\r\n if m==1:\r\n print(0)\r\n elif m==0:\r\n print(1)\r\n else:\r\n print(2)\r\nelif summ==2:\r\n if m==1:\r\n print(2)\r\n elif m==0:\r\n print(1)\r\n else:\r\n print(0)\r\nelif summ==3:\r\n if m==1:\r\n print(1)\r\n elif m==0:\r\n print(2)\r\n else:\r\n print(0)\r\nelif summ==4:\r\n if m==1:\r\n print(0)\r\n elif m==0:\r\n print(2)\r\n else:\r\n print(1)\r\nelif summ==5:\r\n if m==1:\r\n print(2)\r\n elif m==0:\r\n print(0)\r\n else:\r\n print(1)\r\nelse:\r\n pass\r\n ", "test=[[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1]]\r\nn=int(input())\r\nk=int(input())\r\nn%=6\r\nprint(test[n][k])", "n = int(input())\r\nx = int(input())\r\n\r\na = [0, 0, 0]\r\na[x] = 1\r\n\r\nfor i in range(n % 6):\r\n if (n - i) % 2 == 0:\r\n a[1], a[2] = a[2], a[1]\r\n else:\r\n a[0], a[1] = a[1], a[0]\r\n\r\nif a[0]:\r\n print(0)\r\nif a[1]:\r\n print(1)\r\nif a[2]:\r\n print(2)", "n = int(input())\nx = int(input())\n\nshells = [0, 0, 0]\nshells[x] = 1\n\nif x == 0:\n n = n % 6\nif x == 1:\n n = n % 3\nif x == 2:\n n = n % 6\n\n\nfor i in range(n, 0, -1):\n if i % 2 == 0:\n shells[1], shells[2] = shells[2], shells[1]\n if i % 2 == 1:\n shells[0], shells[1] = shells[1], shells[0]\n\nif shells[0]:\n print(0)\nif shells[1]:\n print(1)\nif shells[2]:\n print(2)\n\n\n#1 0 0 needs 5 mov if it is odd\n# 6 mov if it is even\n\n#0 1 0 needs 3 mov if it is odd\n# 3 mov if it is even\n\n#0 0 1 needs 6 mov if it is odd\n# 5 mov if it is even\n\n", "n = int(input())\r\nx = int(input())\r\nif x == 0:\r\n\tfl1 = True\r\n\tfl2 = fl3 = False\r\nelif x == 1:\r\n\tfl1 = fl3 = False\r\n\tfl2 = True\r\nelse:\r\n\tfl1 = fl2 = False\r\n\tf3 = True\r\nn = n % 6\r\nif n == 0:\r\n\tif fl1:\r\n\t\tprint(0)\r\n\telif fl2:\r\n\t\tprint(1)\r\n\telse:\r\n\t\tprint(2)\r\nelif n == 1:\r\n\tif fl1:\r\n\t\tprint(1)\r\n\telif fl2:\r\n\t\tprint(0)\r\n\telse:\r\n\t\tprint(2)\r\nelif n == 2:\r\n\tif fl1:\r\n\t\tprint(1)\r\n\telif fl2:\r\n\t\tprint(2)\r\n\telse:\r\n\t\tprint(0)\r\nelif n == 3:\r\n\tif fl1:\r\n\t\tprint(2)\r\n\telif fl2:\r\n\t\tprint(1)\r\n\telse:\r\n\t\tprint(0)\r\nelif n == 4:\r\n\tif fl1:\r\n\t\tprint(2)\r\n\telif fl2:\r\n\t\tprint(0)\r\n\telse:\r\n\t\tprint(1)\r\nelse:\r\n\tif fl1:\r\n\t\tprint(0)\r\n\telif fl2:\r\n\t\tprint(2)\r\n\telse:\r\n\t\tprint(1)\r\n\t\t\t\r\n", "def get_pos(x,y):\n if x >= y:\n return y-1\n return (y%x)-1\n\ndef solve(n,x):\n a1 = [1,2,2,1,0,0]\n a2 = [0,0,1,2,2,1]\n \n\n pos1 = get_pos(len(a1),n)\n if a1[pos1] == x:\n return 0\n \n pos2 = get_pos(len(a2),n)\n if a2[pos2] == x:\n return 1 \n\n return 2\n \n\n\ndef main():\n n = int(input())\n x = int(input())\n # arr = []\n # for _ in range(n):\n # arr.append(int(input()))\n print(solve(n,x))\n\nmain()", "n = int(input())\r\nx = int(input())\r\n\r\narr = [[0,1,2], [1,0,2], [1,2,0], [2,1,0], [2,0,1],[0,2,1]]\r\nn = n%6\r\n\r\nprint(arr[n][x])\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nimport re\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n\"\"\"\r\n\"\"\"\r\ndef get(n, x):\r\n d0 = [0,1,2,2,1,0]\r\n d1 = [1,0,0,1,2,2]\r\n d2 = [2,2,1,0,0,1]\r\n r = n%6\r\n if d0[r] == x:\r\n return 0\r\n if d1[r] == x:\r\n return 1\r\n if d2[r] == x:\r\n return 2\r\n\r\ndef solve():\r\n n = II()\r\n x = II()\r\n print(get(n,x))\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()\r\n", "l=[[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1],[0,1,2]]\r\nn=int(input())%6\r\nm=int(input())\r\nprint(l[n][m])\r\n", "import sys\r\ncups = [[0, 1, 2], [1, 0 ,2], [1, 2, 0], [2, 1, 0], [2, 0, 1], [0, 2, 1]]\r\n\r\nn = int(input()) \r\nx = int(input())\r\n\r\nm = n % 6\r\n\r\n\r\nprint (cups[m][x])\r\n", "n = int(input())\r\nx = int(input())\r\n\r\nn = n % 6\r\n\r\na = [0, 1, 2]\r\ni = 0\r\nfor j in range(n):\r\n a[i], a[i + 1] = a[i + 1], a[i]\r\n i = (i + 1) % 2\r\n \r\nprint(a[x])", "n = int(input())\r\nx = int(input())\r\nxs = {0:[0,1,2], 1:[1,0,2], 2:[1,2,0], 3:[2,1,0], 4:[2,0,1], 5:[0,2,1]}\r\nprint(xs[n%6][x])", "e=[[1, 0, 2],[2, 0, 1],[2, 1, 0],[1, 2, 0],[0, 2, 1],[0,1,2]]\r\nn=int(input())\r\nk=int(input())\r\nn=(n-1)%6\r\nh=e[n]\r\nfor a in range(3):\r\n if h[a]==k:\r\n print(a)\r\n quit()", "n = int(input())\r\nx= int(input())\r\nd = n%6\r\nrs = [[1,0,2],\r\n [1,2,0],\r\n [2,1,0],\r\n [2,0,1],\r\n [0,2,1],\r\n [0,1,2]]\r\nprint(rs[d-1][x])", "n = int(input())\r\nfin_pos = int(input())\r\nn = n % 6\r\na = [0, 1, 2]\r\nchanges_made = {}\r\nfor i in range(1, 7):\r\n\tif i % 2 == 1:\r\n\t\ta[0], a[1] = a[1], a[0]\r\n\t\tb = a.copy()\r\n\t\tchanges_made[i] = b\r\n\telse:\r\n\t\ta[1], a[2] = a[2], a[1]\r\n\t\tb = a.copy()\r\n\t\tchanges_made[i] = b\r\nchanges_made[0] = changes_made[6]\r\nstart_pos = changes_made[n][fin_pos]\r\nprint(start_pos)", "n=int(input())\r\np=int(input())\r\nls1=[0,1,2]\r\nls2=[1,0,2]\r\nif(n%6==0):\r\n print(ls1[p])\r\nelif(n%6==1):\r\n print(ls2[p])\r\nelif(n%6==2):\r\n ls1=ls1[1:]+ls1[:1]\r\n print(ls1[p])\r\nelif(n%6==3):\r\n ls2=ls2[-1:]+ls2[:-1]\r\n print(ls2[p])\r\nelif(n%6==4):\r\n ls1=ls1[2:]+ls1[:2]\r\n print(ls1[p])\r\nelif(n%6==5):\r\n ls2=ls2[-2:]+ls2[:-2]\r\n print(ls2[p])", "n=int(input())\r\nx=int(input())\r\nseq=[[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1]]\r\np=n%6\r\nprint(seq[p][x])", "from doctest import master\r\n\r\n\r\nn=int(input())\r\nx=int(input())\r\nm=n%6\r\nmas=[0,0,0]\r\nmas[x]=1\r\n# mas=[[0,1,2],[1,0,2],[1,2,0],[2,1,0],[2,0,1],[0,2,1]]\r\n# mas.reverse()\r\nfor i in range(m,0,-1):\r\n if i%2==0:\r\n mas[1],mas[2]=mas[2],mas[1]\r\n \r\n else:\r\n mas[0],mas[1]=mas[1],mas[0]\r\n\r\nprint(mas.index(1))\r\n\r\n ", "n= int(input())\r\nx= int(input())\r\na = [1,2,3]\r\nif(n%6==1):\r\n a = [2,1,3]\r\nif(n%6==2):\r\n a =[2,3,1]\r\nif(n%6==3):\r\n a = [3,2,1]\r\nif(n%6==4):\r\n a = [3,1,2]\r\nif(n%6==5):\r\n a =[1,3,2]\r\nprint(a[x]-1)", "N, Pos = int(input()), int(input())\r\nif N % 3 == 0:\r\n Line = [0, 1, 2]\r\nelif N % 3 == 1:\r\n Line = [1, 0, 2]\r\nelif N % 3 == 2:\r\n Line = [1, 2, 0]\r\nif (N // 3) % 2 == 0:\r\n pass\r\nelse:\r\n Line.reverse()\r\nprint(Line[Pos])", "l = [[0, 1, 2], [1, 0, 2], [1, 2, 0], [2, 1, 0], [2, 0, 1], [0, 2, 1]]\r\nprint(l[int(input()) % 6][int(input())])", "n = int(input())\r\nx = int(input())\r\nk = n % 6\r\na = [0] * 3\r\na[x] = 1\r\n\r\n\r\nfor i in range(n, n - k, -1):\r\n if i % 2 != 0:\r\n a[0], a[1] = a[1], a[0]\r\n else:\r\n a[1], a[2] = a[2], a[1]\r\nfor i in range(len(a)):\r\n if a[i]:\r\n print(i)\r\n", "n=int(input())\r\nx=int(input())\r\n\r\nstate=[(0,1,2),(1,0,2),(1,2,0),(2,1,0),(2,0,1),(0,2,1)];\r\ns2=state[n%6]\r\nprint(state[n%6][x])", "a, n, x = [], int(input()), int(input())\r\na1 = [0, 1, 2, 2, 1, 0]\r\na2 = [1, 0, 0, 1, 2, 2]\r\na3 = [2, 2, 1, 0, 0, 1]\r\nif a1[n % 6] == x: print(0)\r\nelif a2[n % 6] == x: print(1)\r\nelse: print(2)", "n=int(input())\r\nx=int(input())\r\nif x==0:\r\n if n%6==3 or n%6==4:\r\n print(2)\r\n elif n%6==1 or n%6==2:\r\n print(1)\r\n elif n%6==5 or n%6==0:\r\n print(0)\r\nelif x==1:\r\n if n%3==0:\r\n print(1)\r\n elif n%3==1:\r\n print(0)\r\n elif n%3==2:\r\n print(2)\r\nelse:\r\n if n%6==0 or n%6==1:\r\n print(2)\r\n elif n%6==4 or n%6==5:\r\n print(1)\r\n elif n%6==2 or n%6==3:\r\n print(0)\r\n", "n = int(input())\r\nx = int(input())\r\ns = [0,1,2]\r\nn=n%6\r\nfor i in range(1,n+1):\r\n if(i%2==0):\r\n s[1],s[2]=s[2],s[1]\r\n else:\r\n s[0],s[1]=s[1],s[0]\r\nprint(s[x])", "n=int(input())\nx=int(input())\n\nb0=[0,1,2,2,1,0]\nb1=[1,0,0,1,2,2]\nb2=[2,2,1,0,0,1]\n\nn1=n%6\nif x==int(b0[n1]):\n\tans=0\nif x==int(b1[n1]):\n\tans=1\nif x==int(b2[n1]):\n\tans=2\nprint(ans)\n", "n = int(input())\r\nn %= 6\r\nx = int(input())\r\na = [0, 1, 2]\r\n\r\nfor i in range(1, n+1):\r\n if i&1:\r\n a[0], a[1] = a[1], a[0]\r\n else:\r\n a[1], a[2] = a[2], a[1]\r\n \r\nprint(a[x])\r\n", "n=int(input())\r\na=int(input())\r\nb=n%6\r\nl=[0,1,2]\r\nfor i in range(b) :\r\n if (i+1)%2!=0 :\r\n c=l[0]\r\n l[0]=l[1]\r\n l[1]=c\r\n else :\r\n c=l[1]\r\n l[1]=l[2]\r\n l[2]=c\r\n\r\nprint(l[a])\r\n", "def solve():\r\n shells = [False] * 3\r\n n = int(input())\r\n x = int(input())\r\n\r\n shells[x] = True\r\n n %= 6\r\n\r\n for i in range(n, 0, -1):\r\n if i % 2:\r\n shells[0], shells[1] = shells[1], shells[0]\r\n else:\r\n shells[1], shells[2] = shells[2], shells[1]\r\n\r\n for i in range(3):\r\n if shells[i]:\r\n print(i)\r\n return None\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n=int(input())\r\nx=int(input())\r\nl=[0,1,2]\r\nn=n%6\r\nfor i in range(1,n+1):\r\n\tif(i%2==0):\r\n\t\tl[1],l[2]=l[2],l[1]\r\n\telse:\r\n\t\tl[0],l[1]=l[1],l[0]\r\nprint(l[x])\r\n", "a = \"122100\"\r\nb = \"001221\"\r\nc = \"210012\"\r\n\r\ntmp = int(input()) % 6 - 1\r\ndata = input()\r\nif data == a[tmp]:\r\n print(0)\r\nelif data == b[tmp]:\r\n print(1)\r\nelse:\r\n print(2)", "n=int(input()); x=int(input())\r\ni=n\r\nwhile i>0:\r\n if i%2==0: \r\n if x==1: x=2\r\n elif x==2: x=1\r\n if x==0: i%=6\r\n else:\r\n if x==1: x=0\r\n elif x==0: x=1\r\n i-=1\r\nprint(x)\r\n\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nclass FenwickTreeMinMax:\r\n def __init__(self, n, func, ini):\r\n self.size = n\r\n self.a = [ini] * (n + 1)\r\n self.b = self.a[:]\r\n self.func = func\r\n self.ini = ini\r\n\r\n def _lowbit(self, index):\r\n return index & (-index)\r\n\r\n def update(self, index, val):\r\n self.a[index] = val\r\n while index <= self.size:\r\n self.b[index] = val\r\n i = 1\r\n while i < self._lowbit(index):\r\n self.b[index] = self.func(self.b[index], self.b[index - i])\r\n i <<= 1\r\n index += self._lowbit(index)\r\n\r\n def query(self, l, r):\r\n res = self.ini\r\n while r >= l:\r\n res = self.func(res, self.a[r])\r\n r -= 1\r\n while r - self._lowbit(r) >= l:\r\n res = self.func(res, self.b[r])\r\n r -= self._lowbit(r)\r\n return res\r\n\r\n\r\nclass BinIndexTreeMin:\r\n def __init__(self, size):\r\n self.size = size\r\n self.a = [10 ** 9 for _ in range(size + 5)]\r\n self.h = self.a[:]\r\n self.mn = 10 ** 9\r\n\r\n def update(self, x, v):\r\n if v < self.mn:\r\n self.mn = v\r\n a = self.a\r\n h = self.h\r\n a[x] = v\r\n while x <= self.size:\r\n if h[x] >= v:\r\n h[x] = v\r\n else:\r\n break\r\n x += self.lowbit(x)\r\n\r\n def query(self, l, r):\r\n ans = self.a[r]\r\n while l != r:\r\n r -= 1\r\n while r - self.lowbit(r) > l:\r\n if ans > self.h[r]:\r\n ans = self.h[r]\r\n if ans == self.mn:\r\n break\r\n # ans = min(ans, self.h[r])\r\n r -= self.lowbit(r)\r\n # ans = min(ans, self.a[r])\r\n if ans > self.a[r]:\r\n ans = self.a[r]\r\n if ans == self.mn:\r\n break\r\n return ans\r\n\r\n def lowbit(self, x):\r\n return x & -x\r\n\r\nn, m = map(int, input().split())\r\nmaxlen = 10 ** 6\r\na = [maxlen] + list(map(int, input().split()))\r\nq = []\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n q.append((l, r, i))\r\nq.sort(key=lambda x: x[1])\r\nnums, r_ls = {}, [maxlen] * (n + 1)\r\nfor i in range(1, n + 1):\r\n if a[i] in nums:\r\n r_ls[i] = nums[a[i]]\r\n nums[a[i]] = i\r\nft = BinIndexTreeMin(n)\r\nres, cur = [maxlen] * m, 1\r\nfor i in range(m):\r\n l, r, qi = q[i]\r\n while cur <= r:\r\n if r_ls[cur] != maxlen:\r\n ft.update(r_ls[cur], cur - r_ls[cur])\r\n cur += 1\r\n res[qi] = ft.query(l, r)\r\nfor i in range(m):\r\n print(res[i] if res[i] < maxlen else -1)", "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\nN,M=map(int,readline().split())\r\nA=list(map(int,readline().split()))\r\nquery=[[] for r in range(N+1)]\r\nfor m in range(M):\r\n l,r=map(int,readline().split())\r\n l-=1\r\n query[r].append((l,m))\r\nans_lst=[None]*M\r\nprev={}\r\ninf=1<<30\r\nDST=Dual_Segment_Tree(N+1,min,inf,min,[inf]*(N+1))\r\nfor r in range(1,N+1):\r\n if A[r-1] in prev:\r\n i=prev[A[r-1]]\r\n DST.Operate_Range(r-1-i,0,i+1)\r\n prev[A[r-1]]=r-1\r\n for l,q in query[r]:\r\n ans=DST[l]\r\n if ans==inf:\r\n ans=-1\r\n ans_lst[q]=ans\r\nprint(*ans_lst,sep=\"\\n\")\r\n" ]

[ "n = int(input())\n\ncont = 0\nfor i in range(n, 0, -1):\n if n%i == 0:\n n = i\n \n if cont == 0:\n cont = 1\n else:\n print(' ', end = '')\n \n print(n, end = '')\nprint()\n \t \t \t\t\t\t\t\t \t\t \t\t\t \t \t\t\t", "n = int(input())\r\nif n== 1:\r\n print(1)\r\n exit()\r\nanswer = [n]\r\ndef factors(x):\r\n for i in range(2,x + 1):\r\n if x % i == 0:\r\n return x//i\r\n return 1\r\nwhile True:\r\n n = factors(n)\r\n answer.append(n)\r\n if n == 1:\r\n break\r\nprint(*answer)", "import math\r\n\r\nN = 10**6+50\r\nspf = [-1]*(N+1)\r\nfor i in range(N+1):\r\n spf[i] = i\r\nfor i in range(2, int(math.sqrt(N))+1):\r\n if spf[i] == i:\r\n for j in range(i*2, N+1, i):\r\n if spf[j] == j:\r\n spf[j] = i\r\n\r\ndef factorize(n):\r\n d = {}\r\n while n != 1:\r\n p = spf[n]\r\n if p in d:\r\n d[p] += 1\r\n else:\r\n d[p] = 1\r\n n //= p\r\n return d\r\n\r\nn = int(input())\r\nans = []\r\nwhile n != 1:\r\n ans.append(n)\r\n p = spf[n]\r\n n //= p\r\nans.append(1)\r\nprint(*ans)\r\n", "n = int(input())\r\nans = []\r\nans.append(n)\r\nimport math\r\nwhile n != 1 :\r\n if n <= 3:\r\n ans.append(n)\r\n n = 1 \r\n break\r\n if n == 4:\r\n ans.append(4)\r\n ans.append(2)\r\n n = 1 \r\n break \r\n if n == 5:\r\n ans.append(5)\r\n n = 1 \r\n break \r\n sqrt = int( math.sqrt(n)) + 1\r\n flag = 0 \r\n for i in range(2, sqrt):\r\n if n % i == 0 :\r\n #ans.append(i)\r\n flag = 1 \r\n break \r\n if flag == 0 :\r\n ans.append(n)\r\n n = 1 \r\n break \r\n n = n // i \r\n ans.append(n)\r\nans.append(1)\r\ndicts = {}\r\nfor i in ans:\r\n if i not in dicts:\r\n dicts[i] = 1 \r\nuniqans = []\r\nfor k, v in dicts.items():\r\n uniqans.append(k)\r\nuniqans = sorted(uniqans)\r\nuniqans = uniqans[::-1]\r\nstrans = []\r\nfor i in uniqans:\r\n strans.append(str(i))\r\nprint(\" \".join(strans))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "def coins():\r\n a=int(input())\r\n c=[]\r\n for i in range(a,0,-1):\r\n if a%i==0:\r\n c.append(i)\r\n a=i\r\n print(*c)\r\ncoins()", "test =int(input())\r\nfor i in range(test,0,-1):\r\n if test%i==0:\r\n test=i\r\n print(test)", "# LUOGU_RID: 99725707\nimport math\n\nn=int(input())\nprint(n,end=' ')\nwhile n!=1:\n for i in range(n):\n if n%(i+2)==0:\n n=int(n/(i+2))\n print(n,end=' ')\n break#add", "a = int(input())\r\nfor i in range(a, 0, -1):\r\n if a % i == 0:\r\n print(i, end=' ')\r\n a = i", "n = int(input())\r\nans = str(n)\r\nfor i in range(2, n+1):\r\n while n%i == 0:\r\n n = n // i\r\n ans += \" \" + str(n) \r\nprint(ans)\r\n", "n = int(input())\r\n\r\ndenominations = []\r\ni = n\r\n\r\nwhile i > 0:\r\n if n % i == 0:\r\n denominations.append(i)\r\n n = i\r\n i -= 1\r\n\r\nprint(\" \".join(map(str, denominations)))\r\n", "n = int(input())\r\nprint(n, end=\" \")\r\ni = n // 2\r\nwhile i:\r\n if not n % i:\r\n n = i\r\n print(n, end=\" \")\r\n i -= 1\r\n", "def num(a):\r\n w=int(a/2)\r\n for j in range(w,0,-1):\r\n if j==1:\r\n print('1')\r\n break\r\n elif a%j==0:\r\n print(j,end=' ')\r\n num(j)\r\n break\r\na=int(input())\r\nprint(a,end=' ')\r\nnum(a)", "n = int(input())\r\n\r\nfor x in range(2, 1 + int(n**.5)):\r\n while not n%x:\r\n print(n, end=' ')\r\n n //= x\r\n\r\nprint(n, end=' ')\r\n\r\nif n>1:\r\n print(1)", "def solve():\n if n==2:\n return '2 1'\n if n==1 :\n return '1'\n fac=[n]\n for i in range(n-1,0,-1) :\n if fac[-1]%i==0:\n fac.append(i)\n\n return ''.join(str(x)+' ' for x in fac).strip()\n \n \n\n\n\n\n\n\n\n \n \n \nfrom sys import stdin\ninput = stdin.readline\n \n\nn= int(input())\n#arr=[int(x) for x in input().split()]\nprint(solve())", "n = int(input())\r\n\r\na = [True for i in range(0,n+1)]\r\n\r\n\r\np = 2\r\nwhile(p*p <= n):\r\n\tif(a[p] == True):\r\n\t\tfor i in range(p*p, n+1, p):\r\n\t\t\ta[i] = False\r\n\tp += 1\r\n\r\n\r\n\r\n\r\nres = [n]\r\nwhile(n!=1):\r\n\tfor i in range(2,n+1):\r\n\t\tif(n%i==0 and a[i] == True):\r\n\t\t\tres.append(n//i)\r\n\t\t\tn = n//i\r\n\t\t\tbreak\r\n#res.append(1)\r\n\r\nfor i in range(len(res)):\r\n\tprint(res[i],end = ' ')", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nn1 = n\r\nd = []\r\nfor i in range(2,int(n**0.5)+1):\r\n if n1%i==0:\r\n while n1%i==0:\r\n n1//=i\r\n d.append(i)\r\nif n1!=1:\r\n d.append(n1)\r\nd = sorted(d)\r\nprint(n,end=\" \")\r\nfor elem in d:\r\n n//=elem\r\n print(n,end=\" \")\r\nprint()", "import math\r\n\r\nN = int(input())\r\ns = str(N)\r\nwhile(N!=1):\r\n\t#print(N)\r\n\ttrigger = False\r\n\tfor i in range(2,math.ceil(math.sqrt(N))+1):\r\n\t\tif(N%i==0):\r\n\t\t\ts+=\" \"+str(N//i)\r\n\t\t\tN = N//i\r\n\t\t\ttrigger = True\r\n\t\t\tbreak\r\n\tif not trigger:\r\n\t\tbreak\r\nif(s[len(s)-2:]!=\" 1\" and s!=\"1\"):\r\n s+=\" 1\" \r\nprint (s)\r\n", "a=int(input())\r\nf=[]\r\nt=[]\r\nfor i in range(1,a+1):\r\n if a%i==0:\r\n f.append(i)\r\nf.remove(a)\r\nr=sorted(f)\r\nt=r[:]\r\nr.reverse()\r\nfor b in r:\r\n for u in t:\r\n if (b>u) and (b%u!=0) and (u in r):\r\n r.remove(u)\r\nr.reverse()\r\nr.append(a)\r\nr.reverse()\r\nv=list(map(str,r))\r\nprint(' '.join(v))\r\n", "n = int(input())\r\nd = 2\r\na = [str(n)]\r\nwhile d * d <= n:\r\n while n % d == 0:\r\n n //= d\r\n a.append(str(n))\r\n d += 1\r\nif n > 1:\r\n a.append(\"1\")\r\nprint(\" \".join(a))", "n = int(input())\r\n\r\ndef do(n):\r\n for i in range(2,(n//2)+1):\r\n if n%i==0:\r\n return n//i\r\n return 1\r\nans = [n]\r\nwhile(n!=1):\r\n n = do(n)\r\n ans.append(n)\r\nprint(*ans)", "import math\r\n\r\ndef smallest_factor(num):\r\n # dont give 1\r\n for i in range(2, 1+num):\r\n if num % i == 0:\r\n return i\r\n\r\ncoin = int(input())\r\n\r\ndenoms = []\r\nwhile True:\r\n denoms.append(coin)\r\n if coin == 1:\r\n break\r\n coin //= smallest_factor(coin)\r\n\r\nprint(*denoms)", "\"\"\"\n#1 brute force / knapsack?\n- get all divisors of n\n- for each divisor:\n - get max value of count for each prev divisor dividing it as well\n - store best one as prev and its count plus 1\n- walk backwards from n, printing \n\n(can also likely be solved recursively by solving for cases less than n\nthat must be divisible by n)\n------\n#2 get all divisors and solve as a knapsack problem?\n- find all divisors from 1 to n\n- for each divisor, see what max is if we include it or not\n\ntrying to find denomination with most coins\nmost coins for including c_i = max(most for c_(i-1), most for most recent divsor of c_i + 1)\n-------------------\n#3 Also can be a graph search:\n- build adjacency list: j has directed edge to k if k | j; 100 has directed edge to 50 because 50 | 100.\n - get all divisors from 1 to n of n\n - each time a divisor k of n is found, add edge from n to k, and add edges from k to any previous divisors of n that are also divisors of k\n- find longest path in graph from n to 1. Shortest path can be achieved with BFS. Since all edges are equal weight, we could exhaustively explore the graph and keep track of longest graph. \n - Could leverage caching? do we need to re-explore routes if we already know the longest way to get to 1 from them? \n - Won't be too helpful, will be very small graph since there are likely fewer than 100 nodes, each of which will have relatively few edges\n\"\"\"\n\ndef solve_case(n):\n \"\"\"\n Approach #2\n \"\"\"\n # (i, max coins, prev coin)\n divisors = [(1, 1, None)]\n for i in range(2, n+1):\n if (n % i == 0):\n divisors.append((i, 1, None))\n \n for i, divisor in enumerate(divisors[1:], start=1):\n curr = divisor[0]\n for j, j_max, j_prev in divisors[i-1::-1]:\n if (curr % j == 0) and (j_max >= divisors[i][1]):\n divisors[i] = (curr, j_max+1, j) \n \n curr = n\n for i, _, prev in divisors[::-1]:\n if i == curr:\n print(i, end=\" \")\n curr = prev\n\nif __name__ == '__main__':\n solve_case(int(input()))\n", "def g(n):\r\n sq=int(n**0.5)\r\n for i in range(2,sq+2):\r\n if(n%i==0):\r\n return n//i\r\n return 1\r\nn=int(input())\r\nwhile(n!=1):\r\n print(n,end=\" \")\r\n n=g(n)\r\nprint(1)\r\n", "x=int(input())\r\nfor i in range(x,0,-1):\r\n\tif x%i==0:x=i;print(x,end=' ')", "n=int(input())\r\nd=2\r\nprint(n,end=' ')\r\nwhile n>1:\r\n while n/d != n//d :\r\n d+=1\r\n n/=d\r\n print(int(n),end=' ')\r\n\r\n", "n = int(input())\r\nn1 = n\r\na1 = set([1, n])\r\npro = 1\r\nfor p in range(2, n):\r\n if n > 1 and n%p==0:\r\n# print (n, p, pro)\r\n if p%pro:\r\n continue\r\n a1.add(p)\r\n n//=p\r\n pro*=p\r\n if not n:\r\n break\r\nn = n1\r\na2 = set([1, n])\r\npro = n\r\nfor p in range(n-1, 1, -1):\r\n if n > 1 and n%p==0:\r\n# print (n, p, pro)\r\n if pro%p:\r\n continue\r\n a2.add(p)\r\n n=p\r\n pro=p\r\n if not n:\r\n break\r\n#print (a2)\r\nif len(a1)>len(a2):\r\n a = a1\r\nelse:\r\n a = a2\r\na = list(a)\r\na.sort(reverse=True)\r\n\r\n\r\n\r\na = list(a)\r\na.sort(reverse=True)\r\nprint(*a)\r\n", "para = int(input())\r\ni = 2\r\nprint(para, end=' ')\r\nwhile para > 1:\r\n if para % i == 0:\r\n para = para / i\r\n print(int(para), end=' ')\r\n else:\r\n i = i + 1 ", "n=int(input())\r\nlist1=[n]\r\nfor i in range(n-1,0,-1):\r\n if(n%i==0):\r\n list1.append(i)\r\n n=i\r\nprint(*list1)", "num =int(input(\"\"))\r\nl=[]\r\nfor i in range(1,num+1):\r\n if num%i==0:\r\n \r\n l.append(i)\r\nl.reverse()\r\nnew=[num] \r\nfor i in l:\r\n \r\n if new[-1]%i==0:\r\n new.append(i)\r\nfor i in range (1,len(new)):\r\n print(new[i],end=\" \")\r\n\r\n \r\n ", "n=int(input())\r\nres=[]\r\nfor i in range(n,0,-1):\r\n if n%i==0:\r\n n=i\r\n res.append(i)\r\nprint(*res)", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int, stdin.readline().split()))\r\ndef fn(x):\r\n mx=1\r\n p=2\r\n while p*p<=x:\r\n if x%p==0:\r\n mx=max(mx,p,x//p)\r\n p+=1\r\n return mx\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n s={n}\r\n while n!=1:\r\n n=fn(n)\r\n s.add(n)\r\n print(*sorted(s,reverse=True))", "n=int(input())\r\ntemp=n\r\nfor x in range(n,0,-1):\r\n \r\n if(n%x==0):\r\n print(x,end=\" \")\r\n n=x\r\n \r\n", "import math\r\n\r\nn = int(input()) \r\norign = n\r\n\r\ndef sE(n):\r\n zz = []\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p ** 2, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n prime[0]= False\r\n prime[1]= False\r\n for p in range(n + 1):\r\n if prime[p]:\r\n zz.append(p) \r\n return zz\r\n \r\n\r\nprimefac = [] \r\nsss = sE(int(math.sqrt(n))) \r\nwhile n > 1: \r\n for i in sss:\r\n if n % i == 0: \r\n n //= i \r\n primefac.append(i) \r\n break\r\n else: \r\n primefac.append(n) \r\n break\r\n\r\nans = f\"{orign} \"\r\ndiv = 1\r\nfor i in primefac: \r\n div *= i \r\n ans += str((orign // div)) + \" \" \r\n\r\nprint(ans)\r\n", "import math\r\nn = int(input())\r\nans = []\r\nfor i in range(n, 0, -1):\r\n\tif n % i == 0:\r\n\t\tn = i\r\n\t\tans.append(n)\r\nfor i in ans:\r\n\tprint(i),", "def f(n):\r\n num = n\r\n for j in range(n, 0, -1):\r\n if num % j == 0:\r\n print(j, end = ' ')\r\n num = j\r\nf(int(input()))\r\n", "import math\r\nn=int(input())\r\nd=[]\r\nfor i in range(1, int(math.sqrt(n))+1):\r\n if(n%i==0):\r\n d.append(i)\r\n if(i!=n//i):\r\n d.append(n//i)\r\nd.sort(reverse=True)\r\nl=[n]\r\nfor a in d[1:]:\r\n if(l[-1]%a ==0):\r\n l.append(a)\r\nprint(*l)", "n = int(input())\r\nresult = []\r\nresult.append(n)\r\nwhile n != 1:\r\n if n % 2 == 0:\r\n result.append(n // 2)\r\n n = n // 2\r\n else:\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n result.append(n // i)\r\n n = n // i\r\n break\r\nfor j in range(len(result)):\r\n print(result[j], end=\"\\n\")", "def check(l,i):\r\n\tfor z in l:\r\n\t\tif z%i!=0:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nn=int(input())\r\nl=[]\r\nfor i in reversed(range(1,n+1)):\r\n\ttry:\r\n\t\tif n%i==0 and check(l,i):\r\n\t\t\tl.append(i)\r\n\texcept:\r\n\t\tif n%i==0:\r\n\t\t\tl.append(i)\r\nfor i in l:\r\n\tprint(i,end=\" \")", "n = int(input())\r\nm = [n]\r\nf = 0\r\nfor i in range(n, 0, -1):\r\n if n % i == 0:\r\n if m[-1] % i == 0:\r\n m.append(i)\r\nm.pop(0)\r\nprint(*m)\r\n", "n = int(input())\r\nNewCoin = n\r\nk=2\r\nans = []\r\nans.append(NewCoin)\r\nwhile (k<=NewCoin):\r\n if NewCoin%k==0:\r\n ans.append(NewCoin//k)\r\n NewCoin //=k\r\n else:\r\n k+=1\r\nfor i in ans:\r\n print(i,end=' ')", "n = int(input())\ntmp = []\nfor x in reversed(range(n + 1)):\n if x > 0:\n if n % x == 0:\n tmp.append(x)\n n = x\nfor x in tmp:\n print(x, end=\" \")\n \t\t \t \t\t \t \t \t\t\t \t \t \t\t\t", "max_coin = int(input())\n\nlist_coins = []\nwhile max_coin != 1:\n list_coins.append(max_coin)\n\n for i in range(2, max_coin + 1):\n if max_coin % i == 0:\n max_coin = int(max_coin / i)\n break\n\nlist_coins.append(1)\n\nprint(*list_coins)\n", "import math\r\n \r\n# A function to print all prime factors of\r\n# a given number n\r\ndef primeFactors(n):\r\n d = {}\r\n # Print the number of two's that divide n\r\n while n % 2 == 0:\r\n #l.append(2)\r\n if 2 in d:\r\n d[2] +=1\r\n else:\r\n d[2] = 1\r\n \r\n n = n//2\r\n \r\n # n must be odd at this point\r\n # so a skip of 2 ( i = i + 2) can be used\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n \r\n # while i divides n , print i and divide n\r\n while n % i== 0:\r\n #l.append(i)\r\n if i in d:\r\n d[i] +=1\r\n else:\r\n d[i] = 1\r\n n = n // i\r\n \r\n # Condition if n is a prime\r\n # number greater than 2\r\n if n > 2:\r\n d[n] = 1\r\n \r\n return d\r\n \r\n# Driver Program to test above function\r\n \r\nn = int(input())\r\nd = primeFactors(n)\r\nans = [n]\r\np = list(d.keys())\r\nfor i in range(len(p)):\r\n x = d[p[i]]\r\n for j in range(x):\r\n ans.append(ans[-1]//p[i])\r\nprint(*ans)", "n=int(input())\r\ni=n\r\nl=[]\r\nwhile(i!=0):\r\n if(n%i==0):\r\n l.append(i)\r\n n=i\r\n i=i-1\r\nprint(*l)\r\n", "def ff(n):\r\n for i in range(n//2, 0,-1):\r\n if n%i == 0:\r\n return i\r\n \r\n \r\nn = int(input())\r\nl = [n]\r\n\r\n\r\nwhile n > 1:\r\n n = ff(n)\r\n l.append(n)\r\n if n == 1: \r\n break\r\nprint(*l)\r\n", "# 1sec there can only be 10^7 - 10^8\r\nfrom math import sqrt\r\ndef mapp(arr):\r\n mp={}\r\n for i in arr:\r\n if i in mp:\r\n mp[i]+=1\r\n else:\r\n mp[i]=1\r\n return mp\r\ndef SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n li = []\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n \r\n for p in range(2, len(prime)):\r\n if prime[p]:\r\n li.append(p)\r\n return li\r\ndef primefactors(n):\r\n factors = []\r\n while (n % 2 == 0):\r\n factors.append(2)\r\n n //= 2\r\n for i in range(3, int(sqrt(n)) + 1, 2): # only odd factors left\r\n while n % i == 0:\r\n factors.append(i)\r\n n //= i\r\n if n > 2: # incase of prime\r\n factors.append(n)\r\n return factors\r\n# n=int(input())\r\n# from math import comb\r\n# from collections import Counter\r\n# import math\r\n# import sys\r\n# for i in range(int(sys.stdin.readline())):\r\n# n=int(sys.stdin.readline())\r\n# a=list(map(int,sys.stdin.readline().split()))\r\n# s=input()\r\n\r\nn= int(input())\r\narr=primefactors(n)\r\nprint(n,end=\" \")\r\nfor i in arr:\r\n print(n//i,end=\" \")\r\n n//=i", "\r\nfrom collections import Counter\r\nfrom math import *\r\nfrom sys import *\r\nfrom time import *\r\nimport re\r\n\r\ndef iii():\r\n return [int(iii) for iii in input().split()]\r\ndef fff():\r\n return [float(fff) for fff in input.split()]\r\n\r\ndef ii():\r\n return int(input())\r\ndef ff():\r\n return int(input())\r\n\r\ndef count(l):\r\n return dict(Counter(l))\r\n\r\n\r\ndef S1(n):\r\n return n*(n+1)//2\r\n\r\n\r\ndef S3(n):\r\n return pow(S1(n), 2)\r\n\r\ndef factors(n, noself = False):\r\n f = []\r\n sq = int(sqrt(n))\r\n for i in range(1, sq+1):\r\n if n%i == 0:\r\n f1 = i\r\n f2 = n//i\r\n f.append(f1)\r\n if f2 != f1:\r\n if noself and f2 == n:\r\n continue\r\n else:\r\n f.append(f2)\r\n return sorted(f)\r\n\r\n\r\ndef isprime(n):\r\n if n < 2:\r\n return False\r\n sq = int(sqrt(n))\r\n for i in range(1, sq+1):\r\n if n % i == 0:\r\n return False\r\n\r\n return True\r\n\r\nn = int(input())\r\nr = []\r\nwhile n != 1:\r\n f = factors(n, noself=True)\r\n r.append(n)\r\n n = f[-1]\r\n\r\nr.append(1)\r\nprint(\" \".join([str(x) for x in r]))\r\n", "n = int(input())\r\nprimes = [1]*1000000\r\nprimes[0], primes[1] = 0, 0\r\nfor i in range(2, 1000000):\r\n if primes[i]:\r\n for j in range(2*i, 1000000, i):\r\n primes[j] = 0\r\nprime = []\r\nfor i in range(1000000):\r\n if primes[i]:\r\n prime.append(i)\r\n \r\nprint(n, end = ' ')\r\n\r\nfor i in prime:\r\n while(n % i == 0):\r\n n /= i\r\n print(int(n), end = ' ')\r\n \r\n if n == 1:\r\n print()\r\n break", "from collections import deque, Counter, OrderedDict\r\nfrom heapq import nsmallest, nlargest\r\ndef binNumber(n,size):\r\n return bin(n)[2:].zfill(size)\r\n\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b%a,a)\r\n\r\n# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n#code\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print(n,end=\" \")\r\n while n > 1:\r\n if n%2==0:\r\n n = n//2\r\n print(n,end=\" \")\r\n else:\r\n for i in range(3,n+1,2):\r\n if n%i == 0:\r\n n = n//i\r\n print(n,end=\" \")\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", "n = int(input())\r\ni = 2\r\nprint(n, end=\" \")\r\nwhile n != 1:\r\n if n % i == 0:\r\n n = int(n/i)\r\n print(n, end=\" \")\r\n else:\r\n i += 1\r\n", "n = int(input())\r\nk = 1\r\nb = []\r\nfor i in range(2, n):\r\n if n%i ==0 and i%k == 0:\r\n b.append(i)\r\n k = i\r\nb = b[::-1]\r\nif n == 1:\r\n print(1)\r\nelse:\r\n print(n, *b, 1)\r\n", "n = int(input())\r\nc = n\r\nans = [str(c)]\r\nwhile c > 1:\r\n for i in reversed(range(c)):\r\n if c % i == 0:\r\n c = i\r\n break\r\n ans.append(str(c))\r\nprint(' '.join(ans))\r\n", "num = int(input())\r\nout = [num]\r\ni = num // 2\r\ncurrent = num\r\nwhile i > 0:\r\n if current % i == 0:\r\n out.append(i)\r\n current = i\r\n i = i // 2\r\n else:\r\n i -= 1\r\nprint(*out, sep=' ')", "N = int(input())\r\nfact_arr = []\r\n\r\nfor i in range(1, N + 1) :\r\n if N%i == 0 :\r\n fact_arr.append(i)\r\n \r\nif len(fact_arr) <= 2:\r\n for i in reversed(range(len(fact_arr))) :\r\n print(fact_arr[i], end = \" \")\r\n \r\n exit()\r\n \r\n\r\nmax_count = 0\r\nfor j in reversed(range(len(fact_arr) - 1)) :\r\n temp_arr = []\r\n temp_arr.append(N)\r\n temp_arr.append(fact_arr[j])\r\n s = fact_arr[j]\r\n t_count = 0\r\n for i in reversed(range(j)) :\r\n d = fact_arr[i]\r\n if temp_arr[-1]%d == 0:\r\n t_count += 1\r\n temp_arr.append(d)\r\n \r\n if t_count > max_count :\r\n max_count = t_count\r\n ans_arr = tuple(temp_arr)\r\n \r\n \r\nfor i in range(len(ans_arr)) :\r\n print(ans_arr[i], end = \" \")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "import math\r\nfrom collections import *\r\n\r\ndef solve():\r\n n = int(input())\r\n ans = []\r\n a = []\r\n for i in range(n+1, 0, -1):\r\n if n%i==0:\r\n f = True\r\n for j in range(len(a)):\r\n if a[j]%i!=0:\r\n f = False\r\n if f:\r\n a.append(i)\r\n ans.append(i)\r\n print(*ans)\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\nsolve()\r\n", "from math import sqrt\r\n\r\nn = int(input())\r\nans = []\r\n\r\ndef prime(n):\r\n for i in range(2,int(sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\n\r\n\r\n\r\ndef primefac(n):\r\n\r\n for i in range(2,int(sqrt(n))+1):\r\n if n%i==0:\r\n if prime(i) == True:\r\n return i\r\nans.append(n)\r\nwhile n!=1:\r\n # ans.append(n)\r\n z = prime(n)\r\n if z == True:\r\n n = n//n\r\n ans.append(n)\r\n else:\r\n k = primefac(n)\r\n n = n//k\r\n ans.append(n)\r\nprint(*ans)\r\n\r\n\r\n\r\n", "def max_div_n(n):\n result = []\n i = n\n while (i != 0):\n if (n % i == 0):\n print(i)\n n = i\n i -=1\n\nif __name__ == '__main__':\n n = int(input())\n max_div_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\nfor i in range(n,0,-1):\r\n if n%i==0:\r\n n=i\r\n print(i,end=' ')\r\n", "n = int(input())\r\nans = [n]\r\nfor i in range(int(ans[len(ans) - 1]), 0, -1):\r\n ctr = 0\r\n for x in ans:\r\n if x % i == 0:\r\n ctr += 1\r\n if ctr == len(ans):\r\n if i not in ans:\r\n ans.append(i)\r\nans.sort(reverse=True)\r\nfor x in ans:\r\n print(x)", "def div(n):\r\n f = n // 2\r\n while n % f != 0:\r\n f -= 1\r\n return f\r\nn = int(input())\r\ns = n\r\nprint(n, end = ' ')\r\nwhile n != 1:\r\n n = div(n)\r\n print(n, end=' ')", "n = int(input())\r\ns = []\r\nfor i in range(n,0,-1):\r\n if n % i == 0:\r\n s.append(i)\r\n n = i\r\nprint(*s,sep=' ')\r\n", "from heapq import *\r\nfrom queue import *\r\nfrom math import *\r\nimport sys, bisect\r\nfrom collections import Counter, defaultdict\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nMOD = 1000003\r\n\r\n\r\ndef divisor(number):\r\n for i in range(2, int(sqrt(number) + 1)):\r\n if number % i == 0:\r\n return number // i\r\n return 1\r\n\r\n\r\ndef rec(number, ans):\r\n biggest_divisor = divisor(number)\r\n\r\n if biggest_divisor not in ans:\r\n ans.add(biggest_divisor)\r\n rec(biggest_divisor, ans)\r\n\r\n\r\ndef solve():\r\n N = inl()[0]\r\n ans = {N, 1}\r\n rec(N, ans)\r\n return sorted(set(ans), reverse=True)\r\n\r\n\r\nprint(*solve())\r\n", "n = int(input())\r\nl = []\r\n\r\nfor i in range(1, n):\r\n k = 0\r\n \r\n if n % i == 0:\r\n for j in range(len(l)):\r\n if i % l[j] == 0:\r\n k += 1\r\n\r\n if k == len(l):\r\n l.append(i)\r\n\r\nl.append(n) \r\nl = l[:: - 1]\r\n\r\nfor item in l:\r\n print(item, end = ' ')\r\n", "n = int(input())\r\nans = [n]\r\nwhile n > 1:\r\n d = 2\r\n while n % d:\r\n d += 1\r\n n //= d\r\n ans.append(n)\r\nprint(*ans)\r\n", "from collections import defaultdict, Counter\r\nfrom typing import ValuesView\r\n\r\nn = int(input())\r\ndivisor = n\r\nif n == 1:\r\n print(n)\r\nelse:\r\n while n != 1:\r\n temp = n % divisor\r\n if not temp:\r\n n = divisor\r\n print(n)\r\n divisor -= 1\r\n\r\n", "n = int(input())\r\ni, t = 2, [1]\r\nwhile i * i < n + 1:\r\n while n % i == 0:\r\n t.append(i)\r\n n //= i\r\n i += 1\r\nif n > 1: t.append(n)\r\nfor i in range(1, len(t)):\r\n t[i] = t[i - 1] * t[i]\r\nt.reverse()\r\nprint(' '.join(str(i) for i in t))", "n=int(input())\r\nx=[]\r\ni=n\r\nwhile i>0:\r\n if n%i==0:\r\n x.append(i)\r\n n=i\r\n i=i-1\r\nfor i in x:\r\n print(i,end=\" \")\r\n", "i=2\r\nn=int(input())\r\nprint(n,end=\" \")\r\nwhile(n>1):\r\n if n%i==0:\r\n print(n//i,end=\" \")\r\n n=n//i\r\n else:\r\n i=i+1\r\n", "n = int(input())\r\nres = [n]\r\nfor i in range(n-1,0,-1):\r\n if all(y % i == 0 for y in res):\r\n res.append(i)\r\nprint(' '.join([str(i) for i in res]))\r\n", "def coins(coin):\n if coin != 1:\n divisor=2\n result=coin\n while True:\n if result == 1:\n print(result)\n break\n if result % divisor == 0:\n print(result)\n result=result // divisor\n else:\n divisor=divisor+1\n else:\n print(coin)\ncoins(int(input()))\n\t \t\t \t\t \t \t \t \t\t\t\t \t", "import math\nn = int(input())\ndef isPrime(x):\n if x == 2 or x == 3:\n return True\n else:\n for i in range(2, int(math.sqrt(x)) + 1):\n if x % i == 0:\n return False\n return True\nprint(n, end=\" \")\nx = n\nn_is_prime = isPrime(n)\nfor i in range(int(n // 2), 0, -1):\n if x % i == 0:\n print(i, end=\" \")\n if isPrime(i) == True and n_is_prime==False:\n print(1)\n break\n x = i\n\n\n", "x=int(input(\"\"))\r\nch=x\r\nprint(x)\r\nfor i in range((ch//2),0,-1):\r\n if ch % i ==0 :\r\n print(i)\r\n ch=i\r\n \r\n\r\n", "\r\n\r\n\r\nimport math\r\nfrom collections import deque\r\n\r\ndef solve(n):\r\n d = deque()\r\n d.append(n)\r\n while n % 2 == 0 :\r\n n //=2\r\n d.append(n)\r\n\r\n for j in range(3 , int(math.sqrt(n)) + 1):\r\n while n % j == 0 :\r\n n //= j\r\n d.append(n)\r\n if n > 2 :\r\n if n not in d :d.append(n)\r\n\r\n return d\r\n\r\n\r\n\r\nn = int(input())\r\nif n == 1 :\r\n print(1)\r\n exit(0)\r\n\r\nr = (solve(n))\r\nif 1 not in r :\r\n r.append(1)\r\nprint(*r)\r\n", "def main():\r\n n = int(input())\r\n while n != 1:\r\n print(n, end=' ')\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n n //= i\r\n break\r\n print(n)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\r\n n=int(input())\r\n RES=[]\r\n \r\n def solve(n,RES):\r\n RES.append(n)\r\n if n==1:\r\n return\r\n else:\r\n for i in range(n-1,0,-1):\r\n if n%i==0:\r\n \r\n n=i\r\n break\r\n solve(n,RES)\r\n\r\n solve(n,RES)\r\n print(*RES)\r\nmain()", "def coins(n):\r\n ans=[n]\r\n while n:\r\n for i in range(n-1,0,-1):\r\n if n%i==0:\r\n ans.append(i)\r\n n=i\r\n break\r\n if ans[-1]==1:\r\n print(*ans)\r\n return \"\"\r\n\r\nprint(coins(int(input())))", "n = int(input())\r\nh=n\r\nfor i in range(n,0,-1):\r\n if(h%i)==0:\r\n h = i\r\n print(h,end=\" \")\r\n", "n=int(input())\r\nfor i in range(n,0,-1):\r\n if not(n%i):\r\n n=i\r\n print(int(n),end=' ')\r\n\r\n", "n=int(input())\r\na=[n]\r\nfor x in range(n-1,0,-1):\r\n c=0\r\n for y in a:\r\n if y%x!=0:\r\n c=1\r\n break\r\n else:\r\n pass\r\n if c==0:\r\n a.append(x)\r\nfor x in a:\r\n print(x,end=\" \")", "a=int(input())\r\nl=[a]\r\nfor i in range(a,0,-1):\r\n if a%i==0 and l[-1]%i==0:\r\n print(i,end=' ')\r\n l.append(i)", "m=int(input())\r\nfor i in range(m,0,-1):\r\n if m%i==0:\r\n m=i\r\n print(m)", "a=int(input())\r\nfor i in range(2,a+1):\r\n \r\n if a%i==0:\r\n while a%i==0:\r\n \r\n print(int(a),end=' ')\r\n a=a/i\r\nprint(int(a))\r\n", "a=int(input())\r\nc=[]\r\nf=2\r\nwhile f*f<=a:\r\n while a%f==0:\r\n c+=[f]\r\n a//=f\r\n f+=1\r\nif a>1:\r\n c+=[a]\r\nc+=[1]\r\nfor i in range(len(c)):\r\n m=1\r\n for j in c:\r\n m*=j\r\n c.pop(0)\r\n print(m,end=' ')", "from collections import defaultdict\r\n\r\n\r\ndef factorize(n): # o(sqr(n))\r\n c, ans, a = 1, 0, []\r\n while (c * c < n):\r\n if n % c == 0:\r\n ans += 2\r\n a.extend([c, n // c])\r\n c += 1\r\n\r\n if c * c == n:\r\n ans += 1\r\n a.append(c)\r\n return a\r\n\r\n\r\ndef dp(i, pre):\r\n if i == n:\r\n return [1]\r\n ret = mem[i, pre]\r\n if ret != []:\r\n return ret\r\n ans1, ans2 = [pre], []\r\n\r\n if pre % arr[i] == 0:\r\n ans1.extend(dp(i + 1, arr[i]))\r\n\r\n ans2.extend(dp(i + 1, pre))\r\n if len(ans1) > len(ans2):\r\n mem[i, pre] = ans1\r\n return ans1\r\n else:\r\n mem[i, pre] = ans2\r\n return ans2\r\n\r\n\r\nn = int(input())\r\narr, mem = sorted(factorize(n), reverse=True), defaultdict(list)\r\nn = len(arr)\r\nprint(*dp(1, arr[0]))\r\n", "a=int(input())\r\nc=[]\r\nres=[1]\r\nfor i in range(1, a+1):\r\n if(a%i==0):\r\n c.append(i)\r\nfor j in range(1, len(c)):\r\n if(c[j]%res[-1]==0):\r\n res.append(c[j])\r\nres.reverse()\r\nprint(*res)\r\n \r\n ", "n=int(input())\ndivisor=[]\nfor i in range(1,n):\n if n%i==0:\n divisor.append(i)\nresult=[n]\nwhile 1 not in result:\n if result==[n]:\n result.append(max(divisor))\n divisor.remove(max(divisor))\n else:\n possibility=[divisor[i] for i in range(len(divisor)) if result[-1]%divisor[i]==0]\n result.append(max(possibility))\n divisor.remove(max(possibility))\nfor r in result:\n print(r,end=\" \")\n\t\t\t\t \t\t\t\t \t\t\t \t \t \t\t \t\t\t\t" ]

[ "n, m = map(int, input().split())\r\ns = input()\r\nt = input()\r\n\r\nres = [0] * 10000\r\nfor i in range(m - n + 1):\r\n asd = []\r\n for j in range(n):\r\n if t[i + j] != s[j]:\r\n asd.append(j + 1) \r\n if len(asd) < len(res):\r\n res = asd\r\nprint(len(res))\r\nprint(*res)\r\n \r\n ", "ls,lt=map(int,input().split())\r\ns=input()[:ls]\r\nt=input()[:lt]\r\np=[]\r\nfor tt in range(len(t)):\r\n f=\"\"\r\n for ttt in range(len(s)):\r\n try:\r\n f+=t[ttt+tt]\r\n except:\r\n pass\r\n p.append(f)\r\nfor rrr in range(len(s)): \r\n for tt in range(len(p)):\r\n try:\r\n if len(p[tt])<len(s):\r\n p.pop(tt)\r\n except:\r\n pass\r\nsl=[]\r\nfor t in p:\r\n sw=\"\"\r\n for u in range(len(t)):\r\n if s[u]!=t[u]:\r\n sw+=\"?\"\r\n else:\r\n sw+=s[u]\r\n sl.append(sw)\r\nms=[]\r\nfor y in sl:\r\n ms.append (int(list(y).count(\"?\")))\r\nms=min(ms)\r\nprint(ms)\r\nss=\"\"\r\nssl=[]\r\nfor y in sl:\r\n if int(list(y).count(\"?\"))==ms:\r\n ss=\"\"\r\n for t in range(len(y)):\r\n if y[t]==\"?\":\r\n ss+=str(t+1)+\" \"\r\n ssl.append(ss)\r\nimport random\r\nprint(ssl[random.randint(0,len(ssl)-1)])\r\n \r\n", "n, m = map(int, input().split())\ns = input()\nt = input()\n\npositions = [i + 1 for i in range(n)]\n\nfor i in range(0, m - n + 1):\n new_positions = []\n for j in range(n):\n if s[j] != t[i+j]:\n new_positions.append(j + 1)\n\n if len(new_positions) < len(positions):\n positions = new_positions\n\nprint(len(positions))\nprint(*positions)\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\ninf = 10**12\r\n\r\nn, m = map(int, input().split())\r\ns, t = input().rstrip(), input().rstrip()\r\n\r\nmin_diff, min_idx = inf, []\r\nfor i in range(m - n + 1):\r\n diff, temp = 0, []\r\n for j in range(n):\r\n if s[j] != t[i+j]:\r\n temp.append(j+1)\r\n diff += 1\r\n if diff < min_diff:\r\n min_diff = diff\r\n min_idx = temp\r\n\r\nprint(len(min_idx))\r\nprint(*min_idx)\r\n", "n, m = map(int, input().split())\r\ns = str(input())\r\nt = str(input())\r\nres = 1001\r\nans = []\r\nfor i in range(m-n+1):\r\n count = 0\r\n temp = []\r\n for j in range(n):\r\n if s[j] != t[i+j]:\r\n count+=1\r\n temp.append(j+1)\r\n ans.append(temp)\r\n res = min(count, res)\r\nprint(res)\r\nfor i in ans:\r\n if len(i) == res:\r\n for j in i:\r\n print(j, end=\" \")\r\n break", "n,m=map(int,input().split())\r\ns = input()\r\nt = input()\r\nans = []\r\nfor i in range(m-n+1):\r\n d = {}\r\n temp = []\r\n for j in range(n):\r\n if s[j]==t[i+j]:\r\n temp.append(j)\r\n d[s[j]]=0\r\n if len(temp)>len(ans):\r\n #print(i,temp,ans)\r\n ans = [x for x in temp]\r\nprint(n-len(ans))\r\nfor i in range(n):\r\n if i not in ans:\r\n print(i+1,end=\" \")\r\nprint(\"\")", "n, m = map(int, input().split())\r\ns = input()\r\nt = input()\r\nans = n + 1\r\nar = []\r\nfor i in range(m - n + 1):\r\n q = t[i:i + n]\r\n a = []\r\n for j in range(n):\r\n if q[j] != s[j]:\r\n a += [j + 1]\r\n if ans > len(a):\r\n ans = len(a)\r\n ar = a[::]\r\nprint(ans)\r\nprint(*ar)\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\ns=input()\r\nt=input()\r\nflg=1001\r\npos=[]\r\nminrp=0\r\nfor i in range(b-a+1): #t's len\r\n ct=0\r\n tbr=[]\r\n for j in range(a): #s's length\r\n if(t[i+j]!=s[j]):\r\n ct+=1\r\n tbr.append(j+1)\r\n if(ct<flg):\r\n #print(i)\r\n flg=ct \r\n pos=[]\r\n pos.extend(tbr)\r\n minrp=ct \r\nprint(minrp)\r\nprint(*pos)\r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\ns = list(input().rstrip())\r\nt = list(input().rstrip())\r\nans = [i for i in range(1, n + 1)]\r\nfor i in range(m - n + 1):\r\n ans0 = []\r\n for j in range(n):\r\n if s[j] ^ t[i + j]:\r\n ans0.append(j + 1)\r\n if len(ans) > len(ans0):\r\n ans = ans0\r\nk = len(ans)\r\nprint(k)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "a,b=map(int, input().split())\r\ns=input()\r\nk=input()\r\nminn=1001;t=None\r\nfor i in range(b-a+1):\r\n c=0;x=[]\r\n for j in range(a):\r\n if k[i:i+a][j]!=s[j]:\r\n c+=1\r\n x.append(j+1)\r\n if c<minn:\r\n minn=c\r\n t=x\r\n\r\nprint(minn)\r\nprint(*t)\r\n \r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nimport re\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n\"\"\"\r\n\"\"\"\r\ndef solve():\r\n n, m = MII()\r\n s = I().strip()\r\n t = I().strip()\r\n\r\n mn = len(s)\r\n mni = 0\r\n for i in range(len(t)-len(s)+1):\r\n cur = sum([int(a != b) for a,b in zip(s, t[i:i+len(s)])])\r\n if cur < mn:\r\n mn = cur\r\n mni = i\r\n\r\n print(mn)\r\n WS([i+1 for i in range(len(s)) if s[i] != t[i+mni]])\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, k = map(int, input().split())\r\ns = input()[:-1]\r\nw = input()[:-1]\r\n\r\nd = 0\r\nh = 0\r\nfor j in range(k-n+1):\r\n c = 0\r\n for i in range(n):\r\n if w[j+i] == s[i]:\r\n c += 1\r\n if c > d:\r\n d = c\r\n h = j\r\nq = []\r\nfor i in range(n):\r\n if w[h+i] != s[i]:\r\n q.append(i+1)\r\nprint(n-d)\r\nprint(' '.join(map(str, q)))\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ns,t=input(),input()\r\nr=[0]*(m+1)\r\nfor i in range(m-n+1):\r\n a=[j+1 for j,x in enumerate(zip(s,t[i:i+n])) if x[0]!=x[1]]\r\n if len(a)<len(r):r=a\r\nprint(len(r))\r\nprint(*r)\r\n", "from __future__ import annotations\n\nif __name__ == \"__main__\":\n n: int\n m: int\n n, m = map(int, input().split())\n s: str = input()\n t: str = input()\n \n min_replacements = float('inf')\n positions = []\n\n for i in range(m - n + 1):\n replacements = 0\n replace_positions = []\n\n for j in range(n):\n if s[j] != t[i + j]:\n replacements += 1\n replace_positions.append(j + 1)\n\n if replacements < min_replacements:\n min_replacements = replacements\n positions = replace_positions\n\n print(min_replacements)\n print(*positions)", "n, m = (list)(map(int , input().split()))\r\ns = input()\r\ng = input()\r\n\r\nans = []\r\nmin_op = 11111111111111\r\n\r\nfor i in range(len(g)) :\r\n if len(g) - i < len(s) : break\r\n cnt = 0\r\n for j in range(len(s)) : cnt += s[j] != g[i+j]\r\n if min_op > cnt :\r\n min_op = cnt\r\n ans = []\r\n for j in range(len(s)) :\r\n if s[j] != g[i+j] : ans.append(j+1)\r\n\r\nprint(min_op)\r\nfor i in ans : print(i , end=\" \")\r\n ", "# Author : Mohamed Yousef \r\n# Date : 2023-02-04\r\nimport sys,math,bisect,collections,itertools,heapq\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\n\r\nn,m=mvalues()\r\ns=svalues()\r\nt=svalues()\r\ncnt=0\r\nlocation=[]\r\nres=10e5\r\nfor i in range(n,m+1):\r\n s1=t[cnt:i]\r\n cnt+=1\r\n def find(s1,s):\r\n ans=0\r\n loc=set()\r\n for i in range(n):\r\n if s1[i]==s[i]:\r\n ans+=1\r\n else:\r\n loc.add(i+1)\r\n return ans,loc\r\n l=find(s1,s)\r\n # print(s1,s)\r\n ans=n-l[0]\r\n if ans<res:\r\n res=ans\r\n location=l[1]\r\n\r\nprint(res)\r\nprint(*list(location))\r\n\r\n\r\n\r\n", "# Rating: 1000, Problem 822 B\n\nn, m = [int(i) for i in input().strip().split()]\nsubstring = input().strip()\nstring = input().strip()\n\nmin_replaced = len(substring)\nstart_index = 0\n\nfor i in range(0, m-n+1):\n substr = string[i:i+n]\n count = 0\n for j in range(n):\n if substr[j] == substring[j]:\n continue\n else:\n count+= 1\n if min_replaced > count:\n min_replaced = count\n start_index = i\n\nindexes_symbolized = []\nfor i in range(n):\n if string[i+start_index] == substring[i]:\n continue\n else:\n indexes_symbolized.append(i+1)\n\nans = \"\"\nfor ind in indexes_symbolized:\n ans += str(ind) + \" \"\n\nprint(min_replaced)\nprint(ans)", "n,m = map(int,input().split())\r\n\r\ns = input()\r\nt = input()\r\n\r\nans = [4 for i in range(len(s) + 2)]\r\n\r\nfor i in range(0,m - n + 1):\r\n curr = []\r\n for j in range(len(s)):\r\n if s[j] != t[i+j]:\r\n curr.append(j + 1)\r\n if len(curr) < len(ans):\r\n ans = curr\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "n, m = map(int, input().split(' '))\r\ns = input()\r\nt = input()\r\n\r\ncnt = n+1\r\nchanges = []\r\nfor i in range(m-n+1):\r\n rep = 0\r\n index = []\r\n for j in range(n):\r\n if t[i+j]!=s[j]:\r\n rep += 1\r\n index.append(j+1)\r\n if rep<cnt:\r\n changes = index\r\n cnt = rep\r\nprint(cnt)\r\nleng = len(changes)\r\nfor i in range(leng):\r\n if i!=leng-1:\r\n print(f'{changes[i]} ', end='')\r\n else:print(changes[i])", "sl,tl=map(int,input().split())\r\ns=input()\r\nt=input()\r\na=0\r\nl1=[]\r\nl2=[]\r\nmi=1001\r\nif s in t:\r\n print(a)\r\nelse:\r\n for i in range(tl-sl+1):\r\n l1=[]\r\n a=0\r\n for j in range(sl):\r\n if t[i+j]!=s[j]:\r\n a+=1\r\n l1+=[j+1]\r\n if a<mi:\r\n mi=a\r\n l2=l1\r\n # print(a,l2)\r\n print(mi)\r\n print(*l2)\r\n\r\n\r\n\r\n\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/822/B\r\n\r\nx, y = map(int, input().split())\r\ns = input()\r\nt = input()\r\n\r\nl_b_r = list()\r\nb_c = None\r\n\r\nfor i in range(y):\r\n if i + x <= y:\r\n l_r = list()\r\n c_c = 0\r\n \r\n for j in range(x):\r\n if s[j] != t[j + i]:\r\n c_c += 1\r\n l_r.append(j + 1)\r\n \r\n if b_c == None or c_c < b_c:\r\n b_c = c_c\r\n l_b_r = l_r\r\n\r\nprint(b_c)\r\nprint(\" \".join(str(x) for x in l_b_r))", "\r\ndef main():\r\n\tn, m = map(int, input().split())\r\n\ts = input()\r\n\tt = input()\r\n\tinds = []\r\n\t\r\n\ti = 0\r\n\twhile i < m - n + 1:\r\n\t\tinds.append([])\r\n\t\r\n\t\tj = 0\r\n\t\twhile j < n:\r\n\t\t\tinds[i].append(0)\r\n\t\t\tif s[j] == t[i+j]:\r\n\t\t\t\tinds[i][j] = 1\r\n\t\t\tj += 1\r\n\t\ti += 1\r\n\t\r\n\tmax_sum_ind = 0\r\n\t\r\n\ti = 0\r\n\twhile i < m - n + 1:\r\n\t\tif sum(inds[i]) > sum(inds[max_sum_ind]):\r\n\t\t\tmax_sum_ind = i\r\n\t\ti += 1\r\n\t\r\n\tprint(n - sum(inds[max_sum_ind]))\r\n\ti = 0\r\n\twhile i < n:\r\n\t\tif inds[max_sum_ind][i] == 0:\r\n\t\t\tprint(i + 1, end=\" \")\r\n\t\ti += 1\r\n\r\n\r\n\t\r\n\r\nmain()\r\n", "n,m = map(int, input().split())\r\n\r\ns = input()\r\nt = input()\r\n\r\nminn =10000001\r\nres = []\r\nfor i in range(m-n+1):\r\n val = []\r\n for j in range(n):\r\n if t[i]!=s[j]:\r\n val.append(j+1)\r\n i+=1\r\n \r\n if minn>len(val):\r\n minn =len(val)\r\n res = val\r\n \r\nif minn>len(val):\r\n minn =len(val)\r\n res = val\r\nprint(minn)\r\n\r\nfor i in res:\r\n print(i, end=\" \")", "n, m = map(int, input().split())\n\ns = input()\n\nt = input()\nm = len(t)\n\nmn = [float('inf'), []]\n\n\ndef cmp(x):\n ret = [0, []]\n\n for i in range(n):\n if s[i] != x[i]:\n ret[0] = max(ret[0], 0) + 1\n ret[1].append(i + 1)\n\n return ret\n\n\nfor i in range(m - n + 1):\n mn = min(mn, cmp(t[i: i + n]), key=lambda x: x[0])\nprint(mn[0])\nprint(*mn[1])\n", "n, m = map(int, input().split())\r\ns, t, k = str(input()), str(input()), [\"\"] * 1001\r\nfor i in range(m - n + 1):\r\n g = [j + 1 for j in range(n) if s[j] != (t[i : i + n])[j]]\r\n if len(g) < len(k):\r\n k = g\r\n \r\nprint(len(k)) \r\nprint(*k)# 1698139990.4168484", "n,m=map(int,input().split())\r\ns=input()\r\nt=input()\r\na=list(range(1,n+1))\r\nfor i in range(m-n+1):\r\n b=[]\r\n c=0\r\n for j in range(n):\r\n if s[j]!=t[i+j]:\r\n b.append(j+1)\r\n c=c+1\r\n if(c<len(a)):\r\n a=b\r\nprint(len(a))\r\nprint(' '.join(map(str,a)))", "from math import *\r\nn,m=map(int,input().split())\r\ns,r=input(),input()\r\nq=inf\r\nf=[]\r\nfor i in range(m-n+1):\r\n d=[0 for u in range(n)]\r\n for j in range(n):\r\n if(r[i+j]!=s[j]):\r\n d[j]=1\r\n w=sum(d)\r\n if(w<q):\r\n q=w\r\n f=d\r\nl=[]\r\nfor i in range(n):\r\n if(f[i]==1):\r\n l.append(i+1)\r\nprint(len(l))\r\nprint(*l)\r\n" ]

[ "from heapq import heappush, heappushpop\n\nn, k = map(int, input().split())\npp = list(map(int, input().split()))\nid = sorted(range(n), key=pp.__getitem__)\ncc = list(map(int, input().split()))\nrr, hh, s, t = cc[:], [], 0, 0\nfor i in id:\n p = pp[i]\n while pp[id[t]] < p:\n c = cc[id[t]]\n if len(hh) < k:\n s += c\n heappush(hh, c)\n else:\n s += c - heappushpop(hh, c)\n t += 1\n rr[i] += s\nprint(' '.join(map(str, rr)))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nd={}\r\nl=[]\r\nfor i in range(n):\r\n x=a[i]\r\n y=b[i]\r\n l.append((x,y))\r\nl.sort()\r\nans=[]\r\nj=0\r\nif k==0:\r\n print(*b)\r\nelse:\r\n for i in range(n):\r\n if i<k:\r\n ans.append(l[i][1])\r\n ans.sort()\r\n d[l[i][0]]=sum(ans)\r\n else:\r\n d[l[i][0]]=sum(ans)+l[i][1]\r\n if min(ans)<l[i][1]:\r\n ind=ans.index(min(ans))\r\n ans[ind]=l[i][1]\r\n for i in range(n):\r\n print(d[a[i]],end=' ')\r\n\r\n", "from sys import stdin\ninput = stdin.readline\n\nimport heapq\n\ndef answer():\n\n ans = [0]*n\n q = []\n\n value = 0\n for i in range(n):\n\n if(len(q) <= k):ans[x[i][2]] = x[i][1] + value\n else:\n value -= heapq.heappop(q)\n ans[x[i][2]] = x[i][1] + value\n\n heapq.heappush(q , x[i][1])\n value += x[i][1]\n\n return ans\n\n\nfor T in range(1):\n\n n , k = map(int,input().split())\n\n a = list(map(int,input().split()))\n c = list(map(int,input().split()))\n\n x = [[a[i] , c[i] , i] for i in range(n)]\n x.sort()\n \n \n print(*answer())\n\n \t \t \t \t \t \t \t\t \t\t \t\t\t\t\t", "import heapq as q\r\nn,k=[int(x) for x in input().split()]\r\np=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nm=[]\r\nfor i in range(n):\r\n m.append([p[i],c[i],i])\r\nm.sort(key=lambda x:x[0])\r\nheap=[]\r\nans=[0]*n\r\nc=0\r\nfor i in range(n):\r\n c+=m[i][1]\r\n ans[m[i][2]]=c\r\n q.heappush(heap,m[i][1])\r\n if len(heap)>k:\r\n c-=q.heappop(heap)\r\nprint(*ans)\r\n \r\n ", "import operator\r\nclass Knight:\r\n def __init__(self, power, coins, index):\r\n self.power = power\r\n self.coins = coins\r\n self.index = index\r\n\r\nclass MaxKnight:\r\n def __init__(self, coins, index):\r\n self.coins = coins\r\n self.index = index\r\nnk = input().split(\" \")\r\nn = int(nk[0])\r\nk = int(nk[1])\r\n\r\np = input().split(\" \")\r\nc = input().split(\" \")\r\nfor i in range(n):\r\n p[i] = int(p[i])\r\n c[i] = int(c[i])\r\nknights = []\r\nfor i in range(n):\r\n kn = Knight(p[i], c[i], i)\r\n knights.append(kn)\r\nknights.sort(key=operator.attrgetter('power'))\r\n\r\nmax_c = []\r\nmax_knights = []\r\nfor i in range(n):\r\n max_knights.append(sum(max_c) + knights[i].coins)\r\n if len(max_c) < k:\r\n max_c.append(knights[i].coins)\r\n else:\r\n coins = knights[i].coins\r\n try:\r\n if coins > min(max_c):\r\n max_c.remove(min(max_c))\r\n max_c.append(coins)\r\n except:\r\n pass\r\n# print(max_knights)\r\nfor i in range(n):\r\n max_knights[i] = MaxKnight(max_knights[i], knights[i].index)\r\nmax_knights.sort(key=operator.attrgetter('index'))\r\nprint(\" \".join(str(knight.coins) for knight in max_knights))\r\n", "from sys import stdin, stdout\r\nfrom random import randint\r\nfrom heapq import heapify, heappop, heappush, heapreplace\r\n\r\n\r\n\r\ndef swap(arr1, arr2, i, j):\r\n arr1[i], arr1[j] = arr1[j], arr1[i]\r\n arr2[i], arr2[j] = arr2[j], arr2[i]\r\n\r\n\r\ndef partiton(arr1, arr2, start, end):\r\n pivotIndex = randint(start, end)\r\n swap(arr1, arr2, pivotIndex, end)\r\n pivot = arr1[end]\r\n pIndex = start\r\n for i in range(start, end):\r\n if arr1[i] <= pivot:\r\n swap(arr1, arr2, i, pIndex)\r\n pIndex += 1\r\n swap(arr1, arr2, pIndex, end)\r\n return pIndex\r\n\r\n\r\ndef quickSort(arr1, arr2, start, end):\r\n\r\n while start < end:\r\n pivot = partiton(arr1, arr2, start, end)\r\n if pivot - start < end - pivot:\r\n quickSort(arr1, arr2, start, pivot-1)\r\n start = pivot + 1\r\n else:\r\n quickSort(arr1, arr2, pivot+1, end)\r\n end = pivot - 1\r\n\r\n\r\ndef main():\r\n n, k = map(int, stdin.readline().split())\r\n p = [int(x) for x in stdin.readline().split()]\r\n p = [(p[i], i) for i in range(n)]\r\n c = [int(x) for x in stdin.readline().split()]\r\n quickSort(p, c, 0, n-1)\r\n ans = [-1]*n\r\n ans[p[0][1]] = c[0]\r\n\r\n curr_coins = 0\r\n curr_size = 0\r\n smallest = []\r\n heapify(smallest)\r\n\r\n\r\n for i in range(1, n):\r\n if curr_size == k:\r\n if k != 0 and smallest[0] < c[i-1]:\r\n x = heappop(smallest)\r\n curr_coins -= x\r\n curr_coins += c[i-1]\r\n heappush(smallest, c[i-1])\r\n\r\n elif curr_size < k:\r\n heappush(smallest, c[i-1])\r\n curr_size += 1\r\n curr_coins += c[i-1]\r\n ans[p[i][1]] = curr_coins+c[i]\r\n\r\n for i in range(n):\r\n stdout.write(f\"{ans[i]} \")\r\n\r\nmain()", "n,k = map(int, input().split())\nP = list(map(int, input().split()))\nC = list(map(int, input().split()))\nQ = []\nfor i, p in enumerate(P):\n Q.append((p, i))\nQ.sort()\nq = []\nimport heapq\nheapq.heapify([])\ns = 0\nans = [0]*n\nif k > 0:\n for p, i in Q:\n ans[i] = s+C[i]\n if len(q) == k:\n if q[0] <= C[i]:\n v = heapq.heappop(q)\n heapq.heappush(q, C[i])\n s -= v\n s += C[i]\n else:\n heapq.heappush(q, C[i])\n s += C[i]\n print(*ans)\nelse:\n for p, i in Q:\n ans[i] = C[i]\n print(*ans)\n", "'''\r\nn, k = map(int, input().split())\r\ntemp = [[int(x)] for x in input().split()]\r\nline = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n temp[i] = temp[i] + [line[i], i]\r\ntemp.sort(key=lambda x: x[0], reverse=True)\r\nfor i in range(n):\r\n a = temp[i][1]\r\n t = sorted(temp[i+1:], key=lambda x: x[1], reverse=True)\r\n for j in t[0:min(n-i-1, k)]:\r\n a += j[1]\r\n temp[i] = temp[i] + [a]\r\ntemp.sort(key= lambda x: x[2])\r\nans = []\r\nfor i in temp:\r\n ans.append(str(i[3]))\r\nprint(' '.join(ans))\r\n\r\n'''\r\nn, k = map(int, input().split())\r\npws = list(map(int, input().split()))\r\ncns = list(map(int, input().split()))\r\nnum = [i for i in range(n)]\r\n\r\ncomb =list(zip(pws, num, cns))\r\ncomb.sort()\r\n\r\nless = [0] * k\r\nfor i in range(n):\r\n if i > 0: \r\n less.append(comb[i - 1][2])\r\n less.sort(reverse = True)\r\n less = less[0:k]\r\n num[comb[i][1]] = sum(less) + comb[i][2]\r\n\r\nprint(*num)\r\n", "import heapq\r\n\r\ndef main():\r\n\tn, k = map(int, input().split())\r\n\tpower = list(map(int, input().split()))\r\n\tcoins = list(map(int, input().split()))\r\n\r\n\tpower_coins = sorted(zip(power, coins))\r\n\tresult = {power[i]:coins[i] for i in range(n)}\r\n\tkills = 0\r\n\tcoins = 0\r\n\tmin_heap = []\r\n\tfor p, c in power_coins:\r\n\t\tresult[p] += coins\r\n\t\tif kills < k:\r\n\t\t\tkills += 1\r\n\t\t\theapq.heappush(min_heap, c)\r\n\t\t\tcoins += c\r\n\t\telif k > 0:\r\n\t\t\tif c > min_heap[0]:\r\n\t\t\t\tcoins -= min_heap[0]\r\n\t\t\t\tcoins += c\r\n\t\t\t\theapq.heapreplace(min_heap, c)\r\n\tprint(' '.join(str(result[p]) for p in power))\r\n\r\n\r\nmain()", "from heapq import heappush, heappop\r\n\r\nn, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nheap = []\r\nsort_p = sorted([i for i in range(n)], key=lambda x: p[x])\r\n\r\nsom_k = 0\r\nsoms = []\r\nfor i in range(n):\r\n ci = c[sort_p[i]]\r\n p[sort_p[i]] = (som_k + ci)\r\n som_k += ci\r\n heappush(heap, ci)\r\n if len(heap) > k:\r\n som_k -= heappop(heap)\r\n\r\nprint (*p)", "import heapq\n\nif __name__ == '__main__':\n rd = lambda: map(int, input().split())\n n, k = rd()\n a = sorted(zip(rd(), rd(), range(n)))\n\n minH = []\n total = 0\n ans = [0] * n\n for i in range(len(a)):\n if len(minH) >= k + 1:\n (coins, index) = heapq.heappop(minH)\n total -= coins\n\n heapq.heappush(minH, (a[i][1], i))\n\n total += a[i][1]\n ans[a[i][2]] = total\n\n\n\n print(*ans)\n", "import heapq\r\n[n,k] = map(int,input().split())\r\n\r\np = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\narr = []\r\n\r\nfor i in range(n):\r\n\tarr.append((i,p[i],c[i]))\r\n\r\nfin = []\r\narr.sort(key = lambda x: x[1])\r\nheap = []\r\nfor i in range(n):\r\n\tfin.append([arr[i][0],arr[i][2]])\r\n\tif(i <= k ):\r\n\t\theapq.heappush(heap,arr[i][2])\r\n\telse:\r\n\t\theapq.heappop(heap)\r\n\t\theapq.heappush(heap,arr[i][2])\r\n\tfin[i][1] = sum(heap)\r\nfin.sort()\r\nfor i in range(n):\r\n\tprint(fin[i][1],end = \" \") ", "import heapq as Q\r\n\r\nR = lambda : map(int,input().split())\r\nn,k = R()\r\np,c = R(),R()\r\nsum = 0\r\nans,heap = [None]*n,[]\r\nfor _,coin,idx in sorted(zip(p,c,range(n))) :\r\n sum += coin\r\n ans[idx] = sum\r\n Q.heappush(heap,coin)\r\n if len(heap) > k :\r\n sum -= Q.heappop(heap)\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", "n, k = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\narr = [[p[i], i] for i in range(n)]\r\narr.sort()\r\nz = []\r\nans = [0 for i in range(n)]\r\nfor i in range(n):\r\n s = 0\r\n for el in z:\r\n s += el\r\n ans[arr[i][1]] = s + c[arr[i][1]]\r\n z.append(c[arr[i][1]])\r\n z.sort()\r\n if len(z) > k:\r\n z = z[1:]\r\nfor el in ans:\r\n print(el, end=\" \")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\n@Project : CodeForces\r\n@File : 2.py \r\n@Time : 2018/6/17 0:27\r\n@Author : Koushiro \r\n\"\"\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n knight = [[i,0,0,0]for i in range(n)]\r\n power = list(map(int, input().split()))\r\n money = list(map(int, input().split()))\r\n for i in range(n):\r\n knight[i][1]=power[i]\r\n knight[i][2]=money[i]\r\n knight.sort(key=lambda x:x[1])\r\n yong=[]\r\n yong_sum=0\r\n for i in range(n):\r\n knight[i][3]=knight[i][2]+yong_sum\r\n if len(yong)<k:\r\n yong.append(knight[i][2])\r\n yong.sort()\r\n yong_sum = sum(yong)\r\n elif k==0:\r\n continue\r\n else:\r\n if yong[0]<knight[i][2]:\r\n yong[0]=knight[i][2]\r\n yong.sort()\r\n yong_sum = sum(yong)\r\n\r\n knight.sort(key=lambda x:x[0])\r\n for i in range(n-1):\r\n print(knight[i][3], end=\"\")\r\n print(\" \", end=\"\")\r\n print(knight[-1][3])", "N, K = map(int, input().split())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nrec = []\r\nfor i in range(N):\r\n rec.append((p[i], c[i], i))\r\n\r\nrec = sorted(rec, key=lambda x: x[0])\r\ntmp = []\r\nnum = []\r\nfor i in range(N):\r\n if len(tmp) < K:\r\n tmp.append(rec[i][1])\r\n else:\r\n tmp = sorted(tmp, reverse=True)\r\n tmp = tmp[:K] + [rec[i][1]]\r\n\r\n num.append((sum(tmp), rec[i][2]))\r\n\r\nnum = sorted(num, key=lambda x: x[1])\r\nprint(\" \".join(map(lambda x: str(x[0]), num)))", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nx = [(p[i], i) for i in range(n)]\r\nx.sort()\r\ns = 0\r\nh = []\r\nans = [0] * n\r\nfor _, i in x:\r\n s += c[i]\r\n while len(h) > k:\r\n s -= heapq.heappop(h)\r\n ans[i] = s\r\n heapq.heappush(h, c[i])\r\nsys.stdout.write(\" \".join(map(str, ans)))", "import heapq as q\r\nn,k=[int(x) for x in input().split()]\r\npower=list(map(int,input().split()))\r\ncoin=list(map(int,input().split()))\r\nheap=[]\r\nans=[0]*n\r\ncoun=0\r\nkni=list(zip(power,coin,range(n)))\r\nkni.sort()\r\nfor p,c,idx in kni:\r\n coun+=c\r\n ans[idx]=coun\r\n q.heappush(heap,c)\r\n if len(heap)>k:\r\n coun-=q.heappop(heap)\r\nprint(*ans)\r\n \r\n ", "n,k=map(int,input().split())\r\np=[*map(int,input().split())]\r\nc={i:int(x) for i,x in enumerate(input().split())}\r\nd={x:i for i,x in enumerate(p)}\r\np.sort()\r\nlst,res=[],list(c.values())\r\nfor i,x in enumerate(p):\r\n res[d[x]]+=sum(lst)\r\n lst.append(c[d[x]])\r\n lst.sort()\r\n if i>=k:lst.pop(0)\r\nprint(*res)", "import heapq\r\n\r\nn, k = [int(x) for x in input().strip().split()]\r\np = [int(x) for x in input().strip().split()]\r\nc = [int(x) for x in input().strip().split()]\r\n\r\na = sorted(zip(p, c, range(n)))\r\ncoins = []\r\ns = 0\r\nans = []\r\n\r\nfor ai in a:\r\n s += ai[1]\r\n ans.append([ai[2], s])\r\n heapq.heappush(coins, ai[1])\r\n if len(coins) > k:\r\n s -= heapq.heappop(coins)\r\n\r\nprint(*[c for i, c in sorted(ans)])\r\n", "import heapq as q\nrd = lambda: map(int, input().split())\nn, k = rd()\na = sorted(zip(rd(), rd(), range(n)))\nr = [0] * n\nh = []\ns = 0\nfor x, y, z in a:\n s += y\n r[z] = s\n q.heappush(h, y)\n if len(h) > k:\n s -= q.heappop(h)\nprint(' '.join(map(str, r)))\n", "n, k = [int(s) for s in input().split()]\r\np = [int(s) for s in input().split()]\r\np = [(p[i], i) for i in range(n)]\r\n\r\nc = [int(s) for s in input().split()]\r\nc = [[c[i], i] for i in range(n)]\r\n\r\np.sort(key=lambda x: x[0], reverse=True)\r\n\r\nc_dic = {}\r\nfor x in c:\r\n c_dic[x[1]] = x[0]\r\n\r\nc.sort(key=lambda x: x[0], reverse=True)\r\nans_set = {}\r\n\r\nused = set()\r\ni = 0\r\ncur_ans = 0\r\ncur_k = 0\r\nfor j in range(n):\r\n x = p[j]\r\n if x[1] not in used:\r\n used.add(x[1])\r\n else:\r\n cur_k -= 1\r\n cur_ans -= c_dic[x[1]]\r\n\r\n while i < n:\r\n if cur_k == k:\r\n break\r\n if c[i][1] in used:\r\n i += 1\r\n continue\r\n\r\n cur_ans += c[i][0]\r\n cur_k += 1\r\n used.add(c[i][1])\r\n i += 1\r\n ans_set[x[1]] = cur_ans\r\n\r\nfor i in range(n):\r\n print(ans_set[i] + c_dic[i], end=\" \")\r\n", "from collections import defaultdict as dd\r\nfrom heapq import heapify,heappop,heappush\r\nn,m=[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\nd=dd(int)\r\ne=dd(int)\r\nfor i in range(n):\r\n e[arr[i]]=i\r\n d[arr[i]]=brr[i]\r\ndrr=[0]*n \r\ncrr=[]\r\nheapify(crr)\r\narr.sort()\r\nfor i in range(n):\r\n if(len(crr)==0):\r\n drr[e[arr[i]]]=d[arr[i]]\r\n heappush(crr,d[arr[i]])\r\n continue\r\n if(len(crr)<=m):\r\n drr[e[arr[i]]]=d[arr[i]]+sum(crr)\r\n heappush(crr,d[arr[i]])\r\n continue\r\n if(len(crr)>m):\r\n heappop(crr)\r\n drr[e[arr[i]]]=d[arr[i]]+sum(crr)\r\n heappush(crr,d[arr[i]])\r\n continue\r\nprint(*drr) \r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n", "from collections import namedtuple\nfrom heapq import heappop, heappush\n\n\nclass HighestK:\n def __init__(self, k):\n self._k = k\n self._arr = []\n self._sum = 0\n\n def sum(self):\n return self._sum\n\n def add(self, num):\n if self._k == 0:\n return\n\n if len(self._arr) < self._k:\n heappush(self._arr, num)\n self._sum += num\n return\n\n if num > self._arr[0]:\n self._sum -= heappop(self._arr)\n heappush(self._arr, num)\n self._sum += num\n\n\ndef kill_knights(data, k):\n result = [(data[0].position, data[0].coins)]\n highestK = HighestK(k)\n\n for previous, this in zip(data, data[1:]):\n highestK.add(previous.coins)\n result.append((this.position, highestK.sum() + this.coins))\n\n return list(map(lambda x: x[1], sorted(result)))\n\n\nif __name__ == '__main__':\n _, k = map(int, input().split())\n powers = list(map(int, input().split()))\n coins = list(map(int, input().split()))\n Knight = namedtuple('Knight', ['power', 'coins', 'position'])\n\n data = sorted([Knight(powers[i], coins[i], i) for i in range(len(powers))])\n print(' '.join(map(str, kill_knights(data, k))))\n", "import heapq\nn,k = map(int, input().split())\npowers = list(map(int, input().split()))\ncoins = list(map(int, input().split()))\npc = [[powers[i],coins[i]] for i in range(n)]\npc.sort()\npowerindex = sorted([i for i in range(n)], key = lambda i: powers[i])\ncurrsum = 0\ncoinscollected = []\nans = [0]*n\ncurr = 0\n\nif k>0:\n\tfor i in range(n):\n\t if curr < k:\n\t heapq.heappush(coinscollected,pc[i][1])\n\t curr += 1\n\t currsum += pc[i][1]\n\t ans[powerindex[i]] = currsum\n\t else:\n\t ans[powerindex[i]] = currsum + pc[i][1]\n\t least = heapq.heappop(coinscollected)\n\t if pc[i][1] > least:\n\t heapq.heappush(coinscollected,pc[i][1])\n\t currsum -= least\n\t currsum += pc[i][1]\n\t else:\n\t heapq.heappush(coinscollected,least)\n\tprint(*ans)\nelse:\n\tprint(*coins)\n", "R=lambda:map(int,input().split())\r\nn,k=R()\r\nr=[0]*n\r\nl=[]\r\ns=0\r\nfor _, c, i in sorted(zip(R(),R(),range(n))):\r\n s+=c;r[i]=s;l=sorted(l+[c])\r\n if len(l)>k:\r\n s-=l[0];del l[0]\r\nprint(*r)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nfor q in range(n):\r\n a[q] = [a[q], s[q], q]\r\na.sort()\r\nb, d, z = [0]*k, 0, [[] for q in range(n)]\r\nfor q in range(n):\r\n z[a[q][2]] = d+a[q][1]\r\n l, j = 0, 0\r\n for q1 in range(k):\r\n if l == 1:\r\n b[q1], j = j, b[q1]\r\n elif a[q][1] > b[q1]:\r\n l, j = 1, b[q1]\r\n d += a[q][1] - b[-1]\r\n b[q1] = a[q][1]\r\nprint(*z)\r\n", "# -*- coding: utf-8 -*-\nimport bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\n\nsys.setrecursionlimit(10000)\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n\n error_print(e - s, 'sec')\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, K, P, C):\n\n P_ = sorted([(p, i) for i, p in enumerate(P)])\n conins = []\n ans = []\n for p, i in P_:\n ans.append((i, C[i] + sum(conins)))\n heapq.heappush(conins, C[i])\n if len(conins) > K:\n heapq.heappop(conins)\n\n return ' '.join(map(lambda x: str(x[1]), sorted(ans)))\n\n\ndef main():\n N, K = read_int_n()\n P = read_int_n()\n C = read_int_n()\n\n # N = 100000\n # K = 10\n # P = [random.randint(1, int(1e+9)) for _ in range(N)]\n # C = [random.randint(0, int(1e+9)) for _ in range(N)]\n\n print(slv(N, K, P, C))\n\n\nif __name__ == '__main__':\n main()\n", "import bisect\n\nn, k = map(int, input().split())\np = list(map(int, input().split()))\nc = list(map(int, input().split()))\nif k == 0:\n print(' '.join(map(str, c)))\n exit(0)\nindex_map = dict(zip(p, list(range(n))))\npower_coin_map = dict(zip(p, c))\nsorted_power = sorted(power_coin_map)\nans = [power_coin_map[sorted_power[0]]]\ncurr_l = [ans[0]]\nfor i in range(1, n):\n coin = power_coin_map[sorted_power[i]]\n ans.append(coin + sum(curr_l))\n if len(curr_l) < k:\n bisect.insort(curr_l, coin)\n else:\n if coin > curr_l[0]:\n curr_l = curr_l[1:]\n bisect.insort(curr_l, coin)\nreal_ans = [0]*n\nfor i in range(n):\n power = sorted_power[i] \n real_ans[index_map[power]] = ans[i]\n \nprint(' '.join(map(str, real_ans)))\n", "n, k = map(int, input().split())\np = list(sorted([p, i] for i, p in enumerate(map(int, input().split()))))\nc = list(map(int, input().split()))\nans = [0] * n\ncoins = 0\nminm = 0\nstatus = []\nfor i in range(n):\n if i >= 1:\n status.append(c[p[i - 1][1]])\n status.sort()\n if i <= k:\n ans[p[i][1]] = sum(status) + c[p[i][1]]\n else:\n status.pop(0)\n ans[p[i][1]] = sum(status) + c[p[i][1]]\nprint(*ans)", "n, k = map(int, input().split(' '))\nps = list(map(int, input().split(' ')))\ncs = list(map(int, input().split(' ')))\n\nres = [0] * n\n\nkns = sorted((p, c, i) for i, (p, c) in enumerate(zip(ps, cs)))\n#print(kns)\n\nkmax = []\npcount = [kns[0][1]]\nres[kns[0][2]] = cs[kns[0][2]]\n\n#print(pcount)\n#print(res)\n\nfor j, (p, c, i) in list(enumerate(kns))[1:]:\n #print(j, '-------------------', p, kns[j - 1][0])\n if p > kns[j - 1][0]:\n kmax = sorted(kmax + pcount, reverse=True)[:k]\n res[i] = sum(kmax) + c\n pcount = []\n pcount += [c]\n\nprint(*res)\n", "n,tk=map(int,input().split())\r\np=[int(i)for i in input().split()]\r\nc=[int(i)for i in input().split()]\r\npc=[[i,p[i],c[i]]for i in range(n)]\r\npc.sort(key=lambda x:x[-2])\r\nvictim=[]\r\nx=0\r\nl=0\r\nend=[]\r\nfor i in range(n):\r\n if l<=tk:\r\n victim.append(pc[i][-1])\r\n x+=pc[i][-1]\r\n l+=1\r\n end.append([pc[i][0],x])\r\n else:\r\n \r\n victim.sort()\r\n x+=pc[i][-1]\r\n x-=victim[0]\r\n del victim[0]\r\n victim.append(pc[i][-1])\r\n end.append([pc[i][0],x])\r\nend.sort()\r\nprint(' '.join([str(r[-1])for r in end]))\r\n\r\n \r\n \r\n", "import configparser\r\nimport math\r\nimport sys\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef main():\r\n\r\n n, k = [int(x) for x in input().split(' ')]\r\n powers = [int(x) for x in input().split(' ')]\r\n coins = [int(x) for x in input().split(' ')]\r\n\r\n pnts = []\r\n for i in range(n):\r\n pnts.append((powers[i], coins[i], i))\r\n\r\n pnts = sorted(pnts, key=lambda x:x[0])\r\n\r\n answers = [0 for i in range(n)]\r\n cur_best = []\r\n\r\n for i in range(n):\r\n if k != 0:\r\n answers[pnts[i][2]] = sum(cur_best) + pnts[i][1]\r\n\r\n cur_best.append(pnts[i][1])\r\n cur_best = sorted(cur_best)\r\n cur_best = cur_best[-k:]\r\n\r\n else:\r\n answers[pnts[i][2]] = pnts[i][1]\r\n\r\n for i in answers:\r\n print(i, end=' ')\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import heapq\r\nn, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nindexes = sorted(list(range(n)), key=p.__getitem__)\r\nmost_vyg_odn_yye = []\r\nres = [1]*n\r\ncur_res = 0\r\nfor ind in indexes:\r\n\tthis_cost = c[ind]\r\n\theapq.heappush(most_vyg_odn_yye, this_cost)\r\n\tcur_res += this_cost\r\n\tres[ind] = cur_res\r\n\tif len(most_vyg_odn_yye) > k:\r\n\t\tcur_res -= heapq.heappop(most_vyg_odn_yye)\r\nprint(*res)\r\n", "n,k=map(int,input().split())\r\np=list(map(int,input().split()))\r\npcop=p.copy()\r\nc=list(map(int,input().split()))\r\ndic=dict(zip(p,c))\r\np.sort()\r\nli=[]\r\ndic1={}\r\nfor i in range(min(k,n)):\r\n li.append(dic[p[i]])\r\n dic1[p[i]]=sum(li)\r\nif(n>k and len(li)!=0):\r\n for i in p[k:]:\r\n li.sort()\r\n dic1[i]=sum(li)+dic[i]\r\n if(li[0]<dic[i]):\r\n del li[0]\r\n li.append(dic[i])\r\nelse:\r\n for i in p[k:]:\r\n dic1[i]=dic[i]\r\nfor m in range(n):\r\n print(dic1[pcop[m]],end=' ')", "from collections import OrderedDict as od\r\nn,k=list(map(int,input().split()))\r\npointsArray=[0]*k\r\ndi={}\r\nindexOrder=list(map(int,input().split()))\r\nindex=0\r\nfor i in map(int,input().split()):\r\n di[indexOrder[index]]=i\r\n index+=1\r\ndi=od(sorted(di.items()))\r\n#print(di)\r\nif(k==0):\r\n for i in indexOrder:\r\n print(di[i],end=' ')\r\nelse:\r\n result={}\r\n for key,value in di.items():\r\n result[key]=value+sum(pointsArray)\r\n #print(result[key],key,value,sum(pointsArray))\r\n pointsArray[0]=max(pointsArray[0],value)\r\n pointsArray.sort()\r\n for i in indexOrder:\r\n print(result[i],end=' ')", "from sys import stdin,stdout\r\nfrom heapq import *\r\n\r\n\r\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\ninput = lambda: stdin.buffer.readline().rstrip(b'\\r\\n').decode('ascii')\r\nn, m = map(int, input().split())\r\np, c = [[int(x) for x in input().split()] for _ in range(2)]\r\na, que, ans, su = sorted(range(n), key=p.__getitem__), [], [c[i] for i in range(n)], 0\r\n\r\nfor i in range(n):\r\n ans[a[i]] += su\r\n heappush(que, c[a[i]])\r\n su += c[a[i]]\r\n if len(que) > m:\r\n su -= heappop(que)\r\nprint(*ans)\r\n", "n,k = [int(x) for x in input().split()]\r\n\r\np = [ (int(x),i) for i,x in enumerate(input().split())]\r\n\r\nc = [int(x) for x in input().split()]\r\n\r\np.sort()\r\n\r\nh = []\r\n\r\nimport heapq\r\n\r\ntotal = 0\r\n\r\nans = [0 for _ in c]\r\n\r\nfor pw,ind in p:\r\n ans[ind] = total + c[ind]\r\n if k > 0 and (len(h) < k or h[0] < c[ind]):\r\n heapq.heappush(h,c[ind])\r\n total += c[ind]\r\n if len(h) > k :\r\n total -= heapq.heappop(h)\r\n\r\nprint(\" \".join(map(str,ans)))\r\n", "n, k = list(map(int, input().split()))\r\nstength = list(map(int, input().split()))\r\nmoney = list(map(int, input().split()))\r\nfor i in range(len(money)):\r\n money[i] = [i, money[i]]\r\nmoney.sort(key=lambda x: stength[x[0]])\r\nstength.sort()\r\nans = 0\r\nmon = []\r\nanss=[0]*n\r\nfor i in range(n):\r\n ans=0\r\n ans += money[i][1]\r\n for j in mon:\r\n ans += j\r\n mon.append(money[i][1])\r\n if len(mon) > k:\r\n mon.sort(reverse=True)\r\n mon.pop()\r\n anss[money[i][0]] = ans\r\nprint(*anss)", "import array\r\n\r\nn, k = map(int, input().split())\r\np = [int(x) for x in input().split()]\r\nc = [int(x) for x in input().split()]\r\ns = []\r\nfor i in range(n):\r\n s.append((i, p[i], c[i]))\r\ns = sorted(s, key=lambda x: x[1])\r\nsum_list = [[s[0][2]]]\r\nsum_res = [s[0][2]]\r\nfor i in range(1, n):\r\n sum_list.append(list(sum_list[i-1]))\r\n if i-k-1 >= 0:\r\n sum_list[i].remove(min(sum_list[i]))\r\n sum_list[i].append(s[i][2])\r\n sum_res.append(sum(sum_list[i]))\r\n\r\nans = [str(x[1]) for x in sorted(enumerate(sum_res), key=lambda x: s[x[0]][0])]\r\n\r\nprint(\" \".join(ans))\r\n", "from heapq import heapify, heappush, heappushpop\r\n\r\nn , k = list(map(int , input().split()))\r\n\r\npower = list(map(int , input().split()))\r\ncoins = list(map(int , input().split()))\r\n\r\nknights = [i for i in range(n)]\r\nknights.sort(key=lambda x:power[x])\r\n\r\ncursum = 0\r\ncurcoin = []\r\nheapify(curcoin)\r\nres = [0] * n\r\nfor i in range(min(k,n)):\r\n res [knights[i]] = cursum +coins[knights[i]]\r\n heappush(curcoin, coins[knights[i]])\r\n cursum += coins[knights[i]]\r\n\r\nfor i in range(min(k,n), n):\r\n res [knights[i]] = cursum +coins[knights[i]]\r\n cursum += coins[knights[i]] - heappushpop(curcoin, coins[knights[i]])\r\n\r\nprint(*res)\r\n", "n, k = map(int, input().split())\npws = list(map(int, input().split()))\ncns = list(map(int, input().split()))\nnum = [i for i in range(n)]\n\ncomb =list(zip(pws, num, cns))\ncomb.sort()\n\nless = [0] * k\nfor i in range(n):\n if i > 0: \n less.append(comb[i - 1][2])\n less.sort(reverse = True)\n less = less[0:k]\n num[comb[i][1]] = sum(less) + comb[i][2]\n\nprint(*num)\n\n", "\r\nimport heapq\r\nn, k = map(int, input().split())\r\npowers= list(map(int, input().split()))\r\ncoins = list(map(int, input().split()))\r\n\r\nsorted_powers = sorted(list(range(n)),key= powers.__getitem__)\r\n\r\nres =[0]*n\r\nmy_heap =[]\r\ncurrent_res = 0\r\n\r\nfor i in sorted_powers:\r\n\tc= coins[i]\r\n\theapq.heappush(my_heap, c)\r\n\tcurrent_res += c\r\n\tres [i] = current_res\r\n\tif len(my_heap)> k:\r\n\t\tcurrent_res -= heapq.heappop(my_heap)\r\n\r\n\r\nprint(*res)\r\n\t", "# Codeforces Round #488 by NEAR (Div. 2)\r\nimport collections\r\nfrom functools import cmp_to_key\r\n#key=cmp_to_key(lambda x,y: 1 if x not in y else -1 )\r\n\r\nimport sys\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\nimport bisect \r\n \r\n \r\nN,K = getIntList()\r\n\r\nP = getIntList()\r\nC = getIntList()\r\n\r\nck = [0 for i in range(K + 1) ] \r\n\r\nz = zip(P,C, [i for i in range(N)])\r\n\r\nz = list(z)\r\n\r\nz.sort()\r\n#print(z)\r\nscore = [0 for i in range(N)]\r\nfor i in range(N):\r\n if i>0 and z[i][0] == z[i-1][0]:\r\n score[ z[i][2] ] = score[z[i-1][2]]\r\n else:\r\n score[z[i][2] ] = sum(ck[:K]) + z[i][1]\r\n ck[K] = z[i][1]\r\n ck.sort(reverse = True)\r\n #print(score,ck)\r\n \r\nr = ' '.join(map(str, score))\r\nprint(r)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom heapq import *\r\n\r\nn, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nif k==0:\r\n print(*c)\r\n exit()\r\n \r\nipc = []\r\n\r\nfor i in range(n):\r\n ipc.append((i, p[i], c[i]))\r\n\r\nipc.sort(key=lambda k: k[1])\r\nans = [-1]*n\r\npq = []\r\ns = 0\r\n\r\nfor i, pi, ci in ipc:\r\n ans[i] = s+ci\r\n \r\n if len(pq)>=k:\r\n if ci>pq[0]:\r\n s -= pq[0]\r\n heappop(pq)\r\n heappush(pq, ci)\r\n s += ci\r\n else:\r\n heappush(pq, ci)\r\n s += ci\r\n\r\nprint(*ans)", "import heapq\r\nclass Pair:\r\n def __init__(self,p,c,ind):\r\n self.p = p\r\n self.c = c\r\n self.ind = ind\r\n \r\n def __lt__(self,other):\r\n return self.c < other.c\r\n\r\nn,k = map(int,input().split())\r\npower = list(map(int,input().split()))\r\ncoin = list(map(int,input().split()))\r\nans = coin\r\narr = [(power[i],coin[i],i) for i in range(n)]\r\n\r\narr.sort()\r\nheap = []\r\nfor i in range(n):\r\n if i == 0:\r\n heapq.heappush(heap,Pair(arr[i][0],-arr[i][1],-1))\r\n else:\r\n more = 0 \r\n cnt = 0\r\n popped = []\r\n while heap and cnt < k:\r\n r = heapq.heappop(heap)\r\n popped.append(r)\r\n more += -r.c\r\n \r\n cnt+=1\r\n for pair in popped:\r\n heapq.heappush(heap,pair)\r\n ans[arr[i][2]] += more\r\n heapq.heappush(heap,Pair(arr[i][0],-arr[i][1],-1))\r\nfor val in ans:\r\n print(val,end = ' ')\r\n \r\n\r\n\r\n", "\"\"\" https://codeforces.com/problemset/problem/994/B \"\"\"\r\ndef input_ints ():\r\n inp = input ().split ()\r\n ints = list ( map ( lambda i: int ( i ), inp ) )\r\n return ints\r\n\r\ndef transform_with_index ( arr ):\r\n transformed = []\r\n for i in range ( len ( arr ) ):\r\n transformed.append ([ i, arr [ i ] ])\r\n return transformed\r\n\r\ndef find_index_of_the_least ( arr ):\r\n n = len ( arr )\r\n if ( not n ):\r\n return -1\r\n least_index = 0\r\n for i in range ( 1, n ):\r\n if ( arr [ i ] < arr [ least_index ] ):\r\n least_index = i\r\n return least_index\r\n\r\nmy_sort = lambda arr, reverse = True: sorted ( arr, key = lambda a: a [ 1 ], reverse = reverse )\r\n\r\n\r\nn, k = input_ints ()\r\np = input_ints ()\r\ntransformed_p = transform_with_index ( p )\r\nsorted_p = my_sort ( transformed_p, False )\r\nc = input_ints ()\r\ntransformed_c = transform_with_index ( c )\r\nsorted_c = my_sort ( transformed_c )\r\n\r\npockets = list ( map ( lambda c: [ c ], c ) )\r\npocket_sums = c\r\n\r\n\r\nfor i in range ( 1, n ):\r\n tyrant_knight_index = sorted_p [ i ] [ 0 ]\r\n prev_tyrant_knight_index = sorted_p [ i - 1 ] [ 0 ]\r\n pockets [ tyrant_knight_index ] += pockets [ prev_tyrant_knight_index ]\r\n pocket_sums [ tyrant_knight_index ] += pocket_sums [ prev_tyrant_knight_index ]\r\n if ( len ( pockets [ tyrant_knight_index ] ) > k + 1 ):\r\n least_index = find_index_of_the_least ( pockets [ prev_tyrant_knight_index ] ) + 1\r\n pocket_sums [ tyrant_knight_index ] -= pockets [ tyrant_knight_index ] [ least_index ]\r\n del pockets [ tyrant_knight_index ] [ least_index ]\r\n\r\n\r\noutput = ''\r\nfor i in range ( n ):\r\n output += str ( pocket_sums [ i ] ) + ' '\r\nprint ( output )\r\n", "from collections import defaultdict\r\nimport heapq\r\n\r\n\r\ndef find(x):\r\n return x[0]\r\n\r\n\r\nn, m = map(int, input().split())\r\nans = defaultdict(int)\r\nheap = []\r\n\r\npower = list(map(int, input().split()))\r\ncoins = list(map(int, input().split()))\r\nnum = list(i for i in range(n+1))\r\n\r\nknt = list(zip(power, coins, num))\r\n\r\nknt.sort(key=find)\r\n\r\nSum = 0\r\n\r\nfor i in knt:\r\n ans[i[2]] = i[1] + Sum\r\n heapq.heappush(heap, i[1])\r\n Sum += i[1]\r\n if len(heap) > m:\r\n Sum -= heapq.heappop(heap)\r\n\r\nfor i in range(n):\r\n print(ans[i], end=' ')", "n,k = map(int, input().split())\np = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nz = [[pi, ci, i] for i, (pi, ci) in enumerate(zip(p, c))]\n\nz.sort()\nfrom bisect import bisect_left\n\na = [0] * n\nm = [0] * k\nfor i in range(n):\n pi, ci, ii = z[i]\n a[ii] = ci + sum(m)\n insert_at = bisect_left(m, ci)\n if insert_at > 0:\n m.insert(insert_at, ci)\n del m[0]\n\nprint(*a)", "from heapq import heappush, heappop\r\nn,k = map(int, input().split())\r\npowers = list(map(int, input().split()))\r\ncoins = list(map(int, input().split()))\r\n\r\nA = []\r\nans = [0] * n\r\nfor i in range(n):\r\n A.append((powers[i], coins[i], i))\r\nA.sort()\r\nh = []\r\ntotal = 0\r\nfor i in range(n):\r\n _,c,idx = A[i]\r\n ans[idx] = total + c\r\n if len(h) < k:\r\n heappush(h, c)\r\n total += c\r\n elif h and h[0] < c:\r\n total -= heappop(h)\r\n heappush(h, c)\r\n total += c\r\n\r\nfor x in ans:\r\n print(x, end=\" \")\r\nprint()\r\n", "import heapq\r\nfrom bisect import insort\r\n\r\nMIS = lambda: map(int,input().split())\r\nn, k = MIS()\r\np = sorted((x, i) for i, x in enumerate(MIS()))\r\nc = list(MIS())\r\n\r\ntopcoin = []\r\ntotcoin = 0\r\nans = c[:]\r\nfor x, i in p:\r\n ans[i]+= totcoin\r\n insort(topcoin, -c[i]); totcoin+= c[i]\r\n if len(topcoin) > k: totcoin+= topcoin.pop()\r\nprint(*ans)", "n, k = map(int , input().split())\r\n\r\nl = input()\r\nl = [int(i) for i in l.split()]\r\n\r\nx =input()\r\nx = [int(i) for i in x.split()]\r\nd = []\r\nfor i in range(n):\r\n d.append((l[i] , x[i] , i))\r\nif k==0 :\r\n for i in x:\r\n print(i , end = \" \")\r\nelse:\r\n d.sort()\r\n minn = []\r\n ans = 0\r\n temp = [0]*n\r\n for i in range(n):\r\n if i<=k:\r\n if i<k : \r\n ans+=d[i][1]\r\n minn.append(d[i][1])\r\n temp[d[i][2]] = ans\r\n else:\r\n temp[d[i][2]] = ans+d[i][1]\r\n else:\r\n if min(minn)<d[i-1][1]:\r\n ans = ans - min(minn) + d[i-1][1]\r\n minn.remove(min(minn))\r\n minn.append(d[i-1][1])\r\n temp[d[i][2]] = ans + d[i][1]\r\n \r\n print(*temp)\r\n \r\n", "from functools import reduce\r\nReadInts = lambda: [*map(int,input().split())]\r\nn , k = ReadInts()\r\nans , temp = [0] * n, []\r\nfor p, v, idx in sorted(list(zip(ReadInts(), ReadInts(), range(n)))):\r\n ans [idx] = reduce(lambda a, b: a + b , [v] + temp)\r\n temp = sorted (temp + [v])[::-1][:k]\r\nprint (*ans)", "from sys import stdin\r\nfrom heapq import *\r\n\r\ninput = lambda: stdin.buffer.readline().rstrip(b'\\r\\n').decode('ascii')\r\nn, m = map(int, input().split())\r\np, c = [[int(x) for x in input().split()] for _ in range(2)]\r\na, que, ans = sorted(range(n), key=p.__getitem__), [], [c[i] for i in range(n)]\r\n\r\nfor i in range(n):\r\n ans[a[i]] += sum(que)\r\n heappush(que, c[a[i]])\r\n if len(que) > m:\r\n heappop(que)\r\nprint(*ans)", "f= lambda: map(int,input().split())\r\nn,k=f()\r\na=[]\r\nans=[0]*n\r\ns=0\r\nfor x, c, i in sorted(zip(f(),f(),range(n))):\r\n s+=c\r\n ans[i]=s\r\n a=sorted(a+[c])\r\n if len(a) > k:\r\n s-=a[0]; del a[0]\r\nprint(*ans) \r\n \r\n", "R=lambda:map(int,input().split())\nn,k=R()\nr=[0]*n\nl=[]\ns=0\nfor _, c, i in sorted(zip(R(),R(),range(n))):\n s+=c;r[i]=s;l=sorted(l+[c])\n if len(l)>k:\n s-=l[0];del l[0]\nprint(*r)\n", "n, k = map(int, input().split())\r\np = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nif k == 0:\r\n print(' '.join(map(str, c)))\r\nelse:\r\n for i in range(n):\r\n p[i] = (p[i], c[i], i)\r\n p.sort()\r\n prevk = []\r\n ans = [0 for i in range(n)]\r\n ans[p[0][2]] = p[0][1]\r\n for i in range(1, n):\r\n prevk.append(p[i - 1][1])\r\n if i > k:\r\n prevk.sort(reverse=True)\r\n prevk.pop()\r\n ans[p[i][2]] = sum(prevk) + p[i][1]\r\n print(' '.join(map(str, ans)))\r\n\r\n\r\n\r\n", "nk, k = [int(x) for x in input().split()]\r\nknights = [int(x) for x in input().split()]\r\ncoins = [int(x) for x in input().split()]\r\n\r\ndata = sorted(zip(knights, coins, range(nk)))\r\nhave = [0] * nk\r\nselected = []\r\nfor p, c, i in data:\r\n ans = c + sum(selected)\r\n have[i] = ans\r\n selected.append(c)\r\n selected = sorted(selected, reverse=True)[:k]\r\nprint(*have)", "from heapq import heappushpop\nn, k = map(int, input().split())\nps = list(map(int, input().split()))\ncs = list(map(int, input().split()))\ncoins = [0]*k\nindices = sorted(range(n), key=(lambda i: ps[i]), reverse=True)\nans = list(cs)\nfor i in reversed(indices):\n while ps[indices[-1]] < ps[i]:\n heappushpop(coins, cs[indices.pop()])\n ans[i] += sum(coins)\nprint(*ans, sep=' ')\n", "from sys import stdin,stdout\r\nimport heapq\r\nnmbr=lambda:int(stdin.readline())\r\nlst=lambda:list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,k=lst()\r\n l=sorted(zip(lst(),lst(),range(n)))\r\n h=[];sm=0\r\n ans={}\r\n for i in range(n):\r\n pwr,cns,ind=l[i]\r\n sm+=cns\r\n if len(h)>k:\r\n sm-=heapq.heappop(h)\r\n ans[ind]=sm\r\n heapq.heappush(h,cns)\r\n for i in range(n):\r\n stdout.write(str(ans[i])+' ')\r\n print()", "t=lambda:map(int,input().split())\r\nn,k=t()\r\nr=[0]*n\r\nl=[]\r\ns=0\r\nfor h,c,i in sorted(zip(t(),t(),range(n))):\r\n s+=c;r[i]=s;l=sorted(l+[c])\r\n if len(l)>k: s-=l[0];del l[0]\r\nprint(*r)", "n, k = input().split(' ')\r\nn = int(n)\r\nk = int(k)\r\npower2 = input().split(' ')\r\ngold = input().split(' ')\r\nprof = [0] * k\r\nsums = dict()\r\ns = 0\r\nd = dict()\r\nfor i in range(n):\r\n power2[i] = int(power2[i])\r\n gold[i] = int(gold[i])\r\n d[power2[i]] = gold[i]\r\npower = sorted(power2)\r\nfor i in range(n):\r\n ind = power[i]\r\n coin = d[ind]\r\n for j in range(k):\r\n if prof[j] >= coin:\r\n sums[ind] = s + coin\r\n prof.insert(j, coin)\r\n s = s - prof[0] + coin\r\n del prof[0]\r\n break\r\n else:\r\n sums[ind] = s + coin\r\n prof.append(coin)\r\n s = s - prof[0] + coin\r\n del prof[0]\r\nst = ''\r\nfor elem in power2:\r\n st += str(sums[elem]) + ' '\r\nprint(st)", "import sys\r\nfrom heapq import heappush, heappop\r\ninput = sys.stdin.readline \r\n\r\nn, k = map(int, input().split())\r\np = list(map(int, input().split())) \r\nc = list(map(int, input().split())) \r\nl = [] \r\nfor i in range(n):\r\n l.append([p[i], -c[i], i]) \r\nl.sort() \r\nans = [0] * n \r\na = []\r\nct = 0\r\nfor i in range(n):\r\n s = c[l[i][2]] \r\n f = []\r\n for j in range(min(ct, k)):\r\n q = heappop(a)\r\n f.append(q) \r\n s += -q \r\n while(f):\r\n heappush(a, heappop(f)) \r\n heappush(a, l[i][1])\r\n ct += 1\r\n ans[l[i][2]] = s\r\nprint(*ans)\r\n ", "f = lambda: map(int, input().split())\r\nn, k = f()\r\n\r\nknight_coins = []\r\nresult = [0] * n\r\ntotal_coins = 0\r\n\r\nfor power, coins, index in sorted(zip(f(), f(), range(n))):\r\n total_coins += coins \r\n result[index] = total_coins\r\n knight_coins = sorted(knight_coins + [coins])\r\n if len(knight_coins) > k:\r\n total_coins -= knight_coins[0] \r\n del knight_coins[0] \r\n\r\nprint(*result)# 1698408499.3269129", "from math import ceil, log\r\nfrom heapq import heappop, heappush, heapify\r\nt = 1\r\nfor test in range(t):\r\n n,k = map(int, input().split())\r\n p = list(map(int, input().split()))\r\n c = list(map(int, input().split()))\r\n arr = [i for i in sorted(enumerate(p), key=lambda x:x[1])]\r\n maxcoins = [0 for i in range(k)]\r\n heapify(maxcoins)\r\n ans = list(p)\r\n tmpSum = 0\r\n tmpSum2 = 0\r\n prev = arr[0][1]\r\n for ind, power in arr:\r\n if power>prev:\r\n ans[ind] = tmpSum+c[ind]\r\n tmpSum2 = tmpSum\r\n else:\r\n ans[ind] = tmpSum2+c[ind]\r\n heappush(maxcoins, c[ind])\r\n tmpSum+=c[ind]\r\n tmpSum-=heappop(maxcoins)\r\n print(*ans)\r\n\r\n\r\n\r\n\r\n \r\n\r\n", "n,k = tuple(map(lambda x:int(x), input().split(' ')))\np = list(map(lambda x:int(x), input().split(' ')))\nc = list(map(lambda x:int(x), input().split(' ')))\nout = [i for i in c]\n#t = [(p[i], c[i]) for i in range(n)]\nt = [(p[i], i) for i in range(n)]\nimport heapq\nkbest = []\n#print(t)\nt.sort()\n#print(t)\nprev = 0\ni = 0\nwhile i < len(t):\n j = i\n while j < len(t) and t[j][0] == t[i][0] :\n out[t[j][1]] += sum(kbest)\n j += 1\n while i < j:\n heapq.heappush(kbest, c[t[i][1]])\n if len(kbest) > k:\n heapq.heappop(kbest)\n i += 1\n\"\"\"\nimport bisect\nfor i in range(n):\n tp = (p[i], -1)\n it = bisect.bisect_left(t, tp)\n #print(it)\n aux = [tup[1] for tup in t[:it]]\n aux.sort()\n out[i] += sum(aux[-k:])\n\"\"\"\nprint(' '.join(map(lambda x: str(x), out)))\n\n", "import sys\ninput = sys.stdin.readline\n\n'''\n\n'''\n\nfrom heapq import heapify, heappush, heappop\n\nn, k = map(int, input().split())\nplst = list(map(int, input().split()))\nclst = list(map(int, input().split()))\n\nif k == 0:\n print(*clst)\n sys.exit()\n\npc = sorted(((p, c, i) for i, (p, c) in enumerate(zip(plst, clst))), key=lambda t: (t[0], t[2]))\nres = [0] * n\npq = []\npq_sum = 0\npq_size = 0\n\nfor p, c, i in pc:\n if i > 0 and plst[i] == plst[i-1]:\n res[i] = res[i-1]\n else:\n res[i] = pq_sum + c\n\n # Update pq\n if pq_size < k:\n heappush(pq, c)\n pq_sum += c\n pq_size += 1\n else:\n alt = heappop(pq)\n if alt < c:\n heappush(pq, c)\n pq_sum += c - alt\n else:\n heappush(pq, alt)\n\nprint(*res)\n", "import heapq\n\n\nn, k = list(map(int, input().strip().split()))\n\np = list(map(int, input().strip().split()))\nc = list(map(int, input().strip().split()))\n\np = sorted([(x, i) for i, x in enumerate(p)], key=lambda x: x[0])\n\nans = []\ntop_k = []\n\ncur_gold = 0\nfor i, t in enumerate(p):\n if k == 0:\n ans.append((c[t[1]], t[1]))\n else:\n if i < k:\n cur_gold += c[t[1]]\n ans.append((cur_gold, t[1]))\n heapq.heappush(top_k, c[t[1]])\n else:\n smallest = heapq.nsmallest(1, top_k)[0]\n if smallest < c[t[1]]:\n cur_gold += c[t[1]]\n ans.append((cur_gold, t[1]))\n heapq.heappop(top_k)\n heapq.heappush(top_k, c[t[1]])\n cur_gold -= smallest\n else:\n ans.append((cur_gold + c[t[1]], t[1]))\n\nans = sorted(ans, key=lambda x: x[1])\nprint(\" \".join(map(lambda x: str(x[0]), ans)))", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 998244353\ndd = [(0,-1),(1,0),(0,1),(-1,0)]\nddn = [(0,-1),(1,-1),(1,0),(1,1),(0,1),(-1,-1),(-1,0),(-1,1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\n\n\ndef main():\n n,m = LI()\n a = LI()\n b = LI()\n c = []\n if m == 0:\n return ' '.join(map(str, b))\n for i in range(n):\n c.append((a[i],b[i],i))\n c.sort()\n t = []\n rr = {}\n for d,e,i in c:\n tr = e\n tr += sum(t)\n rr[i] = tr\n if len(t) < m:\n t.append(e)\n else:\n tm = min(t)\n if tm < e:\n tmi = t.index(tm)\n t[tmi] = e\n r = []\n for i in range(n):\n r.append(rr[i])\n return ' '.join(map(str,r))\n\n\nprint(main())\n\n", "a=input()\r\nb=input()\r\nc=input()\r\ninfo=a.split()\r\ninfo=list(map(int, info))\r\ny=b.split()\r\npowers=list(map(int, y))\r\nz=c.split()\r\ncoins=list(map(int, z))\r\nl=sorted(zip(powers,coins,range(info[0])))\r\nfinal=[0]*info[0]\r\ns=0\r\nw=[]\r\nfor _, c, i in l:\r\n s+=c\r\n final[i]=s\r\n w=sorted(w+[c])\r\n if len(w)>info[1]:\r\n s-=w[0]\r\n del w[0]\r\nprint(*final)", "f= lambda: map(int,input().split())\r\nn,k=f()\r\na=[]\r\nans=[0]*n\r\nsum=0\r\nfor x, c, i in sorted(zip(f(),f(),range(n))):\r\n sum+=c\r\n ans[i]=sum\r\n a=sorted(a+[c])\r\n if len(a) > k:\r\n sum-=a[0]\r\n del a[0]\r\nprint(*ans)", "#Zadb\r\nn,k=map(int, input().split())\r\npov=list(map(int,input().split()))\r\ncoin=list(map(int,input().split()))\r\nvse=[]\r\nfor i in range(n):\r\n vse.append((pov[i],coin[i],i))\r\nif k==0:\r\n print(' '.join(str(n) for n in coin))\r\nelse:\r\n vse.sort()\r\n ans=[]\r\n k_set=[]\r\n for i in range(n):\r\n ans.append((vse[i][2],sum(k_set)+vse[i][1]))\r\n if len(k_set)<k:\r\n k_set.append(vse[i][1])\r\n else:\r\n minn=min(k_set)\r\n if minn>=vse[i][1]:\r\n pass\r\n else:\r\n k_set.remove(minn)\r\n k_set.append(vse[i][1])\r\n ans.sort()\r\n print(' '.join(str(n[1]) for n in ans))", "from heapq import heappushpop\nn, k = map(int, input().split())\nps = list(map(int, input().split()))\ncs = list(map(int, input().split()))\ncoins = [0]*k\nindices = sorted(range(n), key=(lambda i: ps[i]), reverse=True)\nans = list(cs)\ns = 0\nfor i in reversed(indices):\n while ps[indices[-1]] < ps[i]:\n c = cs[indices.pop()]\n s += c - heappushpop(coins, c)\n ans[i] += s\nprint(*ans, sep=' ')\n" ]

[ "from math import gcd\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ng = a[0]\r\nmax = a[0]\r\nfor i in a:\r\n if i > max:\r\n max = i\r\n g = gcd(g, i)\r\n\r\nans = (max // g) - n\r\n\r\nif ans % 2 == 0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")", "import functools\r\nimport math\r\n\r\nn = int(input())\r\ntab = list(map(int, input().split()))\r\npgcd = functools.reduce(lambda x, y: math.gcd(x, y), tab)\r\nnbturns = max(tab) / pgcd - n\r\nprint('Alice' if nbturns % 2 == 1 else 'Bob')\r\n", "from math import *\r\nn=int(input())\r\na=list(map(int,input().split()))\r\np=a[0]\r\nfor i in range(1,n):\r\n p=gcd(p,a[i])\r\nans=(max(a)//p-n)%2\r\nprint(\"Alice\") if ans else print(\"Bob\")", "import fractions, functools\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ngcd = functools.reduce(fractions.gcd, a)\r\nmoves = max(a) // gcd - n\r\nprint(['Bob', 'Alice'][moves % 2])", "n = int(input())\r\nciag = [int(x) for x in input().split()]\r\nnaj = 0\r\nfor i in range(n):\r\n\tif naj<ciag[i]:\r\n\t\tnaj = ciag[i]\r\n\t\t\r\ndef nwd(a,b):\r\n\twhile b!=0:\r\n\t\ta,b = b, a%b\r\n\treturn a\r\n\r\nwsz = nwd(ciag[1],ciag[0])\r\nfor i in range(1,n):\r\n\twsz = nwd(wsz,ciag[i])\r\n\r\nwy = (naj//wsz-n)%2\r\nif wy == 1:\r\n\tprint('Alice')\r\nelse:\r\n\tprint('Bob')", "import math\nn = int(input())\nnumbers = [int(x) for x in input().split(' ')]\n\ngcd = numbers[0]\nfor i in numbers:\n gcd = math.gcd(i, gcd)\n\ncheck = max(numbers)/gcd - len(numbers)\nif(check%2!=0):\n print(\"Alice\")\nelse:\n print(\"Bob\")\n\t\t\t \t\t\t \t\t \t \t\t\t\t \t\t\t\t\t\t", "from math import gcd\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = a[0]\r\nfor i in range(1, n):\r\n\td = gcd(d, a[i])\r\n\r\na = list(map(lambda x: x//d, a))\r\nprint(\"Alice\" if (max(a) - n) % 2 == 1 else \"Bob\")", "n, listo2, c= int(input()), [], 0\r\nimport math\r\nlisto = list(map(int,input().split()))\r\nlisto.sort()\r\nobaa = listo[0]\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\nfor i in range(1,n):\r\n GCD = gcd(listo[i], obaa)\r\n obaa = GCD\r\nbomba = int(listo[n-1]/GCD) - n \r\nif bomba % 2 == 0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")", "import math\r\nn = int(input())\r\na = list(map(int,input().split()))\r\ng = 0\r\nfor i in range(len(a)):\r\n g = math.gcd(g,a[i])\r\nif (max(a)/g-len(a))%2==0:\r\n print('Bob')\r\nelse:\r\n print('Alice')\r\n", "#n,m,k=list(map(int, input().split()))\r\nn=int(input())\r\n\r\n\r\n\r\nbloc=list(map(int, input().split())) \r\n\r\nrest=bloc[0]\r\n\r\nzero=0\r\n\r\n\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n partial=min(rest,max(bloc[i],bloc[j])% min(bloc[i],bloc[j]))\r\n if partial==0:\r\n zero=1\r\n elif rest>partial:\r\n rest=partial\r\n \r\n#print(\"rest=\",rest)\r\n\r\nposibil=1\r\nwhile posibil==1:\r\n posibil=0\r\n for i in bloc:\r\n partial=i%rest\r\n if partial>0 and partial<rest:\r\n rest=partial\r\n posibil=1\r\n \r\n#print(\"rest=\",rest) \r\ncate=max(bloc)//rest\r\n#multipli=0\r\nfor i in bloc:\r\n if i% rest==0:\r\n cate-=1\r\n \r\n \r\n#print(cate) \r\nif cate%2==0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")\r\n", "from fractions import gcd\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\nans = a[0]\r\nfor i in a:\r\n ans = gcd(ans,i)\r\n\r\ncnt = max(a)//ans\r\nleft = cnt-n\r\n\r\nif left%2 == 1:\r\n print(\"Alice\")\r\n \r\nelse:\r\n print(\"Bob\")\r\n\r\n", "def gcd(a,b):\r\n if a<b:\r\n a,b=b,a \r\n \r\n if b==0:\r\n return a \r\n return gcd(b,a%b)\r\n\r\nn=int(input())\r\nl=list(map(int, input().split()))\r\nmx=max(l)\r\nx=0 \r\nfor i in l:\r\n x=gcd(x,i)\r\n\r\n\r\nif ((mx//x) -n)%2==1:\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")\r\n", "def gcd(a,b):\r\n if b == 0:\r\n return a\r\n return gcd(b,a%b)\r\na = int(input())\r\nb = map(int,input().split())\r\nc = m = 0\r\nfor x in b:\r\n c = gcd(c,x)\r\n if(x > m):\r\n m = x\r\nif (m//c-a)&1:\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")\r\n\r\n", "from math import gcd\r\n\r\n\r\ndef alice_bob(lst):\r\n m, g = 0, 0\r\n for elem in lst:\r\n g, m = gcd(g, elem), max(m, elem)\r\n if (m // g + len(lst)) % 2:\r\n return \"Alice\"\r\n return \"Bob\"\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(alice_bob(a))\r\n", "def gcd (a,b):\r\n if (b == 0):\r\n return a\r\n else:\r\n return gcd (b, a % b)\r\n \r\nn=int(input())\r\n\r\nA = list(map(int,input().split()))\r\n\r\nres = A[0]\r\nfor c in A[1::]:\r\n res = gcd(res , c)\r\n \r\n\r\ne=(max(A)//res)-len(A)\r\nif e%2!=0:\r\n print('Alice')\r\nelse:\r\n print('Bob')", "n=int(input())\r\na=list(map(int,input().split()))\r\ndef gcd(a,b):\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\nx=a[0]\r\nfor i in a:\r\n x=gcd(x,i)\r\nz=max(a)//x-n\r\nif z%2==0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")", "from math import gcd\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\n# 2 4 8\r\n#2 4 8 6 #where 2 4 8 can not counted\r\n#so move=1\r\nx=0\r\nfor i in arr:x=gcd(i,x)\r\nmoves=(max(arr)//x)-n\r\nif moves&1:print(\"Alice\")\r\nelse:print(\"Bob\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ng=l[0]\r\nfrom math import gcd\r\nfor i in l:\r\n g=gcd(g,i)\r\nmoves = max(l)//g - n\r\nif(moves%2==1):\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")", "def main():\r\n n = int(input())\r\n l = list(map(int, input().split()))\r\n a = l[-1]\r\n for b in l:\r\n while a:\r\n a, b = b % a, a\r\n a = b\r\n print(('Bob', 'Alice')[(max(l) // a - n) & 1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\nS = [int(x) for x in input().split(' ')] # assuming distinct\n\ndef gcd(lst):\n res = lst[0]\n for x in lst[1:]:\n while x != 0:\n res, x = x, res%x\n return res\n\nsize_end = max(S)//gcd(S)\nif (size_end-len(S))%2 == 0:\n print(\"Bob\")\nelse :\n print(\"Alice\")\n", "from sys import stdin\r\nfrom functools import reduce\r\nfrom math import gcd\r\n\r\nn, a = int(stdin.readline()), sorted(map(int, stdin.readline().split()))\r\ng = reduce(gcd, a)\r\nprint('Alice' if ((a[-1] - g * n) // g) % 2 else 'Bob')\r\n", "from sys import stdin\r\nfrom math import gcd\r\ninput=stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ng=a[0]\r\nfor i in range(1,n):\r\n g=gcd(g,a[i])\r\nr=max(max(a)//g-n,0)\r\nif r%2==0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")", "from sys import stdin\nfrom math import gcd\nfrom functools import reduce\ninput = stdin.readline\nput = lambda : list(map(int, input().split()))\nmod = int(1e9 + 7)\n\nn,= put()\nl = put()\ng = reduce(gcd, l)\nm = max(l)//g\nif (m-n)%2==1:\n print('Alice')\nelse:\n print('Bob')", "import fractions;\n\nn = int(input());\na = list(map(int, input().split()));\ngcd = a[0];\nfor i in range(1, n):\n\tgcd = fractions.gcd(gcd, a[i]);\nx = (max(a) / gcd - n)\nif (x % 2 == 1):\n\tprint(\"Alice\");\nelse:\n\tprint(\"Bob\");", "n = int(input()) \nL = list(map(int,input().split()))\nm = max(L)\nimport functools as f\n\ng = lambda a,b:a if b==0 else g(b,a%b) #Gcd for two numbers\nx = f.reduce(lambda x,y:g(x,y),L)\na = m//x - n \nif (a%2 == 0):\n print(\"Bob\")\nelse:\n print(\"Alice\")", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=l[0]\r\nfrom math import gcd\r\nfor i in l:\r\n x=gcd(x,i)\r\nx=(max(l)//x)-n\r\nif(x%2==1):\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")", "from math import gcd\r\nn = int(input())\r\nl = [int(x) for x in input().split()]\r\ng = l[0]\r\nfor i in l[1:]:\r\n\tg = gcd(g,i)\r\nprint(\"Alice\" if (max(l)//g-n)%2==1 else \"Bob\")", "from fractions import gcd\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = gcd(a[0], a[1])\r\nfor i in range(1, n, 1):\r\n d = gcd(d, a[i])\r\nm2 = max(a)\r\nif (m2//d-n) % 2 == 1:\r\n print('Alice')\r\nelse:\r\n print('Bob')\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\ng = 0 \r\nfor i in a:\r\n g = gcd(g, i)\r\nc = max(a) // g - n \r\nif(c % 2):\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")", "import math\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ng = arr[0]\r\nfor i in range(1, n):\r\n g = math.gcd(g, arr[i])\r\n\r\ntotal = max(arr) // g\r\nnew = total - n\r\nif new % 2 == 1:\r\n print('Alice')\r\nelse:\r\n print('Bob')\r\n", "from fractions import gcd\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nd = max(a)\r\nc = 0\r\nfor i in range(len(a)):\r\n c = gcd(c,a[i])\r\nresult = d //c-n\r\nif result % 2 == 0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")", "from math import gcd\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\np=arr[0]\r\nfor el in arr[1:]:\r\n p=gcd(p,el)\r\nv=max(arr)//p-n\r\nif v%2==0:\r\n print(\"Bob\")\r\nelse :\r\n print(\"Alice\")", "def gcd(a,b):\r\n return a if b==0 else gcd(b,a%b)\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ncom=a[0]\r\nfor x in a:\r\n com=gcd(com,x)\r\ncnt=max(a)//com\r\nprint((cnt-n)%2==1 and 'Alice' or 'Bob')", "from math import gcd\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nG = 0\r\nfor a in A:\r\n G = gcd(G, a)\r\n\r\nt = max(A)//G - n\r\n\r\nif t % 2 == 1:\r\n print('Alice')\r\nelse:\r\n print('Bob')\r\n", "from fractions import gcd\r\nfrom functools import reduce\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ng = reduce(gcd, a)\r\ns = max(a)//g - n\r\nif s%2:\r\n print('Alice')\r\nelse:\r\n print('Bob')", "from collections import defaultdict,Counter,deque\nimport math\nimport bisect\nfrom itertools import accumulate\nfrom math import ceil, log,gcd\nfrom functools import lru_cache\nfrom sys import stdin, stdout\nimport time\nimport atexit\nimport io\nimport sys\nimport string\n\n\n\n\n\n\n\ndef write(*args, **kwargs):\n sep = kwargs.get('sep', ' ')\n end = kwargs.get('end', '\\n')\n stdout.write(sep.join(str(a) for a in args) + end)\n\ndef read():\n return stdin.readline().rstrip()\nimport sys\nimport random\nfrom typing import List\nimport heapq\nfrom functools import reduce\n\ndef primes(n):\n if n<=2:\n return []\n sieve=[True]*(n+1)\n for x in range(3,int(n**0.5)+1,2):\n for y in range(3,(n//x)+1,2):\n sieve[(x*y)]=False\n \n return [2]+[i for i in range(3,n,2) if sieve[i]]\n\ndef factors(n): \n return set(reduce(list.__add__, \n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\n\n\ndef prime_factors(n):\n i = 2\n factors = []\n d = defaultdict(lambda:0)\n for i in primes(int(n**0.5+1)):\n while n % i == 0:\n n //= i\n factors.append(i)\n d[i]+=1\n if n > 1:\n factors.append(n)\n d[n]+=1\n return factors,d\n\n@lru_cache(None)\ndef fib(n):\n if n < 3:\n return 1\n else:\n return fib(n-1) + fib(n-2)\nn = int(read())\n# h,n= [*map(int, read().split())] \nx = [*map(int, read().split())] \n\n\ng = x[0]\n\nfor i in x[1:]:\n g = math.gcd(g,i)\n \nfor i in range(n):\n x[i] /= g\n\nc = max(x)-len(x)\n\nif c%2 == 1:\n print('Alice')\nelse :\n print('Bob') \n", "\r\nfrom math import gcd\r\n\r\nn = int(input())\r\nar = sorted(map(int,input().split()))\r\n\r\nd = gcd(ar[0],ar[1])\r\n\r\nfor i in range(2,n):\r\n\td = gcd(d,ar[i])\r\n\r\nN = max(ar)//d - n\r\nprint( \"Alice\" if N%2 else \"Bob\")\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nimport fractions\n\nn = int(input())\na = list(map(int, input().split()))\nm = max(a)\ng = 0\nfor i in a:\n g = fractions.gcd(g, i)\n\nif (m//g - n) % 2 == 0:\n print('Bob')\nelse:\n print('Alice')\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ndef gcd(a,b):\r\n if b==0: return a \r\n return gcd(b,a%b) \r\ng=0\r\nfor i in l:\r\n g=gcd(g,i)\r\nno_of_moves=max(l)//g-n \r\nprint('Alice' if no_of_moves&1 else 'Bob')\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN = int(input())\nA = list(map(int,input().split()))\n\ng = A[0]\nfor i in A:g = gcd(i,g)\n\nif ((max(A)//g)-N)%2==1:\n print('Alice')\nelse:\n print(\"Bob\")", "import math\r\nn=int(input())\r\na=list(map(int,input().split()))\r\ntemp=min(a)\r\nfor i in a:\r\n temp=math.gcd(temp,i)\r\nmax1=max(a)\r\nn1=max1//temp-len(a)\r\nif(n1%2==0):\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")\r\n", "from math import gcd\r\nfrom functools import reduce\r\nn, a = int(input()), list(map(int, input().split()))\r\ng = reduce(lambda x, y: gcd(x, y), a, 0)\r\nprint(\"Alice\" if (max(a) // g - n) % 2 == 1 else \"Bob\")", "primes=[]\r\niota=[1 for j in range(10**5+1)]\r\niota[0], iota[1]=0, 0\r\nfor j in range(2, 10**5+1):\r\n if iota[j]==1:\r\n c=2\r\n while c*j<=10**5:\r\n iota[c*j]=0\r\n c+=1\r\nfor j in range(10**5+1):\r\n if iota[j]==1:\r\n primes.append(j)\r\n#print(primes)\r\nn=int(input())\r\nw=[int(k) for k in input().split()]\r\neta={}\r\nfor j in w:\r\n x=j\r\n for k in primes[:10**5-1]:\r\n res=0\r\n while x%k==0:\r\n x//=k\r\n res+=1\r\n if k in eta:\r\n eta[k]=min(eta[k], res)\r\n else:\r\n eta[k]=res\r\nres=1\r\nfor j in eta.keys():\r\n for k in range(eta[j]):\r\n res*=j\r\nres=max(w)//res-n\r\nif res%2==1:\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n sys.stdout.write()\n pass\n\n\ndef solve(nums):\n\n c = math.gcd(nums[0], nums[1])\n for ele in nums:\n c = math.gcd(c, ele)\n total = max(nums) // c - len(nums)\n if total % 2 == 1:\n return \"Alice\"\n return \"Bob\"\n\n\ndef readinput():\n _ = getInt()\n nums = list(getInts())\n print(solve(nums))\n\nreadinput()\n", "def gcd(a, b):\n return gcd(b, a % b) if b else a\n\nn = int(input())\nA = [int(x) for x in input().split()]\nA.sort()\ng = 0\nfor x in A:\n g = gcd(x, g);\nprint(\"Alice\" if (A[n-1]//g-n) % 2 else \"Bob\")\n", "import math\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ngcd = 0\r\nfor num in arr:\r\n\tgcd = math.gcd(gcd, num)\r\n\r\nmoves = max(arr) / gcd - n\r\nif moves % 2:\r\n\tprint('Alice')\r\nelse:\r\n\tprint('Bob')", "from math import gcd\r\ndef main():\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n all_gcd = 0\r\n for x in l:\r\n all_gcd = gcd(all_gcd,x)\r\n maxi = max(l)\r\n max_elements_poss = maxi//all_gcd\r\n if (max_elements_poss-n)&1:\r\n print(\"Alice\")\r\n else:\r\n print(\"Bob\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\ndef answer(n,A):\r\n maxi=A[0]\r\n g=A[0]\r\n for i in range(1,n):\r\n g=math.gcd(g,A[i])\r\n maxi=max(maxi,A[i])\r\n \r\n x=maxi//g-n\r\n \r\n if x%2==0:\r\n return \"Bob\"\r\n else:\r\n return \"Alice\"\r\n \r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(answer(n,arr))", "import sys, threading\r\nimport math\r\nimport time\r\nfrom os import path\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\nfrom functools import cmp_to_key\r\nimport heapq\r\n \r\n \r\n# # # # # # # # # # # # # # # #\r\n# JAI SHREE RAM #\r\n# # # # # # # # # # # # # # # #\r\n \r\n \r\ndef lcm(a, b):\r\n return (a*b)//(math.gcd(a,b))\r\n \r\n \r\ndef solve():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n g=0\r\n a.sort()\r\n\r\n for i in range(n):\r\n g=math.gcd(g,a[i])\r\n \r\n max_n=a[-1]//g\r\n\r\n numbers_added = max_n-n\r\n\r\n if numbers_added%2:\r\n print(\"Alice\")\r\n else:\r\n print(\"Bob\")\r\n\r\n \r\n \r\ndef main():\r\n t = 1\r\n if path.exists(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\"):\r\n sys.stdin = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/input.txt\", 'r')\r\n sys.stdout = open(\"/Users/nitishkumar/Documents/Template_Codes/Python/CP/Codeforces/output.txt\", 'w')\r\n start_time = time.time()\r\n print(\"--- %s seconds ---\" % (time.time() - start_time))\r\n \r\n \r\n sys.setrecursionlimit(10**5)\r\n\r\n solve()\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "import math\r\nn = int(input())\r\narr = sorted(list(map(int, input().split())))\r\nb = 0\r\nfor i in arr:\r\n b = math.gcd(b, i)\r\nc = (arr[0] - 1) // b\r\nc += sum([(arr[i+1] - arr[i] - 1) // b for i in range(n-1)])\r\nprint('Bob' if c % 2 == 0 else 'Alice')\r\n", "import sys\r\nimport math as mt\r\nimport collections as cc\r\ninput = sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\nn , = I()\r\nar = I()\r\ngc = ar[0]\r\nfor i in ar[1::]:\r\n gc = mt.gcd(gc,i)\r\nif (n-(max(ar)//gc))%2==0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")", "import math\nimport sys\nfrom functools import reduce\ninput = sys.stdin.readline\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 solve():\n n = read_int()\n a = read_ints()\n gcd = reduce(math.gcd, a, a[0])\n moves = max(a)/gcd-n\n if moves%2 == 0:\n return 'Bob'\n return 'Alice'\n\n\nif __name__ == '__main__':\n print(solve())\n", "# LUOGU_RID: 132706419\n# pypy3\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nimport sys\r\nfrom math import gcd\r\n\r\nIN = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nPN = lambda x: sys.stdout.write(x)\r\nI = lambda: int(IN())\r\nS = lambda: IN().split()\r\nM = lambda: map(int, IN().split())\r\nL = lambda: list(map(int, IN().split()))\r\nG = lambda: map(lambda x: int(x) - 1, IN().split())\r\n\r\nn = I()\r\na = L()\r\n\r\ng = 0\r\nfor x in a:\r\n g = gcd(x, g)\r\n\r\ncnt = max(a) / g\r\n\r\nif cnt % 2 == n % 2:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")", "from functools import reduce\r\n\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm, g = max(a), reduce(gcd, a)\r\nprint('Alice' if (m // g - n) & 1 else 'Bob')", "def gcd(a, b):\r\n a, b = max(a, b), min(a, b)\r\n while a % b != 0:\r\n a %= b\r\n a, b = b, a\r\n return b\r\n\r\nn = int(input())\r\nsp = list(map(int, input().split()))\r\ng = sp[0]\r\nmx = 0\r\nfor i in sp:\r\n mx = max(mx, i)\r\n g = gcd(g, i)\r\ncnt = mx / g - n\r\nif cnt % 2 == 1:\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")", "import math\r\nn=int(input())\r\nlistt=list(map(int,input().split()))\r\nx=0\r\nfor i in range(n):x=math.gcd(x,listt[i])\r\nmoves=(max(listt)//x)-n\r\nif moves&1==1:print(\"Alice\")\r\nelse:print(\"Bob\")\r\n", "'''\r\n\r\ndivide all numbers by gcd\r\n\r\nsolve the same problem\r\n\r\nfind missing numbers from 1 to max(A)\r\n\r\nif odd, alice\r\n\r\nif even, bob\r\n\r\n'''\r\ndef gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\n\r\nn = int(input())\r\nA = [int(i) for i in input().split()]\r\n\r\ngx = A[0]\r\nfor i in A:\r\n gx = gcd(gx, i)\r\n\r\nfor i in range(n):\r\n A[i] = A[i]//gx\r\n\r\nstart = 1\r\nval = 0\r\nA.sort()\r\nfor i in range(n):\r\n if start<=A[i]:\r\n val+=A[i]-start\r\n start = A[i]+1\r\n #print(i, val)\r\n#print(val)\r\nif val&1:\r\n print('Alice')\r\nelse:\r\n print('Bob')\r\n", "def main():\n import sys\n input = sys.stdin.readline\n def euklides(a, b):\n while b > 0:\n pom = b\n b = a%b\n a = pom\n return a\n def nwd(tab, n):\n wynik = euklides(tab[0], tab[1])\n for i in range(2, n):\n wynik = euklides(wynik, tab[i])\n return wynik\n n = int(input())\n tab = list(map(int, input().split()))\n NWD = nwd(tab, n)\n print('Bob' if ((max(tab)/NWD)-n) % 2 == 0 else 'Alice' )\nmain()", "from math import gcd\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = 0\r\nfor i in range(n):\r\n d = gcd(d, a[i])\r\nk = max(a)//d-n\r\n\r\nif k%2:\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")", "def find_gcd(x, y): \r\n \r\n while(y): \r\n x, y = y, x % y \r\n \r\n return x \r\n\r\n\r\n\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\n\r\nnum1 = a[0] \r\nnum2 = a[1] \r\ngcd = find_gcd(num1, num2) \r\n \r\nfor i in range(2, len(a)): \r\n gcd = find_gcd(gcd, a[i]) \r\n \r\nif ((n-(max(a)//gcd))%2==0):print(\"Bob\")\r\nelse:print(\"Alice\")", "#print('Bob' if int(input()) % 2 else 'Alice')\r\n#argh I hate misreading the problem\r\n\r\nimport fractions\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ngcd = a[0]\r\nfor x in a:\r\n gcd = fractions.gcd(gcd, x)\r\nmoves = max(a) // gcd - n\r\nprint('Alice' if moves % 2 else 'Bob')\r\n", "def gcd(a,b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\nn = int(input())\r\nai = list(map(int,input().split()))\r\nnum = ai[0]\r\nfor i in range(1,n):\r\n num = gcd(num,ai[i])\r\nans = (max(ai) // num - n ) % 2\r\nprint(\"Alice\" * ans + \"Bob\" * (1-ans))\r\n", "from sys import stdin,stdout\r\nfrom math import gcd\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 g=a[0]\r\n for v in a[1:]:\r\n g=gcd(g,v)\r\n mx=max(a)\r\n terms=abs(n-mx//g)\r\n print('Alice' if terms&1 else 'Bob')", "from fractions import gcd\r\n\r\nn = int(input())\r\nx = list(map(int, input().split(' ')))\r\ngcdx = x[0]\r\nfor i in x:\r\n gcdx = gcd(gcdx, i)\r\n \r\nnums = max(x) / gcdx\r\n\r\nif (int(nums) - n)%2 == 1:\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")\r\n", "#!/usr/bin/python3\n\nn = int(input())\na = sorted(map(int, input().split()))\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\ndef gcd2(lst):\n if len(lst) == 1:\n return lst[0]\n lst.append(gcd(lst.pop(), lst.pop()))\n return gcd2(lst)\nm = a[-1]\nprint('Alice' if (m // gcd2(a) - n) % 2 == 1 else 'Bob')\n", "from functools import reduce\r\n\r\ndef gcd(a, b):\r\n while a > 0:\r\n a, b = b % a, a\r\n return b\r\n\r\n\r\nn, a = int(input()), list(map(int, input().split()))\r\nif (max(a) // reduce(gcd, a) - n) % 2 == 1:\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")\r\n", "from math import gcd\r\n\r\n\r\nn = int(input())\r\nseq = [int(c) for c in input().split()]\r\n\r\ng = seq[0]\r\nfor e in seq:\r\n g = gcd(g, e)\r\n\r\nseq = [e // g for e in seq]\r\n\r\nturns = max(seq) - len(seq)\r\nprint('Alice' if turns % 2 == 1 else 'Bob')\r\n", "def gcd(x,y):\n if x<y:\n return gcd(y,x)\n else:\n if y==0:\n return x\n else:\n return gcd(y,x%y)\n \n\nif __name__=='__main__':\n inp = input()\n inp = input()\n arr = inp.split(' ')\n L = []\n for a in arr:\n L.append(int(a))\n L.sort()\n mv = L[0]\n T = L[1:]\n for t in T:\n mv = gcd(mv,t)\n tot = L[-1]//mv\n for l in L:\n if l%mv==0:\n tot-=1\n if tot%2==1:\n print(\"Alice\")\n else:\n print(\"Bob\")\n \n", "from fractions import gcd\r\nn, f, m = int(input()), 0, 0\r\nfor x in map(int, input().split()):\r\n f, m = gcd(f, x), max(m, x)\r\nprint('Alice' if (m // f - n) % 2 else 'Bob')\r\n", "def gcd(a, b):\n while b > 0:\n a, b = b, a % b\n return a\n\nn = int(input())\nA = list(map(int, input().split()))\n\nGCD = A[0]\nfor x in A[1:]:\n GCD = gcd(GCD, x)\nnum = max(A) // GCD - n\nif num % 2 == 0:\n print(\"Bob\")\nelse:\n print(\"Alice\")\n\n", "from math import *\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=a[0]\r\nfor i in a:\r\n b=gcd(i,b)\r\nprint('Alice' if (max(*a)//b-n)%2==1 else 'Bob')", "n = int(input())\r\na = list(map(int, input().split()))\r\ndef nod(a,b):\r\n while a * b:\r\n if a > b:\r\n a, b = b, a % b\r\n else:\r\n a, b = b % a, a\r\n return (a + b)\r\nb = a[:]\r\nans = nod(b[0], b[1])\r\nb = b[2:]\r\nwhile b:\r\n ans = nod(ans, b[0])\r\n b = b[1:]\r\n#print(ans)\r\nfor i in range(n):\r\n a[i] = a[i] // ans\r\nif (- n + max(a)) % 2 == 0:\r\n print('Bob')\r\nelse:\r\n print('Alice')", "import math\r\nn=int(input())\r\na=sorted([int(_) for _ in input().split()])\r\nb=0\r\nfor i in a:\r\n b=math.gcd(b,i)\r\nc=(a[0]-1)//b\r\nfor i in range(n-1):\r\n c+=(a[i+1]-a[i]-1)//b;\r\nif c%2==0: print(\"Bob\")\r\nelse: print(\"Alice\")", "def gcd(a, b):\r\n\twhile a:\r\n\t\ta, b = b % a, a\r\n\treturn b\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nG = A[0]\r\nfor i in range(1, n):\r\n\tG = gcd(G, A[i])\r\nfor i in range(n):\r\n\tA[i] //= G\r\n\r\nif (max(A) - n) % 2 == 1:\r\n\tprint(\"Alice\")\r\nelse:\r\n\tprint(\"Bob\")", "# coding = utf-8\nfrom functools import reduce\ndiv = 1000000007\ns = input()\nn = int(s)\ns = input()\nnum = list(map(lambda x:int(x),s.split(\" \")))\n\ndef gcd(a,b):\n\tif b == 0:\n\t\treturn a\n\treturn gcd(b,a%b)\n\ng = reduce(gcd,num)\nm = max(num)\n\nnow = m/g\nremain = now - len(num)\nif remain%2==0:\n\tprint(\"Bob\")\nelse:\n\tprint(\"Alice\")\n\t \t\t \t\t \t\t\t \t \t\t \t\t\t \t \t\t \t\t", "from fractions import gcd\r\nn = int(input())\r\nsez = [int(i) for i in input().split()]\r\nsez.sort()\r\n\r\ng = gcd(sez[0], sez[1])\r\nfor i in range(2, n):\r\n g = gcd(g, sez[i])\r\n\r\nleft = sez[n-1]/g - n\r\nif left%2 == 1:\r\n print(\"Alice\")\r\nelse:\r\n print(\"Bob\")\r\n\r\n\r\n \r\n", "from fractions import gcd\n\nn=int(input())\n\nA=list(map(int,input().split()))\nA.sort()\nx=A[0]\nfor i in range(1,n):\n x=gcd(x,A[i])\n\n \n\nmoves=(max(A)//x)-n\n\nif(moves%2==0):\n print(\"Bob\")\nelse:\n print(\"Alice\")\n", "from math import *\r\nn=int(input())\r\nls=[int(x) for x in input().split()]\r\ng=0\r\nfor i in ls:g=gcd(g,i)\r\nx=max(ls)//g\r\nif (x-n)&1:print('Alice')\r\nelse: print('Bob')", "from sys import *\nfrom math import *\nfrom string import *\nfrom operator import *\nfrom functools import *\nfrom fractions import *\nfrom collections import *\nsetrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\nn=RI()[0]\na=RI()\nmaxVal=max(a)\ngcdVal=reduce(lambda x,y: gcd(x,y), a)\nprint([\"Bob\",\"Alice\"][(maxVal//gcdVal - n)&1])\n\n\n\n\n\n\n\n\n\n", "from fractions import gcd\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=a[0]\r\nfor i in range(1,n):\r\n x=gcd(x,a[i])\r\n# In the end,array will be x,2x,3x...,regardless of the initial state\r\nmoves=(max(a)//x)-n\r\nif(moves%2==0):\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")", "from functools import reduce\r\nfrom math import gcd\r\nn = int(input())\r\n*a, = map(int, input().split())\r\nif max(a) // reduce(gcd, a) - n & 1:\r\n print('Alice')\r\nelse:\r\n print('Bob')", "from fractions import gcd\nfrom functools import reduce\n\nn = int(input())\nseq = list(map(int, input().split()))\ngcd_gcd = reduce(gcd, seq)\nmoves = max(seq) // gcd_gcd - n\n\nif moves % 2 != 0:\n\tprint(\"Alice\")\nelse:\n\tprint(\"Bob\")\n", "def gcd(a,b):\r\n a,b=min(a,b),max(a,b)\r\n while a>0:\r\n a,b=b%a,a\r\n return b\r\nn=int(input())\r\np=[int(x) for x in input().split()]\r\nc=gcd(p[0],p[1])\r\nif n>=3:\r\n for i in range (1,n-1):\r\n c=gcd(p[i+1],c)\r\nm=(max(p)/c)\r\nt=m-n\r\nif t%2==0:\r\n print('Bob')\r\nelse:\r\n print('Alice')\r\n\r\n\r\n\r\n", "import math\r\nimport itertools as it\r\n\r\n\r\nn, a = int(input()), list(map(int, input().split()))\r\ng = list(it.accumulate(a, math.gcd))[-1]\r\nprint(('Bob', 'Alice')[(max(a) // g - n) % 2])\r\n", "import math\r\n\r\ndef solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n d = math.gcd(a[0], a[1])\r\n for el in a[2:]:\r\n d = math.gcd(d, el)\r\n final_len = max(a)/d\r\n diff = final_len - n\r\n if diff % 2:\r\n print('Alice')\r\n else:\r\n print('Bob')\r\nsolve()", "from fractions import gcd\r\nfrom functools import reduce\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nk = reduce(gcd,a)\r\nm = max(a) / k\r\nif (m-n) % 2 == 0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")\r\n\r\n", "'''input\n3\n5 6 7\n'''\n# its dsu \nfrom sys import stdin, setrecursionlimit\nimport math\nfrom collections import defaultdict, deque\n\nsetrecursionlimit(15000)\n\n\ndef get_gcd(arr):\n\tg = arr[0]\n\tfor i in range(1, len(arr)):\n\t\tg = math.gcd(g, arr[i])\n\treturn g\n\n\n\n# main starts\nn = int(stdin.readline().strip())\narr = list(map(int, stdin.readline().split()))\ng = get_gcd(arr)\nmx = max(arr)\nif ((mx // g) - n) % 2:\n\tprint(\"Alice\")\nelse:\n\tprint(\"Bob\") ", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = max(a)\r\nd = m\r\n\r\ndef gcd(a,b):\r\n if a*b == 0:\r\n return(a+b)\r\n else:\r\n return(gcd(b,a % b))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n d = gcd(d,abs(a[i]-a[j]))\r\nif (m // d - n) % 2 == 0:\r\n print('Bob')\r\nelse:\r\n print('Alice')", "def NOD(a, b):\n if b > a :\n c = b\n b = a\n a = c\n while a > 0 :\n c = b % a\n b = a\n a = c\n return b\nn = int (input())\nx = list(map(int,input().split()))\nd = x[0]\nfor i in range(1,n):\n d = NOD(d,x[i])\nm = max(x)\nk = m // d - n\nif k % 2 == 0:\n print(\"Bob\")\nelse :\n print(\"Alice\")\n \n\n", "from fractions import gcd\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmel = max(a)\r\nfor i in range(1, len(a)):\r\n a[0] = gcd(a[0], a[i])\r\nprint(('Bob', 'Alice')[(mel // a[0] - n) % 2])", "import sys\nlines = sys.stdin.readlines()\nn = int(lines[0].strip())\nnums = list(map(int, lines[1].strip().split(\" \")))\n\ndef gcd(a,b):\n if a == 0: return b\n if a > b: return gcd(b,a)\n return gcd(b%a, a)\n\nG = nums[0]\nfor i in range(1, n):\n G = gcd(G, nums[i])\n\nturns = max(nums)//G - n\nif turns % 2 == 0: print(\"Bob\")\nelse: print(\"Alice\")\n", "def gcd (x,y):\r\n while(x):\r\n y = y % x\r\n x,y = y,x\r\n return y\r\n\r\ndef main():\r\n n = int(input())\r\n v = list(map(int,input().split()))\r\n a = max(v)\r\n g = v[0]\r\n for vk in v:\r\n g = gcd(g,vk)\r\n a = (a//g-n)\r\n if (a%2):\r\n print('Alice')\r\n else:\r\n print('Bob')\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "import random\r\nimport time\r\nimport math\r\nn = int(input())\r\nlist = sorted(list(map(int, input().split())))\r\nd=math.gcd(list[0],list[0])\r\nfor i in range(n):\r\n d = math.gcd(d, list[i])\r\nif (max(list)//d-n)%2==0:\r\n print(\"Bob\")\r\nelse:\r\n print(\"Alice\")\r\n", "import math\r\ntest = 1\r\n# cha = {}\r\n# pro = 0\r\n# temp = \"abcdefghijklmnopqrstuvwxyz\"\r\n# for v in temp:\r\n# cha.update({temp[pro]:pro})\r\n# pro+=1\r\n# #print(cha)\r\n# test = int(input())\r\nfor _ in range(test):\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n k = a[0]\r\n ma = 0\r\n for v in a:\r\n k = math.gcd(v,k)\r\n ma = max(ma,v)\r\n temp = ma//k\r\n temp-=n\r\n if temp%2 == 0:\r\n print(\"Bob\")\r\n else:\r\n print(\"Alice\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\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 = sys.stdin.readline\r\nfrom math import gcd\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nx = gcd(*w)\r\nq = max(w)//x\r\nprint(['Bob', 'Alice'][(q-n)%2])\r\n", "def gcd(a, b):\n while a > 0:\n a, b = b % a, a\n return b\n\nn = int(input())\na = [int(x) for x in input().split()]\n\ng = a[0]\nm = a[0]\nfor i in range(1, n):\n g = gcd(g, a[i])\n m = m if m >= a[i] else a[i]\n\nif (m // g - n) % 2:\n print(\"Alice\")\nelse:\n print(\"Bob\")\n", "import math\r\nn=int(input())\r\ndef hcf_list(list_of_numbers):\r\n if len(list_of_numbers) == 0:\r\n return None\r\n\r\n gcd = list_of_numbers[0]\r\n\r\n for i in range(1, len(list_of_numbers)):\r\n gcd = math.gcd(gcd, list_of_numbers[i])\r\n\r\n return gcd\r\ndef fun(l,n):\r\n if((max(l)-n) % 2 == 0):\r\n print(\"Bob\")\r\n else:\r\n print(\"Alice\")\r\nl=list(map(int,input().split()))\r\nif min(l)==1:\r\n fun(l,n)\r\nelse:\r\n hcf = hcf_list(l)\r\n for i in range(len(l)):\r\n l[i]//=hcf\r\n fun(l,n)", "import sys\r\nimport io, os\r\nimport math\r\ngcd=math.gcd\r\nceil=math.ceil\r\n#arr=list(map(int, input().split()))\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\ndef main():\r\n n=int(input())\r\n arr=list(map(int, input().split()))\r\n g=arr[0]\r\n for i in range(1,n):\r\n g=gcd(g,arr[i])\r\n for i in range(n):\r\n arr[i]=arr[i]//g\r\n moves=max(arr)-n\r\n if(moves%2==0):\r\n print(\"Bob\")\r\n else:\r\n print(\"Alice\")\r\nmain()" ]

[ "n=int(input(\"\"))\r\nwhile not(1<=n<=1000):\r\n n=int(input(\"\"))\r\nl=[4,7,47,74,477,447,444,44,77,777,774,744,474]\r\np=len(l)\r\ni=0\r\ntest=False\r\nwhile not test and i<p:\r\n if n%l[i]==0:\r\n test=True\r\n else:\r\n i+=1\r\nif test:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "s = int(input())\r\nfl = False\r\nl = [4, 7, 44, 47, 74, 77, 447, 474, 477, 744, 747, 774, 777]\r\nfor i in l:\r\n if s in l or s%i == 0:\r\n fl = True\r\n break\r\nif fl == False:\r\n print('NO')\r\nelse:\r\n print(\"YES\")", "a = int(input())\r\n\r\ndef lucky(no):\r\n while no!=0:\r\n x = no%10\r\n no //= 10\r\n if x!= 7 and x!=4:\r\n return 0\r\n else:\r\n return 1\r\n\r\n\r\nfor i in range(1,a//2+1):\r\n if lucky(i)==1:\r\n if a%i==0:\r\n print('YES')\r\n break\r\nelse:\r\n if lucky(a) == 1:\r\n print('YES')\r\n else:\r\n print('NO')", "n = (input())\r\nn_int = int(n)\r\n\r\nlisted_num = [int(i) for i in n]\r\n\r\nif n_int%7 == 0 or n_int%4 == 0 or n_int%47 == 0 or n_int%477 == 0:\r\n print(\"YES\")\r\n\r\nelse:\r\n listed_num = set(listed_num)\r\n if sum(listed_num) == 11:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\ndef isLucky(num):\r\n return bool(str(num).replace('4', '').replace('7', '') == '')\r\n\r\nyes = False\r\nfor i in range(n):\r\n if isLucky(n) or (isLucky(i) and n%i == 0):\r\n print(\"YES\")\r\n yes = True\r\n break\r\nif not yes: print(\"NO\")", "chast = [4, 7, 44, 47, 77, 444, 447, 477, 777, 774, 744]\r\nf1 = 0\r\nn = int(input())\r\nfor elem in chast:\r\n if n % elem == 0:\r\n print(\"YES\")\r\n f1 = 1\r\n break\r\nif f1 == 0:\r\n print(\"NO\")\n# Thu Jul 06 2023 13:17:21 GMT+0300 (Moscow Standard Time)\n", "number = input()\r\nif any(digit not in \"47\" for digit in number):\r\n if int(number) % 4 == 0 or int(number) % 7 == 0\\\r\n or int(number) % 47 == 0 or int(number) % 74 == 0\\\r\n or int(number) % 477 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "def check_lucky(val):\n check = False\n if len(str(val)) < 2:\n if val == 4 or val == 7:\n check = True\n else:\n val = list(set(str(val)))\n if len(val) != 2:\n check = False\n else:\n if (val[0] == \"4\" or val[0] == \"7\") and (val[1] == \"4\" or val[1] == \"7\"):\n check = True\n else:\n check = False\n return check \n\nn = int(input())\nset_check = False\nfor i in range(1,n+1):\n check_num = check_lucky(i)\n if check_num:\n if n % i == 0:\n print(\"YES\")\n set_check = True\n break\nif not set_check:\n print(\"NO\")\n", "from itertools import product\r\n\r\nn = int(input())\r\nluck = []\r\n\r\ndef generate_lucky(l:int) -> list:\r\n ns = list(product(\"47\", repeat=l))\r\n return list(map(lambda x:int(\"\".join(x)),ns))\r\n\r\nfor i in range(1, 4):\r\n l = generate_lucky(i)\r\n for x in l:\r\n luck.append(x)\r\n\r\nfor x in luck:\r\n if n%x ==0:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\n\r\n", "l = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nx = int(input())\r\nanswer = 0\r\nfor i in l:\r\n if x%i==0:\r\n answer+=1\r\n else:\r\n pass\r\nif answer > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "n=int(input())\r\nn1=str(n)\r\ncount=0\r\nfor digit in n1:\r\n if digit=='4' or digit=='7':\r\n count+=1\r\n\r\nif count==len(n1) and count!=0:\r\n print(\"YES\")\r\nelif (n%4==0 or n%7==0 or n%47==0 or n%74==0 or n%447==0 or n%474==0 or n%477==0 or n%747==0 or n%774==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "k=int(input());print([\"YES\",\"NO\"][all(k%a for a in[4,7,47,744,477])])", "import sys\r\nn=int(input())\r\nb={4,7,44,77,47,74,444,777,744,474,447,477,747,774}\r\nfor i in b:\r\n if n%i==0:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")\r\n ", "lucky = [4, 7, 44, 47, 74, 77, 444, 447, 474, 744, 477, 747, 774, 777]\r\nn = int(input())\r\nfor luck in lucky:\r\n if n % luck == 0:\r\n print('YES')\r\n exit()\r\nprint('NO')", "def l(n):\n ln = [4,7,47,74,444,447,474,477,744,747,774,777]\n for i in ln:\n if n%i == 0:\n return True \n return False \nn = int(input())\nis_l = l(n)\nif is_l:\n print(\"YES\")\nelse:\n print(\"NO\")", "n=int(input())\r\nif n%4==0 or n%7==0 or n%47==0 or n%74==0:\r\n print(\"YES\")\r\nelse:\r\n string=str(n)\r\n check=True\r\n for s in string:\r\n if s=='4' or s=='7':\r\n check=True\r\n else:\r\n print(\"NO\")\r\n check=False\r\n break\r\n if check==True:\r\n print(\"YES\")", "l=[4,7,44,47,74,77,444,447,474,477,747,774,777]\r\na=int(input())\r\nc=1\r\nfor i in l:\r\n if a % i ==0:\r\n print(\"YES\")\r\n c=0\r\n break\r\nif c==1:\r\n print(\"NO\")", "n=int(input())\nlucky_num=[4,7,44,47,74,77,444,447,474,477,744,747,777,774]\nt=False\nfor i in range(len(lucky_num)):\n if n%lucky_num[i]==0:\n t=True\n\nif t:\n print('YES')\nelse:\n print('NO')\n\n\n\n\n", "a = [4, 7]\r\nfor i in ('47'):\r\n for j in ('47'):\r\n a.append(int(i + j))\r\nfor t in ('47'):\r\n for i in ('47'):\r\n for j in ('47'):\r\n a.append(int(i + j + t))\r\nn = int(input())\r\nflag = False\r\nfor i in a:\r\n if n % i == 0:\r\n print('YES')\r\n flag = True\r\n break\r\nif flag == False:\r\n print('NO')\r\n", "n = int(input())\r\n\r\ndef is_happy(a: int) -> bool:\r\n r = a % 10\r\n happy = True\r\n while a != 0:\r\n if r != 4 and r != 7:\r\n happy = False\r\n a = a // 10\r\n r = a % 10\r\n return happy\r\n\r\nsemi_happy = False\r\nfor num in range(1, n + 1):\r\n if is_happy(num) and n % num == 0:\r\n semi_happy = True\r\n break\r\nif semi_happy:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nc = 4\r\nb = False\r\nwhile c <= n:\r\n v = set(list(str(c)))\r\n if len(v) == 2 and '7' in v and '4' in v or len(v) == 1 and '7' in v or len(v) == 1 and '4' in v:\r\n if n % c == 0:\r\n b = True\r\n break\r\n c += 1\r\nif b:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nlst = [4,7,47,74,44,77,444,447,474,744,777,774,747,477]\r\nout = [0 if n%i==0 else 1 for i in lst]\r\nif 0 in out:\r\n print('YES')\r\nelse:\r\n print('NO')", "#23.9.21 9:50-10:04-10:12-10:18\r\n#我打算暴力求解:4 7 44 47 74 77 444 447 474 477 744 747 777\r\n#错因1：少447,774\r\n#错因2：没考虑输入值为1的情况\r\n#死因：读错题；题目只要数字整除于lucky num就行不用分解质因数成lucky num\r\nx = int(input())\r\nstandard =[4, 7, 44, 47, 74, 77, 447, 474, 477, 744, 747, 774]\r\nfor i in standard:\r\n if x % i == 0:\r\n print('YES')\r\n break\r\nelse:print('NO')", "x = int(input())\r\na=0\r\nn=0\r\ns=0\r\nv=0\r\nz=0\r\nm=0\r\ny=0\r\nw=0\r\np=[47,74,447,474,477,744,747,774]\r\nf=[954,894,222,370,814,962,94,141,235,282,423,470,517,611,705,799,846,893]\r\nfor i in range(250):\r\n a = a++4\r\n if a == x :\r\n s=1\r\n break\r\n else:\r\n s=0\r\nfor i in range(142):\r\n n = n++7\r\n if n == x :\r\n v=1\r\n break\r\n else:\r\n v=0\r\nfor i in range(len(p)):\r\n if x == p[i]:\r\n z=1\r\n else:\r\n m=0\r\nfor i in range(len(f)):\r\n if x == f[i]:\r\n w=1\r\n else:\r\n m=0\r\nif s == 1 or v==1 or z==1 or w==1 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nc=0\r\nfor i in range (1000):\r\n if str(i).count(\"4\")+str(i).count(\"7\")==len(str(i)):\r\n if(n%i==0):\r\n c+=1\r\n \r\nif n%4==0 or n%7==0:\r\n c+=1\r\nif c>0:print(\"YES\")\r\nelse:print(\"NO\")\r\n", "n=int(input())\r\ns=str(n)\r\nl=['4','7']\r\nk=[4,7,47,74,444,777,447,744,474,747,774,477]\r\nc=0\r\no=0\r\nfor i in s:\r\n if i in l:\r\n c+=1\r\nfor i in k:\r\n if n%int(i)==0:\r\n o=1\r\n break\r\nif c==len(s) or (n%4==0) or n%7==0 or o==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nl = [7,4,47,74,444,777,447,474,744,774,747,477]\r\ncount =0\r\nfor i in l :\r\n if (n % i == 0):\r\n count += 1\r\nif (count > 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_lucky(number):\r\n for i in range(1, number + 1):\r\n if number % i == 0 and all(digit in '47' for digit in str(i)):\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nif is_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nlucky_nrs=[4 , 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nalmost_lucky=False\r\naantal_lucky_nrs=len(lucky_nrs)\r\nfor i in range(aantal_lucky_nrs):\r\n div=int(lucky_nrs[i])\r\n if n%div ==0:\r\n almost_lucky= True\r\n break\r\nif almost_lucky==False:\r\n print('NO')\r\nelse:\r\n print('YES')", "lst = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\na = int(input())\ny = 'NO'\nfor i in range(14):\n if a%lst[i] == 0:\n y = 'YES'\nprint(y)\n# Thu Jul 06 2023 23:34:48 GMT+0300 (Moscow Standard Time)\n", "def er(a,k):\r\n for i in range(len(a)):\r\n if k%a[i]==0:\r\n return\"YES\"\r\n return\"NO\"\r\ndef re(a,n):\r\n global l\r\n global t\r\n if a>n:\r\n return \r\n if str(a).count(\"4\")+str(a).count(\"7\")==len(str(a)) and a not in l and a<=n:\r\n l.append(a)\r\n t+=1\r\n re(a*10+4,n)\r\n re(a*10+7,n)\r\nl=[]\r\nt=0\r\nn=int(input())\r\nre(0,n)\r\nprint(er(l,n))", "ki = int(input())\r\nprint(['YES', 'NO'][all(ki%i for i in[4, 7, 47, 477])])", "def main():\r\n number=eval(input())\r\n lucky_numbers={4,7,44,47,74,77,444,447,474,477,744,747,774,777}\r\n for x in lucky_numbers:\r\n if number%x==0 :\r\n print(\"YES\")\r\n return\r\n print('NO') \r\nmain()", "n = int(input())\r\n \r\nfor x in range(1, n+1):\r\n if n % x == 0:\r\n if str(x).count('4') + str(x).count('7') == len(str(x)):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\n# Thu Jul 06 2023 11:28:11 GMT+0300 (Moscow Standard Time)\n", "a = int(input())\r\n\r\nflag = False\r\n\r\nfor i in range(1, a):\r\n if a % i == 0 and str(i).count('4') + str(i).count('7') == len(str(i)):\r\n flag = True\r\n \r\nif flag or str(a).count('4') + str(a).count('7') == len(str(a)):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\n\r\nlucky_numbers = [4, 7, 47, 74, 447, 474, 744, 774, 747, 477]\r\n\r\nif any(n % num == 0 for num in lucky_numbers):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "ln=[4,7,47,74,44,444,447,474,477,777,774,744]\r\nc=0\r\nn=int(input())\r\nfor i in range(12):\r\n if n%ln[i]==0: c=c+1\r\nif c>0: print(\"YES\")\r\nelse: print(\"NO\")", "def check(n):\r\n l = [4,7,44,77,47,74,444,777,447,474,744,774,747,477]\r\n for i in l:\r\n if n % i == 0:\r\n return True\r\n return False\r\nn = int(input())\r\nprint(\"YES\" if check(n) else \"NO\")", "n=int(input())\r\nl=[4,7,47,74,777,774,747,744,444,477,474,477]\r\nflag=0\r\nfor i in l:\r\n if n%i==0:\r\n flag=1\r\n print(\"YES\")\r\n break\r\n else:\r\n continue\r\nif flag==0:\r\n print(\"NO\")", "def judge(n):\r\n s = str(n)\r\n for a in s:\r\n if a != '4' and a != '7':\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\nans = False\r\nfor i in range(1, int(n/2)+1):\r\n if n % i == 0 and judge(int(n/i)) == True:\r\n ans = True\r\n break\r\nif ans:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "lucky_numbers = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nn = int(input())\r\n\r\nif n in lucky_numbers:\r\n print(\"YES\")\r\nelse:\r\n for num in lucky_numbers:\r\n if n%num == 0:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")\r\n", "# Read the input number\r\nn = int(input())\r\n\r\n# Define a function to check if a number is lucky\r\ndef is_lucky(x):\r\n lucky_digits = {4, 7}\r\n while x > 0:\r\n digit = x % 10\r\n if digit not in lucky_digits:\r\n return False\r\n x //= 10\r\n return True\r\n\r\n# Check if n is almost lucky\r\nfor i in range(1, n + 1):\r\n if n % i == 0 and is_lucky(i):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ns = '47'\r\nans = 'NO'\r\nfor i in range(1, n + 1):\r\n flag = True\r\n for j in str(i):\r\n if j not in s:\r\n flag = False\r\n if flag:\r\n if n % i == 0:\r\n ans = 'YES'\r\n break\r\nprint(ans)", "n=int(input())\r\nflag=0\r\nl=[4,7,47,74,444,447,474,477,744,747,774,777]\r\nfor i in l:\r\n if n%i==0:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s=[4,7,47,74,447,474,744,477,747,774]\r\na=int(input())\r\nb=False\r\nfor i in s:\r\n if a%i==0:\r\n print('YES')\r\n b=True\r\n break\r\nif not(b):\r\n print('NO')\r\n", "N=int(input())\r\na=[4,7,47,74,447,474,477,747,774]\r\nt=False\r\nfor i in a:\r\n if N%i==0:\r\n t=True\r\n break\r\nprint(\"YES\" if t else \"NO\")", "# 4,7,44,47,77,444,447,474,477,\r\nlucky = [\r\n 4,7,\r\n 44,47,74,77, \r\n 444,447,474,477,\r\n 777,774,747,744,\r\n ]\r\nn = int(input())\r\nfor i in lucky:\r\n if n % i == 0:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "n = int(input())\r\n\r\nis_almost_lucky = False\r\n\r\nfor i in range(1, n + 1):\r\n if n % i == 0:\r\n digits = set(str(i))\r\n if digits.issubset({'4', '7'}):\r\n is_almost_lucky = True\r\n break\r\n\r\nif is_almost_lucky:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nln=[4,7,47,74,447,474,477,747]\r\nres=False\r\nfor i in range(len(ln)):\r\n if n%ln[i] == 0:\r\n res=True\r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\n\nlucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\n\nlucky = False\n\nfor i in lucky_numbers:\n if n % i == 0:\n lucky = True\n break\n\nif lucky:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def lucky(n ,numbers):\r\n for i in range(len(numbers)):\r\n if n%numbers[i] == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n \r\nn = int(input())\r\nnumbers = [4,7,47,74,44,444,447,474,477,777,774,744]\r\n\r\n\r\nprint(lucky(n, numbers))", "n = int(input())\r\nlucky_numbers = (4,7,44,47,77,74,444,447,474,477,777,774,747,744)\r\nalmost_lucky = False\r\nfor i in lucky_numbers : \r\n if n%i == 0 : almost_lucky = True\r\nprint('YES' if almost_lucky else 'NO')", "l = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744,747,774, 777]\r\nn = int(input())\r\nif(n in l):\r\n print(\"YES\")\r\nelse:\r\n for i in l:\r\n if(n % i == 0):\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nf = 0\r\nfor i in range(4,778):\r\n l = [i for i in str(i) if i!='4' and i!='7']\r\n if len(l)==0 and n%i==0:\r\n f=1\r\n break\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nif (n%4 == 0 or n%7 == 0 or n%44 == 0 or n%47 == 0 or n%74 == 0 or n%77 == 0 or n%444 == 0 or n%447 == 0 or n%474 == 0 or n%477 == 0 or n%744 == 0 or n%747 == 0 or n%777 == 0 or n%774 == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter\r\ndef isLucky(i):\r\n while i > 0:\r\n if i % 10 == 4 or i % 10 == 7:\r\n i //= 10\r\n continue\r\n return False\r\n return True\r\ndef solve(N):\r\n for i in range(4, N + 1):\r\n if isLucky(i) and N % i == 0: return \"YES\"\r\n return \"NO\"\r\n \r\n\r\n#T = int(input().split()[1])\r\n#s = input()\r\nprint(solve(int(input())))", "n = int(input())\r\nlst = [4,7,47,74,444,447,474,477,744,747,774,777]\r\nf=0\r\nnewl = []\r\nfor k in lst:\r\n if k<=n:\r\n newl.append(k)\r\n\r\nfor i in newl:\r\n if n%i==0:\r\n f=1\r\n break\r\nif f==0:\r\n print(\"NO\")\r\nelif f==1:\r\n print(\"YES\")\r\n ", "lst = []\r\n\r\nfor i in range(1, 1001):\r\n if str(i).count('4') + str(i).count('7') == len(str(i)):\r\n lst.append(i)\r\n\r\nn = int(input())\r\ncounter = 0\r\n\r\nfor i in range(1, n+1):\r\n if i in lst and n % i == 0:\r\n counter += 1\r\n \r\nprint(\"YES\" if counter > 0 else \"NO\")\r\n", "import sys\r\nimport bisect\r\nfrom math import *\r\n# Fast input reading\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n# Constants\r\nMOD = 10**9 + 7\r\nINF = float('inf')\r\n\r\n# Utility functions\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n# Main function\r\ndef main():\r\n n=int(input())\r\n a={'4','7'}\r\n L=[]\r\n for i in range(1,n+1):\r\n if(set(str(i)).issubset(a)):\r\n L.append(i)\r\n x=0\r\n for i in L:\r\n if(n%i==0):\r\n x=1\r\n print(\"YES\")\r\n break\r\n if(x==0):\r\n print(\"NO\")\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nok = 1\r\nar = [4, 7, 47, 477]\r\nfor i in ar:\r\n if n % i == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "def f():\r\n a = int(input())\r\n n = (4,7,47,744,477)\r\n for i in n:\r\n if a%i == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nwhile True:\r\n print(f())\r\n break", "n = int(input())\r\nlucky_numbers = [4, 7]\r\nfor i in range(1, n + 1):\r\n is_lucky = True\r\n for digit in str(i):\r\n if digit != '4' and digit !='7':\r\n is_lucky = False\r\n break\r\n if n % i == 0 and is_lucky:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "lucky_numbers = []\r\nfor number in range(1,1001):\r\n if set(list(str(number))) == {\"4\",\"7\"} or set(list(str(number))) == {\"4\"} or set(list(str(number))) == {\"7\"}:\r\n lucky_numbers.append(number)\r\n\r\ndef almost(num):\r\n for lucky_number in lucky_numbers:\r\n if num / lucky_number == num // lucky_number:\r\n return True\r\n\r\norg = int(input())\r\nif org in lucky_numbers or almost(org):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = input()\r\ny = True\r\nfor x in n:\r\n if x != '4' and x != '7':\r\n y = False\r\n break\r\n\r\nif y:\r\n print(\"YES\")\r\n\r\n\r\nelse:\r\n n = int(n)\r\n if n % 4 ==0 or n % 7 == 0 or n % 47 == 0 or n % 74 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\r\nfor i in (4, 7, 47, 74, 447, 477, 774):\r\n if n%i == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "n=int(input())\r\nfor i in range(1, 1001):\r\n if (len(str(i))==str(i).count('4')+str(i).count('7') and n%i==0 and n>0):\r\n print('YES')\r\n break\r\n\r\nelse:\r\n print('NO')", "n=int(input())\r\nnum=['4','7','44','47','74','77','444','447','474','477','744','747','774','777']\r\ncount=0\r\nfor i in num:\r\n if n%int(i)==0:\r\n count+=1\r\nif count>=1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ndef lucky(num):\r\n for _ in str(num):\r\n if _ not in ['4', '7']:\r\n return False\r\n return True\r\nfor i in range(n+1):\r\n if lucky(i) and not n%i:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "n = int(input())\r\nm = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\ncount = 0\r\nfor i in range(len(m)):\r\n if int(n)%m[i] == 0:\r\n count = 1\r\n break\r\nif count == 0:\r\n print(\"NO\")\r\nelse:\r\n print('YES')\r\n ", "num = int(input())\r\nif (num% 4 == 0 or num % 7 == 0 or num % 44 == 0 or num % 47 == 0 or num % 74 == 0 or num % 77 == 0 or num % 444 == 0 or num % 447 == 0 or num % 474 == 0 or num % 477 == 0 or num % 744 == 0 or num % 747 == 0 or num % 774 == 0 or num % 777 == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "lucky = [4, 7, 44, 77, 47, 74, 444, 447, 474, 744, 477, 747, 774, 777]\r\nn = int(input())\r\nfor i in lucky:\r\n break\r\nf = 0\r\nfor i in lucky:\r\n if n % i == 0:\r\n f = 1\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ncheck = True\r\n\r\nif n % 4 == 0 or n % 7 == 0 or n % 47 == 0 or n % 744 == 0:\r\n print(\"YES\")\r\nelse:\r\n for val in str(n):\r\n if val != \"4\" and val != \"7\":\r\n check = False\r\n \r\n if check:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a=int(input())\r\nn=0\r\narr=[4,7,44,47,74,77,444,447,474,477,744,747,777]\r\ni=0\r\nwhile(i<len(arr)):\r\n if(a==arr[i] or a%arr[i]==0):\r\n n=a\r\n i=i+1\r\nif(n==a):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\r\nlucky = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nans = ''\r\nfor x in lucky:\r\n if ans == '':\r\n if a % x == 0:\r\n ans = 'YES'\r\n\r\nif ans == '':\r\n ans = 'NO'\r\n\r\nprint(ans)", "# your code goes here\r\nn=int(input())\r\nis_lucky=False\r\nlucky_numbers=[4,7,44,47,74,77,444,447,474,477,744,777,747,774]\r\n\r\nfor number in lucky_numbers:\r\n\tif n%number==0:\r\n\t\tis_lucky=True\r\n\t\tbreak\r\nif is_lucky:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "l=input()\r\na=0\r\nb=0\r\nc=0\r\nk=int(l)\r\nif(k%4==0 or k%7==0 or k%44==0 or k%47==0 or k%74==0 or k%77==0 or k%444==0 or k%447==0 or k%474==0 or k%744==0 or k%477==0 or k%747==0 or k%774==0 or k%777==0):\r\n print(\"YES\")\r\nelse:\r\n for i in range(0,len(l),1):\r\n if(l[i]=='4'):\r\n a=a+1\r\n elif(l[i]=='7'):\r\n b=b+1\r\n else:\r\n c=c+1\r\n if(a+b==len(l)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n", "def is_lucky(number):\r\n return all(digit == '4' or digit == '7' for digit in str(number))\r\n\r\ndef is_almost_lucky(number):\r\n for i in range(1, number + 1):\r\n if number % i == 0 and is_lucky(i):\r\n return True\r\n return False\r\n\r\nn = int(input())\r\n\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\r\nimport math\r\n\r\nt = 1#int(input())\r\nfor q in range(0, t):\r\n #l = int(input())\r\n #n, num = map(int, input().split(' '))\r\n n = int(input())\r\n\r\n # for i in range(0, l):\r\n # s1[i] = int(s1[i])\r\n\r\n mas = [4, 7, 47, 74, 447, 477, 444, 744, 747, 774, 474, 777]\r\n l = len(mas)\r\n tr = 0\r\n for i in range(0, l):\r\n if n % mas[i] == 0:\r\n tr = 1\r\n\r\n\r\n if tr == 1:\r\n print('YES')\r\n else:\r\n\r\n print('NO')\r\n\r\n\r\n\r\n", "def is_lucky(n):\r\n while n>0:\r\n digit=n%10\r\n if digit!=4 and digit!=7:\r\n return False\r\n n//=10\r\n return True\r\nt=int(input())\r\nfor i in range(1,t+1):\r\n if t%i==0 and is_lucky(i):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nif 1000 >= n >= 1:\r\n l = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\n flag = False\r\n for i in l:\r\n if n % i == 0:\r\n flag = True\r\n break\r\n else:\r\n continue\r\n if flag:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def is_almost_lucky(n):\r\n # Lucky numbers\r\n lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n \r\n def dfs(index, current):\r\n if index == len(lucky_numbers):\r\n return False\r\n if current % lucky_numbers[index] == 0:\r\n return True\r\n if lucky_numbers[index] > current:\r\n return False\r\n return dfs(index + 1, current)\r\n \r\n if dfs(0, n):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nn = int(input())\r\nresult = is_almost_lucky(n)\r\nprint(result)\r\n", "t=input()\r\nn=int(t)\r\nif n%4==0 or n%7==0 or n%47==0:\r\n print('YES')\r\nelse:\r\n t=t.replace('4','')\r\n t=t.replace('7','')\r\n if t=='':\r\n print('YES')\r\n else:\r\n print('NO')", "n = int(input())\r\nif n % 4 == 0 : \r\n print(\"YES\")\r\nelif n % 7 == 0: \r\n print(\"YES\")\r\nelif n % 47 == 0 : \r\n print(\"YES\")\r\nelif n % 44 == 0 : \r\n print(\"YES\")\r\nelif n % 74 == 0 :\r\n print(\"YES\")\r\nelif n % 77 == 0 :\r\n print(\"YES\")\r\nelif n % 444 == 0 :\r\n print(\"YES\")\r\nelif n % 477 == 0 :\r\n print(\"YES\")\r\nelif n % 474 == 0 :\r\n print(\"YES\") \r\nelif n%774 == 0 :\r\n print(\"YES\")\r\nelif n%744 == 0 :\r\n print(\"YES\")\r\nelif n%777 == 0:\r\n print(\"YES\") \r\nelif n%747 == 0:\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "li=[4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\na=int(input())\r\nclk=1\r\nfor i in li:\r\n if a % i == 0:\r\n print(\"YES\")\r\n clk=0\r\n break\r\nif clk==1:\r\n print(\"NO\")", "n = int(input())\r\nlucky = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nfor i in lucky:\r\n if n%i == 0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "num=int(input())\r\nif all(digit in ['4', '7'] for digit in str(num)):\r\n print(\"YES\")\r\nelif num%4==0 or num%7==0 or num%47==0 or num%74==0 or num%444==0 or num%474==0 or num%744==0 or num%747==0 or num%777==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nl=[4,7,44,77,74,47,444,777,447,474,477,774,744,747]\r\nc=0\r\nfor i in l:\r\n if n%i==0:\r\n c=1\r\n break \r\nif c==0:\r\n print('NO')\r\nelse:\r\n print('YES')", "# CF_Problem: 122A_Lucky_Division\r\n\r\n\r\ndef isAlmostLucky(n):\r\n luckyNumbers = [4, 7, 47, 74, 444, 447, 474, 477, 744, 747, 774, 777]\r\n\r\n for x in luckyNumbers:\r\n if n % x == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(isAlmostLucky(int(input())))\r\n", "n = int(input())\nld = False\nnu = []\nfor i in range(1, n + 1):\n lu = True\n for j in range(len(str(i))):\n if str(i)[j] != '4' and str(i)[j] != '7':\n lu = False\n if lu:\n nu.append(i)\nfor i in range(len(nu)):\n if n % nu[i] == 0:\n ld = True\nif ld:\n print('YES')\nelse:\n print('NO')", "x = int(input())\r\ny = [4, 7]\r\nq = [4, 7]\r\nz = 0\r\n'''\r\nfor j in y:\r\n for i in y:\r\n z = i * 10 + j\r\n'''\r\n\r\nfor e in y:\r\n for f in y:\r\n for g in y:\r\n z = g * 100 + f * 10 + e\r\n q.append(z)\r\n\r\n\r\nfor j in y:\r\n for i in y:\r\n p = i * 10 + j\r\n q.append(p)\r\n\r\nfor summ in q:\r\n if (x % summ == 0):\r\n eyad = 1\r\n break\r\n else:\r\n eyad =0\r\n\r\nif eyad == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input());print([\"YES\",\"NO\"][all(x%j for j in[4,7,47,744,477])])", "n = input()\r\n\r\n# Проверяем, состоит ли число n только из цифр 4 и 7\r\nif all(digit == '4' or digit == '7' for digit in n):\r\n print(\"YES\")\r\nelse:\r\n # Проверяем, делится ли число n без остатка на число, состоящее только из цифр 4 и 7\r\n for i in range(1, int(n) + 1):\r\n if int(n) % i == 0 and all(digit == '4' or digit == '7' for digit in str(i)):\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 29 21:51:32 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\ndef j(n):\r\n l_n=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\n for i in range(len(l_n)):\r\n if n%(l_n[i])==0:\r\n return(\"YES\")\r\n return(\"NO\")\r\nprint(j(n))", "n=int(input())\r\ndef isLucky(m):#判断是否为Lucky Number\r\n m=str(m)\r\n for i in range(len(m)):\r\n if m[i]==\"4\" or m[i]==\"7\":\r\n continue\r\n else:\r\n return False\r\n return True\r\n# print(isLucky(n))\r\n#存放因子\r\nfactorList=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n factorList.append(i)\r\nfound=False\r\nfor j in range(len(factorList)):\r\n if isLucky(factorList[j]):\r\n found=True\r\n break\r\n else:\r\n continue\r\nif found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "number = int(input())\r\n\r\ndef check_lucky(to_check):\r\n\r\n \"\"\"Checks if a number is lucky, returns \"True\" if it is, otherwise, returns \"False\".\"\"\"\r\n\r\n lucky_digit_counter = 0\r\n\r\n for digit in str(to_check):\r\n\r\n if digit == '4' or digit == '7':\r\n\r\n lucky_digit_counter += 1\r\n\r\n \r\n if lucky_digit_counter == len(str(to_check)):\r\n\r\n return True\r\n \r\n else: return False\r\n\r\n\r\nif check_lucky(number):\r\n\r\n print(\"YES\")\r\n\r\nelse:\r\n\r\n divisors = [i for i in range(1, number) if number % i == 0]\r\n flag = \"NO\"\r\n\r\n for divisor in divisors:\r\n\r\n if check_lucky(divisor):\r\n\r\n flag = \"YES\"\r\n break\r\n\r\n print(flag) ", "n=input()\r\ncount=0\r\ncount1=0\r\nfor i in n:\r\n if int(i)==7 or int(i)==4:\r\n count+=1\r\n else:\r\n break\r\nif int(n)%7==0 or int(n)%4==0 or int(n)%77==0 or int(n)%44==0 or int(n)%47==0 or int(n)%777==0 or int(n)%774==0 or int(n)%747==0 or int(n)%477==0 or int(n)%744==0 or int(n)%444==0 or int(n)%447==0 or int(n)%474==0:\r\n count1+=1\r\nif count==len(n):\r\n print(\"YES\")\r\nelif count1==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ncheck = [4, 7, 44, 47, 74, 77, 444, 447, 474, 744, 477, 747, 774, 777]\r\ndef abc(x):\r\n for i in check:\r\n if (n % i == 0):\r\n return \"YES\"\r\n return \"NO\"\r\nprint(abc(n))", "whole_stuff =int(input())\r\nlucky=0\r\n\r\nif whole_stuff %4==0 or whole_stuff %7==0:\r\n lucky= lucky +1\r\n\r\nif whole_stuff % 44 == 0 or whole_stuff % 77 == 0 or whole_stuff % 47 == 0 or whole_stuff % 74 == 0:\r\n lucky= lucky +1\r\n\r\nif whole_stuff % 444 == 0 or whole_stuff % 777 == 0 :\r\n lucky= lucky +1\r\n\r\nif whole_stuff % 447 == 0 or whole_stuff % 474 == 0 or whole_stuff % 744 == 0 :\r\n lucky= lucky +1\r\n\r\nif whole_stuff % 477 == 0 or whole_stuff % 774 == 0 or whole_stuff % 747 == 0:\r\n lucky= lucky +1\r\n\r\nif lucky==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "s =input()\nn = len(s)\nl = s.count('4')\nm = s.count('7')\n\n# hmm so there is a thing so it should like be divided by a some luck number not only 4 or 7.\n\n# so to draft a solution for this let's take\n# 799 as example it's not lucky that sure so we will look for his dividers id ther are lucky (%4,%7)\n\n\nif(l+m==n):\n print(\"YES\")\nelse:\n t = False\n for i in range(4,int(s),1):\n if int(s)%i==0:\n _l = str(i).count('4')\n _m = str(i).count('7')\n if (_l+_m)==len(str(i)):\n t = True\n break\n if t:\n print(\"YES\")\n else:\n print(\"NO\")\n", "l1=[4,7,44,77,47,74,444,447,474,477,744,747,774,777]\r\nn=int(input())\r\nif n in l1:\r\n print(\"YES\")\r\nelse:\r\n for num in l1:\r\n if n%num==0:\r\n print(\"YES\")\r\n break\r\n if num==777:\r\n print(\"NO\")", "arr = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nnum = int(input())\r\nvrdct = False\r\nfor i in arr:\r\n if num%i==0:\r\n vrdct = True\r\n break\r\n\r\nprint(\"YES\") if vrdct else print(\"NO\")", "n = int(input())\r\nlucky_number = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nx = 0\r\nfor num in lucky_number:\r\n if n%num == 0:\r\n x = 1\r\n else:\r\n pass\r\n\r\nif x == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\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\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\ndef insr():\r\n s = input()\r\n return list(s[:len(s) - 1])\r\n\r\ndef invr():\r\n return map(int, input().split())\r\n\r\n\r\nn =inp()\r\nl=[4,7,47,74,444,777,447,474,477,774,777,744]\r\ni=0\r\nfor i in range(len(l)):\r\n flag=0\r\n if(n%l[i]==0):\r\n flag=1\r\n break\r\n \r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_lucky(number):\r\n while number != 0:\r\n if number % 10 != 4 and number % 10 != 7:\r\n return False\r\n number //= 10\r\n return True\r\n\r\ndef is_almost_lucky(number):\r\n if is_lucky(number):\r\n return True\r\n\r\n for i in range(2, int(number**0.5) + 1):\r\n if number % i == 0 and (is_lucky(i) or is_lucky(number // i)):\r\n return True\r\n\r\n return False\r\n\r\nn = int(input())\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x=int(input())\r\nif x%4==0 or x%7==0 or x% 47 == 0 or x % 477 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nif n%4==0 or n%7==0:\r\n\tprint(\"YES\")\r\nelif n%47==0 or n%477==0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a = [4,7,44,47,74,444,447,474,477,744,747,777]\r\nb = False\r\nx = int(input())\r\nfor i in a:\r\n if x % i == 0:\r\n b = True\r\nif b == True:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n = int(input())\r\nl = [4, 7, 47, 74, 777, 774, 747, 744, 444, 477, 474, 477]\r\nflag = True\r\nfor i in l:\r\n if n % i == 0:\r\n flag = False\r\n print('YES')\r\n break\r\n else:\r\n continue\r\nif flag:\r\n print('NO')\r\n", "isLucky = lambda s: s == (''.join([c for c in s if c == '4' or c == '7']))\n\nn = int(input())\n\nfor i in range(2, n+1):\n if (not(n % i) and isLucky(str(i))):\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n\n", "N=['4','44','444','7','77','777','47','74','447','474','477','744','747','774',]\r\ns=input()\r\na=2\r\nfor n in N:\r\n if int(s)%int(n)==0:\r\n a=1\r\nif a==1:\r\n print(\"YES\")\r\nelif a==2:\r\n print(\"NO\")", "def almost_lucky(n: int) -> bool:\r\n for i in range(4, n+1):\r\n s = set(str(i))\r\n if len(s) == 2:\r\n if n % i == 0 and '4' in s and '7' in s:\r\n return True\r\n\r\n elif len(s) == 1:\r\n if n % i == 0 and ('4' in s or '7' in s):\r\n return True\r\n\r\n return False\r\n\r\nn = int(input())\r\nresult = 'YES' if almost_lucky(n) else 'NO'\r\nprint(result)", "def solve():\r\n check = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n x = int(input())\r\n for i in check:\r\n if x % i == 0:\r\n print('YES')\r\n return\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", "a=input()\r\nc=0\r\nfor i in range(0,len(a)):\r\n if a[i]=='4' or a[i]=='7':\r\n c=c+1 \r\nif c==len(a):\r\n print(\"YES\")\r\nelif int(a)%4==0 or int(a)%7==0:\r\n print(\"YES\")\r\nelif int(a)%47==0 or int(a)%74==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "luc=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nans=\"NO\"\r\nori=int(input())\r\nfor i in range(len(luc)):\r\n if ori%luc[i]==0:\r\n ans=\"YES\"\r\nprint(ans)", "a=int(input())\r\nb=[]\r\nfor i in range(a+1):\r\n lucky=True\r\n for j in list(str(i)):\r\n if j!='4' and j!='7':\r\n lucky= False\r\n if lucky:\r\n b.append(i)\r\nalk=False\r\nfor i in b:\r\n if a%i==0:\r\n alk=True\r\nif alk:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ndivisors = [4, 7, 44, 47, 77, 444, 447, 474, 477, 744, 774, 777]\r\n \r\nflag = 0\r\nfor divisor in divisors:\r\n if n % divisor == 0:\r\n flag = 1\r\n break\r\n \r\nif flag == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = int(input())\r\nlist_1 = []\r\n\r\ndef check_lucky(x):\r\n if x == \"\":\r\n return True\r\n if x[0] == \"4\" or x[0] == \"7\":\r\n return check_lucky(x[1:])\r\n return False\r\n\r\nfor i in range(1, x+1):\r\n if x%i == 0:\r\n if check_lucky(str(i)):\r\n print(\"YES\")\r\n break\r\n else:\r\n continue\r\nelse:\r\n print(\"NO\")", "def is_lucky(number):\r\n\r\n while number > 0:\r\n digit = number % 10\r\n if digit != 4 and digit != 7:\r\n return False\r\n number //= 10\r\n return True\r\n\r\ndef is_almost_lucky(n):\r\n for i in range(1, n + 1):\r\n if is_lucky(i) and n % i == 0:\r\n return True\r\n return False\r\nn = int(input())\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = str(input())\r\nx = len(s)\r\nluckydigits = 0\r\nfor i in range(x):\r\n if s[i] == \"4\" or s[i] == \"7\":\r\n luckydigits += 1\r\nif luckydigits == x:\r\n print(\"YES\")\r\nelse:\r\n if int(s)%4 == 0:\r\n print(\"YES\")\r\n elif int(s)%7 == 0:\r\n print(\"YES\")\r\n elif int(s)%47 == 0:\r\n print(\"YES\")\r\n elif int(s)%74 == 0:\r\n print(\"YES\")\r\n elif int(s)%447 == 0:\r\n print(\"YES\")\r\n elif int(s)%474 == 0:\r\n print(\"YES\")\r\n elif int(s)%477 == 0:\r\n print(\"YES\")\r\n elif int(s)%744 == 0:\r\n print(\"YES\")\r\n elif int(s)%747 == 0:\r\n print(\"YES\")\r\n elif int(s)%777 == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nz=[\"4\",\"7\"]\r\na=0\r\nif n%int(z[0])==0 or n%int(z[1])==0 or n%47==0:\r\n print(\"YES\")\r\nelse:\r\n for i in str(n):\r\n if i not in z:\r\n \r\n print(\"NO\")\r\n a=0\r\n break\r\n else:\r\n a+=1\r\nif a>0:\r\n print(\"YES\")", "a=input()\r\nj=0\r\nif (int(a)%4)==0 or (int(a)%7)==0 or (int(a)%47)==0 or (int(a)%74)==0 or (int(a)%447)==0 or (int(a)%477)==0 or (int(a)%774)==0:\r\n print (\"YES\")\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]=='4' or a[i]=='7':\r\n j+=1\r\n if j==len(a):\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")", "def isLucky(n):\r\n if(n==4 or n==7):return True\r\n s=set(str(n))\r\n if(len(s)==2 and '4' in s and '7' in s):return True\r\n return False\r\n \r\ndef check(n):\r\n length=len(str(n))\r\n if(isLucky(n)):\r\n return True\r\n else:\r\n for i in range(1,n):\r\n if(isLucky(i) and n%i==0):return True\r\n return False\r\n \r\nn=int(input())\r\nif(check(n)):print('YES')\r\nelse:print('NO')\r\n", "number = int(input())\r\n\r\nlucky_numbers = [4, 7, 47, 74, 44, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n\r\ndivisivel = False\r\n\r\nfor i in lucky_numbers:\r\n if number % i == 0:\r\n divisivel = True\r\n break\r\n\r\nif divisivel:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nlength = len(str(n))\r\ns=[4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nboolie = False\r\npp = 0\r\nfor l in range(len(s)):\r\n if n%s[l]==0:\r\n boolie=True\r\nif boolie==False:\r\n for i in str(n):\r\n if int(i)==4 or int(i)==7:\r\n pp+=1\r\n \r\nif pp==length or boolie==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "lky= [4,7,47,74,44,444,447,474,477,777,774,744]\r\nnum=int(input())\r\ncount=0\r\nfor i in range(len(lky)):\r\n if num%lky[i]==0:\r\n count+=1\r\nif count>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ndivisors = []\r\nfor i in range(1, n + 1):\r\n if n % i == 0:\r\n divisors.append(i)\r\nfor i in divisors:\r\n ris = 'YES'\r\n for c in str(i):\r\n if c != '4' and c != '7':\r\n ris = 'NO'\r\n if ris == 'YES':\r\n print(ris)\r\n break\r\nif ris == 'NO':\r\n print(ris)", "n = int(input())\r\n\r\ndef lucky_num(num):\r\n if list(str(num)).count(\"4\") + list(str(num)).count(\"7\") == len(list(str(num))):\r\n return True\r\n return False\r\n\r\ncheck = False\r\nfor i in range(n + 1):\r\n if lucky_num(i) and (n%i == 0):\r\n check = True\r\n\r\nif check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_lucky_number(x):\r\n lucky_digits = (['4', '7'])\r\n return all(digit in lucky_digits for digit in str(x))\r\n\r\ndef solve(n):\r\n for i in range(1, n+1):\r\n if n % i == 0 and is_lucky_number(i):\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n# Input\r\nn = int(input())\r\n\r\n# Output\r\nsolve(n)\r\n", "a = int(input())\r\nans = \"NO\"\r\nk = [4, 7, 47, 74, 444, 447, 477, 744, 774, 777]\r\nfor i in k:\r\n if a % i == 0:\r\n ans = \"YES\"\r\n \r\nprint(ans)", "n = int(input())\r\nfor i in (4, 7, 47, 447, 477):\r\n if n%i == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "l=[4,7,44,47,74,77,444,447,474,744,477,747,774,777]\r\nn = int(input())\r\nfor i in l:\r\n if n%i == 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print('NO')", "n = int(input())\r\n\r\ndivisors = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n\r\ndid_divisor_found = 0\r\nfor divisor in divisors:\r\n if n % divisor == 0:\r\n print(\"YES\")\r\n did_divisor_found = 1\r\n break\r\n\r\nif did_divisor_found == 0:\r\n print(\"NO\")", "num = int(input())\nprint('NO' if all(num%i for i in [4,7,47,477]) else 'YES')\n", "numbers = input()\r\nintNumbers = int(numbers)\r\nfours = numbers.count(\"4\")\r\nsevens = numbers.count(\"7\")\r\nl = [4,7,47,74,777,774,747,744,444,477,474,477]\r\nif fours+sevens == len(numbers):\r\n print(\"YES\")\r\n exit()\r\nfor i in l:\r\n if intNumbers%i == 0:\r\n print(\"YES\")\r\n exit()\r\n else:\r\n continue\r\nprint(\"NO\")", "def is_lucky(number):\r\n lucky_digits = {'4', '7'}\r\n for digit in str(number):\r\n if digit not in lucky_digits:\r\n return False\r\n return True\r\n\r\ndef is_almost_lucky(n):\r\n for i in range(1, n + 1):\r\n if n % i == 0 and (is_lucky(i) or is_lucky(n // i)):\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nresult = \"YES\" if is_almost_lucky(n) else \"NO\"\r\nprint(result)\r\n", "N = int(input())\r\n\r\nres = False\r\nfor i in range(2, N + 1):\r\n\tbl = True\r\n\tfor j in str(i):\r\n\t\tif (int(j) != 4) and (int(j) != 7):\r\n\t\t\tbl = False\r\n\t\t\tbreak\r\n\tif bl:\r\n\t\tif N%i == 0:\r\n\t\t\tres = True\r\n\t\t\tbreak\r\n\r\nif res:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "num=[4,7,44,77,74,47,444,447,474,744,774,747,477,777]\r\na=int(input())\r\nc=0\r\nfor i in range(len(num)):\r\n if(a%num[i]==0 ):\r\n print(\"YES\")\r\n c=1\r\n break \r\nif(c==0):\r\n print(\"NO\") ", "def is_almost_lucky(n):\r\n lucky_digits = set([4, 7])\r\n\r\n for i in range(1, n + 1):\r\n if n % i == 0 and all(int(digit) in lucky_digits for digit in str(i)):\r\n return \"YES\"\r\n\r\n return \"NO\"\r\n\r\nn = int(input())\r\n\r\nresult = is_almost_lucky(n)\r\nprint(result)\r\n", "numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477]\r\nuser = int(input())\r\nlucky = False\r\n\r\nfor num in numbers:\r\n if user % num == 0:\r\n lucky = True\r\n break\r\n\r\nif lucky:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def luck(a):\r\n a=str(a)\r\n j1=0\r\n for i in a:\r\n if i!='4' and i!='7':\r\n j1=1\r\n break\r\n if j1==0:\r\n return 1\r\n else:\r\n return 0\r\n\r\np=int(input())\r\npanduan=0\r\nfor i in range(1,p+1):\r\n if p%i==0 and luck(i):\r\n panduan=1\r\n break\r\nif panduan==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_lucky(number):\r\n lucky_digits = {'4', '7'}\r\n for digit in str(number):\r\n if digit not in lucky_digits:\r\n return False\r\n return True\r\n\r\ndef is_almost_lucky(n):\r\n for i in range(1, n + 1):\r\n if n % i == 0 and is_lucky(i):\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = int(input())\n\nif str(a).count(\"7\") + str(a).count(\"4\") == len(str(a)):\n print(\"YES\")\n\nelif a % 4 == 0 or a % 7 == 0 or a % 47 == 0 or a % 74 == 0 or a % 444 == 0 or a % 447 == 0 or a % 474 == 0 or a % 477 == 0 or a % 777 == 0 or a % 774 == 0 or a % 747 == 0 or a % 744 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n# Thu Jul 06 2023 12:27:24 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\ncheck = [int(i+j+k) for i in ['0','4','7'] for j in ['4','7'] for k in ['4','7']] + [4,7]\r\nfor c in check:\r\n if n%c == 0:\r\n print('YES')\r\n exit()\r\nprint('NO')", "a=int(input())\r\nif a%7==0 or a%4==0 or a%47==0 or a%477==0 or a%77==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\ndivisiors = [4,7,47,74,77,44,444,477,447,777,774,744]\r\n\r\n\r\nfor i in range(len(divisiors)):\r\n if n%divisiors[i] == 0:\r\n print('YES')\r\n break\r\n else:\r\n pass\r\nelse:\r\n print('NO')\r\n", "n=int(input())\nmops=[4, 7, 44, 47, 74, 77, 444, 447, 474, 744, 477, 747, 774, 777]\nans='NO'\nfor i in mops:\n if n%i==0:\n ans='YES'\n break\nprint(ans)\n# Thu Jul 06 2023 13:12:28 GMT+0300 (Moscow Standard Time)\n", "def main():\r\n n = int(input())\r\n str_n = str(n)\r\n ln = len(str_n)\r\n if n > 0:\r\n count = 0\r\n i = 2\r\n str_i = str(2)\r\n while i < n:\r\n p = 0\r\n while p < len(str_i):\r\n if str_i[p] == \"4\" or str_i[p] == \"7\":\r\n count += 1\r\n p += 1\r\n if count == len(str_i):\r\n if n % i == 0:\r\n return \"YES\"\r\n count = 0\r\n i += 1\r\n str_i = str(i)\r\n if n % 4 != 0 or n % 7 != 0:\r\n count = 0\r\n i = 0\r\n while i < ln:\r\n if str_n[i] == \"4\" or str_n[i] == \"7\":\r\n count += 1\r\n i += 1\r\n if count == ln:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n else:\r\n return \"NO\"\r\nprint(main())\r\n", "lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nn = int(input())\r\n\r\nn_is_almost_lucky = False\r\nfor lucky in lucky_numbers:\r\n if n % lucky == 0:\r\n n_is_almost_lucky = True\r\n\r\nif n_is_almost_lucky:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nl = list()\r\nfor i in range(4, n + 1):\r\n s = set(str(i))\r\n if (('4' in s or '7' in s) and len(s) == 1) or ('4' in s and '7' in s and len(s) == 2):\r\n l.append(int(i))\r\nf = False\r\nfor i in l:\r\n if n % i == 0:\r\n f = True\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "number = int(input())\r\nlacky, flag = 4, True\r\nflag_1 = False\r\nwhile number % lacky != 0:\r\n flag_1 = False\r\n while flag_1 == False:\r\n counter = 0\r\n lacky += 1\r\n for i in str(lacky):\r\n if i == '7' or i == '4':\r\n counter += 1\r\n if counter == len(str(lacky)):\r\n flag_1 = True\r\n if number < lacky:\r\n print('NO')\r\n flag = False\r\n break\r\n\r\nif flag is True:\r\n print('YES')", "ls = [4,7,44,47,74,444,447,474,477,744,747,777]\r\na = int(input())\r\nbl = False\r\nfor el in ls:\r\n if a % el == 0:\r\n bl = True\r\nprint('YES' if bl else 'NO')", "a=int(input())\r\nif a%4==0 or a%7==0 or a%44==0 or a%47==0 or a%74==0 or a%77==0 or a%444==0 or a%447==0 or a%474==0 or a%477==0 or a%744==0 or a%747==0 or a%777==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\n# Thu Jul 06 2023 12:42:04 GMT+0300 (Moscow Standard Time)\n", "x = int(input(\"\"))\r\nnumSorte = []\r\nfor i in range(1000):\r\n numstr = str(i)\r\n sorte = 1\r\n for j in numstr:\r\n if j!='4' and j!='7':\r\n sorte = 0\r\n break\r\n if sorte==1:\r\n numSorte.append(i)\r\nsorte = 0\r\nfor i in range(len(numSorte)):\r\n if x%numSorte[i]==0:\r\n sorte = 1\r\nif sorte==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "number=int(input())\r\nf=True\r\nlucky_numbers=[4,7,44,77,47,74,444,777,447,774,474,747,477,744]\r\nif number in lucky_numbers:\r\n print('YES')\r\n f=False\r\n\r\nfor i in lucky_numbers:\r\n if f:\r\n if number>i and number%i==0:\r\n print('YES')\r\n f=False\r\nif f:\r\n print('NO')", "b = int(input())\r\n\r\ndef x(n):\r\n lucky = set([4, 7])\r\n \r\n for i in range(1, b + 1):\r\n if b % i == 0 and all(int(digit) in lucky for digit in str(i)):\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n \r\nn = x(b)\r\nprint(n)", "import itertools as it\nv = input()\na = []\nn = []\nfor i in range(len(v)):\n a.append(4)\n for i in range(len(a)):\n q = list(it.permutations(a, len(a)))\n for j in q:\n if j not in n:\n n.append(j)\n a[i] = 7\n if a[-1] == 7:\n q = list(it.permutations(a, len(a)))\n for j in q:\n if j not in n:\n n.append(j)\n\n for i in range(len(a)):\n a[i] = 4\nf = 0\nfor i in range(len(n)):\n r = [*n[i]]\n s = ''\n for j in r:\n s += str(j)\n if int(v) % int(s) == 0:\n f = 1\nif f == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n", "n = int(input())\r\n\r\ndef luck_numbers(n):\r\n l = []\r\n for i in range(4,n+1):\r\n if all(x=='4' or x=='7' for x in str(i)):\r\n l.append(i)\r\n return l\r\n\r\nl = luck_numbers(n)\r\nfor luck_number in l:\r\n if n%luck_number == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "lky=[\"4\",\"7\"]\r\nlst=[]\r\nnum=int(input())\r\nstring=str(num)\r\nfor i in string:\r\n lst.append(i)\r\n lst.sort()\r\nres = []\r\n[res.append(x) for x in lst if x not in res]\r\n\r\nif res ==lky or num%4==0 or num%7==0 or num%47==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\nn=int(input())\r\nx=[str(i) for i in range (n+1)]\r\ny=[]\r\nfor i in x:\r\n d=dict(Counter(i))\r\n if len(d)==1 and ('4' in d or '7' in d):\r\n y.append(int(i))\r\n elif len(d)==2 and ('4' in d and '7' in d):\r\n y.append(int(i))\r\n \r\nf=False\r\nfor i in y:\r\n if i<=n:\r\n if n%i==0:\r\n f=True\r\nif f==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l_num = [4, 7, 47, 44, 74, 77, 444, 447, 477, 474, 744, 747, 774, 777]\r\nnum = int(input())\r\nflag = 'NO'\r\nfor i in l_num:\r\n if(num % i == 0):\r\n flag = \"YES\"\r\n break\r\n elif(i > num):\r\n break\r\nprint(flag)", "a=int(input())\r\nf=\"NO\"\r\nif a%4==0 or a%7==0:\r\n f=\"YES\"\r\nelse:\r\n if f==\"NO\":\r\n a=str(a)\r\n f=\"YES\"\r\n for i in a:\r\n if i not in \"47\":\r\n f=\"NO\"\r\n break\r\n if f==\"NO\":\r\n a=int(a)\r\n for i in range(1,a):\r\n b=str(i)\r\n if \"4\" in b and \"7\" in b:\r\n if a%i==0:\r\n f=\"YES\"\r\n break\r\n \r\n \r\nprint(f)", "def check_lucky(num):\n num = str(num)\n counter = 0\n for dig in num:\n if dig == '4' or dig == '7':\n continue\n else:\n counter += 1\n break\n if counter == 0:\n return 1\n else:\n return 0\n\n\nn = int(input())\ncount = 0\nfor i in range(4, n + 1):\n if check_lucky(i) and n % i == 0:\n count += 1\n break\n else:\n continue\nif count > 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "n=int(input())\r\ndef is_lucky(n):\r\n string=str(n)\r\n for i in range(len(string)):\r\n if(string[i]!=\"4\" and string[i]!=\"7\"):\r\n return(False)\r\n else:\r\n if(i==len(string)-1):\r\n return(True)\r\nfor i in range(1,n+1):\r\n if(is_lucky(i)):\r\n if(n%i==0):\r\n print(\"YES\")\r\n break\r\n elif(i==n):\r\n print(\"NO\")\r\n \r\n elif(i==n):\r\n print(\"NO\")\r\n ", "def is_lucky(n):\r\n while n > 0:\r\n digit = n % 10\r\n if digit != 4 and digit != 7:\r\n return False\r\n n //= 10\r\n return True\r\n\r\ndef lucky_division(n):\r\n if is_lucky(n):\r\n return \"YES\"\r\n lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n for num in lucky_numbers:\r\n if n % num == 0:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n result = lucky_division(n)\r\n print(result)\r\n", "n=int(input())\r\nl=[4,44,444,7,77,777,447,774,477,744,474,747,47,74]\r\nfor i in l:\r\n if(n%i==0):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nmark= 0\r\nnumbers = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nfor number in numbers:\r\n\tif n % number == 0 :\r\n\t\tprint(\"YES\")\r\n\t\tmark=1\r\n\t\tbreak\r\nif mark == 0 :\r\n\tprint(\"NO\")", "c=int(input())\r\nt=[]\r\nh=0\r\nfor a in range(3,777):\r\n bool=1\r\n k=a\r\n while a!=0:\r\n b=a%10\r\n a=a//10\r\n if b!=7 and b!=4:\r\n bool=0\r\n if bool==1:\r\n t.append(k)\r\nif c in t: \r\n print('YES')\r\nelse: \r\n for i in t:\r\n if c%i==0:\r\n h=1\r\n if h==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "# Input\r\nn = int(input())\r\n\r\n# List of lucky numbers\r\nlucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n\r\n# Check if n is almost lucky\r\nfor lucky in lucky_numbers:\r\n if n % lucky == 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\ns=str(n)\r\nflag=False\r\nfor i in s:\r\n if i=='4' or i=='7':\r\n continue\r\n else:\r\n flag=True\r\n break\r\nif flag==False:\r\n print(\"YES\")\r\nelse: \r\n div=False\r\n l=[4,7,44,47,74,77,444,447,474,777,477,774,747,744]\r\n for i in l:\r\n if n%i==0:\r\n div=True\r\n break\r\n if div==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n", "def is_almost_lucky(n):\r\n lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777] # List of lucky numbers\r\n for lucky_number in lucky_numbers:\r\n if n % lucky_number == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n# Read the input number\r\nn = int(input())\r\n\r\n# Check if n is almost lucky\r\nprint(is_almost_lucky(n))\r\n\r\n ", "n = int(input())\r\na = 0\r\ndef iscooll(a):\r\n s = str(a)\r\n if s.count('4')+s.count('7') == len(s):\r\n return True\r\nfor i in range(1, n+1):\r\n if n%i == 0:\r\n if iscooll(i):\r\n a = 1\r\nif a == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\n# Thu Jul 06 2023 15:16:34 GMT+0300 (Moscow Standard Time)\n\n# Thu Jul 06 2023 15:16:40 GMT+0300 (Moscow Standard Time)\n", "def is_lucky(number):\r\n lucky_numbers = [4, 7, 47, 74, 444, 447, 474, 744, 777, 774, 747, 477]\r\n for lucky in lucky_numbers:\r\n if number % lucky == 0:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nif is_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a_s=[4,7,44,47,74,77,444,447,474,744,774,747,477,777]\r\nn=int(input())\r\nsta=0\r\nfor a in a_s:\r\n if n%a==0:\r\n sta=1\r\n break\r\nif sta==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "def check(k):\r\n f = k.count('4')\r\n s = k.count('7')\r\n if s+f==len(k):\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\ndef factor(num):\r\n for i in range(4, num):\r\n if num%i==0:\r\n if check(str(i)):\r\n return 1\r\n return 0\r\n\r\n\r\nk = input()\r\nnum = int(k)\r\nif check(k):\r\n print('YES')\r\nelif num<4:\r\n print('NO')\r\nelif factor(num):\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_lucky(num):\r\n lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477]\r\n for lucky in lucky_numbers:\r\n if num % lucky == 0:\r\n return True\r\n return False\r\n\r\n# Input reading\r\nn = int(input())\r\n\r\n# Check if the number is almost lucky and output the result\r\nif is_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "l=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nn=int(input())\r\nfor x in l:\r\n\tif x==n or n%x==0:\r\n\t\tprint(\"YES\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\nl=[4,7,47,74,444,447,474,744,477,747,774,777]\r\nfor i in range(len(l)):\r\n if n%l[i]==0:\r\n f=True\r\n break\r\n else:\r\n f=False\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\narr = [4, 7, 47, 44, 74, 77, 444, 447, 474, 477, 777]\r\nk = 0\r\nfor i in arr:\r\n if n%i==0:\r\n k+=1\r\nif k == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\nm = [4, 7, 44, 77, 47, 74, 444, 447, 474, 774, 777, 744, 477, 747]\r\no = 0\r\nfor i in m:\r\n if n%i==0:\r\n print('YES')\r\n o += 1\r\n break\r\nif o==0:\r\n print('NO')", "def lucky(i):\r\n y = \"\".join(sorted(set(i)))\r\n if y == \"4\" or y == \"7\" or y == \"47\":\r\n return True\r\n \r\n return False\r\n \r\nn = int(input())\r\na = 0\r\n \r\nfor i in range(1, n + 1):\r\n if lucky(str(i)):\r\n if n % i == 0:\r\n a = 1\r\n print(\"YES\")\r\n break\r\n \r\nif a == 1:\r\n pass\r\nelse:\r\n print(\"NO\")\r\n", "def is_lucky(n):\r\n if n in [4,7]:\r\n return True\r\n elif n in [0,1,2,3,5,6,8,9]:\r\n return False\r\n else:\r\n if n % 10 not in [4,7]:\r\n return False\r\n else:\r\n return is_lucky(n // 10)\r\n\r\n\r\nimport math\r\nm = int(input())\r\njud = 'NO'\r\nfor d in range(1,int(math.sqrt(m))+1):\r\n if m % d != 0:\r\n continue\r\n else:\r\n if is_lucky(d) or is_lucky(m//d):\r\n jud = 'YES'\r\n break\r\nprint(jud)\r\n\r\n\r\n", "x = int(input())\r\nluckies = [i for i in range(1,x+1) if \"\".join(sorted(list(set(str(i))))) in ['4','7','47','74'] ]\r\nprint(\"YES\" if x in luckies or any(x%i==0 for i in luckies) else \"NO\")\r\n", "n=input()\r\na=n.count('4')\r\nb=n.count('7')\r\nc=int(n)\r\n\r\nif a+b==len(n):\r\n print(\"YES\")\r\nelif c%7==0 or c%4==0 or c%47==0 or c%74==0 :\r\n\r\n print(\"YES\")\r\nelif c%447==0 or c%477==0 or c%777==0:\r\n print(\"YES\")\r\nelif c%744==0 or c%774==0 or c%444==0:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n\r\n", "n=int(input())\r\nf=0\r\nl=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nfor i in range (0,len(l)):\r\n if n%l[i]==0:\r\n print('YES')\r\n f=1\r\n break\r\nif f==0:\r\n print('NO')", "lucky = [4, 7, 47, 74, 44, 77, 444, 447, 474, 744, 477, 747, 774, 777]\r\n \r\nnum = int(input())\r\nif any(num%a==0 for a in lucky):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#Finding Length of String\r\nx = int(input())\r\nlength = int(len(str(x)))\r\n\r\n#Defining Functions to do Recursion\r\ndef add4(x):\r\n return int(x + '4') \r\ndef add7(y):\r\n return int(y + '7')\r\n\r\n#Defining Function that will return value\r\nlist_div = [4,7]\r\nfor i in range(1, length):\r\n for j in range(len(list_div)):\r\n entry1 = list_div[j]\r\n add4val, add7val = add4(str(entry1)), add7(str(entry1))\r\n list_div.append(int(add4val))\r\n list_div.append(int(add7val))\r\n\r\nresult = 'NO'\r\nfor a in list_div:\r\n if x % int(a) == 0:\r\n result = 'YES'\r\n break\r\n else:\r\n continue\r\n\r\nprint(result)\r\n\r\n\r\n ", "# Read input number\r\nn = int(input())\r\n\r\n# Function to check if a number is lucky\r\ndef is_lucky(num):\r\n while num > 0:\r\n digit = num % 10\r\n if digit != 4 and digit != 7:\r\n return False\r\n num //= 10\r\n return True\r\n\r\n# Check if n is almost lucky\r\nfor i in range(1, n+1):\r\n if n % i == 0 and is_lucky(i):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "num = int(input())\r\n\r\nluckyNumbers = [4, 7, 44, 74, 47, 77, 444, 744, 474, 774, 447, 747, 477, 777]\r\n\r\nfor n in luckyNumbers:\r\n if num%n == 0:\r\n print(\"YES\")\r\n quit()\r\n\r\nprint(\"NO\")", "#initializes input, the lucky digits, a set of lucky numbers, and a lucky argument\r\nnumber = input()\r\nluckydigits = {'4', '7'}\r\nluckynumbers = [4, 7, 47, 74]\r\nlucky = 0\r\n\r\n#checks if number is already a lucky number\r\nif set(number) == luckydigits:\r\n print('YES')\r\n exit()\r\n#if number is almost lucky (divisible by a lucky number), ticks lucky argument and prints accordingly\r\nfor x in luckynumbers:\r\n if int(number) % x == 0:\r\n lucky += 1\r\n break\r\nif lucky == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# URL: https://codeforces.com/problemset/problem/122/A\nn = int(input())\nfor x in range(4, n + 1):\n if n % x == 0 and not (set(str(x)) - {'4', '7'}):\n print(\"YES\")\n break\nelse:\n print(\"NO\")\n", "n=input()\r\ncount=0\r\nfor i in n:\r\n if i=='4' or i=='7':\r\n count+=1\r\nif count==len(n):\r\n print(\"YES\")\r\nelse:\r\n n1=int(n)\r\n if n1%4==0 or n1%7==0 or n1%47==0 or n1%74==0 or n1%444==0 or n1%777==0 or n1%477==0 or n1%447==0 or n1%774==0 or n1%744==0 or n1%44==0 or n1%77==0 :\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def is_happy(n):\r\n n = str(n)\r\n for i in n:\r\n if i not in '47':\r\n return False\r\n return True\r\n\r\n\r\ndef f(n):\r\n mas = []\r\n for i in range(1, int(n**0.5)+1):\r\n if n % i == 0:\r\n mas.append(i)\r\n mas.append(n//i)\r\n\r\n for i in mas:\r\n if is_happy(i):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(f(int(input())))\r\n\r\n\r\n\r\n", "def findLucky(num):\r\n if num % 4 == 0 or num % 7 == 0:\r\n return \"YES\"\r\n for i in range(2,num):\r\n if num % i == 0:\r\n if find(i) == \"YES\":\r\n return \"YES\"\r\n\r\n num = str(num)\r\n return find(num)\r\n \r\ndef find(num):\r\n char = '47'\r\n for i in str(num):\r\n if i not in char:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nnum = int(input())\r\nprint(findLucky(num))", "\r\nlucky=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nnum=int(input(\"\"))\r\nyes=0\r\nfor i in lucky:\r\n if num%i==0:\r\n yes+=1\r\n break\r\nif num in lucky or yes>0:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "n = input()\r\n\r\ndef checkLucky(n):\r\n\tnum = str(n)\r\n\tfor s in num:\r\n\t\tif s not in ['4','7']:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nfound = False\r\n\r\nfor k in range(int(n)+1):\r\n\tif checkLucky(k):\r\n\t\tif int(n) % k == 0:\r\n\t\t\tprint('YES')\r\n\t\t\tfound = True\r\n\t\t\tbreak\r\n\r\nif not found:\r\n\tprint('NO')", "n=int(input())\r\nl=[]\r\ntest=False\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n l.append(str(i))\r\nfor i in range(len(l)):\r\n if l[i].count(\"4\")+l[i].count(\"7\")==len(l[i]):\r\n print(\"YES\")\r\n test=True\r\n break\r\n elif l[i].count(\"4\")==len(l[i]):\r\n print(\"YES\")\r\n test=True\r\n break\r\n elif l[i].count(\"7\")==len(l[i]):\r\n print(\"YES\")\r\n test=True\r\n break\r\nif test==False:\r\n print(\"NO\")", "\nlucky = [4,7,47,74,44,77,444,777,447,474,477,774,747,744]\n\nn = int(input())\nans = False\n\nif n in lucky:\n ans = True\nelse:\n for i in lucky:\n if n % i == 0:\n ans = True\n break\n\nif ans:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t \t \t\t \t \t\t \t\t \t \t", "def solve(n):\r\n temp={4,7,47,74,477,444,447,474,747,744,777,774,77,44}\r\n for i in temp:\r\n if n%i==0:\r\n return 'YES'\r\n return 'NO'\r\n \r\nn=int(input())\r\nprint(solve(n))", "def lucky(number):\r\n return all(digit in \"47\" for digit in str(number))\r\n\r\ndef almost_lucky(n):\r\n for i in range(1, n + 1):\r\n if n % i == 0 and lucky(i):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nn = int(input().strip())\r\n\r\nresult = almost_lucky(n)\r\nprint(result)", "n=input()\r\nc=n.replace('',' ')\r\nc=list(map(int,c.split()))\r\nif c.count(4)+c.count(7)==len(c):\r\n print('YES')\r\nelse:\r\n u=0\r\n y=1\r\n while y*y<=int(n):\r\n if int(n)%y==0:\r\n if str(y).count('4')+str(y).count('7')==len(str(y)):\r\n u=1\r\n print('YES')\r\n break\r\n else:\r\n x=int(n)//y\r\n if str(x).count('4')+str(x).count('7')==len(str(x)):\r\n u=1\r\n print('YES')\r\n break\r\n y+=1\r\n if u==0:\r\n print('NO')", "x=int(input())\r\nli=[4,7,47,74,44,444,447,474,477,777,774,744]\r\nflag=False\r\nfor i in li:\r\n if x%i==0:\r\n print(\"YES\")\r\n flag=True\r\n break\r\nif(flag==False):\r\n print(\"NO\")", "list1=[4,44,444,7,77,777,47,74,447,474,477,774,747,744]\r\nt=int(input())\r\nc=1\r\nfor i in list1:\r\n if t%i==0:\r\n print(\"YES\")\r\n c=0\r\n break\r\nif c==1:\r\n print(\"NO\")\r\n ", "n = int(input())\ntemp = n\nf = True\nwhile n:\n if n%10 != 4 and n%10 != 7:\n f = False\n break\n n /= 10\n n = int(n)\nif f :\n print(\"YES\")\nelif temp%4==0 or temp%7==0 or temp%44==0 or temp%47==0 or temp%74==0 or temp%77==0 or temp%444==0 or temp%447==0 or temp%474==0 or temp%477==0 or temp%744==0 or temp%747==0 or temp%774==0 or temp%777==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n \t\t\t \t \t\t \t\t \t\t\t \t \t \t\t\t", "x = []\r\nfor i in range(4,1001):\r\n a = set(list(str(i)))\r\n if len(a) <= 2 :\r\n if len(a)==1:\r\n if '4' in a or '7' in a:\r\n x.append(i)\r\n else:\r\n if '4' in a and '7' in a:\r\n x.append(i)\r\n \r\nn = int(input())\r\ntr = False\r\nfor i in x:\r\n if n%i == 0:\r\n tr = True\r\n break\r\n\r\nif tr:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\nok=0\nfor i in range(1,n+1):\n x=i\n while x > 0:\n if x % 10 != 4 and x % 10 != 7:\n break\n else:\n x /= 10\n x = int(x)\n if x==0:\n if n%i==0:\n print(\"YES\")\n ok=1\n break\nif ok==0:\n print(\"NO\")\n\n\n\n \t\t\t\t\t\t \t \t \t\t\t\t\t\t \t\t\t \t\t\t\t\t\t", "n=int(input())\r\nif (n%4)==0 or (n%7)==0 or (n%47)==0 or (n%74)==0 or (n%447)==0 or (n%477)==0 or (n%744)==0 or (n%774)==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\ndef lucky (x):\r\n global n, luck\r\n\r\n if x == 0:\r\n return [4,7]\r\n else:\r\n x = lucky(x-1)\r\n if x == True:\r\n return True\r\n temp = []\r\n for i in x:\r\n if n%i == 0:\r\n print(\"YES\")\r\n luck = False\r\n return True\r\n\r\n #print(i)\r\n temp.append(10*i+4)\r\n temp.append(10*i+7)\r\n return temp\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nluck = True\r\n\r\n\r\nlucky(math.ceil(math.log10(n)))\r\nif luck:\r\n print(\"NO\")", "li=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nn=int(input())\r\nk=0\r\nfor i in range(len(li)):\r\n if n%li[i]==0:\r\n k+=1\r\n break\r\nif k ==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def is_lucky(num):\r\n return all(digit == '4' or digit == '7' for digit in str(num))\r\n\r\ndef is_almost_lucky(num):\r\n for i in range(1, num + 1):\r\n if num % i == 0 and is_lucky(i):\r\n return True\r\n return False\r\n\r\ndef main():\r\n n = int(input())\r\n if is_almost_lucky(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nk=4\r\nl=['4','7']\r\nwhile True:\r\n if n%k==0 and all(t in l for t in list(str(k))):\r\n print('YES')\r\n break\r\n elif k>=n:\r\n print('NO')\r\n break\r\n else:\r\n k+=1", "x = int(input())\n\nif x % 4 == 0 or x % 7 == 0 or x % 44 == 0 or x % 47 == 0 or x % 74 == 0 or x % 77 == 0 or x % 444 == 0 or x % 447 == 0 or x % 474 == 0 or x % 477 == 0 or x % 744 == 0 or x % 747 == 0 or x % 777 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t\t \t \t\t \t \t \t \t\t\t\t", "n=int(input());print(\"NO\"if set(str(n))!={'4','7'}and n%4!=0 and n%7!=0 and n%47!=0 and n%74!=0 else \"YES\")\r\n", "n = int(input())\nd = \"4\"\ni = -1\nlucky = False\nwhile int(d) <= n:\n if n % int(d) == 0:\n lucky = True\n break\n if \"4\" in d:\n i = -(d[::-1].index(\"4\") + 1)\n d = d[:i] + \"7\" + \"4\" * -(i+1)\n else:\n d = \"4\" + d\nif lucky:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import itertools\r\nt = int(input())\r\nn = itertools.combinations_with_replacement(['4', '7'], 1)\r\ne = itertools.combinations_with_replacement(['4', '7'], 2)\r\nc = itertools.combinations_with_replacement(['4', '7'], 3)\r\ndef meir():\r\n for i in n:\r\n if t % int(''.join(i)) == 0:\r\n print(\"YES\")\r\n return 0;\r\n for i in e:\r\n if t % int(''.join(i)) == 0:\r\n print(\"YES\")\r\n return 0;\r\n for i in c:\r\n if t % int(''.join(i)) == 0:\r\n print(\"YES\")\r\n return 0;\r\n print(\"NO\")\r\n return 0\r\nmeir()", "n = int(input())\nif (n%4 == 0) or (n%7 == 0) or (n%47 == 0) or (n%74 == 0) or (n%477 == 0) or (n%744 == 0) or (n%474 == 0) or (n%747 == 0) or (n%447 == 0) or (n%774 == 0):\n print(\"YES\")\nelse:print(\"NO\")\n \t\t \t \t \t\t\t\t\t\t \t \t \t\t \t \t", "a = int(input())\r\n\r\ndivide = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n\r\ndef solve():\r\n ans = \"NO\"\r\n for i in divide:\r\n if a % i == 0:\r\n ans = \"YES\"\r\n print(ans)\r\nsolve()", "test_num=int(input())\r\ntest_set=set(str(test_num))\r\nif test_set.issubset({\"4\",\"7\"}):\r\n print(\"YES\")\r\nelse:\r\n test=False\r\n for i in [4,7,44,47,74,77,444,447,474,477,744,747,774,777]:\r\n if test_num % i ==0:\r\n test=True\r\n break\r\n if test:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "\r\ndef lucky_num(n):\r\n '''decide whether n is a lucky number'''\r\n if str(n).count('4')+str(n).count('7')==len(str(n)):\r\n return('lucky_number')\r\n else:\r\n return 2\r\n\r\n\r\nn=int(input())\r\nfor i in range(1,n+1): \r\n if lucky_num(i)=='lucky_number':\r\n if n%i==0:\r\n print('YES')\r\n break\r\n else:\r\n continue\r\n elif i<n:\r\n continue\r\n else:\r\n print('NO')", "n = input()\n\nluckys = [4, 7, 47, 77, 74, 44, 444,447,474, 477, 777, 774, 744]\nflag = False\nfor i in luckys:\n if int(n) % i == 0:\n flag = True\n break\n\nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 16:28:11 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\ndef judge(x):\r\n if '1' in x or '2' in x or '3' in x or '5' in x or '6' in x or '8' in x or '9' in x or '0' in x :\r\n return False\r\n else:\r\n return True\r\nn=int(input())\r\nlucky_nums=[]\r\nfor i in range(n+1):\r\n re=judge(str(i))\r\n if re :\r\n lucky_nums.append(i)\r\nres='NO'\r\nfor i in lucky_nums :\r\n if n % i == 0 :\r\n res='YES'\r\nprint(res)\r\n ", "n = int(input())\r\n\r\n\r\ndef is_happy(arg):\r\n n = list(str(arg))\r\n for i in range(len(n)):\r\n if n[i] != '4' and n[i] != '7':\r\n return False\r\n else:\r\n return True\r\n\r\n\r\nfor i in range(4, n + 1):\r\n if is_happy(i):\r\n if n % i == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "be = input()\r\nxd = set([4,7])\r\nxd2 = set([int(i) for i in be]) \r\nbe = int(be)\r\nluckyN= [4,7,47,77,44,77,444,447,477,474,777,774,744,747]\r\nlucky = False\r\n\r\nif(xd2.issubset(xd)):\r\n lucky = True\r\nelse:\r\n for n in luckyN:\r\n if(be%n == 0):\r\n lucky = True\r\nif(lucky):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# Read the input number\r\nn = int(input())\r\n\r\n# Check if n is almost lucky\r\nlucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n\r\nif any(n % lucky == 0 for lucky in lucky_numbers):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x= input()\r\nlucky = True\r\nluck_num = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nfor i in x:\r\n if i != \"4\" and i!=\"7\":\r\n lucky=False\r\nif lucky ==True:\r\n print(\"YES\")\r\nelse:\r\n for i in luck_num:\r\n if int(x)%i==0:\r\n lucky=True\r\n break\r\n if lucky==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nm=0\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n t=0\r\n for j in str(i):\r\n if int(j)==4 or int(j)==7:\r\n pass\r\n else:\r\n t+=1\r\n if t==0:\r\n m+=1\r\n else:\r\n continue\r\n else:\r\n continue\r\nif m==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def lucky(num):\r\n lucky = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n for i in lucky:\r\n if num % i == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\ndef main():\r\n num = int(input())\r\n print(lucky(num))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "num=int(input())\r\nif num%4==0 or num%7==0:\r\n print('YES')\r\nelif num%44==0 or num%77==0 or num%47==0 or num%74==0:\r\n print(\"YES\")\r\nelif num%444==0 or num%447==0 or num%474==0 or num%477==0:\r\n print('YES')\r\nelif num%744==0 or num%747==0 or num%774==0 or num%777==0:\r\n print('YES')\r\nelse:\r\n print(\"NO\")\r\n", "lis=[4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nn = int(input())\r\nfor k in lis:\r\n if n %k==0:\r\n print(\"YES\")\r\n break\r\nelse:print(\"NO\")", "def is_lucky(num):\r\n lucky_digits = {'4', '7'}\r\n \r\n for digit in str(num):\r\n if digit not in lucky_digits:\r\n return False\r\n \r\n return True\r\n\r\ndef is_almost_lucky(num):\r\n for i in range(1, num + 1):\r\n if num % i == 0 and is_lucky(i):\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\n'''\nFlag=True\ntemp=n\nwhile temp!=0:\n d=temp%10\n temp=temp//10\n if d!=4 or d!=7: \n Flag=False\nif Flag:\n print('YES')\n'''\nif n%4==0 or n%7==0 or n%47==0 or n%74==0 or n%474==0 or n%477==0 or n%444==0 or n%447==0:\n print('YES')\nelse:\n print('NO')\n\n", "lucky=[]\r\nk=2\r\nfor i in range(4,1001):\r\n if i not in lucky:\r\n t=True\r\n for j in str(i):\r\n if j!='4' and j!='7':\r\n t=False\r\n break\r\n if t:\r\n lucky.append(i)\r\n while i*k<1001:\r\n lucky.append(i*k)\r\n k+=1\r\n k=2\r\nn=int(input())\r\nif n in lucky:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "n = int(input())\r\ns = [4, 7, 47, 74, 444, 447, 474, 477, 744, 774, 777]\r\nfor i in range(len(s)):\r\n if n%s[i] == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "lst=[]\r\ndef findluckynum():\r\n for i in range(4,n+1):\r\n st=set(str(i))\r\n if st=={\"4\"} or st=={\"7\"} or st=={\"7\",\"4\"}:\r\n lst.append(i)\r\nn=int(input())\r\nfindluckynum()\r\ncount=0\r\nfor j in lst:\r\n if n%j==0:\r\n count=1\r\n break\r\nif count==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 26 10:20:30 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\ni=int(input())\r\nif i%4==0 or i%7==0 or i%47==0 or i%74==0 or i%447==0 or i%477==0 or i%747==0:\r\n print('YES')\r\nelse:print('NO')", "from sys import stdin\ninput = stdin.readline\n\n\nif __name__ == \"__main__\":\n n = int(input())\n numeros_suerte = {4,7,44,47,74,77,444,447,474,477,744,747,774,777}\n x = False\n for num in numeros_suerte:\n if n % num == 0:\n x = True\n print([\"NO\", \"YES\"][x])\n \n\t \t\t\t\t\t \t \t \t\t\t\t \t \t", "n=int(input())\r\nm=[4,7,47,74,444,447,477,744,747,777]\r\nan = [item for item in m if n%item==0]\r\nprint(\"YES\" if an else \"NO\")", "div = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\na = int(input())\r\nfor i in div:\r\n if a%i==0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def is_lucky(number):\r\n return all(digit in \"47\" for digit in str(number))\r\n\r\ndef is_almost_lucky(n):\r\n for lucky_number in range(1, 1001):\r\n if is_lucky(lucky_number) and n % lucky_number == 0:\r\n return True\r\n return False\r\n\r\ndef main():\r\n n = int(input())\r\n if is_almost_lucky(n):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nif n%4==0 or n%7==0 or n%47==0 or n%74==0 or n%447 ==0 or n%474 == 0 or n%744 == 0 or n%477 ==0 or n%747==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nif n%4==0 or n%7==0 or n%44==0:\r\n print('YES')\r\nelif n%47==0 or n%74==0 or n%77==0:\r\n print('YES')\r\nelif n%444==0 or n%447==0 or n%477==0:\r\n print('YES')\r\nelif n%744==0 or n%747==0 or n%777==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input()); print([\"YES\", \"NO\"][all(n % i for i in [4, 7, 47, 477])])", "n = int(input())\n\ndef isLucky(n: str):\n for c in n:\n if c != \"4\" and c != \"7\":\n return False\n return True\n\nif isLucky(str(n)):\n print(\"YES\")\nelse:\n almost = False\n for i in range(2, int(n / 2)+1):\n if n % i == 0 and isLucky(str(i)) or isLucky(str(n / i)):\n almost = True\n break\n print(\"YES\" if almost else \"NO\")\n", "numbers = [4 , 7 , 44 , 47 , 74 , 77 , 444 , 447 , 474 , 477 , 744 , 747 , 774 , 777]\r\nnum = int(input()) \r\nfor numb in numbers : \r\n if num % numb == 0 : quit(print(\"YES\"))\r\nprint(\"NO\")", "l=[4,7,44,47,74,77,444,447,477,744,774,777]#枚举法\nn=int(input())\nb=False\nfor i in l:\n if n%i==0:b=True\nprint(['NO','YES'][b])", "n = int(input())\r\nans = \"NO\"\r\nfor i in range(1, n + 1):\r\n f, s = 0, 0\r\n for el in str(i):\r\n f += el == '4'\r\n s += el == '7'\r\n if f + s == len(str(i)) and n % i == 0:\r\n ans = \"YES\"\r\n break\r\nprint(ans)", "num = int(input())\r\nlucky_nums = [4,7,47,74,447,477,474,747,774]\r\ncheck = 0\r\nfor i in range(len(lucky_nums)):\r\n if num%lucky_nums[i]==0:\r\n check+=1\r\n break\r\nif check == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "t=input()\r\nf=0\r\nfor i in t:\r\n if i==\"4\" or i==\"7\":\r\n f=1\r\n else:\r\n f=0\r\n break\r\nif f==1 or int(t)%4==0 or int(t)%7==0 or int(t)%44==0 or int(t)%47==0 or int(t)%74==0 or int(t)%74==0 or int(t)%77==0 or int(t)%444==0 or int(t)%447==0 or int(t)%474==0 or int(t)%477==0 or int(t)%744==0 or int(t)%747==0 or int(t)%777==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x = input()\r\ny = list(x)\r\nz = 0\r\n\r\nfor i in range(0,len(y)):\r\n if y[i] == \"4\" or y[i] == \"7\":\r\n z += 1\r\n\r\nx = int(x)\r\nlist_accepted = [4,7,47,74,447,444,474,744,777,747,774,477]\r\nv = 0\r\n\r\nfor i in range(0,len(list_accepted)):\r\n if x > list_accepted[i]:\r\n if x % list_accepted[i] == 0:\r\n v += 1\r\n \r\nif v != 0 or z == len(y):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nm = [4,7,47,74,44,77,444,777,447,474,744,477,747,774]\r\ns = 0\r\nfor i in m :\r\n if n % int(i) == 0:\r\n s += 1\r\nif s > 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n=int(input())\r\na=0\r\nlns=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nfor i in range(14):\r\n if lns[i]<=n and n%lns[i]==0:\r\n a+=1\r\n break\r\n else:\r\n continue\r\n\r\nif a==0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n = int(input())\r\na = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 777]\r\nans = 'NO'\r\nfor x in a:\r\n if n % x == 0:\r\n ans = 'YES'\r\n break\r\nprint(ans)\r\n", "a=[4,7,47,77,447,477,747,777]\r\nj=int(input())\r\nfor i in range(len(a)):\r\n if j%a[i]==0:\r\n print('YES')\r\n break\r\nelse:print('NO')", "import sys\nfrom itertools import permutations\nfrom collections import Counter\nimport math\nM = 1000000007\n\n#s = str(sys.stdin.readline())\nn = (int(sys.stdin.readline()))\ns = Counter(str(n))\nans = \"\"\n#a = list(map(int,sys.stdin.readline().split()))\nif n % 4 == 0 or n % 7 == 0 or n%447 == 0 or n % 447 == 0 or n % 47 == 0 or n % 74 == 0 or n % 744 == 0 or n % 477 == 0 or n % 444 == 0 or n % 777 == 0:\n ans = \"YES\"\nelse: ans = \"NO\"\nprint(ans)\n", "def lucky(x):\r\n s = list(str(x))\r\n ok=all(x=='7' or x=='4' for x in s)\r\n if ok:\r\n return True\r\n else:\r\n return False\r\nn=int(input())\r\nif lucky(n):\r\n print('YES')\r\nelse:\r\n ok=False\r\n for i in range(1,n//2+1):\r\n if lucky(i) and n%i==0:\r\n ok=True\r\n break\r\n if ok:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "l=[4,7,44,77,47, 74,444,447,474,477, 774,777,747,744,4747,4747,4444,4744,4447, 4474,4477,4777,4774,7474,7777,7774 , 7747 , 7744, 7444,7477,7447]\r\nx=int(input())\r\nif x in l:\r\n print(\"YES\")\r\nelse:\r\n s=list(filter(lambda i : i <= x , l))\r\n for n in s:\r\n if x%n==0:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\")", "\r\n\r\n\r\ndef main():\r\n\tlucky_nums = [4, 7, 44, 444, 47, 474, 477, 74, 747, 744]\r\n\tnumber = int(input())\r\n\t\r\n\tfor lucky_num in lucky_nums:\r\n\t\tif number % lucky_num == 0:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tquit()\r\n\tprint(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n = input()\r\n\r\ncount = 0\r\n\r\ncon = 0\r\n\r\nfor i in n:\r\n if i == '4' or i == '7':\r\n count += 1\r\nu = int(n)\r\na = u % 4 \r\nb = u % 7 \r\nc = u % 74 \r\nd = u % 47\r\ng = u % 774\r\nl = u % 744\r\np = u % 474\r\nk = u % 477\r\ny = u % 447\r\nif a == 0 or b == 0 or c == 0 or d == 0 or g == 0 or l == 0 or p == 0 or k == 0 or y == 0 or count == len(n):\r\n print('YES')\r\nelse:\r\n print('NO')", "# geluksgetallen_onder_1010 = [4, 7, 44, 47, 74, 77, 447, 474, 477, 744, 747, 777]\r\n# 44, 744 zijn deelbaar door 4, 77 en 777 door 7\r\n\r\ngeluksgetallen_onder_1000_beperkt = [4, 7, 47, 74, 447, 474, 477, 744, 747]\r\n\r\nis_bijna_geluksgetal = False\r\n\r\ningegeven_waarde = int(input())\r\n\r\nfor getal in geluksgetallen_onder_1000_beperkt:\r\n if ingegeven_waarde % getal == 0: \r\n is_bijna_geluksgetal = True\r\n break\r\n\r\nif is_bijna_geluksgetal:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = [4, 7, 44, 47, 77, 444, 447, 477, 777, 774, 744]\r\nf = 0\r\nk = int(input())\r\nfor b in a:\r\n if k % b == 0: \r\n print(\"YES\")\r\n f = 1 \r\n break\r\nif f == 0:\r\n print(\"NO\")\n# Thu Jul 06 2023 13:50:04 GMT+0300 (Moscow Standard Time)\n", "def divisors(a):\r\n i = 1\r\n while i * i <= a:\r\n if a % i == 0:\r\n if a == i * i:\r\n A.append(i)\r\n else:\r\n A.append(i)\r\n A.append(a // i)\r\n i += 1\r\ndef IsHappy(a):\r\n a = str(a)\r\n for i in range(len(a)):\r\n if a[i] != \"4\" and a[i] != \"7\":\r\n return False\r\n return True\r\nA = []\r\nn = int(input())\r\ndivisors(n)\r\nA.sort()\r\nK = True\r\nfor i in range(len(A)):\r\n if IsHappy(A[i]):\r\n print(\"YES\")\r\n K = False\r\n break\r\nif K:\r\n print(\"NO\")", "n = int(input())\r\n\r\narr = [ 4 , 7 , 44 , 47 , 74 , 77 , 444 ,447, 474, 477 , 744 , 747 , 774 , 777 ]\r\n\r\ndef func( n, arr ):\r\n \r\n for i in arr :\r\n \r\n if i > n :\r\n break\r\n if n % i == 0:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n \r\nt = func( n , arr )\r\n\r\nprint( t ) ", "num = int(input())\r\nlucky_list = []\r\nfor i in range(1,num+1):\r\n s = str(i)\r\n is_lucky = True\r\n for j in s:\r\n if j == \"7\":\r\n continue\r\n elif j == \"4\":\r\n continue\r\n else:\r\n is_lucky = False\r\n if is_lucky == True:\r\n lucky_list.append(i)\r\nis_lucky = True\r\nis_second_lucky = False\r\nnum = str(num)\r\nfor i in num:\r\n if i == \"7\":\r\n continue\r\n elif i == \"4\":\r\n continue\r\n else:\r\n is_lucky = False\r\n \r\nif is_lucky == False:\r\n num = int(num)\r\n for i in lucky_list:\r\n if num % i == 0:\r\n is_second_lucky = True\r\n break\r\nif is_lucky or is_second_lucky:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nl=[]\r\nfor i in range(4,a+1):\r\n if a%i==0:\r\n l.append(i)\r\nflag=False\r\nfor j in l:\r\n f2=False\r\n b=str(j)\r\n for k in b:\r\n if k!='4' and k!='7':\r\n f2=True\r\n if f2==False:\r\n flag=True\r\nif flag==True:\r\n print('YES')\r\nelse:\r\n print('NO')", "def lucky(x):\r\n for i in str(x):\r\n if (i!=\"4\" and i!=\"7\") :\r\n return False\r\n return True\r\nn=int(input())\r\nfor i in range(1,1001):\r\n if(lucky(i) and n%i==0):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Aug 30 21:18:34 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\nlucky_number=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\ncontrol=False\r\nnumber=int(input())\r\nfor i in range(14):\r\n if number%lucky_number[i]==0:\r\n control=True\r\nif control:\r\n print('YES')\r\nelse:\r\n print('NO')", "raw=int(input())\r\nx=0\r\nl=[4,7,47,44,77,74,444,777,447,474,744,774,747,477]\r\nfor i in l:\r\n a=raw/i\r\n if a.is_integer():\r\n print('YES')\r\n break\r\n else:\r\n x+=1\r\nif x==14:\r\n print('NO')", "n=int(input())\r\nf=False\r\nfor i in range(1,1000):\r\n\r\n if n%i==0:\r\n if set(str(i))=={'4','7'} or set(str(i))=={'4'} or set(str(i))=={'7'}:\r\n f=True\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_lucky(n):\r\n lucky = {4,7}\r\n new = set()\r\n for i in str(n):\r\n new.add(int(i))\r\n \r\n\r\n return (new.issubset(lucky))\r\n\r\n \r\nn = int(input())\r\nflag = 0\r\n\r\nfor i in range(1,n+1):\r\n if is_lucky(i) == True:\r\n if n%i == 0:\r\n flag = 1\r\n break\r\n \r\nif flag == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "def listoffactors(n):\r\n l= []\r\n for i in range(1,n+1):\r\n if n%i==0:\r\n l.append(i)\r\n return l\r\ndef islucky(n1):\r\n n1 = str(n1)\r\n ans = True\r\n for j in (list(n1)):\r\n if (j!='4') & (j!='7'):\r\n ans = False\r\n break\r\n return ans\r\na = int(input())\r\nans1 = False\r\n# print(listoffactors(a))\r\nfor k in listoffactors(a):\r\n if islucky(k)==True:\r\n ans1 = True\r\n break\r\nif ans1==True:\r\n print('YES')\r\nelse: print(\"NO\")\r\n\r\n\r\n", "# A=B=C=0\r\n\r\n# for _ in range(int(input())):\r\n# a,b,c=map(int,input().split())\r\n# A+=a\r\n# B+=b\r\n# C+=c\r\n# if(A==0 and B==0 and C==0):\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n# s = input()\r\n# hello = \"hello\"\r\n# index = 0\r\n\r\n# for char in s:\r\n# if char == hello[index]:\r\n# index += 1\r\n# if index == len(hello):\r\n# print(\"YES\")\r\n# break\r\n\r\n# if index < len(hello):\r\n# print(\"NO\")\r\n\r\ndef func(n):\r\n i=list(set(str(n)))\r\n #print(i)\r\n ans=['4','7']\r\n for j in i:\r\n if j not in ans:\r\n return False\r\n return True\r\n\r\na=int(input())\r\nflag=1\r\nfor i in range(2,a+1):\r\n if(a%i==0) and func(i):\r\n print(\"YES\")\r\n flag=0\r\n break\r\nif flag:\r\n print(\"NO\")", "s = input()\r\nflag = False\r\nn = int(s)\r\nN =n\r\ni = 1\r\nwhile(i<=n):\r\n n = N\r\n if(s.count('4') + s.count('7')== len(s)):\r\n flag = True\r\n break\r\n else:\r\n if(n%i==0):\r\n s = str(i)\r\n i+=1\r\nprint('YES') if(flag == True) else print('NO')\r\n\r\n", "n=int(input())\r\nm=[]\r\nfor i in range(1,1001):\r\n if all(x==\"4\" or x==\"7\" for x in list(str(i))):\r\n m.append(i)\r\nif all(n%num!=0 for num in m):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "num = int(input())\r\nmylist = [4, 7, 44, 77, 47, 74, 444, 447, 474, 744, 774, 777, 747, 477]\r\nfor i in mylist:\r\n if num % i == 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def isluckynumber(number):\r\n for digit in str(number):\r\n if digit != '4' and digit != '7':\r\n return False\r\n return True\r\n\r\ndef isalmostlucky(number):\r\n for divisor in range(1, number + 1):\r\n if isluckynumber(divisor) and number % divisor == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nn = int(input())\r\nprint(isalmostlucky(n))", "given_number = int(input())\r\nalmost_lucky_numbers_dividers= [4, 7, 47, 74, 444, 447, 474, 477, 744, 747, 774, 777]\r\nis_lucky = False\r\nfor lucky_divider in almost_lucky_numbers_dividers:\r\n if given_number % lucky_divider == 0 :\r\n print(f\"YES\")\r\n is_lucky = True\r\n break\r\nif not is_lucky:\r\n print(f\"NO\")\r\n ", "# import sys;input=sys.stdin.readline\r\nimport math\r\n\r\ndef yes(ch='\\n'):\r\n print(\"YES\",end=ch)\r\n return \r\n\r\ndef no(ch='\\n'):\r\n print(\"NO\",end=ch)\r\n return \r\n\r\ndef help(n):\r\n three=n//3\r\n rem=n%3\r\n if (2*rem>=three):\r\n return 1\r\n else:\r\n return 0\r\n\r\ndef solve():\r\n n=int(input())\r\n if (n%4==0 or n%7==0 or n%47==0 or n%74==0 or n%77==0 or n%477==0):\r\n yes()\r\n else:\r\n no()\r\n\r\n\r\n# for _ in range(int(input())):\r\nsolve()", "def digit(x):\r\n digits=[]\r\n while(x!=0):\r\n digits.append(x%10)\r\n x=x//10\r\n return(digits)\r\ndef lucky(x):\r\n l=digit(x)\r\n if len(l)==0:\r\n return \"NO\"\r\n for i in range(len(l)):\r\n if l[i]!=4 and l[i]!=7:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nn=int(input())\r\nluckyset=set()\r\nfor i in range(1,1001):\r\n if lucky(i)==\"YES\":\r\n luckyset.add(i)\r\n#print(luckyset)\r\nfor i in range(1,n+1):\r\n if n%i==0 and i in luckyset:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nnumbers = [4, 7, 47, 74, 447, 474, 477, 744, 747, 777]\r\nlucky = False\r\n\r\nfor i in numbers:\r\n if n % i== 0:\r\n lucky = True\r\n break\r\n\r\nif lucky:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input());print([\"YES\",\"NO\"][all(n%i for i in[4,7,47,477])])", "SC = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nn = int(input())\r\npsc = False\r\nfor sc in SC:\r\n if n % sc == 0:\r\n psc = True\r\n break\r\nprint([\"NO\", \"YES\"][psc])\r\n\r\n", "#https://codeforces.com/problemset/problem/122/A\r\n\r\ndef get_luckyNumberList():\r\n return [\"4\", \"7\"]\r\n\r\ndef is_luckyNumber(number):\r\n luckyNumberList = get_luckyNumberList()\r\n for value in str(number):\r\n if value not in luckyNumberList:\r\n return False\r\n return True\r\n\r\ndef almost_lucky(number):\r\n for value in range(1, number + 1):\r\n if number % value == 0:\r\n if(is_luckyNumber(value)):\r\n return True\r\n return False\r\n\r\nnumber = int(input())\r\nif(almost_lucky(number)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def divide(n,lucky_numbers,s=0):\r\n for lucky_number in lucky_numbers:\r\n if n%lucky_number==0:\r\n print('YES')\r\n break\r\n else:\r\n s+=1\r\n if s==14:\r\n print('NO')\r\n\r\nn=int(input())\r\nlucky_numbers=[4,7,44,77,47,74,444,777,447,474,744,477,747,774]\r\noutcome=divide(n,lucky_numbers)\r\n\r\n\r\n \r\n \r\n \r\n", "a = input()\r\n\r\nb = set(list(a))\r\ns = 0\r\nc = [4, 774, 7, 744, 777, 74, 747, 44, 77, 47, 474, 444, 477, 447]\r\n\r\nfor i in c:\r\n if int(a) % i == 0:\r\n print('YES')\r\n break\r\nelse:\r\n for i in b:\r\n if int(i) == 4 or int(i) == 7:\r\n s += 1\r\n if s == len(b):\r\n print('YES')\r\n else:\r\n print('NO')\n# Thu Jul 06 2023 10:39:14 GMT+0300 (Moscow Standard Time)\n", "w = int(input())\r\nl = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\ns = 0\r\nfor i in l:\r\n if w % i == 0:\r\n s = 1\r\nif s == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = int(input())\r\nb = [4,7,47,477]\r\nfor i in b:\r\n if a % i == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 6 21:43:45 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\ndef islucky(k):\r\n for l in str(k):\r\n if not(l == \"4\" or l == \"7\"):\r\n return False\r\n return True\r\n\r\nans = False\r\nnum = int(input())\r\nfor i in range(num):\r\n if num % (i + 1) == 0:\r\n if islucky(num // (i+1)):\r\n ans = True\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nlucky_num = []\r\nfor i in range(1,1000):\r\n count_4_7 = str(i).count('4') + str(i).count('7')\r\n count_no_4_7_a1 = str(i).count('0') + str(i).count('1') + str(i).count('2') + str(i).count('3')\r\n count_no_4_7_a2 = str(i).count('5') + str(i).count('6') + str(i).count('8') + str(i).count('9')\r\n if count_4_7 != 0 and count_no_4_7_a1 + count_no_4_7_a2 == 0:\r\n lucky_num.append(i)\r\n\r\nx = 'NO'\r\nfor j in lucky_num:\r\n if n % j == 0:\r\n x = 'YES'\r\n break\r\n\r\nprint(x)", "a = int(input())\r\n\r\nif (a % 4 == 0) or (a % 7 == 0) or (a % 47 == 0) or (a % 74 == 0) or (a % 477 == 0) or (a % 774 == 0) or (\r\n a % 474 == 0) or (a % 747 == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "lu=int(input())\r\nif (lu%4==0 or lu%7==0 or lu%47==0 or lu%74==0 or lu%444==0 or lu%447==0 or lu%474==0 or lu%744==0 or lu%477==0 or lu%747==0 or lu%777==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nn=int(input())\r\nfor i in l:\r\n if n%i==0:\r\n print(\"YES\")\r\n break\r\nelse:print(\"NO\")\r\n", "s = input()\r\nt = int(s)\r\n\r\ndef generate_numbers(n, digits, current_number=[]): #basically getting lucky numbers btw 0 and s \r\n if n == 0:\r\n return [int(\"\".join(map(str, current_number)))]\r\n numbers = []\r\n while n != 0:\r\n for digit in digits:\r\n numbers.extend(generate_numbers(n - 1, digits, current_number + [digit]))\r\n n -= 1\r\n return numbers\r\n \r\n\r\ndigits = [4,7] \r\nn = len(s)\r\nresult = generate_numbers(n, digits)\r\nkek = list(sorted(set(result)))\r\n\r\nfor k in kek:\r\n if t % k == 0:\r\n print('YES')\r\n quit()\r\nelse:\r\n print('NO')\r\n\r\n# i = 0\r\n# while i != len(kek):\r\n# if kek[i] > t:\r\n# kek.pop(i)\r\n# i += 1\r\n# print(kek) #is not functioning properly (works for every alternate case)\r\n\r\n#remaining steps is to get the apt list of lucky nos btw 0 and s then dividing them with s to get if s is almost lucky (hard part is almost done)\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 is_lucky(n):\r\n while n > 0:\r\n digit = n % 10\r\n if digit != 4 and digit != 7:\r\n return False\r\n n //= 10\r\n return True\r\nt = int(input())\r\nfor i in range(1, t+1):\r\n if t % i == 0 and is_lucky(i):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "def LuckyDivision():\r\n firstInput = int(input())\r\n i = 1\r\n nothing = False\r\n luckyNum = False\r\n while (i < 1000):\r\n splitI = list(str(i))\r\n if (\"0\" in splitI or \"1\" in splitI or \"2\" in splitI or \"3\" in splitI or \"5\" in splitI or \"6\" in splitI or \"8\" in splitI or \"9\" in splitI):\r\n #do Nothing\r\n nothing = True\r\n else:\r\n if (firstInput % i == 0):\r\n luckyNum = True\r\n break\r\n i += 1\r\n if (luckyNum == True):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nLuckyDivision()", "def ans(a):\n length=len(a)\n j=0\n answer = None\n while j<length:\n if a[j]==\"4\" or a[j]==\"7\":\n answer = True\n else :\n answer = False\n return answer\n j+=1\n return answer\ndef resu():\n i=1\n res=False\n while i<int(a):\n if int(a)%i == 0 and ans(str(i)):\n res=True\n i+=1\n return res\na=input()\nif ans(a):\n print(\"YES\")\nelif int(a)% 4 == 0 or int(a)%7==0:\n print(\"YES\")\nelif resu():\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = input()\r\ncnt = n.count('4') + n.count('7')\r\nflag = 0\r\nif cnt == len(n):\r\n print('YES')\r\nelse:\r\n num = int(n)\r\n lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n for i in lucky_numbers:\r\n if num % i == 0:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')", "n = input()\r\nlength = len(n)\r\nis_almost_lucky = 0\r\n\r\nfor i in range(length) :\r\n if n[i] == '4' or n[i] == '7':\r\n is_almost_lucky = 1\r\n else:\r\n is_almost_lucky = 0\r\n break\r\n# print(is_almost_lucky)\r\nif int(n) % 4 == 0 or int(n) % 7 == 0 or int(n) % 44 == 0 or int(n) % 47 == 0 or int(n) % 74 == 0:\r\n is_almost_lucky = 1\r\nelif int(n) % 77 == 0 or int(n) % 444 == 0 or int(n) % 447 == 0 or int(n) % 474 == 0 or int(n) % 477 == 0:\r\n is_almost_lucky = 1\r\nelif int(n) % 744 == 0 or int(n) % 747 == 0 or int(n) % 774 == 0 or int(n) % 777 == 0:\r\n is_almost_lucky = 1\r\nif is_almost_lucky == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\nif n % 4 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 7 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 47 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 74 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 77 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 44 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 444 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 447 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 474 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 744 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 774 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 747 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 477 == 0:\r\n almost_lucky = True\r\n\r\nelif n % 777 == 0:\r\n almost_lucky = True\r\nelse:\r\n almost_lucky = False\r\n\r\nif almost_lucky == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "def lucky(n):\r\n while n != 0:\r\n if n % 10 != 4 and n % 10 != 7:\r\n return False\r\n n //= 10\r\n return True\r\n\r\ndef almost_lucky(n):\r\n if lucky(n):\r\n return True\r\n\r\n for i in range(2, int(n**0.5) + 1):\r\n if n % i == 0 and (lucky(i) or lucky(n // i)):\r\n return True\r\n\r\n return False\r\n\r\nn = int(input())\r\nif almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from math import *\r\nfrom sys import *\r\nfrom itertools import *\r\n\r\nn = int(input())\r\nt = 0\r\nfor i in [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]:\r\n if n % i == 0:\r\n t = 1\r\nprint([\"NO\", \"YES\"][t])", "n=int(input())\r\n\r\nluckynums = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nlucky = False\r\n\r\nfor i in range(len(luckynums)):\r\n if n%luckynums[i] == 0:\r\n lucky = True\r\n break\r\n\r\nif lucky:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ni = 4\r\nj = 7\r\nk = 4\r\nl = 7\r\ncount = 0\r\nwhile i <= n or j <= n or k <= n or l <= n:\r\n if n % i == 0 or n % j == 0 or n % k == 0 or n % l == 0:\r\n count = 1\r\n i = (i * 10) + 7\r\n j = (j * 10) + 4\r\n k = (k * 10) + 4\r\n l = (l * 10) + 4\r\n\r\nif count == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=['4','7']\r\na=False\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n lucky=True\r\n for d in str(i):\r\n if d not in l:\r\n lucky=False\r\n break\r\n if lucky:\r\n a=True\r\n break\r\nif a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import sqrt\r\n\r\n\r\nn = int(input())\r\nsqrt_n = int(sqrt(n)) + 2\r\nfound = False\r\nfor i in range(1, sqrt_n):\r\n if n % i == 0:\r\n for j in str(i):\r\n if j != '4' and j != '7':\r\n found = False\r\n break\r\n found = True\r\n if found:\r\n print('YES')\r\n exit()\r\n for j in str(n // i):\r\n if j != '4' and j != '7':\r\n found = False\r\n break\r\n found = True\r\n if found:\r\n print('YES')\r\n exit()\r\nprint('NO')", "number = int(input())\r\nif (number % 4 == 0) or (number % 7 == 0) or (number % 47 == 0) or (number % 477 == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "def check(x):\r\n x = str(x)\r\n for i in x:\r\n if i not in ['4', '7']:\r\n return False \r\n return True\r\n \r\nn = int(input())\r\ni = 1\r\nwhile i * i <= n:\r\n if n % i == 0:\r\n if check(i) or check(n // i):\r\n exit(print('YES'))\r\n i += 1\r\nprint('NO')", "a=int(input())\nq='NO'\nfor i in range(1,a+1):\n i=str(i)\n if i.count('4')+i.count('7')==len(i):\n if a%int(i)==0:\n q='YES'\nprint(q)\n# Thu Jul 06 2023 15:05:57 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\nl = [4,44,444,7,7,777,47,74,447,474,744,477,774,747]\r\nfor i in l:\r\n if n%i == 0:\r\n print(\"YES\")\r\n n = 0\r\n break\r\nif n == 0:\r\n pass\r\nelse:\r\n print(\"NO\")", "x = int(input())\n\nif x%4==0 or x%7==0 or x%44==0 or x%47==0 or x%74==0 or x%77==0 or x%444==0 or x%447==0 or x%474==0 or x%477==0 or x%744==0 or x%747==0 or x%774==0 or x%777==0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t\t\t \t\t \t\t\t", "def lucky_num():\r\n l, n = 1, 1\r\n while True:\r\n yield int(bin(n)[2:].replace('1', '4').replace('0', '7').rjust(l, '7'))\r\n n -= 1\r\n if n == -1:\r\n l += 1\r\n n = int('1' * l, 2)\r\n\r\n\r\nlucky_num = lucky_num()\r\nn = int(input())\r\nln = next(lucky_num)\r\nwhile ln <= n:\r\n if n % ln == 0:\r\n print('YES')\r\n break\r\n ln = next(lucky_num)\r\nelse:\r\n print('NO')", "#筛选1000内的lucky number\r\nlucky = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nn = int(input())\r\nfor i in range(len(lucky)):\r\n if n % lucky[i] == 0:\r\n print(\"YES\")\r\n break\r\n elif i == len(lucky)-1:\r\n print(\"NO\")", "a = input()\nb = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\nd = 0\nfor i in range(len(b)):\n if int(a) % b[i] == 0:\n d = 1\n break\nif d == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n# Thu Jul 06 2023 14:22:34 GMT+0300 (Moscow Standard Time)\n", "value = int(input())\r\nif value % 4 == 0 or value % 7 == 0 or value % 47 == 0 or value % 447 == 0 or value % 477 == 0 or value % 747 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\n\nok = 0\nfor i in range(1 , n+1) :\n x = i\n while x > 0:\n if x % 10 != 4 and x % 10 != 7:\n break\n else:\n x /= 10\n x = int(x)\n\n if x == 0:\n if n%i == 0 :\n print(\"YES\")\n ok = 1\n break\n\nif ok == 0:\n print(\"NO\")\n \t \t \t\t\t \t \t \t \t\t\t \t \t\t", "n=int(input())\r\na=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nf=1\r\nfor i in a:\r\n if not n%i:\r\n print('YES')\r\n f=0\r\n break\r\nif f:\r\n print('NO')", "def is_lucky(n):\r\n if all(digit in \"47\" for digit in str(n)):\r\n return True\r\n lucky_numbers = ['4', '7', '44', '77', '47', '74']\r\n for luck_number in lucky_numbers:\r\n if int(n) % int(luck_number) == 0:\r\n return True\r\n return False\r\nn = int(input())\r\nif is_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ni = 4\r\ndef con(a):\r\n for i in a:\r\n if i == '4' or i == '7':\r\n continue\r\n else:\r\n return False\r\n return True\r\nvid = 'NO'\r\nwhile i<=n:\r\n if con(str(i)) and n%i == 0:\r\n vid = 'YES'\r\n break\r\n i += 1\r\nprint(vid)\r\n \r\n", "def f(s: str):\r\n p = s.count('4')+s.count('7')\r\n return (len(s) == p)\r\n\r\nn = input()\r\np = n.count('4')+n.count('7')\r\nif (p == len(n)):\r\n print(\"YES\")\r\nelse:\r\n n = int(n)\r\n #print(f(\"47\"))\r\n for i in range(1, 1000):\r\n if f(str(i)) and n % i == 0:\r\n print(\"YES\")\r\n break\r\n else:\r\n print('NO')", "s=input()\r\nc=0\r\nfor i in s:\r\n if i=='4' or i=='7':\r\n c+=1\r\nl=[4,7,47,74,447,444,474,744,747,774,477]\r\nd=0\r\nfor j in l:\r\n if int(s)>j:\r\n if int(s)%j==0:\r\n d+=1\r\nif d!=0 or c==len(s):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# Lucky Divition\r\nn = int(input())\r\nLuckNumberList = [4, 774, 7, 744, 777, 74, 747, 44, 77, 47, 474, 444, 477, 447]\r\nAlmostLucky = False\r\nfor x in LuckNumberList:\r\n if n % x == 0:\r\n AlmostLucky = True\r\n break\r\n else:\r\n AlmostLucky = False\r\nif AlmostLucky:\r\n print('YES')\r\nelse:\r\n print('NO')", "def is_lucky(num):\r\n lucky_numbers = [4, 7, 47, 74, 447, 474, 477, 744, 747, 774]\r\n\r\n for lucky in lucky_numbers:\r\n if num % lucky == 0:\r\n return True\r\n\r\n return False\r\n\r\ndef lucky_division(n):\r\n if is_lucky(n):\r\n print(\"YES\")\r\n else:\r\n for i in range(1, n // 2 + 1):\r\n if n % i == 0 and is_lucky(i):\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n lucky_division(n)\r\n", "n = int(input())\r\n\r\nans = \"NO\"\r\nfor i in range(1, n+1):\r\n if n%i == 0:\r\n if i in [4, 7, 44, 47, 74, 77, 444, 447, 474, 744, 747, 477, 774, 777]:\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)", "n = int(input())\r\nshas = [4, 7, 47, 44, 77, 74, 447, 474, 444, 477, 744, 747, 774, 777]\r\nf = False\r\nfor i in shas:\r\n if n % i == 0:\r\n f = True\r\n break\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import itertools\r\nn = int(input())\r\ns = itertools.product([\"4\", \"7\", \"0\"], repeat=4)\r\nfor i in s:\r\n i = ''.join(i)\r\n i = i.replace('0', '')\r\n if i != '' and n % int(i) == 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "lucky = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n \r\nnum = int(input())\r\nfor l in lucky:\r\n if num % l == 0:\r\n print (\"YES\")\r\n exit()\r\n \r\nprint (\"NO\") \r\nexit()", "mas=[4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\na=int(input())\r\nc=0\r\nfor i in mas:\r\n if a%i==0:\r\n c=1\r\n\r\nif c==1:\r\n print('YES')\r\n\r\nelse:\r\n print('NO')", "s=int(input())\r\na=[4,7,47,74,44,77,777,444,747,774,474,447,744,477]\r\nans='NO'\r\nfor i in a:\r\n if s>=i and s%i==0:\r\n ans='YES';break\r\nprint(ans)", "def is_lucky_number(number):\r\n lucky_digits = set(['4', '7'])\r\n for digit in str(number):\r\n if digit not in lucky_digits:\r\n return False\r\n return True\r\n\r\ndef is_almost_lucky(number):\r\n for i in range(1, number + 1):\r\n if number % i == 0 and is_lucky_number(i):\r\n return True\r\n return False\r\n\r\n# Read input\r\nn = int(input())\r\n\r\n# Check if n is almost lucky\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ndef l(o):\r\n y = str(o)\r\n for i in range(len(y)):\r\n if not y[i] in [\"4\", \"7\"]:\r\n return False\r\n return True\r\ndef Sol():\r\n for i in range(1, n+1):\r\n if n % i == 0 and l(i):\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\nSol()\r\n", "l = int(input())\r\nn = [4,7,44,47,74,77,444,447,474,477,744,774,777]\r\nj = 0\r\nfor i in n:\r\n if l % i == 0:\r\n print(\"YES\")\r\n j = 1\r\n break\r\nif j == 0:\r\n print(\"NO\")\r\n", "n = int(input())\r\ndef lucky(x):\r\n luckydigits=[4,7]\r\n for digit in str(x):\r\n if int(digit) not in luckydigits:\r\n return False\r\n return True\r\nfor i in range(1,n+1):\r\n if n%i==0 and lucky(i):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\ndef iy(num):\r\n ls = [4, 7]\r\n for digit in str(num):\r\n if int(digit) not in ls:\r\n return False\r\n return True\r\n\r\ndef iay(num):\r\n for i in range(1, num + 1):\r\n if num % i == 0 and iy(i):\r\n return True\r\n return False\r\n\r\nif iay(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nn = int(input())\r\nans = 'NO'\r\nfor i in a:\r\n if n % i == 0:\r\n ans = 'YES'\r\n break\r\nprint(ans)\r\n", "\r\nn = int(input().strip())\r\ndef is_lucky(number):\r\n lucky_digits = {4, 7}\r\n while number > 0:\r\n digit = number % 10\r\n if digit not in lucky_digits:\r\n return False\r\n number //= 10\r\n return True\r\nfor i in range(1, n + 1):\r\n if n % i == 0 and is_lucky(i):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nnums = (4,7,47,744,477)\r\nprint(['YES','NO'][all(n%i for i in nums)])", "def is_lucky(num):\r\n return all(digit == '4' or digit == '7' for digit in str(num))\r\n\r\ndef is_almost_lucky(n):\r\n for i in range(1, n+1):\r\n if n % i == 0 and is_lucky(i):\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nn = int(input())\r\nprint(is_almost_lucky(n))\r\n", "s=input()\r\nn=int(s)\r\ni=0\r\nc=0\r\nwhile i<len(s):\r\n if s[i]!=\"4\" and s[i]!=\"7\":\r\n c+=1\r\n i+=1\r\n\r\nif c==0:\r\n print (\"YES\")\r\nelse :\r\n if (n%4==0 or n%7==0 or n%44==0 or n%47==0 or n%77==0 or n%444==0 or n%447==0 or n%477==0 or n%474==0):\r\n print(\"YES\")\r\n else :\r\n print (\"NO\")", "import math\n\nn = int(input())\n\ndef isLuckyNumber(number):\n while number > 0:\n rest = number % 10\n if rest != 4 and rest != 7: return False\n number //= 10\n return True\n\n# def generate_lucky_numbers(n, i = 0, perm = [], ):\n# if i == n:\n# return perm\n# for v in [4, 7]:\n# perm.extend(generate_lucky_numbers(n, i + 1, perm))\n# return perm\n\ndef generate_lucky_numbers(n):\n return [i for i in reversed(range(4, n)) if isLuckyNumber(i)]\n\n \nif isLuckyNumber(n): print('YES')\nelse:\n if n % 4 == 0 or n % 7 == 0: print('YES')\n else:\n lucky_numbers = generate_lucky_numbers(n)\n answer = \"YES\" if any(n % x == 0 for x in lucky_numbers) else \"NO\"\n print(answer)", "lucky_numbers = []\r\ncount = 0\r\nfor i in range(778):\r\n i = str(i)\r\n for e in i:\r\n if e != '7' and e != '4':\r\n count = 1\r\n if count == 0:\r\n lucky_numbers.append(int(i))\r\n else:\r\n count = 0\r\nnumber = int(input())\r\njudge = 0\r\nfor i in lucky_numbers:\r\n if i <= number and number % i == 0:\r\n judge = 1\r\nif judge == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "import itertools\n\ndef almostLucky(number):\n luckyNumber = [4, 7, 47, 74, 447, 477, 744, 774, 747, 474]\n for x in luckyNumber:\n if int(number)%x == 0:\n return \"YES\"\n return \"NO\"\n \n \n\ndef main():\n number = input()\n print(almostLucky(number))\n \n\nif __name__ == \"__main__\":\n main()", "ln = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777, 4444]\r\nn = int(input())\r\nif n in ln:\r\n print(\"YES\")\r\nelse:\r\n flag = 0\r\n for i in ln:\r\n if n % i == 0:\r\n print(\"YES\")\r\n break\r\n else:\r\n flag += 1\r\n if flag == len(ln):\r\n print(\"NO\")\r\n#veeras code ", "n = int(input())\nspis = [4, 7, 44, 47, 77, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\nflag = True\nfor i in spis:\n if n % i == 0:\n print(\"YES\")\n flag = False\n break\n else:\n continue\nif flag:\n print(\"NO\")\n", "sayi=int(input(\"\"));\r\nfor i in range(1,sayi+1):\r\n if sayi%i==0:\r\n d=i\r\n stop=0\r\n deg=0\r\n for i in str(d):\r\n #print(i)\r\n if i=='4' or i=='7':\r\n deg+=1\r\n if deg==len(str(d)):\r\n stop=1\r\n print(\"YES\")\r\n break\r\nif stop==0:\r\n print(\"NO\")", "n=int(input())\r\nlist1=[4,7,44,47,74,77,444,447,474,744,477,747,774,777]\r\nfor i in list1:\r\n if n%i==0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "e = [4,7,44,47,77,444,447,474,774,747,477,744]\r\nt = int(input())\r\ng = False\r\nfor i in e:\r\n if t % i == 0:\r\n g = True\r\n else:\r\n continue\r\nif g == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=int(input())\r\nif(x%4==0 or x%7==0 or x==47 or x==477 or x==799 or x==94 or x==141):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nif(a%4==0)or(a%7==0)or(a%47==0)or(a%74==0)or(a%447==0)or(a%474==0)or(a%477==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nv=[]\r\ndef gen(l=0):\r\n if l > 100000:\r\n\r\n return\r\n v.append(l)\r\n gen(l*10+4)\r\n gen(l*10+7)\r\ngen()\r\nv.sort()\r\nv.pop(0)\r\nfor i in v:\r\n if n%i==0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "a = [4, 7, 44, 47 ,74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nn = int(input())\r\nfor i in a:\r\n if n%i==0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\n# Thu Jul 06 2023 11:11:47 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nk=0\r\na=[4,7,47,44,77,74,444,447,474,774,777,747,477,744]\r\nfor i in range(14):\r\n if n%a[i]==0:\r\n print(\"YES\")\r\n k=1\r\n break\r\nif k==0:\r\n print(\"NO\")", "def happy(num):\r\n return str(num).count('4') + str(num).count('7') == len(str(num))\r\n\r\nn = int(input())\r\ntest = 0\r\n\r\nfor i in range(1, n+1):\r\n if happy(i) and n % i == 0:\r\n test += 1\r\n\r\nif test > 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "number = int(input())\r\nnew_number = number\r\nvalue = False\r\nset_value = {47,74,474,477,444,447,747,744,777}\r\nif number%4==0 or number%7==0:\r\n value = True\r\nelif True:\r\n for i in set_value:\r\n if number%i ==0:\r\n value =True\r\n break\r\nif value:\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "def find_dividers(number):\r\n dividers = []\r\n for i in range(1, int(number ** 0.5) + 1):\r\n if number % i == 0:\r\n dividers.append(i)\r\n dividers.append(number // i)\r\n return sorted(dividers)\r\n\r\n\r\nn = int(input())\r\ndividers = find_dividers(n)\r\nres = []\r\nfor divider in dividers:\r\n right = True\r\n for digit in str(divider):\r\n if not (digit == '4' or digit == '7'):\r\n right = False\r\n if right:\r\n res.append(divider)\r\nif res:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\n\r\n\r\ndef Check_Lucky_Number(x):\r\n check = True\r\n while x > 0:\r\n if x % 10 != 4 and x % 10 != 7:\r\n check = False\r\n break\r\n x = x // 10\r\n return check\r\n\r\n\r\nres = \"NO\"\r\n\r\nif Check_Lucky_Number(n):\r\n res = \"YES\"\r\nelse:\r\n for i in range(4, n + 1):\r\n if n % i == 0 and Check_Lucky_Number(i):\r\n res = \"YES\"\r\n break\r\n\r\nprint(res)\r\n", "n=int(input())\r\n\r\ndef luckyDivision(n):\r\n \r\n first_test=0\r\n for number in str(n):\r\n if number !='4' and number !='7':\r\n first_test=1\r\n if not first_test:\r\n print('YES')\r\n return True\r\n \r\n num=4\r\n while num<=777:\r\n \r\n flag=0\r\n for i in str(num):\r\n if i!='4' and i!='7':\r\n flag=1 \r\n if not flag and n%num==0:\r\n print('YES')\r\n return True\r\n \r\n num+=1\r\n print('NO')\r\n \r\n \r\nluckyDivision(n)", "num = int(input())\r\n\r\ndef ishappy(num):\r\n for i in str(num):\r\n if i not in '47':\r\n return False\r\n else:\r\n return True\r\n \r\n\r\nfor i in range(1, num + 1):\r\n if ishappy(i) and not num % i:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n ", "import math\r\nn=int(input())\r\nfactor=[]\r\nfor i in range(1,math.ceil(math.sqrt(n))+1):\r\n if n%i==0:\r\n factor.append(i)\r\n factor.append((n//i))\r\nfor j in factor:\r\n if all([x in ['4','7'] for x in list(str(j))]):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "def is_lucky(num):\r\n lucky_numbers = [4, 7, 47, 74, 447, 474, 477, 744, 747, 774]\r\n\r\n for lucky in lucky_numbers:\r\n if num % lucky == 0:\r\n return True\r\n\r\n return False\r\nn = int(input())\r\nw = '47'\r\ncheck = 0\r\nfor i in str(n):\r\n if is_lucky(n):\r\n print(\"YES\") \r\n break\r\n elif i not in w:\r\n print('NO')\r\n break\r\n else:\r\n check += 1\r\n\r\nif check == len(str(n)):\r\n print('YES')", "n = int(input())\r\nlist_ln = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nj = 0\r\nfor i in range(13):\r\n if n % list_ln[i] == 0:\r\n j = 1\r\n break\r\nif j == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "# LUOGU_RID: 122345353\nif int(input())in[4,7,8,12,14,16,20,21,24,28,32,35,36,40,42,44,47,48,49,52,56,60,63,64,68,70,72,74,76,77,80,84,88,91,92,94,96,98,100,104,105,108,112,116,119,120,124,126,128,132,133,136,140,141,144,147,148,152,154,156,160,161,164,168,172,175,176,180,182,184,188,189,192,196,200,203,204,208,210,212,216,217,220,222,224,228,231,232,235,236,238,240,244,245,248,252,256,259,260,264,266,268,272,273,276,280,282,284,287,288,292,294,296,300,301,304,308,312,315,316,320,322,324,328,329,332,336,340,343,344,348,350,352,356,357,360,364,368,370,371,372,376,378,380,384,385,388,392,396,399,400,404,406,408,412,413,416,420,423,424,427,428,432,434,436,440,441,444,447,448,452,455,456,460,462,464,468,469,470,472,474,476,477,480,483,484,488,490,492,496,497,500,504,508,511,512,516,517,518,520,524,525,528,532,536,539,540,544,546,548,552,553,556,560,564,567,568,572,574,576,580,581,584,588,592,595,596,600,602,604,608,609,611,612,616,620,623,624,628,630,632,636,637,640,644,648,651,652,656,658,660,664,665,666,668,672,676,679,680,684,686,688,692,693,696,700,704,705,707,708,712,714,716,720,721,724,728,732,735,736,740,742,744,747,748,749,752,756,760,763,764,768,770,772,774,776,777,780,784,788,791,792,796,798,799,800,804,805,808,812,814,816,819,820,824,826,828,832,833,836,840,844,846,847,848,852,854,856,860,861,864,868,872,875,876,880,882,884,888,889,892,893,894,896,900,903,904,908,910,912,916,917,920,924,928,931,932,936,938,940,944,945,948,952,954,956,959,960,962,964,966,968,972,973,976,980,984,987,988,992,994,996,1000]:print('YES')\nelse:print('NO')", "# Read the input\r\nz = int(input().strip())\r\n\r\n# Define a function to check if a number is lucky\r\ndef is_lucky(x):\r\n return all(digit in '47' for digit in str(x))\r\n\r\n# Check if n is almost lucky by checking if it's divisible by a lucky number\r\nfor i in range(1, z + 1):\r\n if z % i == 0 and is_lucky(i):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "l = [4,7,47,74,444,447,474,477,744,747,777]\nn = int(input())\nfor i in l:\n if n >= i and n%i == 0:\n print(\"YES\")\n exit()\nprint(\"NO\")\n# Fri Jul 07 2023 15:14:36 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\nnums = [4, 7, 47, 74, 474, 477, 444]\ns = \"NO\"\nfor i in nums:\n\tif n%i == 0:\n\t\ts = \"YES\"\n\nprint(s)", "def is_lucky(num):\r\n lucky_digits = {'4', '7'}\r\n while num > 0:\r\n digit = num % 10\r\n if str(digit) not in lucky_digits:\r\n return False\r\n num //= 10\r\n return True\r\n\r\nn = int(input())\r\nalmost_lucky = False\r\n\r\nfor lucky_num in range(1, n + 1):\r\n if is_lucky(lucky_num) and n % lucky_num == 0:\r\n almost_lucky = True\r\n break\r\n\r\nif almost_lucky:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=int(input())\r\nf=0\r\nq=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nfor x in q:\r\n if a%x==0:\r\n print('YES')\r\n f=1\r\n break\r\nif f==0:\r\n print('NO')", "a = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nz = len(a)\r\ns = int(input())\r\nm = 0\r\nfor x in a:\r\n if s % x == 0:\r\n m = 1\r\n break\r\nif m == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#from collections import Counter\r\nimport math\r\ncount_time=0\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n\r\n'''\r\nt=int(input())\r\nans=list()\r\n\r\nfor _ in range(t):\r\n l,t=map(int,input().split())\r\n \r\nprint(*ans,sep='\\n')'''\r\nA=[]\r\nn=int(input())\r\ndef create(s,l):\r\n global A\r\n if not l:return None\r\n e=int(s+'4')\r\n if e<=n:A.append(e)\r\n create(s+'4',l-1)\r\n e=int(s+'7')\r\n if e<=n:A.append(e)\r\n create(s+'7',l-1)\r\ncreate('',len(str(n)))\r\nfor i in A:\r\n if not n%i:\r\n print('YES')\r\n break\r\nelse:print('NO')\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\r\n", "n = int(input())\r\nfor i in range(2, n + 1):\r\n yes = True\r\n for j in str(i):\r\n if j in '12356890':\r\n yes = False\r\n if n % i == 0 and yes:\r\n print(\"YES\")\r\n exit(0)\r\n\r\nprint('NO')\r\n", "n=int(input())\r\nx=0\r\na=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nfor i in range(len(a)):\r\n if n % a[i]==0:\r\n x=1 \r\nif x==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n = int(input())\n lucky_numbers = [4, 7, 44, 47, 74, 77,\n 444, 447, 474, 477, 744, 747, 774, 777]\n for lucky_number in lucky_numbers:\n if n % lucky_number == 0:\n print(\"YES\")\n return\n print(\"NO\")\n\n\nif __name__ == \"__main__\":\n main()\n", "arr=[4,7,44,47,74,77,444,447,474,744,774,747,477,777]\r\nn=int(input())\r\nflag=0\r\nfor i in range(0,len(arr),1):\r\n if n%arr[i]==0:\r\n flag=1\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# @name: A. Lucky Division\r\n# @author: AbrarShakhi\r\n# @link: https://codeforces.com/problemset/problem/122/A\r\n\r\n\r\ndef solution():\r\n n = int(input())\r\n lucky = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n for i in lucky:\r\n if n % i == 0:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n return\r\n# endef\r\n\r\n\r\nclass Console:\r\n def asList(self, func=int, sep=\" \"):\r\n return [func(i) for i in input().split(sep)]\r\n\r\n def asIter(self, func=int, sep=\" \"):\r\n return map(func, input().split(sep))\r\n\r\n\r\ncin = Console()\r\ntc = 1\r\n# tc = int(input())\r\nwhile tc > 0:\r\n solution()\r\n tc -= 1\r\n", "def is_lucky(n):\r\n n_str = str(n)\r\n for digit in n_str:\r\n if digit != '4' and digit != '7':\r\n return False\r\n return True\r\ndef is_almost_lucky(n):\r\n for i in range(1, n+1):\r\n if n % i == 0 and is_lucky(i):\r\n return True\r\n return False\r\nn = int(input())\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "A = [4, 7, 47, 74, 44, 77, 777, 444, 447, 474, 744, 774, 747, 477]\r\nx = int(input())\r\ncount = 0\r\nfor i in A:\r\n if x % i == 0:\r\n count += 1\r\nprint('NO') if count == 0 else print('YES')\r\n\r\n\r\n", "num = int(input())\r\n\r\nluckyNumbers = [4, 7, 47, 74, 44, 77, 444, 447, 474, 477, 777, 774, 747, 744]\r\n\r\nfor n in luckyNumbers:\r\n if num%n == 0:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "def is_lucky(n):\r\n if n==4 or n==7:\r\n return 1\r\n s={'4','7'}\r\n s1=set(str(n))\r\n if s1==s:\r\n return 1\r\n else:\r\n return 0\r\nn=int(input())\r\nf=0\r\nfor i in range(1,n+1):\r\n if n%i==0 and is_lucky(i):\r\n f=1\r\n print(\"YES\")\r\n break\r\nif f==0:\r\n print(\"NO\")", "v = int(input())\r\nlucky = [i for i in range(1, 1001) if set(str(i)) <= set('47')]\r\nif v in lucky or 0 in [v%i for i in lucky]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\n\r\ndef is_lucky(number):\r\n lucky_digits = [4, 7]\r\n for digit in str(number):\r\n if int(digit) not in lucky_digits:\r\n return False\r\n return True\r\n\r\ndef is_almost_lucky(number):\r\n for i in range(1, number+1):\r\n if number % i == 0 and is_lucky(i):\r\n return True\r\n return False\r\n\r\nresult = \"YES\" if is_almost_lucky(n) else \"NO\"\r\nprint(result)\r\n", "def check_lucky(n):\r\n s = str(n)\r\n flag =1\r\n for i in s:\r\n if i!='4' and i != '7':\r\n flag = 0\r\n break\r\n if flag ==1:\r\n return True\r\n else:\r\n return False\r\n\r\nn = int(input())\r\nls=[]\r\nfor i in range(1,n+1):\r\n if check_lucky(i)==True:\r\n ls.append(i)\r\nflag = 0\r\nfor i in ls:\r\n if n%i==0:\r\n flag =1\r\n break\r\nif flag==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\nfor i in range(1,1001):\r\n\r\n if n%i == 0:\r\n result = 1\r\n st = str(i)\r\n for j in range(len(st)):\r\n if (st[j] !='4') and (st[j] !='7'):\r\n result = 0\r\n break\r\n\r\n if result:\r\n break\r\nif result:\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nd=1\r\ndef luck(s):\r\n a=True\r\n while s != 0:\r\n if s % 10 != 7 and s % 10 != 4:\r\n a=False\r\n s //= 10\r\n return a\r\nfor i in range(1,n+1):\r\n x=i\r\n if n%i==0:\r\n if d==1:\r\n if luck(x)==True:\r\n d=0\r\n else:\r\n break\r\nif d==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=[]\r\nfor i in range(4,1000):\r\n if str(i).count('4')+str(i).count('7')==len(str(i)):\r\n l.append(i)\r\nfor i in range(len(l)): \r\n if n%l[i]==0:\r\n print('YES')\r\n break\r\nelse:print(\"NO\")", "def is_lucky(num):\r\n # Check if the number is lucky (contains only 4 and 7)\r\n for digit in str(num):\r\n if digit != '4' and digit != '7':\r\n return False\r\n return True\r\n\r\ndef is_almost_lucky(n):\r\n # Iterate through numbers from 1 to n and check if n is divisible by any lucky number\r\n for i in range(1, n + 1):\r\n if is_lucky(i) and n % i == 0:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\n\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nlucky = [4, 7, 47, 74, 444, 447, 477, 777, 774, 744]\r\na = False\r\nfor i in lucky:\r\n if n % i == 0:\r\n a = True\r\n else:\r\n continue\r\nif a:\r\n print(\"YES\") \r\nelse: \r\n print(\"NO\") ", "n = int(input())\r\nls = [4,7,44,77,47,74,447,474,744,477,774,747,777,444]\r\nt=0\r\nfor i in ls :\r\n if n % i == 0 :\r\n print (\"YES\")\r\n break\r\n t+=1\r\nif t == 14 :\r\n print (\"NO\")", "import math\n\n\ndef check(x):\n s = str(x)\n for i in range (0,len(s)):\n if s[i]!='4' and s[i]!='7':\n return False\n return True\ntest=1\n\nfor t in range(test):\n n = int(input())\n f=False\n for i in range(1,n+1):\n if check(i) and not (n%i):\n f=True\n break\n\n print(\"YES\" if f else \"NO\" )\n\t\t \t\t \t\t \t\t\t\t\t \t\t \t\t \t", "n=int(input())\r\nls=[4,7,44,47,74,77,444,447,477,744,747,777]\r\nfor i in range(len(ls)):\r\n if n % ls[i] ==0:\r\n print('YES')\r\n break\r\nelse:print('NO')", "#https://codeforces.com/problemset/problem/122/A\n\nimport math\n#import numpy as np\n\nif __name__==\"__main__\":\n lucky = [4,7,47,74,77,444,447,474,477,744,747,777]\n n = int(input())\n for x in lucky:\n if (n%x)==0:\n print(\"YES\")\n exit()\n print(\"NO\")\n\n", "def is_lucky(num):\r\n return all(digit in '47' for digit in str(num))\r\n\r\ndef is_almost_lucky(n):\r\n for i in range(1, n + 1):\r\n if is_lucky(i) and n % i == 0:\r\n return True\r\n return False\r\n\r\n# Read the input number\r\nn = int(input().strip())\r\n\r\n# Check if n is almost lucky and print the result\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def is_lucky(num):\r\n # Check if a number is lucky (contains only 4 and/or 7)\r\n lucky_digits = set(['4', '7'])\r\n for digit in str(num):\r\n if digit not in lucky_digits:\r\n return False\r\n return True\r\n\r\ndef is_almost_lucky(num):\r\n # Check if a number is almost lucky (divisible by a lucky number)\r\n for i in range(4, num + 1):\r\n if is_lucky(i) and num % i == 0:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input())\r\nprint('YES' if is_almost_lucky(n) else 'NO')", "import math\r\nn=int(input())\r\nu=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n u.append(i)\r\nu=list(map(str,u))\r\ns=set()\r\ns.add('4')\r\ns.add('7')\r\nf=False\r\nfor i in u:\r\n c=0\r\n for j in i:\r\n if j in s:\r\n c+=1\r\n if c==len(i):\r\n f=True\r\nif f==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n=int(input())\r\nluckyNumbers=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nfor luckyNumber in luckyNumbers:\r\n if n% luckyNumber==0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "n = int(input())\r\n\r\ndef taoso(x):\r\n if int(x) > n:\r\n return False\r\n else:\r\n if x == '0':\r\n x = ''\r\n \r\n if n % int(x+'4') == 0 or n % int(x+'7') == 0:\r\n return True\r\n else:\r\n return taoso(x+'4') or taoso(x+'7')\r\n\r\nkq = taoso('0')\r\n\r\nif kq == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "c=input()\r\na=int(c)\r\nb=0\r\nfor x in c:\r\n if x!='4' and x!='7':\r\n b=1\r\nif b==1:\r\n if a%4==0 or a%7==0 or a%47==0 or a%74==0 or a%474==0 or a%447==0 or \\\r\n a%477==0 or a%744==0 or a%747==0 or a%774==0:\r\n b=0\r\nif b==0:\r\n print('YES')\r\nif b==1:\r\n print('NO')", "n=input()\r\nn1=int(n)\r\na=[]\r\nfor i in n:\r\n a.append(i)\r\nb=list(set(a))\r\nc=sorted(b)\r\nif c==['4', '7']:\r\n print(\"YES\")\r\nelse:\r\n if n1%4==0:\r\n print(\"YES\")\r\n elif n1%7==0:\r\n print(\"YES\")\r\n elif n1%77==0:\r\n print(\"YES\")\r\n elif n1%44==0:\r\n print(\"YES\")\r\n elif n1%444==0:\r\n print(\"YES\")\r\n elif n1%447==0:\r\n print(\"YES\")\r\n elif n1%47==0:\r\n print(\"YES\")\r\n elif n1%74==0:\r\n print(\"YES\")\r\n elif n1%744==0:\r\n print(\"YES\")\r\n elif n1%747==0:\r\n print(\"YES\")\r\n elif n1%774==0:\r\n print(\"YES\")\r\n elif n1%777==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def lucky_number(str):\r\n for char in str:\r\n if char != '4' and char != '7':\r\n return False\r\n return True\r\n\r\n\r\ndef lucky_division(n):\r\n for i in range(n):\r\n if lucky_number(str(i)) and n % i == 0:\r\n return True\r\n\r\n return False\r\n\r\n\r\n\r\ns = int(input())\r\nif lucky_number(str(s)) or lucky_division(s):\r\n print('YES')\r\nelse:\r\n print(\"NO\")", "list1=[4,7,44,77,47,74,444,447,474,744,477,774,747,777]\r\nn = input()\r\nif n.count('4') + n.count('7') == len(n):\r\n print('YES')\r\nelse:\r\n n=int(n)\r\n tag = 'NO'\r\n for i in list1:\r\n if n%i == 0:\r\n tag = 'YES'\r\n break\r\n print(tag)", "l = [4, 7, 47, 74, 474, 477, 747]\r\ns = int(input())\r\nfor i in l:\r\n if s%i==0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\na = int(input())\r\nif 0 < a == int(a):\r\n q = list(str(a))\r\n for el in q:\r\n if el == '4' or el == '7':\r\n continue\r\n else:\r\n if a % 4 == 0 or a % 7 == 0 or a % 47 == 0:\r\n print('YES')\r\n sys.exit()\r\n else:\r\n print('NO')\r\n sys.exit()\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = input()\r\nn = int(s)\r\na = 0\r\nfor i in range(len(s)):\r\n if s[i] == '4' or s[i] == '7':\r\n a += 1\r\nif a == len(s):\r\n print('YES')\r\nelse:\r\n lucky_nums = []\r\n for j in range(1,n):\r\n b = str(j)\r\n c = 0\r\n for k in range(len(b)):\r\n if b[k] == '4' or b[k] =='7':\r\n c += 1\r\n if c == len(b):\r\n lucky_nums.append(j)\r\n \r\n d = 0\r\n for l in lucky_nums:\r\n if n % l == 0:\r\n print(\"YES\")\r\n break\r\n else:\r\n d += 1\r\n if d == len(lucky_nums):\r\n print('NO')\r\n ", "\nlucky = [4,7,47,74,44,77,444,777,447,474,477,774,747,744]\nn = int(input())\nans = \"NO\"\n\nif n in lucky:\n ans=\"YES\"\n\nelse:\n for i in lucky:\n if n%i == 0:\n ans = \"YES\"\nprint(ans)\n\t\t\t \t\t \t \t\t\t \t\t \t \t\t \t", "a = int(input())\r\nprint('YES' if a%4==0 or a%7==0 or a%47 == 0 or a%74==0 or a%444==0 or a%447==0 or a%474==0 or a%477==0 or a%744==0 or a%747==0 or a%774==0 or a%777 ==0 else 'NO')\r\n\r\n", "n=int(input())\r\na=[]\r\nfor i in range(1,n+1):\r\n if n%i==0:\r\n a.append(i)\r\ncheck=0\r\nfor i in a:\r\n s=str(i)\r\n if '1' in s or '2' in s or '3' in s or '5' in s or '6' in s or '8' in s or '9' in s or '0' in s:\r\n continue\r\n else:\r\n check=1\r\nif check==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "ad = str(input())\r\ndef prime_factors(n):\r\n i = 2\r\n factors = []\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.append(i)\r\n if n > 1:\r\n factors.append(n)\r\n return factors\r\ndef checkluck(string):\r\n for i in string:\r\n if i != \"7\" and i != \"4\":\r\n return False\r\n return True\r\n\r\nsuccess = False\r\nk = prime_factors(int(ad))\r\ntarget1 = [2, 2]\r\ntarget2 = [7]\r\n\r\nif checkluck(ad) == True:\r\n success = True\r\nelse:\r\n if 7 in k or k.count(2) > 1:\r\n success = True\r\n for i in k:\r\n if checkluck(str(i)) == True:\r\n success = True\r\nif success == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def generate_numbers(n1):\r\n def generate_helper(n):\r\n if n == 1:\r\n return ['4', '7']\r\n else:\r\n prev_numbers = generate_helper(n - 1)\r\n new_numbers = [number + '4' for number in prev_numbers] + [number + '7' for number in prev_numbers]\r\n return new_numbers\r\n\r\n all_numbers = []\r\n for n in range(1, n1 + 1):\r\n numbers = generate_helper(n)\r\n all_numbers.extend(numbers)\r\n\r\n return all_numbers\r\nn=int(input())\r\nn1=len(str(n))\r\nlist1=generate_numbers(n1)\r\na=0\r\nfor i in list1:\r\n if int(n)%int(i)==0 and a==0:\r\n print(\"YES\")\r\n a=1\r\nif a==0:\r\n print(\"NO\")", "def check(x):\r\n a=True\r\n while x>0:\r\n if x%10!=4 and x%10!=7:\r\n a=False\r\n break\r\n x//=10\r\n return a\r\nn=int(input())\r\nb=False\r\nfor i in range(4,n+1):\r\n if n%i==0 and check(i):\r\n b=True\r\n break\r\nif b:\r\n print('YES')\r\nelse:\r\n print('NO')", "list=[4,44,444,7,77,777,47,74,447,474,477,774,747,744]\r\nT=int(input())\r\nct=1\r\nfor i in list:\r\n if T%i==0:\r\n print(\"YES\")\r\n ct=0\r\n break\r\nif ct==1:\r\n print(\"NO\")\r\n ", "lucky_digits = [\"4\", \"7\"]\r\nn = int(input())\r\n\r\ndef is_lucky(n):\r\n a = 0 \r\n for i in range(1, n + 1):\r\n if n % i == 0 and all(True if d in lucky_digits else False for d in str(i)):\r\n a = a + 1\r\n if a > 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nresult = is_lucky(n)\r\nprint(result)", "n=int(input())\r\nt=n\r\nwhile t!=0:\r\n r=t%10\r\n if r==4 or r==7:\r\n f=1 \r\n else:\r\n f=0\r\n break\r\n t=int(t/10)\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n if n%4==0 or n%7==0 or n%47==0 or n%74==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "n = int(input())\r\n\r\ndef is_lucky(number):\r\n digits = [int(d) for d in str(number)]\r\n if all(d == 4 or d == 7 for d in digits):\r\n return True\r\n else:\r\n return False\r\n\r\nif is_lucky(n) or n % 4 == 0 or n % 7 == 0 or n % 47 == 0 or n % 74 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import exit\r\n\r\n\r\n\r\ndef is_lucky(n) :\r\n n = str(n)\r\n for i in n :\r\n if i != \"4\" and i != \"7\" :\r\n return False\r\n \r\n return True\r\n\r\n\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nfor i in range(n + 1) :\r\n if is_lucky(i) :\r\n if n % i == 0 :\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "def is_lucky(number):\r\n # Function to check if a number is lucky (contains only 4 and 7)\r\n while number > 0:\r\n digit = number % 10\r\n if digit != 4 and digit != 7:\r\n return False\r\n number //= 10\r\n return True\r\n\r\ndef is_almost_lucky(n):\r\n # Function to check if a number is almost lucky\r\n for i in range(1, n + 1):\r\n if n % i == 0 and (is_lucky(i) or is_lucky(n // i)):\r\n return True\r\n return False\r\n\r\n# Read the input\r\nn = int(input())\r\n\r\n# Check if n is almost lucky and print the result\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport re\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef main():\r\n #length = int(input())\r\n n = int(input())\r\n #string = input()\r\n ans = 0\r\n #numbers = [*map(int, input().split())]\r\n lucky = [4,7,44,47,74,77,444,447,474,477,744,747,777]\r\n print([\"NO\",\"YES\"][any(n%i==0 for i in lucky)])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "n=(input())\r\nx=1\r\nfor i in range(len(n)):\r\n if n[i]=='4': \r\n x=x\r\n elif n[i]=='7':\r\n x=x\r\n else:\r\n x=0\r\nif int(n)%4==0 or int(n)%7==0 or int(n)%44==0 or int(n)%47==0 or int(n)%74==0 or int(n)%77==0 or int(n)%444==0 or int(n)%777==0 or int(n)%447==0 or int(n)%474==0 or int(n)%747==0 or int(n)%774==0 or int(n)%744==0:\r\n x=1\r\nif x==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\na=[4,7,44,47,74,77,444,447,474,477,744,747,777]\r\nflag=False\r\nfor i in a:\r\n if n%i==0:\r\n flag=True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "n = int(input())\r\na = []\r\nfor i in range(1, 1001):\r\n k = 0\r\n for j in str(i):\r\n if int(j) in [0, 1, 2, 3, 5, 6, 8, 9]:\r\n k += 1\r\n break\r\n if k == 0:\r\n a.append(i)\r\nfor i in a:\r\n if n % i == 0:\r\n print('YES')\r\n quit()\r\nprint('NO')\r\n", "def ko(num):\r\n lucky_digits = set([4, 7])\r\n while num > 0:\r\n digit = num % 10\r\n if digit not in lucky_digits:\r\n return False\r\n num //= 10\r\n return True\r\n\r\ndef yo(n):\r\n for i in range(1, n + 1):\r\n if n % i == 0 and ko(i):\r\n return \"YES\"\r\n return \"NO\"\r\n \r\nn = int(input())\r\n\r\nprint(yo(n))", "# Function to check if a number is lucky\r\ndef is_lucky(number):\r\n while number > 0:\r\n digit = number % 10\r\n if digit != 4 and digit != 7:\r\n return False\r\n number //= 10\r\n return True\r\n\r\n# Function to find all lucky numbers up to n\r\ndef lucky_numbers_up_to_n(n):\r\n lucky_numbers = []\r\n for i in range(1, n + 1):\r\n if is_lucky(i):\r\n lucky_numbers.append(i)\r\n return lucky_numbers\r\n\r\n# Read the input number\r\nn = int(input())\r\n\r\n# Find lucky numbers up to n\r\nlucky_numbers = lucky_numbers_up_to_n(n)\r\n\r\n# Check if n is almost lucky\r\nfor lucky in lucky_numbers:\r\n if n % lucky == 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nd = [4, 7, 47, 74, 477]\r\nprint(['YES', 'NO'][all(n % i for i in d)])", "n=int(input())\r\nfor i in range(1,1001):\r\n if(str(i).count(\"4\")+str(i).count(\"7\")==len(str(i)) and n%i==0):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def is_almost_lucky(n):\r\n # Check if n is divisible by any lucky number (4, 7, 44, 47, 74, 77, ...)\r\n lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n for lucky in lucky_numbers:\r\n if n % lucky == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\ndef main():\r\n n = int(input())\r\n result = is_almost_lucky(n)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\nlucky = (i for i in range(1, 1001) if all(c in \"47\" for c in str(i)))\nres = \"YES\" if any(n % i == 0 for i in lucky) else \"NO\"\nprint(res)\n", "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\tlucky_num = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n\t\tflag = False\r\n\r\n\t\tfor num in lucky_num:\r\n\t\t\tif n % num == 0:\r\n\t\t\t\tflag = True\r\n\t\t\t\tbreak\r\n\r\n\t\tif flag:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "def main():\r\n lucky_number_list = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n n = int(input())\r\n \r\n for lucky_number in lucky_number_list:\r\n if(n % lucky_number == 0):\r\n print('YES')\r\n return 0\r\n \r\n print('NO')\r\n return 0\r\n\r\nmain()", "user_input = input()\r\n\r\ncount = 0\r\n\r\nfor i in user_input:\r\n if i == \"4\" or i == \"7\":\r\n count += 1\r\nif count == len(user_input):\r\n print(\"YES\")\r\nelif int(user_input) % 4 == 0 or int(user_input) % 7 == 0 or int(user_input) % 47 == 0 or int(user_input) % 447 == 0 or int(user_input) % 474 == 0 or int(user_input) % 477 == 0 or int(user_input) % 747 == 0 or int(user_input) % 774 == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def isLucky(n: int):\r\n lucky = [4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\n\r\n for x in lucky:\r\n if n % x == 0:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input())\r\nprint(\"YES\" if isLucky(n) else \"NO\")", "lucky = []\r\nfor i in range(1000):\r\n j = str(i)\r\n if j.count(\"4\") + j.count(\"7\") == len(j):\r\n lucky.append(i)\r\n\r\nn = int(input())\r\nans = \"NO\"\r\nfor k in lucky:\r\n if n%k==0:\r\n ans = \"YES\"\r\n\r\nprint(ans)\r\n\r\n", "num = int(input())\r\nif num%4==0 or num%7==0 or num%47==0 or num%477==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Aug 9 23:13:35 2023\r\n\r\n@author: dell\r\n\"\"\"\r\n\r\ndef is_lucky(m):\r\n n=str(m)\r\n x=1\r\n for i in range(len(n)):\r\n if n[i]==\"4\" or n[i]==\"7\":\r\n x=x\r\n else:\r\n x=0\r\n return x\r\n \r\nn=int(input())\r\ny=1\r\nfor i in range(1,n+1):\r\n if is_lucky(i)==1:\r\n if n%i==0:\r\n y=y*0\r\nif y==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n ", "n = int(input())\r\nprohib = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\nfor dig in prohib:\r\n if n % dig == 0:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "n = int(input())\nx = 1\nf_count, s_count = 0,0\nwhile n >= x:\n if n%x == 0:\n x_str = str(x)\n x_list = list(x_str) \n f_count = x_list.count('4')\n s_count = x_list.count('7')\n if len(x_list) == f_count+s_count:\n print('YES')\n break; \n x += 1\nelse:\n print('NO') \n ", "n = int(input())\r\nres=False\r\nl=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nfor i in l:\r\n if n%i==0:\r\n res=True\r\n break\r\nif res:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "\r\nn=int(input())\r\n\r\nans=[4, 44, 444, 447, 47, 474, 477, 7, 74, 744, 747, 77, 774, 777]\r\nfor i in range(len(ans)):\r\n if n%ans[i]==0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n = input()\nn = int(n)\nif n == 4:\n print(\"YES\")\nelif n == 7:\n print(\"YES\")\nelif n == 44:\n print(\"YES\")\nelif n == 47:\n print(\"YES\")\nelif n == 74:\n print(\"YES\")\nelif n == 77:\n print(\"YES\")\nelif n == 444:\n print(\"YES\")\nelif n == 447:\n print(\"YES\")\nelif n == 474:\n print(\"YES\")\nelif n == 477:\n print(\"YES\")\nelif n == 744:\n print(\"YES\")\nelif n == 747:\n print(\"YES\")\nelif n == 774:\n print(\"YES\")\nelif n == 777:\n print(\"YES\")\nelif n % 4 == 0:\n print(\"YES\")\nelif n % 7 == 0:\n print(\"YES\")\nelif n % 44 == 0:\n print(\"YES\")\nelif n % 47 == 0:\n print(\"YES\")\nelif n % 74 == 0:\n print(\"YES\")\nelif n % 77 == 0:\n print(\"YES\")\nelif n % 444 == 0:\n print(\"YES\")\nelif n % 447 == 0:\n print(\"YES\")\nelif n % 474 == 0:\n print(\"YES\")\nelif n % 477 == 0:\n print(\"YES\")\nelif n % 744 == 0:\n print(\"YES\")\nelif n % 747 == 0:\n print(\"YES\")\nelif n % 774 == 0:\n print(\"YES\")\nelif n % 777 == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t\t\t \t\t \t\t \t \t\t \t\t \t \t \t", "from sys import stdin;input = lambda: stdin.readline().rstrip('\\r\\n')\r\nn = int(input())\r\nm = [4,7,47,74,477,447,444,777,774,744]\r\nfor e in m:\r\n if n % e == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nln=[4,7,47,74,444,447,474,477,744,747,774,777]\r\nfor i in ln:\r\n if n%i==0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "num=input()\r\nfor i in range(len(num)):\r\n if num[i]!='4' and num[i]!='7':\r\n if int(num)%4==0 or int(num)%7==0 or int(num)%44==0 or int(num)%47==0 or int(num)%74==0 or int(num)%77==0 or int(num)%444==0 or int(num)%447==0 or int(num)%474==0 or int(num)%744==0 or int(num)%477==0 or int(num)%747==0 or int(num)%774==0 or int(num)%777==0: \r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n break\r\n else:\r\n if i==len(num)-1:\r\n print('YES')\r\n break\r\n ", "n=int(input())\r\nif (n%4==0) or (n%7==0) or (n%47==0) or (n%74==0) or n%44==0 or n%77==0 or n%444==0 or n%447==0 or n%474==0 or n%477==0 or n%744==0 or n%747==0 or n%774==0 or n%777==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "n = int(input())\r\ndef lucky(n):\r\n for ch in str(n):\r\n if ch not in '47':\r\n return False\r\n return True\r\nflag = False\r\nfor i in range(4, n+1):\r\n if lucky(i) and n%i==0:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n =int(input())\r\na=set()\r\na.update([4,7])\r\n# print(a)\r\nc=3\r\nb=set()\r\ncount=0\r\nwhile c!=778:\r\n c+=1\r\n x=list(map(int,str(c)))\r\n b.update(x)\r\n if b==a or b<a:\r\n # print(c)\r\n if n % c == 0:\r\n count+=1\r\n x.clear()\r\n b.clear()\r\nif count>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nreq=[4,7,44,47,74,77,444,447,474,477,744,747,774,777]\r\nflag=False\r\nfor i in req:\r\n if not a%i:\r\n flag=True\r\n break\r\nif not flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "num = int(input())\r\n\r\ndef isLucky(n:int):\r\n x = 0\r\n for i in str(n):\r\n if i == '4' or i == '7':\r\n x += 1\r\n if x == len(str(n)):\r\n return True\r\n else:\r\n return False\r\n\r\nx = 0\r\nfor i in str(num):\r\n if i == '4' or i == '7':\r\n x += 1\r\nif x == len(str(num)):\r\n print('YES')\r\nelse:\r\n for i in range(1, num + 1):\r\n if num % i == 0 and isLucky(i) == True:\r\n print('YES')\r\n break\r\n elif i == num:\r\n print('NO')", "s = ['1','2','3','5','6','8','9']\r\nLucky = ['4','7','47','74','447','474','744','477','747']\r\nisLucky = True\r\nn = str(input())\r\nfor letter in n:\r\n if letter in s: isLucky = False\r\nn = int(n)\r\nfor number in Lucky:\r\n if n%int(number) == 0: isLucky = True\r\nif isLucky == True: print(\"YES\")\r\nelse: print(\"NO\")\r\n", "# Function to check if a number is almost lucky\r\ndef is_almost_lucky(number):\r\n lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n for lucky in lucky_numbers:\r\n if number % lucky == 0:\r\n return True\r\n return False\r\n\r\n# Input the number\r\nn = int(input())\r\n\r\n# Check if the number is almost lucky\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nlucky=[4,44,444,7,77,777,47,74,744,474,447,477,747,774]\r\nlucky.sort()\r\nanswer='NO'\r\nif n in lucky:\r\n answer='YES'\r\nelse:\r\n for i in lucky:\r\n if i >= n:\r\n break\r\n else:\r\n if n%i == 0:\r\n answer='YES'\r\n break\r\nprint(answer)", "def is_lucky(number):\r\n lucky_numbers = [4, 7, 44, 47, 74, 77, 444, 447, 474, 477, 744, 747, 774, 777]\r\n for lucky in lucky_numbers:\r\n if number % lucky == 0:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input().strip())\r\nresult = is_lucky(n)\r\nprint(\"YES\" if result else \"NO\")\r\n", "number = int(input())\r\n\r\nlucky_numbers = [4, 7, 47, 74, 444, 447, 474, 744, 477, 747, 774, 777]\r\n\r\nfor lucky_number in lucky_numbers:\r\n if number % lucky_number == 0:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def is_it_happy_number(n):\r\n if (n % 4 == 0) or (n % 7 == 0) or (n % 44 == 0) or (n % 47 == 0) or (n % 74 == 0) or (n % 447 == 0) or (n % 474 == 0) or (n % 477 == 0) or (n % 744 == 0) or (n % 747 == 0) or (n % 774 == 0):\r\n return True\r\n else:\r\n return False\r\nif is_it_happy_number(int(input())):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ns=str(n)\r\nc=0\r\nfor i in s:\r\n if i=='4' or i=='7':\r\n c+=1\r\nl=[4,7,44,47,74,77,444,447,474,744,747,774,777]\r\nd=0\r\nfor i in range(0,len(l)):\r\n if n>l[i]:\r\n if n%l[i]==0:\r\n d+=1\r\nif d!=0 or c==len(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "## 122 - A. Lucky Division\r\n\r\ndef solve(): \r\n n = int(input())\r\n ans = \"NO\"\r\n\r\n for i in range(1, n+1): \r\n if n%i == 0:\r\n digits = str(i)\r\n# print(digits)\r\n \r\n if all(item in '47' for item in digits):\r\n ans = \"YES\"\r\n \r\n print(ans) \r\n \r\n \r\nfor _ in range(1):\r\n solve()", "def is_lucky(num):\r\n # Function to check if a number is lucky or not\r\n while num > 0:\r\n digit = num % 10\r\n if digit != 4 and digit != 7:\r\n return False\r\n num //= 10\r\n return True\r\n\r\ndef is_almost_lucky(n):\r\n # Function to check if a number is almost lucky or not\r\n for i in range(1, n+1):\r\n if is_lucky(i) and n % i == 0:\r\n return True\r\n return False\r\n\r\n# Input number n\r\nn = int(input())\r\n\r\n# Check if the number is almost lucky\r\nif is_almost_lucky(n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nf = 0\r\nfor i in range(4, n+1):\r\n if n % i == 0:\r\n f = 1\r\n for d in range(10):\r\n if d == 4 or d == 7:\r\n pass\r\n elif str(d) in str(i):\r\n f = 0\r\n break\r\n if f == 1:\r\n print('YES')\r\n if f == 1:\r\n break\r\nif f == 0:\r\n print('NO')" ]

[ "def main():\n input()\n s = input()\n ta = t = (s.count('x') - s.count('X')) // 2\n res = []\n if t > 0:\n for c in s:\n if t and c == 'x':\n c = 'X'\n t -= 1\n res.append(c)\n else:\n for c in s:\n if t and c == 'X':\n c = 'x'\n t += 1\n res.append(c)\n print(abs(ta))\n print(''.join(res))\n\n\nif __name__ == '__main__':\n main()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Apr 5 05:45:34 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n\r\n#https://codeforces.com/problemset/problem/424/A --- Alexis Galvan\r\n\r\n\r\ndef hamster_squat():\r\n \r\n total = int(input())\r\n \r\n hamsters = input()\r\n \r\n dic = {'x':0,'X':0}\r\n \r\n for i in range(len(hamsters)):\r\n dic[hamsters[i]] += 1\r\n \r\n if dic['x'] == dic['X']:\r\n print(0)\r\n print(hamsters)\r\n return\r\n \r\n sat = dic['x']\r\n stood = dic['X']\r\n \r\n add_lower = False\r\n if sat < stood:\r\n add_lower = True\r\n \r\n maximum = max(sat, stood)\r\n add = maximum - (int((sat+stood)/2))\r\n print(add)\r\n if add_lower:\r\n output = ''\r\n hamsters = [i for i in hamsters]\r\n for i in range(len(hamsters)):\r\n if add > 0:\r\n if hamsters[i] == 'X':\r\n hamsters[i] = 'x'\r\n add -= 1\r\n \r\n output = output + hamsters[i]\r\n\r\n else:\r\n output = ''\r\n hamsters = [i for i in hamsters]\r\n for i in range(len(hamsters)):\r\n if add > 0:\r\n if hamsters[i] == 'x':\r\n hamsters[i] = 'X'\r\n add -= 1\r\n\r\n output = output + hamsters[i]\r\n\r\n \r\n print(output)\r\n\r\nhamster_squat()\r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n ", "def Squats(n, seq):\r\n\tcntX = seq.count('X')\r\n\tcntx = seq.count('x')\r\n\r\n\tdiffCnt = cntx-cntX\r\n\r\n\tif diffCnt<0:\r\n\t\tresult = seq.replace('X','x',abs(int(n/2) - cntX))\r\n\t\treturn abs(int(n/2) - cntX) , result\r\n\r\n\telif diffCnt>0:\r\n\t\tresult = seq.replace('x','X',abs(int(n/2) - cntX))\r\n\t\treturn abs(int(n/2) - cntX), result\r\n\r\n\telse:\r\n\t\treturn 0, seq\r\n\r\nn = int(input())\r\nseq = input()\r\n\r\nres = Squats(n, seq)\r\nprint(res[0])\r\nprint(res[1])", "n=input()\r\nn=int(n)\r\ny=input()\r\nx_s=0\r\nx_c=0\r\nb=\"\"\r\nfor i in range(n):\r\n if y[i]=='x':\r\n x_s+=1\r\n else:\r\n x_c+=1\r\nif x_s==x_c:\r\n print(0)\r\n for i in y:\r\n print(i ,end=\"\")\r\nif x_s>x_c:\r\n u=n/2-x_c\r\n o=n/2-x_c\r\n while u>0:\r\n for i in range(n):\r\n if y[i]=='x' and not u<1:\r\n b+='X'\r\n u -= 1\r\n else:\r\n b+=y[i]\r\n print(int(o))\r\n for i in b:\r\n print(i, end=\"\")\r\nif x_s<x_c:\r\n u=n/2-x_s\r\n o = n / 2 - x_s\r\n while u>0:\r\n for i in range(n):\r\n if y[i]=='X' and not u<1:\r\n b+='x'\r\n u-=1\r\n else:\r\n b+=y[i]\r\n print(int(o))\r\n for i in b:\r\n print(i, end=\"\")\r\n", "n = int(input())\r\ns = input()\r\nsit = s.count('x')\r\nstand = s.count('X')\r\nprint(abs((n//2)-stand))\r\nif sit == stand:\r\n print(s)\r\nelif sit>stand:\r\n print(s.replace('x','X',(n//2)-stand))\r\nelse:\r\n print(s.replace('X','x',(n//2)-sit))", "n=int(input())\r\na=list(input())\r\nz=a.count('X')\r\np=n//2\r\nprint(abs(p-z))\r\nif z>p:\r\n t=0\r\n for i in range(n):\r\n if t<abs(p-z):\r\n if a[i]=='X':\r\n a[i]='x'\r\n t+=1\r\n else:\r\n break\r\n for i in range(n):\r\n print(a[i],end='')\r\nelif z==p:\r\n for i in range(n):\r\n print(a[i],end='')\r\nelse:\r\n t=0\r\n for i in range(n):\r\n if t<abs(p-z):\r\n if a[i]=='x':\r\n a[i]='X'\r\n t+=1\r\n else:\r\n break\r\n for i in range(n):\r\n print(a[i],end='')\r\n", "ham_count = int(input())\norder = input()\n\nfinal_order = order\n\nsmall_count = 0\n\nbig_count = 0\nfor i in order:\n if i == 'x':\n small_count = small_count + 1\n else:\n big_count = big_count + 1\n\nif small_count > big_count:\n diff = int((small_count - big_count) / 2)\n print(diff)\n for i, index in enumerate(order):\n if diff == 0:\n break\n elif index == 'x':\n final_order = final_order[:i] + 'X' + final_order[i + 1:]\n diff = diff - 1\n print(final_order)\nelif big_count > small_count:\n diff = int((big_count - small_count) / 2)\n print(diff)\n for i, index in enumerate(order):\n if diff == 0:\n break\n elif index == 'X':\n final_order = final_order[:i] + 'x' + final_order[i + 1:]\n diff = diff - 1\n\n print(final_order)\nelse:\n print(0)\n print(order)\n", "ln=int(input())\r\nlis=[]\r\ninp=input()\r\nfor i in inp:\r\n lis.append(i)\r\ns=inp.count('x')\r\nl=inp.count('X')\r\nprint(abs(l-s)//2)\r\nif s==l:\r\n print(inp)\r\nelse:\r\n if s>l:\r\n for i in range(abs(s-l)//2):\r\n m=lis.index('x')\r\n lis[m]='X'\r\n else:\r\n for i in range(abs(s-l)//2):\r\n m=lis.index('X')\r\n lis[m]='x'\r\n for i in lis:\r\n print(i,end=\"\")", "n = int(input())\r\nglobal s\r\ns = input()\r\na, b = s.count(\"x\"), s.count(\"X\")\r\np = abs(a - b) // 2\r\ndef change(a, b):\r\n global s\r\n q = 0\r\n for x in range(n):\r\n if q == p:\r\n break\r\n if s[x] == a:\r\n s = s[:x] + b + s[x + 1:]\r\n q += 1\r\nprint(p)\r\nif a > b:\r\n change(\"x\", \"X\")\r\nelse:\r\n change(\"X\", \"x\")\r\nprint(s)", "n = int(input())\r\ns = input()\r\nd = s.count('x')\r\nc = abs(d - n // 2)\r\nif d < n // 2:\r\n s = s.replace('X', 'x',c) # C for the replacement of numbers of element\r\nelse:\r\n s = s.replace('x', 'X',c)\r\nprint(c)\r\nprint(s)\r\n\r\n", "n = int(input())\r\n\r\ns = input()\r\n\r\na = s.count('X')\r\nb = s.count('x')\r\n\r\nif a==b:\r\n print(0)\r\n print(s)\r\nelse:\r\n \r\n if a>b:\r\n c = a - n//2\r\n s = s.replace('X' , 'x' , c)\r\n print(c)\r\n else:\r\n c = b - n//2\r\n print(c)\r\n s = s.replace('x' , 'X' , c)\r\n\r\n print(s)", "hamsters = int(input())\r\npositions = input()\r\nstanding = positions.count('X')\r\nseated = positions.count('x')\r\nmid = hamsters//2\r\nprint(abs(standing-mid))\r\nif standing>mid:\r\n positions = positions.replace('X','x',abs(standing-mid))\r\n print(positions)\r\nelif standing == mid:\r\n print(positions)\r\nelse:\r\n positions = positions.replace('x','X',abs(standing-mid))\r\n print(positions)", "n=int(input())\r\ns=input()\r\nk=s.count('X')\r\n\r\nk1=n-k\r\np=int(abs(k-k1)/2)\r\ns1=\"\"\r\nif k>=k1 :\r\n for i in s :\r\n if i==\"X\"and k!=k1 :\r\n s1+=\"x\"\r\n k-=1\r\n k1+=1\r\n else :\r\n s1+=i\r\nif k<k1 :\r\n for i in s :\r\n if i==\"x\"and k!=k1 :\r\n s1+=\"X\"\r\n k+=1\r\n k1-=1\r\n else :\r\n s1+=i\r\nprint(p)\r\nprint(s1)\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\na = input()\r\nx = a.count('x')\r\nif x > n//2:\r\n k = 0\r\n rez = ''\r\n z=x-(n//2)\r\n for i,y in enumerate(a):\r\n if y=='x' and k<z:\r\n y = 'X'\r\n k+=1\r\n rez+=y\r\n print(z)\r\n print(rez)\r\nelif x<n//2:\r\n k = 0\r\n rez = ''\r\n z=n//2-x\r\n for i,y in enumerate(a):\r\n if y=='X' and k<z:\r\n y = 'x'\r\n k+=1\r\n rez+=y\r\n print(z)\r\n print(rez)\r\nelse:\r\n print(0)\r\n print(a)", "n = int(input())\ns = input()\ndiff = (s.count('x') - s.count('X')) // 2\nprint(abs(diff))\ns = list(s)\n\nfor i in range(len(s)):\n if s[i] == 'X' and diff < 0:\n s[i] = 'x'\n diff += 1\n elif s[i] == 'x' and diff > 0:\n s[i] = 'X'\n diff -= 1\nprint(''.join(s))\n", "n=int(input());s=list(input());x=s.count('x');b=n//2-min(x,n-x)\r\nif (n-x)==x:t=''\r\nelif (n-x)>x:t='X'\r\nelse:t='x'\r\nprint(b)\r\nfor i in range(n):\r\n\tif s[i]==t:b-=1;s[i]='x' if t=='X' else 'X'\r\n\tif b==0:break\r\nprint(''.join(s))", "import string\n\nsol=0\nn=input()\ncnt_sit=0\ncnt_stand=0\nsi=0\nst=0\nstring=input()\nfor i in string:\n if i.isupper()==True:\n cnt_stand+=1\n else:\n cnt_sit+=1\nif cnt_sit==int(n)/2 and cnt_stand==int(n)/2:\n print(0)\n print(string)\nelif cnt_sit>cnt_stand:\n while cnt_sit!=int(n)/2 and cnt_stand!=int(n)/2:\n si+=1\n cnt_sit-=1\n cnt_stand+=1\n sol+=1\n print(sol)\n for i in string:\n if i.islower()==True and si!=0:\n print(i.upper(),end='')\n si-=1\n else:\n print(i,end='')\n print(' ')\nelse:\n while cnt_sit!=int(n)/2 and cnt_stand!=int(n)/2:\n st+=1\n cnt_sit+=1\n cnt_stand-=1\n sol+=1\n print(sol)\n for i in string:\n if i.isupper()==True and st!=0:\n print(i.lower(),end='')\n st-=1\n else:\n print(i,end='')\n print(' ')\n", "n = int(input())\r\ns = input()\r\nm = s.count(\"X\")\r\ncount = abs(n//2-m)\r\nprint(count)\r\nif m<n//2:\r\n print(str.replace(s, \"x\", \"X\", count))\r\nelse:\r\n print(str.replace(s, \"X\", \"x\", count))", "n=int(input(''))\r\nm=list(input(''))\r\n\r\n\r\ncount=0\r\nfor i in range(n):\r\n if m[i]=='X': count+=1\r\nif n/2==count:\r\n print('0')\r\n for i in range(n):\r\n print(m[i],end='')\r\nif n/2>count:\r\n print(int(n/2-count))\r\n k=n/2-count\r\n for i in range(n):\r\n if m[i]=='x' and k>0:\r\n print('X',end='')\r\n k-=1;\r\n else: print(m[i],end='')\r\nif n/2<count:\r\n print(int(count-n/2))\r\n k=count-n/2\r\n for i in range(n):\r\n if m[i]=='X' and k>0:\r\n print('x',end='')\r\n k-=1;\r\n else: print(m[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", "n = int(input())\ns = input()\na = s.count('x')\nb = s.count('X')\nprint(abs(a - b) // 2)\nprint(('X' if a > b else 'x').join(s.split('x' if a > b else 'X', abs(a - b) // 2)))\n", "# https://codeforces.com/problemset/problem/424/A\r\nn=int(input())\r\nhamster=input()\r\nsmallx,bigx=0,0\r\nfor i in hamster:\r\n if(i=='x'):\r\n smallx=smallx+1\r\n else:\r\n bigx=bigx+1\r\nprint(int(abs(smallx-bigx)/2))\r\nif(smallx>bigx):\r\n for i in range(len(hamster)):\r\n if(hamster[i]=='x' and smallx!=bigx):\r\n print(\"X\", end = '')\r\n smallx=smallx-1\r\n bigx=bigx+1\r\n else:\r\n print(hamster[i], end = '')\r\nelif(bigx>smallx):\r\n for i in range(len(hamster)):\r\n if(hamster[i]=='X' and smallx!=bigx):\r\n print(\"x\", end = '')\r\n bigx=bigx-1\r\n smallx=smallx+1\r\n else:\r\n print(hamster[i], end = '')\r\nelif(bigx==smallx):\r\n print(hamster)", "n = int(input());a = list(input()); i = 0\nprint(max(a.count('x'), a.count('X')) - n // 2)\nwhile a.count('x') != a.count('X'):\n a[i] = ['x', 'X'][a.count('x') > a.count('X')]\n i += 1\nprint(*a, sep='')", "n = int(input())\r\nstr = input()\r\nsit = 0\r\nfor i in str:\r\n if (i == 'x'):\r\n sit += 1\r\nminutes = abs(n / 2 - sit)\r\nresult = ''\r\nif (minutes == 0):\r\n result = str\r\nelse:\r\n if (sit >= n /2):\r\n s = 'X'\r\n else:\r\n s = 'x'\r\n l = minutes\r\n for i in str:\r\n t = i\r\n if t != s and l > 0:\r\n t = s\r\n l -= 1\r\n result += t\r\n\r\n\r\nprint(\"%d\" % minutes)\r\nprint(result)\r\n", "n = int(input())\nhamsters = input()\nups = 0\ndowns = 0\nfor hamster in hamsters :\n if hamster =='X':\n ups+=1\n else :\n downs +=1\n\nif ups > n//2 :\n to_down = ups - n//2\n print(to_down)\n for hamster in hamsters:\n if hamster == 'X' and to_down:\n print('x',end='')\n to_down -=1\n else :\n print(hamster,end='')\n print()\nelif downs > n//2 :\n to_up = downs - n//2\n print(to_up)\n for hamster in hamsters:\n if hamster == 'x' and to_up:\n print('X',end='')\n to_up -=1\n else :\n print(hamster,end='')\n print()\nelse:\n print(0)\n print(hamsters)\n", "n = int(input())\r\nline = input()\r\nup = 0\r\ndown = 0\r\nfor x in line:\r\n if x == 'x':\r\n down += 1\r\n else:\r\n up += 1\r\nprint(int(abs(up - down) / 2))\r\nfor x in line:\r\n if up < down and x == 'x':\r\n print('X', end='')\r\n up += 1\r\n down -= 1\r\n elif down < up and x == 'X':\r\n print('x', end='')\r\n down += 1\r\n up -= 1\r\n else:\r\n print(x, end='')", "n = int(input())\r\ns = input()\r\nX, x = s.count('X'), s.count('x')\r\nresult = n // 2 - min(X, x)\r\ns = s.replace('X', 'x', result) if X > x else s.replace('x', 'X', result)\r\nprint(result)\r\nprint(s)", "n = int(input())\r\npos = input()\r\nx = []\r\nX = []\r\n\r\nfor i in range(n):\r\n x.append(i) if pos[i] == 'x' else X.append(i)\r\n\r\nc = len(x) - len(X)\r\nif c > 0:\r\n for i in range(c // 2):\r\n pos = pos[:x[i]] + 'X' + pos[x[i] + 1:]\r\nelif c < 0:\r\n for i in range(-c // 2):\r\n pos = pos[:X[i]] + 'x' + pos[X[i] + 1:]\r\n\r\nprint(abs(c // 2))\r\nprint(pos)\r\n", "# from dust i have come, dust i will be\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nans = []\r\nfor i in range(n):\r\n ans.append(s[i])\r\n\r\nx = s.count('x')\r\nX = n - x\r\n\r\ncnt = 0\r\nif x > X:\r\n i = 0\r\n while X < x:\r\n if s[i] == 'x':\r\n ans[i] = 'X'\r\n X += 1\r\n x -= 1\r\n cnt += 1\r\n i += 1\r\n\r\nelif X > x:\r\n i = 0\r\n while x < X:\r\n if s[i] == 'X':\r\n ans[i] = 'x'\r\n x += 1\r\n X -= 1\r\n cnt += 1\r\n i += 1\r\n\r\nprint(cnt)\r\nfor i in range(n):\r\n print(ans[i], end='')\r\n", "n=int(input())\r\ns=input()\r\ncnt=s.count('x')-s.count('X')\r\nprint(abs(cnt//2))\r\ns=list(s)\r\nfor i in range(len(s)):\r\n if cnt>0 and s[i]=='x':\r\n s[i]='X'\r\n cnt-=2\r\n elif cnt<0 and s[i]=='X':\r\n s[i]='x'\r\n cnt+=2\r\nprint(''.join(s))", "# lazy method\r\nn = int(input())\r\ns = input()\r\na = list(s)\r\nk = s.count('X') - s.count('x')\r\nc,r = 'xX'[k > 0], 'xX'[k < 0]\r\nprint(abs(k) // 2)\r\nfor i,x in enumerate(s):\r\n if k and x == c:\r\n a[i] = r\r\n k -= (-2,2)[k > 0]\r\nprint(''.join(a))", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nni = sys.stdin.readline()\r\n\r\nnh = 0\r\nnl = 0\r\n\r\nfor i in range(n):\r\n\tif(ni[i] == 'X'):\r\n\t\tnh += 1\r\n\telse:\r\n\t\tnl += 1\r\n\t\t\r\nt = []\r\nc = 0\r\nif(nl > nh):\r\n\tk = int(n / 2) - nh\r\n\tfor i in range(n):\r\n\t\tif(ni[i] == 'x' and k > 0):\r\n\t\t\tc += 1\r\n\t\t\tt.append('X')\r\n\t\t\tk -= 1\r\n\t\telse:\r\n\t\t\tt.append(ni[i])\r\nelif(nh > nl):\r\n\tk = int(n / 2) - nl\r\n\tfor i in range(n):\r\n\t\tif(ni[i] == 'X' and k > 0):\r\n\t\t\tc += 1\r\n\t\t\tt.append('x')\r\n\t\t\tk -= 1\r\n\t\telse:\r\n\t\t\tt.append(ni[i])\r\nelif(nh == nl):\r\n\tprint(0)\r\n\tprint(ni)\r\n\texit()\r\n\t\r\nprint(c)\r\nprint(\"\".join(t))", "n=int(input())\r\npositions = list(input())\r\nneeded = n//2\r\nstanding=0\r\nfor i in range(n):\r\n if positions[i] == 'X':\r\n standing+=1\r\nprint(abs(needed-standing))\r\ni=0\r\nwhile(needed>standing):\r\n if positions[i] == 'x':\r\n positions[i] = 'X'\r\n standing+=1\r\n i+=1\r\ni=0\r\nwhile(needed<standing):\r\n if positions[i] == 'X':\r\n positions[i] = 'x'\r\n needed+=1\r\n i+=1\r\nprint(''.join(positions))\r\n \r\n", "n = int(input())\r\ns = input()\r\nstand = 0\r\nsit = 0\r\nfor c in s:\r\n if c == 'X':\r\n stand += 1\r\n if c == 'x':\r\n sit += 1\r\n\r\nif stand == sit :\r\n print(0)\r\n print(s)\r\nelif stand > sit:\r\n count = int(stand - n/2)\r\n print(count)\r\n chars = list(s)\r\n for i in range(len(chars)):\r\n if chars[i] == 'X' and count > 0:\r\n chars[i] = 'x'\r\n count -= 1\r\n s = ''.join(chars)\r\n print(s)\r\nelse:\r\n count = int(sit - n/2)\r\n print(count)\r\n chars = list(s)\r\n for i in range(len(chars)):\r\n if chars[i] == 'x' and count > 0:\r\n chars[i] = 'X'\r\n count -= 1\r\n s = ''.join(chars)\r\n print(s)\r\n\r\n\r\n\r\n ", "n = int(input())\r\ns = input()\r\nstanding = s.count(\"X\")\r\ncount = abs(n // 2 - standing)\r\nprint(count)\r\nif standing < n // 2:\r\n\r\n print(str.replace(s, \"x\", \"X\", count))\r\n\r\nelse:\r\n\r\n print(str.replace(s, \"X\", \"x\", count))\r\n", "n=int(input())\r\ns=input()\r\nx=s.count('x')\r\nX=s.count('X')\r\nif x==X:\r\n m=0\r\nelif x>X:\r\n m=n//2-X\r\n for j in range(m):\r\n i=s.find('x')\r\n s=s[:i]+'X'+s[i+1:]\r\nelse:\r\n m=n//2-x\r\n for j in range(m):\r\n i=s.find('X')\r\n s=s[:i]+'x'+s[i+1:]\r\nprint(m)\r\nprint(s)", "n = int(input())\r\nls = input()\r\nval = abs(ls.count('X')-ls.count('x'))/2\r\nprint(int(val))\r\nif val!=0:\r\n ch = 'X' if ls.count('X')<ls.count('x') else 'x'\r\n nstr = ''\r\n for i in ls:\r\n if val>0:\r\n if i!=ch:\r\n nstr+=ch\r\n val-=1\r\n else:\r\n nstr+=ch\r\n else:\r\n nstr+=i\r\n print(nstr)\r\nelse:\r\n print(ls)", "n=int(input())\r\nm=input()[:n]\r\na=int(n/2)\r\nc1,c2=0,0\r\nfor i in range(n):\r\n if m[i]=='x':\r\n c1+=1\r\n else:\r\n c2+=1\r\nif c1==c2==a:\r\n print(0)\r\n print(m)\r\nelif c1>c2:\r\n print(c1-a)\r\n m=m.replace('x','X',c1-a)\r\n print(m)\r\nelse:\r\n print(c2-a)\r\n m=m.replace('X','x',c2-a)\r\n print(m)", "n = int(input())\r\ns = input()\r\nsitting, standing = s.count(\"x\"), s.count(\"X\")\r\nx = (n // 2) - min(standing, sitting)\r\nprint(x)\r\nif standing > sitting:\r\n s = s.replace(\"X\", \"x\", x)\r\nelif standing < sitting:\r\n s = s.replace(\"x\", \"X\", x)\r\nprint(s)", "n=int(input())\r\na=input()\r\nt=a.count(\"X\")\r\nc=n//2\r\nif t==c:\r\n print(\"0\")\r\n print(a)\r\nelif t<c:\r\n print(c-t)\r\n a=a.replace(\"x\",\"X\",(c-t))\r\n print(a)\r\nelse:\r\n print(t-c)\r\n a=a.replace(\"X\",\"x\",(t-c))\r\n print(a)\r\n", "input()\r\n\r\ns = input()\r\n\r\nc1 = s.count('x')\r\nc2 = s.count('X')\r\ns = s.replace('x', 'X', max(0, (c1-c2)//2))\r\ns = s.replace('X', 'x', max(0, (c2-c1)//2))\r\n\r\nprint(abs(c2-c1)//2)\r\nprint(s)", "\r\nn=input()\r\ns=input()\r\nX=s.count('X')\r\nx=s.count('x')\r\nc=abs((X-x)//2)\r\nprint(c)\r\nif X>x:\r\n s=s.replace('X','x',c)\r\nelse:\r\n s=s.replace('x','X',c)\r\nprint(s)", "ham=int(input())\r\npos=str(input())\r\nsit=int(0)\r\nup=int(0)\r\nsitr=int(0)\r\nmov=int(0)\r\nprit=str(\"\")\r\n\r\nfor z in pos:\r\n if z==\"x\":\r\n sit=int(sit+1)\r\n if z==\"X\":\r\n up=int(up+1)\r\n \r\nsitr=int(ham/2)\r\n\r\nif sitr!=sit:\r\n if sitr>sit:\r\n mov=int(sitr-sit)\r\n print(mov)\r\n for x in pos:\r\n if x==\"x\":\r\n prit=str(prit+\"x\")\r\n elif x==\"X\" and mov>0:\r\n mov=int(mov-1)\r\n prit=str(prit+\"x\")\r\n elif x==\"X\" and mov==0:\r\n prit=str(prit+\"X\")\r\n print(prit)\r\n \r\n elif sitr<sit:\r\n mov=int(sit-sitr)\r\n print(mov)\r\n for x in pos:\r\n if x==\"x\" and mov>0:\r\n mov=int(mov-1)\r\n prit=str(prit+\"X\")\r\n elif x==\"x\" and mov==0:\r\n prit=str(prit+\"x\")\r\n elif x==\"X\":\r\n prit=str(prit+\"X\")\r\n print(prit)\r\n \r\nelif sitr==sit:\r\n print(\"0\")\r\n print(pos)\r\n \r\n", "n = int(input())\r\nst = input()\r\n\r\na = st.count('x')\r\nb = st.count('X')\r\n\r\nif a==b:\r\n print(0)\r\n print(st)\r\nelif a>b:\r\n print(a-(n//2))\r\n while st.count('x')!=n/2:\r\n st = st.replace('x','X',1)\r\n print(st)\r\nelse:\r\n print(b-(n//2))\r\n while st.count('X')!=n/2:\r\n st = st.replace('X','x',1)\r\n print(st)", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nimplementation just avoid reusing same value\r\n'''\r\n\r\ndef solve():\r\n n = II()\r\n a = [c for c in I().strip()]\r\n num_sit = a.count('x')\r\n\r\n to_sit = abs(n//2 - num_sit)\r\n to_stand = abs(n//2 - (n - num_sit))\r\n\r\n changes = min(to_sit, to_stand)\r\n pose = 'x' if num_sit <= n//2 else 'X'\r\n\r\n for i in range(len(a)):\r\n if changes == 0:\r\n break\r\n \r\n if pose != a[i]:\r\n a[i] = pose\r\n changes -= 1\r\n\r\n print(min(to_sit, to_stand))\r\n WNS(a)\r\n\r\n\r\nsolve()", "n = int(input())\r\nstring = input()\r\n\r\nx = string.count('x')\r\nX = n - x\r\n\r\nans = abs(x - n // 2)\r\nif x >= X:\r\n string = string.replace('x', 'X', ans)\r\nelse:\r\n string = string.replace('X', 'x', ans)\r\n\r\nprint(ans)\r\nprint(string)", "n = int(input()) // 2\r\ns = input()\r\nx = s.count('x')\r\n\r\nprint(abs(x-n))\r\n\r\nif x < n:\r\n print(s.replace('X', 'x', n-x))\r\nelif x > n:\r\n print(s.replace('x', 'X', x-n))\r\nelse:\r\n print(s)", "n = int(input())\r\ns = input()\r\nb, a = s.count('x'), s.count('X')\r\nif a == b == n // 2:\r\n print(0)\r\n print(s)\r\nelse:\r\n diff = abs(a - n // 2)\r\n if a > n // 2:\r\n c = 0\r\n for i in range(len(s)):\r\n if s[i] == 'X':\r\n s = s.replace('X', 'x', 1)\r\n c += 1\r\n if c == diff:\r\n break\r\n if a < n // 2:\r\n c = 0\r\n for i in range(len(s)):\r\n if s[i] == 'x':\r\n s = s.replace('x', 'X', 1)\r\n c += 1\r\n if c == diff:\r\n break\r\n print(diff)\r\n print(s)", "numero = int(input())\nestados = str(input())\nparados = 0\nsentados = 0\n\nseparados = []\n\ncontador = 0\nfor i in estados:\n separados.append(i)\n if i == 'X':\n parados += 1\n elif i =='x':\n sentados += 1\n\ntotal = len(estados)\n\nif parados > sentados:\n resultado = total//2-sentados\n for i in range(len(separados)):\n if separados[i] == 'X':\n contador += 1\n separados[i] = 'x'\n if contador==resultado:\n break\n\nelif sentados>parados:\n resultado = total//2-parados\n for i in range(len(separados)):\n if separados[i] == 'x':\n contador += 1\n separados[i] = 'X'\n if contador==resultado:\n break\nelse:\n resultado = 0\nprint(resultado)\nprint(''.join(separados))\n \t\t\t\t\t\t \t \t \t \t\t\t", "t=int(input())\r\nn=input()\r\na=n.count(\"x\")\r\nb=n.count(\"X\")\r\nif a==b:\r\n print(0)\r\n print(n)\r\n exit(0)\r\nelif a>b:\r\n n=n.replace(\"x\",\"X\",a-t//2)\r\n print(a-t//2)\r\n print(n)\r\nelse:\r\n n = n.replace(\"X\", \"x\", b - t // 2)\r\n print(b - t // 2)\r\n print(n)", "n=int(input())\r\ns=input()\r\nl=list(s)\r\ncntx=0\r\ncntX=0\r\nfor i in range(len(l)):\r\n if l[i] is 'x':\r\n cntx+=1\r\n if l[i] is 'X':\r\n cntX+=1\r\n if cntx>n//2 or cntX>n//2:\r\n if cntx>n//2:\r\n l[i]=str('X')\r\n else:\r\n l[i]=str('x')\r\nprint(abs(n//2-cntx))\r\nprint(''.join(l))\r\n", "a=int(input())\r\nb=list(input())\r\n\r\nc=b.count('x')\r\nd=b.count('X')\r\nprint(abs((a//2)-c))\r\nif c>d:\r\n e=0\r\n for i in range(a):\r\n if b[i]=='x':\r\n b[i]='X'\r\n e+=1\r\n if e==abs((a//2)-c):\r\n break\r\n print(''.join(b))\r\nelif c<d:\r\n e=0\r\n for i in range(a):\r\n if b[i]=='X':\r\n b[i]='x'\r\n e+=1\r\n if e==abs((a//2)-c):\r\n break\r\n print(''.join(b))\r\nelse:\r\n print(''.join(b))\r\n \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(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\na=input()\r\nc=a.count('X')\r\nif(c==n//2):\r\n print(0)\r\n print(a)\r\nelse:\r\n if(c>n//2):\r\n a=a.replace('X','x',c-n//2)\r\n else:\r\n a=a.replace('x','X',n//2-c)\r\n print(abs(c-n//2))\r\n print(a)", "def list_to_str(a):\r\n y=''\r\n for i in range(len(a)):y=y+str(a[i])\r\n return y\r\nn=int(input())\r\ns=input()\r\ndef chrnum(s,a):\r\n ans=0\r\n for i in s:\r\n if i==a:ans+=1\r\n return ans\r\na=chrnum(s,'X')\r\nb=len(s)-a\r\nc=int(abs(a-b)/2)\r\nprint(c)\r\ns=list(s)\r\ndef fn(s,c):\r\n if a>b:\r\n for i in range(n):\r\n if s[i]=='X':\r\n s[i]='x'\r\n c-=1\r\n if c==0:return list_to_str(s)\r\n elif a<b:\r\n for i in range(n):\r\n if s[i]=='x':\r\n s[i]='X'\r\n c-=1\r\n if c==0:return list_to_str(s)\r\n else:return list_to_str(s)\r\nprint(fn(s,c))\r\n \r\n", "n=int(input())\r\ns=input()\r\nx=s.count('x')\r\ny=s.count('X')\r\nz=((n//2)-min(x,y))\r\nif(min(x,y)!=x):\r\n s=s.replace('x','X',z)\r\nelse:\r\n s=s.replace('X','x',z)\r\nprint(z)\r\nprint(s)\r\n", "n = int(input())\nline = list(input())\nstand = 0\nfor m in line:\n if m.isupper():\n stand += 1\nif stand > n//2:\n d = stand - n // 2\n for i in range(n):\n if d > 0:\n if line[i].isupper():\n line[i] = line[i].lower()\n d -= 1\n else:\n break\nelif stand < n//2:\n d = n //2 - stand\n for i in range(n):\n if d > 0:\n if line[i].islower():\n line[i] = line[i].upper()\n d -= 1\n else:\n break\nprint(abs(stand - n // 2))\nprint(''.join(line))\n \t \t\t\t \t\t\t\t\t \t \t\t\t \t", "n = int(input())\r\ns = list(input())\r\na = s.count(\"x\")\r\nb = s.count(\"X\")\r\nc = \"x\" if a < b else \"X\"\r\nk = abs(n // 2 - a)\r\nprint(k)\r\ni = 0\r\nwhile k > 0:\r\n if s[i] != c:\r\n s[i] = c\r\n k -= 1\r\n i += 1\r\nprint(\"\".join(s))", "z=int(input())\r\nx=list(map(str,input()))\r\nif x.count('X')>=x.count('x'):\r\n print((z//2)-x.count('x'))\r\n b='x'\r\n a='X'\r\nelse:\r\n print((z//2)-x.count('X'))\r\n b='X'\r\n a='x'\r\nfor i in range((z//2)-x.count(b)):\r\n x[x.index(a)]=b \r\nprint(''.join(x))", "n = int(input())\r\ns = str(input())\r\nhalf = n//2\r\nsit = s.count('x')\r\nstand = s.count('X')\r\nans = max(sit, stand) - half\r\nt = ans\r\nwhile ans!=0:\r\n if sit>stand:\r\n temp = s.index('x')\r\n s = s[:temp] + 'X' + s[temp+1:]\r\n sit = sit-1\r\n stand = stand +1\r\n ans = ans -1\r\n else:\r\n temp = s.index('X')\r\n s = s[:temp] + 'x' + s[temp+1:]\r\n sit = sit+1\r\n stand = stand - 1\r\n ans = ans -1\r\nprint(t)\r\nprint(s)", "n,s_list = int(input()),list(input())\r\ncnt=0\r\n# for i in range(n//2):\r\n# if s_list[2*i]==s_list[2*i+1]:\r\n# if s_list[2*i].isupper():\r\n# s_list[2*i]=s_list[2*i].lower()\r\n# else:\r\n# s_list[2*i]=s_list[2*i].upper()\r\n# cnt+=1\r\na_list=[[s_list.count(\"X\"),\"X\"],[s_list.count(\"x\"),\"x\"]]\r\nwhile a_list[0][0]!=a_list[1][0]:\r\n a_list.sort()\r\n s_list[s_list.index(a_list[1][1])]=a_list[0][1]\r\n a_list[1][0]-=1\r\n a_list[0][0]+=1\r\n cnt+=1\r\nprint(cnt)\r\nprint(\"\".join(s_list))\r\n", "n = int(input())\r\ns = input()\r\na = s.count('x')\r\nb = s.count('X')\r\nprint(abs(a - b) // 2)\r\nprint(('X' if a > b else 'x').join(s.split('x' if a > b else 'X', abs(a - b) // 2)))", "n = int(input())\r\nstring = input()\r\nstands = string.count('X')\r\nsits = string.count('x')\r\nans = ''\r\ndiff = abs(stands - sits)\r\nprint(diff // 2)\r\nif stands > sits:\r\n for i in range(n):\r\n if string[i] == 'X' and diff != 0:\r\n ans += 'x'\r\n diff -= 2\r\n else:\r\n ans += string[i]\r\n print(ans)\r\nelif stands < sits:\r\n for i in range(n):\r\n if string[i] == 'x' and diff != 0:\r\n ans += 'X'\r\n diff -= 2\r\n else:\r\n ans += string[i]\r\n print(ans)\r\nelse:\r\n print(string)", "# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░╔═══╗╔╗╔═══╦═══╗\r\n# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░║╔═╗╠╝║║╔═╗║╔═╗║\r\n# ╔══╦═╗╔══╦═╗╔╗░╔╦╗╔╦══╦╗╔╦══╬╝╔╝╠╗║║║║║╠╝╔╝║\r\n# ║╔╗║╔╗╣╔╗║╔╗╣║░║║╚╝║╔╗║║║║══╬╗╚╗║║║║║║║║░║╔╝\r\n# ║╔╗║║║║╚╝║║║║╚═╝║║║║╚╝║╚╝╠══║╚═╝╠╝╚╣╚═╝║░║║░\r\n# ╚╝╚╩╝╚╩══╩╝╚╩═╗╔╩╩╩╩══╩══╩══╩═══╩══╩═══╝░╚╝░\r\n# ░░░░░░░░░░░░╔═╝║░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n# ░░░░░░░░░░░░╚══╝░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n\r\na=int(input())\r\n\r\nb=input()\r\n\r\nc=b.count('x')\r\nd=b.count('X')\r\ne=abs((a//2)-d)\r\nf=abs((a//2)-c)\r\n\r\nif(d==a//2):\r\n print(0)\r\n print(b)\r\nelif(d<a//2):\r\n print(e)\r\n print(b.replace('x','X',e))\r\nelif(c<a//2):\r\n print(f)\r\n print(b.replace('X','x',f))\r\n", "def main(s):\r\n isl = 0\r\n isu = 0\r\n for i in s:\r\n if i.isupper():\r\n isu += 1\r\n else:\r\n isl += 1\r\n retstr = int(abs(isl - isu) / 2)\r\n k = 0\r\n i = 0\r\n for j in s:\r\n if (isl < isu)and(k < retstr)and(j.isupper()):\r\n s[i]= j.lower()\r\n k += 1\r\n elif (isl > isu)and(k < retstr)and(j.islower()):\r\n s[i] = j.upper()\r\n k += 1\r\n i += 1\r\n s = ''.join(s)\r\n return str(retstr) + '\\n' + s\r\n\r\nn = input()\r\nsrting = list(input())\r\nprint(main(srting))", "n=int(input())\r\ns=input()\r\nx1=s.count(\"X\")\r\nx=s.count(\"x\")\r\n\r\nif x1==n//2:\r\n\tprint(0)\r\n\tprint(s)\r\nelif x1>n//2:\r\n\tprint(x1-n//2)\r\n\ts=s.replace(\"X\",\"x\",(x1-n//2))\r\n\tprint(s)\r\nelse:\r\n\tprint(x-n//2)\r\n\ts=s.replace(\"x\",\"X\",(x-n//2))\r\n\tprint(s)", "number = int(input())\r\nhamsters = input()\r\nsit = []\r\nstand = []\r\nfor i in range(len(hamsters)):\r\n if hamsters[i] == 'x':\r\n sit.append(i + 1)\r\n else:\r\n stand.append(i + 1)\r\nif len(sit) == len(stand):\r\n print(0)\r\nelif len(sit) > len(stand):\r\n change = len(sit) - number // 2\r\n hamsters = hamsters.replace('x', 'X', change)\r\n print(change)\r\nelse:\r\n change = len(stand) - number // 2\r\n hamsters = hamsters.replace('X', 'x', change)\r\n print(change)\r\nprint(hamsters)\r\n", "n= int(input())\r\na = list(input())\r\nsitting = a.count('x')\r\nif sitting < n//2:\r\n find_char = 'X'\r\n change_char = 'x'\r\nelif sitting > n//2:\r\n find_char = 'x'\r\n change_char = 'X'\r\nelse:\r\n print(0)\r\n print(\"\".join(a))\r\n exit()\r\n\r\nchanges_needed = abs(n//2 - sitting)\r\nchanges = 0\r\n\r\nfor i in range(n):\r\n if changes < changes_needed:\r\n if a[i] == find_char:\r\n a[i] = change_char\r\n changes += 1\r\n else:\r\n break\r\nprint(changes_needed)\r\nprint(\"\".join(a))", "\r\nn = int(input())\r\nst = input()\r\n\r\ncO = 0\r\nco = 0\r\n\r\nfor i in st:\r\n\tif i == 'x':\r\n\t\tco += 1\r\n\telse:\r\n\t\tcO += 1\r\n\r\nif co == cO:\r\n\tprint(0)\r\n\tprint(st)\r\n\r\n\r\nelse:\r\n\tl1 = list(st)\r\n\tif co > cO:\r\n\t\tprint(co - n //2)\r\n\t\tn1 = co - n//2\r\n\t\twhile n1 != 0:\r\n\t\t\tfor j in range(len(l1)):\r\n\t\t\t\tif l1[j] == 'x':\r\n\t\t\t\t\tl1[j] = 'X'\r\n\t\t\t\t\tn1 -= 1\r\n\t\t\t\t\tbreak\r\n\r\n\t\tprint(*l1,sep='')\r\n\r\n\r\n\telse:\r\n\t\tprint(cO - n//2)\r\n\t\tn1 = cO - n//2\r\n\t\twhile n1 != 0:\r\n\t\t\tfor j in range(len(l1)):\r\n\t\t\t\tif l1[j] == 'X':\r\n\t\t\t\t\tl1[j] = 'x'\r\n\t\t\t\t\tn1 -= 1\r\n\t\t\t\t\tbreak\r\n\r\n\t\tprint(*l1,sep='')\r\n", "n = int(input())\r\ns = list(input())\r\nc = 0\r\nj = 0\r\nfor i in s:\r\n if i == 'X':\r\n c += 1\r\nif c > n/2:\r\n for i in range(len(s)):\r\n if s[i] == 'X':\r\n s[i] = 'x'\r\n c -= 1\r\n j += 1\r\n if c == n/2:\r\n break\r\nelif c < n/2:\r\n for i in range(len(s)):\r\n if s[i] == 'x':\r\n s[i] = 'X'\r\n c += 1\r\n j += 1\r\n if c == n/2:\r\n break\r\nelse:\r\n pass\r\ns1 = ''.join(s)\r\nprint(j)\r\nprint(s1)", "n = int(input())\r\nline = list(input())\r\nx = line.count('x')\r\nX = line.count('X')\r\n\r\nres = max(x, X) - n//2\r\n\r\nif x < n//2:\r\n for i in range(n):\r\n if line[i] == 'X':\r\n line[i] = 'x'\r\n x+=1\r\n if x==n//2:\r\n break\r\nelif x>n//2:\r\n for i in range(n):\r\n if line[i]=='x':\r\n line[i] = 'X'\r\n X+=1\r\n if n//2==X:\r\n break\r\nprint(res)\r\nprint(''.join(line))\r\n\r\n\r\n", "n = int(input())\nv = input()\nS = v.count('X')\nif S > n // 2:\n d = S - n // 2\n print(d)\n v = v.replace('X', 'x', d)\n print(v)\nelse:\n d = (n - S) - n // 2\n print(d)\n v = v.replace('x', 'X', d)\n print(v)\n", "n = int(input())\r\ns = input()\r\ncount = s.count(\"x\")\r\nres = int(abs(count - (n - count)) / 2)\r\nprint(res)\r\ni = 0\r\nss = \"\"\r\nif count > (n - count):\r\n while res != 0:\r\n if s[i] == \"X\":\r\n ss += s[i]\r\n else:\r\n ss += \"X\"\r\n res -= 1\r\n i += 1\r\nelse:\r\n while res != 0:\r\n if s[i] == \"x\":\r\n ss += s[i]\r\n else:\r\n ss += \"x\"\r\n res -= 1\r\n i += 1\r\nprint(ss+s[i:])", "oyle = int(input())\r\ndizi = list(input())\r\ncount = 0\r\nfor i in range(oyle):\r\n if dizi.count(\"X\") == (len(dizi) / 2):\r\n print(count)\r\n print(\"\".join(dizi))\r\n break\r\n else:\r\n kac_tane_gerek = (len(dizi) / 2) - dizi.count(\"X\")\r\n if kac_tane_gerek > 0:\r\n if dizi[i] == \"x\" and kac_tane_gerek > 0:\r\n dizi[i] = \"X\"\r\n kac_tane_gerek -= 1\r\n count += 1\r\n else:\r\n kac_tane_gerek = abs(kac_tane_gerek)\r\n if dizi[i] == \"X\" and kac_tane_gerek > 0:\r\n dizi[i] = \"x\"\r\n kac_tane_gerek -= 1\r\n count += 1\r\n", "n = int(input())\ns = input()\n\nif s.count('X') == s.count('x'):\n print(0)\n print(s)\nelse:\n l = {i: n//2 - s.count(i) for i in 'Xx'}\n if l['X'] > 0: \n s = s.replace('x', 'X', l['X'])\n print(l['X'])\n print(s)\n else:\n s = s.replace('X', 'x', l['x'])\n print(l['x'])\n print(s)", "n=int(input())\r\na=input()\r\nx=a.count('x')\r\nif 2*x>n:\r\n a=a.replace('x','X',x-n//2)\r\nelse:\r\n a=a.replace('X','x',n//2-x)\r\nprint(abs(2*x-n)//2)\r\nprint(a)", "n = int(input())\r\ns = input()\r\ns\r\nx = s.count('x')\r\nX = s.count('X')\r\nrs = int(abs(x-X) / 2)\r\nif x > X:\r\n t = 'x'\r\n T = 'X'\r\nelse:\r\n t='X'\r\n T = 'x'\r\ntemp =\"\"\r\nfor i in range(len(s)):\r\n if s[i] == t: \r\n if rs:\r\n rs-=1\r\n else:\r\n temp+= s[i:len(s)]\r\n break\r\n temp += T\r\n else:\r\n temp +=s[i]\r\nrs = int(abs(x-X)/2)\r\nprint(rs)\r\nprint(temp)", "n=int(input())\r\nx=input()\r\ns=\"\"\r\nstand=0\r\nsit=0\r\nfor i in range(n):\r\n if x[i]==\"X\":\r\n stand=stand+1\r\n else:\r\n sit = sit +1\r\nb=n//2\r\nminutes=0\r\nif stand==b and sit==b:\r\n print(minutes)\r\n print(x)\r\nelse:\r\n minutes=minutes+(max(stand,sit)-b)\r\n d=max(stand,sit)\r\n e=min(stand,sit)\r\n if d==stand:\r\n f=\"x\"\r\n else:\r\n f=\"X\"\r\n g=(n//2)-e\r\n counter=0\r\n for j in range(n):\r\n if counter<g and x[j]!=f:\r\n s=s+f\r\n counter=counter+1\r\n else:\r\n s=s+x[j]\r\n \r\n print(minutes)\r\n print(s)", "n = int(input())\r\narr = input()\r\nsit = 0\r\nstand = 0\r\nfor i in arr:\r\n if(i == \"x\"):\r\n sit += 1\r\n else:\r\n stand += 1\r\nif(sit == stand):\r\n print(0)\r\n print(arr)\r\nelif(sit < stand):\r\n print(int(n/2) - sit)\r\n temp = list(arr)\r\n changed = 0\r\n for i in range(n):\r\n if(changed == int(n/2) - sit):\r\n break\r\n if(arr[i] == 'X'):\r\n temp[i] = \"x\"\r\n changed +=1\r\n print(\"\".join(temp))\r\nelse:\r\n print(int(n/2) - stand)\r\n temp = list(arr)\r\n changed = 0\r\n for i in range(n):\r\n if(changed == int(n/2) - stand):\r\n break\r\n if(arr[i] == 'x'):\r\n temp[i] = \"X\"\r\n changed +=1\r\n print(\"\".join(temp))\r\n", "n = int(input())\r\ns = input()\r\nhigh = s.count('X')\r\nlow = n - high\r\nval = max(high, low)\r\nprint(abs(n // 2 - val))\r\n\r\nif low == high:\r\n print(s)\r\nelif low > high:\r\n ans = \"\"\r\n for i in s:\r\n if low == n // 2:\r\n ans += i\r\n elif i == 'X':\r\n ans += 'X'\r\n else:\r\n ans += 'X'\r\n low -= 1\r\n print(ans)\r\nelse:\r\n ans = \"\"\r\n for i in s:\r\n if low == n // 2:\r\n ans += i\r\n elif i == 'x':\r\n ans += 'x'\r\n else:\r\n ans += 'x'\r\n low += 1\r\n print(ans)", "n, s = int(input()), input()\r\n\r\nres = max((s.count('X'), 1), (s.count('x'), 0))\r\n\r\nif res[1]:\r\n s = s.replace('X', 'x', res[0] - n//2)\r\nelse:\r\n s = s.replace('x', 'X', res[0] - n//2)\r\n\r\nprint(res[0] - n//2, s, sep = '\\n')", "import re\r\nn=int(input())\r\ns=input()\r\nif s.count(\"x\")==s.count(\"X\"):\r\n print(0)\r\n print(s)\r\nelse:\r\n l=n//2\r\n if s.count(\"x\")>s.count(\"X\"):\r\n k=l-s.count(\"X\")\r\n print(k)\r\n print(re.sub(\"x\",\"X\",s,k))\r\n else:\r\n k = l - s.count(\"x\")\r\n print(k)\r\n print(re.sub(\"X\", \"x\", s, k))\r\n\r\n", "n = int(input())\r\ns = list(input())\r\ni = 0\r\nj = 0\r\nscx = s.count('x')\r\nscxb = s.count('X')\r\nif scx < scxb:\r\n while i < (scxb - scx)//2:\r\n if s[j] == 'X':\r\n s[j] = s[j].lower()\r\n i += 1\r\n j += 1\r\n print(i)\r\n print(''.join(c for c in s))\r\nelif scx > scxb:\r\n while i < (scx - scxb)//2:\r\n if s[j] == 'x':\r\n s[j] = s[j].upper()\r\n i += 1\r\n j += 1\r\n print(i)\r\n print(''.join(c for c in s))\r\nelse:\r\n print(0)\r\n print(''.join(c for c in s))\r\n", "def main(n, s):\n stand = len(list(filter(lambda i: i == 'X', s)))\n dif = max(n // 2, stand) - min(n // 2, stand)\n r = 0\n if stand > n // 2:\n r ^= 1\n print(dif)\n for i in range(n):\n if dif <= 0:\n break\n if r == 0 and s[i] == 'x':\n s[i] = 'X'\n dif -= 1\n elif r == 1 and s[i] == 'X':\n s[i] = 'x'\n dif -= 1\n return ''.join(s)\nprint(main(int(input()), list(input())))\n", "n=int(input())\r\na=input()\r\nb=0\r\nd=0\r\nfor i in a:\r\n if i=='X':\r\n b+=1\r\nif b>n//2:\r\n d=b-n//2\r\n a = list(a)\r\n for i in range(len(a)):\r\n if a[i]=='X':\r\n a[i]='x'\r\n d-=1\r\n if d==0:\r\n break\r\n print(b-n//2)\r\n print(''.join(a))\r\nelif b<n//2:\r\n d=n//2-b\r\n a=list(a)\r\n for i in range(len(a)):\r\n if a[i]=='x':\r\n a[i]='X'\r\n d-=1\r\n if d==0:\r\n break\r\n print(n//2-b)\r\n print(''.join(a))\r\nelse:\r\n print(0)\r\n print(a)\r\n", "input()\r\nX = input()\r\nStand, Sit = X.count(\"X\"), X.count(\"x\")\r\nDif = (max(Stand, Sit) - min(Stand, Sit)) // 2\r\nprint(Dif)\r\nprint(X.replace(\"X\", \"x\", Dif) if Stand >= Sit else X.replace(\"x\", \"X\", Dif), sep=\"\\n\")\r\n", "n, t = int(input()), input()\r\na, b = 'x', 'X'\r\nk = t.count(a) - n // 2\r\nif k:\r\n t = list(t)\r\n if k < 0: a, b, k = b, a, -k\r\n print(k)\r\n for i, c in enumerate(t):\r\n if c == a:\r\n t[i] = b\r\n k -= 1\r\n if k == 0: break\r\n print(''.join(t))\r\nelse: print('0\\n' + t)", "n=int(input())\r\ns=input() \r\na=s.count('x')-s.count('X')\r\ndiff=abs(a//2)\r\nprint(diff)\r\ns=list(s)\r\nfor i in range(n):\r\n if(a>0 and s[i]=='x'):\r\n s[i]='X'\r\n a-=2;\r\n elif(a<0 and s[i]=='X'):\r\n s[i]='x'\r\n a+=2\r\nprint(''.join(s))", "n=int(input())\r\n\r\nl=list(input())\r\nu=l.count(\"X\")\r\nd=l.count('x')\r\n\r\nif u==d:\r\n print(0)\r\n print(''.join(l))\r\nelse:\r\n \r\n if u<d:\r\n print(n//2-u)\r\n i=0\r\n while(u<n//2 and i<n):\r\n if l[i]==\"x\":\r\n l[i]='X'\r\n i+=1\r\n u+=1\r\n else:\r\n i+=1\r\n \r\n print(''.join(l))\r\n else:\r\n print(n//2-d)\r\n i=0\r\n while(d<n//2 and i<n):\r\n if l[i]==\"X\":\r\n l[i]='x'\r\n i+=1\r\n d+=1\r\n else:\r\n i+=1\r\n \r\n print(''.join(l))\r\n \r\n ", "n = int(input())\ns = input()\nx1 = s.count('x')\nx2 = s.count('X')\nx3 = (max(x1, x2) - min(x1, x2)) // 2\ni = 0\nprint(x3)\nif x1 > x2:\n while s.count('x') != s.count('X'):\n if s[i] == 'x':\n s = s[:i] + 'X' + s[i + 1:]\n i += 1\nelif x2 > x1:\n while s.count('x') != s.count('X'):\n if s[i] == 'X':\n s = s[:i] + 'x' + s[i + 1:]\n i += 1\nprint(s)\n", "n=int(input())\r\nl=list(input())\r\nXx=(l.count('X')-l.count(\"x\"))//2\r\nans=0\r\nif Xx>0:\r\n for i in range(n):\r\n if Xx==0: break\r\n if l[i]=='X': l[i]='x'; Xx-=1; ans+=1\r\nelse:\r\n for i in range(n):\r\n if Xx==0: break\r\n if l[i]=='x': l[i]='X'; Xx+=1; ans+=1\r\nprint(ans)\r\nprint(''.join(map(str,l)))", "n = int(input())\ns = input()\n\na = 0\nb = 0\ns = list(s)\n\nfor i in range(n):\n\tif s[i] == 'x':\n\t\ta += 1\n\telse:\n\t\tb += 1\n\nif a > n // 2:\n\tcounter = 0\n\tfor i in range(len(s)):\n\t\tif s[i] == 'x' and counter + a > n // 2:\n\t\t\ts[i] = 'X'\n\t\t\tcounter -= 1\nelse:\n\tcounter = 0\n\tfor i in range(len(s)):\n\t\tif s[i] == 'X' and counter + b > n // 2:\n\t\t\ts[i] = 'x'\n\t\t\tcounter -= 1\n\nprint(abs(a-b)//2)\nyay = \"\"\nfor i in range(len(s)):\n\tyay += s[i]\nprint(yay)", "n = int(input())\r\ns = str(input())\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'X':\r\n count += 1\r\n\r\nif count == n // 2:\r\n print(0)\r\n print(s)\r\nelse:\r\n if count > n // 2:\r\n ans = count - (n //2)\r\n print(ans)\r\n s = list(s)\r\n for i in range(len(s)):\r\n if ans == 0:\r\n break\r\n else:\r\n if s[i] == 'X':\r\n s[i] = 'x'\r\n ans -= 1 \r\n print(\"\".join(map(str,s)))\r\n else:\r\n ans = (n//2) - count\r\n print(ans)\r\n s = list(s)\r\n for i in range(len(s)):\r\n if count == (n//2):\r\n break\r\n else:\r\n if s[i] == 'x':\r\n s[i] = 'X'\r\n count += 1\r\n print(\"\".join(map(str,s)))\r\n\r\n ", "n = int(input())\nstr = input()\nlower=0\nfor i in str:\n if i.islower():\n lower+=1\nif n//2==lower:\n print(\"0\\n\",str)\nelif lower>n//2:\n print(lower-n//2)\n newstr=\"\"\n for i in str:\n if i.islower() and lower != n//2:\n newstr+=i.upper()\n lower-=1\n else:\n newstr+=i\n print(newstr)\nelif lower<n//2:\n print(n//2-lower)\n newstr=\"\"\n for i in str:\n if i.isupper() and lower != n//2:\n newstr+=i.lower()\n lower+=1\n else:\n newstr+=i\n print(newstr)\n", "n=int(input())\r\ns=input()\r\nax=0\r\nbX=0\r\nfor i in s:\r\n if i==\"x\":\r\n ax=ax+1\r\n else:\r\n bX=bX+1\r\nif ax==bX:\r\n print(0)\r\n print(s)\r\nelse:\r\n if ax>bX:\r\n y=(n//2)-bX\r\n print(y)\r\n for i in range(y):\r\n s=s.replace(\"x\",\"X\",1)\r\n print(s)\r\n else:\r\n y=(n//2)-ax\r\n print(y)\r\n for i in range(y):\r\n s=s.replace(\"X\",\"x\",1)\r\n print(s)\r\n\r\n ", "def main():\n n = int(input())\n state = [c for c in input()]\n n_stand_ups = state.count('X')\n n_sit_downs = n - n_stand_ups\n count = abs(n_stand_ups - n_sit_downs) // 2\n\n index = -1\n\n if n_sit_downs > n_stand_ups:\n for _ in range(count):\n index = next(i for i in range(index + 1, n) if state[i] == 'x')\n state[index] = 'X'\n else:\n for _ in range(count):\n index = next(i for i in range(index + 1, n) if state[i] == 'X')\n state[index] = 'x'\n\n print(count)\n print(''.join(state))\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\nst=list(input())\r\na=st.count('X')\r\nb=st.count('x')\r\nif a==n//2:\r\n print('0')\r\n print(''.join(st))\r\nelif a>n//2:\r\n count=0\r\n while count<abs(a-n//2):\r\n for i in range(len(st)):\r\n if st[i]=='X':\r\n st[i]='x'\r\n break\r\n count+=1\r\n print(abs(a-n//2))\r\n print(''.join(st))\r\nelse:\r\n count=0\r\n while count<abs(b-n//2):\r\n for i in range(len(st)):\r\n if st[i]=='x':\r\n st[i]='X'\r\n break\r\n count+=1\r\n print(abs(a-n//2))\r\n print(''.join(st))", "n=int(input())\r\ns=input()\r\nx=\"\"\r\nc=s.count(\"x\")\r\nv=s.count(\"X\")\r\n\r\nif s.count(\"X\")==s.count(\"x\"):\r\n print(0)\r\n print(s)\r\nelif v>c:\r\n p = s.count(\"X\") - (n // 2)\r\n print(p)\r\n for i in s:\r\n if i==\"X\" and p :\r\n x+=\"x\"\r\n p-=1\r\n else:\r\n x+=i\r\nelse:\r\n p=s.count(\"x\") - (n // 2)\r\n print(p)\r\n for j in s:\r\n if j == \"x\" and p:\r\n x += \"X\"\r\n p-=1\r\n else:\r\n x += j\r\nprint(x)", "n=int(input())\r\nli=list(input())\r\na=li.count(\"x\")\r\nb=li.count(\"X\")\r\ncheck=\"\"\r\ncheck1=\"\"\r\na1=0\r\nif a>b:\r\n a1=a-n//2\r\n check=\"x\"\r\n check1=\"X\"\r\nelif b>a:\r\n a1=b-n//2\r\n check=\"X\"\r\n check1=\"x\"\r\nelse:\r\n print(0)\r\n print(\"\".join(li))\r\n exit(0)\r\nb2=a1\r\nfor i in range(len(li)):\r\n if a1>0 and li[i]==check:\r\n li[i]=check1\r\n a1-=1\r\nprint(b2)\r\nprint(\"\".join(li))\r\n\r\n", "n=int(input())\r\ns=input()\r\na=s.count(\"x\")\r\nb=s.count(\"X\")\r\nif a>b:\r\n\tprint(n//2-b)\r\n\tprint(s.replace(\"x\",\"X\",n//2-b))\r\nelif b>a:\r\n\tprint(n//2-a)\r\n\tprint(s.replace(\"X\",\"x\",n//2-a))\r\nelse:\r\n\tprint(0)\r\n\tprint(s)", "n = int(input())\r\ns = input()\r\ncnt_x = s.count('x')\r\nminutes = abs(cnt_x - n // 2)\r\nans = list(s)\r\n\r\nif cnt_x < n // 2:\r\n ch1, ch2 = 'X', 'x'\r\nelif cnt_x > n // 2:\r\n ch1, ch2 = 'x', 'X'\r\ni, j = 0, 0\r\nwhile i < minutes and j < n:\r\n if ans[j] == ch1:\r\n ans[j] = ch2\r\n i += 1\r\n j += 1\r\n\r\nprint(minutes)\r\nprint(''.join(ans))\r\n", "a=int(input())\r\nb=input()\r\nc=0\r\nd=0\r\nfor i in range(len(b)):\r\n if b[i] == \"X\":\r\n c+=1\r\nif c == a//2:\r\n print(0)\r\n print(b)\r\nelif c > a//2:\r\n print(c-(a//2))\r\n d=c-(a//2)\r\n b=list(b)\r\n for i in range(len(b)):\r\n if b[i] == \"X\":\r\n b[i]=\"x\"\r\n d-=1\r\n if d==0:\r\n break\r\n print(''.join(b))\r\nelse:\r\n print((a//2)-c)\r\n d=(a//2)-c\r\n b=list(b)\r\n for i in range(len(b)):\r\n if b[i] == \"x\":\r\n b[i]=\"X\"\r\n d-=1\r\n if d==0:\r\n break\r\n print(''.join(b))", "from math import dist, ceil, floor, sqrt, log\r\nimport itertools\r\nimport math\r\nimport functools\r\nimport operator\r\nimport collections\r\nimport heapq\r\nimport re\r\nimport string\r\nfrom sys import stdin\r\ninp = stdin.readline\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\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\n\r\ndef main():\r\n n = I()\r\n s = S()\r\n counter = collections.Counter(s)\r\n char, num = counter.most_common(1)[0]\r\n replacements = k = num - n//2\r\n if replacements < 1:\r\n print(0)\r\n return s\r\n\r\n to_upper = True if char.islower() else False\r\n\r\n out = ''\r\n\r\n for c in s:\r\n if c == char and k:\r\n k -= 1\r\n if to_upper:\r\n out += c.upper()\r\n else:\r\n out += c.lower()\r\n else:\r\n out += c\r\n\r\n print(replacements)\r\n return out\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "input()\r\npos = [(c == 'X') for c in input()]\r\n\r\nb = pos.count(True) - len(pos)//2\r\n\r\nprint (abs(b))\r\n\r\nif b < 0:\r\n for p in range(len(pos)):\r\n if not pos[p]:\r\n pos[p] = True\r\n b += 1\r\n if b == 0:\r\n break\r\nelif b > 0:\r\n for p in range(len(pos)):\r\n if pos[p]:\r\n pos[p] = False\r\n b -= 1\r\n if b == 0:\r\n break\r\n\r\n\r\nprint(''.join('X' if p else 'x' for p in pos))", "#9-A. Squats\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nX , x = s.count('X') , s.count('x')\r\n\r\nout = (n//2) - min(X , x)\r\n\r\nif X > x :\r\n s = s.replace('X' , 'x' , out )\r\n\r\nelif x > X :\r\n s = s.replace('x' , 'X' , out)\r\n\r\nprint(out , s , sep = '\\n')\r\n\r\n\r\n\r\n", "n = int(input())\r\nhams = list(input())\r\nsitting = hams.count('x')\r\nstanding = hams.count('X')\r\nmins = 0\r\n\r\n\r\nif sitting>standing:\r\n\tneeded = sitting-n//2\r\n\ti = 0\r\n\twhile needed > 0:\r\n\t\tif hams[i] == 'x':\r\n\t\t\thams[i] = 'X'\r\n\t\t\tmins+=1\r\n\t\t\tneeded-=1\r\n\t\ti+=1\r\n\r\nelif sitting<standing:\r\n\tneeded = standing-n//2\r\n\ti = 0\r\n\twhile needed > 0:\r\n\t\tif hams[i] == 'X':\r\n\t\t\thams[i] = 'x'\r\n\t\t\tmins+=1\r\n\t\t\tneeded-=1\r\n\t\ti+=1\r\n\r\nprint(mins)\r\nprint(''.join(hams))", "n = int(input())\r\ns = input()\r\nd = s.count('x')\r\nc = abs(d - n // 2)\r\nif d < n // 2:\r\n s = s.replace('X', 'x',c)\r\nelse:\r\n s = s.replace('x', 'X',c)\r\nprint(c)\r\nprint(s)", "n = int(input());a = input()\ni = (max(a.count('x'), a.count('X')) - n // 2)\nprint(i, a.replace(['x', 'X'][a.count('x') < a.count('X')], ['x', 'X'][a.count('x') > a.count('X')], i))", "n = int(input())\r\nst = input()\r\nl1 = list(st)\r\nsmall = st.count(\"x\")\r\ncap = st.count(\"X\")\r\ndiff = 0\r\nif cap == small:\r\n print(0)\r\n print(st)\r\nelif cap < small:\r\n diff = (small-cap)//2\r\n temp = 0\r\n for i in range(n):\r\n if l1[i] == \"x\" and temp < diff:\r\n l1[i] = \"X\"\r\n temp += 1\r\n\r\n print(diff)\r\n print(\"\".join(l1))\r\n\r\nelse:\r\n diff = (cap-small)//2\r\n temp = 0\r\n for i in range(n):\r\n if l1[i] == \"X\" and temp < diff:\r\n l1[i] = \"x\"\r\n temp += 1\r\n\r\n print(diff)\r\n print(\"\".join(l1))\r\n", "n = int(input())\r\na = input()\r\ns = list(a)\r\nb = 0; c = 0\r\nd = n//2\r\nfor i in range(n):\r\n if a[i] == \"x\": b += 1\r\n else: c += 1\r\nif b == c: print(0); print(a)\r\nelse:\r\n if b < d:\r\n print(d-b)\r\n for i in range(len(s)):\r\n if s[i] == \"X\" and b < d:\r\n s[i] = \"x\"\r\n b += 1\r\n elif c < d:\r\n print(d-c)\r\n for i in range(len(s)):\r\n if s[i] == \"x\" and c < d:\r\n s[i] = \"X\"\r\n c += 1\r\n ans = \"\"\r\n for i in range(n): ans += s[i]\r\n print(ans)", "n = int(input())\r\ns = input()\r\n\r\nif s.count('X') == n / 2:\r\n print(0)\r\n print(s)\r\nelif s.count('X') > n / 2:\r\n count = s.count('X') - n / 2\r\n count1 = 0\r\n for i in s:\r\n if i == 'X':\r\n s = s.replace(i, 'x', 1)\r\n count1 += 1\r\n if count1 == count:\r\n print(int(count))\r\n print(s)\r\n quit()\r\nelse:\r\n count = n / 2 - s.count('X')\r\n count1 = 0\r\n for i in s:\r\n if i == 'x':\r\n s = s.replace(i, 'X', 1)\r\n count1 += 1\r\n if count1 == count:\r\n print(int(count))\r\n print(s)\r\n quit()", "n=input()\ns=input()\nX=s.count('X')\nx=s.count('x')\nc=abs((X-x)//2)\nprint(c)\nif X>x:\n s=s.replace('X','x',c)\nelse:\n s=s.replace('x','X',c)\nprint(s)\n \t\t \t\t\t \t \t \t \t\t\t \t\t \t \t", "n = int(input())\r\nhamsters = input()\r\nsitting = hamsters.count('x')\r\n\r\nif sitting > n // 2:\r\n minutes = (n // 2) - (n - sitting)\r\n print(minutes)\r\n for i in range(n):\r\n if hamsters[i] == 'x' and minutes:\r\n print('X', end='')\r\n minutes -= 1\r\n else:\r\n print(hamsters[i], end='')\r\nelse:\r\n minutes = (n // 2) - sitting\r\n print(minutes)\r\n for i in range(n):\r\n if hamsters[i] == 'X' and minutes:\r\n print('x', end='')\r\n minutes -= 1\r\n else:\r\n print(hamsters[i], end='')\r\n", "n = int(input())\r\ns = input()\r\nr = (n >> 1) - s.count('x')\r\nc = abs(r)\r\nprint(c)\r\ni = 0\r\nif r > 0:\r\n while c:\r\n if s[i] == 'X':\r\n print('x', end = '')\r\n c -= 1\r\n else:\r\n print(s[i], end = '')\r\n i += 1\r\n print(s[i:])\r\nelif r < 0:\r\n while c:\r\n if s[i] == 'x':\r\n print('X', end = '')\r\n c -= 1\r\n else:\r\n print(s[i], end = '')\r\n i += 1\r\n print(s[i:])\r\nelse:\r\n print(s)", "n = int(input())\r\ns = input()\r\nx, y, ans = 0, 0, 0\r\nfor t in s:\r\n x += (t == 'x')\r\n y += (t == 'X')\r\n\r\ns = list(s) \r\nfor i in range(len(s)):\r\n if s[i] == 'x' and x > y:\r\n s[i] = 'X'\r\n x -= 1\r\n y += 1\r\n ans += 1\r\n if s[i] == 'X' and x < y:\r\n s[i] = 'x'\r\n y -= 1\r\n x += 1\r\n ans += 1\r\ns = ''.join(s) \r\nprint(ans)\r\nprint(s)# 1697811425.6530273", "n = int(input())\r\ns = input()\r\nr = s.count(\"X\")\r\nd=abs(n//2-r)\r\nprint(d)\r\nif r<n//2:\r\n print(str.replace(s, \"x\", \"X\", d))\r\nelse:\r\n print(str.replace(s, \"X\",\"x\",d))", "n = int(input())\r\ns = list(input())\r\nsit = s.count(\"x\")\r\nstay = s.count(\"X\")\r\nd = True\r\nswaps = 0\r\ni = 0\r\nif sit == max(sit, stay):\r\n d = True\r\nelse:\r\n d = False\r\nk = (max(sit,stay) - min(sit,stay)) // 2\r\nwhile i < n and swaps < k:\r\n if d == True:\r\n if s[i] == \"x\":\r\n s[i] = \"X\"\r\n swaps += 1\r\n else:\r\n if s[i] == \"X\":\r\n s[i] = \"x\"\r\n swaps += 1\r\n i += 1\r\nprint(k)\r\nfor i in s:\r\n print(i, end=\"\")", "n,i=int(input()),list(input())\r\nif i.count(\"X\")<=n//2:a=\"X\";b=i.count(a)\r\nelse:a=\"x\";b=i.count(a)\r\nprint(n//2-b)\r\nfor z in range(n):\r\n\tif i.count(a)==n//2:print(\"\".join(i));break\r\n\tif i[z]!=a:i[z]=a\r\n", "n = int(input())\r\nstr = list(input())\r\nc = 0\r\nfor i in range(n):\r\n if str.count('x') == n//2 :\r\n break\r\n if str.count('x') > n//2:\r\n if str[i] == 'x':\r\n c += 1\r\n str[i] = 'X'\r\n else:\r\n if str[i] == 'X':\r\n c += 1\r\n str[i] = 'x'\r\n\r\nprint(c)\r\nprint(''.join(str))\r\n ", "n = int(input())\r\ns = input()\r\nx = s.count(\"X\")\r\nr=abs(n//2-x)\r\nprint(r)\r\nif x<n//2:\r\n print(str.replace(s, \"x\", \"X\", r))\r\nelse:\r\n print(str.replace(s, \"X\",\"x\",r))", "n = int(input())\r\nstr1 = input()\r\ncount_of_X = 0\r\ncount_of_x = 0\r\nfor i in range(len(str1)):\r\n if str1[i] == \"X\":\r\n count_of_X += 1\r\n elif str1[i] == \"x\":\r\n count_of_x += 1\r\na = abs(count_of_X - count_of_x)//2\r\nprint(abs(count_of_X - count_of_x)//2)\r\nif count_of_X > count_of_x:\r\n for j in range(a):\r\n str1_list = list(str1)\r\n for k in range(len(str1_list)):\r\n if str1_list[k] == \"X\":\r\n str1_list[k] = \"x\"\r\n break\r\n str1 = \"\".join(str1_list)\r\n print(str1)\r\nelif count_of_x > count_of_X:\r\n for j in range(a):\r\n str1_list = list(str1)\r\n for k in range(len(str1_list)):\r\n if str1_list[k] == \"x\":\r\n str1_list[k] = \"X\"\r\n break\r\n str1 = \"\".join(str1_list)\r\n print(str1)\r\nelse:\r\n print(str1)", "#!/usr/bin/python\nimport re\nimport inspect\nfrom sys import argv, exit\n\ndef rstr():\n return input()\n\ndef rint():\n return int(input())\n\ndef rints(splitchar=' '):\n return [int(i) for i in input().split(splitchar)]\n\ndef varnames(obj, namespace=globals()):\n return [name for name in namespace if namespace[name] is obj]\n\ndef pvar(var, override=False):\n prnt(varnames(var), var)\n\ndef prnt(*args, override=False):\n if '-v' in argv or override:\n print(*args)\n\nif __name__ == '__main__':\n n = rint()\n ham = rstr()\n ham = [1 if x=='X' else 0 for x in ham]\n sham = sum(ham)\n if sham > n/2:\n to_change = sham - n/2\n for i,x in enumerate(ham):\n if x == 1:\n ham[i] = 0\n to_change -= 1\n if not to_change:\n break\n print(int(sham-n/2))\n print(''.join(['X' if x else 'x' for x in ham]))\n elif sham < n/2:\n to_change = n/2 - sham\n for i,x in enumerate(ham):\n if x == 0:\n ham[i] = 1\n to_change -= 1\n if not to_change:\n break\n print(int(n/2-sham))\n print(''.join(['X' if x else 'x' for x in ham]))\n else:\n print(int(n/2-sham))\n print(''.join(['X' if x else 'x' for x in ham]))\n", "if __name__ == '__main__':\r\n n = int(input())\r\n line = str(input())\r\n num_stand = 0\r\n for i in range(n):\r\n if line[i] == 'X':\r\n num_stand += 1\r\n tar = n // 2\r\n res = 0\r\n if tar > num_stand:\r\n for i in range(n):\r\n if line[i] == 'x':\r\n line = line[:i] + 'X' + line[i + 1:]\r\n num_stand += 1\r\n res += 1\r\n if tar == num_stand:\r\n break\r\n elif tar < num_stand:\r\n for i in range(n):\r\n if line[i] == 'X':\r\n line = line[:i] + 'x' + line[i + 1:]\r\n num_stand -= 1\r\n res += 1\r\n if tar == num_stand:\r\n break\r\n print(res)\r\n print(line)\r\n", "n = int(input())\r\ns = list(input())\r\n\r\ncount = s.count('X')\r\n\r\nif count < n//2:\r\n t = count\r\n for i in range(n):\r\n if t < n//2 and s[i] == 'x':\r\n s[i] = 'X'\r\n t += 1\r\n print(t-count)\r\n print(''.join(s))\r\nelif count > n//2:\r\n t = count\r\n for i in range(n):\r\n if t > n//2 and s[i] == 'X':\r\n s[i] = 'x'\r\n t -= 1\r\n print(count-t)\r\n print(''.join(s))\r\nelse:\r\n print(0)\r\n print(''.join(s))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(input().rstrip())\r\n\r\ncnt = data.count('X')\r\ntmp = n // 2 - cnt\r\n\r\nprint(abs(tmp))\r\nif tmp > 0:\r\n for i in range(n):\r\n if data[i] == 'x' and tmp > 0:\r\n tmp -= 1\r\n print('X', end='')\r\n else:\r\n print(data[i], end='')\r\nelse:\r\n tmp = -tmp\r\n for i in range(n):\r\n if data[i] == 'X' and tmp > 0:\r\n tmp -= 1\r\n print('x', end='')\r\n else:\r\n print(data[i], end='')", "n = int(input())//2\r\nl1 = list(input())\r\nconst = l1.count(\"x\")-l1.count(\"X\")\r\nans=0\r\nwhile l1.count(\"X\")-l1.count(\"x\")!=0:\r\n if l1.count(\"X\")>l1.count(\"x\"):\r\n l1[l1.index(\"X\")]=\"x\"\r\n else:\r\n l1[l1.index(\"x\")]=\"X\"\r\n ans+=1\r\nprint(ans)\r\nprint(\"\".join(l1))\r\n ", "n = int(input())\r\nt = input()\r\nsit = t.count(\"x\")\r\nup = n-sit\r\nif sit > up:\r\n\tprint(sit-n//2)\r\n\tprint(t.replace(\"x\",\"X\",sit-n//2))\r\nelif up > sit:\r\n\tprint(up-n//2)\r\n\tprint(t.replace(\"X\",\"x\",up-n//2))\r\nelse:\r\n\tprint(0)\r\n\tprint(t)", "n,s=int(input()),input()\r\nX,x=s.count('X'),s.count('x')\r\nout=(n//2)-min(X,x)\r\nif(X>x):\r\n s=s.replace('X','x',out)\r\nelif(x>X):\r\n s=s.replace('x','X',out)\r\nprint(out,s,sep='\\n')", "n=int(input())\r\n\r\nt=list(input())\r\n\r\np=t.count('X')\r\nq=t.count('x')\r\n\r\n\r\nif p>q:\r\n o=0\r\n for j in range(n):\r\n if t[j]=='X':\r\n t[j]='x'\r\n o+=1\r\n if t.count('X')==t.count('x'):\r\n print(o)\r\n print(''.join(t))\r\n break\r\nelif q>p:\r\n s=0\r\n for k in range(n):\r\n if t[k]=='x':\r\n t[k]='X'\r\n s+=1\r\n if t.count('x')==t.count('X'):\r\n print(s)\r\n print(''.join(t))\r\n break\r\nelse:\r\n print(0)\r\n print(''.join(t))\r\n", "input()\r\ninp = input()\r\n\r\nn = len(inp)\r\n\r\nstand = inp.count(\"X\")\r\nsit = inp.count(\"x\")\r\n\r\nif stand > sit:\r\n diff = stand - n//2\r\n res = inp.replace(\"X\", \"x\", diff)\r\nelse:\r\n diff = sit - n//2\r\n res = inp.replace(\"x\", \"X\", diff)\r\nprint(diff)\r\nprint(res)", "n = int(input())\r\ns = input()\r\nresult = \"\"\r\na = s.count(\"X\")\r\nb = s.count(\"x\")\r\nprint(abs(a-b)//2)\r\nif a>=b:\r\n\tfor i in s:\r\n\t\tif i==\"X\" and a!=n//2:\r\n\t\t\tresult+=\"x\"\r\n\t\t\ta-=1\r\n\t\telse:\r\n\t\t\tresult+=i\r\nelse:\r\n\tfor i in s:\r\n\t\tif i==\"x\" and b!=n//2:\r\n\t\t\tresult+=\"X\"\r\n\t\t\tb-=1\r\n\t\telse:\r\n\t\t\tresult+=i\r\nprint(result)", "n = int(input())\r\nword = input()\r\nlcx = word.count(\"x\")\r\nucx = n - lcx\r\ntoChange = max(lcx, ucx) - n // 2\r\n\r\nif lcx > ucx:\r\n word = word.replace(\"x\", \"X\", toChange)\r\nelif lcx < ucx:\r\n word = word.replace(\"X\", \"x\", toChange)\r\nprint(toChange)\r\nprint(word)", "n = int(input())\r\na = list(input())\r\nprint(abs(a.count(\"X\") - n // 2))\r\nif a.count(\"X\") > a.count(\"x\"):\r\n for i in range(n):\r\n a[i] = \"x\"\r\n if abs(a.count(\"X\") - n // 2) == 0: break\r\nelif a.count(\"x\") > a.count(\"X\"):\r\n for i in range(n):\r\n a[i] = \"X\"\r\n if abs(a.count(\"X\") - n // 2) == 0: break\r\nprint(\"\".join(a))", "n=int(input())\r\ns=input()\r\ndiff=(s.count('x')-s.count('X'))//2\r\nprint(abs(diff))\r\ns=list(s)\r\nfor i in range(n):\r\n if diff>0 and s[i]=='x' :\r\n s[i]='X'\r\n diff-=1\r\n elif diff<0 and s[i]=='X':\r\n s[i]='x'\r\n diff+=1\r\nprint(''.join(s))", "# https://codeforces.com/contest/424/problem/A\r\nn =int(input())\r\ns=list(input())\r\nx,X=s.count(\"x\"),s.count(\"X\")\r\nc=0\r\n\r\nif(x==X):\r\n print(c)\r\nelif(x>X):\r\n c=(n//2)-min(x,X)\r\n print(c)\r\n\r\n for i in range(len(s)):\r\n if (s[i]==\"x\" ):\r\n s[i]=\"X\"\r\n c-=1\r\n if (c==0):\r\n break\r\nelse:\r\n c=(n//2)-min(x,X)\r\n print(c)\r\n\r\n for i in range(len(s)):\r\n if (s[i]==\"X\" ):\r\n s[i]=\"x\"\r\n c-=1\r\n if (c==0):\r\n break \r\n\r\n\r\n\r\nprint(\"\".join(s))\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\ndiff=(s.count('x')-s.count('X'))//2\r\nprint(abs(diff))\r\ns=list(s)\r\nfor i in range(len(s)):\r\n if s[i]=='X' and diff < 0:\r\n s[i]='x'\r\n diff+=1\r\n elif s[i]=='x' and diff >0:\r\n s[i]='X'\r\n diff-=1\r\nprint(''.join(s))", "n=int(input())\ns=input()\nX=0\nx=0\nfor i in s:\n\tif i=='x':\n\t\tx+=1\n\telse:\n\t\tX+=1\nprint(abs(x-X)//2)\nif x==X:\n\tprint(s)\nelif x>X:\n\tfor i in s:\n\t\tif i=='x' and x>X:\n\t\t\tprint('X',end=\"\")\n\t\t\tx-=1\n\t\t\tX+=1\n\t\telse:\n\t\t\tprint(i,end=\"\")\nelse:\n\tfor i in s:\n\t\tif i=='X' and X>x:\n\t\t\tprint('x',end=\"\")\n\t\t\tX-=1\n\t\t\tx+=1\n\t\telse:\n\t\t\tprint(i,end=\"\")", "n = int(input())\r\ns = list(input())\r\nsit = 0\r\nfor i in range(n):\r\n if s[i] == 'x':\r\n sit += 1\r\nans = 0\r\ni = 0\r\nwhile i < n and sit < n - sit:\r\n if s[i] == 'X':\r\n sit += 1\r\n ans += 1\r\n s[i] = 'x'\r\n i += 1\r\ni = 0\r\nwhile i < n and sit > n - sit:\r\n if s[i] == 'x':\r\n sit -= 1\r\n ans += 1\r\n s[i] = 'X'\r\n i += 1\r\nprint(ans)\r\nprint(''.join(s))", "n = int(input())\r\ns = input()\r\ncnt_x = s.count('x')\r\nminutes = abs(cnt_x - n // 2)\r\nans = list(s)\r\nif cnt_x < n // 2:\r\n i = 0\r\n j = 0\r\n while i < minutes and j < n:\r\n if ans[j] == 'X':\r\n ans[j] = 'x'\r\n i += 1\r\n j += 1\r\nelif cnt_x > n // 2:\r\n i = 0\r\n j = 0\r\n while i < minutes and j < n:\r\n if ans[j] == 'x':\r\n ans[j] = 'X'\r\n i += 1\r\n j += 1\r\nprint(minutes)\r\nprint(''.join(ans))\r\n", "n = int(input())\r\ns = list(input())\r\n\r\nx = len([c for c in s if c == 'x'])\r\nX = len([c for c in s if c == 'X'])\r\n\r\nm = n // 2\r\nd = 0\r\nif x == X:\r\n print(0)\r\n print(\"\".join(s))\r\nelse:\r\n if x < X:\r\n d = m - x\r\n k = 0\r\n for i in range(n):\r\n if s[i] == 'X':\r\n s[i] = 'x'\r\n k += 1\r\n if k == d:\r\n break\r\n else:\r\n d = m - X\r\n k = 0\r\n for i in range(n):\r\n if s[i] == 'x':\r\n s[i] = 'X'\r\n k += 1\r\n if k == d:\r\n break\r\n\r\n print(d)\r\n print(\"\".join(s))", "n = int(input())\ns = input()\nsumx = s.count('x')\nprint(abs(n // 2 - sumx))\nfor i in range(abs(n // 2 - sumx)):\n if sumx > n - sumx:\n s = s.replace('x', 'X', 1)\n else:\n s = s.replace('X', 'x', 1)\nprint(s)\n\n\t \t \t \t\t\t \t\t\t \t\t \t \t\t", "n, a = int(input()), list(input())\ndown, half = a.count(\"x\"), n // 2\nres = abs(down - half)\nprint(res)\nfor i, c in enumerate(a):\n if down > half and c == \"x\":\n a[i] = \"X\"\n res -= 1\n if down < half and c == \"X\":\n a[i] = \"x\"\n res -= 1\n if res == 0:\n break\nres = \"\".join(a)\nprint(res)\n", "n = int(input())\nhamsters = list(input())\ncount = 0\n\nfor i in range(n):\n if hamsters.count('x') == n // 2:\n break\n if hamsters.count('x') > n // 2:\n if hamsters[i] == 'x':\n count += 1\n hamsters[i] = 'X'\n else:\n if hamsters[i] == 'X':\n count += 1\n hamsters[i] = 'x'\n\nprint(count)\nprint(''.join(hamsters))\n\t \t \t\t \t\t\t\t\t \t \t \t\t\t \t \t \t", "n=int(input())\ns=input()\nif s.count('x')>=s.count('X'):\n print(n//2-s.count('X'))\n s=s.replace('x','X',n//2-s.count('X'))\n print(s)\nelse:\n print(n//2-s.count('x'))\n s=s.replace('X','x',n//2-s.count('x'))\n print(s)", "# https://codeforces.com/problemset/problem/424/A\n# 900\n\nn = int(input())\nl = [c for c in input()]\nh = n/2\n\nu = 0\nd = 0\n\nui = []\ndi = []\n\nfor i, c in enumerate(l):\n if c == \"X\":\n u += 1\n ui.append(i)\n else:\n d += 1\n di.append(i)\n\n\nif u > h:\n print(int(u-h))\n for i in ui:\n l[i] = \"x\"\n u -= 1\n d += 1\n\n if u == h:\n break\nelif d > h:\n print(int(d-h))\n for i in di:\n l[i] = \"X\"\n d -= 1\n u += 1\n\n if d == h:\n break\nelse:\n print(0)\n\nprint(\"\".join(l))", "n = int(input())\r\ns = input()\r\na = s.count('X')\r\nb = s.count('x')\r\nif a == b:\r\n print(0)\r\n print(s)\r\nelse:\r\n print(abs(a - b) // 2)\r\n if a > b:\r\n s = list(s)\r\n for i in range(n):\r\n if a == b:\r\n break\r\n if s[i] == 'X':\r\n s[i] = 'x'\r\n a -= 1\r\n b += 1\r\n print(''.join(s))\r\n else:\r\n s = list(s)\r\n for i in range(n):\r\n if a == b:\r\n break\r\n if s[i] == 'x':\r\n s[i] = 'X'\r\n a += 1\r\n b -= 1\r\n print(''.join(s))", "n=int(input())\r\ns=input()\r\nu,d=0,0\r\nfor i in s:\r\n if i==\"X\":\r\n u=u+1\r\n else:\r\n d=d+1\r\nif u>d:\r\n print(n//2-d)\r\nelif u==d:\r\n print(0)\r\nelse:\r\n print(n//2-u)\r\nif u==d:\r\n print(s)\r\nelif u>d:\r\n v=n//2-d\r\n new=\"\"\r\n for i in s:\r\n if v!=0 and i==\"X\":\r\n new=new+\"x\"\r\n v=v-1\r\n else:\r\n new=new+i\r\n print(new)\r\nelse:\r\n v=n//2-u\r\n new=\"\"\r\n for i in s:\r\n if v!=0 and i==\"x\":\r\n new=new+\"X\"\r\n v=v-1\r\n else:\r\n new=new+i\r\n print(new)\r\n \r\n \r\n \r\n ", "n = int(input())\npositions = list(input())\n\ndef mutate(positions):\n X_count = positions.count('X')\n x_count = positions.count('x')\n average = len(positions) // 2\n\n if X_count > average:\n count = X_count - average\n while count:\n positions[positions.index('X')] = 'x'\n count -= 1\n return (X_count - average, positions)\n elif x_count > average:\n count = x_count - average\n while count:\n positions[positions.index('x')] = 'X'\n count -= 1\n return (x_count - average, positions)\n else:\n return (0, positions)\n\nc, p = mutate(positions)\npos = ''.join(p)\nprint(c)\nprint(pos)", "n = int(input())\r\ns = input()\r\na = s.count('x')\r\nb = s.count('X')\r\nprint(abs(b - a)//2) \r\ns = s.split('x' if a > b else 'X', abs(a - b) // 2)\r\ns = ('X' if a > b else 'x').join(s)\r\nprint(s)", "numbe_of_hamsters = int(input())\r\npositions = input()\r\n\r\ncurrent_max = max(positions.count(\"x\"),positions.count(\"X\"))\r\n\r\nif positions.count(\"X\") == numbe_of_hamsters/2:\r\n print(0)\r\n print(positions)\r\nelse:\r\n print(int(abs(numbe_of_hamsters/2 - current_max))) \r\n if positions.count(\"x\")> positions.count(\"X\"):\r\n for i in range(int(abs(numbe_of_hamsters/2 - current_max))):\r\n positions = positions.replace(\"x\",\"X\",1)\r\n print(positions)\r\n elif positions.count(\"x\") < positions.count(\"X\"):\r\n for i in range(int(abs(numbe_of_hamsters/2 - current_max))):\r\n positions = positions.replace(\"X\",\"x\",1)\r\n print(positions) \r\n \r\n", "n = int(input())\r\npositions = input().strip()\r\n\r\n# Count the number of standing hamsters\r\nstanding = positions.count('X')\r\n\r\n# Calculate the number of hamsters that need to stand up\r\nrequired = n // 2 - standing\r\n\r\n# Calculate the minimum number of minutes required to get the desired configuration\r\nminutes = abs(required)\r\n\r\n# Construct the new configuration\r\nif required > 0:\r\n new_positions = positions.replace('x', 'X', required)\r\nelse:\r\n new_positions = positions.replace('X', 'x', abs(required))\r\n\r\n# Output the result\r\nprint(minutes)\r\nprint(new_positions)\r\n", "n = int(input())\r\na = input().strip()\r\ncnt = 0\r\na = list(a)\r\nfor i in range(n):\r\n if a[i] == 'x':\r\n cnt += 1\r\nres = abs(n // 2 - max(cnt, n - cnt))\r\nprint(res)\r\nif cnt > n - cnt:\r\n for i in range(n):\r\n if a[i] == 'x' and res:\r\n a[i] = 'X'\r\n res -= 1\r\nelse:\r\n for i in range(n):\r\n if a[i] == 'X' and res:\r\n a[i] = 'x'\r\n res -= 1 \r\nprint(''.join(a)) ", "def solve():\r\n n = int(input())\r\n s = list(input())\r\n c = ''\r\n if s.count('x') < s.count('X') :\r\n c = 'x'\r\n else :\r\n c = 'X'\r\n print(int(abs(s.count('x') - s.count('X'))/2))\r\n for i in range (0,n) :\r\n if s.count(c) == n/2:\r\n break\r\n if s[i] != c:\r\n s[i] = c\r\n print(*s,sep='')\r\nsolve()", "from copy import deepcopy\r\ninput()\r\ns = list(input())\r\nk = deepcopy(s)\r\ni = 0\r\nwhile s.count(\"x\") > s.count(\"X\"):\r\n s[i] = \"X\"\r\n i+=1\r\nwhile s.count(\"X\") > s.count(\"x\"):\r\n s[i] = \"x\"\r\n i+=1\r\ni = 0\r\nfor c1,c2 in zip(s,k):\r\n i+=int(c1!=c2)\r\nprint(i)\r\nprint(\"\".join(s))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\n\r\nx = n//2 - s.count('x')\r\nprint(abs(x))\r\nif x <= 0:\r\n print(s.replace('x', 'X', -x))\r\nelse:\r\n print(s.replace('X', 'x', x))\r\n", "hamsternum = int(input())\r\nhamsters = list(input())\r\nhamsteridx = []\r\nrequirednum = hamsternum // 2\r\ncounter = 0\r\ntime = 0\r\n\r\nif hamsters.count('X') > requirednum:\r\n for i in range(hamsternum):\r\n if hamsters[i] == 'X':\r\n hamsteridx.append(i)\r\n while hamsters.count(\"X\") != requirednum:\r\n hamsters[hamsteridx[counter]] = 'x'\r\n counter += 1\r\n time += 1\r\nif hamsters.count('X') < requirednum:\r\n while hamsters.count(\"X\") != requirednum:\r\n if hamsters[counter] == 'X':\r\n counter += 1\r\n continue\r\n hamsters[counter] = 'X'\r\n counter += 1\r\n time += 1\r\n\r\nprint(time)\r\nprint(''.join(hamsters))", "i = int(input())\r\nl = list(map(str,input()))\r\nprint(int(abs(l.count('X')-l.count('x'))/2))\r\nif l.count('X') > l.count('x'):\r\n for x in range(l.count('X')-int(i/2)):\r\n l.insert(l.index('X'), 'x')\r\n l.pop(l.index('X'))\r\nif l.count('X') < l.count('x'):\r\n for x in range(l.count('x')-int(i/2)):\r\n l.insert(l.index('x'), 'X')\r\n l.pop(l.index('x'))\r\nprint(''.join([str(elem) for elem in l]))", "from collections import defaultdict, deque, Counter, OrderedDict\r\n\r\ndef main():\r\n n = int(input())\r\n s = [c for c in input()]\r\n d = Counter()\r\n for c in s:\r\n d[c] += 1\r\n a,b,c = '','',0\r\n if d['X'] > d['x']:\r\n a, b = 'X', 'x'\r\n c = (d['X'] - d['x'])//2\r\n elif d['X'] < d['x']:\r\n a, b = 'x', 'X'\r\n c = (d['x'] - d['X'])//2\r\n else:\r\n print(\"0\\n\"+\"\".join(s))\r\n exit(0)\r\n ans = c\r\n for i in range(n):\r\n if c == 0: break\r\n if s[i] == a:\r\n s[i] = b\r\n c -= 1\r\n print(ans)\r\n print(\"\".join(s))\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(400000)\r\n threading.stack_size(40960000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\"\"\"\r\n main()", "# cook your dish here\r\nn = int(input())\r\ns = input()\r\nX = s.count('X')\r\nx = s.count('x')\r\nif X==x:\r\n print(0)\r\n print(s)\r\nelif X>x:\r\n diff = X-x\r\n diff = diff//2\r\n print(diff)\r\n ans = ''\r\n for item in s:\r\n if item == 'X' and diff!=0:\r\n ans+='x'\r\n diff-=1\r\n else:\r\n ans += item\r\n print(ans)\r\nelse:\r\n diff = x-X\r\n diff = diff//2\r\n print(diff)\r\n ans = ''\r\n for item in s:\r\n if item == 'x' and diff!=0:\r\n ans+='X'\r\n diff-=1\r\n else:\r\n ans += item\r\n print(ans)", "import math\r\na=int(input())\r\ny=input()\r\nsmallxc=0\r\nresult=\"\"\r\nfor i in range(0,a):\r\n if(y[i:i+1]==\"x\"):\r\n smallxc+=1 \r\nif smallxc==a//2:\r\n print(0)\r\n print(y) \r\nelse:\r\n counter=0\r\n if smallxc>a//2:\r\n for j in range(0,a):\r\n if(y[j:j+1]==\"x\"):\r\n result+=\"X\"\r\n counter+=1\r\n if counter==smallxc-(a//2):\r\n break\r\n else:\r\n result+=\"X\"\r\n result+=y[j+1:]\r\n \r\n \r\n else:\r\n for j in range(0,a):\r\n if(y[j:j+1]==\"X\"):\r\n result+=\"x\"\r\n counter+=1\r\n if counter==a//2-(smallxc):\r\n break\r\n else:\r\n result+=\"x\"\r\n result+=y[j+1:]\r\n \r\n print(abs(smallxc-(a//2)))\r\n print(result) ", "n = int(input())\r\ns = list(input())\r\nst = s.count('X')\r\nn2 = n // 2\r\nk = abs(n2 -st)\r\nif st > n2:\r\n for i in range(n):\r\n if s[i] == 'X': s[i]='x'\r\n if s.count('X') == n2: break\r\nelif st < n2:\r\n for i in range(n):\r\n if s[i] == 'x': s[i]='X'\r\n if s.count('X') == n2: break\r\nprint(k)\r\nprint(''.join(s))", "n = int(input())\r\ns = str(input())\r\nup = 0\r\ndown = 0\r\nfor i in s:\r\n if i.islower():\r\n down += 1\r\n else:\r\n up += 1\r\nif up == down:\r\n print(0)\r\n print(s)\r\n\r\nelif up > down:\r\n a = up - down\r\n b = a//2\r\n print(b)\r\n for i in s:\r\n if i.islower():\r\n print(i, end = '')\r\n else:\r\n if b > 0:\r\n print(i.lower(), end = '')\r\n b -= 1\r\n else:\r\n print(i, end = '')\r\n print('')\r\nelse:\r\n a = (down - up)\r\n b = a//2\r\n print(b)\r\n for i in s:\r\n if i.isupper():\r\n print(i, end = '')\r\n else:\r\n if b > 0:\r\n print(i.upper(), end = '')\r\n b -= 1\r\n else:\r\n print(i, end = '')\r\n print('')", "n = int(input())\r\ns=input()\r\na=s.count(\"X\")\r\nb=s.count(\"x\")\r\nstep=abs(a-b)//2\r\nprint(step)\r\ns=list(s)\r\nif a>b:\r\n c=0\r\n for i in range(n):\r\n if c==step:\r\n break\r\n if s[i]=='X':\r\n s[i]='x'\r\n c+=1 \r\nelse:\r\n c=0\r\n for i in range(n):\r\n if c==step:\r\n break\r\n if s[i]==\"x\":\r\n s[i]=\"X\"\r\n c+=1 \r\nprint(''.join(s)) \r\n", "import sys\nfrom collections import defaultdict\nfrom heapq import nlargest\nInput=lambda:map(int,input().split())\nn = int(input())\ns = input()\na = s.count('x')\nb = n//2\nprint(abs(b-a))\nif b < a:\n a-=b\n s = s.replace('x','X',a)\nelif b > a:\n b-=a\n s = s.replace('X','x',b)\nprint(s)", "n = int(input())\r\ns = input()\r\nm = s.count(\"X\")\r\nc=abs(n//2-m)\r\nprint(c)\r\nif m<n//2:\r\n print(str.replace(s, \"x\", \"X\", c))\r\nelse:\r\n print(str.replace(s, \"X\",\"x\",c))", "length = input()\r\nstring = input()\r\ntotal = 0\r\n\r\nwhile string.count('x') != string.count('X'):\r\n if string.count('x') > string.count('X'):\r\n string = string.replace('x', 'X', 1)\r\n else:\r\n string = string.replace('X', 'x', 1)\r\n total += 1\r\n \r\nprint(total, string, sep='\\n')", "#!/usr/bin/env python3\n\nfrom itertools import *\n\ndef read_ints():\n\treturn map(int, input().strip().split())\n\nn, = read_ints()\nx = input().strip()\n\nsit = 0\n\nfor c in x:\n\tif c=='x':\n\t\tsit+=1\n\nstandup = sit-n//2\ncopy = standup\n\nnewstr = [ '' ]\n\nfor c in x:\n\tif c=='x' and standup>0:\n\t\tnewstr.append('X')\n\t\tstandup -= 1\n\telif c=='X' and standup<0:\n\t\tnewstr.append('x')\n\t\tstandup += 1\n\telse:\n\t\tnewstr.append(c)\n\nprint(abs(copy))\nprint(''.join(newstr))\n", "n = int(input())\nnum = 0\ns = input()\ns1 = ''\nif s.count('x') < n//2:\n count = n//2 - s.count('x')\n print(count)\n for i in range(len(s)):\n if count == 0:\n print(s1+s[i:])\n break\n if s[i] == 'X':\n count -= 1\n s1 += 'x'\nelif s.count('x') > n//2:\n count = s.count('x') - n//2\n print(count)\n for i in range(len(s)):\n if count == 0:\n print(s1+s[i:])\n break\n if s[i] == 'x':\n count -= 1\n s1 += 'X'\nelse:\n print(0)\n print(s)", "length = int(input())\r\ntext = list(input())\r\n\r\nsitCount = standCount = 0 \r\n\r\nfor letter in text :\r\n if letter == \"X\" : standCount += 1\r\n else : sitCount += 1\r\n\r\n\r\nif sitCount == standCount : \r\n print(0)\r\n print(\"\".join(text))\r\n exit()\r\n \r\nlength //= 2\r\n\r\nsit = length - sitCount\r\nstand = length - standCount \r\n\r\nlarg = sit if sit > stand else stand\r\n\r\n\r\nflag = True if sit > stand else False\r\nifcontinue = True \r\n\r\n\r\nprint(larg)\r\n\r\nfor letter in text :\r\n if ifcontinue :\r\n if flag and letter == \"X\" : \r\n print(\"x\",end=\"\")\r\n larg -= 1\r\n elif not flag and letter == \"x\" : \r\n print(\"X\",end=\"\")\r\n larg -= 1\r\n else :\r\n print(letter,end=\"\") \r\n if larg == 0 : ifcontinue = False\r\n else :\r\n print(letter,end=\"\")", "n = int(input())\r\ns = input()\r\nf, t = 'x', 'X'\r\nc = n // 2 - s.count(t)\r\nif c < 0:\r\n f, t = t, f\r\n c = -c\r\nprint(c)\r\nfor ch in s:\r\n if ch == f and c > 0:\r\n print(t, end='')\r\n c -= 1\r\n else:\r\n print(ch, end='')", "n=int(input())\r\ns=input()\r\nans=[]\r\nc,C=0,0\r\nfor i in s:\r\n if i==\"x\":\r\n c+=1\r\n else:\r\n C+=1\r\n# print(c,C)\r\nif(c==C):\r\n print(\"0\")\r\n print(s)\r\nelse:\r\n mn=min(c,C)\r\n if mn == c:\r\n ch=\"x\"\r\n else:\r\n ch=\"X\"\r\n val=(len(s)//2)-mn\r\n print(val)\r\n # print(ch)\r\n for i in s:\r\n\r\n if (i != ch and mn < (len(s)//2)):\r\n ans.append(ch)\r\n mn+=1\r\n else:\r\n ans.append(i)\r\n\r\n for j in ans:\r\n print(j,end=\"\")", "n=int(input())\r\ns=input()\r\nMin=min(abs(n//2-s.count(\"X\")),abs(n//2-s.count(\"x\")))\r\nprint(Min)\r\nprint(s.replace(\"X\",\"x\",Min) if s.count(\"X\")>=s.count(\"x\") else s.replace(\"x\",\"X\",Min))", "n = int(input())\r\nk = input()\r\ntotal = k.count(\"x\")\r\nminutes = abs(total - (n // 2))\r\nif total > n//2 :\r\n k = k.replace(\"x\",\"X\",minutes)\r\nelif total < n//2 :\r\n k = k.replace(\"X\",\"x\",minutes)\r\n \r\nprint(\"{}\\n{}\".format(minutes,k))\r\n", "n = int(input())\na = input()\na = list(a)\nv1 = a.count('x')\nv2 = a.count('X')\nf = n//2 -min(v1,v2)\nprint(n//2 -min(v1,v2))\nif v1>v2:\n for i in range(n):\n if f == 0:\n break\n if a[i] == 'x':\n a[i] = 'X'\n f-=1\n \nelse:\n for i in range(n):\n if f == 0:\n break\n if a[i] == 'X':\n a[i] = 'x'\n f-=1\n \nfor i in range(n):\n print(a[i],end= '' )\n \n\n", "n = int(input())\r\ns = list(input())\r\na = s.count(\"X\")\r\nb = s.count(\"x\")\r\ny = []\r\ny.append(a)\r\ny.append(b)\r\ni = 0\r\nj = 0\r\nif a < b:\r\n o = \"X\"\r\n l = \"x\"\r\nelse:\r\n o = \"x\"\r\n l = \"X\"\r\nwhile i < abs(n//2 - y[0]) and j < len(s):\r\n if s[j] == l:\r\n s[j] = o\r\n i += 1\r\n j += 1\r\n\r\nprint(abs(n//2 - y[0]))\r\n\r\n\r\nprint(\"\".join(s))\r\n\r\n\r\n\r\n", "a = int(input())\r\n*q, = input()\r\ns = q.count('x')\r\nw = q.count('X')\r\nif w > s:\r\n print(a // 2 - s)\r\n for i in range(a // 2 - s):\r\n q[q.index('X')] = 'x'\r\nelse:\r\n print(a // 2 - w)\r\n for i in range(a // 2 - w):\r\n q[q.index('x')] = 'X'\r\nprint(''.join(q))\r\n", "n=int(input())\na=input()\nx=a.count('x')\nif 2*x>n:\n a=a.replace('x','X',x-n//2) \nelse:\n a=a.replace('X','x',n//2-x)\nl=abs((2*x-n)//2)\nprint(l)\nprint(a)", "n_hamsters: int = int(input())\nhamsters = input()\nhamsters_standing = len([ham for ham in hamsters if ham == \"X\"])\nhamsters_sitting = n_hamsters - hamsters_standing\n\nif hamsters_standing == hamsters_sitting:\n print(0)\n print(hamsters)\nelif hamsters_standing > hamsters_sitting:\n num_change = (hamsters_standing - hamsters_sitting) // 2\n print(num_change)\n result = \"\"\n for hamster in hamsters:\n if hamster == \"X\" and num_change > 0:\n result += \"x\"\n num_change -= 1\n else:\n result += hamster\n print(result)\nelse:\n num_change = (hamsters_sitting - hamsters_standing) // 2\n print(num_change)\n result = \"\"\n for hamster in hamsters:\n if hamster == \"x\" and num_change > 0:\n result += \"X\"\n num_change -= 1\n else:\n result += hamster\n print(result)\n", "from sys import stdin, stdout\r\nimport collections\r\nn = int(stdin.readline())\r\ninp = stdin.readline().strip()\r\ncounter = collections.Counter(inp)\r\nif counter['X'] == n//2:\r\n stdout.write('0\\n'+inp+'\\n')\r\nelse:\r\n reqA = n//2-counter['X']\r\n reqB = n//2-counter['x']\r\n if reqA > reqB:\r\n stdout.write(str(reqA)+'\\n')\r\n for i in inp:\r\n if i=='x' and reqA>0:\r\n stdout.write('X')\r\n reqA-=1\r\n else:\r\n stdout.write(i)\r\n else:\r\n stdout.write(str(reqB)+'\\n')\r\n for i in inp:\r\n if i=='X' and reqB>0:\r\n stdout.write('x')\r\n reqB-=1\r\n else:\r\n stdout.write(i)\r\n" ]

[ "m, n = input().split()\ncand = []\nfor i in range (int(m)):\n\tcand.append(0)\n\t\nfor i in range (int(n)):\n\ta = [int(x) for x in input().split()]\n\tcand[a.index(max(a))] += 1\n\t\nprint(cand.index(max(cand)) + 1)\n\t\n\t\n", "n, m = list(map(int,input().split()))\na = [0]*n\nfor i in range(m):\n\tb = list(map(int,input().split()))\n\tc = b.index(max(b))\n\ta[c] = a[c]+1\nprint(a.index(max(a))+1)\n\t\n", "x=list(map(int, input().split()))\r\nn=x[0]\r\nm=x[1]\r\nq=[]\r\nfor i in range(m):\r\n y=list(map(int, input().split()))\r\n p=y.index(max(y))+1\r\n q.append(p)\r\nfreq = {}\r\nfor item in q:\r\n if (item in freq):\r\n freq[item] += 1\r\n else:\r\n freq[item] = 1\r\nt=[k for k,v in freq.items() if float(v) == max(freq.values()) ]\r\nprint(min(t))", "n,m=map(int,input().split())\r\nc=[0]*n\r\nfor i in range (m):\r\n l=list(map(int,input().split()))\r\n c[l.index(max(l))]+=1\r\nprint(c.index(max(c))+1)", "def main():\r\n\tn,m = map(int,input().split())\r\n\tcandidates = [ 0 for _ in range(n+1)]\r\n\tfor _ in range(m):\r\n\t\tarr = list(map(int,input().split()))\r\n\t\ttemp = -1 \r\n\t\tmx = -1\r\n\t\tfor i in range(n):\r\n\t\t\tif mx<arr[i]:\r\n\t\t\t\tmx = arr[i]\r\n\t\t\t\ttemp = i+1\r\n\t\tcandidates[temp]+=1\r\n\ttemp = -1 \r\n\tmx = -1 \r\n\tfor i in range(n+1):\r\n\t\tif mx<candidates[i]:\r\n\t\t\tmx = candidates[i]\r\n\t\t\ttemp = i\r\n\tprint(temp)\r\nmain()", "n,m=map(int,input().split())\r\nc=[0]*n\r\nfor i in range(m):\r\n\tv=list(map(int,input().split()))\r\n\tc[v.index(max(v))]+=1\r\nprint(c.index(max(c))+1)", "def argmax(lst):\r\n return lst.index(max(lst))\r\nn,m = (int(i) for i in input().split(\" \"))\r\n\r\narr = {}\r\nfor _ in range(m):\r\n x = [int(i) for i in input().split(\" \")]\r\n y = argmax(x)\r\n arr[y] = arr.get(y,0)+1\r\n \r\nc = -1\r\nc2 = -1\r\nfor i,j in arr.items():\r\n if j>c:\r\n c = j\r\n c2 = i\r\n elif j==c:\r\n c2 = min(c2,i)\r\n \r\nprint(c2+1)\r\n ", "\r\nn,m=map(int,input().split())\r\nc=[0]*n\r\nfor i in range(m):\r\n\tl=list(map(int,input().split()))\r\n\tc[(l.index(max(l)))]+=1\r\nprint(c.index(max(c))+1)", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(m):\r\n temp = list(map(int, input().split()))\r\n a.append(temp.index(max(temp)))\r\ntemp = [0] * n\r\nfor i in a:\r\n temp[i] += 1\r\nprint(temp.index(max(temp)) + 1)\r\n", "# n candidates\n# m cities\n\nn, m = list(map(int, input().split(\" \")))\ncandidates = [0 for _ in range(n)]\nvotes_list = list()\nfor _ in range(m):\n votes_list.append(list(map(int, input().split(\" \"))))\n\nfor votes in votes_list:\n candidates[votes.index(max(votes))] += 1\n\nprint(candidates.index(max(candidates)) + 1)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-30 23:39:33\nLastEditTime: 2021-11-30 23:58:53\nDescription: Elections\nFilePath: CF570A.py\n'''\n\n\ndef func():\n m, n = map(int, input().strip().split())\n vote = []\n for i in range(n):\n city = list(map(int, input().strip().split()))\n vote.append(city.index(max(city)) + 1)\n votes = []\n for item in set(vote):\n votes.append([item, vote.count(item)])\n print(max(votes, key=lambda el:el[1])[0])\n\n\nif __name__ == '__main__':\n func()\n ", "n,m=map(int,input().split())\r\nd=[0 for i in range(n)]\r\nfor i in range(m):\r\n s=list(map(int,input().split()))\r\n a=s.index(max(s))\r\n d[a]+=1\r\nprint(d.index(max(d))+1)\r\n", "n,m=map(int,input().split())\r\na=[]\r\nw=[]\r\n\r\n# n-candidates\r\n# m-votes\r\n\r\nfor i in range(m):\r\n\ta = list(map(int,input().split()))\r\n\tw.append(a.index(max(a))+1)\r\n\r\nbset=set(w)\r\nmpst_common=None\r\nqty=0\r\nfor item in bset:\r\n q=w.count(item)\r\n if q>qty:\r\n qty=q\r\n mpst_common=item\r\nprint(mpst_common)", "n,m=map(int,input().split())\r\nwins=[0]*n\r\nfor _ in range(m):\r\n a=list(map(int,input().split()))\r\n wins[a.index(max(a))]+=1\r\nprint(wins.index(max(wins))+1)\r\n", "def main():\r\n\tn,m=tuple(map(int,input().split()))\r\n\tL=[0 for _ in range(m)]\r\n\tfor i in range(m):\r\n\t\ta=list(map(int,input().split()))\r\n\t\tL[i]=a.index(max(a))\r\n\tre=[0 for _ in range(n)]\r\n\tfor k in range(n):\r\n\t\tre[k]=L.count(k)\r\n\tprint(re.index(max(re))+1)\r\nif __name__=='__main__':\r\n\tmain()", "nm = input().split()\r\ng = []\r\nfor i in range(int(nm[1])) :\r\n m = 0\r\n k = 0\r\n s = input().split()\r\n for j in range(int(nm[0])):\r\n if int(s[j])>m :\r\n m = int(s[j])\r\n k = j\r\n g.append(k)\r\nh = list(0 for i in range(int(nm[0])))\r\nfor i in g :\r\n h[i] +=1\r\nk = 0\r\nl = 0\r\nfor i in range(int(nm[0])) :\r\n if h[i] >l :\r\n l = h[i]\r\n k = i\r\nprint(k+1)\r\n", "n, m = map(int, input().split())\r\n\r\nwins = [0]*n\r\nfor _ in range(m):\r\n t = list(map(int, input().split()))\r\n winner = 0\r\n for x in range(1, n): \r\n if t[x] > t[winner]: winner = x\r\n\r\n wins[winner] += 1\r\n\r\nwinner = 0\r\nfor x in range(1, n):\r\n if wins[x] > wins[winner]: winner = x\r\n\r\nprint(winner+1)\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\n# For getting input from input.txt file\r\n#sys.stdin = open('input.txt', 'r')\r\n# Printing the Output to output.txt file\r\n# sys.stdout = open('output.txt', 'w')\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\ncandidate = [0]*n\r\na = []\r\nfor i in range(m):\r\n a.append(inlist())\r\n\r\nfor city in a:\r\n mx = -1\r\n mxi = 0\r\n\r\n for i in range(n):\r\n if city[i] > mx:\r\n mx = city[i]\r\n mxi = i\r\n candidate[mxi] += 1\r\n\r\nmx = -1\r\nmxi = 0\r\n\r\nfor i in range(n):\r\n if candidate[i] > mx:\r\n mx = candidate[i]\r\n mxi = i\r\nprint(mxi+1)\r\n", "n,m=map(int,input().split())\r\np=[]\r\nfor _ in range(m):\r\n l=list(map(int,input().split()))\r\n a=max(l)\r\n p.append(l.index(a))\r\np.sort()\r\nprint(max(set(p), key = p.count)+1)", "n , m = (list)(map(int , input().split()))\r\ncount = [0 for _ in range(n)]\r\nans = -1\r\nmaxi = -1\r\nfor _ in range(m) :\r\n winner = -1\r\n max = -1\r\n a = (list)(map(int , input().split()))\r\n for __ in range(n) :\r\n if a[__] > max :\r\n winner = __\r\n max = a[__]\r\n count[winner] += 1\r\n if maxi < count[winner] :\r\n maxi = count[winner]\r\n ans = winner\r\n elif maxi == count[winner] :\r\n ans = min(ans , winner)\r\nprint(ans + 1)", "n, m = map(int, input().split())\r\nwinnerList = []\r\nfor i in range(m):\r\n a = list(map(int, input().split()))\r\n large = a[0]\r\n pos = 0\r\n for j in range(n):\r\n if(large < a[j]):\r\n large = a[j]\r\n pos = j\r\n winnerList.append(pos+1)\r\nwinnerCount = dict()\r\nfor j in winnerList:\r\n winnerCount[j] = 0\r\nfor j in winnerList:\r\n winnerCount[j] += 1\r\nlarge = 0\r\nkey = 0\r\nfor j in winnerCount:\r\n if(large < winnerCount[j]):\r\n large = winnerCount[j]\r\n key = j\r\nprint(key)", "n,m = list(map(int,input().split()))\r\nb=[]\r\nfor _ in range(m):\r\n a = list(map(int,input().split()))\r\n k = 0\r\n for i in range(1,n):\r\n if a[i]>a[k]:\r\n k=i\r\n b.append(k+1)\r\nb.sort()\r\nt,k=0,0\r\nfor i in range(0,m):\r\n j=i+1\r\n while (j<m and b[j]==b[i]):\r\n j+=1\r\n if j-i>t:\r\n t=j-i\r\n k=b[i]\r\n i=j\r\nprint(k)", "is_debug = False\r\n\r\nn, m = map(int, input().split())\r\n\r\nv = [0]*n\r\nfor _ in range(m):\r\n a = list(map(int, input().split()))\r\n \r\n c = -1\r\n x = -1\r\n for i in range(len(a)):\r\n if x < a[i]:\r\n c = i\r\n x = a[i]\r\n print(f\"c={c}\") if is_debug else ''\r\n\r\n v[c] += 1\r\nprint(f\"v={v}\") if is_debug else ''\r\n\r\nc = 0\r\nx = -1\r\nfor i in range(len(v)):\r\n if x < v[i]:\r\n c = i\r\n x = v[i]\r\n\r\nprint(f\"{c+1}\")\r\n", "n, m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n temp=list(map(int,input().split()))\r\n a=temp[0]\r\n b=1\r\n for j in range(n):\r\n if temp[j]>a:\r\n a=temp[j]\r\n b=j+1\r\n l.append(b) \r\n\r\nc=l.count(1)\r\nd=1\r\nfor i in range(n):\r\n if l.count(i+1)>c:\r\n c=l.count(i+1)\r\n d=i+1\r\nprint(d) \r\n \r\n \r\n\r\n\r\n \r\n \r\n", "n,m = map(int,input().split())\r\nans = [0] * n\r\nfor i in range(m):\r\n line = input().split()\r\n line = [int(i) for i in line]\r\n ans[line.index(max(line))] += 1\r\nprint(ans.index(max(ans)) + 1)\r\n", "n, m = [int(i) for i in input().split()]\r\na = [0] * n\r\nfor i in range(m):\r\n cur = [int(i) for i in input().split()]\r\n a[cur.index(max(cur))] += 1\r\nprint (1 + a.index(max(a)))", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nimport math, fractions\r\n# ===============================\r\nn, m = [int(x) for x in input().split()]\r\nq = [0]*n\r\nfor _ in range(m):\r\n\ttemp = [int(x) for x in input().split()]\r\n\tq[temp.index(max(temp))] += 1\r\nprint(q.index(max(q))+1)", "n, m = map(int, input().split())\nList = []\nfor i in range(m):\n temp = list(map(int, input().split()))\n List.append(temp)\ncandidate = [0 for i in range(n)]\nfor i in range(m):\n max = List[i][0]\n id = 0\n for j in range(1,n):\n if max < List[i][j]:\n max = List[i][j]\n id = j\n candidate[id]+=1\nid = 0\nmax = candidate[0]\nfor i in range(n):\n if max < candidate[i]:\n max = candidate[i]\n id = i\n \n\nprint(id+1)\n \n\n \t\t \t\t\t \t\t\t \t\t\t \t\t\t \t", "#n = int(input())\r\nn, m = map(int, input().split())\r\n#s = input()\r\na = [0] * n\r\nfor i in range(m):\r\n c = list(map(int, input().split()))\r\n a[c.index(max(c))] += 1\r\nprint(a.index(max(a)) + 1)", "def main():\r\n n, m = list(map(int, input().split()))\r\n arr = [list(map(int, input().split())) for _ in range(m)]\r\n\r\n score_list = []\r\n for i in range(m):\r\n mx = max(arr[i])\r\n score_list.append(arr[i].index(mx) + 1)\r\n\r\n temp_dict = {}\r\n for element in score_list:\r\n if element not in temp_dict:\r\n temp_dict[element] = 1\r\n else:\r\n temp_dict[element] += 1\r\n\r\n mx = max(temp_dict.values())\r\n print(min([key for key, value in temp_dict.items() if value == mx]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def line_input():\r\n return [int(i) for i in input().split()]\r\n\r\nif __name__ == '__main__':\r\n n, m = line_input()\r\n votes = []\r\n for i in range(m):\r\n votes.append(line_input())\r\n winner = 0\r\n winner_lst= [0]*n\r\n for city in votes:\r\n winner_lst[city.index(max(city))] += 1\r\n winner = winner_lst.index((max(winner_lst)))\r\n\r\n\r\n print(winner+1)\r\n", "n, m=map(int, input().split())\r\nc=[0]*n\r\nfor i in range(m):\r\n l=list(map(int, input().split()))\r\n c[l.index(max(l))]+=1\r\n \r\nprint(c.index(max(c))+1)", "# 570A\r\na = input().split()\r\na = list(map(int,a))\r\nn = a[0]\r\nm = a[1]\r\nwotes = [0]*n\r\nfor q in range(m):\r\n a = input().split()\r\n a = list(map(int,a))\r\n winner = -1 \r\n mx = -1\r\n for j in range(n):\r\n if a[j] > mx:\r\n mx = a[j]\r\n winner = j\r\n wotes[winner] += 1\r\nwinner = -1 \r\nmx = -1\r\nfor j in range(n):\r\n if wotes[j] > mx:\r\n mx = wotes[j]\r\n winner = j\r\nprint(winner+1)", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\nn,m = map(int, input().split())\r\n\r\nres = []\r\nfor _ in range(m):\r\n\tls = list(map(int, input().split()))\r\n\tmlsi = ls.index(max(ls))\r\n\tres.append(mlsi)\r\n\r\nresCit = [0]*(max(res)+1)\r\nfor r in res:\r\n\tresCit[r]+=1\r\nprint(resCit.index(max(resCit))+1)", "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, m = IA()\r\n a = [0]*n \r\n for i in range(m):\r\n c = IA()\r\n m = max(c)\r\n index = c.index(m)\r\n a[index] += 1\r\n w = max(a)\r\n i = a.index(w)\r\n return i+1\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n,m=map(int,input().split())\r\nwin=list()\r\nfor j in range(n):\r\n win.append(0)\r\nfor i in range(m):\r\n a=list(map(int,input().split()))\r\n c=max(a)\r\n for k in range(n):\r\n if a[k]==c:\r\n win[k]+=1\r\n break\r\nd=max(win)\r\nfor i in range(n):\r\n if win[i]==d:\r\n print(i+1)\r\n quit()\r\n \r\n \r\n", "\r\n\r\ndef main_function():\r\n n, m = [int(i) for i in input().split(\" \")]\r\n data = [[int(i) for i in input().split(\" \")] for i in range(m)]\r\n candidates = [0 for i in range(n)]\r\n for i in data:\r\n candidates[i.index(max(i))] += 1\r\n print(candidates.index(max(candidates)) + 1)\r\n\r\n\r\n\r\nmain_function()\r\n\r\n", "import sys\nn, m = map(int, sys.stdin.readline().split())\nblist = [0] * n\nfor i in range(m):\n alist = list(map(int, sys.stdin.readline().split()))\n m = max(alist)\n idx = alist.index(m)\n blist[idx] += 1\nm = max(blist)\nprint(1+blist.index(m))\n", "n,m = [int(x) for x in input().split()]\r\na = [[int(x) for x in input().split()] for i in range(m) ]\r\n#print(a)\r\nfirstStage = [1]*m\r\neachperson = {}\r\nfor i in range(1,n+1):\r\n eachperson[i] = 0\r\n#print(firstStage)\r\n\r\nmav1 = 1\r\nmav2 = 0\r\n#print(type(eachperson),eachperson)\r\nfor i in range(m):\r\n maxV1 = 0\r\n for j in range(n):\r\n if a[i][j] > maxV1:\r\n maxV1 = a[i][j]\r\n firstStage[i] = j+1\r\n eachperson[ firstStage[i] ] += 1\r\n\r\nfor x in eachperson:\r\n if eachperson[x] > mav2:\r\n mav1 = x\r\n mav2 = eachperson[x]\r\n#print(eachperson)\r\nprint(mav1) ", "n,m = map(int,input().split())\r\ns = []\r\nfor i in range(n) :\r\n s.append(0)\r\nfor i in range(m) :\r\n a = list(map(int,input().split()))\r\n s[a.index(max(a))] += 1\r\nprint(s.index(max(s))+1)", "input_1=input().split(\" \")\r\ncand_count=int(input_1[0])\r\ncities_count=int(input_1[1])\r\nwiners_list=[]\r\nfor i in range(cities_count):\r\n x=input().split()\r\n x_num=[]\r\n \r\n for j in range(cand_count):\r\n x_num.append(int(x[j]))\r\n winer=max(x_num)\r\n winer_index=x_num.index(winer)\r\n winers_list.append(winer_index+1)\r\ntimes_of_win=[]\r\nfor i in range(1,cand_count+1):\r\n times_of_win.append(winers_list.count(i))\r\nprint(times_of_win.index(max(times_of_win))+1)\r\n ", "n,m=list(map(int,input().split()))\r\n\r\nb=[]\r\nfor _ in range(m):\r\n\ta=list(map(int,input().split()))\r\n\tb.append(a.index(max(a))+1)\r\n\r\nd={}\r\nfor i in range(1,n+1):\r\n\td[i]=b.count(i)\r\n\r\ns=set(b)\r\nc=[]\r\nfor i in s:\r\n\tc.append(b.count(i))\r\n\r\nfor i in d:\r\n\tif d[i]==max(c):\r\n\t\tprint(i)\r\n\t\tbreak", "n,m=map(int,input().split())\r\nx=[0]*n\r\nwhile(m):\r\n a=list(map(int,input().split()))\r\n b=max(a)\r\n x[a.index(b)]+=1\r\n m-=1\r\nc=max(x)\r\nprint(x.index(c)+1)", "def arr_int(arr):\r\n for i in range(len(arr)):\r\n arr[i]=int(arr[i])\r\n return (arr)\r\ndef winner(lista):\r\n max_list=max(lista)\r\n ans=0\r\n for i in range(len(lista)):\r\n if lista[i]==max_list:\r\n ans=i\r\n break\r\n return ans\r\ndef main():\r\n n,m=input().split()\r\n arr_can=[]\r\n for i in range(int(n)):\r\n arr_can.append(0)\r\n for i in range(int(m)):\r\n city=input().split()\r\n city=arr_int(city)\r\n win=winner(city)\r\n arr_can[win]+=1\r\n ans=winner(arr_can)\r\n print(ans+1)\r\n\r\nmain()", "n,m=map(int,input().split())\r\ncandi=[]\r\nfor i in range(m):\r\n k=list(map(int,input().split()))\r\n maxi=max(k)\r\n ind=k.index(maxi)\r\n candi.append(ind)\r\na=set(candi)\r\nmax=0\r\nval=0\r\nfor i in a:\r\n p=candi.count(i)\r\n if p>max:\r\n max=p\r\n val=i\r\n elif p==max:\r\n if i<val:\r\n val=i\r\nprint(val+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 ", "n, m = map(int, input().split())\r\nList = []\r\nfor i in range(m):\r\n temp = list(map(int, input().split()))\r\n List.append(temp)\r\ncandidate = [0 for i in range(n)]\r\nfor i in range(m):\r\n max = List[i][0]\r\n id = 0\r\n for j in range(1,n):\r\n if max < List[i][j]:\r\n max = List[i][j]\r\n id = j\r\n candidate[id]+=1\r\nid = 0\r\nmax = candidate[0]\r\nfor i in range(n):\r\n if max < candidate[i]:\r\n max = candidate[i]\r\n id = i\r\n \r\n\r\nprint(id+1)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n z=list(map(int,input().split()))\r\n l.append(z.index(max(z))+1)\r\nk=set(l)\r\ncnt=0\r\ncnt1=0\r\nfor j in k:\r\n if l.count(j)>cnt:\r\n cnt=l.count(j)\r\n cnt1=j\r\nprint(cnt1)", "n,m=list(map(int,input().split()))\r\nb=[0]*n\r\nfor i in range(m):\r\n a=list(map(int,input().split()))\r\n k=a.index(max(a))\r\n b[k]+=1\r\nprint(b.index(max(b))+1)\r\n ", "a,b=map(int,input().split())\narr=[0]*102\nh=0\nwhile(b):\n b-=1\n l=list(map(int,input().split()))\n h=max(l)\n arr[l.index(h)]+=1\nprint(arr.index(max(arr))+1)\n\n\t \t\t \t\t \t\t\t \t\t\t\t\t \t", "n, m = map(int, input().split())\r\nd = {}\r\nfor i in range(m):\r\n a = list(map(int, input().split()))\r\n d[a.index(max(a))+1] = d.get(a.index(max(a))+1, 0) + 1 \r\nans = []\r\nfor i in d.keys():\r\n if d[i] == max(d.values()):\r\n ans.append(i)\r\nprint(min(ans))", "n, m = map(int, input().split())\r\nscore = [0 for i in range(n)]\r\nfor i in range(m):\r\n a = list(map(int, input().split()))\r\n maximum = -1\r\n index = -1\r\n for j in range(len(a)):\r\n if(maximum < a[j]):\r\n maximum = a[j]\r\n index = j\r\n score[index] += 1\r\nmaximum = -1\r\nindex = -1\r\nfor i in range(len(score)):\r\n if(maximum < score[i]):\r\n maximum = score[i]\r\n index = i\r\nprint(index + 1)", "n,c=[int(x)for x in input().split()]\na=[]\nb=[]\nfor i in range(c):\n\tb=[int(x)for x in input().split()]\n\ta.append(b)\n\nf=[0]*((n))\nfor i in range(c): \n\tmaxpos=a[i].index(max(a[i]))\n\tf[maxpos]+=1\nprint(f.index(max(f))+1)\n\t# maxpos = a.index(max(a)) \n\n# a=[1,2,3,4,1,3,1]\n# f=[0]*(len(a))\n# for i in range(len(a)):\n# \tf[a[i]]+=1\n\n# print(f)", "N,M = map(int,input().split())\r\na = list(list(map(int,input().split()))for i in range(M))\r\nc = [0]*N\r\nfor i in range(M):\r\n c[a[i].index(max(a[i]))]+=1\r\nprint(c.index(max(c))+1)\r\n ", "n, m = map(int, input().split())\n\nfirst_win = [0 for _ in range(n+1)]\nwins = [0 for _ in range(n+1)]\n\nfor city in range(m):\n a = list(map(int, input().split()))\n w = 1\n for i in range(2, n+1):\n if a[w - 1] < a[i-1]:\n w = i\n\n if first_win[w] == 0:\n first_win[w] = city + 1\n\n wins[w] += 1\n\nwinner, M, fw = -1, max(wins), n + 5\n\nfor i in range(1, n+1):\n if wins[i] == M:\n print(i)\n break;\n # if wins[i] == M and fw > first_win[i]:\n # winner = i\n # fw = first_win[i]\n\n# print(winner)\n", "n,m=map(int,input().split())\r\na=[0]*n;\r\nfor i in range(0,m):\r\n l=list(map(int,input().split()))\r\n c=l.index(max(l))\r\n a[c]=a[c]+1\r\nprint(a.index(max(a))+1)\r\n ", "n,m=list(map(int,input().split()))\r\na=[]\r\nfor i in range(m):\r\n a.append(list(map(int,input().split())))\r\nwon=[0]*n\r\nfor i in range(m):\r\n mai=0\r\n for j in range(n):\r\n if a[i][j]>a[i][mai]:\r\n mai=j\r\n won[mai]+=1\r\nmaxx=0\r\nfor i in range(n):\r\n if won[i]>won[maxx]:\r\n maxx=i\r\nprint(maxx+1)", "\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\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\r\n def check(lst):\r\n cnt = dict()\r\n ind = -1\r\n for num in lst:\r\n cnt[num] = cnt.get(num, 0) + 1\r\n if ind == -1 or cnt[num] > cnt[ind] or (cnt[num] == cnt[ind] and num < ind):\r\n ind = num\r\n return ind\r\n\r\n res = []\r\n for _ in range(m):\r\n cur = ac.read_list_ints()\r\n res.append(cur.index(max(cur)) + 1)\r\n ac.st(check(res))\r\n return\r\n\r\n\r\nSolution().main()\r\n", "n,m=map(int,input().split())\r\nk=[]\r\nfor i in range(m):\r\n l=[int(q) for q in input().split()]\r\n k.append(l.index(max(l)))\r\ncount=[]\r\nfor i in range(n):\r\n count.append(k.count(i))\r\nprint(1+count.index(max(count)))", "a,b=map(int,input().split())\r\nc=[]\r\nfor i in range(b):\r\n l=list(map(int,input().split()))\r\n c.append(l.index(max(l))+1)\r\nmax=0\r\nf=0\r\nfor j in range(1,a+1):\r\n if c.count(j)>max:\r\n max=c.count(j)\r\n f=j\r\nprint(f)", "import sys\r\nn,m=[int(i) for i in input().split(\" \")]\r\nsum1=[0 for i in range(n)]\r\nfor i in range(m):\r\n sum2=[int (i) for i in input().split(\" \")]\r\n for j in range(n):\r\n if sum2[j]==max(sum2):\r\n sum1[j]+=1\r\n break\r\nfor j in range(n):\r\n if sum1[j]==max(sum1):\r\n print(j+1)\r\n break\r\n", "n, m = map(int,input().split())\r\na = []\r\nwhile m>0:\r\n lst = list(map(int, input().split()))\r\n a.append(lst.index(max(lst)))\r\n m-=1\r\n\r\na.sort()\r\nb = set(a)\r\nx= 0\r\nfor i in b:\r\n if a.count(i) > x:\r\n x= a.count(i)\r\n y = i\r\nprint(y+1)", "n, m = map(int, input().split())\r\nsitywin = []\r\n\r\nfor i in range(1, m+1):\r\n\tli = list(map(int, input().split()))\r\n\tsitywin.append(li.index(max(li)) + 1)\r\n\r\nwinner = 0\r\nvote = 0\r\nfor i in range(1, n+1):\r\n\tv = sitywin.count(i)\r\n\tif v > vote:\r\n\t\twinner = i\r\n\t\tvote = v\r\nprint(winner)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jul 17 20:17:51 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn,m = map(int, input().split())\r\n\r\nl = [0]*n\r\nfor i in range(m):\r\n k = list(map(int, input().split()))\r\n l[k.index(max(k))]+=1\r\n\r\nprint(l.index(max(l)) +1)\r\n ", "n, m = [int(i) for i in input().split()]\r\nls = list()\r\nfor i in range(n):\r\n\tls.append(0)\r\nfor i in range(m):\r\n\tcity = [int(i) for i in input().split()]\r\n\twin = 0\r\n\twinv = 0\r\n\tfor j in range(n):\r\n\t\tif city[j] > winv:\r\n\t\t\twin = j\r\n\t\t\twinv = city[j]\r\n\tls[win] += 1\r\nmaxv=0\r\nwin=0\r\nfor i in range(n):\r\n\tif ls[i] > maxv:\r\n\t\twin = i+1\r\n\t\tmaxv = ls[i]\r\nprint(win)", "n,m=map(int, input().split())\r\nd=[0]*n\r\nfor i in range(m):\r\n l=list(map(int,input().split()))\r\n c=l.index(max(l))\r\n d[c]+=1\r\nprint(d.index(max(d))+1)", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nd=defaultdict(int)\r\nfor _ in range(m):\r\n a=list(map(int,input().strip().split()))\r\n mx=max(a)\r\n for i in range(n):\r\n if a[i]==mx:break\r\n d[i+1]+=1\r\nmx=0\r\nfor x in d:\r\n if d[x]>mx:mx=d[x]\r\nb=[]\r\nfor x in d:\r\n if d[x]==mx:b.append(x)\r\nb.sort()\r\nprint(b[0])", "a,b=map(int,input().split())\r\nc=[0]*a\r\nfor i in range(b):\r\n *d,=map(int,input().split())\r\n c[d.index(max(d))]+=1\r\nprint(c.index(max(c))+1)\r\n", "# LUOGU_RID: 101605745\n(n, m), *a = [[*map(int, s.split())] for s in open(0)]\r\nc = [0] * n\r\nfor x in a:\r\n c[x.index(max(x))] += 1\r\nprint(c.index(max(c)) + 1)", "a=list(map(int, input(). split()))\r\nm=[0]*a[0]\r\nfor i in range(a[1]):\r\n n=list(map(int, input().split()))\r\n m[n.index(max(n))]+=1\r\nprint(m.index(max(m))+1)", "# 570A\r\n# θ(n*m) time\r\n# θ(n + m) space\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\n# SOLUTION\r\n\r\ndef main():\r\n n, m = read(3)\r\n c = [0] * n\r\n for _ in range(m):\r\n mx = mx_i = -1\r\n v = read(3)\r\n for i in range(n):\r\n if v[i] > mx:\r\n mx = v[i]\r\n mx_i = i\r\n c[mx_i] += 1\r\n mx = mx_i = -1\r\n for i in range(n):\r\n if c[i] > mx:\r\n mx = c[i]\r\n mx_i = i\r\n return mx_i + 1\r\n\r\n\r\n# HELPERS\r\n\r\n\r\ndef read(mode=1, size=None):\r\n # 0: String\r\n # 1: Integer\r\n # 2: List of strings\r\n # 3: List of integers\r\n # 4: Matrix of integers\r\n if mode == 0: return input().strip()\r\n if mode == 1: return int(input().strip())\r\n if mode == 2: return input().strip().split()\r\n if mode == 3: return list(map(int, input().strip().split()))\r\n a = []\r\n for _ in range(size):\r\n a.append(read(3))\r\n return a\r\n\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = ''\r\n if isinstance(s, tuple) or isinstance(s, list): s = ' '.join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\\n\")\r\n\r\n\r\nres = main()\r\nwrite(res)", "candidates, cities = map(int, input().split())\r\ncandidate = [0 for i in range(candidates)]\r\nfor i in range(cities):\r\n first = list(map(int, input().split()))\r\n candidate[first.index(max(first))] += 1\r\nprint(candidate.index(max(candidate))+1)", "\r\n\r\nn,m=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(0,m):\r\n a=list(map(int,input().split()))\r\n c=max(a)\r\n for j in range(0,n):\r\n if a[j]==c:\r\n x.append(j+1)\r\n break\r\n else:\r\n continue\r\nz=0\r\nzz=[]\r\nfor j in range(0,n):\r\n for i in range(0,m):\r\n if x[i]==j+1:\r\n z+=1\r\n else:\r\n continue\r\n zz.append(z)\r\n z=0\r\nd=max(zz)\r\nfor i in range(0,n):\r\n if zz[i]==d:\r\n print(i+1)\r\n break\r\n else:\r\n continue\r\n", "def list(l):\r\n\td=[]\r\n\tfor i in range(len(l)):\r\n\t\td.append(int(l[i]))\r\n\treturn d\r\nl=input()\r\nl=l.split()\r\nn=int(l[0])\r\nm=int(l[1])\r\ns=[]\r\nfor k in range(n):\r\n\ts.append(0)\r\nfor i in range(m):\r\n\ta=list(input().split())\r\n\tj=a.index(max(a))\r\n\ts[j]+=1\r\nprint(s.index(max(s))+1)", "n,m=list(map(int,input().split()))\r\na=[0 for i in range(n)]\r\nfor i in range(m):\r\n b=list(map(int,input().split()))\r\n c=-1\r\n d=0\r\n for j in range(n):\r\n if b[j]>c:\r\n c=b[j]\r\n d=j\r\n a[d]+=1\r\nc=-1\r\nd=0\r\nfor j in range(n):\r\n if a[j]>c:\r\n c=a[j]\r\n d=j\r\nprint(d+1)", "n,m=map(int,input().split())\r\nq=[0 for x in range(n)]\r\nfor i in range(m):\r\n l=[int(x) for x in input().split()]\r\n q[(l.index(max(l)))]+=1\r\nprint(q.index(max(q))+1)\r\n", "n, m = [int(i) for i in input().split()]\r\nlst = [[int(i) for i in input().split()] for j in range(m)]\r\na, b = [0] * m, [0] * n\r\nfor i in range(m):\r\n a[i] = lst[i].index(max(lst[i])) + 1\r\nfor i in range(n):\r\n b[i] = a.count(i + 1)\r\nprint(b.index(max(b)) + 1)\r\n", "string = input()\r\nnumbers = string.split(\" \")\r\ncandidates = int(numbers[0])\r\ncities = int(numbers[1])\r\nwins = [0 for x in range(candidates)]\r\nfor x in range(cities):\r\n string = input()\r\n votes = string.split(\" \")\r\n for y in range(candidates):\r\n votes[y] = int(votes[y])\r\n maximum = max(votes)\r\n candidate = votes.index(maximum)\r\n wins[candidate] += 1\r\nmaximum = max(wins)\r\ncandidate = wins.index(maximum)\r\nprint(candidate + 1)", "from math import *\r\n\r\ndef Max(v: list[int]):\r\n idx, max = -1, -1\r\n for cIdx, cVal in enumerate(v):\r\n if cVal > max: idx, max = cIdx, cVal\r\n return idx\r\n\r\ndef main():\r\n cdt, ct = [int(i) for i in input().split()]\r\n \r\n cdts = [0] * 200\r\n for _ in range(ct):\r\n round1 = [int(i) for i in input().split()]\r\n winner = Max(round1) + 1\r\n cdts[winner] += 1\r\n \r\n idx, max = -1, -1\r\n for cIdx, cVal in enumerate(cdts):\r\n if cVal > max: idx, max = cIdx, cVal\r\n print(idx)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from operator import itemgetter\r\n\r\nfl=input().split()\r\n\r\nn=int(fl[0])\r\nm=int(fl[-1])\r\n\r\nl=[]\r\nfor _ in range(m):\r\n l.append(list(map(int,input().split())))\r\n\r\nresf=[]\r\nfor i in l:\r\n resf.append(i.index(max(i))+1)\r\nm=0\r\nfor i in resf:\r\n if m<resf.count(i):\r\n m=resf.count(i)\r\noutput=[(a,resf.count(a)) for a in resf]\r\n# # output=list(set(output))\r\n# output.sort(key=lambda x: (x[1], x[0]))\r\n# sorted(output,key=itemgetter(1))\r\noutput=list(set(output))\r\n\r\nres=[]\r\n\r\nfor i in output:\r\n if i[1]==m:\r\n res.append(i[0])\r\nprint(min(res))\r\n\r\n\r\n", "n,m=[int(x) for x in input().split()]\r\nfinal=[[0,i] for i in range(n)]\r\nfor i in range(m):\r\n result=[int(x) for x in input().split()]\r\n first=[[result[j],j] for j in range(n)]\r\n first=sorted(first, key=lambda x:(-x[0],x[1]))\r\n final[first[0][1]][0]+=1\r\nfinal=sorted(final, key=lambda x:(-x[0],x[1]))\r\nprint(final[0][1]+1)\r\n", "x, y = list(map(int, input().split()))\r\nlista = []\r\nans = [0]*x\r\nfor i in range(y):\r\n lista.append(list(map(int, input().split())))\r\n\r\nfor i in range(y):\r\n ans[lista[i].index(max(lista[i]))]+=1\r\n\r\nprint(ans.index(max(ans))+1)\r\n \r\n", "from bisect import bisect_right\r\nimport math\r\nfrom queue import PriorityQueue\r\nfrom sys import stdin, stdout\r\nimport collections\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n, m = multi_input()\r\n a = [list_input(int) for i in range(m)]\r\n res = [0 for i in range(n)]\r\n for i in range(m):\r\n ind = -1\r\n mval = -1\r\n for j in range(n):\r\n if a[i][j] > mval:\r\n mval = a[i][j]\r\n ind = j\r\n res[ind] += 1\r\n ind = -1\r\n mval = -1\r\n for i in range(n):\r\n if res[i] > mval:\r\n mval = res[i]\r\n ind = i\r\n print(f\"{ind+1}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def solve():\r\n n, m = input().split()\r\n n, m = int(n), int(m)\r\n\r\n w = []\r\n win = [0] * n\r\n\r\n for i in range(m):\r\n p = list(map(int, input().split()))\r\n w.append(p.index(max(p)))\r\n\r\n win[w[-1]] += 1\r\n\r\n return win.index(max(win)) + 1\r\n\r\n\r\nprint(solve())", "n,mm=map(int,input().split())\r\nl=[0]*n\r\nfor i in range(mm):\r\n d=list(map(int,input().split()))\r\n l[d.index(max(d))]+=1\r\nprint(l.index(max(l))+1)\r\n", "#\r\n# Bad codeforces template TM\r\n#\r\n# Zeyu Chen, 2019\r\n#\r\n\r\nfrom sys import stdin, stdout, setrecursionlimit\r\ninput = stdin.readline\r\nflush = stdout.flush\r\n\r\n#setrecursionlimit(1000000)\r\n\r\n############################################################\r\n\r\nOUT = []\r\n\r\ndef write(item, sep = \" \"):\r\n if type(item) is int:\r\n OUT.append(str(item))\r\n elif type(item) is list:\r\n if type(item[0]) is int:\r\n OUT.append(sep.join(map(str, item)))\r\n else:\r\n OUT.append(sep.join(item))\r\n else:\r\n OUT.append(item)\r\n\r\ndef PRINT():\r\n print(\"\\n\".join(OUT))\r\n\r\nGI = lambda: int(input())\r\nGS = lambda: input()[:-1]\r\n\r\ngi = lambda: list(map(int, input().split()))\r\ngs = lambda: input().split()\r\n\r\n############################################################\r\n\r\ncand, cities = gi()\r\n\r\nwinner = [0] * cand\r\n\r\nfor i in range(cities):\r\n arr = gi()\r\n best = arr.index(max(arr))\r\n\r\n winner[best] += 1\r\n\r\nwrite(winner.index(max(winner)) + 1)\r\n\r\n\r\n\r\n\r\n############################################################\r\n\r\nPRINT()", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(m):\r\n l=list(map(int,input().split()))\r\n x=l.index(max(l))\r\n a.append(x+1)\r\na.sort()\r\nprint(max(a,key=a.count))", "def main():\r\n n, m = map(int, input().split())\r\n ar = [0] * 105\r\n x = 1\r\n\r\n while m > 0:\r\n m -= 1\r\n v = list(map(int, input().split()))\r\n vv = v.copy()\r\n v.sort(reverse=True)\r\n\r\n for i in range(len(v)):\r\n if vv[i] == v[0]:\r\n ar[i + 1] += 1\r\n break\r\n\r\n for i in range(1, n + 1):\r\n if ar[i] > ar[i - 1]:\r\n x = i\r\n ar[i] = max(ar[i], ar[i - 1])\r\n\r\n print(x)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "overall = [0] * 105\r\nn, m = map(int, input().split())\r\nfor m in range(m):\r\n a = list(map(int, input().split()))\r\n overall[a.index(max(a)) + 1] += 1\r\nprint(overall.index(max(overall)))\r\n\r\n", "n, m = map(int, input().split())\r\ncity_wins = [0] * n\r\nfor _ in range(m):\r\n votes = list(map(int, input().split()))\r\n winner = max(range(n), key=lambda i: votes[i])\r\n city_wins[winner] += 1\r\nprint(max(range(n), key=lambda i: city_wins[i]) + 1)\r\n", "i, c= map(int,input().split())\r\nm = {elem:0 for elem in range(1,i+1)}\r\nfor x in range(c):\r\n l = list(map(int,input().split()))\r\n m[l.index(max(l))+1] += 1\r\nprint(max(m, key=m.get))", "n, m = [int(i) for i in input().split()]\r\n\r\n\r\nres = [0]*n\r\n\r\nfor i in range(m):\r\n s = [int(j) for j in input().split()]\r\n m = s[0]\r\n mi = 0\r\n for j in range(n):\r\n if s[j] > m:\r\n m = s[j]\r\n mi = j\r\n res[mi] += 1\r\nm = res[0]\r\nmi = 0\r\nfor k in range(n):\r\n if res[k] > m:\r\n m = res[k]\r\n mi = k\r\nprint(mi + 1)\r\n", "n, m = map(int, input().split())\nA = [list(map(int, input().split())) for _ in range(m)]\n\ncnt = [0 for _ in range(n)]\nfor aa in A:\n maxv = max(aa)\n for i in range(n):\n if aa[i] == maxv:\n cnt[i] += 1\n break\n\nmaxcnt = max(cnt)\nfor i in range(n):\n if cnt[i] == maxcnt:\n print(i + 1)\n exit()\n", "nm = list(map(int, input().strip().split()))\r\nn = nm[0]\r\nm = nm[1]\r\nlst = [0] * n\r\nfor i in range(m):\r\n lst1 = list(map(int, input().strip().split()))\r\n ind = lst1.index(max(lst1))\r\n lst[ind] += 1\r\nprint(lst.index(max(lst)) + 1)", "n,m = map(int, input().split())\r\na = [0]*n\r\nfor _ in range(m):\r\n z = list(map(int, input().split()))\r\n a[z.index(max(z))] += 1\r\nprint(a.index(max(a)) +1)\r\n", "n,m=map(int,input().split())\r\nz=[0]*n\r\nfor i in range(m):\r\n a=[int(a)for a in input().split()]\r\n z[a.index(max(a))]+=1\r\nprint(z.index(max(z))+1)", "#See the constraints; check if Brute force is useful\r\n#Figure out a realtion or general formula if possible\r\n#Find the corner cases\r\n#dp,prefix sum, greedy solution or logical \r\n#Ek baar aur kr bro\r\n#Be organised \r\n#Think hard you can do it\r\n\r\ndef singleinput():R = int(input());return R\r\ndef strinput():R = str(input());return R\r\ndef intarray():As = list(map(int,input().split()));return As\r\ndef matrixinput(arr): As = list(map(int,input().split())); arr.append(As)\r\n\r\n\r\nn,m = intarray()\r\nvotes = [0]*(n+1)\r\nfor _ in range(m):\r\n city = intarray()\r\n votes[city.index(max(city))+1]+=1\r\n\r\nmax = votes[0]\r\nans = 0\r\nfor i in range(1,n+1):\r\n if(votes[i]>max):\r\n max = votes[i]\r\n ans = i\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\ns=[0]*n\r\nfor x in range(m):\r\n a=list(map(int,input().split()))\r\n s[a.index(max(a))]+=1\r\nprint(s.index(max(s))+1)\r\n \r\n \r\n", "n , m = map(int,input().split())\r\nl = []\r\nfor f in range(n) : l.append(0)\r\nfor f1 in range(m) :\r\n i = list(map(int,input().split()))\r\n ma = 0\r\n for f2 in range(n):\r\n if i[f2] > i[ma] : ma = f2\r\n l[ma] += 1\r\nma = 0\r\nfor f in range(n) :\r\n if l[f] > l[ma] : ma = f\r\nprint(ma+1)\r\n", "def get_winner(results, cand_n):\r\n\tcurrent_winner = (0, 0)\r\n\tfor index_cand in range(cand_n):\r\n\t\tif current_winner[1] < results[index_cand]:\r\n\t\t\tcurrent_winner = (index_cand, results[index_cand])\r\n\treturn current_winner\r\n\r\ncand, cities = [int(x) for x in input().split(' ')]\r\nwins = [0] * cand\r\nfor index_city in range(cities):\r\n\tres = [int(x) for x in input().split(' ')]\r\n\twins[get_winner(res, cand)[0]] += 1\r\nprint(get_winner(wins, cand)[0] + 1)", "from sys import stdin , stdout\r\nfrom collections import defaultdict\r\nimport math\r\nimport heapq\r\n\r\n\r\ndef get_list(): return list(map(int, stdin.readline().strip().split()))\r\ndef get_int(): return int(stdin.readline())\r\ndef get_ints(): return map(int, stdin.readline().strip().split())\r\ndef get_string(): return stdin.readline().strip()\r\ndef printn(n) : stdout.write(str(n) + \"\\n\")\r\ndef printlis(a): \r\n for x in a:\r\n stdout.write(str(x)+\" \")\r\n printn('')\r\n\r\n\r\ndef solve() :\r\n n ,m = get_ints()\r\n a = [0]*n\r\n for i in range(m):\r\n b = get_list()\r\n mx = -math.inf\r\n ind = -1\r\n for j in range(n):\r\n if mx < b[j]:\r\n mx = b[j]\r\n ind = j\r\n a[ind]+=1\r\n \r\n mx = -math.inf\r\n ans = 1\r\n for i in range(n):\r\n if mx < a[i]:\r\n mx = a[i]\r\n ans = i+1\r\n\r\n printn(ans)\r\n return\r\n\r\n\r\n\r\nif __name__ == \"__main__\" :\r\n # t = get_int()\r\n t = 1\r\n while t:\r\n t-=1\r\n solve()", "n,m=map(int,input().split(\" \"))\r\nL1=[0]*n\r\nfor k in range(m):\r\n L=list(map(int,input().split(\" \")))\r\n L1[L.index(max(L))]+=1\r\nprint(L1.index(max(L1))+1)\r\n", "n,m=map(int,input().split())\r\nd=[0]*(n+1)\r\nfor i in range(m):\r\n inp=list(map(int,input().split()))\r\n s=inp.index(max(inp))\r\n d[s+1]+=1\r\nprint(d.index(max(d)))\r\n", "n,m = map(int,input().split())\r\ns,d = [list(map(int,input().split()))for i in range(m)],{i:0 for i in range(1,n + 1)}\r\nfor i in range(m):\r\n d[s[i].index(max(s[i]))+ 1] += 1\r\nprint(list(d.keys())[list(d.values()).index(max(d.values()))])", "from collections import Counter\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n s=list(map(int,input().split()))\r\n l.append(s.index(max(s))+1)\r\nd=Counter(l)\r\nprint (d.most_common(1)[0][0])\r\n", "n,m=map(int,input().split())\r\nl=[0]*n\r\nfor i in range(m):\r\n s=list(map(int,input().split()))\r\n l[s.index(max(s))]+=1\r\nprint(l.index(max(l))+1)", "n, m = [int(x) for x in input().split()]\r\ncandidatesWin = []\r\nfor i in range (0, n + 1):\r\n candidatesWin.append(0)\r\nfor i in range (0, m):\r\n votes = [int(x) for x in input().split()]\r\n maxVote = max(votes)\r\n for j in range (0, n):\r\n if votes[j] == maxVote:\r\n candidatesWin[j + 1] += 1\r\n break\r\nmaxWin = max(candidatesWin)\r\nfor i in range (1, n + 1):\r\n if candidatesWin[i] == maxWin:\r\n print(i)\r\n break\r\n", "n, m = map(int, input().split())\r\ndef f(a):\r\n m = max(a)\r\n return min(i for i in range(n) if a[i] == m) + 1\r\nb = [0] * n\r\nfor i in range(m):\r\n a = list(map(int, input().split()))\r\n b[f(a) - 1] += 1\r\nprint(f(b))\r\n", "n,m = map(int,input().split())\r\nll = []\r\nball = [0] * n\r\nfor i in range(m):\r\n ll.append(list(map(int,input().split())))\r\nfor i in range(m):\r\n k = max(ll[i])\r\n for j in range(n):\r\n if ll[i][j] == k:\r\n ball[j] += 1\r\n break\r\nk = max(ball)\r\nfor i in range(n):\r\n if ball[i] == k:\r\n print(i+1)\r\n break", "from collections import Counter\nn, m = (int(x) for x in input().split())\nppl = []\nfor _ in range(m):\n a = [int(x) for x in input().split()]\n ppl.append(a.index(max(a)))\nc = Counter(ppl)\nv = max(c.values())\nprint(min(x for x in c if c[x] == v) + 1)\n", "#in thr nmae of god\r\n#Mr_Rubik\r\nn, m = map(int,input().split())\r\nc=[0]*(n+1)\r\nfor i in range(m):\r\n city=[int(i) for i in input().split()]\r\n c[city.index(max(city)) + 1] += 1\r\nprint(c.index(max(c)))", "#!/usr/bin/python3\r\n\r\n\r\ndef main():\r\n n, m = [int(x) for x in input().split()]\r\n poli = [0]*n\r\n\r\n while m:\r\n inp = [int(x) for x in input().split()]\r\n _max = max(inp)\r\n poli[inp.index(_max)] += 1\r\n m -= 1\r\n\r\n print(poli.index(max(poli))+1)\r\n\r\n\r\nif __name__ == \"__main__\": main()\r\n", "[n,m] = list(map(int, input().split(\" \")))\nv1 = []\nfor i in range(m):\n l = list(map(int, input().split(\" \")))\n v1.append(l.index(max(l))+1)\nv1.sort()\nv2 = list(map(lambda x: v1.count(x), v1))\nr = v2.index(max(v2))\nprint(v1[r])\n", "n, m = map(int, input().split())\r\nans = [0]*n\r\nfor i in range(m):\r\n l =list(map(int, input().split()))\r\n ans[l.index(max(l))]=ans[l.index(max(l))]+1\r\n #print(ans)\r\nprint(ans.index(max(ans))+1)", "from collections import Counter as cnt\r\nn,m=map(int,input().split())\r\nll=[list(map(int,input().split())) for _ in range(m)]\r\nif n==1:\r\n print(1)\r\nelse:\r\n l=[]\r\n \r\n for city in ll:\r\n l.append(1+(city.index(max(city))))\r\n dic=cnt(l)\r\n maxvalur=dic[max(dic,key=dic.get)]\r\n ans=[]\r\n for key in dic:\r\n if dic[key]==maxvalur:\r\n ans.append(key)\r\n print(min(ans))\r\n ", "n,m=map(int,input().split());z=[]\r\nfor i in range(m):\r\n x=[int(x) for x in input().split()]\r\n z.append(1+x.index(max(x)))\r\np=list(set(z))\r\nk=0\r\nfor i in p:\r\n if z.count(i)>k:\r\n k=z.count(i)\r\n s=i\r\nprint(s)\r\n", "m, n = map(int, input().split())\r\ncity = [0]*n\r\nfor i in range (n):\r\n temp = list(map(int, input().split()))\r\n city[i] = temp.index(max(temp))+1\r\nres = 0\r\nmax_m = 0\r\nfor i in range (1, m+1):\r\n if city.count(i) > max_m:\r\n res = i\r\n max_m = city.count(i)\r\nprint(res)", "n, m = map(int,input().split())\r\nl, t1 = [], []\r\nfor _ in range(m):\r\n l1 = list(map(int,input().split()))\r\n l.append(l1)\r\n tp =max(l1)\r\n ls = l1.index(tp)+1\r\n t1.append(ls)\r\n# print(t1)``\r\n\r\nla = {}\r\nfor i in range(len(t1)):\r\n if t1[i] in la:\r\n la[t1[i]]+=1\r\n else:\r\n la[t1[i]] = 1\r\nmt = la[max(la,key=lambda k:la[k])]\r\n# print(la,mt)\r\ntp1 = []\r\nfor i in la.keys():\r\n if la[i]==mt:\r\n tp1.append(i)\r\nprint(min(tp1))", "from collections import Counter\r\n\r\n[n, m] = [int(x) for x in input().split()]\r\n\r\ncities = []\r\n\r\nfor i in range(m):\r\n votes = [int(x) for x in input().split()]\r\n cities.append(votes.index(max(votes))+1)\r\n\r\nprint(Counter(cities).most_common()[0][0])\r\n", "[n,m]=[int(i) for i in input().split()]\r\n\r\narr=[]\r\n\r\nfor i in range(m):\r\n\ta=[int(i) for i in input().split()]\r\n\tarr.append(a)\r\n\r\ncity_win=[]\r\nfor x in range(m):\r\n\t\r\n\tmaxi=-2\r\n\twin=-2\r\n\tfor y in range(n):\r\n\t\tif(arr[x][y]>maxi):\r\n\t\t\tmaxi=arr[x][y]\r\n\t\t\twin=y\r\n\r\n\tcity_win.append(win)\r\n\r\nfinal_win=[]\r\n\r\nfor e in range(n):\r\n\tfinal_win.append([e,0])\r\n\r\nfor f in range(m):\r\n\tfinal_win[city_win[f]][1]+=1\r\n\r\nmax_win=-2\r\nwinner=-2\r\nfor g in range(n):\r\n\tif(final_win[g][1]>max_win):\r\n\t\tmax_win=final_win[g][1]\r\n\t\twinner=final_win[g][0]\r\n\r\nprint(winner+1)\r\n", "'''input\n3 1\n1 2 3\n'''\nn, m = map(int, input().split())\ns = [0] * n\nfor _ in range(m):\n\tv = list(map(int, input().split()))\n\tw = v.index(max(v))\n\ts[w] += 1\n\nprint(s.index(max(s))+1)\n\n\n\n\n\n\n\n\n", "n,m=map(int,input().split())\r\nwinner=[0]*n\r\nfor _ in range(m):\r\n arr=list(map(int,input().split()))\r\n m=max(arr)\r\n i=arr.index(m)\r\n winner[i]+=1\r\n\r\nwin=0\r\nans=0\r\nfor w in range(n): \r\n if winner[w]>win:\r\n win=winner[w]\r\n ans=w\r\n \r\nprint(ans+1)", "n,m = map(int, input().strip().split(' '))\r\ncan=[]\r\nfor i in range(n):\r\n can.append(0)\r\nfor i in range(m):\r\n lst = list(map(int, input().strip().split(' ')))\r\n ind=lst.index(max(lst))\r\n can[ind]+=1\r\nj=can.index(max(can))\r\nprint(j+1)\r\n ", "n,m=map(int,input().split())\r\nc=[0]*n\r\nfor i in range(m):\r\n a=list(map(int,input().split()))\r\n c[a.index(max(a))]+=1\r\nprint(c.index(max(c))+1)\r\n", "n, m = list(map(int, input().split()))\r\ncan = [0]*n\r\nfor i in range(m):\r\n c = list(map(int, input().split()))\r\n index = c.index(max(c))\r\n can[index] += 1\r\nprint(can.index(max(can)) + 1)", "n,m=map(int,input().split())\r\nc=[]\r\nfor i in range(m):\r\n a=list(map(int,input().split()))\r\n m=max(a)\r\n ind=a.index(m)\r\n c.append(ind+1)\r\nw=[]\r\nfor i in range(1,n+1):\r\n w.append(c.count(i))\r\nm1=max(w)\r\nind1=w.index(m1)\r\nprint(ind1+1)", "n,m=map(int,input().split())\r\nM=[]\r\nfor _ in range(m):\r\n\tM.append(list(map(int,input().split())))\r\n#print(M)\r\nv=[0]*n\r\nfor i in M:\r\n\tpos=i.index(max(i))\r\n\tv[pos]+=1\r\n\r\nprint(v.index(max(v))+1)", "candidates,cities = map(int,input().split())\r\nresults = [0]*(candidates+1)\r\nfor c in range(cities):\r\n round1 = list(map(int,input().split()))\r\n results[round1.index(max(round1)) + 1] += 1\r\nprint (results.index(max(results)))\r\n\r\n", "n,m=[int(x) for x in input().split()]\r\na=[0]*n\r\nfor i in range(m):\r\n b=[int(x) for x in input().split()]\r\n a[b.index(max(b))]+=1\r\nprint(a.index(max(a))+1)", "\r\n\r\ncan , city = map(int , input().split())\r\n\r\nl = []\r\n\r\nfor i in range(can):\r\n l.append(0)\r\n \r\nfor i in range(city):\r\n x = [int(x) for x in input().split()]\r\n a = x.index(max(x))\r\n l[a] = l[a] + 1\r\n \r\nprint(l.index(max(l)) + 1)", "n, m = [int(s) for s in input().split()]\r\nvotes = [0]*n\r\n\r\nfor i in range(m):\r\n city = [int(s) for s in input().split()]\r\n candidate = city.index(max(city))\r\n votes[candidate] += 1\r\nprint(votes.index(max(votes)) + 1)\r\n\r\n", "n, m = [int(i) for i in input().split()]\r\nc = [0] * n\r\n\r\nfor i in range(m):\r\n l = [int(i) for i in input().split()]\r\n v = max(l)\r\n c[l.index(v)] += 1\r\nprint(c.index(max(c)) + 1)", "def solve():\r\n n,m = map(int, input().split())\r\n a = []\r\n for i in range(m):\r\n x = list(map(int, input().split()))\r\n a.append(x.index(max(x)))\r\n b = []\r\n for i in range(n):\r\n b.append(a.count(i))\r\n print(b.index(max(b))+1)\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "n, m = list(map(int, input().split()))\r\ncit = [0]*n\r\nfor i in range(m):\r\n a1 = list(map(int, input().split()))\r\n maxi = 0\r\n mxx = 0\r\n for j in range(n):\r\n if a1[j] > mxx:\r\n mxx = a1[j]\r\n maxi = j\r\n cit[maxi] += 1\r\nmaxi = 0\r\nmxx = 0\r\nfor i in range(n):\r\n if cit[i] > mxx:\r\n mxx = cit[i]\r\n maxi = i + 1\r\nprint(maxi)\r\n", "def in_int():\r\n return map(int, input().split())\r\n\r\n\r\nn, m = in_int()\r\na = [list(in_int()) for _ in range(m)]\r\n\r\n\r\ndef max_i(a):\r\n max = 0\r\n maxi = 0\r\n for i in range(len(a)):\r\n if a[i] > max:\r\n max = a[i]\r\n maxi = i\r\n return maxi\r\n\r\n\r\nv = [0] * n\r\nfor i in map(max_i, a):\r\n v[i] += 1\r\n\r\nprint(max_i(v) + 1)\r\n", "inputs=list(map(int,input().split()))\r\n\r\nn=inputs[0]\r\nm=inputs[1]\r\n\r\nmax_outer=[0,0]\r\nmx=[0 for i in range(n)]\r\n\r\nfor i in range(m):\r\n max_inner=[0,0]\r\n votes=list(map(int,input().split()))\r\n for j in range(n):\r\n if votes[j]>max_inner[0]:\r\n max_inner=[votes[j],j]\r\n mx[max_inner[1]]+=1\r\n\r\nfor i in range(n):\r\n if mx[i]>max_outer[0]:\r\n max_outer=[mx[i],i+1]\r\n\r\nprint(max_outer[1])", "candidates , cities = map(int ,input().split())\r\nres = [0] * candidates\r\nfor i in range(cities) : \r\n cite = list(map(int , input().split()))\r\n winner = cite.index(max(cite))\r\n res[winner] += 1\r\nprint(res.index(max(res)) + 1 )\r\n", "n_candidatos, n_ciudades = map(int,input().split(' '))\n\nmatriz = []\nmatrizb = [[0]* n_candidatos for i in range(n_ciudades) ]\nfor i in range(n_ciudades):\n matriz.append(list(map(int,input().split(' '))))\n\nfor i in range(n_ciudades):\n fila = matriz[i] \n ifila = fila.index(max(fila))\n matrizb[i][ifila] = 1\n\nfinal = []\nfor j in range(n_candidatos):\n suma_col = 0\n for i in range(n_ciudades):\n suma_col += matrizb[i][j]\n final.append(suma_col)\n\nprint ( 1 + final.index(max(final))) \n \n\n ", "n, m = [int(i) for i in input().split()]\r\nvotes = [0] * n\r\n\r\nfor i in range(m):\r\n currVotes = [int(i) for i in input().split()]\r\n maxIndex = 0\r\n for j in range(len(currVotes)):\r\n if currVotes[maxIndex] < currVotes[j]:\r\n maxIndex = j\r\n votes[maxIndex] += 1\r\n \r\nmaxIndex = 0\r\nfor i in range(len(votes)):\r\n if votes[maxIndex] < votes[i]:\r\n maxIndex = i\r\nprint(maxIndex + 1)\r\n", "n,m = [int(i) for i in input().split()]\r\nl = n*[0]\r\nfor i in range(m):\r\n\ta = [int(j) for j in input().split()]\r\n\tm = max(a)\r\n\tind = a.index(m)\r\n\tl[ind] += 1\r\nm = max(l)\r\nind = l.index(m)\r\nprint(ind+1)\r\n", "def main():\r\n m, n = input().split()\r\n n = int(n)\r\n m = int(m)\r\n\r\n a = []\r\n\r\n for i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\n b = [0]*m\r\n\r\n for i in a:\r\n b[i.index(max(i))] += 1\r\n\r\n print(b.index(max(b))+1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nal=[0]*n\r\nfor i in range(m):\r\n l=list(map(int,input().split()))\r\n al[l.index(max(l))]+=1\r\nprint(al.index(max(al))+1)\r\n", "n,m=map(int,input().split())\r\nd=[0]*n\r\nfor i in range(m):\r\n a=list(map(int,input().split()))\r\n d[a.index(max(a))]+=1\r\nprint(d.index(max(d))+1)\r\n", "n,m=input().split()\r\nwin=[]\r\nwinov=[]\r\nn=int(n);m=int(m)\r\nfor i in range(m):\r\n A=input().split()\r\n A = list(map(int,A)) \r\n win.append(A.index(max(A))+1)\r\nfor i in range(n):\r\n winov.append(win.count(i+1))\r\nprint(winov.index(max(winov))+1)", "n,m=map(int, input().split())\r\nd=[0]*n\r\nfor i in range(m):\r\n l=list(map(int, input().split()))\r\n c=l.index(max(l))\r\n d[c]=d[c]+1\r\nprint(d.index(max(d))+1)\r\n", "n, m = map(int, input().split())\r\nc = [0] * n\r\nfor i in range(m):\r\n\ta = list(map(int, input().split()))\r\n\tc[a.index(max(a))] += 1\r\nprint (c.index(max(c)) + 1)", "def elections(n,m,array):\r\n results=[0]*n\r\n for c in array:\r\n results[c.index(max(c))]+=1\r\n return results.index(max(results))+1\r\nn,m=list(map(int,input().split(\" \")))\r\narray=[]\r\nfor i in range(m):\r\n array.append(list(map(int,input().split(\" \"))))\r\nprint(elections(n,m,array))\r\n", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/24 21:26\r\n\r\n\"\"\"\r\n\r\nN, M = map(int, input().split())\r\n\r\n\r\nwins = collections.defaultdict(int)\r\nfor i in range(M):\r\n a = [int(x) for x in input().split()]\r\n\r\n maxa = -1\r\n w = -1\r\n for j in range(N):\r\n if a[j] > maxa:\r\n maxa = a[j]\r\n w = j+1\r\n\r\n wins[w] += 1\r\n\r\nmaxa = -1\r\nans = -1\r\nfor i in sorted(wins.keys()):\r\n if wins[i] > maxa:\r\n maxa = wins[i]\r\n ans = i\r\n\r\nprint(ans)\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nh = {}\r\nfor i in range(m):\r\n a = [int(x) for x in input().split()]\r\n max_a = max(a)\r\n ind = a.index(max_a)\r\n if h.get(ind) == None:\r\n h[ind] = 1\r\n else:\r\n h[ind] += 1\r\n\r\nmax_v = max(h.values())\r\nfor key in sorted(h.keys()):\r\n if h[key] == max_v:\r\n print(key + 1)\r\n break", "n,m=list(map(int,input().split()))\r\nMax=0\r\nn1=[]\r\nind=0\r\nfor i in range(n):\r\n n1.append(0)\r\nfor i in range(m):\r\n a=list(map(int,input().split()))\r\n Max=-1\r\n ind=0\r\n for g in range(n):\r\n if a[g]>Max:\r\n ind=g\r\n Max=a[g]\r\n n1[ind]+=1\r\nMax=0\r\nfor i in range(n):\r\n if n1[i]>Max:\r\n ind=i+1\r\n Max=n1[i]\r\nprint(ind)", "n, m = [int(j) for j in input().split()]\r\nmat = []\r\nfor j in range(m):\r\n mat.append([int(j) for j in input().split()])\r\nstream = n * [0]\r\nfor j in range(m):\r\n index = 0\r\n for k in range(1, n):\r\n if mat[j][k] > mat[j][index]:\r\n index = k\r\n stream[index] += 1\r\nprint(stream.index(max(stream)) + 1)\r\n", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\n \r\n \r\nn, m = map(int, input().split())\r\ncities = {}\r\nfor _ in range(m) :\r\n a = list(map(int, input().split()))\r\n maxVotes = 0\r\n maxVotesIdx = 1\r\n for i in range(n) :\r\n if a[i] > maxVotes :\r\n maxVotes = a[i]\r\n maxVotesIdx = i + 1\r\n if maxVotesIdx not in cities :\r\n cities[maxVotesIdx] = 1\r\n else :\r\n cities[maxVotesIdx] += 1\r\nmaxCities = max(cities.values())\r\nprint(min(i for i in cities if cities[i] == maxCities))\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "n,m=map(int,input().split())\r\nwins=[0]*n\r\nfor i in range(m):\r\n x=list(map(int,input().split()))\r\n get_max=-1\r\n get_ind=-1\r\n for i in range(len(x)):\r\n if x[i]>get_max:\r\n get_max=x[i]\r\n get_ind=i\r\n wins[get_ind]+=1\r\n\r\nget_max=-1\r\nget_ind=-1\r\nfor i in range(n):\r\n if wins[i]>get_max:\r\n get_max=wins[i]\r\n get_ind=i\r\n\r\nprint(get_ind+1)\r\n \r\n", "inp = input().split()\r\nn = int(inp[0])\r\nm = int(inp[1])\r\n\r\ncand = [0 for i in range(n)]\r\n\r\nfor i in range(m):\r\n elec = input().split()\r\n intv = [int(i) for i in elec]\r\n maximum = max(intv)\r\n winner = intv.index(maximum)\r\n cand[winner] += 1\r\n\r\n\r\nmaximum = max(cand)\r\nwinner = cand.index(maximum) + 1\r\n\r\nprint(winner)", "n,m=input().split()\r\nn,m=int(n),int(m)\r\ns=[0]*n\r\nfor i in range(m):\r\n l=list(map(int,input().split()))\r\n x=max(l)\r\n s[l.index(x)]+=1\r\nprint(s.index(max(s))+1) ", "n,m = map(int,input().split())\r\nd = []\r\nfor i in range(m):\r\n\tc,r=-1,0\r\n\ts = [int(i) for i in input().split()]\r\n\tfor i in range(n):\r\n\t\tif s[i]>c:\r\n\t\t\tr=i+1\r\n\t\t\tc = s[i]\r\n\td.append(r)\r\nr = [0 for i in range(n)]\r\n\r\nfor i in d:\r\n\tr[i-1]+=1\r\nprint(r.index(max(r))+1)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nvotes = [0] * n\r\n\r\nfor _ in range(m):\r\n city_votes = list(map(int, input().split()))\r\n votes[city_votes.index(max(city_votes))] += 1\r\n\r\nprint(votes.index(max(votes)) + 1)", "from collections import Counter\nn, m = map(int, input().strip().split())\nwinners = []\nfor i in range(m):\n\tarr = list(map(int, input().strip().split()))\n\twinners.append(arr.index(max(arr))+1)\nfreq = Counter(winners)\nmaxFreq = max(freq.values())\nwinners.sort()\nfor winner in winners:\n\tif freq[winner] == maxFreq:\n\t\tprint(winner)\n\t\tbreak", "n,m = map(int, input().split())\r\nvotes = [0]*n\r\nfor i in range(m):\r\n\tarr = list(map(int, input().split()))\r\n\tidx = arr.index(max(arr))\r\n\tvotes[idx] += 1\r\nprint(votes.index(max(votes)) + 1)", "n,m = map(int,input().split())\r\nwinner = []\r\nfor _ in range(m):\r\n res = list(map(int,input().split()))\r\n m = max(res)\r\n winner.append(res.index(m)+1)\r\n\r\nfrom collections import defaultdict\r\nd = defaultdict(int)\r\nwinner.sort()\r\na = 0\r\nres = 0\r\nfor w in winner:\r\n d[w]+=1\r\n if d[w]>res:\r\n res = d[w]\r\n a = w\r\nprint(a)", "def main():\r\n\tn, m = map(int, input().split())\r\n\r\n\tvotes = [0 for _ in range(n)]\r\n\tfor _ in range(m):\r\n\t\tnums = list(map(int, input().split()))\r\n\t\tvotes[getMaxIndex(nums)] += 1\r\n\tprint(getMaxIndex(votes) + 1)\r\n\r\n\r\ndef getMaxIndex(nums):\r\n\tidx = 0\r\n\tmx = 0\r\n\tfor i in range(len(nums)):\r\n\t\tif nums[i] > mx:\r\n\t\t\tidx = i\r\n\t\t\tmx = nums[i]\r\n\treturn idx\r\n\r\nmain()", "n, m = map(int, input().split())\r\nc = [0]*n\r\nfor i in range(m):\r\n\tl = list(map(int, input().split()))\r\n\tc[(l.index(max(l)))] += 1\r\nprint(c.index(max(c)) + 1)", "n,m=map(int,input().split())\r\nz=[0]*n\r\nfor x in range(m):\r\n\tk=list(map(int,input().split()))\r\n\tc=-1\r\n\tfor y in range(n):\r\n\t\tif k[y]>c:\r\n\t\t\tc=k[y]\r\n\t\t\tind=y\r\n\tz[ind]+=1\r\n\r\nq=max(z)\r\nfor x in range(n):\r\n\tif z[x]==q:\r\n\t\tprint(x+1)\r\n\t\tbreak", "n,m=map(int,input().split(\" \"))\na=list()\nb=list()\nc=[0]*(n+1)\nfor i in range(0,m):\n\ta=list(map(int,input().split(\" \")))\n\tk=max(a)\n\tif a.count(k)==1:\n\t\tb.append(a.index(k)+1)\n\t\tc[a.index(k)+1]=c[a.index(k)+1]+1\n\telse:\n\t\tfor j in range(0,n):\n\t\t\tif a[j]==k:\n\t\t\t\tb.append(j+1)\n\t\t\t\tc[j+1]=c[j+1]+1\n\t\t\t\tbreak\ns=max(c)\nprint(c.index(s))\n", "lineInput = list(map(int,str(input()).split()))\r\nm = lineInput[0]\r\nn = lineInput[1]\r\n\r\ncity = [0] * 110\r\n\r\nfor i in range(0,n):\r\n\tcnt = list(map(int,str(input()).split()))\r\n\twinner = 0\r\n\tfor j in range(0,m):\r\n\t\tif(cnt[j] > cnt[winner]):\r\n\t\t\twinner = j\r\n\tcity[winner] += 1\r\n\r\nanswer = int(0)\r\nfor i in range(0,m):\r\n\tif(city[i] > city[answer]):\r\n\t\tanswer = i\r\n\r\nanswer += 1\r\nprint(answer)", "# http://codeforces.com/problemset/problem/570/A\n# Elections\n\ndef first_that_equals(array, number):\n for i in range(len(array)):\n if array[i] == number:\n return i\n return -1\n\ncandidates, cities = list(map(int, input().split()))\ncandidates = [0 for n in range(candidates)]\n\nfor i in range(cities):\n votes = list(map(int, input().split()))\n winner = first_that_equals(votes, max(votes))\n candidates[winner] += 1\n\nprint(first_that_equals(candidates, max(candidates)) + 1)\n", "n,m = map(int,input().split())\r\ncount = [0]*n\r\nfor i in range(m):\r\n vote = list(map(int,input().split()))\r\n count[vote.index(max(vote))] += 1\r\n\r\nprint(count.index(max(count))+1)", "n,m = map(int, input().split())\r\nvote = [0]*n\r\nfor i in range(m):\r\n votes = list(map(int, input().split()))\r\n maxV = 0\r\n for j in range(n):\r\n if votes[j]>votes[maxV]:\r\n maxV = j\r\n vote[maxV]+=1\r\nmaxV = 0\r\nfor j in range(n):\r\n if vote[j] > vote[maxV]:\r\n maxV = j\r\nprint(maxV+1)", "from collections import defaultdict\r\n\r\nif __name__ == '__main__':\r\n n, m = list(map(int, input().split()))\r\n\r\n results = defaultdict(int)\r\n for city in range(m):\r\n row = list(map(int, input().split()))\r\n winner_in_city = row.index(max(row))\r\n results[winner_in_city] += 1\r\n \r\n max_votes = max(results.values())\r\n results = filter(lambda x: x[1] == max_votes, results.items())\r\n print(min(x[0] for x in results) + 1)\r\n", "n,m = map(int,input().split())\r\ndic = [0]*n\r\nfor i in range(0,m):\r\n dics = [int(i) for i in input().split()]\r\n intdic = dics.index(max(dics))\r\n dic[intdic] += 1\r\n\r\nprint(dic.index(max(dic))+1)\r\n\r\n", "n,k=list(map(int,input().split()))\r\np=[]\r\nfor x in range(k):\r\n pa=list(map(int,input().split()))\r\n p.append(pa.index(max(pa))+1)\r\nsam=list(set(p))\r\nta=[]\r\nsam.sort()\r\nfor item in sam:\r\n ta.append(p.count(item))\r\nla=ta.index(max(ta))\r\nprint(sam[la])", "s=input()\r\nl=[]\r\nl=s.split()\r\nn=int(l[0])\r\nk=int(l[1])\r\nd=[]\r\nm2 = []\r\nfor i in range(0,k):\r\n s1=input()\r\n h1=[]\r\n h1=s1.split()\r\n for i in range(0, len(h1)):\r\n h1[i] = int(h1[i])\r\n m2.append( h1.index(max(h1)) +1)\r\n#print(m2)\r\n#to get the most frequent element\r\nres = max(set(m2), key = m2.count)\r\nprint(res)\r\n\r\n", "\r\ndef determine_winner(cities_data):\r\n cities_winners = []\r\n\r\n winners = []\r\n for i in range(len(cities_data)):\r\n max_votes = 0\r\n for j in range(len(cities_data[i])):\r\n if cities_data[i][j] >= max_votes:\r\n max_votes = cities_data[i][j]\r\n for z in range(len(cities_data[i])):\r\n if cities_data[i][z] == max_votes:\r\n winners.append(z)\r\n break\r\n return max(set(winners), key=winners.count)+1\r\n\r\ndef convert_into_int(arr):\r\n for i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n return arr\r\n\r\ninputs_nums = input().split(' ')\r\ninputs_nums = convert_into_int(inputs_nums)\r\n\r\ninputs_data = []\r\n\r\nfor i in range(inputs_nums[1]):\r\n input_data = input().split(' ')\r\n input_data = convert_into_int(input_data)\r\n inputs_data.append(input_data)\r\n\r\nprint(determine_winner(inputs_data))\r\n", "(a,b) = list(int(x) for x in input().split())\r\ncitiesWon = []\r\nes = []\r\nfor _ in range(a):\r\n citiesWon.append(0)\r\nfor _ in range(b):\r\n es.append(list(int(x) for x in input().split()))\r\nfor i in es:\r\n t = i.index(max(i))\r\n citiesWon[t]+=1\r\nprint(citiesWon.index(max(citiesWon))+1)", "n,m=list(map(int,input().split()))\r\nx=[]\r\nfor i in range(m):\r\n a=list(map(int,input().split()))\r\n x.append(a.index(max(a))+1)\r\nx1=list(set(x))\r\nx1.sort()\r\nx1.sort(reverse=True,key=lambda j:x.count(j))\r\nprint(x1[0])", "from statistics import *\r\nn,m = map(int, input().split()); li=[0]*150\r\nfor i in range(m):\r\n x= list(map(int, input().split()))\r\n mx= max(x)\r\n for j in range(n):\r\n if x[j]==mx: li[j+1]+=1; break\r\nmxx= max(li)\r\nfor i in range(1,101):\r\n if li[i]==mxx:\r\n print(i); break", "n1,m1=input().split()\r\nn=int(n1)\r\nm=int(m1)\r\nl=[]\r\nfor i in range(m):\r\n s=list(map(int,input().split()))\r\n l.append(s)\r\nl1=[0]*n\r\nfor val in l:\r\n l1[val.index(max(val))]+=1\r\nprint(l1.index(max(l1))+1)\r\n", "from collections import Counter\r\n# import math\r\n# import sys\r\n# for i in range(int(input())):\r\nn,m=map(int,input().split())\r\n# z_arr=list(map(int,input().split()))\r\nz_arr=[list(map(int,input().split())) for i in range(m)]\r\ncity_win=[]\r\nfor i in z_arr:\r\n city_win.append(i.index(max(i))+1)\r\nmp=Counter(city_win)\r\nmx=max(mp.values())\r\nans=[]\r\nfor k,v in mp.items():\r\n if v==mx:\r\n ans.append(k)\r\nprint(min(ans))", "import math\r\ndef fact(n):\r\n ans = 1\r\n for i in range(2, n+1):\r\n ans*= i\r\n return ans\r\ndef comb(n, c):\r\n return fact(n)//(fact(n-c)*c)\r\n\r\nn, m = map(int, input().split())\r\nd = {i:0 for i in range(1, n+1)}\r\nfor _ in range(m):\r\n vals = list(map(int, input().split()))\r\n ad = 1\r\n maxi = 0\r\n for i in range(n):\r\n if(vals[i] > maxi):\r\n ad = i+1\r\n maxi = vals[i]\r\n d[ad]+=1\r\nv = sorted(d.items(), key = lambda x:x[1],reverse = True)\r\nprint(v[0][0])\r\n", "candidates,cities=map(int,input().split())\r\nwinnercandidates=[0]*200\r\nfor i in range(cities):\r\n\tvotes=list(map(int,input().split()))\t\r\n\tmx=max(votes)\r\n\tfor j in range(candidates):\r\n\t\tif votes[j]==mx:\r\n\t\t\twinnercandidates[j]+=1\r\n\t\t\tbreak\r\nmx=max(winnercandidates)\r\nfor i in range(200):\r\n\tif winnercandidates[i]==mx:\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n", "from sys import stdin\n\nN, M = map (int, stdin.readline ().split ())\ncity_votes = []\n\nfor m in range (M):\n\tcity_votes.append (list (map (int, stdin.readline ().split ())))\n\t\ncity_winner = []\n\n# find winners in each city\nfor city in range (M):\n\tcity_winner.append (city_votes [city].index (max (city_votes [city])))\n\n# find most frequent winner\nfreq = [0] * N\n\nfor winner in city_winner:\n\tfreq [winner] += 1\n\nprint (freq.index (max (freq)) + 1)" ]

[ "def print_line(base, start, end):\n if start > end:\n return\n print_vertex(base, start)\n current = start\n while current != end:\n print_vertex(current, current + 1)\n current += 1\n\n\ndef print_branch(base, start, end):\n if start > end:\n return\n current = start\n while current != end:\n print_vertex(base, current)\n current += 1\n print_vertex(base, end)\n\n\ndef print_height(h):\n for i in range(1, h + 1):\n print_vertex(i, i + 1)\n\n\ndef print_vertex(i, j):\n print('{0} {1}'.format(i, j))\n\n\ndef main():\n n, d, h = [int(t) for t in input().split()]\n\n if d > 2 * h:\n print('-1')\n return\n if n == 2:\n print('1 2')\n return\n elif h == 1 and d == 1:\n print('-1')\n return\n\n print_height(h)\n\n print_line(1, h + 2, d + 1)\n\n if h < d:\n print_branch(1, d + 2, n)\n else:\n print_branch(2, d + 2, n)\n\n\nif __name__ == '__main__':\n main()\n", "n,d,h=map(int,input().split())\r\nif d>h*2 or (n>2 and d==1 and h==1): print(-1)\r\nelse: \r\n ans=[]\r\n for i in range(h): ans+=[' '.join((str(i+1),str(i+2)))]\r\n t=1\r\n for i in range(h+2,d+2): ans+=[' '.join((str(t),str(i)))]; t=i\r\n for i in range(d+2,n+1): ans+=[' '.join((str(h),str(i)))]; t=i\r\n print('\\n'.join(ans))", "n, d, h = map(int, input().split())\r\n\r\nif n == 2:\r\n print(1, 2)\r\n exit(0)\r\n\r\nif (d == 1) or (d > 2 * h):\r\n print(-1)\r\n exit(0)\r\n\r\nfor i in range(1, h + 1):\r\n print(i, i + 1)\r\n\r\nif (d > h):\r\n print(1, h + 2)\r\n\r\nfor i in range(h + 3, d + 2):\r\n print(i - 1, i)\r\n\r\nfor i in range(d + 2, n + 1):\r\n print(h, i)\r\n", "n,d,h = map(int,input().split())\r\nif d > 2 * h or (n != 2 and d == 1 and h == 1):\r\n print(-1)\r\nelse:\r\n for i in range(1,h+1):\r\n print(i,i+1)\r\n num = h\r\n if num != d:\r\n print(1,num+2)\r\n num += 1\r\n while num < d:\r\n print(num+1,num+2)\r\n num += 1\r\n num += 2\r\n while num <= n:\r\n print(h,num)\r\n num += 1\r\n", "n, d, h = list(map(int, input().split()))\nif h < (d + 1) // 2 or (h == d == 1 and n > 2):\n print(-1)\n exit()\n\ni = 1\nwhile i <= h:\n print(i, i + 1)\n i += 1\nif i <= d:\n print(1, h + 2)\n i = h + 2\nwhile i <= d:\n print(i, i + 1)\n i += 1\ni += 1\nwhile i <= n:\n if h == d:\n print(2, i)\n else:\n print(1, i)\n i += 1\n", "import os\r\nimport sys\r\n\r\nif os.getenv('LOCALCFTEST'):\r\n sys.stdin = open('cfinput.txt')\r\nMOD = 10 ** 9 + 7\r\n\r\n\r\ndef solve(n, d, h):\r\n if 2 * h < d or (d==1 and n>2):\r\n print(-1)\r\n return\r\n if n == 2:\r\n print(1, 2)\r\n return\r\n if h == 1:\r\n for i in range(2, n+1):\r\n print(1, i)\r\n return\r\n\r\n for i in range(1,h+1): # 从1，一条高h的链\r\n print(i, i + 1)\r\n\r\n\r\n if d > h: # 从1，一条d-h的链\r\n print(1,h+2)\r\n for i in range(h+2,d+1):\r\n print(i,i+1)\r\n # 剩下的全挂2上\r\n for i in range(d+2,n+1):\r\n print(2,i)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, d, h = map(int, input().split())\r\n # print(n,d,h)\r\n solve(n, d, h)\r\n", "n, d, h = map(int, input().strip().split())\nif n == 2:\n\tif d == 1 and h == 1:\n\t\tprint(1, 2)\n\telse:\n\t\tprint(-1)\nelif 2 * h < d or d == 1:\n\tprint(-1)\nelse:\n\tfor i in range(1, h + 1):\n\t\tprint(i, i + 1)\n\tif d > h:\n\t\tprint(1, h + 2)\n\t\tfor i in range(h + 2, d + 1):\n\t\t\tprint(i, i + 1)\n\tp = 2 if d == h else 1\n\tfor i in range(d + 2, n + 1):\n\t\tprint(p, i)\n\t\t\n\n", "n, d, h = map(int, input().split())\nif d > 2 * h or d == 1 and n > 2:\n print(-1)\nelse:\n for i in range(h):\n print(i + 1, i + 2)\n for i in range(d - h):\n print(1 if i == 0 else i + h + 1, i + h + 2)\n for i in range(d + 1, n):\n print(2 if d == h else 1, i + 1)\n", "n,d,h=map(int,input().split())\r\nif d>2*h:\r\n print(\"-1\")\r\n quit()\r\nif d==1 and n>2:\r\n print(\"-1\")\r\n quit()\r\nif d==h :\r\n ls=[]\r\n for i in range(1,h+1):\r\n ls.append([i,i+1])\r\n for i in range(h+2,n+1):\r\n ls.append([2,i])\r\n for i in ls:\r\n print(i[0],i[1])\r\n quit()\r\n\r\nls=[]\r\n# add h to right\r\nfor i in range(1,h+1):\r\n ls.append([i,i+1])\r\n# add 1 to left\r\nls.append([1,h+2])\r\nfor i in range(h+2,d+1):\r\n ls.append([i,i+1])\r\nfor i in range(d+2,n+1):\r\n ls.append([1,i])\r\nfor i in range(n-1):\r\n print(ls[i][0],ls[i][1])\r\n", "n,d,h = map(int,input().split())\r\nif d == 1 :\r\n\tif n == 2:\r\n\t\tprint(\"1 2\")\r\n\telse:\r\n\t\tprint(\"-1\")\r\nelif d > 2*h:\r\n\tprint(\"-1\")\r\nelse:\r\n\tif h == 1:\r\n\t\tfor i in range(2,n+1):\r\n\t\t\tprint(1,i);\r\n\telse:\r\n\t\tfor i in range(1,h+1):\r\n\t\t\tprint(i,i+1)\r\n\t\tfor i in range(d-h):\r\n\t\t\tif i == 0:\r\n\t\t\t\tprint(1,h+2)\r\n\t\t\telse:\r\n\t\t\t\tprint(h+i+1,h+i+2)\r\n\t\tfor i in range(n-d-1):\r\n\t\t\tprint(2,n-i)\r\n", "n, d, h = [int(x) for x in input().split()]\r\n\r\nif not (d >= h and d <= 2 * h):\r\n print(\"-1\")\r\nelif d == h and h == 1 and n > 2:\r\n print(\"-1\")\r\nelse:\r\n if d == h:\r\n cur = 2\r\n for _ in range(h):\r\n print(cur - 1, cur)\r\n cur += 1\r\n tmproot = cur - 2\r\n while cur <= n:\r\n print(tmproot, cur)\r\n cur += 1\r\n else:\r\n cur = 2\r\n for _ in range(h):\r\n print(cur - 1, cur)\r\n cur += 1\r\n tmproot = 1\r\n for _ in range(d - h):\r\n print(tmproot, cur)\r\n tmproot = cur\r\n cur += 1\r\n while cur <= n:\r\n print(\"1\", cur)\r\n cur += 1\r\n", "n, d, h = map(int, input().split())\r\n\r\nif d == 1:\r\n if n == 2:\r\n print('1 2')\r\n else:\r\n print('-1')\r\nelif 2 * h < d:\r\n print('-1')\r\nelse:\r\n for i in range(2, h + 2):\r\n print(i - 1, i)\r\n for j in range(d - h):\r\n print(1 if j == 0 else h + j + 1, h + j + 2)\r\n for i in range(d + 2, n + 1):\r\n print(1 if h != d else 2, i)\r\n", "import heapq\n\ndef tree(n, d, h):\n if d > 2 * h:\n return\n\n if d == 1:\n if n > 2:\n return\n yield (1, 2)\n return\n\n for i in range(1, h+1):\n yield (i, i+1)\n if d == h:\n for i in range(h+2, n+1):\n yield (2, i)\n else:\n yield (1, h+2)\n for i in range(h+2, d+1):\n yield (i, i+1)\n for i in range(d+2, n+1):\n yield (1, i)\n\n\ndef main():\n n, d, h = readinti()\n T = list(tree(n, d, h))\n if T:\n print('\\n'.join(f'{e[0]} {e[1]}' for e in T))\n else:\n print('-1')\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", "'__author__'=='deepak Singh Mehta) '\r\n \r\n\r\n\r\n\r\nif __name__=='__main__':\r\n n,d,h = map(int,input().split())\r\n if d>(2*h) or (d==1 and n != 2):\r\n print(-1)\r\n else:\r\n for i in range(1,h+1):\r\n print(i,i+1)\r\n x = 1\r\n i = 1\r\n while i<=d-h:\r\n y = h + 1 + i\r\n print(x,y)\r\n x = y\r\n i += 1\r\n\r\n for i in range(d+2,n+1):\r\n print(i,(2 if d==h else 1))\r\n", "n,d,h=map(int,input().split())\r\nif n ==2:\r\n if d == h and d == 1:\r\n print('1 2')\r\n else:\r\n print(-1)\r\nelif d== 1 or d>2*h:\r\n print(-1)\r\nelse:\r\n for i in range(h):\r\n print(i+1,i+2) \r\n for i in range(d-h):\r\n print(1 if i==0 else i+h+1,i+h+2)\r\n \r\n for i in range(d+1,n):\r\n print(2 if d==h else 1, i+1)\r\n\r\n\r\n", "n,d,h=map(int,input().split())\r\nif not d<=2*h:\r\n print(-1)\r\n exit()\r\nif n>=3 and d==1:\r\n print(-1)\r\n exit()\r\nedges=[]\r\nfor i in range(1,h+1):\r\n edges.append([i,i+1])\r\nif h!=d:\r\n edges.append([1,h+2])\r\n for i in range(h+2,d+1):\r\n edges.append([i,i+1])\r\n for i in range(d+2,n+1):\r\n edges.append([1,i])\r\n for e in edges:\r\n print(*e)\r\nelse:\r\n for i in range(h+2,n+1):\r\n edges.append([2,i])\r\n for e in edges:\r\n print(*e)", "\nfrom sys import stdin as Si\n\nif __name__=='__main__':\n n,d,h = map(int,Si.readline().split())\n if d>h*2 or (n>2 and d==1 and h==1): print(-1)\n else:\n ans = ''\n for i in range(h): ans+=('.'.join((str(i+1),str(i+2)))+',')\n t =1\n for i in range(h+2,d+2): ans+=('.'.join((str(t),str(i)))+',');t=i\n for i in range(d+2,n+1): ans+=('.'.join((str(h),str(i)))+',');t=i\n print (' '.join(('\\n'.join(ans.split(','))).split('.')))", "n, d, h = map(int, input().split())\r\nif h < ((d + 1) >> 1) or (n > 2 and d == 1):\r\n print(-1)\r\nelse:\r\n k = 2 if h != 1 else 1\r\n print(h + 1, k)\r\n for i in range(2, h):\r\n print(i, i + 1)\r\n if h != 1: print(h, 1)\r\n if h < d: print(1, h + 2)\r\n for i in range(h + 2, d + 1):\r\n print(i, i + 1)\r\n for i in range(d + 2, n + 1):\r\n print(i, k)", "[n,d,h]=[int(i) for i in input().split()]\r\nif d>2*h or (n>2 and d==1):\r\n print(-1)\r\nelse:\r\n for i in range(1,h+1):\r\n print(i,i+1)\r\n if d>h:\r\n print(1,h+2)\r\n for i in range(h+2,d+1):\r\n print(i,i+1)\r\n for i in range(d+2,n+1):\r\n print(1,i)\r\n else:\r\n for i in range(d+2,n+1):\r\n print(2,i)", "from sys import stdin\r\nn,d,h=map(int,stdin.readline().split())\r\nif n<d:\r\n print(-1)\r\n exit()\r\nif d>2*h:\r\n print(-1)\r\n exit()\r\nif n>2 and h==1 and d<2*h:\r\n print(-1)\r\n exit()\r\n\r\np=1\r\nfor i in range(h):\r\n print (p,p+1)\r\n p=p+1\r\nif d==h and n>p:\r\n p=p+1\r\n begin=2\r\n print(begin,p)\r\nif d>h:\r\n p=p+1\r\n print(1,p)\r\n begin=1\r\n\r\nfor i in range(d-h-1):\r\n print(p,p+1)\r\n p=p+1\r\np=p+1\r\nfor i in range(p,n+1):\r\n print(begin,i)\r\n", "a,b,c=map(int,input().split())\r\nif b<c or c*2<b or a<b+1 or b==c==1 and a>2:\r\n print(-1)\r\n exit()\r\n\r\nfor i in range(c) :\r\n print(1+i,2+i)\r\nt=b-c\r\nprev=1\r\nif t==0 :\r\n prev=c+1\r\n\r\n\r\nfor i in range(t) :\r\n print(prev,i+c+2)\r\n prev=i+c+2\r\nl=2\r\nif c==1 :\r\n l=1\r\nfor i in range(a-prev) :\r\n print(l,prev+i+1)\r\n \r\n \r\n \r\n \r\n \r\n", "n, d, h = map(int, input().split())\nif d > 2 * h or d == 1 and n > 2:\n\tprint(-1)\nelse:\n\tfor i in range(h):\n\t\tprint(i+1, i+2)\n\tfor i in range(d - h):\n\t\tprint(1 if i == 0 else i+h+1, i+h+2)\n\tfor i in range(d+1, n):\n\t\tprint(2 if d == h else 1, i+1)\n" ]

[ "s1=input()\r\ns2=input()\r\nraz=len(s1)-1\r\nfor i in range(len(s2)):\r\n if s1[i]!=s2[i]: raz=i;break\r\nfor i in range(raz+1, len(s1)):\r\n if s1[i]!=s2[i-1]: print(0);exit()\r\ni=raz\r\nwhile i>0 and s1[raz]==s1[i-1]: i-=1\r\nprint(raz-i+1)\r\nprint(' '.join(map(str, range(i+1,raz+2))))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nS = input()\r\nT = input()\r\nN = len(T)\r\n\r\nv = []\r\nj = 0\r\nfor i in range(N):\r\n while j<=N and T[i]!=S[j]:\r\n v.append(j)\r\n j+=1\r\n j+=1\r\nif not v:\r\n v.append(N)\r\n \r\nif len(v)>1:\r\n exit(print(0))\r\n \r\nans = []\r\ni = v[0]\r\nwhile i<=N and S[v[0]]==S[i]:\r\n ans.append(i+1)\r\n i+=1\r\n \r\ni = v[0]-1\r\nwhile i>=0 and S[v[0]]==S[i]:\r\n ans.append(i+1)\r\n i-=1\r\nans.sort()\r\nprint(len(ans))\r\nprint(*ans)\r\n ", "a = input()\r\nb = input()\r\nl = len(a)\r\nbl = len(b)\r\nf = True\r\nfor i in range(l):\r\n if i == bl or a[i] != b[i]:\r\n if a[:i] + a[i+1:] == b:\r\n s = e = i\r\n c = a[i]\r\n for j in range(i,-1,-1):\r\n if c != a[j]:\r\n break\r\n s = j\r\n for j in range(i,l):\r\n if c != a[j]:\r\n break\r\n e = j\r\n print(e-s+1)\r\n print(\" \".join(map(str, list(range(s+1,e+2)))))\r\n else:\r\n print(0)\r\n f = False\r\n break", "# -----------------------------------------------------------\r\n# URL : https://codeforces.com/contest/39/problem/J\r\n# Title : Spelling Check\r\n# Notes : tag-codeforces, tag-problem-J\r\n# -----------------------------------------------------------\r\n\r\n# ---------------------------------------------------Shared part--------------------------------------------------------\r\nimport os\r\nimport time\r\nfrom collections import defaultdict\r\nfrom sys import stdin, maxsize, stdout\r\n\r\ninp = lambda: stdin.readline().strip()\r\niinp = lambda: int(inp())\r\nintl = lambda: list(map(int, inp().split()))\r\nstrl = lambda: list(inp().split())\r\nlist_to_string = lambda _a: \"\".join(map(str, _a))\r\nlist_to_string_list = lambda _a: \" \".join(map(str, _a))\r\n_dp = lambda default_value: defaultdict(lambda: default_value)\r\nflush = lambda: stdout.flush()\r\nprint_flush = lambda _text: (print(_text), flush())\r\n\r\n\r\ndef print_dp(_dict):\r\n for item in _dict.items():\r\n print(f\"{item[0]} = {item[1]}\")\r\n\r\n\r\nMOD = 10 ** 9 + 7\r\nINF = maxsize\r\nA = 911382323\r\nM = 9999999999879998\r\n\r\n\r\n# -------------------------------------------------------Solution-------------------------------------------------------\r\n\r\n\r\ndef prefix_length(s1, s2):\r\n i = 0\r\n while i < len(s1) and i < len(s2) and s1[i] == s2[i]:\r\n i += 1\r\n return i\r\n\r\n\r\ndef suffix_length(s1, s2):\r\n i = 0\r\n while i < len(s1) and i < len(s2) and s1[- 1 - i] == s2[- 1 - i]:\r\n i += 1\r\n return i\r\n\r\n\r\ndef solve_prefix_suffix():\r\n a = inp()\r\n b = inp()\r\n\r\n n_a = len(a)\r\n\r\n # count length of equals at the beginning\r\n prefix = prefix_length(a, b)\r\n\r\n # count length of equals at the end\r\n suffix = suffix_length(a, b)\r\n\r\n if prefix + 1 < n_a - suffix:\r\n print(0)\r\n return\r\n\r\n ans = list(range(max(n_a - suffix, 1), min(prefix + 1, n_a) + 1))\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\ndef run():\r\n solve_prefix_suffix()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n if os.environ.get(\"DEBUG_CODEFORCES\"):\r\n stdin = open(\"../../input.txt\", \"r\")\r\n start_time = time.time()\r\n run()\r\n print(\"\\n--- %s seconds ---\\n\" % (time.time() - start_time))\r\n else:\r\n run()\r\n", "s1 = input()\r\ns2 = input()\r\ns2+='@'\r\ni = 0\r\nf = 0\r\nwhile i<len(s1):\r\n if not f:\r\n if s1[i]!=s2[i]:\r\n f = 1\r\n ch = i\r\n elif f==1 and s1[i]!=s2[i-1]:\r\n f = 2 \r\n break\r\n i+=1\r\nif f==2:\r\n print(0)\r\n\r\nelse:\r\n pre = s1[ch]\r\n i = ch\r\n while i>=0 and pre==s1[i]:\r\n st = i\r\n i-=1\r\n \r\n ans = []\r\n for i in range(st+1,ch+2):\r\n ans.append(i)\r\n print(len(ans))\r\n print(*ans)\r\n\r\n ", "import sys\r\ninput = sys.stdin.readline\r\ns = input().strip()\r\nt = input().strip()\r\ni = 0\r\nwhile i < len(t) :\r\n if s[i] != t[i] :\r\n break\r\n i += 1\r\nif i == len(t) :\r\n while i >= 0 and s[-1] == s[i] :\r\n i -= 1\r\n print(len(t)-i)\r\n for j in range(i+2,len(s)+1) :\r\n print(j,end=' ')\r\nelse :\r\n j = k = i\r\n while i < len(t) :\r\n if s[i+1] != t[i] :\r\n break\r\n i += 1\r\n if i < len(t) :\r\n print(0)\r\n else :\r\n while j > 0 and s[j] == s[j-1] :\r\n j -= 1\r\n print(k-j+1)\r\n for a in range(j+1,k+2) :\r\n print(a,end=' ')", "s = input()\r\nt = input()\r\n\r\ndef solve(s, t):\r\n n = len(t)\r\n i = 0\r\n while i < n:\r\n if s[i] != t[i]:\r\n if s[:i] + s[i+1:] == t:\r\n indices = []\r\n j = i\r\n while s[j] == s[i]:\r\n indices.append(j)\r\n j -= 1\r\n return sorted(indices)\r\n else:\r\n return []\r\n i += 1\r\n indices = []\r\n j = n\r\n while j >= 0 and s[j] == s[n]:\r\n indices.append(j)\r\n j -= 1\r\n return sorted(indices)\r\n\r\nindices = solve(s, t)\r\nprint(len(indices))\r\nif indices:\r\n print(\" \".join(str(i+1) for i in indices))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\ns = input().strip()\r\nt = input().strip()\r\ni = 0\r\nwhile i < len(t) :\r\n if s[i] != t[i] :\r\n break\r\n i += 1\r\nif i == len(t) :\r\n while i >= 0 and s[-1] == s[i] :\r\n i -= 1\r\n print(str(len(t)-i)+'\\n')\r\n for j in range(i+2,len(s)+1) :\r\n print(str(j)+' ')\r\nelse :\r\n j = k = i\r\n while i < len(t) :\r\n if s[i+1] != t[i] :\r\n break\r\n i += 1\r\n if i < len(t) :\r\n print('0')\r\n else :\r\n while j > 0 and s[j] == s[j-1] :\r\n j -= 1\r\n print(str(k-j+1)+'\\n')\r\n for a in range(j+1,k+2) :\r\n print(str(a)+' ')", "import itertools\r\nimport math\r\nimport time\r\nfrom builtins import input\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\n\r\n# from sys import stdin, stdout\r\n# input, print = stdin.readline, stdout.write\r\n\r\ndecimal.getcontext().prec = 18\r\n\r\n\r\ndef solve():\r\n # PLEASE\r\n # without collisions...pls...\r\n # o-0\r\n\r\n s1 = str(sys.stdin.readline())\r\n s2 = str(sys.stdin.readline())\r\n\r\n m1 = 10 ** 9 + 9\r\n m2 = 10 ** 9 + 7\r\n p = 117351917731\r\n\r\n h2_m1 = 0\r\n h1_m1 = [0 for i in range(len(s1) + 1)]\r\n h1_m1[1] = ord(s1[0])\r\n\r\n h2_m2 = 0\r\n h1_m2 = [0 for i in range(len(s1) + 1)]\r\n h1_m2[1] = ord(s1[0])\r\n\r\n last_p1 = 1\r\n last_p2 = 1\r\n\r\n for i in range(len(s2)):\r\n h2_m1 = (h2_m1 + ord(s2[i]) * last_p1) % m1\r\n last_p1 = (last_p1 * p) % m1\r\n h1_new = (h1_m1[i + 1] + ord(s1[i + 1]) * last_p1) % m1\r\n h1_m1[i + 2] = h1_new\r\n\r\n h2_m2 = (h2_m2 + ord(s2[i]) * last_p2) % m2\r\n last_p2 = (last_p2 * p) % m2\r\n h1_new = (h1_m2[i + 1] + ord(s1[i + 1]) * last_p2) % m2\r\n h1_m2[i + 2] = h1_new\r\n\r\n res = []\r\n\r\n m1_rev = pow(p, m1 - 2, m1)\r\n m2_rev = pow(p, m2 - 2, m2)\r\n\r\n for i in range(len(s1)):\r\n pref = h1_m1[i]\r\n suff = ((h1_m1[-1] - h1_m1[i + 1]) * m1_rev) % m1\r\n\r\n if (pref + suff) % m1 == h2_m1:\r\n pref2 = h1_m2[i]\r\n suff2 = ((h1_m2[-1] - h1_m2[i + 1]) * m2_rev) % m2\r\n\r\n if (pref2 + suff2) % m2 == h2_m2:\r\n res.append(i + 1)\r\n\r\n print(len(res))\r\n sys.stdout.write(\" \".join(map(str, res)))\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "s=input()\r\nt=input()\r\nf=[0]*len(s)+[1]\r\nh=[0]*len(s)+[1]\r\nfor i in range(len(s)-1):\r\n f[i]=(s[i]==t[i])&f[i-1]\r\nfor i in range(len(s)-1,0,-1):\r\n h[i]=(s[i]==t[i-1])&h[i+1]\r\nl=[]\r\nfor i in range(len(s)):\r\n if f[i-1]&h[i+1]==1:l+=[i+1]\r\nprint(len(l))\r\nprint(*l)\r\n", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\na = input()\r\nb = input() + \" \"\r\npointer_a = 0\r\npointer_b = 0\r\ndiff = 0\r\nletter = ''\r\nans = []\r\nwhile pointer_a < len(a):\r\n if a[pointer_a] == b[pointer_b]:\r\n pointer_a += 1\r\n pointer_b += 1\r\n else:\r\n pointer_a += 1\r\n diff += 1\r\n letter = a[pointer_a-1]\r\n ans.append(pointer_a)\r\nif diff == 1:\r\n for i in range(ans[0]-1,len(a)-1):\r\n if a[i] == a[i+1]:\r\n ans.append(i+2)\r\n else:\r\n break\r\n for i in range(ans[0]-1,0,-1):\r\n if a[i] == a[i-1]:\r\n ans.append(i)\r\n else:\r\n break\r\n ans.sort()\r\n print(len(ans))\r\n print(*ans)\r\nelse:\r\n print(0)", "from collections import Counter\n\na = input()\nb = input()\n\ndef longest_common_prefix(word1, word2):\n i, j = 0, 0\n while j < len(word2):\n if word1[i] != word2[j]:\n return i \n i += 1\n j += 1\n return len(word1) - 1\n\ndef longest_common_suffix(word1, word2):\n i = len(word1) - 1\n j = len(word2) - 1\n while i >= 0 and j >= 0:\n if word1[i] != word2[j]:\n return i \n i -= 1\n j -= 1\n return 0\n\ndef solve(word1, word2):\n result = []\n lower_bound = longest_common_suffix(word1, word2)\n upper_bound = longest_common_prefix(word1, word2)\n if lower_bound > upper_bound:\n return []\n for i in range(lower_bound, upper_bound+1):\n result.append(str(i + 1))\n return result\n \n\n\nindices = solve(a, b)\nif not indices:\n print(0)\nelse:\n print(len(indices))\n print(' '.join(indices))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nw = input()[:-1]\r\nn = len(w)\r\n\r\na = [1]*(n+2)\r\nb = [1]*(n+2)\r\n\r\nfor i in range(n):\r\n if s[i] != w[i]:\r\n a[i] = 0\r\n\r\n a[i] = min(a[i], a[i-1])\r\n\r\nfor i in range(n-1, -1, -1):\r\n if s[i+1] != w[i]:\r\n b[i+1] = 0\r\n b[i+1] = min(b[i+1], b[i+2])\r\n\r\n\r\nd = [i+1 for i in range(n+1) if a[i-1] == b[i+1] == 1]\r\nprint(len(d))\r\nprint(*d)", "a = input()\r\nb = input()\r\nsize = len(b)\r\ncount = 0\r\nleft = 0\r\nfor index in range(size+1):\r\n if left >= size or a[index] != b[left]:\r\n left -= 1\r\n pointer = index\r\n count += 1\r\n left += 1\r\nif count == 1:\r\n holder = [pointer+1]\r\n while pointer - 1 > -1 and a[pointer-1] == a[pointer]:\r\n pointer -= 1\r\n holder.append(pointer+1)\r\n holder = holder[::-1]\r\n print(len(holder))\r\n print(*holder)\r\nelse:\r\n print(0)\r\n", "s, t = input(), input()\r\nn = j = len(t)\r\n\r\nfor i in range(n):\r\n if s[i] != t[i]:\r\n j = i\r\n break\r\n\r\nfor i in range(j + 1, n + 1):\r\n if s[i] != t[i - 1]:\r\n print(0)\r\n break\r\nelse:\r\n i = j\r\n while i > 0 and s[i - 1] == s[j]:\r\n i -= 1\r\n \r\n print(j - i + 1)\r\n print(*range(i + 1, j + 2))", "import sys\r\n \r\ns1 = sys.stdin.readline().strip()\r\ns2 = sys.stdin.readline().strip()\r\n \r\nl = 0\r\n \r\nwhile l < len(s2) and s1[l] == s2[l]:\r\n l += 1\r\n \r\nr = len(s1) - 1\r\nwhile r>=1 and s1[r] == s2[r-1]:\r\n r -= 1\r\nr = len(s1) - r - 1\r\n \r\ntotal = (l + 1) - (len(s1) - r) + 1\r\nif total < 0:\r\n total = 0\r\n \r\nprint(total)\r\nfor i in range(total):\r\n if i + 1 < total:\r\n end = ' '\r\n else:\r\n end = '\\n'\r\n print(i + len(s1) - r, end=end)", "s = input().strip()\nt = input().strip()\ndiff = len(s) - 1\nfor i in range(len(t)):\n if s[i] != t[i]:\n diff = i\n break\nfor i in range(diff + 1, len(s)):\n if s[i] != t[i - 1]:\n print(0)\n import sys; sys.exit()\nstart = diff\nwhile start != 0 and s[start - 1] == s[diff]:\n start -= 1\nprint(diff - start + 1)\nprint(' '.join(map(str, range(start + 1, diff + 2))))\n", "import sys\n\n#input functions\nreadint = lambda: int(sys.stdin.readline())\nreadints = lambda: map(int,sys.stdin.readline().split())\nreadar = lambda: list(map(int,sys.stdin.readline().split()))\nflush = lambda: sys.stdout.flush()\n\na = input()\nb = input()\nans = list()\nx = len(a)\nfront = 0\nback = 0\nfor i in range(x-1):\n if a[i] != b[i]: break\n front += 1\nfor j in range(x-1):\n if a[-j-1] != b[-j-1]: break\n back += 1\ny = x-1\nfor k in range(x):\n if min(front,k)+min(back,x-k-1) >= y: ans.append(k+1)\nprint(len(ans))\nprint(*ans)\n\n \t \t \t\t\t\t \t\t \t \t \t \t", "a = input()\r\nb = input()\r\n\r\ni = 0\r\nwhile i < len(b) and a[i] == b[i] :\r\n i += 1\r\n\r\nc = a[:i]+a[i+1:]\r\nif b != c :\r\n print(0)\r\n exit()\r\n\r\nj = i\r\nwhile j and a[j - 1] == a[j] :\r\n j -= 1\r\nans = list(range(j + 1, i + 2))\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))" ]

[ "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\ndef fn(a):\r\n print('a',a)\r\n n=len(a)\r\n pos1=[0]\r\n for i in range(1,n):\r\n pos1+=[pos1[-1]+a[i]*i]\r\n print('pos1',pos1)\r\n neg=[]\r\n for i in range(n):\r\n neg+=[i*(n-i-1)*a[i]]\r\n print('neg',neg)\r\n d=[]\r\n for i in range(1,n+1):\r\n sm=0\r\n for j in range(1,i):\r\n sm+=a[j-1]*(j-1)-(n-i)*a[i-1]\r\n d+=[sm]\r\n print('d',d);\r\n print('================================')\r\n p=-1\r\n for i in range(1,n):\r\n if pos1[i-1]-neg[i]<k:\r\n p=i\r\n break\r\n if p==-1:return\r\n a.pop(p)\r\n fn(a)\r\nfor _ in range(1):#nmbr()):\r\n n,k=lst()\r\n a=lst()\r\n # fn(a)\r\n # exit(0)\r\n pos = [0]\r\n for i in range(1, n):\r\n pos += [pos[-1] + a[i] * i]\r\n removed=0\r\n positive_term=0\r\n for i in range(1,n):\r\n negative_term=(i-removed)*a[i]*(n-i-1)\r\n # print(positive_term,positive_term-negative_term)\r\n if (positive_term-negative_term)<k:\r\n removed+=1\r\n stdout.write(str(i+1)+'\\n')\r\n else:positive_term += (i - removed) * a[i]\r\n", "r = lambda: map(int, input().split())\nn, k = r()\ndata = list(r())\nalc = 0\ntotal = 0\nfor i in range(n):\n d = alc - total * (n - (i - total) - total - 1) * data[i]\n if d >= k:\n alc += total * data[i]\n total += 1\n else:\n print(i + 1)\n\n\n", "n, k = map(int, input().split())\ns = 0\nrem, i = 0, 1\nans = []\nfor cur in map(int, input().split()):\n add = (n - i) * cur * (i - rem - 1)\n if s - add < k:\n rem += 1\n ans.append(i)\n else:\n s += cur * (i - rem - 1)\n i += 1\nprint(' '.join(map(str, ans)))\n", "n, k = map(int, input().split())\r\narr = map(int, input().split())\r\ns, j, all_res = 0, 0, []\r\nfor i, q in enumerate(arr, 1):\r\n if s - j * (n - i) * q < k: \r\n all_res.append(str(i))\r\n else:\r\n s += q * j\r\n j += 1\r\nprint('\\n'.join(all_res))\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,k=lst()\r\n a=lst()\r\n removed=0\r\n positive_term=0\r\n for i in range(1,n):\r\n negative_term=(i-removed)*a[i]*(n-i-1)\r\n if (positive_term-negative_term)<k:\r\n removed+=1\r\n stdout.write(str(i+1)+'\\n')\r\n else:positive_term += (i - removed) * a[i]", "n, k = map(int, input().split())\nc, m, l, r = 0, 0, [], 0\nfor e in [int(i) for i in input().split()]:\n d = m - c * (n - c - 1) * e\n r+= 1\n if d < k:\n n -= 1\n l += [r]\n else:\n m += c * e\n c += 1\nl.sort()\nfor e in l: print(e)\n \n \n", "n, k = map(int, input().split())\r\ns = 0\r\nrem, i = 0, 1\r\nanswer = []\r\nfor cur in map(int, input().split()):\r\n add = (n - i) * cur * (i - rem - 1)\r\n if s - add < k:\r\n rem += 1\r\n answer.append(i)\r\n else:\r\n s += cur * (i - rem - 1)\r\n i += 1\r\nprint('\\n'.join(map(str, answer)))\r\n", "import collections\nimport math\nimport os\nimport shutil\nfrom heapq import heapify, heappop, heappush\nimport queue\nfrom sys import stdin, stdout\nfrom itertools import *\nimport bisect\nimport sys\nfrom collections import deque\n\nMAXN = 200010\nmod = 1000000007\ninf = int(1e6)\n\nans = 0\nn,k=map(int,stdin.readline().split())\na=[int(i) for i in stdin.readline().split()]\na[1:]=a\na[0]=0\nb=[0]*(n+5)\npre=[0]*(n+5)\nfor i in range(1,n+1):\n b[i]=a[i]*(i-1)\n pre[i]=pre[i-1]+b[i]\nsum,nn,x=0,n,0\nfor i in range(1,n+1):\n if sum-(nn-x-1)*a[i]*x<k:\n print(i)\n nn-=1\n else:\n sum+=a[i]*x\n x+=1\n\t\t\t \t\t \t\t \t\t \t \t \t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\new = set()\r\nc = 0\r\nt = 0\r\nfor i in range(n):\r\n x = (i-t)*w[i]*(n-i-1)\r\n if c - x < k:\r\n t += 1\r\n ew.add(i+1)\r\n else:\r\n c += (i-t)*w[i]\r\nfor i in ew:\r\n print(i)", "n, k = map(int, input().split())\r\nS = D = i = 0\r\nans = []\r\nfor val in map(int, input().split()):\r\n f = (n - i - 1) * val * (i - D)\r\n if S - f < k:\r\n D += 1\r\n ans.append(i + 1)\r\n else: S += val * (i - D)\r\n i += 1\r\nprint(' '.join(map(str, ans)))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\npre,cnt=0,0\r\n\r\nfor i in range(N):\r\n a = A[i]\r\n b = pre-(N-i-1)*a*(i-cnt)\r\n if b<K:\r\n #print(pre,cnt,i,b)\r\n print(i+1)\r\n cnt+=1\r\n else:\r\n pre+=(i-cnt)*a\r\n \r\n\r\n \r\n \r\n \r\n \r\n", "n, k = map(int, input().split())\r\nc, v = 0, []\r\nfor i, a in enumerate(map(int, input().split())):\r\n j = i + 1 - len(v)\r\n d = c - (j - 1) * (n - j) * a\r\n if d < k:\r\n v.append(i + 1)\r\n n -= 1\r\n else:\r\n c += a * (j - 1)\r\nprint('\\n'.join(map(str, v)))" ]

[ "import sys\r\ninput=sys.stdin.readline\r\nn,m=map(int,input().split())#10w,20w\r\ng=[set()]\r\nvisited={}\r\nend=set()\r\nans=[]\r\ncycle=[]\r\nfor i in range(n):\r\n inp=list(map(int, input().split()))\r\n if inp[0]==0:\r\n end.add(i+1)\r\n g.append(set(inp[1:]))\r\ns=int(input())\r\npath={s}\r\nwhile path:\r\n u=path.pop()\r\n for v in g[abs(u)]:\r\n if u>0:\r\n v=-v\r\n if visited.get(v) is None:\r\n path.add(v)\r\n visited[v]=u\r\nwin=False\r\nfor u in end:\r\n if -u in visited:\r\n print('Win')\r\n u=-u\r\n while u!=s:\r\n ans.append(abs(u))\r\n u=visited[u]\r\n ans.append(s)\r\n print(\" \".join(str(i) for i in ans[::-1]))\r\n win=True\r\n exit()\r\nif not win:\r\n q=[s]\r\n visited={s}\r\n qu={s}\r\n while q:\r\n u=q[-1]\r\n if len(g[u])==0:\r\n q.pop()\r\n qu.remove(u)\r\n continue\r\n v=g[u].pop()\r\n if v not in visited:\r\n visited.add(v)\r\n q.append(v)\r\n qu.add(v)\r\n elif v in qu:\r\n print('Draw')\r\n win=True\r\n exit()\r\n if not win:\r\n print(\"Lose\")", "n, m = [int(x) for x in input().split()]\r\nedges = [set()]\r\ndrain = set()\r\nfor i in range(n):\r\n nums = [int(x) for x in input().split()]\r\n if nums[0] == 0:\r\n drain.add(i + 1)\r\n edges.append(set(nums[1:]))\r\nstart = int(input())\r\n\r\nnodes = {start}\r\nvisited = {}\r\nwhile len(nodes) > 0:\r\n curr = nodes.pop()\r\n for v in edges[abs(curr)]:\r\n if curr > 0:\r\n v = -v\r\n if visited.get(v) is None:\r\n nodes.add(v)\r\n visited[v] = curr\r\n\r\nok = False\r\nfor d in drain:\r\n if -d in visited:\r\n print('Win')\r\n v = -d\r\n l = []\r\n while v != start:\r\n l.append(abs(v))\r\n v = visited[v]\r\n l.append(start)\r\n print(' '.join(str(x) for x in l[::-1]))\r\n ok = True\r\n break\r\n\r\nif not ok:\r\n stack = [start]\r\n in_stack = {start}\r\n visited = {start}\r\n while len(stack) > 0:\r\n curr = stack[-1]\r\n if len(edges[curr]) == 0:\r\n stack.pop()\r\n in_stack.remove(curr)\r\n continue\r\n v = edges[curr].pop()\r\n if v not in visited:\r\n visited.add(v)\r\n stack.append(v)\r\n in_stack.add(v)\r\n elif v in in_stack:\r\n print('Draw')\r\n ok = True\r\n break\r\n if not ok:\r\n print('Lose')\r\n " ]

[ "'''\r\n有n种价值为a[i]的硬币，某人拥有总值为t的硬币，已知q对数字(b,c)中，所有的b之间不同、\r\n所有的c之间不同，其拥有的第b种币数量>第c种。求所有可能的方案数，并取模。\r\n\r\n方案数为0的情况：数对表示的大小关系形成环(dfs检测环)\r\n进行预处理之后使用完全背包\r\n'''\r\nR,P,G=lambda:map(int,input().split()),print,range;n,q,t=R();n+=1;a=[0]+[*R()]\r\n# 图的预处理这块没看明白\r\ng,d=[0]*n,[0]*n\r\nfor _ in G(q):u,v=R();g[u]=v;d[v]+=1\r\nc=0\r\nfor u in G(1,n):\r\n if d[u]==0:\r\n s=0;v=u\r\n while t>=0 and v>0:\r\n c+=1;s+=a[v];a[v]=s\r\n if g[v]>0:t-=s\r\n v=g[v]\r\n if t<0:break\r\nif t<0 or c<n-1:exit(P(0))\r\nf=[1]+[0]*t\r\nfor i in G(1,n):\r\n for x in G(a[i],t+1):\r\n f[x]+=f[x-a[i]];f[x]%=(10**9+7)\r\nP(f[t])" ]

[ "n,m = map(int,input().split())\r\na = sorted(list(map(int,input().split())))\r\nb = sorted(list(map(int,input().split())))\r\n\r\ndef solve(a, b):\r\n s = sum(b)\r\n l = len(a)\r\n ans = len(a) * sum(b)\r\n temp = 0\r\n for i in range(l-1):\r\n temp += a[i]\r\n ans = min(ans, (l - i - 1) * s + temp)\r\n return ans\r\n\r\nprint(min(solve(a, b), solve(b, a)))", "n, m = list(map(int, input().split()))\nA = list(map(int, input().split()))\nB = list(map(int, input().split()))\nA.sort(reverse=True)\nB.sort(reverse=True)\nsumA = sum(A)\nsumB = sum(B)\nansA = sumB\nansB = sumA\n\nfor i in range(1, n):\n ansA += min(A[i],sumB)\nfor i in range(1, m):\n ansB += min(B[i], sumA)\nprint(min(ansA,ansB))", "import sys\n\nn,m=map(int,sys.stdin.readline().split())\n\n\n\nA=list(map(int,sys.stdin.readline().split()))\n\n\n\nB=list(map(int,sys.stdin.readline().split()))\n\n\n\n\n\nA.sort(reverse=True)\n\nB.sort(reverse=True)\n\na=sum(A)\n\nb=sum(B)\n\nans=0\n\nleft=0\n\nfor i in range(n):\n\n left+=A[i]\n\n temp=b*(i+1)+a-left\n\n if(ans==0):\n\n ans=temp\n\n ans=min(ans,temp)\n\n\n\nleft=0\n\nfor i in range(m):\n\n left+=B[i]\n\n temp=a*(i+1)+b-left\n\n if(ans==0):\n\n ans=temp\n\n ans=min(ans,temp)\n\nprint(ans)\n\n \n\n\n\n\n\n# Made By Mostafa_Khaled", "#inf = open(\"test.in\")\r\n\r\nm, n = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans = 10**18\r\na = list(reversed(sorted(a)))\r\nb = list(reversed(sorted(b)))\r\nsuma = sum(a)\r\nsumb = sum(b)\r\n\r\nsa = [0]*(m+1)\r\nsb = [0]*(n+1)\r\n\r\nfor i in range(m - 1, -1, -1):\r\n sa[i] = sa[i + 1] + min(a[i], sumb)\r\n\r\nfor i in range(n - 1, -1, -1):\r\n sb[i] = sb[i + 1] + min(b[i], suma)\r\n\r\nfor i in range(1, m + 1):\r\n ans1 = i * sumb + sa[i]\r\n ans = min(ans, ans1)\r\n\r\nfor i in range(1, n + 1):\r\n ans1 = i * suma + sb[i]\r\n ans = min(ans, ans1)\r\n\r\nprint(ans)", "def solve(a, b):\r\n ret = 0\r\n\r\n a.sort()\r\n a = a[::-1]\r\n\r\n other = sum(b)\r\n ret = other\r\n for i in range(1, len(a)):\r\n ret += min(a[i], other)\r\n\r\n return ret\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nprint(min(solve(a, b), solve(b,a)))", "n, m = map(int, input().split())\r\nsum1 = 0\r\nsum2 = 0\r\na = list(map(int, input().strip().split()))\r\nb = list(map(int, input().strip().split()))\r\n\r\nfor i in range (0, n) :\r\n sum1 += a[i]\r\nfor i in range (0, m) :\r\n sum2 += b[i]\r\n\r\nans1 = sum2 \r\nans2 = sum1 \r\na.sort()\r\nb.sort()\r\nfor i in range (0, n-1) :\r\n ans1 += min(a[i], sum2)\r\nfor i in range (0, m-1) :\r\n ans2 += min(b[i], sum1)\r\n\r\nres = min(ans1, ans2)\r\nprint(res)", "n,m=map(int,input().split()) \r\n\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n# asum=0\r\n# bsum=0\r\na.sort()\r\nb.sort()\r\nasum=sum(a)\r\nbsum=sum(b)\r\nans=9999999999999999999999999999999999999999\r\n# print(a[0])\r\nle=0\r\nfor i in range(0,n):\r\n tmp=le+(n-i)*(bsum)\r\n ans=min(ans,tmp)\r\n le=le+a[i]\r\n \r\nle=0 \r\nfor i in range(0,m):\r\n tmp=le+(m-i)*(asum)\r\n ans=min(ans,tmp)\r\n le=le+b[i]\r\n \r\nprint(ans)\r\n" ]

[ "x1,y1,x2,y2 = map(int,input().split())\r\nprint((x2-x1)//2*(y2-y1+1)+(y2-x1)//2-(y1-x1)//2+1)" ]

[ "def main():\r\n\t(n, m) = (int(x) for x in input().split())\r\n\tL = [None] * n\r\n\tfor i in range(n):\r\n\t\tL[i] = input()\r\n\tprint(solver(n, m, L))\r\n\r\ndef solver(n, m, L):\r\n\ttr = topRow(n, m, L)\r\n\tif tr == -1:\r\n\t\treturn 1\r\n\tbr = bottomRow(n, m, L)\r\n\tlc = leftCol(n, m, L)\r\n\trc = rightCol(n, m, L)\r\n\tcolSize = rc - lc + 1\r\n\trowSize = br - tr + 1\r\n\tif colSize > n or rowSize > m:\r\n\t\treturn -1\r\n\tif colSize > rowSize:\r\n\t\tif br >= colSize:\r\n\t\t\tsquareTop = br - colSize + 1\r\n\t\t\tsquareBottom = br\r\n\t\telse:\r\n\t\t\tsquareTop = 0\r\n\t\t\tsquareBottom = colSize - 1\r\n\t\tsquareLeft = lc\r\n\t\tsquareRight = rc\r\n\telif colSize < rowSize:\r\n\t\tif rc >= rowSize:\r\n\t\t\tsquareLeft = rc - rowSize + 1\r\n\t\t\tsquareRight = rc\r\n\t\telse:\r\n\t\t\tsquareLeft = 0\r\n\t\t\tsquareRight = rowSize - 1\r\n\t\tsquareTop = tr\r\n\t\tsquareBottom = br\r\n\telse:\r\n\t\tsquareTop = tr\r\n\t\tsquareBottom = br\r\n\t\tsquareLeft = lc\r\n\t\tsquareRight = rc\r\n\tcount = 0\r\n\tfor i in range(squareTop, squareBottom + 1):\r\n\t\tfor j in range(squareLeft, squareRight + 1):\r\n\t\t\tif L[i][j] == 'W':\r\n\t\t\t\tcount += 1\r\n\treturn count\r\n\r\ndef topRow(n, m, L):\r\n\tfor i in range(n):\r\n\t\tif 'B' in L[i]:\r\n\t\t\treturn i\r\n\treturn -1\r\n\r\ndef bottomRow(n, m, L):\r\n\tfor i in range(n - 1, -1, -1):\r\n\t\tif 'B' in L[i]:\r\n\t\t\treturn i\r\n\treturn -1\r\n\r\ndef leftCol(n, m, L):\r\n\tfor j in range(m):\r\n\t\tfor i in range(n):\r\n\t\t\tif L[i][j] == 'B':\r\n\t\t\t\treturn j\r\n\treturn -1\r\n\r\ndef rightCol(n, m, L):\r\n\tfor j in range(m - 1, -1, -1):\r\n\t\tfor i in range(n):\r\n\t\t\tif L[i][j] == 'B':\r\n\t\t\t\treturn j\r\n\treturn -1\r\n\r\n\r\n\r\ngrid1 = [['W', 'W', 'W', 'W'], \r\n ['W', 'W', 'W', 'B'],\r\n ['W', 'W', 'W', 'B'],\r\n ['W', 'W', 'B', 'B'],\r\n ['W', 'W', 'W', 'W']]\r\n\r\n#print(solver(5, 4, grid1))\r\n\r\nmain()", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nx1 = y1 = 10 ** 10\r\nx2 = y2 = -1\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 'B':\r\n x1 = min(x1, i)\r\n x2 = max(x2, i)\r\n y1 = min(y1, j)\r\n y2 = max(y2, j)\r\n cnt += 1\r\ndx = x2 - x1 + 1\r\ndy = y2 - y1 + 1\r\nif cnt == 0:\r\n ans = 1\r\nelif max(dx, dy) <= min(n, m):\r\n ans = max(dx, dy)**2 - cnt\r\nelse:\r\n ans = -1\r\nprint(ans)", "def polycarp(n, m, l):\r\n left = min(l).find(\"B\")\r\n if left == -1:\r\n return 1\r\n right = m - min([x[::-1] for x in l]).find(\"B\") - 1\r\n top = bottom = -1\r\n for i in range(n):\r\n if l[i].find(\"B\") != -1:\r\n top = i\r\n break\r\n for i in range(n - 1, -1, -1):\r\n if l[i].find(\"B\") != -1:\r\n bottom = i\r\n break\r\n w = right - left + 1\r\n h = bottom - top + 1\r\n if w > n or h > m:\r\n return -1\r\n r = 0\r\n for i in range(top, bottom + 1):\r\n for j in range(left, right + 1):\r\n if l[i][j] == \"W\":\r\n r += 1\r\n if w > h:\r\n r += (w - h) * w\r\n else:\r\n r += (h - w) * h\r\n return r\r\n\r\n\r\nn, m = list(map(int, input().strip().split()))\r\nl = list()\r\nfor i in range(n):\r\n l.append(input().strip())\r\nprint(polycarp(n, m, l))", "n, m = map(int, input().split())\r\na = []\r\nb = []\r\nmaxU = n\r\nmaxD = -1\r\nmaxL = m\r\nmaxR = -1\r\nlet = 0\r\nfor i in range(n):\r\n ent = input()\r\n for j in range(m):\r\n b.append(ent[j])\r\n a.append(b)\r\n b = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == \"B\":\r\n let += 1\r\n if i < maxU:\r\n maxU = i\r\n if i > maxD:\r\n maxD = i\r\n if j < maxL:\r\n maxL = j\r\n if j > maxR:\r\n maxR = j\r\nst = 0\r\nres = 0\r\nif (maxD-maxU+1) > (maxR-maxL+1):\r\n st = maxD-maxU+1\r\nelse:\r\n st = maxR-maxL+1\r\nif let == 0:\r\n print(\"1\")\r\nelse:\r\n if (st <= n)and(st <= m):\r\n res = st*st - let\r\n print(res)\r\n else:\r\n print(\"-1\")\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n", "(n, m) = (int(i) for i in input().split())\r\n\r\n\r\n\r\ntop = -1\r\nleft = 101\r\nright = -1\r\ndown = -1\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n\tread = input()\r\n\tfor j in range(m):\r\n\t\tcur = read[j]=='B'\r\n\t\tif not cur: continue\r\n\t\tcnt += 1\r\n\t\tif top==-1:\r\n\t\t\ttop = i\r\n\t\tif j<left:\r\n\t\t\tleft = j\r\n\t\tif j>right:\r\n\t\t\tright = j\r\n\t\tdown = i\r\n\r\nstor = max(down-top, right-left)+1\r\nif n<stor or m<stor:\r\n\tprint(-1)\r\nelse:\r\n\tprint(stor**2 - cnt)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\na, b, c, d, x = 0, 101, 0, 101, 0\r\nfor i in range(n):\r\n s = input()[:-1]\r\n for j in range(m):\r\n if s[j] == 'B':\r\n if i > a:\r\n a = i\r\n if i < b:\r\n b = i\r\n if j > c:\r\n c = j\r\n if j < d:\r\n d = j\r\n x += 1\r\n\r\nq = max(abs(a-b), abs(c-d)) + 1\r\n\r\nif x == 0:\r\n print(1)\r\nelif q > n or q > m:\r\n print(-1)\r\nelse:\r\n print(q*q-x)", "n, m = map(int, input().split())\r\nL = [input() for _ in range(n)]\r\nC = [[0 for _ in range(m)] for _ in range(n)]\r\nx1, y1 = 500, 500\r\nx2, y2 = -1, -1\r\nfor i in range(n):\r\n sa = 0\r\n for j in range(m):\r\n if L[i][j] == 'B':\r\n x1 = min(i, x1)\r\n x2 = max(i, x2)\r\n y1 = min(j, y1)\r\n y2 = max(j, y2)\r\n sa += 1\r\n if i > 0:\r\n C[i][j] += C[i-1][j]\r\n C[i][j] += sa\r\nif x2 == -1:\r\n print(1)\r\nelse:\r\n a = max(x2-x1, y2-y1)\r\n ans = 1000000\r\n for i in range(n):\r\n for j in range(m):\r\n if i + a < n and j + a < m and i <= x1 and x2 <= i + a and j <= y1 and y2 <= j + a:\r\n s = C[i+a][j+a]\r\n if i > 0:\r\n s -= C[i-1][j]\r\n if j > 0:\r\n s -= C[i][j-1]\r\n if i > 0 and j > 0:\r\n s -= C[i-1][j-1]\r\n ans = min((a+1)*(a+1) - s, ans)\r\n if ans == 1000000:\r\n ans = -1\r\n print(ans)\r\n\r\n", "n, m = map(int, input().split(' '))\r\nx_min, x_max, y_min, y_max = n, -1, m, -1\r\nB_cnt = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j]=='B':\r\n B_cnt += 1\r\n x_max, x_min = max(x_max, i), min(x_min, i)\r\n y_max, y_min = max(y_max, j), min(y_min, j)\r\n\r\nnum = max((y_max-y_min+1), (x_max-x_min+1))\r\nres = num*num-B_cnt\r\nif B_cnt == 0:print(1)\r\nelif (num>n or num>m):print(-1)\r\nelse:print(res)", "def list_input():\r\n return list(map(int,input().split()))\r\ndef map_input():\r\n return map(int,input().split())\r\ndef map_string():\r\n return input().split()\r\n \r\nn,m = map_input()\r\ncnt = 0\r\nupp = n+1\r\nlow = -1\r\nleft = -1\r\nright = m+1\r\nfor i in range(n):\r\n a = list(input())\r\n cnt += a.count('B')\r\n for j in range(m):\r\n if a[j] == 'B':\r\n upp = min(upp,i)\r\n low = max(low,i)\r\n left = max(left,j)\r\n right = min(right,j)\r\nx = abs(upp-low)+1 \r\ny = abs(right-left)+1\r\ns = max(x,y)\r\n# print(upp,low,left,right)\r\nif cnt == 0:\r\n print(1)\r\nelif s > n or s > m:\r\n print(-1)\r\nelse:\r\n print((s*s)-cnt)\r\n \r\n", "from math import sqrt\r\nn,m=map(int,input().split())\r\na=[]\r\nb=[]\r\nc=[]\r\ne=[]\r\ncounter=0\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if s[j]=='B':\r\n counter+=1\r\n c.append(j+1)\r\n e.append(i+1)\r\n b.append(s[j])\r\n a.append(b)\r\n b=[]\r\nif len(c)==0:\r\n print(1)\r\nelse:\r\n s=max(max(c)-min(c)+1,max(e)-min(e)+1)\r\n if s<=n and s<=m:\r\n print(s*s-counter)\r\n else:\r\n print(-1)\r\n", "n, m = map(int, input().split())\r\nfield = [input() for _ in range(n)]\r\nblack = 0\r\nminheight = minwidth = 101\r\nmaxheight = maxwidth = 0\r\nfor i in range(n):\r\n s = field[i]\r\n for j in range(m):\r\n if s[j] == 'B':\r\n black += 1\r\n minheight = min(i, minheight)\r\n maxheight = max(i, maxheight)\r\n minwidth = min(j, minwidth)\r\n maxwidth = max(j, maxwidth)\r\nif black == 0:\r\n print(1)\r\nelse:\r\n a = maxwidth - minwidth + 1\r\n b = maxheight - minheight + 1\r\n c = max(a, b)\r\n des = c * c\r\n if des > n * m or c > n or c > m:\r\n print(-1)\r\n else:\r\n print(des - black)", "n,m=map(int,input().split())\r\nls=[]\r\nfor i in range(n):\r\n l=list(str(input()))\r\n ls.append(l)\r\nminr=1000\r\nmaxr=-1\r\nminc=1000\r\nmaxc=-1\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if ls[i][j]=='B':\r\n c+=1\r\n if minr>i:\r\n minr=i\r\n if maxr<i:\r\n maxr=i\r\n if minc>j:\r\n minc=j\r\n if maxc<j:\r\n maxc=j\r\nif c==0:\r\n print(1)\r\n exit()\r\nelif c==1:\r\n print(0)\r\n exit()\r\nelse:\r\n a=max(maxr-minr+1,maxc-minc+1)\r\n if a>m or a>n:\r\n print(-1)\r\n exit()\r\n else:\r\n print(a*a-c)\r\n exit()\r\n", "# PYTHON-3 \n\nn,m = input().split(\" \")\nn = int(n) # no. of rows \nm = int(m) # no. of columns\nc = 0 # counter variable\n\n# Algorithm used :\n#\tTo find out the length of the square we need to find four values -- \n#\tu_black(the index of the upper row with black cell), b_black(the index of the bottom row with black cell),\n#\tl_black(the index of leftmost column with black cell) and r_black(the index of rightmost column with black cell).\n#\tThen the length of the square will be the maximum of (b_black-u_black+1) and (l_black-r_black+1).\n#\tNow once we get the length of square we can find the no. of white squares to be painted \n#\tby subtracting the no. of black squares already present from the total black squares required (ie. length*length).\n\nu_black, b_black, l_black, r_black = n,0,m,0\n\nfor i in range(0,n):\n\trow = str(input())\n\tfor j in range(0,m):\n\t\tif row[j] == \"B\":\n\t\t\tu_black = min(u_black,i)\n\t\t\tb_black = max(b_black,i)\n\t\t\tl_black = min(l_black,j)\n\t\t\tr_black = max(r_black,j)\n\t\t\tc = c + 1 # for each black square found this counter variable increments by 1\n\nlength = max(b_black - u_black + 1, r_black - l_black + 1)\n\nif c == 0: # if no black squares are present then we can paint only one white square\n\tprint(1)\n\nelif length > m or length > n: # if the length of the square found is either greater than \n\tprint(-1)\t\t\t\t # the total no. of rows or total no. of columns then it is impossible to form a square\n\nelse :\n\tprint((length*length)-c)\n\n", "rows,cols = [int(i) for i in input().strip().split()]\nb_present = False\nl,r,u,d = cols,cols,rows,-1\nb_cnt = 0\nfor i in range(rows):\n\tcol = input().strip()\n\tif 'B' in col:\n\t\tb_present = True\n\t\tl = min(l,col.index('B'))\n\t\tu = min(u,i)\n\t\tr = min(r,col[::-1].index('B'))\n\t\td = max(d,i)\n\t\tb_cnt += col.count('B')\nif not b_present:\n\tprint(1)\nelse:\n\tr = cols - r - 1\n\t#print(l,r,u,d)\n\tif r - l + 1 > rows or d - u + 1 > cols:\n\t\tprint(-1)\n\telse:\n\t\t\tprint(max((r - l + 1),(d - u + 1)) * max((r - l + 1),(d - u + 1)) - b_cnt)\n", "n, m = map(int,input().split())\r\nq = [str(input()) for i in range(n)]\r\nk=0\r\nt=True\r\nu=0\r\nli=vi=n*m\r\npi=ni=0\r\nfor i in range(n):\r\n t=False\r\n u=0\r\n for j in q[i]:\r\n if j=='B':\r\n if u<li:\r\n li=u\r\n if u>pi:\r\n pi=u\r\n if i<vi:\r\n vi=i\r\n if i>ni:\r\n ni=i\r\n k+=1\r\n u+=1\r\nif (max(ni-vi, pi-li)+1)>n or (max(ni-vi, pi-li)+1)>m:\r\n print(-1)\r\nelif k==0:\r\n print(1)\r\nelse:\r\n print((max(ni-vi, pi-li)+1)**2-k)\r\n", "h, w = map(int, input().split())\r\nx0, y0, x1, y1, c = 1000, 1000, -1, -1, 0\r\nfor i in range(h):\r\n row = str(input())\r\n for j in range(w):\r\n if row[j] == 'B':\r\n x0, y0, x1, y1, c = min(x0, i), min(y0, j), max(x1, i), max(y1, j), c + 1\r\nln = max(x1 - x0 + 1, y1 - y0 + 1)\r\nif ln > min(h, w):\r\n print(-1)\r\nelif x1 == -1:\r\n print(1)\r\nelse:\r\n print(ln * ln - c)\r\n", "n,k=map(int,input().split(' '))\r\nb=[]\r\nr=[]\r\nc=[]\r\n\r\nfor i in range (n):\r\n b.append(input())\r\nfor i in range(n):\r\n for j in range(k):\r\n if b[i][j]=='B':\r\n \r\n r.append(i)\r\n c.append(j)\r\n\r\nif len(c)==0:\r\n print(1)\r\nelse:\r\n maxr=max(r)-min(r)\r\n maxc=max(c)-min(c)\r\n size=max(maxc,maxr)+1\r\n if (size>n or size>k):\r\n print(-1)\r\n else:\r\n print(size**2-len(c))\r\n \r\n", "n, m = list(map(int, input().split()))\r\nsheet = []\r\nfor i in range(n):\r\n sheet.append(input())\r\n\r\nmin_row = 101\r\nmax_row = -1\r\nmin_col = 101\r\nmax_col = -1\r\ncount_black = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if sheet[i][j] == 'B':\r\n count_black += 1\r\n min_row = min(min_row, i)\r\n max_row = max(max_row, i)\r\n min_col = min(min_col, j)\r\n max_col = max(max_col, j)\r\nl = max( max_row - min_row + 1, max_col - min_col + 1)\r\nif count_black == 0:\r\n print(1)\r\nelif l > n or l > m:\r\n print(-1)\r\nelse:\r\n print(l*l - count_black)", "a, b= map(int, input().split())\r\nm = [[0 for i in range(b)] for j in range(a)]\r\nl = b\r\nr = -1\r\nv = -1\r\nk = 0\r\nfor i in range(a):\r\n p = input()\r\n for j in range(b):\r\n m[i][j] = p[j]\r\n \r\n \r\n#for i in range(a):\r\n #for j in range(b):\r\n #print(m[i][j], end=' ')\r\n #print()\r\n \r\n \r\nfor i in range(a):\r\n for j in range(b):\r\n if m[i][j] == 'B':\r\n if v == -1:\r\n v = i\r\n n = i\r\n k += 1\r\n if l > j:\r\n l = j\r\n if r < j:\r\n r = j\r\nif k == 0:\r\n print(1)\r\nelse:\r\n s = max(n - v, r - l) + 1\r\n if s > a or s > b:\r\n print(-1)\r\n else:\r\n #print(s)\r\n print(s*s - k)", "if __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n cells = []\r\n for _ in range(n):\r\n cells.append(input())\r\n \r\n t = n\r\n l = m\r\n d = r = -1\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n if cells[i][j] == 'B':\r\n t = min(i, t)\r\n d = max(i, d)\r\n l = min(j, l)\r\n r = max(j, r)\r\n \r\n if d == -1:\r\n print(1)\r\n exit()\r\n \r\n cnt = 0\r\n for i in range(t, d + 1):\r\n for j in range(l, r + 1):\r\n if cells[i][j] == 'W':\r\n cnt += 1\r\n \r\n length = max(r - l, d - t) + 1\r\n if length > n or length > m:\r\n print(-1)\r\n exit()\r\n \r\n \r\n cnt += length * (2 * length - (r - l + d - t + 2))\r\n print(cnt)", "def solve(s):\r\n lst=[]\r\n tmp = []\r\n for i in s:\r\n if i == \"\\n\":\r\n lst.append(tmp)\r\n tmp=[]\r\n else:\r\n tmp.append(i)\r\n n=len(lst)\r\n m=len(lst[0])\r\n a,b,c,d=1000,-1,1000,-1\r\n tmp = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if lst[i][j]==\"B\":\r\n a=min(a,j)\r\n b=max(b,j)\r\n c=min(c,i)\r\n d=max(d,i)\r\n tmp+=1\r\n if a==1000:\r\n return 1\r\n elif b-a+1>n or d-c+1>m:\r\n return -1\r\n else:\r\n ans=max(b-a+1,d-c+1)\r\n return ans*ans-tmp\r\n\r\nn,m=map(int,input().split())\r\ns=\"\"\r\nfor i in range(n):\r\n s2=input()\r\n s+=s2+\"\\n\"\r\nprint(solve(s))\r\n \r\n", "n, m = map(int,input().split())\r\nminx, maxx, miny, maxy, total = 101, 0, 101, 0, 0\r\nfor i in range(n):\r\n string = input()\r\n for j in range(m):\r\n if string[j] == \"B\":\r\n total += 1\r\n minx = min(minx,j)\r\n maxx = max(maxx,j)\r\n miny = min(miny,i)\r\n maxy = max(maxy,i)\r\n\r\nans = max(maxx-minx+1,maxy-miny+1)\r\nif ans > min(m,n):\r\n print(-1)\r\nelif total == 0:\r\n print(1)\r\nelse:\r\n print(ans**2-total)", "n, m = map(int, input().split(' '))\r\nmin_j, max_j, min_i, max_i = m, -1, n, -1\r\ncount = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j]=='B':\r\n count += 1\r\n min_j = min(min_j, j)\r\n max_j = max(max_j, j)\r\n min_i = min(min_i, i)\r\n max_i = max(max_i, i)\r\nnum = max(max_j-min_j+1, max_i-min_i+1)\r\n\r\n\r\nif num>n or num>m:\r\n print(-1)\r\nelif count==0:\r\n print(1)\r\nelse:\r\n need = num*num - count\r\n print(need)", "n,m=map(int,input().split())\r\nmatr=[list(input()) for i in range(n)]\r\nh1=h2=w1=w2=-1\r\ncout=0\r\nfor i,x in enumerate(matr):\r\n for j,y in enumerate(x):\r\n if y=='B':\r\n if h1==-1:\r\n h1=h2=i\r\n w1=w2=j\r\n else:\r\n h2=i\r\n if j<w1:w1=j\r\n if j>w2:w2=j\r\n cout+=1\r\nres=max(h2-h1+1,w2-w1+1)\r\nif res>n or res>m:print(-1)\r\nelse:print(res*res-cout)", "n, m = input().split()\nn, m = int(n), int(m)\nnum_B = 0\nstart_row = m-1\nend_row = 0\nstart_column = n-1\nend_column = 0\nfor i in range(n):\n row = input()\n for j in range(m):\n if row[j] == 'B':\n start_row = min(j, start_row)\n end_row = max(j, end_row)\n start_column = min(i, start_column)\n end_column = max(i, end_column)\n num_B += 1\nif num_B == 0:\n print(1)\n quit()\nmax_dimen = max(end_row - start_row, end_column - start_column)+1\nif (max_dimen > n) or (max_dimen > m):\n print(-1)\nelse:\n print(max_dimen**2 - num_B)\n", "n,m = map(int,input().split())\nb=0\nmaxy=maxx=-1\nminy=minx=max(m,n)-1\nfor i in range(n):\n s=str(input())\n for j in range(m):\n if s[j]=='B':\n b+=1\n minx=min(minx,j); maxx=max(maxx,j)\n miny=min(miny,i); maxy=max(maxy,i)\nif b==0: print(1)\nelse:\n dx=maxx-minx+1; dy=maxy-miny+1\n d=max(dx,dy)\n if d>m or d>n: print(-1)\n else:\n t=d**2-b \n print(t)", "def load_data():\n n, m = list(map(int, input().split()))\n matrix = []\n for i in range(n):\n line = list(input())\n matrix.append(line)\n\n return n, m, matrix\n\ndef find_first_occurrence(M, mode):\n length = len(M)\n index_list = list(range(len(M)))\n if mode < 0: index_list = index_list[::-1]\n for i in index_list:\n if 'B' in M[i]:\n return i\n\n return -1\n\ndef main():\n n, m, matrix = load_data()\n top, btm, left, right = [0] * 4\n matrix_t = list(zip(*matrix))\n top = find_first_occurrence(matrix, 1)\n\n # if no B return 1\n if top == -1: print('1'); return;\n\n btm = find_first_occurrence(matrix, -1)\n left = find_first_occurrence(matrix_t, 1)\n right = find_first_occurrence(matrix_t, -1)\n\n width = abs(right - left)+1\n height = abs(top-btm)+1\n\n if width > n or height > m: print('-1'); return;\n\n side = max(width, height)\n\n if width >= height:\n target = [line[left:right+1] for line in matrix]\n up, down = top, btm\n else:\n target = matrix[top:btm+1]\n target = list(zip(*target))\n up, down = left, right\n\n res = float('inf')\n for i in range(len(target)-side+1):\n temp = list(range(i, i+side))\n if up in temp and down in temp: \n count = sum([target[j].count('W') for j in temp])\n res = min(res, count)\n\n print(res)\n\n\nif __name__ == '__main__':\n main()", "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\nmx, my, MX, MY = 10**9, 10**9, -(10**9), -(10**9)\r\na = [None]*n\r\nfor i in range(n):\r\n\ts = list(minp())\r\n\ta[i] = s\r\n\tfor j in range(len(s)):\r\n\t\tif s[j] == 'B':\r\n\t\t\tmx = min(mx, j)\r\n\t\t\tmy = min(my, i)\r\n\t\t\tMX = max(MX, j)\r\n\t\t\tMY = max(MY, i)\r\nif mx == 10**9:\r\n\tprint(1)\r\nelse:\r\n\twhile MX-mx != MY-my:\r\n\t\tif MX-mx < MY-my:\r\n\t\t\tif mx > 0:\r\n\t\t\t\tmx -= 1\r\n\t\t\telif MX < m - 1:\r\n\t\t\t\tMX += 1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tif my > 0:\r\n\t\t\t\tmy -= 1\r\n\t\t\telif MY < n - 1:\r\n\t\t\t\tMY += 1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\tif MX-mx != MY-my:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tr = 0\r\n\t\tfor i in range(my,MY+1):\r\n\t\t\tfor j in range(mx,MX+1):\r\n\t\t\t\tif a[i][j] != 'B':\r\n\t\t\t\t\tr+=1\r\n\t\tprint(r)\r\n", "n,k=map(int,input().split())\r\nlist1=[]\r\nlist2=[]\r\nblack = 0\r\nside = 0\r\n\r\nfor i in range(n):\r\n line=input()\r\n for a in range(len(line)):\r\n if line[a]=='B':\r\n list1.append(i)\r\n list2.append(a)\r\n black+=1\r\n\r\nif black==0:\r\n print(1)\r\nelse:\r\n side=max(max(list1)-min(list1)+1,max(list2)-min(list2)+1)\r\n if n<side or k<side:\r\n print(-1)\r\n else:\r\n print(side*side-black)", "\r\nn, m = [int(i) for i in input().split()]\r\nnm = []\r\nfor i in range(n):\r\n\tnm.append([i for i in input()]) \r\n\t\r\n\r\nL = []\r\nD = []\r\ncount = 0\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif nm[i][j] == \"B\":\r\n\t\t\tL.append(i)\r\n\t\t\tD.append(j)\r\n\t\t\tcount += 1\r\n\t\t\t#print(L, D, count)\r\n\t\t\t\r\nsizeL = 0\r\nif L:\r\n\tsizeL = max(L) - min(L) + 1\r\n\r\nsizeD = 0\r\nif D:\r\n\tsizeD = max(D) - min(D) + 1\r\n\t\r\nsize = max(sizeL, sizeD)\r\nif count == 0:\r\n\tsize = 1\r\n#print(size, sizeL, sizeD, count)\r\n\r\nif (size > n) or (size > m):\r\n\tprint(-1)\r\nelse: \r\n\tprint(size**2 - count)\r\n\t", "inp = input()\r\nn, m = inp.split()\r\nn = int(n)\r\nm = int(m)\r\ngrid = []\r\ntop = n\r\nbtm = 0\r\nlft = m\r\nrht = 0\r\nallBlackCount = 0\r\n\r\nfor i in range(0,n):\r\n inp = input()\r\n grid.append(inp)\r\n \r\nfor i in range(0, n):\r\n for j in range(0, m):\r\n if grid[i][j] == 'B':\r\n top = min(top, i)\r\n btm = max(btm, i)\r\n lft = min(lft, j)\r\n rht = max(rht, j)\r\n allBlackCount += 1\r\n\r\n# print(top,lft)\r\n# print(btm,rht)\r\n\r\nh = btm-top+1\r\nw = rht-lft+1\r\nsz = max(h, w)\r\n\r\nif allBlackCount == 0:\r\n print(1)\r\nelif sz > n or sz > m:\r\n print(-1)\r\nelse:\r\n print(sz*sz-allBlackCount)", "n, m = list(map(int, input().split()))\r\nrows = []\r\nb = 0\r\nymin, ymax, xmin, xmax = n - 1, 0, m - 1, 0\r\nfor i in range(n):\r\n row = input()\r\n for j in range(m):\r\n if row[j] == \"B\":\r\n b += 1\r\n if j > xmax:\r\n xmax = j\r\n if j < xmin:\r\n xmin = j\r\n rows.append(row)\r\nfor i in range(m):\r\n for j in range(n):\r\n if rows[j][i] == \"B\":\r\n if j > ymax:\r\n ymax = j\r\n if j < ymin:\r\n ymin = j\r\nxlen = xmax - xmin + 1\r\nylen = ymax - ymin + 1\r\nif xlen > n or ylen > m:\r\n print(-1)\r\nelif b == 0:\r\n print(1)\r\nelse:\r\n print(max(xlen,ylen)*max(xlen,ylen)-b)", "n,m=map(int,input().split())\nblacksX,blacksY=[],[]\ncount=0\nfor x in range(n):\n inp=input()\n for y in range(m):\n if inp[y]=='B':\n blacksX.append(x)\n blacksY.append(y)\n count+=1\nif len(blacksX)==0:\n print(1)\nelse:\n side=max(max(blacksX)-min(blacksX)+1,max(blacksY)-min(blacksY)+1)\n if side <=n and side <= m:\n print(side*side-count)\n else:\n print(-1)\n", "\nn, m= [int(_) for _ in input().split()]\nmatrix = []\nfor i in range(n):\n s = input()\n matrix.append([(c == \"B\") for c in s])\n\nx_min = m\ny_min = n\nx_max = 0 \ny_max = 0 \n\nfor i in range(n):\n for j in range(m):\n if matrix[i][j]:\n if j < x_min:\n x_min = j\n if j > x_max:\n x_max = j\n if i < y_min:\n y_min = i\n if i > y_max:\n y_max = i\n\nif(x_min == m):\n print(1)\nelif (y_max - y_min + 1 > m or x_max - x_min + 1 > n):\n print(-1)\nelse:\n ans = 0\n for i in range(y_min, y_max + 1):\n for j in range(x_min, x_max + 1):\n if not matrix[i][j]:\n ans+=1\n if(y_max - y_min < x_max - x_min):\n ans += (x_max - x_min + 1)*((x_max - x_min) - (y_max - y_min))\n elif(y_max - y_min > x_max - x_min):\n ans += (y_max - y_min + 1)*((y_max - y_min) - (x_max - x_min))\n print(ans)\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\nline=[None]*n\r\nfor i in range(n):\r\n\tline[i]=input()\r\n\r\nup=down=left=right=-1\r\nfor i in range(n):\r\n\tif 'B' in line[i]:\r\n\t\tup=i\r\n\t\tbreak\r\nfor i in range(n):\r\n\tif 'B' in line[~i]:\r\n\t\tdown=n+~i\r\n\t\tbreak\r\nfor i in range(m):\r\n\tis_found=False\r\n\tfor j in range(n):\r\n\t\tif line[j][i]=='B':\r\n\t\t\tleft=i\r\n\t\t\tis_found=True\r\n\t\t\tbreak\r\n\tif is_found:\r\n\t\tbreak\r\nfor i in range(m):\r\n\tis_found=False\r\n\tfor j in range(n):\r\n\t\tif line[j][~i]=='B':\r\n\t\t\tright=m+~i\r\n\t\t\tis_found=True\r\n\t\t\tbreak\r\n\tif is_found:\r\n\t\tbreak\r\n\r\nheight=down-up+1\r\nwidth=right-left+1\r\ncount=0\r\nif height>m or width>n:\r\n\tcount=-1\r\nelif up==down==left==right==-1:\r\n\tcount=1\r\nelse:\r\n\tfor i in range(up,down+1):\r\n\t\tfor j in range(left,right+1):\r\n\t\t\tif line[i][j]=='W':\r\n\t\t\t\tcount+=1\r\n\textra=0\r\n\tif height>width:\r\n\t\textra=(height-width)*height\r\n\telse:\r\n\t\textra=(width-height)*width\r\n\tcount+=extra\r\nprint(count)", "for a in range(1):\r\n ans1 = 0\r\n n, m = input().split()\r\n n, m = int(n), int(m)\r\n length = 0\r\n listok = []\r\n for a in range(n):\r\n \tlistok.append(input())\r\n coordlist = []\r\n for y in range(n):\r\n \tfor x in range(m):\r\n \t\tif listok[y][x] == 'B':\r\n \t\t\tcoordlist.append((x, y))\r\n maxlength = 0\t\t\t\r\n maxwidth = 0\t\t\t\r\n ys = []\r\n xs = []\r\n for a in range(len(coordlist)):\r\n x, y = coordlist[a]\r\n ys.append(y)\r\n xs.append(x)\r\n if xs == [] or ys == []:\r\n print(1)\r\n break\r\n maxwidth = max(xs) - min(xs) + 1\r\n maxlength = max(ys) - min(ys) + 1\r\n ans = 0\r\n if maxlength > maxwidth:\r\n length = maxlength\r\n else:\r\n length = maxwidth\r\n if length > n or length > m:\r\n print(-1)\r\n break\r\n for x in range(max(xs) - (length - 1), max(xs)+1):\r\n for y in range(max(ys) - (length - 1), max(ys)+1):\r\n if listok[y][x] == 'W':\r\n ans += 1\r\n print(ans)", "if __name__ == \"__main__\":\r\n n, m = list(map(int, input().split()))\r\n matrix = list()\r\n minR = n; minC = m; maxR=maxC=0\r\n count = 0\r\n for i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == 'B':\r\n minR = min(minR, i)\r\n maxR = max(maxR, i)\r\n minC = min(minC, j)\r\n maxC = max(maxC, j)\r\n count += 1\r\n edge = max(maxR-minR+1, maxC-minC+1)\r\n if count == 0:\r\n print(1)\r\n elif edge > n or edge > m:\r\n print(-1)\r\n else:\r\n print(edge*edge-count)\r\n \r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Wed Jul 12 10:15:46 2017\n\n@author: malware\n\"\"\"\n\nn, m = map(int, input().split())\n\nc = []\na = []\nnumBlack = 0\nfor i in range(n):\n st = str(input())\n #print(st)\n c.append([])\n for ch in st:\n c[i].append(ch)\ns = []\n#print(c)\n\nfor i in range(n):\n a.append([0]*m)\n s.append([0]*m)\n for j in range(m):\n if (c[i][j] == 'W'):\n a[i][j] = 0\n else:\n a[i][j] = 1\n numBlack = numBlack + a[i][j]\n\ns[0][0] = a[0][0]\nfor i in range(1, n):\n s[i][0] = s[i - 1][0] + a[i][0]\n \nfor j in range(1, m):\n s[0][j] = s[0][j - 1] + a[0][j]\n \n \nfor i in range(1, n):\n for j in range(1, m):\n s[i][j] = s[i - 1][j] + s[i][j - 1] - s[i - 1][j - 1] + a[i][j]\n#print(numBlack)\nres = 123456789\nfor len in range(1, min(n, m) + 1):\n for i in range(n - len + 1):\n for j in range(m - len + 1):\n square = len * len\n if (i == 0):\n One = 0;\n else:\n One = s[i - 1][j + len - 1];\n Three = 0\n if (j == 0):\n Two = 0;\n Three = 0\n else:\n Two = s[i + len - 1][j - 1];\n if (i > 0 and j > 0): Three = s[i - 1][j - 1]\n Four = s[i + len - 1][j + len - 1];\n Black = Four - One - Two + Three \n \n if (Black != numBlack): continue\n #print(len, ' ',i,' ',j,' ',Black,' ', square)\n cur = square - Black\n res = min(res, cur)\nif (res == 123456789): res = -1\nprint(res)\n\n", "a,b=map(int,input().split())\r\nl,r=b,-1\r\nd,u=a,-1\r\nz=[];ok=1\r\nfor i in range(a):\r\n k=input();z.append(k)\r\n for j in range(b):\r\n if \"B\" in k:ok=0;l=min(l,k.find('B'));r=max(r,k.rfind('B'));d=min(d,i);u=max(u,i)\r\nif ok:print(1)\r\nelse:\r\n h=u-d+1;w=r-l+1\r\n dim=max(h,w)\r\n if dim>min(a,b):print(-1)\r\n else:\r\n s=(dim-min(h,w))*dim\r\n for i in range(d,u+1):\r\n for j in range(l,r+1):s+=0+(z[i][j]=='W')\r\n print(s)", "read = lambda: map(int, input().split())\r\nn, m = read()\r\na = [input() for i in range(n)]\r\ncnt = sum(i.count('B') for i in a)\r\nx1 = y1 = 1001\r\nx2 = y2 = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 'B':\r\n x1 = min(x1, i)\r\n x2 = max(x2, i)\r\n y1 = min(y1, j)\r\n y2 = max(y2, j)\r\nd = max(x2 - x1, y2 - y1) + 1\r\nif cnt == 0:\r\n ans = 1\r\nelif d > min(n, m):\r\n ans = -1\r\nelse:\r\n ans = d * d - cnt\r\nprint(ans)", "from math import *\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\nx=[inf,-inf]\r\ny=[inf,-inf]\r\nc=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(l[i][j]=='B'):\r\n c+=1\r\n x[0]=min(x[0],j)\r\n x[1]=max(x[1],j)\r\n y[0]=min(y[0],i)\r\n y[1]=max(y[1],i)\r\nif(c==0):\r\n print(1)\r\nelse:\r\n q=max(x[1]-x[0]+1,y[1]-y[0]+1)\r\n if(q>n or q>m):\r\n print(-1)\r\n else:\r\n print(q*q-c)\r\n", "n, m = list(map(int, input().split()))\nrows =[]\ncols=[]\nbl = 0\nmat = []\nfor i in range(n):\n\tk=input()\n\tfor j in range(m):\n\t\tif k[j] == \"B\":\n\t\t\trows.append(i)\n\t\t\tcols.append(j)\n\t\t\tbl +=1\nJ=False\nif bl==0:\n\tJ=True\n\tprint (1)\nif not J:\n\ta = min(rows)\n\tb = max(rows)\n\tc = min(cols)\n\td = max(cols)\n\n\tw = d-c+1\n\th= b-a+1\n\tif w>=h:\n\t\tif w <= n:\n\t\t\tj = w*w-bl\n\t\telse:\n\t\t\tj=-1\n\telse:\n\t\tif h > m:\n\t\t\tj = -1\n\t\telse:\n\t\t\tj=h*h-bl\n\tprint(j)", "n, m = map(int, input().split())\r\npole = list()\r\nmin_i, min_j, max_i, max_j = n, m, -1, -1\r\ncount_B = 0\r\n\r\nfor i in range(n):\r\n pole += [input()]\r\n for j in range(m):\r\n t = pole[i][j]\r\n if t == 'B':\r\n count_B += 1\r\n min_i, min_j, max_i, max_j = min(i, min_i), min(j, min_j), max(i, max_i), max(j, max_j)\r\n\r\nd_i, d_j = max_i - min_i, max_j - min_j\r\nside = max(d_i + 1, d_j + 1)\r\n\r\nprint(1) if count_B == 0 else print(side ** 2 - count_B) if side <= min(n, m) else print(-1)\r\n", "h,w=map(int,input().split())\r\nx0,y0,x1,y1,c=101,101,0,0,0\r\nfor i in range(h):\r\n s=str(input())\r\n for j in range(w):\r\n if s[j]== 'B':\r\n x0, y0, x1, y1, c =min(x0,j),min(y0,i),max(x1,j),max(y1,i),c+1\r\nans=max(y1-y0+1,x1-x0+1)\r\nif (ans>h)|(ans>w):\r\n print(-1)\r\nelif x0==101:\r\n print(1)\r\nelse:\r\n print(ans*ans-c)", "n, m = [int(s) for s in input().split()]\ng = [[0 for i in range(m)] for j in range(n)]\nsum = 0\ntop = n-1\nbottom = 0\nleft = m-1\nright = 0\nfor i in range(n):\n f = str(input())\n for j in range(m):\n if f[j] == 'B':\n sum += 1\n top = min(top, i)\n bottom = max(bottom, i)\n left = min(left, j)\n right = max(right, j)\nif sum == 0:\n print(1)\nelse:\n a = max(right - left + 1, bottom - top + 1)\n if a>n or a>m:\n print(-1)\n else:\n print(a**2 - sum)\n", "n,m = input().split(\" \")\nn = int(n)\nm = int(m)\nc = 0\nu_black, b_black, l_black, r_black = n,0,m,0\n\nfor i in range(0,n):\n\trow = str(input())\n\tfor j in range(0,m):\n\t\tif row[j] == \"B\":\n\t\t\tu_black = min(u_black,i)\n\t\t\tb_black = max(b_black,i)\n\t\t\tl_black = min(l_black,j)\n\t\t\tr_black = max(r_black,j)\n\t\t\tc = c + 1\n\nlength = max(b_black - u_black + 1, r_black - l_black + 1)\n\nif c == 0:\n\tprint(1)\n\nelif length > m or length > n:\n\tprint(-1)\n\nelse :\n\tprint((length*length)-c)\n\n", "n, m = [int(x) for x in input().split()]\nsheet = []\nfor i in range(n):\n\tsheet.append(input())\nnumB = 0\nfor i in range(n):\n\tnumB += sheet[i].count('B')\ntopRow = -1; bottomRow=-1; leftCol=-1; rightCol=-1\nfor i in range(n):\n\tif 'B' in sheet[i]:\n\t\ttopRow = i\n\t\tbreak\nfor i in range(n-1, -1, -1):\n\tif 'B' in sheet[i]:\n\t\tbottomRow = i\n\t\tbreak\nfor j in range(m):\n\tif leftCol > -1:\n\t\tbreak\n\tfor i in range(n):\n\t\tif sheet[i][j] == 'B':\n\t\t\tleftCol = j\nfor j in range(m-1, -1, -1):\n\tif rightCol > -1:\n\t\tbreak\n\tfor i in range(n):\n\t\tif sheet[i][j] == 'B':\n\t\t\trightCol = j;\nheight = bottomRow-topRow+1\nlength = rightCol-leftCol+1\nside = height if height > length else length\nif side > m or side > n:\n\tprint(-1)\nelse:\n\tprint(side**2-numB)\n\t\t\n", "from sys import stdin\nn, m = [int(i) for i in stdin.readline().split(' ')]\ntrim = lambda s: s[:-1] if (s[-1] == \"\\n\") else s\ncells = []\nfor i in range(0, n):\n cells.append(trim(stdin.readline()))\n\npossible = True\nrightColumn = -1\nbottomRow = -1\nleftColumn = -1\ntopRow = -1\nfor i in range(0, m):\n if (\"B\" in [j[-(i+1)] for j in cells]):\n leftColumn = m-i-1\n if (\"B\" in [j[i] for j in cells]):\n rightColumn = i\nfor i in range(0, n):\n if (\"B\" in cells[i]):\n bottomRow = i\n if (\"B\" in cells[-(i+1)]):\n topRow = n-i-1\nsidelength = max(rightColumn-leftColumn+1, bottomRow-topRow+1)\nans = sidelength**2\nif (topRow == -1):\n ans = 1\nif ((sidelength > n) or (sidelength > m)):\n possible = False\nfor i in range(topRow, bottomRow+1):\n for j in range(leftColumn, rightColumn+1):\n if cells[i][j] == \"B\":\n ans -= 1\n\nif possible:\n print(ans)\nelse:\n print(-1)\n", "n, m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\n\r\nr=[]\r\nc=[]\r\ntotal=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='B':\r\n r.append(i)\r\n c.append(j)\r\n total+=1\r\n\r\nif total!=0:\r\n mir=min(r) \r\n mar=max(r)\r\n x= mar-mir+1\r\n\r\n mic=min(c)\r\n mac=max(c)\r\n y=mac-mic+1\r\n\r\n h=max(x,y) \r\n if h>n or h>m:\r\n print(-1)\r\n else:\r\n print(h*h-total)\r\nelse:\r\n print(1) \r\n\r\n\r\n ", "n, m = map(int, input().split())\r\nT = [[] for i in range(n)]\r\nfor i in range(n):\r\n a = list(input())\r\n T[i] = a\r\nINF = float(\"inf\")\r\nminX, maxX = INF, 0\r\nminY, maxY = INF, 0\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if T[i][j] == \"B\":\r\n minX = min(minX, i)\r\n maxX = max(maxX, i)\r\n minY = min(minY, j)\r\n maxY = max(maxY, j)\r\n cnt += 1\r\n\r\nlen = max(maxX - minX + 1, maxY - minY + 1)\r\nif cnt == 0:\r\n print(1)\r\nelif len <= n and len <= m:\r\n print(len * len - cnt)\r\nelse:\r\n print(-1)\r\n\r\n", "sheet = []\r\nnm = input().split(' ')\r\nn= int(nm[0])\r\nm = int(nm[1])\r\ncountB = 0\r\nminr = minc = 101\r\nmaxr = maxc = -1\r\nfor i in range(n):\r\n sheet.append(input())\r\n for j in range(len(sheet[i])):\r\n if sheet[i][j]=='B':\r\n countB+=1\r\n if i<minr:\r\n minr = i\r\n if i>maxr:\r\n maxr = i\r\n if j<minc:\r\n minc = j\r\n if j>maxc:\r\n maxc = j\r\n# print(countB)\r\n# print(str(minr)+\" \"+str(maxr)+\" \"+str(minc)+\" \"+str(maxc))\r\nif minr==101 and maxr==-1:\r\n print(1)\r\nelse:\r\n L = 0\r\n if (maxr-minr+1)>(maxc-minc+1):\r\n L = maxr-minr+1\r\n else:\r\n L = maxc-minc+1\r\n if L>n or L>m:\r\n print(-1)\r\n else:\r\n size = L*L\r\n print(size-countB)\r\n\r\n\r\n", "class CodeforcesTask828BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.square = []\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[0]):\n self.square.append(input())\n\n def process_task(self):\n bxmax = bymax = 0\n bxmin = bymin = max(self.n_m) + 1\n blacks = 0\n for x in range(self.n_m[0]):\n for y in range(self.n_m[1]):\n if self.square[x][y] == \"B\":\n blacks += 1\n bxmin = min(bxmin, x)\n bxmax = max(bxmax, x)\n bymin = min(bymin, y)\n bymax = max(bymax, y)\n side = 1 + max((bxmax - bxmin), (bymax - bymin))\n if side > min(self.n_m):\n self.result = \"-1\"\n elif side < 0:\n self.result = \"1\"\n else:\n self.result = str((side ** 2) - blacks)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask828BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "nmStr = input()\nnm = nmStr.split()\nn = int(nm[0])\nm = int(nm[1])\n\nmap = []\nfor i in range(n):\n map.append(input())\n\ncount = 0\ntop = n\nbottom = 0\nleft = m\nright = 0\nfor row in range(n):\n for col in range(m):\n if map[row][col] == 'B':\n left = min(left, col)\n right = max(right, col)\n top = min(top, row)\n bottom = max(bottom, row)\n count += 1\n \nedge = max(bottom-top+1, right-left+1)\n\nif count == 0 and n > 0 and m > 0:\n print(1)\nelif edge > m or edge > n:\n print(-1)\nelse:\n print(edge*edge - count) \n\n \t \t\t \t \t\t \t\t \t \t \t\t", "n, m = map(int, input().split())\r\nl = [[e == 'B' for e in input()] for _ in range(n)]\r\na = b = float('inf')\r\nc = d = -float('inf')\r\nif any(map(any, l)):\r\n for i in range(n):\r\n for j in range(m):\r\n if l[i][j]:\r\n a = min(a, i)\r\n b = min(b, j)\r\n c = max(c, i)\r\n d = max(d, j)\r\n while c != n - 1 and c - a < d - b: c += 1\r\n while a != 0 and c - a < d - b: a -= 1\r\n while d != m - 1 and c - a > d - b: d += 1\r\n while b != 0 and c - a > d - b: b -= 1\r\n if c - a != d - b:\r\n print(-1)\r\n exit()\r\n cnt = 0\r\n for i in range(a, c + 1):\r\n for j in range(b, d + 1):\r\n if not l[i][j]: cnt += 1\r\n print(cnt)\r\nelse:\r\n print(1)", "import sys\n\ndef main():\n n,m = map(int,sys.stdin.readline().split())\n x=[]\n for i in range(n):\n x.append(sys.stdin.readline().rstrip())\n\n y = [-1,-1,-1,-1]\n\n for i in range(n):\n for j in range(m):\n if x[i][j]=='B':\n if y[0]==-1:\n y[0]=i\n y[1]=max(y[1],j)\n y[2] = max(y[2],i)\n if y[3]!=-1:\n y[3] = min(y[3],j)\n else:\n y[3] = j\n\n if y[0] == -1 and y[1] == -1 and y[2] == -1 and y[3] == -1:\n print(1)\n return \n\n q = max(y[1]-y[3]+1, y[2]-y[0]+1)\n if q > m or q>n:\n print(-1)\n return\n\n ans = 0\n for i in range(y[0],y[2]+1):\n for j in range(y[3],y[1]+1):\n if x[i][j]=='W':\n ans+=1\n\n ans+= q*(q - (y[2]-y[0]+1)) + q*(q - (y[1]-y[3]+1)) \n print(ans)\n\n \nmain()\n", "n, m = map(int, input().split())\r\narr = []\r\nmax_x = []\r\nmax_y = []\r\nfor i in range(n):\r\n arr.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"B\":\r\n max_x.append(j)\r\n max_y.append(i)\r\nif len(max_x) == 0:\r\n print(1)\r\n exit()\r\ndif_x = max(max_x) - min(max_x) + 1\r\ndif_y = max(max_y) - min(max_y) + 1\r\nsize = max(dif_x, dif_y)\r\nif size > n or size > m:\r\n print(-1)\r\n exit()\r\nelse:\r\n print(size ** 2 - len(max_x))", "n,m=map(int,input().split())\r\nx1,y1,x2,y2,c=m,n,0,0,0\r\nfor i in range(n):\r\n s=input()\r\n for j in range(m):\r\n if s[j]=='B':\r\n if x1>j:x1=j\r\n if x2<j:x2=j\r\n if y1>i:y1=i\r\n if y2<i:y2=i\r\n c+=1\r\nif c==0:\r\n print(1)\r\nelse:\r\n w=x2-x1+1\r\n h=y2-y1+1\r\n h=max(w,h)\r\n if h>n or h>m:\r\n print(-1)\r\n else:\r\n print(h*h-c)\r\n", "n, m = map(int, input().split())\r\nnn0 = n\r\nnn1 = -1\r\nmm0 = m\r\nmm1 = -1\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n s = input().strip()\r\n if \"B\" in s:\r\n nn0 = min(i, nn0)\r\n nn1 = max(i, nn1)\r\n mm0 = min(s.index(\"B\"), mm0)\r\n mm1 = max(s.rindex(\"B\"), mm1)\r\n cnt += sum(map(lambda z: z == \"B\", s))\r\nif nn1 < 0:\r\n print(1)\r\nelse:\r\n z = max(nn1-nn0, mm1-mm0) + 1 \r\n if z <= min(m,n):\r\n print(z*z - cnt)\r\n else: \r\n print(-1)\r\n ", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\n[n, m] = list_input()\r\ncell = list()\r\nfor i in range(n):\r\n cell.append(input())\r\n\r\nps = [[0 for j in range(m+1)] for i in range(n+1)]\r\nfor i in range(n):\r\n for j in range(m):\r\n a = 0\r\n if cell[i][j] == 'B':\r\n a = 1\r\n ps[i+1][j+1] = ps[i+1][j]+ps[i][j+1]-ps[i][j]+a\r\n\r\nres = 1<<30\r\nfor i in range(n):\r\n for j in range(m): \r\n h = n-i\r\n w = m-j\r\n lmax = min(h, w)\r\n for l in range(1, lmax+1):\r\n cnt = ps[i+l][j+l]-ps[i][j+l]-ps[i+l][j]+ps[i][j]\r\n if cnt == ps[n][m]:\r\n res = min(res, l*l-ps[n][m])\r\n\r\nif res == 1<<30:\r\n print('-1')\r\nelse:\r\n print(res)\r\n", "n, m = map(int, input().split())\nour = [input() for i in range(n)]\nfirst = -1\nfor i in range(n):\n if 'B' in our[i]:\n first = i\n break\nlast = -1\nfor i in range(n- 1, -1, -1):\n if 'B' in our[i]:\n last = i\n break \nif first == -1:\n print(1)\nelse:\n f2 = -1\n l2 = -1\n for i in range(m):\n a = [our[j][i] for j in range(n)]\n if 'B' in a:\n f2 = i\n break\n for i in range(m - 1, -1, -1):\n a = [our[j][i] for j in range(n)]\n if 'B' in a:\n l2 = i\n break \n if last - first + 1 > m or l2 - f2 + 1 > n:\n print(-1)\n else:\n res = 0\n for i in range(first, last + 1):\n for j in range(f2, l2 + 1):\n if our[i][j] == 'W':\n res += 1\n res += max(last - first + 1, l2 - f2 + 1) ** 2 - (last - first + 1) * (l2 - f2 + 1)\n print(res)", "def solve():\n H, W = list(map(int, input().split()))\n top = H\n low = 0\n left = W\n right = 0\n painted = 0\n for h in range(H):\n string = input()\n for w in range(len(string)):\n if (string[w] == 'B'):\n painted += 1\n top = min(top, h)\n low = max(low, h)\n left = min(left, w)\n right = max(right, w)\n square_dim = max((low-top+1),(right - left+1))\n #print (low,top,right,left)\n if (painted == 0):\n print (1)\n elif (square_dim > H or square_dim > W):\n print(-1)\n else:\n print (square_dim*square_dim - painted)\n \n\ndef main():\n solve()\n\nmain()\n\t\t \t \t\t \t\t \t \t\t\t\t \t\t \t", "while True:\n try:\n n,m=map(int,input().split())\n a=[]\n x1=y1=11111111\n x2=y2=z=0\n for i in range(0, n):\n x=list(input())\n a.append(x)\n for i in range(0,n):\n for j in range(0,m):\n if a[i][j]=='B':\n z+=1\n x1 = min(x1, i)\n x2 = max(x2, i)\n y1 = min(y1, j)\n y2 = max(y2, j)\n if z==0:\n print(1)\n continue\n ans=max(x2-x1,y2-y1)+1\n if ans>n or ans>m:\n print(-1)\n else:\n print(ans*ans-z)\n except EOFError:\n break", "n,m = map(int,input().split())\r\ndata = [ input() for _ in range(n)]\r\nrmax=cmax=-1\r\nrmin=1000\r\ncmin=1000\r\nfor i in range(n):\r\n for j in range(m):\r\n if data[i][j]=='B':\r\n cmin=min(cmin,i)\r\n cmax=max(cmax,i)\r\n rmin=min(rmin,j)\r\n rmax=max(rmax,j)\r\n \r\nrow = rmax-rmin+1\r\ncolumn = cmax-cmin+1\r\nside = max(row,column)\r\nif rmax==-1 and cmax==-1:\r\n print(1)\r\nelse:\r\n if side<=n and side<=m:\r\n w=0\r\n for i in range(column):\r\n for j in range(row):\r\n if data[i+cmin][j+rmin]=='W':\r\n w+=1\r\n if column>row:\r\n w+=column*(column-row)\r\n elif row>column:\r\n w+=row*(row-column)\r\n print(w)\r\n else:\r\n print(-1)\r\n", "def min_squares(canvas, length, width):\n def find_top():\n for i in range(length):\n for j in range(width):\n if canvas[i][j] == \"B\":\n return i\n return -1\n\n def find_left():\n for j in range(width):\n for i in range(length):\n if canvas[i][j] == \"B\":\n return j\n\n def find_bottom():\n for i in reversed(range(length)):\n for j in range(width):\n if canvas[i][j] == \"B\":\n return i\n\n def find_right():\n for j in reversed(range(width)):\n for i in range(length):\n if canvas[i][j] == \"B\":\n return j\n\n t = find_top()\n if t == -1:\n return 1\n l = find_left()\n b = find_bottom()\n r = find_right()\n\n # print(t, l, b, r)\n painted = 0\n for i in range(t, b + 1):\n for j in range(l, r + 1):\n if canvas[i][j] == \"W\":\n painted += 1\n\n while(b - t < r - l):\n if t > 0:\n t -= 1\n painted += r - l + 1\n elif b < length - 1:\n b += 1\n painted += r - l + 1\n else:\n return -1\n\n while(r - l < b - t):\n if l > 0:\n l -= 1\n painted += b - t + 1\n elif r < width - 1:\n r += 1\n painted += b - t + 1\n else:\n return -1\n\n return painted\n\n\nif __name__ == \"__main__\":\n l, w = map(int, input().split())\n canvas = []\n for _ in range(l):\n canvas.append(input())\n print(min_squares(canvas, l, w))\n", "n, m = map(int, input().split())\nsq = [list(input()) for _ in range(n)]\n\nrmin = n\nrmax = 0\ncmin = m\ncmax = 0\ncnt = 0\nfor r in range(n):\n for c in range(m):\n if sq[r][c] == 'B':\n cnt += 1\n rmin = min(rmin, r)\n rmax = max(rmax, r)\n cmin = min(cmin, c)\n cmax = max(cmax, c)\n\nl = max(max(rmax - rmin + 1, cmax - cmin + 1), 1)\nif min(n, m) < l:\n ans = -1\nelse:\n ans = l * l - cnt\nprint(ans)\n\n\n", "n, m = [int(x) for x in input().split()]\r\n\r\narr = []\r\n\r\nx1, x2, y1, y2 = 101, -1, 101, -1\r\n\r\nfor i in range(n):\r\n arr.append(input().rstrip())\r\nc1 = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if arr[i][j] == \"B\":\r\n x1 = min(x1, j)\r\n x2 = max(x2, j)\r\n y1 = min(y1, i)\r\n y2 = max(y2, i)\r\n c1 = 1\r\n\r\n#print(x1, x2, y1, y2)\r\n\r\ncount = 0\r\n\r\nfor j in range(x1, x2 + 1):\r\n for i in range(y1, y2 + 1):\r\n if arr[i][j] == \"W\":\r\n count += 1\r\n\r\nsizeX = x2 - x1 + 1\r\nsizeY = y2 - y1 + 1\r\nif not c1:\r\n print(1)\r\nelif sizeX > sizeY:\r\n if sizeX > n:\r\n print(-1)\r\n else:\r\n print(count + sizeX * (sizeX - sizeY))\r\nelif sizeY > sizeX:\r\n if sizeY > m:\r\n print(-1)\r\n else:\r\n print(count + sizeY * (sizeY - sizeX))\r\nelse:\r\n print(count)\r\n", "n,m = map(int,input().split())\r\nx1,y1 = float(\"inf\"),float(\"inf\")\r\nx2,y2 = float(\"-inf\"),float(\"-inf\")\r\nc = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j]=='B':\r\n c+=1\r\n x1 = min(x1,i)\r\n x2= max(x2,i)\r\n y1 = min(y1,j)\r\n y2 = max(y2,j)\r\nif c==0:\r\n print(1)\r\nelif x2-x1+1>m or y2-y1+1>n:\r\n print(-1)\r\nelse:\r\n mx = max(x2-x1+1,y2-y1+1)\r\n print(mx*mx-c)\r\n\r\n", "n, m = map(int, input().split())\r\nfield = [input() for _ in range(n)]\r\nranges = [[m, -1], [n, -1]]\r\nfor i in range(n):\r\n for j in range(m):\r\n if field[i][j] == 'B':\r\n ranges[0][0] = min(j, ranges[0][0])\r\n ranges[0][1] = max(j, ranges[0][1])\r\n ranges[1][0] = min(i, ranges[1][0])\r\n ranges[1][1] = max(i, ranges[1][1])\r\ndimX = ranges[0][1] - ranges[0][0] + 1\r\ndimY = ranges[1][1] - ranges[1][0] + 1\r\n#print(ranges)\r\nif -1 in ranges[0]:\r\n print(1)\r\nelif dimX > n or dimY > m:\r\n print(-1)\r\nelse:\r\n if dimX > dimY:\r\n cnt = dimX * (dimX - dimY)\r\n else:\r\n cnt = dimY * (dimY - dimX)\r\n for i in range(ranges[1][0], ranges[1][1] + 1):\r\n for j in range(ranges[0][0], ranges[0][1] + 1):\r\n if field[i][j] == 'W':\r\n cnt += 1\r\n print(cnt)\r\n", "import sys\nimport math\n\ninp = input()\nsqr = []\nfor line in sys.stdin:\n s = list(line.rstrip())\n sqr.append(s)\n\nr = -1\nl = math.inf\nd = -1\nu = math.inf\n\nfor i, line in enumerate(sqr):\n for j, b in enumerate(line):\n if b == 'B':\n if i < u:\n u = i\n if i+1 > d:\n d = i + 1\n if j < l:\n l = j\n if j+1 > r:\n r = j + 1\n\nans = -1\nif r != -1:\n ver = d - u\n hor = r - l\n if ver < hor:\n while ver < hor:\n if u > 0:\n u -= 1\n ver += 1\n elif d < len(sqr):\n d += 1\n ver += 1\n else:\n break\n else:\n ans = 0\n elif ver > hor:\n while ver > hor:\n if l > 0:\n l -= 1\n hor += 1\n elif r < len(sqr[0]):\n r += 1\n hor += 1\n else:\n break\n else:\n ans = 0\n else:\n ans = 0\nelse:\n ans = 1\n\nif ans == 0:\n for i in range(u,d):\n for j in range(l,r):\n if sqr[i][j] == 'W':\n ans += 1\nprint(ans)\n", "import sys\r\nn,m = map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a=input()\r\n l.append(a)\r\nans=0\r\nmir=mic=sys.maxsize\r\nmar=mac=-sys.maxsize\r\nflag=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j] == 'B':\r\n ans-=1\r\n mar=max(mar,i)\r\n mir=min(mir,i)\r\n mac=max(mac,j)\r\n mic=min(mic,j)\r\ncheck = max(abs(mar-mir),abs(mac-mic))+1\r\nif ans==0:\r\n flag=0\r\nelif check > min(n,m):\r\n flag=-1\r\nelse:\r\n flag=1\r\n \r\nif flag==0:\r\n print(1)\r\nelif flag==-1:\r\n print(-1)\r\nelse:\r\n ans+=check*check\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\ninf = pow(10, 9) + 1\r\nlx, rx = inf, -inf\r\nly, ry = inf, -inf\r\nc = 0\r\nfor i in range(n):\r\n s = list(input().rstrip())\r\n for j in range(m):\r\n if not s[j] & 1:\r\n lx, rx = min(lx, i), max(rx, i)\r\n ly, ry = min(ly, j), max(ry, j)\r\n c += 1\r\nif lx == inf:\r\n ans = 1\r\nelse:\r\n u = max(rx - lx + 1, ry - ly + 1)\r\n ans = u * u - c if u <= min(n, m) else -1\r\nprint(ans)", "n,m=map(int,input().split())\r\ns=[list(input()) for _ in range(n)]\r\nu,d,l,r=11**11,0,11**11,0\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i][j]=='B':\r\n if i<u:\r\n u=i\r\n if i>d:\r\n d=i\r\n if j<l:\r\n l=j\r\n if j>r:\r\n r=j\r\nif r-l>=n or d-u>=m:\r\n print(-1)\r\nelif u==11**11 and d==0 and l==11**11 and r==0:\r\n print(1)\r\nelse:\r\n ans=0\r\n for i in range(u,d+1):\r\n for j in range(l,r+1):\r\n if s[i][j]=='W':\r\n ans+=1\r\n print(ans+((max(r-l+1,d-u+1)-min(r-l+1,d-u+1))*(max(r-l+1,d-u+1))))", "n, m = map(int, input().split())\r\ncells = [input() for _ in range(n)]\r\n\r\nbcells = [i for i in range(n) if 'B' in cells[i]]\r\nif not bcells:\r\n print(1)\r\nelse:\r\n up, down = bcells[0], bcells[-1]\r\n left = min(cells[i].find('B') for i in bcells)\r\n right = max(cells[i].rfind('B') for i in bcells)\r\n ver, hor = down - up + 1, right - left + 1\r\n\r\n if ver > m or hor > n:\r\n print(-1)\r\n else:\r\n cnt = sum([cells[i][left: right + 1].count('W') for i in range(up, down + 1)])\r\n if ver > hor:\r\n cnt += (ver - hor) * ver\r\n elif hor > ver:\r\n cnt += (hor - ver) * hor\r\n print(cnt)\r\n" ]

[ "n, m, a, b = [int(x) for x in input().split(' ')]\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n rem = n % m\r\n add_amt = (m - rem) * a\r\n sub_amt = rem * b\r\n print(add_amt if add_amt < sub_amt else sub_amt)", "n, m, a, b = [int(i) for i in input().split()]\r\rif n % m != 0:\r print(min((m - n % m) * a, n % m * b))\relse:\r print(0)", "n = [int(i) for i in input().split()]\n# print(n[0]%n[1]*n[3],(n[1]-n[0]%n[1])*n[2])\nprint(min(n[0]%n[1]*n[3],(n[1]-n[0]%n[1])*n[2]))", "(initial_number_of_commentary_boxes, number_of_delegations, fee_to_build, fee_to_discard) = map(int, input().split(' '))\n\nif initial_number_of_commentary_boxes % number_of_delegations == 0:\n print('0')\nelse:\n number_of_boxes_to_discard = initial_number_of_commentary_boxes - initial_number_of_commentary_boxes // number_of_delegations * number_of_delegations\n total_fee_to_discard = fee_to_discard * number_of_boxes_to_discard\n number_of_boxes_to_build = (initial_number_of_commentary_boxes // number_of_delegations + 1) * number_of_delegations - initial_number_of_commentary_boxes\n total_fee_to_build = fee_to_build * number_of_boxes_to_build\n\n print(min(total_fee_to_build, total_fee_to_discard))", "n , m , a , b = map(int, input().split() )\r\nx = (n//m +1)*m - n\r\ny = n - (n//m)*m\r\nprint( min(x*a , y*b) )", "n,m,a,b=map(int,input().split())\r\nif(n%m==0):\r\n print(0)\r\nelif(n>m):\r\n d=n%m\r\n c=(n//m+1)*m-n\r\n t1=c*a\r\n t2=d*b\r\n print(min(t1,t2))\r\nelif(m>n):\r\n c=m-n\r\n d=n-m*(n//m)\r\n t1=c*a\r\n t2=d*b\r\n print(min(t1,t2))\r\n \r\n", "n, m, a, b = map(int, input().split())\n\ndestroy = n%m\n\nbuild = m - destroy\n\ndest = destroy* b\n\nbui = build*a\n\nprint(min(dest, bui))", "n,m,a,b = map(int,input().split())\nr = n % m\nif(r*b < (m-r)*a):\n print(r*b)\nelse:\n print((m-r)*a)\n", "n,m,a,b=map(int,input().rstrip().split())\r\nprint(min((m-n%m)*a,n%m*b))", "n,m,a,b=map(int,input().split())\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n B=(n%m)*b\r\n A=(m-(n%m))*a\r\n print(min(A,B))\r\n \r\n", "# -*- coding: utf-8 -*-\nimport bisect\nimport heapq\nimport math\nimport random\nimport sys\nfrom collections import Counter, defaultdict\nfrom decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal\nfrom functools import lru_cache, reduce\nfrom itertools import combinations, combinations_with_replacement, product, permutations\n\nsys.setrecursionlimit(10000)\n\n\ndef read_int():\n return int(input())\n\n\ndef read_int_n():\n return list(map(int, input().split()))\n\n\ndef read_float():\n return float(input())\n\n\ndef read_float_n():\n return list(map(float, input().split()))\n\n\ndef read_str():\n return input()\n\n\ndef read_str_n():\n return list(map(str, input().split()))\n\n\ndef error_print(*args):\n print(*args, file=sys.stderr)\n\n\ndef mt(f):\n import time\n\n def wrap(*args, **kwargs):\n s = time.time()\n ret = f(*args, **kwargs)\n e = time.time()\n\n error_print(e - s, 'sec')\n return ret\n\n return wrap\n\n\n@mt\ndef slv(N, M, A, B):\n\n t1 = M - N % M\n t2 = M - t1\n return min(t1 * A, t2 * B)\n\n\ndef main():\n N, M, A, B = read_int_n()\n\n print(slv(N, M, A, B))\n\n\nif __name__ == '__main__':\n main()\n", "n,m,a,b = map(int,input().split())\r\nprint(min((m*((n//m)+1)-n)*a,(n%m)*b))", "n,m,a,b=map(int,input().split())\r\nan=n//m\r\nli=[an*m-m,an*m,an*m+m]\r\nprint(min((n-li[0])*b,(n-li[1])*b,(li[2]-n)*a))", "n, m, a, b = map(int, input().split())\nq, r = divmod(n, m)\nif not r: print(0)\nelse:\n x = r * b\n y = ( (q+1) * m - n ) * a\n print(x) if x < y else print(y)\n", "n, m, a, b = map(int,input().split())\nif (n%m) == 0:\n print(0)\nelse:\n import math\n top = math.ceil(n/m)\n down = math.floor(n/m)\n print(min((m*top-n)*a,(n-down*m)*b))", "n,m,a,b = map(int,input().split())\ng = (n%m)*b\nz = (m-n%m)*a\nprint(min(g,z))\n \t\t\t \t \t\t \t\t \t\t\t \t \t\t \t\t\t\t", "n, m, a, b = map(int, input().split())\nextra = n % m\nans = min(b * extra, a * (m - extra))\nprint(ans)\n", "def round_up(n, m):\r\n if n%m == 0: return n\r\n return n + (m-(n%m))\r\n\r\nn, m, a, b = map(int, input().split())\r\nprint(min(a*(round_up(n, m)-n), b*(n%m)))", "n,m,a,b = map(int,input().split())\r\nif n%m == 0:\r\n print(0)\r\nelse:\r\n sn=n%m\r\n st=m-n%m\r\n if sn*b<st*a:\r\n print(sn*b)\r\n else:\r\n print(st*a)\r\n", "n,m,a,b=map(int,input().split())\r\nif n%m!=0:\r\n c=(m-(n%m))*a\r\nelse:\r\n c=0\r\nb=(n%m)*b\r\nprint(min(c,b))\r\n1000000000000\r\n750000000001", "# http://codeforces.com/contest/990/problem/A\nn, m, a, b = [int(x) for x in input().split()]\nans = min((n%m)*b, (m-n%m)*a)\nprint(ans)\n\n", "args = [int(n) for n in input().split()]\r\nrem = args[0] % args[1]\r\nif rem == 0:\r\n print(0)\r\nelse:\r\n build_cost = args[2] * (args[1] - rem)\r\n demo_cost = args[3] * rem\r\n if build_cost <= demo_cost:\r\n print(build_cost)\r\n else:\r\n print(demo_cost)", "n, m, a, b = map(int, input().strip().split())\r\n\r\nr = n % m\r\n\r\nif r == 0:\r\n print('0')\r\n exit(0)\r\n\r\ns = m - r\r\nres = min(a * s, b * r)\r\nprint(res)", "n, m, a, b = map(int, input().split())\r\n\r\nprint(min((n % m)*b, (m - n % m)*a))\r\n", "#!/usr/bin/python3\n\nn, m, a, b = [int (x) for x in input().strip().split()]\n\nl = (n - (n//m)*m)\nr = ((n//m + 1)*m - n)\n\nif (a*r > b*l):\n\tprint(b*l)\nelse:\n\tprint(a*r)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, a, b = map(int, input().split())\r\nif n % m == 0:\r\n ans = 0\r\nelse:\r\n x = n % m\r\n ans = min((m - x) * a, x * b)\r\nprint(ans)", "import math\r\nn,m,a,b = map(int,input().split())\r\n\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n temp = math.ceil(n/m)\r\n x = ((temp-1)*m)\r\n y = (temp*m)\r\n min1=10**18\r\n min2=10**18\r\n \r\n min1 = (n-x)*b\r\n min2 = (y-n)*a\r\n print(min(min1,min2))", "import sys\r\nfrom array import array\r\n\r\nn, m, a, b = map(int, input().split())\r\nd = n // m\r\nprint(min((n - (d*m)) * b, ((d+1)*m - n) * a))\r\n", "n,m,a,b=map(int,input().split())\r\nd = n%m\r\nv = (n//m + 1)*m - n\r\n\r\nprint(min(b*d,v*a))", "n,m,a,b=map(int,input().split())\nif(n%m==0):\n\tprint(0)\nelse:\n\tmod=n%m\n\tprint(min(b*mod,a*(m-mod)))\n", "n,m,a,b=map(int,input().split())\nprint(min(n%m*b,(m-n%m)*a))\nd=7\ne=6\nr=d+e\n\t \t \t \t\t\t\t \t\t\t\t \t\t \t\t \t\t", "k = input('')\r\nk = k.split()\r\nn = int(k[0])\r\nm = int(k[1])\r\na = int(k[2])\r\nb = int(k[3])\r\n\r\nprint(min((m-n%m)*a, n%m*b))", "import math\r\ns = input().split()\r\nfor i in range(4):\r\n s[i] = int(s[i])\r\nprint(min((s[1]-s[0]%s[1])*s[2],(s[0]%s[1])*s[3]))", "if __name__ == \"__main__\":\r\n x = list(map(int,input().split(' ')))\r\n if x[0]%x[1]==0:\r\n print(0)\r\n else:\r\n y = x[0]%x[1]\r\n print(min(x[3]*y,(x[1]-y)*x[2]))\r\n", "n,m,a,b = map(int,input().split())\nt1 = n % m * b\nt2 = abs(m - n % m) * a\nprint(min(t1,t2))", "n, m, a, b = map(int, input().split())\r\nif n % m == 0:\r\n print(0)\r\n exit()\r\nc_o_d = (n%m)*b\r\nc_o_b = ((m*(n//m+1))-n)*a\r\nprint(min(c_o_b, c_o_d))", "from math import ceil\r\nkab, dpr, cen, sn = map(int, input().split())\r\nkoe = ceil(kab/dpr)\r\ns1 = (koe * dpr - kab) * cen \r\nkoe -= 1\r\ns2 = (kab - koe * dpr) * sn\r\nprint(min(s1, s2))\r\n", "import sys\r\nn,m,a,b = map(int,input().split())\r\ndistroy= n%m\r\nbuild = ((n//m)+1)*m - n\r\nans = 0\r\nif((a*build)<(b*distroy)):\r\n print(a*build)\r\nelse:\r\n print(b*distroy)\r\n", "s = input().split(\" \");\r\nn = int(s[0])\r\nm = int(s[1])\r\na = int(s[2])\r\nb = int(s[3])\r\nprint(min((n%m) * b, (m - (n%m))*a))", "n,m,a,b=map(int,input().split())\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n x=(n%m)*b\r\n y=(m-(n%m))*a\r\n z=n*b+m*a\r\n print(min(x,min(y,z)))", "n,m,a,b=map(int,input().split())\r\nif n%m:\r\n more=m-n%m\r\n less=n%m\r\n print(min(more*a,less*b))\r\nelse: print(0)", "n,m,a,b=map(int,input().split())\r\nprint(min(((n%m)*b),(m-(n%m))*a))\r\n", "n,m,a,b = map(int,input().split())\r\nk = n % m\r\nprint(min(k*b,(m-k)*a))", "n, m, a, b = map(int, input().split())\nprint(min(n%m*b, (m-n%m)*a))\n", "n,m,a,b=map(int,input().split())\r\nk=n%m\r\nprint(min(k*b,(m-k)*a))", "n,m,a,b = tuple(map(int, input().split()))\r\n\r\nprint(min((m - (n % m)) * a, (n % m) * b))", "n, m, a, b = map(int,input().split())\r\np = n % m\r\nif p == 0:\r\n print(0)\r\nelse:\r\n s1 = (m - (n % m))*a\r\n s2 = (n % m)*b\r\n print(min(s1,s2))", "n,m,a,b = map(int,input().split())\nif n%m==0:\n print(0)\nelse:\n print(min((n%m)*b,(m-n%m)*a))\n", "num = [int(x) for x in input().split()]\r\n\r\nn = num[0]\r\nm = num[1]\r\na = num[2]\r\nb = num[3]\r\n\r\ncount = 0\r\nlow = n % m\r\nhigh = m - low\r\ndes = b * low\r\nbuild = a * high\r\n\r\npay = min([des, build])\r\nprint(pay)\r\n", "n,m,a,b=map(int,input().split())\r\n\r\nde = n % m\r\nbu = m - de\r\n\r\nprint(min(de * b, bu * a))\r\n ", "n, m, a, b = [int(x) for x in input().split(' ')]\r\nans = min((n % m) * b, (m - n%m) * a)\r\nprint(ans)", "n, m, a, b = map(int, input().split())\r\n\r\nsum = 0\r\nextra = n % m\r\nneed = m - (n % m)\r\n\r\nprint(min((extra * b), (need * a)))", "l,m,a,b = map(int,input().split())\ny = (l%m)*b\nz = (m-l%m)*a\nprint(min(y,z))\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,a,b=map(int,input().split())\r\n\r\nk = n%m\r\nprint(min(a*(m-k),b*k))", "from math import ceil\r\nn,m,a,b=map(int,input().split())\r\nw1=((ceil(n/m)*m)-n)*a\r\nw2=(n-((n//m)*m))*b\r\nprint(min(w1,w2))", "n,m,a,b=map(int,input().split())\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n x=n%m\r\n y=m-x\r\n build=y*a\r\n demo=x*b\r\n if build > demo:\r\n print(demo)\r\n else:\r\n print(build)\r\n", "a = list(map(int,input().split()))\r\nn1 = a[0] % a[1]\r\nn2 = a[1] - n1\r\nprint(min(n1*a[3], n2*a[2]))", "n, m, a, b = map(int, input().split())\r\nrem = n%m\r\nlol = rem*b\r\nlol_lol = (m-rem)*a\r\nprint(min(lol, lol_lol))", "(n, m, a, b) = map(int, input().split(\" \"))\nprint(min(a*(m - n%m),b*(n%m)))", "n,m,a,b=(int(i) for i in input().split())\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n if a*(m*((n//m)+1)-n)>=b*(n-m*(n//m)):\r\n print(b*(n-m*(n//m)))\r\n else:\r\n print(a*(m*((n//m)+1)-n))\r\n", "inp = input()\r\ntemp = inp.split()\r\nn = int(temp[0])\r\nm = int(temp[1])\r\na = int(temp[2])\r\nb = int(temp[3])\r\n\r\nif n%m == 0:\r\n print(0)\r\nelse:\r\n num_to_remove = n%m\r\n num_to_add = m - n%m\r\n cost_to_remove = b*num_to_remove\r\n cost_to_add = a*num_to_add\r\n print(min(cost_to_remove,cost_to_add))\r\n", "x,y,a,b=[int(x) for x in input().split()]\r\nf=(x%y)*b\r\ns=(y-x%y)*a\r\nif f<s:\r\n print(f)\r\nelse:\r\n print(s)", "data = [int(z) for z in input(\"\").split()]\nn = data[0]\nm = data[1]\na = data[2]\nb = data[3]\njudge = n/m\nif n/m == n//m:\n print(0)\nelse:\n fee1 = n%m * b\n fee2 = (int(n/m + 1) * m - n) * a\n if fee1 < fee2:\n print(fee1)\n else:\n print(fee2)\n\n", "n, m, a, b = map(int, input().split())\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n per = (m - n % m) * a\r\n sec = n % m * b\r\n print(min(per, sec))", "s=input().split()\r\nn,m,a,b=int(s[0]),int(s[1]),int(s[2]),int(s[3])\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n lower=abs(((n//m))*m-n)*b\r\n upper=(((n//m)+1)*m-n)*a\r\n print(min(lower,upper))\r\n", "n, m, a, b = map(int, input().split())\r\nx1 = n % m\r\nx2 = m - n%m\r\nprint(min(a*x2, b*x1))", "n, m, a, b = [int(i) for i in input().split()]\r\n\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n r = n % m\r\n rr = m - r\r\n if r * b < rr * a:\r\n print(r * b)\r\n else:\r\n print(rr * a)\r\n", "n,m,a,b = map(int,input().split())\n\nrem = n%m\n\nbuild = (m-rem) * a\ndestroy = rem * b\nprint(build if build<destroy else destroy)", "'''problem1'''\r\nn,m,a,b = list(map(int,input().split(\" \")))\r\n\r\nif n%m != 0:\r\n if n > m:\r\n diff = n%m\r\n # print(\"diff:\",diff)\r\n dec = diff * b\r\n inc = (m - diff) * a\r\n # print(\"dec\",dec,\",inc:\",inc)\r\n print(min(inc,dec))\r\n else:\r\n diff = n%m\r\n # print(\"diff:\",diff)\r\n inc = (m-diff) * a\r\n dec = (diff) * b\r\n # print(\"dec\",dec,\",inc:\",inc)\r\n\r\n print(min(inc,dec))\r\nelse:\r\n print(0)\r\n\r\n# '''problem2'''\r\n# n,k = list(map(int,input().split(\" \")))\r\n# ll = list(map(int,input().split(\" \")))\r\n\r\n# ll.sort()\r\n# print(ll)\r\n# lll = []\r\n# for i in ll:\r\n# # print(\"i:\",i,end=' ')\r\n# for j in ll:\r\n# # print(\"j:\",j)\r\n# if (i is not j) and (j>i) and (j <= i+k):\r\n# lll.append(i)\r\n# break\r\n# # print(lll)\r\n# for i in lll:\r\n# if i in ll:\r\n# ll.remove(i)\r\n# print(len(ll))", "n,m,a,b=map(int,input().split())\r\nprint([0,min((n%m)*b,abs(m-n%m)*a)][n%m!=0])", "# cook your dish here\r\nfrom math import ceil\r\nfor _ in range(1):\r\n n,m,a,b=map(int,input().split())\r\n if(n%m==0):\r\n print(0)\r\n else:\r\n lv=n%m\r\n uv=(ceil(n/m))*m-n\r\n print(min(b*lv,a*uv))\r\n ", "n, m, a, b = map(int, input().split())\r\n\r\nif not n % m:\r\n print(0)\r\nelse:\r\n k = n - n % m\r\n k1 = n + m - n % m\r\n p = (k1 - n) * a\r\n p1 = (n - k) * b\r\n if p >= p1:\r\n print(p1)\r\n else:\r\n print(p)\r\n", "n, m, a, b = map(int, input().split())\nprint(min(b * (n % m), a * (-n%m)))\n", "n, m, a, b = [int(x) for x in input().split()]\nif n % m == 0:\n print(0)\n exit()\nprint(min(((n - (n // m) * m) * b), a * ((n // m) * m + m - n)))", "n,m,a,b=[int(x) for x in input().split()]\r\nprint(min((n%m)*b,(m-n%m)*a))\r\n", "from math import *\r\nn, m, a, b=map(int,input().split())\r\nx=n%m\r\np=x*b\r\nq=(m-x)*a\r\nif p < q:\r\n print(p)\r\nelse:\r\n print(q)", "p=input().rstrip().split(' ')\r\nn=int(p[0])\r\nm=int(p[1])\r\na=int(p[2])\r\nb=int(p[3])\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n if n>m:\r\n f=(n-m)*b;\r\n r=n//m;\r\n h=m*r;\r\n F=(n-h)*b;\r\n H=m*(r+1)\r\n s=(H-n)*a\r\n print(min(f,F,s))\r\n else:\r\n f=n*b\r\n G=(m-n)*a\r\n print(min(f,G))\r\n", "n,m,a,b = map(int,input().split())\r\nc = 0\r\nif n%m==0:\r\n\tprint(0)\r\n\r\nelse:\r\n\tk = (n+m)//m\r\n\tc = k*m-n\r\n\tk = n%m\r\n\tprint(min(c*a,k*b))\r\n\t\r\n", "n, m, a, b = map(int, input().split())\r\n\r\n# Case 1: n is already divisible by m\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n # Cost to add boxes to make n divisible by m\r\n add_cost = (m - (n % m)) * a\r\n\r\n # Cost to remove boxes to make n divisible by m\r\n remove_cost = (n % m) * b\r\n\r\n # Compare the cost of adding boxes and removing boxes\r\n if add_cost <= remove_cost:\r\n print(add_cost)\r\n else:\r\n print(remove_cost)\r\n", "n,m,a,b=map(int,input().split( ))\r\nx=n//m\r\ny=n%m\r\nt=min(y*b,((x+1)*m-n)*a)\r\nprint(int(t))\r\n", "\r\nn,m,a,b = map(int,input().split(\" \"))\r\nr = n%m\r\nprint(min(r*b,(m-r)*a))", "n,m,a,b=map(int,input().split())\r\nr=n%m\r\nt=r*b\r\np=(m-r)*a\r\nprint(min(t,p))", "n, m, a, b = [int(s) for s in input().split()]\r\n\r\na = ((m - (n % m)) % m) * a\r\nb = (n % m) * b\r\n\r\nprint(min(a, b))\r\n", "\nInput=lambda:map(int,input().split())\n\na = list(Input())\nif a[0] > a[1]:\n Cost1 = a[3] * (a[0] % a[1]) #distroy\n Cost2 = (((a[0] // a[1] + 1)*a[1]) - a[0])*a[2] # buy\n print(min(Cost1,Cost2))\nelif a[0] < a[1]:\n Cost1 = (a[1] - a[0]) * a[2] #buy\n Cost2 = a[0] * a[3] # distroy\n print(min(Cost1,Cost2))\nelse:\n print(0)\n\n\n\n", "n, m, a, b = [int(x) for x in input().split()]\r\n\r\nadd_cost = (n - n // m * m) * b\r\nremove_cost = ((n // m + 1) * m - n) * a\r\n# print('add_cost', add_cost)\r\n# print('remove_cost', remove_cost)\r\nprint(min(add_cost, remove_cost))\r\n", "import math\r\nn, m, a, b = map(int, input().split())\r\n\r\nif n % m == 0:\r\n print (0)\r\nelse:\r\n df = n - m * math.floor(n / m)\r\n s1 = b * df\r\n s2 = a * (m - df)\r\n print (min(s1, s2))", "while True:\r\n\ttry:\r\n\t\t\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tbox, delg, buil, brok = map(int, input().split())\r\n\t\t\tif box%delg == 0:\r\n\t\t\t\tprint(0)\r\n\t\t\telse:\r\n\t\t\t\txtr = box%delg\r\n\t\t\t\tprint(min(xtr*brok, (delg-xtr)*buil))\r\n\texcept EOFError:\r\n\t\tbreak", "\n\n\"\"\" *** Author--Saket Saumya ***\n IIITM\n\"\"\"\n\nimport math\nimport os\nimport random\nimport re\nfrom sys import stdin, stdout\nfrom collections import Counter\nfrom itertools import permutations\n\n\ndef si():\n\treturn str(stdin.readline())\ndef ii():\n return int(stdin.readline())\ndef mi():\n return map(int, stdin.readline().split())\ndef li():\n return list(mi())\ndef debug(x):\n\treturn stdout.write(str(x))\n\t\nn,m,a,b=map(int,input().split())\nprint(min((n%m)*b,(m-n%m)*a))\n\t\n", "n,m,a,b=input().split()\nn=int(n)\nm=int(m)\na=int(a)\nb=int(b)\nl=n%m\np=min((m-l)*a,b*l)\nprint(p)", "n,m,a,b=map(int,input().split())\r\nif(n%m==0):\r\n print(0)\r\nelse:\r\n p=m*(n//m)\r\n c1=b*(n-p)\r\n p1=m*(n//m+1)\r\n c2=a*(p1-n)\r\n print(min(c1,c2))", "n,m,a,b = map(int, input().split())\r\nif(n%m==0):\r\n print(0)\r\nelse:\r\n print(min((n-(n//m)*m)*b, ((n//m + 1)*m -n)*a))", "n, m, a, b = tuple(map(int, input().split(' ')))\n\nif n%m == 0:\n print(0)\n\nelse:\n temp = n%m\n print(min(temp * b, (m-temp)*a))\n\n\n\n\n", "a,b,c,d=list(map(int,input().split()))\r\nprint(min((a%b)*d,-(a-((a//b)+1)*b)*c))\r\n", "n, m, a, b = map(int,input().split())\r\nprint(min((m*(n//m+1)-n)*a,(n - (m*(n//m)))*b))", "n,m,a,b = list(map(int,input().strip().split()))\r\ncost_of_demolition = n % m * b\r\ncost_of_building = (m - n % m) * a\r\nprint(min(cost_of_building,cost_of_demolition))\r\n", "n,m,a,b = input().split(\" \")\nn = int(n)\nm = int(m)\na = int(a)\nb = int(b)\n\n\nremainder = n % m\ncostdestroy = remainder * b\nnumberToBuild = m - remainder\ncostToBuild = numberToBuild * a\nif costdestroy < costToBuild:\n\tprint(costdestroy)\nelse:\n\tprint(costToBuild)\n", "n,m,a,b=map(int,input().split())\r\nif n%m==0:\r\n\tprint(0)\r\nelse:\r\n\tif n<m:\r\n\t\ttemp1,temp2=m-n,n%m\r\n\t\tx,y=temp1*a,temp2*b\r\n\t\tprint(min(x,y))\r\n\telse:\r\n\t\ti=n//m\r\n\t\ti=(m*(i+1))-n\r\n\t\ttemp1,temp2=n%m,i\r\n\t\tx,y=temp1*b,temp2*a\r\n\t\tprint(min(x,y))", "a,b,c,d=[int (x) for x in input().split()]\r\ndef min(a,b):\r\n if(a>=b):\r\n return b\r\n else:\r\n return a\r\na=min(a%b*d,(b-a%b)*c)\r\nprint(a)", "import os\r\nif not(\"BEFUNGEE_HOME\" in os.environ.keys()):\r\n f=open(\"ttt\",\"r\")\r\n input=f.readline\r\nn,m,a,b=list(map(int,input().split()))\r\ndestroy=n%m\r\nbuild=m-destroy\r\nif build*a>destroy*b:\r\n print(destroy*b)\r\nelse:\r\n print(build*a)\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, ceil\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn, m, a, b = map(int, input().split())\r\n\r\nrem = n%m\r\n\r\nprint(min(rem*b, (m-rem)*a))\r\n", "n,m,a,b=map(int,input().split())\r\nif(n%m==0):\r\n print(0)\r\nelse:\r\n k=n//m\r\n s=k*m\r\n p=s+m\r\n x=abs(n-s)\r\n y=abs(n-p)\r\n print(min(y*a,x*b))", "n,m,a,b = map(int,input().split())\n\nif n%m == 0:\n print(0)\nelif n > m:\n print(min((n%m)*b,(m-n%m)*a))\nelif m > n:\n print(min(n*b,(m-n)*a))\n", "n,m,a,b = map(int, input().split())\nr = n % m\nprint(min(r*b, (m-r)*a))", "n,m,a,b = map(int,input().split())\r\n\r\nif n%m == 0:\r\n print(0)\r\n exit()\r\n\r\nz1 = (n - (n//m)*m)*b\r\nz2 = ((n//m)*m + m - n)*a\r\n\r\nprint(min(z1,z2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m,a,b=map(int,input().split())\r\nprint(min((n%m)*b,(m-n%m)*a))", "n,m,a,b=map(int,input().split())\n#n boxes\n#m delegations\n#a building fee\n#b demolishing fee\n\nx=n%m\ny=m-x\nprint(min(x*b,y*a))\n", "import math\r\n\r\nn , m , a ,b = map(int, input().split())\r\n\r\nif n%m == 0:\r\n print(0)\r\n exit()\r\nr = n % m \r\nx = math.ceil(n/m)\r\n\r\nz = (x * m - n) * a\r\nzz = r * b\r\n\r\nprint(min(z,zz))\r\n", "\r\ndef solve():\r\n n,m,a,b=list(map(int,input().split(\" \")))\r\n\r\n rem=n%m\r\n print(min(rem*b,(m-rem)*a))\r\n \r\n \r\n# t=int(input())\r\n# for i in range(t):\r\nsolve()", "n,m,a,b=map(int,input().split())\r\nif(n%m==0):\r\n print(0)\r\nelse:\r\n x=n//m\r\n y=n%m\r\n d=y*b\r\n v=(m-y)*a\r\n print(min(d,v))", "def f(ll):\r\n n,m,a,b = ll #3e5\r\n c1 = (n%m)*b\r\n c2 = (m-n%m)*a\r\n return min(c1,c2)\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "def readInts():\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\narray = readInts()\r\nd = array[0] % array[1]\r\ndelet = d*array[3]\r\ncreate = (array[1]-d)*array[2]\r\n\r\nif d != 0:\r\n if delet <= create:\r\n print(delet)\r\n else:\r\n print(create)\r\nelse:\r\n print(d)\r\n", "n, m, a, b = map(int, input().split())\r\nk = n % m\r\ns = k * b\r\np = (m - k) * a\r\nprint(min(s, p))\r\n", "from sys import stdin\r\nn, m, a, b = map(int, stdin.readline().split())\r\nx = n%m\r\nprint(min(a *(m-x), b*x))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nn,m,a,b=map(int,input().split())\r\nif(n%m==0):\r\n\tprint(0)\r\nelse:\r\n\tif(n<m):\r\n\t\tprint(min(n*b,(m-n)*a))\r\n\telse:\r\n\t\td=m*(n//m + 1)\t\r\n\t\te=n%m\r\n\t\tprint(min(e*b,(d-n)*a))\r\n", "n,m,a,b=map(int,input().split())\r\nhi=(n+m-1)//m\r\nlo=n//m\r\nans=min((hi*m-n)*a,(n-lo*m)*b)\r\nprint(ans)", "c = input().split()\r\nn = int(c[0])\r\nm = int(c[1])\r\na = int(c[2])\r\nb = int(c[3])\r\n\r\nlower = m * (n // m)\r\nupper = lower + m\r\nprint(min(a * (upper - n), b * (n - lower)))", "\"\"\"\nhttps://codeforces.com/problemset/problem/990/A\n\"\"\"\nn, m, a, b = [int(x) for x in input().split()]\n\nx, y = divmod(n, m)\n\nprint(min((m - y) * a, y * b))\n", "import math\r\nn , m , a, b = map(int,input().split())\r\nt1=n%m\r\nt2 = (m*math.ceil(n/m))-n\r\nif not (n%m): print(0)\r\nelse : print(min(t1*b , t2*a))", "n,m,a,b=map(int,input().split())\r\n\r\nq=n%m\r\n\r\nif(q==0):\r\n\tprint(0)\r\nelse:\r\n\tprint(min(b*q,a*(m-q)))", "n,m,a,b = map(int,input().split(\" \"))\r\nconst = (m - n % m) * a\r\ndemo = (n % m) * b\r\nif n % m != 0:\r\n if const < demo:\r\n print(const)\r\n else:\r\n print(demo)\r\nelse:\r\n print(0)\r\n\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-17 23:30:54\nLastEditTime: 2021-11-20 14:35:26\nDescription: Commentary Boxes\nFilePath: CF990A.py\n'''\n\nfrom math import ceil\n\n\ndef func():\n n, m, a, b = map(int, input().strip().split())\n if n % m == 0:\n print(0)\n else:\n print(min((n - (n // m) * m) * b, (ceil(n / m) * m - n) * a))\n\n\nif __name__ == '__main__':\n func()\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out1.out\",'w')\r\nn,m,a,b=map(int,input().split())\r\nx=n%m\r\nprint(min(x*b,(m-x)*a))\t\r\n", "inp = input()\r\nn,m,a,b = inp.split()\r\nn,m,a,b =int(n),int(m),int(a),int(b)\r\nr = m-n%m\r\nprint(min(a*r,b*(n%m)))", "n,m,a,b = map(int, input().split())\r\nrem = n%m\r\narem = m-rem\r\nif arem*a > rem*b:\r\n print(rem*b)\r\nelse:\r\n print(arem*a)", "import math\r\nn,m,a,b=map(int,input().split())\r\nde=(n%m)*b\r\nbu=((math.ceil(n/m)*m)-n)*a\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n print(min(bu,de))", "n, m, a, b = map(int, input().split())\r\nif(n % m == 0):\r\n print(0)\r\n exit()\r\nx = n // m * m \r\ny = (n // m + 1) * m \r\nprint(min(a * (y - n), b * (n - x)))", "n, m, a, b = map(int, input().strip().split())\nif n%m == 0:\n\texit(print(0))\nif n < m:\n\texit(print(min((m-n)*a, n*b)))\nupper_limit = (n//m+1)*m\nlower_limit = n-(n%m)\nprint(min((upper_limit-n)*a, (n-lower_limit)*b))\n\n", "n,m,a,b=list(map(int,input().strip().split()))\r\nif(n%m==0):\r\n print(0)\r\nelse:\r\n temp=n//m\r\n demo=n-temp*m\r\n demo=demo*b\r\n temp=temp+1\r\n bui=temp*m-n\r\n bui=bui*a\r\n if(bui>=demo):\r\n print(demo)\r\n else:\r\n print(bui)\r\n", "from math import ceil\r\n\r\nX = list(map(int, input().split()))\r\nprint(min((X[0] - (X[0] // X[1]) * X[1]) * X[3], (ceil(X[0] / X[1]) * X[1] - X[0]) * X[2]) if X[0] / X[1] != 0 else 0)\r\n", "n, m, a, b = map(int, input().split())\r\n\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n first = n % m * b\r\n second = (m - n %m)*a\r\n print(min(first, second))", "n,m,a,b=map(int,input().split())\r\nd=n%m\r\nu=m-d\r\nprint(min(u*a,d*b))", "n,m,a,b= list(map(int, input().split(\" \")))\r\nprint((n%m)*b if (n%m)*b<=(m-n%m)*a else (m-n%m)*a)", "from sys import stdin, stdout\r\n\r\nlst = list(map(int, stdin.readline().strip().split()))\r\nrem = lst[0] % lst[1]\r\nif rem == 0:\r\n stdout.write('0')\r\nelse:\r\n cons_cost = (lst[1] - rem) * lst[2]\r\n dest_cost = rem * lst[3]\r\n stdout.write(str(min(cons_cost, dest_cost)))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 14 01:03:29 2018\r\n\r\n@author: Arsanuos\r\n\"\"\"\r\n\r\nimport math\r\n\r\ndef main():\r\n n, m, a, b = [int(t) for t in input().split()]\r\n if n % m == 0:\r\n print(0)\r\n else:\r\n down = int(m * math.floor(n/m))\r\n up = int(m * math.ceil(n/m))\r\n print(int(min(abs(down - n) * b, abs(up - n) * a)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n \r\n \r\n \r\n \r\n \r\n ", "n, m, a, b = map(int, input().split())\r\n\r\nif not(n%m):\r\n print(0)\r\nelse:\r\n print(min((n%m)*b, (((n//m+1)*m)-n)*a))\r\n", "p = list(map(int, input().split()))\nn = p[0]\nm = p[1]\na = p[2]\nb = p[3]\nif n % m == 0 and n >= m:\n\t\tprint(0)\nelif n < m:\n\t\tprint(min(n*b, (m-n)*a))\nelse:\n\t\tprint(min((n % m) *b, ((n // m + 1) * m - n)*a))\n", "n, m, a, b = map(int, input().split())\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n r = n % m\r\n ff = int((m - r) * a)\r\n ss = int(r * b)\r\n print(min(ff, ss))", "n, m, a, b = str(input()).split(\" \")\r\nn, m, a, b = int(n), int(m), int(a), int(b)\r\n\r\nif n%m == 0:\r\n print(0)\r\nelse:\r\n con = (m-n%m)*a\r\n dem = (n%m)*b\r\n if con < dem:\r\n print(con)\r\n else:\r\n print(dem)\r\n", "n,m,a,b = [int(_) for _ in input().strip().split()]\r\nre = n % m\r\nif re == 0:\r\n\tprint(0)\r\nelse:\r\n\tprint(min((m - re) * a, re * b))", "n,m,a,b = map(int,input().split())\r\nif n%m!=0:\r\n neg = n%m\r\n pos = m - neg\r\n if neg*b > pos*a:\r\n print(pos*a)\r\n else:\r\n print(neg*b)\r\nelse:\r\n print(\"0\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Dec 31 09:06:24 2018\n\n@author: umang\n\"\"\"\n\nn, m, a, b = map(int, input().split())\n\nres = n % m\n\nif (m-res)*a < (res)*b:\n print((m-res)*a)\nelse:\n print(res*b)", "n,m,a,b = map(int,input().split())\r\nif n%m == 0:\r\n ans = 0\r\nelse:\r\n p = n//m\r\n ans = min(a*((p+1)*m-n),b*(n-p*m))\r\nprint(ans)", "n , m , a , b = list(map(int , input().split()))\r\n\r\n\r\nif(n % m == 0):\r\n print(0)\r\nelse:\r\n if(n > m):\r\n r1 = (n % m)*b\r\n r2 = (((n//m)+1)*m-n)*a\r\n print(min(r1 , r2))\r\n else:\r\n r1 = (m-n)*a\r\n r2 = n * b\r\n print(min(r1 , r2))", "n, m, a, b = map(int, input().split())\nif n % m == 0:\n print(0)\nelse:\n d = n // m\n print(min((n-d*m)*b, ((d+1)*m-n)*a))", "n,m,a,b = map(int,input().split())\r\n\r\nimport math\r\nif n%m==0:\r\n print(0)\r\nelif m>n:\r\n des = n*b\r\n build = (m-n)*a\r\n if build<=des:\r\n print(build)\r\n else:\r\n print(des)\r\nelse:\r\n temp = math.floor(n/m)\r\n build = (((temp+1)*m)-n)*a\r\n des = (n-(temp*m))*b\r\n\r\n if build<=des:\r\n print(build)\r\n else:\r\n print(des)\r\n", "n,m,a,b=map(int,input().split())\r\nprint(min(n%m*b,(m-n%m)*a))", "n,m,a,b=map(int,input().split())\r\nk=n%m\r\nz=m-k\r\nprint(min(a*z,k*b))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# import sys \r\n# sys.stdin=open(\"input1.in\",\"r\")\r\n# sys.stdout=open(\"OUTPUT3.out\",\"w\")\r\nn,m,a,b=map(int,input().split())\r\nif n%m==0:\r\n\tprint(\"0\")\r\nelse:\r\n\tx=n%m\r\n\tmin1=b*x\r\n\ty=m-x\r\n\tmin2=a*y\r\n\tprint(min(min1,min2))", "n, m, a, b = [int(x) for x in input().strip().split()]\r\n\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n x = n//m\r\n t1 = abs(n - x*m)\r\n t2 = abs(n - (x+1) * m)\r\n \r\n print(min(t1*b, t2*a))", "n, m, a, b = map(int, input().split())\r\nprint(min((m-n%m)*a, n%m*b))", "n, m, a, b = map(int, input().split())\r\nq = n // m\r\nx = q * m\r\nres = min((n - x) * b, (x + m - n) * a)\r\nprint(res)", "import math\r\n\r\ndef main_function():\r\n n, m , a, b = [int(i) for i in input().split(\" \")]\r\n remainder = n % m\r\n print(min(remainder * b, (m - remainder) * a))\r\n\r\n\r\n\r\n\r\nmain_function()", "n,m,a,b = [int(i) for i in input().split()]\nk = n%m\nprint(min((m-k)*a,k*b))\n \t\t \t\t \t\t \t \t \t \t\t", "n, m, a, b = [int(i) for i in input().split(' ')]\r\n\r\ncreate_number = m - n % m\r\ndelete_number = n % m\r\nprint(min(a*create_number, b*delete_number))", "import math\r\nn, m, a, b = map(int, input().split())\r\n\r\nif n%m == 0:\r\n print(0)\r\nelif n<m:\r\n x = (m-n)*a\r\n y = n*b;\r\n print(min(x,y))\r\nelif n>m:\r\n x = math.floor(n/m)*m\r\n y = math.ceil(n/m)*m\r\n c = (n-x)*b\r\n d = (y-n)*a\r\n print(min(c,d))\r\n", "n, m, a, b = map(int,input().split())\r\n\r\nconst = (n % m) * b\r\ndemol = (m - (n % m)) * a\r\n\r\nif const > demol:\r\n print(demol)\r\nelse:\r\n print(const)", "n,m,a,b=map(int,input().split())\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n x=a*(m*(n//m+1)-n)\r\n y=b*(n-m*(n//m))\r\n print(min(x,y))\r\n", "n,m,a,b = map(int,input().split())\r\nprint(min((n%m)*b, (m - (n%m))*a))\r\n\r\n\r\n\r\n", "a = tuple ( map ( int , input ( ) . split()))\r\nprint ( min ( (a [ 1 ] -a[0]%a[1])*a[2] ,(a[0]%a[1])*a[3]))\r\n", "n,m,a,b=[int(x) for x in input().split()]\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n print(min(b*(n%m),a*(m-n%m)))", "n,m,a,b = map(int,input().split())\r\nans = (n%m)*b\r\nans2 = (m-n%m)*a\r\nprint(min(ans,ans2))", "n, m, a, b = map(int,input().split())\r\nif n%m==0:\r\n print(0)\r\n exit(0)\r\nelse:\r\n dostroit = (n//m+1)*m - n\r\n snesti = n- n//m * m\r\n print(min(dostroit*a,snesti*b))\r\n", "import sys\r\ninput = lambda :sys.stdin.readline()[:-1]\r\nni = lambda :int(input())\r\nna = lambda :list(map(int,input().split()))\r\nyes = lambda :print(\"yes\");Yes = lambda :print(\"Yes\");YES = lambda : print(\"YES\")\r\nno = lambda :print(\"no\");No = lambda :print(\"No\");NO = lambda : print(\"NO\")\r\n#######################################################################\r\n\r\nn,m,a,b = na()\r\nx = n % m\r\nprint(min(a * (m-x), x * b))", "n,m,a,b=map(int,input().split())\r\n\r\nx=n%m\r\ny=m-x\r\n#print(n/m)\r\nif n%m!=0: \r\n if(x*b<y*a):\r\n print(x*b)\r\n elif(x*a>y*b):\r\n print(a*y)\r\n else:\r\n print(a*y)\r\nelse:print(0)\r\n", "n,m,a,b = map(int,input().split())\r\ny = (n%m)*b\r\nz = (m-n%m)*a\r\nprint(min(y,z))", "n, m, a, b = map(int,input().split(' '))\r\nprint(min(a*(m-n%m),b*(n%m)))", "n,m,a,b=map(int,input().split())\r\nif n%m == 0:\r\n print(0)\r\nelse:\r\n k=n%m\r\n print(min(k*b,(m-k)*a))", "n, m, a, b = map(int, input().split())\nif n%m == 0:\n print(0)\nelse:\n r1 = n%m\n r2 = ((n+m-1)//m)*m-n\n\n ans = min(r1*b, r2*a)\n print(ans)\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,a,b = get_int_list()\r\nif n%m == 0:\r\n print(0)\r\nelse:\r\n res1 = n%m\r\n res2 = m - res1\r\n if res1*b < res2*a:\r\n print(res1*b)\r\n else:\r\n print(res2*a)", "n, m, a, b = map(int, input().split())\r\nn1=n%m\r\nn2=m-(n%m)\r\nprint(min(n1*b,n2*a))\r\n", "\r\nn,m,a,b = map(int,input().split())\r\n\r\n\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n k = n%m\r\n print(min(k*b,(m-k)*a))", "def i_ints():\r\n return list(map(int, input().split()))\r\n\r\nn, m ,a, b = i_ints()\r\n\r\nrest = n % m\r\nprint(min(rest * b, (m - rest) * a))", "n, m, a, b = map(int, input().split())\nprint(min((-n) % m * a, n % m * b))", "n,m,a,b=map(int,input().split())\r\nprint(min(a*(m-n%m),b*(n%m)))\r\n", "n, m, a, b = map(int, input().split()) \r\nprint(int(min(b*(n%m),a*(m-(n%m)))))", "a,b,c,d = map(int,input().split())\r\nt = a//b\r\nk = min((b-a%b)*c,(a%b)*d)\r\nprint(k)\r\n", "boxes,deligate,built,demolish = map(int,input().split())\r\n\r\nif boxes % deligate is 0:\r\n print(0)\r\n\r\nelif boxes > deligate:\r\n\r\n foo = boxes%deligate\r\n a=(deligate - foo)*built\r\n b=foo*demolish\r\n # demolish karne hai\r\n print(min(a,b)) # built karna hai \r\n\r\nelif boxes < deligate:\r\n \r\n print(min(boxes*demolish, (deligate-boxes)*built)) \r\n", "box,men,buy,sell=map(int,input().split())\r\nprint(min((box%men)*sell,(men-box%men)*buy))", "n,m,a,b=list(map(int,input().split()))\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n print(min(((n//m+1)*m-n)*a,(n-(n//m)*m)*b))", "n,m,a,b=map(int,input().split())\r\nif n%m==0:\r\n print(\"0\")\r\nelse:\r\n k=(n%m)*b\r\n j=((n//m+1)*m-n)*a\r\n if k<j:\r\n print(k)\r\n else:\r\n print(j)", "n, m, a, b = map(int, input().split())\nif((n%m)*b<(m-n%m)*a):\n\tprint(b*(n%m));\nelse:\n\tprint(a*(m-n%m));\t", "n,m,a,b = [int(i) for i in input().split()]\nx = n//m\ny = x + 1\n\nu = n - x*m\nv = m*y - n\nw = u*b\nz = v*a\nprint(min(w, z))\n", "n,m,a,b = map(int,input().split())\r\nif(n%m==0):\r\n print(0)\r\nelse:\r\n c = (n//m+1)*m\r\n print(min((c-n)*a,(n%m)*b))\r\n ", "abcd = input().split()\r\nm = int(abcd[0])\r\nn = int(abcd[1])\r\na = int(abcd[2])\r\nb = int(abcd[3])\r\nt = m%n\r\nif t == 0:\r\n print(0)\r\nelif (n-t) * a >= t * b:\r\n print(t*b)\r\nelse:\r\n print((n-t)*a)", "n,m,a,b = map(int, input().split())\r\nrem = n%m\r\nbuildcost = (m-rem)*a\r\ndestrcost = rem*b\r\n\r\nprint(min(buildcost,destrcost))", "import math\n\n\ndef main():\n [n, m, a, b] = map(int, input().split())\n n1 = math.floor(n / m) * m\n n2 = math.ceil(n / m) * m\n\n s1 = (n - n1) * b\n s2 = (n2 - n) * a\n\n print(min(s1, s2))\n\n\nif __name__ == '__main__':\n main()\n", "n,m,a,b = map(int,input().split())\r\nif (n%m==0):\r\n print(0)\r\nelse:\r\n add = ((n//m+1)*m-n)*a\r\n minu = (n-(n//m)*m)*b\r\n print(min(add,minu))\r\n", "from sys import stdin,stdout\r\nimport bisect\r\n# import collections\r\n# import itertools\r\n# import operator\r\n# import functools\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\n\r\nn,m,a,b = mi()\r\nx = n%m\r\nprint(min(b*x,a*(m-x)))", "str1 = list(map(int,input().split()))\r\nn = str1[0]\r\nm = str1[1]\r\na = str1[2]\r\nb = str1[3]\r\nrem = n % m\r\nprint (min(rem*b,(m-rem)*a))", "n,m,a,b = map(int,input().split())\r\nc = 0\r\nd = 0\r\nif n % m == 0:\r\n print(0)\r\nelif m > n:\r\n c = abs((m-n) * a)\r\n d = abs(n * b)\r\n if c < d:\r\n print(c)\r\n else:\r\n print(d)\r\nelif n > m:\r\n c = (m -(n % m)) * a \r\n d = (n % m) * b\r\n if c < d:\r\n print(c)\r\n else:\r\n print(d)\r\n", "i = list(map(int, input().split()))\r\nn = i[0]\r\nm = i[1]\r\na = i[2]\r\nb = i[3]\r\nmod =n%m\r\nif mod==0:\r\n\tprint(0)\r\nelse:\r\n\tdivide = n//m\r\n\tbuilt = m-mod\r\n\tdestroy = mod\r\n\tDC = destroy * b\r\n\tBC = built * a\r\n\tprint(min(DC,BC))", "n,m,a,b = map(int,input().split())\np = (n%m)*b\nq = (m-n%m)*a\nprint(min(p,q))\n \t \t \t\t\t\t\t\t \t\t \t \t \t \t", "n, m, a, b = list(map(int, input().split()))\nl = n // m\nr = n // m if n % m == 0 else n // m + 1\nl *= m\nr *= m\nprint(min(a * (r - n), b * (n - l)))\n\n", "numbers = list(map(int, input().split()))\r\nn = numbers[0]\r\nm = numbers[1]\r\na = numbers[2]\r\nb = numbers[3]\r\ncal = min((m-(n%m))*a,(n%m)*b)\r\nprint(cal)", "n , m , a , b = map(int , input().split())\r\nans = None\r\nif (n <= m) :\r\n ans = min((a * (m - n)) , b * n)\r\nelse :\r\n ans = min((n % m) * b , (((n - (n % m)) + m) - n) * a)\r\nprint(ans)", "\r\nn,m,a,b=map(int,input().split())\r\nv=[]\r\nif n%m==0:\r\n\tprint(0)\r\nelse:\r\n\tre=(n%m)\r\n\tprint(min((re*b),(m-re)*a))", "n,m,a,b=map(int,input().split())\r\nz=(n%m)*b\r\nx=((n//m+1)*m-n)*a\r\ny=min(z,x)\r\nprint(y if y>0 else 0)", "a=[int(x) for x in input().split()]\r\nb=a[0]%a[1]\r\nc=a[1]-b\r\nprint(min(c*a[2],b*a[3]))\r\n", "n, m, a, b = map(int, input().split())\r\nprint(min(b*(n%m), a*(m-n%m)))\r\n", "from functools import cmp_to_key\r\n\r\ns=input()\r\ns=s.split(\" \")\r\nn=int(s[0])\r\nm=int(s[1])\r\na=int(s[2])\r\nb=int(s[3])\r\nk=n//m\r\ny=n-m*k\r\nx=m-y\r\n\r\nprint(min(x*a,y*b))", "n,m,a,b=map(int,input().split())\nprint(min((m-n%m)*a,n%m*b))", "a, b, c, d = input().split()\r\n\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\n\r\no1 = a%b\r\no2 = b - o1;\r\n\r\nprint(min(o1*d, o2*c))", "n, m, a, b = map(int, input().split())\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n print(min(a*(m - n % m) , b * ( n % m ) ) )", "n,m,a,b=map(int,input().split())\r\nif((n%m)==0):print(0)\r\nelse:\r\n mn,mx=n%m,m-(n%m)\r\n print(min(mn*b,mx*a))", "n, m, a, b = [int(x) for x in input().split()]\r\np = n % m\r\ns = (m - p) * a\r\nd = p * b\r\nprint(min(s,d))", "n,m,a,b=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nb=int(b)\r\nx=n%m\r\nif x==0:\r\n print(\"0\")\r\nelse:\r\n y=m-x\r\n x=x*b\r\n y=y*a\r\n if x<y:\r\n print(x)\r\n else:\r\n print(y)\r\n", "n,m,a,b=map(int,input().split())\r\n#l=[int(i) for i in input().split()] \r\nrem=n%m \r\nbrk=n%m \r\nif rem==0:\r\n build=0 \r\nelse:\r\n build=m*(n//m+1)-n \r\ncost1=build*a \r\ncost2=brk*b \r\nprint(min(cost1,cost2))", "\r\ndef solve(n, m, a, b):\r\n r = n % m\r\n if r == 0:\r\n return 0\r\n c1, c2 = b * r, (m - r) * a\r\n return min(c1, c2)\r\n\r\ndef driver():\r\n inp = [*map(lambda x: int(x), input().split())]\r\n n, m, a, b = inp[0], inp[1], inp[2], inp[3]\r\n print(solve(n, m, a, b))\r\n \r\ndriver()", "n,m,a,b = map(int,input().split())\r\n\r\nprint(min((n%m)*b, (m-(n%m))*a))", "from math import *\r\nfrom sys import stdin, stdout\r\ncoder = \"sdpt\"\r\n\r\n\r\n[n,m,a,b]=list(map(int,stdin.readline().split()))\r\n\r\nx = ceil(float(n)/float(m))\r\ny = floor(float(n)/float(m))\r\nbuild = (x*m - n)*a\r\n\r\ndest = (n - y*m)*b\r\n\r\nprint(min(build,dest))\r\n\r\n# from math import *\r\n# from sys import stdin, stdout\r\n# coder = \"sdpt\"\r\n#\r\n# def cin():\r\n# return list(map(int,stdin.readline().split()))\r\n#\r\n# for _ in range(int(input())):\r\n# arr = list(map(float,stdin.readline().split()))\r\n#\r\n# p = arr[:3]\r\n# q = arr[3:6]\r\n# d = arr[6:9]\r\n# c = arr[9:12]\r\n# r = arr[12]\r\n# m = [0] * 3\r\n# n = [0] * 3\r\n# for i in range(3):\r\n# m[i] = c[i] - p[i]\r\n# n[i] = q[i] - p[i]\r\n# w = [0] * 3\r\n# x = [0] * 3\r\n# SumWsq = 0\r\n# Sum2WX = 0\r\n# SumXsq = 0\r\n# SumNsq = 0\r\n# Sum2ND = 0\r\n# SumDsq = 0\r\n#\r\n# rsq = r * r\r\n# for i in range(3):\r\n# j = (i + 1) % 3\r\n# k = (i + 2) % 3\r\n# w[i] = m[j] * n[k] - m[k] * n[j]\r\n# x[i] = m[j] * d[k] - m[k] * d[j]\r\n#\r\n# SumWsq += w[i] * w[i]\r\n# Sum2WX += 2 * w[i] * x[i]\r\n# SumXsq += x[i] * x[i]\r\n#\r\n# SumNsq += n[i] * n[i] * rsq\r\n# SumDsq += d[i] * d[i] * rsq\r\n# Sum2ND += 2 * d[i] * n[i] * rsq\r\n#\r\n# A = SumXsq - SumDsq\r\n# B = Sum2WX - Sum2ND\r\n# C = SumWsq - SumNsq\r\n#\r\n# if A == 0:\r\n# ans = -C / B\r\n# print(\"%.8f\" % ans)\r\n# else:\r\n# ans = (-B + sqrt(B * B - 4 * A * C)) / (2 * A)\r\n# print(\"%.8f\" % ans)", "n, m, a, b = map(int, input().split())\r\nprint(min((n-m*(n//m))*b, (m*(n//m+1)-n)*a))\r\n", "n,m,a,b = map(int,input().split())\r\nif n%m!=0:\r\n mn = n//m * m\r\n mx = n//m * m + m\r\n print(min(((n - mn) * b),((mx - n) * a)))\r\nelse:print(0) ", "#Bhargey Mehta (Junior)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\n#sys.stdin = open('input.txt', 'r')\r\nMOD = 998244353\r\nsys.setrecursionlimit(1000000)\r\n\r\nn, m, a, b = map(int, input().split())\r\nx = a*(m-n%m)\r\ny = b*(n%m)\r\nprint(min(x, y))", "import math\r\nn,m,a,b=map(int,input().split())\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n p=math.ceil(n/m)\r\n q=math.floor(n/m)\r\n inc=(p*m - n)*a\r\n dec=(n - q*m)*b\r\n print(min(inc,dec))", "from math import *\r\nimport sys\r\nn,m,a,b=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=int(a)\r\nb=int(b)\r\nif(n/m==0):\r\n print(0)\r\n sys.exit(0)\r\ntemp1=ceil(n/m)\r\ntemp2=floor(n/m)\r\nx=(m*temp1-n)*a\r\ny=(n-m*temp2)*b\r\nif(x>y):\r\n print(y)\r\nelse:\r\n print(x)\r\n\r\n", "n,m,a,b=map(int,input().split())\r\nr=n%m\r\nif r==0:\r\n\tprint(0)\r\nelse:\r\n\tif (m-r)*a<r*b:\r\n\t\tprint((m-r)*a)\r\n\telse:\r\n\t\tprint(r*b)", "import sys\r\nn,m,a,b=list(map(int,input().split()))\r\nif n%m==0:\r\n print(\"0\")\r\n sys.exit()\r\nx=(n//m)*m\r\ny=((n//m)+1)*m\r\nm1=(y-n)*a\r\nm2=(n-x)*b\r\nprint(min(m1,m2))\r\n\r\n", "n, m, a, b = map(int, input().split())\r\n\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n nasht = n % m\r\n print(min(nasht*b, (m-nasht)*a))", "n,m,a,b = map(int,input().split(' '))\r\nx = n%m\r\n\r\ny = -n%m\r\n\r\nprint(min(x*b,y*a))\r\n", "n, m, a, b = (int(i) for i in input().split())\nfree = n % m\nres = min(free * b, (m - free) * a)\nprint(res)\n", "n,m,a,b=map(int,input().split())\r\ndestroy=n%m\r\nif destroy==0:\r\n print(0)\r\nelse:\r\n build=(n//m+1)*m-n\r\n s1,s2=destroy*b,build*a\r\n print(min(s1,s2))\r\n\r\n", "n,m,a,b=map(int,input().split())\nk = n//m\nprint(min((n - k*m) * b, ((k+1) * m - n) * a))\n", "n,m,a,b=map(int,input().split())\r\nif n%m==0:\r\n print(\"0\")\r\nelse:\r\n print(min(((n%m)*b) , ((m-(n%m))*a)))\r\n\r\n", "n1, m1, a1, b1 = map(int, input().split())\r\n\r\n\r\ndef burli_estimating(n, m, a, b, ):\r\n if n > m:\r\n differ = n % m\r\n building = (m - differ) * a\r\n destroying = differ * b\r\n if building > destroying:\r\n return destroying\r\n return building\r\n elif n < m:\r\n building = (m - n) * a\r\n destroying = n * b\r\n return building if building < destroying else destroying\r\n elif n == m:\r\n return 0\r\n else:\r\n return 'something has gone wrong!'\r\n\r\n\r\nprint(burli_estimating(n1, m1, a1, b1))", "n, m, a, b = map(int, input().split())\r\nprint(min(a*(m - n%m), b*(n%m)))", "n, m, a, b = map(int, input().split())\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n remove = n % m\r\n add = m - (n % m)\r\n remove *= b\r\n add *= a\r\n print(min(add, remove))\r\n", "n, m, a, b = [int(i) for i in input().split()]\r\nprint(min(n % m * b, (m - n % m) * a))\r\n", "n,m,a,b = map(int,input().split())\r\nif(n%m==0):\r\n print(0)\r\nelse:\r\n x = n%m\r\n y = m*(n//m+1)-n\r\n print(min(x*b,y*a))", "n,m,a,b = list(map(int,input().split()))\r\nif n%m == 0:\r\n\tprint('0')\r\nelse:\r\n\txtraBoxes = n%m\r\n\tbuildBoxes = (m-xtraBoxes)*a\r\n\tdestroyBoxes = xtraBoxes*b\r\n\tif buildBoxes > destroyBoxes:\r\n\t\tprint(destroyBoxes)\r\n\telse:\r\n\t\tprint(buildBoxes)", "n,m,a,b = map(int,input().split(\" \"))\r\nif(n%m==0):\r\n print(\"0\")\r\nelse:\r\n print(min(b*(n%m), (m-n%m)*a))", "n, m, a, b = map(int, input().split())\r\nprint(min(abs(((n // m) * m) - n) * b, abs((((n // m) + 1) * m) - n) * a))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, a, b = map(int, input().split())\r\n\r\nprint(min(n%m * b, (m-n%m)*a))", "n, m, a, b = map(int, input().split())\r\n\r\nrem = n % m\r\n\r\nprint(min((m - rem) * a, rem * b))\r\n", "\nn, m, a, b = map(int, input().split())\n\nprint(min(n%m*b, (m-(n%m))*a))\n\n\n", "n,m,a,b = input().split()\n\nn = int(n)\nm = int(m)\na = int(a)\nb = int(b)\n\nif(n%m==0):\n print(\"0\")\nelse:\n if(n<m):\n cost_of_const = (m-n)*a\n cost_of_dest = n*b\n else:\n s = n//m\n cost_of_dest = (n-(m*s))*b\n cost_of_const = ((m*(s+1))-n)*a\n print(min(cost_of_const , cost_of_dest))\n\t\t \t\t\t \t\t \t\t\t \t\t\t \t\t\t\t\t", "six = input().split(\" \");\r\nn = int(six[0])\r\nm = int(six[1])\r\na = int(six[2])\r\nb = int(six[3])\r\nprint(min((n%m) * b, (m - (n%m))*a))", "while True:\n\ttry:\n\t\tn, m, a, b = map(int, input().split())\n\t\tflg = False\n\t\tif n//m == 0:\n\t\t\tt = n*b \n\t\t\tt1 =(m-n)*a\n\t\t\tprint(min(t,t1))\n\t\telif n%m!= 0:\n\t\t\tt = (n%m)*b\n\t\t\tt1 = (m-(n%m))*a\n\t\t\tprint(min(t,t1))\n\t\telse:\n\t\t\tprint(\"0\")\n\t\t\n\t\t\t\n\texcept EOFError:\n\t\tbreak\n\t\t \t \t \t\t \t\t\t \t \t \t\t\t\t", "n,m,a,b=map(int,input().split())\r\nif n%m:print(min((m*(n//m+1)-n)*a,(n%m)*b))\r\nelse:print(0)", "n,m,a,b = map(int,input().split())\r\nf = 0\r\nif n%m==0:\r\n print(0)\r\n f = 1\r\nif not f:\r\n bl = n+(m-(n%m))\r\n bl = bl-n\r\n d = n-(n%m)\r\n d=n-d\r\n print(min(bl*a,d*b))\r\n", "#autogenerated (:'D)\r\nread_numbers = lambda: map(int, input().split())\r\nINF = 1 << 64\r\n\r\n#main\r\nn, m, a, b = read_numbers()\r\nr = n % m\r\nprint( min(r*b, (m-r)*a) )", "n, m, a, b = map(int, input().split())\nr = n % m\nprint(min(r * b, (m - r) * a))\n", "n,m,a,b=map(int,input().split())\nprint(min(n%m*b,(m-n%m)*a))\nf=6\ng=9\nh=g-f\n\t\t\t\t \t \t\t \t \t \t \t\t\t", "n, m, a, b = map(int, input().split())\r\naa = m - (n % m)\r\nbb = n % m\r\nprint(min(aa*a, bb*b))", "n,m,a,b=list(map(int,input().split()))\r\n\r\n\r\n\r\n\r\n\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n\r\n d = (n%m)*b\r\n\r\n e = (((n//m)+1)*m-n)*a\r\n\r\n f = n*b\r\n\r\n print(min(d,f,e))\r\n", "n,m,a,b = map(int,input().split())\r\nbe = (n%m) * b\r\nae = (m - (n%m))*a\r\nif ae <= be:\r\n print(ae)\r\nelse:\r\n print(be)", "n,m,a,b = map(int,input().split())\r\nk = n%m\r\nprint([a*(m-k),b*k][b*k==min(b*k,a*(m-k))])", "n,m,a,b=map(int,input().split())\r\nprint(min(a*(m-n%m),n%m*b))", "n,m,a,b=map(int,input().split())\r\ns=0\r\nif n%m>0:\r\n\ts=min(n%m*b,(m-n%m)*a)\r\nprint(s)", "n, m, a, b = map(int, input().split())\nn %= m\nprint(min(n * b, (m - n) * a))\n", "n,m,a,b = input().split(\" \")\r\nn = int(n)\r\nm = int(m)\r\na = int(a)\r\nb = int(b)\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n ba = int(n/m)\r\n bb = ba\r\n ba = ba + 1\r\n ba = ba * m - n\r\n ba = ba * a\r\n bb = n-bb*m\r\n bb = bb*b\r\n if bb>ba:\r\n print(ba)\r\n else:\r\n print(bb)\r\n", "n,m,a,b=map(int, input().split())\r\nprint(min(n%m*b, (m-n%m)*a))", "n,m,a,b=map(int,input().split())\r\nif(n%m==0):\r\n print(0)\r\nelse:\r\n x=n%m\r\n y=m-x\r\n xx=x*b\r\n yy=y*a\r\n if(yy>=xx):\r\n print(xx)\r\n else:\r\n print(yy)\r\n", "n, m, a, b = map(int, input().split())\nost = n % m\ncnt = n // m\nprint(min(ost * b, (m - ost) * a))", "n,m,a,b=map(int,input().split())\r\nc=(n%m)*b\r\nd=(m-(n%m))*a\r\nprint(min(c,d))", "n,m,a,b = map(int, input().split())\r\nrem=int(n/m)\r\nreq=rem * m\r\nlis=[]\r\nif(n>req):\r\n cost1 = (m- (n-req))*a\r\n lis.append(cost1)\r\nelse:\r\n cost2 = (req-n)*a\r\n lis.append(cost2)\r\n\r\nif(n>req):\r\n cost3 = (n-req)*b\r\n lis.append(cost3)\r\nelse:\r\n cost4 = n*b\r\n lis.append(cost4)\r\n\r\nlis.sort()\r\nprint(lis[0])", "n, m, a, b = map(int, input().split())\r\nq = n % m\r\np = n // m\r\nprint(min(((p + 1) * m - n) * a, q * b))", "n,m,a,b=[int(x)for x in input().split()]\nif n<m:print(min(a*(m-n),b*n))\nelse:print(min(b*(n%m),a*(m-(n%m)) ))", "n, m, a, b = map(int,input().split())\r\n\r\nif n%m==0:\r\n print(0)\r\nelse:\r\n x, y = n//m, (n//m + 1)\r\n x, y = x*m, y*m\r\n \r\n print(min((n-x)*b, (y-n)*a))", "n, m, a, b = list(map(int, input().split()))\n\nr = n % m\n\nprint(min((m - r) * a, r * b))", "n, m, a, b = map(int, input().split())\r\nif n % m == 0:\r\n print(0)\r\nelif (m-(n%m))*a > b*(n%m):\r\n print(b*(n%m))\r\nelse:\r\n print((m-(n%m))*a)\r\n", "n, m, a, b = map(int, input().split())\r\n\r\nif n % m == 0:\r\n print(0)\r\nelse:\r\n ans = min(n * b, (n % m) * b, ((n // m + 1) * m - n) * a)\r\n print(ans)\r\n", "n,m,a,b=map(int,input().split())\r\nprint(min((n%m)*b,(m-(n%m))*a))", "n, m, a, b = map(int,input().split())\r\na1=int()\r\nb1=int()\r\na1=a*(m-(n%m))\r\nb1=b*(n%m)\r\nprint(min(a1,b1))\r\n", "import io, sys, atexit, os\r\n\r\nimport math as ma\r\nfrom sys import exit\r\nfrom decimal import Decimal as dec\r\nfrom itertools import permutations\r\nfrom itertools import combinations\r\n\r\n\r\ndef li ():\r\n\treturn list (map (int, input ().split ()))\r\n\r\n\r\ndef num ():\r\n\treturn map (int, input ().split ())\r\n\r\n\r\ndef nu ():\r\n\treturn int (input ())\r\n\r\n\r\ndef find_gcd ( x, y ):\r\n\twhile (y):\r\n\t\tx, y = y, x % y\r\n\treturn x\r\ndef prod(n):\r\n\ts=1\r\n\twhile(n!=0):\r\n\t\ts=s*(n%10)\r\n\t\tn=n//10\r\n\treturn s\r\n\r\ndef check(xp):\r\n\top=sorted(xp)\r\n\tif(op==xp):\r\n\t\treturn True\r\n\r\n\r\nmm = 1000000007\r\ndef solve ():\r\n\tt = 1\r\n\tfor it in range (t):\r\n\t\tn,m,a,b=num()\r\n\t\tif(n%m==0):\r\n\t\t\tprint(0)\r\n\t\telse:\r\n\t\t\txp=n%m\r\n\t\t\tprint(min(a*(m-xp),b*xp))\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve ()", "n,m,a,b = map(int, input().split()) \r\nif n>=m :\r\n d = ( m * ( n//m + 1) - n )*a\r\n d1 = ( n%m ) * b\r\n res = min(d1,d)\r\n print(res)\r\nelse :\r\n d = ( m - n) * a\r\n d1 = ( n%m) * b\r\n res = min(d,d1)\r\n print(res)\r\n\r\n \r\n\r\n\r\n", "n,m,a,d = [int(x) for x in input().split()]\r\nk = n%m;\r\nl = m-k;\r\nif(k > 0):\r\n print(min(l*a,k*d))\r\nelse:\r\n print(k)\r\n", "n, m, a, b = map(int, input().split())\r\nr = n%m\r\nprint(min(r*b, (m-r)*a))", "n,m,a,b = map(int,input().split())\r\nnBuild = m-n%m\r\nnDem = n%m\r\nprint(min(nBuild*a,nDem*b))\r\n", "from array import array\r\nfrom sys import stdin\r\nimport bisect\r\nfrom bisect import *\r\nimport itertools\r\nfrom itertools import *\r\n\r\ndef scan_gen():\r\n for line in stdin: yield from iter(line.split())\r\nscan = scan_gen()\r\ndef nint(): return int(next(scan))\r\ndef nintk(k): return tuple(nint() for _ in range(k))\r\ndef nfloat(): return float(next(scan))\r\ndef intar_init(size): return array('i',[0]) *size\r\ndef intar(size=None):\r\n if size == None: size = nint()\r\n arr = intar_init(size) \r\n for x in range(size): arr[x]=nint()\r\n return arr\r\n\r\n\r\ndef solve():\r\n n,m,a,b=nintk(4)\r\n d = n%m\r\n dd = m-d\r\n print(min(d*b,dd*a))\r\n\r\nsolve()\r\n" ]

[ "import datetime\r\n\r\nn = int(input())\r\na , b = input().split()\r\n\r\nx = datetime.timedelta(hours= int(a) , minutes=int(b))\r\nc = 0\r\nwhile '7' not in str(x):\r\n x -= datetime.timedelta(hours= 0 , minutes=n)\r\n c +=1\r\n\r\nprint(c)", "x = int(input())\r\n\r\nh, m = [int(x) for x in input().split()]\r\n\r\nfor y in range(3600):\r\n t = h * 60 + m - x * y\r\n if t < 0:\r\n t += 60 * 24\r\n h_new = t // 60\r\n m_new = t % 60\r\n \r\n if '7' in str(h_new) + str(m_new):\r\n print(y)\r\n break\r\n", "n=int(input())\r\nh,m=map(int,input().split())\r\nc=h*60+m\r\nans=0\r\nwhile \"7\" not in str(c//60)+str(c%60):\r\n c-=n\r\n ans+=1\r\n if c==0:\r\n c=1440\r\nprint(ans)\r\n \r\n\r\n \r\n", "x = int(input())\r\nh, m = map(int, input().split(\" \"))\r\nc = 0\r\n\r\nwhile (h%10!=7 and m%10!=7):\r\n c+= 1\r\n m-=x\r\n if (m < 0):\r\n h -= 1\r\n m = 60 + m\r\n\r\n if (h < 0):\r\n h = 23\r\n\r\nprint(c)", "def lucky(a,b):\r\n return '7' in str(a)+str(b)\r\nx = int(input())\r\nt = 0\r\nh,m = map(int,input().split())\r\nwhile not lucky(h,m):\r\n t+=1\r\n m -= x\r\n while m<0:\r\n m+=60\r\n h-=1\r\n h%=24\r\nprint(t)\r\n", "import sys\nif __name__ == \"__main__\":\n\tx = int(input())\n\thh,mm = input().split(' ')\n\thh = int(hh)\n\tmm = int(mm)\n\tcnt = 0\n\twhile(1):\n\t\ts = set(str(str(hh)+str(mm)))\n\t\t#print(s)\n\t\tif('7' in s):\n\t\t\tbreak;\n\t\telse:\n\t\t\tif(mm<x):\n\t\t\t\tr = x-mm\n\t\t\t\tmm = 60-r\n\t\t\t\tif(hh == 00):\n\t\t\t\t\thh = 23\n\t\t\t\telse:\n\t\t\t\t\thh-=1\n\t\t\telse:\n\t\t\t\tmm-=x\n\t\t#print(\"hh:mm \", hh,\":\",mm)\n\t\tcnt+=1\n\tprint(cnt)", "x = int(input())\r\nhh, mm = map(int, input().split())\r\nresult = 0\r\nwhile '7' not in str(hh) and '7' not in str(mm):\r\n\tmm-=x\r\n\tif mm<0:\r\n\t\tmm=60+mm\r\n\t\thh-=1\r\n\tif hh<0:\r\n\t\thh=24+hh\r\n\tresult+=1\r\nprint(result)", "t=int(input())\r\ns=input()\r\nif('7' in s):\r\n\tprint(0)\r\nelse:\r\n\th=list(map(int,s.split(\" \")))\r\n\tcount=0\r\n\twhile('7' not in s):\r\n\t\tif(h[1]<t):\r\n\t\t\tif(h[0]!=0):\r\n\t\t\t\th[0]-=1\r\n\t\t\telse:\r\n\t\t\t\th[0]=23\r\n\t\t\th[1]=h[1]-t+60\r\n\t\telse:\r\n\t\t\th[1]=h[1]-t\r\n\t\tcount+=1\r\n\t\ts=str(h[0])+\" \"+str(h[1])\r\n\tprint(count)\r\n\t\t\t\t\r\n", "x = int(input())\r\na,b = map(int,input().split())\r\nc = 0\r\nwhile '7' not in str(a) and '7' not in str(b):\r\n b = b - x\r\n if a < 0:\r\n a+= 24\r\n if b < 0:\r\n b += 60\r\n a -= 1\r\n #print(a,b)\r\n c += 1\r\nprint(c)\r\n", "from sys import stdin, stdout\r\n\r\nx = int(stdin.readline())\r\nh, m = map(int, stdin.readline().split())\r\ncnt = 0\r\n\r\nwhile '7' not in str(h) and '7' not in str(m):\r\n if m < x:\r\n if h == 0:\r\n h = 23\r\n m = m + 60 - x\r\n cnt += 1\r\n else:\r\n h -= 1\r\n m = m + 60 - x\r\n cnt += 1\r\n else:\r\n m -= x\r\n cnt += 1\r\n\r\nstdout.write(str(cnt))\r\n", "x = int(input())\r\nh, m = map(int, input().split())\r\nM, c = 60*h + m, 0\r\nwhile '7' not in str(M//60) + str(M%60):\r\n c += 1; M -= x\r\n if M < 0: M += 1440\r\nprint(c)", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/24/18\n\n\"\"\"\n\nimport math\nimport collections\nimport bisect\nimport heapq\nimport time\nimport random\nimport itertools\nimport sys\n\nMOD = 24 * 60\nX = int(input()) % MOD\nH, M = map(int, input().split())\n\nans = 0\nwhile ''.join(map(str, [H, M])).find('7') < 0:\n t = (H*60 + M - X + MOD) % MOD\n H = t // 60\n M = t % 60\n ans += 1\n\nprint(ans)", "x=int(input())\r\narr=list(map(int,input().strip().split(' ')))\r\nh=arr[0]\r\nm=arr[1]\r\ncnt=0\r\nwhile(True):\r\n s=str(h)\r\n ss=str(m)\r\n if('7' in s or '7' in ss):\r\n break\r\n else:\r\n cnt+=1\r\n \r\n if(m-x<0):\r\n if(h-1<0):\r\n h=23\r\n else:\r\n h-=1\r\n m=60+m-x\r\n else:\r\n m=m-x\r\nprint(cnt)", "import sys\r\n\r\nx = int(sys.stdin.readline())\r\n\r\nh,m = sys.stdin.readline().split()\r\n\r\nh = int(h)\r\nm = int(m)\r\n\r\ndef sub(h,m,x):\r\n if x<=m:\r\n return h,(m-x)\r\n else:\r\n if h>=1:\r\n return (h-1),(m+60-x)\r\n else:\r\n return 23,(m+60-x)\r\n\r\ndef is_good(d):\r\n x = d//10\r\n y = d%10\r\n if y==7 or d==7:\r\n return True\r\n else:\r\n return False\r\n\r\niterations = 0\r\n\r\nwhile not (is_good(h) or is_good(m)):\r\n iterations +=1\r\n h,m = sub(h,m,x)\r\n\r\nprint(iterations)", "def main():\r\n x = int(input())\r\n h, m = list(map(int, input().split()))\r\n \r\n c = 0\r\n while h % 10 != 7 and m % 10 != 7:\r\n m -= x\r\n c += 1\r\n if m < 0:\r\n m = m + 60\r\n h -= 1\r\n if h < 0:\r\n h = 23\r\n print (c)\r\n \r\nmain()", "t=int(input())\r\nh,m=map(int,input().split())\r\nif('7' in str(h) or '7' in str(m)):\r\n print(\"0\")\r\nelse:\r\n c=0\r\n while(1):\r\n if('7' in str(h) or '7' in str(m)):\r\n print(c)\r\n break\r\n \r\n elif(t>=m):\r\n x=t-m\r\n if(x==0):\r\n m=0\r\n else:\r\n m=59-(x-1)\r\n h-=1\r\n c+=1\r\n else:\r\n m=m-t\r\n c+=1", "import sys\r\nx=int(sys.stdin.readline().strip())\r\nh,m = list(map(lambda y:int(y), sys.stdin.readline().strip().split(' ')))\r\n\r\nans=0\r\nwhile(\"7\" not in \"{}:{}\".format(h,m)):\r\n m-=x\r\n ans+=1\r\n if m<0:\r\n m+=60\r\n h-=1\r\n if h<0:\r\n h+=24\r\nprint(ans)\r\n", "x = int(input())\r\n\r\na, b = map(int, input().split())\r\n\r\ntime_target = a*60 + b\r\nc = 0\r\nwhile True:\r\n hr = time_target // 60\r\n mn = time_target % 60\r\n\r\n if '7' in str(hr) or '7' in str(mn):\r\n break\r\n else:\r\n c += 1\r\n time_target = (time_target - x) % 1440\r\n\r\nprint(c)\r\n", "x = int(input())\r\nh, m = map(int,input().split())\r\nt, ans = 60 * h + m, 0\r\nwhile '7' not in str(t // 60) + str( t % 60):\r\n\tans += 1\r\n\tt -= x\r\n\tif t<0:t += 1440\r\nprint(ans)\r\n", "def CheckIfLucky(num):\r\n while (num >=1):\r\n if (num %10 == 7):\r\n return True;\r\n num = num / 10;\r\n return False;\r\n\r\n\r\n\r\n\r\n#get the inputs\r\nsnoozeTime = int(input())\r\nwakingUpTime = input()\r\n#seperating the hours from the minutes\r\nwakingH = int(wakingUpTime[:2])\r\nwakingM = int(wakingUpTime[3:5])\r\nnumofSnoozes = 0;\r\n\r\nwhile (True):\r\n if (CheckIfLucky(wakingH) or CheckIfLucky(wakingM)):\r\n print (numofSnoozes)\r\n break\r\n if(wakingM < snoozeTime):\r\n wakingM = 60 + wakingM - snoozeTime\r\n wakingH -= 1\r\n if (wakingH < 0):\r\n wakingH = 23\r\n else:\r\n wakingM -= snoozeTime\r\n numofSnoozes += 1\r\n\r\n\r\n\r\n\r\n#Debugging\r\n#print (wakingH)\r\n#print (wakingM)\r\n#print(CheckIfLucky(wakingH))\r\n#print(CheckIfLucky(wakingM))", "x = int(input())\r\nhh ,mm = map(int,input().split(\" \"))\r\n\r\n\r\n\r\ncount = 0\r\n\r\nwhile True:\r\n\tif '7' in str(hh) or '7' in str(mm):\r\n\t\tprint(count)\r\n\t\texit(0)\r\n\r\n\tmm -= x\r\n\tcount += 1\r\n\tif mm < 0:\r\n\t\tmm = 60 + mm\r\n\t\thh -= 1\r\n\r\n\tif hh < 0:\r\n\t\thh = 23\r\n\r\n\r\n\r\n", "x = int(input())\r\nh, m = map(int, input().split())\r\n\r\nsnoozes = 0\r\nwhile True:\r\n # Calculate the time x*y minutes before the alarm time\r\n total_minutes = h*60 + m - x*snoozes\r\n if total_minutes < 0:\r\n # Add 24 hours if the time is negative\r\n total_minutes += 24*60\r\n snooze_h, snooze_m = divmod(total_minutes, 60)\r\n\r\n # Check if the snooze time is lucky\r\n if '7' in str(snooze_h) or '7' in str(snooze_m):\r\n break\r\n\r\n # Increment the number of snoozes\r\n snoozes += 1\r\n\r\nprint(snoozes)\r\n", "x = int(input())\r\n\r\nh, m = map(int, input().split())\r\n\r\ncluck = 0\r\n\r\nwhile ('7' not in str(h)) and ('7' not in str(m)):\r\n m -= x\r\n if m < 0:\r\n m += 60\r\n h -= 1\r\n if h < 0:\r\n h = 23\r\n\r\n cluck += 1\r\n\r\nprint(cluck)\r\n", "def haveseven(a):\r\n return ((a % 10 == 7) or (int(a/10) == 7))\r\n\r\nx = int(input())\r\nhh, mm = map(int, input().split())\r\n\r\nt = hh*60 + mm\r\ncnt = 0\r\nwhile '7' not in str(t//60) + str(t%60):\r\n cnt+=1\r\n t-=x\r\n if (t < 0):\r\n t += 24*60\r\n\r\nprint(cnt)", "import fileinput\nfrom datetime import datetime\n\n\nlines = []\ni = 0\nfor line in fileinput.input():\n lines.append(line)\n i += 1\n if i == 2:\n break\n\n\n\nx = int(lines[0].strip())\nparts = lines[1].split()\nhh = int(parts[0].strip())\nmm = int(parts[1].strip())\n\n\nd = datetime(2010, 9, 12, hh, mm, 00)\n\ni = 0\nwhile True:\n # print (d)\n if '7' in str(d).split(' ')[1]:\n break\n t = d.timestamp()\n d = datetime.fromtimestamp(t - x * 60)\n i += 1\n\nprint (i)", "x = int(input())\nh, m = input().split()\nmin_push = 0\n\nwhile ('7' not in m) and ('7' not in h):\n m = str(int(m) - x)\n if int(m) < 0:\n m = str(60 + int(m))\n h = str(int(h) - 1)\n if int(h) < 0:\n h = str(23)\n min_push += 1\n\nprint(min_push)", "def test(h, m):\n return (m % 10 == 7) or (h % 10 == 7)\n\n\nx = int(input())\nh, m = list(map(int, input().split()))\ncount = 0\n\nwhile not test(h, m):\n m -= x\n if m < 0:\n m += 60\n h = (h-1) % 24\n count += 1\n # print(\"h=\" + str(h) +\" m=\"+str(m))\n\n\nprint(count)\n", "x = int(input())\nh, m = map(int, input().split(' '))\norig_h, orig_m = h, m\ncounter = 0\n\ndef isLucky(h, m):\n return ('7' in str(h)) or ('7' in str(m))\n\ndef next_time(h, m, x):\n m -= x\n if m < 0:\n m = 60+m\n h -= 1\n if h < 0:\n h = 24+h\n return (h, m)\n\nwhile True:\n if isLucky(h, m):\n if orig_h < h:\n orig_h += 24\n print(((orig_h*60+orig_m) - (h*60+m))//x)\n break\n h, m = next_time(h, m, x)\n", "x=int(input())\r\ns=input()\r\nif s.find('7')!=-1:\r\n print(0)\r\nelse:\r\n s=s.split()\r\n k=0\r\n h, m = [int(s[i]) for i in range(len(s))]\r\n m1=h*60+m\r\n while str(m1//60).find('7')==-1 and str(m1%60).find('7')==-1:\r\n m1-=x\r\n k+=1\r\n print(k)\r\n\r\n", "x=int(input())\r\nh,m=map(int,input().split())\r\nM,c=60*h+m,0\r\nwhile'7'not in str(M//60)+str(M%60):\r\n c+=1;M-=x\r\n if M<0:M+=1440\r\nprint(c)", "x = int(input())\r\nh, m = list(map(str, input().split()))\r\nh2, m2 = h, m\r\nans = 0\r\ntemp = 0\r\nwhile \"7\" not in str(h2) and \"7\" not in str(m2):\r\n# print(h2,m2)\r\n if (int(m2) - x < 0):\r\n# print(ans, \"ASDSDA\")\r\n temp = int(h2)\r\n if (temp - 1 < 0):\r\n temp = 23\r\n h2 = temp\r\n else:\r\n temp -= 1\r\n h2 = temp\r\n temp = (60 - x) + int(m2)\r\n m2 = temp\r\n else:\r\n temp = int(m2)\r\n temp -= x\r\n m2 = temp\r\n ans += 1\r\nprint(ans)", "x = int(input())\r\nh, m = [int(i) for i in input().split()]\r\nans = 0\r\nwhile not ((\"7\" in str(h)) or (\"7\" in str(m))):\r\n tm = (m + h * 60 - x + 24 * 60) % (24 * 60)\r\n h = tm // 60\r\n m = tm % 60\r\n ans += 1\r\nprint(ans)", "import math\r\nn = int(input())\r\nh, m = map(int, input().split())\r\nans = 0\r\nwhile h % 10 != 7 and m % 10 != 7:\r\n if n > m:\r\n m = 60 + m - n\r\n h -= 1\r\n else:\r\n m -= n\r\n if h < 0 :\r\n h = 23\r\n ans += 1\r\n\r\nprint(ans)\r\n", "y = int(input())\nh, m = input().split()\nh,m = int(h),int(m)\nstep = 0\nwhile not (('7' in str(h)) or ('7' in str(m))):\n m -= y\n step+=1\n if m<0:\n m = m%60\n h-=1\nprint(step)\n", "#916A\r\ndef main():\r\n\tx = int(input())\r\n\th, m = map(int, input().split())\r\n\th = int(h)\r\n\tm = int(m)\r\n\tt = 0\r\n\twhile not checktime(h, m):\r\n\t\th, m = uptime(h, m, x)\r\n\t\tt += 1\r\n\tprint(t)\r\n\r\ndef uptime(h, m, x):\r\n\tm -= x\r\n\tif m < 0:\r\n\t\tif h == 0:\r\n\t\t\th = 23\r\n\t\telse:\r\n\t\t\th -= 1\r\n\t\tm += 60\r\n\treturn h, m\r\n\r\ndef checktime(h, m):\r\n\treturn '7' in str(h) or '7' in str(m)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "x = int(input())\r\nh, m = map(int,input().split())\r\nM,c = 60*h+m, 0\r\nwhile '7' not in str(M//60)+str(M%60):\r\n c += 1\r\n M -= x\r\n if M<0:\r\n M+=1440\r\nprint(c)", "def isLucky(t):\n\tif 7==t%10:\n\t\treturn True\n\tif (t//60)%10==7:\n\t\treturn True\n\treturn False\n\nx = int(input())\nh,m = map(int,input().split())\nct = h*60+m\nans = 0\nwhile (not isLucky(ct)):\n\tct = (ct-x)%(60*24)\n\tans+=1\nprint(ans)\n", "x = int(input())\r\ns = input().split()\r\nhh = int(s[0])\r\nmm = int(s[1])\r\nres = 0\r\nk=0\r\nst = True\r\nif '7' in str(hh) or '7' in str(mm):\r\n k=0\r\nelse:\r\n while(st):\r\n if mm-x<0:\r\n mm = 60-x+mm\r\n if hh-1==-1:\r\n hh=23\r\n else:\r\n hh-=1\r\n else:\r\n mm-=x\r\n k+=1\r\n if '7' in str(hh) or '7' in str(mm):\r\n st = False\r\nprint(k)", "x,[h,m],r=int(input()),list(map(int,input().split(' '))),0\nwhile'7'not in''.join(str(c)for c in[h,m]):\n\tm,r=m-x,r+1\n\tif m<0:m,h=m+60,(h+23)%24\nprint(r)", "x =int(input())\r\nh,m= map(int,input().split())\r\nt=60*h+m\r\ny=0\r\nwhile '7' not in str(t//60)+str(t%60):\r\n\ty+=1\r\n\tt-=x\r\n\tif t<0:\r\n\t\tt+=1440\r\n\t\r\n\t\r\nprint(y)\r\n\r\n\r\n", "x=int(input())\r\nh,m=input().split()\r\ns=0\r\nwhile('7' not in h and '7' not in m):\r\n h=int(h)\r\n m=int(m)\r\n s=s+1\r\n m=m-x\r\n if(m<0):\r\n h=h-1\r\n m=60+m\r\n if(h<0):\r\n h=24+h\r\n h=str(h)\r\n m=str(m)\r\nprint(s)\r\n \r\n", "x = int(input())\r\nhh, yy = map(int, input().split())\r\nsnoozes = 0\r\nwhile not \"7\" in (str(hh) + str(yy)):\r\n\t#print(str(hh) + str(yy))\r\n\tif yy - x < 0:\r\n\t\tyy = 60 + yy - x\r\n\t\thh -= 1\r\n\t\tif hh < 0:\r\n\t\t\thh = 23\r\n\telse:\r\n\t\tyy -= x\r\n\tsnoozes += 1\r\nprint(snoozes)", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\nx = int(input().strip())\r\n# arr = [int(x) for x in input().split()]\r\n\r\nhrs, mins = get_ints()\r\n\r\ndef timeToMins(hrs, mins):\r\n return hrs*60 + mins\r\n\r\ndef isMinsLucky(mins):\r\n hrs = mins//60\r\n mins = mins%60\r\n time = str(hrs) + str(mins)\r\n return time.find('7') >= 0\r\n\r\ncount = 0\r\ntotalMins = timeToMins(hrs, mins)\r\n\r\nwhile True:\r\n if isMinsLucky(totalMins):\r\n break\r\n else:\r\n count += 1\r\n totalMins -= x\r\n\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jan 19 20:08:49 2018\r\n\r\n@author: Lenovo Ideapad\r\n\"\"\"\r\n\r\nx=int(input())\r\nh,m=map(int,input().split(\" \"))\r\ncount=0\r\nwhile(h%10!=7 and h//10!=7 and m%10!=7 and m//10!=7):\r\n m-=x\r\n if(m<0):\r\n m+=60\r\n h-=1\r\n if(h<0):\r\n h+=24\r\n count+=1\r\nprint(count)", "x = int(input())\r\nhh, mm = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(10 ** 5):\r\n if hh % 10 == 7 or mm % 10 == 7:\r\n break\r\n if x > mm:\r\n mm = mm + 60 - x\r\n if hh > 0:\r\n hh -= 1\r\n else:\r\n hh = hh + 24 - 1\r\n else:\r\n mm -= x\r\n s += 1\r\n if hh % 10 == 7 or mm % 10 == 7:\r\n break\r\nprint(s)", "n = int(input())\r\nx,y=map(int,input().split())\r\ni,j=x,y\r\nk=0\r\nwhile '7' not in str(i)+str(j):\r\n j = j - n\r\n if j < 0:\r\n i -= 1\r\n j += 60\r\n if i < 0:\r\n i += 24\r\n k += 1\r\nprint(k)", "#! /usr/bin/env python3\n'''\nAuthor: krishna\nCreated: Fri Jan 19 20:09:55 2018 IST\nFile Name: a.py\nUSAGE:\n a.py\nDescription:\n\n'''\nimport sys, os\n\n\ndef has7(i):\n if (i % 10 == 7):\n return 1\n\n i /= 10\n\n if (i % 10 == 7):\n return 1\n\n return 0\n\n\ndef main():\n '''\n The Main\n '''\n n = int(sys.stdin.readline())\n h, m = map(int, sys.stdin.readline().split())\n\n i = 0\n\n while (1):\n if (has7(h)):\n break\n if (has7(m)):\n break\n\n i += 1\n\n m -= n\n if (m < 0):\n m += 60\n h -= 1\n\n if (h < 0):\n h += 24\n\n print(i)\n\n\nif __name__ == '__main__':\n main()\n", "x, y = int(input()), 0\nh, m = map(int, input().split())\nwhile not '7' in f'{h}{m}':\n y += 1\n h, m = divmod((h * 60 + m - x) % 1440, 60)\nprint(y)", "x = int(input())\n\nhh, mm = [int(i) for i in input().split()]\n\nsecs = hh * 60 + mm\n\nif '7' in list(str(hh)) or '7' in list(str(mm)):\n print(0)\nelse:\n i = 0\n while not ('7' in list(str(hh)) or '7' in list(str(mm))):\n secs = (secs - x) % 1440\n i += 1\n hh, mm = secs // 60, secs % 60\n print(i)\n", "x = int(input())\r\nhh, mm = map(int, input().split())\r\nmins = hh * 60 + mm\r\nans = 0\r\nwhile str(mins // 60).count('7') == 0 and str(mins % 60).count('7') == 0:\r\n mins -= x\r\n ans += 1\r\n if mins < 0:\r\n mins = 1440 + mins\r\nprint(ans)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef check(t):\r\n h = t // 60\r\n m = t % 60\r\n\r\n return h // 10 == 7 or h % 10 == 7 or m // 10 == 7 or m % 10 == 7\r\n\r\n\r\nx = int(input())\r\n\r\ndata = input().split()\r\ntime = int(data[0]) * 60 + int(data[1])\r\n\r\ncnt = 0\r\nwhile not check(time):\r\n cnt += 1\r\n time -= x\r\n if time <= 0:\r\n time += 24 * 60\r\n\r\nprint(cnt)", "\r\n\r\ndef test7(h,m):\r\n if h % 10 == 7:\r\n return True\r\n if m % 10 == 7:\r\n return True\r\n return False\r\n\r\nx = int(input())\r\n(h,m) = map(int,input().split(' '))\r\nn =0\r\nwhile True:\r\n if test7(h,m):\r\n print(n)\r\n break\r\n m -= x\r\n if(m<0):\r\n m+=60\r\n h-=1\r\n if(h<0):\r\n h+=24\r\n n+=1\r\n\r\n\r\n\r\n#print(x,h,m)\r\n", "x = int(input())\r\nhh, mm = map(int, input().split())\r\nans = 0\r\nwhile '7' not in str(hh) and '7' not in str(mm):\r\n mm -= x\r\n if mm < 0:\r\n hh = (hh + 23) % 24\r\n mm += 60\r\n ans += 1\r\nprint(ans)", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nx = I()\r\nhh, mm = IL()\r\n\r\nmoves = 0\r\nwhile hh%10!=7 and mm%10!=7:\r\n moves += 1\r\n mm -= x\r\n dm = mm%60 - mm\r\n mm = mm%60\r\n hh -= dm//60\r\n hh = hh%24\r\n\r\nprint(moves)", "x=int(input())\r\nh,m=map(int,input().split())\r\ns=0\r\nwhile '7' not in str(h)+str(m):\r\n s+=1\r\n m-=x\r\n if m<0:\r\n m+=60\r\n h-=1\r\n if h<0:\r\n h+=24\r\nprint(s)", "import sys\nn=int(input())\nh,m=map(int,input().split())\nans=0\nwhile 1:\n if h%10==7 or m%10==7:\n print(ans)\n sys.exit()\n ans+=1\n m-=n\n if m<0:\n m+=60\n h-=1\n if h<0: h=23", "x=int(input())\r\nhh,mm=map(int,input().split())\r\nans=0\r\nwhile not '7' in str(hh)+str(mm):\r\n ans+=1\r\n if mm>=x:\r\n mm-=x\r\n else:\r\n if hh==0:\r\n hh=23\r\n else:\r\n hh-=1\r\n mm=60-(x-mm)\r\nprint(ans)", "x = int(input())\r\nhh,mm = map(int,input().split())\r\nans = 0\r\nwhile True:\r\n if (str(hh)+str(mm)).count(\"7\") >= 1:\r\n break\r\n mm -= x\r\n if mm < 0:\r\n mm += 60\r\n hh -= 1\r\n if hh < 0:\r\n hh = 23\r\n ans += 1\r\nprint(ans)\r\n", "from datetime import timedelta\r\n\r\nsubtract = int(input())\r\nhour, minute = map(int, input().split())\r\n\r\ntime_1 = timedelta(hours=hour, minutes=minute)\r\ntime_2 = timedelta(minutes=subtract)\r\nans = 0\r\nwhile '7' not in str(time_1):\r\n time_1 = time_1 - time_2\r\n ans += 1\r\nprint(ans)\r\n", "x = int(input())\r\nhh, mm = map(str, input().split())\r\nans = 0\r\nwhile mm[0] != '7'and mm[1] != '7'and hh[0] != '7' and hh[1] != '7':\r\n mm = int(mm) - x\r\n hh = int(hh)\r\n ans += 1\r\n if mm < 0:\r\n hh -= 1\r\n mm += 60 \r\n if hh < 0:\r\n hh = 23\r\n mm = str(mm)\r\n hh = str(hh)\r\n if len(mm) == 1:\r\n mm = '0' + mm\r\n if len(hh) == 1:\r\n hh = '0' + hh\r\nprint(ans)", "#wa1\r\n#wa2\r\n#wa3\r\nx = int(input())\r\nl1 = [int(x) for x in input().split()]\r\ni=0\r\nm0 = l1[1]\r\nh0 = l1[0]\r\ny=0\r\nh,m=h0,m0\r\nwhile h!=17 and h!=7 and str(m)[-1]!=\"7\":\r\n time = h*60+m\r\n y+=1\r\n time -=x\r\n if time<0:\r\n time = 24*60+time \r\n h = int(time/60)\r\n m = time%60\r\n #print(h,m)\r\n\r\n\r\nprint(y)\r\n \r\n", "x=int(input())\nh,m=map(int,input().split())\nt=0\nwhile h%10!=7 and m%10!=7:\n\tif x>m:\n\t\tm=60+m-x\n\t\th-=1\n\telse:\n\t\tm-=x\n\tif h<0:\n\t\th=23\n\tt+=1\nprint(t)\n\t", "#!/usr/bin/env python3\r\n#! -*- coding: utf-8 -*-\r\n\r\n\r\ndef main():\r\n\tx = int(input())\r\n\th, m = map(int, input().split())\r\n\tseconds = m * 60 + h * 60 * 60\r\n\ty = 0\r\n\twhile 1:\r\n\t\tsec = ((seconds - y * x * 60) + (24 * 60 * 60)) % (24 * 60 * 60)\r\n\t\tm = sec // 60 % (60)\r\n\t\th = sec // 60 // 60\r\n\t\tif '7' in str(m) or '7' in str(h):\r\n\t\t\tprint(y)\r\n\t\t\texit(0)\r\n\t\ty += 1\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "x = int(input())\r\nhh,mm = map(int,input().split())\r\ncnt = 0 \r\nwhile '7' not in str(mm) and '7' not in str(hh):\r\n mm = mm-x\r\n cnt +=1\r\n if mm < 0:\r\n mm = 60+mm\r\n hh -= 1\r\n if hh <=0:\r\n hh = 24+hh\r\n \r\nprint(cnt) ", "x = int(input())\nh,m = map(int,input().split())\nans = 0\nwhile (h % 10 != 7) and (m % 10 != 7):\n\tif m - x >= 0:\n\t\tm -= x\n\telse:\n\t\ttemp = x - m\n\t\tm = 60 - temp\n\t\tif h - 1 >= 0:\n\t\t\th -= 1\n\t\telse:\n\t\t\th = 23\n\tans += 1\n\t# print(':'.join([str(h),str(m)]))\nprint(ans)", "\r\nx = int(input())\r\nhh, mm = map(int, input().split())\r\nans = 0\r\nwhile '7' not in str(hh) + str(mm) :\r\n\tans += 1\r\n\tmm = mm - x\r\n\tif mm < 0:\r\n\t\thh = hh - 1\r\n\t\tmm = 60 + mm\r\n\r\n\tif hh < 0:\r\n\t\thh = hh + 24\r\n\r\nprint(ans)", "x = int(input())\r\nc = 0\r\n\r\nh,m = map(int, input().split())\r\nfrom datetime import *\r\nt = datetime(9,9,9,h, m)\r\nwhile '7' not in str(t.time()):\r\n\tt-=timedelta(minutes= x)\r\n\tc+=1\r\nprint (c)", "x=int(input())\r\nhh,mm= map(int,input().split(' '))\r\ns=str(hh)+str(mm)\r\nans=0\r\nwhile('7' not in s):\r\n if mm>=x:\r\n mm-=x\r\n else:\r\n hh=(hh+23)%24\r\n mm=60+mm-x\r\n ans+=1\r\n s=str(hh)+str(mm) \r\nprint(ans)", "x=int(input())\r\nh,m=map(int,input().split())\r\ncnt=0\r\nwhile True:\r\n #print(h,m)\r\n if '7' in str(h)+str(m):\r\n break\r\n cnt+=1\r\n m-=x\r\n if m<0:\r\n m=60+m\r\n h-=1\r\n if h<0:\r\n h=24+h\r\nprint(cnt)\r\n", "x=int(input())\r\nhh,mm=map(int,input().split())\r\na=mm\r\nc=0\r\nif '7' in str(mm):\r\n m=0\r\nelse:\r\n while(str(hh).count('7')==0 and str(mm).count('7')==0):\r\n mm=mm-x\r\n c=c+1\r\n if mm<0:\r\n mm=mm+60\r\n hh=int(hh)-1\r\n if hh<0:\r\n hh=hh+24\r\n m=c\r\nprint(m)", "x=int(input())\nh,m=list(map(int,input().split()))\ndef ok(mm):\n while mm<0: mm+=1440\n hh=mm//60\n mm=mm%60\n return hh%10==7 or hh//10==7 or mm%10==7 or mm//10==7\nfor y in range(999):\n if ok(h*60+m-y*x):\n print(y)\n exit(0)\n", "num = int(input())\r\nh, m = map(int, input().split())\r\n\r\nans = 0\r\nwhile \"7\" not in str(h)+str(m):\r\n if m < num:\r\n m = 60+m-num\r\n ans += 1\r\n if h == 0:\r\n h = 23\r\n else:\r\n h -= 1\r\n else:\r\n m -= num\r\n ans += 1\r\nprint(ans)\r\n\r\n", "# @author Matheus Alves dos Santos\n\nsnooze_time = int(input())\nhours, minutes = map(int, input().split())\nn_snooze = 0\n\nwhile ('7' not in (str(hours) + str(minutes))):\n n_snooze += 1 \n minutes -= snooze_time\n \n if (minutes < 0):\n minutes += 60\n hours -= 1\n \n if (hours < 0):\n hours += 24\n\nprint(n_snooze)", "if __name__ == \"__main__\":\r\n\tx = int(input())\r\n\thh,mm=map(int, input().split())\r\n\ts = str(hh)+str(mm)\r\n\tcount=0\r\n\twhile '7' not in s:\r\n\t\tmm-=x\r\n\t\tif mm < 0:\r\n\t\t\thh-=1\r\n\t\t\tmm=60+mm\r\n\t\tcount +=1\r\n\t\ts = str(hh)+str(mm)\r\n\tprint(count)", "x = int(input())\n\nh, m = map(int, input().split())\n\ndef is_lucky(a, b):\n return '7' in str(a) or '7' in str(b)\n\nres = 0\nwhile not is_lucky(h, m):\n res += 1\n m -= x\n if m < 0:\n h -= 1\n if h < 0:\n h += 24\n m += 60\n\nprint(res)\n", "x = int(input())\r\nh, m = map(int, input().split())\r\nmm = m + h * 60\r\ncnt = 0\r\nwhile not('7' in str(h) or '7' in str(m)):\r\n h = mm // 60\r\n m = mm - 60 * (mm // 60)\r\n if '7' in str(h) or '7' in str(m):\r\n print(cnt)\r\n exit(0)\r\n mm -= x\r\n cnt += 1\r\nprint(cnt)", "#http://codeforces.com/problemset/problem/916/A\r\n#solved\r\n\r\nx = int(input())\r\nh, m = list(map(int, input().split()))\r\ns=0\r\nwhile (not m%10==7) and (not h%10==7):\r\n m-=x\r\n if m<0:\r\n m+=60\r\n h-=1\r\n if h<0:\r\n h+=24\r\n s+=1\r\nprint (s)\r\n\r\n\r\n ", "x = int(input())\nh,m = list(map(int,input().strip().split(' ')))\n\ndef clock_time(h,m,x):\n\tcount = 0\n\twhile '7' not in str(h)+str(m):\n\t\tm -= x\n\t\tcount += 1\n\t\tif m < 0:\n\t\t\tm += 60\n\t\t\th -= 1\n\t\t\tif h < 0:\n\t\t\t\th = 23\n\n\treturn count\n\t\nprint(clock_time(h,m,x))", "x=int(input())\r\nh,m=map(int,input().split())\r\nr=0\r\nwhile h!=7 and h!=17 and m%10!=7:\r\n if m<x:h=(h+23)%24\r\n m=(m+60-x)%60\r\n r+=1\r\nprint(r)\r\n", "import math, sys\r\ndef dead():\r\n sys.stdout.write(\"-1\")\r\n sys.exit()\r\n\r\ndebug = 0\r\nif debug:\r\n f = open(\"input.txt\", \"r\")\r\n input = f.readline\r\ndef main():\r\n x = int(input())\r\n h,m = map(int,input().split())\r\n ans = 0\r\n while not '7' in str(h) and not '7' in str(m):\r\n m -= x\r\n ans += 1\r\n if(m < 0):\r\n m = 60 + m\r\n h -= 1\r\n if(h<0):\r\n h = 23\r\n print(ans)\r\n \r\n \r\nmain()", "x=int(input())\r\nhh,mm=map(int,input().split())\r\nif('7' in str(hh)+str(mm)):\r\n print(0)\r\nelse:\r\n count=0\r\n while('7' not in str(hh)+str(mm)):\r\n mm-=x\r\n if(mm<0):\r\n hh-=1\r\n mm+=60\r\n count+=1\r\n print(count)", "def nt(t):\r\n t = t % (60 * 24)\r\n return '7' in str(t // 60) + str(t % 60)\r\n\r\nx = int(input())\r\nh, m = [int(i) for i in input().split()]\r\nt = h * 60 + m\r\nans = 0\r\nwhile not nt(t):\r\n t = (t - x) % (60 * 24)\r\n ans += 1\r\nprint(ans)", "# CF 457\r\nini=lambda:int(input())\r\ninl=lambda:list(map(int,input().split()))\r\nx=ini()\r\nhh,mm=inl()\r\nimport datetime\r\nwake=datetime.datetime(2000, 1, 1, hh, mm)\r\nmins=datetime.timedelta(minutes=x)\r\nc=0\r\nwhile '7' not in wake.strftime('%H%M'):\r\n wake-=mins\r\n c+=1\r\nprint(c)\r\n", "import sys\r\nn=int(input())\r\nh,m=input().split()\r\ndef seven(s):\r\n return '7' in s\r\nif seven(h+m):\r\n print(0)\r\n sys.exit(0)\r\nelse:\r\n ans=0\r\n hh=int(h)\r\n mm=int(m)\r\n while 1:\r\n \r\n if mm-n>=0:\r\n mm=mm-n\r\n else:\r\n \r\n mm=(mm-n)%59+1\r\n if hh-1>=0:\r\n hh=hh-1\r\n else:\r\n hh=23\r\n ans+=1\r\n if seven(str(hh)+str(mm)):\r\n print(ans)\r\n sys.exit(0)\r\n \r\n \r\n \r\n", "x = int(input())\r\nh, m = map(int, input().split())\r\ncnt = 0\r\nwhile \"7\" not in str(h) and \"7\" not in str(m):\r\n m -= x\r\n if m < 0:\r\n h -= 1\r\n m = 60 + m\r\n if h == -1:\r\n h = 23\r\n cnt += 1\r\nprint(cnt)", "x=int(input())\r\na=input()\r\nc=0\r\ne=0\r\nh=int(a[:2])\r\nm=int(a[3:])\r\nif '7' in a:\r\n print(0)\r\nelse:\r\n while 1:\r\n while m>=0:\r\n c+=1\r\n m-=x\r\n if '7' in str(m) and m>0:\r\n print(c)\r\n e=10\r\n break\r\n if e==10:\r\n break\r\n else:\r\n m+=60\r\n if '7' in str(m):\r\n print(c)\r\n break\r\n if h==0:\r\n h=23\r\n else:\r\n h-=1\r\n if '7' in str(h):\r\n print(c)\r\n break", "from sys import stdin, stdout\r\n\r\nx = int(stdin.readline())\r\na, b = map(int, stdin.readline().split())\r\n\r\ntime = a * 60 + b\r\nfor i in range(10 ** 6):\r\n t = time - i * x\r\n \r\n if t < 0:\r\n t += 24 * 60\r\n time += 24 * 60\r\n \r\n if '7' in str(t // 60) + str(t % 60):\r\n stdout.write(str(i))\r\n break\r\n", "x = int(input())\r\n\r\nn , m = (input().split())\r\n\r\nn = int(n)\r\nm = int(m)\r\n\r\ncount = 0\r\nwhile True:\r\n\th1 = n%10\r\n\th2 = n/10\r\n\r\n\tm1 = m%10\r\n\tm2 = m/10\r\n\r\n\tif h1 == 7 or h2==7 or m1 == 7 or m2 ==7:\r\n\t\tbreak\r\n\telse:\r\n\t\tm=m-x;\r\n\t\tif m<0:\r\n\t\t\tn =n-1\r\n\t\t\r\n\t\tm = m%60\r\n\t\tn = n%24\r\n\t\t#print(n,m)\r\n\t\tcount+=1\r\n\r\nprint(count)", "def dec(t):\n if t[1] == 0:\n t[1] = 59\n t[0] -= 1\n if t[0] == -1:\n t[0] = 23\n return t\n t[1] -= 1\n return t\n\nx = int(input())\nt = list(map(int, input().split(' ')))\nans = 0\n\nwhile not (t[0] // 10 == 7 or t[0] % 10 == 7 or t[1] // 10 == 7 or t[1] % 10 == 7):\n for _ in range(x):\n t = dec(t)\n ans += 1\n\nprint(ans)\n", "def check(h,m):\r\n if('7' in str(h) or '7' in str(m)):\r\n return True\r\n return False\r\n\r\n\r\nx=int(input())\r\nh,m=map(int,input().split())\r\nc=0\r\nwhile True:\r\n if not check(h,m):\r\n m-=x\r\n c+=1\r\n if m<0:\r\n m=(m+60)%60\r\n h-=1\r\n if h<0:\r\n h=23\r\n m=(m+60)%60\r\n else:\r\n break\r\nprint(c)\r\n", "x=int(input())\nh,m=map(int,input().split())\nM,c=60*h+m,0\nwhile '7' not in str(M//60)+str(M%60):\n\tc+=1;M-=x\n\tif M<0:M+=1440\nprint(c)\n\t \t\t\t \t \t \t \t\t\t\t \t\t \t\t\t\t\t", "x = int(input())\r\nh, m = map(int, input().split())\r\n\r\ny = 0\r\nwhile 1:\r\n if str(h).find('7') >= 0 or str(m).find('7') >= 0:\r\n break\r\n\r\n y += 1\r\n m -= x\r\n if m < 0:\r\n h -= 1\r\n m += 60\r\n if h < 0:\r\n h += 24\r\n\r\nprint(y)", "x = int(input())\nh, m = map(int, input().split())\nn = 0\nwhile '7' not in str(m) and '7' not in str(h):\n m -= x\n if m <0:\n h -= 1\n m += 60\n if h == -1:\n h = 23\n n += 1\nprint(n)", "\r\n\r\nx = list(map(int, input().strip().split()))[0]\r\nh, m = list(map(int, input().strip().split()))\r\n\r\n\r\ncount = 0\r\n\r\nwhile True:\r\n a = str(h)\r\n b = str(m)\r\n if '7' in a:\r\n break\r\n if '7' in b:\r\n break\r\n count += 1\r\n m -= x\r\n if m < 0:\r\n h -= 1\r\n m += 60\r\n if h < 0:\r\n h += 24\r\n\r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jan 23 17:32:25 2018\r\n\r\n@author: xws\r\n\"\"\"\r\n\r\nx = int(input())\r\ns = input().split(\" \")\r\na,b = int(s[0]),int(s[1])\r\n\r\n#print (x,a,b)\r\n\r\nT = 0\r\ndef has7(x):\r\n if x%10 ==7:\r\n return 1\r\n else:\r\n return 0\r\nwhile(True):\r\n if has7(a) or has7(b):\r\n break\r\n b = b-x\r\n if(b<0):\r\n b = b+60\r\n a = a-1\r\n if(a<0):\r\n a = a+24\r\n T = T+1\r\n\r\nprint (T)", "from sys import stdin\r\n\r\nrd = stdin.readline\r\n\r\nx = int(rd())\r\nhh, mm = map(int, rd().split())\r\n\r\nif mm % 10 == 7 or hh % 10 == 7: print(0)\r\nelse:\r\n\r\n res = 0\r\n\r\n while mm % 10 != 7 and hh % 10 != 7:\r\n\r\n mm -= x\r\n \r\n if mm < 0:\r\n mm += 60\r\n hh -= 1\r\n\r\n if hh < 0: hh = 23\r\n\r\n res += 1\r\n\r\n print(res)\r\n", "dem, x = 0, int(input())\r\nh, m = map(int, input().split())\r\nwhile True:\r\n if h % 10 == 7 or m % 10 == 7:\r\n print(dem)\r\n break\r\n dem, m = dem + 1, m - x\r\n if m < 0: h, m = h - 1, m + 60\r\n if h < 0: h = 23", "x=int(input())\r\nh,w=map(str,input().split())\r\nif('7' in h or '7' in w):\r\n print(0)\r\nelse:\r\n h=int(h)\r\n w=int(w)\r\n t=60*h+w\r\n f=1\r\n c=0;\r\n while(f==1):\r\n t=t-x;\r\n c=c+1\r\n if(t<0):\r\n t=t+1440\r\n y=t//60\r\n z=t%60\r\n y=str(y)\r\n z=str(z)\r\n if('7' in y or '7' in z):\r\n print(c)\r\n exit(0)\r\n \r\n ", "n = int(input())\nhh,mm = map(int,input().split())\n\ncont = 0\n\nwhile (True) :\n if (mm % 10 == 7 or hh % 10 == 7) :\n print(cont)\n break\n\n mm -= n\n if (mm < 0) :\n mm = 60 + mm\n hh -= 1\n\n if (hh < 0) :\n hh = 24 + hh\n\n cont += 1\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\n\r\ndef judge(hh,mm):\r\n if hh/10==7 or hh%10==7 or mm%10==7 or mm/10==7:\r\n return True\r\n else :\r\n return False\r\n\r\ndef solve(hh,mm,xx):\r\n hh=(hh-1)%24\r\n mm+=60\r\n mm-=xx\r\n if(mm>=60):\r\n mm-=60\r\n hh=(hh+1)%24\r\n return [hh,mm]\r\n\r\nif __name__==\"__main__\":\r\n x = int(input())\r\n hh,mm = input().split()\r\n hh = int(hh)\r\n mm = int(mm)\r\n ans = 0\r\n while True :\r\n if judge(hh,mm) :\r\n print(ans)\r\n break\r\n ans += 1\r\n hh,mm = solve(hh,mm,x)\r\n \r\n ", "x = int(input())\nt = list(map(int, input().split()))\ni = 0\nwhile '7' not in str(t[0]) + str(t[1]):\n i += 1\n t[1] -= x\n if t[1] < 0:\n t[1] += 60\n t[0] -= 1\n if t[0] < 0:\n t[0] += 24\nprint(i)\n", "n = int(input())\r\nh,m = map(int,input().split())\r\nans = 24*60\r\nfor i in range(ans):\r\n if h % 10 == 7 or m % 10 == 7:\r\n break\r\n else:\r\n m -= n\r\n if m < 0:\r\n m += 60\r\n h -= 1\r\n if h < 0:\r\n h += 24\r\nprint(i)", "interval = int(input())\r\npressed = 0\r\nh, m = [int(x) for x in input().split()]\r\nwhile h not in [7, 17] and not m%10== 7:\r\n m -= interval\r\n pressed += 1\r\n if m < 0:\r\n m += 60\r\n h -= 1\r\n if h < 0:\r\n h += 24\r\nprint(pressed)\r\n", "x = int(input())\r\nh,m = map(int, input().split())\r\nresult = 0\r\n\r\nwhile True:\r\n if h%10==7 or m%10==7:\r\n break\r\n\r\n if m-x<0:\r\n if h==0:\r\n h = 23\r\n else:\r\n h-=1\r\n m = 60-(x-m)\r\n else:\r\n m -= x\r\n result += 1\r\n\r\nprint(result)", "n = int(input())\r\nh, m = map(int, input().split())\r\n#s = input()\r\n#c = list(map(int, input().split()))\r\nl = 0\r\nwhile (not ('7' in str(h) + str(m))):\r\n if m < n:\r\n if h == 0:\r\n h = 23\r\n else:\r\n h -= 1\r\n m += 60 - n\r\n else:\r\n m -= n\r\n l += 1\r\nprint(l)", "x=int(input())\n\nhh,mm=map(int,input().split())\n\nif str(hh).count('7')>0 or str(mm).count('7')>0:\n\tprint(0)\n\nelse:\n\tcount=0\n\twhile str(hh).count('7')==0 and str(mm).count('7')==0:\n\t\tmm-=x\n\t\tcount+=1\n\t\tif mm<0:\n\t\t\tmm=mm+60\n\t\t\thh-=1\n\t\t\tif hh<0:\n\t\t\t\thh=hh+24\n\tprint(count)\n", "x=int(input())\r\nhh,mm=map(int,input().split())\r\nt=hh*60+mm\r\ni=0\r\nwhile(1):\r\n h=t//60\r\n m=t%60\r\n if(h//10==7 or h%10==7 or m//10==7 or m%10==7):\r\n break\r\n t=(t-x+1440)%1440\r\n i+=1\r\nprint(i)", "x = int(input())\nh, m = [int(k) for k in input().split(' ') if k]\ny = 0\ndef lucky(a, b):\n return '7' in str(a) or '7' in str(b)\nwhile not lucky(h, m):\n m -= x\n if m < 0:\n m += 60\n h -= 1\n if h < 0:\n h += 24\n y += 1\nprint(y)", "x = int(input())\nhh,mm = input().split()\ns = hh + \" \" + mm\nif s.count('7') > 0:\n exit(print(0))\nh = int(hh)\nm = int(mm)\nans = 0\nwhile True: \n if m - x < 0:\n t = x - m\n m = 60 - t\n if h > 0:\n h -= 1\n else:\n h = 23\n else:\n m -= x\n s = str(h) + str(m)\n ans += 1\n if s.count('7') > 0:\n break\n \nprint(ans)\n\n\n", "t=int(input())\nn,m=input().split()\np,k=int(n),int(m)\nd=0\ns=0\nl=0\nwhile d!=1:\n if k>10:\n if str(k)[0]=='7' or str(k)[1]=='7':\n if s%t==0:\n print(s//t)\n l=1\n d=1\n break\n elif k<10:\n if str(k)[0]=='7':\n if s%t==0:\n print(s//t)\n l=1\n d=1\n break\n if p>10: \n if str(p)[0]=='7' or str(p)[1]=='7':\n if l==0:\n if s%t==0:\n print(s//t)\n l=1\n d=1\n break\n elif p<10:\n if str(p)[0]=='7':\n if l==0:\n if s%t==0:\n print(s//t)\n l=1\n d=1\n break\n \n if k!=0: \n k=(k-1)%60\n elif k==0:\n k=59\n p=(p-1)%24\n elif p==0 and k==0:\n p=23\n k=59\n \n s+=1 \n \n \n \n \n \n \n \n \n \n \n", "x = int(input())\nhh, mm = map(int, input().split())\n\ndef lucky(a):\n return a % 10 == 7 or a // 10 % 10 == 7\nans = 0\nwhile not lucky(hh) and not lucky(mm):\n mm -= x\n ans += 1\n if mm < 0:\n mm += 60\n hh -= 1\n if hh < 0:\n hh += 24\n\nprint(ans)\n", "x = int(input())\r\nhh,mm = map(int,input().split())\r\n\r\n#def cut_the_num(n):\r\n\t#if n // 10 == 0:\r\n\t\t#n = n % 10\r\n\r\n#cut_the_num(hh)\r\n#cut_the_num(mm)\r\n\r\n\r\ncount = 0\r\n\r\nif (str(hh).count('7') > 0) or (str(mm).count('7') > 0):\r\n\tprint('0')\r\nelse:\r\n\twhile (str(hh).count('7') == 0) and (str(mm).count('7') == 0):\r\n\t\tmm_new = mm - x\r\n\t\t#print(\"Отнимаем X\")\r\n\t\tif mm_new < 0:\r\n\t\t\tmm = 60 - (x - mm)\r\n\t\t\t#print('Обновляем часы')\r\n\t\t\thh_new = hh - 1\r\n\t\t\tif hh_new < 0:\r\n\t\t\t\thh = 23\r\n\t\t\telse:\r\n\t\t\t\thh = hh_new\r\n\t\t\t\t#print(\"Новый час\")\r\n\t\telse:\r\n\t\t\tmm = mm_new\r\n\t\tcount += 1\r\n\tprint(count)", "x=int(input())\r\nhh,mm=map(int, input().split())\r\noutput = 0\r\nwhile hh%10 !=7 and mm%10 !=7:\r\n output +=1\r\n mm -=x \r\n if mm <0:\r\n mm +=60\r\n hh -=1\r\n if hh<0:\r\n hh+=24\r\nprint(output)\r\n", "n=int(input())\r\na,b=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nans=0\r\nwhile 1:\r\n if(str(a).count('7')>0 or str(b).count('7')>0):\r\n print(ans)\r\n break\r\n else:\r\n if b-n>=0:\r\n b=b-n\r\n else:\r\n a-=1\r\n b+=60\r\n b-=n\r\n ans+=1", "x=int(input())\r\nhh,mm=[int(x) for x in input().split()]\r\ny=0\r\nwhile '7' not in str(hh) and '7' not in str(mm):\r\n mm-=x\r\n y+=1\r\n if mm<0:\r\n mm+=60\r\n hh-=1\r\n if hh<0:\r\n hh+=24\r\nprint(y)\r\n", "n = int(input())\r\n\r\nline = input().split()\r\n\r\na = int(line[0])\r\nb = int(line[1])\r\n\r\n\r\ni = 0\r\n\r\n\r\nwhile (a%10!=7) and (b%10!=7):\r\n b-=n\r\n i+=1\r\n if b < 0:\r\n b += 60\r\n a -= 1\r\n if a<0:\r\n a += 24\r\n\r\nprint(i)\r\n\r\n", "x = int(input())\r\nh, m = map(int, input().split())\r\nt, c = h*60+m, 0\r\nwhile '7' not in str(t//60)+str(t % 60):\r\n c += 1\r\n t -= x\r\n if t<0:\r\n t += 1440\r\nprint(c)", "x=int(input())\r\ncount=0\r\na,b=map(int,input().split())\r\nwhile True:\r\n if '7' in str(a) or '7' in str(b):\r\n break\r\n if b-x>=0:\r\n b-=x\r\n else:\r\n b=60-(x-b)\r\n if a>=(1):\r\n a-=(1)\r\n else:\r\n a=23\r\n count+=1\r\nprint(count)", "x=int(input())\r\n\r\nh,m=map(int,input().split())\r\n\r\ndef az(h,m):\r\n\tm=m-x\r\n\td=0\r\n\tif m<0:\r\n\t\tm=m%60\r\n\t\td+=1\r\n\th=h-d\r\n\tif h<0:\r\n\t\th+=24\r\n\treturn((h,m))\r\nans=0\r\nwhile '7' not in str(h) and '7' not in str(m):\r\n\th,m=az(h,m)\r\n\tans+=1\r\nprint(ans)\r\n", "x=int(input())\r\na,b=map(int,input().split())\r\ny=0\r\nwhile '7' not in str(a)+str(b):\r\n z=b+a*60+1440\r\n z-=x\r\n z%=1440\r\n a=z//60\r\n b=z%60\r\n y+=1\r\nprint(y)", "\r\nReadIntList = lambda: list(map(int, input().split()))\r\nReadStrList = lambda: list(map(str, input().split()))\r\nReadInt = lambda: int(input())\r\nReadMultipleValues = lambda: map(int, input().split())\r\nReadMultipleValuesStr = lambda: map(str, input().split())\r\nmonth = {'Jan':\"01\", 'feb':\"02\",'Mar':\"03\",'Apr':\"04\",'May':\"05\",'Jun':\"06\", 'Jul':\"07\",'Aug':\"08\",\r\n 'Sep':\"09\",'Oct':\"10\",'Nov':\"11\",'Dec':\"12\"}\r\n\r\n# maximum=dict(sorted(maximum.items(), key=operator.itemgetter(1),reverse=True))\r\n# >>>>>>>>>>>> MAIN >>>>>>>>>>>>\r\n\r\nx = ReadInt()\r\nhh,mm =ReadMultipleValues()\r\noutput = 0\r\nwhile hh%10 !=7 and mm%10 !=7:\r\n output +=1\r\n mm -=x \r\n if mm <0:\r\n mm +=60\r\n hh -=1\r\n if hh<0:\r\n hh+=24\r\nprint(output)", "def time (h,m,x):\n t = 0\n if \"7\" in str(h) or \"7\" in str(m):\n return 0\n else :\n if m[0] == 0:\n m = int(m[1])\n else:\n m = int(m)\n if h[0] == 0:\n h = int(h[1])\n else:\n h = int(h)\n while (\"7\" not in str(m)) and (\"7\" not in str(h)):\n if m - x < 0 :\n remain = x - m\n m = 60 - remain\n h -= 1\n t += 1\n else:\n m -= x\n t += 1\n if h < 0 :\n h = 23\n\n return t\n\n\n\nx = int(input())\nh , m = input().split()\nprint (time (h,m,x))\n \n \n", "t=int(input())\r\na,b=[int(x) for x in input().split()]\r\nr=0\r\nwhile True:\r\n str1=str(a)\r\n str2=str(b)\r\n if ('7' in str1) or ('7' in str2):\r\n print(r)\r\n break\r\n b=b-t\r\n if b < 0:\r\n b=60+b\r\n a=a-1\r\n if a < 0:\r\n a=23\r\n r=r+1\r\n \r\n", "import collections\r\nimport math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef printnl(val):\r\n sys.stdout.write(str(val) + '\\n')\r\n\r\n\r\nx = int(input())\r\nh, m = map(int, input().split())\r\nans = int(1e9)\r\nfor i in range(24):\r\n for j in range(60):\r\n curr = (h-i)*60+((m-j))\r\n curr += 24*60\r\n curr %= 24*60\r\n\r\n if (curr) % x == 0 and '7' in str(i)+str(j):\r\n ans = min(ans, (curr) / x)\r\nprint(int(ans))\r\n", "x = int(input())\r\nh,m = input().split()\r\nif '7' in h or '7' in m:\r\n\tprint(0)\r\nelse:\r\n\th,m = int(h),int(m)\r\n\tc=0\r\n\twhile True:\r\n\t\ttemp = m-x\r\n\t\tif temp <0:\r\n\t\t\th-=1\r\n\t\t\tif h<0: h=24+h\r\n\t\t\tm = 60+temp\r\n\t\telse:\r\n\t\t\tm = temp\r\n\t\tc += 1\r\n\t\t#print(h,m)\r\n\t\tif '7' in str(h) or '7' in str(m):\r\n\t\t\tprint(c)\r\n\t\t\tbreak", "x = int(input())\r\n\r\nhours, mins = list(map(int, input().split()))\r\ncount = 0\r\n\r\nwhile '7' not in str(mins) and '7' not in str(hours):\r\n mins -= x \r\n count += 1 \r\n \r\n if mins < 0:\r\n mins = 60+mins\r\n hours -= 1\r\n \r\n if hours < 0:\r\n hours = 23\r\n \r\nprint(count)\r\n ", "def judge(s):\r\n for i in s:\r\n if i=='7':\r\n return True\r\n return False\r\ndef main():\r\n x=int(input())\r\n l=input().split()\r\n h=int(l[0])\r\n hh=h\r\n m=int(l[1])\r\n mm=m\r\n while True:\r\n if judge(str(m)) or judge(str(h)):\r\n break\r\n m-=x\r\n if m<0:\r\n m+=60\r\n h-=1\r\n print(((hh-h)*60+(mm-m))//x)\r\nmain()\r\n", "x = int(input())\r\nhh, mm = map(int, input().split())\r\ni = 0\r\nt = hh * 60 + mm\r\nwhile i + 1:\r\n h = t // 60\r\n m = t % 60\r\n if h // 10 == 7 or h % 10 == 7 or m // 10 == 7 or m % 10 == 7:\r\n print(i)\r\n exit(0)\r\n t = (t - x + 1440) % 1440\r\n i += 1\r\n", "x = int(input())\r\nhour, minut = input().split(\" \")\r\nhour = int(hour)\r\nminut = int(minut)\r\nsum = 60*hour+minut\r\ni = 0\r\nwhile not (sum%10==7 or (sum//60)%10==7):\r\n sum -= x\r\n i+=1\r\n while sum < 0:\r\n sum += 24*60\r\n#print(str(sum%10) + \" \" + str((sum//60)%10))\r\nprint(i)", "x=int(input())\nk=input().split()\nhh=int(k[0])\nmm = int(k[1])\nk=0\nwhile '7' not in str(mm) and '7' not in str(hh):\n\tif x<=mm:\n\t\tmm-=x\n\telse:\n\t\tif hh==0:\n\t\t\thh=23\n\t\telse:\n\t\t\thh-=1\n\t\tmm+=60-x\n\tk+=1\n\nprint(k)", "from functools import lru_cache\r\nx = int(input())\r\nh, m = tuple(map(int, input().split()))\r\n\r\ndef contains_7(n):\r\n if n%10 == 7:\r\n return True\r\n else:\r\n if n//10 == 7:\r\n return True\r\n return False\r\n\r\ndef to_min(h, m):\r\n return h*60+m\r\n\r\ndef to_h_m(mins):\r\n if mins<0:\r\n mins = mins + (60*24)\r\n return mins//60, mins%60\r\n\r\n\r\ndef sol(h,m,x):\r\n i = 0\r\n while True:\r\n\r\n if contains_7(h) or contains_7(m):\r\n return i\r\n else:\r\n i +=1\r\n h, m = to_h_m(to_min(h,m) - x)\r\n\r\nprint(sol(h,m,x))\r\n", "def main():\n X = int(input())\n HH, MM = map(int, input().split())\n\n m = MM\n h = HH\n snooze = 0\n while 1:\n if m % 10 == 7 or h % 10 == 7:\n break\n m -= X\n if m < 0:\n m += 60\n h -= 1\n if h < 0:\n h += 24\n snooze += 1\n\n print(snooze)\n\nmain()\n", "def main():\r\n x = eval(input())\r\n h,m = map(int,input().split(\" \"))\r\n time = 0\r\n while ((\"7\" in str(m)) or (\"7\" in str(h))) == False:\r\n m = m-x\r\n time += 1\r\n if m < 0:\r\n h -= 1\r\n m = 60 + m\r\n if h < 0:\r\n h = 23\r\n print(time)\r\n\r\nmain()\r\n", "# LUOGU_RID: 133484349\nx=int(input())\nh,m=map(int,input().split())\ns=0\nwhile '7' not in str(h)+str(m):\n s+=1\n m-=x\n if m<0:\n m+=60\n h-=1\n if h<0:\n h+=24\nprint(s)", "x = int(input())\r\nhh, mm = map(int, input().split())\r\ncnt = 0\r\nt = str(hh) + str(mm)\r\ntime = hh * 60 + mm\r\nwhile '7' not in t:\r\n time -= x\r\n hh = time // 60\r\n mm = time % 60\r\n t = t = str(hh) + str(mm)\r\n cnt += 1\r\nprint(cnt)", "def is_lucky(hh, mm):\r\n return '7' in str(hh) or '7' in str(mm)\r\n\r\ndef main():\r\n x = int(input())\r\n hh, mm = map(int, input().split())\r\n\r\n snooze_count = 0\r\n while not is_lucky(hh, mm):\r\n mm -= x\r\n if mm < 0:\r\n mm += 60\r\n hh -= 1\r\n if hh < 0:\r\n hh += 24\r\n snooze_count += 1\r\n\r\n print(snooze_count)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x = int(input())\r\nhh, mm = map(int, input().split())\r\n\r\n\r\nif '7' in (str(hh) + str(mm)):\r\n ans = 0\r\nelse:\r\n mins = 0\r\n while '7' not in (str(hh) + str(mm)) or mins % x != 0:\r\n mins += 1\r\n if mm == 0:\r\n if hh != 0:\r\n hh -= 1\r\n mm = 59\r\n else:\r\n hh = 23\r\n mm = 59\r\n else:\r\n mm -= 1\r\n ans = mins//x\r\n #print(hh, mm)\r\n\r\n\r\nprint(ans)", "x=int(input()); hm=list(map(int,input().split()))\r\norg=60*hm[0]+hm[1]\r\nmins=org\r\ndays=0\r\nwhile '7' not in str((mins%1440)//60) and '7' not in str(mins%1440-60*((mins%1440)//60)):\r\n mins-=x\r\nprint(int((org-mins)/x))\r\n", "x=int(input())\r\nhh,mm=map(int,input().split())\r\na=0\r\nwhile hh%10!=7 and mm%10!=7:\r\n mm=mm-x\r\n if mm<0:\r\n mm=mm+60\r\n hh=hh-1\r\n if hh<0:\r\n hh=23\r\n a=a+1\r\nprint(a)", "x=int(input())\nh,m=map(int,input().split())\nM=60*h+m\nc=0\nwhile 7 not in (h//10,h%10,m//10,m%10):\n\tc+=1\n\tM-=x\n\tif M<0:M+=1440\n\th,m=M//60,M%60\nprint(c)", "x=int(input())\nh,m=map(int,input().split())\nans=0\nwhile '7' not in str(h)+str(m):\n ans+=1\n m-=x\n if m < 0 :\n m+=60\n h=(h-1)%24\n\nprint(ans)\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\nread = lambda: map(int, input().split())\n\n\nx = int(input())\nhh, mm = read()\nr = 0\nwhile '7' not in str(mm) and '7' not in str(hh):\n mm -= x\n if mm < 0:\n hh -= 1\n mm += 60\n if hh < 0:\n hh = 23\n r += 1\nprint(r)\n", "x = int(input())\ni,j = map(int, input().split())\n\ndef toMinutes(timeList):\n return timeList[0]*60 + timeList[1]\n\ndef toTime(minutes):\n h,m = divmod(minutes, 60)\n d,h = divmod(h, 24)\n return [h,m]\n\ndef has7(timeList):\n for j in timeList:\n while j != 0:\n if j % 10 == 7:\n return True\n else:\n j = j // 10\n return False\n\ncounter = 0\n\nwhile True:\n if has7(toTime(toMinutes([i,j]) - x*counter)):\n print(counter)\n break\n else:\n counter += 1\n", "x = int(input())\r\nh, m = map(int, input().split())\r\ntim = 60*h + m\r\nmd = 60*24\r\nfor y in range(60*25):\r\n tw = (tim - x*y) % md\r\n mm = tw%60\r\n hh = (tw - mm)/60\r\n if '7' in str(hh) or '7' in str(mm):\r\n print(y)\r\n exit(0)", "gap = int(input())\r\nx = input().split()\r\nhh = int(x[0])\r\nmm = int(x[1])\r\nans = 0\r\n\r\ntime = hh * 60 + mm\r\n\t\r\ndef rep(time):\r\n\treturn f\"{time // 60}{time % 60}\"\r\n\t\r\nwhile '7' not in rep(time):\r\n\tif time >= gap:\r\n\t\ttime -= gap\r\n\telse:\r\n\t\ttime = 24 * 60 - (gap - time)\r\n\tans += 1\r\n\t\r\nprint(ans)", "def lucky(x):\n return (x % 10 == 7)\nx = int(input())\nh, m = map(int, input().split())\nt = 60 * h + m\n\nans = float('inf')\nfor hh in range(24):\n for mm in range(60):\n if lucky(hh) or lucky(mm):\n s = 60 * hh + mm\n while t < s:\n s -= 60 * 24\n\n r = t - s\n if r % x != 0:\n continue\n\n ans = min(ans, r // x)\n\nprint(ans)\n", "import datetime\r\n\r\nx = int(input())\r\nhh, mm = map(int, input().split())\r\nans = 0\r\nd1 = datetime.datetime(1970, 1, 1, hh, mm, 0)\r\nwhile '7' not in d1.strftime('%H%M'):\r\n d1 = d1 - datetime.timedelta(minutes=x)\r\n ans = ans + 1\r\n\r\nprint(ans)", "x = int(input())\r\nh, m = map(int, input().split())\r\nstep = 0\r\nflag = 0\r\nif ('7' in str(h)) or ('7' in str(m)):\r\n flag = 1\r\nwhile flag == 0:\r\n step += 1\r\n if m - x >= 0:\r\n m = m - x\r\n else:\r\n h = h - 1\r\n if h < 0:\r\n h = 23\r\n m = 60 - (x - m)\r\n if ('7' in str(h)) or ('7' in str(m)):\r\n flag = 1\r\nprint(step)", "x = int(input())\r\nh, m = map(int, input().split())\r\nt = 60 * h + m\r\ndef check(t):\r\n h = str(t // 60)\r\n m = str(t % 60)\r\n if '7' in h + m:\r\n return True\r\n return False\r\nan = 0\r\nwhile not check(t):\r\n t -= x\r\n an += 1\r\n if t < 0:\r\n t = 24 * 60 + t\r\nprint(an)\r\n", "x = int(input())\r\nhh, mm = map(int,input().split())\r\n\r\nn = 0\r\nwhile True:\r\n if hh//10==7 or hh%10==7 or mm//10==7 or mm%10==7:\r\n break\r\n n+=1\r\n mm -= x\r\n if mm<0:\r\n hh -= 1\r\n mm += 60\r\n if hh<0:\r\n hh += 24\r\nprint(n)", "\r\nx = int(input())\r\nhh, mm = map(int, input().split())\r\n\r\nt = hh * 60 + mm\r\n\r\ndef lucky(x):\r\n if str(x).find('7') != -1:\r\n return True\r\n return False\r\n\r\nres = 1000000\r\nfor h in range(24):\r\n for m in range(60):\r\n if lucky(h) or lucky(m):\r\n s = h * 60 + m\r\n d = (t - s + 24*60) % (24*60)\r\n if d % x == 0:\r\n y = d // x\r\n res = min(res, y)\r\nprint(res)", "x = int(input())\r\nh,m = map(int,input().split())\r\ndef ch(a):\r\n if '7' in str(a):\r\n return True\r\n return False\r\ny = 0\r\ndef hh(h):\r\n if h==0:\r\n return 23\r\n else :\r\n return h-1\r\nwhile(True):\r\n if ch(m) or ch(h):\r\n break\r\n if m-x<0:\r\n m = m + 60 - x\r\n h = hh(h)\r\n y += 1\r\n else:\r\n m = m-x\r\n y += 1\r\nprint(y)", "n=int(input())\r\nh,m=map(int,input().split())\r\n\r\nans=0\r\nwhile True:\r\n s=str(h)+str(m)\r\n if \"7\" in s:\r\n break\r\n else:\r\n m-=n\r\n if m<0:\r\n m=60+m\r\n h-=1\r\n ans+=1\r\n else:\r\n ans+=1\r\nprint(ans)", "x=int(input())\r\nt=input()\r\nte=0\r\nj=0\r\nif \"7\" in t:\r\n print(0)\r\nelse:\r\n t=t.split()\r\n while \"7\" not in t[1] and \"7\" not in t[0]:\r\n if x>int(t[1]):\r\n te=x-int(t[1])\r\n if t[0]==\"00\":\r\n t[0]=\"23\"\r\n else:\r\n t[0]=str(int(t[0])-1)\r\n if len(t[0])==1:\r\n t[0]=\"0\"+t[0]\r\n t[1]=str(60-te)\r\n if len(t[1])==1:\r\n t[1]=\"0\"+t[1]\r\n else:\r\n t[1]=str(int(t[1])-x)\r\n if len(t[1])==1:\r\n t[1]=\"0\"+t[1]\r\n j=j+1\r\n print(j)\r\n", "# brute force\nx = int(input())\n[h,m] = [int(x) for x in input().split()]\nlowTime = [h,m]\nhighTime = lowTime[:]\nlowNum = 0\nhighNum = 0\nwhile '7' not in str(highTime[0]) and '7' not in str(highTime[1]) and '7' not in str(lowTime[0]) and '7' not in str(lowTime[1]):\n lowTime[1] -= x\n if lowTime[1] < 0:\n lowTime[1] += 60\n lowTime[0] -= 1\n if lowTime[0] < 0:\n lowTime[0] = 23\n lowNum += 1\nprint(lowNum)\n", "x=int(input())\r\nc=[x for x in input().split()]\r\na,b=int(c[0]),int(c[1])\r\nif a%10==7 or b%10==7:\r\n print(0)\r\nelse:\r\n res=0\r\n while a%10!=7 and b%10!=7:\r\n if b>=x:\r\n b-=x\r\n else:\r\n if a==0:\r\n a=23\r\n else:\r\n a-=1\r\n b=b+60-x\r\n res+=1\r\n print(res)", "x = int(input())\r\nhh, mm = [int(v) for v in input().split()]\r\n\r\nans = 0\r\nwhile '7' not in ('%s%s' % (hh, mm)):\r\n ans += 1\r\n if x == 60:\r\n hh -= 1\r\n else:\r\n mm -= x\r\n if mm < 0:\r\n mm += 60\r\n hh -= 1\r\n if hh < 0:\r\n hh = 23\r\n\r\nprint(ans)\r\n", "import sys\r\nimport math\r\n\r\ndef main():\r\n\tx = int(input())\r\n\thour, minute = map(int, input().split(' '))\r\n\tans = 0\r\n\twhile True:\r\n\t\tif '7' in str(hour) or '7' in str(minute):\r\n\t\t\tprint(ans)\r\n\t\t\tbreak\r\n\t\tans += 1\t\r\n\t\tminute -= x\r\n\t\tif minute < 0:\r\n\t\t\tminute = 60 + minute\r\n\t\t\thour -= 1\r\n\t\t\tif hour < 0:\r\n\t\t\t\thour = 24 + hour\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n\t\t\t\t", "x = int(input())\r\nhh, mm = map(int, input().split())\r\nanswer = 0\r\nwhile hh % 10 != 7 and mm % 10 != 7:\r\n if mm < x:\r\n diff = x - mm\r\n hh -= 1\r\n if hh < 0:\r\n hh = 23\r\n mm = 60 - diff\r\n else:\r\n mm -= x\r\n answer += 1\r\nprint(answer)\r\n", "x = int( input() )\r\nhh, mm = map(int, input().split())\r\n\r\ndef checkTime(mins):\r\n hours = mins // 60\r\n minutes = mins % 60\r\n return (hours % 10 == 7 or minutes % 10 == 7)\r\n\r\ndef prevMoment(mins):\r\n if mins - x < 0:\r\n return 1440 - abs(mins - x)\r\n else:\r\n return mins - x\r\n\r\nsumm = hh * 60 + mm\r\ncnt = 0\r\n\r\nwhile (True):\r\n if checkTime(summ):\r\n break\r\n summ = prevMoment(summ)\r\n cnt += 1\r\n\r\nprint(cnt)", "# Min Zhang\n# cf916a\n\n# Feb 2, 2018\n\ndef isLucky(h,m):\n return ('7' in str(h)) or ('7' in str(m))\n\n# return number of minutes\n# time1 is later than time2\ndef distance(h1,m1,h2,m2):\n return 60 * (h1 - h2) + (m1 - m2)\n\n\ndef addTime(h, m, snooze):\n if m + snooze >= 60:\n m2 = m + snooze - 60\n h2 = h + 1\n else:\n h2 = h\n m2 = m + snooze\n return (h2, m2)\n\ndef minusTime(h, m, snooze):\n if h == 0:\n hcopy = 24\n h2, m2 = minusTime(hcopy, m, snooze)\n elif m - snooze < 0:\n m2 = 60 + (m - snooze)\n h2 = h - 1\n else:\n m2 = m - snooze\n h2 = h\n \n if h2 >= 24:\n h2 = h2 - 24\n return (h2, m2)\n\ndef main():\n snooze = int(input())\n h, m = map(lambda x: int(x), input().split(' '))\n click = 0\n while not isLucky(h,m):\n h,m = minusTime(h, m, snooze) \n click += 1\n print(click)\n\nif __name__ == '__main__':\n main()\n", "def lucky(hh, mm):\r\n if '7' in str(hh):\r\n return True\r\n if '7' in str(mm):\r\n return True\r\n return False\r\n\r\nx = int(input())\r\nh, m = map(int, input().split())\r\ncnt = 0\r\nwhile not lucky(h, m):\r\n m -= x\r\n if m < 0:\r\n m += 60\r\n h -= 1\r\n if h < 0:\r\n h += 24\r\n cnt += 1\r\n \r\nprint(cnt)", "x = int(input())\nh, m = map(int, input().split())\nr = 0\nwhile '7' not in str(m) and '7' not in str(h):\n r += 1\n m -= x\n if m < 0:\n m += 60\n h -= 1\n if h < 0:\n h += 24\nprint(r)\n", "#!/usr/bin/env python\r\n# -*- coding: utf-8 -*-\r\n# @Time : 2017/10/20 13:52\r\n# @Author : litianshuang\r\n# @Email : [email protected]\r\n# @File : test.py\r\n# @Desc :\r\n\r\ndef check(h, m):\r\n if h %10 == 7 or h / 10 == 7:\r\n return True\r\n if m % 10 == 7 or m / 10 == 7:\r\n return True\r\n return False\r\n\r\ndef minute(h, m, x):\r\n if m >= x:\r\n m -= x\r\n return h, m\r\n m = m + 60 - x\r\n h -= 1\r\n if h < 0:\r\n h = 23\r\n return h, m\r\n\r\nif __name__== \"__main__\":\r\n x = int(input())\r\n h, m = [int(n) for n in input().split(' ')]\r\n ans = 0\r\n while True:\r\n if check(h, m):\r\n break\r\n ans += 1\r\n h, m = minute(h, m, x)\r\n print(ans)\r\n", "x=int(input())\nh,m=map(int,input().split())\nn=0\nwhile '7' not in str(h)+str(m):\n n+=1\n m-=x\n if m<0:\n m+=60\n h=(h-1)%24\nprint(n)\n", "x = int(input())\nhh, mm = map(int, input().split())\nans = 0\nwhile hh%10 != 7 and mm%10 != 7:\n ans += 1\n mm -= x\n if mm < 0:\n mm += 60\n hh -= 1\n if hh < 0:\n hh += 24\nprint(ans)\n", "x = int(input())\r\nn, m = list(map(int, input().split()))\r\na = 0\r\nwhile (n % 10 != 7 and n // 10 != 7 and m % 10 != 7 and m // 10 != 7):\r\n m -= x\r\n if m < 0:\r\n m += 60\r\n n -= 1\r\n if n < 0:\r\n n += 24\r\n a += 1\r\nprint(a)\r\n", "# https://codeforces.com/problemset/problem/916/A\n# 900\n\ns = int(input())\nh, m = input().split()\nhh, mm = [int(h), int(m)]\n\nns = 0\nwhile True:\n if \"7\" in h or \"7\" in m:\n break\n\n mm -= s\n if 0 > mm:\n hh -= 1\n if hh == -1:\n hh = 23\n mm = 60 + mm\n \n ns += 1\n h = str(hh)\n m = str(mm)\n\nprint(ns)", "times = (int)(input())\r\narray = [int(i) for i in input().split()]\r\nx = 0\r\nwhile not str(array[0]).__contains__(\"7\") and not str(array[1]).__contains__(\"7\"):\r\n array[1] = array[1]-times\r\n if array[1]<0:\r\n array[0] = array[0]-1\r\n if array[0] < 0:\r\n array[0] = 23\r\n array[1] = 60+array[1]\r\n x = x + 1\r\nprint(x)\r\n\r\n", "n=int(input())\r\nh,m=input().split()\r\nh=int(h)\r\nm=int(m)\r\n\r\ndef ask(h,m):\r\n if '7' in str(h):\r\n return True\r\n else:\r\n if '7' in str(m):\r\n return True\r\n else:\r\n return False\r\n\r\ncount=0\r\nwhile ask(h,m)==False:\r\n m-=n\r\n #print('h,m',h,'',m,)\r\n count+=1\r\n #print('count',count)\r\n if m<0:\r\n m=(m+60)\r\n h-=1\r\n if h<0:\r\n h=(h+24)\r\n #print(count,' h,m',h,':',m)\r\nprint(count)", "t=int(input())\r\nh,m=map(int,input().split())\r\nA=list(str(h))\r\nB=list(str(m))\r\nc=0\r\nwhile('7' not in B and '7' not in A):\r\n\tm=m-t\r\n\tc=c+1\r\n\tif(m<0):\r\n\t\tm=60+m\r\n\t\th=h-1\r\n\t\tif(h<0):\r\n\t\t\th=24+h\r\n\tA=list(str(h))\r\n\tB=list(str(m))\r\nprint(c)\r\n", "x, y = int(input()), 0\nh, m = map(int, input().split())\nm += 60 * h\nfor y in range(999):\n if '7' in '%d%d' % divmod((m - x * y) % 1440, 60):\n break\nprint(y)", "def transferToMM( hh, mm ):\r\n minute = hh * 60 + mm\r\n return minute\r\ndef transferToHH( minute ):\r\n if minute < 0:\r\n minute = ( 24 * 60 ) + minute\r\n hh = ( minute // 60 ) % 24\r\n mm = minute % 60\r\n return [ hh, mm ]\r\ndef check( hh, mm ):\r\n for i in range( len( str( hh ) ) ):\r\n if str(hh)[i] == '7':\r\n return True\r\n for i in range( len( str( mm ) ) ):\r\n if str(mm)[i] == '7':\r\n return True\r\n return False\r\nstep = int( input() )\r\nhh, mm = input().split()\r\nhh = int( hh )\r\nmm = int( mm )\r\nanswer = 0\r\nwhile not check( hh, mm ):\r\n Time = transferToHH( transferToMM( hh, mm ) - step )\r\n #print( Time[0], Time[1] )\r\n hh = int( Time[0] )\r\n mm = int( Time[1] )\r\n #print( hh, mm )\r\n #if answer > 7:\r\n #break\r\n answer += 1\r\nprint( answer )\r\n", "x = int(input())\nh, m = [int(x) for x in input().split()]\n\nans = 0\nwhile h % 10 != 7 and m % 10 != 7:\n if m < x:\n h -= 1\n h %= 24\n m -= x\n m %= 60\n ans += 1\n\nprint(ans)\n ", "def sev(k):\r\n return k//10 == 7 or k % 10 == 7\r\n\r\ndef check(k):\r\n return sev(k//60) or sev(k%60)\r\n\r\nx = int(input())\r\na = input()\r\na = list(a.split(' '))\r\nh = int(a[0])\r\nm = int(a[1])\r\ntime = h * 60 + m\r\nhappy = time\r\nans = 0\r\nwhile check(happy) == False:\r\n happy -= x\r\n ans += 1\r\n if happy < 0:\r\n happy += 24*60\r\nprint(ans)\r\n", "n = int(input())\r\nh,m = list(map(int,input().split()))\r\ncount = 0\r\nwhile(True):\r\n if(h%10==7 or h//10==7 or m%10==7 or m//10==7):\r\n break\r\n m = m-n\r\n count = count +1\r\n if(m<0):\r\n h = h-1\r\n m = m+60\r\n if h<0:\r\n h = h+24\r\nprint(count)\r\n\r\n\r\n#UPSOLVED", "x=int(input())\r\na=[int(y) for y in input().split()]\r\ncount=0\r\nwhile((\"7\" not in str(a[0]))and(\"7\" not in str(a[1]))):\r\n a[1]=a[1]-x\r\n if(a[1]<0):\r\n a[1]=a[1]+60\r\n a[0]=a[0]-1\r\n if(a[0]<0):\r\n a[0]=a[0]+24\r\n count=count+1\r\nprint(count)", "from sys import stdin, stdout\r\nInput = []\r\nInput = [stdin.readlines()]\r\nInput = Input[0]\r\nInput = [x.split(\" \") for x in Input]\r\nx = int(Input[0][0])\r\nhh = int(Input[1][0])\r\nmm = int(Input[1][1])\r\nfor y in range(1000):\r\n\tcurrenttime = hh*60+mm\r\n\talarm = (currenttime - x*y) % 1440\r\n\thh1 = int(alarm/60)\r\n\tmm1 = alarm - hh1*60\r\n\tif \"7\" in str(hh1)+str(mm1):\r\n\t\tstdout.write(str(y))\r\n\t\tbreak", "n = int(input())\r\nh,m = map(int,input().split())\r\nc = 0\r\nif \"7\" in str(h) or \"7\" in str(m):\r\n print(\"0\")\r\nelse:\r\n while (\"7\" not in str(m)) and (\"7\" not in str(h)):\r\n m -= n\r\n c += 1\r\n if m < 0:\r\n m = 60 + m \r\n h -= 1 \r\n if h < 0:\r\n h = 24 + h\r\n \r\n print(c)", "x=int(input())\r\nh,m=map(int,input().split())\r\nif \"7\" in str(h) or \"7\" in str(m):\r\n\tprint(0)\r\nelse:\r\n\tc=0\r\n\twhile not(\"7\" in str(h) or \"7\" in str(m)):\r\n\t\tif m>=x:\r\n\t\t\tm-=x\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tm=60+(m-x)\r\n\t\t\th-=1\r\n\t\t\tc+=1\r\n\tprint(c)", "n = int(input())\r\nhh, mm = map(int, input().split())\r\nnum = 0\r\nwhile \"7\" not in str(hh) and \"7\" not in str(mm):\r\n mm -= n\r\n if mm < 0:\r\n mm += 60\r\n mm = mm % 60\r\n hh -= 1\r\n if hh < 0:\r\n hh = 23\r\n\r\n num += 1\r\n\r\n\r\nprint(num)", "x=int(input())\nh,m=input().split()\nif \"7\" in h or '7' in m:\n print(0)\nelse:\n h=int(h)\n m=int(m)\n c=h*60+m\n for i in range(1,100000):\n c=c-x\n if c<=0:\n c=24*60+c\n if '7' in str(c % 60) or '7' in str(c//60) :\n print(i)\n break\n\n\n", "x = int(input())\r\nh, m, = map(int, input().split(' '))\r\ncount = 0\r\nwhile \"7\" not in str(h) + str(m):\r\n if m-x < 0:\r\n if h == 0:\r\n h = 23\r\n else:\r\n h -= 1\r\n m = (60 + m - x)\r\n else:\r\n m -= x\r\n count += 1\r\nprint(count)", "x = int(input())\r\nh,m = input().split()\r\nh = int(h)\r\nm = int(m)\r\ndef check(hours,minutes):\r\n if (hours//10==7) or (hours%10==7) or (minutes%10==7):\r\n return 1\r\n else:\r\n return 0\r\ni = 0 \r\nwhile (check(h,m)!=1):\r\n i+=1\r\n m = m-x;\r\n if m<0:\r\n h = h-1\r\n m = m+60\r\n if h<0:\r\n h=h+24\r\nprint(i)\r\n", "'''input\r\n34\r\n09 24\r\n'''\r\n\r\ndef lucky(h,m):\r\n\treturn '7' in str(h) or '7' in str(m)\r\n\r\nx=int(input())\r\nh,m=[str(i) for i in input().split(\" \")]\r\nc=0\r\nwhile not lucky(h,m):\r\n\tif int(m)<x:\r\n\t\th=int(h)-1\r\n\t\th%=24\r\n\t\th=str(h)\r\n\t\tm=int(m)\r\n\t\tm-=int(x)\r\n\t\tm+=60\r\n\t\tm=str(m)\r\n\t\t#t=60-x\r\n\t\t#m=str(t)\r\n\telse:\r\n\t\tm=int(m)\r\n\t\tm-=x\r\n\t\tm=str(m)\r\n\tc+=1\r\n\t#print(h,m)\r\nprint(c)", "x=int(input())\r\na=[i for i in range(60)]\r\nh,m=map(int,input().split())\r\nstr_h=str(h)\r\nstr_m=str(m)\r\nans=0\r\nwhile \"7\" not in str_h and \"7\" not in str_m:\r\n m-=x\r\n if m<0:\r\n m=a[m]\r\n h-=1\r\n str_m=str(m)\r\n str_h=str(h)\r\n ans+=1\r\nprint(ans)", "x=int(input())\r\na,b=map(int,input().split())\r\nif(a==0 and b==0):\r\n a=24\r\ns=0\r\nto=a*60+b\r\nwhile(1):\r\n a=to//60\r\n b=to%60\r\n # print(a,b)\r\n if('7' in str(a) or'7' in str(b)):\r\n print(s)\r\n quit()\r\n else:\r\n to-=x\r\n s+=1", "x=int(input())\r\nh,m=map(int,input().split())\r\nc=0\r\n\r\nif '7' in str(h) or '7' in str(m):\r\n print(0)\r\nelse:\r\n while True:\r\n \r\n if (m-x)>=0:\r\n m=m-x\r\n c=c+1\r\n else:\r\n m=60-(abs(m-x))\r\n if h==0:\r\n h=23\r\n else:\r\n h=h-1\r\n c=c+1\r\n d=str(h)\r\n f=str(m)\r\n if '7' in d or '7' in f:\r\n break\r\n print(c)\r\n", "x = int(input())\r\nh, m = map(int, input().split())\r\nans = 0\r\n\r\nwhile (True):\r\n\ts = str(h)+str(m)\r\n\tif (s.find('7') != -1):\r\n\t\tprint(ans)\r\n\t\texit(0)\r\n\tm = m-x\r\n\tif (m < 0):\r\n\t\tm = m+60\r\n\t\th = h-1\r\n\t\tif (h < 0):\r\n\t\t\th = 23\t\r\n\tans = ans+1", "x = int(input())\r\nh, m = map(int, input().split())\r\nf = 0\r\nif '7' in str(h) + str(m):\r\n print(f)\r\nelse:\r\n k = h * 60 + m\r\n s = str(k // 60).rjust(2, '0') + str(k - h * 60).rjust(2, '0')\r\n while '7' not in s:\r\n if k - x < 0:\r\n k = 23 * 60 + (60 - (x - k))\r\n s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')\r\n f += 1\r\n else:\r\n k -= x\r\n s = str(k // 60).ljust(2, '0') + str(k - (k // 60) * 60).ljust(2, '0')\r\n f += 1\r\n print(f)\r\n", "# your code goes here\r\ndef isLucky(num):\r\n while num > 1 :\r\n if num%10==7:\r\n return True\r\n num = num//10\r\n return False\r\n\r\nx = int(input())\r\nhh, mm = map(int, input().split())\r\ncount = 0\r\nif hh%10 == 7 or mm%10 ==7:\r\n print(count)\r\nelse:\r\n while True:\r\n mm = mm-x\r\n if mm < 0:\r\n mm = 60 + mm\r\n hh = hh - 1\r\n if hh < 0:\r\n hh = 23\r\n count += 1\r\n if hh%10 == 7 or mm%10 ==7:\r\n break\r\n print(count)", "interval = int(input().strip())\r\n\r\nhh, mm = map(int, input().strip().split())\r\n\r\n#print(hh, mm, interval)\r\n\r\n# do by simulation\r\n\r\ndef countDown(x):\r\n global hh, mm\r\n mm -= x\r\n if mm < 0:\r\n mm += 60\r\n hh -= 1\r\n if hh < 0:\r\n hh += 24\r\n\r\ndef check_lucky(hh, mm):\r\n return '7' in str(hh) + str(mm)\r\n\r\ncount = 0\r\n\r\nwhile not check_lucky(hh, mm):\r\n #print(hh, ':', mm)\r\n countDown(interval)\r\n count += 1\r\n\r\nprint(count)", "def lucky(n):\r\n n = str(n)\r\n if len(n) != 2:\r\n n = '0' + n\r\n return n[0] == '7' or n[1] == '7'\r\n\r\nx = int(input())\r\nh, m = [int(j) for j in input().split()]\r\ncount, minutes = 0, h * 60 + m\r\nwhile lucky(h) == False and lucky(m) == False:\r\n minutes -= x\r\n if minutes <= 0:\r\n minutes = 1440 + minutes\r\n h = int(minutes / 60)\r\n m = minutes % 60\r\n if h == 24:\r\n h = 0\r\n count += 1\r\nprint(count)\r\n", "x = int(input())\r\nhh, mm = map(int, input().split())\r\n\r\nans = 0\r\nwhile '7' not in str(hh) + str(mm):\r\n ans += 1\r\n mm -= x\r\n if mm < 0:\r\n mm += 60\r\n hh = (hh - 1) % 24\r\n\r\nprint(ans)\r\n", "x=int(input())\r\nhh,mm=map(int,input().split())\r\ncount=0\r\nwhile \"7\" not in str(hh)+str(mm):\r\n if mm-x<0:\r\n mm=60+mm-x\r\n hh-=1 \r\n if hh<0:\r\n hh=23\r\n else:\r\n mm-=x\r\n count+=1\r\nprint(count)", "x, (hh, mm) = int(input()), map(int, input().split())\r\nt = hh * 60 + mm\r\ncnt = 0\r\n\r\nwhile '7' not in str(t // 60) + str(t % 60):\r\n t = (t + 1440 - x) % 1440\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "# x = 3\n# desired_str = \"11 23\"\n\n# x = 5\n# desired_str = \"01 07\"\n\nx = int(input())\ndesired_str = input()\npresses = 0\n\n\ndesired = [int(i) for i in desired_str.split()]\n\nwhile True:\n\tif desired_str.find(\"7\") >= 0:\n\t\tbreak\n\telse:\n\t\tdesired[1] -= x\n\t\tif desired[1] < 0:\n\t\t\tdesired[0] -= 1\n\t\t\tdesired[1] += 60\n\t\tpresses += 1\n\t\tdesired_str = \" \".join([str(i) for i in desired])\n\n\t\nprint(presses)\n", "x=int(input())\r\nhh,mm=map(int,input().split())\r\ny=0\r\nwhile 1:\r\n if hh%10==7 or mm%10==7:break\r\n mm-=x\r\n if mm<0:\r\n mm+=60\r\n hh-=1\r\n if hh<0:hh=23\r\n y+=1\r\nprint(y)", "x = int(input())\nh, m = (int(i) for i in input().split())\nc = 0\nwhile True:\n if \"7\" in str(m) or \"7\" in str(h):\n break\n\n else:\n m -= x\n c += 1\n if m < 0:\n m += 60\n h -= 1\n\n if h < 0:\n h += 24\n\nprint(c) \n", "x=int(input())\r\nhh,mm=map(str,input().split())\r\nflag=0\r\ncount=0\r\nwhile(flag==0):\r\n if('7' in hh or '7' in mm):\r\n flag=1\r\n break\r\n else:\r\n mm=str(int(mm)-x)\r\n if(int(mm)<0):\r\n mm=str(60+int(mm))\r\n hh=str(int(hh)-1)\r\n if(int(hh)<0):\r\n hh=str(23)\r\n count+=1\r\n\r\nprint(count)\r\n\r\n", "n = int(input())\r\nh, m = [int(z) for z in input().split()]\r\nif \"7\" in str(h) or \"7\" in str(m):\r\n print(0)\r\n exit(0)\r\ndef time(x):\r\n t = x // 60\r\n m = x % 60\r\n return t, m\r\ncur = h * 60 + m\r\ncnt = 0\r\nwhile True:\r\n cur -= n\r\n cnt += 1\r\n if cur < 0:\r\n cur += 24 * 60\r\n a, b = time(cur)\r\n if \"7\" in str(a) or \"7\" in str(b):\r\n print(cnt)\r\n exit(0)", "x = int(input())\r\nt = input().split()\r\nh, m = int(t[0]), int(t[1])\r\ni = 0\r\nwhile True:\r\n\tif '7' in str(h) or '7' in str(m):\r\n\t\tprint(i)\r\n\t\texit(0)\r\n\tm -= x\r\n\tif m < 0:\r\n\t\tm += 60\r\n\t\th -= 1\r\n\tif h < 0:\r\n\t\th += 24\r\n\ti += 1", "def counting(hour,minu,inc):\r\n count=0\r\n h=hour\r\n m=minu\r\n x=inc\r\n flag=1\r\n while(flag):\r\n if '7' in str(m) or '7' in str(h):\r\n print(count)\r\n flag=0\r\n else:\r\n if (m-x)<0:\r\n temp=m-x\r\n tem=60+temp\r\n m=tem\r\n if(h-1)<0:\r\n h=23\r\n else:\r\n h-=1\r\n count+=1\r\n else:\r\n m-=x\r\n count+=1\r\nx=int(input().strip())\r\nh,m=[int(t) for t in input().strip().split(' ')]\r\ncounting(h,m,x)", "def check(a, b):\r\n a = str(a) + str(b)\r\n for elem in a:\r\n if elem == \"7\":\r\n return True\r\n return False\r\ndef last(x):\r\n global h, m\r\n time = h * 60 + m\r\n time -= x\r\n time %= 1440\r\n m = time % 60\r\n h = time // 60\r\nx = int(input())\r\ncnt = 0\r\nh, m = map(int, input().split())\r\nwhile (not check(h, m)):\r\n last(x)\r\n cnt += 1\r\nprint(cnt)", "from sys import stdin, stdout\r\n\r\ndef check_seven(h, m):\r\n\treturn h//10 == 7 or m//10 == 7 or h%10 == 7 or m%10 == 7\r\n\r\ndef change(h, m, x):\r\n\tif m >= x:\r\n\t\tm -= x\r\n\telse:\r\n\t\tm = 60 - x + m\r\n\t\tif h == 0:\r\n\t\t\th = 23\r\n\t\telse:\r\n\t\t\th -= 1\r\n\r\n\treturn h, m\r\n\r\nx = int(stdin.readline())\r\nh, m = map(int, stdin.readline().strip().split())\r\ncount = 0\r\nwhile not check_seven(h, m):\r\n\th, m = change(h, m, x)\r\n\tcount += 1\r\n\r\nprint(count)", "x = int(input())\n\nh, m = map(int, input().split())\n\nn = 0\nwhile \"7\" not in str(h) and \"7\" not in str(m):\n n += 1\n m -= x\n if m < 0:\n m += 60\n h -= 1\n if h < 0:\n h += 24\n\nprint(n)\n", "def dst(a, b):\r\n\tif (a <= b):\r\n\t\treturn b - a\r\n\treturn b - a + 60 * 24\r\n\r\nx = int(input())\r\nh, m = map(int, input().split())\r\n# print(h, m)\r\ncur = 60 * h + m\r\nans = 10**9\r\nfor H in range(24):\r\n\tfor M in range(60):\r\n\t\tif (str(H) + str(M)).count(\"7\"):\r\n\t\t\tif (dst(H * 60 + M, cur) % x == 0):\r\n\t\t\t\tans = min(ans, dst(H * 60 + M, cur) // x)\r\nprint(ans)", "x = int(input())\r\nhh, mm = map(int, input().split())\r\nm = (60 * 24 * 3) + mm + hh * 60\r\nc = 0\r\n\r\nwhile '7' not in '{}{}'.format((m // 60) % 24, m % 60):\r\n c += 1\r\n m -= x\r\n\r\nprint(c)\r\n", "x = int(input())\nhh, mm = map(int, input().split())\nans = 0\nwhile(1):\n\tif hh/10 == 7 or hh%10 ==7 or mm/10 == 7 or mm%10 == 7:\n\t\tbreak\n\tans+=1\n\tmm -= x\n\tif mm < 0:\n\t\tmm = 60 + mm\n\t\thh-=1\n\tif hh < 0:\n\t\thh = 23\nprint(ans)", "x = int(input())\r\nh,m = map(int, input().split())\r\nc, ttlmin = 0, h*60 + m\r\nwhile '7' not in str(ttlmin//60) + str(ttlmin % 60):\r\n ttlmin -= x\r\n c = c + 1\r\n if ttlmin < 0:\r\n ttlmin += 24*60\r\nprint(c)\r\n", "x = int(input())\r\nh, m = map(int, input().split())\r\n\r\ntimes = 0\r\nwhile (h != 7 and h != 17) and ((m % 10) != 7):\r\n\tm -= x\r\n\tif m < 0:\r\n\t\tm += 60\r\n\t\th -= 1\r\n\t\tif h < 0:\r\n\t\t\th += 24\r\n\ttimes += 1\r\nprint(times)", "def clock(a, b, n):\r\n b -= n\r\n if b < 0:\r\n if a > 0:\r\n a -= 1\r\n else:\r\n a = 23\r\n b %= 60\r\n return a, b\r\n\r\n\r\nx = int(input())\r\nh, m = map(int, input().split())\r\nc = 0\r\nwhile True:\r\n if '7' in str(h) or '7' in str(m):\r\n break\r\n h, m = clock(h, m, x)\r\n c += 1\r\nprint(c)", "x = int(input())\r\nh,m = map(int, input().split())\r\nans = 0\r\nwhile 1:\r\n if '7' in str(h) + str(m):\r\n break\r\n ans += 1\r\n if m >= x:\r\n m -= x\r\n else:\r\n m = 60 - (x-m)\r\n h -= 1\r\n if h == -1:\r\n h = 23\r\nprint(ans)", "n = int(input().strip())\r\nh, m = map(int, input().split())\r\ncount = 0\r\nwhile '7' not in str(h)+str(m):\r\n m -= n\r\n if m < 0:\r\n h -= 1\r\n m += 60\r\n count += 1\r\nprint(count)\r\n", "import datetime\r\n\r\nx = int(input())\r\nhh, mm = [int(i) for i in input().split()]\r\n\r\ntime = datetime.time(hh, mm, 0, 0)\r\ncount = 0\r\n\r\nwhile '7' not in str(time):\r\n count += 1\r\n date = datetime.datetime.combine(datetime.datetime.today(), time) - datetime.timedelta(minutes=x)\r\n time = date.time()\r\n\r\nprint(count)\r\n", "x=int(input())\r\na,b=[str(s) for s in input().split()]\r\na=int(a)\r\nb=int(b)\r\nh=str(a)\r\nm=str(b)\r\ni=0\r\nwhile('7' not in h and '7' not in m):\r\n\tb=b-x\r\n\tif(b<0):\r\n\t\tb=59+b+1\r\n\t\ta=a-1\r\n\t\tif(a<0):\r\n\t\t\ta=23\r\n\ti+=1\r\n\th=str(a)\r\n\tm=str(b)\r\nprint(i)", "import datetime as dt\n\nx = int(input())\nhh, mm = map(int, input().split())\n\nwake_time = dt.datetime.now().replace(hour=hh, minute=mm, second=0, microsecond=0)\ndelta = dt.timedelta(minutes=x)\n\ni = 0\nwhile True:\n if '7' in wake_time.strftime(\"%H:%M\"):\n break\n\n wake_time = wake_time - delta\n i += 1\n\nprint(i)\n", "X, N = int(input()), 0\r\nTime = list(map(int, input().split()))\r\nTimeToMinutes = Time[0] * 60 + Time[1]\r\nwhile True:\r\n Hour, Min = str(TimeToMinutes // 60), str(TimeToMinutes % 60)\r\n if '7' in Hour or '7' in Min:\r\n break\r\n N += 1\r\n TimeToMinutes -= X\r\n if TimeToMinutes < 0:\r\n TimeToMinutes = 24 * 60 + TimeToMinutes\r\nprint(N)\r\n\r\n# A new start\r\n", "x, v = int(input()), 0\r\nh, m = map(int, input().split())\r\nwhile '7' not in (str(h) + str(m)):\r\n m -= x\r\n if m < 0:\r\n m += 60\r\n h -= 1\r\n if h < 0:\r\n h += 24\r\n v += 1\r\nprint(v)", "x = int(input())\r\nh, m = map(int, input().split())\r\ny = 0\r\nwhile not (h % 10 == 7 or m % 10 == 7):\r\n m -= x\r\n if m < 0:\r\n h -= 1\r\n m = 60 + m\r\n if h < 0:\r\n h = 24 + h\r\n y += 1\r\nprint(y)\r\n", "x=int(input())\r\nh,m=map(int,input().strip().split())\r\nresult=0\r\nwhile True:\r\n if h%10==7 or m%10==7:\r\n break\r\n if m-x<0:\r\n if h==0:\r\n h=23\r\n else:\r\n h=h-1\r\n m=60-(x-m)\r\n else:\r\n m=m-x\r\n result=result+1\r\nprint(result)\r\n" ]

[ "y,w=map(int,input().split())\r\nprobability=[\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nprint(probability[max(y,w)])", "a,b = map(int,input().split())\nv = max(a,b)\nv = (6-v)+1\nif(v==1):\n print(\"1/6\")\nelif(v==2):\n print(\"1/3\")\nelif(v==3):\n print(\"1/2\")\nelif(v==4):\n print(\"2/3\")\nelif(v==5):\n print(\"5/6\")\nelse:\n print(\"1/1\")\n", "m = max(list(map(int,input().split())))\r\nif m==1: print('1/1')\r\nelif m==2: print('5/6')\r\nelif m==3: print('2/3')\r\nelif m==4: print('1/2')\r\nelif m==5: print('1/3')\r\nelse: print('1/6')", "from fractions import Fraction\r\ny,w=map(int,input().split())\r\nm=max(y,w)\r\nc=0\r\nfor i in range(m,7):\r\n c=c+1\r\nif c==0:\r\n print(\"0/1\")\r\nelif c==1:\r\n print(\"1/6\")\r\nelif c==2:\r\n print(\"1/3\")\r\nelif c==3:\r\n print(\"1/2\")\r\nelif c==4:\r\n print(\"2/3\")\r\nelif c==5:\r\n print(\"5/6\")\r\nelif c==6:\r\n print(\"1/1\")", "# Author: José Rodolfo (jric2002)\r\ny, w = list(map(int, input().split(\" \")))\r\nd = 6\r\nn = d - max(y, w) + 1\r\ni = 2\r\nwhile (i <= n):\r\n if ((n % i) == 0 and (d % i) == 0):\r\n n = int(n / i)\r\n d = int(d / i)\r\n else:\r\n i += 1\r\nprint(n, d, sep=\"/\")", "lis = ['1/6', '1/3', '1/2', '2/3', '5/6', '1/1']\r\ninput = input()\r\ninput = input.split()\r\nY = int(input[0])\r\nW = int(input[1])\r\nprint(lis[6-(max(Y,W))])", "from fractions import Fraction\n\nthrows_of_dice = [int(i) for i in input().split()]\n\nmaximum = max(throws_of_dice)\nhigher_numbers_that_can_get = 7 - maximum\n\nprobability = Fraction(higher_numbers_that_can_get, 6)\n\nif probability == 0:\n probability = \"0/1\"\nif probability == 1:\n probability = \"1/1\"\nprint(probability)\n \t\t\t \t \t\t \t\t\t \t\t \t\t\t \t \t\t", "from fractions import gcd\r\nx, y = map(int,input().split())\r\nd = 6-max(x,y)+1\r\nf = gcd(d,6)\r\nd = int(d/f)\r\na = int(6/f)\r\nprint (str(d)+\"/\"+str(a))", "y,w=list(map(int,input().split()))\nprint ('2' if max(y,w) is 3 else '5' if max(y,w) is 2 else '1',\"/\", sep=\"\", end=\"\")\nprint ('1' if max(y,w) is 1 else '2' if max(y,w) is 4 else '3' if max(y,w) is 5 or max(y,w) is 3 else '6')\n \t \t\t \t \t \t \t \t \t \t", "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) ]))\ndef invr():\n return(map(int,input().split()))\n\nl = inlt()\n\np = max(l)\n\nif(p == 1):\n print(\"1/1\")\nelif(p == 2):\n print(\"5/6\")\nelif(p == 3):\n print(\"2/3\")\nelif(p == 4):\n print(\"1/2\")\nelif(p == 5):\n print(\"1/3\")\nelse:\n print(\"1/6\")\n", "def main():\r\n y,w=[int(x) for x in input().split()]\r\n temp=max(y,w)\r\n ans=7-temp\r\n if ans==1:\r\n print('1/6')\r\n elif ans==2:\r\n print('1/3')\r\n elif ans==3:\r\n print('1/2')\r\n elif ans==4:\r\n print('2/3')\r\n elif ans==5:\r\n print('5/6') \r\n elif ans==6:\r\n print('1/1') \r\n \r\nmain()", "a, b = input().split()\r\na, b = int(a), int(b)\r\nd = 6\r\nif a > b:\r\n c = 6 - a + 1\r\nelse:\r\n c = 6 - b + 1\r\nfor i in range(2, 4):\r\n if d % i == 0 and c % i == 0:\r\n d = int(d / i)\r\n c = int(c / i)\r\nprint(f\"{c}/{d}\")\r\n", "a,b=map(int,input().split())\r\ns=[\"0/1\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nd=max(a,b)\r\nprint(s[d])", "val = input().split()\r\ndata = [int(x) for x in val]\r\n\r\n\r\nnum = 7 - max(data)\r\ndenom = 6\r\n\r\nfor i in range(2,num+1):\r\n\tif num%i==0 and denom%i==0:\r\n\t\tnum/=i\r\n\t\tdenom/=i\r\nprint('{0}/{1}'.format(int(num),int(denom)))", "\"\"\"\r\nIIIIIIIIII OOOOOOOOOOO IIIIIIIIII\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\nIIIIIIIIII OOOOOOOOOOO IIIIIIIIII\r\n\"\"\"\r\na, b = map(int, input().split())\r\nc = 6 - max(a, b) + 1\r\nif c == 6:\r\n\tprint(\"%d/%d\" %(1, 1))\r\nelif c % 2 == 0 and 6 % 2 == 0:\r\n\tprint(\"%d/%d\" %(c/2, 6/2))\r\nelif c % 3 == 0 and 6 % 3 == 0:\r\n\tprint(\"%d/%d\" %(c/3, 6/3))\r\nelse:\r\n\tprint(\"%d/%d\" %(c, 6))\r\n\r\n\r\n", "from math import gcd\r\nx, y = map(int, input().split())\r\na, b = 6 - max(x, y) + 1, 6\r\nwhile gcd(a, b) != 1:\r\n j = gcd(a, b)\r\n a, b = a // j, b // j\r\nprint('{0}/{1}'.format(a, b))\r\n\r\n\r\n", "\r\ndef main():\r\n count_of_edges = 6\r\n edges_left = count_of_edges\r\n raw_array = input().split(\" \")\r\n yakko = int(raw_array[0])\r\n wakko = int(raw_array[1])\r\n if yakko > wakko:\r\n edges_left -= yakko\r\n else:\r\n edges_left -= wakko\r\n edges_left += 1\r\n nod_of_left_and_count = nod(edges_left,count_of_edges)\r\n print(\"%d/%d\" % (edges_left/nod_of_left_and_count,count_of_edges/nod_of_left_and_count))\r\n\r\n\r\ndef nod(a, b):\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n return a+b\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\r\nx=list(input())\r\n#print(x)\r\ny=int(x[0])\r\nw=int(x[2])\r\nz=max(y,w)\r\nc1=6-z+1\r\nz1=6\r\nd=math.gcd(c1, z1)\r\n#print(d)\r\nprint(str(c1//d)+'/'+str(z1//d))", "y,w=map(int,input().split())\r\nprob=['','1/1','5/6','2/3','1/2','1/3','1/6']\r\nc=max(y,w)\r\nprint(prob[c])", "from fractions import Fraction\ny, w = [int(i) for i in input().split()]\ngreater = max(y, w)\ngreaters = 6 - greater + 1\nresult = Fraction(greaters, 6)\nif result.denominator == 1:\n print(str(result.numerator) + '/1')\nelse:\n print(result)\n", "y, w = [int(x) for x in input().split()]\r\nnum = 7 - max(y, w)\r\nden = 6\r\nif num%2 == 0:\r\n num = num/2\r\n den = den/2\r\nif num%3 == 0:\r\n num = num/3\r\n den = den/3\r\n \r\n\r\nprint(f'{int(num)}/{int(den)}')", "from unittest import result\r\n\r\nfirst_line = input().split()\r\ny , w = first_line\r\nmaximum = max(y,w)\r\nresult = int(maximum)-1\r\n\r\n\r\nprobability = [\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nprint(probability[int(result)])", "def chance(x):\r\n if (x == 1):\r\n print('1/1')\r\n elif (x == 2):\r\n print('5/6')\r\n elif (x == 3):\r\n print('2/3')\r\n elif (x == 4):\r\n print('1/2')\r\n elif (x == 5):\r\n print('1/3')\r\n elif (x == 6):\r\n print('1/6')\r\n else:\r\n print('0/1')\r\n\r\nY, W = map(int, input().split())\r\n\r\nif (Y >= W):\r\n chance(Y)\r\nelse:\r\n chance(W)\r\n\r\n\r\n \r\n", "from fractions import Fraction\r\n\r\ny, w = map(int, input().split())\r\n\r\nNumerator = 7-max(y,w)\r\nDenominator = 6\r\n\r\ntemp = Numerator/Denominator\r\nif Numerator == 0: print(\"0/1\")\r\nelif Numerator == Denominator: print(\"1/1\")\r\nelse:\r\n x = Fraction(Numerator, Denominator)\r\n print(x)", "a, b = map(int, input().split())\r\nif 6 - max(a, b) == 0 or 6 - max(a, b) == 4:\r\n print(str(6 - max(a, b) + 1) + '/' + '6')\r\nelif 6 - max(a, b) == 1 or 6 - max(a, b) == 3:\r\n print(str((6 - max(a, b) + 1) // 2) + '/' + '3')\r\nelif 6 - max(a, b) == 2:\r\n print('1' + '/' + '2')\r\nelse:\r\n print('1' + '/' + '1')", "from math import gcd\r\nrolls=list(map(int, input().split()))\r\nmaximum=max(rolls)\r\nsuccessful=6-maximum+1\r\ndenominator=6\r\nwhile gcd(successful, denominator)!=1:\r\n temp=successful\r\n successful=successful//gcd(successful, denominator)\r\n denominator=denominator//gcd(temp, denominator)\r\nprint(str(successful)+'/'+str(denominator))", "from math import gcd\n\na, b = map(int, input().split())\nc = 7 - max(a, b)\nd = gcd(c, 6)\nprint(f\"{c // d}/{6 // d}\")\n# Sat Apr 16 2022 15:36:29 GMT+0000 (Coordinated Universal Time)\n", "from fractions import Fraction\r\nw, y = map(int, input().split())\r\nnum = 6 - max(w, y) + 1\r\nif num == 6:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(num, 6))", "a = [int(i) for i in input().split()]\r\nb = 6\r\nc = 0\r\nc = b + 1 - max(a) \r\nif a[0]==0 or a[1]==0: \r\n print('0/1')\r\nelif c // b ==1: \r\n print('1/1')\r\nelse:\r\n if c % 2 ==0: \r\n print(int(c/2),'/',int(b/2), sep='')\r\n elif c % 3 ==0: \r\n print(int(c/3),'/',int(b/3), sep='')\r\n else: \r\n print(c,'/',b, sep='')", "x,y = input().split()\r\nx, y = int(x), int(y)\r\n\r\nmx = max(x,y)\r\n\r\no = 7-mx\r\n\r\nif o == 1:\r\n print(\"1/6\")\r\nelif o == 2:\r\n print(\"1/3\")\r\nelif o == 3:\r\n print(\"1/2\")\r\nelif o == 4:\r\n print(\"2/3\")\r\nelif o == 5:\r\n print(\"5/6\")\r\nelif o == 6:\r\n print(\"1/1\")", "from fractions import Fraction as f\r\na = max(map(int, input().split()))\r\nif a != 1:\r\n print(f(7-a,6))\r\nelse:\r\n print('1/1')", "num = 7-max(map(int,input().split()))\r\nif 6%num==0:\r\n print(\"1/\"+str(int(6/num)))\r\nelif(6 % (num / 2)==0):\r\n print(str(int(num/(num/2)))+\"/\"+str(int(6/(num/2))))\r\nelse:\r\n print(str(num)+\"/6\")\r\n\r\n", "a,b=map(int,input().split(' '))\r\nx=max(a,b)-1\r\na=['1/1','5/6','2/3','1/2','1/3','1/6']\r\nprint(a[x])\r\n", "y,w=map(int,input().split())\r\nmaxi=max(y,w)\r\nval=((6-maxi)+1)/6\r\nif val==(1/6):\r\n print(\"1/6\")\r\nelif val==(2/6):\r\n print(\"1/3\")\r\nelif val==(3/6):\r\n print(\"1/2\")\r\nelif val==(4/6):\r\n print(\"2/3\")\r\nelif val==(5/6):\r\n print(\"5/6\")\r\nelif val==1:\r\n print(\"1/1\")\r\nelif val==0:\r\n print(\"0/1\")", "x=input()\r\n\r\n\r\ny=x.split()\r\n\r\n\r\na=int(y[0])\r\n\r\nb=int(y[1])\r\n\r\n\r\n\r\nif a>b:\r\n ma=7-a\r\nelse:\r\n ma=7-b\r\n\r\n\r\n\r\nif ma==1:\r\n print(\"1/6\")\r\n\r\nelif ma==2:\r\n print(\"1/3\")\r\n\r\nelif ma==3:\r\n print(\"1/2\")\r\n\r\nelif ma==4:\r\n print(\"2/3\")\r\n\r\nelif ma==5:\r\n print(\"5/6\")\r\n\r\nelse:\r\n print(\"1/1\")\r\n \r\n \r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Feb 3 10:59:19 2023\r\n\r\n@author: HASSNA\r\n\"\"\"\r\nx=[int (i) for i in input().split()]\r\nma=max(x)-1\r\nli=['1/1' , '5/6' , '2/3' , '1/2' , '1/3' , '1/6']\r\nprint(li[ma])\r\n", "def gcd(a, b):\r\n\tif(b == 1):\r\n\t\treturn a\r\n\telif(b % a == 0):\r\n\t\treturn a\r\n\telse:\r\n\t\treturn gcd(b%a, a)\r\n\r\n\r\nY, W = [int(x) for x in input().split()]\r\n\r\nhigh = max(Y, W)\r\ndivider = gcd(6 - high + 1, 6)\r\n\r\nprint(str((6 - high + 1)//divider) + \"/\" + str(6//divider))", "from fractions import Fraction \r\n\r\ny,w=map(int,input().split())\r\nm=max(y,w)\r\nx=6-m+1\r\nr=Fraction(x,6)\r\nif r>=1 or r==0:\r\n print(str(r)+\"/1\")\r\nelse:\r\n print(Fraction(x,6)) \r\n\r\n\r\n\r\n", "from math import gcd\r\n\r\na, b = map(int, input().split())\r\nnum, den = 6 - max(a, b) + 1, 6\r\ndiv = gcd(num, den)\r\nnum //= div\r\nden //= div\r\nprint(f'{num}/{den}')\r\n", "\r\ny, w = [int(x) for x in input().split()]\r\nmaxx=max(y,w)\r\nresult=(6-maxx+1)/6\r\nif result==1/6:\r\n print('1/6')\r\nelif result==2/6:\r\n print('1/3')\r\nelif result==3/6:\r\n print('1/2')\r\nelif result==4/6:\r\n print('2/3')\r\nelif result==5/6:\r\n print('5/6')\r\nelif result==1:\r\n print('1/1')\r\nelse:\r\n print('0/1')", "x,y= map(int,input().split())\r\nl=['1/1','5/6','2/3','1/2','1/3','1/6']\r\na=max(x,y)\r\nprint(l[a-1])\r\n\r\n", "y, w = map(int, input().split())\r\nx = 6 - max(y,w)+1\r\ns = 6\r\nfor i in range(7,1, -1):\r\n if s%i==0 and x%i==0:\r\n s//=i\r\n x//=i\r\nprint(str(x)+'/'+str(s))", "# https://codeforces.com/problemset/problem/9/A\r\n\r\ndef func_sol(raw_data):\r\n return str(['0/1', '1/1', '5/6', '2/3', '1/2', '1/3', '1/6'][max(map(int, raw_data.split()))])\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "s = max(list(map(int, input().split())))\r\np = (7-s)/6\r\nif p == 0:\r\n print(\"0/1\")\r\nelif p == 1/6:\r\n print(\"1/6\")\r\nelif p == 2/6:\r\n print(\"1/3\")\r\nelif p == 3/6:\r\n print(\"1/2\")\r\nelif p == 4/6:\r\n print(\"2/3\")\r\nelif p == 5/6:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "s = [\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\",\"0/1\"]\r\nt,w=map(int,input().split(\" \"))\r\nans = max(t , w)\r\nprint(s[ans-1])", "from fractions import Fraction\r\ny, w = map(int, input().split())\r\npt = 7 - max(y, w)\r\nans = Fraction(pt, 6)\r\nif ans == Fraction(1/1):\r\n print('1/1')\r\nelse:\r\n print(ans)\r\n", "a,b=map(int,input().split(\" \"))\nif a<b:\n t=b\nelse:\n t=a\nd=6\nc=d-t+1\np=d\nq=c\nwhile c!=0:\n s=d%c\n d=c\n c=s\nq=q//d\np=p//d\nprint(f'{q}/{p}')\n\n\t\t \t\t\t\t \t \t \t\t\t\t \t \t\t\t\t\t\t", "line = input().split()\n\ny = int(line[0])\nw = int(line[1])\n\ndot_numbers_need = 6 - max(y,w) +1\n\nif dot_numbers_need == 6:\n divide = '1/1' \n\n\nelif dot_numbers_need%2 == 0 :\n divide = f'{int(dot_numbers_need/2)}/{int(6/2)}'\nelif dot_numbers_need%3 == 0 :\n divide = f'{int(dot_numbers_need/3)}/{int(6/3)}'\nelse:\n divide = f'{int(dot_numbers_need)}/6'\n\nprint(divide)", "\r\ny,w=map(int,input().split())\r\n\r\n\r\nif y==w:\r\n if y==6:\r\n print('1/6')\r\n elif y==5:\r\n print('1/3')\r\n elif y == 4:\r\n print('1/2')\r\n elif y == 3:\r\n print('2/3')\r\n elif y == 2:\r\n print('5/6')\r\n elif y == 1:\r\n print('1/1')\r\n\r\nelse:\r\n\r\n m = max(y, w)\r\n if m == 6:\r\n print('1/6')\r\n elif m == 5:\r\n print('1/3')\r\n elif m == 4:\r\n print('1/2')\r\n elif m == 3:\r\n print('2/3')\r\n elif m == 2:\r\n print('5/6')\r\n elif m == 1:\r\n print('1/1')\r\n\r\n\r\n\r\n", "x,y = map(int,input().split())\r\nmx = max(x,y)\r\ni=7-mx\r\nu=6\r\nif i==6:\r\n print(\"1/1\")\r\nelif i%3==0:\r\n print(i//3,\"/\",u//3,sep='')\r\nelif i%2==0:\r\n print(i//2,\"/\",u//2,sep='')\r\nelif mx==6:\r\n print(i,\"/\",u, sep='')\r\nelif mx==2:\r\n print(i,\"/\",u, sep='')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jun 21 02:02:28 2020\r\n\r\n@author: ElAhwel\r\n\"\"\"\r\n\r\nnums = list(map(int , input().split()))\r\nprob = round( ((7-max(nums))/6) , 2)\r\ncount = 1\r\nfor i in range(1 , 7):\r\n for j in range (1 , 7):\r\n dev = round((i/j) , 2)\r\n sub = dev - prob\r\n if sub == 0 and count == 1:\r\n print('{}/{}'.format(i , j))\r\n count = 2 ", "x = input().split()\r\ny = 7\r\nz = (y - int(max(x)))\r\nif 6%z == 0:\r\n e = 6/z\r\n a = z/z\r\nelif z%2 == 0:\r\n e = 6/2\r\n a = z/2\r\nelse:\r\n e = 6\r\n a = z\r\n \r\nprint(str(a)[0]+'/'+str(e)[0])\r\n\r\n", "l1 = [int(num) for num in input().split()]\r\nY = l1[0]\r\nW = l1[1]\r\nif max(Y, W) == 1:\r\n print(\"1/1\")\r\nif max(Y, W) == 2:\r\n print(\"5/6\")\r\nif max(Y, W) == 3:\r\n print(\"2/3\")\r\nif max(Y, W) == 4:\r\n print(\"1/2\")\r\nif max(Y, W) == 5:\r\n print(\"1/3\")\r\nif max(Y, W) == 6:\r\n print(\"1/6\")\r\n", "y,w = input().split()\r\ny = int(y)\r\nw = int(w)\r\nno = max(y,w)\r\np = (6-no) + 1\r\nif p == 6:\r\n print(\"1/1\")\r\nelif p == 0:\r\n print(\"0/1\")\r\nelif p % 2 == 0:\r\n print(f\"{p//2}/3\")\r\nelif 6 % p == 0:\r\n print(f\"1/{6//p}\")\r\nelse:\r\n print(f\"{p}/6\")", "import sys\r\n\r\nINF = 2e18 + 99\r\n\r\ndef debug(n):\r\n print(n)\r\n\r\na, b = map(int, sys.stdin.readline().split())\r\n\r\nif max(a, b) == 1:\r\n print(\"1/1\")\r\nelif max(a, b) == 2:\r\n print(\"5/6\")\r\nelif max(a, b) == 3:\r\n print(\"2/3\")\r\nelif max(a, b) == 4:\r\n print(\"1/2\")\r\nelif max(a, b) == 5:\r\n print(\"1/3\")\r\nelse:\r\n print(\"1/6\")\r\n", "from math import gcd\r\n\r\n[y, w] = map(int, input().split(\" \"))\r\n\r\nwinning_chance = 7 - max(y, w)\r\n\r\ndivider = gcd(winning_chance, 6)\r\n\r\nprint(f\"{winning_chance/divider:.0f}/{6/divider:.0f}\")\r\n", "y, w = map(int, input().split())\r\nd = 7 - max(y, w)\r\nz = 6\r\nif d % 2 == 0:\r\n d //= 2\r\n z //= 2\r\nif d % 3 == 0:\r\n d //= 3\r\n z //= 3\r\nprint(d, \"/\", z, sep=\"\")\r\n\r\n", "n = 6 - (max(map(int, input().split())) - 1)\r\n \r\nd = {1:'1/6',\r\n 2:'1/3',\r\n 3:'1/2',\r\n 4:'2/3',\r\n 5:'5/6',\r\n 6:'1/1'}\r\n\r\nprint(d[n])", "x,y=map(int,input().split())\r\nif max(x,y)==6:\r\n print('1/6')\r\nelif max(x,y)==5:\r\n print('1/3')\r\nelif max(x,y)==4:\r\n print('1/2')\r\nelif max(x,y)==3:\r\n print('2/3')\r\nelif max(x,y)==2:\r\n print('5/6')\r\nelse:\r\n print('1/1')\r\n", "import math\r\na,b = map(int,input().split())\r\nm = math.gcd(a,b)\r\no = 7-max(a,b)\r\nk = math.gcd(6,o) \r\nprint(str(o//k) + '/' + str(6//k))\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ny, w = map(int, input().split())\r\nx = sum(1 if x >= max(y, w) else 0 for x in range(1, 7))\r\nmax_d = 1\r\nfor i in range(2, 7):\r\n if x % i == 0 and 6 % i == 0:\r\n max_d = i\r\nif x == 0:\r\n max_d = 6\r\n\r\nprint(f'{x // max_d}/{6 // max_d}')", "def gcd(a,b):\r\n if max(a,b) % min(a,b) != 0:\r\n return gcd(max(a,b)-min(a,b),min(a,b))\r\n else:\r\n return min(a,b)\r\n\r\na,b = map(int, input().split())\r\n\r\nx = 7-max(a,b)\r\nprint(str(int(x/gcd(x,6)))+'/'+str(int(6/gcd(x,6))))", "from math import gcd\r\npossible=[1, 2 ,3,4,5,6]\r\nscores = [int(_) for _ in input().split(' ')]\r\ntobeat=max(scores)\r\nfor x in possible:\r\n if x < tobeat:\r\n possible[possible.index(x)]=0\r\npossnumber = (len(possible)-possible.count(0))\r\nd = gcd(possnumber,6)\r\nprint(str(possnumber // d)+'/'+str(6 // d))", "numbers = list(map(int, input().split()))\r\nn=max(numbers)\r\nif n==6 :\r\n print(\"1/6\")\r\nelif n==5:\r\n print(\"1/3\")\r\nelif n==4:\r\n print(\"1/2\")\r\nelif n==3:\r\n print(\"2/3\")\r\nelif n==2:\r\n print(\"5/6\")\r\nelif n==1:\r\n print(\"1/1\")", "from math import gcd\na,b=map(int,input().split())\ng=gcd((7-max(a,b)),6)\nprint(str((7-max(a,b))//g)+\"/\"+str(6//g))\n\t\t\t \t\t\t \t \t\t\t\t\t\t \t\t\t", "m=0\r\nv=[(1/6),(2/6),(3/6),(4/6),(5/6),(1/1)]\r\nd=['1/6','1/3','1/2','2/3','5/6','1/1']\r\nx,y=[int(z) for z in input().split()]\r\nif x>y:\r\n c=x\r\nelse:\r\n c=y \r\n#print('c=',c) \r\nfor b in range(c,7):\r\n m=m+1\r\n s=m/6\r\n #print('m',m)\r\nfor a in v:\r\n if a==s:\r\n f=v.index(a)\r\n print(d[f])\r\n break\r\n ", "r = input().split()\r\ny = int(r[0])\r\nw = int(r[1])\r\nmax = max(y, w)\r\nf = {\r\n 6: \"1/6\",\r\n 5: \"1/3\",\r\n 4: \"1/2\",\r\n 3: \"2/3\",\r\n 2: \"5/6\",\r\n 1: \"1/1\",\r\n}\r\nresult = f[max]\r\nprint(result)\r\n", "import fractions as f\r\nA,B = map(int, input().split())\r\nC = max(A, B)\r\nD = (f.Fraction(1 - ((C-1) / 6)).limit_denominator()).as_integer_ratio()\r\nprint('{}/{}'.format(D[0], D[1]))\r\n\r\n", "from fractions import Fraction\nif __name__ == '__main__':\n a = Fraction(len(range(max(map(int, input().split())),7))/6).limit_denominator(6)\n if a == 1: a = '1/1'\n print(a)\n \n \n", "while True:\r\n try:\r\n a, b = map(int, input().split(' '))\r\n s = [i for i in range(max(a, b), 6+1)]\r\n if len(s) == 0:\r\n print(\"0/1\")\r\n elif len(s) == 1:\r\n print(\"1/6\")\r\n elif len(s) == 2:\r\n print(\"1/3\")\r\n elif len(s) == 3:\r\n print(\"1/2\")\r\n elif len(s) == 4:\r\n print(\"2/3\")\r\n elif len(s) == 5:\r\n print(\"5/6\")\r\n else:\r\n print(\"1/1\")\r\n except:\r\n break", "a,b=map(int,input().split())\r\nk=max(a,b)\r\nif k==1:\r\n\tprint(\"1/1\")\r\nelif k==2:\r\n\tprint(\"5/6\")\r\nelif k==3:\r\n\tprint(\"2/3\")\r\nelif k==4:\r\n\tprint(\"1/2\")\r\nelif k==5:\r\n\tprint(\"1/3\")\r\nelse:\r\n\tprint(\"1/6\")", "import math\r\nm,n = map(int,input().split())\r\nwinning = (6 - max(m,n)) + 1\r\ntotal = 6\r\ngcd = math.gcd(winning, total)\r\nprint(f\"{winning//gcd}/{total//gcd}\")", "from itertools import combinations\r\na, b = map(int, input().split())\r\nc = max(a, b)\r\nd = 6\r\ne = 7 - c\r\nif e % 2 + d % 2 == 0:\r\n\te //= 2\r\n\td //= 2\r\nif d % e == 0:\r\n\td //= e\r\n\te = 1\r\nprint(e, '/', d, sep='')\r\n", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\nx,y=map(int,input().split())\r\ns=6-max(x,y)+1\r\nt=gcd(s,6)\r\np=str(s//t)+\"/\"+str(6//t)\r\nprint(p)\r\n", "from fractions import *\r\ndata=input().split()\r\ny=int(data[0])\r\nw=int(data[1])\r\nlst=[y,w]\r\nsorted_list=sorted(lst,reverse=True)\r\n\r\nA=6-sorted_list[0]+1\r\nB=6\r\n\r\nz=Fraction(A,B)\r\n\r\nif z==1:\r\n print('1/1')\r\nelif z==0:\r\n print('0/1')\r\nelse:\r\n print(z)\r\n", "s = list(map(int, input().split(\" \")))\r\n\r\nc = 6 - max(s) + 1\r\nz = 6\r\n\r\nfor i in range(2, 4):\r\n if c % i == 0:\r\n c //= i\r\n z //= i\r\n\r\nprint(str(c) + \"/\" + str(z))", "import math\r\n\r\ndef reduce_fraction(n,m):\r\n k = math.gcd(n,m)\r\n return (n//k, m//k)\r\n\r\n\r\ny,w = map(int, input().split())\r\n\r\nall_sides = 6\r\n\r\nmax_value_of_two_previous_friends = max(y,w)\r\n\r\nall_probabilityes = list(range(max_value_of_two_previous_friends,7))\r\n\r\n\r\nprob = len(all_probabilityes)\r\nresult_with_dot = prob/all_sides\r\nresult = f\"{reduce_fraction(prob, all_sides)[0]}{'/'}{reduce_fraction(prob, all_sides)[1]}\"\r\n\r\n\r\nif result_with_dot == 1:\r\n print(f\"{1}{'/'}{1}\")\r\nelif result_with_dot == 0:\r\n print(f\"{0}{'/'}{1}\")\r\nelse:\r\n print(result)\r\n", "yakko, wakko = [int(x) for x in input().split()]\n\nm = max(yakko, wakko)\n\nif m == 6:\n print(\"1/6\")\nelif m == 5:\n print(\"1/3\")\nelif m == 4:\n print(\"1/2\")\nelif m == 3:\n print(\"2/3\")\nelif m == 2:\n print(\"5/6\")\nelse:\n print(\"1/1\")\n\n \t \t\t \t \t\t \t\t\t\t\t \t \t", "from fractions import Fraction\n\na,b = map(int, input().split())\n\nif a < b:\n a = b\n\nt = 6 - a + 1\n\nif t == 2:\n print(\"1/3\")\n quit()\n\nif t == 3:\n print(\"1/2\")\n quit()\n\nif t ==4:\n print(\"2/3\")\n quit()\n\nif t == 6:\n print(\"1/1\")\n quit()\n\nprint(str(t) + \"/6\")", "def max1(a):\r\n\tp = a[0]\r\n\tfor x in a:\r\n\t\tif x > p:\r\n\t\t\tp = x\r\n\treturn p\r\n\r\n\r\ndef prlist(a):\r\n\tfor x in a:\r\n\t\tprint(x, end = \" \")\r\n\t\t\t\r\n\r\ndef fakt(n):\r\n\tp = 1\r\n\tfor i in range(1, n + 1):\r\n\t\tp *= i\r\n\treturn p\r\n\r\n\t\t\t\r\n#row, col = list(map(int, input().split()))\r\n#a = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nk = max(a)\r\nt = 0\r\nfor i in range(1, 7):\r\n\tif i >= k:\r\n\t\tt += 1\r\np = 6\r\nfor i in range(6, 1, -1):\r\n\tif p % i == 0 and t % i == 0:\r\n\t\tp //= i\r\n\t\tt //= i\r\nprint(t, \"/\", p, sep = \"\")\r\n\t\t\r\n\t\t\r\n\t\t\r\n", "import fractions\nl = input().split()\nl1 = []\nfor m in l:\n l1.append(int(m))\n\nmaximum = max(l1)\n\nhi1 = fractions.gcd\nhi=hi1(6-maximum+1,6)\n\nprint(str(int((6-maximum+1)/hi))+'/'+str(int(6/hi)))", "from fractions import Fraction\r\ny,w=input().split()\r\ny=int(y)\r\nw=int(w)\r\nans=Fraction(6-max(y,w)+1,6)\r\nif ans==1:\r\n print('1/1')\r\nelse:\r\n print(ans)", "num=list(map(int,input().split()))\r\noutcomes=[1,2,3,4,5,6]\r\nnum.sort()\r\nf=num[1]\r\noutcome=outcomes[f-1:6]\r\ncount=len(outcome)\r\nfact_down=[6,3,2,1]\r\nfact_up=[1]\r\nif count%2==0:\r\n fact_up.append(2)\r\nif count % 3 == 0:\r\n fact_up.append(3)\r\nif count%6==0:\r\n fact_up.append(6)\r\nfact_up.reverse()\r\nnumerator=int(count/fact_up[0])\r\ndenominator=int(6/fact_up[0])\r\nprint(numerator, end=\"/\")\r\nprint(denominator)", "a,b=map(int,input().split())\r\ncount=0\r\nif a>=b:\r\n count=7-a\r\nelse:\r\n count=7-b\r\nif count==4:\r\n print(\"2/3\")\r\nelif count==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/\",int(6/count),sep=\"\")", "def answer():\r\n \r\n a = max([int(x) for x in input().split()])\r\n ans = (7-a)\r\n if ans ==1:\r\n print(\"1/6\")\r\n elif ans==2:\r\n print(\"1/3\")\r\n elif ans==3:\r\n print(\"1/2\")\r\n elif ans==4:\r\n print(\"2/3\")\r\n elif ans==5:\r\n print(\"5/6\")\r\n else:\r\n print(\"1/1\")\r\nanswer()\r\n", "from fractions import Fraction as f\r\n\r\ndef sol(x, y):\r\n m = max(x , y)\r\n l = len(list(range(m, 6+1)))\r\n fx = f(l, 6)\r\n return \"{}/{}\".format(fx.numerator, fx.denominator)\r\n\r\n\r\n# print(sol(4, 2))\r\n# print(sol(1, 2))\r\n# print(sol(1, 1))\r\n#\r\n# if __name__ == '__main__':\r\nx, y = list(map(int, input().split()))\r\nprint(sol(x, y))\r\n", "a, b = map(int, input().split(\" \"))\nnum = 6 - max(a, b) + 1\nden = 6\ndef gcd(x, y):\n if x == 0:\n return y\n return gcd(y % x, x)\ng = gcd(num, den)\nnum //= g\nden //= g\nprint(f\"{num}/{den}\")", "x = input()\nx = x.split()\nhigh = max(x)\nif high == '1':\n print('1/1')\nif high == '2':\n print('5/6')\nif high == '3':\n print('2/3')\nif high == '4':\n print('1/2')\nif high == '5':\n print('1/3')\nif high == '6':\n print('1/6')", "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\ny, w = inlt()\r\n\r\nn = 7 - max(y, w)\r\nd = 6\r\n\r\nif n % 2 == 0 and d % 2 == 0:\r\n n /= 2\r\n d /= 2\r\nif n % 3 == 0 and d % 3 == 0:\r\n n /= 3\r\n d /= 3\r\n\r\nn = int(n)\r\nd = int(d)\r\nprint(f'{n}/{d}')", "#!/usr/bin/env python3\r\n\r\nimport sys\r\ndef get_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\nY, W = get_ints()\r\nscore_to_beat = max(Y, W)\r\n\r\nif (score_to_beat == 1):\r\n print(\"1/1\")\r\nelif (score_to_beat == 2):\r\n print(\"5/6\")\r\nelif (score_to_beat == 3):\r\n print(\"2/3\")\r\nelif (score_to_beat == 4):\r\n print(\"1/2\")\r\nelif (score_to_beat == 5):\r\n print(\"1/3\")\r\nelif (score_to_beat == 6):\r\n print(\"1/6\")\r\n", "# LUOGU_RID: 128753451\ny,w = map(int,input().split())\r\nc = max(y,w)\r\nd = 6 - c + 1\r\nif d==1 : \r\n print(\"1/6\")\r\nif d==2 : \r\n print(\"1/3\")\r\nelif d==3 :\r\n print(\"1/2\")\r\nelif d==4 : \r\n print(\"2/3\")\r\nelif d==5 : \r\n print(\"5/6\")\r\nelif d==6 : \r\n print(\"1/1\")", "a, b = map(lambda x: int(x), input().split(\" \"))\n\nm = max(a, b)\n\np = 7 - m\n\nb = 6\n\nwhile (p % 2 == 0 and b % 2 == 0) or b % p == 0:\n if p % 2 == 0 and b % 2 == 0:\n p /= 2\n b /= 2\n elif b % p == 0:\n t = p\n p /= t\n b /= t\n break\n\nprint(str(int(p)) + \"/\" + str(int(b)))\n", "y, w = map(int,input().split())\r\n\r\nd = 6 - max(y,w) + 1\r\n\r\nnum = d\r\ndeno = 6\r\n\r\nfor i in range(6,0,-1):\r\n if(num%i==0 and deno%i==0):\r\n num//=i\r\n deno//=i\r\n \r\nprint(\"{}/{}\".format(num,deno))", "import math\r\n\r\ny,w = map(int,input().split())\r\nm = 7 - max(y,w)\r\nd = math.gcd(m,6)\r\n\r\nif m==6 :\r\n print(\"1/1\")\r\nelse :\r\n\r\n print (\"%d/%d\" % (m/d,6/d))", "from math import gcd\r\nfrom fractions import Fraction\r\na,b=map(int,input().split())\r\nc=7-max(a,b)\r\nd=gcd(c,6)\r\nprint(str(c//d)+'/'+str(6//d))\r\n", "def die_roll():\r\n a=max(list(map(int,input().split())))\r\n if a==1:print('1/1')\r\n if a==2:print('5/6')\r\n if a==3:print('2/3')\r\n if a==4:print('1/2')\r\n if a==5:print('1/3')\r\n if a==6:print('1/6')\r\ndie_roll()", "from math import gcd\n\n\ndef solve(y, w):\n p = 6 - max(y, w) + 1\n t = 6\n g = gcd(p, t)\n p //= g\n t //= g \n return f'{p}/{t}'\n\n\n\ndef main():\n y, w = list(map(int, input().split()))\n print(solve(y, w))\n\n\nmain()\n", "a, b = map(int, input().split())\r\nx = (6 - max(a, b) + 1)\r\ny = 6\r\nfor i in range(1, 6):\r\n if x % i == 0 and y % i == 0:\r\n x //= i\r\n y //= i\r\nprint(F'{x}/{y}')", "x,y=map(int, input().split() )\r\nt=max(x,y)\r\nlst=[\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nprint(lst[t-1])", "a,b = input().split(\" \")\r\na = int(a)\r\nb = int(b)\r\nprobability = [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nif a>b: print(probability[a])\r\nelse: print(probability[b])\r\n", "a,b = [int(x) for x in input().split()]\r\nm = max(a,b)\r\n\r\nchance = (6-m+1) / 6\r\nif chance ==1:\r\n print(\"1/1\")\r\nelif chance == 0.5:\r\n print(\"1/2\")\r\nelif chance == 0.8333333333333334:\r\n print(\"5/6\")\r\nelif chance == 0.6666666666666666:\r\n print(\"2/3\")\r\nelif chance == 0.5:\r\n print(\"1/2\")\r\nelif chance == 0.3333333333333333:\r\n print(\"1/3\")\r\nelif chance == 0.16666666666666666:\r\n print(\"1/6\")\r\nelse:\r\n print(\"0/1\")\r\n", "Yako,Wako=map(int,input().split())\r\nx=[1,2,3,4,5,6]\r\nx1=[]\r\nfor i in range(6):\r\n if x[i]>=max(Yako,Wako):\r\n x1.append(x[i])\r\nDot=len(x1)\r\nif 6%Dot==0:\r\n print(Dot//Dot,\"/\",6//Dot,sep='')\r\nelif Dot%2==0:\r\n print(Dot//2,\"/\",6//2,sep='')\r\nelse:\r\n print(Dot,\"/\",6,sep='')", "def gcd(x, y):\r\n if y == 0:\r\n return x\r\n else:\r\n return gcd(y, x % y)\r\n\r\n\r\ny, w = map(int, input().split(\" \"))\r\nmaxi = 7-max(y, w)\r\nif maxi != 0:\r\n x = gcd(6, maxi)\r\n if x != 1:\r\n print('{}/{}'.format(maxi//x, 6//x))\r\n else:\r\n print('{}/{}'.format(maxi, 6))\r\nelse:\r\n print(\"0/1\")\r\n", "from fractions import Fraction\r\ny,w=list(map(int,input().split()))\r\na=6-y\r\nb=6-w\r\nx=min(a,b)\r\ns=Fraction(x+1,6)\r\nif s==1 or s==0:\r\n print(s,end=\"\")\r\n print(\"/1\")\r\nelse:\r\n print(s)\r\n#print(Fraction(x+1,6))", "y, w = map(int, input().split(\" \"))\ni = max(y, w)\n#chances to win is (6 - (i - 1) / 6)\n\nif i == 1:\n print(\"1/1\")\nelif i == 2:\n print(\"5/6\")\nelif i == 3:\n print(\"2/3\")\nelif i == 4:\n print(\"1/2\")\nelif i == 5:\n print(\"1/3\")\nelif i == 6:\n print(\"1/6\")\n", "from math import floor\r\n\r\ninp = input().split()\r\nW = int(inp[0])\r\nY = int(inp[1])\r\n\r\no = (6 - max([W, Y])) + 1 # Number of outcomes where she will get to go\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n elif b == 0:\r\n return a\r\n if a < b:\r\n return gcd(a, b % a)\r\n else:\r\n return gcd(b, a % b)\r\n\r\n\r\ndivider = gcd(6, o)\r\nprint(str(floor(o/divider)) + \"/\" + str(floor(6/divider)))\r\n", "n = len(range(max(map(int,input().split())),7))\r\nif n==6:\r\n\tprint('1/1')\r\nelif n==3:\r\n\tprint('1/2')\r\nelif n==4:\r\n\tprint('2/3')\r\nelif n==2:\r\n\tprint('1/3')\r\nelse:\r\n\tprint(str(n)+'/6')", "#9A - Die Roll\r\nimport math\r\n\r\ny, w = map(int, input().split())\r\nnum = 6-max(y,w) + 1\r\nif num == 6:\r\n print(\"1/1\")\r\nelif num%3==0:\r\n print(\"{}/2\".format(math.trunc(num/3)))\r\nelif num%2==0:\r\n print(\"{}/3\".format(math.trunc(num/2)))\r\nelse:\r\n print(\"{}/6\".format(math.trunc(num)))\r\n", "a,b = map(int,input().split())\r\nt = max(a,b)\r\n\r\na = 7-t\r\nb = 6\r\nfor i in range(1,7):\r\n if a%i==0 and b%i==0:\r\n a//=i\r\n b//=i\r\nprint(str(a)+'/'+str(b))\r\n \r\n\r\n", "from fractions import Fraction\r\nm, n = map(int, input().split())\r\n\r\nx = max(m,n)\r\ny = 7 - x\r\nif y == 6:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(y, 6))", "import math \r\ny,w = input().split()\r\ny=int(y)\r\nw=int(w)\r\nmaximum = max(y,w)\r\nnum=7-maximum\r\nden=6\r\nhcf=math.gcd(num,den)\r\nprint(f\"{num//hcf}/{den//hcf}\")\r\n", "f,s=input().split()\r\nf=int(f)\r\ns=int(s)\r\nl=max(f,s)\r\nx=6-l+1\r\nif x==1:\r\n print(\"1/6\")\r\nelif x==2:\r\n print(\"1/3\")\r\nelif x==3:\r\n print(\"1/2\")\r\nelif x==4:\r\n print(\"2/3\")\r\nelif x==5:\r\n print(\"5/6\")\r\nelif x==6:\r\n print(\"1/1\")", "from fractions import Fraction\r\nY,W=input(\"\").split(\" \")\r\nY=int(Y);W=int(W)\r\ns=max(Y,W)\r\nc=6-s+1\r\nif s==0 or s==1:\r\n print(\"1/1\")\r\nelse:\r\n print (Fraction(c,6))", "l = list(input().split())\r\na = []\r\nfor i in range(2):\r\n a.append(int(l[i]))\r\nnumerator = 1 + (6 - max(a))\r\ndenominator = 6\r\ndef hcf_euclid(a, b):\r\n if a == 0 or b == 0:\r\n return a + b\r\n if a > b:\r\n return hcf_euclid(a % b, b)\r\n else:\r\n return hcf_euclid(a, b % a)\r\nb = hcf_euclid(numerator, denominator)\r\nprint(numerator//b, end=\"/\")\r\nprint(denominator//b)", "from fractions import Fraction\r\n\r\na,b=list(map(int,input().split()))\r\nn=6-max(a,b)+1\r\nfraction = Fraction(n, 6).limit_denominator()\r\nprint(fraction) if (str(fraction).count('/')==1) else print(str(fraction)+'/'+'1')\r\n", "def array(arr, struc):\r\n return (list(map(struc, arr.split())))\r\n\r\n\r\narr = array(input(), int)\r\nprob = 7-max(arr)\r\n\r\nif prob == 2:\r\n print('1/3')\r\nelif prob == 3:\r\n print('1/2')\r\nelif prob == 4:\r\n print('2/3')\r\nelif prob == 6:\r\n print('1/1')\r\nelif prob == 1:\r\n print('1/6')\r\nelse:\r\n print('5/6')", "a, b = map(int, input().split())\r\n\r\nprop = (6 - max(a, b) + 1)\r\nund = 6\r\n\r\nif 6 % prop == 0:\r\n und = 6 // prop\r\n prop = 1\r\nelse:\r\n if prop == 4:\r\n und = 3\r\n prop = 2\r\n \r\nprint(str(prop) + \"/\" + str(und))", "options = input().split(\" \")\r\nmax = int(max(options))\r\ncount_of_wins = 6 - max + 1\r\ngcd = 1\r\nfor i in range(1, count_of_wins + 1):\r\n if count_of_wins % i == 0 and 6 % i == 0:\r\n gcd = i\r\nprint(f\"{int(count_of_wins/gcd)}/{int(6/gcd)}\")", "from fractions import Fraction as f\r\na=f(6-max(map(int,input().split()))+1,6)\r\nprint('1/1' if a==1 else a)\r\n", "import string\r\nimport math\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef lcm(x, y):\r\n return (x*y)//gcd(x,y)\r\n\r\nprint(['1/1','5/6','2/3','1/2','1/3','1/6'][max(map(int,input().split()))-1])", "x = list(map(int, input().split(\" \")))\r\nh = max(x)\r\nprob = ['','1/6', '1/3', '1/2', '2/3', '5/6', '1/1' ]\r\nans = prob[7-h]\r\nprint(ans)", "def hcf(x, y):\r\n if x > y:\r\n smaller = y\r\n else:\r\n smaller = x\r\n for i in range(1,smaller + 1):\r\n if((x % i == 0) and (y % i == 0)):\r\n hcf = i\r\n return hcf\r\n\r\ny,w = input().split()\r\ny = int(y)\r\nw = int(w)\r\nmax_vals = max(w,y)\r\nprobability = 7 - max_vals\r\nx=int(hcf(probability,6))\r\nprobability/=x\r\nprint(int(probability), end=\"\")\r\nprint(\"/\", end=\"\")\r\nprint(int(6/x))", "yakko, wakko = input(\"\").split()\r\n\r\nmax = int(wakko)\r\nif int(yakko) >= max:\r\n max = int(yakko)\r\n\r\nnum = 6-max+1\r\nfor x in range(1,7):\r\n if x*(num/6) in [1.0,2.0,3.0,4.0,5.0,6.0]:\r\n print(f\"{int(x*num/6)}/{x}\")\r\n break", "#9A - Die Roll\r\nimport math\r\n#Firstly, we get the results of the previous 2 die rolls\r\ny, w = map(int, input().split())\r\n#Propbability=m/n\r\n# m - favorable cases\r\n# n - total possible cases - 6 for a die roll\r\n#First, we compute m\r\nnum = 6-max(y,w) + 1\r\n#And we simplify the fraction obtained to be less/equal to 1\r\nif num == 6:\r\n print(\"1/1\")\r\n#If the number is 3: we simplify 3/6 to 1/2\r\nelif num%3==0:\r\n print(\"{}/2\".format(math.trunc(num/3)))\r\n# If the num is a multiple of 2:\r\nelif num%2==0:\r\n print(\"{}/3\".format(math.trunc(num/2)))\r\n#If the number is 1 or 5, we cannot reduce the terms:\r\nelse:\r\n print(\"{}/6\".format(math.trunc(num)))\r\n", "from fractions import *\n\nline = input().split()\nn = max(int(line[0]), int(line[1]))\n\nres = Fraction(6 - n + 1, 6)\nprint(\"1/1\" if res == 1 else res)", "def string_split(s, a):\r\n output_list = []\r\n intermediate_str = \"\"\r\n for loc, i in enumerate(s):\r\n if i != a:\r\n intermediate_str += i\r\n if loc == len(s) - 1:\r\n output_list.append(int(intermediate_str))\r\n else:\r\n if len(intermediate_str) != 0:\r\n output_list.append(int(intermediate_str))\r\n intermediate_str = \"\"\r\n return output_list\r\n\r\n\r\ndef joiner_str(l, char):\r\n interm_var = \"\"\r\n for loc , i in enumerate(l):\r\n if not loc == len(l) - 1:\r\n interm_var += i + char\r\n interm_var += l[len(l) - 1]\r\n return interm_var\r\n\r\n\r\n\r\n\r\n\r\ndef recursion(l):\r\n jh = []\r\n def recursion_helper(lis, lis2, start_index, end_index):\r\n if start_index > end_index:\r\n return lis2\r\n elif start_index == end_index:\r\n lis2.append(lis[start_index])\r\n return lis2\r\n else:\r\n lis2.append(lis[start_index])\r\n lis2.append(lis[end_index])\r\n return recursion_helper(lis, lis2, start_index + 1, end_index - 1)\r\n return recursion_helper(l, jh, 0, len(l) - 1)\r\n\r\ndef maximum(l):\r\n a = l[0]\r\n for i in l:\r\n if i > a:\r\n a = i\r\n return a\r\n\r\n\r\ndef func():\r\n b = input()\r\n b = string_split(b, \" \")\r\n ma = maximum(b)\r\n asd = 7 - ma\r\n if asd == 6:\r\n return \"1/1\"\r\n if asd == 5:\r\n return \"5/6\"\r\n if asd == 4:\r\n return \"2/3\"\r\n if asd == 3:\r\n return \"1/2\"\r\n if asd == 2:\r\n return \"1/3\"\r\n if asd == 1:\r\n return \"1/6\"\r\n\r\n\r\nprint(func())\r\n\r\n\r\n", "def calcgcd(x, y):\n if y == 0:\n return x\n return calcgcd(y, x % y)\n\n\ny, w = map(int, input().split())\n\nnom = 7 - max(y, w)\nden = 6\ngcd = calcgcd(nom, den)\n\nnom //= gcd\nden //= gcd\n\nprint(str(nom) + \"/\" + str(den))\n\n", "Y, W = map(int, input().split())\nresult = max(Y, W)\na = 6 - result + 1\nb = 6\nc=a\nd=b\nif a < b:\n a, b = b, a\nwhile b != 0:\n s = a % b\n a = b\n b = s\nprint(f\"{int(c/a)}/{int(d/a)}\")\n\t \t \t\t\t \t \t\t \t\t\t\t\t \t \t \t", "a,b=map(int,input().split())\r\nq=max (a,b)\r\nif q==1:\r\n print('1/1')\r\nelif q==6:\r\n print('1/6')\r\nelif q==2:\r\n print('5/6')\r\nelif q==3:\r\n print('2/3')\r\nelif q==4:\r\n print('1/2')\r\nelif q==5:\r\n print('1/3')\r\n\r\n \r\n ", "def input_split(f): return map(f , input().split())\r\n\r\ndef gcd(a,b):\r\n if(b == 0):\r\n return a\r\n return gcd(b,a%b)\r\n\r\n\r\ny, w = input_split(int)\r\nmx = max(y , w)\r\nk = gcd(6 - mx + 1 , 6)\r\nmx = (6 - mx + 1) // k\r\nprint ('{}/{}'.format(mx , 6 // k))\r\n", "from fractions import Fraction\r\ndef main():\r\n\ta = Fraction(7 - max(map(int, input().split())), 6)\r\n\tprint(a if a != 1 else '1/1')\r\nmain()", "s = [int(i) for i in list(input().split())]\r\n\r\ns.sort()\r\nnumerator = 6 - s[1] + 1\r\n\r\nif numerator == 6:\r\n print(\"1/1\")\r\nelif numerator == 5:\r\n print(\"5/6\")\r\nelif numerator == 4:\r\n print(\"2/3\")\r\nelif numerator == 3:\r\n print(\"1/2\")\r\nelif numerator == 2:\r\n print(\"1/3\")\r\nelif numerator == 1:\r\n print(\"1/6\")", "a,b=map(int,input().split())\r\nmaxi=max(a,b)\r\nans=6-maxi+1\r\nif ans==0:\r\n print(\"0/1\")\r\nelif ans==1:\r\n print(\"1/6\")\r\nelif ans==2:\r\n print(\"1/3\")\r\nelif ans==3:\r\n print(\"1/2\")\r\nelif ans==4:\r\n print(\"2/3\")\r\nelif ans==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "y, w = list(map(int, input().split(' ')))\r\n\r\ndef get_ratio(p):\r\n temp = 6\r\n while temp % 2 == 0 and p % 2 == 0:\r\n p = p // 2\r\n temp = temp // 2\r\n if temp % 3 == 0 and p % 3 == 0:\r\n p = p // 3\r\n temp = temp // 3\r\n \r\n return (p, temp)\r\n\r\n\r\nh = max(y,w)\r\np = (7-h)\r\n\r\nans = get_ratio(p)\r\n\r\nprint(str(ans[0]) + \"/\" + str(ans[1]))", "curr = max(int(x) for x in input().split())\n\n## OPTIMIZE: change order to reflect probabilities\nif curr == 1:\n print(\"1/1\")\nelif curr == 2:\n print(\"5/6\")\nelif curr == 3:\n print(\"2/3\")\nelif curr == 4:\n print(\"1/2\")\nelif curr == 5:\n print(\"1/3\")\nelse:\n print(\"1/6\")\n", "def gcd(m,n):\r\n if n==0:\r\n return m\r\n return gcd(n,m%n)\r\na,b=list(map(int,input().split()))\r\nm=7-max(a,b)\r\ng=gcd(m,6)\r\nm//=g\r\nprint(str(m)+\"/\"+str(6//g))", "Y, W = map(int, input().split())\r\ngreater = max(Y, W)\r\nif greater == 1:\r\n print(\"1/1\")\r\nif greater == 2:\r\n print(\"5/6\")\r\nif greater == 3:\r\n print(\"2/3\")\r\nif greater == 4:\r\n print(\"1/2\")\r\nif greater == 5:\r\n print(\"1/3\")\r\nif greater == 6:\r\n print(\"1/6\")", "import math\r\n\r\na = max(map(int, input().split()))\r\n\r\nnum = 7 - a\r\nden = 6\r\n\r\ng = math.gcd(num, den)\r\n\r\nprint(str(num // g) + '/' + str(den // g))", "# Description of the problem can be found at http://codeforces.com/problemset/problem/9/A\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a % b)\r\n\r\nn = 7 - max(map(int, input().split()))\r\nprint(\"%d/%d\" % (n // gcd(n, 6), 6 // gcd(n, 6)))", "from math import gcd\n\ny, w = map(int, input().split())\nn = 7 - max(y, w)\ng = gcd(n, 6)\nprint(f\"{n//g}/{6//g}\")\n", "import math\r\na = int(7-int(max(input().split())))\r\ng = int(math.gcd(a, 6))\r\na = int(a/g)\r\nprint(f\"{a}/{int(6/g)}\")\r\n", "s = input()\r\ny,w = map(int,s.split(' '))\r\n\r\nm = 7 - max(y,w)\r\n\r\nif m==1:\r\n print ('1/6')\r\nif m==2:\r\n print ('1/3')\r\nif m==3:\r\n print ('1/2')\r\nif m==4:\r\n print ('2/3')\r\nif m==5:\r\n print ('5/6')\r\nif m==6:\r\n print ('1/1') \r\n\r\n\r\n", "import math\r\na, b=map(int, input().split())\r\ng=max(a, b)\r\nf=(6-g)+1\r\ny=math.gcd(f, 6)\r\nprint('{}/{}'.format(f//y, 6//y))", "numbers = input().split()\nnum1, num2 = int(numbers[0]), int(numbers[1])\n\nnums_to_win = 7 - max(num1, num2)\nmp = {1: \"1/6\", 2: \"1/3\", 3: \"1/2\", 4: \"2/3\", 5: \"5/6\", 6: \"1/1\"}\nprint(mp[nums_to_win])\n\n", "from fractions import Fraction\r\nn,m=map(int,input().split())\r\nk=(6-max(n,m)+1)/6\r\nif k==1:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(k).limit_denominator())", "a, b = map(int, input().split())\n\nc = 6 - max(a, b) + 1\n\nif c == 1:\n\tprint('1/6')\nelif c == 2:\n\tprint('1/3')\nelif c == 3:\n\tprint('1/2')\nelif c == 4:\n\tprint('2/3')\nelif c == 5:\n\tprint('5/6')\nelse:\n\tprint('1/1')", "a = []\r\ns = input()\r\na = s.split()\r\nfor i in range(len(a)):\r\n\ta[i] = int(a[i])\r\n\r\nma = max(a[0], a[1])\r\nmi = 6-ma+1\r\n\r\ndef uc(a, b):\r\n\twhile a != b:\r\n\t\tif a>b:\r\n\t\t\tmid = b\r\n\t\t\tb = a-b\r\n\t\t\ta = mid\r\n\t\telse:\r\n\t\t\tmid = a\r\n\t\t\ta = b-a\r\n\t\t\tb = mid\r\n\treturn a\r\n\r\nprint(int(mi/uc(mi, 6)), end = '')\r\nprint('/', end = '')\r\nprint(int(6/uc(mi, 6)), end = '')", "import math\r\nn,m=map(int,input().split())\r\nr=max(n,m)\r\np=6-r+1;\r\nq=math.gcd(p,6)\r\np=p//q\r\nr=6//q\r\nprint(p,end = '')\r\nprint(\"/\",end = '')\r\nprint(r)", "from fractions import Fraction\r\nl=list(map(int,input().split()))\r\nm=max(l)\r\np=6-m+1\r\nif p==6:\r\n print('1/1')\r\nelse:\r\n print(Fraction(p,6))\r\n", "a,b=map(int,input().split())\nc=max(a,b)\nd=7-c\ne=6\n\nif d%2==0:\n d=int(d/2)\n e=3\nif d%3==0:\n d=int(d/3)\n e=int(e/3)\nprint(str(d)+'/'+str(e))", "def gcd(a,b):return gcd(b,a%b) if b else a\r\nm,n=map(int,input().split())\r\nmmax=max(m,n)\r\nd=gcd(6,6-mmax+1)\r\nprint(str((6-mmax+1)//d)+\"/\"+str(6//d))", "a, b=map(int, input().split(' '))\r\ndef prob(x):\r\n listx=['0/1', '1/6', '1/3', '1/2', '2/3', '5/6', '1/1']\r\n return listx[x]\r\n\r\nmagic=6-max(a, b)+1\r\nprint(prob(magic))\r\n", "a, b = (int(x) for x in input().split())\r\nwin_strike = 6 - max(a, b) + 1\r\nif win_strike == 6:\r\n\tprint('1/1')\r\nelif win_strike == 0:\r\n\tprint('0/1')\r\nelif win_strike%3 == 0:\r\n\tprint(f'{win_strike//2}/{2}')\r\nelif win_strike%2 == 0:\r\n\tprint(f'{win_strike//2}/3')\r\nelse:\r\n\tprint(f'{win_strike}/6')", "\r\nfrom fractions import Fraction\r\n\r\na , b = map(int,input().split())\r\n\r\nx = 7 - max(a , b)\r\n\r\nif (x == 0 ):\r\n print(\"0/1\")\r\nelif (x == 6 ):\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(x , 6))\r\n\r\n\r\n\r\n\r\n", "import math \r\na, b = map(int, input().split())\r\nc = 6 - max(a, b) + 1\r\nprint(\"{}/{}\".format(int(c/math.gcd(c, 6)), int(6/math.gcd(c, 6))))", "from math import gcd\r\nc=[int(x) for x in input().split()]\r\na=max(c)\r\nd=6-a+1\r\ne=gcd(d,6)\r\nprint(str(d//e)+'/'+str(6//e))", "Y, W = map(int, input().split())\nmaxi = max(Y, W)\nA = 6 - maxi + 1\nB = 6\nif B % A == 0:\n print(f\"1/{B//A}\")\nelif A % 2 == 0:\n print(\"2/3\")\nelse:\n print(f\"{A}/{B}\")\n", "from fractions import Fraction as frac \r\na,b = (map(int,input().split()))\r\nif a==b==1:print('1/1')\r\nelse: print(frac(6-max(a,b)+1)/6)\r\n ", "# import os\r\n\r\n\r\nx, y = map(int, input().split())\r\n\r\nmaximum = max([x,y])\r\na = 6-maximum+1\r\n# a peut etre 1 2 3 4 5 6\r\nif a == 1:\r\n print(\"1/6\")\r\nelif a == 2:\r\n print(\"1/3\")\r\nelif a == 3:\r\n print(\"1/2\")\r\nelif a == 4:\r\n print(\"2/3\")\r\nelif a == 5:\r\n print(\"5/6\")\r\nelif a == 6:\r\n print(\"1/1\")\r\n\r\n\r\n\r\n\r\n\r\n# 03/01 - 1\r\n# 04/01 - 19 (3)", "b=max(map(int,input().split()))\r\nr=['1/1','5/6','2/3','1/2','1/3','1/6']\r\nprint(r[b-1])", "n,t=list(map(int,input().split()))\nif n==6 or t==6:\n print('1/6')\nelif t<6 and n<6 and t==5 or n==5:\n print('1/3')\nelif t<5 and n<5 and t==4 or n==4:\n print('1/2')\nelif t<4 and n<4 and t==3 or n==3:\n print('2/3')\nelif t<3 and n<3 and t==2 or n==2:\n print('5/6')\nelse:\n print('1/1')", "[a,b] = map(int, input().split())\nsix = 6 \nif a>b:\n c = 7-a\n for x in range(1,4):\n if c%x == 0:\n c = int(c/x)\n six = int(six/x)\n print(str(c)+ '/' + str(six))\nelif b>=a:\n c = 7-b\n for x in range(1,4):\n if c%x == 0:\n c = int(c/x)\n six = int(six/x)\n x = x+1 \n print(str(c)+ '/' + str(six))", "a, b = map(int,input().split())\r\nc = max(a,b)\r\nc = 7-c\r\nn = 6\r\nfor i in reversed(range(2,7)):\r\n\tif c%i == 6%i == 0:\r\n\t\tc = c//i\r\n\t\tn = n//i\r\n\t\tbreak\r\nprint('{}/{}'.format(c, n))\r\n", "import math\nuserInput = input()\n\ntakko, wakko = map(int,userInput.split())\n\nmax_roll = max(takko,wakko)\n\nnumerator = 6 - max_roll + 1\ndenominator = 6\n\ngcd = math.gcd(numerator, denominator)\nnumerator //= gcd\ndenominator //= gcd\n\n# Output the result\nif numerator == 0:\n print(\"0/1\")\nelif numerator == denominator:\n print(\"1/1\")\nelse:\n print(f\"{numerator}/{denominator}\")\n\t \t \t \t \t \t \t\t \t \t \t\t\t", "def gcd(a, b):\r\n if(a%b==0):\r\n return b\r\n else:\r\n return gcd(b, a%b)\r\n\r\nn,m = map(int, input().split())\r\n\r\nn = max(n,m)\r\nn = 6-n+1\r\nm = 6\r\ng = gcd(n, m)\r\nn//=g\r\nm//=g\r\n\r\nprint(n,'/',m, sep = '')", "[y, w] = map(int, input().split(\" \"))\nmax_point = max(y, w) - 1\nif max_point == 5:\n print(\"1/6\")\nelif max_point == 4:\n print(\"1/3\")\nelif max_point == 3:\n print(\"1/2\")\nelif max_point == 2:\n print(\"2/3\")\nelif max_point == 1:\n print(\"5/6\")\nelse:\n print(\"1/1\")", "m = (6-(max(list(map(int,input().split())))))+1\r\nif m==6:print(\"1/1\")\r\nelif m%2==0:print(str(int(m/2))+\"/3\")\r\nelif m%3==0:print(str(int(m/3))+\"/2\")\r\nelse:print(str(m)+\"/6\")", "def frac(n_D_win, deno):\r\n if (n_D_win == deno):\r\n return \"1/1\"\r\n elif (n_D_win % 2 == 0) and (deno % 2 == 0):\r\n n_D_win //= 2\r\n deno //= 2\r\n frac(n_D_win, deno)\r\n elif (n_D_win % 3 == 0):\r\n n_D_win //= 3 \r\n deno //= 3\r\n frac(n_D_win, deno)\r\n return f\"{n_D_win}/{deno}\"\r\nY, W = list(map(int, input().split()))\r\nD_min = max(Y, W)\r\nn_D_win = (6 - D_min) + 1\r\nprint(frac(n_D_win, 6))", "from fractions import Fraction\r\nx,y=map(int,input().split())\r\nk=max(x,y)\r\nif (7-k)/6==1:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(7-k,6))", "from math import *\r\ny,w=map(int,input().split())\r\na,b=6-max(y,w)+1,6\r\nx=gcd(a,b)\r\na//=x\r\nb//=x\r\nprint(a,b,sep='/')\r\n", "Y,W=map(int,input().split())\nx=max(Y,W)\nif x==1:\n print('1/1')\nif x==2:\n print('5/6')\nif x==3:\n print('2/3')\nif x==4:\n print('1/2')\nif x==5:\n print('1/3')\nif x==6:\n print('1/6')\n", "from math import gcd\r\na, b = map(int, input().split())\r\nc = 6 - max(a, b) + 1\r\ng = gcd(c, 6)\r\nprint(f'{c // g}/{6 // g}')\n# Fri Apr 22 2022 12:49:38 GMT+0000 (Coordinated Universal Time)\n", "from math import gcd\r\na, b = map(int, input().split())\r\nc = [7 - max(a, b), 6]\r\nc = [c[0] // gcd(c[0], c[1]), c[1] // gcd(c[0], c[1])]\r\nprint(str(c[0])+\"/\"+str(c[1]))", "class Solve:\r\n \r\n def __init__(self) -> None:\r\n self.Y = 0;\r\n self.W = 0;\r\n self.A = 0;\r\n self.B = 6;\r\n\r\n def vao(self) -> None:\r\n self.Y, self.W = map(int, input().split(\" \"));\r\n\r\n def UCLN(self, a, b) -> int:\r\n while(a % b != 0):\r\n tmp = a % b;\r\n a = b;\r\n b = tmp;\r\n return b;\r\n\r\n def lam(self) -> None:\r\n t = max(self.Y, self.W);\r\n self.A = 6 - t + 1;\r\n self.B = int(self.B / self.UCLN(self.A,6));\r\n self.A = int(self.A / self.UCLN(self.A,6));\r\n\r\n def ra(self) -> None:\r\n print(\"{}/{}\".format(self.A, self.B));\r\n\r\n\r\ndef main():\r\n p = Solve();\r\n p.vao();\r\n p.lam();\r\n p.ra();\r\n\r\n\r\nmain();\r\n", "a,b = map(int,input().split())\r\nres = max(a,b)\r\nres = 6-(res-1)\r\nx = 6\r\nfor i in range(2,7):\r\n if(res%i==0) and (x%i==0):\r\n x/=i\r\n res/=i\r\n x=int(x)\r\n res = int(res)\r\nprint(res,end='/')\r\nprint(x)", "def gcd(a, b):\r\n for i in range(min(a, b), 0, -1):\r\n if a % i == 0 and b % i == 0:\r\n return i\r\n \r\na, b = map(int, input().split())\r\ngcd_ab = gcd(6 - max(a, b) + 1, 6)\r\n\r\nprint(f'{(6 - max(a, b) + 1) // gcd_ab}/{6 // gcd_ab}')\r\n", "# ===============================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===============================\r\nfrom fractions import gcd\r\ny, w = [int(x) for x in input().split()]\r\nt = max(y,w)\r\nchance = 6-t+1\r\nf = gcd(chance, 6)\r\nprint(\"{}/{}\".format(chance//f, 6//f))\r\n", "from fractions import Fraction\r\n\r\na,b=map(int,input().split())\r\ny=6\r\nx=y-(max(a,b)-1)\r\nif x==y:\r\n print('1/1')\r\nelse:\r\n fraction = Fraction(str(x) + '/' + str(y))\r\n print(fraction)", "y,w=map(int,input().split())\r\na=max(y,w)\r\nif a==1:\r\n print(1,1,sep=\"/\")\r\nelif a==2:\r\n print(5,6,sep=\"/\")\r\nelif a==3:\r\n print(2,3,sep=\"/\")\r\nelif a==4:\r\n print(1,2,sep=\"/\")\r\nelif a==5:\r\n print(1,3,sep=\"/\")\r\nelif a==6:\r\n print(1,6,sep=\"/\")", "a=input()\r\nyw=a.split()\r\nhigher=max(int(yw[0]),int(yw[1]))\r\np=0\r\nfor i in range(1,7):\r\n if i>=higher:\r\n p+=1\r\nif p==6:\r\n print(\"1/1\")\r\nelif p==2:\r\n print(\"1/3\")\r\nelif p==3:\r\n print(\"1/2\")\r\nelif p==4:\r\n print(\"2/3\")\r\nelse:\r\n print(\"%d/6\"%p)", "y,w=map(int,input().split())\r\nn=max(y,w)\r\nx=6-n+1\r\nc=6\r\nif n==1:\r\n x=1\r\n c=1\r\nif x%3==0:\r\n x=x//3\r\n c=2\r\nif x%2==0:\r\n x=x//2\r\n c=3\r\nprint('{0}/{1}'.format(x,c))", "#Codeforces 6A\r\n\r\n\r\ndef lowest_form(a):\r\n if a%2==0:\r\n if(a//2==3):\r\n return '1/1'\r\n else: return str(a//2)+'/3'\r\n elif a%3==0:\r\n if(a//3==2): return ('1/1')\r\n else: return str(a//3)+'/2'\r\n elif a==0: \r\n return '0/1'\r\n elif a==6:\r\n return '1/1'\r\n else: return str(a)+'/6'\r\n\r\n\r\n\r\ny,w = map(int,input().split())\r\nif y<w:\r\n a=(6-w+1)\r\n print(lowest_form(a))\r\nelse:\r\n a=(6-y+1)\r\n print(lowest_form(a))\r\n", "y, w = map(int, input().split()) \r\nchance = 1/((6 - max(y, w) + 1) / 6) \r\nk = 1 \r\nif chance != int(chance): \r\n for i in range(2, 7): \r\n if chance * i == int(chance * i): \r\n k = i \r\n break \r\nprint(1 * k, '/' , int(chance * k), sep = '')", "import math\r\n\r\nx, y = map(int, input().split())\r\nz = 6 - max(x, y) + 1\r\nd = math.gcd(z, 6)\r\nprint(z // d, 6 // d, sep = '/')", "# LUOGU_RID: 92916412\nn,m = map(int, input().split())\r\nif n<m:\r\n n = m\r\nsum = 0\r\nfor i in range(6,0,-1):\r\n if i>=n:\r\n sum = sum+1\r\nif sum == 2:\r\n print(\"1/3\")\r\nelif sum == 3:\r\n print(\"1/2\")\r\nelif sum == 4:\r\n print(\"2/3\")\r\nelif sum == 0:\r\n print(\"0/1\")\r\nelif sum == 6:\r\n print(\"1/1\")\r\nelse:\r\n print(str(sum)+\"/6\")", "x=[int(i) for i in input().split()]\r\nfrom fractions import Fraction\r\nmaxi=max(x)\r\ny=[i for i in range(1,7) if i>=maxi]\r\nif len(y)==6:\r\n print('1/1')\r\nelse:\r\n print(str(Fraction(len(y),6)))\r\n\r\n\r\n", "from fractions import Fraction\r\nli = ['1/1', '5/6', '2/3', '1/2', '1/3', '1/6']\r\nY, W = map(int, input().split())\r\n\r\nprint(li[max(Y,W)-1])", "y, w = map(int, input().split())\r\n\r\nm = max(y, w)\r\nchance = 6 - m + 1\r\n\r\nif chance == 1:\r\n\tprint(\"1/6\")\r\nelif chance == 2:\r\n\tprint(\"1/3\")\r\nelif chance == 3:\r\n\tprint(\"1/2\")\r\nelif chance == 4:\r\n\tprint(\"2/3\")\r\nelif chance == 5:\r\n\tprint(\"5/6\")\r\nelse:\r\n\tprint(\"1/1\")\r\n\r\n", "from fractions import Fraction\r\nk,m = map(int,input().split())\r\nresult=max(k,m)\r\nj=6-result\r\ntim=(j+1)/6\r\nif tim==1:\r\n print(\"1/1\")\r\nelif tim==0:\r\n print(\"0/1\")\r\nelse:\r\n print(Fraction(tim).limit_denominator())\r\n", "from fractions import Fraction\r\n\r\n\r\nY, W = list(map(int, input().split()))\r\n\r\nZ = max(Y, W)\r\ncount = 0\r\nfor i in range(Z, 7):\r\n count +=1\r\nif count == 6:\r\n print(\"1/1\")\r\nelse:\r\n Ans = Fraction(count, 6)\r\n\r\n print(Ans)\r\n", "a,b=map(int,input().split())\r\nx=[\"\",\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\np=max(a,b)\r\nprint(x[p])", "from fractions import Fraction\r\ny,w = list(map(int,input().split()))\r\n\r\nprop = Fraction(6 - (max(y,w) - 1), 6)\r\n\r\nif prop == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(prop)\r\n", "x,y=input().split()\r\nc=[]\r\nc.append(int(x))\r\nc.append(int(y))\r\nhigh=max(c)\r\ny=[]\r\nfor i in range(1,7):\r\n if i>=high:\r\n y.append(i)\r\nif len(y)==1:\r\n print('1/6')\r\nelif len(y)==2:\r\n print('1/3')\r\nelif len(y)==3:\r\n print('1/2')\r\nelif len(y)==4:\r\n print('2/3')\r\nelif len(y)==5:\r\n print('5/6')\r\nelif len(y)==6:\r\n print('1/1')\r\n", "roll_sides = [1,2,3,4,5,6]\r\nmax_yw = max(map(int, input().split()))\r\nrest_sides_to_win = list(filter(lambda x: x>=max_yw , roll_sides))\r\nif len(rest_sides_to_win) == 6:\r\n print(\"1/1\")\r\nelif len(rest_sides_to_win) == 0:\r\n print(\"0/1\")\r\nelse:\r\n if len(rest_sides_to_win)%3 == 0:\r\n print(f\"{int(len(rest_sides_to_win)/3)}/2\")\r\n elif len(rest_sides_to_win)%2 == 0:\r\n print(f\"{int(len(rest_sides_to_win)/2)}/3\")\r\n else:\r\n print(f\"{len(rest_sides_to_win)}/6\")", "from math import gcd\r\ny,w=map(int,input().split())\r\nn=7-max(y,w)\r\nd=6\r\na=gcd(n,d)\r\nprint(\"{}/{}\".format(n//a,d//a))", "from fractions import Fraction\r\nn = input().split()\r\na = max(n)\r\nc = (6 - int(a)) + 1\r\nif c/6 == 0:\r\n print(\"0/1\")\r\nelif c/6 == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(c, 6))", "nerd=input().split()\r\nn=[\"0/6\",\"1/6\",'1/3',\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(n[7-int(max(nerd,key=int))])", "u = list(map(int , input().split()))\r\nl = [\"1/1\",\"5/6\",'2/3',\"1/2\",\"1/3\" ,\"1/6\"]\r\nmax_s = (max(u) -1)-6\r\nprint(l[max_s])\r\n", "from sys import stdin\r\nn = 6 - (max(map(int, stdin.readline().split())) - 1)\r\n \r\nd = ['1/6','1/3','1/2','2/3','5/6','1/1']\r\n \r\nprint(d[n-1])", "from fractions import Fraction\r\nd=sorted([int(x) for x in input().split()])\r\na=6-d[1]+1\r\nprint(Fraction(a,6) if Fraction(a,6)!=1 else '1/1')", "from math import gcd\r\ny, w = map(int, input().split())\r\nprint(f'{(7 -(max(y, w))) // gcd(7 - max(y, w), 6)}/{6 // gcd(7 - max(y, w), 6)}')\r\n", "y=list(map(int,input().split()))\r\nans=0\r\ndie=6\r\ns=max(y)\r\nwhile s<=6:\r\n s+=1\r\n ans+=1\r\nif 6%ans==0:\r\n die=6//ans\r\n ans=1\r\n print(\"{}/{}\".format(ans,die))\r\nelif ans%2==0 and 6%2==0:\r\n die=6//2\r\n ans=ans//2\r\n print(\"{}/{}\".format(ans,die))\r\nelif ans%3==0 and 6%3==0:\r\n die=6//3\r\n ans=ans//3\r\n print(\"{}/{}\".format(ans,die))\r\nelse:\r\n print(\"{}/{}\".format(ans,die))", "(y, w) = [int(i) for i in input().split()]\n\na = 6-(max(y,w)-1)\nb = 6\n\nif(a%2 == 0):\n a //= 2\n b //= 2\n\nif(a%3 == 0):\n a //= 3\n b //= 3\n\nprint(a, b, sep=\"/\")\n \t \t \t \t \t\t \t \t\t \t \t\t \t\t", "from fractions import Fraction\r\nY,W=map(int,input().split())\r\n\r\nif Y>W:\r\n print(Fraction((6-(Y-1)),6))\r\nelif Y<W:\r\n print(Fraction((6-(W-1)),6))\r\nelif Y==W==1:\r\n print(\"1/1\")\r\nelif Y==W:\r\n print(Fraction((6-(W-1)),6))", "from fractions import Fraction\r\nx = list(map(int,input().split()))\r\n\r\nm = max(x)\r\nprob = ['1/1','5/6','2/3','1/2','1/3','1/6']\r\nprint(prob[m-1])\r\n", "import math\r\n\r\na,b = map(int,input().split())\r\nmx = max(a,b)\r\nans = 6 - mx + 1\r\ngcd = math.gcd(6,ans)\r\nprint(f\"{ans//gcd}/{6//gcd}\")\r\n", "\r\ny, w = map(int, input().split())\r\n\r\na = 0\r\nb = 6\r\n\r\na = 6 - (max(y, w)-1)\r\nif b % a == 0:\r\n b = b//a\r\n a = 1\r\nelif a == 4:\r\n a = 2\r\n b = 3\r\n\r\n\r\n\r\nprint(a, \"/\", b, sep=\"\") \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n", "import math\r\n\r\n\r\ny, w = map(int, input().split())\r\n# compute favorable cases\r\nfavorable = 6-max(y,w) + 1\r\n\r\nif favorable == 6:\r\n print(\"1/1\")\r\nelif favorable%3==0:\r\n print(\"{}/2\".format(math.trunc(favorable/3)))\r\nelif favorable%2==0:\r\n print(\"{}/3\".format(math.trunc(favorable/2)))\r\nelse:\r\n print(\"{}/6\".format(math.trunc(favorable)))\r\n", "y,w=map(int,input().split(' '))\r\ns=max(y,w)\r\nif(s==1):\r\n print(\"1/1\")\r\nelif(s==2):\r\n print(\"5/6\")\r\nelif(s==3):\r\n print(\"2/3\")\r\nelif(s==4):\r\n print(\"1/2\")\r\nelif(s==5):\r\n print(\"1/3\")\r\nelif(s==6):\r\n print(\"1/6\")\r\nelse:\r\n print(\"0/1\")\r\n", "line = input().split(\" \")\r\n\r\nout = {0:\"0/1\",\r\n 1/6:\"1/6\",\r\n 1/3:\"1/3\",\r\n 1/2:\"1/2\",\r\n 2/3:\"2/3\",\r\n 5/6:\"5/6\",\r\n 1:\"1/1\"}\r\na = int(line[0])\r\nb = int(line[1])\r\n\r\nc = max(a, b)\r\n\r\np = (6 - (c - 1))/6\r\n\r\nprint(out[p])\r\n", "\nimport math\nimport os\nimport re\nimport sys\nfrom typing import Counter, Sized\nimport string\n\ndef gcd(m,n):\n while m%n != 0:\n oldm = m\n oldn = n\n\n m = oldn\n n = oldm%oldn\n return n\nif __name__ == '__main__':\n r,w=map(int,input().split())\n max1=max(r,w)\n max1=(6-max1)+1\n gcd1=gcd(6,max1)\n print(max1//gcd1,end=\"/\")\n print(6//gcd1)\n\t\t\t \t \t\t \t\t \t\t \t\t \t \t\t", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nif n>m:\r\n p=7-n\r\nelse:\r\n p=7-m\r\nif p==1:\r\n print(\"1/6\")\r\nif p==2:\r\n print(\"1/3\")\r\nif p==3:\r\n print(\"1/2\")\r\nif p==4:\r\n print(\"2/3\")\r\nif p==5:\r\n print(\"5/6\")\r\nif p==6:\r\n print(\"1/1\")\r\n", "from fractions import Fraction as frac\r\nx,y=map(int,input().split())\r\nmax_=max(x,y)\r\nif max_==1:\r\n print(\"1/1\")\r\nelse:\r\n probab=7-max_\r\n print(frac(probab,6))\r\n", "from math import gcd\na, b = map(int, input().split())\nn = 6 - max(a, b)+1\ng = gcd(n, 6)\n\ns = str(n//g)+\"/\"+str(6//g)\nprint(s)", "a = list(map(int, input().split()))\r\nchances = []\r\nfor i in range(7):\r\n if i >= max(a):\r\n chances.append(i)\r\nn = len(chances)\r\nm = 6\r\ndef ReduceFraction(n, m):\r\n if n > m:\r\n k = n\r\n else:\r\n k = m\r\n while k != 1:\r\n if n % k == 0 and m % k == 0:\r\n return n // k, m // k\r\n else:\r\n k -= 1\r\n return n, m\r\n \r\n \r\nints = list(ReduceFraction(n,m))\r\nprint(f'{ints[0]}/{ints[1]}')", "' talk is cheap show me your awp flicks'\r\nfrom fractions import Fraction\r\nfrom sys import stdin\r\na,b=list(map(int,stdin.readline().split()))\r\nw=6-max(a,b)\r\n\r\ns=Fraction(w+1,6)\r\ns=str(s)\r\ns.rstrip()\r\nif '/' not in s:\r\n\tprint(s,'/','1',sep='')\r\n\texit()\r\nprint(s)\r\n\t\r\n", "import math\r\n\r\nY, W = map(int, input().split())\r\n\r\nm_score = max(Y, W)\r\n\r\nf_outcomes = 6 - m_score + 1\r\n\r\nt_outcomes = 6\r\n\r\ngcd = math.gcd(f_outcomes, t_outcomes)\r\n\r\nnum = f_outcomes // gcd\r\nden = t_outcomes // gcd\r\n\r\nprint(f\"{num}/{den}\")\r\n", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a % b)\r\n\r\ny, w = map(int, input().split())\r\n\r\nm = max(y, w)\r\n\r\nf = 6 - m + 1\r\n\r\nt = 6\r\n\r\ng = gcd(f, t)\r\n\r\nf //= g\r\nt //= g\r\n\r\nprint(f\"{f}/{t}\")", "y,w = map(int,input().split())\r\nm = max(y,w)\r\nres = [\"\",\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nprint(res[m])\r\n", "import math\n\n(yakko, wakko) = map(int, input().split(' '))\n\nnominator = 6 - max(yakko, wakko) + 1\ndenominator = 6\ngcd = math.gcd(nominator, denominator)\n\nif gcd != 1:\n nominator = nominator // gcd\n denominator = denominator // gcd\n print(str(nominator) + '/' + str(denominator))\nelse:\n print(str(nominator) + '/' + str(denominator))", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=0\r\nif(a>=b):\r\n for i in range(a,7):\r\n c+=1\r\n if(c==1):\r\n print(\"1/6\")\r\n elif(c==2):\r\n print(\"1/3\")\r\n elif(c==3):\r\n print(\"1/2\")\r\n elif(c==4):\r\n print(\"2/3\")\r\n elif(c==5):\r\n print(\"5/6\")\r\n else:\r\n print(\"1/1\")\r\nif(b>a):\r\n for i in range(b,7):\r\n c+=1\r\n if(c==1):\r\n print(\"1/6\")\r\n elif(c==2):\r\n print(\"1/3\")\r\n elif(c==3):\r\n print(\"1/2\")\r\n elif(c==4):\r\n print(\"2/3\")\r\n elif(c==5):\r\n print(\"5/6\")\r\n else:\r\n print(\"1/1\")\r\n\r\n \r\n", "m , k = map(int,input().split())\r\nprint(['1/1','5/6','2/3','1/2','1/3','1/6'][max(m,k)-1])\r\n", "x, y = map(int, input().split())\r\na = 0\r\nb = 6\r\nfor i in range(7):\r\n if i >= x and i >= y:\r\n a += 1\r\naa = a\r\nbb = b\r\nwhile a % b != 0:\r\n a, b = b, a % b\r\nprint(aa // b, '/', bb // b, sep='')\r\n", "import math\ny,w = map(int, input().split())\ndiv = math.gcd(7 - max(y,w), 6)\nprint((7-max(y,w)) // div, '/', 6//div, sep = '')\n", "from fractions import Fraction as F\r\ny, w = map(int, input().split())\r\nf = F(7-max(y,w), 6)\r\nprint(f'{f.numerator}/{f.denominator}')", "y,w=[int(x) for x in input().split()]\r\na=max(y,w)\r\nn=7-a\r\nif n==2:\r\n print(\"1/3\")\r\nelif n==3:\r\n print(\"1/2\")\r\nelif n==6:\r\n print(\"1/1\")\r\nelif n==4:\r\n print(\"2/3\")\r\nelif n==0:\r\n print(\"0/1\")\r\nelse:\r\n print(n,end='')\r\n print(\"/6\")\r\n", "import collections\r\nfrom fractions import Fraction\r\nn = input().split()\r\nn = list(map(int, n))\r\nA = 6 - max(collections.Counter(n).keys())+1\r\nB = 6\r\nif(Fraction(A,B) == 1):\r\n print(\"1/1\")\r\nelif(Fraction(A,B) == 0):\r\n print(\"0/1\")\r\nelse:\r\n print(Fraction(A,B))", "a = list(map(int, input().split(\" \")))\r\ntuso = 6 - max(a) + 1\r\nif (tuso == 2): r = \"1/3\"\r\nif (tuso == 3): r = \"1/2\"\r\nif (tuso == 4): r = \"2/3\"\r\nif (tuso == 1): r = \"1/6\"\r\nif (tuso == 5): r = \"5/6\"\r\nif (tuso == 6): r = \"1/1\"\r\nprint(r)", "from fractions import Fraction\r\ny,w = (map(int,input().split()))\r\nresult = Fraction(7-max(y,w),6)\r\nif result == 1 :\r\n print(str(result)+\"/1\")\r\nelse :\r\n print(result)\r\n", "Y=(6-(max(map(int,input().split(\" \"))))+1)\r\nif Y==2:\r\n\tprint(\"1/3\")\r\nelif Y==3:\r\n\tprint(\"1/2\")\r\nelif Y==4:\r\n\tprint(\"2/3\")\r\nelif Y==6:\r\n\tprint(\"1/1\")\r\nelse:\r\n\tprint(\"%d/6\"%Y)", "import math\r\n\r\n\r\ndef die_roll():\r\n\r\n\r\n y,w = map(int,input().split())\r\n\r\n maximum = max(y,w)\r\n\r\n\r\n remaining = 6 - maximum + 1\r\n\r\n\r\n gcd = math.gcd(remaining,6)\r\n\r\n remaining //= gcd\r\n denom = 6 // gcd\r\n\r\n print(remaining,denom,sep='/')\r\n \r\n\r\n\r\n\r\n\r\n\r\ndie_roll()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "inpt = [int(i) for i in input().split(\" \")]\r\np = 7 - max(inpt[0], inpt[1])\r\nif p%6 == 0:\r\n print('1/1')\r\nelif p%3 == 0:\r\n print(f'{p//3}/{2}')\r\nelif p%2 == 0:\r\n print(f'{p//2}/{3}')\r\nelse:\r\n print(f'{p}/6')", "# 9A\r\n\r\nrolls = list(map(int, input().split()))\r\nm = max(rolls)\r\nfrac = [7-m, 6]\r\ngcd = min(frac)\r\nwhile frac[0] % gcd != 0 or frac[1] % gcd != 0:\r\n gcd -= 1\r\n\r\nfrac[0] = frac[0] // gcd; frac[1] = frac[1] // gcd\r\n\r\nprint('/'.join(list(map(str, frac))))", "from fractions import Fraction\r\n\r\nwy = list(map(int,input().split()))\r\nnum = 0\r\n\r\nif wy[0] > wy[1]:\r\n mx = wy[0]\r\nelse :\r\n mx = wy[1]\r\n \r\nwhile mx <= 6:\r\n num+=1\r\n mx+=1\r\n\r\nresult = Fraction(num,6)\r\nif result == 1 :\r\n print ('1/1')\r\nelse :\r\n print(result)", "roll1, roll2 = [float(z) for z in input().split()]\r\n#roll2 = float(input().split())\r\nif roll1>roll2:\r\n\tx=roll1\r\nelse:\r\n\tx=roll2\r\n\r\nif x==1:\r\n\tprint(\"1/1\")\r\nelif x==2:\r\n\tprint(\"5/6\")\r\nelif x==3:\r\n\tprint(\"2/3\")\r\nelif x==4:\r\n\tprint(\"1/2\")\r\nelif x==5:\r\n\tprint(\"1/3\")\r\nelse:\r\n\tprint(\"1/6\")\r\n", "Y, W = map(int, input().split())\r\nmax_val = max(Y, W)\r\nif max_val == 1:\r\n print('1/1')\r\nelif max_val == 2:\r\n print('5/6')\r\nelif max_val == 3:\r\n print('2/3')\r\nelif max_val == 4:\r\n print('1/2')\r\nelif max_val == 5:\r\n print('1/3')\r\nelif max_val == 6:\r\n print('1/6')\r\nelse:\r\n print('0/1')", "import math\r\na,b = map(int,input().split())\r\nprint(int((6-max(a,b)+1)/math.gcd((6-max(a,b)+1),6)),int(6/math.gcd((6-max(a,b)+1),6)) , sep = \"/\")", "def solution(y, w):\r\n _max = max(y, w)\r\n chance = (7 - _max)\r\n\r\n if chance == 2:\r\n return '1/3'\r\n elif chance == 3:\r\n return '1/2'\r\n elif chance == 4:\r\n return '2/3'\r\n elif chance == 6:\r\n return '1/1'\r\n else:\r\n return \"%d/6\" %(chance)\r\n\r\n\r\ny, w = list(map(int, input().split()))\r\nres = solution(y, w)\r\nprint(res)", "def gcd(a,b):\r\n if not a:return b\r\n if not b:return a\r\n return gcd(b, a%b)\r\n\r\n\r\nx,y= map(int,input().split())\r\ntop = 7 - max(x,y)\r\na = gcd(top,6)\r\nprint(str(top // a) + '/' + str(6//a))", "p1, p2 = map(int, input().split(' '))\n\np_1 = 6 - p1 + 1\n\np_2 = 6 - p2 + 1\n\na = min(p_1, p_2)\n\ndef GCD(x, y): \n \n while(y): \n x, y = y, x % y \n \n return x \n\ng = GCD(6, a)\n\nprint(f\"{int(a/g)}/{int(6/g)}\")", "y,w = map(int,input().split())\r\n\r\nmx = max(y,w)\r\n\r\nnu = 6 - mx + 1\r\nde = 6\r\nfor i in range(2,7) :\r\n if nu % i == 0 and de % i == 0 :\r\n nu = int(nu / i)\r\n de = int(de / i)\r\n\r\nprint('{}/{}'.format(nu,de))", "def main(y, w):\r\n n = (6 - max(y, w) + 1) / 6\r\n\r\n if n == 5 / 6:\r\n return (5, 6)\r\n elif n == 2 / 3:\r\n return (2, 3)\r\n elif n == 1 / 3:\r\n return (1, 3)\r\n elif n == 1 / 6:\r\n return (1, 6)\r\n else:\r\n return n.as_integer_ratio()\r\n\r\nif __name__ == \"__main__\":\r\n y, w = map(int, input().split())\r\n\r\n print(*main(y, w), sep=\"/\")", "\r\ntiros = input().split()\r\ny = int(tiros[0])\r\nw = int(tiros[1])\r\n\r\ncp = None\r\ntc = 6\r\nmaximo = max(w,y)\r\n\r\ncp = 6 - maximo + 1\r\ntc = 6\r\n\r\nif cp%2 == 0:\r\n cp = cp // 2\r\n tc = tc // 2\r\nif cp%3 == 0:\r\n cp = cp // 3\r\n tc = tc // 3\r\n\r\nprint(str(cp)+'/'+str(tc)) ", "sl = list(map(int,input().split()))\nif max(sl) == 1:\n print(f'{1}/{1}')\nelif max(sl) == 2:\n print(f'{5}/{6}')\nelif max(sl) == 3:\n print(f'{2}/{3}')\nelif max(sl) == 4:\n print(f'{1}/{2}')\nelif max(sl) == 5:\n print(f'{1}/{3}')\nelif max(sl) == 6:\n print(f'{1}/{6}')", "y,w=map(int, input().split())\r\nd=max(y,w)\r\nd=7-d\r\nlist=[\"0/1\",\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(list[d])", "__author__ = \"runekri3\"\r\n\r\nOUTS = [\"ERROR LOL\", \"1/6\", \"1/3\", \"1/2\", \"2/3\", \"5/6\", \"1/1\"]\r\n\r\nY, W = input().split(\" \")\r\n\r\nmin_roll = max(int(Y), int(W))\r\n\r\nchance = 6 - min_roll + 1\r\n\r\nprint(OUTS[chance])", "D=list(map(int,input().split()))\r\nnume=6-max(D)+1\r\ndenom=6\r\nif nume==0:\r\n denom=1\r\nif nume==6:\r\n nume=1\r\n denom=1\r\nif nume%2==0:\r\n nume=nume//2\r\n denom=denom//2\r\nif nume%3==0:\r\n nume = nume // 3\r\n denom = denom // 3\r\n\r\nprint(nume,end=\"/\")\r\nprint(denom,end=\"\")", "from fractions import Fraction\r\n\r\nn, m = map(int, input().split())\r\n\r\nprobability = Fraction((6 - max(n,m) + 1),6)\r\n\r\nif probability == 1:\r\n print('1/1')\r\nelif probability == 0:\r\n print('0/0')\r\nelse:\r\n print(probability)", "l=list(map(int,input().split()))\r\nif (l[0]>=l[1]):\r\n k=6-l[0]+1\r\nelse:\r\n k=6-l[1]+1\r\nif (6%k==0):\r\n b=6//k\r\n a=1\r\nelif (k%2==0):\r\n k=k//2\r\n a=k\r\n b=3\r\nelse:\r\n a=k\r\n b=6\r\nprint(\"%d/%d\"%(a,b))", "y,w=input().split()\r\nif int(y)>int(w):\r\n g=int(y)\r\nelse:\r\n g=int(w)\r\ndiff=7-g\r\nif diff%6==0:\r\n print(\"1/1\")\r\nelif diff%3==0:\r\n print(str(int(diff/3))+\"/2\")\r\nelif diff%2==0:\r\n print(str(int(diff/2))+\"/3\")\r\nelse:\r\n print(str(diff)+\"/6\")\r\n", "# LUOGU_RID: 112782846\nY,W = map(int,input().split())\nmax_num = max(Y,W)\nnum = 6-max_num+1\nif num == 6:\n print(\"1/1\")\nelif 6%num == 0:\n print(\"{}/{}\".format(1,6//num))\nelif num%2==0:\n print(\"{}/{}\".format(num//2,6//2))\nelse:\n print(\"{}/{}\".format(num,6))", "def solve(y, w):\n p = 6 - max(y, w) + 1\n t = 6\n if p % 2 == 0:\n p //= 2\n t //= 2\n if p % 3 == 0:\n p //= 3\n t //= 3\n return f'{p}/{t}'\n\n\n\ndef main():\n y, w = list(map(int, input().split()))\n print(solve(y, w))\n\n\nmain()\n", "I=[int(i) for i in input().split()]\r\nk=max(I[0],I[1])\r\nif k==1:\r\n print(\"1/1\")\r\nelif k==2:\r\n print(\"5/6\")\r\nelif k==3:\r\n print(\"2/3\")\r\nelif k==4:\r\n print(\"1/2\")\r\nelif k==5:\r\n print(\"1/3\")\r\nelse: print(\"1/6\")", "def gcd(a, b): \r\n while b != 0: \r\n a, b = b, a % b \r\n return a\r\nn,m=map(int,input().split())\r\na=6-max(n,m)+1\r\nb=gcd(6,a)\r\nprint(str(a//b)+'/'+str(int(6//b)))\r\n", "a,b=map(int,input().split())\r\nmx=max(a,b)\r\nc=6-mx+1;\r\nif c==1:print('1/6')\r\nelif c==2:print('1/3')\r\nelif c==3:print('1/2')\r\nelif c==4:print('2/3')\r\nelif c==5:print('5/6')\r\nelif c==6:print('1/1')", "from fractions import Fraction\r\nY, W = map(int, input().split())\r\nodds = Fraction(len(range(max(Y, W),7)), 6)\r\nprint(\"1/1\" if odds == 1 else odds)", "from fractions import Fraction\r\ny,w = input().split()\r\nz = max(int(y),int(w))\r\na = (6-(int(z)-1))/6\r\nb = (6-(int(z)-1))\r\nif a == 1:\r\n print(\"1/1\")\r\nelif a == 0:\r\n print(\"0/1\")\r\nelse:\r\n print(Fraction(b,6))", "a=len(range(max(tuple(map(int,input().split()))),7))\r\ndct={'0.0':'0/1' ,'0.17':'1/6','0.33':'1/3','0.5':'1/2','0.67':'2/3','0.83':'5/6',\"1.0\":'1/1'}\r\nprint(dct[str(round(a/6,2))])\r\n\r\n\r\n", "Y , W = map(int,input().split())\r\nnum = 1-((max(Y,W)-1)/6)\r\nif ('%.1f'%num) == '1.0':\r\n print('1/1')\r\nelif ('%.1f'%num) == '0.8':\r\n print('5/6')\r\nelif ('%.1f'%num) == '0.7':\r\n print('2/3')\r\nelif ('%.1f'%num) == '0.5':\r\n print('1/2')\r\nelif ('%.1f'%num) == '0.3':\r\n print('1/3')\r\nelif ('%.1f'%num) == '0.2':\r\n print('1/6')", "def reduce(numerator, denominator):\n for i in range(2, numerator+1):\n if numerator % i == 0 and denominator % i == 0:\n return reduce(numerator // i, denominator // i)\n return numerator, denominator\ny, w = map(int, input().split())\nmax_ = max(y, w)\na, b = reduce(6-max_ + 1, 6)\nprint(str(a)+\"/\"+str(b))\n", "yakko, wakko = map(int, input().split())\r\n\r\nchance = 6 - (max(wakko, yakko) - 1)\r\n\r\nif chance == 1:\r\n print('1/6')\r\nelif chance == 2:\r\n print('1/3')\r\nelif chance == 3:\r\n print('1/2')\r\nelif chance == 4:\r\n print('2/3')\r\nelif chance == 5:\r\n print('5/6')\r\nelse:\r\n print('1/1')\r\n\r\n", "x,y = map(int, input().split())\n\nif x > y:\n z = x\nelse:\n z = y\n\nif z == 1:\n print('1/1')\nelif z == 2:\n print('5/6')\nelif z == 3:\n print('2/3')\nelif z == 4:\n print('1/2')\nelif z == 5:\n print('1/3')\nelif z == 6:\n print('1/6')\n", "from fractions import Fraction\r\nfrom math import gcd\r\n\r\nx,y=map(int,input().split())\r\nif x>y:\r\n greater=x\r\nelse:\r\n greater=y\r\nn=6-greater+1\r\nif n/6==0:\r\n print(\"0/1\")\r\nelif n//6==1:\r\n print(\"1/1\")\r\nelse:\r\n g=gcd(n,6)\r\n n=n//g\r\n p=6//g\r\n print('{0}/{1}'.format(n,p))\r\n", "a,b = list(map(int,input().split()))\r\nflag = max(a,b)\r\ncount = (6-flag)+1\r\nif count == 0:\r\n print(\"0/1\")\r\nif count == 1:\r\n print(\"1/6\")\r\nif count == 2:\r\n print(\"1/3\")\r\nif count == 3:\r\n print(\"1/2\")\r\nif count == 4:\r\n print(\"2/3\")\r\nif count == 5:\r\n print(\"5/6\")\r\nif count == 6:\r\n print(\"1/1\")", "import math\r\ny,w=list(map(int,input().split()))\r\nd=((6-max(y,w))+1)\r\nprint(str(d//(math.gcd(6,d)))+\"/\"+str(6//(math.gcd(6,d))))", "from fractions import Fraction as f\n\ny, w = map(int, input().split())\nres = f(7-max(y, w), 6)\n\nif str(res) == \"0\":\n print(\"0/1\")\nelif str(res) == \"1\":\n print(\"1/1\")\nelse:\n print(res)\n", "change = {'1':'1/1','2':'5/6','3':'2/3','4':'1/2','5':'1/3','6':'1/6'}\r\nsave = input()\r\nif int(save[0]) > int(save[2]):\r\n print(change[save[0]])\r\nelse:\r\n print(change[save[2]])", "a,b=map(int,input().split( \" \"))\r\nif a>=b:\r\n max=a\r\nelse:\r\n max=b\r\nlista=[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nD=6-max\r\nprint(lista[D])", "a,b = input().split()\r\n\r\na = int(a)\r\nb = int(b)\r\n\r\nc = int(7 - max(a,b))\r\n\r\nif c == 6:\r\n print(\"1/1\")\r\nelif c%2 == 0:\r\n print (str(int(c/2))+\"/3\")\r\nelif c%3 == 0:\r\n print (str(int(c/3))+\"/2\")\r\nelse:\r\n print (str(int(c))+\"/6\")\r\n \r\n", "from fractions import Fraction\r\nY,W=map(int,input().split())\r\nif( Fraction(7-max(Y,W),6) ==1 ):\r\n print(\"1/1\")\r\nelif (Fraction(7-max(Y,W),6) ==0): ##not applicable aslan :v\r\n print(\"0/0\")\r\nelse:\r\n print(Fraction(7-max(Y,W),6))", "from fractions import Fraction\r\n\r\ndef main(y, w):\r\n return Fraction((6 - max(y, w) + 1) / 6).limit_denominator()\r\n\r\nif __name__ == \"__main__\":\r\n y, w = map(int, input().split())\r\n\r\n n = main(y, w)\r\n\r\n print(f\"{n.numerator}/{n.denominator}\")", "a, b = map(int, input().split())\r\nx = 6 - max(a, b)\r\nprint(['1/6', '1/3', '1/2', '2/3', '5/6', '1/1'][x])", "from fractions import Fraction\r\nimport math\r\nx = str(input()).split(\" \")\r\na = int(x[0])\r\nif int(x[1]) > int(x[0]):\r\n a = int(x[1])\r\n\r\nresult = float((6-(a-1)) / 6)\r\nresult = Fraction.from_float(result).limit_denominator()\r\nif result == 1:\r\n print(f'{result}/1')\r\nelse: \r\n print(result)\r\n\r\n\r\n", "a=max(map(int, input().split()))\r\nn=['','1/1','5/6', '2/3', '1/2', '1/3', '1/6']\r\nprint(n[a])", "s=map(int,input().split())\r\nmaxmum=max(s)\r\nres=(6-maxmum)+1\r\nfractions=['0/6','1/6','1/3','1/2','2/3','5/6','1/1']\r\nprint(fractions[res])\r\n", "if __name__ == '__main__':\n yakko, wakko = [int(i) for i in input().split()]\n result = 6 - max(yakko, wakko) + 1\n if result == 2:\n print(\"1/3\")\n elif result == 3:\n print(\"1/2\")\n elif result == 4:\n print(\"2/3\")\n elif result == 6:\n print(\"1/1\")\n else:\n print(str(result) + \"/6\")\n\n \t \t\t\t \t \t\t \t \t \t\t\t\t", "from fractions import Fraction\r\nx, y = map(int, input().split())\r\ndot = 0\r\nif x > y:\r\n dot = ((6 - x) + 1)\r\n print(Fraction(dot, 6))\r\nelif y > x:\r\n dot = ((6 - y) + 1)\r\n print(Fraction(dot, 6))\r\nelif x == y & x ==1 & y== 1:\r\n dot ='1/1'\r\n print(dot)\r\nelif x == y &x !=1:\r\n dot = ((6 - y) + 1)\r\n print(Fraction(dot, 6))\r\n\r\n", "y,w = map(int, input().rstrip().split())\r\nm = max(y,w)\r\nm = 6-m+1\r\nif m==6:\r\n print(\"1/1\")\r\nelif m==0:\r\n print(\"0/1\")\r\nelif m%2==0:\r\n print(\"{}/3\".format(m//2))\r\nelif m%3==0:\r\n print(\"{}/2\".format(m//3))\r\nelse:\r\n print(\"{}/6\".format(m))", "from fractions import Fraction\r\ndef invr():\r\n return(map(int,input().split()))\r\nwakko,yakko = invr()\r\nlarger = max(wakko,yakko)\r\n\r\nprobability = Fraction(7-larger,6)\r\n\r\nif probability == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(probability)\r\n", "# 6 sided die \r\n# Yakko and Wakko rolled die and \r\n# their results are Y and W \r\nY, W = map(int, input().split()) \r\nlst = [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nchance = max(Y, W)\r\nprint(lst[chance])", "a,b = map(int,input().split())\r\nm = max(a,b)\r\ns = 6-m+1\r\nif s==1:\r\n print('1/6') \r\nelif s==2:\r\n print('1/3') \r\nelif s==3:\r\n print('1/2')\r\nelif s==4:\r\n print('2/3') \r\nelif s==5:\r\n print('5/6') \r\nelif s==6:\r\n print('1/1') \r\n\r\n", "import math\r\na,b=map(int,input().split())\r\nc=6-max(a,b)+1\r\na=math.gcd(c,6)\r\nc//=a\r\nprint(c,\"/\",6//a,sep=\"\")\r\n", "def gcd(a, b):\r\n if(b == 0):\r\n return a\r\n else:\r\n return gcd(b, a % b)\r\ndef reduceFraction(x, y) :\r\n \r\n d = gcd(x, y);\r\n \r\n x = x // d;\r\n y = y // d;\r\n \r\n print(str(x)+\"/\"+str(y))\r\nx, y = [int(x) for x in input().split()]\r\nif x>y:\r\n reduceFraction(7-x,6)\r\nelse:\r\n reduceFraction(7-y,6)", "x, y = map(int, input().split())\r\np = 7 - max(x, y)\r\nif p == 1: print('1/6')\r\nelif p == 2: print('1/3')\r\nelif p == 3: print('1/2')\r\nelif p == 4: print('2/3')\r\nelif p == 5: print('5/6')\r\nelse: print('1/1')", "n,k=map(int,input().split())\r\na=max(n,k)\r\nb=6-a+1\r\nif b==0:\r\n print(\"0/1\")\r\nelif b==1:\r\n print(\"1/6\")\r\nelif b==2:\r\n print(\"1/3\")\r\nelif b==3:\r\n print(\"1/2\")\r\nelif b==4:\r\n print(\"2/3\")\r\nelif b==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "import sys\r\ny,w=(list(map(int,sys.stdin.readline().split())))\r\nd=6\r\nn=d+1-max(y, w)\r\nfor i in range(2, 4):\r\n if n%i==0:\r\n n //= i\r\n d //= i\r\nprint(f'{n}/{d}')", "light=[\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\npan=list(map(int,input().split()))\r\nm=max(pan)\r\nprint(light[m])", "a, b = map(int,input().split())\r\nz = max(a,b)\r\nz = 6-z+1\r\nif z%2==0 and z!=6:\r\n z = z//2\r\n print(str(z)+'/3')\r\nelif z%3==0 and z!=6:\r\n print('1/2')\r\nelif z==6:\r\n print('1/1')\r\nelif z==5:\r\n print('5/6')\r\nelif z==1:\r\n print('1/6')", "import math\r\nuser_input = input()\r\ninputs = user_input.split(' ')\r\ninputs.sort()\r\ndot = 6 - int(inputs[1]) + 1\r\n#print(dot)\r\nif dot == 1:\r\n print(\"1/6\")\r\nelif dot == 2:\r\n print(\"1/3\")\r\nelif dot == 3:\r\n print(\"1/2\")\r\nelif dot == 4:\r\n print(\"2/3\")\r\nelif dot == 5:\r\n print(\"5/6\")\r\nelif dot == 6:\r\n print(\"1/1\")", "A, B = map(int, input().split(\" \"))\r\nmaxvalue = max(A, B)\r\ni = maxvalue\r\ncounter = 0\r\nwhile i <= 6:\r\n i += 1\r\n counter += 1\r\nimport math\r\ngcd = math.gcd(counter, 6)\r\nprint(f\"{counter // gcd}/{6 // gcd}\")\r\n", "from fractions import Fraction as frac\r\n\r\nn = map(int, input().split(\" \"))\r\nd = 7- max(n)\r\n\r\nif d/6 == 1:\r\n print(\"1/1\")\r\nelif d/6 == 0:\r\n print(\"0/1\")\r\nelse:\r\n\r\n print(frac(d, 6))\r\n\r\n", "from fractions import Fraction \r\n#citim datele din input\r\ny, w = map(int,input().strip().split())\r\n\r\n#gasim care are cel mai multe puncte\r\nif y >= w:\r\n #7 deoarece daca Dot are aceeasi puncte ca si cel mai mare punctaj, el castiga\r\n numerator = 7 - y\r\nelse:\r\n numerator = 7 - w\r\n\r\n#denominator o sa fie mereu 6, 6 fete are zarul\r\ndenominator = 6\r\n\r\n#verificam daca putem simplifica cu 2\r\nif numerator % 2 == 0:\r\n #daca da, simplificam si numerator si denominator-ul\r\n numerator /= 2\r\n denominator /= 2\r\n#verificam daca putem simplifica cu 3\r\nif numerator % 3 == 0:\r\n #daca da, simplificam si numaratorul si numitorul\r\n numerator /= 3\r\n denominator /= 3\r\n#transformam rezultatul in string\r\nresult = str(int(numerator)) + \"/\" + str(int(denominator))\r\n#printam rezultatul\r\nprint(result)", "c=[int(x) for x in input().split()]\r\np=7-max(c)\r\nif p==0: print(\"0/1\")\r\nelif p==6: print(\"1/1\")\r\nelif p%2==0: print(f\"{p//2}/3\")\r\nelif p%3==0: print(\"1/2\")\r\nelse: print(f\"{p}/6\")", "yak,wak=[int(x) for x in input().split()]\r\nmaxx=max(yak,wak)\r\ncount=0\r\nfor i in range(1,7):\r\n if i>=maxx:\r\n count+=1\r\nli1=[float(x/6) for x in range(1,7)]\r\nli2=['1/6','1/3','1/2','2/3','5/6','1/1']\r\nprint(li2[li1.index(count/6)])", "x,y = map(int, input().split())\r\nx = max(x,y)\r\nls = [ '1/1' , '5/6' , '2/3', '1/2', '1/3', '1/6' ] \r\nprint(ls[x-1])", "y, w = map(int, input().split())\n\nma = max(y, w)\n\nnumerator = 6 - ma + 1\ndenominator = 6\n\nif denominator % 2 == 0 and numerator % 2 == 0:\n denominator = denominator // 2\n numerator = numerator // 2\nif denominator % 3 == 0 and numerator % 3 == 0:\n denominator = denominator // 3\n numerator = numerator // 3\nprint(f\"{numerator}/{denominator}\")\n", "y,k=input().split()\ny=int(y)\nk=int(k)\nmin=max(y,k)\nnum=6-min+1\nden=6\nif(num%6==0):\n num=num/6\n den=den/6\nif(num%3==0):\n num=num/3\n den=den/3\nif(num%2==0):\n num=num/2\n den=den/2\nprint(int(num),end=\"\")\nprint(\"/\",end=\"\")\nprint(int(den))\n\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\nc=6-max(a,b)+1\r\n\r\nimport math\r\ne=math.gcd(c,6)\r\ns=str(c//e)+'/'+str(6//e)\r\nprint(s)\r\n", "import fractions as f\r\na,b = map(int,input().split())\r\ntemp = 7 - max(a,b)\r\nx = f.gcd(temp,6)\r\nprint(str(temp//x)+\"/\"+str(6//x))\r\n", "#!/usr/bin/env python3\n\nfrom fractions import gcd\n\na, b = 6, 7 - max(int(x) for x in input().split())\ng = gcd(a, b)\na //= g\nb //= g\nprint(\"%d/%d\" % (b, a))\n", "from fractions import Fraction\r\nC=int(max(input().split()))\r\nscore=int(7-C)\r\nif C!=1:\r\n print(Fraction(score,6))\r\nelse:\r\n print(\"1/1\")", "a, b = map(int, input().split())\r\nm = max(a, b)\r\nif m == 0:\r\n print ('0/1')\r\nif m == 1:\r\n print ('1/1')\r\nif m == 2:\r\n print ('5/6')\r\nif m == 3:\r\n print ('2/3')\r\nif m == 4:\r\n print ('1/2')\r\nif m == 5:\r\n print ('1/3')\r\nif m == 6:\r\n print ('1/6')", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=0\r\nfor i in range(1,7):\r\n if i>=a and i>=b:\r\n c+=1\r\nif c==0:\r\n print(\"0/1\")\r\nelif c==1:\r\n print(\"1/6\")\r\nelif c==2:\r\n print(\"1/3\")\r\nelif c==3:\r\n print(\"1/2\")\r\nelif c==4:\r\n print(\"2/3\")\r\nelif c==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")\r\n", "y,w=input().split()\r\nj=max(int(y),int(w))\r\nj= (7-j)/6\r\nj=round(j,2)\r\n#print (j)\r\nif j==0 :print(\"0/1\")\r\nelif j==0.5:print(\"1/2\")\r\nelif j==0.33:print(\"1/3\")\r\nelif j==0.67:print(\"2/3\")\r\nelif j==0.17:print(\"1/6\")\r\nelif j==0.83:print(\"5/6\")\r\nelif j==1 :print(\"1/1\")", "w = list(map(int,input().split()))\r\nlst = [\"\",\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nprint(lst[max(w[0],w[1])])", "def gcd(a, b):\r\n if a % b == 0:\r\n return b\r\n return gcd(b, a % b)\r\n \r\n\r\nif __name__ == '__main__':\r\n y, w = map(int, input().split())\r\n\r\n numerator = 6 - abs(max(y, w)) + 1\r\n _gcd = gcd(numerator, 6)\r\n print('{}/{}'.format(numerator // _gcd, 6 // _gcd))", "import math\r\nk, m = map(int, input().split())\r\nd = 7 - (max(k,m))\r\nprint(d//math.gcd(d,6),\"/\",6//math.gcd(d,6), sep='')", "import math\r\nx,y=map(int,input().split())\r\nm=max(x,y)\r\nl=6-m+1\r\nk=math.gcd(l,6)\r\nprint(f\"{l //k}/{6 // k}\")", "a,b = map(int,input().split())\r\nl = [1,2,3,4,5,6]\r\nc = 0\r\nfor i in l :\r\n if i >= max(a,b) :\r\n c += 1\r\nl = c/6\r\na = []\r\nfor i in range(1,1000) :\r\n for j in range(1,1000) :\r\n if i / j == l :\r\n a = [i,j]\r\n break\r\n if len(a) != 0 :\r\n break\r\n\r\nprint(str(a[0]) + \"/\" + str(a[1]))", "y , w = map(int,input().split())\r\nm = max(y,w)\r\nif m == 1 : print(\"1/1\")\r\nelif m == 2 : print(\"5/6\")\r\nelif m == 3 : print(\"2/3\")\r\nelif m == 4 : print(\"1/2\")\r\nelif m == 5 : print(\"1/3\")\r\nelse : print(\"1/6\")\r\n", "a,b=map(int,input().split())\r\np=max(a,b)\r\nif p==1:\r\n print(\"1/1\")\r\nelif p==2:\r\n print(\"5/6\")\r\nelif p==3:\r\n print('2/3')\r\nelif p==4:\r\n print(\"1/2\")\r\nelif p==5:\r\n print(\"1/3\")\r\nelif p==6:\r\n print('1/6')\r\nelse:\r\n print('0/1')", "y, w = map(int, input().split())\nt = max(y, w)\na = 0\nfor i in range(t, 7):\n a += 1\nif a == 1:\n print('1/6')\nelif a == 2:\n print('1/3')\nelif a == 3:\n print('1/2')\nelif a == 4:\n print('2/3')\nelif a == 5:\n print('5/6')\nelif a == 6:\n print('1/1')\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\ns=['1/6','1/3','1/2','2/3','5/6','1/1']\r\n#print(s[0])\r\ns1=max(a,b)\r\ns2=int(6-s1)\r\n#print(s2)\r\nif s2+1==1:\r\n print(s[0])\r\nelif s2+1==2:\r\n print(s[1])\r\nelif s2+1==3:\r\n print(s[2])\r\nelif s2+1==4:\r\n print(s[3])\r\nelif s2+1==5:\r\n print(s[4])\r\nelif s2+1==6:\r\n print(s[5])\r\n", "import math\r\ny,w=map(int,input().split())\r\na=7-max(y,w)\r\nif 6%a==0:\r\n b=6//a\r\n print('1'+'/'+str(b))\r\nelif math.gcd(a,6)>1:\r\n x=a//math.gcd(a,6)\r\n y=6//math.gcd(a,6)\r\n print(str(x)+'/'+str(y))\r\nelse:\r\n print(str(a)+'/'+str(6))\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\ndef die_roll(y, w):\r\n num = 6 - max(y, w) + 1\r\n denom = 6\r\n if num % 2 == 0:\r\n num //= 2\r\n denom //= 2\r\n if num % 3 == 0:\r\n num //= 3\r\n denom //= 3\r\n return \"{}/{}\".format(num, denom)\r\n\r\ny, w = map(int, input().split())\r\nans = die_roll(y, w)\r\nprint(ans)\r\n", "# 9-A-DieRoll.py\r\n\r\nimport math\r\n\r\ndef computeGCD(a, b):\r\n\r\n if b == 0:\r\n return a\r\n\r\n return computeGCD(b, a%b)\r\n\r\ndef createFraction(goodCases, totalCases):\r\n\r\n if goodCases == 0:\r\n return \"0/1\"\r\n\r\n elif goodCases == totalCases:\r\n return \"1/1\"\r\n\r\n a = goodCases\r\n b = totalCases\r\n gcdAB = computeGCD(a, b)\r\n\r\n return str(a//gcdAB) + \"/\" + str(b//gcdAB)\r\n\r\nY, W = [int(x) for x in input().split()]\r\ngoodCases = (6 - max(Y, W)) + 1\r\ntotalCases = 6\r\nprint(createFraction(goodCases, totalCases))", "l=[\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nx=list(map(int,input().split()))\r\nm=max(x)\r\nprint(l[m])\r\n", "import math\r\nx,y = list(map(int,input().split()))\r\nx=max(x,y)\r\nx=6-x+1\r\ng = math.gcd(x,6)\r\nprint(str(x//g)+'/'+str(6//g))", "nums = input().split()\r\n\r\nif nums[0] > nums[1]:\r\n max_num = int(nums[0])\r\nelse:\r\n max_num = int(nums[1])\r\n\r\nr = (7 - max_num) / 6\r\nif r == 0:\r\n print('0/1')\r\nelif r == 1/6:\r\n print('1/6')\r\nelif r == 1/3:\r\n print('1/3')\r\nelif r == 1/2:\r\n print('1/2')\r\nelif r == 2/3:\r\n print('2/3')\r\nelif r == 5/6:\r\n print('5/6')\r\nelse:\r\n print('1/1')", "Y, W = list(map(int, input().split()))\nmaior = max(Y,W)\nr = 6-maior+1\nif r == 0:\n print(\"0/1\")\nif r == 1:\n print(\"1/6\")\nelif r == 2:\n print(\"1/3\")\nelif r == 3:\n print(\"1/2\")\nif r == 4:\n print(\"2/3\")\nif r == 5:\n print(\"5/6\")\nelif r == 6:\n print(\"1/1\")\n\t\t \t \t\t \t \t\t\t\t\t \t \t \t \t\t", "from fractions import Fraction\r\na,b=map(int,input().split())\r\nif(a>=b):\r\n max=a\r\nelse:\r\n max=b\r\nc=6-max+1\r\nif c==0:\r\n print(\"0/1\")\r\nelif c==6:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(c,6))", "from fractions import Fraction\r\ny,w=input().split()\r\ny,w=int(y),int(w)\r\nm=max(y,w)\r\nn=6-(m-1)\r\np=Fraction(n,6)\r\nif p==0:\r\n print(\"0/0\")\r\nelif p==1:\r\n print(\"1/1\")\r\nelse:\r\n print(p)", "from fractions import Fraction\r\nx = input()\r\nx = x.split(' ')\r\nif x[0] > x[1] :\r\n x.pop(1)\r\nelse :\r\n x.pop(0)\r\nr = x[0]\r\nr = int(r)\r\nr = 6 - r\r\nr = r + 1\r\nf = Fraction(r , 6)\r\nprint(str(f.numerator) + '/' + str(f.denominator))\r\n", "a=list(map(int,input().split()))\r\nb=max(a)\r\nc=6-b+1\r\nd=6\r\nfor r in range(2,7):\r\n if(c%r==0 and d%r==0):\r\n c=c/r\r\n d=d/r\r\nprint(str(int(c))+\"/\"+str(int(d)))\r\n", "from fractions import Fraction\r\ny,w = map(int,input().split())\r\nm = max(y,w)\r\nnumerator = 7 - m\r\nif numerator == 6:\r\n print(\"1/1\")\r\nelif numerator == 0:\r\n print(\"0/1\")\r\nelse:\r\n print(Fraction(numerator,6))", "y,w = map(int,input().split())\r\nm = max(y,w)\r\na = [0,1,2,3,4,5,6]\r\nkd = 0\r\nfor i in range(len(a)):\r\n if a[i]>=m:\r\n kd+=1\r\np = kd/6\r\nif 6%kd==0:\r\n a = 1\r\n b = 6//kd\r\n print(f'{a}/{b}')\r\nelif p==0:\r\n print('0/1')\r\nelif p==1:\r\n print('1/1')\r\nelif 6%kd!=0 and kd!=4:\r\n a = kd\r\n b = 6\r\n print(f'{a}/{b}')\r\nelif kd == 4:\r\n a = kd//2\r\n b = 3\r\n print(f'{a}/{b}')\r\n", "y , w=input().split()\ny= int(y)\nw=int(w)\nu= max(y,w)\na=7-u\nb=6\nif a%2==0 and b%2==0:\n a=a/2\n b=b/2\nif a%3==0 and b%3==0:\n a=a/3\n b=b/3\nprint(str(int(a))+'/'+str(int(b)))\n", "from math import gcd\nn, m = map(int, input().strip().split())\nnum = 6-max(n, m)+1\nden = 6\ng = gcd(num, den)\nnum //= g\nden //= g\nprint(str(num) + '/' + str(den))\n", "first, second = [int(x) for x in input().split()]\r\nmax_num = max(first, second)\r\nnumerator = 7 - max_num\r\ndenominator = 6\r\nif numerator % 2 == 0:\r\n numerator = int(numerator / 2)\r\n denominator = int(denominator / 2)\r\nif numerator % 3 == 0:\r\n numerator = int(numerator / 3)\r\n denominator = int(denominator / 3)\r\nprint(str(numerator) + \"/\" + str(denominator))\r\n", "s,t = map(int,input().split( ))\r\nu = max(s,t)\r\nu = 6-u+1\r\nif u%2==1:\r\n if u==3:\r\n print(\"1/2\")\r\n elif u==1:\r\n print(\"1/6\")\r\n else:\r\n print(\"5/6\")\r\nelse:\r\n if u==4:\r\n print(\"2/3\")\r\n elif u==2:\r\n print(\"1/3\")\r\n else:\r\n print(\"1/1\")", "a,b=map(int,input().split())\r\nb=max(a,b)\r\na=6-b+1\r\nif a/6==1/6:\r\n\tprint('1/6')\r\nelif a/6==2/6:\r\n\tprint('1/3')\r\nelif a/6==3/6:\r\n\tprint('1/2')\r\nelif a/6==4/6:\r\n\tprint('2/3')\r\nelif a/6==5/6:\r\n\tprint('5/6')\r\nelif a/6==6/6:\r\n\tprint('1/1')", "from math import gcd\r\na,b=map(int,input().split())\r\nmaxi=max(a,b)\r\nremain=(6-maxi)+1\r\nif gcd(remain,6)>1:\r\n first=6//gcd(remain,6)\r\n second=remain//gcd(remain,6)\r\n print(str(second)+'/'+str(first))\r\nelse: \r\n print(str(remain)+'/'+str(6))", "h=input()\r\nh=h.split()\r\na=int(h[0])\r\nb=int(h[1])\r\nmx=max(a,b)\r\nm=6-mx+1\r\nif m==6:\r\n print('1/1')\r\nif m==5:\r\n print('5/6')\r\nif m==4:\r\n print('2/3')\r\nif m==3:\r\n print('1/2')\r\nif m==2:\r\n print('1/3')\r\nif m==1:\r\n print('1/6')", "Yakko , Wakko = map(int , input().split(\" \"))\n\nprobability = {1: \"1/6\" , 2 : \"1/3\" , 3 : \"1/2\" , 4: \"2/3\" , 5 : \"5/6\" , 6 : \"1/1\"}\n\nprint(probability[len(range(max(Yakko , Wakko) , 7))])\n", "from fractions import Fraction\r\nx,y=map(int,input().split())\r\nans=Fraction(6-max(x,y)+1,6)\r\nif (ans==1):\r\n print('1/1')\r\nelse:\r\n print(ans)", "y,w = map(int, input().split());q = [\" \",\"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"];d = max(y,w);print(q[d])\r\n", "\r\nimport math\r\n\r\nY, W = map(int, input().split())\r\n\r\na, b = 7-max(Y, W), 6\r\n\r\ng = math.gcd(a, b)\r\n\r\nprint(f\"{a//g}/{b//g}\")\r\n\r\n", "import sys\nY, W = map(int, sys.stdin.readline().split())\na = 7 - max(Y,W)\nif a == 6:\n print(\"1/1\")\nelif a == 5:\n print(\"5/6\")\nelif a == 4:\n print(\"2/3\")\nelif a == 3:\n print(\"1/2\")\nelif a == 2:\n print(\"1/3\")\nelse:\n print(\"1/6\")\n\n", "print(('111251'+'/'*6+'632361')[6-max(map(int,input().split()))::6])", "l=[int(ele) for ele in input().split()]\r\nm=max(l)\r\na,b=7-m,6\r\nk=int(6/a)\r\nif a==4:print('2/3')\r\nif 6%a==0:print('1/%d'%k)\r\nelif a==5:print('5/6')", "nums = 7 - max(map(int, input().split()))\n\nif nums == 3:\n print(\"1/2\")\nelif nums == 2:\n print(\"1/3\")\nelif nums == 4:\n print(\"2/3\")\nelif nums == 0:\n print(\"0/1\")\nelif nums == 6:\n print(\"1/1\")\nelse:\n print(f\"{nums}/6\")", "m,n = list(map(int,input().split()))\na=max(n,m)\np=(6-a)/6\nif(p==0): print(f'1/6')\nelif(p==1/6): print(f'1/3')\nelif(p==2/6): print(f'1/2')\nelif(p==3/6): print(f'2/3')\nelif(p==4/6): print(f'5/6')\nelse: print(f'1/1')\n\n\n\t\t\t\t\t\t\t \t \t \t \t\t\t\t \t \t", "a, b = map(float, input().split())\r\nprob = (7-max(a, b))\r\nif prob == 1:\r\n print(\"1/6\")\r\nelif prob == 2:\r\n print(\"1/3\")\r\nelif prob == 3:\r\n print(\"1/2\")\r\nelif prob == 4:\r\n print(\"2/3\")\r\nelif prob == 5:\r\n print(\"5/6\")\r\nelif prob == 6:\r\n print(\"1/1\")\r\n", "import math\r\na,b=map(int,input().split())\r\nn=6-max(a,b)+1\r\ng=math.gcd(n,6)\r\nprint(n//g,'/',6//g,sep='')", "a, b = map(int,input().split())\r\nc = []\r\nc.append(a)\r\nc.append(b)\r\nd = max(c)\r\nif d == 6 :\r\n print(\"1/6\")\r\nif d == 5:\r\n print(\"1/3\")\r\nif d == 4:\r\n print(\"1/2\")\r\nif d == 3:\r\n print(\"2/3\")\r\nif d == 2:\r\n print(\"5/6\")\r\nif d == 1:\r\n print(\"1/1\")\r\n", "#!/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(map(int, input().split())))\n\n\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\n\n\ndef invr():\n return(map(int, input().split()))\n\n\nif __name__ == \"__main__\":\n a, b = invr()\n m = 7 - max(a, b)\n if m == 6:\n print('1/1')\n if m == 5:\n print('5/6')\n if m == 4:\n print('2/3')\n if m == 3:\n print('1/2')\n if m == 2:\n print('1/3')\n if m == 1:\n print('1/6')\n", "x = [int(i) for i in input().split()]\r\n\r\nif(x[0]>x[1]):\r\n dot = x[0]\r\nelse:\r\n dot = x[1]\r\n\r\ndot = 6-dot+1\r\n\r\nif(dot==0): print(\"0/1\")\r\nif(dot==1): print(\"1/6\")\r\nif(dot==2): print(\"1/3\")\r\nif(dot==3): print(\"1/2\")\r\nif(dot==4): print(\"2/3\")\r\nif(dot==5): print(\"5/6\")\r\nif(dot==6): print(\"1/1\")\r\n", "import math\r\nn=6-max(map(int,input().split()))+1\r\ng=math.gcd(n,6)\r\nprint(f'{n//g}/{6//g}')", "from fractions import Fraction\r\n\r\n\r\ny,w = [int(x) for x in input().split(\" \")]\r\n\r\nmax_probability = max(y,w)\r\n\r\nlist_of_numbers =[]\r\n\r\nwhile (max_probability <= 6):\r\n list_of_numbers.append(max_probability)\r\n max_probability +=1\r\n\r\nif len(list_of_numbers) == 6:\r\n print(\"1/1\")\r\nelif len(list_of_numbers) == 0:\r\n print(\"0/1\")\r\nelse:\r\n print(Fraction(len(list_of_numbers)/6).limit_denominator())\r\n\r\n", "y,w=[int(h) for h in input().split()]\r\nf=6-max(y,w)+1\r\ng=6\r\nfrom math import gcd\r\ns=gcd(f,g)\r\nf//=s\r\ng//=s\r\nprint(f,\"/\",g,sep=\"\")\r\n", "from fractions import Fraction\r\na1, a2 = list(map(int, input().split()))\r\na3 = max(a1, a2)\r\na4 = abs((a3 - 1) - 6)\r\na5 = Fraction(a4, 6)\r\nprint(f\"{a5.numerator}/{a5.denominator}\")\r\n", "[A, B] = map(int, input().split())\nmsgs = [\"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\nmax_boi = max(A, B)\nprint(msgs[max_boi - 1])\n", "a, b = map(int, input().split())\r\nc = 7 - max(a,b)\r\ng = 6\r\n\r\nif (c%3 == 0):\r\n c = int(c/3)\r\n g = int(g/3)\r\n\r\nif (c%2 == 0):\r\n c = int(c/2)\r\n g = int(g/2)\r\n \r\nprint(str(c) + '/' + str(g))\r\n\r\n", "a = input().split()\r\nn1 = int(a[0])\r\nn2 = int(a[1])\r\nn = max(n1,n2)\r\nl = [1,2,3,4,5,6]\r\nfor i in range(1,n):\r\n l.remove(i)\r\nsix = 6\r\nn = len(l)\r\nfor i in range(2,6):\r\n if n%i==0 and six%i==0:\r\n n/=i\r\n six/=i\r\nif len(l)==6:\r\n print(\"1/1\")\r\nelif len(l)==0:\r\n print(\"0/1\")\r\nelse:\r\n print(str(int(n))+\"/\"+str(int(six)))", "a=input().split()\r\nb=[int(i) for i in a]\r\nk=max(b)\r\nif 7-k==0:\r\n print(\"0/1\")\r\nelif (7-k)==1:\r\n print(\"1/6\")\r\nelif (7-k)==2:\r\n print(\"1/3\")\r\nelif (7-k)==3:\r\n print(\"1/2\")\r\nelif (7-k)==4:\r\n print(\"2/3\")\r\nelif (7-k)==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")\r\n", "a,b = input().split()\r\na = int(a)\r\nb=int(b)\r\nmaxAB=max(a,b)\r\nif maxAB==1:\r\n print(\"1/1\")\r\nelif maxAB==2:\r\n print(\"5/6\")\r\nelif maxAB==3:\r\n print(\"2/3\")\r\nelif maxAB==4:\r\n print(\"1/2\")\r\nelif maxAB==5:\r\n print(\"1/3\")\r\nelif maxAB==6:\r\n print(\"1/6\")\r\n", "from math import gcd\r\n\r\n\r\ndef reduceFraction(x, y):\r\n d = gcd(x, y)\r\n\r\n x = x // d\r\n y = y // d\r\n\r\n return '{}/{}'.format(x, y)\r\n\r\n\r\n'''\r\ndef GCD(a, b):\r\n if b == 0:\r\n return a\r\n return GCD(b, a % b)\r\n'''\r\n\r\nY, W = [int(item) for item in input().split()]\r\n'''\r\nif Y > W:\r\n N = 6 - Y + 1\r\n print(reduceFraction(N, 6))\r\nelse:\r\n N = 6 - W + 1\r\n print(reduceFraction(N, 6))\r\n'''\r\nMroll = max(Y, W)\r\ndotCh = 6 - Mroll + 1\r\n\r\nprint(reduceFraction(dotCh, 6))\r\n", "t = max (tuple (map (int, input ().split (' ')))) - 1\r\nfrac = ['1/1', '5/6', '2/3', '1/2', '1/3', '1/6'] [t]\r\nprint (frac)", "a,b=input().split()\r\nk = 7-max(int(a),int(b))\r\nif k==1:\r\n print(\"1/6\")\r\nelif k==2:\r\n print(\"1/3\")\r\nelif k==3:\r\n print(\"1/2\")\r\nelif k==4:\r\n print(\"2/3\")\r\nelif k==5:\r\n print(\"5/6\")\r\nelif k==6:\r\n print(\"1/1\")\r\nelse:\r\n print(\"0/1\")", "a, b = input().split(' ')\r\na, b = int(a), int(b)\r\n\r\nm = max([a, b])\r\nneed_to_get = 7-m\r\n\r\nif need_to_get==6:\r\n print(\"1/1\")\r\nelif 6%need_to_get==0:\r\n print(f\"1/{int(6/need_to_get)}\")\r\nelif 6%need_to_get!=0 and need_to_get%2==0:\r\n print(f\"{int(need_to_get/2)}/{int(6/2)}\")\r\nelse:\r\n print(f\"{need_to_get}/6\")\r\n", "from fractions import Fraction\r\na,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nm = max(a,b)\r\np1 = Fraction((6-m+1)/6)\r\nif p1==1:\r\n print('1/1')\r\nelse:\r\n print(p1.limit_denominator(6))\r\n", "from fractions import Fraction\ny, w = [int(x) for x in input().split()]\nif y > w:\n w = y\nif w == 1:\n print(\"1/1\")\nelse:\n print(Fraction(7-w,6))\n\t \t \t\t\t \t \t \t\t \t\t\t \t", "a, b = [str(x) for x in input().split()]\n\nans = 7 - int(max(a, b))\n\nif ans == 6:\n print('1/1')\nif ans == 5:\n print('5/6')\nif ans == 4:\n print('2/3')\nif ans == 3:\n print('1/2')\nif ans == 2:\n print('1/3')\nif ans == 1:\n print('1/6')\n", "a, b = list(map(int, input().split()))\r\n\r\nnum = 6-max(a, b)+1\r\nden = 6\r\nif num % 2 == 0:\r\n num /= 2\r\n den /= 2\r\n \r\nif den % num == 0:\r\n den /= num\r\n num /= num\r\n \r\n\r\nprint(\"%d/%d\" % (num, den))", "y, w = map(int, input().split())\r\nx = ['1/1', '5/6', '2/3', '1/2', '1/3', '1/6']\r\nz = max(y, w) -1\r\nprint(x[z])", "y, w = input().split()\r\nmaxx=max(int(y),int(w))\r\nresult=(6-maxx+1)/6\r\nif result==1/6:\r\n print('1/6')\r\nelif result==2/6:\r\n print('1/3')\r\nelif result==3/6:\r\n print('1/2')\r\nelif result==4/6:\r\n print('2/3')\r\nelif result==5/6:\r\n print('5/6')\r\nelif result==1:\r\n print('1/1')\r\nelse:\r\n print('0/1')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 11 20:40:00 2020\r\n\r\n@author: akprasad\r\n\"\"\"\r\n\r\nif __name__ == '__main__':\r\n a, b = [int(x) for x in input().split()]\r\n if max(a, b) == 1:\r\n print(\"1/1\")\r\n elif max(a, b) == 2:\r\n print(\"5/6\")\r\n elif max(a, b) == 3:\r\n print(\"2/3\")\r\n elif max(a, b) == 4:\r\n print(\"1/2\")\r\n elif max(a, b) == 5:\r\n print(\"1/3\")\r\n else:\r\n print(\"1/6\")\r\n", "y=tuple(map(int,input().split()))\nchance = 6-max(y)+1\nif(chance==1):\n print(\"1/6\")\nelif(chance==2):\n print(\"1/3\")\nelif(chance==3):\n print(\"1/2\")\nelif(chance==4):\n print(\"2/3\")\nelif(chance==5):\n print(\"5/6\")\nelse:\n print('1/1')", "gm = [int(i) for i in input().split()]\r\nnpe = 7-max(gm)\r\n\r\nif npe == 1:\r\n print('1/6')\r\nif npe == 2:\r\n print('1/3')\r\nif npe == 3:\r\n print('1/2')\r\nif npe == 4:\r\n print('2/3')\r\nif npe == 5:\r\n print('5/6')\r\nif npe == 6:\r\n print('1/1')\r\n", "y,w = map(int, input().split( ))\r\nm = max(y, w)\r\n\r\nif m == 1:\r\n print(\"1/1\")\r\nelif m == 2:\r\n print(\"5/6\")\r\nelif m == 3:\r\n print(\"2/3\")\r\nelif m == 4:\r\n print(\"1/2\")\r\nelif m == 5:\r\n print(\"1/3\")\r\nelif m == 6:\r\n print(\"1/6\")\r\n \r\n\r\n'''\r\n1 1 Dot\r\n2 1\r\n3 1\r\n4 1\r\n5 1 \r\n6 1\r\n\r\n\r\n\r\n1 2 Dot\r\n2 2 Dot\r\n3 2\r\n4 2\r\n5 2\r\n6 2\r\n\r\n1 3 Dot\r\n2 3 Dot\r\n3 3 Dot\r\n4 3\r\n5 3\r\n6 3\r\n\r\n1 4 Dot\r\n2 4 Dot\r\n3 4 Dot\r\n4 4 Dot\r\n5 4\r\n6 4\r\n\r\n1 5 Dot\r\n2 5 Dot\r\n3 5 Dot\r\n4 5 Dot\r\n5 5 Dot\r\n6 5\r\n\r\n1 6 Dot\r\n2 6 Dot\r\n3 6 Dot\r\n4 6 Dot\r\n5 6 Dot\r\n6 6 Dot\r\n\r\n'''\r\n", "y,w=map(int,input().split())\r\nd=7-max(y,w)\r\nif(6%d==0):\r\n print('1'+'/'+str(int(6/d)))\r\nelif(d%2==0):\r\n print(str(int(d/2))+'/'+'3')\r\nelse:\r\n print(str(d)+'/'+'6')\r\n", "from fractions import Fraction \r\nn = list(map(int,input().split()))\r\nn.sort()\r\ns=0\r\nfor i in range(n[1],7,1):\r\n s =s +1 \r\nv=Fraction(s,6)\r\nif v == 1 :\r\n print(\"1/1\")\r\nelse :\r\n print(v)", "from fractions import Fraction\r\n\r\nY, W = map(int,input().split())\r\nD = 7 - max(Y,W)\r\nif D == 6:\r\n print('1/1')\r\nelse:\r\n print(Fraction(D,6))\r\n", "w, y = map(int, input().split())\r\nrn = max(w, y)\r\nrn = [i for i in range(rn, 7)]\r\nchance = len(rn)\r\nprob = 6\r\nwhile True:\r\n if chance % 3 == 0 and prob % 3 == 0:\r\n chance = chance // 3\r\n prob = prob // 3\r\n elif chance % 2 == 0 and prob % 2 == 0:\r\n chance = chance // 2\r\n prob = prob // 2\r\n else:\r\n break\r\nif chance/ prob == 0:\r\n print('0/1')\r\nelif chance / prob == 1:\r\n print('1/1')\r\nelse:\r\n print(f\"{chance}/{prob}\")\r\n", "print({1: '1/1', 2: '5/6', 3: '2/3', 4: '1/2', 5: '1/3', 6: '1/6'}[max(map(int, input().split()))])\n", "def findGCD(x,y):\r\n \r\n if x % y == 0:\r\n return y\r\n return findGCD(y,x%y)\r\n\r\na,b = map(int, input().split())\r\n\r\nc = max(a,b)\r\n\r\nno_of_posibility = 6 - c + 1\r\n\r\nx = findGCD(no_of_posibility,6)\r\n\r\nprint(str(no_of_posibility//x)+\"/\"+str(6//x))", "def gcd(a,b):\r\n res = 0\r\n for i in range(max(a,b),-1,-1):\r\n if(a % i == 0 and b % i == 0):\r\n res = i\r\n break\r\n return res\r\n\r\n\r\ny,w = map(int, input().split())\r\nchances = [x for x in range(max(y,w),7,+1)]\r\ncd = len(chances)\r\ns = 6\r\nprint(str(int(cd/gcd(cd,s))) + \"/\" + str(int(s/gcd(cd,s))))", "import math\r\ndef dierolls(r,p):\r\n maximum=max(r,p)\r\n i=6-maximum+1\r\n gcdd=math.gcd(i,6)\r\n print(str(i//gcdd)+'/'+str(6//gcdd)) \r\nr,p=map(int,input().split())\r\ndierolls(r,p)\r\n", "z=max([int(a)for a in input().split()])\r\nif z==1:print('1/1')\r\nif z==2:print('5/6')\r\nif z==3:print('2/3')\r\nif z==4:print('1/2')\r\nif z==5:print('1/3')\r\nif z==6:print('1/6')", "import math\n\ny, w = (int(x) for x in input().split())\nh = math.gcd(7 - max(y, w), 6)\nprint((7 - max(y, w)) // h, 6 // h, sep='/')", "a, b = map(int,input().split())\r\nh = max(a,b)\r\nif int(h) == 1:\r\n print('1/1')\r\nelif int(h) == 2:\r\n print('5/6')\r\nelif int(h) == 3:\r\n print('2/3')\r\nelif int(h) == 4:\r\n print('1/2')\r\nelif int(h) == 5:\r\n print('1/3')\r\nelif int(h) == 6:\r\n print('1/6')", "y, w = input().split()\ny = int(y)\nw = int(w)\nlist = ['1/6','1/3','1/2','2/3','5/6','1/1']\n\nr =max(y,w)\nprint(list[6-r])\n\t \t\t \t \t\t\t\t\t\t \t \t \t\t\t \t\t\t", "is_debug = False\r\n\r\ny, w = map(int, input().split())\r\nv = 6 - max(y, w) + 1\r\n\r\nif v in [2, 3, 6]:\r\n print(f\"{int(v/v)}/{int(6/v)}\")\r\nelif v in [4]:\r\n print(f\"2/3\")\r\nelse:\r\n print(f\"{v}/6\")\r\n", "a ,b = map(int,input().split())\nk = 7 - max(a,b)\nb1 = 6\nif k % 2 == 0 and b1 % 2 == 0:\n\tk //= 2\n\tb1 //= 2\nif k % 3 == 0 and b1 % 3 == 0:\n\tk = k // 3\n\tb1 = b1 //3\nprint(str(k) + \"/\"+str(b1))\n", "import math\r\ny,w=map(int,input().split())\r\nsc=7-max(y,w)\r\nif sc>0:\r\n print(str(sc//math.gcd(sc,6))+\"/\"+str(6//math.gcd(sc,6)))\r\nelse:\r\n print(\"0/1\")\r\n", "#!/usr/bin/env python\r\n# coding: utf-8\r\n\r\n# In[38]:\r\n\r\n\r\n#9A\r\ninp = list(map(int, input().split()))\r\nmx = max(inp)\r\nnmrr = 6 - mx + 1\r\ndmtr = 6\r\nfor i in (range(1, nmrr+1)[::-1]):\r\n if (dmtr % i == 0) and (nmrr % i == 0):\r\n dmtr = dmtr // i\r\n nmrr = nmrr // i\r\n break\r\nprint('{}/{}'.format(nmrr,dmtr))\r\n\r\n\r\n# In[ ]:\r\n\r\n\r\n\r\n\r\n", "import math\r\ny, w = map(int, input().split())\r\nd = 6 - max(y, w) + 1\r\ng = math.gcd(d, 6)\r\na = d // g \r\nb = 6 // g \r\nprint(f\"{a}/{b}\")", "n,k=map(int,input().split())\r\nm=max(n,k)\r\nl=[]\r\nfor i in range(m,7):\r\n l.append(i)\r\nif len(l)==1:\r\n print('1/6')\r\nelif len(l)==2:\r\n print('1/3')\r\nelif len(l)==3:\r\n print('1/2')\r\nelif len(l)==4:\r\n print('2/3')\r\nelif len(l)==5:\r\n print('5/6')\r\nelse:\r\n print('1/1')", "def probability_dot(y,w):\r\n #w >= 1 and w <= 6\r\n #y >= 1 and y <= 6\r\n a = max(w,y)\r\n p = 7 - a\r\n return p\r\n\r\n\r\ny, w = input().split()\r\np = probability_dot(int(y),int(w))\r\ndp = 6\r\nif p == 2:\r\n p = 1\r\n dp = 3\r\nelif p == 3:\r\n p = 1\r\n dp = 2\r\nelif p == 4:\r\n p = 2\r\n dp = 3\r\nelif p == 6:\r\n p = 1\r\n dp = 1\r\nprint(f\"{p}/{dp}\")", "import math\r\na,b=map(int,input().strip().split())\r\nc=6-max(a,b)+1\r\nd=6\r\ne=math.gcd(d,c)\r\n\r\nprint(str(c//e)+\"/\"+str(d//e))", "\ndef main():\n w, y = (int(i) for i in input().split())\n maxScore = max(w, y)\n numerator = 6 - (maxScore-1) # she will win if she has more or equal the maximum between their scores\n if(numerator == 6):\n print(\"1/1\")\n return\n if(numerator % 2 == 0):\n print(\"{}/3\".format(numerator // 2))\n return\n if(numerator % 3 == 0):\n print(\"{}/2\".format(numerator // 3))\n return\n print(\"{}/6\".format(numerator))\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 \t\t", "from sys import stdin\r\n_input = stdin.readline\r\n_max, _int = max, int\r\ndef solution():\r\n y, w = [_int(i) for i in _input().split()]\r\n t = 7 - _max(y, w)\r\n\r\n if 6 % t == 0:\r\n print(1,6//t, sep='/')\r\n elif t % 2 == 0:\r\n print(t // 2, 3, sep='/')\r\n else:\r\n print(t, 6, sep='/')\r\nsolution()", "y,w=list(map(int,input().split()))\r\nx=max(y,w)\r\np=(6-x)+1\r\npl=['1/1','5/6','2/3','1/2','1/3','1/6']\r\nprint(pl[x-1])\r\n", "x,y=map(int,input().split())\r\na=7-max(x,y)\r\ndef nsd(a,b):\r\n ost=a%b\r\n while ost!=0:\r\n a=b\r\n b=ost\r\n ost=a%b\r\n return b\r\nprint(str(a//nsd(a,6))+'/'+str(6//nsd(a,6)))\r\n", "y, w = list(map(int, input().split()))\r\n\r\nmass = range(1, 7)\r\n\r\nln = len(list(filter(lambda x: x >= max(y, w), mass)))\r\ntemp = 6\r\nfor i in range(2, 4):\r\n if ln % i == 0 and temp % i == 0:\r\n ln, temp = ln // i, temp // i\r\nprint(ln, temp, sep='/')\r\n\r\n", "y,w=[int(x) for x in input().split()]\r\ndef output(a,b):\r\n p = max(a,b)\r\n l = 7-p\r\n if l==1 or l==5:\r\n print(str(l)+\"/6\")\r\n elif l==4:\r\n print(\"2/3\")\r\n elif l==2:\r\n print(\"1/3\")\r\n elif l==3:\r\n print(\"1/2\")\r\n else:\r\n print(\"1/1\")\r\noutput(y,w)\r\n \r\n\r\n", "def dr(a,b):\n if b>a:\n a,b=b,a\n num = (7-a)\n if num in (2,4):\n return \"{}/3\".format(num//2)\n elif num == 3:\n return \"1/2\"\n elif num in (1,5):\n return \"{}/6\".format(num)\n return \"1/1\"\n\na,b = list(map(int,input().split()))\nprint(dr(a,b))", "#https://codeforces.com/problemset/problem/9/A\r\n\r\nresults = [int(x) for x in input().split(\" \")]\r\ntotal_results = 6\r\npossibilities = [int(x)+1 for x in range(total_results) if int(x)+1 >= max(results)]\r\nfavourable_results = len(possibilities)\r\nif(total_results == favourable_results):\r\n total_results, favourable_results = 1, 1\r\nelif(favourable_results%2 ==0):\r\n total_results, favourable_results = total_results//2, favourable_results//2\r\nelif(favourable_results == 3):\r\n total_results, favourable_results = total_results//3, favourable_results//3\r\n\r\nprint(str(favourable_results) + \"/\" + str(total_results))", "n, m = map(int, input().split())\r\nx = max(n, m)\r\ns = ['1/1', '5/6', '2/3', '1/2', '1/3', '1/6']\r\nprint(s[x-1])", "n,m=map(int,input().split())\r\nx=max(n,m)\r\n\r\ny=6-x+1\r\nfrom fractions import Fraction\r\n\r\nif y==6:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(y,6))", "a, b = map(int, input().split())\r\nans1, ans2 = 6-max(a, b)+1, 6\r\n\r\nif ans1 % 2 == 0 and ans2 % 2 == 0:\r\n ans1 //= 2\r\n ans2 //= 2\r\nif ans1 % 3 == 0 and ans2 % 3 == 0:\r\n ans1 //= 3\r\n ans2 //= 3\r\n\r\nprint(ans1, ans2, sep=\"/\")\r\n", "x = list(map(int, input().split()))\n# She wins if she gets a number equal to or higher than the highest number they've got\nprob = (6 - max(x) + 1) / 6\n\nprobs = {1/6: '1/6', 1/3: '1/3', 1/2: '1/2', 2/3: '2/3', 5/6: '5/6', 1: '1/1'}\n\nfor i in probs:\n if prob == i:\n print(probs[i])\n break\n", "a, b = [int(i) for i in input().split()]\r\n\r\np = 6 - max(a, b) + 1\r\nd = 6\r\nif (p % 2 == 0):\r\n p //= 2\r\n d //= 2\r\nif (p % 3 == 0):\r\n p //= 3\r\n d //= 3\r\nprint(p, d, sep = '/')", "a , b = map(int, input().split())\r\nx = 6 - max(a,b) + 1\r\ny = 6\r\n\r\nfrom math import gcd\r\ntemp = gcd(x,y)\r\nx//= temp\r\ny//=temp\r\n\r\nprint(f\"{x}/{y}\")", "import math\r\n\r\na, b = map(int, input().split())\r\nn, d = 6 - max(a, b) + 1, 6\r\ng = math.gcd(n, d)\r\nn //= g\r\nd //= g\r\nprint(n, d, sep='/')\r\n", "y, w = [int(i) for i in input().split()]\r\nchis = 7 - max(y,w)\r\nzn = 6\r\nif chis % 2 == 0:\r\n chis = chis//2\r\n zn = zn // 2\r\nif chis % 3 == 0:\r\n chis = chis//3\r\n zn = zn//3\r\nans = str(chis) + \"/\" + str(zn)\r\nprint(ans)", "s = list(map(int, input().split()))\r\nz = (6 - max(s) + 1)\r\nif z == 5 or z == 1:\r\n print(f'{z}/6')\r\nif z == 2:\r\n print('1/3')\r\nif z == 3:\r\n print('1/2')\r\nif z == 4:\r\n print('2/3')\r\nif z == 6:\r\n print('1/1')\r\n", "a,b = map(int,input().split())\r\n\r\ndef mcd(a,b):\r\n resto = 0\r\n while(b>0):\r\n resto = b\r\n b = a%b\r\n a = resto\r\n return a\r\n\r\nm = max(a,b)\r\nt = 6-m+1\r\n\r\nmc = mcd(6,t)\r\n\r\nprint(str(int(t/mc))+\"/\"+str(int(6/mc)))\r\n", "[a,b] = list(map(int,input().split(' ')))\r\n\r\nx = {1: \"1/6\",2: \"1/3\",3: \"1/2\",4: \"2/3\",5: \"5/6\",6: \"1/1\"}\r\n\r\nprint(x[7 - max(a,b)])", "a,b = map(int,input().split())\r\nmaxiGran = 6\r\nmaxi = max([a,b])\r\nlistenDon = []\r\nfor i in range(maxi,7):\r\n listenDon+=[i]\r\nlen = len(listenDon)\r\ny = len\r\nwhile maxiGran>0:\r\n c = len%maxiGran\r\n len = maxiGran\r\n maxiGran = c\r\nprint(f\"{y//len}/{6//len}\")", "from fractions import Fraction\r\nimport math\r\ny,w=[int(i) for i in input().split()] #input data\r\na=7-(max(y,w)) #search the maximum result\r\nb=6\r\nc=math.gcd(a,b) #find the gcd\r\nd=a//c\r\ne=b//c\r\nprint(d, end='')\r\nprint('/', end='')\r\nprint(e)\r\n", "import fractions as fr\r\nx=input().split()\r\na=int(x[0])\r\nb=int(x[1])\r\nD=[1,2,3,4,5,6]\r\ns=0\r\nfor i in D:\r\n if i>=max(a,b):\r\n s=s+1\r\nif s==6:\r\n print('1/1')\r\nelse:\r\n print(fr.Fraction(s,6))", "from fractions import Fraction\r\n\r\ny,w=map(int,input().split(\" \"))\r\nm=max(y,w)\r\nc=0\r\nfor i in range(m,7):\r\n c+=1\r\n\r\nd=Fraction(c,6)\r\nif d==0:\r\n print('0/0')\r\nelif d==1:\r\n print('1/1')\r\nelse:\r\n print(d) \r\n", "a,b=map(int,input().split())\r\np=max(a-1,b-1)\r\nl=6-p;m=0\r\nk=l/6\r\nfor i in range(1,7):\r\n for j in range(1,7):\r\n if i/j==k:\r\n print(str(i)+'/'+str(j))\r\n m=1\r\n break\r\n if m==1:\r\n break\r\n", "def main():\r\n\t[y, w] = input().split()\r\n\t[y, w] = [int(y), int(w)]\r\n\tprint(calculate(y, w))\r\n\r\ndef calculate(y, w):\r\n\tb = max(y, w)\r\n\tif b == 6:\r\n\t\treturn \"1/6\"\r\n\telif b == 5:\r\n\t\treturn \"1/3\"\r\n\telif b == 4:\r\n\t\treturn \"1/2\"\r\n\telif b == 3:\r\n\t\treturn \"2/3\"\r\n\telif b == 2:\r\n\t\treturn \"5/6\"\r\n\telif b == 1:\r\n\t\treturn \"1/1\"\r\n\r\n# [y, w] = \"4 2\".split()\r\n# [y, w] = [int(y), int(w)]\r\n# print(y, w)\r\nmain()", "y,w= map(int, input().split())\r\nd= 6-max(y,w)+1\r\nif d==0:\r\n print('0/1')\r\nelif d==1:\r\n print('1/6')\r\nelif d==2:\r\n print('1/3')\r\nelif d==3:\r\n print('1/2')\r\nelif d==4:\r\n print('2/3')\r\nelif d==5:\r\n print('5/6')\r\nelse:\r\n print('1/1')", "y,w=map(int,input().split())\nt=[]\nif y>=w:\n for i in range(y,7):\n t.append(i)\nif w>y:\n for i in range(w,7):\n t.append(i)\n \nn=len(t) \nd=6\nfor i in range(1,n+1):\n if((n%i==0) and (d%i==0)): \n f=i\nn=n//f\nd=d//f\ns=str(n)+'/'+str(d)\nprint(s)", "y, w = map(int, input().split())\r\nd = 6 - max(y, w) + 1\r\nn = 6\r\n\r\nfor i in range(1, n + 1):\r\n if d % i == 0 and n % i == 0:\r\n d //= i\r\n n //= i\r\n\r\nprint('{}/{}'.format(d, n))\r\n", "a, b = map(int, input().split())\r\nvr = 7 - max(a, b)\r\nd = 1\r\nfor i in range(2, 7):\r\n if 6 % i == 0 and vr % i == 0:\r\n d = i\r\nprint(str(vr // d) + '/' + str(6 // d))\r\n", "x,y = input().split()\r\nx = int(x)\r\ny = int(y)\r\n\r\nval = int(7-max(x,y))\r\n\r\nif((val)==6):\r\n print(\"1/1\")\r\nelif(val==1):\r\n print(\"1/6\")\r\nelif(val==2):\r\n print(\"1/3\")\r\nelif(val==3):\r\n print(\"1/2\")\r\nelif(val==4):\r\n print(\"2/3\")\r\nelse:\r\n print(\"5/6\")", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n#\r\n# ------------------------------------------------------------------------------\r\n# Author: Mohammad Mohsen\r\n# Date: Tue Dec 21 23:43:37 2021\r\n# problem name: Die_Roll\r\n# contest: 9-Codeforces Beta Round #9 (Div. 2 Only)\r\n# problem difficulty: A-D2\r\n# problem url: https://codeforces.com/contest/9/problem/A\r\n# ------------------------------------------------------------------------------\r\n\r\nfrom typing import *\r\nfrom fractions import Fraction\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 self.max_numbers: int = 6\r\n\r\n def solution(self) -> Union[str, int, float]:\r\n rolls: List[int] = [int(i) for i in input().strip().split()]\r\n dots_chance: Fraction = Fraction(self.max_numbers - max(rolls) + 1, self.max_numbers)\r\n if dots_chance == Fraction(1):\r\n return \"1/1\"\r\n else:\r\n return dots_chance\r\n\r\nproblem = Problem(\"Die_Roll\")\r\n\r\nif __name__ == \"__main__\":\r\n solution: Union[str, int, float] = problem.solution()\r\n print(solution)\r\n\r\n", "a, b = input().split(\" \")\r\nchances = 6 - max(int(a), int(b))+1\r\nif chances == 1:\r\n print(\"1/6\")\r\nelif chances == 2:\r\n print(\"1/3\")\r\nelif chances == 3:\r\n print(\"1/2\")\r\nelif chances == 4:\r\n print(\"2/3\")\r\nelif chances == 5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")\r\n", "import math\r\na,b = map(int,input().split());\r\nx = max(a,b);\r\nchance = 6-x+1;\r\nif (chance==0):\r\n print(\"0/1\");\r\nelif (chance==1):\r\n print(\"1/6\");\r\nelif (chance==2):\r\n print(\"1/3\");\r\nelif (chance==3):\r\n print(\"1/2\");\r\nelif (chance==4):\r\n print(\"2/3\");\r\nelif (chance==5):\r\n print(\"5/6\");\r\nelif (chance==6):\r\n print(\"1/1\");\r\n", "a = max(map(int, input().split()))-1\n\nresults = [r'1/1', r'5/6', r'2/3', r'1/2', r'1/3', r'1/6']\n\nprint (results[a])\n\t\t \t\t \t \t\t \t \t \t\t\t\t\t\t \t\t \t\t\t", "from fractions import Fraction\r\ny,w=map(int,input().split())\r\na=max(y,w)\r\nans=(6-a)+1\r\nif ans==0 or ans==1:\r\n print(str(ans)+\"/6\")\r\nelif ans==6:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(ans,6))\r\n", "lst= list(map(int, input().split()))\r\nchance= 6-(max(lst)-1)\r\n\r\nif chance%6==0:print(f\"{int(chance/6)}/{1}\")\r\nelif chance%3==0:print(f\"{int(chance/3)}/{2}\")\r\nelif chance%2==0:print(f\"{int(chance/2)}/{3}\")\r\nelse:print(f\"{chance}/{6}\")", "ls=[int(a) for a in input().split()]\r\np=6-max(ls)+1\r\nd=6\r\nfor i in range(2,p+1):\r\n if p%i==0 and 6%i==0:\r\n p/=i\r\n d/=i\r\nif p==0:\r\n print('0/1')\r\nelse:\r\n print(str(int(p))+'/'+str(int(d)))\r\n", "import math;\r\nx, y = map(int, input().split())\r\nmaxPoints = max(x, y)\r\ncountScore = 6 - maxPoints + 1\r\ngcd = math.gcd(countScore, 6)\r\ncountScore /= gcd\r\nprint(f\"{int(countScore)}/{int(6/gcd)}\")", "import sys\r\nfrom math import gcd\r\n\r\n#sys.stdin, sys.stdout = open(\"input.txt\", \"r\"), open(\"output.txt\", \"w\")\r\n\r\ns = max(map(int, input().split()))\r\nnum = (6-s+1)\r\nden = 6\r\ng = gcd(num, den)\r\nprint(\"%d/%d\" % (num//g, den//g))\r\n\r\n\r\n", "s=input()\r\ny=s[0]\r\nz=s[2]\r\nif int(y)>int(z):\r\n j=7-int(y)\r\nelse:\r\n j=7-int(z)\r\nif j==1:\r\n print('1/6')\r\nif j==2:\r\n print('1/3')\r\nif j==3:\r\n print('1/2')\r\nif j==4:\r\n print('2/3')\r\nif j==5:\r\n print('5/6')\r\nif j==6:\r\n print('1/1')\r\n ", "from math import gcd\r\na,b = map(int,input().strip().split())\r\nx = 6-max(a,b)+1\r\ny = 6\r\nfinal = gcd(x,y)\r\nprint(x//final,\"/\",y//final,sep='')\r\n", "map1 = {\r\n \"1/6\": \"1/6\",\r\n \"2/6\": \"1/3\",\r\n \"3/6\": \"1/2\",\r\n \"4/6\": \"2/3\",\r\n \"5/6\": \"5/6\",\r\n \"6/6\": \"1/1\"\r\n}\r\na1, a2 = list(map(int, input().split()))\r\n\r\nprint(map1[f\"{6 - max(a1, a2) + 1}/6\"])", "from math import *\r\nmx = 7-max(map(int, input().split()))\r\nprint(f\"{mx//gcd(mx, 6)}/{6//gcd(mx, 6)}\")", "from fractions import Fraction\r\nm = max([int(x) for x in input().split()])\r\nf = Fraction((6-m+1),6)\r\nif f ==1:\r\n\tprint(\"1/1\")\r\nelse:\r\n\tprint(f)", "\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import *\r\n#from itertools import *\r\n#from operator import itemgetter\r\n#from itertools import count, islice\r\n#from functools import reduce\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#dirs = [[1,0],[0,1],[-1,0],[0,-1]]\r\n#from math import factorial as fact\r\n#a,b = [int(x) for x in input().split()]\r\n#sarr = [x for x in input().strip().split()]\r\n#import math\r\n#from math import *\r\n\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(2**30)\r\n#MOD = 10**9+7\r\ndef solve():\r\n a,b = [int(x) for x in input().split()]\r\n m = max(a,b)\r\n if m == 1:\r\n print('1/1')\r\n elif m == 2:\r\n print('5/6')\r\n elif m == 3:\r\n print('2/3')\r\n elif m == 4:\r\n print('1/2')\r\n elif m == 5:\r\n print('1/3')\r\n else:\r\n print('1/6')\r\n\r\ntt = 1#int(input())\r\nfor test in range(tt):\r\n solve()\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n#\r\n", "s = input().split()\r\npos = ['0/1','1/6','1/3','1/2','2/3','5/6','1/1']\r\nprint(pos[6 - int(max(s)) + 1])", "import math\r\na,b=map(int,input().split())\r\nc=6-max(a,b)+1\r\nd=math.gcd(6,c)\r\nprint(str(int(c/d))+'/'+str(int(6/d)))", "r,d=0,6\r\ndef div(k):\r\n global r,d\r\n while r%k==0 and d%k==0:\r\n r=r//k\r\n d=d//k\r\ns=input()\r\na=s.split(' ')\r\nY,W=int(a[0]), int(a[1])\r\nr=7-max(Y,W)\r\ndiv(2)\r\ndiv(3)\r\nprint(str(r)+'/'+str(d))", "from math import gcd\n\ny, w = [int(v) for v in input().split()]\nfavorable = 6 - max(y, w) + 1\nhcf = gcd(favorable, 6)\nprint(favorable // hcf, \"/\", 6 // hcf, sep=\"\")\n", "\r\ndef gcd(a,b):\r\n if(b == 0):\r\n return a\r\n return gcd(b,a%b)\r\n\r\nx = input()\r\nx = x.split()\r\nw = int(x[0])\r\ne = int(x[1])\r\nsum = 0\r\nfor i in range(max(w,e),7):\r\n sum = sum + 1\r\nmon = 6\r\ng = gcd(sum,mon)\r\nsum //= g\r\nmon //= g\r\n\r\nprint(sum,'/',mon,sep = '',end = '\\n')", "from fractions import Fraction\r\nm,n=map(int,input().split())\r\nk=max(m,n)\r\nc=7-k\r\nif c/6==1:\r\n print('1/1')\r\nelse:\r\n print(Fraction(c,6))", "def hcf(a,b):\n g=1\n for i in range(b-1,1,-1):\n if a%i==0 and b%i==0:\n g=i\n break\n return g \nn,m=input().split()\nn,m=int(n),int(m)\nk=7-max(n,m)\np=hcf(k,6)\nif 6%k==0:\n q=6//k\n print(\"1/\"+str(q))\nelse:\n print(str(k//p)+\"/\"+str(6//p))\n \n", "points=input().split(\" \")\r\nyakko=int(points[0])\r\nwakko=int(points[1])\r\nmaxi=max(yakko,wakko)\r\nnumerator=(6-maxi)+1\r\ndenominator=6\r\ni=2\r\nnewNumerator=numerator\r\nnewDenominator=denominator\r\nwhile i<=numerator:\r\n if newNumerator%i==0 and newDenominator%i==0:\r\n newNumerator=newNumerator//i\r\n newDenominator=newDenominator//i\r\n i+=1\r\n\r\nprint(str(newNumerator)+\"/\"+str(newDenominator))", "n,k = map(int,input().split())\r\nm = max(n,k)\r\nprint(['1/6','1/3','1/2','2/3','5/6','1/1'][6 - m ])", "Yakko , Wakko = map(int , input().split())\r\nMax = max(Yakko,Wakko)\r\nif Max == 1:\r\n print(\"1/1\")\r\nif Max == 2:\r\n print(\"5/6\")\r\nif Max == 3:\r\n print(\"2/3\")\r\nif Max == 4:\r\n print(\"1/2\")\r\nif Max == 5:\r\n print(\"1/3\")\r\nif Max == 6:\r\n print(\"1/6\")\r\n", "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 == b:\r\n return a\r\n if a > b:\r\n return gcd(a - b, b)\r\n return gcd(a, b-a)\r\n\r\n\r\nY, W = map(int, input().split())\r\nmax_ = max(Y, W)\r\nA = 7 - max_\r\nB = 6\r\ng = gcd(A, B)\r\nprint(f\"{A//g}/{B//g}\")", "y=max(list(map(int, input().split())))\r\nif y==6:\r\n p='1/6'\r\nelif y==5:\r\n p='1/3'\r\nelif y==4:\r\n p='1/2'\r\nelif y==3:\r\n p='2/3'\r\nelif y==2:\r\n p='5/6'\r\nelse:\r\n p='1/1'\r\nprint(p)\r\n", "def main():\r\n maximum = max(map(int, input().split()))\r\n up_side = (6 - maximum) + 1\r\n real_dividor = 1\r\n for dividor in range(up_side, 1, -1):\r\n if up_side % dividor == 0 and 6 % dividor == 0:\r\n real_dividor = dividor\r\n break\r\n print(f'{up_side / real_dividor:.0f}/{6 / real_dividor:.0f}')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "inp=input()\r\na,b=inp.split()\r\n\r\na=int(a)\r\nb=int(b)\r\n\r\nif a>b:\r\n cou=7-a\r\nelse:\r\n cou=7-b\r\nif cou==6:\r\n print(\"1\"+\"/\"+\"1\")\r\nelif cou==2:\r\n print(\"1\"+\"/\"+\"3\")\r\nelif cou==3:\r\n print(\"1\"+\"/\"+\"2\")\r\nelif cou==4:\r\n print(\"2\"+\"/\"+\"3\")\r\nelif cou==5:\r\n print(\"5\"+\"/\"+\"6\")\r\nelif cou==1:\r\n print(\"1\"+\"/\"+\"6\")", "a = 7 - max(list(map(int, input().split())))\r\nif a in [1,5]:\r\n print(a,6, sep=\"/\")\r\nelif a in [2, 4]:\r\n print(a // 2, 3, sep=\"/\")\r\nelif a == 3:\r\n print(\"1/2\")\r\nelse:\r\n print(\"1/1\")", "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\ny, w = inlt()\r\nn = 7 - max(y, w)\r\nd = 6\r\nfor i in range(2,4):\r\n if n % i == 0:\r\n n //= i\r\n d //= i\r\nprint(f'{n}/{d}')", "yw = [int(i) for i in input().split()]\r\nnum = 6-max(yw)+1\r\nden = 6\r\nlcm = 2\r\nwhile lcm<=num:\r\n if num%lcm==0 and den%lcm==0:\r\n den //= lcm\r\n num //= lcm\r\n lcm = 1\r\n lcm += 1\r\nprint(f\"{num}/{den}\")\r\n \r\n", "def solve(arr):\r\n ans = (7-max(arr))/6\r\n if ans == 1/2:\r\n print(\"1/2\")\r\n elif ans == 1/3:\r\n print(\"1/3\")\r\n elif ans == 2/3:\r\n print(\"2/3\")\r\n elif ans == 5/6 :\r\n print(\"5/6\")\r\n elif ans == 1:\r\n print(\"1/1\")\r\n elif ans == 1/6:\r\n print(\"1/6\")\r\n else : \r\n print(\"0/1\")\r\n \r\narr = input().split()\r\narr = [int(x) for x in arr]\r\n\r\nsolve(arr)", "SIDES = 6\r\ny, w = (int(i) for i in input().split())\r\nm = max(y, w)\r\n\r\nimport fractions\r\nt = SIDES - m\r\n\r\nf = fractions.Fraction(t+1, SIDES)\r\nprint(*f.as_integer_ratio(), sep='/')", "\r\nfrom fractions import Fraction\r\na,b=map(int,input().split())\r\nm=max(a,b)\r\nl=[i for i in range(m,7)]\r\nk=len(l)\r\nif k%6==0:\r\n print(\"1/1\")\r\nelse:\r\n f=Fraction(k,6)\r\n print(f)", "import math\nbest = max(map(int,input().split()))\ns = {1:'1/6',2:'1/3',3:'1/2',4:'2/3',5:'5/6',6:'1/1'}\nprint(s[7-best])", "import sys\r\n\r\na, b = map(int, sys.stdin.readline().split())\r\n\r\ndie = [1, 2, 3, 4, 5, 6]\r\n\r\nu = len(die[die.index(max(a, b)):])\r\nd = 6\r\nif u%2 == 0:\r\n d = int(d/2)\r\n u = int(u/2)\r\nif u%3 == 0:\r\n d = int(d/3)\r\n u = int(u/3)\r\nprint(str(u) + '/' + str(d))", "I=lambda : list(map(int,input().split(' ')))\nfrom collections import defaultdict\ny,w=I()\nx=1+6-max(y,w)\nif x==0:\n print('0/1')\nelif x==1:\n print('1/6')\nelif x==2:\n print('1/3')\nelif x==3:\n print('1/2')\nelif x==4:\n print('2/3')\nelif x==5:\n print('5/6')\nelse:\n print('1/1')\n", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nh = max(a, b)\r\nj = 6 - h + 1\r\nif j == 0:\r\n print('0/1')\r\nelif j == 1:\r\n print('1/6')\r\nelif j == 2:\r\n print('1/3')\r\nelif j == 3:\r\n print('1/2')\r\nelif j == 4:\r\n print('2/3')\r\nelif j == 5:\r\n print('5/6')\r\nelse:\r\n print('1/1')", "y,w = map(int,input().split())\r\nroll = [\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nx=max(y,w)\r\nres = roll[6-x]\r\nprint(res)\r\n", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x))\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10\r\n# from functools import cmp_to_key\r\n\r\ndef gcd(a,b):\r\n return gcd(b,a%b) if b else a \r\n\r\ndef get(a,b):\r\n x=gcd(a,b)\r\n a//=x;b//=x\r\n return '{}/{}'.format(a,b)\r\n\r\na,b=map(int,input().split())\r\nprint(get(7-max(a,b),6))", "a,b=map(int,input().split())\r\nx=max(a,b)\r\nans=7-x\r\nxx=ans/6\r\nflg=0\r\nfor i in range(1,7):\r\n for j in range(1,7):\r\n if i/j==xx:\r\n print(str(i)+\"/\"+str(j))\r\n flg=1\r\n break\r\n if flg==1:\r\n break\r\n", "from sys import stdin\r\nfrom math import gcd\r\nn = 6 - (max(map(int, stdin.readline().split())) - 1)\r\nr = gcd(n, 6)\r\nprint(f\"{n//r}/{6//r}\")\r\n", "a, b = map(int, input().split())\r\nmaxi = max([a, b])\r\n\r\nif maxi == 1:\r\n print('1/1')\r\nelif maxi == 2:\r\n print('5/6')\r\nelif maxi == 3:\r\n print('2/3')\r\nelif maxi == 4:\r\n print('1/2')\r\nelif maxi == 5:\r\n print('1/3')\r\nelif maxi == 6:\r\n print('1/6')\r\n", "from fractions import Fraction\r\n\r\ny, w = map(int, input().split())\r\n\r\nNumerator = 7-max(y,w)\r\nDenominator = 6\r\n\r\ntemp = Numerator/Denominator\r\n\r\nif temp == 0: print(\"0/1\")\r\nelif temp == 1: print(\"1/1\")\r\nelse: print(Fraction(Numerator, Denominator))", "# link: https://codeforces.com/contest/9/problem/A\r\n\r\nimport math\r\na, b = (int(x) for x in input().split())\r\n\r\nnumerator = 6 - max(a,b) + 1\r\ndenominator = 6\r\n\r\nGCD = math.gcd(numerator, denominator)\r\n\r\nprint(f'{numerator//GCD}/{denominator//GCD}')\r\n", "from math import gcd\r\na, b = map(int, input().split())\r\nprint((6-max(a, b)+1) // gcd(6-max(a, b)+1, 6), 6 // gcd(6-max(a, b)+1, 6), sep='/')", "# LUOGU_RID: 126424983\na,b=map(int,input().split( ))\r\nc=max(a,b)\r\nd=(7-c)\r\nif(c==1):\r\n print('1/1')\r\nelse:\r\n from fractions import Fraction\r\n half=Fraction(d,6)\r\n print(half)\r\n\r\n\r\n", "# LUOGU_RID: 126326941\nimport math\r\na = b = c = 0\r\na,b = map(int,input().split())\r\na = max(a,b)\r\nc = 7-a\r\ngcdac = math.gcd(6,c)\r\na = 6 // gcdac\r\nc = c // gcdac\r\ngcdac = math.gcd(6,c)\r\nprint(\"%d/%d\" % (c,a))", "max = 0\r\nup = 6\r\na, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nif a >= b:\r\n max = a\r\nelse:\r\n max = b\r\nup = 6 - max + 1\r\nif up == 3:\r\n print(str(1) + \"/\" + str(2))\r\n quit()\r\nif up == 2:\r\n print(str(1) + \"/\" + str(3))\r\n quit()\r\nif up == 4:\r\n print(str(2) + \"/\" + str(3))\r\n quit()\r\nif up == 6:\r\n print(str(1) + \"/\" + str(1))\r\n quit()\r\nresult = up\r\nprint(str(result) + \"/\" + str(6))", "points = [int(i) for i in input().split()]\r\ntop = max(points)\r\np = 6 - top + 1\r\nif p == 4 or p == 2:\r\n print(f'{p // 2}/3')\r\nelif p == 0:\r\n print('0/1')\r\nelif p == 6:\r\n print('1/1')\r\nelif p == 3:\r\n print('1/2')\r\nelse:\r\n print(f\"{p}/6\")\r\n", "y,w=map(int,input().split())\r\nif y>w:\r\n y,w=w,y\r\nif w==1:\r\n print(\"1/1\")\r\nelif w==2:\r\n print(\"5/6\")\r\nelif w==3:\r\n print(\"2/3\")\r\nelif w==4:\r\n print(\"1/2\") \r\nelif w==5:\r\n print(\"1/3\")\r\nelse:\r\n print(\"1/6\")", "outcome=[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\nm,n=map(int,input().split())\nbigger=max(m,n)\n\nprint(outcome[(6-bigger)])", "a,b = map(int, input().split())\r\nmark = max(a,b)\r\n\r\nif mark == 1:\r\n print ('1/1')\r\nelif mark == 6:\r\n print ('1/6')\r\nelif mark == 3:\r\n print ('2/3')\r\nelif mark == 4:\r\n print ('1/2')\r\nelif mark == 2:\r\n print ('5/6')\r\nelse:\r\n print ('1/3')", "import math\r\nlst = list(map(int, input().strip().split()))[:2]\r\nnum = max(lst[0], lst[1])\r\na = 7 - num\r\nb = 6\r\nc = math.gcd(a, b)\r\nwhile c != 1:\r\n\ta //= c\r\n\tb //= c\r\n\tc = math.gcd(a, b)\r\nprint(a, b, sep=\"/\")", "import math\r\na,b=map(int,input().split())\r\nc=max(a,b)\r\nc=6-c+1\r\nif(c==0):\r\n print(c,\"/1\",sep='')\r\nelse:\r\n g=math.gcd(6,c)\r\n print(c//g,\"/\",6//g,sep='')\r\n \r\n \r\n", "import sys; input = sys.stdin.readline\r\nfrom math import gcd\r\nY, W = map(int, input().split())\r\nc = 7 - max(Y, W); p = 6\r\nprint('%d/%d' % (c // gcd(c, p), p // gcd(c, p)))", "from fractions import Fraction\nrequiredMinRoll = max(list(map(int, input().split())))\nfr = Fraction((7-requiredMinRoll),6)\nprint(fr.numerator, '/', fr.denominator, sep='')\n", "from math import gcd\r\n\r\na,b = map(int,input().split())\r\nm = max(a,b)\r\np = (6 - m) + 1\r\ndiv = gcd(6,p)\r\nprint(f\"{p//div}/{6//div}\")", "a,b=map(int,input().split())\r\nx = 7-max(a,b)\r\nif x==1: print(\"1/6\")\r\nif x==2: print(\"1/3\")\r\nif x==3: print(\"1/2\")\r\nif x==4: print(\"2/3\")\r\nif x==5: print(\"5/6\")\r\nif x==6: print(\"1/1\")\r\n\r\n ", "yw_ch = input()\r\nyw_ch = list(str.split(yw_ch))\r\nyw_ch = [int(a) for a in yw_ch]\r\nA = (6 - (max(yw_ch)-1))\r\nB = 6\r\nfrom fractions import Fraction\r\nans = Fraction(A, B)\r\nif ans == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(ans)", "y, w = input().split()\r\ny = int(y)\r\nw = int(w)\r\n\r\nn = 0\r\nd = 6\r\nif y >= w:\r\n for i in range(y, 7):\r\n n += 1\r\nelif w > y:\r\n for i in range(w, 7):\r\n n += 1\r\nfor i in range(1,6):\r\n if n % i == 0 and d % i == 0:\r\n n = n/i\r\n d = d/i\r\nprint(int(n),'/',int(d),sep='')\r\n", "w, y = [int(x) for x in input().split()]\r\nd = 6 - max(w, y) + 1\r\np = ['0/1','1/6','1/3','1/2','2/3','5/6','1/1']\r\nprint(p[d])\r\n\r\n", "a, b = sorted(map(int,input().split()))\r\nif 6-b==0:\r\n print('1/6')\r\nelif 6-b==1:\r\n print('1/3')\r\nelif 6-b==2:\r\n print('1/2')\r\nelif 6-b==3:\r\n print('2/3')\r\nelif 6-b==4:\r\n print('5/6')\r\nelif 6-b==5:\r\n print('1/1')", "a= sorted(list(map(int, input().split())))\r\nx= 0\r\nm= 6\r\nif a[0]==1 and a[1]==1 :\r\n print(\"1/1\")\r\n exit()\r\nelse:\r\n for i in range(a[1], 7):\r\n x += 1\r\nif x%2==0 :\r\n x//=2\r\n m//=2\r\nelif x%3==0:\r\n x//=3\r\n m//=3\r\nprint(x, \"/\", m, sep=\"\")\r\n", "from fractions import Fraction\r\ni = input()\r\nj = i.split()\r\nnumerator = 0\r\nif int(j[0]) > int(j[1]):\r\n numerator += 6 - int(j[0]) + 1\r\nelif int(j[0]) < int(j[1]):\r\n numerator += 6 - int(j[1]) + 1\r\nelse:\r\n numerator += 6 - int(j[0]) + 1\r\nw = Fraction(numerator, 6)\r\nif str(w) == '1':\r\n w = '1/1'\r\nelif str(w) == '0':\r\n w = '0/1'\r\nprint(w)", "from fractions import Fraction\r\ny,w=map(int,input().split())\r\nif (7-max(y,w))==6:\r\n print(f\"{1}/{1}\")\r\nelse:\r\n print(Fraction(7-max(y,w),6))", "x, y = list(map(int, input().split()))\r\n\r\ntoBeat = max(x, y)\r\nif toBeat == 6:\r\n\tprint(\"1/6\")\r\nelif toBeat == 1:\r\n\tprint(\"1/1\")\r\nelif toBeat == 2:\r\n\tprint(\"5/6\")\r\nelif toBeat == 3:\r\n\tprint(\"2/3\")\r\nelif toBeat == 4:\r\n\tprint(\"1/2\")\r\nelif toBeat == 5:\r\n\tprint(\"1/3\")", "from fractions import Fraction\r\n\r\nli = list(map(int,input(\" \").split()))\r\na=li[0]\r\nb=li[1]\r\nc=max(a,b)\r\nf=0\r\ni=1\r\nwhile i<=6:\r\n if i>=c:\r\n f=f+1\r\n i=i+1\r\n \r\nif(f==6):\r\n print('1/1')\r\nelif(f==0):\r\n print(Fraction(0,1))\r\nelse: \r\n print(Fraction(f,6))\r\n ", "n,m = map(int,input().split())\nprop = [\"\",\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\nprint (prop[max(n,m)])\n \t\t \t\t\t \t \t \t \t", "a=[]\r\na=input().split()\r\na=[int(i) for i in a]\r\nk=1+6-max(a)\r\nif k==6:\r\n print('1/1')\r\nif k==0:\r\n print('0/1')\r\nif k==1 or k==5:\r\n k=str(k)+'/6'\r\n print(k)\r\nif k==2 or k==4:\r\n k=str(int(k/2))+'/3'\r\n print(k)\r\nif k==3:\r\n print('1/2')\r\n", "arr=[\"\",\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nl = list(map(int,input().split()))\r\nd = max(l)\r\nprint(arr[d])", "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 die_roll(num):\r\n res = 6 - num + 1\r\n # 1 / 6\r\n # 2 / 6\r\n # 3 / 6\r\n # 4 / 6\r\n # 5 / 6\r\n # 6 / 6\r\n if res == 1:\r\n return str(res) + '/' + str(6)\r\n elif res == 2:\r\n return \"1/3\"\r\n elif res == 3:\r\n return \"1/2\"\r\n elif res == 4:\r\n return \"2/3\"\r\n elif res == 5:\r\n return \"5/6\"\r\n else:\r\n return \"1/1\"\r\n s\r\ndef main():\r\n numbers = inlt()\r\n _max_num = max(numbers)\r\n result = die_roll(_max_num)\r\n print(result)\r\n return 0\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a, b = [int(i) for i in input().split(' ')]\nif a>b:\n c=a\nelse:\n c=b\npoint = 6-c+1\nif point==6:\n print(\"1/1\")\nelif point%3==0:\n print(\"1/2\")\nelif point%2==0:\n print(\"{}/3\".format(point//2))\nelse:\n print(\"{}/6\".format(point))", "from fractions import Fraction\r\na,b=map(int,input().split())\r\nc=max(a,b)\r\nd=0\r\nfor i in range(1,7):\r\n if(i>=c):\r\n d=d+1\r\nif(d==6):\r\n print(str(int(d/6))+\"/\"+str(1))\r\nelif (d==0):\r\n print(str(0)+\"/\"+str(1))\r\nelse:\r\n print(Fraction(d,6))\r\n\r\n ", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\nfrom math import gcd\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 a, b = multi_input()\r\n n = max(a,b) - 1\r\n g = gcd(6-n,6)\r\n print(f\"{(6-n)//g}/{6//g}\\n\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "y, w = map(int, input().split())\r\n\r\nnom = (6 - max(y, w) + 1)\r\ndenom = 6\r\na, b = nom, denom\r\nwhile nom:\r\n denom, nom = nom, denom % nom\r\n\r\nprint(a // denom, b // denom, sep = \"/\")\r\n ", "testcases=1\n\nfor t in range (testcases):\n\tstring=input()\n\tsy,sw=string.split()\n\ty=int(sy)\n\tw=int(sw)\n\td=max(y,w)\n\td=7-d\n\tif d== 1:\n\t\tprint('1/6')\n\telif d==2:\n\t\tprint('1/3')\n\telif d==3:\n\t\tprint('1/2')\n\telif d==4:\n\t\tprint('2/3')\n\telif d==5:\n\t\tprint('5/6')\n\telse:\n\t\tprint('1/1')\n\n\t\n\n\n\t\n\n\n\t\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\n(y, w) = tuple(map(int, input().split()))\r\n\r\ndef gcd(a, b):\r\n if (b == 0):\r\n return a\r\n return gcd(b, a%b)\r\n\r\nc = 6 - max(y, w) + 1\r\ngd = gcd(c, 6)\r\n\r\nprint(f'{c // gd}/{6 // gd}') ", "import math\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=abs(max(a,b)-6)+1\r\nd=math.gcd(c,6)\r\nprint(str(c//d)+'/'+str(6//d))\r\n\r\n", "ans_list = ('1/6', '1/3', '1/2', '2/3', '5/6', '1/1')\r\n \r\nx,y = map(int, input().split())\r\n \r\nz = 6 - max(x,y)\r\n \r\nprint(ans_list[z])", "from fractions import Fraction\r\ninp = list(map(int,input().split()))\r\na,b = inp[0],inp[1]\r\n\r\nif a>b:\r\n i,j=a,b\r\nelse:\r\n i,j =b,a\r\n\r\nif i==j==1:\r\n prob = '1/1'\r\nelif i>j and i==2:\r\n prob = Fraction(5,6)\r\nelif i>j and i==3:\r\n prob = Fraction(2,3)\r\nelif i>j and i==4:\r\n prob = Fraction(1,2)\r\nelif i>j and i==5:\r\n prob = Fraction(1,3)\r\nelif i>j and i ==6:\r\n prob = Fraction(1,6)\r\nelif i==j:\r\n prob = Fraction(7-i,6)\r\nelse:\r\n prob = 0\r\n\r\nprint(prob)", "def reduce(a,b):\r\n x =1\r\n for i in range(2,7):\r\n if a%i ==0 and b%i==0:\r\n x = i\r\n return int(a/x),int(b/x)\r\n \r\n \r\n\r\nip = list(map(int,input().split()))\r\na = (6-max(ip)) + 1\r\na,b = reduce(a,6)\r\nprint(\"{}/{}\".format(a,b))\r\n\r\n\r\n", "def main():\r\n y, w = [int(i) for i in input().split()]\r\n mx = max(y, w)\r\n count = 0\r\n for i in range(1, 7):\r\n if i >= mx:\r\n count += 1\r\n if count == 6:\r\n print(\"1/1\")\r\n elif count % 2 and count != 3:\r\n print(\"%s/%s\" % (count, 6))\r\n else:\r\n if count == 3:\r\n print(\"1/2\")\r\n else:\r\n print(\"%s/%s\" % (count // 2, 3))\r\n\r\n\r\nmain()", "x=max(map(int,input().split()))\r\na=6-(x-1)\r\nb=6\r\nwhile b != 0:\r\n a, b = b, a % b\r\nprint(\"{}/{}\".format((6-(x-1))//a,6//a))", "from math import gcd\nx, y = [int(x) for x in input().split()]\nx = 6 - max(x,y) + 1\ny = 6\nd = gcd(x,y)\nx = x//d\ny = y//d\nprint(x,'/',y,sep=\"\")\n\n", "s=list(map(int,input().split()))\r\ns1=max(s)\r\nlis=[\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nprint(lis[s1])\r\n\r\n", "Y, W = map(int, input().split())\n\nD = 7 - max(Y,W) \n\nif D == 6:\n print(\"1/1\")\nelif D == 5:\n print(\"5/6\")\nelif D == 4:\n print(\"2/3\")\nelif D == 3:\n print(\"1/2\")\nelif D == 2:\n print(\"1/3\")\nelse:\n print(\"1/6\")\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=max(a,b)\r\nd = 6-c+1\r\nif d==0:\r\n print(\"0/1\")\r\nelif d==1:\r\n print(\"1/6\")\r\nelif d==2:\r\n print(\"1/3\")\r\nelif d==3:\r\n print(\"1/2\")\r\nelif d==4:\r\n print(\"2/3\")\r\nelif d==5:\r\n print(\"5/6\")\r\nelif d==6:\r\n print(\"1/1\")\r\n", "import math\r\na, b = map(int, input().split(' '))\r\nc = (7 - max(a, b))\r\nz = 6\r\nc1 = int(c / math.gcd(c, z))\r\nz1 = int(z / math.gcd(c, z))\r\nprint(c1, end=\"\")\r\nprint('/', end=\"\")\r\nprint(z1, end=\"\")", "a, b = map(int, input().split())\r\nc = 6 - max(a, b) + 1\r\nall = 6\r\nif c % 3 == 0:\r\n c //= 3\r\n all //= 3\r\nif c % 2 == 0:\r\n c //= 2\r\n all //= 2\r\nprint(c, '/', all, sep = \"\")", "a , b = map(int , input().split())\n\n\nmx = max(a , b)\n\nrs = 6 - (mx-1)\nif(rs == 1):\n print('1/6')\nelif(rs == 2):\n print('1/3')\nelif(rs==3):\n print('1/2')\nelif(rs == 4):\n print('2/3')\nelif(rs == 5):\n print('5/6')\nelif rs == 6:\n print('1/1')\nelif rs == 0:\n print('0/1')\n\t\t \t\t \t\t \t\t \t\t\t\t \t \t", "x, y = map(int, input().split())\nx = max(x,y)\ny = 7-x\nif y == 6:\n print(\"1/1\")\nelif y == 3:\n print(\"1/2\")\nelif y == 4:\n print(\"2/3\")\nelif y == 5:\n print(\"5/6\")\nelif y == 2:\n print(\"1/3\")\nelse:\n print (\"1/6\")", "xyz = [\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nx , y = list(map(int, input().split(\" \")))\r\nz = max(x , y)\r\nprint(xyz[6 - z])", "from math import gcd\r\ndef reduceFraction(x) :\r\n d = gcd(x, 6);\r\n x = x // d;\r\n y = 6 // d;\r\n return x,y\r\nx=list(map(int,input().split()))\r\nc=max(x)\r\nl=[]\r\nfor i in range(c,7):\r\n l.append(i)\r\nd=reduceFraction(len(l))\r\ns=list(map(str,d))\r\nprint(s[0]+\"/\" +s[1])\r\n\r\n \r\n \r\n", "import sys\r\n\r\na, b = map(int, input().split())\r\nc = 6 - max(a, b) + 1\r\nd = 6\r\nif c ==6:\r\n print(\"1\",\"/\",\"1\",sep=\"\")\r\n sys.exit(0)\r\nif c % 2 == 0 and d % 2 == 0:\r\n c /= 2\r\n d /= 2\r\nif c % 3 == 0 and d % 3 == 0:\r\n c /= 3\r\n d /= 3\r\nprint(int(c), \"/\", int(d), sep=\"\")\r\n", "from fractions import Fraction\r\n\r\nm,n = list(map(int,input().split()))\r\n\r\na = max(m,n)\r\nnumerator = 6-a+1\r\ndenomenator = 6\r\n\r\nif numerator%2 == 1:\r\n\tif numerator == 3:\r\n\t\tprint(\"1/2\")\r\n\telse:\r\n\t\tprint(f\"{numerator}/6\")\r\nelse:\r\n\tif numerator == 4:\r\n\t\tprint(\"2/3\")\r\n\telse:\r\n\t\tprint(f\"1/{6//numerator}\")", "from math import gcd\r\na = 7 - max(map(int, input().split()))\r\nb = 6\r\nwhile gcd(a, b) != 1:\r\n div = gcd(a, b)\r\n a //= div\r\n b //= div\r\nans = str(a) + '/' + str(b)\r\nprint(ans)", "from fractions import Fraction\r\n\r\npoints = input().split()\r\ny = int(points[0])\r\nw = int(points[1])\r\n\r\nmax_points = max(y, w)\r\nif max_points == 6:\r\n print('1' + \"/\" + '6')\r\nelif max_points == 1:\r\n print('1' + '/' + '1')\r\n\r\nelse:\r\n numerator = 6 - max_points + 1\r\n print (Fraction(numerator, 6))\r\n", "a,b=map(int,input().split())\r\nc=max(a,b)-1\r\nd=6-c\r\n\r\nif(d==1):\r\n print(\"1/6\")\r\nif(d==2):\r\n print(\"1/3\")\r\nif(d==3):\r\n print(\"1/2\")\r\nif(d==4):\r\n print(\"2/3\")\r\nif(d==5):\r\n print(\"5/6\")\r\nif(d==6):\r\n print(\"1/1\")", "import math\r\na,b = map(int,input().split())\r\ne = max(a,b)\r\nif e == 6:\r\n print('1/6')\r\nelif e == 5:\r\n print('1/3')\r\nelif e == 4:\r\n print('1/2')\r\nelif e == 3:\r\n print('2/3')\r\nelif e == 2:\r\n print('5/6')\r\nelif e == 1:\r\n print('1/1')", "import math\n\ny, w = [int(i) for i in input().split(\" \")]\nx = 6 - max(y, w) + 1\ng = math.gcd(x, 6)\nnum = x // g\nden = 6 // g\nprint(str(num) + \"/\" + str(den))\n\n", "def hgstcmnfactr(l, m):\n lst = set()\n mst = set()\n for i in range(1, l+1):\n if l % i == 0:\n lst.add(i)\n for j in range(1, m+1):\n if m % j == 0:\n mst.add(j)\n return max(lst & mst)\n\n\nmn = max(list(map(int, input().split(\" \"))))\nchns = 7-mn\nprint(str(int(chns/hgstcmnfactr(chns, 6))) + \"/\" + str(int(6/hgstcmnfactr(chns, 6))))\n", "from math import gcd\r\n\r\nyz, wz = map(int, input().split())\r\n\r\ndeno = 6\r\nnum = 6 - max(yz, wz) + 1\r\n\r\ncom = gcd(num, deno)\r\n\r\nnum//= com\r\ndeno //= com\r\n\r\nprint(f\"{num}/{deno}\")\r\n", "import math\r\ndef gcd (a, b):\r\n if a % b == 0:\r\n return b\r\n else:\r\n return gcd(b, a%b) \r\n\r\ndef prime_bool(k):\r\n if k==2 or k==3: return True\r\n if k%2==0 or k<2: return False\r\n for i in range(3, int(k**0.5)+1, 2):\r\n if k%i==0:\r\n return False\r\n return True\r\n\r\ndef prime(k):\r\n for i in range(2, int(k**0.5)+1, 1):\r\n if k%i==0:\r\n return i\r\n return k\r\n\r\n\r\n\r\nh, m = input().split()\r\nh = int(h)\r\nm = int(m)\r\nt = 6 - max(h, m) + 1\r\nprint(t//gcd(t, 6), '/', 6//gcd(t, 6),sep='')\r\n", "y, w = map(int, input().split())\na = 6 - max(y, w)+1\nb = 6\nimport math\ng = math.gcd(a, b)\na //= g\nb //= g\nprint(str(a)+'/'+str(b))\n", "n,m=map(int,input().split())\r\nn=max(n,m)\r\nres1=6-n+1\r\nres2=6\r\nfor i in range(1,6): \r\n if(res1%i==0 and res2%i==0):\r\n res1=res1//i \r\n res2=res2//i\r\nprint(res1,end=\"\")\r\nprint('/',end=\"\")\r\nprint(res2)", "y, w=map(int, input().split())\r\ns=0\r\nm=0\r\nn=max(y, w)\r\nfor i in range(1, 7):\r\n if i>=n and i<=6:\r\n m=m+1\r\nif m==1:\r\n s=\"1/6\"\r\nif m==2:\r\n s=\"1/3\"\r\nif m==3:\r\n s='1/2'\r\nif m==4:\r\n s='2/3'\r\nif m==5:\r\n s='5/6'\r\nif m==6:\r\n s='1/1'\r\nif m==0:\r\n s='0/1'\r\nprint(s)", "def inp():\r\n x = input()\r\n return list(map(eval, x.split(\" \")))\r\n\r\ndef main():\r\n\r\n die = inp()\r\n\r\n num = str(6-max(die)+1)\r\n den = \"6\"\r\n\r\n if num == '1':\r\n print(num + \"/\" + den)\r\n elif num == '2':\r\n print(str(1) + \"/\" + str(3))\r\n elif num == '3':\r\n print(str(1) + \"/\" + str(2))\r\n elif num == '4':\r\n print(str(2) + \"/\" + str(3))\r\n elif num == '5':\r\n print(str(5) + \"/\" + den)\r\n elif num == '6':\r\n print(str(1) + \"/\" + str(1))\r\n \r\nif __name__ == \"__main__\":\r\n main()", "from math import gcd\r\n\r\ny,w = map(int,input().split())\r\nma = max(y,w)\r\nma = 6-ma+1\r\ntotal = 6\r\ndiv = gcd(ma,total)\r\nma = ma//div\r\ntotal = total//div\r\nprint(str(ma)+\"/\"+str(total))\r\n ", "import math\n\ndef irr(c):\n\td = int(math.gcd(c, 6))\n\tx = int(c/d)\n\ty = int(6/d)\n\tres = [x, y]\n\treturn res\n\na, b = input().split()\na = int(a)\nb = int(b)\nc = 7 - max(a, b)\nif c == 0:\n\tprint(\"0/1\")\nelif c == 6:\n\tprint(\"1/1\")\nelse:\n\tres = irr(c)\n\tprint(str(res[0]) + \"/\" + str(res[1]))\n", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\nmax_scores = max(list(map(int, input().split())))\r\nprint(str((6 - max_scores + 1) // gcd(6, 6 - max_scores + 1)) + '/' + str(6 // gcd(6, 6 - max_scores + 1)))\r\n\r\n", "from fractions import Fraction\r\ns=list(map(int,input().split()))\r\nn=6-(max(s)-1)\r\nf=Fraction(n,6)\r\nif f==1:\r\n print('1/1')\r\nelif f!=0:\r\n print(f)", "x,y=list(map(int,input().split()))\r\nz=max(x,y)\r\nans=6-z+1\r\nif ans==1:\r\n print('1/6')\r\nelif ans==2:\r\n print('1/3')\r\nelif ans==3:\r\n print('1/2')\r\nelif ans==4:\r\n print('2/3')\r\nelif ans==5:\r\n print('5/6')\r\nelse:\r\n print('1/1')", "numbers = input().split()\r\nY = int(numbers[0])\r\nW = int(numbers[1])\r\nif Y>W:\r\n x=6-Y+1\r\nelse:\r\n x=6-W+1\r\na=x\r\nb=6\r\nif 6 % x == 0:\r\n a=1\r\n b=(6//x)\r\nelse:\r\n None \r\nif x % 2 == 0:\r\n a=(x//2)\r\n b=3\r\nelse: \r\n None \r\nif a == b:\r\n a = 1\r\n b = 1\r\nprint(str(a)+\"/\"+str(b))", "s=[\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nx=list(map(int,input().split()))\r\nn=max(x)\r\nprint(s[n])\r\n", "Y, W = input().split()\r\nY, W = int(Y), int(W)\r\nif (Y == 6) or (W == 6):\r\n print(1, '/',6,sep='')\r\nelif (Y == 5) or (W == 5):\r\n print(1, '/',3,sep='')\r\nelif (Y == 4) or (W == 4):\r\n print(1, '/',2,sep='')\r\nelif (Y == 3) or (W == 3):\r\n print(2, '/',3,sep='')\r\nelif (Y == 2) or (W == 2):\r\n print(5, '/',6,sep='')\r\nelif (Y == 1) or (W == 1):\r\n print(1, '/',1,sep='')", "rolls = [int(x) for x in input().split(' ')]\r\n\r\nhighest_roll = max(rolls)\r\n\r\nchances = 6 - highest_roll\r\n\r\nif chances == 5:\r\n print('1/1')\r\nelif chances == 4:\r\n print('5/6')\r\nelif chances == 3:\r\n print('2/3')\r\nelif chances == 2:\r\n print('1/2')\r\nelif chances == 1:\r\n print('1/3')\r\nelse:\r\n print('1/6')\r\n ", "a,b=input().split()\r\nz=max(int(a),int(b))\r\nl=[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(l[6-z])", "from fractions import Fraction\r\nn, p = map(int, input().split())\r\nx = (7 - max(n, p))\r\nc = Fraction(x, 6)\r\nprint(c) if c != 1 else print('1/1')", "a,b = map(int,input().split())\r\nc = max(a,b)\r\nd = (6-c)+1\r\nif d==4:\r\n print(f'{2}/{3}')\r\nelif 6%d==0:\r\n f = 6//d\r\n print(f'{1}/{f}')\r\nelse:\r\n print(f'{d}/{6}')", "s = input()\r\n\r\na = int(s.split()[0])\r\nb = int(s.split()[1])\r\nnumer = ((6-max(a, b))+1)\r\ndenom = 6\r\nif numer != 0 and numer % 2 == 0:\r\n numer //=2\r\n denom //= 2\r\nelif numer != 0 and numer % 3 == 0:\r\n numer //=3\r\n denom //= 3\r\np = numer//denom\r\nif numer == 0:\r\n print('0/1')\r\nelif numer == denom:\r\n print('1/1')\r\nelse:\r\n print(f'{numer}/{denom}')", "from fractions import Fraction\r\n\r\na , b = map(int,input().split())\r\nx = max(a , b )\r\nl = []\r\n\r\nfor i in range(7):\r\n if i >= x :\r\n l.append(i)\r\n\r\nres = Fraction(len(l) , 6 )\r\n\r\nif res == 0 :\r\n print('0/1')\r\n exit()\r\nelif res == 1 :\r\n print('1/1')\r\n exit()\r\nelse:\r\n print(res)\r\n\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nif a>b:\r\n t=7-a\r\nelse:\r\n t=7-b\r\nif t==1:print('1/6')\r\nif t==2:print('1/3')\r\nif t==3:print('1/2')\r\nif t==4:print('2/3')\r\nif t==5:print('5/6')\r\nif t==6:print('1/1')\r\n", "from fractions import Fraction\r\n\r\n\r\nx = list(map(int,input().split()))\r\nm = Fraction((6-max(x)+1),6)\r\nif m == 1 :\r\n print('1/1') \r\nelse:\r\n print(m)\r\n", "a,b = map(int,input().split())\r\nmx = max(a,b)\r\nif mx == 1:\r\n print('1/1')\r\nelif mx == 2:\r\n print('5/6')\r\nelif mx == 3:\r\n #print('4/6')\r\n print('2/3')\r\nelif mx == 4:\r\n #print('3/6')\r\n print('1/2')\r\nelif mx == 5:\r\n #print('2/6')\r\n print('1/3')\r\nelse:\r\n print('1/6')\r\n \r\n", "from fractions import Fraction\r\ny, w = map(int, input().split(\" \"))\r\nans = Fraction((6 - max(y, w) +1),6)\r\nif ans == 1:\r\n print('1/1')\r\nelse:\r\n print(ans)", "li = input()\r\nli = li.split()\r\nlist1 = [ ]\r\nlist3 = [1,2,3,4,5,6]\r\nlist1 = list(map(int,li))\r\n#print(list1)\r\nn = max(list1)\r\np = min(list1)\r\nif n ==1:\r\n\tprint(\"1/1\")\r\nelif n ==6:\r\n\tprint(\"1/6\")\r\nelse:\r\n\to = n -1\r\n\tlist2 = [ ]\r\n\tlist2 = list3[o:]\r\n\tans = len(list2) / 6\r\n\t#print(ans) \r\n\tif len(list2) % 2 ==0:\r\n\t\tq = int(len(list2) /2)\r\n\t\tprint(str(q)+\"/3\")\r\n\telif len(list2) % 3 ==0:\r\n\t\ts = int(len(list2) /3)\r\n\t\tprint(str(s)+\"/2\")\r\n\telse:\r\n\t\te =len(list2)\r\n\t\tprint(str(e)+\"/6\")\t", "y,w=map(int,input().split())\r\ns=max(y,w)\r\nn=6-(s-1)\r\nif(n%6==0):\r\n print(str(n//6)+'/'+str(6//6))\r\nelif(n%3==0):\r\n print(str(n//3)+'/'+str(6//3))\r\nelif(n%2==0):\r\n print(str(n//2)+'/'+str(6//2))\r\nelse:\r\n print(str(n)+'/'+str(6))\r\n", "x=input(\"\").split(\" \")\r\nmax=0\r\nif(x[0]>x[1]):\r\n max=int(x[0])\r\nelse:\r\n max=int(x[1])\r\nA=7-max\r\nB=6\r\nif(A==0):\r\n print(\"0/1\")\r\nelif(A==1):\r\n print(\"1/6\")\r\nelif(A==2):\r\n print(\"1/3\")\r\nelif(A==3):\r\n print(\"1/2\")\r\nelif(A==4):\r\n print(\"2/3\")\r\nelif(A==5):\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")\r\n", "from fractions import Fraction\r\n\r\n\r\ndef probability(points: list[int]):\r\n max_point = max(points)\r\n range_of_points = 6 - max_point + 1\r\n prob = range_of_points/6\r\n\r\n if (prob == 0):\r\n result = \"0/1\"\r\n\r\n elif (prob == 1):\r\n result = \"1/1\"\r\n\r\n else:\r\n result = Fraction(range_of_points, 6)\r\n\r\n return result\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n points = list(map(int, input().split()))\r\n print(probability(points))\r\n", "from math import gcd\r\ny,w = map(int, input().split())\r\nn,d = 7- max(y,w), 6\r\ng = gcd(n,d)\r\nprint(\"{}/{}\".format(n//g,d//g))\r\n", "import math\r\na,b=map(int,input().split())\r\ncount=0\r\nfor j in range(max(a,b),7):\r\n count+=1\r\ngcd=math.gcd(count,6)\r\ncount//=gcd\r\nden=6//gcd\r\nprint(f\"{count}/{den}\")\r\n", "import math\r\n\r\ny, w = map(int, input().split())\r\n\r\nm = max(y, w)\r\n\r\na1 = 6-m+1\r\na2 = 6\r\na1, a2 = a1/math.gcd(a1,a2), a2/math.gcd(a1, a2)\r\na1, a2 = int(a1), int(a2)\r\n\r\nprint(a1,end='/')\r\nprint(a2)\r\n", "list_d = list(range(1, 7, 1))\r\nl = 6\r\n\r\ninp = list(map(int, input().split(\" \")))\r\ny = inp[0]\r\nw = inp[1]\r\n\r\nma = max(y, w)\r\n\r\nle = len(list(range(ma, 7, 1)))\r\n\r\nfor i in list_d:\r\n if ((le % i == 0) and (l % i == 0)):\r\n le = int(le/i)\r\n l = int(l/i)\r\n\r\nprint(str(le)+\"/\"+str(l))", "n = [int(x) for x in input().split()]\nn.sort()\nchances = 6 - (int(n[1]) - 1)\nif chances == 3:\n print(\"1/2\")\nelif chances == 6:\n print(\"1/1\")\nelif chances % 2 == 0:\n print(str(int(chances / 2)) + \"/3\")\nelse:\n print (str(chances) + \"/6\")", "# dice roll\r\n\r\na = input().split()\r\ny, w = int(a[0]), int(a[1])\r\n\r\nx = 7 - max(y, w)\r\n\r\nans = {1:'1/6', 2:'1/3', 3:'1/2', 4:'2/3', 5:'5/6', 6:'1/1'}\r\n\r\nprint(ans[x])", "a,b=map(int,input().split())\nc=max(a,b)\nver=6-c+1\nm=6\n\nif c==1:\n print('1/1')\n\nelif m%2==0 and ver%2==0:\n print(str(ver//2)+'/'+str(m//2))\n\nelif m%3==0 and ver%3==0:\n print(str(ver//3)+'/'+str(m//3))\n\nelse:\n print(str(ver)+'/'+str(m))\n", "x,y= input().split()\r\nx = int (x)\r\ny = int(y)\r\na = ['1/6','1/3','1/2','2/3','5/6','1/1']\r\nprint(a[6-max(x,y)])\r\n", "from fractions import gcd\r\na,b=map(int,input().split())\r\nm=6-max(a,b)+1\r\nprint(str(int(m/gcd(m,6)))+'/'+str(int(6/gcd(m,6))))\r\n", "import numbers\r\n\r\ntrials = list(map(int,input().split()))\r\n\r\nnumerator = 6 - max(trials) + 1\r\ndenominator = 6\r\n\r\nfor i in range(2,6):\r\n\r\n if ( not numerator%i and not denominator%i ):\r\n numerator//=i\r\n denominator//=i\r\n\r\nprint(str(numerator) + '/' + str(denominator))\r\n", "from fractions import Fraction\r\n\r\nif __name__ == '__main__':\r\n a, b = map(int, input().split())\r\n \r\n t = 6 - max(a, b) + 1\r\n \r\n f = Fraction(t, 6)\r\n \r\n if t == 0:\r\n print('0/1')\r\n else:\r\n print(f'{f.numerator}/{f.denominator}')\r\n \r\n ", "def gcd(a,b):\r\n m = min(a,b)\r\n n = max(a,b)\r\n l = 0\r\n if a==0 or b==0:\r\n return 0\r\n else:\r\n for i in range(1000):\r\n l = n % m\r\n if l==0:\r\n return m\r\n else:\r\n n=m\r\n m=l\r\n continue\r\nb = list(int(x) for x in input().split())\r\nt = gcd(7-max(b),6)\r\nprint(int((7-max(b))/t),end=\"\")\r\nprint(\"/\",end=\"\")\r\nprint(int(6/t))", "from fractions import Fraction\r\na = max(list(map(int,input().split())))\r\nprint(str(Fraction(numerator=7-a, denominator=6))+'/1'*(a==1))\r\n", "Y, W = input().split()\r\nY, W = int(Y), int(W)\r\ncounter = 0\r\nif Y > W:\r\n max = Y\r\nelse:\r\n max = W\r\nif 7-max == 0:\r\n print(\"0/1\")\r\nelse:\r\n a, b = 7-max, 6\r\n while a != 0 and b != 0:\r\n if a > b:\r\n a = a % b\r\n else:\r\n b = b % a\r\n \r\n\r\n print(str(int((7-max)/(a + b)))+\"/\"+str(int(6/(a + b))))", "m,n = map(int,input().split())\nt = max(m,n)\na = 6-t+1\nk = 6\nfor i in range(1,7):\n if(a%i == 0 and k%i == 0):\n a = a/i\n k = k/i\nprint(int(a), end='')\nprint('/', end='')\nprint(int(k))\n\n\t \t\t\t \t\t \t \t \t\t \t \t\t \t\t\t", "arr = y,w = [int(x) for x in input().split()]\r\n\r\nmx = max(arr)\r\n\r\nd = 6-mx+1\r\n\r\nif d == 0:\r\n print(\"0/1\")\r\nelif d == 1:\r\n print(\"1/6\")\r\nelif d == 2:\r\n print(\"1/3\")\r\nelif d == 3:\r\n print(\"1/2\")\r\nelif d == 4:\r\n print(\"2/3\")\r\nelif d == 5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "y, w = map(int, input().split())\r\npossibleValues = 6 - max(y, w)\r\nif possibleValues == 0:\r\n print(\"1/6\")\r\nelif possibleValues == 1:\r\n print(\"1/3\")\r\nelif possibleValues == 2:\r\n print(\"1/2\")\r\nelif possibleValues == 3:\r\n print(\"2/3\")\r\nelif possibleValues == 4:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "a,b = map(int, input().split()) \r\nx = max(a, b) \r\nif x==1:\r\n print(\"1/1\")\r\nif x==2:\r\n print(\"5/6\")\r\nif x==3:\r\n print(\"2/3\")\r\nif x==4:\r\n print(\"1/2\")\r\nif x==5:\r\n print(\"1/3\")\r\nif x==6:\r\n print(\"1/6\") \r\n ", "from fractions import Fraction\r\ny,w=map(int,input().split())\r\nif y==w:\r\n\tr=(6-y+1)/6\r\n\tv=Fraction(6-y+1,6)\r\n\tif v==1:\r\n\t print(\"1/1\")\r\n\telif v==0:\r\n\t print(\"0/1\")\r\n\telse:\r\n\t print(v)\r\nelse:\r\n\tv=Fraction(6-max(y,w)+1,6)\r\n\tif v==1:\r\n\t print(\"1/1\")\r\n\telif v==0:\r\n\t print(\"0/1\")\r\n\telse:\r\n\t print(v)", "s = input()\r\ns = s.split(\" \")\r\ny=int(s[0])\r\nw=int(s[1])\r\nl=[\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nm=max(y,w)\r\nprint(l[m-1])", "n,m = [int(i) for i in input().split()]\r\na = max(n,m)\r\nk = 6-(a-1)\r\nif k == 6:\r\n\tprint('1/1')\r\nelif k == 5 :\r\n\tprint('5/6')\r\nelif k == 4:\r\n\tprint('2/3')\r\nelif k == 3 :\r\n\tprint('1/2')\r\nelif k == 2:\r\n\tprint('1/3')\r\nelif k == 1:\r\n\tprint('1/6')\r\nelif k == 0 :\r\n\tprint('0/0')\r\n", "y, w = map(int, input().split())\r\np = 7-max(y, w)\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n if b == 0:\r\n return a\r\n return gcd(b%a, a)\r\nx = gcd(p, 6)\r\nprint(\"%d/%d\"%(p//x, 6//x))\r\n", "def gcd(a,b):\r\n\t\t\t\tif a == 0:\r\n\t\t\t\t\treturn b\r\n\t\t\t\treturn gcd(b%a,a)\r\na, b = str(input()).split(' ')\r\na = int(a)\r\nb = int(b)\r\nif a > b:\r\n max = a\r\nelse:\r\n max = b\r\nprob = 7-max\r\nze = gcd(prob,6)\r\nprint(f'{prob//ze}/{6//ze}')", "from math import gcd\r\na=input().split()\r\nb=7-int(max(a))\r\nc=gcd(b,6)\r\nx=int(b/c)\r\ny=int(6/c)\r\nprint(x,end=\"/\")\r\nprint(y)", "from sys import stdin, stdout\r\n\r\noutcomes = 7 - max(int(i) for i in stdin.readline().split())\r\nif outcomes == 1: stdout.write('1/6')\r\nelif outcomes == 2: stdout.write('1/3')\r\nelif outcomes == 3: stdout.write('1/2')\r\nelif outcomes == 4: stdout.write('2/3')\r\nelif outcomes == 5: stdout.write('5/6')\r\nelif outcomes == 6: stdout.write('1/1')\r\nelse: stdout.write('0/1')", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nm=max(a,b)\r\nc=7-m\r\nif c==0:print('0/1')\r\nelif c==1:print('1/6')\r\nelif c==2:print('1/3')\r\nelif c==3:print('1/2')\r\nelif c==4:print('2/3')\r\nelif c==5:print('5/6')\r\nelse:print('1/1')", "y, w = [int(i) for i in input().split()]\r\nmx = max(y , w)\r\nprob = 7 - mx\r\nif y == 1 and w == 1:\r\n print(\"1/1\")\r\nelif prob % 2 != 0 and prob %3 != 0:\r\n print(f\"{prob}/{6}\")\r\nelif prob % 2 == 0:\r\n print(f\"{prob // 2}/{6//2}\")\r\nelse:\r\n print(f\"{prob//3}/{6//3}\")", "def gcd (a,b):\r\n if b ==0:\r\n return a\r\n else:\r\n return gcd(b, a%b)\r\n\r\n\r\nnumbers = [int(i)for i in input().split()]\r\nmaximum = max(numbers)\r\npossible = 6-maximum+1\r\nnumerator = possible\r\ndenominator = 6\r\nwhile gcd(numerator,denominator)!=1:\r\n factor = gcd(numerator,denominator)\r\n numerator = int(numerator/factor)\r\n denominator = int(denominator/factor)\r\nprint(str(numerator)+\"/\"+str(denominator))\r\n", "n,m = map(int,input().split())\narr = ['','1/1','5/6','2/3','1/2','1/3','1/6']\nval = max(n,m)\nprint(arr[val])\n \n \t\t \t\t \t\t\t\t \t\t \t \t\t \t\t\t \t \t", "a,b = map(int,input().split())\r\nprint(['','1/1','5/6','2/3','1/2','1/3','1/6'][max(a,b)])", "s = input()\r\ns.split()\r\nma = max(s)\r\ndot = 6-int(ma)+1\r\nif dot == 2:\r\n print(1,\"/\",3,sep=\"\")\r\nelif dot == 3:\r\n print(1,\"/\",2,sep=\"\")\r\nelif dot == 4:\r\n print(2,\"/\",3,sep=\"\")\r\nelif dot == 6:\r\n print(1,\"/\",1,sep=\"\")\r\nelse:\r\n print(dot,\"/\",6,sep=\"\")", "from fractions import Fraction\r\na, b = map(int, input().split())\r\nm = max(a, b)\r\np = Fraction(6-(m-1), 6)\r\nif p == p.numerator:\r\n print(p, '/1',sep='')\r\nelse:\r\n print(p)", "a, b = map(int, input().split())\r\n\r\ndic = {0: \"0/1\", 1: \"1/6\", 2: \"1/3\", 3: \"1/2\", 4: \"2/3\", 5: \"5/6\", 6: \"1/1\"}\r\nchances = 7 - max(a, b)\r\n\r\nprint(dic[chances])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 30 19:32:51 2021\r\n\r\n@author: nehas\r\n\"\"\"\r\n\r\ny,w=map(int,input().split())\r\nl=[\"\",\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nc=max(y,w)\r\nprint(l[c])\r\n", "#Se le asigna una proba a cada número en el dado. \n#Se le resta a 6 para saber la oportunidad que Dot tiene de ganar.\n#El resultado es usado para referenciar una variable de la lista de strings de proba. \nproba = ['1/6','1/3','1/2','2/3','5/6','1/1']\nYakko, Wakko = map(int, input().split())\nmaxRoll = max(Yakko,Wakko)\nprint(proba[6-maxRoll])\n\t \t \t\t \t\t\t\t \t\t\t \t \t\t \t", "Y,W = map(int,input().split())\r\nyw = max(Y,W)\r\nif yw == 1:\r\n print('1/1')\r\nelif yw == 2:\r\n print('5/6')\r\nelif yw == 3:\r\n print('2/3')\r\nelif yw == 4:\r\n print('1/2')\r\nelif yw == 5:\r\n print('1/3')\r\nelif yw == 6:\r\n print('1/6')", "a,b=map(int,input().split())\r\nc=6\r\nd=6-max(a,b)+1\r\nif d%2==0:\r\n d=d//2\r\n c=c//2\r\nif d%3==0:\r\n d=d//3\r\n c=c//3\r\nprint(str(d)+\"/\"+str(c))", "Y, W = map(int, input().split())\r\nn, d = 7-(max(Y,W)), 6\r\nif n % 2 == 0:\r\n n //= 2\r\n d //= 2\r\nif n % 3 == 0:\r\n n //= 3\r\n d //= 3\r\n\r\nprint(f'{n}/{d}')\r\n", "a, b = map(int, input().split())\r\nc = 6-max(a, b)+1\r\nif c == 2:\r\n print('1/3')\r\nelif c == 3:\r\n print('1/2')\r\nelif c == 4:\r\n print('2/3')\r\nelif c == 6:\r\n print('1/1')\r\nelse:\r\n print(f'{c}/6')", "def die(a,b):\r\n maximum=max(a,b)-1\r\n ans=(6-maximum)\r\n if ans==1:\r\n print(str(1)+'/'+str(6))\r\n elif ans==2:\r\n print(str(1)+'/'+str(3))\r\n elif ans==3:\r\n print(str(1)+'/'+str(2))\r\n elif ans==4:\r\n print(str(2)+'/'+str(3))\r\n elif ans==5:\r\n print(str(5)+'/'+str(6))\r\n else:\r\n print(str(1)+'/'+str(1))\r\n \r\na,b=map(int,input().split())\r\ndie(a, b)\r\n ", "from fractions import Fraction\r\n\r\nk,r =map(int,(input().split())) \r\n \r\nx=max(k,r)\r\n\r\ndie=['1/6','1/3','1/2','2/3','5/6','1/1']\r\n\r\n\r\nprint(die[6-x])\r\n ", "p,q= map(int, input().split())\r\narr=[\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nans=max(p,q)\r\nprint(arr[ans])\r\n", "n,m=map(int,input().split())\r\n\r\nif n>=m:\r\n res=6-n+1\r\n if res==0:\r\n print(\"0/1\")\r\n elif res==1:\r\n print(\"1/6\")\r\n elif res==2:\r\n print(\"1/3\")\r\n elif res==3:\r\n print(\"1/2\")\r\n elif res==4:\r\n print(\"2/3\")\r\n elif res==5:\r\n print(\"5/6\")\r\n else:\r\n print(\"1/1\")\r\n\r\nelse:\r\n res = 6 - m + 1\r\n if res == 0:\r\n print(\"0/1\")\r\n elif res == 1:\r\n print(\"1/6\")\r\n elif res == 2:\r\n print(\"1/3\")\r\n elif res == 3:\r\n print(\"1/2\")\r\n elif res == 4:\r\n print(\"2/3\")\r\n elif res == 5:\r\n print(\"5/6\")\r\n else:\r\n print(\"1/1\")", "y,w=map(int,input().split())\r\nc=6-max(y,w)+1\r\nd=6\r\nfor i in range(1,6+1):\r\n if(d%i==0 and c%i==0):\r\n d=d//i\r\n c=c//i\r\nprint(c,'/',d,sep='')", "import math\r\ny,w = list(map(int,input().split()))\r\nnum = ((6-max(y,w))+1)\r\ngcd = round(math.gcd(num,6))\r\n# print(gcd)\r\nnum = num//gcd\r\nden = 6//gcd\r\nres = str(num)+'/'+str(den)\r\nprint(res)", "from fractions import Fraction\n\n\na = max([int(x) for x in input().split()])\nb = (6 - a)+1\n\nif a == 1:\n print(\"1/1\")\nelse:\n print(Fraction(b,6))\n\n\n\n\n\n\n", "A, B = map(int, input().split())\r\nprobability = [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nX = max(A, B)\r\nprint(probability[X])\r\n", "from fractions import Fraction\ninp=(list(map(int,input().split())))\nx=max(inp)\nif x==1:\n print(\"1/1\")\nelse:\n print(Fraction(7-x, 6))\n", "\r\nfrom math import gcd\r\n\r\nx, y = map(int, input().split())\r\nn = 7 - max(x, y)\r\nd = 6\r\ng = gcd(n, d)\r\nprint(f'{n//g}/{d//g}')", "a, b=[int(k) for k in input().split()]\r\nres=0\r\nfor i in range(1, 7):\r\n if i>=a and i>=b:\r\n res+=1\r\nif res==1:\r\n print(\"1/6\")\r\nelif res==2:\r\n print(\"1/3\")\r\nelif res==3:\r\n print(\"1/2\")\r\nif res==4:\r\n print(\"2/3\")\r\nelif res==5:\r\n print(\"5/6\")\r\nelif res==6:\r\n print(\"1/1\")", "from fractions import Fraction\r\na,b=map(int,input().split())\r\nk=max(a,b)\r\nl=6-k+1\r\nm=k-1+l\r\nif l==6:\r\n print(\"1/1\")\r\n\r\n \r\nelse:\r\n print(Fraction(l,m))\r\n", "n,m=list(map(int,input().split()))\r\nma=max(n,m)\r\nt=7-ma\r\nif t==1:\r\n print(str(1)+\"/\"+str(6))\r\nelif t==2:\r\n print(str(1)+\"/\"+str(3))\r\nelif t==3:\r\n print(str(1)+\"/\"+str(2))\r\nelif t==4:\r\n print(str(2)+\"/\"+str(3))\r\nelif t==5:\r\n print(str(5)+\"/\"+str(6))\r\nelse:\r\n print(str(1)+\"/\"+str(1))", "y,w=map(int,input().split())\r\nm=max(y,w)\r\ndic={1:\"1/6\",2:\"1/3\",3:\"1/2\",4:\"2/3\",5:\"5/6\",6:\"1/1\"}\r\nprint(dic[7-m])", "x=max(map(int,input().split()))\r\nif x==1:\r\n print(1,'/',1,sep='')\r\nelif x==2:\r\n print(5,'/', 6,sep='')\r\nelif x==3:\r\n print(2,'/', 3,sep='')\r\nelif x==4:\r\n print(1,'/', 2,sep='')\r\nelif x==5:\r\n print(1,'/', 3,sep='')\r\nelse:\r\n print(1,'/', 6,sep='')", "Num = list(input())\n\nNum[0] = int(Num[0])\nNum[1] = int(Num[2])\nNum.pop(2)\n\ns = max(Num)\n\nscore = 7 - s\n\ndef fraccion_irrec(num, dem, i):\n if i == 1:\n return int(num), int(dem)\n if num%i == 0 and dem%i == 0:\n return fraccion_irrec(num/i, dem/i, i-1)\n else:\n return fraccion_irrec(num, dem, i-1)\n\nhola = fraccion_irrec(score, 6, score)\nprint(str(hola[0])+\"/\"+str(hola[1]))\n\t\t\t \t\t \t \t \t\t\t\t\t\t \t \t \t \t", "y,w= [int(i) for i in input().rstrip().split()] \r\nm=max(y,w)\r\ns=6-m+1\r\ng=6\r\nwhile True:\r\n if s%2==0 and g%2==0:\r\n #print(f\"{s//2}/{g//2}\")\r\n s,g=s//2,g//2\r\n elif s%3==0 and g%3==0:\r\n #print(f\"{s//3}/{g//3}\")\r\n s,g=s//3,g//3\r\n else:\r\n break\r\nprint(f\"{s}/{g}\")", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef main():\r\n while True:\r\n try:\r\n x, y = map(int, input().split())\r\n t = 6 - max(x, y) + 1\r\n if t == 6:\r\n print(\"1/1\")\r\n continue\r\n print(\"{}/{}\".format(t // gcd(t, 6), 6 // gcd(t, 6)))\r\n except EOFError:\r\n break\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# cook your dish here\r\nimport math\r\ny,w = map(int,input().split())\r\n\r\nres = [1,2,3,4,5,6]\r\n\r\nnum = len(list(filter(lambda x: x>=max(y,w),res)))\r\n\r\nif num==0:\r\n print('0/1')\r\n \r\nelif num==6:\r\n print('1/1')\r\n \r\nelse:\r\n temp=num\r\n num = num//math.gcd(temp,6)\r\n den = 6//math.gcd(temp,6)\r\n print(str(num)+'/'+str(den))", "y = map(int, input().split())\r\nf = ['1/6', '1/3', '1/2', '2/3', '5/6', '1/1']\r\nprint(f[6 - max(y)])", "Y,W=input().split()\r\nY=int(Y)\r\nW=int(W)\r\nnilai=max(Y,W)\r\nif nilai==1:\r\n print(\"1/1\")\r\nelif nilai==2:\r\n print(\"5/6\")\r\nelif nilai==3:\r\n print(\"2/3\")\r\nelif nilai==4:\r\n print(\"1/2\")\r\nelif nilai==5:\r\n print(\"1/3\")\r\nelse:\r\n print(\"1/6\")", "import math\r\ny,w=list(map(int,input().split()))\r\nm=max(y,w)\r\nc=0\r\nfor i in range(1,7):\r\n if i>=m:\r\n c=c+1\r\nco=math.gcd(c,6)\r\nprint(int(c/co),'/',int(6/co),sep=\"\")\r\n", "y, w = list(map(int, input().split()))\r\n\r\na = 6 - ((max(y, w))) +1\r\nb = 6\r\n\r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return abs(x)\r\n\r\n\r\ng = gcd(a, b)\r\nprint(int(a / g), '/', int(b / g), sep='')\r\n", "def gcd(a,b):\r\n if(b==0):\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\ndef irr_fraction(num,dem):\r\n g = gcd(num,dem)\r\n while(g>1):\r\n num/=g\r\n dem/=g\r\n g = gcd(num,dem)\r\n\r\n print(str(int(num))+\"/\"+str(int(dem)))\r\n\r\n\r\ndef solve(y,w):\r\n\r\n avlbl = min(6,6-max(y,w)+1)\r\n irr_fraction(avlbl,6)\r\n\r\n\r\n\r\ny,w = [int(y) for y in input().split()]\r\nsolve(y,w)", "required_nums = (6-(max(list(map(int,input().split())))))+1\r\nmax_no = 6\r\nif required_nums == max_no:\r\n print(\"1/1\")\r\nelse:\r\n for x in range(2,6):\r\n if required_nums%x==0 and max_no%x==0:\r\n print(str(required_nums//x)+\"/\"+str(max_no//x))\r\n break\r\n else:\r\n print(str(required_nums)+'/'+str(max_no))", "y, w = map(int, input().split())\r\nm = max(y, w)\r\n\r\ndef gcd(a, b):\r\n if b==0:\r\n return a\r\n else:\r\n return gcd(b, a%b)\r\n\r\nprint(f\"{int((7-m)/gcd(7-m,6))}/{int(6/gcd(7-m,6))}\")\r\n\r\n", "import math\r\ny,w=map(int,input().split())\r\na=max(y,w)\r\na=7-a\r\nz=math.gcd(a,6)\r\nif z!=1:\r\n\tdot1=int(a/z)\r\n\tdot2=int(6/z)\r\n\tdot=str(dot1)+\"/\"+str(dot2)\r\n\tprint(dot)\r\nelse:\r\n\tdot=str(a)+\"/\"+\"6\"\r\n\tprint(dot)\r\n", "from fractions import Fraction\r\ny,w=map(int, input().split())\r\nb=list(range(max(y,w),7))\r\nc= str(Fraction(len(b), 6))\r\nprint(c if len(c) > 1 else c+\"/1\")", "import sys\r\n\r\n\r\ndef sol():\r\n\tread = sys.stdin.readline\r\n\ty, w = (int(i) for i in read().split())\r\n\tp_numerator: int = 6 - (max(w, y) - 1)\r\n\tdenominator: int = 6\r\n\tif p_numerator == 4:\r\n\t\tp_numerator = 2\r\n\t\tdenominator = 3\r\n\telif p_numerator == 3:\r\n\t\tp_numerator = 1\r\n\t\tdenominator = 2\r\n\telif p_numerator == 2:\r\n\t\tp_numerator = 1\r\n\t\tdenominator = 3\r\n\telif p_numerator == 6:\r\n\t\tp_numerator = 1\r\n\t\tdenominator = 1\r\n\r\n\r\n\tprint(f'{p_numerator}/{denominator}')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol()", "# https://codeforces.com/problemset/problem/9/A\r\ny_w = [int(i) for i in input().split()]\r\nmaxi = max(y_w)\r\nif maxi == 6:\r\n print('1/6')\r\nelif maxi == 5:\r\n print('1/3')\r\nelif maxi == 4:\r\n print('1/2')\r\nelif maxi == 3:\r\n print('2/3')\r\nelif maxi == 2:\r\n print('5/6')\r\nelif maxi == 1:\r\n print('1/1')", "from math import gcd\r\n\r\ny, w = map(int, input().split())\r\nnumerator = 6-max(y, w)+1\r\ngcd_num = gcd(numerator, 6)\r\nprint(str(numerator//gcd_num) + \"/\" + str(6//gcd_num))", "s=input().split();y=int(s[0]);w=int(s[1]);ans=7-max(y,w)\nif ans==1:\n print('1/6')\nelif ans==2:\n print('1/3')\nelif ans==3:\n print('1/2')\nelif ans==4:\n print('2/3')\nelif ans==5:\n print('5/6')\nelif ans==6:\n print('1/1')", "\nnumbers = input().split()\n\nbigger = max(int(numbers[0]), int(numbers[1]))\n\ndiceNumbers = [1, 2, 3 , 4, 5, 6]\n\nremainingNumbers = [1, 2, 3 , 4, 5, 6]\n\nfor index in range(len(diceNumbers)):\n\n element = diceNumbers[index]\n\n if element < bigger:\n remainingNumbers.remove(element)\n\nif len(remainingNumbers) == len(diceNumbers):\n print(\"1/1\")\n\nelse:\n\n up = len(remainingNumbers)\n down = len(diceNumbers)\n\n if up != 1 and down % up == 0:\n\n down /= up\n up /= up\n\n elif up % 2 == 0 and down % 2 == 0:\n up /= 2\n down /= 2\n \n elif up % 3 == 0 and down % 3 == 0:\n up /= 3\n down /= 3\n\n print(str(int(up)) + \"/\" + str(int(down)))\n \n\t\t \t\t \t\t\t\t \t \t \t \t\t\t\t \t \t", "from math import gcd\r\nm = 7 - max(map(int, input().split()))\r\nprint(f'{m//gcd(6, m) if gcd(6, m) - 1 else m}/{6//gcd(6, m) if gcd(6, m) - 1 else 6}')", "lis=sorted(list(map(int,input().strip().split())))\r\nm=lis[1]\r\np=(6-m+1)\r\nif p==0:\r\n print(\"0/6\")\r\nelif p==1:\r\n print(\"1/6\")\r\nelif p==2:\r\n print(\"1/3\")\r\nelif p==3:\r\n print(\"1/2\")\r\nelif p==4:\r\n print(\"2/3\")\r\nelif p==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")\r\n", "from fractions import Fraction\r\ny,w=map(int,input().split())\r\n\r\nif w==0:\r\n print(\"0/1\")\r\nelif w==y==1:\r\n print(\"1/1\")\r\n\r\nelif y>=w:\r\n print(Fraction(7-y, 6))\r\n\r\nelse:\r\n print(Fraction(7-w, 6))\r\n\r\n", "s = max(input().split())\r\nx, y = 7 - int(s), 6\r\nx2, y2 = x, y\r\nwhile(y):\r\n x, y = y, x % y\r\nprint(f'{int(x2 / abs(x))}/{int(y2 / abs(x))}')", "l=input().split()\r\nm=int(max(l))\r\ntmp=6-(m-1)\r\ntmp2=6\r\nif tmp==6:\r\n tmp=\"1\"\r\n tmp2=1\r\nelif tmp%2==0:\r\n tmp=tmp//2\r\n tmp2=6//2\r\nelif tmp%3==0:\r\n tmp=tmp//3\r\n tmp2=6//3\r\nprint(tmp,end=\"\")\r\nprint(\"/\",end=\"\")\r\nprint(tmp2,end=\"\")", "import math\r\n\r\nY, W = map(int, input().split())\r\n\r\nnumerator = 7 - max(Y, W)\r\ndenominator = 6\r\n\r\ngcd = math.gcd(denominator,numerator)\r\n\r\nprobability = f\"{numerator // gcd}/{denominator // gcd}\"\r\nprint(probability)", "s = list(map(int, input().split()))\r\na = max(s)\r\n#s = input()\r\n#a = max(int(s[0]), int(s[2]))\r\na = 6 - a + 1\r\nb = 6\r\nif a%2 == 0:\r\n a //= 2\r\n b //= 2\r\nif a%3 == 0:\r\n a //= 3\r\n b //= 3\r\nprint(a, b, sep = '/')\r\n", "a,b=map(int,input().split())\r\nm=max(a,b)\r\np=6-m+1\r\nd=6\r\nif p%2==0 :\r\n p=p//2\r\n d=d//2\r\nif p%3==0:\r\n p=p//3\r\n d=d//3\r\nprint(str(p)+\"/\"+str(d))", "n1 = input().split()\r\nlist1 = []\r\nfor i in n1:\r\n list1.append(int(i))\r\nmax1 = max(list1)\r\n\r\nnumerator = (6-max1 + 1) *(1)\r\ndenominator = 6\r\nb=False\r\nk = 1\r\nwhile b==False:\r\n if numerator % k == 0 and denominator % k ==0:\r\n numerator = int(numerator / k)\r\n denominator = int(denominator / k)\r\n k+=1\r\n if k > numerator:\r\n break\r\nprint(str(numerator) + \"/\" + str(denominator))", "y,w = map(int,input().split(\" \"))\r\n\r\nprob = [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\n\r\nprint(prob[max(y,w)])\r\n", "a=max(map(int,input().split()))\nans={\n 1:\"1/1\",\n 2:\"5/6\",\n 3:\"2/3\",\n 4:\"1/2\",\n 5:\"1/3\",\n 6:\"1/6\"\n}\n\nprint(ans[a])\n\n\n\n", "from fractions import Fraction\nYakko, Wakko = map(int, input().split())\n\n#Test how many faces can Dot get to win\nDot = 6-max(Yakko, Wakko)+1\n\n#Printing probablity\nprobablity = Fraction(Dot, 6)\n\nif (probablity == 1):\n print(\"1/1\")\nelif (probablity == 0):\n print(\"0/1\")\nelse:\n print(probablity)\n\n", "#%%\r\nYW=input().split()\r\nY,W=[int(x) for x in YW]\r\n\r\nDot=max(Y,W)\r\n\r\nif Dot==1:\r\n print('1/1')\r\nelif Dot==2:\r\n print('5/6')\r\nelif Dot==3:\r\n print('2/3')\r\nelif Dot==4:\r\n print('1/2')\r\nelif Dot==5:\r\n print('1/3')\r\nelse:\r\n print('1/6')\r\n\r\n# %%\r\n", "a,b = map(int,input().split())\r\nc = 7 - max(a,b)\r\nif c == 1: print(\"1/6\")\r\nelif c == 2: print(\"1/3\")\r\nelif c == 3: print(\"1/2\")\r\nelif c == 4: print(\"2/3\")\r\nelif c == 5: print(\"5/6\")\r\nelif c == 6: print(\"1/1\")", "y, w = map(int, input().split())\r\nMax_point = max(y, w)\r\nif (Max_point == 6):\r\n print (\"1/6\")\r\nelif (Max_point == 5):\r\n print (\"1/3\")\r\nelif (Max_point == 4):\r\n print (\"1/2\")\r\nelif (Max_point == 3):\r\n print (\"2/3\")\r\nelif (Max_point == 2):\r\n print (\"5/6\")\r\nelse:\r\n print (\"1/1\")", "def func(x):\r\n if x==5 or x==1: return 1\r\n if x==2 or x==4: return 2\r\n if x==3: return 3\r\n\r\nn=max(list(map(int,input().split())))-1\r\nif n!=0: n=6-n; x=func(n); print(f\"{int(n/x)}/{int(6/x)}\")\r\nelif n==0: print(\"1/1\")", "a = a0 = 7-max(map(int, input().split()))\r\nb = b0 = 6\r\nwhile a and b:\r\n if a > b:\r\n a -= b\r\n else:\r\n b -= a\r\nc = max(a, b)\r\nprint(a0//c, b0//c, sep='/')", "import math\r\na,b = map(int,input().split())\r\nx=max(a,b)\r\nn1=7-x\r\nn2=6\r\nprint(int(n1/math.gcd(n1,n2)),end=\"\")\r\nprint(\"/\",end=\"\")\r\nprint(int(n2/math.gcd(n1,n2)))", "from fractions import gcd\r\na,b=input().strip().split(\" \")\r\na,b=[int(a),int(b)]\r\nx=max(a,b)\r\nf=6-x+1\r\nif f==0:\r\n print(0,\"/\",1,sep=\"\")\r\nelif f==6:\r\n print(1,\"/\",1,sep=\"\")\r\nelse: \r\n print(f//gcd(f,6),\"/\",6//gcd(f,6),sep=\"\")\r\n", "x,y = map(int,input().split())\r\nc=(6-max(x,y)+1)\r\nt=6\r\nfor i in range(1,7):\r\n if c%i==0 and t%i==0:\r\n c=c//i\r\n t=t//i\r\nprint(str(c)+'/'+str(t))\r\n\r\n", "from fractions import gcd\r\ny,w= input().split()\r\nmax_num = max(y,w)\r\np = min(6,6-int(max_num)+1)\r\nd=6\r\ng=gcd(p,d)\r\np/=g\r\nd/=g\r\np=int(p)\r\nd=int(d)\r\nprint(str(p)+\"/\"+str(d))", "if __name__ == \"__main__\":\r\n y, w = map(int,input().split())\r\n count = 0\r\n\r\n for i in range(1,7):\r\n if(i >= max(y,w)):\r\n count = count + 1\r\n \r\n \r\n if(6 % count == 0):\r\n print(\"1/\" + str(int(6/count)))\r\n elif(count % 2 == 0):\r\n print(str(int(count/2)) + \"/3\")\r\n else:\r\n print(str(count) + \"/6\")", "Y, W = list(map(int,input().split(' ')))\r\n\r\nyBeat = 7-Y\r\n\r\nwBeat = 7-W\r\n\r\nif yBeat <= wBeat:\r\n if yBeat == 3:\r\n print(\"1/2\")\r\n elif yBeat == 2 or yBeat == 4:\r\n print(str(int(yBeat/2))+\"/3\")\r\n elif yBeat == 6:\r\n print(str(int(yBeat/6))+\"/1\")\r\n else:\r\n print(str(yBeat)+\"/6\")\r\nif wBeat < yBeat: \r\n if wBeat == 3:\r\n print(\"1/2\")\r\n elif wBeat == 2 or wBeat == 4:\r\n print(str(int(wBeat/2))+\"/3\")\r\n elif wBeat == 6:\r\n print(str(int(wBeat/6))+\"/1\")\r\n else:\r\n print(str(wBeat)+\"/6\")", "arg = input()\narg = arg.replace(\" \", \"\")\n\ndef Valid(num):\n if num > 0 and num < 8:\n return 1\n else:\n return 0\n\nif Valid(int(arg[0])) and Valid(int(arg[1])):\n yakko = int(arg[0])\n wakko = int(arg[1])\n if yakko >= wakko:\n dot = 6 - yakko + 1\n else:\n dot = 6 - wakko + 1\n\n from fractions import Fraction as frac\n if frac(dot, 6) == 1:\n print(\"1/1\")\n else: \n print(frac(dot, 6))\n \n\n\n\n\n\n\n \n\n \n\n\n", "def gcd(a,b):\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\nif max(a,b) == 6:\r\n print(1,6,sep = \"/\")\r\nelse:\r\n gc = gcd(7-max(a,b),6)\r\n x,y = (7-max(a,b))//gc,6//gc \r\n print( x, y, sep = \"/\")", "def gcd(a,b):\r\n if(b==0):\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\n\r\ndef irr_fraction(num,dem):\r\n g = gcd(num,dem)\r\n while(g>1):\r\n num/=g\r\n dem/=g\r\n g = gcd(num,dem)\r\n print (str(int(num))+\"/\"+str(int(dem))) \r\n\r\nx=input()\r\nk=[int(i) for i in x.split()]\r\nz=(6-max(k[0],k[1])+1)\r\nirr_fraction(z,6)", "import math\r\n\r\ny, w = [int(y) for y in input().split()]\r\nm = 7 - max(y, w)\r\nx = math.gcd(m,6)\r\nprint(int(m/x),end='')\r\nprint('/',end='')\r\nprint(int(6/x),end='')\r\n", "print ([\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"][6 - int(max(input().split()))])\r\n", "n,s=map(int,input().split())\r\na=[\"0/1\",\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nz=max(n,s)\r\nprint(a[z])", "from math import gcd\r\nm = 6-max(list(map(int,input().split(' '))))+1\r\nprint(str(m//gcd(m,6))+'/'+str(6//gcd(m,6)))", "print(['1/1','5/6','2/3','1/2','1/3','1/6'][max(map(int,input().split()))-1])", "from math import gcd\r\na, b = map(int, input().split())\r\nneu = 7 - max(a, b)\r\ndeno = 6\r\ng = gcd(neu, deno)\r\nneu, deno = neu // g, deno //g\r\nprint(str(neu) + \"/\" + str(deno))\r\n\r\n'''\r\n* So I drown it out \r\n* Like I always do\r\n* Dancing through our house\r\n* With the ghost of you\r\n'''\r\n", "y,w=map(int,input().split())\r\nl=7-max(y,w);tot=6\r\nif l%2==0:\r\n l=int(l/2)\r\n tot=int(tot/2)\r\nif l%3==0:\r\n l=int(l/3)\r\n tot=int(tot/3)\r\nprint(str(l)+\"/\"+str(tot))", "def out(x,y):\r\n return f\"{x}/{y}\"\r\na,b=map(int,input().split(\" \"))\r\np=7-max(a,b)\r\nif p==0:\r\n print(out(0,1))\r\nelif(p==6):\r\n print(out(1,1))\r\nelif(p==1 or p==5):\r\n print(out(p,6))\r\nelif(p==3):\r\n print(out(1,2))\r\nelif(p==2 or p==4):\r\n print(out((p//2),3))\r\n\r\n", "# A. Die Roll\r\nlista = [int(x) for x in input().split(' ')]\r\nmaior = max(lista)\r\n\r\na = (6 - maior) + 1 #+1 pq é maior ou IGUAL\r\nb = 6\r\n\r\nfor i in range(a+1):\r\n if i == 0:\r\n continue\r\n if a % i == 0 and b % i == 0:\r\n a = int(a/i)\r\n b = int(b/i)\r\nresposta = str(a) + '/' + str(b)\r\nprint(resposta)", "a, b = map(int, input().split())\r\na = max(a, b)\r\nnumerator = 6 - a + 1\r\ndenominator = 6\r\nif numerator % 2 == 0:\r\n numerator = numerator // 2\r\n denominator = denominator // 2\r\nif numerator % 3 == 0:\r\n numerator = numerator // 3\r\n denominator = denominator // 3\r\n\r\nprint((\"%d/%d\") % (numerator, denominator))", "Y,M=map(eval,input(\"\").split())\nQ=max(Y,M)\nZ=set()\nfor i in range(1,7):\n if i>=Q:\n Z.add(i)\n else:\n continue\nA=len(Z)\nB=6\nif A==6:\n print(\"1/1\")\nelif A==0:\n print(\"0/1\")\nelse:\n for i in range(2,B):\n while(A%i==0 and B%i==0):\n A=A//i\n B=B//i\n print(\"{}/{}\".format(A,B))\n \n\n\n\t\t \t \t \t \t \t \t \t\t \t\t\t", "a, i = map(int, input().strip().split())\n\nres = max(a, i)\n\nif res == 1:\n\tprint(\"1/1\")\nelif res == 2:\n\tprint(\"5/6\")\nelif res == 3:\n\tprint(\"2/3\")\nelif res == 4:\n\tprint(\"1/2\")\nelif res == 5:\n\tprint(\"1/3\")\nelif res == 6:\n\tprint(\"1/6\")", "y,w = [int(x) for x in input().split()]\r\nif y < w: \r\n y = w\r\n \r\na= (7-y)\r\nb= 6\r\nfor i in range(1,7):\r\n if a % i == 0 and b % i == 0:\r\n a/=i\r\n b/=i\r\na=int(a)\r\nb=int(b)\r\nprint(str(a)+'/'+str(b))", "import math\n\nn = 6 - max(map(int, input().split())) + 1\ngcd = math.gcd(n, 6)\nprint(n // gcd, 6 // gcd, sep=\"/\")\n", "a,b=map(int,input().split())\r\narr=[1,2,3,4,5,6]\r\nbrr=[]\r\nfor i in range(0,len(arr),1):\r\n if arr[i]>=a and arr[i]>=b:\r\n brr.append(arr[i])\r\nif len(brr)==1:\r\n print(\"1/6\")\r\nelif len(brr)==2:\r\n print(\"1/3\")\r\nelif len(brr)==3:\r\n print(\"1/2\")\r\nelif len(brr)==4:\r\n print(\"2/3\")\r\nelif len(brr)==5:\r\n print(\"5/6\")\r\nelif len(brr)==6:\r\n print(\"1/1\")\r\nelif len(brr)==0:\r\n print(\"0/1\")\r\n ", "import math\r\nlist = input().split()\r\nx = int(list[0])\r\ny = int(list[1])\r\nres = 7 - max(x ,y)\r\nprint(str(int(res / math.gcd(res, 6))) + \"/\" + str(int(6 / math.gcd(res, 6))))\r\n", "lt=list(input().split())\r\na,b=int(lt[0]),int(lt[1])\r\nif a<b:\r\n a=b\r\na=6-a+1\r\nb=6\r\nfor i in range(6,0,-1):\r\n if (a//i == a/i) and (b//i==b/i):\r\n a//=i\r\n b//=i\r\nprint(str(a)+\"/\"+str(b))\r\n", "from math import gcd\r\ndef die_roll(num,dem):\r\n g=gcd(num,dem)\r\n while g>1:\r\n num//=g\r\n dem//=g\r\n g=gcd(num,dem)\r\n print(str(num)+\"/\"+str(dem))\r\ny,w=map(int,input().split())\r\nx=min(6,6-max(y,w)+1)\r\ndie_roll(x,6)", "import sys\n \nINF = 2 * 10**18 + 99\n \ndef debug(n):\n print(n)\n \ndef main():\n a, b = map(int, input().split())\n if max(a, b) == 1:\n print(\"1/1\")\n elif max(a, b) == 2:\n print(\"5/6\")\n elif max(a, b) == 3:\n print(\"2/3\")\n elif max(a, b) == 4:\n print(\"1/2\")\n elif max(a, b) == 5:\n print(\"1/3\")\n else:\n print(\"1/6\")\n \nif __name__ == \"__main__\":\n main()\n\n\t\t \t\t \t \t \t\t \t \t \t\t\t", "y,w=[int(i) for i in input().split()]\r\nx=6-max(y,w)+1\r\nif x==0:\r\n print(\"0/1\")\r\nelif x==1:\r\n print(\"1/6\")\r\nelif x==2:\r\n print(\"1/3\")\r\nelif x==3:\r\n print(\"1/2\")\r\nelif x==4:\r\n print(\"2/3\")\r\nelif x==5:\r\n print(\"5/6\")\r\nelif x==6:\r\n print(\"1/1\")", "m = max([int(i) for i in input().split()])\r\nif m == 1:\r\n print ('1/1')\r\nelif m == 2:\r\n print ('5/6')\r\nelif m == 3:\r\n print ('2/3')\r\nelif m == 4:\r\n print ('1/2')\r\nelif m == 5:\r\n print ('1/3')\r\nelse:\r\n print ('1/6')", "try:\r\n Y, W = [int(i) for i in input().split()]\r\n Probs =['1/6','1/3','1/2','2/3','5/6','1/1']\r\n maxnum = max(Y,W)\r\n print(Probs[6-maxnum])\r\nexcept:\r\n print(\"Error: The input must contain two natural numbers Y and W (1:6)— the results of Yakko's and Wakko's die rolls.\")", "y, w = map(int, input().split())\r\nm = 7 - max(y,w)\r\nif m == 3: print('1/2')\r\nelif m == 2: print('1/3')\r\nelif m == 4: print('2/3')\r\nelif m == 6: print('1/1')\r\nelif m == 5: print('5/6')\r\nelif m == 1: print('1/6')", "a=input().split()\r\na[0]=int(a[0])\r\na[1]=int(a[1])\r\nb=max(a)\r\nif b==6:\r\n print('1/6')\r\nif b==5:\r\n print('1/3')\r\nif b==4:\r\n print('1/2')\r\nif b==3:\r\n print('2/3')\r\nif b==2:\r\n print('5/6')\r\nif b==1:\r\n print('1/1')\r\n", "a, b = map(int, input().split())\r\nx = max(a, b) - 1\r\nif (6 - x) % 6 == 0:\r\n print(str(int((6 - x) / 6)) + '/' + '1')\r\nelif (6 - x) % 2 == 0:\r\n print(str(int((6-x)/2)) + '/' + '3')\r\nelif (6 - x) % 3 == 0:\r\n print(str(int((6 - x) / 3)) + '/' + '2')\r\nelse:\r\n print(str((6 - x)) + '/' + '6')", "import sys\r\ninput = sys.stdin.readline\r\nimport math\r\nfrom collections import *\r\nfrom fractions import Fraction\r\nx,y = [int(x) for x in input().split()]\r\nout = [\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(out[6-max(x,y)])", "t = 1\r\ndef main() :\r\n a = max(list(map(int,input().split())))\r\n den = 7-a\r\n num = 6\r\n \r\n if den == 2 :\r\n den = 1\r\n num = 3\r\n elif den == 3 :\r\n den = 1\r\n num = 2\r\n elif den == 4 :\r\n den = 2\r\n num = 3\r\n else :\r\n den = den\r\n num = num\r\n if den== 0 :\r\n return \"0/1\"\r\n elif den==6 :\r\n return \"1/1\"\r\n else :\r\n return str(den)+\"/\"+str(num)\r\nR = []\r\nfor _ in range(t) :\r\n R.append(main())\r\nfor ans in R :\r\n print(ans)\r\n ", "l = input().split()\r\nn=0\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\n if (l[i])>n:\r\n n=(l[i])\r\na=(6-n)+1\r\nif a==1:\r\n print('1/6')\r\nif a==2:\r\n print('1/3')\r\nif a==3:\r\n print('1/2')\r\nif a==4:\r\n print('2/3')\r\nif a==5:\r\n print('5/6')\r\nif a==6:\r\n print(('1/1'))\r\n", "import math\ns=input().split(\" \")\ns.sort()\ns.reverse()\nnum=6-int(s[0])+1\ngcd=math.gcd(num,6)\n\nprint(str(int(num/gcd))+\"/\"+str(int(6/gcd)))\n\t\t\t \t\t\t \t \t\t\t\t \t \t \t\t \t \t", "n, m = list(map(int, input().split()))\r\nt = 6 - max(n,m) + 1\r\nif max(n,m) == 1:\r\n print(str(1)+'/'+str(1))\r\nelif t % 2 == 0:\r\n t = t // 2\r\n print(str(t)+'/'+str(3))\r\nelif 6 % t == 0:\r\n print(str(1) + '/' + str(6//t))\r\nelse: print(str(t)+'/'+str(6))", "from fractions import Fraction\r\n\r\n\r\na, b = map(int, input().split())\r\nc = max(a, b)\r\nd = 6 - c + 1\r\ne = (Fraction(d , 6))\r\nif e == 1:\r\n print(\"1/1\")\r\nelif e == 0:\r\n print(\"0/1\")\r\nelse:\r\n print(e)", "a=list(map(int,input().split())) \r\na.sort()\r\nb=((6-a[1])+1)\r\nif b==0:\r\n print(\"0/1\")\r\nif b==1:\r\n print(\"1/6\")\r\nif b==2:\r\n print(\"1/3\")\r\nif b==3:\r\n print(\"1/2\")\r\nif b==4:\r\n print(\"2/3\")\r\nif b==5:\r\n print(\"5/6\")\r\nif b==6:\r\n print(\"1/1\")", "from fractions import Fraction as f\r\na = str(f(7 - max(list(map(int,input().split()))),6))\r\nprint('1/1' if a == '1' else a)", "from fractions import Fraction\r\n\r\na=list(map(int, input().split()))\r\n\r\na=sorted(a)\r\n\r\nc=(6-a[1]+1)\r\nc = Fraction(c, 6)\r\n\r\nif c==0:\r\n print('0/1')\r\n \r\nelif c==1:\r\n print('1/1')\r\n \r\nelse:\r\n print(str(c))\r\n\r\n\r\n", "# LUOGU_RID: 128155493\na,b=map(int,input().split())\nn=max(a,b)\nif n==1:\n print('1/1')\nelif n==2:\n print('5/6')\nelif n==3:\n print('2/3')\nelif n==4:\n print('1/2')\nelif n==5:\n print('1/3')\nelse:\n print('1/6')", "y, w = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(7):\r\n if i >= y and i >= w:\r\n cnt += 1\r\nif cnt % 6 == 0:\r\n print(str(1) + \"/\" + str(1))\r\nelif cnt % 2 == 0:\r\n print(str(cnt // 2) + \"/\" + str(3))\r\nelif cnt % 3 == 0:\r\n print(str(cnt // 3) + \"/\" + str(2))\r\nelif cnt == 0:\r\n print(str(0) + \"/\" + str(1))\r\nelse:\r\n print((str(cnt) + \"/\" + str(6)))\r\n\r\n\r\n", "def findGCD(x, y):\r\n if x % y == 0:\r\n return y\r\n return findGCD(y, x % y)\r\n\r\n\r\na, b = map(int, input().split())\r\n\r\nc = max(a, b)\r\n\r\nno_of_possibility = 6 - c + 1\r\n\r\nx = findGCD(no_of_possibility, 6)\r\n\r\nprint(str(no_of_possibility // x) + \"/\" + str(6 // x))\r\n", "y,w=map(int,input().split())\r\np=6-max(y,w)+1\r\ndef gcd(a,b):\r\n if(b==0):\r\n return a\r\n else:\r\n return gcd(b,a%b)\r\nd=gcd(p,6)\r\nprint(str(p//d),'/',str(6//d),sep='')\r\n", "a=list(map(int,input().split()))\r\ntemp=max(a)-1\r\ntemp=6-temp\r\nimport math\r\nprint('{x}/{y}'.format(x=temp//math.gcd(6,temp),y=6//math.gcd(6,temp)))", "def gcd(a, b, ctr = 1):\r\n\tfor i in range(1, min(a, b)+1):\r\n\t\tif a%i==0 and b%i==0:\r\n\t\t\tctr = i\r\n\treturn ctr\r\n\r\na, b = 7-max(map(int, input().split())), 6\r\nd = gcd(a, b)\r\nprint(f\"{a//d}/{b//d}\")", "import math\n\na, b = [int(i) for i in input().split()]\nc = max(a, b)\n\nsu = 7 - c\nza = math.gcd(su, 6)\n\nprint(f'{su//za}/{6//za}')\n", "Y,W=map(int,input().split())\r\n\r\nif Y>W:\r\n num=7-Y\r\nelse:\r\n num=7-W\r\nif num==1:\r\n print(\"1/6\")\r\nif num==2:\r\n print(\"1/3\") \r\nif num==3:\r\n print(\"1/2\")\r\nif num==4:\r\n print(\"2/3\")\r\nif num==5:\r\n print(\"5/6\")\r\nif num==6:\r\n print(\"1/1\")", "y, w = map(int, input().split())\r\nn = 6-(max(y,w))+1\r\nsix = 6\r\nwhile n%2==0 and six%2==0:\r\n n //= 2\r\n six //= 2\r\nif six%n==0:\r\n print(n//n,\"/\",six//n, sep = \"\")\r\nelse: print(n,\"/\",six, sep = \"\")", "from fractions import Fraction\r\nm,n=map(int,input().split())\r\nk=max(n,m)\r\nx=6-k+1\r\nif x==0:\r\n print(\"0/1\")\r\nelif x==6:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(x,6))\r\n", "Q= input().split()\r\nn = max(int(Q[0]),int(Q[1]))\r\n\r\nif n == 1:\r\n print(str(1) + \"/\" + str(1))\r\nelse:\r\n if (7-n)%2==0 or (7-n)%3==0 :\r\n if (7-n)==3:\r\n print(str(1) + \"/\" + str(2))\r\n else:\r\n print(str(int((7-n)/2)) + \"/\" + str(3))\r\n else:\r\n print(str(7-n) + \"/\" + str(6))", "x = [int(x) for x in input().split()]\r\nz=len(x)\r\nif x[0]>x[1]:\r\n greater=x[0]\r\nelse:\r\n greater=x[1]\r\n\r\nprobability=(6-greater+1)/6\r\nif probability==1:\r\n print('1/1')\r\nelif probability==5/6:\r\n print('5/6') \r\nelif probability==4/6:\r\n print('2/3')\r\nelif probability==(3/6):\r\n print('1/2') \r\n\r\nelif probability==( 2/6):\r\n print('1/3')\r\n\r\nelif probability==( 1/6):\r\n print(' 1/6')\r\n", "y,w=map(int,input().split())\r\nc=6-max(y,w)\r\na=[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(a[c])\r\n", "import math as ma\r\ndef dice(j,t):\r\n\tm=max(j,t)\r\n\tn=7-m\r\n\td=6\r\n\tprint('{}/{}'.format(n//ma.gcd(n,6),6//ma.gcd(n,6)))\r\nj,t=list(map(int,input().split()))\t\r\ndice(j,t)", "from fractions import Fraction\r\ndef rational(n):\r\n return(Fraction(n,6))\r\na,b=map(int,input().split())\r\nif(a>=b):\r\n m=6-a+1\r\nelse:\r\n m=6-b+1\r\nif(m==6):\r\n print(\"1/1\")\r\nelse:\r\n print(rational(m))\r\n \r\n", "y, w = [int(i) for i in input().split()]\r\n\r\nnumerator = 6 - max(y, w) + 1\r\ndenominator = 6\r\nif numerator % 2 == 0:\r\n denominator //= 2\r\n numerator //= 2\r\n\r\nif numerator % 3 == 0:\r\n numerator //= 3\r\n denominator //= 3\r\n\r\nprint(str(numerator) + \"/\" + str(denominator))", "from math import gcd\r\n\r\nk = [int(x) for x in input().split(' ')]\r\nM = max(k)\r\nGCD = gcd((7 - M), 6)\r\nnom = (7 - M) // GCD\r\nden = 6 // GCD\r\nprint(str(nom) + '/' + str(den))", "a,b=[int(x) for x in input().split()]\r\nc=max([a,b])\r\nresult=6-c+1\r\nif result==0:\r\n print(\"0/6\")\r\nelif result==1:\r\n print(\"1/6\")\r\nelif result==2:\r\n print(\"1/3\")\r\nelif result==3:\r\n print(\"1/2\")\r\nelif result==4:\r\n print(\"2/3\" )\r\nelif result==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")\r\n\r\n", "from fractions import Fraction\r\na=list(map(int,input().split()))\r\nx=Fraction(7-max(a),6)\r\nif x==1:\r\n print('1/1')\r\nelse:\r\n print(x)", "from fractions import Fraction\r\ny, w = map(int, input().split())\r\nd = 7 - max(y , w)\r\nf = Fraction(d, 6)\r\nif f == 1:\r\n print(\"1/1\")\r\nelif f == 0:\r\n print(\"0/1\")\r\nelse:\r\n print(f)\r\n", "from math import gcd\n\ny, w = sorted(map(int, input().split()))\n\na = 6 - w + 1\nb = 6\n\nprint(str(int(a / gcd(a, b))) + \"/\" + str(int(b / gcd(a, b))))\n# Sat Apr 16 2022 15:48:25 GMT+0000 (Coordinated Universal Time)\n", "m ,n = map(int,input().split())\r\nm = max(n,m)\r\nif m==1:\r\n print(\"1/1\")\r\nif m == 2 :\r\n print(\"5/6\")\r\nif m==3 :\r\n print(\"2/3\")\r\nif m ==4:\r\n print(\"1/2\")\r\nif m == 5 :\r\n print(\"1/3\")\r\nif m==6 :\r\n print(\"1/6\")", "a = ['1/1', '1/2', '1/3', '1/6', '2/3', '5/6']\r\ny, w = map(int, input().split())\r\nm = max(y, w)\r\nif m == 6:\r\n print(a[3])\r\nelif m == 5:\r\n print(a[2])\r\nelif m == 4:\r\n print(a[1])\r\nelif m == 3:\r\n print(a[4])\r\nelif m == 2:\r\n print(a[5])\r\nelif m == 1:\r\n print(a[0])", "def gcd(a,b):\r\n\tif a<b:\r\n\t\ta,b=b,a\r\n\twhile b>0:\r\n\t\tt=a%b\r\n\t\ta=b\r\n\t\tb=t\r\n\treturn a\r\n\r\ny,w=map(int,input().split())\r\n\r\ny=max(y,w)\r\n\r\ny=6-y+1\r\n\r\nw=gcd(y,6)\r\nprint(y//w,end=\"/\")\r\nprint(6//w)", "A, B = list(map(int, input(\"\").split(\" \")))\n\nmax_roll = max(A, B)\n\nif max_roll == 1:\n print(\"1/1\")\nelif max_roll == 2:\n print(\"5/6\")\nelif max_roll == 3:\n print(\"2/3\")\nelif max_roll == 4:\n print(\"1/2\")\nelif max_roll == 5:\n print(\"1/3\")\nelif max_roll == 6:\n print(\"1/6\")\n\n\t \t\t \t \t \t\t \t\t \t\t\t \t\t", "WY = int(max(input().split(\" \")))\n\nif(WY == 1):\n print(\"1/1\")\nelif(WY == 2):\n print(\"5/6\")\nelif(WY == 3):\n print(\"2/3\")\nelif(WY == 4):\n print(\"1/2\")\nelif(WY == 5):\n print(\"1/3\")\nelif(WY == 6):\n print(\"1/6\")\n\n", "# coding: utf-8\ny, w = [int(i) for i in input().split()]\nprob = 7-max(y,w)\nif prob==6:\n print('1/1')\nelif prob==5:\n print('5/6')\nelif prob==4:\n print('2/3')\nelif prob==3:\n print('1/2')\nelif prob==2:\n print('1/3')\nelif prob==1:\n print('1/6')\n", "from math import gcd\r\na,b=list(map(int,input().split()))\r\nd=6-max(a,b)+1\r\ng=gcd(6,d)\r\nx1=d//g\r\nx2=6//g\r\nprint(str(x1)+'/'+str(x2))", "Y,W=map(int,input().split())\nmaximum=max(Y,W)\nprobability=(7-maximum)/6\nif probability==(1/6):\n\tprint(\"1/6\")\nelif probability==(2/6):\n\tprint(\"1/3\")\nelif probability==(3/6):\n\tprint(\"1/2\")\nelif probability==(4/6):\n\tprint(\"2/3\")\nelif probability==(5/6):\n\tprint(\"5/6\")\nelif probability==(1):\n\tprint(\"1/1\")", "\r\nprobability = 7 - max(*(int(dice) for dice in input().split()))\r\n\r\nif probability in (0, 6):\r\n print(f\"{probability//6}/1\")\r\nelif probability in (1, 5):\r\n print(f\"{probability}/6\")\r\nelif probability == 2:\r\n print(\"1/3\")\r\nelif probability == 3:\r\n print(\"1/2\")\r\nelse:\r\n print(\"2/3\")", "x , z = input().split()\r\ny = int(x)\r\nw = int(z)\r\npro = [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nd = max(y, w)\r\nprint(pro[d])", "a=max(eval(input().replace(\" \",\",\")))\nif a==6:print(\"1/6\")\nelif a==5:print(\"1/3\")\nelif a==4:print(\"1/2\")\nelif a==3:print(\"2/3\")\nelif a==2:print(\"5/6\")\nelif a==1:print(\"1/1\")\n\t\t \t\t \t\t \t\t \t \t \t", "def GCD(x,y):\r\n if x == 0:\r\n return y\r\n \r\n return GCD(y%x,x)\r\n\r\nmaxi = max(list(map(int,input().split())))\r\nnenominator = 6 - maxi + 1\r\nans = print(f'{nenominator // GCD(nenominator,6)}/{6 // GCD(nenominator,6)}')", "y, w = list(map(int, input().split()))\n\nmx = max(y,w)\nif mx==1:\n print('1/1')\nelif mx==2:\n print('5/6')\nelif mx==3:\n print('2/3')\nelif mx==4:\n print('1/2')\nelif mx==5:\n print('1/3')\nelse:\n print('1/6')\n \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\na, b = 7-max(x, y), 6\r\n\r\nwhile a%2 == 0 and b%2 == 0:\r\n a //= 2\r\n b //= 2\r\n\r\nwhile a%3 == 0 and b%3 == 0:\r\n a //= 3\r\n b //= 3\r\n\r\nprint(\"{}/{}\".format(a, b))", "y,w = list(map(int,input().split()))\r\nm = max(w,y)\r\na = 7-m\r\nb = 6\r\nif a%2 == 0:\r\n a = a//2\r\n b = b//2\r\nif a%3 == 0:\r\n a = a//3\r\n b = b//3\r\nprint(str(a)+'/'+str(b))", "from fractions import Fraction\r\nx = max(list(map(int, input().split(' '))))\r\ny = 7-x\r\nprob = Fraction(y, 6)\r\nif prob < 1:\r\n print(prob)\r\nif prob == 1:\r\n print(\"1/1\")\r\nif prob == 0:\r\n print(\"0/1\")\r\n", "y, w = map(int,input().split())\r\nm = max(y,w)\r\nd = list(range(1,7))\r\nprint(['1/1','5/6','2/3','1/2','1/3','1/6'][m - 1])", "from math import gcd\r\n(Y,W) = map(int,input().split())\r\nA = (6-max(Y,W))+1\r\nprint(str(A//gcd(A,6))+'/'+str(6//gcd(A,6)))", "a, b = 7-max(map(int, input().split())), 6\r\nif a == 2 or a == 4:\r\n a, b = a//2, b//2\r\nelif a == 3:\r\n a, b = a//3, b//3\r\nelif a == 6:\r\n a, b = a//6, b//6\r\nprint(str(a)+'/'+str(b))", "m = 7 - int(max(input().split()))\nd = 6\nfor r in [2, 3]:\n if not m % r:\n m //= r\n d //= r\nprint(f'{m}/{d}')\n", "a,b = map(int,input().split())\r\nc = max(a,b)\r\nif c==6: print('1/6')\r\nelif c==5: print('1/3')\r\nelif c==4: print('1/2')\r\nelif c==3: print('2/3')\r\nelif c==2: print('5/6')\r\nelse: print('1/1')", "a,b=[int(i) for i in input().split()]\r\nif a>=b:\r\n if a==6:\r\n print(\"1/6\")\r\n elif a==1:\r\n print(\"1/1\")\r\n elif a==2:\r\n print(\"5/6\")\r\n elif a==3:\r\n print(\"2/3\")\r\n elif a==4:\r\n print(\"1/2\")\r\n else:\r\n print(\"1/3\")\r\nelse:\r\n if b==6:\r\n print(\"1/6\")\r\n elif b==1:\r\n print(\"1/1\")\r\n elif b==2:\r\n print(\"5/6\")\r\n elif b==3:\r\n print(\"2/3\")\r\n elif b==4:\r\n print(\"1/2\")\r\n else:\r\n print(\"1/3\")\r\n", "import math\r\n\r\na, b = [int(s) for s in input().split(\" \")]\r\nmx = max(a, b)\r\nnum = 6-mx + 1\r\ndenom = 6\r\ngcd = math.gcd(num, denom)\r\nprint(\"{}/{}\".format(num//gcd, denom//gcd))", "n = input().split(\" \")\r\ny = int(n[0])\r\nw = int(n[1])\r\nm = max(y,w)\r\na = 6 - m\r\na += 1\r\nb = 6\r\nwhile (a % 2 == 0) and (b % 2 == 0):\r\n a /= 2\r\n b /= 2\r\n \r\nwhile (a % 3 == 0) and (b % 3 == 0):\r\n a /= 3\r\n b /= 3\r\n\r\nprint(str(int(a)) + \"/\" + str(int(b))) ", "a, b = map(int, input().split())\r\n\r\nm = max(a, b)\r\n\r\ns = 0\r\n\r\nfor i in range(m, 7):\r\n s += 1\r\n\r\nzn = 6\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ng = gcd(s, zn)\r\n\r\ns //= g\r\nzn //= g\r\n\r\nprint(s, '/', zn, sep='')\r\n", "# LUOGU_RID: 125325559\na,b=map(int,input().split())\r\nif a>b:\r\n c=a\r\nelse: c=b\r\nif c==1:\r\n\tprint('1/1')\r\nelif c==2:\r\n\tprint('5/6')\r\nelif c==3:\r\n\tprint('2/3')\r\nelif c==4:\r\n\tprint('1/2')\r\nelif c==5:\r\n\tprint('1/3')\r\nelif c==6:\r\n\tprint('1/6')", "from fractions import Fraction\n\ny, w = input().split()\n\nif (int (y) >= int(w)):\n n = int(y)\nelse:\n n = int(w)\n\np = 6 - n + 1\n\nif (p/6 == 1):\n print(\"1/1\")\n\nelse:\n print(Fraction(p,6))\n\t \t\t\t \t \t \t\t \t \t\t \t \t \t", "\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef probability(Y, W):\r\n max_value = max(Y, W)\r\n chances_to_win = 6 - max_value + 1\r\n total_outcomes = 6\r\n common_divisor = gcd(chances_to_win, total_outcomes)\r\n numerator = chances_to_win // common_divisor\r\n denominator = total_outcomes // common_divisor\r\n return numerator, denominator\r\n\r\nY, W = map(int, input().split())\r\n\r\nnumerator, denominator = probability(Y, W)\r\nprint(f\"{numerator}/{denominator}\")", "\r\nsa = [int(i) for i in input().split()]\r\nj = max(sa)\r\n\r\nif(j == 1):\r\n print(\"1/1\")\r\nelse:\r\n d = 6-j+1\r\n if(d == 2):\r\n print(\"1/3\")\r\n elif(d == 3):\r\n print(\"1/2\")\r\n elif(d == 4):\r\n print(\"2/3\")\r\n else:\r\n print(str(d)+\"/\"+\"6\")", "from math import gcd\r\n\r\nY, W = map(int, input().split())\r\n\r\nmaximum_outcome = max(Y, W)\r\npossible_outcomes_left = 6 - maximum_outcome + 1\r\n\r\nif possible_outcomes_left == 6:\r\n numerator = 1\r\n denominator = 1\r\nelse:\r\n gcd_value = gcd(possible_outcomes_left, 6)\r\n numerator = possible_outcomes_left // gcd_value\r\n denominator = 6 // gcd_value\r\n\r\nprint(f\"{numerator}/{denominator}\")\r\n", "from math import gcd\r\n\r\na, b = map(int, input().split())\r\na = max(a, b)\r\nc = 6 - a + 1\r\nprint('{}/{}'.format(c // gcd(c, 6), 6 // gcd(c, 6)))\r\n", "y, w = list(map(int, input().split()))\r\nl = [i for i in range(1, 7)]\r\nmx = max(y, w)\r\nres_1 = 1\r\nfor i in range(1, mx + 1):\r\n if len(l[mx - 1:]) % i == 0 and 6 % i == 0:\r\n res_1 = i\r\nres1 = len(l[mx - 1:]) // res_1\r\nres2 = 6 // res_1\r\nif res1 == res2:\r\n print('1/1')\r\nelse:\r\n print(\"{}/{}\".format(len(l[mx - 1:]) // res_1, 6 // res_1))\r\n", "def skr(n, d):\r\n max_i = max(n, d)\r\n for f in range(1, max_i + 1):\r\n if n % f == 0 and d % f == 0:\r\n n //= f\r\n d //= f\r\n return n, d\r\n\r\n\r\ny, w = list(map(int, input().split()))\r\nmax_ = max(y, w)\r\nn, d = skr(7 - max_, 6)\r\nprint(f\"{n}/{d}\")", "x, y = map(int,input().split())\r\nz = 6 - max(x,y) + 1\r\nif z == 1:\r\n print('1/6')\r\nelif z == 2:\r\n print('1/3')\r\nelif z == 3:\r\n print('1/2')\r\nelif z == 4:\r\n print('2/3')\r\nelif z == 5:\r\n print('5/6')\r\nelse:\r\n print('1/1')", "from fractions import Fraction\r\n\r\nw,y = map(int,input().split())\r\nmaxn = max(w,y)\r\ncnt = 0\r\nfor i in range(maxn,7):\r\n cnt += 1\r\nif cnt == 0:\r\n print(\"0/1\")\r\nelif cnt == 6:\r\n print(\"1/1\")\r\nelif cnt == 2:\r\n print(\"1/3\")\r\nelif cnt == 3:\r\n print(\"1/2\")\r\nelif cnt == 4:\r\n print(\"2/3\")\r\nelif cnt == 5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/6\")", " \r\nm,n = map(int, input().split( ))\r\n\r\n\r\n\r\nt = max(n,m)\r\nchoise = 7-t\r\ni = 6\r\nwhile(i>0):\r\n if(choise%i == 0 and 6%i == 0):\r\n print(str(int(choise/i))+'/'+str(int(6/i)))\r\n i = -1\r\n i -=1", "def main():\r\n y , w = [int(x) for x in input().split()]\r\n\r\n prob = [\"\",\"1/1\",\"5/6\",\"2/3\",\"1/2\", \"1/3\", \"1/6\"]\r\n print(prob[max(y,w)])\r\n \r\nif __name__ == '__main__':\r\n main()", "x,y = map(int,input().split())\r\nn=7-max(x,y)\r\nm=6 \r\nif(m%2==0 and n%2==0):\r\n n=int(n/2) \r\n m=int(m/2)\r\nif(m%3==0 and n%3==0):\r\n n=int(n/3) \r\n m=int(m/3)\r\nprint(str(n)+\"/\"+str(m))", "from fractions import Fraction\r\nuser = input(\"\").split(\" \")\r\ny = int(user[0])\r\nw = int(user[1])\r\nlimit = max(y, w)\r\nlob = ((6 - limit)+1)\r\nhor = 6\r\nprobablity = Fraction(lob,hor)\r\nif probablity == 0:\r\n print(\"0/1\")\r\nif probablity == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(probablity)", "y,w = map(int,input().split())\r\ndice_roll = [\"1/6\", \"1/3\", \"1/2\", \"2/3\", \"5/6\", \"1/1\"]\r\n\r\nx = max(y,w)\r\nprint(dice_roll[6-x])", "from math import gcd\r\ny, w = map(int, input().split())\r\nmx = 6 - max(y, w) + 1\r\nhcf = gcd(mx, 6)\r\nprint(str(mx//hcf)+'/'+str(6//hcf))", "a,b=map(int,input().split())\r\n\r\nc=7-max(a,b)\r\n\r\nif c%6==0:\r\n print('1/1')\r\nelif c%2==0:\r\n print(str(c//2)+'/'+str(6//2))\r\nelif c%3==0:\r\n print(str(c//3)+'/'+str(6//3))\r\nelse :\r\n print(str(c)+'/6')", "import math\n\nm = max(int(x) for x in input().split())\ng = math.gcd(7 - m, 6)\nprint(str((7 - m) // g) + \"/\" + str(6 // g))\n", "x,y=[int(a) for a in input().split()]\r\nf=max(x,y)\r\nif (f==1):\r\n print(\"1/1\")\r\nelif (f==2):\r\n print(\"5/6\")\r\nelif (f==3):\r\n print(\"2/3\")\r\nelif (f==4):\r\n print(\"1/2\")\r\nelif (f==5):\r\n print(\"1/3\")\r\nelif (f==6):\r\n print(\"1/6\")\r\n", "x = [int(v) for v in input().split()]\r\nx = max(x)\r\np = ['1/1','5/6','2/3','1/2','1/3','1/6']\r\nprint(p[x-1])", "if __name__ == '__main__':\r\n x = input().split()\r\n a = int(x[0])\r\n b = int(x[1])\r\n m = max(a, b)\r\n ll = 6 - m + 1\r\n if ll == 1:\r\n print(\"1/6\")\r\n elif ll == 2:\r\n print(\"1/3\")\r\n elif ll == 3:\r\n print(\"1/2\")\r\n elif ll == 4:\r\n print(\"2/3\")\r\n elif ll == 5:\r\n print(\"5/6\")\r\n else:\r\n print(\"1/1\")\r\n", "a,b=map(int,input().split())\r\nlst=['1/1','5/6','2/3','1/2','1/3','1/6']\r\nc=max(a,b)-1\r\nprint(lst[c])\r\n", "ls = ['1/6', '1/3', '1/2', '2/3', '5/6', '1/1']\r\n\r\nm = list(map(int, input().split()))\r\nans = ls[6-max(m)]\r\nprint(ans)", "n, m = map(int, input().split())\r\nx = max(n, m)\r\ntemp = (6 - x) + 1\r\nif 6 % temp == 0:\r\n print(f'{temp // temp}/{6 // temp}')\r\nelif temp % 2 == 0:\r\n print(f'{temp // 2}/{6 // 2}')\r\nelse:\r\n print(f'{temp}/{6}')", "def gcd(x,y):\r\n gcd = 1\r\n for i in range(1,min(x,y)+1):\r\n if x% i == 0 and y % i == 0 and i > gcd : \r\n gcd = i\r\n \r\n return gcd\r\n \r\na,b = map(int,input().split(' '))\r\n\r\nx = sum(1 for i in range(max(a,b),7))\r\ny = gcd(x,6)\r\n\r\nx = str(int(x/y))\r\ny = str(int(6/y))\r\n\r\nprint(x+\"/\"+y)", "from fractions import Fraction\nN1 = list(map(int, input().strip().split()))[:2]\nhigh = max(N1)\nwin_chance = 7 - high\na = Fraction(win_chance, 6)\nif a == 1:\n print(\"1/1\")\nelse:\n print(a)\n\n\n\n", "from fractions import Fraction\r\nval = input()\r\nlst = val.split()\r\nx1 = int(lst[0])\r\nx2 = int(lst[1])\r\n\r\ny = max(x1,x2)\r\nnum=6-y+1\r\nif num != 0 and num != 6:\r\n print(Fraction(num,6))\r\nif num == 0:\r\n print(\"0/1\")\r\nif num == 6:\r\n print(\"1/1\")", "def gcd(a, b):\r\n if a < b:\r\n a, b = b, a\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\nn = max(map(int, input().split()))\r\ng = gcd(6 - n + 1, 6)\r\nprint((6 - n + 1) // g, 6 // g, sep='/')\r\n", "Y, W= [int(x) for x in input().split()]\r\nall_pro=[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nmin_= max(Y,W)\r\n\r\nprint(all_pro[6-min_])", "inpt1 = [int(x) for x in input().split(\" \")]\r\n\r\nY = inpt1[0]\r\nX = inpt1[1]\r\n\r\n\r\nnumerator = 6 - max(Y, X) + 1\r\ndenominator = 6\r\ncount = 0\r\nfor i in range(1, 7):\r\n if numerator % i == 0 and denominator % i == 0:\r\n numerator //=i\r\n denominator//=i\r\n\r\nprint(str(numerator)+\"/\"+str(denominator))\r\n", "a,b=input().split()\r\nm=int(a)\r\nn=int(b)\r\nl=[m,n]\r\nl.sort()\r\nk=l[1]\r\np=7-k\r\ndef ans(p):\r\n if p==1:\r\n print(\"1/6\")\r\n elif p==2:\r\n print(\"1/3\")\r\n elif p == 3:\r\n print(\"1/2\")\r\n elif p==4:\r\n print(\"2/3\")\r\n elif p==5:\r\n print(\"5/6\")\r\n else :\r\n print(\"1/1\")\r\nans(p)", "\r\na,b=list(map(int,input().split()))\r\n\r\nx = 7 - max(a, b)\r\nif x == 1:\r\n print(\"1/6\")\r\nelif x == 2:\r\n print(\"1/3\")\r\nelif x == 3:\r\n print(\"1/2\")\r\nelif x == 4:\r\n print(\"2/3\")\r\nelif x == 5:\r\n print(\"5/6\")\r\nelif x == 6:\r\n print(\"1/1\")\r\n", "x,y=map(int,input().split())\r\narr=[\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nmax1=max(x,y)\r\nprint(arr[max1-1])", "a, b = map(int, input().split())\r\ng = max(a, b)\r\neg = abs(g - 7)\r\nif eg == 1:\r\n print(\"1\" + \"/\" + \"6\")\r\nelif eg == 2:\r\n print(\"1\" + \"/\" + \"3\")\r\nelif eg == 3:\r\n print(\"1\" + \"/\" + \"2\")\r\nelif eg == 4:\r\n print(\"2\" + \"/\" + \"3\")\r\nelif eg == 5:\r\n print(\"5\" + \"/\" + \"6\")\r\nelse:\r\n print(\"1\" + \"/\" + \"1\")\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 DieRoll:\n def solve(self, y, w):\n m = max(y, w)\n den = 6\n num = den-m+1\n for i in range(2, den):\n if den % i == 0 and num % i == 0:\n den //= i\n num //= i\n print(str(num)+\"/\"+str(den))\n\nif __name__ == \"__main__\":\n y, w = Input.invr()\n dieRoll = DieRoll()\n dieRoll.solve(y, w)\n", "y, m = input().split()\r\ny = int(y)\r\nm = int(m)\r\nk = max(y, m)\r\nn = 6 - k + 1\r\nif n == 1:\r\n print('1/6')\r\nelif n == 2:\r\n print('1/3')\r\nelif n == 3:\r\n print('1/2')\r\nelif n == 4:\r\n print('2/3')\r\nelif n == 5:\r\n print('5/6')\r\nelse:\r\n print('1/1')", "from math import gcd\r\n\r\n\r\ny, w = [int(s) for s in input().split()]\r\n\r\nvalue = 6 - max(y, w) + 1\r\nif value == 0:\r\n print(\"0/1\")\r\nelif value == 6:\r\n print(\"1/1\")\r\nelse:\r\n divisor = gcd(6, value)\r\n print(f\"{value // divisor}/{6 // divisor}\")", "from math import gcd\na, b = [int(x) for x in input().split()]\nx = 6 - max(a, b) + 1\nprint(str(x // gcd(x, 6)) + '/' + str(6 // gcd(x, 6)))\n", "import math\r\n\r\na,b=list(map(int,input().split()))\r\n\r\nc=max(a,b)\r\n\r\nd=7-c\r\n\r\ng=math.gcd(6,d)\r\n\r\nprint(str(d//g)+\"/\"+str(6//g))", "while True:\r\n try:\r\n Y, W = map(int, input().split())\r\n D = 6 - max(Y, W) + 1\r\n if D == 1:\r\n print(\"1/6\")\r\n elif D == 2:\r\n print(\"1/3\")\r\n elif D == 3:\r\n print(\"1/2\")\r\n elif D == 4:\r\n print(\"2/3\")\r\n elif D == 5:\r\n print(\"5/6\")\r\n elif D == 6:\r\n print(\"1/1\")\r\n elif D == 0:\r\n print(\"0/1\")\r\n except:\r\n break", "# Die Roll\r\ns = input().split(\" \")\r\ns = [int(i) for i in s]\r\ns.sort()\r\nnum = 6 - s[-1] + 1\r\nchance = num / 6\r\nif chance == 1/6 or chance == 5/6:\r\n print(\"{}/{}\".format(num,6))\r\nelif chance == 2/6 or chance == 4/6:\r\n print(\"{}/{}\".format(num//2,6//2))\r\nelif chance == 3/6:\r\n print(\"{}/{}\".format(num//3,6//3))\r\nelif chance == 0/1:\r\n print(\"{}/{}\".format(0,1))\r\nelif chance == 1:\r\n print(\"{}/{}\".format(1,1))", "a,b=map(int,input().split())\r\nn=6-max(a,b)+1\r\np=6\r\nif n==2:\r\n n=1\r\n p=3\r\nelif n==3:\r\n n=1\r\n p=2\r\nelif n==4:\r\n n=2\r\n p=3\r\nelif n==6:\r\n n=1\r\n p=1\r\nprint(str(n)+\"/\"+str(p)) \r\n", "[Y,W] = map(int, input().split())\nmsgs = [\"n/a\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\nprint(msgs[max(Y,W)])", "import math\r\nn,m = map(int, input().split())\r\nt = 7-max(m,n)\r\nx = math.gcd(t,6)\r\nprint(str(t//x)+\"/\"+str(6//x))\r\n", "x = list(map(int,input().split()))\r\ny = max (x[0],x[1])\r\nn = (6 - y)+1\r\nprob = n / 6\r\nif (n == 2 or n == 4):\r\n a = int(prob * 3) \r\n b = 3 \r\nelif(n == 3):\r\n a = 1 \r\n b = 2\r\nelif(n == 6):\r\n a = 1\r\n b = 1\r\nelif(n == 0):\r\n a = 0\r\n b = 1\r\nelse:\r\n a = int(prob*6)\r\n b = 6 \r\n \r\n \r\nprint(a,b,sep = '/')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n DICE_ROLLS:list[int] = list(map(int, input().split()))\r\n WIN_PROB_FRACTION:str = [\"0/6\", \"1/6\", \"1/3\", \"1/2\", \"2/3\", \"5/6\", \"1/1\"][7-max(DICE_ROLLS)]\r\n print(WIN_PROB_FRACTION)\r\n \r\nmain()", "inputs = list(map(int, input().split()))\r\nmax_number = max(inputs)\r\n# 7 not 6 because max_number is acceptable to win\r\nnumerator = 7 - max_number\r\ndenominator = 6\r\nif numerator % 2 == 0:\r\n numerator //= 2\r\n denominator //= 2\r\n\r\nif numerator % 3 == 0:\r\n numerator //= 3\r\n denominator //= 3\r\n\r\n\r\nprint(f\"{numerator}/{denominator}\")\r\n", "dice = [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nwD = input().split()\r\nW_D = list(map(int,wD))\r\nM = max(W_D)\r\nP = dice[M]\r\nprint (P)", "y,w = [int(x) for x in input().split()]\r\nbig = max(y,w)\r\nif big == 1:\r\n print('1/1')\r\nelse:\r\n a = 6-big\r\n a = a+1\r\n if a%2 == 0:\r\n print(str(int(a/2))+'/3')\r\n elif a%3 == 0:\r\n print(str(int(a/3))+'/2')\r\n else:\r\n print(str(a)+'/6')\r\n ", "from fractions import Fraction\r\n\r\nyakko, wakko = map(int, input().split())\r\n\r\nwinning_outcomes = 0\r\n\r\nfor dot_roll in range(max(yakko, wakko), 7):\r\n winning_outcomes += 1\r\n\r\ntotal_outcomes = 6\r\ndot_probability = Fraction(winning_outcomes, total_outcomes)\r\n\r\nprint(f\"{dot_probability.numerator}/{dot_probability.denominator}\")\r\n", "from fractions import Fraction as frac\r\n\r\ndef solve(costs):\r\n m = max(costs)\r\n c = 6 - m + 1\r\n c = frac(c, 6)\r\n s = str(c)\r\n if len(s) == 1:\r\n print(c, end=\"/1\")\r\n else:\r\n print(s)\r\n\r\n\r\ndef main():\r\n solve([int(x) for x in input().split()])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import gcd\r\n\r\na, b = list(map(int, input().split(' ')))\r\nans = 6 - max(a, b) + 1\r\nx = gcd(6, ans)\r\n\r\nprint(f'{ans//x}/{6//x}')", "from fractions import Fraction\nL=(input()).split(\" \")\nprint(\"1/1\") if Fraction((6-max(int(L[0]),int(L[1]))+1)/6).limit_denominator() == 1 else print (Fraction((6-max(int(L[0]),int(L[1]))+1)/6).limit_denominator())\n \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\n \r\npossible_outcomes = 6 - max(a,b) + 1\r\n \r\nif 6 % possible_outcomes == 0:\r\n print(str(possible_outcomes//possible_outcomes) + \"/\" + str(6//possible_outcomes))\r\nelif possible_outcomes == 4:\r\n print(str(2) + \"/\" + str(3))\r\nelse:\r\n print(str(possible_outcomes) + \"/\" + str(6))", "y,w = map(int,input().split())\r\np= [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nprint(p[max(y,w)])", "a,b=map(int,input().split())\r\nx=7-(max(a,b))\r\nif x==6:\r\n print(\"1/1\")\r\nelse:\r\n from fractions import Fraction\r\n print(Fraction(x,6))", "a,b= (map(int, input().split()))\r\nm= max(a,b)\r\np = 6-m\r\nif p+1== 2:\r\n print(\"1/3\")\r\nelif p+1==3:\r\n print(\"1/2\")\r\nelif p+1== 4:\r\n print('2/3')\r\nelif p+1==6:\r\n print(\"1/1\")\r\nelse:\r\n print(f\"{p+1}/6\")", "def gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ny, w = map(int, input().split())\r\nmax_roll = max(y, w)\r\nfavorable_outcomes = 6 - max_roll + 1\r\ngcd_value = gcd(favorable_outcomes, 6)\r\nprint(f\"{favorable_outcomes // gcd_value}/{6 // gcd_value}\")\r\n", "n=list(map(int,input().split()))\r\nx=7-max(n)\r\ny=6\r\nfor i in range(2,7):\r\n if x%i==0 and y%i==0:\r\n x/=i\r\n y/=i\r\n if x==1:\r\n break\r\nprint(f\"{int(x)}/{int(y)}\")", "from math import gcd\r\n\r\ndef solve(Y, W):\r\n # Dot needs to roll a number equal to or greater than the maximum of Y and W\r\n # There are 6 possibilities on a die, so the total number of successful outcomes is (6 - max(Y, W) + 1)\r\n A = 6 - max(Y, W) + 1\r\n B = 6 # total possible outcomes\r\n\r\n # Now, we need to reduce the fraction A/B to its simplest form\r\n GCD = gcd(A, B)\r\n\r\n A = A // GCD\r\n B = B // GCD\r\n\r\n # return the fraction as a string\r\n return str(A) + '/' + str(B)\r\n\r\n# Reading input values\r\nY, W = map(int, input().split())\r\n\r\nprint(solve(Y, W))\r\n", "list=input().split()\r\nx=max(int(list[0]),int(list[1]))\r\ndef gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\na=6-x+1\r\nb=6\r\nprint(\"%d/%d\"%(a//gcd(a,b),b//gcd(a,b)))", "y,w = map(int, input().split())\r\nn = len(list(range(max(y,w), 7)))\r\na,b = 0,0\r\nif n%2==0:\r\n if n%3==0:\r\n a,b = 1,1\r\n else:\r\n a,b =n//2,3\r\nelif n%3==0:\r\n a,b = 1,2\r\nelse:\r\n a,b = n,6\r\n\r\nprint(f\"{a}/{b}\") ", "l=list(map(int,input().split()))\r\na=7-max(l)\r\nif a==6:\r\n print('1/1')\r\nelif a==3:\r\n print('1/2')\r\nelif a==2:\r\n print('1/3')\r\nelif a==4:\r\n print('2/3')\r\nelse:\r\n print('{}/6'.format(a))", "from fractions import Fraction\r\n\r\n\r\ndef probability(points: list[int]):\r\n prob = (6 - max(points) + 1)/6\r\n\r\n if (prob == 0):\r\n result = \"0/1\"\r\n\r\n elif (prob == 1):\r\n result = \"1/1\"\r\n\r\n else:\r\n result = Fraction(6 - max(points) + 1, 6)\r\n\r\n return result\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n points = list(map(int, input().split()))\r\n print(probability(points))\r\n", "def gcd(a, b):\n if (b == 0):\n return a\n return gcd(b, a % b)\n\n\n(y, w) = list(map(int, input().split()))\nmax = max(y, w)\nif (max == 1):\n print('1/1')\n exit()\nc = 7 - max\nd = gcd(c, 6)\nprint(f\"{int(c/d)}/{int(6/d)}\")\n\n \t\t\t \t \t \t\t \t \t\t \t\t\t \t", "x,y=map(int,input().split())\r\nx=max(x,y)\r\nx=6-x+1\r\nif x==1: print('1/6')\r\nelif x==2: print('1/3')\r\nelif x==3: print('1/2')\r\nelif x==4: print('2/3')\r\nelif x==5: print('5/6')\r\nelse: print('1/1')", "import math\r\na,b = map(int,input().split())\r\nx = math.gcd(6-max(a,b)+1,6)\r\ns = str((6-max(a,b)+1)//x) + '/' + str(6//x)\r\nprint(s)", "from fractions import Fraction\r\ny, w = map(int, input().split())\r\nif y > w:\r\n x = Fraction((7-y)/6)\r\n if x == 1:\r\n print(\"1/1\")\r\n elif x == 1/6:\r\n print(\"1/6\")\r\n elif x == 2/6:\r\n print(\"1/3\")\r\n elif x == 3/6:\r\n print(\"1/2\")\r\n elif x == 4/6:\r\n print(\"2/3\")\r\n elif x == 5/6:\r\n print(\"5/6\")\r\n else:\r\n print(0)\r\nelif w > y:\r\n x = Fraction((7-w)/6)\r\n if x == 1:\r\n print(\"1/1\")\r\n elif x == 1/6:\r\n print(\"1/6\")\r\n elif x == 2/6:\r\n print(\"1/3\")\r\n elif x == 3/6:\r\n print(\"1/2\")\r\n elif x == 4/6:\r\n print(\"2/3\")\r\n elif x == 5/6:\r\n print(\"5/6\")\r\n else:\r\n print(0)\r\nelse:\r\n x = Fraction((7-y)/6)\r\n if x == 1:\r\n print(\"1/1\")\r\n elif x == 1/6:\r\n print(\"1/6\")\r\n elif x == 2/6:\r\n print(\"1/3\")\r\n elif x == 3/6:\r\n print(\"1/2\")\r\n elif x == 4/6:\r\n print(\"2/3\")\r\n elif x == 5/6:\r\n print(\"5/6\")\r\n else:\r\n print(0)", "l=[int(c) for c in input().split()]\r\na=max(l)\r\na=6-a+1\r\nb=6\r\nfor i in range(1,7):\r\n if a%i==0 and b%i==0:\r\n a=a//i\r\n b=b//i\r\nprint(f\"{a}/{b}\") ", "'''\nFilePath: Die_Roll.py\nAuthor: nev8r\nDate: 2023-04-28 15:28:09\nLastEditTime: 2023-04-28 15:36:09\n'''\n'''\n # 原神怎么你了！！！\n # @author: nev8r\n # @file: Die_Roll.py\n # @date: 2023/04/28 15:28\n'''\nfrom sys import stdin\nfrom itertools import combinations\n# from bisect import bisect as bis #a=[1,3,4,6,7,8] #bis(a,5)-->3\n# import bisect #bisect.bisect_left(a,4)-->2 #bisect.bisect(a,4)-->3\nfrom collections import deque\n# @lru_cache(maxsize=None) #help with pypy3-64 speed, add to function\nimport math\nimport time\ninput = stdin.readline\nres = max(map(int,input().split()))\nif res == 1:\n print('1/1')\nelif res == 2:\n print('5/6')\nelif res == 3:\n print('2/3')\nelif res == 4:\n print('1/2')\nelif res == 5:\n print('1/3')\nelif res == 6:\n print('1/6')\n \t\t \t\t \t\t \t\t \t\t\t\t\t\t\t \t", "from fractions import Fraction\r\n\r\ny, w = map(int, input().split())\r\n\r\nbigger = y if y > w else w\r\nnumerator = 6 - (bigger - 1)\r\nratio = str(Fraction(numerator, 6))\r\nif ratio == \"1\":\r\n print(\"1/1\")\r\nelif ratio == \"0\":\r\n print(\"0/1\")\r\nelse:\r\n print(\"{}/{}\".format(ratio[0], ratio[2]))", "y, w = map(int, input().split())\r\na = 6 - max(y, w) + 1\r\n\r\n\r\ndef gcd(a, b):\r\n return a if not b else gcd(b, a % b)\r\n\r\n\r\ng = gcd(a, 6)\r\nprint(f\"{a // g}/{6 // g}\")\r\n", "s,z = map(int,input().split())\r\na = max(s,z)\r\nif a==1: print(\"1/1\")\r\nelif a==2: print(\"5/6\")\r\nelif a==3: print(\"2/3\")\r\nelif a==4: print(\"1/2\")\r\nelif a==5: print(\"1/3\")\r\nelse: print(\"1/6\")", "from fractions import Fraction\n\nroll1, roll2 = map(int, input().split())\nmax_roll = max(roll1, roll2)\nnum_faces = 6 # number of faces on the dice\n\npoints_to_win = num_faces - max_roll + 1\nchance_to_win = Fraction(points_to_win, num_faces)\nprint(str(chance_to_win.numerator) + '/' + str(chance_to_win.denominator))\n\n# if roll1 == roll2:\n# print('1/1')\n# elif roll1 == num_faces or roll2 == num_faces:\n# print('0/1')\n# else:\n# points_to_win = num_faces - max(roll1, roll2)\n# chance_win = Fraction(points_to_win, num_faces)\n# print(str(chance_win.numerator) + '/' + str(chance_win.denominator))\n", "Y,W=map(int,input().split())\r\nz=max(Y,W)\r\nk=7-z\r\nif k==1 or k==5:\r\n print(str(k)+'/'+'6')\r\nelif k==2 or k==4:\r\n print(str(k//2)+'/'+'3')\r\nelif k==3:\r\n print('1/2')\r\nelse:\r\n print('1/1')", "n,m=map(int,input().split())\r\na=max(n,m)\r\nif (a==1):\r\n print('1/1')\r\nelif (a==2):\r\n print('5/6')\r\nelif (a==3):\r\n print('2/3')\r\nelif (a==4):\r\n print('1/2')\r\nelif (a==5):\r\n print('1/3')\r\nelif (a==6):\r\n print('1/6')\r\n", "a=input()\r\nb = [int(x) for x in a.split()]\r\nb=7-max(b)\r\nif 6%b==0:\r\n\tprint(\"1/\"+repr(int(6/b)))\r\nelif b%2==0:\r\n\tprint(repr(int(b/2))+\"/\"+repr(3))\r\nelse:\r\n\tprint(repr(int(b))+\"/\"+repr(int(6)))", "y,k = map (int,input().split())\r\nprop=''\r\nres=7-max(y,k)\r\nif res==1 :\r\n print('1/6')\r\nelif res==2 :\r\n print('1/3')\r\nelif res==3 :\r\n print('1/2')\r\nelif res==4 :\r\n print('2/3')\r\nelif res==5 :\r\n print('5/6')\r\nelif res==6 :\r\n print('1/1')\r\n", "Yes, Won = map(int, input().split())\r\nprobability = [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\ndone = max(Yes, Won)\r\nprint(probability[done])", "a,b = map(int,input().split())\r\na = max(a,b)\r\na = 6-a\r\na += 1\r\n\r\na /=6\r\na *=10\r\n\r\nif int(a) == 1:\r\n print(\"1/6\")\r\nelif int(a) == 3:\r\n print(\"1/3\")\r\nelif int(a) == 5:\r\n print(\"1/2\")\r\nelif int(a) == 6:\r\n print(\"2/3\")\r\nelif int(a) == 8:\r\n print(\"5/6\")\r\nelif int(a) == 10:\r\n print(\"1/1\")", "from fractions import Fraction\r\n\r\na, b = map(int, input().split())\r\n\r\nif max(a, b) != 1:\r\n print(Fraction(7 - max(a, b), 6))\r\nelse:\r\n print('1/1')", "from fractions import Fraction\r\na, b = map(int, input().split())\r\nm = max(a, b)\r\nl = [i for i in range(m, 7)]\r\nk = len(l)\r\nif k % 6 == 0:\r\n print(\"1/1\")\r\nelse:\r\n f = Fraction(k, 6)\r\n print(f)", "probability={1:\"1/1\",2:\"5/6\",3:\"2/3\",4:\"1/2\",5:\"1/3\",6:\"1/6\"}\r\nx=list(map(int, input().split(\" \")))\r\nprint(probability[max(x)])", "arr = input()\r\narr = arr.split(\" \")\r\narr = [int(x) for x in arr]\r\n\r\nmaxx = max(arr)\r\nif maxx > 0:\r\n\tmaxx = maxx - 1\r\nelse:\r\n\tmaxx = 0\r\n\t\r\nif 6 % (6 - (maxx)) == 0:\r\n first = 1\r\n second = int(6/(6 - (maxx)))\r\nelse:\r\n first = 6-(maxx)\r\n if first % 2 == 0:\r\n first = int(first/2)\r\n second = 3\r\n else:\r\n second = 6\r\nprint(f\"{first}/{second}\")\r\n\r\n", "import sys\r\nimport math\r\n# sys.stdin = open(\"input.txt\")\r\na=max(map(int,input().split()))\r\nn=7-a\r\nd=6\r\ng=math.gcd(n,d)\r\nprint(str(n//g)+\"/\"+str(d//g))", "from fractions import Fraction\n\npoints = input().split()\nmaximo = max(points[0], points[1])\nposibility = 6 - int(maximo) + 1\n\nif Fraction(posibility,6) < 1:\n print(Fraction(posibility,6))\nelse:\n print('1/1')\n \t \t \t\t \t\t \t\t\t \t", "Y, W = map(int, input().split())\r\n\r\nprobability = [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nD = max(Y, W)\r\nprint(probability[D])\r\n", "from fractions import Fraction\r\n\r\nY,W=map(int,input().split())\r\n\r\nK=max(Y,W)\r\nif K!=1:\r\n\r\n A=0\r\n die=[1,2,3,4,5,6]\r\n it=iter(die)\r\n for i in it:\r\n if i>=K:\r\n A=A+1\r\n print(Fraction(A,6))\r\nelse:\r\n print('1/1')", "# 9A\r\n''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\n'''Code'''\r\nY,W = sp_inp()\r\nval = max(Y,W)\r\nrem = 6-(val)+1\r\nif(val==1):\r\n print(f\"{1}/{1}\")\r\nelif(rem%2==0):\r\n print(f\"{rem//2}/{3}\")\r\nelif(rem%3==0):\r\n print(f\"{rem//3}/{2}\")\r\nelse:\r\n print(f\"{rem}/{6}\")", "w,y = input().split()\r\nw = int(w)\r\ny = int(y)\r\nmax_roll = 6\r\naux = max_roll - max(w,y)\r\nif aux == 0:\r\n print(\"1/6\")\r\nelif aux == 1:\r\n print(\"1/3\")\r\nelif aux == 2:\r\n print(\"1/2\")\r\nelif aux == 3:\r\n print(\"2/3\")\r\nelif aux == 4:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "import math\na,b = map(int,input().split())\na = max(a,b)\nd = 7-a\ng = math.gcd(6,d)\nd = d//g\np = 6//g\nprint(str(d)+'/'+str(p))\n", "a,b=map(int,input().split())\r\ns=6-max(a,b)+1\r\nfrom math import gcd\r\nprint(str(s*6//gcd(s,6)//max(s,6))+\"/\"+str(s*6//gcd(s,6)//min(s,6)))", "n=input()\r\nl=list(map(int,n.split()))\r\nm=max(l)\r\nif m==6:\r\n\tprint(\"1/6\")\r\nelif m==5:\r\n\tprint(\"1/3\")\r\nelif m==4:\r\n\tprint(\"1/2\")\r\nelif m==3:\r\n\tprint(\"2/3\")\r\nelif m==2:\r\n\tprint(\"5/6\")\r\nelif m==1:\r\n\tprint(\"1/1\")\r\nelse:\r\n\tprint(\"0/1\")", "x,y = [ int(i) for i in input().split()]\r\nmaax1 = max( x,y )\r\n\r\nif (maax1 == 6):\r\n print (\"1/6\")\r\nelif (maax1 == 5):\r\n print (\"1/3\")\r\nelif (maax1 == 4):\r\n print (\"1/2\")\r\nelif (maax1 == 3):\r\n print (\"2/3\")\r\nelif (maax1 == 2):\r\n print (\"5/6\")\r\nelse:\r\n print (\"1/1\")", "y,w=[int(x) for x in input().split()]\r\nd=6-max(y,w)+1\r\nif(6%d==0):\r\n d1=6//d\r\n print(\"1/%d\"%(d1))\r\nelif(d==4):\r\n print(\"2/3\")\r\nelse:\r\n print(\"%d/6\"%(d))\r\n", "__author__ ='Obriel Muga'\r\n\r\nif __name__ == '__main__':\r\n dados = input()\r\n a,b = map(int,dados.strip().split())\r\n mayor = max(a,b)\r\n prob = 7 - mayor\r\n result_a = prob\r\n result_b = 6\r\n if (prob == 6):\r\n print(\"1/1\")\r\n elif (prob == 2):\r\n print(\"1/3\")\r\n elif (prob == 3):\r\n print(\"1/2\")\r\n elif (prob == 4):\r\n print(\"2/3\")\r\n elif (prob == 5):\r\n print(\"5/6\")\r\n elif (prob == 1):\r\n print(\"1/6\")\r\n\r\n\r\n \r\n", "from math import gcd\na,b = map(int, input().split())\nnum = 6 - max(a,b) + 1 \nden = 6\nprint(num // gcd(num,den), den // gcd(num,den),sep=\"/\")\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Apr 10 18:28:11 2022\r\n\r\n@author: dehon\r\n\"\"\"\r\n\r\nd = {1: \"1/1\", 2: \"5/6\", 3: \"2/3\", 4: \"1/2\", 5: \"1/3\", 6: \"1/6\"}\r\nprint(d[max([int(i) for i in input().split()])])", "#!/bin/env python3\n\ny, w = input().split()\ny = int(y)\nw = int(w)\n\nnwins = 0\nfor i in range(1,7):\n #print(i)\n if i >= y and i >= w:\n nwins += 1\n\n#print(nwins)\n\nif nwins == 0:\n print(\"0/1\")\nelif nwins == 1:\n print(\"1/6\")\nelif nwins == 2:\n print(\"1/3\")\nelif nwins == 3:\n print(\"1/2\")\nelif nwins == 4:\n print(\"2/3\")\nelif nwins == 5:\n print(\"5/6\")\nelse:\n print(\"1/1\")\n", "rolls = list(map(int, input().split(' ')))\r\nmax_roll = max(rolls)\r\ndie = range(1,7)\r\n\r\nif max_roll == 1:\r\n print('1/1')\r\nelse:\r\n from fractions import Fraction\r\n print(Fraction(len(die[max_roll-1:]),6))\r\n", "y,w=map(int,input().split())\r\nc=max(y,w)\r\nm=6-c\r\nx=[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(x[m])", "y, w = map(int, input().split(\" \", 1))\r\nmaximum = max(y, w)\r\nnum = 6 - maximum + 1\r\nden = 6\r\nif num == 0:\r\n print(\"0/1\")\r\nelif num == 1:\r\n print(\"1/6\")\r\nelif num == 2:\r\n print(\"1/3\")\r\nelif num == 3:\r\n print(\"1/2\")\r\nelif num == 4:\r\n print(\"2/3\")\r\nelif num == 5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\") ", "dices = list(map(int, input().strip().split()))[:2]\r\nY = dices[0]\r\nW = dices[1]\r\nmaxRoll = Y if Y > W else W\r\ncounts = 0\r\nfor i in range(maxRoll,7):\r\n counts+=1\r\nif counts == 1:\r\n print(\"1/6\")\r\nelif counts == 2:\r\n print(\"1/3\")\r\nelif counts == 3:\r\n print(\"1/2\")\r\nelif counts == 4:\r\n print(\"2/3\")\r\nelif counts == 5:\r\n print(\"5/6\")\r\nelif counts == 6:\r\n print(\"1/1\")\r\n", "def gcd(a,b):\r\n i1=1\r\n for i in range(1,min(a,b)+1):\r\n if a%i==0 and b%i==0:\r\n i1=i\r\n return i1\r\na,b=map(int,input().split())\r\nc1=max(a,b)\r\nc=0\r\nfor i in range(c1,7):\r\n c+=1\r\nif c==0:\r\n print('0/1')\r\nelse:\r\n x=6//(gcd(c,6))\r\n c=c//(gcd(c,6))\r\n print(str(c)+'/'+str(x))\r\n", "a,b = map(int,input().split())\r\nt = max(a,b)\r\nl = 6-t+1\r\nif l%2 == 0:\r\n\tt = str(l//2)\r\n\tk = t+\"/\"+\"3\"\r\n\tif k == \"3/3\":\r\n\t\tprint(\"1/1\")\r\n\telse:\r\n\t\tprint(t+\"/\"+\"3\")\r\nelif l == 3:\r\n\tprint(\"1/2\")\r\nelif l%2 == 1:\r\n\tt = str(l)\r\n\tprint(t+\"/\"+\"6\")\r\n\r\n", "a, b = map(int,input().split())\n\nif a > b:\n m = a\nelse:\n m = b\n\nif m == 1:\n print(\"1/1\")\nelif m == 2:\n print(\"5/6\")\nelif m == 3:\n print(\"2/3\")\nelif m == 4:\n print(\"1/2\")\nelif m == 5:\n print(\"1/3\")\nelif m == 6:\n print(\"1/6\")\n\n #fbgstrhkrsjnhsrjnhs;\n\n\t\t \t\t\t\t \t \t \t\t\t \t\t \t \t \t\t\t", "from fractions import Fraction\r\nfrom typing import List\r\n\r\ndef main():\r\n \"\"\"Run code.\"\"\"\r\n\r\n (y,w) = map(int, input().split())\r\n if y == 1 and w == 1:\r\n print(\"1/1\")\r\n else:\r\n num, den = 6-max(y,w)+1, 6\r\n print(Fraction(num, den))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "a,b=map(int,input().split())\r\nmas=[int(i) for i in range(max(a,b),7)]\r\nl = len(mas)\r\nif l==6:\r\n print('1/1')\r\nelif l==5:\r\n print('5/6')\r\nelif l==4:\r\n print('2/3')\r\nelif l==3:\r\n print('1/2')\r\nelif l==2:\r\n print('1/3')\r\nelse:\r\n print('1/6')\r\n", "w, y = map(int, input().split())\nm = max(w, y)\noutcomes = [\"0/1\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\nprint(outcomes[m])\n", "from math import gcd\n\nY, W = map(int, input().split())\nA = 7 - max(Y, W)\nprint(f\"{A // gcd(A, 6)}/{6 // gcd(A, 6)}\")\n", "w,y=[int(x) for x in input().split()]\r\nl=[w,y]\r\nl.sort()\r\nn=7-l[1]\r\nfor j in range (1,n+1):\r\n if n%j==0 and 6%j==0:\r\n ans=int(n/j)\r\n ans1=int(6/j)\r\nprint(\"{0}/{1}\".format(ans,ans1)) ", "m=[int(i) for i in input().split(\" \")]\r\nl=[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\n\r\nprint(l[6 - max(m[0],m[1])])", "y , w = map(int , input().split())\r\narr =[\"1/1\" , \"5/6\" , \"2/3\" , \"1/2\" , \"1/3\" , \"1/6\"]\r\nv = max(y,w)\r\n\r\nprint(arr[v-1])", "w,y = map(int,input().split())\r\nr_p = max(w,y)\r\nout = ['1/6','1/3','1/2','2/3','5/6','1/1']\r\nprint(out[6-r_p])", "import sys\r\nn, m = map(int, input().split())\r\nif 7 - max(n, m) == 2:\r\n print(\"1/3\")\r\nelif 7 - max(n, m) == 3:\r\n print(\"1/2\")\r\nelif 7 - max(n, m) == 4:\r\n print(\"2/3\")\r\nelif 7 - max(n, m) == 6:\r\n print(\"1/1\")\r\nelse:\r\n print(str(7 - max(n, m))+\"/6\")", "a,b=map(int,input().split())\r\ntemp=max(a,b)\r\nc=6-temp+1\r\na=6\r\nif c==0:\r\n print(\"0/1\")\r\nelif c==6:\r\n print(\"1/1\")\r\nelse:\r\n for i in range(2,c+1):\r\n if a%i==0 and c%i==0:\r\n c//=i\r\n a//=i\r\n print(\"{}/{}\".format(c,a))", "from fractions import Fraction\r\ndef fraction(a, b):\r\n ''' return simplest fraction as a string of the form a/b '''\r\n fr = Fraction(a, b)\r\n return '{}/{}'.format(fr.numerator, fr.denominator)\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\na=(6-(max(a,b)))\r\n\r\n\r\nprint(fraction(a+1,6))\r\n", "m,n = map(int,input().split())\nt = max(m,n)\nx = 6-t+1\ny = 6\nfor i in range(1,7):\n if(x%i == 0 and y%i == 0):\n x = x/i\n y = y/i\nprint(int(x), end='')\nprint('/', end='')\nprint(int(y))\n\n \t \t\t \t\t\t\t\t \t\t \t\t\t", "#BISMILLAH\n\nx, y = map(int, input().strip().split())\nif max(x, y) == 1:\n\tprint(\"1/1\")\nelif max(x, y) == 2:\n\tprint(\"5/6\")\nelif max(x, y) == 3:\n\tprint(\"2/3\")\nelif max(x, y) == 4:\n\tprint(\"1/2\")\nelif max(x, y) == 5:\n\tprint(\"1/3\")\nelse:\n\tprint(\"1/6\")\n\t\n#ALHAMDULILLAH", "def gcd(a, b):\r\n if(b == 0):\r\n return a\r\n else:\r\n return gcd(b, a % b)\r\nl=[]\r\nl=[ int(x) for x in input().split()]\r\nif(l[0]==l[1]):\r\n x=gcd((6-l[0])+1,6)\r\n print(str((6-l[0])//x +1 )+'/'+str(6//x))\r\nelse:\r\n x=gcd(6-max(l[0],l[1])+1,6)\r\n \r\n print(str((6-max(l[0],l[1])+1)//x)+'/'+str(6//x))\r\n\r\n \r\n", "import math\r\nx, y = map(int, input().split())\r\ncheck = 7-max(x, y)\r\nprint(f'{check//math.gcd(check,6)}/{6//math.gcd(check, 6)}')\r\n", "Y, W = map(int, input().split())\r\nM = max(Y, W)\r\nV = 6 - M + 1\r\nif V == 1:\r\n print(\"1/6\")\r\nif V == 2:\r\n print(\"1/3\")\r\nif V == 3:\r\n print(\"1/2\")\r\nif V == 4:\r\n print(\"2/3\")\r\nif V == 5:\r\n print(\"5/6\")\r\nif V == 6:\r\n print(\"1/1\")\r\n", "y,w = map(int, input().split())\r\na = max(y,w)\r\nb = (6-a+1)\r\nif b==1:\r\n print('1/6')\r\nelif b==2:\r\n print('1/3')\r\nelif b==3:\r\n print('1/2')\r\nelif b==4:\r\n print('2/3')\r\nelif b==5:\r\n print('5/6')\r\nelif b==6:\r\n print('1/1')", "def main():\r\n from math import gcd\r\n [y, w] = [int(_) for _ in input().split()]\r\n result_a = 6 - max(y, w) + 1\r\n result_b = 6\r\n\r\n common = gcd(result_a, result_b)\r\n result_a //= common\r\n result_b //= common\r\n\r\n print('%d/%d' % (result_a, result_b))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from itertools import product, combinations\r\nfrom math import sqrt, gcd\r\n\r\na = max(map(int, input().split()))\r\nif a == 1:\r\n ans = \"1/1\"\r\nelif a == 2:\r\n ans = \"5/6\"\r\nelif a == 3:\r\n ans = \"2/3\"\r\nelif a == 4:\r\n ans = \"1/2\"\r\nelif a == 5:\r\n ans = \"1/3\"\r\nelse:\r\n ans = \"1/6\"\r\nprint(ans)\r\n\r\n", "l = ['0/1','1/6', '1/3', '1/2','2/3','5/6','1/1']\r\na,b = map(int, input().split())\r\ns = 6-(max(a,b)-1)\r\nprint(l[s])", "import math\r\n\r\nll = list(map(int, input().split()))\r\na = abs(max(ll) - 6) + 1\r\nprint(f\"{a//math.gcd(a, 6)}/{6//math.gcd(a, 6)}\")", "from fractions import Fraction\r\n\r\nY, W = input().split()\r\n\r\nif int(Y) == 1 and int(W) == 1:\r\n print('1/1')\r\nelse:\r\n print(Fraction(7-int(max(Y, W)),6))", "x, y = [int(x) for x in input().split()]\r\npossible_winning_outcomes = 6 - max(x, y) + 1\r\nif possible_winning_outcomes >= 6:\r\n print('1/1')\r\nelif 0 < possible_winning_outcomes < 6:\r\n if possible_winning_outcomes == 1:\r\n print('1/6')\r\n elif possible_winning_outcomes == 2:\r\n print('1/3')\r\n elif possible_winning_outcomes == 3:\r\n print('1/2')\r\n elif possible_winning_outcomes == 4:\r\n print('2/3')\r\n else:\r\n print('5/6')\r\nelse:\r\n print('0/1')", "lst = input().split()\ny = int(lst[0])\nw = int(lst[1])\n\nnum = 6 - max(y,w) + 1\ndenom = 6\n\nfrom math import gcd\n\nd = gcd(num,denom)\nprint(num // d, '/', denom//d, sep='')\n", "y,w =map(int,input().split())\r\nlists= [\"\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nx=max(y,w)\r\nprint(lists[x])", "d={0:'0/1',1:'1/6',2:'1/3',3:'1/2',4:'2/3',5:'5/6',6:'1/1'}\r\nprint(d[6-max(map(int,input().split()))+1])", "x = input()\nx = x.split()\nnums = [int(i) for i in x]\n\nout = max(nums[0], nums[1])\n\ndef test():\n if out == 1:\n print(\"1/1\")\n elif out == 2:\n print(\"5/6\")\n elif out == 3:\n print(\"2/3\")\n elif out == 4:\n print(\"1/2\")\n elif out == 5:\n print(\"1/3\")\n elif out == 6:\n print(\"1/6\")\n\ntest()\n", "from fractions import Fraction\r\nn=input()\r\ny,w=map(int,n.split())\r\nm=max(y,w)\r\nf=7-m\r\nif f==6:\r\n print('1/1')\r\nelse:\r\n p=Fraction(f,6)\r\n print(p)", "n,m=input().split()\nn=int(n)\nm=int(m)\nlis1=[1,2,3,4,5,6]\nlis2=['1/1','5/6','2/3','1/2','1/3','1/6']\nfor i in range(6):\n if lis1[i]==max(n,m):\n print(lis2[i])\n\n#########\n \t \t\t\t\t\t\t\t\t \t \t\t\t\t\t \t\t\t\t \t\t", "y, w = map(int, input().split())\r\nmax_num = max(y, w)\r\ntemp = 7 - max_num\r\nif temp == 0:\r\n print(\"0/1\")\r\nif temp == 1:\r\n print(\"1/6\")\r\nif temp == 2:\r\n print(\"1/3\")\r\nif temp == 3:\r\n print(\"1/2\")\r\nif temp == 4:\r\n print(\"2/3\")\r\nif temp == 5:\r\n print(\"5/6\")\r\nif temp == 6:\r\n print(\"1/1\")", "x,y=map(int,input().split())\r\nz1=6-max(x,y)+1\r\nz2=6\r\nfor i in range(1,z2+1):\r\n if z2%i==0 and z1%i==0:\r\n z2=z2//i\r\n z1=z1//i\r\nprint(z1,'/',z2,sep='')\r\n", "def gcd(a, b): # given a > b\r\n while b:\r\n a, b = b, (a % b)\r\n return a\r\n\r\ndef solve():\r\n yak, wak = map(int, input().split())\r\n b = 7 - max(yak, wak)\r\n a = 6\r\n gcd_val = gcd(a, b)\r\n print(f'{b//gcd_val}/{a//gcd_val}')\r\nsolve()\r\n", "from fractions import Fraction\nrolls = [int(x) for x in input().split()]\nrolls.sort()\nnum=int(7-rolls[1])\ndenom=int(6)\nfor x in range(2,4):\n if num%x==0:\n num = int(num/x)\n denom = int(denom/x)\nprint(f\"{num}/{denom}\")\n", "from fractions import Fraction\r\nx,y=map(int,input().split())\r\nk=6\r\na=k-(max(x,y)-1)\r\nif a==k:\r\n print('1/1')\r\nelse:\r\n fraction=Fraction(str(a)+'/'+str(k))\r\n print(fraction)", "a = max(map(int,input().split()))\r\nroll = [\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(roll[6-a])", "from math import *\r\na, b = map(int, input().split())\r\na = 6 - max(a, b) + 1\r\nb = gcd(6, a)\r\nprint(int(a / b), '/', int(6 / b), sep='')\n# Sat Aug 20 2022 07:54:08 GMT+0000 (Coordinated Universal Time)\n", "# https://codeforces.com/contest/9/problem/A\r\nfrom fractions import Fraction\r\n\r\npoints = [int(x) for x in input().split(' ')]\r\n\r\nminPointDotNeedsToWin = max(points[0], points[1])\r\ndictOfDiceProbability = {1: '1/1', 2: '5/6', 3: '2/3', 4: '1/2', 5: '1/3', 6: '1/6'}\r\n\r\nprobabilityOfDotToWin = dictOfDiceProbability[minPointDotNeedsToWin]\r\n\r\nprint(probabilityOfDotToWin)\r\n", "from math import gcd\r\ny, w = sorted(map(int, input().split()))\r\nL = set(range(w, 7))\r\nL.add(y + w) if y + w <= 6 else None\r\nd = gcd(len(L), 6)\r\nif len(L) == 0:\r\n print(\"0/1\")\r\nelse:\r\n print(f\"{len(L) // d}/{6 // d}\")\r\n", "import fractions\r\na = max(map(int, input().split()))\r\nx = 7 - a\r\nif x != 6:\r\n print(fractions.Fraction(x, 6))\r\nelse:\r\n print(\"1/1\")\r\n", "from fractions import Fraction \r\n\r\nY, W = map(int,input().split())\r\n\r\nif Y < W:\r\n Max = W\r\nelse:\r\n Max = Y\r\n \r\nfrac = Fraction(7 - Max, 6)\r\n\r\nif frac == 0:\r\n print(\"0/1\")\r\nelif frac == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(frac)", "import math\r\na,b=list(map(int,input().strip().split()))\r\nx=7-max(a,b)\r\nx2=6\r\nn=math.gcd(x,x2)\r\nx//=n\r\nx2//=n\r\nprint(f'{x}/{x2}')", "from fractions import Fraction as frac\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nc=(6-a[1])+1\r\nif frac(c, 6)==1:\r\n print(\"1/1\")\r\nelif frac(c, 6)==0:\r\n print(\"0/1\")\r\nelse:\r\n print(frac(c, 6))", "a,b=map(int,input().split())\r\nm=max(a,b)\r\nv=7-m\r\nif v==1:\r\n print(\"1/6\")\r\nelif v==2:\r\n print(\"1/3\")\r\nelif v==3:\r\n print(\"1/2\")\r\nelif v==4:\r\n print(\"2/3\")\r\nelif v==5:\r\n print(\"5/6\")\r\nelif v==6:\r\n print(\"1/1\")\r\nelse:\r\n print(\"0/1\")\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\nw,y = map(int,input().split())\r\n\r\nchance = 6-max(w,y)+1\r\ngc = gcd(chance,6)\r\nprint(chance//gc,'/',6//gc,sep='')\r\n\r\n", "from fractions import Fraction\n\n(a,b)=[int(i) for i in input().split()]\nc=7-max(a,b)\nf=Fraction(c,6)\nif f==1:\n print(\"1/1\")\nelse: print(f)\n\t \t \t\t\t \t\t \t\t \t\t\t \t \t \t\t \t\t", "from fractions import Fraction\ny,w=map(int, input().split())\ny=max(y,w)\ny=6-y+1\nif(Fraction(y/6).limit_denominator()==1):\n print(\"1/1\")\nelif(Fraction(y/6).limit_denominator()==0): \n print(\"0/1\")\nelse:\n print(Fraction(y/6).limit_denominator())", "from fractions import Fraction\r\na = max(map(int,input().split(\" \")))\r\ns = str(Fraction(6-(a-1),6))\r\ns = \"0/1\" if s == '0' else '1/1' if s == '1' else s\r\nprint(s)", "point = list(map(int, input().split()))\r\n\r\nif (6 - (max(point) - 1)) == 6:\r\n print(\"1/1\")\r\nelif (6 - (max(point) - 1)) % 2 == 0:\r\n print(f\"{int((6 - (max(point) - 1))/2)}/{int(6/2)}\")\r\nelif (6 - (max(point) - 1)) % 3 == 0:\r\n print(f\"{int((6 - (max(point) - 1))/3)}/{int(6/3)}\")\r\nelse:\r\n print(f\"{int((6 - (max(point) - 1)))}/{6}\")", "a=input().split(' ')\r\np=int(a[0])\r\nq=int(a[1])\r\nm=max(p,q)\r\nd=6-m+1\r\nif d == 6:\r\n print(1, end='')\r\n print('/', end='')\r\n print(1)\r\nelif d == 5:\r\n print(5, end='')\r\n print('/', end='')\r\n print(6)\r\nelif d == 4:\r\n print(2, end='')\r\n print('/', end='')\r\n print(3)\r\nelif d == 3:\r\n print(1, end='')\r\n print('/', end='')\r\n print(2)\r\nelif d == 2:\r\n print(1, end='')\r\n print('/', end='')\r\n print(3)\r\nelse:\r\n print(1, end='')\r\n print('/', end='')\r\n print(6)\r\n", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\n# end of function here\r\ny, w = [int(item) for item in input().split()]\r\nhigher = max(y, w)\r\ndotChances = 7 - higher\r\ntemp = gcd(dotChances, 6)\r\nprint('{}/{}'.format(dotChances // temp, 6 // temp))\r\n", "from fractions import gcd\r\na,b=map(int,input().split())\r\nt=max(a,b)\r\nt=7-t\r\nq=t/6\r\nif q == 1:\r\n print(\"1/1\")\r\nelif q == 0 :\r\n print(\"0/1\")\r\nelse:\r\n w=gcd(t,6)\r\n t/=w\r\n e=6/w\r\n t=int(t)\r\n e=int(e)\r\n print(t,e,sep=\"/\")", "y,w=map(int,input().split())\r\nd=max(y,w)\r\nd=7-d\r\nm=6\r\nif d%2==0:\r\n d//=2\r\n m=3\r\nelif d%3==0:\r\n d//=3\r\n m=2\r\nif d==m:\r\n d=1\r\n m=1\r\nprint(str(d)+\"/\"+str(m))", "yw = input()\r\ny = int(yw[0])\r\nw = int(yw[-1])\r\nmaks = max(y,w)\r\nans = (6-maks+1)\r\nfor i in range(6,0,-1):\r\n if (ans%i == 0 and 6%i == 0):\r\n print(str(ans//i)+'/'+str(6//i))\r\n break", "a, b = map(int, input().split())\r\nvalue = max(a,b)\r\nmemo = {1: \"1/1\", 2:\"5/6\", 3:\"2/3\", 4:\"1/2\", 5:\"1/3\", 6:\"1/6\"}\r\nprint(memo[value])\r\n ", "k=input()\r\ny=int(k.split(\" \")[0])\r\nw=int(k.split(\" \")[1])\r\nif (y==6) or (w==6):\r\n print(\"1/6\")\r\nelif (y==5) or (w==5):\r\n print(\"1/3\")\r\nelif (y==4) or (w==4):\r\n print(\"1/2\")\r\nelif (y==3) or (w==3):\r\n print(\"2/3\")\r\nelif (y==2) or (w==2):\r\n print(\"5/6\")\r\nelif (y==1) or (w==1):\r\n print(\"1/1\")", "y,w=map(int,input().split())\ndef f(a,b):\n c=a%b\n if c==0:\n return b\n else:\n return f(b,c)\n \nif y>6 and w>6:\n print('0/1')\nelif y<1 and w<1:\n print('1/1')\nelse:\n mole=7-max(y,w)\n deno=6\n max_num=f(mole,deno)\n mole=mole//max_num\n deno=deno//max_num\n print(mole,'/',deno,sep='')\n \n\n \n ", "from math import *\r\na,b=list(map(int,input().split()))\r\nprint(str((7-max(a,b))//gcd(6,7-max(a,b)))+'/'+str(6//gcd(6,7-max(a,b))))", "from fractions import Fraction\nk=input().split()\nn=int(k[0])\nm=int(k[1])\n\ns=max(n,m)\nres=6-s+1\nf=Fraction(res,6)\nif f==0:\n print(\"0/1\")\nelif f==1:\n print(\"1/1\")\nelse:\n print(f)\n \t\t \t\t \t \t \t\t \t\t\t\t\t \t\t\t\t\t\t \t", "import sys\r\nimport collections\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef rints():\r\n return map(int, input().strip().split())\r\ndef rint():\r\n return int(input().strip())\r\ndef rintas():\r\n return [int(i) for i in input().strip().split()]\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(a%b, a)\r\n \r\nmod = pow(10, 9) + 7\r\ny, w = rints()\r\ncnt = 0\r\nfor i in [1,2,3,4,5,6]:\r\n if max(y,w,i) == i: cnt += 1\r\n\r\nif cnt == 0:\r\n print(\"0/1\")\r\nelif cnt == 6:\r\n print(\"1/1\")\r\nelif cnt == 1:\r\n print(\"1/6\")\r\nelif cnt == 2:\r\n print(\"1/3\")\r\nelif cnt == 3:\r\n print(\"1/2\")\r\nelif cnt == 4:\r\n print(\"2/3\")\r\nelif cnt == 5:\r\n print(\"5/6\")\r\n \r\n\r\n", "# LUOGU_RID: 126736062\na=input()\r\nb=a.split(' ')\r\nb[0]=int(b[0])\r\nb[1]=int(b[1])\r\ni=1\r\nsumm=0\r\nwhile(i<7):\r\n if(i>=max(b[0],b[1])):\r\n summ+=1\r\n i+=1\r\nif(summ==6):\r\n print('1/1')\r\nelif(summ==0):\r\n print('0/1')\r\nelse:\r\n if(summ%2==0):\r\n print(summ//2,end='')\r\n print('/',end='')\r\n print(3)\r\n elif(summ%3==0):\r\n print(summ//3,end='')\r\n print('/',end='')\r\n print(2)\r\n else:\r\n print(summ,end='')\r\n print('/',end='')\r\n print(6)\r\n \r\n", "y, w = map(int, input().split(\" \"))\r\n\r\nmax_y_w = max(y, w)\r\n\r\nif max_y_w == 1:\r\n print(\"1/1\")\r\nelif max_y_w == 2:\r\n print('5/6')\r\nelif max_y_w == 3:\r\n print(\"2/3\")\r\nelif max_y_w == 4:\r\n print(\"1/2\")\r\nelif max_y_w == 5:\r\n print(\"1/3\")\r\nelif max_y_w == 6:\r\n print(\"1/6\")\r\nelse:\r\n print(\"0/1\")", "a,b=map(int,input().split())\r\nx=max(a,b)\r\nposs=7-x\r\nif(poss==0):\r\n print('0/1')\r\nif(poss==1):\r\n print('1/6')\r\nif(poss==2):\r\n print('1/3')\r\nif(poss==3):\r\n print('1/2')\r\nif(poss==4):\r\n print('2/3')\r\nif(poss==5):\r\n print('5/6')\r\nif(poss==6):\r\n print('1/1')", "x,y=map(int,input().split())\r\n\r\nlargest = max(x,y)\r\n\r\ntotal_chances=6\r\n\r\nchances = len(range(largest,total_chances+1))\r\n\r\ndream_chances=chances/total_chances\r\n\r\n\r\n\r\nif(dream_chances==1):\r\n print(\"1/1\")\r\nelif(dream_chances==0):\r\n print(\"0/1\")\r\nelif(chances%2==0):\r\n num=int(chances/2)\r\n den=int(total_chances/2)\r\n print(str(num)+\"/\"+str(den))\r\nelif(chances%3==0):\r\n num=int(chances/3)\r\n den=int(total_chances/3)\r\n print(str(num)+\"/\"+str(den))\r\nelse :\r\n print(str(chances)+\"/\"+str(total_chances)) ", "from math import gcd\r\n\r\nY, W = map(int, input().split())\r\n\r\neeeee = 0\r\n\r\nfor i in range(1, 7):\r\n if i >= Y and i >= W:\r\n eeeee += 1\r\n\r\nif eeeee == 0:\r\n print('0/1')\r\nelse:\r\n a, b = eeeee, 6\r\n g = gcd(a, b)\r\n a //= g\r\n b //= g\r\n print('%d/%d' % (a, b))\n# Sat Apr 16 2022 16:21:31 GMT+0000 (Coordinated Universal Time)\n", "a,b=map(int,input().split())\r\nmax1=max(a,b)\r\nans1=6-max1+1\r\nif(ans1==3):\r\n\tprint(str(1)+\"/\"+str(2))\r\nelif(ans1==2):\t\r\n\tprint(str(1)+\"/\"+str(3))\r\nelif(ans1==1):\t\r\n\tprint(str(1)+\"/\"+str(6))\r\nelif(ans1==4):\t\r\n\tprint(str(2)+\"/\"+str(3))\r\nelif(ans1==5):\t\r\n\tprint(str(5)+\"/\"+str(6))\r\nelif(ans1==6):\t\r\n\tprint(str(1)+\"/\"+str(1))\t\t\t\t", "z=input()\r\nz=z.split()\r\n\r\nf=0\r\nif int(z[0])>int(z[1]):\r\n f=int(z[0])\r\nelse:\r\n f=int(z[1])\r\n\r\n \r\ng=6-f+1\r\n\r\nif g==6:\r\n print(\"1/1\")\r\nelif g==2:\r\n print(\"1/3\")\r\nelif g==3: \r\n print(\"1/2\")\r\nelif g==4:\r\n print(\"2/3\")\r\nelse:\r\n print(str(g)+\"/6\")\r\n", "n = str(input())\r\nk = n.split(\" \")\r\nn1 = int(k[0])\r\nm1 = int(k[1])\r\nif n1>m1:\r\n if n1==2:\r\n print(\"5\", \"/\", \"6\", sep=\"\")\r\n elif n1==3:\r\n print(\"2\", \"/\", \"3\", sep=\"\")\r\n elif n1==4:\r\n print(\"1\", \"/\", \"2\", sep=\"\")\r\n elif n1==5:\r\n print(\"1\", \"/\", \"3\", sep=\"\")\r\n elif n1==6:\r\n print(\"1\", \"/\", \"6\", sep=\"\")\r\n elif n1==1:\r\n print(\"1\", \"/\", \"1\", sep=\"\")\r\nelse:\r\n if m1==2:\r\n print(\"5\",\"/\", \"6\", sep=\"\")\r\n elif m1==3:\r\n print(\"2\", \"/\", \"3\", sep=\"\")\r\n elif m1==4:\r\n print(\"1\", \"/\", \"2\", sep=\"\")\r\n elif m1==5:\r\n print(\"1\", \"/\", \"3\", sep=\"\")\r\n elif m1==6:\r\n print(\"1\", \"/\", \"6\", sep=\"\")\r\n elif m1==1:\r\n print(\"1\", \"/\", \"1\", sep=\"\")\r\n\r\n\r\n", "#Coder_1_neel\r\n\r\nfrom fractions import Fraction\r\n\r\na, b = map(int, input().split())\r\nx = max(a, b)\r\nx = abs(x - 6) + 1\r\n\r\nif x == 0:\r\n denominator = 6 \r\n print(f\"0/{denominator}\")\r\nelse:\r\n fraction = Fraction(x, 6)\r\n \r\n if fraction == 1:\r\n print(\"1/1\")\r\n else:\r\n print(fraction)\r\n\r\n", "x,y = map(int,input().split())\r\nmax1 = max(x,y)\r\na = 0\r\nb = 6\r\ni = 0\r\nwhile max1<=6:\r\n a+=1\r\n max1+=1\r\nif a==6:\r\n print('1/1')\r\nelif a==2:\r\n print('1/3')\r\nelif a==3:\r\n print('1/2')\r\nelif a==4:\r\n print('2/3')\r\nelif a==5:\r\n print('5/6')\r\nelif a==0:\r\n print('0/1')\r\nelif a==1:\r\n print('1/6')\r\n", "a, b = map(int,input().split())\r\nsl = 6 - max(a,b) + 1\r\n\r\nif sl==6:\r\n print(\"1/1\")\r\nif sl==5:\r\n print(\"5/6\")\r\nif sl==4:\r\n print(\"2/3\")\r\nif sl==3:\r\n print(\"1/2\")\r\nif sl==2:\r\n print(\"1/3\")\r\nif sl==1:\r\n print(\"1/6\")", "from fractions import Fraction\r\n\r\na,b= map(int,input().split())\r\nc= max(a,b)\r\nprobability = Fraction(7-c,6)\r\nif probability.denominator == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(probability)\r\n", "import math\r\n\r\ny, w = map(int, input().split())\r\n\r\nn = (7-max(y,w))\r\n\r\nd = math.gcd(n, 6)\r\n\r\nprint(str(n//d)+'/'+str(6//d))\r\n\r\n\r\n", "Yako, Vako = map(int,input().split())\r\nchisl = 7-max(Yako,Vako)\r\nif chisl == 6:\r\n print(\"1/1\")\r\nelif chisl == 0:\r\n print(\"0/1\")\r\nelif chisl % 2 == 0:\r\n print(\"{}/{}\".format(chisl//2,6//2))\r\nelif chisl % 3 == 0:\r\n print(\"1/2\")\r\nelse:\r\n print(\"{}/{}\".format(chisl,6))", "MAP = {\r\n 1: '1/1',\r\n 2: '5/6',\r\n 3: '2/3',\r\n 4: '1/2',\r\n 5: '1/3',\r\n 6: '1/6'\r\n}\r\n\r\ndef chance(y, w):\r\n return MAP[max(y, w)]\r\n\r\ny, w = list(map(int, input().split(' ')))\r\nprint(chance(y, w))\r\n", "# cook your dish here\ny,w = map(int,input().split())\nz = max(y,w)\nw = 7-z\nif w == 1:\n print(\"1/6\")\nif w == 2:\n print(\"1/3\")\nif w == 3:\n print(\"1/2\")\nif w == 4:\n print(\"2/3\")\nif w == 5:\n print(\"5/6\")\nif w == 6:\n print(\"1/1\")\n", "# m,n are the dimentions of the board\r\n\r\ny, w = map(int, input().split())\r\n\r\nx = 7 - max(y, w)\r\n\r\nif (x==1):\r\n print(\"1/6\")\r\nelif (x==2):\r\n print(\"1/3\")\r\nelif (x==3):\r\n print(\"1/2\")\r\nelif (x==4):\r\n print(\"2/3\")\r\nelif (x==5):\r\n print(\"5/6\")\r\nelif (x==6):\r\n print(\"1/1\")\r\n", "a , b = map(int,input().split())\r\nmax1 = max(a,b)\r\nk = 6-(max1-1)\r\nif k==1:print(\"1\"+\"/\"+\"6\")\r\nelif k==2:print(\"1\"+\"/\"+\"3\")\r\nelif k==3:print(\"1\"+\"/\"+\"2\")\r\nelif k==4:print(\"2\"+\"/\"+\"3\")\r\nelif k==5:print(\"5\"+\"/\"+\"6\")\r\nelif k==6:print(\"1\"+\"/\"+\"1\")", "al = list(map(int,input().split()))\r\nwp = 7-max(al)\r\nll = [None,'1/6','1/3','1/2','2/3','5/6','1/1']\r\nprint(ll[wp])\r\n\r\n", "from fractions import Fraction\r\ninp = input().split()\r\na = int(inp[0])\r\nb = int(inp[1])\r\nc = ((6 - max(a,b))+1)\r\nif(6 % c == 0):\r\n num = 1\r\n dem = 6 // c\r\n print(str(num) +'/'+str(dem))\r\nelse:\r\n num = c\r\n dem = 6\r\n print(Fraction(num,dem))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# if(((6 - max(a,b))+1)%6 == 0):\r\n# c = ((6 - max(a,b))+1)//6\r\n# print(str(((6 - max(a,b))+1)) + '/6')\r\n# else:\r\n# c = ((6 - max(a,b))+1)/6\r\n\r\n# if(isinstance(c,int)):\r\n# d = str(c) + '/' + str(c)\r\n# print(d)\r\n# else:\r\n# print(Fraction(c))\r\n\r\n", "read = list(map(int, input().split()))\r\nmaximum=max(read)\r\nif(maximum==1):\r\n print(\"1/1\")\r\nelif(maximum==2):\r\n print(\"5/6\")\r\nelif(maximum==3):\r\n print(\"2/3\")\r\nelif(maximum==4):\r\n print(\"1/2\")\r\nelif(maximum==5):\r\n print(\"1/3\")\r\nelse: print(\"1/6\")\r\n\r\n\r\n\r\n", "def euclid(a, b):\r\n if a > b:\r\n return euclid(b, a)\r\n elif a == 0:\r\n return b\r\n else:\r\n return euclid(b % a, a)\r\n\r\n\r\ndef cancel(a, b):\r\n c = euclid(a, b)\r\n return [a // c, b // c]\r\n\r\n\r\ny, w = [int(s) for s in input().split(' ')]\r\nprint('/'.join([str(z) for z in cancel(7 - max(y, w), 6)]))\r\n", "n=list(map(int,input().split()))\r\nif max(n)!= 1:\r\n p=(7-max(n))\r\n from fractions import Fraction\r\n print(Fraction(p,6))\r\nelse:\r\n print('1/1')", "import sys\r\nfrom fractions import Fraction\r\n\r\ny_w = list(map(int, sys.stdin.readline().split()))\r\ny_w.sort()\r\ncount = 0\r\nfor i in range(7):\r\n if i >= y_w[-1]:\r\n count += 1\r\n continue\r\nif count == 6:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(count, 6))\r\n", "from sys import stdin, stdout\r\nfrom collections import Counter, deque\r\nfrom itertools import permutations, combinations, accumulate\r\nfrom functools import reduce\r\nfrom heapq import *\r\nfrom operator import itemgetter\r\nfrom math import *\r\n\r\ninput_int = lambda: int(stdin.readline())\r\ninput_ints = lambda: map(int, stdin.readline().split())\r\ninput_array = lambda: list(input_ints())\r\ninput_str = lambda: stdin.readline()[:-1]\r\n\r\ny, w = input_ints()\r\nm = max(y, w)\r\nr = 0\r\nwhile m <= 6:\r\n r += 1\r\n m += 1\r\nif r == 6:\r\n stdout.write('1/1')\r\nelse:\r\n d = 6\r\n g = gcd(r, d)\r\n if g != 1:\r\n r //= g\r\n d //= g\r\n stdout.write(f'{r}/{d}')\r\n", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\nalbst=(6-max(x,y))+1\r\nbase=6\r\nif base%albst ==0:\r\n albst2=albst//albst\r\n base2=base//albst\r\n print(f'{albst2}/{base2}')\r\nelif base%2 ==0 and albst%2==0:\r\n albst2=albst//2\r\n base2=base//2\r\n print(f'{albst2}/{base2}')\r\nelif base%albst !=0:\r\n print(f'{albst}/{6}')", "from fractions import *\r\n\r\na, b = map(int, input().split())\r\n\r\nc = Fraction((6 - max(a, b) + 1), 6)\r\n\r\nif c == 0:\r\n print(\"0/1\")\r\nelif c == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(c)\r\n", "a,b=input().split()\r\nc= max(int(a), int(b))\r\nd=6-c+1\r\nif d==2:\r\n print('1/3')\r\nelif d==3:\r\n print('1/2')\r\nelif d==6:\r\n print('1/1')\r\nelif d==4:\r\n print('2/3')\r\nelse:\r\n print(str(d) +\"/\"+\"6\")", "listo=[int(x) for x in input().split(\" \")]\r\nlisto.sort(reverse=True)\r\nboro=listo[0]\r\nprobability=(6-boro+1)/6\r\nif probability==0:\r\n print(str(0)+\"/\"+str(1))\r\nelif probability==1/6:\r\n print(str(1)+\"/\"+str(6))\r\nelif probability==1/3:\r\n print(str(1)+\"/\"+str(3))\r\nelif probability==1/2:\r\n print(str(1)+\"/\"+str(2))\r\nelif probability==2/3:\r\n print(str(2)+\"/\"+str(3))\r\nelif probability==5/6:\r\n print(str(5)+\"/\"+str(6))\r\nelse:\r\n print(str(1)+\"/\"+str(1))", "import fractions as f\r\ny,w=map(int,input().split())\r\nm=max(y,w)\r\nif 7-m==6:\r\n print(\"1/1\")\r\nelse:\r\n print(f.Fraction((7-m),6))", "b=input().split()\r\ny,w=int(b[0]),int(b[1])\r\nfav_cases=(6-max(y,w))+1\r\nif fav_cases==1:\r\n print('1/6')\r\nelif fav_cases==2:\r\n print('1/3')\r\nelif fav_cases==3:\r\n print('1/2')\r\nelif fav_cases==4:\r\n print('2/3')\r\nelif fav_cases==5:\r\n print('5/6')\r\nelif fav_cases==6:\r\n print('1/1')\r\nelse:\r\n print('0/1')", "n = input().split()\r\na = int(n[0])\r\nb = int(n[1])\r\nc = max(a,b)\r\nd = 6 - c\r\nif d ==0:\r\n print(\"1/6\")\r\nif d == 1 :\r\n print(\"1/3\")\r\nif d==2:\r\n print(\"1/2\")\r\nif d == 3:\r\n print(\"2/3\")\r\nif d==4:\r\n print(\"5/6\")\r\nif d==5:\r\n print(\"1/1\")", "a, b = map(int, input().split(' '))\r\n\r\nhigh = max([a, b])\r\nwinners = (6 - high) + 1\r\n\r\npA = winners\r\npB = 6\r\n\r\nif(pB % pA == 0):\r\n pB = int(pB / pA)\r\n pA = 1\r\n\r\nelif(pA % 2 == 0 and pB % 2 == 0):\r\n pA = int(pA / 2)\r\n pB = int(pB / 2)\r\n\r\nprint('{}/{}'.format(pA, pB))", "inp = list(map(int, str.split(input(), \" \")))\r\ninp.sort()\r\n\r\nif (7-inp[1])/6 == 0:\r\n print(\"0/1\")\r\nelif (7-inp[1])/6 == 1:\r\n print(\"1/1\")\r\nelse:\r\n if 7-inp[1] == 3:\r\n print(\"1/2\")\r\n elif 7-inp[1] == 2:\r\n print(\"1/3\")\r\n elif 7-inp[1] == 4:\r\n print(\"2/3\")\r\n elif 7-inp[1] == 5:\r\n print(\"5/6\")\r\n elif 7-inp[1] == 1:\r\n print(\"1/6\")", "a, b = map(int, input().split())\r\n\r\n\r\nmx = max(a, b)\r\n\r\n\r\ntest = 6 - mx + 1\r\n\r\nprob = 6\r\n\r\nif test % 6 == 0:\r\n test /= 6\r\n prob /= 6\r\nelif test % 3 == 0:\r\n test /= 3\r\n prob /= 3\r\nelif test % 2 == 0:\r\n test /= 2\r\n prob /= 2\r\n\r\nprint (str(int(test)) + '/' + str(int(prob)))\r\n\r\n", "a,b=map(int,input().split(\" \"))\r\nx=max(a,b)\r\nc=0\r\nfor i in range(x,7):\r\n c=c+1\r\nd=6\r\nif(c==d):\r\n num=str(1)\r\n den=str(1)\r\nelif(c%2==0 and d%2==0):\r\n num=str(c//2)\r\n den=str(d//2)\r\nelif(c%3==0 and d%3==0):\r\n num=str(c//3)\r\n den=str(d//3)\r\nelse:\r\n num=str(c)\r\n den=str(d)\r\nprint(num+\"/\"+den)", "y,w=map(int, input().split())\r\ns=max(y,w)\r\nn=6-s+1\r\nif n==1 :\r\n print('1/6')\r\nif n==2:\r\n print('1/3')\r\nif n==3:\r\n print('1/2')\r\nif n==5:\r\n print('5/6')\r\nif n==4:\r\n print('2/3')\r\nif n==6:\r\n print('1/1')", "import math\r\n\r\ny, w = map(int, input().split())\r\nn, d = 0, 6\r\nrolls = [1, 2, 3, 4, 5, 6]\r\n\r\nfor i in rolls:\r\n if i >= max(y, w):\r\n n += 1\r\n\r\ngcd = math.gcd(n, d)\r\nn /= gcd\r\nd /= gcd\r\nprint(f'{int(n)}/{int(d)}')", "n = max([int(x) for x in input().split()])\r\npossible = 6-n+1\r\ntotal = 6\r\nif possible % 2 == 0:\r\n possible = possible//2\r\n total = total//2\r\nif possible % 3 == 0:\r\n possible = possible//3\r\n total = total//3\r\nprint(str(possible)+\"/\"+str(total))\r\n", "import math\r\nll = [int(i) for i in input().split()]\r\nif ll[0] == 0 and ll[1] == 0:\r\n\tprint(\"{}/{}\".format(int(ll[0]),int(ll[1])))\r\nelse :\r\n\ta = 6 - (max(ll[0],ll[1])-1)\r\n\tgcd = math.gcd(a,6)\r\n\tprint(\"{}/{}\".format(a//gcd,6//gcd))\r\n\t", "\r\n\r\ndef main():\r\n yW = list(map(int,input().split())) \r\n val = max(yW)\r\n dotVal = 7 - val\r\n neum = dotVal\r\n demo = 6\r\n for i in range(1,7):\r\n if neum % i == 0 and demo % i == 0:\r\n neum = neum / i\r\n demo = demo/ i\r\n print(f'{int(neum)}/{int(demo)}')\r\nmain()", "nums = input().split()\r\nY, W = int(nums[0]), int(nums[1])\r\nlargest = max(Y, W)\r\na = (6-largest)+1\r\nb = 6\r\ndef gcd(a, b):\r\n for i in range(b+1, 0, -1):\r\n if a % i == 0 and b % i == 0:\r\n return i\r\n\r\nprint(f\"{a//gcd(a, b)}/{b//gcd(a, b)}\")", "# https://codeforces.com/problemset/problem/9/A\r\n\r\nimport sys\r\nimport math\r\n\r\n\r\ndef main():\r\n # sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n # sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n # sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n\r\n # n = int(sys.stdin.readline().strip())\r\n y, w = map(int, sys.stdin.readline().strip().split()[:2])\r\n\r\n print(['1/1', '5/6', '2/3', '1/2', '1/3', '1/6'][max(y, w) - 1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# hajj\r\n# 　　　　　　 ＿＿\r\n# 　　　　　／＞　　フ\r\n# 　　　　　| 　_　 _ l\r\n# 　 　　　／` ミ＿xノ\r\n# 　　 　 /　　　 　 |\r\n# 　　　 /　 ヽ　　 ﾉ\r\n# 　 　 │　　|　|　|\r\n# 　／￣|　　 |　|　|\r\n# 　| (￣ヽ＿_ヽ_)__)\r\n# 　＼二つ\r\n", "from math import gcd\r\nif __name__ == \"__main__\":\r\n x = 6 - max([int(i) for i in input().split(\" \")]) + 1\r\n d = gcd(x, 6)\r\n print(str(x//d) + \"/\" + str(6//d))", "from sys import stdin\n\ndef readInts():\n return list(map(int, stdin.readline().split()))\n\ndef gcd(a,b):\n if b==0:\n return a\n else:\n return gcd(b, a%b)\n\ny, w = readInts()\n\nmaxi = max(y, w) - 1\n\ndom = 6 - maxi\n\ngreatest = gcd(dom,6)\n\nprint('{}/{}'.format(dom//greatest, 6//greatest))\n", "from sys import stdin\r\n\r\ndef gcd(a,b):\r\n\tif b==0:\r\n\t\treturn a\r\n\treturn gcd(b,a%b)\r\n\r\ny,w = map(int,stdin.readline().split())\r\ny = max(y,w)\r\nd = 6-y+1\r\nif d==6:\r\n\tprint(\"1/1\")\r\nelse:\r\n\tden = 6\r\n\tg = gcd(den,d)\r\n\tden = den//g\r\n\td = d//g\r\n\tprint(str(d)+\"/\"+str(den))", "a=input()\r\nb=a[0]\r\nc=a[2]\r\nif int(b)> int(c):\r\n j=7-int(b)\r\nelse:\r\n j=7-int(c)\r\nif j==1:\r\n print(\"1/6\")\r\nif j==2:\r\n print(\"1/3\")\r\nif j==3:\r\n print(\"1/2\")\r\nif j==4:\r\n print(\"2/3\")\r\nif j==5:\r\n print(\"5/6\")\r\nif j==6:\r\n print(\"1/1\")\r\n \r\n", "from math import gcd\r\na,b=map(int,input().split())\r\na=max(a,b)\r\na=6-a+1\r\nprint(f'{a//gcd(a,6)}/{6//gcd(a,6)}')", "def nod(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\ny, w = map(int, input().split())\r\n\r\nvar_d = 6 - max(y, w) + 1\r\ngcd = nod(var_d, 6)\r\nprint(var_d//gcd, \"/\", 6//gcd, sep=\"\")\n# Sat Jul 24 2021 11:42:52 GMT+0300 (Москва, стандартное время)\n", "from fractions import Fraction\r\nm = max(map(int, input().split()))\r\nif m == 1:print('1/1')\r\nelse:print(Fraction(6-m+1, 6))", "from math import gcd\r\n\r\ndef chance(n,m):\r\n q=[i for i in range(max(n,m),7)]\r\n return f'{len(q)//gcd(len(q),6)}/{6//gcd(len(q),6)}'\r\n\r\na,b=map(int,input().split())\r\nprint(chance(a,b))", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n else:\r\n return gcd(b, a%b)\r\nn = 7 - max(map(int, input().split()))\r\nprint(\"%d/%d\" % (n // gcd(n, 6), 6 // gcd(n,6)))", "from fractions import Fraction\r\nh,l=map(int,input().split())\r\ndie=\"123456\"\r\nc=0\r\nmax_number=max(h,l)\r\nfor i in range(1,7):\r\n if i>=max_number:\r\n c+=1\r\ndiv=Fraction(c,6)\r\nif div==1:\r\n print('1/1')\r\nelse:\r\n print(div)", "n = max(map(int, input().split()))\r\n\r\nprint([None, '1/1', '5/6', '2/3', '1/2', '1/3', '1/6', '0/1'][n])", "z = list(map(int, input().split()))\r\na = max(z)\r\nv = (6 - max(z)) + 1\r\nif v % 6 == 0:\r\n print(f'{int(v/6)}/{int(6/6)}')\r\nelif v % 3 == 0:\r\n print(f'{int(v/3)}/{int(6/3)}')\r\nelif v % 2 == 0:\r\n print(f'{int(v/2)}/{int(6/2)}')\r\nelse:\r\n print(f'{v}/{6}')", "inp1 = input()\ninp1 = [int(x) for x in inp1.split(\" \")]\nchanses = 6-(max(inp1)-1)\nif chanses == 0: print(\"0/1\")\nelif chanses == 2: print(\"1/3\")\nelif chanses == 3: print(\"1/2\")\nelif chanses == 6: print(\"1/1\")\nelif chanses == 4: print(\"2/3\")\nelse: print(f\"{chanses}/6\")\n\n# print(chanses)", "from fractions import Fraction\r\nt = input().split(\" \")\r\na = max(t)\r\nb = 7 - int(a)\r\nif(b/6==0):\r\n print(\"0/1\")\r\nelif(b/6==1):\r\n print(\"1/1\")\r\nelse:\r\n d = b/6\r\n if(d==0.5):\r\n print(\"1/2\")\r\n elif(d==0.6666666666666666):\r\n print(\"2/3\")\r\n elif(d==0.8333333333333334):\r\n print(\"5/6\")\r\n elif(d==0.3333333333333333):\r\n print(\"1/3\")\r\n elif(d==0.16666666666666666):\r\n print(\"1/6\")", "from math import gcd\r\ny, w = [int(i) for i in input().split()]\r\nz = (6-max((y, w))+1)\r\nx = 6\r\nx //= gcd(6,z)\r\nz //= gcd(6,z)\r\nprint(f'{z}/{x}')", "import math\r\nfrom math import *\r\n\r\na,b = map(int, input().split())\r\nres1 = 6 - max(a, b) + 1\r\nres2 = math.gcd(res1, 6)\r\n\r\nprint(res1 // res2, 6 // res2, sep = '/')", "l=['1/1','5/6','2/3','1/2','1/3','1/6']\r\nm,n=map(int,input().split())\r\nk=max(m,n)-1\r\nprint(l[k])\r\n", "from fractions import Fraction\nimport math\na = list(map(int, input().split(\" \")))\n\ngcd = math.gcd((7 -max(a)), 6)\nx = int((7 - max(a)) / gcd) \ny = int(6 / gcd)\nprint(\"{}{}{}\".format(x, \"/\", y))", "Y,W = map(int,input().split())\r\nnum = 7-max(Y,W)\r\nden = 6\r\n\r\nif num%2==0:\r\n num//=2\r\n den = 3\r\n\r\nif num%3==0:\r\n num//=3\r\n den//=3\r\nprint(str(num)+\"/\"+str(den))\r\n", "y, w= map(int, input().split())\r\nif max(y,w)==1 : print('1/1')\r\nif max(y,w)==2 : print('5/6')\r\nif max(y,w)==3 : print('2/3')\r\nif max(y,w)==4 : print('1/2')\r\nif max(y,w)==5 : print('1/3')\r\nif max(y,w)==6 : print('1/6')\r\n \r\n \r\n", "y, w = list(map(int, input().split()))\r\n\r\nsmallestWiningRoll = max(y, w)\r\n\r\ndef gcd(x, y):\r\n if y % x == 0: return x\r\n return gcd(y - x, x)\r\n\r\n\r\nif smallestWiningRoll == 1:\r\n print(\"1/1\")\r\nelse:\r\n nominator = 6 - smallestWiningRoll + 1\r\n denominator = 6\r\n greatestCommonDivisor = gcd(nominator, denominator)\r\n nominator //= greatestCommonDivisor\r\n denominator //= greatestCommonDivisor\r\n\r\n print(f\"{nominator}/{denominator}\")", "from math import gcd\r\n\r\n# Read input\r\nyakko, wakko = map(int, input().split())\r\n\r\n# Calculate the probability numerator (number of successful outcomes)\r\nnumerator = 7 - max(yakko, wakko)\r\n\r\n# Calculate the probability denominator (total outcomes)\r\ndenominator = 6\r\n\r\n# Calculate the greatest common divisor (GCD) of the numerator and denominator\r\ncommon_divisor = gcd(numerator, denominator)\r\n\r\n# Simplify the fraction by dividing both numerator and denominator by their GCD\r\nnumerator //= common_divisor\r\ndenominator //= common_divisor\r\n\r\n# Print the probability in the required format\r\nprint(f\"{numerator}/{denominator}\")\r\n", "y, w = list(map(int, input().split()))\r\nans = 6 - max(y, w) + 1\r\nif (ans == 0):\r\n print(\"0/1\")\r\nelif (ans == 2):\r\n print(\"1/3\")\r\nelif (ans == 3):\r\n print(\"1/2\")\r\nelif (ans == 4):\r\n print(\"2/3\")\r\nelif (ans == 6):\r\n print(\"1/1\")\r\nelse:\r\n print(str(ans) + \"/6\")", "c=input()\na=int(c[0])\nb=int(c[2])\nk=7-max(a,b)\nif(k%2==0):\n if(k%3==0):\n print(\"1/1\")\n else:\n k=k/2\n print(round(k),\"/3\",sep='')\nelif (k%3==0):\n k=k/3\n print(round(k),\"/2\",sep='')\nelse:\n print(round(k),'/6',sep='')\n \n ", "from math import gcd\r\na=max(map(int,input().split()))\r\nprint((7-a)//gcd(7-a,6),'/',6//gcd(7-a,6),sep='')", "s = str(input())\r\nst = s.split()\r\n\r\na = int(st[0])\r\nb = int(st[1])\r\n\r\nr = 7-max(a, b)\r\nz = 6\r\nif r % 2 == 0:\r\n r /= 2\r\n z /= 2\r\nelif r % 3 == 0:\r\n r /= 3\r\n z /= 3\r\nelif r % 6 == 0:\r\n r /= 6\r\n z /= 6\r\nr = int(r)\r\nz = int(z)\r\nif z == r:\r\n z = r = 1\r\nprint(f'{r}/{z}')", "n=input().split()\na,b=int(n[0]),int(n[1]);\nc=max(a,b)\nif(c==1):print(\"1/1\")\nelif(c==2):print(\"5/6\")\nelif(c==3):print(\"2/3\")\nelif(c==4):print(\"1/2\")\nelif(c==5):print(\"1/3\")\nelif(c==6):print(\"1/6\")", "\r\n\r\nfrom fractions import Fraction as frac\r\nn, m = map(int, input().split())\r\nl = [1,2,3,4,5,6]\r\nind = l.index(max(n, m))\r\ngc = 6 - ind\r\n\r\nif gc == 6:\r\n\tprint('1/1')\r\nelse:\r\n\tprint(frac(gc, 6))", "from fractions import Fraction\r\nl = list(map(int,input().split()))\r\nx = 7 - max(l)\r\nif x/6 == 1:\r\n print(\"1/1\")\r\nelse :\r\n print(Fraction(x,6))", "#####--------------Template Begin-------------------#####\r\nfrom fractions import Fraction\r\nimport sys\r\n#input = sys.stdin.readline\r\ndef i(): #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\ny, w= mi()\r\nprob=6-max(y,w)+1\r\nif prob==6:\r\n\tprint(\"1/1\")\r\nelif prob==5:\r\n\tprint(\"5/6\")\r\nelif prob==4:\r\n\tprint(\"2/3\")\r\nelif prob==3:\r\n\tprint(\"1/2\")\r\nelif prob==2:\r\n\tprint(\"1/3\")\r\nelif prob==1:\r\n\tprint(\"1/6\")\r\nelif prob==0:\r\n\tprint(\"0/1\")\r\n\r\n", "import os\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom decimal import *\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\n\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\na = max(rl())\r\nb = 6-a+1\r\nc = b//math.gcd(b,6)\r\nd = 6//math.gcd(b,6)\r\nprint(c,'/',d,sep='')\r\n", "# cook your dish here\r\na,b=map(int,input().split())\r\nc=max(a,b)\r\nc=6-c+1\r\nd={1:'1/6',2:'1/3',3:'1/2',4:'2/3',5:'5/6',6:'1/1',0:'0/1'}\r\nprint(d[c])\r\n", "num=input().split()\nmax=num[0]if num[0] > num[1] else num[1]\nak=int(max)\nak=7-ak\nif ak==6:\n print('1/1')\nelse:\n if (not ak-4) or (not ak-6) or (not ak-2):\n print('%d/3' %(ak/2))\n elif not ak-3:\n print('1/2')\n else:\n print('%d/6'%ak)\n", "y,w=map(int,input().split())\nm=max(y,w)\nd=7-m\ne=6\na=min(d,e)\nb=max(d,e)\nt=b%a\nwhile t!=0:\n b,a=a,t\n t=b%a\nprint(d//a,e//a,sep=\"/\")\n\n \t\t \t\t\t\t\t\t\t\t \t\t\t\t \t \t \t \t \t", "number = input().split(\" \")\r\nmy_list = []\r\ndic = {0:\"1/6\",1:\"1/3\",2:\"1/2\",3:\"2/3\",4:\"5/6\",5:\"1/1\"}\r\nfor i in range(2):\r\n my_list.append(int(number[i]))\r\nD = max(my_list)\r\nprint(dic.get(6- D))", "from fractions import Fraction\r\nmaximo = max([int(i) for i in input().split()])\r\nres = Fraction(6-maximo+1, 6)\r\nprint('1/1') if res == 1 else print(str(res))", "import math\r\nfrom fractions import Fraction \r\na,b = map(int,input().split())\r\nx = max(a,b)\r\ny = 6 - (x-1)\r\nz = Fraction(y, 6)\r\nf = (z).as_integer_ratio()\r\nf = str(f)\r\nu = f[1]\r\nd = f[4]\r\nprint(u + \"/\" + d)", "#!/usr/bin/python3\r\n\r\n\r\ndef main():\r\n\r\n dic = {\r\n 1 : \"1/1\",\r\n 2 : \"5/6\",\r\n 3 : \"2/3\",\r\n 4 : \"1/2\",\r\n 5 : \"1/3\",\r\n 6 : \"1/6\",\r\n }\r\n\r\n die_roll = list(map(int, input().split()))\r\n\r\n max_die = max(die_roll[0], die_roll[1])\r\n\r\n print(dic[max_die])\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import math\n\nY, W = map(int, input().split())\n\nmax_score = max(Y, W)\nwinning_probability = (6 - max_score + 1) / 6\n\nif winning_probability == 1:\n print(\"1/1\")\nelif winning_probability == 0:\n print(\"0/1\")\nelse:\n numerator = 6 - max_score + 1\n denominator = 6\n gcd = math.gcd(numerator, denominator)\n print(f\"{numerator//gcd}/{denominator//gcd}\")\n\n\n", "n,m = map(int,input().split())\r\nprob = [\"0/1\",\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\r\nprint(prob[max(n,m)])", "from fractions import gcd\r\ny,w= input().split()\r\nmax_num = max(y,w)\r\np = min(6,6-int(max_num)+1)\r\nd=6\r\ng=int(gcd(p,d))\r\n\r\nwhile(g>1):\r\n p = int(p) / int(g)\r\n d = int(d) / int(g)\r\n g=int(gcd(p,d))\r\np=int(p)\r\nd=int(d)\r\nprint(str(p)+\"/\"+str(d))", "dice_roll = input()\r\nY = int(dice_roll.split()[0])\r\nW = int(dice_roll.split()[1])\r\nnumerator = 7 - max(Y, W)\r\nif numerator == 6:\r\n print(\"1/1\")\r\nelse:\r\n if numerator %3 == 0:\r\n numerator = int(numerator/3)\r\n print(f\"{numerator}/2\")\r\n else:\r\n if numerator %2 == 0:\r\n numerator = int(numerator/2)\r\n print(f\"{numerator}/3\")\r\n else:\r\n print(f\"{numerator}/6\")", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, OCaml, 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'''\n# from fractions import Fractions\ny,w=map(int,input().split())\nx=max(y,w)\nprob=[\"\",\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"]\nprint(prob[x])\n\n", "from math import gcd\r\n\r\ny, w = list(map(int, input().split()))\r\nx = 6 - max(y, w) + 1\r\ncommon = gcd(x, 6)\r\nx //= common\r\nprint(f\"{x}/{6//common}\")", "from fractions import Fraction\r\n\r\nw, y = map(int, input().split())\r\nbigger = max(w, y)\r\ndot = 6 - bigger + 1\r\nif bigger == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(dot, 6))\r\n\r\n# prob = (dot / 6).as_integer_ratio()\r\n# print(str(prob[0]) + '/' + str(prob[1]))", "#take input\n#find which is bigger Y or W\n#6 - max(Y, W) + 1\n#divide by 6\n\n#simplify the fraction\n#print the result\nnumbers = input().split()\nY = int(numbers[0])\nW = int(numbers[1])\nif W<Y:\n X = 6-Y +1\nelse:\n X = 6-W+1\nO = X/6\nsimplify = {\n 1/6: \"1/6\",\n 1/2: \"1/2\",\n 4/6: \"2/3\",\n 5/6: \"5/6\",\n 2/6: \"1/3\",\n 6/6: \"1/1\"\n}\nprint(simplify[O])\n", "input_nums = list(map(int, input().split()))\r\n\r\nbest_options = [idx for idx in range(max(input_nums), 7)]\r\n\r\nif len(best_options) == 0:\r\n probability_numerator = 0\r\n probability_denominator = 1\r\nelse:\r\n probability_numerator = len(best_options)\r\n\r\n if probability_numerator == 4:\r\n probability_numerator = 2\r\n probability_denominator = 3\r\n\r\n elif probability_numerator == 5:\r\n probability_denominator = 6\r\n\r\n else:\r\n probability_denominator = int(6/probability_numerator)\r\n probability_numerator = 1\r\n\r\nprint(f'{probability_numerator}/{probability_denominator}')\r\n", "# https://codeforces.com/problemset/problem/9/A\r\n\r\nfrom fractions import Fraction\r\n\r\ny, w = [int(i) for i in input().split(\" \")]\r\n\r\nhighestPoints = max(y, w)\r\npossibleDotWins = 6 - highestPoints + 1\r\n\r\nfraction = Fraction(possibleDotWins, 6)\r\n\r\nif fraction == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(fraction)\r\n", "Y, W = map(int, input().split())\nnum = max(Y, W)\nif num == 1:\n print(\"1/1\")\nif num == 2:\n print(\"5/6\")\nif num == 3:\n print(\"2/3\")\nif num == 4:\n print(\"1/2\")\nif num == 5:\n print(\"1/3\")\nif num == 6:\n print(\"1/6\")", "yw = list(map(int, input().split()))\r\ny, w = yw\r\nresults = ['1/6', '1/3', '1/2', '2/3', '5/6', '1/1']\r\nprint(results[6 - max(y, w)])\r\n", "t, t1 = map(int, input().split(' '))\r\ns = 7 - max(t, t1)\r\nif s == 1:print('1/6')\r\nif s == 2:print('1/3')\r\nif s == 3:print('1/2')\r\nif s == 4:print('2/3')\r\nif s == 5:print('5/6')\r\nif s == 6:print('1/1')\r\n", "from math import gcd;y,w=map(int,input().split());m=max(y,w);m=6-m+1;print(f'{m//gcd(m,6)}/{6//gcd(m,6)}')", "import math\n\nif __name__ == \"__main__\":\n y, w = tuple(map(int, input().split()))\n res = 6 - max(y, w) + 1\n\n print(f\"{res // math.gcd(6, res)}/{6 // math.gcd(6, res)}\")\n", "y,w=map(int,input().split())\r\na=max(y,w)\r\nif 7-a==6:\r\n print('1/1')\r\nelif 7-a==5:\r\n print('5/6')\r\nelif 7-a==4:\r\n print('2/3')\r\nelif 7-a==3:\r\n print('1/2')\r\nelif 7-a==2:\r\n print('1/3')\r\nelif 7-a==1:\r\n print('1/6')\r\nelse:\r\n print('0/1')\r\n", "import math\r\nab=input().split()\r\na=int(ab[0])\r\nb=int(ab[1])\r\nx=max(a,b)\r\nn=7-x\r\ng=math.gcd(n,6)\r\nprint(str(n//g)+\"/\"+str(6//g))", "from fractions import Fraction\r\n\r\n\r\ndef dieRoll(n):\r\n result = Fraction(7-max(n), 6)\r\n if result == 1:\r\n return \"1/1\"\r\n if result == 0:\r\n return \"0/1\"\r\n\r\n return result\r\n\r\n\r\n\r\n\r\nn = list(map(int, input().strip().split()))\r\n\r\nprint(dieRoll(n))", "a,b = map(int,input().split())\r\nc=max(a,b)\r\nc=(6-c)+1\r\nif(c%2)==1:\r\n if(c==3):\r\n print(str(1)+'/'+str(2))\r\n else:\r\n print(str(c)+'/'+str(6))\r\nelse:\r\n if(c==4):\r\n print(str(2)+'/'+str(3))\r\n else:\r\n print(str(1)+'/'+str(6//c))\r\n", "def solve(y: int, w: int) -> str:\r\n m = max(y,w)\r\n if m == 6:\r\n return \"1/6\"\r\n elif m == 5:\r\n return \"1/3\"\r\n elif m == 4:\r\n return \"1/2\"\r\n elif m == 3:\r\n return \"2/3\"\r\n elif m == 2:\r\n return \"5/6\"\r\n elif m == 1:\r\n return \"1/1\"\r\n \r\ny,w = map(int, input().split())\r\nprint(solve(y,w))\r\n ", "#die throws\r\nfrom fractions import Fraction\r\nlist1=input().strip().split()\r\nif list1[1]>list1[0]:\r\n list1[0]=list1[1]\r\nn=str(Fraction(6-int(list1[0])+1,6))\r\nif n==\"1\":\r\n print(\"1/1\")\r\nelse:\r\n print(n)\r\n", "y,w = list(map(int,input().split()))\r\n\r\na = abs(max(y,w)-7)\r\n\r\nif(a == 1):\r\n print(\"1/6\")\r\n \r\nif(a == 2):\r\n print(\"1/3\")\r\n \r\nif(a == 3):\r\n print(\"1/2\")\r\n \r\nif(a == 4):\r\n print(\"2/3\")\r\n \r\nif(a == 5):\r\n print(\"5/6\")\r\n \r\nif(a == 6):\r\n print(\"1/1\")\r\n", "Y, W = map(int, input().split())\r\nprint([\"1/1\",\"5/6\",\"2/3\",\"1/2\",\"1/3\",\"1/6\"][max(Y, W)-1])", "from fractions import Fraction\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef input_list_numbers():\r\n return(list(map(int, input().split())))\r\n\r\n[Y, W] = input_list_numbers()\r\n\r\nh = max(Y, W)\r\n\r\nd = 6 - (h - 1)\r\n\r\nif (str(Fraction(d/6)) == \"1\"):\r\n print(\"1/1\")\r\nelse:\r\n print(str(Fraction(d, 6)))\r\n", "y,k=map(int,input().split())\r\nl=['0/1','1/1','5/6','2/3','1/2','1/3','1/6'] # strings of poss probabilities\r\nif y>=k:\r\n print(l[y])\r\nelse:\r\n print(l[k])", "def gcd(a, b):\r\n if b == 0: return a\r\n return gcd(b, a % b)\r\na, b = map(int, input().split())\r\ntu, mau = 7 - max(a, b), 6\r\nprint(tu // gcd(tu, mau), \"/\", mau // gcd(tu, mau), sep = \"\")", "def gcd(a,b):\r\n if a == 0 or b == 0:\r\n return a+b\r\n else:\r\n if a-b >= 0:\r\n return gcd(a-b,b)\r\n else:\r\n return gcd(a,b-a)\r\n \r\nx = input('').split()\r\na = int(x[0])\r\nb = int(x[1])\r\nm = max(a,b)\r\noptions = 7-m\r\ndenom = 6\r\ngcd = gcd(options,denom)\r\nno = int((7-m)/gcd)\r\nnd = int(6/gcd)\r\nprint(str(no)+'/'+str(nd))", "W,Y=map(int,input().split())\r\nK=max(W,Y)\r\nS=7-K\r\nif (S==1 or S==5):\r\n\tprint(str(S)+\"/6\")\r\nelif (S==2 or S==4):\r\n\tprint(str(S//2)+\"/3\")\r\nelif (S==3):\r\n\tprint(str(S//3)+\"/2\")\r\nelse:\r\n\tprint(\"1/1\")", "from math import gcd\r\ny,w=map(int,input().split())\r\nans=6-max(y,w)+1\r\ng=gcd(6,ans)\r\nif g==0:print('0/1')\r\nelse:print(str(ans//g)+'/'+str(6//g))", "from fractions import Fraction\r\nimport math\r\ny,w=[int(i) for i in input().split()]\r\na=7-(max(y,w))\r\nb=6\r\nc=math.gcd(a,b)\r\nd=a//c\r\ne=b//c\r\nprint(d,end='')\r\nprint('/',end='')\r\nprint(e)\r\n", "Y_num, W_num = map(int, input().split())\r\nx = max(Y_num,W_num)\r\nmylist = [\"0/1\", \"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nprint(mylist[x])\r\n", "from math import gcd\r\n\r\narray = list(map(int,input().strip().split()))\r\n\r\nmax = array[0]\r\nif array[0] < array[1]:\r\n max = array[1]\r\n\r\ncount = sum(1 for i in range(max,7))\r\n\r\ntmp = gcd(count, 6)\r\nres1 = count / tmp\r\nres2 = 6 / tmp\r\nprint(\"{}/{}\".format(int(res1),int(res2)))", "from math import gcd\r\na,b = map(int, input().split())\r\nc = 7 - max(a,b)\r\ng = gcd(c,6)\r\n\r\nprint(f'{c//g}/{6//g}')", "def solve():\r\n y,w=map(int,input().split());t=max(y,w)\r\n t=6-t+1\r\n if t==0:print(\"0/1\")\r\n if t==6:print('1/1')\r\n if t==1:print('1/6')\r\n if t==2:print('1/3')\r\n if t==3:print('1/2')\r\n if t==4:print('2/3')\r\n if t==5:print('5/6')\r\nsolve()", "y,w=map(int,input().split())\r\nmax_poss=6-(max(y,w))+1\r\nif max_poss==6:\r\n print(\"1/1\")\r\nelif max_poss==5:\r\n print(\"5/6\")\r\nelif max_poss==4:\r\n print(\"2/3\")\r\nelif max_poss==3:\r\n print(\"1/2\")\r\nelif max_poss==2:\r\n print(\"1/3\")\r\nelif max_poss==1:\r\n print(\"1/6\")", "from fractions import Fraction\r\ninput = [int(x) for x in input().split(\" \")]\r\nif input[0] == input[1] == 1:\r\n print('1/1')\r\nelse:\r\n print(Fraction((6-max(input)+1),6))\r\n", "y, w = map(int, input().split())\r\nd = [1, 2, 3, 4, 5, 6]\r\nb = 6\r\na = 6-max(y,w)+1\r\nfor i in range(1,7):\r\n if a % i == 0 and b%i==0:\r\n a = a//i\r\n b = b//i\r\nprint(f\"{a}/{b}\")\r\n", "a,b=map(int,input().split())\r\n\r\nfav=6-max(a,b)+1\r\n\r\nden=6\r\n\r\nif fav%2==0:\r\n fav=int(fav/2)\r\n den=int(den/2)\r\n \r\nelif fav%3==0:\r\n den=int(den/3)\r\n fav=int(fav/3)\r\n \r\nif fav==den:\r\n print('1/1')\r\n \r\nelse:\r\n \r\n print('{}/{}'.format(str(fav),str(den)))\r\n \r\n ", "from fractions import Fraction\r\nx, y = input().split()\r\nx = int(x)\r\ny = int(y)\r\nif x == 1 and y == 1:\r\n print(\"1/1\")\r\nelse:\r\n z = max(x,y)\r\n pd = Fraction(7-z, 6)\r\n print(pd)", "y, w = input().split()\ny, w = int(y), int(w)\nres = 0\nif y > w:\n for x in range(y, 7):\n res += 1\nelse:\n for x in range(w, 7):\n res += 1\nif res == 1:\n print(\"1/6\")\nelif res == 2:\n print(\"1/3\")\nelif res == 3:\n print(\"1/2\")\nelif res == 4:\n print(\"2/3\")\nelif res == 5:\n print(\"5/6\")\nelse:\n print(\"1/1\")\n \t \t \t\t \t \t\t \t \t\t\t\t \t\t \t \t", "\r\nlis = list(map(int, input().strip().split()))\r\nsum = 0\r\n\r\nif lis[0] > lis[1]:\r\n z = (6 - lis[0]) + 1\r\nelse:\r\n z = (6 - lis[1]) + 1\r\n\r\nif 6 % z == 0:\r\n print('1/' + str(int(6 / z)))\r\n\r\nif z == 5:\r\n print('5/6')\r\n\r\nif z == 4:\r\n print('2/3')\r\n\r\n", "a,b = [int(i) for i in input().split()]\n\nprob = [\"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\nif a > b:\n maxi = a\nelse:\n maxi = b\n\nprint(prob[maxi-1])\n \t \t \t \t\t\t\t\t\t\t\t\t \t\t \t\t", "x=list(map(int,input().split()))\r\na=max(x)\r\nb=min(x)\r\ndice=[1,2,3,4,5,6]\r\nc=[]\r\nfor i in dice:\r\n if i>=a:\r\n c.append(i)\r\nif len(c)==0:\r\n print(\"0/1\")\r\nif len(c)==6:\r\n print(\"1/1\")\r\nif len(c)==1:\r\n print(\"1/6\")\r\nif len(c)==2:\r\n print(\"1/3\")\r\nif len(c)==3:\r\n print(\"1/2\")\r\nif len(c)==4:\r\n print(\"2/3\")\r\nif len(c)==5:\r\n print(\"5/6\")", "\r\nfrom fractions import Fraction\r\n\r\nif __name__ == '__main__':\r\n a,b = map(int,input().split())\r\n m = max(a,b) - 1\r\n p = Fraction(6-m,6)\r\n if p == 1:\r\n print(\"1/1\")\r\n else:\r\n print(Fraction((6-m),6))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nx,y = input().split()\r\nx= int(x)\r\ny = int(y)\r\nif x>=y:\r\n if x==1:\r\n print(\"1/1\")\r\n elif x==2:\r\n print(\"5/6\")\r\n elif x==3:\r\n print(\"2/3\")\r\n elif x==4:\r\n print(\"1/2\")\r\n elif x==5:\r\n print(\"1/3\")\r\n elif x==6:\r\n print(\"1/6\")\r\nelse:\r\n if y==1:\r\n print(\"1/1\")\r\n elif y==2:\r\n print(\"5/6\")\r\n elif y==3:\r\n print(\"2/3\")\r\n elif y==4:\r\n print(\"1/2\")\r\n elif y==5:\r\n print(\"1/3\")\r\n elif y==6:\r\n print(\"1/6\")\r\n \r\n ", "a,b = map(int,input().split())\r\nnum = 7-max(a,b)\r\nden = 6\r\nif num % 2 == 0:\r\n num = num //2\r\n den = den // 2\r\nif num % 3 == 0:\r\n num = num // 3\r\n den = den // 3\r\nnum = str(num)\r\nden = str(den)\r\nprint(num+\"/\"+den)", "from math import gcd\r\ny, w = map(int,input().split())\r\nda = 7 - max(y,w)\r\na = gcd(6,da)\r\nprint(str(da//a)+\"/\"+str(6//a))", "#yakko == y points \"1 to 6\"\r\n#wakko == w points \"1 to 6\"\r\n# if dot == wakko or yakko , dot wins\r\n# output on format 1/2 .. 1/3 ....etc . if 0 \"0/1\" if 1 \"1/1\"\r\n# basst === (6 - greatest number) + 1 ,, makam 6 \r\n\r\nfrom fractions import Fraction\r\nn = list(map(int , input().split()))\r\ny = n[0]\r\nw = n[1]\r\n\r\nif y >= w:\r\n b = (6 - y) + 1\r\nelse:\r\n b = (6 - w) + 1\r\n\r\nif Fraction(b , 6) == 1:\r\n print(\"1/1\")\r\nelif Fraction(b , 6) == 0:\r\n print(\"0/1\")\r\nelse:\r\n print(Fraction(b , 6)) \r\n", "a,b = map(int,input().split())\r\nz = 7-max(a,b)\r\nif z == 1:print(\"1/6\")\r\nelif z==2:print(\"1/3\")\r\nelif z==3:print(\"1/2\")\r\nelif z==4:print(\"2/3\")\r\nelif z==5:print(\"5/6\")\r\nelif z==6:print(\"1/1\")", "from math import gcd\r\na, b = map(int, input().split())\r\nc = 7 - max(a, b)\r\nd = 6\r\ne = gcd(c, d)\r\nc = c // e\r\nd = d // e\r\nprint(str(c)+'/'+str(d))", "a,b=map(int,input().split())\r\nk=6-max(a,b)+1\r\nif k==2:\r\n print('1/3')\r\nelif k==3:\r\n print('1/2')\r\nelif k==4:\r\n print('2/3')\r\nelif k==6:\r\n print('1/1')\r\nelif k==0:\r\n print('0/1')\r\nelse:\r\n print(str(k)+'/6')", "from fractions import Fraction\r\ny, w = list(map(int, input().split()))\r\nf = len(list(range(max(y, w), 7)))\r\nif Fraction(f, 6) == 1:\r\n print('1/1')\r\n\r\nelif f == 0:\r\n print('0/1')\r\nelse:\r\n print(Fraction(f, 6))\r\n", "from fractions import Fraction\r\n\r\na, b = map(int, input().split())\r\nif str(Fraction(f\"{6 - max(a, b) + 1}/6\")).isdigit():\r\n print(str(Fraction(f\"{6 - max(a, b) + 1}/6\")) + \"/1\")\r\nelse:\r\n print(Fraction(f\"{6 - max(a, b) + 1}/6\"))\r\n", "y,w=map(int,input().split())\r\nk=max(y,w)\r\nl=7-k\r\nfor i in range(1,7):\r\n if 6%i==0 and l%i==0:\r\n p,q=6//i,l//i\r\nif q==0:\r\n print(\"0/1\")\r\nelse:\r\n print(q,\"/\",p,sep=\"\")", "import math\r\nY,W = map(int,input().split())\r\nmax1 = max(Y,W)\r\nfav_outcome = 6-max1+1\r\ngcd1 = math.gcd(fav_outcome,6)\r\nfav_outcome//=gcd1\r\ntt = 6//gcd1\r\nprint(f\"{fav_outcome}/{tt}\")\r\n", "from fractions import Fraction\r\nY, W = [int(i) for i in input().split()]\r\n\r\nm = max(Y, W)\r\n\r\nc = 6-m+1\r\n\r\nif(c == 0):\r\n print(\"0/1\")\r\nelif(c == 6):\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(c,6))", "[a, b] = list(map(int, input().split(\" \")))\nr = ['1/6', '1/3', '1/2', '2/3', '5/6', '1/1']\nprint(r[6 - max(a,b)])\n", "# codigo de mmc de http://devfuria.com.br/logica-de-programacao/mmc/\ndef mmc(num1, num2):\n a = num1\n b = num2\n\n resto = None\n while resto is not 0:\n resto = a % b\n a = b\n b = resto\n\n return a\n\ny,w = [int(i) for i in input().split()]\nmaior = max(y,w)\nresto = 6-maior+1\nbaixo = 6\nmmc = mmc(resto,baixo)\nprint(int(resto/mmc), end='/')\nprint(int(baixo/mmc))\n \t \t\t\t \t \t\t\t\t \t \t\t\t \t", "ls = ['1/6', '1/3', '1/2', '2/3', '5/6', '1/1']\r\n\r\na,b = input().split()\r\nans = ls[6-max(int(a),int(b))]\r\nprint(ans)", "w, y = input ().split ()\r\nw, y = int (w), int (y)\r\n\r\nr = 6\r\nm = max (w, y)\r\nif m == 1:\r\n print (\"1/1\")\r\n\r\nelse:\r\n m = r - m + 1\r\n for n in range(2,4):\r\n if m % n == 0 and r % n == 0:\r\n r = r/n\r\n r = int (r)\r\n m = m / n\r\n m = int(m)\r\n print (str (m) + \"/\" + str (r))\r\n break\r\n else:\r\n print (str (m) + \"/\" + str (r))", "a,b =input().split()\r\na=int(a)\r\nb=int(b)\r\nif a>b :\r\n c=7-a\r\nelse :\r\n c=7-b\r\nif c==1 :\r\n print('1/6')\r\nif c==2 :\r\n print('1/3')\r\nif c==3 :\r\n print('1/2')\r\nif c==4 :\r\n print('2/3')\r\nif c==5 :\r\n print('5/6')\r\nif c==6 :\r\n print('1/1')", "s = input().split(' ')\r\na = int(s[0])\r\nb = int(s[1])\r\ndic = {1 : '1/1', 2 : '5/6', 3 : '2/3', 4 : '1/2', 5 : '1/3', 6 : '1/6'}\r\nif a >= b:\r\n print(dic[a])\r\nelse:\r\n print(dic[b])", "import math\r\nyakko,wakko=map(int,input().split())\r\n\r\nfavorable_outcomes = 6 - max(yakko, wakko) + 1\r\ntotal_outcomes = 6\r\ndivisor = math.gcd(favorable_outcomes, total_outcomes)\r\nnumerator = favorable_outcomes // divisor\r\ndenominator = total_outcomes // divisor\r\nprint(str(numerator)+\"/\"+str(denominator))", "def gcd(a, b):\n return gcd(b, a % b) if b else a;\n\na, b = map(int, input().split())\na = 7 - max(a,b) \nb = 6\ntmp = gcd(a, b)\nprint('{}/{}'.format(a // tmp,b // tmp))", "import math\r\n\r\nm = max(map(int, input().split()))\r\nprint(str((7 - m) // math.gcd(6, 7 - m)) + \"/\" + str(6 // math.gcd(6, 7 - m)))", "a,b=map(int,input().split())\nc=6-max(a,b)+1\nif c==0:\n print('0/1')\nelif c==6:\n print('1/1')\nelif c==2:\n print('1/3')\nelif c==3:\n print('1/2')\nelif c==4:\n print('2/3')\nelif c==1:\n print('1/6')\nelse:\n print('5/6')\n \t \t \t\t\t\t \t \t\t\t\t\t \t \t \t\t\t", "def gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\nn = max([*map(int, input().split())])\r\nm = 6 - n + 1\r\ng = gcd(6, m)\r\nprint(str(m // g) + \"/\" + str(6 // g))\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/9/A\r\nimport sys\r\n#-----------------------------------------------------------------------------#\r\n# comment before submission\r\n# sys.stdin = open('inputs.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n#-----------------------------------------------------------------------------#\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\n\r\ndef hcf(x1, x2):\r\n x1, x2 = max(x1, x2), min(x1, x2)\r\n while x1 % x2:\r\n x1, x2 = x2, x1 % x2\r\n\r\n return x2\r\n\r\n\r\nd1 = max(map(int, input().split()))\r\ntotal_cases = 6\r\nfav_cases = total_cases - d1 + 1\r\n\r\nnume = fav_cases//hcf(fav_cases, total_cases)\r\ndeno = total_cases // hcf(fav_cases, total_cases)\r\n\r\nprint(f'{nume}/{deno}')\r\n", "a, b = map(int, input().split())\r\nmaxAB = max(a,b)\r\nif maxAB == 1: \r\n print(\"1/1\")\r\nelif maxAB == 2:\r\n print(\"5/6\")\r\nelif maxAB == 3:\r\n print(\"2/3\")\r\nelif maxAB == 4:\r\n print(\"1/2\")\r\nelif maxAB == 5:\r\n print(\"1/3\")\r\nelif maxAB==6:\r\n print(\"1/6\")", "x = int(max(input().split()))\r\np = ['1/1','5/6','2/3','1/2','1/3','1/6']\r\nprint(p[x-1])", "y,w=map(int,input().split())\r\n\r\nA = 7-max(y,w)\r\nB = 6\r\nfor i in range(1,4):\r\n\tif (A%i==0 and B%i==0):\r\n\t\tA=A//i\r\n\t\tB=B//i\r\nout=str(A)+\"/\"+str(B)\r\nprint(out)", "a=input().split()\r\ny=int(a[0])\r\nw=int(a[1])\r\nb=6-max([y, w])+1\r\na=6\r\nif b%2==0:\r\n b//=2\r\n a//=2\r\nif b%3==0:\r\n b//=3\r\n a//=3\r\nprint(str(b)+\"/\"+str(a))", "from fractions import Fraction\r\nn = input().split()\r\nx = [0,0,0,0,0,0,0]\r\na = 0\r\nif(int(n[0]) >= int(n[1])):\r\n for i in range(1,7):\r\n if(i >= int(n[0])):\r\n x[i] = 1\r\nelse:\r\n for i in range(1,7):\r\n if(i >= int(n[1])):\r\n x[i] = 1\r\nfor i in range(len(x)):\r\n if(x[i] == 1):\r\n a += 1\r\nif(a == 6):\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(a, 6))", "from fractions import Fraction\r\nx, y = input().split()\r\nx=int(x)\r\ny=int(y)\r\nz=max(x,y)\r\ncount=0\r\nfor i in range(z,7):\r\n count=count+1\r\nif count==6 : \r\n print(\"1/1\")\r\nelif count==0 : \r\n print(\"0/1\")\r\nelse : \r\n print(Fraction(count,6))", "y,w = map(int, input().split())\r\nz = max(y,w)\r\nprobup = 6-z+1\r\nxd = probup/6\r\nif xd == (1/6):\r\n print(\"1/6\")\r\nelif xd == (1/3):\r\n print(\"1/3\")\r\nelif xd == (1/2):\r\n print(\"1/2\")\r\nelif xd == (2/3):\r\n print(\"2/3\")\r\nelif xd == (5/6):\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "from fractions import gcd\r\n\r\nmaxi = max(map(int, input().split(' ')))\r\nnum = 6 - maxi + 1\r\ngcd_ = gcd(6, num)\r\nprint(\"{}/{}\".format(num // gcd_, 6 // gcd_))", "a,b=map(int,input().split())\r\nc = max(a,b)\r\nc-=1\r\nnum = 6-c\r\nif num==2:\r\n print(\"1/3\")\r\nelif num==3:print(\"1/2\")\r\nelif num==4:print(\"2/3\")\r\nelif num==6:print(\"1/1\")\r\nelse:print(str(num)+\"/6\")", "import math\r\ni1, i2 = map(int, input().split())\r\nprob = 6 - max(i1, i2) + 1 \r\ndiv = math.gcd(prob, 6)\r\nprint(str(prob//div)+\"/\"+str(6//div))", "import math\r\ny,w=map(int,input().split())\r\nprint(\"{}/{}\".format((7-max(y,w))//math.gcd(7-max(y,w),6),6//math.gcd(7-max(y,w),6)))", "from fractions import Fraction\r\n\r\nm = max(map(int, input().split(\" \")))\r\nval = Fraction((6-m+1), 6)\r\nif val == 0:\r\n print(\"0/1\")\r\nelif val == 1:\r\n print(\"1/1\")\r\nelse:\r\n print(val)", "from math import gcd\r\n\r\ny,w = map(int,input().split())\r\n\r\na = 7 - max(y,w)\r\n\r\nc = gcd(a,6)\r\n\r\nprint(str(a // c) + \"/\" + str(6 // c))", "import fractions\r\nn1, n2 = map(int, input().split())\r\nnum = 6-max(n1,n2)+1\r\ndiv = fractions.gcd(num,6)\r\nnum = int(num/div)\r\nden = int(6/div)\r\nprint(str(num)+'/'+str(den))", "a , b = list(map(int,input().split()))\r\nc = max(a , b)\r\nimport math as m\r\nprob = 7 - c\r\ntot_pro = 6\r\nwhile m.gcd(prob , tot_pro) != 1:\r\n d = m.gcd(prob , tot_pro)\r\n prob = prob // d\r\n tot_pro = tot_pro // d\r\n\r\nprint(str(prob) + '/' + str(tot_pro))", "myList = map(int , input().split())\r\nmyList = list(myList)\r\nmyList.sort()\r\nn = 6 - myList[-1] + 1\r\nif n == 1:\r\n print(\"1/6\")\r\nif n == 2:\r\n print(\"1/3\")\r\nif n == 3:\r\n print(\"1/2\")\r\nif n == 4:\r\n print(\"2/3\")\r\nif n == 5:\r\n print(\"5/6\")\r\nif n == 6:\r\n print(\"1/1\")", "n = input().split()\r\nx = int(n[0])\r\ny = int(n[1])\r\nt = 6 +1 - max(x,y)\r\nif t == 6:\r\n res = '1/1'\r\nelif t == 4:\r\n res = '2/3'\r\nelif t == 2:\r\n res = '1/3'\r\nelif t ==3 :\r\n res = '1/2'\r\nelse:\r\n res = str(t)+'/6'\r\nprint(res)\r\n ", "def probability(nums):\r\n maxValue = max(nums)\r\n if maxValue == 1:\r\n return '1/1'\r\n elif maxValue == 2:\r\n return '5/6'\r\n elif maxValue == 3:\r\n return '2/3'\r\n elif maxValue == 4:\r\n return '1/2'\r\n elif maxValue == 5:\r\n return '1/3'\r\n else:\r\n return '1/6'\r\n \r\n\r\nnums = (list(map(int, input().split())))\r\nprint(probability(nums))\r\n", "# import sys\r\n# sys.stdin=open('input.in','r')\r\n# sys.stdout=open('output.out','w')\r\n\r\nl1=list(map(int,input().split()))\r\nn=7-max(l1)\r\nif n==6:\r\n\tprint('1/1')\r\nelif n==3:\r\n\tprint('1/2')\r\nelif n==2:\r\n\tprint('1/3')\r\nelif n==4:\r\n\tprint('2/3')\r\nelse:\r\n\tprint('{}/6'.format(n))", "import math\r\nl,k=list (map(int, input().split()))\r\nn=6-(max(l,k)-1)\r\nd=6\r\nx=math.gcd(n,d)\r\n\r\nprint(int(n/x),end = '')\r\nprint('/',end = '')\r\nprint(int(d/x),end = '')\r\n", "import math\nn,m = [int(i) for i in input().split()]\nn = 6 - max(n,m) + 1\na = math.gcd(n,6)\nprint(f\"{n//a}/{6//a}\")", "import math\r\n\r\ny,w = map(int,input().split())\r\nnom = 6 - (max(y,w)-1)\r\ndom = 6\r\ng = math.gcd(nom,dom)\r\nif nom == 6:\r\n print(\"1/1\")\r\nelse:\r\n nom = int(nom/g)\r\n dom = int(dom/g)\r\n print(str(nom)+\"/\"+ str(dom))", "from fractions import Fraction\r\ny,w=map(int,input().split())\r\nx=max(y,w)\r\nz=Fraction((6-x+1),6)\r\nif z==0:\r\n print('0/0')\r\nelif z==1:\r\n print('1/1')\r\nelse:\r\n print(z)", "a = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nb = max(a)\r\nc = 6 - b\r\nif c == 0:\r\n print('1/6')\r\nelif c == 1:\r\n print('1/3')\r\nelif c == 2:\r\n print('1/2')\r\nelif c == 3:\r\n print('2/3')\r\nelif c == 4:\r\n print('5/6')\r\nelif c == 5:\r\n print('1/1')", "x,y = [int(i) for i in input().split()]\r\nx =6 - max(x,y)+1\r\nd = {1:\"1/6\",2:\"1/3\",3:\"1/2\",4:\"2/3\",5:\"5/6\",6:\"1/1\"}\r\nprint(d[x])\r\n", "Y, W = map(int, input().split())\r\n\r\nmax_score = max(Y, W)\r\npossible_outcomes = 6 - max_score + 1\r\n\r\n# Нахождение наибольшего общего делителя числителя и знаменателя\r\ndef gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n# Сокращение дроби\r\ngcd_value = gcd(possible_outcomes, 6)\r\nnumerator = possible_outcomes // gcd_value\r\ndenominator = 6 // gcd_value\r\n\r\nprint(f\"{numerator}/{denominator}\")", "x=list(map(int,input().split(' ')))\r\nz=max(x)\r\ny=(6-z)+1\r\nd=1\r\nfor i in range(2,y+1):\r\n if y%i==0 and 6%i==0:\r\n d=i\r\nprint('{}/{}'.format(int(y/d),int(6/d)))\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\ny,w=(int(i) for i in input().split())\r\nk=6-max(y,w)+1\r\nk1=math.gcd(k,6)\r\nc1=k//k1\r\nc2=6//k1\r\nprint(str(c1)+'/'+str(c2))", "a, b=map(int, input().split())\r\nx,y=7-max(a,b),6\r\ndef d(q,w):\r\n if min(q,w)==0:\r\n return max(q,w)\r\n elif min(q,w)==1:\r\n return 1\r\n else:\r\n return d(max(q,w)%min(q,w),min(q,w))\r\nprint(\"{0}/{1}\".format(int(x/d(x,y)),int(y/d(x,y))))", "Y, W = input().split()\r\nY=int(Y)\r\nW=int(W)\r\nmaxi = max(Y, W)\r\nr=(6-maxi)+1\r\nif r == 0:\r\n print(\"0/1\")\r\nelif r==1:\r\n print(\"1/6\")\r\nelif r==2:\r\n print(\"1/3\")\r\nelif r==3:\r\n print(\"1/2\")\r\nelif r==4:\r\n print(\"2/3\")\r\nelif r==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "# int(input())\r\n# [int(s) for s in input().split()]\r\n# input()\r\n\r\n\r\ndef solve():\r\n Y, W = [int(s) for s in input().split()]\r\n Z = max(Y, W)\r\n if Z == 6:\r\n print(\"1/6\")\r\n elif Z == 5:\r\n print(\"1/3\")\r\n elif Z == 4:\r\n print(\"1/2\")\r\n elif Z == 3:\r\n print(\"2/3\")\r\n elif Z == 2:\r\n print(\"5/6\")\r\n elif Z == 1:\r\n print(\"1/1\")\r\n elif Z == 0:\r\n print(\"1/1\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "import fractions\r\ny,w = [int(i) for i in input().split()]\r\nm = max(y,w)-1\r\nf = fractions.Fraction(6-m,6)\r\nif f == 0:\r\n print('0/1')\r\nelif f == 1:\r\n print('1/1')\r\nelse:\r\n print(f)", "s = input().split()\r\n\r\na = int(s[0])\r\nb = int(s[1])\r\nmx = 0\r\nif a >= b:\r\n mx = a\r\nif a < b:\r\n mx = b\r\nif (6-mx + 1) == 6:\r\n print(\"1/1\")\r\n exit(0)\r\nif (6-mx + 1) % 3 == 0:\r\n print(str((6-mx + 1) // 3) + \"/2\")\r\n exit(0)\r\nif (6-mx + 1) % 2 == 0:\r\n print(str((6-mx + 1) // 2) + \"/3\")\r\n exit(0)\r\nprint(str((6-mx + 1) // 1) + \"/6\")\r\n", "from fractions import Fraction\r\ny,w = map(int,input().split())\r\nm=max(y,w)\r\nd=(7-m)\r\nif d==6:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(d,6))", "a = list(map(int, input().split()))\r\ns=max(a[0],a[1])\r\nd=6-s+1\r\ns=6\r\nif(d%6==0):\r\n d=d//6\r\n s=1\r\nelif(d%2==0):\r\n d=d//2\r\n s=6//2\r\nelif(d%3==0):\r\n d=d//3\r\n s=6//3\r\n \r\nprint(f'{d}/{s}')", "x, y = map(int, input().split())\r\ndie_roll = [\"1/6\", \"1/3\", \"1/2\", \"2/3\", \"5/6\", \"1/1\"]\r\nx = max(x, y)\r\n\r\nprint(die_roll[6 - x])\r\n", "y, w = list(map(int, input().split()))\r\nprobs = ['1/6', '1/3', '1/2', '2/3', '5/6', '1/1']\r\nd = probs[6-max(y,w)]\r\n\r\nprint(d)", "from fractions import Fraction\n\nentrada = input()\nitens = entrada.split()\ny, w = int(itens[0]), int(itens[1])\n\nmaior = max(y,w)\n\nqtd_faces = 7 - maior\n\nresult = Fraction(qtd_faces, 6)\n\nif (result == 1):\n print('1/1')\nelif (result == 0):\n print('0/1')\nelse:\n print(result)\n \t\t \t\t\t\t \t \t \t \t\t\t\t \t\t\t\t\t", "from fractions import Fraction\r\ny,w=map(int,input().split())\r\nm=max(y,w)\r\ncnt=0\r\nfor i in range(m,7):\r\n cnt+=1\r\nif cnt==0:\r\n print(\"0/1\")\r\nelif cnt==6:\r\n print(\"1/1\")\r\nelif cnt==2:\r\n print(\"1/3\")\r\nelif cnt==3:\r\n print(\"1/2\")\r\nelif cnt==4:\r\n print(\"2/3\")\r\nelif cnt==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/6\")", "def gcd(x,y):\r\n if y == 0:\r\n return x\r\n\r\n return gcd(y, x % y)\r\n\r\nx, y = [int(x) for x in input().split()]\r\nchance = max(x,y)\r\n\r\nif chance == 1:\r\n print(\"1/1\")\r\nelif chance == 2:\r\n print(\"5/6\")\r\nelif chance == 3:\r\n print(\"2/3\")\r\nelif chance == 4:\r\n print(\"1/2\")\r\nelif chance == 5:\r\n print(\"1/3\")\r\nelse:\r\n print(\"1/6\")", "a,b=map(int,input().split(' '))\r\ndef gcd(a,b):\r\n x=max(a,b)\r\n y=min(a,b)\r\n if y==0:\r\n return 1\r\n else:\r\n while x%y>0:\r\n c=x\r\n x=y\r\n y=c%y\r\n \r\n \r\n return y\r\nt,r=(6-(max(a,b)-1)),6\r\nx=gcd(t,r)\r\nprint('{0}/{1}'.format(int(t/x),int(r/x)))\r\n", "y, w = map(int, input().split())\r\nmx = max(y, w)\r\noptions = 6 - mx + 1\r\nif 6 % options == 0:\r\n print(f\"{1}/{6//options}\")\r\nelif options % 2 == 0:\r\n print(f\"{options//2}/{3}\")\r\nelse:\r\n print(f\"{options}/{6}\")", "from sys import stdin, stdout\r\nfrom fractions import Fraction\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\n\r\ndef solve():\r\n x,y = get_ints()\r\n temp = max(x,y)\r\n num = 7-temp\r\n den = 6\r\n ans = Fraction(num,den)\r\n if ans==1:\r\n stdout.write(\"1/1\\n\")\r\n else:\r\n stdout.write(str(ans)+\"\\n\")\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n ", "from math import gcd as g\r\na,b = list(map(int,input().split()))\r\nx = max(a,b)\r\ny = 6-x+1\r\nz = g(y,6)\r\nprint(y//z,\"/\",6//z,sep=\"\")\r\n", "guys_number = map(int , input(\"\").split(\" \"))\r\nnumber_holder = (6 - max(guys_number)+1)\r\nif(6 % number_holder == 0):\r\n print(\"1\" +\"/\"+ str(6 // number_holder))\r\nelif(number_holder % 2 == 0):\r\n print(str(number_holder // 2) + \"/\" + str(6 // 2))\r\nelif(number_holder % 3 == 0):\r\n print(str(number_holder // 3) + \"/\" + str(6 // 3))\r\nelse:\r\n print(str(number_holder) + \"/\" + str(6))\r\n ", "x,y=map(int,input().split())\r\nif(x<y):\r\n x,y=y,x\r\na=6-x+1\r\nif(a==0):\r\n print(\"0/1\")\r\nelif(a==6):\r\n print(\"1/1\")\r\nelif(a==3):\r\n print(\"1/2\")\r\nelif(a==2):\r\n print(\"1/3\")\r\nelif(a==1):\r\n print(\"1/6\")\r\nelif(a==4):\r\n print(\"2/3\")\r\nelif(a==5):\r\n print(\"5/6\")\r\n", "a = 7-max(map(int,input().split()))\r\nif a == 1: print('1/6')\r\nelif a == 2:print('1/3')\r\nelif a == 3:print('1/2')\r\nelif a == 4:print('2/3')\r\nelif a == 5:print('5/6')\r\nelif a == 6:print('1/1')", "y,w = map(int,input().split())\r\nx = min(6-y+1,6-w+1)\r\n\r\nfor i in range(x,0,-1):\r\n if x%i == 0 and 6%i==0:\r\n print(str(x//i)+\"/\"+str(6//i))\r\n break", "a = 7 - max(list(map(int, input().split())))\r\nb = 6\r\nif a == 0:\r\n b = 1\r\nelif 6 % a == 0:\r\n b = 6 // a\r\n a = 1\r\nelif a == 4:\r\n a = 2\r\n b = 3\r\nprint(a, '/', b, sep='')\r\n", "a = input()\r\ns,b = a.split(' ')\r\ns = int(s)\r\nb = int(b)\r\nd = (6-(max(s,b)-1))\r\nf = 6\r\nfor i in [2,3]:\r\n if (d%i == 0):\r\n d = d/i\r\n f = f/i\r\nf = int(f)\r\nd = int(d)\r\nprint(str(d)+'/'+ str(f))\r\n", "mx = max([int(element) for element in input().split()])\r\ndie = 6 - mx + 1\r\nif die == 6:\r\n print(\"1/1\")\r\nelif die == 5:\r\n print(\"5/6\")\r\nelif die == 4:\r\n print(\"2/3\")\r\nelif die == 3:\r\n print(\"1/2\")\r\nelif die == 2:\r\n print(\"1/3\")\r\nelse:\r\n print(\"1/6\")", "# https://codeforces.com/contest/9/problem/A\r\n\r\nlst =[int(i) for i in input().split()]\r\nmax_val = 6\r\nnum_of_favours = max_val - max(lst) + 1\r\n\r\nmin_of_two = min(num_of_favours,max_val)\r\n#fraction = num_of_favours/6\r\n#print(fraction)\r\n\r\nprime_number_set = [2, 3, 5]\r\nfor i in prime_number_set:\r\n if i <= min_of_two:\r\n if num_of_favours % i == 0 and max_val % i == 0:\r\n num_of_favours = int(num_of_favours/i)\r\n max_val = int(max_val/i)\r\n\r\nprint(str(num_of_favours)+'/'+str(max_val))", "\r\ny,w=map(int,input().split())\r\nd=(7-max(y,w))/6\r\nif(d==1):\r\n print('1/1')\r\nelif(d==5/6):\r\n print('5/6')\r\nelif(d==4/6):\r\n print('2/3')\r\nelif(d==3/6):\r\n print('1/2')\r\nelif(d==2/6):\r\n print('1/3')\r\nelif(d==1/6):\r\n print('1/6')", "\r\ny, w = map(int, input().split())\r\n\r\nmax_score=max(y,w)\r\ndot_possibles=6-max_score+1\r\n#4 5 6 \r\nalist=['1/6','1/3','1/2','2/3','5/6','1']\r\nif dot_possibles==6:\r\n print(\"1/1\")\r\nelif dot_possibles ==0:\r\n print(\"0/1\")\r\nelse :\r\n print(alist[dot_possibles-1])", "rolls = input()\r\nrolls = rolls.split()\r\nrolls[0] = int(rolls[0])\r\nrolls[1] = int(rolls[1])\r\n\r\nmaximum = max(rolls)\r\nnominator = 7-maximum\r\n\r\nif nominator == 1: print('1/6')\r\nif nominator == 2: print('1/3')\r\nif nominator == 3: print('1/2')\r\nif nominator == 4: print('2/3')\r\nif nominator == 5: print('5/6')\r\nif nominator == 6: print('1/1')", "y,w=[int(x) for x in input().split()]\ndot=7-max(y,w)\nif dot==0:\n print(\"0/1\")\nelif dot==1:\n print(\"1/6\")\nelif dot==2:\n print(\"1/3\")\nelif dot==3:\n print(\"1/2\")\nelif dot==4:\n print(\"2/3\")\nelif dot==5:\n print(\"5/6\")\nelse:\n print(\"1/1\")", "# Happy_water\r\nimport math\r\n\r\n\r\ndef main():\r\n y, w = map(int, input().split())\r\n x = 7 - max(y, w)\r\n print(x // math.gcd(x, 6), end='')\r\n print('/', end='')\r\n print(6 // math.gcd(x, 6))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "y,w=map(int,input().split())\r\nmax_num = max(y,w)\r\nchoices = 6-(max_num-1)\r\ntotal = 6\r\n\r\ndef hcf(a,b):\r\n if (b == 0):\r\n return a\r\n return hcf(b, a%b)\r\n \r\ncf = (hcf(total,choices))\r\n\r\nprint(f\"{choices//cf}/{total//cf}\")\r\n", "a, b = map(int, input().split())\r\nq = 6 - a*(a>b) - b*(b>=a)\r\np = [\"1/6\", \"1/3\", \"1/2\", \"2/3\", \"5/6\", \"1/1\"]\r\nprint(p[q])", "a,b = map(int,input().split())\ny = max(a,b)\n\nif y == 1:\n print(\"1/1\")\n \nelif y == 2:\n print(\"5/6\")\n \nelif y == 3:\n print(\"2/3\")\n\nelif y == 4:\n print(\"1/2\")\n\nelif y == 5:\n print(\"1/3\")\n \nelif y == 6:\n print(\"1/6\")\n \t\t \t\t\t\t\t\t \t\t\t \t \t \t \t\t", "from math import gcd\r\n\r\nlst = list(map(int, input().split()))\r\n\r\ndot = list(range(max(lst), 7))\r\n\r\nn = len(dot)\r\n\r\nif n == 0:\r\n print('0/1')\r\n\r\nelif n == 6:\r\n print('1/1')\r\n\r\nelse:\r\n d = gcd(n, 6)\r\n\r\n numerator = n // d\r\n denominator = 6 // d\r\n\r\n print('{}/{}'.format(numerator, denominator))", "\narr=input().split()\nmaxi=max(int(arr[0]),int(arr[1]))\nprob=6-maxi+1\nif 6%prob==0:\n\tprob=6//prob\n\tprint('1/'+str(prob))\nelse:\n\tif prob==4:\n\t\tprint('2/3')\n\telse:\n\t\tprint(str(prob)+'/6')", "# LUOGU_RID: 126327799\nx,y=map(int,input().split())\r\na=max(x,y)\r\nif(a==1):\r\n print(\"1/1\\n\")\r\nelif(a==2):\r\n print(\"5/6\\n\")\r\nelif(a==3):\r\n print(\"2/3\\n\")\r\nelif(a==4):\r\n print(\"1/2\\n\")\r\nelif(a==5):\r\n print(\"1/3\\n\")\r\nelif(a==6):\r\n print(\"1/6\\n\")\r\n", "a,b = [int(x) for x in input().split()]\r\nz = max(a,b)\r\npoint = 7-z\r\nif point%6 == 0:\r\n print(\"1/1\")\r\nelif point%2 == 0:\r\n print(str(int(point/2))+\"/\"+\"3\")\r\nelif point%3 == 0:\r\n print(str(int(point/2))+\"/\"+\"2\")\r\nelse:\r\n print(str(point)+\"/6\")\r\n", "from fractions import Fraction as frac\r\na,b=map(int,input().split())\r\nmaxi=max(a,b)\r\nres=6-maxi+1\r\nres1=frac(res,6)\r\nif res1==1:\r\n print(str(1)+'/'+str(1))\r\nelse:\r\n print(frac(res,6))", "a, b = map(int, input().split())\r\nmx = max(a,b)\r\nif mx==6:\r\n print('1/6')\r\nelif mx==5:\r\n print('1/3')\r\nelif mx==4:\r\n print('1/2')\r\nelif mx==3:\r\n print('2/3')\r\nelif mx==2:\r\n print('5/6')\r\nelif mx==1:\r\n print('1/1')", "a=max(list(map( int,input().split())))\r\nl=['1/1','5/6','2/3','1/2','1/3','1/6']\r\nprint(l[a-1])", "from fractions import Fraction\r\ny,w = map(int,input().split())\r\nm=max(y,w)\r\nd=(7-m)/6\r\nif d==1:\r\n print(\"1/1\")\r\nelif d==0:\r\n print(\"0/1\")\r\nelse:\r\n print(Fraction(d).limit_denominator(10))", "a,b=map(int,input().split())\r\nc=7-max(a,b)\r\nif c==3:\r\n print('1/2')\r\nelif c==2:\r\n print('1/3')\r\nelif c==4:\r\n print('2/3')\r\nelif c==6:\r\n print('1/1')\r\nelse:\r\n print(str(c)+'/'+'6')\r\n", "l=[int(i) for i in input().split(\" \")]\nn=7-max(l)\nif n==6:\n print(\"1/1\")\nelif n%2==0:\n print(f\"{n//2}/3\")\nelif n%3==0:\n print(f\"{n//3}/2\")\nelse:\n print(f\"{n}/6\")\n", "y, w = list(map(int, input().strip().split()))\r\nv = max(y, w)\r\nprint({\r\n 1:'1/1',\r\n 2:'5/6',\r\n 3:'2/3',\r\n 4:'1/2',\r\n 5:'1/3',\r\n 6:'1/6'\r\n}[v])", "n=7-max(map(int,input().split()))\r\nif(n==2):\r\n print(\"1/3\")\r\nelif(n==3):\r\n print(\"1/2\")\r\nelif(n==4):\r\n print(\"2/3\")\r\nelif(n==6):\r\n print(\"1/1\")\r\nelse:\r\n print(n,6,sep='/')\r\n", "class solution:\r\n def __init__(self,y,w):\r\n self.y = y\r\n self.w = w\r\n self.answer = ['1/6','1/3','1/2','2/3','5/6','1/1']\r\n def caluclation(self):\r\n if self.y >= self.w:\r\n self.answer = self.answer[(6 - self.y)]\r\n else:\r\n self.answer = self.answer[(6 - self.w)]\r\n\r\ny,w = map(int,input().split())\r\nroot = solution(y,w)\r\nroot.caluclation()\r\nprint(root.answer)", "y,w = map(int,input().split())\r\na = 7 - max(y,w)\r\nb = 6\r\nfor i in range(2,b+1):\r\n if a % i == 0 and b % i == 0:\r\n a = int(a/i)\r\n b = int(b/i)\r\nprint(f'{a}/{b}')", "from fractions import Fraction\r\n\r\nn , m = map(int,input().split())\r\n\r\nx = 7 - max(n , m )\r\n\r\nif x == 0 :\r\n print(\"0/1\")\r\n\r\nelif x == 6 :\r\n print(\"1/1\")\r\n\r\nelse:\r\n print(Fraction(x , 6))\r\n\r\n", "\r\nx=[int(x) for x in input().split(\" \")]\r\nfirst=x[0]\r\nsecond=x[1]\r\n \r\n \r\ndef get_div(num):\r\n for i in range(6,1,-1):\r\n if(num%i==0 and 6%i==0):\r\n return i\r\n return False\r\n \r\n \r\nif(first<second):\r\n least=second\r\nelse:\r\n least=first\r\ncounter=0; \r\nfor i in range(least,7):\r\n counter+=1\r\n \r\nget=get_div(counter) \r\nif(get==False): \r\n print(\"{}/{}\".format(counter,6))\r\n \r\nelse:\r\n \r\n print(\"{}/{}\".format(int(counter/get),int(6/get)))\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\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 fractions import gcd\r\na,b=map(int,input().split(\" \"))\r\nres=6-max(a,b)+1\r\ng=gcd(res,6)\r\nprint(''.join([str(res//g),\"/\",str(6//g)]))", "a = max(map(int, input().split()))\r\n\r\nif a == 1:\r\n print('1/1')\r\nelse:\r\n numerator = 7 - a\r\n denominator = 6\r\n \r\n if numerator % 2 == 0:\r\n numerator /= 2\r\n denominator /= 2\r\n\r\n if numerator % 3 == 0:\r\n numerator /= 3\r\n denominator /= 3\r\n \r\n print('%d/%d' % (numerator, denominator))", "n,k = map(int,input().split())\r\nx=max(n,k)\r\n\r\nif(x==4):\r\n print(\"1/2\")\r\nelif(x==1):\r\n print(\"1/1\")\r\nelif(x==3):\r\n print(\"2/3\")\r\nelif(x==2):\r\n print(\"5/6\")\r\nelif(x==5):\r\n print(\"1/3\")\r\nelif(x==6):\r\n print(\"1/6\")", "a,b =input().split()\r\nliste = [int(a),int(b)]\r\nc = max(liste)\r\nif c == 6:\r\n print(\"1/6\")\r\nif c == 5:\r\n print(\"1/3\")\r\nif c == 4:\r\n print(\"1/2\")\r\nif c == 3:\r\n print(\"2/3\")\r\nif c == 2:\r\n print(\"5/6\")\r\nif c == 1:\r\n print(\"1/1\")", "import math\r\nu,v=list(map(int,input().strip().split()))\r\ny=7-max(u,v)\r\ny2=6\r\nnum=math.gcd(y,y2)\r\ny//=num\r\ny2//=num\r\nprint(f'{y}/{y2}')", "pro= list(map(int,input().split()))\r\ns = 7 - max(pro)\r\nif 6%s == 0:\r\n print(str(s//s)+\"/\"+str(6//s))\r\nelif 6%s == 2:\r\n print(str(s//2)+\"/\"+str(6//2))\r\nelse: \r\n print(str(s)+\"/\"+str(6))", "def gcd(n, m):\r\n if m == 0:\r\n return n\r\n return gcd(m, n % m)\r\ny, w = map(int, input().split())\r\na = 6 - max(y, w) + 1\r\nx = 6\r\nx //= gcd(a, 6)\r\na //= gcd(a, 6)\r\nprint(a, end='')\r\nprint('/', end='')\r\nprint(x)", "m, n = map(int, input().split())\n\na = max(m, n)\nzaehler = 7 - a\nnenner = 6\n\nif(zaehler % 2 == 0):\n zaehler = zaehler // 2\n nenner = nenner // 2\nif(zaehler % 3 == 0):\n zaehler = zaehler // 3\n nenner = nenner // 3\n\nprint('{}/{}'.format(zaehler, nenner))", "def kmm(x):\n km=[]\n for _ in range(1,x+1):\n if x%_==0:\n km.append(_)\n return km\ndef shared(a,b):\n c=list(set(kmm(a))& set(kmm(b)))\n return c[-1]\nins=input()\nY,W = [int(i) for i in ins.split(\" \")]\nif(Y >6 or W >6 or Y <=0 or W <=0):\n print(\"0/1\")\nelse:\n the_max=max(Y,W)\n o=7-the_max\n km=shared(o,6)\n print(\"%d/%d\"%(1,6/o) if 6%o==0 else \"%d/%d\"%(o/km,6/km))\n\n\n\n", "y, w = map(int, input().split())\r\nnumber = max(y, w)\r\nneed = 6 - number + 1\r\nif need == 6:\r\n print('1/1')\r\nelif need % 3 == 0:\r\n print('1/2')\r\nelif need % 2 == 0:\r\n print(str(need // 2) + '/' + '3')\r\nelse:\r\n print(str(need) + '/' + '6')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math\nimport heapq\n\nm = 998244353\n\ndef input_xy():\n x, y = [int(x) for x in take_input().split()]\n return x, y\n\ndef input_arr():\n arr = [int(x) for x in take_input().split()]\n return arr\n\ndef input_n():\n n = int(take_input())\n return n\n\ndef sub_list(a,b):\n c = []\n for i in range(len(a)):\n c.append(a[i]-b[i])\n return c\n\ndef sub_const(a, c):\n b = []\n for x in a:\n b.append(x-c)\n return b\n\ndef binary_search(arr, low, high, x):\n if high >= low:\n mid = (high + low) // 2\n if arr[mid] == x:\n return mid\n elif arr[mid] > x:\n return binary_search(arr, low, mid - 1, x)\n else:\n return binary_search(arr, mid + 1, high, x)\n else:\n return -1\n \ndef printlist(a):\n for x in a:\n print(x, end = \" \")\n\ndef take_input():\n global mode\n if mode==0:\n return input()\n else:\n with open('/Users/aryan/Desktop/cp/test_case.txt') as f:\n lines = f.readlines()\n global line \n st = lines[line][:-1]\n line+=1\n return st\n\ndef solve_t():\n t = int(take_input())\n \n for l in range(t):\n n = input_n()\n arr = input_arr()\n prod = 1\n for x in arr:\n prod*=x\n print((prod + n-1)*2022)\n\ndef solve():\n a, b = input_xy()\n ans = 7-max(a,b)\n answers = {1:'1/6', 2:'1/3', 3:'1/2', 4:'2/3', 5:'5/6', 6:'1/1'}\n print(answers[ans])\n \n\n \nline = 0 \n#mode 1 = file, mode 0 = input buffer\nmode = 0\nsolve()", "def main():\n a, b = map(int, input().split())\n \n fractions = {\n 1: \"1/1\",\n 2: \"5/6\",\n 3: \"2/3\",\n 4: \"1/2\",\n 5: \"1/3\",\n }\n \n max_value = max(a, b)\n if max_value in fractions:\n print(fractions[max_value])\n else:\n print(\"1/6\")\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=list(map(int,input().split()))\r\n\r\ny=n[0]\r\nw=n[1]\r\n\r\ntemp=max(y,w)\r\n\r\nif temp==1:\r\n print(\"1\"+\"/\"+\"1\")\r\nelif temp==2:\r\n print(\"5\"+\"/\"+\"6\")\r\nelif temp==3:\r\n print(\"2\"+\"/\"+\"3\")\r\nelif temp==4:\r\n print(\"1\"+\"/\"+\"2\")\r\nelif temp==5:\r\n print(\"1\"+\"/\"+\"3\")\r\nelif temp==6:\r\n print(\"1\"+\"/\"+\"6\")\r\n ", "a = list(map(int,(input().split())))\r\nb = (6-max(a))+1\r\nif b == 0:\r\n print('0/1')\r\nelif b == 1:\r\n print('1/6')\r\nelif b == 2:\r\n print('1/3')\r\nelif b == 3:\r\n print('1/2')\r\nelif b == 4:\r\n print('2/3')\r\nelif b == 5:\r\n print('5/6')\r\nelif b == 6:\r\n print('1/1')", "print({1:\"1/6\", 2:\"1/3\", 3:\"1/2\", 4:\"2/3\", 5:\"5/6\", 6:\"1/1\"}[7 - max([int(x) for x in input().split()])])", "#https://codeforces.com/problemset/problem/9/A\r\n\r\nY,W = input().split()\r\n\r\nif Y > W:\r\n better_roll = int(Y)\r\nelse:\r\n better_roll = int(W)\r\n\r\npropability = 7 - better_roll\r\n\r\nif propability == 1:\r\n print(\"1/6\")\r\nelif propability == 2:\r\n print(\"1/3\")\r\nelif propability == 3:\r\n print(\"1/2\")\r\nelif propability == 4:\r\n print(\"2/3\")\r\nelif propability == 5:\r\n print(\"5/6\")\r\nelif propability == 6:\r\n print(\"1/1\")", "from math import gcd\r\n\r\nm = max(list(map(int,input().split())))\r\nnb_poss = 7 - m\r\ndenom = 6\r\ndiv = gcd(nb_poss,denom)\r\nnb_poss = nb_poss // div\r\ndenom = denom // div\r\n\r\nres = str(nb_poss) + '/' + str(denom)\r\nprint(res)\r\n", "n, m = map(int, input().split())\nn = 6 - (max(n, m) - 1)\nd = 6\n\nif d % n == 0:\n d /= n\n n = 1\nelif n % 2 == 0:\n n /= 2\n d /= 2\n\nprint(f\"{int(n)}/{int(d)}\")", "a,b=map(int,input().split())\r\nc=max(a,b)\r\nfrom math import gcd\r\nans=gcd(7-c,6)\r\nprint((7-c)//ans,6//ans,sep=\"/\")", "# A. Die Roll\r\n\r\ny,z = map(int,input().split())\r\n\r\nn = 7-max(y,z)\r\n\r\nif n%3==0 and n%2==0:\r\n print(\"1/1\")\r\nelif n%3==0:\r\n print(str(n//3)+\"/\"+\"2\")\r\nelif n%2==0:\r\n print(str(n//2)+\"/\"+\"3\")\r\nelse:\r\n print(str(n)+\"/\"+\"6\")\r\n\r\n", "[W,Y] = map(int, input().split())\nlist = ['1/1','5/6','2/3','1/2','1/3','1/6']\nr = max(W,Y)\nprint (list[r-1])\n", "y,w = map(int,input().split())\r\nr = (7-max(y,w))/6\r\nif r == 1/6 :\r\n print(\"1/6\")\r\nelif r == 2/6 :\r\n print(\"1/3\")\r\nelif r == 3/6 :\r\n print(\"1/2\")\r\nelif r == 4/6 :\r\n print(\"2/3\")\r\nelif r == 5/6 :\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\ndef gcd(a,b):\n if a<b:a,b=b,a\n while b:\n a,b=b,a%b\n return a \na,b=map(int,input().split())\nk=7-max(a,b)\nif gcd(6,k)!=1:\n print(str(k//gcd(6,k))+'/'+str(6//(gcd(6,k))))\nelse:\n print(str(k)+'/'+'6')", "import sys\r\n\r\n# sys.stdin = open(\"1.in\", \"r\")\r\n\r\nY, W = map(int, input().split())\r\n\r\nwin_num = 6 - max(Y, W) + 1\r\n\r\nif win_num == 6:\r\n print(\"1/1\")\r\nelif win_num == 2:\r\n print(\"1/3\")\r\nelif win_num == 3: \r\n print(\"1/2\")\r\nelif win_num == 4: \r\n print(\"2/3\")\r\nelse:\r\n print(str(win_num) + \"/6\")\r\n", "rdl = list(map(int,input().split()))\r\n\r\n_max = max(rdl[0], rdl[1])\r\n_score = 6 - _max + 1\r\n\r\nimport fractions\r\n\r\ngcd = fractions.gcd(6, _score)\r\n\r\nprint(int(_score/gcd), end=\"\")\r\nprint(\"/\",end=\"\")\r\nprint(int(6/gcd),end=\"\\n\")", "#9/A\r\n#Die Roll\r\n#Status : IDK\r\n\r\nimport fractions\r\n\r\ny , w = [int(x) for x in input().split()]\r\n\r\nbigger = y if y > w else w\r\n\r\nans = str(fractions.Fraction((6-bigger+1),6))\r\n\r\nif len(ans) < 2:\r\n print(ans + \"/1\")\r\nelse:\r\n print(ans)", "rollOne, rollTwo = map(int,input().split())\n#map answers[i] to the numerator i\nanswers = [\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\n\nnumerator = (6 - max(rollOne,rollTwo)) \n\nprint(answers[numerator])\n", "y, w = map(int, input().split())\r\nn = 6 - max(y, w) + 1\r\nfor i in range(n, 0, -1):\r\n if (n % i) == 0 == (6 % i):\r\n n = str(n // i) + '/' + str(6 // i)\r\n break\r\nprint(n)\r\n \r\n", "import math\r\ndef nik(rud,pig):\r\n maxi=max(rud,pig)\r\n t=6-maxi+1\r\n gcddd=math.gcd(t,6)\r\n print(str(t//gcddd)+'/'+str(6//gcddd)) \r\nrud,pig=map(int,input().split())\r\nnik(rud,pig)", "y,w=map(int,input().split())\na=6-max(y,w)+1\nb=6\nif a%2==0:\n\ta//=2\n\tb//=2\nif a%3==0:\n\ta//=3\n\tb//=3\nprint(str(a)+'/'+str(b))\n\n\n", "w = 7 - max(map(int, input().split()))\nd = {1:\"1/6\", 2:\"1/3\", 3:\"1/2\", 4:\"2/3\", 5:\"5/6\", 6:\"1/1\"}\nprint(d[w])\n\n", "import math\r\ny, w = map(int, input().split())\r\nc = 7 - max(y, w)\r\ng = math.gcd(c, 6)\r\nprint(f'{c//g}/{6//g}')", "y, w = (int(n) for n in input().split())\n\nd = 7 - max(y, w)\nx = str(d) + '/6'\n\nif d == 0:\n x = '0/1'\nelif d == 2:\n x = '1/3'\nelif d == 3:\n x = '1/2'\nelif d == 4:\n x = '2/3'\nelif d == 6:\n x = '1/1'\n\nprint(x)\n\n \t\t \t \t\t\t\t\t \t \t \t\t\t\t \t\t \t\t\t", "yakko_points, wakko_points = map(int, input().split())\nhigher_points_amount = yakko_points if yakko_points > wakko_points else wakko_points\nnumerator = 6 - higher_points_amount + 1\ndenominator = 6\nif numerator % 2 == 0:\n numerator //= 2\n denominator //= 2\nif numerator % 3 == 0:\n numerator //= 3\n denominator //= 3\nprint(f'{numerator}/{denominator}')\n", "a,b = map(int,input().split()) ; c = 7-(max(a,b)) ; d = (str(c)+'/'+str(6)) \r\nif d == '3/6': print('1/2')\r\nelif d == '2/6': print('1/3')\r\nelif d == '4/6': print('2/3')\r\nelif d == '5/6': print('5/6')\r\nelif d == '6/6': print('1/1')\r\nelif d == '1/6': print('1/6')", "from sys import stdin,stdout\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\na,b=listInput()\r\nc = max(a,b)\r\na= 6-c+1\r\ng=gcd(a,6)\r\nprint(\"%d/%d\"%(a//g,6//g))", "# http://codeforces.com/contest/9/problem/A\r\n\r\nx, y = list(map(int, input().split()))\r\n\r\nnum, den = 7 - max(x, y), 6\r\ngcd = lambda m, n: m if not n else gcd(n, m % n)\r\n\r\ndiv = gcd(num, den)\r\nprint(str(num // div) + '/' + str(den // div))", "rolls = list(map(int, input().split()))\r\nhighest = max(rolls)\r\n\r\nfraction = [0, 6]\r\nfraction[0] = 6 - highest + 1\r\n\r\nfrom fractions import Fraction\r\nresult = str(Fraction(fraction[0], fraction[1]))\r\n\r\nif result == '1':\r\n print(\"1/1\")\r\nelse:\r\n print(result)\r\n", "def gcd(a, b):\r\n while b != 0:\r\n a, b = b, a % b\r\n return a\r\n\r\n\r\na, b = map(int, input().split())\r\nans = 6 - max(a, b) + 1\r\ng = gcd(ans, 6)\r\nprint(ans // g, '/', 6 // g, sep='')\n# Sat Jul 24 2021 11:36:40 GMT+0300 (Москва, стандартное время)\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\ny, w = invr()\r\nx = max(y,w)\r\nx = 7 - x\r\nif x == 1:\r\n print(\"1/6\")\r\nelif x == 2:\r\n print(\"1/3\")\r\nelif x == 3:\r\n print(\"1/2\")\r\nelif x == 4:\r\n print(\"2/3\")\r\nelif x == 5:\r\n print(\"5/6\")\r\nelif x == 6:\r\n print(\"1/1\")", "y,w = map(int,input().split())\r\ny = max(y,w)\r\nhm={0:\"0/1\",1:\"1/6\",2:\"1/3\",3:\"1/2\",4:\"2/3\",5:\"5/6\",6:\"1/1\"}\r\nprint(hm[6-y+1])", "def DieRoll():\r\n others=list(map(int,input().split()))\r\n maxOthers=max(others)\r\n NumbersToGet=6-maxOthers+1\r\n if NumbersToGet==1:\r\n return '1/6'\r\n elif NumbersToGet==2:\r\n return '1/3'\r\n elif NumbersToGet==3:\r\n return '1/2'\r\n elif NumbersToGet==4:\r\n return '2/3'\r\n elif NumbersToGet==5:\r\n return '5/6'\r\n elif NumbersToGet==6:\r\n return '1/1'\r\nprint(DieRoll())", "def func (a, b):\n if (b == 0):\n return a\n return func(b, a%b)\n\ny, w = map(int, input().split())\na = 7 - max(y, w)\nb = 6\nc = func(a,b)\na /= c\nb /= c\n\nprint(\"%d/%d\"%(a, b))\n \t\t \t\t \t\t \t \t \t\t \t\t \t \t \t", "y,w=map(int,input().split())\nmx=max(y,w)\na,b=0,0\nmx=6-mx+1\nif(mx==0):\n a=0\n b=1\nelif(mx==1):\n a=1\n b=6\nelif(mx==2):\n a=1\n b=3\nelif(mx==3):\n a=1\n b=2\nelif(mx==4):\n a=2\n b=3\nelif(mx==5):\n a=5\n b=6\nelse:\n a,b=1,1\nprint(a,end='')\nprint( '/' , end='')\nprint(b)\n \t\t \t \t \t\t\t\t\t \t \t \t \t\t", "'''\r\nt=int(input())\r\nans=[]\r\nfor _ in range(t):\r\n a,b,c=map(int,input().split())\r\n if c>b:\r\n d=2*(c-b)+b-1\r\n else:d=b-1\r\n a-=1\r\n if a>d:ans.append(2)\r\n elif a==d:ans.append(3)\r\n else:ans.append(1)\r\nprint(*ans,sep='\\n')'''\r\nimport math\r\na=6-max(map(int,input().split()))+1\r\nb=math.gcd(a,6)\r\nprint('{}/{}'.format(a//b,6//b))\r\n\r\n", "# cook your dish here\r\ny,w = map(int,input().split())\r\nif y>w:\r\n res = y\r\nelse:\r\n res = w\r\nres = (6-res) + 1\r\nl = [\"0/1\",\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(l[res])", "from posixpath import split\r\n\r\n\r\nlst=map(int,input().split())\r\nmax=max(lst)-1\r\nnum=6-max\r\nif 6%num==0:\r\n den=int(6/num)\r\n num=1\r\nelif 6%num==2:\r\n den=3\r\n num=2\r\nelse:\r\n den=6\r\n num=5\r\nprint(\"{}/{}\".format(num,den))\r\n", "y,w = [int(x) for x in input().split()]\r\nimport math\r\ndice = [1,2,3,4,5,6]\r\nx = dice.index(max(y,w))\r\nnew = dice[x:]\r\ni = len(new)\r\nif i==6:\r\n print(\"1/1\")\r\nelif i==0:\r\n print(\"0/1\")\r\nelse:\r\n g = math.gcd(i,6)\r\n print(\"{}/{}\".format(str(i//g),str(6//g)))\r\n", "n1, n2 = map(int, input().split())\r\n\r\nm = max(n1, n2)\r\nchislitel = 7-m\r\nznam = 6\r\nif chislitel%2 == 0:\r\n chislitel = chislitel//2\r\n znam = znam//2\r\nif chislitel%3 == 0:\r\n chislitel = chislitel//3\r\n znam = znam//3\r\nprint(chislitel, znam, sep='/')\r\n", "from fractions import gcd\r\nn,m=map(int,input().split())\r\n\r\nnum=6-max(n,m)+1\r\nden=6\r\ng=gcd(num,den)\r\n\r\nprint(str(num//g)+'/'+str(den//g))\r\n", "a, b = map(int, input().split(' '))\r\n\r\na = max(a, b)\r\n\r\nif a == 1:\r\n a = '1/1'\r\nelif a == 2:\r\n a = '5/6'\r\nelif a == 3:\r\n a = '2/3'\r\nelif a == 4:\r\n a = '1/2'\r\nelif a == 5:\r\n a = '1/3'\r\nelif a == 6:\r\n a = '1/6'\r\n\r\nprint(a)\r\n", "from fractions import Fraction\r\n\r\n\r\ny, w = [int(i) for i in input().split()]\r\nm = max(y, w)\r\nanswer = Fraction(7 - m, 6)\r\nif answer == 1:\r\n print('1/1')\r\nelse:\r\n print(answer)\r\n", "a,b = map(int, input().split())\r\nn = 6-max([a,b]) + 1\r\nif 6 % n == 0:\r\n print(f\"1/{6//n}\")\r\nelif n % 2 == 0:\r\n print(f\"{n//2}/{6//2}\")\r\nelse:\r\n print(f\"{n}/6\")\r\n", "[Y,W] = map(int, input().split())\r\nc = max(Y,W)\r\nmsgs = [\"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\"]\r\nprint (msgs[c-1])", "\r\ndef GCD(a, b):\r\n if b == 0:\r\n return a\r\n return GCD(b, a % b)\r\n\r\n\r\n\r\n\r\ny, w = [int(item) for item in input().split()]\r\n# maximum = y if y>w else w\r\nmaximum = max(y, w)\r\ndotChances = 6 - maximum + 1\r\ntemp = GCD(dotChances, 6)\r\nprint('{}/{}'.format(dotChances // temp, 6 // temp))\r\n", "y,w = list(map(int,input().split()))\r\nc = 6 - max(y,w)\r\nif c == 0:\r\n print('1/6')\r\nelif c == 1:\r\n print('1/3')\r\nelif c==2:\r\n print('1/2')\r\nelif c==3:\r\n print('2/3')\r\nelif c==4:\r\n print('5/6')\r\nelse:\r\n print('1/1')", "\r\nfrom fractions import Fraction\r\n\r\nls=list(map(int ,input().split()))\r\nu=max(ls)\r\nx=list(range(u,7))\r\n\r\nif(abs(len(x)/6)==0.5):\r\n print('1/2')\r\nelif(abs(len(x)/6)==1):\r\n print('1/1')\r\nelif(abs(len(x)/6)==0):\r\n print('0/1')\r\nelse:\r\n print(Fraction(len(x),6))", "nm=input().split()\r\nn=int(nm[0])\r\nm=int(nm[1])\r\nm=max(n,m)\r\nm-=1\r\nm=6-m\r\nsix=6\r\nif m%2==0 :\r\n m/=2\r\n six/=2\r\nif m%3==0 :\r\n m/=3\r\n six/=3\r\nprint(str(int(m))+\"/\"+str(int(six)))", "import math\r\ny,w = map(int, input().split())\r\nnu = (6 - max(y, w) + 1)\r\nden = 6\r\ng = math.gcd(nu,den)\r\nnu = nu // g\r\nden = den // g\r\ns = str(nu)+'/'+str(den)\r\nprint(s)", "import sys\n\n\nclass DieRoll:\n def cal(self,ya, wakko):\n rem = 6 - max(ya,wakko) + 1\n if rem == 6:\n return \"1/1\"\n elif rem == 5:\n return \"5/6\"\n elif rem == 4:\n return \"2/3\"\n elif rem == 3:\n return \"1/2\"\n elif rem == 2:\n return \"1/3\"\n elif rem == 1:\n return \"1/6\"\n else:\n return \"0/1\"\n\ndef main():\n x,y = [int(z) for z in sys.stdin.readline().split()]\n print(DieRoll.cal(DieRoll,x,y))\n\n\nif __name__ == (\"__main__\"):\n main()\n", "Y,W = map(int,input().split())\r\nm = max(Y,W)\r\nif m==1:\r\n print ('1/1')\r\nelif m==2:\r\n print ('5/6')\r\nelif m==3:\r\n print ('2/3')\r\nelif m==4:\r\n print ('1/2')\r\nelif m==5:\r\n print ('1/3')\r\nelse:\r\n print ('1/6')\r\n\r\n\r\n\r\n", "f={1:'1/6',2:'1/3',3:'1/2',4:'2/3',5:'5/6',6:'1/1'}\r\na=list(map(int,input().split()))\r\nprint(f[7-max(a)])", "y,w = map(int , input().split())\r\np = ((6 - max(y,w))+1)\r\nap = 6\r\n\r\nwhile p % 2 ==0 and ap % 2 == 0:\r\n p /= 2\r\n ap /= 2\r\n\r\nwhile p % 3 ==0 and ap % 3 == 0:\r\n p /= 3\r\n ap /= 3\r\n\r\nprint(str(int(p)) + \"/\" + str(int(ap)))\r\n \r\n\r\n", "def res(n):\n if n == 1 :\n return \"1/6\"\n if n == 2 :\n return \"1/3\"\n if n == 3 :\n return \"1/2\"\n if n == 4 :\n return \"2/3\"\n if n == 5 :\n return \"5/6\"\n if n == 6 :\n return \"1/1\"\n\ny,w = map(int,input().split())\n\nprint(res(7-max(y,w)))", "import math\r\na , b = map( int, input().strip().split(' ') )\r\nx = 7 - max(a,b)\r\ny = math.gcd(x, 6)\r\nprint('{}/{}'.format(x//y, 6//y))", "x, y = map(int, input().split())\r\n\r\na = max(x, y)\r\n\r\nif a ==1:\r\n print(\"1/1\")\r\nelif a ==2:\r\n print(\"5/6\")\r\nelif a ==3:\r\n print(\"2/3\")\r\nelif a ==4:\r\n print(\"1/2\")\r\nelif a ==5:\r\n print(\"1/3\")\r\nelif a ==6:\r\n print(\"1/6\")\r\n ", "a,b = [int(i) for i in input().split()]\r\nc = max(a,b)\r\nif(c==1):print(\"1/1\")\r\nelif(c==2):print(\"5/6\")\r\nelif(c==3):print(\"2/3\")\r\nelif(c==4):print(\"1/2\")\r\nelif(c==5):print(\"1/3\")\r\nelse:print(\"1/6\")", "y, w = map(int, input().split())\r\nu = max(y, w)\r\nanswers = {\r\n 1: '1/1',\r\n 2: '5/6',\r\n 3: '2/3',\r\n 4: '1/2',\r\n 5: '1/3',\r\n 6: '1/6',\r\n}\r\nprint(answers[u])\r\n", "from sys import stdin,stdout\r\nimport math, bisect, heapq\r\nfrom collections import Counter, deque, defaultdict\r\nL = lambda: list(map(int, stdin.readline().strip().split()))\r\nI = lambda: int(stdin.readline().strip())\r\nS = lambda: stdin.readline().strip()\r\nC = lambda: stdin.readline().strip().split()\r\ndef pr(a): print(\" \".join(list(map(str, a))))\r\n#_________________________________________________#\r\n\r\n\r\ndef solve():\r\n a,b = L()\r\n c = ['1/1','5/6','2/3','1/2','1/3','1/6']\r\n print(c[max(a,b)-1])\r\n \r\nfor _ in range(1):\r\n solve()\r\n", "a = input().split(' ')\r\nb = max(int(a[0]),int(a[1]))\r\nc = 7-b\r\nfor i in range(6,0,-1):\r\n if c%i == 0 and 6%i == 0:\r\n print('{}/{}'.format(int(c/i),int(6/i)))\r\n break", "y,w=map(int,input().split())\r\np=max(y,w)\r\ndic={1:'1/1',2:'5/6',3:'2/3',4:'1/2',5:'1/3',6:'1/6'}\r\nprint(dic[p])", "y,w=list(map(int,input().split()))\r\ntotal=6\r\nmaximum=max(y,w)\r\nans=(total-maximum)+1\r\nif ans==2:\r\n print('1/3')\r\n\r\nelif ans==6:\r\n print('1/1')\r\nelif ans==0:\r\n print('1/1')\r\nelif ans==1:\r\n print('1/6')\r\nelif ans==3:\r\n print('1/2')\r\nelif ans==4:\r\n print('2/3')\r\nelse:\r\n print('5/6')\r\n \r\n", "import math\r\n\r\ndef die_roll(Y, W):\r\n max_val = max(Y, W)\r\n dice_roll_max = 7\r\n win_events = dice_roll_max - max_val\r\n gcd_val = math.gcd(win_events, 6)\r\n return (dice_roll_max-max_val) // gcd_val, 6 // gcd_val\r\n\r\nif __name__ == \"__main__\":\r\n dice_rolls = [int(val) for val in input().split(\" \")]\r\n Y, W = dice_rolls[0], dice_rolls[1]\r\n num, den = die_roll(Y, W)\r\n print(f\"{num}/{den}\")", "import fractions\r\nmaximum = max(map(int, input().split()))\r\nnumerator = 6 - maximum + 1\r\nchance = fractions.Fraction(numerator, 6)\r\nprint(str(chance.numerator) + \"/\" + str(chance.denominator))\r\n", "s = input()\r\ny = s[0]\r\nw = s[2]\r\nif int(y) > int(w):\r\n p = 7 - int(y)\r\nelse:\r\n p = 7 - int(w)\r\nif p == 1:\r\n print('1/6')\r\nif p == 2:\r\n print('1/3')\r\nif p == 3:\r\n print('1/2')\r\nif p == 4:\r\n print('2/3')\r\nif p == 5:\r\n print('5/6')\r\nif p == 6:\r\n print('1/1')", "y, w = map(int, input().split())\r\nm = max(y, w)\r\nc = [i for i in range(m, 7)]\r\nn = len(c)\r\nif n==0:\r\n print(\"0/1\")\r\nelif n==6:\r\n print(\"1/1\")\r\nelse:\r\n z = 1\r\n for i in range(1, 6):\r\n if n%i==0 and 6%i==0:\r\n z = i \r\n print(n//z, end=\"\")\r\n print(\"/\", end=\"\")\r\n print(6//z)", "# LUOGU_RID: 101435532\nfrom fractions import Fraction\r\nx, y = map(int, input().split())\r\nans = Fraction(7 - max(x, y), 6)\r\nprint('0/1' if ans == 0 else '1/1' if ans == 1 else ans)", "\r\nx = list(map(int, input(). split()))\r\n\r\na, b = x[0], x[1]\r\n\r\nmax = max(a, b)\r\n\r\ndesired_results = (7-max)\r\ntotal_results = 6\r\n\r\nfor i in range(6):\r\n if i!= 0 and desired_results%i == 0 and total_results%i == 0 :\r\n desired_results = desired_results/i \r\n total_results = total_results/i\r\n \r\nprob = str(int(desired_results)) + \"/\" + str(int(total_results))\r\nprint(prob)", "import math\r\n\r\nmx = 6 - (max([int(x) for x in input().split()]) - 1)\r\ngcdd = math.gcd(mx , 6)\r\nprint(f\"{mx//gcdd}/{6//gcdd}\")", "Y, W = [int(x) for x in input().split()]\n\nD = 6 - max(Y, W)\nif D == 0:\n print(\"1/6\")\nelif D == 1:\n print(\"1/3\")\nelif D == 2:\n print(\"1/2\")\nelif D == 3:\n print(\"2/3\")\nelif D == 4:\n print(\"5/6\")\nelif D == 5:\n print(\"1/1\")\n \t \t\t\t\t\t \t\t\t\t \t\t\t\t", "# OM Namah Shivai\r\n# Jai Hanuman\r\n# Jai Shree Ram\r\n# Jai Shree Krishna\r\n# Jai Maa kali\r\n# Jai Maa Durga\r\n# Radha-Krishna\r\n# OM Namah Shivai\r\n# Jai Hanuman\r\n# Jai Shree Ram\r\n# Jai Shree Krishna\r\n# Jai Maa kali\r\n# Jai Maa Durga\r\n# Radha-Krishna\r\nimport math\r\ny,w = map(int, input().split())\r\nnum = 6-max(y,w)+1\r\nden = 6\r\ngcd = math.gcd(num,den)\r\nnum = num//gcd\r\nden = den//gcd\r\nprint(str(num)+\"/\"+str(den))\r\n\r\n\r\n", "import math\r\nm = max(map(int, input().split()))\r\nm = 7 - m\r\ng = math.gcd(m, 6)\r\nprint(str(m//g)+\"/\"+str(6//g))\r\n", "from fractions import Fraction\r\n\r\na, b = map(int, input().split())\r\nm = max(a, b)\r\nnum = 6 - m + 1\r\nfrac = Fraction(num / 6).limit_denominator()\r\nprint(f\"{frac.numerator}/{frac.denominator}\")\r\n", "ways = ['1/6','1/3','1/2','2/3','5/6','1/1']\r\ny,w = input().split()\r\ny,w = int(y),int(w) \r\nmaxi = max(y,w)\r\nprint(ways[6-maxi])", "\n\n\n\n# Press the green button in the gutter to run the script.\nfrom builtins import input, print\nimport collections\nfrom fractions import Fraction\nfrom math import gcd\n\nif __name__ == '__main__':\n values_dice = list(map(int, input().split(\" \")))\n # print(values_dice)\n bigger_value = max(values_dice)\n counter = 0\n result = 0\n for i in range(7):\n if(i >= bigger_value):\n counter += 1\n # if(counter == 1 ):\n # result = '1/1'\n # print(result)\n if(counter == 6):\n result = '1/1'\n print(result)\n else:\n result = Fraction(str(counter) + \"/\" + str(6))\n print(result)\n\n\n\n\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "import math\r\ns = input().split()\r\n\r\ns = list(map(int, s))\r\ns = [ i for i in [1,2,3,4,5,6] if i >= max(s)]\r\n_gcd = math.gcd(len(s), 6)\r\nprint(f'{len(s)//_gcd}/{6//_gcd}')\r\n\r\n", "import math\r\na, b = map(int, input().split())\r\na = 6 - max(a, b) + 1\r\nb = math.gcd(6, a);\r\nprint(str(a // b) + '/' + str(6 // b)) \r\n\n# Sat Apr 16 2022 15:50:05 GMT+0000 (Coordinated Universal Time)\n", "n,m = map(int,input().split())\r\ndef gcd(x,y):\r\n if x % y == 0:\r\n return y\r\n else:\r\n return gcd(y,x%y)\r\nk = 6-max(n,m)+1\r\nprint(\"%d/%d\" % (k//gcd(6,k),6//gcd(6,k)))", "y, w = map(int, input().split())\r\ncount = 0\r\n\r\nvalue = [1,2,3,4,5,6]\r\n\r\nfor i in value:\r\n if i>=y and i>=w:\r\n count+=1\r\nif count==0:\r\n print('0/1')\r\nelif count==1:\r\n print('1/6')\r\nelif count==2:\r\n print('1/3')\r\nelif count==3:\r\n print('1/2')\r\nelif count==4:\r\n print('2/3')\r\nelif count==5:\r\n print('5/6')\r\nelif count==6:\r\n print('1/1')\r\n", "import math\r\nimport string\r\n\r\nnum1, num2 = map(int, input().split())\r\nval = max(num1, num2)\r\nif val == 1:\r\n print(\"1/1\")\r\nelif val == 2:\r\n print(\"5/6\")\r\nelif val == 3:\r\n print(\"2/3\")\r\nelif val == 4:\r\n print(\"1/2\")\r\nelif val == 5:\r\n print(\"1/3\")\r\nelif val == 6:\r\n print(\"1/6\")\r\n\r\n# num1, num2 = map(int, input().split()) >>> To Read Whole Input In Same Line\r\n# String[::-1] ===>>> Reverse String\r\n# -----------------------------------------\r\n# print(\"Hello world!\", end = ' ') >>> Print in same line\r\n# print(\"It's me.\")\r\n# ------------------------------------------\r\n# print(\"{:.2f}\".format(Sum)) >>> Format Float OutPut\r\n", "x=input().split()\r\nl1=list(map(int,x))\r\nl1.sort()\r\nupp=l1[1]\r\ndotre=6-upp+1\r\n\r\nGCD=\"no\"\r\nsmall=dotre\r\nwhile small>=1:\r\n if dotre%small==0 and 6%small==0:\r\n GCD=str(small)\r\n break\r\n small-=1\r\n \r\nif GCD.isdigit():\r\n print(str(int(dotre/small))+\"/\"+str(int(6/small)))\r\nelse:\r\n print(str(int(dotre))+\"/\"+str(int(6)))\r\n \r\n\r\n", "from sys import stdin, stdout\n\ndef main():\n m = max([int(i) for i in stdin.readline().split()])\n p = 6-m+1\n if p == 0:\n stdout.write(\"0/1\")\n elif p == 2:\n stdout.write(\"1/3\")\n elif p == 3:\n stdout.write(\"1/2\")\n elif p == 4:\n stdout.write(\"2/3\")\n elif p == 6:\n stdout.write(\"1/1\")\n else:\n stdout.write(str(p)+\"/6\")\n\nif __name__ == '__main__':\n main()\n", "from fractions import Fraction\r\n\r\nw,y = map(int,input().split())\r\n\r\noutput = 7 - max(w,y)\r\noutput = Fraction(output,6)\r\n\r\nif output == 1:\r\n\toutput = '1/1'\r\n\r\nprint(output)\r\n", "def hcf(a,b):\r\n r=a%b\r\n while r>0:\r\n a=b\r\n b=r\r\n r=a%b\r\n return b\r\n\r\nx,y=map(int,input().split())\r\nm,c=max(x,y),0\r\nfor i in range(m,7):\r\n if i>=m:\r\n c+=1\r\nif c==0:\r\n print(0)\r\nelse:\r\n h=hcf(6,c)\r\n num,den=c//h,6//h\r\n print(f'{num}/{den}')\r\n ", "from fractions import Fraction\r\na,b=map(int,input().split())\r\nmaxi=max(a,b)\r\np=((6-maxi)+1)\r\nif(p==6):\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(p,6))\r\n ", "def gcd(a):\r\n if a % 6 == 0:\r\n return 6\r\n if a % 3 == 0:\r\n return 3\r\n if a % 2 == 0:\r\n return 2\r\n return 1\r\na, b = map(int, input().split())\r\nc = 6 - max(b, a) + 1\r\nans = gcd(c)\r\nprint(c // ans, 6 // ans, sep = \"/\")", "import math\r\n\r\ny, w = map(int, input().split())\r\ndot = 6 - max(y, w) + 1\r\ngcd = math.gcd(dot, 6)\r\nprint(f\"{dot // gcd}/{6 // gcd}\")\r\n", "from fractions import gcd\r\nc = 7 - max(map(int,input().split()))\r\ng = gcd(c, 6)\r\nprint(str(c // g) + '/' + str(6 // g))\r\n", "a,b = [int(i) for i in input().split()]\nm = max(a,b)\nif m == 1:\n print('1/1')\nelif m==2:\n print('5/6')\nelif m==3:\n print('2/3')\nelif m==4:\n print('1/2')\nelif m==5:\n print('1/3')\nelse:\n print('1/6')", "z = input().split()\r\nz = [int(r) for r in z]\r\nmaximum = max(z[0], z[1])\r\nif maximum == 1:\r\n print(\"1/1\")\r\nelif maximum == 2:\r\n print(\"5/6\")\r\nelif maximum == 3:\r\n print(\"2/3\")\r\nelif maximum == 4:\r\n print(\"1/2\")\r\nelif maximum == 5:\r\n print(\"1/3\")\r\nelif maximum == 6:\r\n print(\"1/6\")\r\n\r\n\r\n\r\n", "a, b = map(int, input().split())\r\ngreater = max(a, b)\r\n\r\ndice = [\"1/6\", \"1/3\", \"1/2\", \"2/3\", \"5/6\", \"1/1\"]\r\ni = 6 - greater\r\nprint(dice[i])", "from fractions import gcd\r\na=6-max(map(int,input().split()))+1\r\nprint(int(a/gcd(a,6)),int(6/(gcd(a,6))),sep='/')", "z= ['1/1','5/6','2/3','1/2','1/3','1/6']\r\nr = list(map(int, input().split()))\r\ns = max(r)\r\nk = z[s-1]\r\nprint(k)\r\n\r\n", "from math import gcd\r\nm = max(map(int, input().split()))\r\nn = 7 - m\r\nprint(n // gcd(n,6), \"/\", 6 // gcd(n,6), sep = \"\")", "y,w=map(int,input().split())\r\nm=max(y,w)\r\np=['1/1','5/6','2/3','1/2','1/3','1/6']\r\nprint(p[m-1])", "print([\"0/1\",\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"][7-max(map(int,input().split()))])\r\n", "a,b=map(int,input().split())\r\nk=6-max(a,b)+1\r\nif k==1:\r\n print(\"1/6\")\r\nelif k==2:\r\n print(\"1/3\")\r\nelif k==3:\r\n print(\"1/2\")\r\nelif k==4:\r\n print(\"2/3\")\r\nelif k==5:\r\n print(\"5/6\")\r\nelse:\r\n print(\"1/1\")", "y, w = map(int, input().split())\r\na = 7 - max(y, w)\r\nb = 6\r\nif a == 0:\r\n b = 1\r\nif b % a == 0:\r\n b //= a\r\n a //= a\r\nif a % 2 == 0 and b % 2 == 0:\r\n b //= 2\r\n a //= 2\r\nif a % 3 == 0 and b % 3 == 0:\r\n b //= 3\r\n a //= 3\r\nif a % 6 == 0 and b % 6 == 0:\r\n b //= 6\r\n a //= 6\r\nprint(str(a) + '/' + str(b))", "def fraction(a,b):\r\n\r\n\r\n i=2\r\n if a<b:\r\n while(i<=a):\r\n if a%i==0 and b%i==0:\r\n a=a//i\r\n b=b//i\r\n else:\r\n i=i+1\r\n elif b>a:\r\n while (i <= b):\r\n if a % i == 0 and b % i == 0:\r\n a = b // i\r\n b = b // i\r\n else:\r\n i = i + 1\r\n elif a==b:\r\n a=a//b\r\n b =a\r\n\r\n print(str(a)+'/'+str(b))\r\n\r\n\r\nx,y=map(int, input().split() )\r\n\r\nif x <=6 and y<=6 :\r\n if x>y :\r\n z=x\r\n elif y>x:\r\n z=y\r\n else:\r\n z=x\r\n d=(6-z)+1\r\n fraction(d,6)\r\n", "a,b=map(float,(input().split()))\r\nans=0.0\r\nfor i in range(1,7):\r\n if i>=a and i>=b:\r\n ans+=1\r\ns=ans/6\r\nif s == 1 / 2:\r\n print (\"1/2\")\r\nelif s == 1 / 6:\r\n print(\"1/6\")\r\nelif s == 1:\r\n print(\"1/1\")\r\nelif s == 5 / 6: \r\n print(\"5/6\")\r\nelif s == 1 / 3: \r\n print(\"1/3\")\r\nelse:\r\n print(\"2/3\")\r\n\r\n\r\n", "# Hydro submission #64575a778b6b0f8909f46db6@1683446392661\ndef f(x,y):\n if x >= y:\n if x%y == 0:\n return y\n else:\n return f(x%y,y)\n else:\n if y%x == 0:\n return x\n else:\n return f(x,y%x)\nl = input().split()\na,b = int(l[0]),int(l[1])\nc = 7-max(a,b)\nprint(str(c//f(c,6)) + '/' + str(6//f(c,6)))", "print('111251//////632361'[6-max(map(int,input().split()))::6])", "def gcd(a, b):\r\n while a * b:\r\n a %= b\r\n if a:\r\n b %= a\r\n return a + b\r\n\r\n\r\nx, y = map(int, input().split())\r\na1 = 6 - max(x - 1, y - 1)\r\nprint(f\"{a1 // gcd(a1, 6)}/{6 // gcd(a1, 6)}\")\r\n\n# Sat Aug 20 2022 07:56:26 GMT+0000 (Coordinated Universal Time)\n", "import re\n\nin1 = [int(x) for x in re.split(\"\\\\s\", input())]\n\ntemp = 6-(max(in1[0], in1[1])-1)\n\nif temp == 1:\n print(\"1/6\")\nif temp == 2:\n print(\"1/3\")\nif temp == 3:\n print(\"1/2\")\nif temp == 4:\n print(\"2/3\")\nif temp == 5:\n print(\"5/6\")\nif temp == 6:\n print(\"1/1\")\n \t\t \t \t\t \t \t \t\t\t\t\t \t \t\t", "y,w=input().split()\r\ny,w=int(y),int(w)\r\ndie=[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nx=max(y,w)\r\nprint(die[6-x])\r\n", "import math\r\na=list(map(int,input().split()))\r\nt=6-(max(a[0],a[1])-1)\r\nprint((str(int(t/math.gcd(t,6))))+\"/\"+str(int(6/math.gcd(6,t))))", "y, w = map(int,input().split())\n\nv = max(y,w)\n\nif v == 1: \n print('1/1')\nelif v == 2: \n print('5/6')\nelif v == 3:\n print('2/3')\nelif v == 4:\n print('1/2')\nelif v == 5:\n print('1/3')\nelse: \n print('1/6')", "import math\r\na,b=map(int,input().split())\r\nm=max(a,b)\r\nr=6-m+1\r\n#print(r)\r\nlcm=math.gcd(r,6)\r\n#print(lcm)\r\nn=int(r/lcm)\r\nd=int(6/lcm)\r\nprint(str(n)+'/'+str(d))\r\n", "#!/usr/bin/env python3\n# coding:utf-8\n\nif __name__ == \"__main__\":\n Y, W = [int(item) for item in input().split(\" \")]\n m = 6 - max(Y, W) + 1\n if m == 1:\n print(\"1/6\")\n elif m == 2:\n print(\"1/3\")\n elif m == 3:\n print(\"1/2\")\n elif m == 4:\n print(\"2/3\")\n elif m == 5:\n print(\"5/6\")\n else:\n print(\"1/1\")\n", "import math\na,b=map(int,input().split())\n\nc=6-max(a,b)+1\nn=math.gcd(c,6)\nif(n==1):\n\tprint(str(int((c)))+\"/\"+\"6\")\nelse:\n\tprint(str(int(c/n))+\"/\"+str(int(6/n)))\n\n", "a, b = [int(i) for i in input().split()]\r\n\r\nf = 7 - max(a, b)\r\nd = {3: '1/2', 2: '1/3', 1: '1/6', 4: '2/3', 6: '1/1', 5: '5/6'}\r\nprint(d[f])", "print(['1/1', '5/6', '2/3', '1/2', '1/3', '1/6'][int(max(input().split()))-1])", "n,p = map(int,input().split())\r\n\r\n\r\ndef gcd(a, b): \r\n if a == 0 : \r\n return b \r\n \r\n return gcd(b%a, a) \r\n\r\nnom = (7-max(n,p))\r\ng = gcd(nom,6)\r\nprint(nom//g,end=\"\")\r\nprint(\"/\",end=\"\")\r\nprint(6//g)\r\n \r\n", "def die_roll(y, w):\r\n d = 6 - max(y, w) + 1\r\n if d == 6:\r\n resp = \"1/1\"\r\n elif d == 3:\r\n resp = \"1/2\"\r\n elif d % 2 == 0:\r\n resp = str(d // 2) + \"/3\"\r\n else:\r\n resp = str(d) + \"/6\"\r\n return resp\r\n\r\n\r\ny, w = list(map(int, input().strip().split()))\r\nprint(die_roll(y, w))", "a = 6 - max(map(int, input().split())) + 1\r\ns = 6\r\nif a % 2 == 0:\r\n a //= 2\r\n s //= 2\r\nif a % 3 == 0:\r\n a //= 3\r\n s //= 3\r\nprint(str(a) + '/' + str(s))\n# Sat Apr 16 2022 15:47:45 GMT+0000 (Coordinated Universal Time)\n", "# import numpy as np\n\ndef solution():\n numbers = array_to_int(input().split(\" \"))\n max = numbers[0] if numbers[0] > numbers[1] else numbers[1]\n print(to_mixed_frac((6 - max + 1), 6))\n\n\ndef to_mixed_frac(first, second):\n while True:\n for i in range(2, first+1):\n if first % i == 0 and second % i == 0:\n first //= i\n second //= i\n break\n else:\n break\n return str(first) + \"/\" + str(second)\n\n\ndef array_to_int(array):\n for i in range(len(array)):\n array[i] = int(array[i])\n return array\n\n\ndef join0(array):\n result = \"\"\n for i in array:\n result += str(i)\n return result\n\n\nsolution()\n# input-output by console\n", "import fractions\r\nif __name__ == '__main__':\r\n dic = {1:'1/6', 2:'1/3', 3:'1/2', 4:'2/3', 5:'5/6', 6:'1/1'}\r\n q = input().split(\" \")\r\n x = int(q[0])\r\n y = int(q[1])\r\n max = max(x, y)\r\n l = [1, 2, 3, 4, 5, 6]\r\n counter = 0\r\n for i in range(l.index(max), len(l)):\r\n counter += 1\r\n print(dic[counter])", "#Author: Bhumi Patel\n\ns = list(map(int , input().split()))\n\nY = s[0]\nW = s[1]\n\na = max(Y,W)\n\nif a == 1:\n print(\"1/1\")\n \nelif a == 2:\n print(\"5/6\")\n \n \nelif a == 3:\n print(\"2/3\")\n \n \nelif a == 4:\n print(\"1/2\")\n \n \nelif a == 5:\n print(\"1/3\")\n \n \nelse:\n print(\"1/6\")\n \t \t \t \t \t\t \t \t\t\t \t\t \t \t\t", "x = list(map(int, input().split(\" \")))\r\ny=max(x[0],x[1])\r\ndiff = 6-y\r\narr=[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(arr[6-y])", "import math\r\n\r\na,b = [int(i) for i in input().split()]\r\n#As possibilidades são tirar o maior ou todos os maiores que ele e menores ou iguais a 6\r\nans = 6 - max(a,b) + 1\r\n\r\ngc = math.gcd(6,ans)\r\n\r\np = 6//gc\r\nq = ans//gc\r\n\r\nif q != p:\r\n print(str(q)+\"/\"+str(p))\r\nelse:\r\n print(\"1/1\")", "l1=[int(i) for i in input().split()][:2]\nl1.sort()\n\nif l1[1] == 1:\n print(\"1/1\")\nelif l1[1] == 2:\n print(\"5/6\")\nelif l1[1] == 3:\n print(\"2/3\")\nelif l1[1] == 4:\n print(\"1/2\")\nelif l1[1] == 5:\n print(\"1/3\")\nelif l1[1] == 6:\n print(\"1/6\")\n\n", "from fractions import Fraction\r\nuser= input('').split(' ')\r\ny = int(user[0])\r\nw = int(user[1])\r\nmaximum = max(y,w)\r\n\r\nlob = ((6 - maximum)+1)\r\nhor = 6\r\nif lob == 6:\r\n ans = ('1/1')\r\nelif lob == 0:\r\n ans = ('0/1')\r\nelse:\r\n ans = Fraction(lob,hor)\r\nprint(ans)", "p=max(list(map(int,input().split())))\r\nnum=7-p\r\nden=6\r\ni=2\r\nfor i in [2,3]:\r\n if num%i==0 and den%i==0:\r\n num=num//i\r\n den=den//i\r\n\r\nprint('{}/{}'.format(num,den))\r\n \r\n", "y, w = map(int,input().split())\n\nnumerator = 6-max(y,w)+1\ndenominator = 6\ni = numerator\nwhile i > 1:\n if numerator%i==0 and denominator%i==0:\n numerator//=i\n denominator//=i\n i = numerator\n continue\n i-=1\n\nprint(\"{0}/{1}\".format(numerator,denominator))", "I=[int(i) for i in input().split()]\r\ny, w = I[0], I[1]\r\nm=int(max(y,w))\r\np=7-m\r\nq=6\r\nif p%2==0 and q%2==0:\r\n p=int(p/2)\r\n q=int(q/2)\r\nif p%3==0 and q%3==0:\r\n p=int(p/3)\r\n q=int(q/3)\r\nprint(str(p)+'/'+str(q))", "w,y=input().split()\r\nw=int(w)\r\ny=int(y)\r\ndef greatest(a,b):\r\n if a>=b:\r\n return a\r\n else:\r\n return b\r\np=7-greatest(w,y)\r\nif p==6: print('1/1')\r\nelif p==5: print('5/6')\r\nelif p==4: print('2/3')\r\nelif p==3: print('1/2')\r\nelif p==2: print('1/3')\r\nelif p==1: print('1/6')\r\nelse : print('0/6')\r\n ", "r = 7 - max((int(x) for x in input().split()))\r\nif r == 1: \r\n print(\"1/6\") \r\nif r == 2:\r\n print(\"1/3\") \r\nif r == 3:\r\n print(\"1/2\") \r\nif r == 4:\r\n print(\"2/3\") \r\nif r == 5:\r\n print(\"5/6\") \r\nif r == 6:\r\n print(\"1/1\") ", "a=list(map(int,input().split()))\r\ny=a[0]\r\nw=a[1]\r\nx=max(y,w)\r\nif((y==1)or(y==2)or(y==3)or(y==4)or(y==5)or(y==6)and(w==1)or(w==2)or(w==3)or(w==4)or(w==5)or(w==6)):\r\n if(x==1):\r\n print('1/1')\r\n elif(x==2):\r\n print('5/6')\r\n elif(x==3):\r\n print('2/3')\r\n elif(x==4):\r\n print('1/2')\r\n elif(x==5):\r\n print('1/3')\r\n elif(x==6):\r\n print('1/6')\r\nelse:print('')\r\n", "results = input()\nresults = results.split(\" \")\nresults = [int(i) for i in results]\nmaxRoll = max(results)\nnum = (6 - maxRoll) + 1\ndenom = 6\nif denom % num == 0:\n denom = int(denom / num)\n num = 1\nelse:\n while (denom % 2 == 0) and (num % 2 == 0):\n num = int(num / 2)\n denom = int(denom / 2)\n\nprint (str(num) + \"/\" + str(denom))\n\t\t\t\t \t \t \t \t\t\t\t \t \t", "\r\ns = max(map(int, input().split()))\r\nk = (6 - s + 1)\r\nif k == 0 or k == 6:\r\n print(f'{int(k/6)}/1')\r\n exit()\r\nif k == 2 or k == 4:\r\n print(f'{int(k/2)}/3')\r\n exit()\r\nif k == 1 or k == 5:\r\n print(f'{int(k)}/6')\r\n exit()\r\nprint('1/2')\r\n", "y,w=[int(i) for i in input().split()]\r\nz=max(y,w)\r\nli=[1,2,3,4,5,6]\r\nif y==w:\r\n i=li.index(y)\r\n c=len(li)-i\r\nelse:\r\n i=li.index(z)\r\n c=len(li)-i\r\nif c%6==0:\r\n print(\"1/1\")\r\nelif c%2==0:\r\n print(\"{0}/{1}\".format((c//2),(6//2)))\r\nelif c%3==0:\r\n print(\"{0}/{1}\".format((c//3),(6//3)))\r\nelse:\r\n print(\"{0}/{1}\".format(c,6))", "res = set(map(int, input().split()))\n\ndices = {i for i in range(1, 7)}\n\nma = max(res)\n\ncnt = 0\nfor v in dices:\n if v >= ma: \n cnt += 1\n\nif cnt == 2:\n print(\"1/3\")\nelif cnt == 3:\n print(\"1/2\")\nelif cnt == 4:\n print(\"2/3\")\nelif cnt == 6:\n print(\"1/1\")\nelse:\n print(f\"{cnt}/6\")\n", "from fractions import Fraction\r\ny, w = map(int, input().split())\r\nx = 0\r\nif y > w:\r\n n = y\r\nelse:\r\n n = w\r\nfor i in range(n,7):\r\n x += 1\r\nx = (Fraction(x)/6)\r\nif x == 0:\r\n print('0/1')\r\nelif x == 1:\r\n print('1/1')\r\nelse:\r\n print(x)\r\n", "print({1: '1/6', 2: '1/3', 3: '1/2', 4: '2/3', 5: '5/6', 6: '1/1'}[7-max(int(x) for x in input().split())])", "import math\r\nmx = max(map(int , input().split()))\r\nn = 6-mx+1\r\ngdd = math.gcd(6,n)\r\n# print(gdd, n//gdd)\r\nprint(n//gdd , '/' , 6//gdd ,sep=\"\")", "def solve():\n [y, w] = [int(x) for x in input().split(\" \")]\n winning_chances = 6 - max(y, w) + 1\n num = winning_chances\n den = 6\n\n for i in range(2, 7):\n if num % i == 0 and den % i == 0:\n num /= i\n den /= i\n\n print(\"{}/{}\".format(int(num), int(den)))\n\n\nsolve()\n", "def main():\r\n n, m = [int(x) for x in input().split()]\r\n x = max(n, m)\r\n if(x == 6):\r\n print(\"1/6\")\r\n elif (x == 5):\r\n print(\"1/3\")\r\n elif (x == 4):\r\n print(\"1/2\")\r\n elif (x == 3):\r\n print(\"2/3\")\r\n elif(x == 2):\r\n print(\"5/6\")\r\n else:\r\n print(\"1/1\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l =[\"1/6\",\"1/3\",\"1/2\",\"2/3\",\"5/6\",\"1/1\"]\r\nprint(l[6-int(max(input().split()))])", "def answer(x,y):\r\n if(x>=y):\r\n maxim=x\r\n else:\r\n maxim=y\r\n dat={}\r\n dat[1] = \"1/1\"\r\n dat[2] = \"5/6\"\r\n dat[3] = \"2/3\"\r\n dat[4] = \"1/2\"\r\n dat[5] = \"1/3\"\r\n dat[6] = \"1/6\"\r\n print (dat[maxim])\r\n \r\nvar1, var2 = input().split()\r\nx=int(var1)\r\ny=int(var2)\r\nanswer(x,y)", "from fractions import Fraction\r\na=(Fraction((int(7)-max(list(map(int,input().split()))))/6).limit_denominator(1000))\r\nprint([a,\"1/1\"][a==1])", "from math import *\r\nimport sys, random\r\n\r\ndef nextInt():\r\n return int(input())\r\ndef nextStrs():\r\n return input().split()\r\ndef nextInts():\r\n return list(map(int,nextStrs()))\r\n\r\ndef main():\r\n a,b = nextInts()\r\n\r\n num = 6-max(a,b)+1\r\n g = gcd(num,6)\r\n num //= g; den = 6//g\r\n\r\n print(num,den,sep='/')\r\n \r\n \r\nif __name__ == '__main__':\r\n exit(main())\r\n", "p,q=map(int,input().split())\r\nif max(p,q)==6:\r\n print('1/6')\r\nelif max(p,q)==5:\r\n print('1/3')\r\nelif max(p,q)==4:\r\n print('1/2')\r\nelif max(p,q)==3:\r\n print('2/3')\r\nelif max(p,q)==2:\r\n print('5/6')\r\nelse:\r\n print('1/1')", "# 2 number in the same line\r\n# Y = int(input())\r\n# Z = int(input())\r\n# read it and split it\r\nx = input().split()\r\n# print(x)\r\nY, Z = int(x[0]), int(x[1])\r\nm = Y\r\nif Z > Y:\r\n m = Z\r\nif m == 6:\r\n print(\"1/6\") # 1/6\r\nelif m == 5:\r\n print(\"1/3\") # 2/6\r\nelif m == 4:\r\n print(\"1/2\") # 3/6\r\nelif m == 3:\r\n print(\"2/3\") # 4/6\r\nelif m == 2:\r\n print(\"5/6\") # 5/6\r\nelif m == 1:\r\n print(\"1/1\") # 6/6\r\n", "\r\nn=[int(z) for z in input().split()]\r\nz=(6-max(n)+1)/6\r\nif z==1:\r\n print(\"1/1\")\r\nelif z==1/6:\r\n print(\"1/6\")\r\nelif z==1/3:\r\n print(\"1/3\")\r\nelif z==1/2:\r\n print(\"1/2\")\r\nelif z==4/6:\r\n print(\"2/3\")\r\nelif z==5/6:\r\n print(\"5/6\")", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\nfrom math import *\r\nimport re\r\nimport random\r\ndef solve():\r\n #for _ in range(int(input())):\r\n for _ in range(1):\r\n a, b = [int(x) for x in input().split()]\r\n a = max(a,b)\r\n ans = ['1','/','6']\r\n a = 6 - a + 1\r\n if(a == 2): ans[2] = '3'\r\n elif(a == 3): ans[2] = '2'\r\n elif(a == 4): ans[2] = '3'; ans[0] = '2'\r\n elif(a == 5): ans[0] = '5'\r\n elif(a == 6): ans[2] = '1'\r\n for x in ans:\r\n print(x, end=\"\")\r\n print(end=\"\\n\")\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "m=input().split()\r\nx=int(m[0])\r\ny=int(m[1])\r\nz=max(x,y)\r\nz=6-z+1\r\nif z==2:\r\n print(\"1/3\")\r\nelif z==3:\r\n print(\"1/2\")\r\nelif z==4:\r\n print(\"2/3\")\r\nelif z==0:\r\n print(\"0/1\")\r\nelif z==6:\r\n print(\"1/1\")\r\nelif z==1:\r\n print(\"1/6\")\r\nelse :\r\n print(\"5/6\")\r\n", "def main():\r\n Y, W = map(int, input().split())\r\n\r\n probs = (\"1/1\", \"5/6\", \"2/3\", \"1/2\", \"1/3\", \"1/6\")\r\n print(probs[max(Y, W) - 1])\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from math import gcd\r\nlist = input().split()\r\nx = int(list[0])\r\ny = int(list[1])\r\nres = 7 - max(x ,y)\r\nprint(str(int(res / gcd(res, 6))) + \"/\" + str(int(6 / gcd(res, 6))))\r\n", "from fractions import Fraction\r\nn, m = map(int, input().split())\r\n\r\ndef calculate_pro(g):\r\n p = 6-g+1\r\n if p == 6:\r\n print(\"1/1\")\r\n else:\r\n print(Fraction(p, 6))\r\n\r\nif n > m:\r\n calculate_pro(n)\r\nelse:\r\n calculate_pro(m)\r\n", "import math\r\nstring = input()\r\nnumbers = string.split()\r\nx = int(numbers[0])\r\ny = int(numbers[1])\r\na = 6 - max([x, y]) + 1\r\nb = 6\r\nn = math.gcd(a, b)\r\na /= n\r\nb /= n\r\nprint(\"%d/%d\" % (a, b))\r\n", "def main():\r\n a = max(*map(int, [*open(0)][0].split()),)\r\n \r\n if a == 1:\r\n print(\"1/1\")\r\n elif a == 2:\r\n print(\"5/6\")\r\n elif a == 3:\r\n print(\"2/3\")\r\n elif a == 4:\r\n print(\"1/2\")\r\n elif a == 5:\r\n print(\"1/3\")\r\n else:\r\n print(\"1/6\")\r\n\r\nmain()", "from fractions import Fraction\n\ndices = list(map(int, input().strip().split(' ')))\nf = Fraction((7-max(dices))/6).limit_denominator(6)\n\nif f == 1:\n print(\"1/1\")\nelse:\n print(f)\n\t \t \t \t\t \t\t\t", "from fractions import Fraction\r\nno1,no2=list(map(int,input().split()))\r\nMax=max(no1,no2)\r\nprob=6-Max+1\r\nif prob==6:\r\n print(\"1/1\")\r\nelif prob==0:\r\n print(\"0/1\")\r\nelse:\r\n print(Fraction(prob,6))", "from fractions import Fraction\r\ny,w = list(map(int,input().split()))\r\nl = [6-(max(y,w)+item) for item in range(0,7-max(y,w))]\r\nf = Fraction(len(l),6)\r\nif f == 1:\r\n print(\"1/1\")\r\nelif f == 0:\r\n print(\"0/1\")\r\nelse:\r\n print(f)\r\n\r\n\r\n\r\n", "import math\r\ns=input().split()\r\ny=int(s[0])\r\nw=int(s[1])\r\nm=max(y,w)\r\nv=7-m\r\nif v==6:\r\n print('1/1')\r\nif v==5:\r\n print('5/6')\r\nif v==4:\r\n print('2/3')\r\nif v==3:\r\n print('1/2')\r\nif v==2:\r\n print('1/3')\r\nif v==1:\r\n print('1/6')\r\n", "from math import gcd\r\ny, w = map(int, input().split())\r\nx = 6 - max(y, w) + 1\r\nprint(str(x // gcd(x, 6)) + '/' + str(6 // gcd(x, 6)))", "\r\nfrom fractions import Fraction\r\ny, w = map(int, input().split())\r\n\r\nans = 7 - max(y, w)\r\n\r\nif ans == 0:\r\n print(\"0/1\")\r\nelif ans == 6:\r\n print(\"1/1\")\r\nelse:\r\n print(Fraction(ans, 6))\r\n", "from fractions import Fraction\r\ny,w = map(int,input().split())\r\ns= max(y,w)\r\nf= 6 -s +1 \r\nt= 6 \r\nprobability = Fraction(f, t)\r\nprint(f\"{probability.numerator}/{probability.denominator}\")", "from math import gcd\n\ny,w =list(map(int, input().split()))\na = max(y,w)\na = 7-a\nprint(str(a//gcd(a,6))+\"/\"+str(6//gcd(a,6)))\n", "a,b=input().split( )\nprint(['蒲小姐我爱你','1/1','5/6','2/3','1/2','1/3','1/6'][max(int(a),int(b))])" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict,deque\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in range(n)]\r\ndef pb(b): print('YES' if b else 'NO')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn = I()\r\nif n==1:\r\n print(0)\r\n exit(0)\r\nelif n<=3:\r\n print(n-1)\r\n for i in range(1, n ):\r\n print(*[i, (i) % n + 1])\r\n exit(0)\r\nres = []\r\nfor i in range(1, n//2+1):\r\n for j in range(n//2+1,n+1):\r\n res.append([i,j])\r\nprint(len(res))\r\nprint(\"\\n\".join([' '.join(map(str,x)) for x in res]))", "# LUOGU_RID: 111250159\n\nn = int(input()) \n\nif n & 1 : print((n // 2) * (n // 2 + 1)) \nelse : print((n // 2) * (n // 2)) \n\nx = n // 2 \ny = n // 2 + 1\nfor i in range(1, x + 1) : \n for j in range(y, n + 1) : \n print(i, j) ", "p = int(input())\r\nprint( ( p // 2 ) ** 2 + ( p // 2) * ( p % 2 ) ) \r\nfor i in range(p//2):\r\n for j in range(p//2, p):\r\n print(i+1, j+1)", "n = int(input())\nans = 0\nfor i in range(2, n+1):\n ans+=1\n for j in range(i-3, 0, -2):\n ans+=1\n\nprint(ans)\nfor i in range(2, n+1):\n print(i, i-1)\n for j in range(i-3, 0, -2):\n print(i, j)\n", "# 41E\ndef do():\n n = int(input())\n ln = n >> 1\n res = []\n for i in range(1, ln + 1):\n for j in range(ln + 1, n + 1):\n res.append((i, j))\n return res\n\nres = do()\nprint(len(res))\nfor x, y in res:\n print(str(x) + \" \" + str(y))\n\n\n\n\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled20.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1-CeuK5kllRYkKqGcRqAYJKANGF2dnIy2\n\"\"\"\n\nn=int(input())\n\nadj=[[0]*(n+1) for i in range(n+1)]\n\nif n<=3:\n if n==1:\n print(0)\n elif n==2:\n print(1)\n print(1,2)\n else:\n print(2)\n print(1,2)\n print(2,3)\n exit(0)\n\nm=0\nans=[]\n\n#make a cycle\nfor i in range(1,n):\n ans.append([i,i+1])\n adj[i][i+1]=1\n adj[i+1][i]=1\n\nfor i in range(1,n+1):\n for j in range(1,n+1):\n if i==j:\n continue\n\n elif adj[i][j]==1 or adj[j][i]==1:\n continue\n\n else:\n #see if there's a common node\n f=1\n for k in range(1,n+1):\n if adj[i][k]==1 and adj[j][k]==1:\n f=0\n break\n\n if f==1:\n adj[i][j]=1\n adj[j][i]=1\n ans.append([i,j])\n\nprint(len(ans))\nfor i in range(len(ans)):\n print(ans[i][0],ans[i][1])", "import math as m\r\nn = int(input())\r\nprint(m.ceil(n/2)*m.floor(n/2))\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if i%2==0 and j%2==1:\r\n print(i,j)\r\n" ]

[ "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\ndef popcount(n):\r\n c=(n&0x5555555555555555)+((n>>1)&0x5555555555555555)\r\n c=(c&0x3333333333333333)+((c>>2)&0x3333333333333333)\r\n c=(c&0x0f0f0f0f0f0f0f0f)+((c>>4)&0x0f0f0f0f0f0f0f0f)\r\n c=(c&0x00ff00ff00ff00ff)+((c>>8)&0x00ff00ff00ff00ff)\r\n c=(c&0x0000ffff0000ffff)+((c>>16)&0x0000ffff0000ffff)\r\n c=(c&0x00000000ffffffff)+((c>>32)&0x00000000ffffffff)\r\n return c\r\n\r\n\r\nclass lazy_segtree():\r\n def update(self,k):self.d[k]=self.op(self.d[2*k],self.d[2*k+1])\r\n def all_apply(self,k,f):\r\n self.d[k]=self.mapping(f,self.d[k])\r\n if (k<self.size):self.lz[k]=self.composition(f,self.lz[k])\r\n def push(self,k):\r\n self.all_apply(2*k,self.lz[k])\r\n self.all_apply(2*k+1,self.lz[k])\r\n self.lz[k]=self.identity\r\n def __init__(self,V,OP,E,MAPPING,COMPOSITION,ID):\r\n self.n=len(V)\r\n self.log=(self.n-1).bit_length()\r\n self.size=1<<self.log\r\n self.d=[E for i in range(2*self.size)]\r\n self.lz=[ID for i in range(self.size)]\r\n self.e=E\r\n self.op=OP\r\n self.mapping=MAPPING\r\n self.composition=COMPOSITION\r\n self.identity=ID\r\n for i in range(self.n):self.d[self.size+i]=V[i]\r\n for i in range(self.size-1,0,-1):self.update(i)\r\n def set(self,p,x):\r\n assert 0<=p and p<self.n\r\n p+=self.size\r\n for i in range(self.log,0,-1):self.push(p>>i)\r\n self.d[p]=x\r\n for i in range(1,self.log+1):self.update(p>>i)\r\n def get(self,p):\r\n assert 0<=p and p<self.n\r\n p+=self.size\r\n for i in range(self.log,0,-1):self.push(p>>i)\r\n return self.d[p]\r\n def prod(self,l,r):\r\n assert 0<=l and l<=r and r<=self.n\r\n if l==r:return self.e\r\n l+=self.size\r\n r+=self.size\r\n for i in range(self.log,0,-1):\r\n if (((l>>i)<<i)!=l):self.push(l>>i)\r\n if (((r>>i)<<i)!=r):self.push(r>>i)\r\n sml,smr=self.e,self.e\r\n while(l<r):\r\n if l&1:\r\n sml=self.op(sml,self.d[l])\r\n l+=1\r\n if r&1:\r\n r-=1\r\n smr=self.op(self.d[r],smr)\r\n l>>=1\r\n r>>=1\r\n return self.op(sml,smr)\r\n def all_prod(self):return self.d[1]\r\n def apply_point(self,p,f):\r\n assert 0<=p and p<self.n\r\n p+=self.size\r\n for i in range(self.log,0,-1):self.push(p>>i)\r\n self.d[p]=self.mapping(f,self.d[p])\r\n for i in range(1,self.log+1):self.update(p>>i)\r\n def apply(self,l,r,f):\r\n assert 0<=l and l<=r and r<=self.n\r\n if l==r:return\r\n l+=self.size\r\n r+=self.size\r\n for i in range(self.log,0,-1):\r\n if (((l>>i)<<i)!=l):self.push(l>>i)\r\n if (((r>>i)<<i)!=r):self.push((r-1)>>i)\r\n l2,r2=l,r\r\n while(l<r):\r\n if (l&1):\r\n self.all_apply(l,f)\r\n l+=1\r\n if (r&1):\r\n r-=1\r\n self.all_apply(r,f)\r\n l>>=1\r\n r>>=1\r\n l,r=l2,r2\r\n for i in range(1,self.log+1):\r\n if (((l>>i)<<i)!=l):self.update(l>>i)\r\n if (((r>>i)<<i)!=r):self.update((r-1)>>i)\r\n def max_right(self,l,g):\r\n assert 0<=l and l<=self.n\r\n assert g(self.e)\r\n if l==self.n:return self.n\r\n l+=self.size\r\n for i in range(self.log,0,-1):self.push(l>>i)\r\n sm=self.e\r\n while(1):\r\n while(l%2==0):l>>=1\r\n if not(g(self.op(sm,self.d[l]))):\r\n while(l<self.size):\r\n self.push(l)\r\n l=(2*l)\r\n if (g(self.op(sm,self.d[l]))):\r\n sm=self.op(sm,self.d[l])\r\n l+=1\r\n return l-self.size\r\n sm=self.op(sm,self.d[l])\r\n l+=1\r\n if (l&-l)==l:break\r\n return self.n\r\n def min_left(self,r,g):\r\n assert (0<=r and r<=self.n)\r\n assert g(self.e)\r\n if r==0:return 0\r\n r+=self.size\r\n for i in range(self.log,0,-1):self.push((r-1)>>i)\r\n sm=self.e\r\n while(1):\r\n r-=1\r\n while(r>1 and (r%2)):r>>=1\r\n if not(g(self.op(self.d[r],sm))):\r\n while(r<self.size):\r\n self.push(r)\r\n r=(2*r+1)\r\n if g(self.op(self.d[r],sm)):\r\n sm=self.op(self.d[r],sm)\r\n r-=1\r\n return r+1-self.size\r\n sm=self.op(self.d[r],sm)\r\n if (r&-r)==r:break\r\n return 0\r\n\r\ndef operate(a,b):\r\n return a|b\r\n\r\ndef mapping(f,x):\r\n if f==-1:\r\n return x\r\n return f\r\n\r\ndef composition(f,g):\r\n if f==-1:\r\n return g\r\n return f\r\n\r\nn,q=map(int,input().split())\r\nc=list(map(lambda x:int(x)-1,input().split()))\r\nedge=[[] for i in range(n)]\r\nfor _ in range(n-1):\r\n a,b=map(lambda x:int(x)-1,input().split())\r\n edge[a].append(b)\r\n edge[b].append(a)\r\n\r\nL=[0]*n\r\nR=[0]*n\r\ntodo=[(1,0,-1),(0,0,-1)]\r\ntmp=0\r\nwhile todo:\r\n t,v,p=todo.pop()\r\n if t==0:\r\n L[v]=tmp\r\n tmp+=1\r\n for u in edge[v]:\r\n if u!=p:\r\n todo.append((1,u,v))\r\n todo.append((0,u,v))\r\n else:\r\n R[v]=tmp\r\n\r\nseg=lazy_segtree([0]*n,operate,0,mapping,composition,-1)\r\nfor i in range(n):\r\n seg.set(L[i],1<<c[i])\r\n\r\nfor _ in range(q):\r\n query=list(map(int,input().split()))\r\n if query[0]==1:\r\n v,c=query[1:]\r\n v-=1\r\n c-=1\r\n seg.apply(L[v],R[v],1<<c)\r\n else:\r\n v=query[1]-1\r\n bit=seg.prod(L[v],R[v])\r\n print(popcount(bit))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef make_graph(n, m):\r\n x, s = [], [0] * (n + 3)\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n s[u + 2] += 1\r\n s[v + 2] += 1\r\n x.append(u)\r\n x.append(v)\r\n for i in range(3, n + 3):\r\n s[i] += s[i - 1]\r\n G = [0] * (2 * m)\r\n for i in range(2 * m):\r\n j = x[i] + 1\r\n G[s[j]] = x[i ^ 1]\r\n s[j] += 1\r\n return G, s\r\n \r\ndef euler_tour(G, s0):\r\n s = []\r\n s.append(1)\r\n now = list(s0)\r\n t = 1\r\n t1, t2 = [0] * (n + 1), [0] * (n + 1)\r\n while s:\r\n i = s[-1]\r\n if not t1[i]:\r\n t1[i] = t\r\n t += 1\r\n while now[i] ^ s0[i + 1] and t1[G[now[i]]]:\r\n now[i] += 1\r\n if now[i] == s0[i + 1]:\r\n t2[i] = t - 1\r\n s.pop()\r\n else:\r\n s.append(G[now[i]])\r\n now[i] += 1\r\n return t1, t2\r\n\r\ndef f(i):\r\n if not lazy[i]:\r\n return\r\n tree[i] = lazy[i]\r\n if i < l1:\r\n lazy[i << 1] = lazy[i]\r\n lazy[i << 1 ^ 1] = lazy[i]\r\n lazy[i] = 0\r\n return\r\n\r\ndef update(l, r, s):\r\n q, ll, rr, i = [1], [0], [l1 - 1], 0\r\n while len(q) ^ i:\r\n j = q[i]\r\n l0, r0 = ll[i], rr[i]\r\n if l <= l0 and r0 <= r:\r\n if s:\r\n lazy[j] = s\r\n f(j)\r\n i += 1\r\n continue\r\n f(j)\r\n m0 = (l0 + r0) >> 1\r\n if l <= m0 and l0 <= r:\r\n q.append(j << 1)\r\n ll.append(l0)\r\n rr.append(m0)\r\n if l <= r0 and m0 + 1 <= r:\r\n q.append(j << 1 ^ 1)\r\n ll.append(m0 + 1)\r\n rr.append(r0)\r\n i += 1\r\n for i in q[::-1]:\r\n if i < l1:\r\n j, k = i << 1, i << 1 ^ 1\r\n f(j)\r\n f(k)\r\n tree[i] = tree[j] | tree[k]\r\n return\r\n\r\ndef get_ans(s, t):\r\n update(s, t, 0)\r\n s += l1\r\n t += l1\r\n ans = 0\r\n while s <= t:\r\n if s % 2:\r\n ans |= tree[s]\r\n s += 1\r\n s >>= 1\r\n if not t % 2:\r\n ans |= tree[t]\r\n t -= 1\r\n t >>= 1\r\n return ans\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nG, s0 = make_graph(n, n - 1)\r\nt1, t2 = euler_tour(G, s0)\r\npow2 = [1]\r\nfor _ in range(62):\r\n pow2.append(2 * pow2[-1])\r\na = [0] * (n + 1)\r\nfor i in range(n):\r\n a[t1[i + 1]] = pow2[c[i] - 1]\r\nl1 = pow(2, (n + 1).bit_length())\r\nl2 = 2 * l1\r\ntree, lazy = [0] * l2, [0] * l2\r\nfor i in range(1, n + 1):\r\n tree[i + l1] = a[i]\r\nfor i in range(l1 - 1, 0, -1):\r\n tree[i] = tree[2 * i] | tree[2 * i + 1]\r\nans = []\r\nfor _ in range(m):\r\n t = list(map(int, input().split()))\r\n if t[0] == 1:\r\n v, ck = t[1], t[2]\r\n fv, lv = t1[v], t2[v]\r\n update(fv, lv, pow2[ck - 1])\r\n else:\r\n v = t[1]\r\n fv, lv = t1[v], t2[v]\r\n ans0 = get_ans(fv, lv)\r\n ans.append(bin(ans0).count(\"1\"))\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "# LUOGU_RID: 101738980\ns = input()\r\nans = eval(s)\r\nfor i in range(len(s)):\r\n if s[i] == '+':\r\n x = -5\r\n j = i + 1\r\n while j < len(s) and s[j] not in '+-':\r\n x *= 10\r\n j += 1\r\n ans += x\r\n if s[i] == '-':\r\n x = 3\r\n j = i + 1\r\n while j < len(s) and s[j] not in '+-':\r\n x *= 10\r\n j += 1\r\n ans += x\r\nprint(ans)\r\n", "import re\r\ns=input()\r\nprint(eval(s)+eval(re.sub(\"-|\\+|\\d\",lambda m:\"+-035\"[2-\"+--\".count(m[0])::3],s)))", "e = input()\r\n\r\nnr = 0\r\nnrs = []\r\nsigns = []\r\nfor c in e:\r\n if not c.isdigit():\r\n nrs += [nr]\r\n signs += [c]\r\n nr = 0\r\n nr = nr*10 + ord(c) - ord('0')\r\nnrs += [nr]\r\nres = nrs[0]\r\nfor i in range(len(signs)):\r\n if signs[i] == '+':\r\n res += nrs[i+1]\r\n else:\r\n res -= nrs[i+1]\r\nprint(res)\r\n", "from sys import stdin,stdout\r\n# from os import _exit\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\ns = input().strip()+\"+\"\r\nres = 0\r\ncur = 0\r\nsign = 1\r\nfor c in s:\r\n if c==\"+\" or c==\"-\":\r\n res+=sign*cur\r\n cur = 0\r\n if c==\"-\":\r\n sign = -1\r\n if c==\"+\":\r\n sign = 1\r\n cur = cur*10+(ord(c)-ord(\"0\"))\r\nprint(str(res)+\"\\n\")\r\n", "s = input()\r\n\r\na = 1\r\nb = 0\r\nres = 0\r\nfor c in s:\r\n\tif (c == '+'):\r\n\t\tres = res + a * b\r\n\t\ta = 1\r\n\t\tb = 0\r\n\telif (c == '-'):\r\n\t\tres = res + a * b\r\n\t\ta = -1\r\n\t\tb = 0\r\n\tb = b * 10 + ord(c) - 48\r\nres = res + a * b\r\n\r\nprint(res)" ]

[ "a, b = map(int, input().split())\nx, y, z = map(int, input().split())\n\nneed_yellow = x * 2 + y\nneed_blue = y + z * 3\n\nyellow_diff = max(0, need_yellow - a)\nblue_diff = max(0, need_blue - b)\n\ntotal_diff = yellow_diff + blue_diff\n\nprint(total_diff)\n\n\t \t\t\t \t\t \t \t \t\t \t\t \t\t\t\t", "Y , B = map(int,input().split())\r\ny , g , b = map(int,input().split())\r\nprint(max(0 , 2*y+g - Y) + max(0 , 3*b+g - B))", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\na_need = 0\r\nb_need = 0\r\n\r\n# yellow\r\na_need = x * 2\r\n\r\n# green\r\na_need += y\r\nb_need += y\r\n\r\n# blue\r\nb_need += z * 3\r\n\r\na_need = (a_need - a) if a_need > a else 0\r\nb_need = (b_need - b) if b_need > b else 0\r\n\r\nneed_total = a_need + b_need\r\n\r\nif need_total > 0:\r\n print(need_total)\r\nelse:\r\n print(0)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\n\r\ndef main():\r\n A = list(map(int, input().split()))\r\n B = list(map(int, input().split()))\r\n #print('A: ' + str(A))\r\n #print('B: ' + str(B))\r\n yellow = B[0] * 2 + B[1] * 1\r\n blue = B[1] * 1 + B[2] * 3\r\n ans = 0\r\n #print('yellow: %d, blue: %d' % (yellow, blue))\r\n if A[0] < yellow:\r\n ans += yellow - A[0]\r\n if A[1] < blue:\r\n ans += blue - A[1]\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "[A,B] = map(int, input().split())\r\n[x,y,z] = map(int, input().split())\r\nyellow=x*2+y\r\nblue=y+3*z\r\nif yellow>=A:\r\n ya=yellow-A\r\nelse:\r\n ya=0\r\nif blue>=B:\r\n bl=blue-B\r\nelse:\r\n bl=0\r\nprint (ya+bl)", "A,B=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nprint(max(0,2*x+y-A)+max(0,y+3*z-B))\r\n", "YC, BC = map(int, input().split())\r\nYB, GB, BB = map(int, input().split())\r\n\r\nYCR = 2 * YB + GB\r\nBCR = GB + 3 * BB\r\n\r\nprint(max(0, YCR-YC) + max(0, BCR-BC))", "A, B = [int(x) for x in input().split()]\r\n\r\nx, y, z = [int(x) for x in input().split()]\r\n\r\n\r\nyellow = x*2 + y\r\n\r\nblue = y + z*3\r\n\r\n\r\nif A >= yellow:\r\n\tans1 = 0\r\nelse:\r\n\tans1 = yellow - A\r\nif B >= blue:\r\n\tans2 = 0\r\nelse:\r\n\tans2 = blue - B \r\nprint(ans1 + ans2)", "# Tricky Alchemy\r\n# https://codeforces.com/problemset/problem/912/A\r\n\r\nyellow_crystals, blue_crystals = map(int, input().split())\r\nyball, gball, bball = map(int, input().split())\r\n\r\nneeded_yellow_crystals = 2 * yball + gball\r\nneeded_blue_crystals = gball + 3 * bball\r\n\r\nbuy_yellow_crystals = max(needed_yellow_crystals - yellow_crystals, 0)\r\nbuy_blue_crystals = max(needed_blue_crystals - blue_crystals, 0)\r\n\r\nprint(buy_yellow_crystals + buy_blue_crystals)", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Jan 11 23:59:16 2018\n\n@author: Sand Boa\n\"\"\"\ndef validator(chunk:int, i:int, j:int)->int:\n pass\n \nif __name__ == \"__main__\":\n yellow_crys, blue_crys = list(map(int,input().split()))\n yellow, green, blue = list(map(int,input().split()))\n yello_summ = max(((yellow*2+green)-yellow_crys),0)\n blue_summ = max(((blue*3+green )-blue_crys),0)\n ans=(yello_summ+blue_summ)\n print(ans)\n \t\t \t\t \t\t\t \t\t\t \t \t \t\t", "a, b = map(int, input().split())\nx, y, z = map(int, input().split())\n\na_need = 2*x + y\nb_need = y + 3*z\n\na1 = (a_need - a) if a_need > a else 0\nb1 = (b_need - b) if b_need > b else 0\n\nprint(a1 + b1)\n", "yellow , blue = list(map(int,input().split()))\r\noby , obg , obb = list(map(int,input().split()))\r\nprint(max(0,2*oby+obg-yellow)+max(0,3*obb+obg-blue)) ", "[yc,bc] = map(int,input().split())\r\n[yb,gb,bb] = map(int,input().split())\r\nx = (yb*2+gb)-yc\r\ny = (bb*3+gb)-bc\r\nif x < 0:\r\n x = 0\r\nif y < 0:\r\n y = 0\r\nprint(x+y)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nd = 3*z + y\r\nc = y + 2*x\r\nprint(max(d-b,0) + max(c-a,0))", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nyellow=(x*2)+y\r\nblue=y+(z*3)\r\nsum1=0\r\nif a>=yellow:\r\n\tsum1=0\r\nelse:\r\n\tsum1+=yellow-a\r\nif b>=blue:\r\n\tsum1+=0\r\nelse:\r\n\tsum1+=blue-b\r\nprint(sum1)", "A, B = map(int, input().split(' '))\nx, y, z = map(int, input().split(' '))\nprint(max(0, 2*x+y-A) + max(0, y+3*z-B))\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\na-=2*x \r\na-=y \r\nb-=y \r\nb-=3*z \r\nsumm=0\r\nif a<0:\r\n summ+=-a \r\nif b<0:\r\n summ+=-b\r\nprint(summ)\r\n", "A, B = map(int,input().split())\nyellow , green , blue = map(int,input().split())\nAnswer = 0\nz=(yellow*2)+green # in the total need z yellow\na=(blue*3)+green # in the total need a blue\nprint(max(z-A,0)+max(a-B,0))", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nyellow=2*x+y\r\nblue = 3*z+y\r\nprint(max(0,yellow-a)+max(0,blue-b))\r\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nt = max(2 * x + y - a, 0)\r\nq = max(3 * z + y - b, 0)\r\nprint(t + q)\r\n\r\n#\r\n# CodeForcesian\r\n# ♥\r\n# حس میکنم خنگ شدم\r\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nprint(max(0,y + 3 * z - b) + max(0, y + 2 * x - a))", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nresult = 0\r\nif y+x*2>a:\r\n\tresult+=y+x*2-a\r\nif y+z*3>b:\r\n\tresult+=y+z*3-b\r\nprint(result)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nprint(max(0,x*2+y-a)+max(0,y+3*z-b))", "A,B=map(int,input().split())\r\nx,y,z=list(map(int,input().split()))\r\nprint(max(0,x*2+y-A)+max(0,z*3+y-B))\r\n", "a, b=[int(i) for i in input().split()]\r\nx, y, z=[int(i) for i in input().split()]\r\nn, m=0,0\r\nn+=2*x\r\nn+=y\r\nm+=y\r\nm+=3*z\r\ns=0\r\nif a-n<0:\r\n s+=n-a\r\nif b-m<0:\r\n s+=m-b\r\nprint(s)", "cy,cb=map(int,input().split()) #y=2y\r\n #g=1y+1b\r\n #b=3b\r\ny,g,b=map(int,input().split())\r\nresy=y*2+g*1 \r\nresb=g+b*3\r\nreqy=resy-cy\r\nreqb=resb-cb\r\nsum=0\r\nif reqy>0:\r\n sum+=reqy\r\nif reqb>0:\r\n sum+=reqb\r\nprint(sum)\r\n", "\r\na, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\ny_cr = x * 2\r\nb_cr = z * 3\r\n\r\ny_cr += y\r\nb_cr += y\r\n\r\nprint(max(y_cr - a , 0) + max(b_cr - b, 0))", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nA = 2*x+y-A\r\nB = 3*z+y-B\r\nprint(max(A, 0)+max(B, 0))\r\n", "[A, B] = map(int, input().split())\n[x, y, z] = map(int, input().split())\nNY = 2*x + y\nNB = 3*z + y\nif (A - NY < 0) and (B - NB < 0):\n print(abs(A - NY) + abs(B - NB))\nelif A - NY < 0:\n print(abs(A - NY))\nelif B - NB < 0:\n print(abs(B - NB))\nelse:\n print(0)\n", "yc,bc = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\ncount = 0\r\nryc,rbc=0,0\r\n\r\nyc = yc-(2*x)\r\nyc = yc-(1*y)\r\nbc = bc-(1*y)\r\nbc = bc-(3*z)\r\nif yc<0: ryc+=(-1*yc)\r\nif bc<0: rbc+=(-1*bc)\r\nprint(ryc+rbc)", "# A --> Yellow Crystal\r\n# B --> Blue Crystal\r\n# Yellow Ball = 2Y\r\n# Green Ball = Y + B\r\n# Blue Ball = 3B\r\n\r\nA, B = [int(x) for x in input().split()]\r\nx, y, z = [int(x) for x in input().split()]\r\n\r\ntotal = 0\r\nif 2*x + y > A:\r\n total += abs(2*x + y - A)\r\nif 3*z + y > B:\r\n total += abs(3*z + y - B)\r\n\r\nprint(total)", "a,b = list(map(int,input().split()))\r\nx,y,z = list(map(int,input().split()))\r\n\r\nY = x*2 + y\r\nB = y + z*3\r\n\r\nprint(max(Y-a,0)+max(B-b,0))", "[a,b]=map(int,input().split())\r\n[x,y,z]=map(int,input().split())\r\nyc=x*2+y\r\nbc=y+z*3\r\nn=0\r\nif yc>a:\r\n n=yc-a\r\nif bc>b:\r\n n+=bc-b\r\nprint(n) \r\n \r\n\r\n ", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nyc=x*2+y\r\nbc=z*3+y\r\nif(a<yc):\r\n a=yc-a\r\nelse:\r\n a=0\r\nif(b<bc):\r\n b=bc-b\r\nelse:\r\n b=0\r\nprint(a+b)", "y,b=map(int,input().split())\r\nye,gr,bl=map(int,input().split())\r\nx=ye*2+gr\r\nk=gr+bl*3\r\nprint(max(0,x-y)+max(0,k-b))", "def main():\n a, b = map(int, input().split())\n x, y, z = map(int, input().split())\n a -= x * 2 + y\n b -= y + z * 3\n print(max(-a, 0) + max(- b, 0))\n\n\nif __name__ == '__main__':\n main()\n", "__ready_for_submit__ = True\n\nimport sys, os\n\nfile_name = os.path.basename(__file__).split('.')[0]\n\nif __ready_for_submit__:\n infile = sys.stdin\n outfile = sys.stdout\nelse:\n infile = open(file_name + '.in', 'r')\n outfile = open(file_name + '.out', 'w')\n\nA, B = [int(x) for x in infile.readline().split()]\nx, y, z = [int(x) for x in infile.readline().split()]\n\nTA = 2*x + y\nTB = y + 3*z\n\nans = max(0, TA - A) + max(0, TB - B)\noutfile.write('%d\\n' % ans)\n\ninfile.close()\noutfile.close()", "[A,B]=map(int,input().split())\r\n[x,y,z]=map(int,input().split())\r\nyellowneed = x*2+y\r\nblueneed = z*3+y\r\nyellowbuy = max(yellowneed - A, 0)\r\nbluebuy = max(blueneed - B,0)\r\nprint(yellowbuy+bluebuy)", "y,b = map(int,input().split())\r\nyy,gg,bb = map(int,input().split())\r\nyyy = 2*yy + gg\r\nbbb = 3*bb + gg\r\nprint(max(0,yyy-y)+max(0,bbb-b))", "# Bismillahir Rahmanir Rahim\r\n# Abu Hurayra - Handle: HurayraIIT\r\nimport sys\r\ndef rs(): return sys.stdin.readline().rstrip()\r\ndef ri(): return int(sys.stdin.readline())\r\ndef ria(): return list(map(int, sys.stdin.readline().split()))\r\ndef ws(s): sys.stdout.write(s + '\\n')\r\ndef wi(n): sys.stdout.write(str(n) + '\\n')\r\ndef wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\\n')\r\n#a = list(map(int, input().split()))\r\n \r\n \r\n \r\ndef main():\r\n current_yellow_crystals, current_blue_crystals = ria()\r\n yellow_balls, green_balls, blue_balls = ria()\r\n \r\n needed = 0\r\n \r\n yellow_crystals_needed = yellow_balls*2 + green_balls\r\n blue_crystals_needed = green_balls + 3 * blue_balls\r\n \r\n wi(max(0,yellow_crystals_needed-current_yellow_crystals)+max(0,blue_crystals_needed-current_blue_crystals))\r\n\r\n\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "A,B=map(int,input().split())\r\ny,g,b=map(int,input().split())\r\nyc=y*2+g\r\nbc=b*3+g\r\nif(A<=yc and B<=bc):\r\n print(yc+bc-A-B)\r\nelif(A>yc and B<=bc):\r\n print(bc-B)\r\nelif(A<=yc and B>bc):\r\n print(yc-A)\r\nelse:\r\n print(0)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\t\t\t\r\na1=(2*x)+y\t\r\nb1=(3*z)+y\r\ns=max(a1-a,0)+max(b1-b,0)\r\nprint(s)", "(yc,bc)=map(int,input().split())\r\n(ybn,gbn,bbn)=map(int,input().split())\r\n\r\nycn = (ybn*2)+(gbn) # ycn=3 yellow crystals+l bule crystal\r\nbcn = (bbn*3)+(gbn) \r\n # bcn= 1 yellow crystals+4 blue crystal\r\nbyc = max(ycn - yc,0)\r\nbbc = max(bcn - bc,0)\r\nprint(byc+bbc)", "a,b = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nans = 0\r\nif(a//2 >= x):\r\n a -= x * 2\r\nelse:\r\n val = x * 2\r\n ans += val - a\r\n a = 0\r\nif(a >= y):\r\n a -= y\r\nelse:\r\n ans += y - a\r\n a = 0\r\nif(b >= y):\r\n b -= y\r\nelse:\r\n ans += y - b\r\n b = 0\r\nif(b >= z * 3):\r\n b -= z*3\r\nelse:\r\n ans += z*3 - b\r\nprint(ans)", "yc, bc = list(map(int, input().split()))\r\ny, g, b = list(map(int, input().split()))\r\nyc -= y * 2\r\nyc -= g\r\nbc -= g\r\nbc -= b * 3\r\nprint(abs(min(yc, 0)) + abs(min(bc, 0)))", "n,m=[int(x) for x in input().split()]\r\na,b,c=[int(x) for x in input().split()]\r\nyellow=0\r\nblue=0\r\nyellow+=2*a\r\nyellow+=b\r\nblue+=b+3*c\r\nprint(max(0,yellow-n)+max(0,blue-m))\r\n", "n,k=map(int,input().split())\r\na,b,c=map(int,input().split())\r\nres=0\r\ny=2*a + b -n\r\nb=3*c + b -k \r\nif y>0:\r\n res+=y\r\nif b>0:\r\n res+=b \r\nprint(res)", "A,B = map(int,input().split())\r\nr,g,b = map(int,input().split())\r\na_ = b_ = 0 \r\na_ = r*2 + g \r\nb_ = b*3 + g \r\nprint(max(a_-A,0)+max(b_ - B,0))", "inp = lambda: map(int, input().split())\r\n\r\nyell, blue = inp()\r\ny, g, b = inp()\r\n\r\nyell -= (2 * y + g)\r\nblue -= (3 * b + g)\r\n\r\nans = 0\r\n\r\nif yell < 0:\r\n ans += abs(yell)\r\n\r\nif blue < 0:\r\n ans += abs(blue)\r\n\r\nprint(ans)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\na_count = x * 2 + y\r\nb_count = y + z * 3\r\nprint(max(a_count-a, 0) + max(b_count-b, 0))", "s=[int(n) for n in input().split()]\r\nz=[int(n) for n in input().split()]\r\na=z[0]*2+z[1]\r\nb=z[2]*3+z[1]\r\nif a>s[0] and b<=s[1]:\r\n\tprint(a-s[0])\r\nelif a<=s[0] and b>s[1]:\r\n\tprint(b-s[1])\r\nelif a>s[0] and b>s[1]:\r\n\tprint(a+b-(s[0]+s[1]))\r\nelse:\r\n\tprint(0)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nprint(max((2 * x + y) - a, 0) + max((3 * z + y) - b, 0))\r\n", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nprint(max(0, 2 * x + y - A) + max(0, y + 3 * z - B))", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\np=(2*x+1*y)\r\nq=(1*y+3*z)\r\nm=0\r\nif p>=a:\r\n\tm+=p-a\t\r\nif q>=b:\r\n\tm+=q-b\r\nprint(m)", "def req_num(a, b, x, y, z):\n req_a = (x * 2) + y\n req_b = (z * 3) + y\n if (req_a - a) <= 0:\n ans_a = 0\n else:\n ans_a = req_a - a\n if (req_b - b) <= 0:\n ans_b = 0\n else:\n ans_b = req_b - b\n return ans_a + ans_b\n\na, b = list(map(int, input().strip().split()))\nx, y, z = list(map(int, input().strip().split()))\nprint(req_num(a, b, x, y, z))\n", "A,B=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nyellow = 2*x + y\r\nblue = 3*z + y\r\nprint(max(0,yellow-A)+max(0,blue-B))\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nif a < x*2+y:\r\n ry=x*2+y-a\r\nelse:\r\n ry=0\r\nif b < y+z*3:\r\n rb=y+z*3-b\r\nelse:\r\n rb=0\r\nprint(ry+rb)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nyel = max(0, 2 * x + y - a)\r\nblu = max(0, y + 3 * z - b)\r\nprint(yel + blu)\r\n", "(a, b) = [int(s) for s in input().split()]\r\n(x, y, z) = [int(s) for s in input().split()]\r\n\r\nneeded_yellow = max(2*x + y - a, 0)\r\nneeded_blue = max(y + 3*z - b, 0)\r\n\r\nprint(needed_yellow + needed_blue)\r\n", "# Tricky alchemy\n[A,B] = map(int,input().split())\n[y,g,b] = map(int,input().split())\nprint(max(0, 2*y+g-A) + max(0, g+3*b-B))\n", "y,b=map(int,input().split())\r\nye,gr,bl=map(int,input().split())\r\nprint(-min(y-ye*2-gr,0)-min(b-bl*3-gr,0))", "a,b=[int(i) for i in input().split()]\r\nx,y,z=[int(i) for i in input().split()]\r\nyc=0\r\nbc=0\r\nyc=yc+(2*x)\r\nyc=yc+(1*y)\r\nbc=bc+(1*y)\r\nbc=bc+(3*z)\r\nayc=yc-a\r\nif(ayc<=0):\r\n ayc=0\r\nabc=bc-b\r\nif(abc<=0):\r\n abc=0\r\nprint(abc+ayc)\r\n\r\n", "A,B= map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nblue = (3*z + y) - B\r\nyellow = (2*x + y) - A\r\nblue = max(0,blue)\r\nyellow = max(0,yellow)\r\nprint(blue+yellow)", "a1,b1 = map(int,input().split())\r\ny,g,b = map(int,input().split())\r\na2 = 2*y+g; b2 = 3*b+g\r\nif a1 >= a2: a1 = 0; a2 = 0\r\nif b1 >= b2: b1 = 0; b2 = 0\r\nprint(a2-a1+b2-b1)", "a, b = [int(x)for x in input().split()]\r\nx,y,z = [int(x)for x in input().split()]\r\nif a >= (2*x+y):\r\n yellow = 0\r\nelse:\r\n yellow = (2*x+y-a)\r\n\r\nif b >= (y+3*z):\r\n blue = 0\r\nelse:\r\n blue = (y+3*z-b)\r\n\r\nprint(yellow+blue)", "yl,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nprint(max(0,2*x+y-yl)+max(0,3*z+y-b))", "a,b = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\n\r\n#green = 2*y\r\n#extra_y = extra_b = y\t\r\nyellow = 2*x + y\r\nblue = 3*z + y\r\n\r\n\r\nif a-yellow < 0:\r\n\treq_y = abs(a-yellow)\r\nelse:\r\n\treq_y =0\r\n\r\nif b-blue < 0:\r\n\treq_b = abs(b-blue)\r\nelse:\r\n\treq_b =0\r\n\r\nprint(req_y + req_b)", "a,b=map(int,input().split())\r\nc,d,e=map(int,input().split())\r\n'''a=yellow cryst b=blue cryst c=yellow ball needed d=green ball needed e=blue ball needed'''\r\nf=2*c\r\nif f>a:\r\n g=f-a\r\nelse:\r\n g=0 \r\n# g is extra yellow crystals needed for making yellow balls\r\nh=3*e\r\nif h>b:\r\n i=h-b\r\nelse:\r\n i=0\r\n# i is extra blue crystals needed for making blue balls\r\n\r\nBad_VaRiaB1E_N4m3_12345678_9876_543_21=f+d-a\r\n\r\nif f+d>a:\r\n g = Bad_VaRiaB1E_N4m3_12345678_9876_543_21\r\n\r\nj=h+d-b\r\nif h+d>b:\r\n i = j\r\n\r\nprint(g+i)", "yellowShards,blueShards = [int(x) for x in input().split()]\r\nyBalls,gBalls,bBalls = [int(x) for x in input().split()]\r\n\r\nyellowNeeded = yBalls*2 + gBalls\r\nblueNeeded = gBalls + 3*bBalls\r\n\r\nans =0\r\nif(yellowShards<yellowNeeded):\r\n ans = ans + (yellowNeeded-yellowShards)\r\nif(blueShards<blueNeeded):\r\n ans = ans + (blueNeeded-blueShards)\r\n\r\nprint(ans)\r\n", "a,b = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nyellow = 2*x+y\r\nblue = y+3*z\r\nprint(max(0,yellow-a)+max(0,blue-b))", "A,B = input().split()\r\ny,g,b = input().split()\r\nc = 2*int(y)+int(g)-int(A)\r\nd = 3*int(b)+int(g)-int(B)\r\nif c>0:\r\n if d>0:print(c+d)\r\n else:print(c)\r\nelse:\r\n if d>0:print(d)\r\n else:print(0)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nneeda = 2 * x + y\r\nneedb = y + 3 * z\r\nprint(max(0, needa - a) + max(0, needb - b))", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nmoo = 0\r\nif 2 * x + y > a:\r\n moo += 2 * x + y - a\r\nif y + 3 * z > b:\r\n moo += y + 3 * z - b\r\nprint(moo)", "a, b = map(int, input().split())\nx, y, z = map(int, input().split())\n\nyellow = 2 * x + y\nblue = y + 3 * z\nans = max(0, yellow - a) + max(0, blue - b)\n\nprint(ans)", "def tricky(l1, l2):\r\n a, b = l1[0], l1[1]\r\n x, y, z = l2[0], l2[1], l2[2]\r\n cy = 2 * x + y\r\n cb = 3 * z + y\r\n res = 0\r\n if cy > a:\r\n res += (cy-a)\r\n if cb > b:\r\n res += (cb - b)\r\n if res < 0:\r\n return 0\r\n return res\r\n\r\nm = list(map(int, input().split()))\r\nn = list(map(int, input().split()))\r\nprint(tricky(m,n))", "import sys\r\n\r\nY, B = sys.stdin.readline().strip().split(' ')\r\nY= int(Y)\r\nB= int(B)\r\n[y1,g1,b1] = sys.stdin.readline().strip().split(' ')\r\ny1= int(y1)\r\ng1= int(g1)\r\nb1= int(b1)\r\n\r\nY = Y-g1\r\nB = B-g1\r\n\r\nY = (y1*2)-Y\r\nB = (b1*3)-B\r\nif Y<0:\r\n\tY=0\r\nif B<0:\r\n\tB=0\r\n\r\nt=B+Y\r\nprint(t)", "a = [];\r\ns = input();\r\nt=\"\";\r\nfor i in range(len(s)):\r\n\tt += s[i];\r\n\tif (s[i] == ' '):\r\n\t\ta.append((int)(t)); \t\r\n\t\tt = \"\";\r\na.append((int)(t));\r\n#print(a);\r\ns1 = input();\r\nt = \"\";\r\nb=[];\r\nfor i in range(len(s1)):\r\n\tt += s1[i];\r\n\tif (s1[i] == ' '):\r\n\t\tb.append((int)(t));\r\n\t\tt = \"\";\r\nb.append((int)(t));\r\nneed_yellow = b[0] * 2 + b[1];\r\nneed_blue = b[1] + 3*b[2];\r\nans1 = need_yellow - a[0];\r\nans2 = need_blue - a[1];\r\nif (ans1 < 0):\r\n\tans1 = 0;\r\nif (ans2 < 0):\r\n\tans2 = 0;\r\nprint (ans1+ans2);\r\n#n = x * 2 + y * 2 + 3 * z;\r\n#print(n-a-b);\r\n", "a, b = map(int, input().split() )\nx, y, z = map(int, input().split() )\nY = 2*x + y\nB = y + 3*z\nprint(max(0, Y-a) + max(0, B-b) )\n", "R=lambda:map(int,input().split())\r\na,b=R()\r\nx,y,z=R()\r\nprint(max(0,2*x+y-a)+max(0,y+3*z-b))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"ot.out\",\"w\")\r\n\r\nA,B=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nsumm=0\r\ny1=0\r\nb1=0\r\ny1=(x*2)+y\r\n\r\nb1=y+(3*z)\r\n\r\nsumm=0\r\nif y1>A:\r\n\tsumm+=y1-A\r\nif b1>B:\r\n\tsumm+=b1-B\r\nprint(summ)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nk=0\r\na=a-(x)*2-y\r\nif a<0:k=k+abs(a)\r\nb=b-(z)*3-y\r\nif b<0:k=k+abs(b)\r\nprint(k)\r\n\r\n", "A,B = [int(i) for i in input().split(' ')]\r\nx,y,z = [int(j) for j in input().split(' ')]\r\nprint((x * 2 + y - A)*(x * 2 + y - A > 0) + (z * 3 + y - B)*(z * 3 + y - B > 0))", "a = list(input().split(' '))\r\nx , y = int(a[0]), int(a[1])\r\narr = list(input().split(' '))\r\na , b , c = int(arr[0]), int(arr[1]), int(arr[2])\r\nres = 0\r\nif ( 2 * a + b - x > 0):\r\n res += 2 * a + b - x\r\nif (b + 3 * c - y > 0):\r\n res += b + 3 * c - y\r\nprint(res)\r\n", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\na = 0\r\nb = 0\r\na += 2 * x + y\r\nb += 3 * z + y\r\nans = 0\r\nif a > A:\r\n ans += a - A\r\nif b > B:\r\n ans += b - B\r\nprint(ans)\r\n", "R=lambda:map(int,input().split())\na,b=R()\nx,y,z=R()\nprint(max(2*x+y-a,0)+max(y+3*z-b,0))\n\n\n\n\n# Made By Mostafa_Khaled", "a,b = list(map(int, input().split())) # Yellow and blue crystals available\r\nyl,gr,bl = list(map(int, input().split())) # Yellow, green, and blue balls required\r\nreq_a = yl * 2 + gr - a\r\nreq_b = gr + bl * 3 - b\r\nif req_a >= 0 and req_b >= 0:\r\n print(req_a+req_b)\r\nelif req_a >= 0:\r\n print(req_a)\r\nelif req_b >= 0:\r\n print(req_b)\r\nelse:\r\n print(0)", "yt, bt = map(int, input().split(' '))\ny, g, b = map(int, input().split(' '))\nyr = y*2+g\nbr = g+3*b\nprint(max(yr-yt, 0) + max(br-bt, 0))\n", "def no_of_crystals(nyc, nbc, nyb, ngb, nbb):\r\n blue_needed = (3*nbb)+ngb\r\n yellow_needed = (2*nyb)+ngb\r\n total = 0\r\n if (blue_needed - nbc) > 0:\r\n total += blue_needed - nbc\r\n if(yellow_needed - nyc) > 0:\r\n total += yellow_needed - nyc\r\n return total\r\n\r\nnyc, nbc = input().split()\r\nnyb, ngb, nbb = input().split()\r\ncount = no_of_crystals(int(nyc), int(nbc), int(nyb), int(ngb), int(nbb))\r\nif count > 0:\r\n print(count)\r\nelse:\r\n print(0);", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\ns=0\r\nif y+2*x>a:s+=y+2*x-a\r\nif y+3*z>b:s+=y+3*z-b\r\nprint(s)", "[A,B] = map(int, input().split())\r\n[x,y,z] = map(int, input().split())\r\nyellow=2*x+y\r\nblue=3*z+y\r\ncount=int(0)\r\nif yellow>A:\r\n count=yellow-A\r\nif blue>B:\r\n count=count+(blue-B)\r\nprint(count)", "def read():\n return map(int, input().split())\n\na, b = read()\nx, y, z = read()\n\nnum_a = max(x * 2 + y - a, 0)\nnum_b = max(y + z * 3 - b, 0)\n\nprint(num_a + num_b)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\ny1=0\r\nif (2*x+y)>a:\r\n y1=(2*x+y)-a\r\nif 3*z+y >b:\r\n y1+=3*z+y-b\r\nprint(y1)\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nans1=2*x+y\r\nans2=y+3*z\r\nres=max(0,ans1-a)+max(0,ans2-b)\r\nprint(res)", "#Coder_1_neel\r\na,b=map(int,input().split())\r\ny,g,bl=map(int,input().split())\r\ny=(y*2)+(g)\r\nbl=(bl*3)+g\r\nz=max(0,y-a)\r\nu=max(0,bl-b)\r\nprint(z+u)", "A,B = map(int,input().split())\r\ny,g,b = map(int,input().split())\r\n\r\nr_A, r_B = 0,0\r\n\r\nr_A += 2*y\r\nr_A += g\r\nr_B += 3*b\r\nr_B += g\r\n\r\nprint(max(0,r_A-A)+max(0,r_B-B))\r\n", "Y,B=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nreqA=2*x+y\r\nreqB=y+3*z\r\nres=0\r\n\r\nif(reqA>Y):\r\n res=res+reqA-Y\r\nif(reqB>B):\r\n res=res+reqB-B\r\nprint(res)\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nprint(max(0,(2*x +y -a))+ (max(0,3*z+y -b)))", "a,b = map(int,input().split())\r\ny,g,bl = map(int,input().split())\r\na-=2*y\r\nb-=3*bl\r\na-=g\r\nb-=g\r\nif a >= 0 and b >= 0:print(0)\r\nelif a <= 0 and b >= 0:print(abs(a))\r\nelif a >= 0 and b <= 0:print(abs(b))\r\nelse:print(abs(a)+abs(b))", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\ntotal_yellow = 2 * x + y\r\ntotal_blue = 3 * z + y\r\n\r\nneeded = 0\r\n\r\nif total_yellow > a:\r\n needed += total_yellow - a\r\n\r\nif total_blue > b:\r\n needed += total_blue - b\r\n\r\nprint(needed)\r\n", "a,b=[int(a) for a in input().split()]\r\nx,y,z=[int(x) for x in input().split()]\r\ncount1=2*(x)+y\r\ncount2=y+3*z\r\nans=0\r\nif(count1>=a):\r\n ans=count1-a\r\nif(count2>=b):\r\n ans=ans+count2-b\r\nprint(ans) \r\n \r\n ", "import sys\r\n\r\ndef main():\r\n x, y, a, b, c = map(int, sys.stdin.read().strip().split())\r\n return abs(min(x - a*2 - b, 0)) + abs(min(y - b - 3*c, 0))\r\n \r\nprint(main())\r\n", "a,b = map(int, input().split())\nx, y, z = map(int, input().split())\n\nans = max(0, 2*x+y-a)+max(0, 3*z+y-b)\nprint(ans)\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nprint(max(0, x * 2 + y - a) + max(0, y + 3 * z - b))", "x, y = [int(i) for i in input().split()]\r\na, b, c = [int(i) for i in input().split()]\r\nk = a*2 + b\r\nl = c*3 + b\r\nk -= x\r\nif k < 0:\r\n k = 0\r\nl -= y\r\nif l < 0:\r\n l = 0\r\nprint(l + k)\r\n", "p=list(map(int, input().split()))\r\nq=list(map(int, input().split()))\r\na=p[0]\r\nb=p[1]\r\nx=q[0]\r\ny=q[1]\r\nz=q[2]\r\nyl=2*x+y\r\nbl=y+3*z\r\nr=0\r\nif yl>a:\r\n r=r+abs(a-yl)\r\nif bl>b:\r\n r=r+abs(b-bl)\r\nprint(r)", "y_b,b_b=map(int,input().split())\r\nr_yb,r_gb,r_bb=map(int,input().split())\r\ntr_yb=r_yb*2+r_gb\r\ntr_bb=3*r_bb+r_gb\r\nball_req=0\r\nif tr_yb-y_b>0:\r\n ball_req=tr_yb-y_b\r\nif tr_bb-b_b>0:\r\n ball_req=ball_req+(tr_bb-b_b)\r\nprint(ball_req)", "Y,B=map(int,input().split())\r\ny,g,b=map(int,input().split())\r\nye=Y-(g+(2*y))\r\nbl=B-(g+(3*b))\r\nif ye<0 or bl<0:\r\n\tprint(abs(min(ye,bl,ye+bl)))\r\nelse:\r\n\tprint(\"0\")", "[a, b] = list(map(int, input().split(\" \")))\n[x, y, z] = list(map(int, input().split(\" \")))\nprint(max(2*x + y-a, 0) + max(3*z + y-b, 0))\n", "yellow_crystals, blue_crystals = map(int,input().split())\r\nyellow, green, blue = map(int,input().split())\r\ntotal_yellow = yellow*2 + green*1\r\ntotal_blue = blue * 3 + green*1\r\nreq_crystals = 0\r\nif yellow_crystals < total_yellow :\r\n\treq_crystals += (total_yellow - yellow_crystals)\r\nif blue_crystals < total_blue :\r\n\treq_crystals += (total_blue - blue_crystals)\r\nprint(req_crystals)", "# cook your dish here\r\n\r\ndef main():\r\n A,B = list(map(int, input().strip().split()))\r\n yellow,green,blue = list(map(int, input().strip().split()))\r\n \r\n yelreq = 0\r\n blureq = 0\r\n \r\n # for yellow balls\r\n yelreq = 2*yellow\r\n \r\n # green balls \r\n yelreq += green\r\n blureq += green\r\n \r\n # blue balls \r\n blureq += 3*blue\r\n \r\n reqs = 0\r\n if A<yelreq:\r\n reqs += yelreq - A\r\n if B<blureq:\r\n reqs += blureq - B\r\n\r\n print(reqs)\r\n \r\nmain()\r\n", "a,c = map(int,input().split())\r\ny,g,b = map(int,input().split())\r\ne = y*2+g\r\nf = g+b*3\r\nk = 0\r\nif e>a:\r\n k+=e-a\r\nif f>c:\r\n k+=f-c\r\nprint(k)", "# https://codeforces.com/problemset/problem/912/A\r\nyelcr,blucr=map(int,input().split())\r\nyb,gb,bb=map(int,input().split())\r\n\r\nyelreq=yb*2 +gb\r\nblureq=bb*3+gb\r\nreq=0\r\nif yelcr<yelreq:\r\n req+=yelreq-yelcr\r\nif blureq>blucr:\r\n req+=blureq-blucr\r\nprint(req)\r\n", "a,b=map(int,input().split(' '))\r\nx,y,z=map(int,input().split(' '))\r\n\r\ndy=2*x+y-a\r\ndb=y+3*z-b\r\n\r\nif dy<0:dy=0\r\nif db<0: db=0\r\n\r\nprint(dy+db)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\na -= 2*x+y\r\nb -= 3*z+y\r\n#print(a, b)\r\nl = [a, b]\r\nz = 0\r\nfor i in l:\r\n\tif i < 0:\r\n\t\tz += i\r\nprint(abs(z))", "A,B = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\nA1 = 2*x + y - A\r\nB1 = 3*z + y - B\r\nfinal = 0\r\nif A1 > 0:\r\n final = final + A1\r\nif B1 > 0:\r\n final = final + B1\r\nprint(final)", "y, b = map(int, input().split())\r\nyb, gb, bb = map(int, input().split())\r\nreqY = (2*yb + gb) - y if (2*yb + gb) - y>0 else 0\r\nreqB = (3*bb + gb) - b if (3*bb + gb) - b>0 else 0\r\nreq = reqY+reqB\r\nprint(req)", "\nYc,Bc = map(int,input().split())\nyB,gB,bB = map(int,input().split())\n\nprint(max((yB*2+gB)-Yc,0)+max((gB+bB*3)-Bc,0))\n", "a,b=list(map(int,input().split()))\r\nx,y,z=list(map(int,input().split()))\r\ntotal_blue=3*z+y\r\ntotal_yellow=2*x+y\r\nans=0\r\nif(b<total_blue):\r\n ans+=total_blue-b\r\nif(a<total_yellow):\r\n ans+=total_yellow-a\r\nprint(ans)", "[a, b] = map(int, input().split())\r\n[x, y, z] = map(int, input().split())\r\n\r\ncrys1 = 2*x+y-a\r\ncrys2 = 3*z+y-b\r\n\r\nif crys1 < 0:\r\n crys1 = 0\r\nif crys2 < 0:\r\n crys2 = 0\r\n\r\nprint(crys1+crys2)", "\r\n\r\na, b = map(int,input().split())\r\nx, y, z = map(int,input().split())\r\nzh = 2*x+y-a\r\nif zh<0: zh = 0\r\ns = y+3*z-b\r\nif s<0: s = 0\r\nprint(zh+s)\r\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nyellow, blue = 0, 0\r\n\r\nyellow += x * 2\r\nyellow += y\r\nblue += y\r\nblue += 3 * z\r\n\r\ny_need = max(0, yellow - a)\r\nb_need = max(0, blue - b) \r\nprint(y_need + b_need)", "# your code goes here\r\nA,B=map(int,input().split(\" \"))\r\nx,y,z=map(int,input().split())\r\ncy=2*x+y\r\ncb=3*z+y\r\nans=max(0,cy-A)\r\nans+=max(0,cb-B)\r\nprint(ans)", "crystal = input().split()\r\ny_c = int(crystal[0])\r\nb_c= int(crystal[1])\r\n\r\nballs= input().split()\r\nyellow=int(balls[0])\r\ngreen= int(balls[1])\r\nblue=int(balls[2])\r\n\r\nneed_yellow= 2*yellow + green\r\nneed_blue= green + 3*blue\r\n\r\nans_yellow=ans_blue=0\r\nif y_c<need_yellow:\r\n ans_yellow= need_yellow - y_c\r\nif b_c< need_blue:\r\n ans_blue= need_blue - b_c\r\n\r\nprint(ans_yellow + ans_blue)", "a,b=map(int,input().split())\r\nx,y,z=map(int, input().split())\r\nm=max(x*2+y-a,0)\r\nM=max(0,y+3*z-b)\r\nprint(m+M)", "import sys\r\n\r\nsys.setrecursionlimit(10**5)\r\nint1 = lambda x: int(x)-1\r\np2D = lambda x: print(*x, sep=\"\\n\")\r\ndef II(): return int(sys.stdin.buffer.readline())\r\ndef MI(): return map(int, sys.stdin.buffer.readline().split())\r\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\r\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\r\ndef BI(): return sys.stdin.buffer.readline().rstrip()\r\ndef SI(): return sys.stdin.buffer.readline().rstrip().decode()\r\ninf = 10**16\r\nmd = 10**9+7\r\n# md = 998244353\r\n\r\na,b=MI()\r\nx,y,z=MI()\r\nyel=x*2+y\r\nbul=y+z*3\r\nprint(max(0,yel-a)+max(0,bul-b))\r\n", "a , b = map ( int , input (). split ())\r\nx , y , z = map ( int , input (). split ())\r\n\r\nyellow = 2 * x + y \r\nblue = y + 3 * z \r\nans = max ( 0 , yellow - a ) + max ( 0 , blue - b ) \r\n\r\nprint ( ans )", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\ncnt=0\r\nif((2*x+y)>a):\r\n cnt+=(2*x+y-a)\r\nif((y+3*z)>b):\r\n cnt+=(y+3*z-b)\r\nprint(cnt)", "a = [2,[1,1],3]\r\ny,b=map(int,input().split())\r\narr = list(map(int,input().split()))\r\nfor i,ar in enumerate(arr):\r\n if i==1:\r\n for j in range(2):\r\n a[i][j]*=ar\r\n else:\r\n a[i]*=ar\r\nyc=a[0]+a[1][0]\r\nbc=a[1][1]+a[2]\r\ndy=yc-y\r\ndb=bc-b\r\nans = 0\r\nif dy>0:\r\n ans+=dy\r\nif db>0:\r\n ans+=db\r\nprint(ans)", "y,b=map(int,input().split())\r\np,q,r=map(int,input().split())\r\nreqy=2*p+q\r\nreqb=3*r+q\r\nres=0\r\nif reqy>y:\r\n res+=reqy-y\r\nif reqb>b:\r\n res+=reqb-b\r\nprint(res)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n \r\nyellow = 2 * x + y\r\nblue = y + 3 * z\r\nans = max(0, yellow - a) + max(0, blue - b)\r\n \r\nprint(ans)", "a, b = [int(i) for i in input().split()]\r\n\r\nx, y, z = [int(i) for i in input().split()]\r\n\r\nres1 = 2*x + y\r\nres2 = 3*z + y\r\n\r\nres = 0\r\n\r\nif res1 > a:\r\n res += res1 - a\r\nif res2 > b:\r\n res += res2 - b\r\n\r\nprint(res)", "yellow, blue = map(int, input().split())\r\ny, g, b = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nyt = y * 2 + g\r\nbt = g + b * 3\r\n\r\nyc = yellow - yt\r\nif yc < 0:\r\n count += abs(yc)\r\n\r\nbc = blue - bt\r\nif bc < 0:\r\n count += abs(bc)\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n# while True:\r\n# if yellow > 0:\r\n# y = ny * 2\r\n# yellow -= y\r\n# yellow = yellow - g\r\n# break\r\n# else:\r\n# yellow += 1\r\n# count += 1\r\n# break\r\n#\r\n# while True:\r\n# if blue > 0:\r\n# blue = blue - g\r\n# nb = nb * 3\r\n# blue = blue - nb\r\n# break\r\n# else:\r\n# blue += 1\r\n# count += 1\r\n# break\r\n#\r\n# print(count)\r\n", "A, B = map(int, input().split())\nx, y, z = map(int, input().split())\n\nyellow_needed = 2*x + y\nblue_needed = 3*z + y\n\nextra_yellow = max(0, yellow_needed - A)\nextra_blue = max(0, blue_needed - B)\n\nprint(extra_yellow + extra_blue)\n", "A,B=map(int,input().split(' '))\r\nx,y,z=map(int,input().split(' '))\r\ns=0\r\nif((A-(x*2+y))<0 ):\r\n s=s+(x*2+y)-A\r\n\r\nif(B-(y+z*3))<0 :\r\n s=s+(y+z*3)-B\r\n\r\n\r\nprint(s)\r\n", "c, b = map(int, input().split())\nx, y, z = map(int, input().split())\nprint(max(0, ((3 * z) + y) - b) + max(0, ((2 * x) + y) - c))\n", "a,b=list(map(int,input().split()))\r\nx,y,z=list(map(int,input().split()))\r\nA=2*x+y\r\nB=y+3*z\r\nprint(max(0,A-a)+max(0,B-b))", "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,B=read_ints()\n\tx,y,z=read_ints()\n\tprint(max(0,(2*x+y)-A)+max(0, (y+3*z)-B))\n\nsolve()\n", "a, b = (int(i) for i in input().split())\nx, y, z = (int(i) for i in input().split())\nres = max(0, 3 * z + y - b) + max(0, 2 * x + y - a)\nprint(res)\n", "import sys\r\n\r\ncrystals = sys.stdin.readline().split()\r\n\r\nA = int(crystals[0])\r\nB = int(crystals[1])\r\n\r\nballs = sys.stdin.readline().split()\r\n\r\nx = int(balls[0])\r\ny = int(balls[1])\r\nz = int(balls[2])\r\n\r\n\r\nreq_yellow = 2*x + y\r\nreq_blue = 3*z + y\r\n\r\nreq_add = 0\r\n\r\nif req_yellow - A > 0:\r\n req_add += req_yellow - A\r\nif req_blue - B > 0:\r\n req_add += req_blue - B\r\n\r\n\r\nprint(req_add)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Aug 20 20:21:19 2018\r\n\r\n@author: TARUN\r\n\"\"\"\r\n\r\na = [int(i) for i in input().split()]\r\nZ = [int(i) for i in input().split()]\r\nA = a[0]\r\nB = a[1]\r\nx = Z[0]\r\ny = Z[1]\r\nz = Z[2]\r\n\r\nyellow_crystals = 2*x + y\r\nblue_crystals = y + 3*z\r\n\r\nadditional_yellow_crystals = yellow_crystals - A\r\nadditional_blue_crystals = blue_crystals - B\r\n\r\nif (additional_yellow_crystals>=0 and additional_blue_crystals>=0):\r\n ans = additional_yellow_crystals + additional_blue_crystals\r\nif (additional_yellow_crystals>=0 and additional_blue_crystals<0):\r\n ans = additional_yellow_crystals\r\nif (additional_yellow_crystals<0 and additional_blue_crystals>=0):\r\n ans = additional_blue_crystals\r\nif (additional_yellow_crystals<0 and additional_blue_crystals<0):\r\n ans = 0\r\n \r\nprint(ans)\r\n ", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nneeded_yellow = 2 * x + y\r\nneeded_blue = 3 * z + y\r\n\r\nadditional_yellow = max(0, needed_yellow - a)\r\nadditional_blue = max(0, needed_blue - b)\r\n\r\ntotal_additional = additional_yellow + additional_blue\r\n\r\nprint(total_additional)\r\n", "def get_input():\r\n return map(int, input().split())\r\n\r\na, b = get_input() \r\nx, y, z = get_input()\r\n\r\na_ = x * 2 + y\r\nb_ = z * 3 + y\r\n\r\nresult = a_ - a if a_ > a else 0\r\nresult += b_ - b if b_ > b else 0 \r\n\r\nprint(result)", "n, m = map(int,input().split())\r\ny,g,b = map(int,input().split())\r\n\r\nres = max(y * 2 + g - n,0) + max(g+b*3-m, 0)\r\nprint(res)", "arr1 = [int(x) for x in input().split()]\r\narr2 = [int(x) for x in input().split()]\r\noyc = arr1[0]\r\nobc = arr1[1]\r\nyb = arr2[0]\r\ngb = arr2[1]\r\nbb = arr2[2]\r\nval1 = max(0,(2*yb+gb)-oyc)\r\nval2 = max(0,(3*bb+gb)-obc)\r\nprint(val1+val2)\r\n\r\n\r\n\r\n\r\n\r\n", "yc,bc = map(int, input().split())\r\ny,g,b = map(int, input().split())\r\nprint((max((2*y+g)-yc,0) + max((g+3*b)-bc,0)))", "# A. Tricky Alchemy\n\na, b = map(int, input().split())\nx, y, z = map(int, input().split())\n\nrequired_a = x * 2 + y\nrequired_b = y + z * 3\nprint(max(0, required_a - a) + max(0, required_b - b))\n", "a,b=input(\"\").split(\" \")\r\na=int(a);b=int(b)\r\nx,y,z=input(\"\").split(\" \")\r\nx=int(x);y=int(y);z=int(z)\r\nans=0;p=0;q=0\r\np+=2*x;p+=y\r\nq+=y;q+=3*z\r\nif(p>a):\r\n ans+=p-a\r\nif(q>b):\r\n ans+=q-b\r\nprint(ans)", "if __name__ == \"__main__\":\r\n a, b = map(int, input().split())\r\n x, y, z = map(int, input().split())\r\n target_a = 2 * x + y\r\n target_b = y + 3 * z\r\n print(max(0, target_a - a) + max(0, target_b - b))\r\n", "def main():\r\n [yellow_crystals, blue_crystals] = [int(_) for _ in input().split()]\r\n [yellow_balls, green_balls, blue_balls] = [int(_) for _ in input().split()]\r\n\r\n additional_yellow_crystals = max(0, yellow_balls * 2 + green_balls - yellow_crystals)\r\n additional_blue_crystals = max(0, blue_balls * 3 + green_balls - blue_crystals)\r\n result = additional_yellow_crystals + additional_blue_crystals\r\n\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a,b=map(int,input().split(' '))\r\nx,y,z=map(int,input().split())\r\naa=0 if (a>=((x*2)+y)) else ((x*2)+y)-a\r\nbb=0 if (b>=(y+(3*z))) else (y+(3*z))-b\r\nprint(aa+bb)", "yCrystals,bCrystals=[int(i)for i in input().split()]\r\nyellow,green,blue=[int(i)for i in input().split()]\r\nblue_required=0\r\nyellow_required=0\r\nA=green+(yellow*2)\r\nB=green+(blue*3)\r\n\r\nif yCrystals>=A:\r\n yellow_required=0\r\nelse:\r\n yellow_required=A-yCrystals\r\n\r\nif bCrystals>=B:\r\n blue_required=0\r\nelse:\r\n blue_required=B-bCrystals\r\n\r\nprint(yellow_required+blue_required)", "def alchemy(a, b, lst):\r\n y, z, s = lst[0] * 2 + lst[1], lst[2] * 3 + lst[1], 0\r\n if a < y:\r\n s += y - a\r\n if b < z:\r\n s += z - b\r\n if s <= 0:\r\n return 0\r\n return s\r\n\r\n\r\nA, B = [int(i) for i in input().split()]\r\ncolours = [int(j) for j in input().split()]\r\nprint(alchemy(A, B, colours))\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nu = 2 * x + y\r\nv = y + 3 * z\r\nans = max(u - a, 0) + max(v - b, 0)\r\nprint(ans)", "A,B=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\na=2*x+y\r\nb=y+3*z\r\nballs=0\r\nif(A<a):\r\n balls+=a-A\r\nif(B<b):\r\n balls+=b-B\r\nprint(balls)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nc=0\r\nif a<2*x+y:\r\n c+=2*x+y-a\r\n\r\nif b<3*z+y:\r\n c+=3*z+y-b\r\n \r\nprint(c)\r\n", "A,B = map(int, input().split())\r\nX,Y,Z = map(int, input().split())\r\nP = 2 * X + Y\r\nQ = Y + 3 * Z\r\nif A < P:\r\n C = P - A\r\nelse:\r\n C = 0\r\nif B < Q:\r\n D = Q - B\r\nelse:\r\n D = 0\r\nprint(C + D)", "x=input()\r\nk=[int(i) for i in x.split()]\r\ny=input()\r\nj=[int(i) for i in y.split()]\r\nt=0\r\nif (3*j[2]+j[1])>k[1]:\r\n t=3*j[2]+j[1]-k[1]+t\r\nif (j[0]*2+j[1])>k[0]:\r\n t=j[0]*2+j[1]-k[0]+t\r\nprint(t) \r\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nyellow = x*2 + y\r\nblue = y + z*3\r\na -= yellow\r\nb -= blue\r\n\r\ntotal = 0\r\nif a < 0 and b < 0:\r\n total += -(a+b)\r\nelif a < 0:\r\n total += -a\r\nelif b < 0:\r\n total += -b\r\n\r\nprint(total)\r\n", "a, b = [int(s) for s in input().split(' ')]\r\nx, y, z = [int(s) for s in input().split(' ')]\r\nans = max(2 * x + y - a, 0) + max(3 * z + y - b, 0)\r\nprint(ans)", "A,B = [int(p) for p in input().split()]\r\nx,y,z = [int(p) for p in input().split()]\r\nm = 2*x + y\r\nn = 3*z + y\r\nyellow = m-A\r\nblue = n-B\r\nif (yellow >=0 and blue >=0):\r\n print (yellow+blue)\r\nelif(yellow < 0 and blue>0):\r\n print (blue)\r\nelif(yellow > 0 and blue<0):\r\n print (yellow)\r\nelse:\r\n print (0)", "\r\n\r\ndef main():\r\n k, s = list(map(int, input().split(' '))), list(map(int, input().split(' ')))\r\n t: list = [s[0] * 2 + s[1], s[1] + s[2] * 3]\r\n r: int = sum(map(lambda x, y: y-x if (y-x) > 0 else 0, k, t))\r\n print(r)\r\n return True\r\n\r\n\r\nmain()", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nyellow = x * 2 + y\r\nblue = y + z * 3\r\nans = 0\r\nif yellow > a:\r\n ans += abs(yellow - a)\r\nif blue > b:\r\n ans += abs(blue - b)\r\nprint(ans)\r\n\r\n\r\n", "a,b = map(int,input().split())\r\nx, y, z = map(int, input().split())\r\nneda = 2 * x + y\r\nnedb = y + 3 * z\r\nansa = neda - a\r\nansb = nedb - b\r\nif ansa < 0:\r\n ansa = 0\r\nif ansb < 0:\r\n ansb = 0\r\nprint(ansa+ansb)\r\n\r\n", "a,b=map(int,input().split())\r\na1,b1,c1=map(int,input().split())\r\nprint(max((2*a1)+b1-a,0)+max(b1+(3*c1)-b,0))\r\n", "yc, bc= map(int, input().split())\r\nyb, gb, bb= map(int, input().split())\r\n\r\nyreq=2*yb + gb\r\nbreq= 3*bb + gb\r\nsum=0\r\n\r\nif yreq>yc:\r\n sum=sum+(yreq-yc)\r\n\r\nif breq>bc:\r\n sum=sum+(breq-bc)\r\n\r\n\r\nprint(sum)", "y,b=map(int,input().split())\r\nY,G,B=map(int,input().split())\r\nc=0\r\nyr=Y*2+G\r\nbr=B*3+G\r\nif y<yr:\r\n\tc+=yr-y\r\nif b<br:\r\n\tc+=br-b\r\nprint(c)", "a,b = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nyellow=x*2+y\r\nblue=z*3+y\r\na-=yellow\r\nb-=blue\r\nif a>0:\r\n a=0\r\nelse:\r\n a=-a\r\nif b>0:\r\n b=0\r\nelse:\r\n b=-b\r\nprint(a+b)\r\n", "a,b=map(int,input().split())\r\ny,g,bl=map(int,input().split())\r\nk1=0 if y*2+g<=a else y*2+g-a\r\nk2=0 if g+bl*3<=b else g+3*bl-b\r\nprint(k1+k2)\r\n", "A, B = map(int,input().split())\r\nx, y, z = map(int, input().split())\r\nys = 2*x+y\r\nbs = 3*z+y \r\nif ys > A:\r\n yextra = ys-A\r\nelse:\r\n yextra=0\r\nif bs > B:\r\n bextra = bs-B\r\nelse:\r\n bextra=0\r\nprint (yextra+bextra) ", "n,k=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\na=0\r\nb=0\r\na+=(x*2)\r\na+=(y)\r\nb+=y\r\nb+=(z*3)\r\nif n>=a and k>=b:\r\n print(0)\r\nelif n>=a and k<b:\r\n print(b-k)\r\nelif k>=b and n<a:\r\n print(a-n)\r\nelse:\r\n a-=n \r\n b-=k \r\n print(a+b)", "Yellow, Blue = map(int, input().split())\r\nX = list(map(int, input().split()))\r\nNeedY = X[0] * 2 + X[1]\r\nNeedB = X[2] * 3 + X[1]\r\nYellow = (0 if Yellow >= NeedY else abs(Yellow - NeedY))\r\nBlue = (0 if Blue > NeedB else abs(Blue - NeedB))\r\nprint(Blue + Yellow)\r\n", "a1, b1 = input().split()\na = int(a1)\nb = int(b1)\nx1, y1, z1 = input().split()\nx = int(x1)\ny = int(y1)\nz = int(z1)\nu = x * 2 + y - a\nv = z * 3 + y - b\nif(u < 0):\n\tu = 0\nif(v < 0):\n\tv = 0\nprint(u + v)\n\t\t\t \t\t\t\t\t\t\t\t\t\t\t \t \t \t\t \t \t", "a, b = map(int, input().split())\nx, y, z = map(int, input().split())\nkraj = 0\nif y <= a:\n a -= y\nelse:\n kraj += y - a\n a = 0\nif y <= b:\n b -= y\nelse:\n kraj += y - b\n b = 0\nif x * 2 > a:\n kraj += x * 2 - a\nif z * 3 > b:\n kraj += z * 3 - b\nprint(kraj)", "yel, bl = map(int, input().split(' '))\r\nx, y, z = map(int, input().split(' '))\r\n\r\nyel -= (x*2 + y)\r\nbl -= (z*3 + y)\r\n\r\nprint(abs(min(yel, 0) + min(bl, 0)))", "A,B = input().split();\r\nx,y,z = input().split();\r\ndef Ans(A, B, x, y, z):\r\n\tans = 0;\r\n\tyellow = 0;\r\n\tblue = 0;\r\n\t#for yellow ball\r\n\tyellow += x * 2;\r\n\t#for green ball\r\n\tyellow += y * 1;\r\n\tblue += y * 1;\r\n\t#for blue ball\r\n\tblue += z * 3;\r\n\r\n\tif(yellow > A):\r\n\t\tans += yellow - A;\r\n\tif(blue > B):\r\n\t\tans += blue - B;\r\n\r\n\treturn ans;\r\n\r\nprint(Ans(int(A), int(B), int(x), int(y), int(z)));\r\n\r\n", "a,b = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nk = 2*x+y-a\r\nk1= y+3*z-b\r\nif k<0 : k=0\r\nif k1<0 : k1=0\r\nprint(k+k1)", "a,b = list(map(int,input().split()))\nx,y,z = list(map(int,input().split()))\nyy = x*2\nyy = yy + y\nbb = y\nbb = bb + 3*z\n\nyellow_require = abs(min((a-yy),0)) \nblue_require = abs(min((b-bb),0))\nprint(yellow_require+blue_require)\n\n\n# if yellow_require<0:\n# \tyellow_require = abs(yellow_require)\n# else:\n# \tyellow_require=0\n\n# if blue_require<0:\n# \tblue_require=abs(blue_require)\n# else:\n# \tblue_require=0\n\n# print(yellow_require+blue_require)", "y, b = map(int, input().split())\r\nyb, gb, bb = map(int, input().split())\r\nyc = 2*yb+gb\r\nbc = 3*bb+gb\r\nres = 0\r\nif yc>y:\r\n res = yc - y\r\nif bc>b:\r\n res = res + bc - b\r\nprint(res)\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int, input().split())\r\nxx=max(0,x*2-a+y)\r\nzz=max(0,3*z-b+y)\r\nprint(xx+zz)\r\n#12 12 J/B\r\n#3 5 2 J/V/B 11 11 \r\n", "A, B = map(int,input().split())\r\nx, y, z = map(int,input().split())\r\nprint(max(2*x+y-A,0)+max(y+3*z-B,0))", "[A,B]=[int(i) for i in input().split()]\r\n[x,y,z]=[int(i) for i in input().split()]\r\n\r\n# A yellow\r\n# B blue\r\n\r\na=x*2+y\r\nb=y+z*3\r\n\r\nans1=0\r\nans2=0\r\n\r\nif(A-a<0):\r\n\tans1=a-A\r\n\r\nif(B-b<0):\r\n\tans2=b-B\r\n\r\nprint(ans1+ans2)", "def crystalsToBuy(a, b, x, y, z):\r\n toBuy = max(2*x - a, 0)\r\n a = max(a - 2*x, 0) \r\n toBuy += max(3*z - b, 0)\r\n b = max(b - 3*z, 0)\r\n return toBuy + max(y - a, 0) + max(y - b, 0)\r\n \r\na, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nprint(crystalsToBuy(a, b, x, y, z))\r\n", "cyellow,cblue=map(int,input().split())\r\nyellow,green,blue=map(int,input().split())\r\nnyellow=2*yellow+1*green\r\nnblue=1*green+3*blue\r\nc=0\r\nif nyellow<=cyellow:\r\n c=c+0 \r\nelse:\r\n c=c+(nyellow-cyellow)\r\nif nblue<=cblue:\r\n c=c+0 \r\nelse:\r\n c=c+(nblue-cblue)\r\nprint(c)", "n,m = map(int, input().split())\r\nmat = list(map(int, input().split()))\r\nprint(abs(min(0,n-mat[0]*2-mat[1]) + min(0,m-mat[1]-mat[2]*3)))\r\n", "a,b=input().split()\nx,y,z=input().split()\na=int(a)#拥有的黄色数量\nb=int(b)#拥有的蓝色数量\nx=int(x)\ny=int(y)\nz=int(z)\nna=2*x+y#需要的黄色数量\nnb=3*z+y#需要的蓝色数量\nk=0\nif na-a>0:\n k+=na-a\nif nb-b>0:\n k+=nb-b\nprint(k)\n\t\t \t\t \t \t\t\t \t \t \t \t \t\t \t", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nyellow = 2 * x + y\r\nblue = y + 3 * z\r\nprint(max(0, yellow - A) + max(0, blue - B))", "#!/usr/bin/env python\r\n# coding=utf-8\r\n# 817079\r\na,b = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nnn = x*2+y\r\nmm = 3*z+y\r\nk1=0\r\nk2=0\r\nif nn>a:\r\n k1 = nn-a\r\nif mm>b:\r\n k2=mm-b\r\nprint(k1+k2)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nc = 2 * x + y\r\nd = y + 3 * z\r\nprint(max(0,c-a)+max(0,d-b))", "a,b = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\n\r\na1 = x*2+y\r\nb1 = y+3*z\r\n\r\n\r\nx=0\r\nif a-a1<0:\r\n x+=a1-a\r\nif b-b1<0:\r\n x += b1-b\r\nprint(x)\r\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nansa = x * 2 +y\r\nansb = y + z * 3\r\nansa -= a\r\nansb -= b\r\nansa = max(ansa, 0)\r\nansb = max(ansb, 0)\r\nprint(ansa + ansb)", "# Recieving user input\nyellowC, blueC = map(int, input().split())\nyellowB, greenB, blueB = map(int, input().split())\n# Counting the deficit\nyellowC -= (2 * yellowB + greenB)\nblueC -= (greenB + 3 * blueB)\n# Totalling the amount required\nrequiredC = 0\nif yellowC < 0:\n requiredC += yellowC * -1\nif blueC < 0:\n requiredC += blueC * -1\nprint(requiredC)\n", "entrada = input().split()\r\n\r\nyellow = int(entrada[0])\r\nblue = int(entrada[1])\r\n\r\nentrada = input().split()\r\n\r\ny = int(entrada[0])\r\ng = int(entrada[1])\r\nb = int(entrada[2])\r\n\r\nnY = 2*y + g\r\nnB = g + 3*b\r\n\r\nnY -= yellow\r\nnB -= blue\r\n\r\nif nY <= 0 and nB <= 0:\r\n print(0)\r\nelif nB<= 0:\r\n print(nY)\r\nelif nY <= 0:\r\n print(nB)\r\nelse:\r\n print(nY+nB)", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nans = 0\r\na = x*2+y\r\nb = z*3+y\r\n\r\nif a > A:\r\n ans += a - A\r\nif b > B:\r\n ans += b - B\r\n\r\nprint(ans)", "X, Y = map(int, input().split())\r\ny, g, b = map(int, input().split())\r\nreq_yellow = 2 * y + g\r\nreq_blue = g + 3 * b\r\nreq = 0\r\nif req_yellow > X:\r\n req += (req_yellow - X)\r\n\r\nif req_blue > Y:\r\n req += (req_blue - Y)\r\n\r\nprint(req)", "yc,bc = map(int,input().split())\nyb,gb,bb = map(int,input().split())\n\nycr = yb * 2 + gb * 1\nbcr = bb * 3 + gb * 1\n\nye = ycr - yc if ycr > yc else 0\nbe = bcr - bc if bcr > bc else 0\n\nprint(str(ye+be))\n\n \t\t \t \t \t\t\t\t\t\t \t\t\t\t\t\t\t\t", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nyellow, blue = 0, 0\r\nyellow = 2*x + y\r\nblue = 3*z + y\r\n\r\nx = yellow - a if yellow>a else 0\r\ny = blue - b if blue>b else 0\r\n\r\nprint(x+y)", "x,y = map(int,input().split())\r\na,b,c = map(int,input().split())\r\n\r\nif x <= 2*a + b:\r\n\tr = 2*a + b - x\r\nelse:\r\n\tr = 0\r\nif y <= 3*c + b:\r\n\tt = b + 3*c - y\r\nelse:\r\n\tt = 0\r\nprint(r+t)", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nt = max((2 * x + y) - A, 0) + max((3 * z + y) - B, 0)\r\nprint(t)\r\n", "a,b = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\nyellow = 2 * x + y\r\nblue = y + 3*z\r\nn = max(0,yellow - a) + max(0,blue - b)\r\nprint (n)\r\n", "p=input().rstrip().split(' ')\r\nq=input().rstrip().split(' ')\r\ny=int(q[0])*2\r\ng=int(q[1])\r\ny+=(g)\r\nD=0;\r\nb=int(q[2])*3\r\nb+=(g)\r\nt_y=int(p[0])\r\nt_b=int(p[1])\r\nif t_y<y:\r\n D+=(y-t_y)\r\nif t_b<b:\r\n D+=(b-t_b)\r\nprint(D)", "src=input()\r\ny,blu=map(int,src.split())\r\nsrc=input()\r\na,b,c=map(int,src.split())\r\n\r\nres=0\r\n\r\nif 2*a+b>=y:\r\n res+=2*a+b-y\r\nif b+3*c>=blu:\r\n res+=b+3*c-blu\r\n\r\nprint(res)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nprint(max(2*x+y-a,0)+max(3*z+y-b,0))", "from sys import stdin,stdout\r\ny,bl=map(int,stdin.readline().split())\r\na,b,c=map(int,stdin.readline().split())\r\nyr=a*2+b\r\nbr=b*1+c*3\r\nc=0\r\nif yr >= y:\r\n c+=yr-y\r\nif br > bl:\r\n c+=br-bl\r\nstdout.write(str(c))\r\n", "a, b = map(int,input().split())\r\ny,g,bl = map(int,input().split())\r\na = a-(2*y)\r\nb = b-(3*bl)\r\nans = 0\r\nif g>=a and g>=b:\r\n ans = g-a + g-b\r\nelif g>=a and b>=g:\r\n ans = g-a\r\nelif g<=a and b<=g:\r\n ans = g-b\r\nprint(ans)\r\n", "m , n = map(int,input().split())\r\n\r\ny , g , b = map(int,input().split())\r\n\r\nr1 = y * 2 + g * 1\r\nr2 = g * 1 + b * 3\r\n\r\nx1 , x2 = 0 , 0\r\n#print(r1 , r2)\r\nif r1 > m :\r\n x1 = r1 - m\r\n\r\nif r2 > n :\r\n x2 = r2 - n\r\n\r\nif r1 <= m :\r\n x1 = 0\r\n\r\nif r2 <= n :\r\n x2 = 0\r\n\r\nprint(x1 + x2)", "a, b = [int(i) for i in input().split()]\nx, y, z = [int(i) for i in input().split()]\n\nyellow = 2*x + y\nblue = 3*z + y\nneed = 0\na = a - yellow\nb = b - blue\nif a < 0: need += abs(a)\nif b < 0: need += abs(b)\nprint(need)\n\n# r = (yellow+blue) - (a+b)\n# if r <= 0: print(0)\n# else: print(r)\n", "(yellow_crystals, blue_crystals) = map(int, input().split(' '))\n(yellow_balls, green_balls, blue_balls) = map(int, input().split(' '))\n\nyellow_crystals_demand = 2 * yellow_balls + green_balls\nblue_crystals_demand = green_balls + blue_balls * 3\n\nadditional_yellow_crystals = yellow_crystals_demand - yellow_crystals\nadditional_blue_crystals = blue_crystals_demand - blue_crystals\n\nif additional_yellow_crystals >= 0 and additional_blue_crystals >= 0:\n print(additional_yellow_crystals + additional_blue_crystals)\nelif(additional_yellow_crystals <= 0 and additional_blue_crystals >= 0):\n print(additional_blue_crystals)\nelif (additional_yellow_crystals >= 0 and additional_blue_crystals <= 0):\n print(additional_yellow_crystals)\nelse:\n print(0)\n", "x1,x2 = map(int, input().split())\r\nc1,c2,c3 = map(int, input().split())\r\ny=2*c1+c2\r\nb=3*c3+c2\r\nprint(max(0, y-x1)+max(0, b-x2))", "x=input()\r\ny=x.split()\r\nyellow=int(y[0])\r\nblue=int(y[1])\r\nz=input()\r\nr=z.split()\r\ni1=int(r[0])\r\ni2=int(r[1])\r\ni3=int(r[2])\r\nreq=0\r\ny_req=2*i1+i2\r\nb_req=3*i3+i2\r\nif y_req>yellow:\r\n req+=y_req-yellow\r\n \r\nif b_req>blue:\r\n req+=b_req-blue\r\nprint(req)\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\n\r\nyell=2*x+y\r\nblue=y+3*z\r\nres=max(0,yell-a)+max(0,blue-b)\r\n\r\nprint(res)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\na,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\na2=x*2+y;b2=z*3+y\r\nprint(max(0,a2-a)+max(0,b2-b))\r\n", "x,y=map(int,input().split())\r\nz,t,p=map(int,input().split())\r\nprint(max( 0,( (2*z)+t )-x )+max( 0,( (3*p)+t )-y))\r\n\r\n\r\n", "yellow, blue = list(map(int, input().split()))\ny, g, b = list(map(int, input().split()))\ncurrent = [yellow, blue]\nrequired = [y * 2 + g, g + 3 * b]\nif required[0] > current[0] and required[1] > current[1]:\n print(required[0] - current[0] + required[1] - current[1])\nelif required[0] > current[0]:\n print(required[0] - current[0])\nelif required[1] > current[1]:\n print(required[1] - current[1])\nelse:\n print(0)\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nd = 3*z + y\r\nc = y + 2*x\r\nif c <= a:\r\n c = 0\r\nelse:\r\n c -= a\r\n\r\nif d <= b:\r\n d = 0\r\nelse:\r\n d -= b\r\n\r\nprint(c+d)", "yel,bul=map(int,input().split())\r\nyreq,greq,breq=map(int,input().split())\r\nyel-=yreq*2+greq\r\nbul-=breq*3+greq\r\nneed=0\r\nif yel<0 :\r\n need+=(-yel)\r\nif bul<0 :\r\n need+=(-bul)\r\nprint(need)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nprint(max((2*x+y-a),0)+max((3*z+y-b),0))", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nc1 = 2 * x + y\r\nc2 = y + 3 * z\r\nprint (max(0, c1 - A) + max(0, c2 - B))", "[A, B] = map(int, input() .split())\r\n[x, y, z] = map(int, input() .split())\r\ns = max((2 * x + y) - A, 0)\r\nm = max((y + 3 * z) - B, 0)\r\nprint (s + m)", "a, b = input().split()\r\na, b = int(a), int(b)\r\nx, y, z = input().split()\r\nx, y, z = int(x), int(y), int(z)\r\nv = 0\r\noy = a-2*x\r\nog = b-3*z\r\n\r\nif oy > 0:\r\n if og > 0:\r\n q = oy - y\r\n p = og - y\r\n if q < 0:\r\n if p < 0:\r\n v = abs(q) + abs(p)\r\n else:\r\n v = abs(q)\r\n else:\r\n if p < 0:\r\n v = abs(q) + abs(p)\r\n else:\r\n v = 0\r\n else:\r\n q = oy - y\r\n if q < 0:\r\n v = abs(q) + abs(og) + y\r\n else:\r\n v = abs(og) + y\r\nelse:\r\n if og > 0:\r\n p = og - y\r\n if p < 0:\r\n v = abs(p) + abs(oy) + y\r\n else:\r\n v = abs(oy) + y\r\n else:\r\n v = abs(oy) + abs(og) + 2*y\r\n\r\nprint(v)\r\n", "a,b=list(map(int,input().split()))\nx,y,z=list(map(int,input().split()))\nm=2*x+y\nn=y+3*z\nif a>=m and b>=n:\n print(0)\nelif a<m and b>=n:\n print(m-a)\nelif a>=m and b<n:\n print(n-b)\nelse:\n print(m-a+n-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\nx, y, z = map(int, input().split())\r\nA -= (x * 2)\r\nB -= (z * 3)\r\nif A - y >= 0:\r\n A = y\r\nif B - y >= 0:\r\n B = y\r\nprint(-((A - y) + (B - y)))\r\n\r\n", "y, b = [int(x) for x in input().strip().split(\" \")]\n\ndy, dg, db = [int(x) for x in input().strip().split(\" \")]\n\nry = dy *2\nry += dg\nrb = dg\nrb += db * 3\n\ntotalReq = 0;\nif (y - ry) < 0:\n\ttotalReq += abs(y-ry)\nif (b - rb) < 0:\n\ttotalReq += abs(b-rb)\n\nprint(totalReq)", "l=list(input().split(' '))\r\nv=list(input().split(' '))\r\n\r\ny=(int(v[0])*2)+int(v[1])\r\nb=int(v[1])+(int(v[2])*3)\r\n\r\ne=y-int(l[0])\r\nf=b-int(l[1])\r\n\r\nif e<0:\r\n e=0\r\nif f<0:\r\n f=0\r\n\r\na=e+f\r\nprint(a)\r\n", "if __name__ == '__main__':\n #\n crystal_arr = [int(x) for x in input().split(' ')]\n #\n ball_arr = [int(x) for x in input().split(' ')]\n #\n cry_yellow = crystal_arr[0]\n cry_blue = crystal_arr[1]\n #\n req_cry_yellow = ball_arr[0] * 2 + ball_arr[1]\n req_cry_blue = ball_arr[1] + ball_arr[2] * 3\n\n num = 0\n\n if req_cry_yellow > cry_yellow:\n num += req_cry_yellow - cry_yellow\n\n if req_cry_blue > cry_blue:\n num += req_cry_blue - cry_blue\n\n print(num)\n\t \t\t \t \t\t\t\t\t \t\t\t\t\t\t \t \t \t\t", "string = input().split(' ')\r\n\r\na = int(string[0])\r\nb = int(string[1])\r\n\r\nstring = input().split(' ')\r\n\r\nyellow = int(string[0])\r\ngreen = int(string[1])\r\nblue = int(string[2])\r\n\r\nneeded = 0\r\n\r\naNeeded = yellow*2 + green\r\nbNeeded = green + 3*blue\r\n\r\naAdditional = max(aNeeded-a, 0)\r\nbAdditional = max(bNeeded-b, 0)\r\n\r\nprint(str(aAdditional + bAdditional))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Feb 13 16:04:07 2018\r\n\r\n@author: DNARNAprotein\r\n\"\"\"\r\n\r\n\"\"\"\r\nCODEFORCES\r\nhttp://codeforces.com/problemset/problem/912/A\r\n\"\"\"\r\n\r\nA,B=list(map(int,input().split()))\r\nx,y,z=list(map(int,input().split()))\r\n\r\nrequiredA=(2*x)+y\r\nrequiredB=y+(3*z)\r\n\r\nans=0\r\nif A<requiredA:\r\n ans+=requiredA-A\r\nif B<requiredB:\r\n ans+=requiredB-B\r\nprint(ans)", "ay,ab = map(int,input().split())\r\ny,g,b = map(int,input().split())\r\nty = 2*y+1*g\r\ntb = 3*b+1*g\r\ns = 0\r\nif(ay<ty) :\r\n s += ty-ay\r\nif(ab<tb) :\r\n s += tb-ab\r\nprint(s)", "l=lambda:map(int,input().split())\r\na,b=l()\r\nx,y,z=l()\r\nprint(max(0,2*x+y-a)+max(0,y+3*z-b))", "a, b = (int(el) for el in input().split())\r\nx, y, z = (int(el) for el in input().split())\r\n\r\nprint(abs(min(0, a - x * 2 - y)) + abs(min(0, b - y - z * 3))) ", "A,B=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nk1=x*2+y\r\nk2=y+3*z\r\ns=0\r\nif A<k1:\r\n\ts+=k1-A\r\nif B<k2:\r\n\ts+=k2-B\r\nprint(s)", "a, b = map(int,input().split())\r\ny,g,bl = map(int,input().split())\r\na = a-(2*y)\r\nb = b-(3*bl)\r\nr = 0\r\nif g>=a and g>=b:\r\n r = g-a + g-b\r\nelif g>=a and b>=g:\r\n r = g-a\r\nelif g<=a and b<=g:\r\n r = g-b\r\nprint(r)\r\n", "'''\r\nAuthor : InHng\r\nLastEditTime : 2023-11-06 15:14:07\r\n'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n# import pypyjit\r\n# pypyjit.set_param('max_unroll_recursion=-1')\r\nmod = 10 ** 9 + 7 # 998244353\r\n\r\nA, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nprint(max(2 * x + y - A, 0) + max(y + 3 * z - B, 0))\r\n", "j,k=map(int, input().split()) \r\ny,g,b=map(int, input().split()) \r\nl=0;m=0\r\nif j>=2*y:l=max(0,g-(j-2*y))\r\nelse: l=g+(2*y-j)\r\n\r\nif k>=3*b: m=max(0,g-(k-3*b))\r\nelse: m=g+(3*b-k)\r\n\r\nprint(l+m)", "a, b = list(map(int, input().split()))\r\nP, Q, R = list(map(int, input().split()))\r\n\r\n# the problem states that P = 2a | Q = ab | R = 3b \r\n\r\nprint(max(2*P+Q-a,0)+max(3*R+Q-b, 0))", "#for i in range(int(input())):\r\n#arr=list(map(int,input().split()))\r\n#ls=sorted(arr)\r\nn,k=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nY=2*x+y\r\nG=0\r\nB=3*z+y\r\nans=0\r\nif Y>n:\r\n ans+=(Y-n)\r\nif B>k:\r\n ans+=B-k\r\nprint(ans)", "\r\na , b = map(int , input().split())\r\n\r\nx = [int(x) for x in input().split()]\r\n\r\ny = 2 * x[0] + x[1] - a\r\n\r\nif y < 0:\r\n y = 0\r\n\r\nbl = x[1] + 3 * x[2] - b\r\nif bl < 0:\r\n bl = 0\r\nprint(y + bl)", "a, b = list(map(int, input().split(' ')))\r\nx, y, z = list(map(int, input().split(' ')))\r\na -= 2 * x + y\r\nb -= y + 3 * z\r\na, b = min(0, a), min(0, b)\r\nprint(abs(a + b))", "A, B = map(int, list(input().split()))\nx, y, z = map(int, list(input().split()))\n\nprint(max(0, 2*x+y-A) + max(0, 3*z+y-B))\n", "h,b = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nprint(max(0,2*x+y-h)+max(0,3*z+y-b))", "m,n=map(int,input().split())\r\ny,g,b=map(int,input().split())\r\nc=(n-(b*3)-g)\r\nif c > 0:\r\n c=0\r\nd=(m-(y*2)-g)\r\nif d > 0:\r\n d=0\r\nc+=d\r\nif c > 0:\r\n c=0\r\nelse:\r\n c*=-1\r\nprint(c)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nprint(max(0, 2*x + y - a) + max(0, y + 3*z - b))\r\n", "y,bl=map(int,input().split())\r\na,b,c=map(int,input().split())\r\nyc=a*2+b*1\r\nbc=b*1+c*3\r\nans=0\r\nif(yc>y):\r\n ans=ans+(yc-y)\r\nif(bc>bl):\r\n ans=ans+(bc-bl)\r\nprint(ans)\r\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nprint(max((0,2*x+y-a))+max((0,3*z+y-b)))", "a,b=list(map(int ,input().split()))\r\nx,y,z=list(map(int ,input().split()))\r\ntotal_yellow_crystal=x*2+y-a\r\ntotal_blue_crystal=y+z*3-b\r\nl=[]\r\nl.append(total_yellow_crystal)\r\nl.append(total_blue_crystal)\r\nsample=0\r\nfor i in range(0,len(l)):\r\n\tif(l[i]>0):\r\n\t\tsample+=l[i]\r\n\telse:\r\n\t\tcontinue\r\nprint(sample)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nprint(max(0, 2 * x + y - a) + max(0, 3 * z + y - b))", "A,B = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\nc = 0\r\n\r\nA -= x*2+y\r\nB -= z*3+y\r\n\r\nif A<0:\r\n\tc-=A\r\nif B<0:\r\n\tc-=B\r\n\r\nprint(c)", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nyellow_needed = 2 * x + y\r\nblue_needed = 3 * z + y\r\n\r\ngreen_produced = min(y, x)\r\nyellow_remaining = x - green_produced\r\nblue_remaining = B - green_produced\r\n\r\nyellow_additional = max(yellow_needed - yellow_remaining, 0)\r\nblue_additional = max(blue_needed - blue_remaining, 0)\r\nadditional_yellows = blue_additional = 0\r\nif(yellow_needed>A):additional_yellows = yellow_needed - A\r\nif(blue_needed>B):blue_additional = blue_needed - B\r\nadditional_crystals = additional_yellows + blue_additional\r\nprint(additional_crystals)\r\n", "i=lambda:map(int,input().split())\r\na,b=i();x,y,z=i()\r\nprint(max(0,2*x+y-a)+max(0,y+3*z-b))", "\r\nyc, bc = map(int, input().split())\r\nybn, gbn, bbn = map(int, input().split())\r\nycn = (ybn*2)+(gbn)\r\nbcn = (bbn*3)+(gbn)\r\ncn = 0\r\nif (ycn-yc) >= 0:\r\n cn += (ycn-yc)\r\n \r\nif (bcn-bc) >= 0:\r\n cn+=(bcn-bc)\r\n\r\nprint(cn)", "[a,b] = map(int, input().split())\r\n[x,y,z] = map(int, input().split())\r\nyellow_crystals_needed = x*2+y #5\r\nblue_crystals_needed = z*3+y #4\r\nyellow_crystals_used = 0\r\nblue_crystals_used = 0\r\nadditional_yellow_crystals = 0\r\nadditional_blue_crystals = 0\r\n\r\n\r\nif yellow_crystals_needed<=a:\r\n yellow_crystals_used = yellow_crystals_needed \r\nelse:\r\n additional_yellow_crystals = yellow_crystals_needed-a \r\n \r\nif blue_crystals_needed<=b:\r\n blue_crystals_used = blue_crystals_needed\r\nelse:\r\n additional_blue_crystals = blue_crystals_needed - b\r\n \r\nprint(additional_blue_crystals+additional_yellow_crystals)\r\n", "a, b = map(int, input().split())\nx, y, z = map(int, input().split())\nA = 2*x + y\nB = y + 3*z\nans = 0\nif a < A:\n\tans = ans + A - a\nif b < B:\n\tans = ans + B - b\nprint(ans)\n\t \t \t\t\t \t \t \t \t \t \t \t\t \t", "a=input().split()\nb=int(a[0])\nc=int(a[1])\na=input().split()\nd=int(a[0])\ne=int(a[1])\nf=int(a[2])\nb-=d*2+e\nc-=e+f*3\nprint(-min(0,c)-min(0,b))\n \t\t \t\t\t\t\t \t\t \t\t\t\t\t \t \t \t\t", "a,b=[int(i) for i in input().split()]\r\nx,y,z=[int(i) for i in input().split()]\r\ne=2*x+y\r\nf=y+3*z\r\nt=0\r\nif a<e:\r\n t=t+e-a\r\nif b<f:\r\n t=t+f-b\r\nprint(t)\r\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nprint(max(2 * x + y - a, 0) + max(y + 3 * z - b, 0))", "a, b = input().split()\r\n\r\nx, y, z = input().split()\r\n\r\nres_y = (int(x)*2 + int(y)) - int(a)\r\nif res_y < 0: res_y = 0\r\n\r\nres_b = (int(z)*3 + int(y)) - int(b)\r\nif res_b < 0: res_b = 0\r\n\r\nprint (res_y + res_b)\r\n", "R=lambda:list(map(int,input().split()))\r\na,b=R()\r\nx,y,z=R()\r\nA=x+x+y\r\nB=y+3*z\r\nprint(max(0,A-a)+max(0,B-b))", "from math import *\r\nn,m=map(int,input().split())\r\na,b,c=map(int,input().split())\r\ny=2*a+b\r\nbb=b+3*c\r\nprint(max(0,y-n)+max(0,bb-m))\r\n", "A, B = list(map(int, input().split()))\ny, g, b = list(map(int, input().split()))\n\nyc = y * 2 + g\nbc = g + b * 3\n\nans = max(0, yc - A) + max(0, bc - B)\nprint(ans)\n", "a,b=[int(i) for i in input().split()]\r\nx,y,z=[int(i) for i in input().split()]\r\nye=a-x*2\r\nbl=b-y\r\nye-=y\r\nbl-=z*3\r\nm=0\r\nif bl<0:\r\n m+=(-bl)\r\nif ye<0:\r\n m+=(-ye)\r\nprint(m)\r\n", "[a, b] = map(int, input().split())\r\n[x, y, z] = map(int, input().split())\r\n\r\n#Compute the number of yellow crystals needed to make x yellow balls.\r\n#Compute the number of blue crystals needed to make x yellow balls.\r\n#Compute the number of yellow crystals needed to make y green balls.\r\n#Compute the number of blue crystals needed to make y green balls.\r\n#Compute the number of yellow crystals needed to make z blue balls.\r\n#Compute the number of blue crystals needed to make z blue balls.\r\n#Compute total number of yellow crystals to make x yellow balls, y green balls, and z blue balls.\r\n\r\nyellow = 2*x+y-a\r\nblue = 3*z+y -b\r\n\r\nif yellow <0:\r\n yellow = 0\r\n \r\nif blue<0: \r\n blue = 0\r\n \r\nprint (blue+yellow)\r\n", "Y,B=map(int,input().split())\r\ny,g,b=map(int,input().split())\r\nprint(max(2*y+g-Y,0)+max(3*b+g-B,0))\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\np=2*x+y\r\nq=y+3*z\r\nprint(max(0,p-a)+max(0,q-b))", "Y, B = map(int, input().split())\ny, g, b = map(int, input().split())\n\n\n\ny_needed = 0 if Y >= (2*y+g) else (2*y+g-Y)\nb_needed = 0 if B >= (3*b+g) else (3*b+g-B)\n\nprint(y_needed+b_needed)\n\n\n\n\n\n", "a,b = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\na = a-y-(2*x)\r\nb = b-y-(3*z)\r\nif a >= 0 and b >= 0:\r\n print(0)\r\nelse:\r\n if a < 0 and b < 0:\r\n print(abs(-a-b))\r\n elif a < 0:\r\n print(abs(-a))\r\n elif b < 0:\r\n print(abs(-b))", "[a,b]=map(int,input().split())\r\n[c,d,e]=map(int,input().split())\r\nx=a-c*2-d\r\ny=b-d-e*3\r\nif x>=0 and y>=0:\r\n print(\"0\")\r\nelse:\r\n ans=min(x+y,x,y)\r\n print(abs(ans))", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b = [int(i) for i in input().split()]\r\nx, y, z = [int(i) for i in input().split()]\r\nyellow = x * 2 + y\r\nblue = y + z * 3\r\nprint(max(0, yellow - a) + max(0, blue - b))\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nyellow=2*x+y\r\nblue=3*z+y\r\nyl=2*x+y-a if(2*x+y-a>0) else 0\r\nbl=3*z+y-b if(3*z+y-b>0) else 0\r\nprint(yl+bl)\r\n\r\n ", "p,q=map(int,input().split())\nYball,Gball,Bball = map(int,input().split()) #balls needed\nycrys=2*Yball+Gball #crystals needed\nbcrys=Gball+3*Bball\n\na,b=0,0\nif ycrys>p:\n a=ycrys-p\nif bcrys>q:\n b=bcrys-q\nprint(a+b)\n\t\t \t \t \t \t \t \t\t\t\t \t\t\t \t\t\t", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\na=a-2*x\r\na=a-y\r\nb=b-y\r\nb=b-3*z\r\nif a<0 and b<0:\r\n print((a+b)*-1)\r\nelif a<0 and b>=0:\r\n print(a*-1)\r\nelif a>=0 and b<0:\r\n print(b*-1)\r\nelse:\r\n print('0') ", "a,b=map(int,input().split())\r\nc,d,e=map(int,input().split())\r\ns=0\r\nif a>c:\r\n a=a-2*c\r\nelse:\r\n s=s+2*c-a\r\n a=0\r\nif b>e:\r\n b=b-3*e\r\nelse:\r\n s=s+3*e-b\r\n b=0\r\nif a<d:\r\n s=s+d-a\r\nif b<d:\r\n s=s+d-b\r\nprint(s)", "a,b = [int(i) for i in input().split()]\r\nx,y,z = [int(i) for i in input().split()]\r\na1 = 2*x + y\r\nb1 = y + 3*z\r\nprint(max(a1-a,0) + max(b1-b,0))\r\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nyy, bb = x * 2 + y, z * 3 + y\r\nprint((yy - a if yy > a else 0) + (bb - b if bb > b else 0))\r\n", "Y, B = list(map(int, input().split()))\ny, g, b = list(map(int, input().split()))\n\n# y = 2Y, g = YB, b = 3B\nprint(max(2*y+g-Y,0)+max(3*b+g-B, 0))\n", "yellow_crystals, blue_crystals=map(int, input().split())\r\nyball, gball, bball=map(int, input().split())\r\n\r\nneeded_yellow_crystals=2*yball+gball\r\nneeded_blue_crystals=gball+3*bball\r\n\r\nbuy_yellow_crystals=max(needed_yellow_crystals-yellow_crystals, 0)\r\nbuy_blue_crystals=max(needed_blue_crystals-blue_crystals, 0)\r\n\r\nprint (buy_yellow_crystals+buy_blue_crystals)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nx,y,z=input().split()\r\nx=int(x)\r\ny=int(y)\r\nz=int(z)\r\nrb=y+(z*3)\r\nry=(x*2)+y\r\nans=0\r\nif ry>a:ans+=ry-a\r\nif rb>b:ans+=rb-b\r\nprint(ans)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nye = 2*x + y\r\nbl = y + 3*z\r\n\r\no = max(0, ye - a) + max(0, bl - b)\r\nprint(o)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nneed_yel = x*2 + y\r\nneed_blu = y + 3 * z\r\n\r\nans = max(0, need_yel-a) + max(0, need_blu-b)\r\n\r\nprint(ans)\r\n", "yc,bc = map(int,input().split())\r\ny, g, b = map(int, input().split())\r\ny = (2*y) + g - yc\r\nx = (3*b) + g - bc\r\nx = (0 if x<0 else x)\r\ny = (0 if y<0 else y)\r\nprint (x+y if x+y>=0 else 0)", "y,n = map(int,input().split())\r\na,b,c = map(int, input().split())\r\nprint(max(0, 2*a +b -y) + max(0, 3*c +b -n))", "[A,B] = map(int, input() .split())\n[x,y,z] = map(int, input() .split())\nans_y=2*x+y-A\nans_b=y+3*z-B\nif ans_y<0:\n ans_y=0\nif ans_b<0:\n ans_b=0\nprint(ans_y+ans_b)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\n\r\ndef crystal_counter(o_yellow, o_blue, w_yellow, w_green, w_blue):\r\n needed_yellow = (w_green) + (w_yellow * 2) - (o_yellow) if (w_green) + (w_yellow * 2) - (o_yellow) > 0 else 0\r\n needed_blue = (w_green) + (w_blue * 3) - (o_blue) if (w_green) + (w_blue * 3) - (o_blue) > 0 else 0\r\n return needed_blue + needed_yellow\r\n\r\n\r\nprint(crystal_counter(a, b, x, y, z))", "a,b=list(map(int,input().split()))\r\n\r\nx,y,z=list(map(int,input().split()))\r\n\r\n\r\n\r\nt= 3*z+y\r\nr= y+2*x\r\n\r\n\r\n\r\np=0\r\nif b>=t:\r\n pass\r\nelse:\r\n p+=t-b\r\nif a>=r:\r\n pass\r\nelse:\r\n p+=r-a\r\n\r\nprint(p)\r\n", "[a, b] = map(int, input().split())\n[x, y, z] = map(int, input().split())\nx = x * 2\nx = x + y\nif a < x:\n r = x - a\nelse:\n r = 0\nz = z * 3\nz = z + y\nif b < z:\n r = r + (z - b)\nprint(r)\n", "# Amirhossein Alimirzaei\r\n# University Of Bojnourd\r\n# Telegram : @HajLorenzo\r\n# Instagram : amirhossein_alimirzaei\r\n# CodeForcesian ;)\r\n\r\n_1_=list(map(int,input().split()))\r\n_2_=list(map(int,input().split()))\r\n_1_[0]-=_2_[0]*2+_2_[1]*1\r\n_1_[1]-=_2_[1]*1+_2_[2]*3\r\n_3_=0\r\nif _1_[0]<0:\r\n _3_+=abs(_1_[0])\r\nif _1_[1]<0:\r\n _3_+=abs(_1_[1])\r\nprint(_3_)", "[a, b] = map(int, input().split())\r\n[x, y, z] = map(int, input().split())\r\n#Compute the number of yellow crystals needed to make x yellow balls.\r\n#Compute the number of blue crystals needed to make x yellow balls.\r\n#Compute the number of yellow crystals needed to make y green balls.\r\n#Compute the number of blue crystals needed to make y green balls.\r\n#Compute the number of yellow crystals needed to make z blue balls.\r\n#Compute the number of blue crystals needed to make z blue balls.\r\n#Compute total number of yellow crystals to make x yellow balls, y green balls, and z blue balls.\r\nyellow= 2*x+y\r\nblue= 3*z+y \r\ntotal=0\r\ntotal1=0\r\nif yellow > a:\r\n total = yellow - a\r\nif blue > b:\r\n total1 = blue - b\r\ncompletetotal=total+total1\r\nprint (completetotal)\r\n", "y,b=map(int,input().split())\r\na,c,d=map(int,input().split())\r\nq=a*2 + c -y \r\nw=c+d*3-b\r\nif q>=0 and w>=0:\r\n\tprint(q+w)\r\nelif q>=0 and w<0:\r\n\tprint(q)\r\nelif q<0 and w>=0:\r\n\tprint(w)\r\nelse:\r\n\tprint(0)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\na-=2*x\r\na-=y\r\nb-=y\r\nb-=3*z\r\ns=0\r\nif a<=0:\r\n s+=a\r\nif b<=0:\r\n s+=b\r\nprint(-s)", "def main():\r\n a, b = list(map(int, input().split()))\r\n x, y, z = list(map(int, input().split()))\r\n\r\n yellow_crystals_required = 2 * x + y\r\n blue_crystals_required = y + 3 * z\r\n\r\n total = max(0, yellow_crystals_required - a) + max(0, blue_crystals_required - b)\r\n print(total)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "yellow, blue = map(int, input().split())\ny,g,b = map(int, input().split())\n\nyellow_needed = y * 2 + g\nblue_needed = b * 3 + g\n\nr = max(0, yellow_needed - yellow) + max(0, blue_needed - blue)\n\nprint(r)", "[a,b] = map(int, input().split())\r\n[x,y,z] = map(int, input().split())\r\nyellow = 2*x+y\r\nblue = y+3*z\r\nif yellow <= a:\r\n yellows_needed = 0\r\nelse:\r\n yellows_needed = yellow-a\r\nif blue <= b:\r\n blues_needed = 0\r\nelse:\r\n blues_needed = blue-b\r\nprint(blues_needed+yellows_needed)", "x,y = map(int,input().split())\r\na,b,c = map(int,input().split())\r\nsumm = 0\r\nsub = x - 2*a\r\nif sub > 0:\r\n x = sub\r\nelse:\r\n summ += abs(sub)\r\n x = 0\r\n\r\n#print(x,summ)\r\nsub1 = x - b\r\nif sub1 > 0:\r\n x = sub1\r\nelse:\r\n summ += abs(sub1)\r\n x = 0\r\n\r\n#print(x,summ)\r\nsub2 = y-b\r\nif sub2 > 0:\r\n y = sub2\r\nelse:\r\n summ += abs(sub2)\r\n y = 0\r\n\r\n#print(y,summ)\r\nsub3 = y - 3*c\r\nif sub3 > 0:\r\n y = sub3\r\nelse:\r\n summ += abs(sub3)\r\n y = 0\r\n\r\nprint(summ)", "a,b = [int(a) for a in input().split()]\r\nx,y,z= [int(x) for x in input().split()]\r\nyellow=2*x+ y\r\nblue=y+3*z\r\nif a>yellow:temp1=0\r\nelse:temp1=yellow-a\r\nif b>blue:temp2=0\r\nelse:temp2=blue-b\r\nprint(temp1+temp2)\r\n", "s=input()\r\ns1=s.split()\r\na=int(s1[0])\r\nb=int(s1[1])\r\ns=input()\r\ns1=s.split()\r\nx=int(s1[0])\r\ny=int(s1[1])\r\nz=int(s1[2])\r\nn1=2*int(x)+int(y)\r\nn2=int(y)+3*int(z)\r\nn=0\r\nif n1>a:\r\n n+=n1-a\r\nif (n2>b):\r\n n+=n2-b\r\nprint(n)", "l=list(map(int,input().split()))\r\ntemp=list(map(int,input().split()))\r\n\r\n\r\n#yellow=temp[0]\r\n#green=temp[1]\r\n#blue=temp[2]\r\n\r\ntotal1=(temp[-1]*3+temp[1]-l[-1])\r\ntotal2=(temp[0]*2+temp[1]-l[0])\r\nif(total1<=0 and total2<=0):\r\n print(0)\r\nelif(total1>0 and total2<=0):\r\n print(total1)\r\nelif (total2>0 and total1<=0):\r\n print(total2)\r\nelse:\r\n print(total2+total1)", "from sys import stdin\r\n\r\na, b = map(int, stdin.readline().split())\r\nx, y, z = map(int, stdin.readline().split())\r\n\r\nc = 2 * x + y\r\nd = 3 * z + y\r\n\r\nc -= a\r\nd -= b\r\n\r\nif c < 0:\r\n c = 0\r\nif d < 0:\r\n d = 0\r\n\r\nanswer = c + d\r\n\r\nprint(answer)\r\n", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nye = x * 2 - A\r\nif ye < 0:\r\n ye = 0\r\n A = A - (x * 2)\r\nelse:\r\n A = 0\r\n\r\nbl = z * 3 - B\r\nif bl < 0:\r\n bl = 0\r\n B = B - (z * 3)\r\nelse:\r\n B = 0\r\n\r\ngr = y - A\r\nif gr < 0:\r\n gr = 0\r\ngr2 = y - B\r\nif gr2 < 0:\r\n gr2 = 0\r\nprint(bl + ye + gr + gr2)", "import string\r\n\r\n\r\ndef main_function():\r\n Y, B = [int(i) for i in input().split(\" \")]\r\n y, g, b = [int(i) for i in input().split(\" \")]\r\n needed_sum_Y = 2 * y + 1 * g\r\n needed_sum_B = 1 * g + 3 * b\r\n dif_Y = needed_sum_Y - Y\r\n dif_B = needed_sum_B - B\r\n if dif_B >= 0 and dif_Y >= 0:\r\n return dif_B + dif_Y\r\n elif dif_B >= 0 and dif_Y < 0:\r\n return dif_B\r\n elif dif_B < 0 and dif_Y >= 0:\r\n return dif_Y\r\n else:\r\n return 0\r\n \r\n \r\n\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\n\r\nyellow=2*x+y\r\nblue=3*z+y\r\nans=max(0,yellow-a) + max(0, blue-b)\r\nprint(ans)\r\n", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\na1 = x * 2 + y - a\r\nb1 = z * 3 + y - b\r\nprint((a1 if a1>=0 else 0) + (b1 if b1 >= 0 else 0))\r\n", "p,q=map(int,input().split())\r\nYball,Gball,Bball = map(int,input().split()) #balls needed\r\nycrys=2*Yball+Gball #crystals needed\r\nbcrys=Gball+3*Bball\r\n\r\na,b=0,0\r\nif ycrys>p:\r\n a=ycrys-p\r\nif bcrys>q:\r\n b=bcrys-q\r\nprint(a+b)", "import sys,math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\nMOD=998244353 \r\n \r\ndef solve():\r\n x,y=map(int,input().split())\r\n a,b,c=map(int,input().split())\r\n print(max(0,2*a+b-x)+max(0,3*c+b-y))\r\n\r\nt=1 \r\n#t=int(input())\r\nfor i in range(1,t+1):\r\n solve()\r\n", "crystals = input().split(' ')\r\nfor i in range(len(crystals)):\r\n crystals[i] = int(crystals[i])\r\nballs = input().split(' ')\r\nfor i in range(len(balls)):\r\n balls[i] = int(balls[i])\r\nyNeeded = 0\r\nbNeeded = 0\r\nfor i in range(len(balls)):\r\n if i == 0:\r\n yNeeded += balls[i]*2\r\n elif i == 1:\r\n yNeeded += balls[i]\r\n bNeeded += balls[i]\r\n elif i == 2:\r\n bNeeded += balls[i]*3\r\ncrystalsNeeded = 0\r\nif crystals[0] < yNeeded:\r\n crystalsNeeded += yNeeded - crystals[0]\r\nif crystals[1] < bNeeded:\r\n crystalsNeeded += bNeeded - crystals[1]\r\nprint(crystalsNeeded)", "a,b = list(map(int, input().split()))\nx,y,z = list(map(int, input().split()))\naa = 2*x + y\nbb = y + 3*z\nprint(max(bb-b, 0) + max(aa-a, 0))\n", "A, B =map(int,input().split())\r\nx, y, z=map(int,input().split())\r\nyc = 2 * x + 1 * y\r\nbc = 1 * y + 3 * z\r\nneeded = 0\r\nif A < yc:\r\n needed = yc - A\r\nif B < bc:\r\n needed = needed + bc - B\r\nprint(needed)", "a,b = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\nnc=2*x+y\r\nnb=3*z+y\r\ntot=0\r\nif nb > b:\r\n tot += nb - b\r\nif nc > a:\r\n tot += nc - a\r\n\r\nprint(abs(tot))", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nAp = 2 * x + y\r\nBp = y + 3 * z\r\nprint(max(Ap - A, 0) + max(Bp - B, 0))\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nY=2*x+y\r\nB=y+3*z\r\nc=0\r\nif Y>a:\r\n\tc+=(Y-a)\r\nif B>b:\r\n\tc+=(B-b)\r\nprint(c)", "#for _ in range(int(input())):\r\ny,b=map(int,input().split())\r\na,bx,c=map(int,input().split())\r\ns=0\r\nif(y>=2*a):\r\n y-=2*a\r\nelse:\r\n s+=2*a-y\r\n y=0\r\nif(b>=3*c):\r\n b-=3*c\r\nelse:\r\n s+=3*c-b\r\n b=0\r\nif(y<bx):\r\n s+=bx-y\r\nif(b<bx):\r\n s+=bx-b\r\nprint(s)\r\n\r\n\r\n", "yc,bc=map(int,input().split())\r\nyb,gb,bb=map(int,input().split())\r\ny=2*yb+gb\r\nb=3*bb+gb\r\nsumx=0\r\nyr=y-yc\r\nbr=b-bc\r\nif y>yc:\r\n sumx+=yr\r\nif b>bc:\r\n sumx+=br\r\nprint(sumx)", "y,b=[int(x) for x in input().split()]\r\na,u,c=[int(q) for q in input().split()]\r\ny1=2*a+u\r\nb1=3*c+u\r\nk1=0\r\nk2=0\r\nif(y1>y):\r\n k1=y1-y\r\nif(b1>b):\r\n k2=b1-b\r\nprint(k1+k2)\r\n\r\n", "yellow_crystals, blue_crystals = map(int, input().split())\nyellow_balls, green_balls, blue_balls = map(int, input().split())\n\nyellow_crystals -= 2 * yellow_balls\n\nyellow_crystals -= green_balls\nblue_crystals -= green_balls\n\nblue_crystals -= 3 * blue_balls\n\nprint(abs(min(0, yellow_crystals)) + abs((min(0, blue_crystals))))\n", "s1 = input().split()\r\ns2 = input().split()\r\na = int(s1[0])\r\nb = int(s1[1])\r\nx = int(s2[0])\r\ny = int(s2[1])\r\nz = int(s2[2])\r\nc1 = x*2+y\r\nc2 = z*3+y\r\nres = 0\r\nif a-c1<0:\r\n res+=c1-a\r\nif b-c2<0:\r\n res+=c2-b\r\n\r\nprint(res)\r\n", "x, y=map(int, input().split())\r\na, b, c=map(int, input().split())\r\ng=2*a+b-x\r\nh=3*c+b-y\r\nprint(max(0,g)+max(0,h))\r\n\r\n", "a,b=[int(i) for i in input().split()]\r\nx,y,z=[int(i) for i in input().split()]\r\nyreq=(2*x)+y\r\nbreq=y+(3*z)\r\np=0\r\nif a<yreq:\r\n p+=(yreq-a)\r\nif b<breq:\r\n p+=(breq-b)\r\nprint(p)", "yellow,blue=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\n\r\na,b=x*2,z*3\r\nyellow-=a\r\nblue-=b\r\n\r\nc=0\r\nif y>yellow:\r\n\tc=c+y-yellow\r\nif y>blue:\r\n\tc=c+y-blue\r\nprint(c)", "[A, B] = [int(x) for x in input().split()]\r\n[x, y, z] = [int(x) for x in input().split()]\r\nprint(max(2*x + y - A, 0) + max(y + 3*z - B, 0))\r\n", "a , b = map(int , input().split())\r\nx , y ,z = map(int , input().split())\r\n\r\n\r\nrb = 0\r\nry = 0\r\n\r\nif y + (3*z) > b:\r\n\r\n rb = y + (3*z) - b\r\n\r\nif (2*x) + y > a:\r\n\r\n ry = (2*x) + y - a\r\n\r\n\r\nprint(rb + ry)\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nk=int(0)\r\na=a-2*x-y\r\nb=b-y-3*z\r\nif a<0:\r\n k=k+abs(a)\r\nif b<0:\r\n k=k+abs(b)\r\nprint(k)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nsy=(2*x)+y\r\nsb=y+(3*z)\r\ns=0\r\nif sy>a:\r\n s=(sy-a)\r\nif sb>b:\r\n s=s+(sb-b)\r\nprint(s) ", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nneeded_yellow = max((2 * x + y) - a, 0)\r\nneeded_blue = max((3 * z + y) - b, 0)\r\n\r\nprint(needed_yellow + needed_blue)\r\n", "a,b=[int(x) for x in input().split()]\r\nx,y,z=[int(x) for x in input().split()]\r\na1=2*x+y \r\nb1=y+3*z \r\nif a1>=a:\r\n if b1>=b:\r\n print(a1-a+b1-b)\r\n else:\r\n print(a1-a)\r\nelse:\r\n if b1>=b:\r\n print(b1-b)\r\n else:\r\n print(0)", "[a,b]=map(int,input().split())\r\n[c,d,e]=map(int,input().split())\r\nx=a-c*2-d\r\ny=b-d-e*3\r\nif x>=0 and y>=0:\r\n print(\"0\")\r\nelif x<0 and y<0:\r\n print(abs(x+y))\r\nelif x<=0 and y>=0:\r\n print(abs(x))\r\nelif x>=0 and y<=0:\r\n print(abs(y))", "Y, B = [int(i) for i in input().split()]\r\nx,y,z = [int(i) for i in input().split()]\r\n#x = 2Y\r\n#y = Y+B\r\n#z = 3*B\r\nreqb = 3*z+y\r\nreqy = 2*x+y\r\nn = 0\r\nif reqy>Y:\r\n n+=reqy-Y\r\nif reqb > B:\r\n n+=reqb-B\r\nprint(n)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nprint(max(0, x*2+y-a) + max(z*3+y-b, 0))", "A,B=map(int,input().split())\r\ny,g,b=map(int,input().split())\r\ncount=0\r\nX=(y*2)+(g*1)\r\nc1=abs(X-A)\r\nif A<X:\r\n count+=c1\r\nY=(g*1)+(b*3)\r\nc2=abs(Y-B)\r\nif B<Y:\r\n count+=c2\r\n\r\nprint(count)", "if __name__ == \"__main__\":\n A, B = [int(a) for a in input().strip().split()]\n x, y, z = [int(a) for a in input().strip().split()]\n \n need_A = 2*x + y\n need_B = y + 3*z\n\n result_A = 0\n result_B = 0\n if need_A > A:\n result_A = need_A - A\n if need_B > B:\n result_B = need_B - B\n print(str(result_A + result_B))\n\t\t \t\t \t\t\t \t\t \t\t \t \t \t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jun 30 16:37:41 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn,m = map(int, input().split())\r\na,b,c = map(int, input().split())\r\n\r\nn = n - 2*a - b\r\nm = m - b - 3*c\r\nw = 0\r\nif n <0:\r\n w+= abs(n)\r\nif m < 0:\r\n w+=abs(m)\r\nprint(w)", "import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy\n\nsys.setrecursionlimit(10**7)\ninf=10**20\nmod=10**9+7\ndd=[(-1,0),(0,1),(1,0),(0,-1)]\nddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\n# def LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef LS(): return sys.stdin.readline().split()\ndef S(): return input()\n\ndef main():\n a,b=LI()\n c,d,e=LI()\n ans=0\n\n if a<c*2:\n ans+=c*2-a\n a=0\n else:\n a-=c*2\n\n if b<e*3:\n ans+=e*3-b\n b=0\n else:\n b-=e*3\n\n a,b=sorted([a,b])\n if d<a:\n return ans\n else:\n if d>b:\n return ans+(2*d-(a+b))\n else:\n return ans+(d-a)\n\n# main()\nprint(main())\n", "a,d=map(int,input().split())\r\ny,g,b=map(int,input().split())\r\nm=y*2+g\r\nn=b*3+g\r\nc=0\r\nif(m>a):\r\n c+=m-a\r\nif(n>d):\r\n c+=n-d\r\nprint(c)\r\n", "A,B=map(int,input().split())\r\nx,y,z=list(map(int,input().split()))\r\nans=0\r\nif A<=(2*x + y):\r\n\tans+=(2*x + y - A)\r\nif B<=(y + 3*z):\r\n\tans+=(y + 3*z - B)\r\nprint(ans) ", "n,m=map(int,input().split())\r\nd,f,g=map(int,input().split())\r\ny=0\r\nb=0\r\ny+=(2*d)+f\r\nb+=(3*g)+f\r\nif n>=y and m>=b :\r\n print(0)\r\nelif y>n and b>m:\r\n print((y-n)+(b-m))\r\nelif y>n:\r\n print((y-n))\r\nelif b>m:\r\n print((b-m))\r\n ", "yellow, blue = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nanswer1 = x*2+y-yellow\r\nanswer2 = z*3+y - blue\r\nif answer1 > 0:\r\n if answer2 > 0:\r\n print(answer1+answer2)\r\n else:\r\n print(answer1)\r\nelse:\r\n if answer2 > 0:\r\n print(answer2)\r\n else:\r\n print(0)\r\n", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nyr=2*x+y\r\nbr=y+3*z\r\ns=0\r\nif yr>a:\r\n s=s+yr-a\r\nif br>b:\r\n s=s+br-b\r\nprint(s)", "import sys\r\n# sys.stdin = open('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\ninput = lambda:sys.stdin.readline().strip()\r\nli = lambda:list(map(int,input().split()))\r\na,b = li()\r\nx,y,z = li()\r\nprint(max(0,2*x+y-a)+max(0,3*z+y-b))", "g_yellow, g_blue = input().split()\r\nr_yellow,r_green,r_blue = input().split()\r\n\r\nreq_yellow = int(r_yellow)*2 + int(r_green)\r\nreq_blue = int(r_green) + int(r_blue)*3\r\n\r\n\r\nans_yellow = 0\r\nans_blue = 0\r\n\r\nif req_yellow >= int(g_yellow) :\r\n ans_yellow = req_yellow - int(g_yellow)\r\n \r\nif req_blue >= int(g_blue):\r\n ans_blue = req_blue - int(g_blue)\r\n\r\nprint((ans_yellow) +(ans_blue))", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n# Y - 2y, G - 1y 1b, B - 3b\r\n\r\nprint(max(0, 2 * x + y - a) + max(y + 3 * z - b, 0))\r\n", "A, B = [int(i) for i in input().split()]\ry, g ,b = [int(i) for i in input().split()]\ransY = (y * 2) + g - A\ransB = g + (b * 3) - B\rprint(max(0, ansY) + max(0, ansB))\r", "a,b=list(map(int,input().split()))\r\ny,g,bl=list(map(int,input().split()))\r\nyc=y*2\r\nbc=bl*3\r\ngc=g*2\r\na=a-yc-gc/2\r\nb=b-bc-gc/2\r\n# print(a)\r\n# print(b)\r\nif(a<0 and b<0):\r\n print(int(abs(a+b)))\r\nelif a<0:\r\n print(int(abs(a)))\r\nelif b<0:\r\n print(int(abs(b)))\r\nelse:\r\n print(0)\r\n\r\n", "yellow,blue=map(int,input().split())\r\nYELLOW,GREEN,BLUE=map(int,input().split())\r\nYellow=2*YELLOW+GREEN \r\nBlue=3*BLUE+GREEN\r\nif yellow>=Yellow: \r\n yellow=0 \r\n Yellow=0\r\nif blue>=Blue: \r\n blue=0\r\n Blue=0\r\nprint(Yellow-yellow+Blue-blue)", "a,b = list(map(int,input().split()))\nx,y,z = list(map(int,input().split()))\nyy = x*2\nyy = yy + y\nbb = y\nbb = bb + 3*z\n\nyellow_require = (a-yy)\nblue_require = (b-bb)\n\nif yellow_require<0:\n\tyellow_require = abs(yellow_require)\nelse:\n\tyellow_require=0\n\nif blue_require<0:\n\tblue_require=abs(blue_require)\nelse:\n\tblue_require=0\n\nprint(yellow_require+blue_require)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\n\r\nna = x*2+y\r\nnb = z*3+y\r\n\r\nz = lambda l: l if l >= 0 else 0\r\n\r\nt = z(na - a) + z(nb - b)\r\n\r\nprint(t if t > 0 else 0)\r\n", "def solution(l1,l2):\r\n ycr = l1[0]\r\n bcr = l1[1]\r\n #print(ycr,bcr)\r\n yb = l2[0]\r\n gb = l2[1]\r\n bb = l2[2]\r\n \r\n nb = 3*bb+gb\r\n ny = 2*yb+gb\r\n #print(nb,ny)\r\n nb = max(nb-bcr,0)\r\n ny = max(ny-ycr,0)\r\n #print(nb,ny)\r\n return nb+ny\r\n\r\n\r\n\r\ndef answer():\r\n l1 = [int(x) for x in input().split()]\r\n l2 = [int(x) for x in input().split()]\r\n print(solution(l1,l2))\r\nanswer()", "def solve():\r\n n,m=list(map(int,input().split()))\r\n l=list(map(int,input().split()))\r\n m-=(3*l[2]+l[1])\r\n n-=(l[1]+2*l[0])\r\n print(abs(min(m,0))+abs(min(n,0)))\r\nsolve()", "m, n = map(int,input().split());\r\na,b,c=map(int,input().split());\r\nt1=a*2+b;\r\nt2=b+3*c;\r\nif(t1>m):\r\n t1=t1-m\r\nelse:\r\n t1=0\r\nif(t2>n):\r\n t2=t2-n\r\nelse:\r\n t2=0\r\n \r\nprint(t1+t2)", "pin=lambda:map(int,input().split())\r\ny,b=pin()\r\nY,G,B=pin()\r\nreqy=2*Y+G;reqb=G+3*B;\r\nprint(max(0,reqy-y)+max(0,reqb-b))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "ta = tb = 0;\n\na, b = map(int, input().split())\nx, y, z = map(int, input().split())\n\n'''\na = yellow crystals\nb = blue crystals\n\nx = yellow balls\ny = green balls\nz = blue balls\n'''\nta = 2*x + y;\ntb = 3*z + y;\n\np = ta -a\nq = tb -b\n\nif p <=0 and q <=0:\n print('0')\n\nelif p <=0 and q>0:\n print(q)\n \nelif q <=0 and p>0:\n print(p)\n\nelif p >0 and q >0:\n print(p +q) \n", "import sys\r\nR = lambda: map(int, input().split())\r\nn, m = R()\r\nx, y, z = R()\r\nn -= x * 2 + y\r\nm -= z * 3 + y\r\nprint(sum((x * -1 for x in [n, m] if x < 0))) \r\n\r\n", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nprint(max(x*2 + y - A, 0) + max(z*3 + y - B, 0))\r\n", "a,b=map(int,input().split())\r\np,q,r=map(int,input().split())\r\nt=max(2*p+q-a,0)\r\nv=max(3*r+q-b,0)\r\nprint(t+v)\r\n", "n,m=map(int,input().strip().split()[:2])\r\ny,g,b=map(int,input().strip().split()[:3])\r\nyell=(y*2)+g\r\nblu=(b*3)+g\r\nif n>=yell:\r\n\tif m>=blu:\r\n\t\tprint(0)\r\n\telse:\r\n\t\tprint(blu-m)\r\nelse:\r\n\tif m>=blu:\r\n\t\tprint(yell-n)\r\n\telse:\r\n\t\tprint(abs(yell-n)+abs(blu-m))", "# bsdk idhar kya dekhne ko aaya hai, khud kr!!!\r\n# from math import *\r\n# from itertools import *\r\n# import random\r\na, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nu = 2 * x + y\r\nv = y + 3 * z\r\nif a < u:\r\n temp = u - a\r\nelse:\r\n temp = 0\r\nif b < v:\r\n temp1 = v - b\r\nelse:\r\n temp1 = 0\r\nprint(temp + temp1)\r\n", "a, b = list(map(int, input().split()))\r\nx, y, z = list(map(int, input().split()))\r\n\r\nyellow = 2 * x + y\r\nblue = y + 3 * z\r\n# print(yellow - a,blue - b)\r\nc =max(0, yellow - a) + max(0, blue - b)\r\nprint(c)\r\n\r\n", "A,B=map(int,input().split())\r\ny,g,b=map(int,input().split())\r\nyellow_count=(2*y)+g\r\nblue_count=(3*b)+g\r\nres=0\r\nif yellow_count>A:\r\n res+=yellow_count-A\r\nif blue_count>B:\r\n res+=blue_count-B\r\nprint(res)", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nprint(max(0, x * 2 + y - a) + max(0, y + z * 3 - b))", "ab = list(map(int, input().split()))\r\nxyz = list(map(int, input().split()))\r\nyb = [(2 * xyz[0] + xyz[1]), (xyz[1] + 3 * xyz[2])]\r\nresult = [0, 0]\r\nif yb[0] > ab[0]:\r\n\tresult[0] = yb[0] - ab[0]\r\nif yb[1] > ab[1]:\r\n\tresult[1] = yb[1] - ab[1]\r\nprint(result[0] + result[1])", "Y, B = map(int, input().split())\r\ny, g, b = map(int, input().split())\r\nreqY, reqB = 2*y + g, 3*b + g\r\nmisY, misB = max(0, reqY - Y), max(0, reqB - B)\r\nprint(misY + misB)", "a,b=list(map(int,input().split()))\nx,y,z=list(map(int,input().split()))\nty=x*2+y\ntb=y+3*z\nprint(max(0,ty-a)+max(0,tb-b))", "a, b = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\ns1=x*2+y\r\ns2=y+z*3\r\nans = max(0,s1-a) + max(0,s2-b)\r\nprint(ans)", "a,b=map(int,input().split());x,y,z=map(int,input().split());print(max(0,2*x+y-a)+max(0,y+3*z-b))", "n, m = map(int, input().split())\r\n\r\ny, g, b = map(int, input().split())\r\n\r\noy = ((y * 2 + g) - n) if ((y * 2 + g) - n) > 0 else 0\r\nob = ((b * 3 + g) - m) if ((b * 3 + g) - m) > 0 else 0\r\n\r\nprint(oy + ob)", "YC,BC = map(int, input().split())\r\nOY, OG,OB = map(int, input().split())\r\n\r\nsum_yellow_crystals = OY * 2 + OG;\r\nsum_blue_crystals = OB * 3 + OG;\r\n\r\nrequired_yellow_balls = YC - sum_yellow_crystals\r\nrequired_blue_balls = BC - sum_blue_crystals\r\n\r\nrequired_balls = 0\r\nif(required_blue_balls<0):\r\n required_balls += abs(required_blue_balls)\r\n \r\nif(required_yellow_balls<0):\r\n required_balls += abs(required_yellow_balls)\r\n\r\nprint(required_balls)", "y,b=input().split(' ')\r\nay,ag,ab=input().split(' ')\r\ny=int(y)\r\nb=int(b)\r\nay=int(ay)\r\nag=int(ag)\r\nab=int(ab)\r\nb=b-(ab*3)\r\ny=y-(ay*2)\r\nb=b-ag\r\ny=y-ag\r\nbr=0\r\nif(y<0):\r\n\tbr=br-y\r\nif(b<0):\r\n\tbr=br-b\r\nprint(br)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nyel=2*x+y\r\nbl=y+3*z\r\nprint(max(0,yel-a)+max(0,bl-b))\r\n", "import sys\ninput = sys.stdin.readline\n\na, b = [int(i) for i in input().split()]\nx, y, z = [int(i) for i in input().split()]\nprint(max(0, x * 2 + y - a) + max(0, z * 3 + y - b))\n", "a,b = map(int, input().strip().split(' '))\r\nx,y,z = map(int, input().strip().split(' '))\r\n\r\nbl=3*z+y\r\nyl=2*x+y\r\n\r\ns1=bl-b\r\nif s1<0:\r\n s1=0\r\ns2=yl-a\r\nif s2<0:\r\n s2=0\r\n\r\ns=s1+s2\r\n\r\nprint (s)\r\n", "A,B=[int(i) for i in input().split()]\r\nx,y,z=[int(i) for i in input().split()]\r\nDemand_yellow=2*x+y-A\r\nDemand_bule=3*z+y-B\r\nif Demand_yellow<0:\r\n Demand_yellow=0\r\nif Demand_bule<0:\r\n Demand_bule=0\r\nprint(Demand_yellow+Demand_bule)\r\n", "A,B = map(int,input().split())\r\nx,y,z = map(int,input().split())\r\n\r\nans = 0\r\n\r\nyellow_crystal = 2*x+y-A\r\nblue_crystal = y+3*z-B\r\n\r\nif yellow_crystal > 0:\r\n ans += yellow_crystal\r\nif blue_crystal > 0:\r\n ans += blue_crystal\r\nprint(ans)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\na1=2*x+y\r\nb1=3*z+y\r\nif a<a1:\r\n a2=a1-a\r\nelse:\r\n a2=0\r\nif b<b1:\r\n b2=b1-b\r\nelse:\r\n b2=0\r\nprint(a2+b2)\r\n", "r = lambda: map(int,input().split())\r\ny,b = r()\r\nj,k,l = r()\r\n\r\nprint (max(0,(k+3*l)-b) + max(0,(k+2*j)-y))\r\n\r\n", "a,b=list(map(int,input().strip().split(' ')))\na,b=[int(a),int(b)]\nx,y,z=list(map(int,input().strip().split(' ')))\nx,y,z=[int(x),int(y),int(z)]\nyellow=(2*x+y-a)\nif(yellow<0):\n yellow=0\nblue=(3*z+y-b)\nif(blue<0):\n blue=0\nprint(yellow+blue)\n", "n,m=map(int,input().split())\nk=list(map(int,input().split()))\nyellow=(k[0]*2)+k[1]\nblue=k[2]*3+k[1]\ns=0\nif yellow>n:\n s=s+(yellow-n)\nif blue>m:\n s=s+(blue-m)\nprint(s)\n\n \n \n", "A,B=map(int,input().split())\r\ny,g,b=map(int,input().split())\r\na=y*2+g\r\nb=g+3*b\r\na=max(0, a-A)\r\nb=max(0,b-B)\r\nprint(a+b)", "a,b=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nu=2*x+y\r\nv=y+3*z\r\nif a<u:\r\n temp=u-a\r\nelse:\r\n temp=0\r\nif b<v:\r\n temp1=v-b\r\nelse:\r\n temp1=0\r\nprint(temp+temp1)", "[a,b] = map(int, input().split())\r\n[x,y,z] = map(int, input().split())\r\nyellow = 2*x+y\r\nblue = y+3*z\r\nyellows_needed = max(yellow - a, 0)\r\nblues_needed = max(blue - b, 0)\r\nprint(blues_needed+yellows_needed)", "mp = lambda:map(int, input().split())\r\nlmp = lambda:list(map(int, input().split()))\r\nintp = lambda:int(input())\r\ninp = lambda:input()\r\nfinp = lambda:float(input())\r\nsinp = lambda:input().split()\r\nlinp = lambda:list(input())\r\n\r\na, b = mp()\r\nx, y, z = mp()\r\nye = 2 * x + y\r\nbl = 3 * z + y\r\nprint(max(0, ye - a) + max(bl - b, 0))", "y,b=map(int,input().split())\r\nny,ng,nb=map(int,input().split())\r\nty,tb=0,0\r\nty+=(ny*2+ng)\r\ntb+=(ng+3*nb)\r\na1,a2=0,0\r\nif(ty>=y):\r\n a1=ty-y\r\nif(tb>=b):\r\n a2=tb-b\r\nprint(a1+a2)\r\n\r\n", "yc, bc = [int(i) for i in input().split()]\r\ny, g, b = [int(i) for i in input().split()]\r\ntot_y = (2 * y) + g\r\ntot_b = g + (3 * b)\r\n\r\nprint(max(0, tot_y-yc) + max(0, tot_b-bc))", "a,b=[int(v) for v in input().split()]\r\nx,y,z=[int(v) for v in input().split()]\r\nyellow=x*2+y\r\nblue=y+3*z\r\nans1=yellow-a\r\nans2=blue-b\r\nans=0\r\nif ans1>0: ans+=ans1\r\nif ans2>0: ans+=ans2\r\nprint(ans)", "a,b = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\nyc = x * 2 + y\r\nbc = y + z * 3\r\nans = 0\r\nif yc > a:\r\n ans += yc - a\r\nif bc > b:\r\n ans += bc - b \r\nprint(ans)\r\n", "(a, b) = map(int, input().split(\" \"))\r\n(x, y, z) = map(int, input().split(\" \"))\r\nif x * 2 + y <= a:\r\n yellow_needed = 0\r\nelse:\r\n yellow_needed = x * 2 + y - a\r\nif z * 3 + y <= b:\r\n blue_needed = 0\r\nelse:\r\n blue_needed = z * 3 + y - b\r\nprint(yellow_needed + blue_needed)", "a, b = map(int, input().split())\r\n\r\nx, y, z = map(int, input().split())\r\n\r\nprint(max(0, 2*x+y-a)+max(0, 3*z+y-b))\r\n", "a, b = [int(x) for x in input().split()]\r\nx, y, z = [int(x) for x in input().split()]\r\na -= x << 1\r\na -= y\r\nb -= y\r\nb -= 3 * z\r\nt = 0 if a >= 0 else -a\r\nt += -b if b < 0 else 0\r\nprint(t)", "a,b=map(int,input().split())\r\nq,w,e=map(int,input().split())\r\n\r\n\r\nprint(max(0, 2*q+w-a)+max(0,w+3*e-b))\r\n", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nprint(max(0, 2*x + y - A) + max(0, 3*z+y-B))\r\n", "a, b=map(int,input().split())\r\nx, y, z=map(int,input().split())\r\nprint(max(0,2*x+y-a)+max(0,3*z+y-b))", "def solve(A, B, x, y, z):\n b = z*3 + y\n y = x*2 + y\n return max(0, y - A) + max(0, b - B)\n\n\ndef main():\n A, B = list(map(int, input().split()))\n x, y, z = list(map(int, input().split()))\n print(solve(A, B, x, y, z))\n\n\nmain()\n", "A, B = [int(i) for i in input().split()]\r\nx, y, z = [int(i) for i in input().split()]\r\n\r\nneedY = 2*x + y\r\nneedB = 3*z + y\r\n\r\nans = 0\r\nif needY > A:\r\n ans += needY - A\r\nif needB > B:\r\n ans += needB - B\r\nprint(ans)\r\n\r\n", "# Coded By Block_Cipher\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\nfrom collections import Counter\r\n\r\na,b = list(map(int,input().split()))\r\nx,y,z = list(map(int,input().split()))\r\n\r\np = max(0,2*x+y-a)\r\nq = max(0,3*z+y-b)\r\nprint(p+q)", "x,y=map(int,input().split())\r\na,b,c=map(int,input().split())\r\nprint(abs(min(0,(x-2*a-b))+min(0,(y-3*c-b))))", "n,k=map(int,input().split())\r\na,b,c=(map(int,input().split()))\r\nsum1=a*2+b\r\nsum2=b+(c*3)\r\ndiff=0\r\nif(sum1>n):\r\n diff=sum1-n\r\nif(sum2>k):\r\n diff+=sum2-k\r\nprint(diff)", "# Tricky alchemy version 2\n[yc,bc] = map(int,input().split())\n[y,g,b] = map(int,input().split())\nneeded_yc = 2*y+g\nneeded_bc = 3*b+g\nbuy_yc = max(0, needed_yc-yc)\nbuy_bc = max(0, needed_bc-bc)\nprint(buy_yc+buy_bc)\n", "yc, bc = map(int, input().split())\r\nyb, gb, bb = map(int, input().split())\r\n\r\nycn = 2 * yb + gb\r\nbcn = gb + 3 * bb\r\n\r\nscore = 0\r\n\r\nif ycn > yc:\r\n score+=ycn-yc\r\nif bcn > bc:\r\n score+=bcn-bc\r\nprint(score)", "yc,bc=map(int,input().split(\" \"))\r\ny,g,b=map(int,input().split(\" \"))\r\nnyc=y*2+g\r\n# print(nyc)\r\nnbc=b*3+g\r\n# print(nbc)\r\nprint(max(0,nyc-yc)+max(0,nbc-bc))\r\n", "a, b = map(int, input().split())\r\nx,y,z = map(int, input().split())\r\n\r\nprint(max(0,2*x+y-a) + max(0,y+3*z-b))", "Y,B=map(int,input().split())\r\na,b,c=map(int,input().split())\r\nans=0\r\ny=(2*a+b-Y)\r\nb1=(b+3*c-B)\r\nif y>0:\r\n ans=ans+y\r\nif b1>0:\r\n ans=ans+b1\r\nprint(ans)", "# 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\nx,y,z=map(int,input().split())\r\nc=max(0,(2*x)+y-a)\r\nd=max(y+(3*z)-b,0)\r\nprint(c+d)\r\n", "A,B=map(int,input().split())\r\nx,y,z=map(int,input().split())\r\nnyellow=x*2+y\r\nnbleu=z*3+y\r\nif(nyellow<=A):\r\n nyellow=A \r\nif(nbleu<=B):\r\n nbleu=B \r\nprint((nyellow-A)+(nbleu-B))", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nnA = 2*x+y\r\nnB = 3*z+y\r\nr = 0\r\nif nA > A:\r\n r += nA-A\r\nif nB > B:\r\n r += nB-B\r\nprint(r)\r\n", "ye,b=map(int,input().split())\nx,y,z=map(int,input().split())\nye -= 2*x\nye -= y\nb -= y\nb -= 3*z\n\nsum=0\nif ye < 0 :\n sum += abs(ye)\nif b < 0:\n sum += abs(b)\n\nprint(sum)", "A, B = map(int, input().split())\r\nx, y, z = map(int, input().split())\r\nr=0\r\nt=0\r\nSA=(2*x)+y\r\nSB=(3*z)+y\r\nif SA - A > 0:\r\n r=SA-A\r\nif SB-B >0:\r\n t=SB-B\r\nprint(r+t)", "s,b=list(map(int,input().split()))\r\nx,y,z=list(map(int,input().split()))\r\nop=0\r\nc=0\r\nsop=0\r\nop+=(2*x)+y\r\nc+=(3*z)+y\r\nif op>s:\r\n sop+=op-s\r\nif c>b:\r\n sop+=c-b\r\nprint(sop)" ]

[ "import sys\r\nimport random\r\nimport sys\r\nfrom itertools import permutations\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().strip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().strip().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().strip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().strip().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().strip().split()))\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().strip()\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().strip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().strip())\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 def ask(self, lst):\r\n # CF交互题输出询问并读取结果\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n res = self.read_int()\r\n # 记得任何一个输出之后都要 sys.stdout.flush() 刷新\r\n return res\r\n\r\n def out_put(self, lst):\r\n # CF交互题输出最终答案\r\n self.lst(lst)\r\n sys.stdout.flush()\r\n return\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 @staticmethod\r\n def get_random_seed():\r\n # 随机种子避免哈希冲突\r\n return random.randint(0, 10**9 + 7)\r\n\r\n\r\nclass KMP:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def prefix_function(s):\r\n # 计算s[:i]与s[:i]的最长公共真前缀与真后缀\r\n n = len(s)\r\n pi = [0] * n\r\n for i in range(1, n):\r\n j = pi[i - 1]\r\n while j > 0 and s[i] != s[j]:\r\n j = pi[j - 1]\r\n if s[i] == s[j]:\r\n j += 1\r\n pi[i] = j\r\n # pi[0] = 0\r\n return pi\r\n\r\n @staticmethod\r\n def z_function(s):\r\n # 计算 s[i:] 与 s 的最长公共前缀\r\n n = len(s)\r\n z = [0] * n\r\n left, r = 0, 0\r\n for i in range(1, n):\r\n if i <= r and z[i - left] < r - i + 1:\r\n z[i] = z[i - left]\r\n else:\r\n z[i] = max(0, r - i + 1)\r\n while i + z[i] < n and s[z[i]] == s[i + z[i]]:\r\n z[i] += 1\r\n if i + z[i] - 1 > r:\r\n left = i\r\n r = i + z[i] - 1\r\n # z[0] = 0\r\n return z\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 s = [ac.read_str() for _ in range(3)]\r\n\r\n def check(a, b):\r\n c = b + \"#\" + a\r\n f = KMP().prefix_function(c)\r\n m = len(b)\r\n if max(f[m:]) == m:\r\n return a\r\n x = f[-1]\r\n return a + b[x:]\r\n\r\n ind = list(range(3))\r\n ans = sum(len(w) for w in s)\r\n for item in permutations(ind, 3):\r\n t1, t2, t3 = [s[x] for x in item]\r\n cur = len(check(check(t1, t2), t3))\r\n if cur < ans:\r\n ans = cur\r\n ac.st(ans)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import io, os, sys\r\n\r\npypyin = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ncpyin = sys.stdin.readline\r\ninput = pypyin if 'PyPy' in sys.version else cpyin\r\n\r\ndef strput():\r\n return input().decode() if 'PyPy' in sys.version else input()\r\n\r\n# code starts here\r\n\r\ns = [\"\"] * 3\r\nf = [([0] * 3) for x in range(3)]\r\nfail = [[] for x in range(3)]\r\n\r\n\r\ndef compute_lps(pat):\r\n '''compute the failure function of a pattern'''\r\n lps = [-1] * len(pat)\r\n cand = -1\r\n for i in range(1, len(pat)):\r\n while cand >= 0 and pat[i] != pat[cand + 1]:\r\n cand = lps[cand]\r\n if pat[i] == pat[cand + 1]:\r\n cand += 1\r\n lps[i] = cand\r\n return lps\r\n\r\n\r\ndef kmp(ppos, wpos):\r\n '''KMP pattern search algorithm'''\r\n lps = fail[ppos]\r\n pat, word = s[ppos], s[wpos]\r\n cand, i = -1, 0\r\n while i < len(word) and cand + 1 < len(pat):\r\n while cand >= 0 and word[i] != pat[cand + 1]:\r\n cand = lps[cand]\r\n if word[i] == pat[cand + 1]:\r\n cand += 1\r\n i += 1\r\n return cand + 1\r\n\r\n\r\ndef work(a, b, c):\r\n length = len(s[a]) + len(s[b]) + len(s[c]) - f[a][b]\r\n if f[a][b] == len(s[a]):\r\n length -= f[c][b]\r\n else:\r\n length -= f[c][a]\r\n return length\r\n\r\n\r\ndef main():\r\n for i in range(3):\r\n s[i] = strput().rstrip() \r\n for i in range(3):\r\n fail[i] = compute_lps(s[i])\r\n for j in range(3):\r\n if j != i:\r\n f[i][j] = kmp(i, j)\r\n\r\n res = work(0, 1, 2)\r\n res = min(res, work(0, 2, 1))\r\n res = min(res, work(1, 0, 2))\r\n res = min(res, work(1, 2, 0))\r\n res = min(res, work(2, 0, 1))\r\n res = min(res, work(2, 1, 0))\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\"\"\"\r\n#If FastIO not needed, use this and don't forget to strip\r\n#import sys, math\r\n#input = sys.stdin.readline\r\n\"\"\"\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport heapq as h \r\nfrom bisect import bisect_left, bisect_right\r\nimport time\r\n\r\nfrom types import GeneratorType\r\nBUFSIZE = 8192\r\n\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\nfrom collections import defaultdict as dd, deque as dq, Counter as dc\r\nimport math, string\r\n\r\nstart_time = time.time()\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\ndef getMat(n):\r\n return [getInts() for _ in range(n)]\r\n\r\ndef isInt(s):\r\n return '0' <= s[0] <= '9'\r\n\r\nMOD = 998244353 \r\n\r\n\"\"\"\r\nfind front and back overlaps between each string\r\n012\r\n021\r\n102\r\n120\r\n201\r\n210\r\n\"\"\"\r\nfrom itertools import permutations as pp\r\n\r\ndef solve():\r\n S = [listStr(), listStr(), listStr()]\r\n #s = 'ab'*50000\r\n #s = list(s)\r\n #S = [s]*3\r\n overlap = [[0 for j in range(3)] for i in range(3)]\r\n def calc(x,y):\r\n s1, s2 = S[x], S[y]\r\n if not s1: return [0]\r\n if not s2: return [0]\r\n #tail of s1 with head of s2\r\n N = len(s1)\r\n T = [0]*N\r\n pos = 1\r\n cnd = 0\r\n while pos < N:\r\n if s1[pos] == s1[cnd]:\r\n cnd += 1\r\n T[pos] = cnd\r\n else:\r\n while cnd:\r\n cnd = T[cnd-1]\r\n if s1[pos] == s1[cnd]:\r\n cnd += 1\r\n T[pos] = cnd\r\n break\r\n pos += 1\r\n pos = 0\r\n cnd = 0\r\n N2 = len(s2)\r\n T2 = [0]*N2\r\n #p is T, smatch is T2, s is s2, ps is s1, pi is cnd\r\n while pos < N2:\r\n if s2[pos] == s1[cnd]:\r\n cnd += 1\r\n T2[pos] = cnd\r\n else:\r\n while cnd:\r\n cnd = T[cnd-1]\r\n if s2[pos] == s1[cnd]:\r\n cnd += 1\r\n T2[pos] = cnd\r\n break\r\n if cnd == N:\r\n cnd = T[cnd-1]\r\n pos += 1\r\n return T2\r\n \r\n for ii in range(3):\r\n for jj in range(ii+1,3):\r\n X = calc(ii,jj)\r\n if max(X) == len(S[ii]):\r\n S[ii] = ''\r\n y = 0\r\n else:\r\n y = X[-1]\r\n overlap[ii][jj] = y\r\n X = calc(jj,ii)\r\n if max(X) == len(S[jj]):\r\n S[jj] = ''\r\n y = 0\r\n else:\r\n y = X[-1]\r\n overlap[jj][ii] = y\r\n ops = pp('012')\r\n ans = len(S[0])+len(S[1])+len(S[2])\r\n best = ans\r\n for op in ops:\r\n tmp = ans\r\n tmp -= overlap[int(op[0])][int(op[1])]\r\n tmp -= overlap[int(op[1])][int(op[2])]\r\n best = min(best,tmp)\r\n return best\r\n\r\n#for _ in range(getInt()):\r\nprint(solve())\r\n#solve()\r\n\r\n#print(time.time()-start_time)á", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\ndef listStr():\r\n return list(input().strip())\r\n\r\nfrom itertools import permutations as pp\r\n\r\ndef solve():\r\n S = [listStr(), listStr(), listStr()]\r\n overlap = [[0 for j in range(3)] for i in range(3)]\r\n def calc(x,y):\r\n s1, s2 = S[x], S[y]\r\n if not s1: return [0]\r\n if not s2: return [0]\r\n N = len(s1)\r\n T = [0]*N\r\n pos = 1\r\n cnd = 0\r\n while pos < N:\r\n if s1[pos] == s1[cnd]:\r\n cnd += 1\r\n T[pos] = cnd\r\n else:\r\n while cnd:\r\n cnd = T[cnd-1]\r\n if s1[pos] == s1[cnd]:\r\n cnd += 1\r\n T[pos] = cnd\r\n break\r\n pos += 1\r\n pos = 0\r\n cnd = 0\r\n N2 = len(s2)\r\n T2 = [0]*N2\r\n while pos < N2:\r\n if s2[pos] == s1[cnd]:\r\n cnd += 1\r\n T2[pos] = cnd\r\n else:\r\n while cnd:\r\n cnd = T[cnd-1]\r\n if s2[pos] == s1[cnd]:\r\n cnd += 1\r\n T2[pos] = cnd\r\n break\r\n if cnd == N:\r\n cnd = T[cnd-1]\r\n pos += 1\r\n return T2\r\n \r\n for ii in range(3):\r\n for jj in range(ii+1,3):\r\n X = calc(ii,jj)\r\n if max(X) == len(S[ii]):\r\n S[ii] = ''\r\n y = 0\r\n else:\r\n y = X[-1]\r\n overlap[ii][jj] = y\r\n X = calc(jj,ii)\r\n if max(X) == len(S[jj]):\r\n S[jj] = ''\r\n y = 0\r\n else:\r\n y = X[-1]\r\n overlap[jj][ii] = y\r\n ops = pp('012')\r\n ans = len(S[0])+len(S[1])+len(S[2])\r\n best = ans\r\n for op in ops:\r\n tmp = ans\r\n tmp -= overlap[int(op[0])][int(op[1])]\r\n tmp -= overlap[int(op[1])][int(op[2])]\r\n best = min(best,tmp)\r\n return best\r\n\r\nprint(solve())\r\n", "from itertools import permutations\r\n\r\ndef c(a,b):\r\n s=b+'#'+a\r\n n,j=len(s),0\r\n dp=[0]*n\r\n lb=len(b)\r\n for i in range(1,n):\r\n while(j and s[i]!=s[j]):j=dp[j-1]\r\n if(s[i]==s[j]):j+=1\r\n dp[i]=j\r\n if(j==lb):return a\r\n return a[:len(a)-dp[-1]]+b\r\ns=[input() for _ in range(3)]\r\nprint(min(len(c(s[x[0]],c(s[x[1]],s[x[2]]))) for x in permutations([0,1,2])))" ]

[ "N=input()\r\ncnt=[0,0,0,0,0,0,0,0,0,0]\r\nfor c in N:\r\n cnt[ord(c)-48]+=1\r\ncnt[1]-=1\r\ncnt[6]-=1\r\ncnt[8]-=1\r\ncnt[9]-=1\r\nans=[1869,1968,1689,6198,1698,1986,1896]\r\nres=\"\"\r\nmod=0\r\nfor i in range(9,0,-1):\r\n for j in range(cnt[i]):\r\n res+=str(i)\r\n mod=(mod*3+i)%7\r\nres+=str(ans[mod*3%7])\r\nfor i in range(cnt[0]):\r\n res+='0'\r\nprint(res)", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n \r\n# mandatory imports\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom math import log2, ceil, sqrt, gcd, log\r\n\r\n# optional imports\r\nfrom itertools import permutations, combinations\r\n# from functools import cmp_to_key # for adding custom comparator\r\n# from fractions import Fraction\r\nfrom collections import *\r\nfrom bisect import *\r\n# from __future__ import print_function # for PyPy2\r\n# from heapq import *\r\nBUFSIZE = 8192\r\n\r\n\r\n \r\nclass FastIO(IOBase):\r\n\tnewlines = 0\r\n \r\n\tdef __init__(self, file):\r\n\t\tself._fd = file.fileno()\r\n\t\tself.buffer = BytesIO()\r\n\t\tself.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n\t\tself.write = self.buffer.write if self.writable else None\r\n \r\n\tdef read(self):\r\n\t\twhile True:\r\n\t\t\tb = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n\t\t\tif not b:\r\n\t\t\t\tbreak\r\n\t\t\tptr = self.buffer.tell()\r\n\t\t\tself.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n\t\tself.newlines = 0\r\n\t\treturn self.buffer.read()\r\n \r\n\tdef readline(self):\r\n\t\twhile self.newlines == 0:\r\n\t\t\tb = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n\t\t\tself.newlines = b.count(b\"\\n\") + (not b)\r\n\t\t\tptr = self.buffer.tell()\r\n\t\t\tself.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n\t\tself.newlines -= 1\r\n\t\treturn self.buffer.readline()\r\n \r\n\tdef flush(self):\r\n\t\tif self.writable:\r\n\t\t\tos.write(self._fd, self.buffer.getvalue())\r\n\t\t\tself.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n\tdef __init__(self, file):\r\n\t\tself.buffer = FastIO(file)\r\n\t\tself.flush = self.buffer.flush\r\n\t\tself.writable = self.buffer.writable\r\n\t\tself.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n\t\tself.read = lambda: self.buffer.read().decode(\"ascii\")\r\n\t\tself.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\ng = lambda : input().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\n\r\nval = [1, 6, 8, 9]\r\nrem = [None]*7\r\n\r\nfor v in permutations(val):\r\n\tmd = 0\r\n\tfor i in range(len(v)):\r\n\t\tmd += v[i]*(10**i)\r\n\r\n\trem[md%7] = md\r\n\r\n\r\nused = set([1, 8, 6, 9])\r\nzeros = 0\r\nans = []\r\ncmd = 0\r\n\r\nfor v in gbs():\r\n\tif v in used:\r\n\t\tused.remove(v)\r\n\t\tcontinue\r\n\tif v == 0:zeros += 1;continue\r\n\tcmd += ((v%7)*pow(10, len(ans)+4, 7))%7\r\n\tif cmd >= 7:\r\n\t\tcmd %= 7\r\n\tans.append(str(v))\r\n\r\nans.reverse()\r\n# val = int(''.join(ans))*10000\r\n# print(val%7, cmd)\r\nprint(''.join(ans) + str(rem[(7-cmd)%7]) + '0'*zeros)\r\n", "#fk this pos had to get this out off my not solved dumbass question\r\nn = [int(d) for d in input()]\r\nfor x in [1,6,8,9]:\r\n\tfor i in range(len(n)):\r\n\t\tif n[i]==x:\r\n\t\t\tdel n[i]\r\n\t\t\tbreak\r\nprefix = [1869,6189,1689,6198,1698,9861,1896]\r\nL = sum([n[i]*pow(10,len(n)-i-1,7) for i in range(len(n))])%7\r\nprint(prefix[(-L)*pow(10,5*len(n),7)%7],end='')\r\nprint(*n, sep='')", "p, t = {}, input()\r\nfor i in '0123456789': p[i] = 0\r\nfor i in t: p[i] += 1\r\nfor i in '1689': p[i] -= 1\r\n\r\nq = [0] * 7\r\nr = pow(10, (len(t) - 4) % 6, 7)\r\nfor i, j in enumerate([9681, 6819, 6981, 6891, 8691, 9861, 1896]): q[(i * r) % 7] = j\r\n\r\ns = [0] + [int('1' * i) % 7 for i in range(1, 6)]\r\na = b = d = 0\r\nfor i in '0123456789':\r\n b = (a + p[i]) % 6\r\n d -= ((s[b] - s[a]) * int(i)) % 7\r\n a = b\r\n\r\nprint(str(q[d % 7]) + ''.join(i * p[i] for i in '9876543210'))", "rems = {}\r\nfor d1 in {1, 6, 8, 9}:\r\n for d2 in {1, 6, 8, 9} - {d1}:\r\n for d3 in {1, 6, 8, 9} - {d1, d2}:\r\n for d4 in {1, 6, 8, 9} - {d1, d2, d3}:\r\n n = int(str(d1) + str(d2) + str(d3) + str(d4))\r\n rems[n % 7] = n\r\n\r\nnum = input()\r\n\r\nnum = num.replace('1', '', 1)\\\r\n .replace('6', '', 1)\\\r\n .replace('8', '', 1)\\\r\n .replace('9', '', 1)\r\n\r\nrem = 0\r\nfor c in num[::-1]:\r\n rem = ((rem - int(c) + 14) * 5) % 7\r\n\r\nprint(rems[rem], num, sep=\"\")\r\n", "# Made By Mostafa_Khaled \nbot = True \na=input()\n\ncnt=[0]*10\n\nfor i in (1,6,8,9):\n\n\tcnt[i]=-1\n\nfor i in a:\n\n\tcnt[int(i)]+=1\n\nmod = [1869, 1968, 9816, 6198, 1698, 1986, 1896, 1869]\n\nmodCnt=0\n\nfor i in range(1,10):\n\n\tfor j in range(cnt[i]):\n\n\t\tmodCnt= (modCnt*3 + i)%7\n\n\tprint(str(i)*cnt[i], end='')\n\nmodCnt=(10000*modCnt)%7\n\nprint(str(mod[7-modCnt])+'0'*cnt[0])\n\n# Made By Mostafa_Khaled", "S='1689'\r\ns=input()\r\nZ=s.count('0')\r\ns=s.replace('0','')\r\nfor i in S:t=s.index(i);s=s[:t]+s[t+1:]\r\nk=0\r\nfor i in s:k=(k*10+ord(i)-ord('0'))%7\r\nfor a in S:\r\n for b in S:\r\n for c in S:\r\n for d in S:\r\n if len(set(a+b+c+d))==4 and (k*10000+int(a+b+c+d))%7==0:\r\n print(s+a+b+c+d+'0'*Z)\r\n exit()", "import itertools\r\ndigits = [1, 2, 3, 4, 5, 6, 7, 8, 9]\r\n\r\nnumdict = {'all':'1869234570','-1':'2345896','-2':'1345869','-3':'1245986','-4':'1235689','-5':'1234968','-6':'1235948','-8':'1234569','-9':'1234856'}\r\n\r\ndef list2num(numlist):\r\n num = 0\r\n for digit in numlist:\r\n num = num * 10 + digit\r\n #print(num)\r\n #input()\r\n return num\r\n\r\ndef div7(numlist):\r\n pailie = itertools.permutations(numlist)\r\n flag = 0\r\n for yuanshu in pailie:\r\n num = list2num(yuanshu)\r\n if num % 7 == 0:\r\n flag = 1\r\n return num\r\n break\r\n if flag == 0:\r\n return 0\r\n\r\ndef pre_num(num_string):\r\n count = []\r\n for i in range(10):\r\n if str(i) in '1689':\r\n count.append(num_string.count(str(i)) - 1)\r\n else:\r\n count.append(num_string.count(str(i)))\r\n return count\r\n \r\ndef simulinkinput():\r\n tmp = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]\r\n tmp = tmp * 5\r\n for i in range(10, 40):\r\n zhuhe = itertools.combinations(tmp, i)\r\n for yuanshu in zhuhe:\r\n num_string = str(list2num(yuanshu)) + '1689'\r\n main(num_string)\r\n\r\ndef count2num(numlist):\r\n tmplist = []\r\n for i in range(1,len(numlist)):\r\n if numlist[i] > 0:\r\n tmplist.append(i)\r\n return tmplist\r\n\r\ndef main():\r\n num_string = input()\r\n result_string = ['','111111','222222','333333','444444','555555','666666','777777','888888','999999']\r\n res_list = [1,8,6,9]\r\n count = []\r\n count = pre_num(num_string)\r\n result = ''\r\n for i in range(1,10):\r\n if count[i] >= 6:\r\n loop = count[i] // 6\r\n result = result + result_string[i] * loop\r\n count[i] = count[i] % 6\r\n \r\n mincount = min(count[1:])\r\n if mincount > 0:\r\n result = result + '186923457' * mincount\r\n for i in range(1,10):\r\n count[i] = count[i] - mincount\r\n for i in range(9):\r\n numzhlist = count2num(count)\r\n mincount = min(count[1:])\r\n tmpstring = div7(numzhlist)\r\n if tmpstring != 0:\r\n result = result + str(tmpstring) * mincount\r\n for j in numzhlist:\r\n count[j] = count[j] - mincount\r\n else:\r\n break\r\n for i in range(1,10):\r\n for j in range(count[i]):\r\n res_list.append(i)\r\n resnum = div7(res_list)\r\n if resnum == 0:\r\n exit('0')\r\n else:\r\n result = result + str(resnum) + '0' * count[0]\r\n print(result)\r\n #print('%s/7 = %d' %(result,int(result)/7.0))\r\n\r\n \r\nif __name__ == '__main__':\r\n main()\r\n #simulinkinput()\r\n '''\r\n while True:\r\n main()\r\n input()\r\n '''\r\n # print(__name__)\r\n", "from itertools import permutations\r\n\r\nt, r = [0, 1, 4, 6, 5, 2], {i: 0 for i in '0123456789'}\r\nfor i in input(): r[i] += 1\r\nfor i in '1689': r[i] -= 1\r\n\r\ns = a = b = 0\r\nfor i in '9876543210':\r\n a, b = b, (b + r[i]) % 6\r\n s += int(i) * (t[b]\t- t[a])\r\nd = pow(10, b, 7)\r\n\r\nfor q in permutations('1689'):\r\n q = ''.join(q)\r\n if (s + d * int(q)) % 7 == 0:\r\n print(q + ''.join(i * r[i] for i in '0123456789'))\r\n break", "def main():\n a = input()\n l = len(a)\n book = [0] * 128\n a = list(a)\n for i in range (l):\n a[i] = chr(ord(a[i]) - ord('0'))\n book[ord(a[i])] += 1\n num = 0\n m = 0\n buf = []\n for i in range (1,10):\n if i in (1, 8, 6, 9):\n for j in range (1, book[i]):\n buf.append(i)\n m = (10 * m + i) % 7\n num += 1\n else:\n for j in range (1,book[i]+1):\n buf.append(i)\n m = (10 * m + i) % 7\n num += 1\n m = ( m * 10000 ) % 7\n mp = [9681, 1896,9861, 1698, 6891, 6981, 6819]\n buf.append(mp[m])\n num += 4\n buf.append('0' * (l - num))\n print(''.join(map(str, buf)))\n\nmain()\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\na=input().rstrip()\r\ns=[\"1869\",\"1968\",\"1689\",\"6198\",\"1698\",\"1986\",\"1896\"]\r\ncnt=[0]*10\r\nfor i in range(len(a)):\r\n cnt[int(a[i])]+=1\r\ncnt[1]-=1;cnt[6]-=1;cnt[8]-=1;cnt[9]-=1\r\nans=[]\r\nm=0\r\nfor i in range(1,10):\r\n while cnt[i]>0:\r\n m=(10*m+i)%7\r\n ans.append(str(i))\r\n cnt[i]-=1\r\nneed_m=(7-(m*(10**4))%7)%7\r\nans.append(s[need_m])\r\nans.extend([\"0\"]*cnt[0])\r\nprint(\"\".join(ans))", "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\ns = input().rstrip()\r\nd = {0:\"1869\", 1:\"1968\", 2:\"1689\", 3:\"6198\", 4:\"1698\", 5:\"1986\", 6:\"1896\"}\r\ns = s.replace('1', '', 1)\\\r\n .replace('6', '', 1)\\\r\n .replace('8', '', 1)\\\r\n .replace('9', '', 1)\r\nx = 0\r\nfor i in s[::-1]:\r\n x = ((x - int(i) + 14) * 5) % 7\r\nprint(d[x], s, sep = \"\")", "n = [int(i) for i in input()]\r\nfor x in [1, 6, 8, 9]:\r\n\tfor i in range(len(n)):\r\n\t\tif n[i] == x:\r\n\t\t\tdel n[i]\r\n\t\t\tbreak\r\n\r\nprefix = [1869, 6189, 1689, 6198, 1698, 9861, 1896]\r\nres = sum([n[i] * pow(10, len(n)-i-1, 7) for i in range(len(n))])\r\nprint(prefix[-res * pow(10, 5*len(n), 7) % 7], end='')\r\nprint(*n, sep='')\r\n" ]

[ "n = int(input())\r\nnums = list(map(int, input().split()))\r\nmod = 10 ** 9 + 7\r\n\r\ndp = [0] * 20001\r\n\r\nans = 0\r\nfor num in nums:\r\n new_dp = [0] * 20001\r\n for i in range(20001):\r\n if dp[i]:\r\n new_dp[i+num] += dp[i]\r\n new_dp[i+num] %= mod\r\n new_dp[i-num] += dp[i]\r\n new_dp[i-num] %= mod\r\n dp = new_dp\r\n dp[num+10000] += 1\r\n dp[-num+10000] += 1\r\n ans += dp[10000]\r\nprint(ans % mod)", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN=int(readline())\r\nA=list(map(int,readline().split()))\r\nS=sum(A)\r\ndp=[0]*(2*S+1)\r\nmod=10**9+7\r\nans=0\r\nfor a in A:\r\n dp[S]+=1\r\n prev=dp\r\n dp=[0]*(2*S+1)\r\n for i in range(2*S+1):\r\n for di in (-a,a):\r\n if 0<=i+di<2*S+1:\r\n dp[i+di]+=prev[i]\r\n dp[i+di]%=mod\r\n ans+=dp[S]\r\n ans%=mod\r\nprint(ans)", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip()\r\n\r\nsys.setrecursionlimit(2*10**5+10)\r\nwrite = lambda x: sys.stdout.write(x+\"\\n\")\r\ndebug = lambda x: sys.stderr.write(x+\"\\n\")\r\nwritef = lambda x: print(\"{:.12f}\".format(x))\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = sum(a)\r\nM = 10**9+7\r\ndp = [0]*(2*m+1)\r\nans = 0\r\ndp[m] = 1\r\nval = 0\r\nfor i in range(n):\r\n v = a[i]\r\n ndp = [0]*(2*m+1)\r\n for j in range(m-val, m+val+1):\r\n if j-v>=0:\r\n ndp[j-v] += dp[j]\r\n if ndp[j-v]>M:\r\n ndp[j-v] -= M\r\n if j+v<=2*m:\r\n ndp[j+v] += dp[j]\r\n if ndp[j+v]>M:\r\n ndp[j+v] -= M\r\n dp = ndp\r\n ans += dp[m]\r\n ans %= M\r\n dp[m] += 1\r\n val += v\r\nprint(ans%M)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaxn, mod, ans = 12000, 10 ** 9 + 7, 0\r\ndp = [[0] * 2 for _ in range(2 * maxn + 10)]\r\ncurr, pre = 1, 0\r\nfor x in a:\r\n for i in range(2000, 2 * maxn - 2000 + 1):\r\n dp[i][curr] = (dp[i - x][pre] + dp[i + x][pre]) % mod\r\n dp[maxn - x][curr] = (dp[maxn - x][curr] + 1) % mod\r\n dp[maxn + x][curr] = (dp[maxn + x][curr] + 1) % mod\r\n ans = (ans + dp[maxn][curr]) % mod\r\n curr ^= 1\r\n pre ^= 1\r\nprint(ans)\r\n", "#from turtle import *\r\nimport math\r\nMOD = 1000000007\r\nMAXN = 10000\r\nN = 5000\r\nn = int( input( ) ) \r\na = list( map( int , input( ).split( ) ) )\r\nf = [ [0 for i in range( 0 , MAXN + 2 ) ] for j in range( 0 , n + 2 )]\r\n\r\nans = 0 \r\nfor i in range( 1 , n + 1 ) : \r\n f[i-1][N] += 1 \r\n for j in range( 0 , MAXN + 1 ) : \r\n if j + a[i-1] <= MAXN : \r\n f[i][j] = ( f[i][j] + f[i-1][j+a[i-1]] ) % MOD \r\n if j >= a[i-1] : \r\n f[i][j] = ( f[i][j] + f[i-1][j-a[i-1]] ) % MOD \r\n ans = ( ans + f[i][N] ) % MOD\r\nprint( ans )" ]

[ "'''\r\n Python3(PyPy3) Template for Programming-Contest.\r\n'''\r\n\r\nimport sys\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # LDRU\r\nmod = int(1e9 + 7)\r\ninf = 1 << 64\r\n\r\n\r\ndef main():\r\n n,M = map(int,input().split())\r\n a = list(map(int,input().split()))\r\n b = list(map(int,input().split()))\r\n ans = 0 \r\n prob = 1\r\n for i in range(n):\r\n if (a[i] == 0 and b[i] == 0):\r\n frac = (M - 1) * pow(2 * M,-1,mod) % mod\r\n ans = (prob * frac + ans) % mod \r\n prob = prob * pow(M,-1,mod) % mod\r\n elif (a[i] == 0 and b[i] != 0):\r\n frac = (M - b[i]) * pow(M,-1,mod) % mod \r\n ans = (prob * frac + ans) % mod \r\n prob = prob * pow(M,-1,mod) % mod \r\n elif (a[i] != 0 and b[i] == 0):\r\n frac = (a[i] - 1) * pow(M,-1,mod) % mod \r\n ans = (prob * frac + ans) % mod \r\n prob = prob * pow(M,-1,mod) % mod \r\n else:\r\n if a[i] > b[i]:\r\n ans = (ans + prob) % mod \r\n prob = 0\r\n elif a[i] == b[i]:\r\n continue\r\n else:\r\n break\r\n print(ans % mod)\r\n return 0\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nfrom array import array\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ninp_2d = lambda dtype, n: [dtype(input()) for _ in range(n)]\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\nceil1 = lambda a, b: (a + b - 1) // b\r\nout, tests = [], 1\r\n\r\nmod = 10 ** 9 + 7\r\nadd = lambda a, b: (a % mod + b % mod) % mod\r\nmult = lambda a, b: (a % mod * b % mod) % mod\r\ninv = lambda a: pow(a, mod - 2, mod)\r\n\r\n\r\ndef geteq(i):\r\n if a[i] == b[i] == 0: return m\r\n if a[i] and b[i]: return a[i] == b[i]\r\n return 1\r\n\r\n\r\ndef getge(i):\r\n if a[i] == b[i] == 0: return m * (m - 1) // 2\r\n if a[i] == 0: return m - b[i]\r\n if b[i] == 0: return a[i] - 1\r\n return a[i] > b[i]\r\n\r\n\r\nfor _ in range(tests):\r\n n, m = inp(int)\r\n a, b = array('i', inp(int)), array('i', inp(int))\r\n eq, p, zero = 1, 0, a.count(0) + b.count(0)\r\n q = inv(pow(m, zero, mod))\r\n\r\n for i in range(n):\r\n zero -= (a[i] == 0) + (b[i] == 0)\r\n p = add(p, mult(mult(eq, getge(i)), pow(m, zero, mod)))\r\n eq = mult(eq, geteq(i))\r\n\r\n out.append(mult(p, q))\r\nprint('\\n'.join(map(str, out)))\r\n", "p=10**9+7\r\n\r\nn,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\na=input().split()\r\nb=input().split()\r\n\r\na=[int(k) for k in a]\r\nb=[int(k) for k in b]\r\n\r\ninvm=pow(m,p-2,p)\r\ninv2=pow(2,p-2,p)\r\n\r\nans=0\r\n\r\nfor i in reversed(range(n)):\r\n\tif a[i]==0 and b[i]==0:\r\n\t\tans=(((inv2*invm)%p)*(m-1)+invm*ans)%p\r\n\tif a[i]==0 and b[i]!=0:\r\n\t\tans= ((m-b[i])*invm+invm*ans)%p\r\n\tif a[i]!=0 and b[i]==0:\r\n\t\tans= ((a[i]-1)*invm+invm*ans)%p\r\n\tif a[i]!=0 and b[i]!=0:\r\n\t\tif a[i]>b[i]:\r\n\t\t\tans= 1\r\n\t\telif b[i]>a[i]:\r\n\t\t\tans= 0\r\n\t\telse:\r\n\t\t\tans= ans\r\n\r\nprint(ans)", "n, m = map(int, input().split())\n\na1 = list(map(int, input().split()))\na2 = list(map(int, input().split()))\n\np1 = [0]*(n+2)\np2 = [0]*(n+2)\n\nfor i in range(n-1, -1, -1):\n p1[i] = p1[i + 1]\n p2[i] = p2[i + 1]\n if (a1[i] == 0):\n p1[i] += 1\n if (a2[i] == 0):\n p2[i] += 1\n\np = 0\nmod = 10**9 + 7\nq = pow(m, p1[0], mod) * pow(m, p2[0], mod)\nequal = 1\n\n\n\nfor i in range(n):\n if (a1[i] == a2[i] and a1[i] == 0):\n val = m * (m - 1) // 2\n p += (val * equal * pow(m, p1[i+1], mod) * pow(m, p2[i+1], mod)) % mod\n equal = (equal * m) % mod\n continue\n if (a1[i] == 0):\n val = m - a2[i]\n p += (val * equal * pow(m, p1[i+1], mod) * pow(m, p2[i+1], mod)) % mod\n continue\n if (a2[i] == 0):\n val = a1[i] - 1\n p += (val * equal * pow(m, p1[i+1], mod) * pow(m, p2[i+1], mod)) % mod\n continue\n if (a1[i] > a2[i]):\n p += (equal * pow(m, p1[i+1], mod) * pow(m, p2[i+1], mod) ) % mod\n break\n if (a1[i] < a2[i]):\n break\n\nprint(p * pow(q, mod-2, mod) % mod)\n# Sat Jul 30 2022 17:52:41 GMT+0000 (Coordinated Universal Time)\n", "def bezout(a, b):\r\n x, xx, y, yy = 1, 0, 0, 1\r\n while b:\r\n q = a // b\r\n a, b = b, a % b\r\n x, xx = xx, x - xx*q\r\n y, yy = yy, y - yy*q\r\n return x, y, a\r\n\r\n\r\ndef ans(a, b):\r\n invb, *_ = bezout(b, MOD)\r\n return (a*invb) % MOD\r\n\r\n\r\nMOD = 10**9 + 7\r\n\r\n\r\nn, m = map(int, input().split())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\ntp = 0\r\ntq = 1\r\n\r\nflag = 0\r\ncf = 1\r\n\r\nfor i in range(n):\r\n lp = 0\r\n lq = 1\r\n\r\n l, r = a1[i], a2[i]\r\n if l == r == 0:\r\n lp = (m)*(m-1)//2\r\n lq = m*m\r\n elif l == 0:\r\n lp = m - r\r\n lq *= m\r\n elif r == 0:\r\n lp = l - 1\r\n lq *= m\r\n else:\r\n if l > r:\r\n lp = 1\r\n lq = cf\r\n tp, tq = (tp * lq + lp * tq) % MOD, (lq * tq) % MOD\r\n print(ans(tp, tq))\r\n break\r\n elif l < r:\r\n print(ans(tp, tq))\r\n break\r\n continue\r\n\r\n tp, tq = (tp*cf*lq + lp*tq) % MOD, (cf*lq*tq) % MOD\r\n cf = (cf * m) % MOD\r\n\r\nelse:\r\n print(ans(tp, tq))\r\n" ]

[ "n,d = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nj = ans = 0\r\nfor i in range(n):\r\n while j<n and arr[j]-arr[i]<=d: j += 1\r\n ans = max(ans,j-i)\r\nprint(n-ans)", "n, d = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\n\n# finding largest possible area\n# range <= d\n\ndef find_upper(arr, lower, d):\n\tupper = lower\n\tfor u in range(lower, len(arr)):\n\t\tif(arr[u] - arr[lower] <= d):\n\t\t\tupper = u\n\treturn upper\n\nmax_range = 0\nfor j in range(n):\n\tthis_upper = find_upper(arr, j, d) - j + 1\n\t# print(j, this_upper)\n\tmax_range = max(max_range, this_upper)\n\nprint(n - max_range)\n", "n, d = map(int, input().split())\r\n\r\narr = [int(z) for z in input().split()]\r\n\r\narr.sort()\r\nres = 0\r\nfor i in range(n):\r\n for j in range(n-1, i-1, -1):\r\n if abs(arr[i] - arr[j]) <= d:\r\n res = max(res, j+1 - i)\r\nprint(n - res)\r\n\r\n", "n,d = [int(i) for i in input().split()]\r\ne = [int(i) for i in input().split()]\r\ne.sort()\r\nw = 0\r\nfor i in range(n):\r\n j = i\r\n while j < n and e[j] - e[i] <= d:\r\n j += 1\r\n if w < j - i:\r\n w = j - i\r\nprint(n - w)", "n , d = map(int , input().split())\r\nA = list(map(int , input().split()))\r\nA.sort()\r\nans = n\r\n\r\nfor i in range(n):\r\n g = 0\r\n for j in range(i , n):\r\n \r\n if A[j] - A[i] <= d:\r\n ans = min(ans , n - g)\r\n else:\r\n break\r\n g+=1\r\nprint(ans -1)\r\n", "n, d = map(int, input().split());nums, mx, freq = map(int, input().split()), 0, [0 for i in range(105)]\r\nfor num in nums:\r\n freq[num] += 1\r\nfor i in range(1, 102):\r\n freq[i] += freq[i-1]\r\nd += 1\r\nfor i in range(d, 102):\r\n\tmx = max(mx, freq[i]-freq[i-d])\r\nprint(n-mx)", "n,d=map(int,input().split())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\n\r\nsol=-1\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if(s[j]-s[i]<=d):\r\n if(j-i)>sol:\r\n sol=j-i\r\nprint(n-sol-1)\r\n", "n, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na.sort()\r\nbest = 100000\r\nfor i in range(len(a)):\r\n for j in range(i, len(a)):\r\n if a[j] - a[i] <= d and (n - j + i-1) < best:\r\n best = (n - j + i - 1)\r\n\r\nprint(best)", "n, m = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nl = []\r\nr = n\r\n\r\ns.sort()\r\n\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if abs(s[j] - s[i]) <= m:\r\n r = r - 1\r\n\r\n l.append(r)\r\n r = n\r\n\r\nprint(min(l))\r\n", "n,d = map(int,input().split())\r\ns = [int(i) for i in input().split()]\r\ns.sort()\r\nans = 0\r\n\r\nfor i in range(n):\r\n\tcnt=0\r\n\tfor j in range(n-1,-1,-1):\r\n\t\tif s[j]-s[i]<=d:\r\n\t\t\tcnt = j-i\r\n\t\t\tbreak\r\n\tans=max(cnt+1,ans)\r\nprint(n-ans)", "n , d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nA = 0\r\nfor length in range(n-1 , -1 , -1):\r\n for i in range(n-length):\r\n if l[i+length] - l[i] <= d:\r\n A = -1\r\n print(n - length - 1)\r\n break\r\n if A == -1 : break\r\n", "n, d = [int(x) for x in input().split()]\r\nx = [int(x) for x in input().split()]\r\n\r\nx.sort()\r\n\r\nres = len(x)\r\nfor i in range(len(x)):\r\n j = i\r\n while j<len(x) and x[j] <= x[i]+d: j+=1\r\n res = min(res, len(x)-j+i)\r\nprint(res)\r\n \r\n \r\n \r\n \r\n", "def main():\n n, d = [int(x) for x in input().split(\" \")]\n vals = [int(x) for x in input().split(\" \")]\n vals.sort()\n ans = n - 1\n for ind_left in range(n):\n for ind_right in range(ind_left, n, 1):\n v = vals[ind_right] - vals[ind_left]\n if v <= d:\n ans = min(ans, n - ind_right + ind_left - 1)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n\n", "do = [[-1 for i in range(105)] for j in range(105)]\r\n\r\ndef max_length(points,d,l,r):\r\n if l>=r or points[r] <= points[l] + d:\r\n return r-l+1\r\n if do[l][r] == -1:\r\n do[l][r] = max(max_length(points,d,l+1,r),max_length(points,d,l,r-1))\r\n return do[l][r]\r\n\r\nn, d = [int(i) for i in input().split()]\r\na = sorted([int(i) for i in input().split()])\r\n\r\nprint(n-max_length(a,d,0,n-1))\r\n", "if __name__ == '__main__':\n n, d = map(int, input().split())\n numbers = list(map(int, input().split()))\n cnt = 0\n # length = len(numbers)\n numbers = sorted(numbers)\n # median = numbers[len(numbers) // 2]\n w = 0\n for i in range(n):\n j = i\n while j < n and numbers[j] - numbers[i] <= d:\n j += 1\n if w < j - i:\n w = j - i\n print(n - w)\n \t \t \t \t \t \t\t \t \t\t\t\t\t\t", "n, d = [int(s) for s in input().split(' ')]\r\nx = [int(s) for s in input().split(' ')]\r\nx.sort()\r\nm = float('inf')\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if x[j] - x[i] <= d:\r\n m = min(m, n - (j - i + 1))\r\nprint(m)\r\n", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nif max(l)-min(l)<=k:\r\n print(0)\r\n exit()\r\nmaxlen=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if max(l[i:j+1])-min(l[i:j+1])<=k:\r\n maxlen=max(maxlen,j-i+1)\r\nprint(n-maxlen)", "import math\r\nn, d = map(int,input().split())\r\nar = list(map(int,input().split()))\r\nar.sort()\r\nif n == 1:\r\n ans = 1\r\nelse:\r\n ans = 10000000\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if ((ar[j]-ar[i]<=d) and (n-(j-i)<ans)):\r\n ans = n - (j - i)\r\nprint (ans-1)", "a=[*map(int,input().split(' '))]\r\nb=[*map(int,input().split(' '))]\r\nb=sorted(b)\r\nc=0\r\nd=0\r\ne=0\r\nf=len(b)\r\nfor i in range(0,f):\r\n for j in range(i,f):\r\n if(b[j]-b[i]>a[1]):\r\n c+=1\r\n i+=1\r\n if(j==f-1):\r\n break\r\n if(j==f-1):\r\n break\r\n \r\n \r\nprint(c)\r\n", "n,d = [int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nc=[0 for i in range(102)]\r\nfor i in a:\r\n c[i]+=1;\r\nsum1=[0 for i in range(500)]\r\nfor i in range(1,101):\r\n sum1[i] = sum(c[i-1:i+d])\r\nprint(n-max(sum1))", "n, x = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\n\r\nres = 100000000000;\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if arr[j] - arr[i] <= x:\r\n res = min(res,n-(abs(i-j)+1))\r\nprint(res)", "n,d=[int(x) for x in input().split()]\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\nans=1000000000000\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if arr[j]-arr[i]<=d:\r\n #print(n-(j-i+1))\r\n ans=min(ans,n-(j-i+1))\r\nprint(ans)\r\n \r\n \r\n ", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nmaximum = n-1\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if(l[j]-l[i]<=k):\r\n if(n-(j-i+1)<maximum):\r\n maximum = n-(j-i+1)\r\nprint(maximum)\r\n ", "nd = input().split(' ')\r\nn, d = int(nd[0]), int(nd[1])\r\npoints = input().split(' ')\r\n\r\nfor p in range(len(points)):\r\n points[p] = int(points[p])\r\n\r\npoints.sort()\r\nto_remove = []\r\nl = len(points)\r\nfor i in range(l):\r\n for j in range(l):\r\n if abs(points[i] - points[j]) <= d:\r\n to_remove.append(l - (i-j+1))\r\n\r\nprint(min(to_remove))", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr=sorted(arr);d=[0]*(101)\r\nfor i in arr:\r\n d[i]+=1\r\nans=10**18\r\nfor i in range(0,101):\r\n if i+k+1>101:break\r\n else:ans=min(n-sum(d[i:i+k+1]),ans)\r\nprint(ans)\r\n \r\n \r\n", "n,d = map(int,input().split())\nlist = [int(num) for num in input().split()]\nlist = sorted(list)\nnum = 1000000\nfor i in range(n):\n for j in range(i,n):\n if list[j]-list[i]<=d:\n num = min(num,n+i-j-1)\n\nprint(num)\n\t \t\t\t \t\t \t \t \t\t \t\t \t\t \t", "n,d = map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort();\r\ni=0\r\ncnt=0\r\ncnt1=0\r\nif n==1:\r\n print(\"0\")\r\n\r\nelse:\r\n for i in range(n):\r\n cnt=0\r\n for j in range(i+1,n):\r\n d1=a[j]-a[i]\r\n if d1>d:\r\n break;\r\n cnt+=1\r\n if(cnt1<cnt):\r\n cnt1=cnt\r\n print(n-cnt1-1)", "d = int(input().split()[1])\r\na = list(map(int, input().split()))\r\nprint(min(sum(1 - (0 <= c - p <= d) for c in a) for p in a))\r\n", "n,d = map(int,input().split())\r\nlis = sorted(map(int,input().split()))\r\nans=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if lis[j]-lis[i]<=d:\r\n ans=max(ans,j-i+1)\r\nprint(n-ans)\r\n ", "n,d = (int(z) for z in input().split())\r\narr = [int(z) for z in input().split()]\r\narr.sort()\r\nmx = -1\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if arr[j] - arr[i] <= d:\r\n mx = max(mx, j - i + 1)\r\nprint(n - mx)", "import bisect\n\nline = input()\nn, d = int(line.strip().split()[0]), int(line.strip().split()[1])\n\nline = input()\nnums = [int(item) for item in line.strip().split()]\nnums = sorted(nums)\n\nmaxd = 0\nfor i in range(n):\n st = nums[i]\n end = nums[i] + d\n loc = bisect.bisect_right(nums, end)\n #print(i, loc)\n dd = loc - i\n maxd = max(maxd, dd)\nprint(n - maxd)\n\n\n\n\t\t \t \t\t \t \t \t \t \t \t\t \t \t", "a,b=map(int,input().split())\r\nz=0\r\nr=sorted(map(int,input().split()))\r\nfor i in range(a):\r\n j=0\r\n for j in range(i,a):\r\n if r[j]-r[i]>b:z=max(z,j-i);break\r\n else:z=max(z,j-i+1)\r\nprint(a-z)", "n,k=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))+[100000]\r\na=0\r\nfor i in range(n+1):\r\n\tu=1\r\n\tfor j in range(i+1,n+1):\r\n\t\tif l[j]-l[i]<=k:\r\n\t\t\tu+=1\r\n\t\telse:\r\n\t\t\ta=max(a,u)\r\n\t\t\tu=0 \r\nprint(n-a)\r\n\t\t\r\n\t\t\t", "# http://codeforces.com/contest/940/problem/A\r\n\r\nimport sys\r\n\r\nn_and_d = sys.stdin.readline()\r\ntmp = n_and_d.split(' ')\r\nn = int(tmp[0])\r\nd = int(tmp[1])\r\n\r\nl = sys.stdin.readline().strip().split(' ')\r\nl = [int(l[i]) for i in range(0, n)]\r\n\r\nl.sort()\r\n\r\nmin = n\r\n\r\nfor i in range(0, n):\r\n upper_bound_value = l[i] + d\r\n upper_bound_index = i\r\n\r\n while upper_bound_index + 1 < n and l[upper_bound_index + 1] <= upper_bound_value:\r\n upper_bound_index += 1\r\n\r\n tmp = n - 1 - upper_bound_index + i;\r\n\r\n if tmp < min:\r\n min = tmp\r\n\r\nprint(min)", "n,d = map(int,input().split())\r\n\r\na = [int(i) for i in input().split()]\r\n\r\na.sort()\r\nm=0\r\nfor i in range(0,n):\r\n\r\n for j in range(i,n):\r\n\r\n if (a[j]-a[i])<=d and (j-i+1)>m:\r\n\r\n m=j-i+1\r\n \r\nprint(n-m)", "\r\nn, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\na = sorted(a)\r\n\r\nl = 0\r\nr = 0\r\ncur_d = a[r] - a[l]\r\nmax_num = 1\r\n\r\nwhile r < len(a):\r\n \r\n if a[r] - a[l] <= d:\r\n # print(l, r, a[r]-a[l])\r\n max_num = max(max_num, r - l + 1)\r\n r += 1\r\n else:\r\n l += 1\r\n\r\nprint(len(a) - max_num)", "n,d = map(int,input().split())\nx = list(map(int,input().split()))\n\nx.sort()\nz = -1\nfor i in range(n):\n\ty = 0\n\tfor j in range(i,n):\n\t\tif (x[j]-x[i] <= d): \n\t\t\tif j -i > z: \n\t\t\t\tz = j - i\n\nprint(n - z - 1)\n\n", "n, d = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nfound = 0\r\nfor i in range(n, 0, -1):\r\n if found: break\r\n for j in range(n - i + 1):\r\n if l[j + i -1] - l[j] <= d:\r\n print(n - i)\r\n found = 1\r\n break\r\n\r\n", "n,d = map(int,input().split())\nx = list(map(int,input().split()))\n\nx.sort()\nz = n\nfor i in range(n):\n\ty = 0\n\tfor j in range(i,n):\n\t\tif (x[j]-x[i] <= d): \n\t\t\tif n - (j -i)-1 < z: \n\t\t\t\tz = n - (j -i)-1 \n\nprint(z)\n\n", "n,d=map(int,input().split())\nls=[int(a) for a in input().split()]\nls.sort()\nctr1=0\nsm=0\nfor i in range(n):\n sm=0\n ctr2=i\n while sm<=d:\n if ctr2==n-1:\n break\n if ls[ctr2+1]-ls[i]>d:\n break\n ctr2+=1\n sm=ls[ctr2]-ls[i]\n if ctr2==n-1:\n break\n #print(ctr2,sm,i)\n ctr1=max(ctr1,ctr2-i+1)\nprint(n-ctr1)", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\ntemp=[]\r\nfor i in range(len(a)):\r\n count=0\r\n for j in range(i,len(a)):\r\n if (a[j]-a[i])<=d:\r\n count+=1\r\n else:\r\n break\r\n temp.append(count)\r\nt=max(temp)\r\nprint(len(a)-t)\r\n\r\n", "#Complexity - O(nlogn)\nimport bisect\n\nn, d = map(int, input().split())\narr = sorted(list(map(int, input().split())))\n\nmax_span = 0\nfor i in range(n):\n pos = bisect.bisect_right(arr, arr[i]+d, i)\n max_span = max(max_span, pos-i)\n\nprint(n-max_span)\n", "n,d = map(int,input().split())\r\nl = sorted(list(map(int,input().split())))\r\nk=m=0\r\nfor x in range(1,n):\r\n while l[x]-l[k]>d:\r\n k+=1\r\n if x-k>m:m = x-k\r\nprint(n-(m+1))", "n, d = [int(k) for k in input().split(' ')]\narr = sorted([int(k) for k in input().split(' ')])\n\ngmin = 9999\n\nfor i in range(len(arr)):\n\tj = 0\n\tfor j in range(i, len(arr)):\n\t\tif arr[j] - arr[i] > d:\n\t\t\tj = j - 1\n\t\t\tbreak\n\tif len(arr) - j + i - 1 < gmin:\n\t\tgmin = len(arr) - j + i - 1\n\nprint(gmin)\n", "n,d = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ncount = 0\r\na.sort()\r\np = []\r\nfor i in range(n):\r\n q = a[i] + d\r\n for j in range(n):\r\n if (a[j]<=q and a[j]>=a[i]):\r\n count+=1\r\n p.append(n-count)\r\n count = 0\r\nprint (min(p))", "n,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nans=float(\"inf\")\r\nfor i,el in enumerate(arr):\r\n res=0\r\n for j,p in enumerate(arr):\r\n if i!=j:\r\n if arr[j]>arr[i]+d or arr[j]<arr[i]:\r\n res+=1\r\n ans=min(ans,res)\r\nprint(ans)", "[n,m] = input().split(' ')\nn = int(n)\nm = int(m)\n\nline = input().split(' ')\n\na = []\nfor i in range( n) :\n a.append(int(line[i]))\nb = sorted (a )\nans = -9999\nfor i in range( n) :\n for j in range(i , n):\n if b[j] - b[i] <= m:\n ans = max(ans,j-i)\n\nprint(n-ans-1)\n", "n,d=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nprint(min(sum((i-j>d or i<j)for i in x)for j in x))", "import sys\r\n# from io import StringIO\r\n# sys.stdin = StringIO(open(__file__.replace('.py', '.in')).read())\r\n\r\nn, d = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nif n == 1:\r\n print(0)\r\n sys.exit()\r\n\r\na.sort()\r\n\r\nm = 0\r\n\r\nfor i in range(n):\r\n c = 0\r\n for j in range(i+1, n):\r\n if a[j] - a[i] <= d:\r\n c += 1\r\n else:\r\n break\r\n m = max(m, 0 if c == 0 else c + 1)\r\n\r\nif m == 0:\r\n print(n - 1)\r\nelse:\r\n print(n - m)\r\n", "n, d = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nls.sort()\r\nm = 100000\r\nfor i in range(n):\r\n for j in range(n):\r\n if ls[j] - ls[i] <= d:\r\n m = min(m, n - j + i - 1)\r\nprint(m)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = n - 1\r\na.sort()\r\nfor l in range(n):\r\n for r in range(l, n):\r\n if a[r] - a[l] <= d:\r\n ans = min(ans, l - 1 + (n - r))\r\nprint(ans)", "n, d = map(int, input().split(\" \"))\r\nA = list(map(int, input().split(\" \")))\r\nlo, ans, cur, idx = A[0], 1, 1, 0\r\n\r\nA.sort()\r\n\r\nans = 0\r\n\r\nfor i in range(0, n):\r\n cur = 0\r\n for j in range(i, n):\r\n if A[j] - A[i] <= d:\r\n cur = cur + 1\r\n else:\r\n break\r\n ans = max(cur, ans)\r\n\r\nprint(n - ans)", "d=int(input().split()[1])\r\na=list(map(int,input().split()))\r\nprint(min(sum(1-(0<=c-p<=d)for c in a)for p in a))", "import math\r\nn,d = map(int,input().split())\r\na = map(int,input().split())\r\na = sorted(list(a))\r\nn = len(a)\r\nans=0\r\nfor i in range(n) :\r\n\ttot = 1\r\n\tfor j in range(i+1,n):\r\n\t\tif a[j]-a[i] > d :\r\n\t\t\tbreak\r\n\t\ttot+=1\r\n\tans = max(ans,tot)\r\nprint(n-ans)", "n, d = map(int, input().split())\nA = [int(i) for i in input().split()]\n\nprint(min(sum(c < p or p < c - d for c in A) for p in A))\n\n", "x, y = map(int, input().split()) \r\na=list(map(int,input().split()))\r\na.sort()\r\ncnt=0\r\nmx=0\r\nval=0\r\n\r\nfor i in range(x): \r\n for j in range(i,x):\r\n z=abs(a[i]-a[j])\r\n if z<=y:\r\n #print(\"Biyog:\")\r\n #print(abs(a[i]-a[j]))\r\n cnt=cnt+1\r\n # print(\"cnt:\")\r\n #print(cnt)\r\n \r\n mx=max(cnt,mx)\r\n cnt=0\r\n\r\n \r\n \r\nprint(x-mx)\r\n\r\n", "\r\n#k=int(input())\r\n#n,m=map(int,input().split())\r\n\r\n#a=list(map(int,input().split()))\r\n\r\n#b=list(map(int,input().split()))\r\n\r\n\r\nn,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\n\r\nm=-1\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if a[j]-a[i]<=d and m<j-i+1:\r\n m=j-i+1\r\n\r\nprint(n-m)", "n, d = map (int, input ().split ())\r\nx = list (map (int, input ().split ()))\r\nans = n - 1\r\nx.sort ()\r\nfor i in range (n) :\r\n for j in range (i + 1, n + 1) :\r\n nx = x[i : j]\r\n mn = 101; mx = -1\r\n for k in nx : mn = min (mn, k); mx = max (mx, k)\r\n if mx - mn <= d : ans = min (ans, n - (j - i))\r\nprint (ans)\r\n", "n, d = map(int,input().split())\na = sorted(list(map(int,input().split())))\nif n==1:\n\tprint (0)\n\texit()\nans = n\nfor i in range(n):\n\tfor j in range(i, n):\n\t\tif a[j]-a[i]<=d:\n\t\t\tans = min(ans, i+n-j-1)\nprint (ans)", "def main():\r\n n,d = map(int,input().split())\r\n x = list(map(int,input().split()))\r\n x.sort()\r\n\r\n ans = n\r\n for i in range(n):\r\n j = i\r\n while j<n and x[j]-x[i]<=d:\r\n j += 1\r\n ans = min(ans, n-(j-i))\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, d = map(int, input().split())\r\npoints = list(map(int, input().split()))\r\npoints.sort()\r\nans = n\r\nfor i in range(n):\r\n j = i\r\n while j<n and points[j] - points[i]<=d:\r\n j+=1\r\n ans = min(ans, n-(j-i))\r\nprint(ans)\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nres = n - 1\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if l[j] - l[i] > k:\r\n continue\r\n res = min(res, n - (j - i + 1))\r\nprint(res)\r\n", "#!/usr/bin/python3\n\n\ndef func():\n n, d = list(map(int, input().split()))\n a = sorted(list(map(int, input().split())))\n# import pdb\n# pdb.set_trace()\n if n == 1:\n return 0\n m_count = float('inf')\n for i in range(n-1):\n j = i + 1\n count = n-1\n while j < n and a[j] - a[i] <= d:\n count -= 1\n j += 1\n if count < m_count:\n m_count = count\n return m_count\n\n\nprint(func())\n", "n, d = map(int, input().strip().split())\r\nx = list(map(int, input().strip().split()))\r\nx.sort()\r\n\r\nres = 1000000\r\nfor l in range(n):\r\n for r in range(l, n):\r\n cur = x[r] - x[l]\r\n if cur <= d:\r\n res = min(res, n - (r -l + 1))\r\nprint(res)", "n,d=input().split()\nn,d=[int(n),int(d)]\na=[int(i) for i in input().split()]\na.sort()\nm=0\nfor i in range(0,n):\n for j in range(i,n):\n if (a[j]-a[i])<=d and (j-i+1)>m:\n m=j-i+1\nprint(n-m)", "n, d = (int(x) for x in input().split())\r\nelems = [int(x) for x in input().split()]\r\nans = 101\r\nfor l in range(0, 101):\r\n r = l + d\r\n outside = 0\r\n for elem in elems:\r\n if elem < l or elem > r:\r\n outside += 1\r\n ans = min(ans, outside)\r\nprint(ans)", "n,d=map(int,input().split())\r\n\r\nlist=[int(num) for num in input().split()]\r\nlist=sorted(list)\r\n\r\nnum=1000000\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if list[j]-list[i]<=d: \r\n num=min(num,n+i-j-1) \r\nprint(num)", "a,b =map(int,input().split())\nc = list(map(int,input().split()))\nc.sort()\nd = 0x7fffffff\nfor i in range(a):\n for j in range(a):\n if(c[j] - c[i] <= b):\n d = min(d,a-j+i-1)\n \n \nprint(d)", "n,d = map(int,input().split())\r\nl = [int(x) for x in input().split()]\r\nbest = 200\r\nfor item in l:\r\n m = len([x for x in l if x < item or x > item+d])\r\n best = min(m,best)\r\nprint(best)", "n, d = map(int, input().split())\r\np = list(map(int, input().split()))\r\nres = n- 1\r\np.sort()\r\n\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if p[j] - p[i] > d:\r\n continue # set xoa ko hop le\r\n res = min(res, n -(j-i +1)) # xoa tat ca cac thang ko nam giua \r\n\r\nprint(res)", "from sys import stdin\r\nfrom collections import *\r\n\r\n\r\ndef arr_inp(n):\r\n if n == 1:\r\n return [int(x) for x in stdin.readline().split()]\r\n elif n == 2:\r\n return [float(x) for x in stdin.readline().split()]\r\n else:\r\n return list(stdin.readline()[:-1])\r\n\r\n\r\nn, d = arr_inp(1)\r\nx, ans = sorted(arr_inp(1)), float('inf')\r\n\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n val = x[j] - x[i]\r\n if val <= d:\r\n ans = min(ans, n - (j - i + 1))\r\n\r\nprint(min(ans, n - 1))\r\n", "n,d = map(int,input().split())\nls = list(map(int,input().split()))\nlens = len(ls)\nls.sort()\nans = 999999999999999999999999\nfor left in range(0,lens):\n for right in range(0,lens):\n if right<left:\n continue\n if ls[right] - ls[left] <= d:\n ans = min(lens-1 - right + left,ans)\nprint(ans)\n\t \t \t \t \t \t \t\t \t \t", "noe, maxs = [int(x) for x in input().split()]\r\narr1 = [int(x) for x in input().split()]\r\narr = sorted(arr1)\r\nmins = int(10e9)\r\nfor i in range(noe):\r\n for j in range(i, noe):\r\n if arr[j]-arr[i] <= maxs:\r\n if noe - j + i - 1 < mins:\r\n mins = noe - j + i - 1\r\nprint(mins)", "n,d=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nans=1e9\r\nfor i in range(n):\r\n st,en=0,n-1\r\n while st<en:\r\n mid= (st+en+1)//2\r\n if a[mid]-a[i]<=d:\r\n st=mid\r\n else :\r\n en=mid-1\r\n ans=min(i+n-st-1,ans)\r\nprint(ans)", "import sys\nlines = sys.stdin.readlines()\n\nn, d = map(lambda x: int(x), lines[0].split())\nsequence = [int(x) for x in lines[1].split()]\n\n\ndef rank(arr):\n to_rank = []\n for idx, no in enumerate(arr):\n greate_d = 0\n for no_2 in arr:\n if abs(no - no_2) > d:\n greate_d = greate_d + 1\n to_rank.append((idx, greate_d))\n to_rank = sorted(to_rank, reverse=True, key=lambda x: x[1])\n return to_rank\n\n\ninvalid = True\ncounter = 0\nwhile invalid:\n results = rank(sequence)\n if results[0][1] == 0:\n invalid = False\n break\n del sequence[results[0][0]]\n counter = counter + 1\nprint(counter)\n", "d=int(input().split()[1])\r\na=sorted(map(int,input().split()))\r\nk=i=len(a)\r\no=lambda x:x[-1]-x[0]\r\nwhile min(list(map(o,[[j for j in a[l:l+i]] for l in range(k-i+1)])))>d:\r\n\ti-=1\r\nprint(k-i)", "parameters = input()\r\nparameters = parameters.split()\r\nn, d = int(parameters[0]), int(parameters[1])\r\n\r\nmultiset = input()\r\nmultiset = multiset.split()\r\nmultiset = [int(x) for x in multiset]\r\nmultiset.sort()\r\nmultiset.reverse()\r\n\r\nchain = 0\r\n\r\nfor i in range(n):\r\n for p in range(i, n):\r\n if multiset[i] - multiset[p] <= d:\r\n if p-i > chain:\r\n chain = p-i\r\n else:\r\n break \r\n\r\nprint(n - chain - 1)", "n, d = map(int,input().split())\r\narr = sorted(list(map(int,input().split())))\r\nsugg_r = set()\r\nfor i in range(n):\r\n for j in range(n-1,i-1,-1):\r\n if arr[j] - arr[i] <= d:\r\n sugg_r.add(j-i)\r\n\r\nprint(n - max(sugg_r) - 1)", "n , d = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\n\r\nr = 0\r\nd2= 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n d2 = l[j] - l[i]\r\n if d2 <= d and j - i + 1 > r:\r\n r = j - i + 1\r\n #print(r)\r\n\r\n\r\nprint( n - r)\r\n\r\n\r\n", "n,d=map(int,input().split())\r\nf=0\r\nl=list(map(int,input().split()))\r\nl=sorted(l,reverse=False)\r\n\r\nif l[-1]-l[0]<=d:\r\n print(0)\r\nelse:\r\n ans=10000\r\n # for i in range(n-1):\r\n # if l[i+1]-l[i]>l[n-i-1]-l[n-i-2]:\r\n # del l[i]\r\n # f+=1\r\n # else:\r\n # del l[n-1-i]\r\n # f+=1\r\n # if max(l)-min(l)<=d:\r\n # break\r\n # print(f)\r\n for i in range(n):\r\n for j in range(i,n):\r\n if l[j]-l[i]<=d:\r\n ans=min(ans,n-j+i-1)\r\n print(ans)", "n, d = [int(x) for x in input().split(' ')]\na = [int(x) for x in input().split(' ')]\na.sort()\n\nr = n\n\nfor p in range(n):\n q = n-1\n while a[q] - a[p] > d:\n q -= 1\n if n - (q - p + 1) < r:\n r = n - (q - p + 1)\nprint(r)", "#!/usr/bin/env python3\r\nimport sys\r\nimport math\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_ls(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef test_ok(ok): print(\"YES\" if ok else \"NO\")\r\n\r\ndef main():\r\n # for _ in range(int(input())):\r\n n, d = map(int, input().split())\r\n ls = get_ls()\r\n ls.sort()\r\n ans = j = 0\r\n for i in range(n):\r\n while j < n and ls[j] - ls[i] <= d:\r\n j += 1\r\n ans = max(ans, j - i)\r\n \r\n print(n - ans)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nd=sorted(c)\r\ne=0\r\nfor _ in range(a):\r\n for i in range(a):\r\n if(_<i):\r\n if(d[i]-d[_]<=b):\r\n e=max(e,i-_)\r\n\r\nprint(a-e-1)", "n, d = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\n\r\nl, r = 0, 0\r\nres = n - 1\r\nwhile l < n:\r\n while r < n and a[r] - a[l] <= d:\r\n r += 1\r\n res = min(res, n - (r - l))\r\n l += 1\r\nprint(res)", "n, d = map(int, input().split())\r\n\r\nls = list(map(int, input().split()))\r\nref = 101\r\ncount = 0\r\n\r\nfor i in ls:\r\n max = i\r\n for j in ls:\r\n if i >= j and i - j <= d:\r\n count = 0\r\n for k in ls:\r\n if k < j or k > i:\r\n count += 1\r\n if count < ref:\r\n ref = count\r\n\r\nprint(ref)", "n,d=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nmymap={}\r\nmax=0\r\nfor i in range(n):\r\n sol=1\r\n x=l[i]\r\n for j in range(n):\r\n if j!=i and abs(x-l[j])<=d and l[j]>=x:\r\n sol+=1\r\n if sol>max:\r\n max=sol\r\nprint(n-max)\r\n \r\n", "n,k=map(int,input().split())\r\na=[0]*101\r\nm=0\r\nfor i in map(int,input().split()):\r\n a[i]+=1\r\nfor i in range(1,100-k+1):\r\n m=max(sum(a[i:i+k+1]),m)\r\nprint(m if m==0 else n-m) \r\n", "from collections import Counter\r\n\r\nn, d = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nm, M = min(lst), max(lst)\r\nif M - m <= d:\r\n print(0)\r\nelse:\r\n c = Counter(lst)\r\n res = n\r\n for k0 in c.keys():\r\n s = sum(v for k,v in c.items() if k0 <= k and k <= k0 + d)\r\n res = min(res, n-s)\r\n print(res)\r\n", "n,d = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nans = n\r\nl = 0\r\nfor r in range(n):\r\n while arr[r]-arr[l] > d and l < r:\r\n l+=1\r\n ans = min(ans, n - (r-l+1))\r\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, d = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nu = 0\r\nfor i in range(n):\r\n xi = x[i]\r\n for j in range(i, n):\r\n if x[j] - xi <= d:\r\n u = max(u, j - i + 1)\r\n else:\r\n break\r\nans = n - u\r\nprint(ans)", "n, d = map(int, input().split())\r\nc, p = [0] * 102, [0] * 102\r\nfor x in map(int, input().split()):\r\n c[x] += 1\r\nfor i in range(1, 102):\r\n p[i] = p[i - 1] + c[i]\r\n#print(p)\r\nprint(n - max(p[i + d + 1] - p[i] for i in range(101 - d)))", "n,r = map(int,input().split())\na = map(int,input().split())\nflag = 0\na = sorted(a)\nd = 0\n\nfor i in range(n):\n for j in range(i,n):\n if a[j] - a[i] <= r:\n d = max(d,j-i+1)\nprint(n-d)\n\n\t\t\t\t\t \t \t\t\t\t\t \t\t \t", "a,b=map(int,input().split())\r\nr=sorted(map(int,input().split()))\r\nz=j=0\r\nfor i in range(a):\r\n while(j<a and r[j]-r[i]<=b ):j+=1\r\n z=max(z,j-i)\r\nprint(a-z)", "n , d = [int(c) for c in input().split()]\r\na=[0]\r\nb = [int(x) for x in input().split()]\r\nfor i in b:\r\n a.append(i)\r\na.sort()\r\nans=10**9\r\nfor i in range(1,n+1):\r\n now = n-1\r\n for j in range(i+1,n+1):\r\n if(a[j]-a[i]<=d):\r\n now-=1\r\n ans= min(ans,now)\r\nprint(ans)\r\n", "n, d = map(int, input().split())\npoints = list(map(int, input().split()))\n\npoints.sort()\n\nmax_length = 0\nj = 0\n\nfor i in range(n):\n while j < n and points[j] - points[i] <= d:\n j += 1\n max_length = max(max_length, j - i)\n\nprint(n - max_length)\n", "n, d = map(int, input().split())\r\nx = sorted(list(map(int, input().split())))\r\nfor i in range(n):\r\n if min(x[n - i - 1 + j] - x[j] for j in range(i + 1)) <= d:\r\n print(i)\r\n exit(0)", "import sys\r\nn , d = map(int, input().split())\r\n\r\nl = [int(x) for x in input().split()]\r\n\r\nl.sort()\r\n\r\nm = 0\r\n\r\nfor i in range(n):\r\n c = 0\r\n for z in range(i,n):\r\n if l[z] - l[i] > d:\r\n break\r\n\r\n c += 1\r\n\r\n m = max(m , c)\r\n\r\nprint(n-m)\r\n\r\n\r\n\r\n", "n, d = map(int, input().split())\nX = list(map(int, input().split()))\nX.sort()\nans = 10**18\nfor l in range(n):\n for r in range(l, n+1):\n Y = X[l:r]\n if not Y:\n ans = min(ans, n)\n else:\n if Y[-1]-Y[0] <= d:\n ans = min(ans, n-(r-l))\nprint(ans)\n", "def main():\n n, d = map(int, input().split())\n l = sorted(map(int, input().split()))\n b, j, r = l[0], 0, 0\n for i, a in enumerate(l):\n if a - b > d:\n a -= d\n while a > l[j]:\n j += 1\n b = l[j]\n else:\n if r < i - j:\n r = i - j\n print(n - r - 1)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\n\nn, d = input().split(' ')\nn = int(n)\nd = int(d)\n\nA = input()\nA = [int(i) for i in A.split()]\n\nif n == 1:\n print('0')\n sys.exit()\n\nA.sort()\nkapa = 1000000000\nfor i in range(len(A)):\n for j in range(i, len(A)):\n zeta = A[j] - A[i]\n if zeta <= d and n - (j - i + 1) < kapa:\n kapa = n - (j - i + 1)\n\nprint(kapa)\n", "n, d = map(int, input().split())\r\nL = list(map(int, input().split()))\r\nL.sort()\r\nmax = -1\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if L[j] - L[i] <= d:\r\n if j - i > max:\r\n max = j - i\r\nprint(n - max - 1)", "n, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nans = 1e18\r\n\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if a[j]-a[i] <= d:\r\n ans = min(ans, i+(n-j-1))\r\n \r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nl=sorted(list(map(int,input().split())))\r\nl.append(1000000)\r\na=[]\r\nfor i in range(n+1):\r\n\tu=1\r\n\tfor j in range(i+1,n+1):\r\n\t\tif l[j]-l[i]<=k:\r\n\t\t\tu+=1\r\n\t\telse:\r\n\t\t\ta.append(u)\r\n\t\t\tu=0 \r\nprint(n-max(a))\r\n\t\t\r\n\t\t\t", "n, d = map(int, input().split())\narr = list(map(int, input().split()))\narr.sort()\n\ndia = arr[-1] - arr[0]\ndeletions = n - 1\n\nfor i in range(n):\n for j in range(i, n):\n temp_dia = arr[j] - arr[i]\n temp_del = i + n - 1 - j\n if temp_dia <= d and temp_del < deletions:\n dia = temp_dia\n deletions = temp_del\n\nprint(deletions)\n", "n,d = list(map(int, input().split()))\nx = list(map(int, input().split()))\n\nt = [0] * 102\n\nfor i in x:\n t[i]+=1\n\nmn = n\nfor i in range(100):\n # i -- i+d\n cnt = 0\n for j in range(i, min(101, i+d+1)):\n cnt += t[j]\n if n-cnt < mn:\n mn = n-cnt\n\nprint(mn)\n", "import bisect \r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nif(a[-1]-a[0]<=k):\r\n print(0)\r\nelse:\r\n min_cnt=n\r\n cnt=0\r\n for i in range(n-1):\r\n min_cnt=min(min_cnt,n-1-bisect.bisect_right(a[i+1:],a[i]+k))\r\n for i in range(1,n):\r\n min_cnt=min(min_cnt,i-1+bisect.bisect_left(a[:n-i],a[-i]-k))\r\n print(min_cnt)\r\n\r\n\r\n", "import sys\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\nr = 0\r\nn, d = map(int,minp().split())\r\na = sorted(map(int,minp().split()))\r\nl = 0\r\nr = 0\r\nb = []\r\nwhile l < n:\r\n\twhile (r < n-1) and (a[r+1]-a[l] <= d):\r\n\t\tr += 1\r\n\tb.append(r-l+1)\r\n\tl += 1\r\nprint(n-max(b))", "#!/usr/bin/env python2\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Mar 2 09:58:19 2018\n\n@author: mikolajbinkowski\n\"\"\"\n\nn, d = [int(k) for k in input().split(' ')]\npoints = [int(k) for k in input().split(' ')]\n \ndef qs(A, l, r):\n if l >= r:\n return\n p = part(A, l, r)\n qs(A, l, p - 1)\n qs(A, p + 1, r)\n \ndef part(A, l, r):\n if l == r:\n return l\n pivot = A[r]\n i = l\n for j in range(l, r):\n if A[j] < pivot:\n swap(A, j, i)\n i += 1\n swap(A, r, i)\n return i\n \ndef swap(A, i, j):\n c= A[i]\n A[i] = A[j]\n A[j] = c\n\nqs(points, 0, n - 1)\n\ni, j = 0, 0\nmax_dist = 0\nwhile j < n:\n while points[j] - points[i] <= d:\n j += 1\n if j >= n:\n break\n dist = j - i\n if dist > max_dist:\n max_dist = dist\n i += 1\nprint(n - max_dist)\n", "n,k=map(int,input().split())\r\na,l=sorted(map(int,input().split())),0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i<j and a[j]-a[i]<=k:l=max(l,j-i)\r\nprint(n-l-1)", "n,d=map(int,input().split())\nAr=[int(x) for x in input().split()]\nAr.sort()\nh=[]\nfor i in range(n):\n\tA=Ar[i:]\n\tm=A[0]+d\n\tj=0\n\twhile j<len(A):\n\t\tif A[j]>m:\n\t\t\tA.remove(A[j])\n\t\telse:\n\t\t\tj+=1\n\th.append(len(A))\nprint(n-max(h))", "n,d = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nans = n\r\nleft = 0\r\nfor right in range(n):\r\n while a[right]-a[left] > d:\r\n left += 1\r\n ans = min(ans,n-right+left-1)\r\nprint(ans)", "n,d=[int(y) for y in input().split()]\r\nx=[int(y) for y in input().split()]\r\nx.sort()\r\nans=1000\r\nada=0\r\nfor i in range(0,n):\r\n\tada=0\r\n\tfor j in range(i+1,n):\r\n\t\tif (x[j]-x[i])>d:\r\n\t\t\tada=1\r\n\t\t\tans=min(ans,(n-i)-(j-i)+i)\r\n\t\t\tbreak\r\n\tif ada==0: ans=min(ans,i)\t\t\r\nprint(ans)", "l = input()\nn, d = l.split()\nn = int(n)\nd = int(d)\nl = input()\nl = l.split()\nfor i in range(0,n):\n\tl[i] = int(l[i])\nl.sort()\n\nwhile(1):\n\ttemp = l[0]\n\tcnt1 = 0\n\tfor i in range(1,len(l)):\n\t\tif(l[i]-temp > d):\n\t\t\tcnt1 = cnt1+1\n\ttemp = l[len(l)-1]\n\tcnt2 = 0\n\tfor i in range(0,len(l)-1):\n\t\tif(temp-l[i] > d):\n\t\t\tcnt2 = cnt2+1\n\tif(cnt1 == 0 and cnt2 == 0):\n\t\tbreak\n\tif(cnt2 > cnt1):\n\t\tdel l[len(l)-1]\n\telse:\n\t\tdel l[0]\nprint(n-len(l))", "n,d=map(int,input().split())\r\n\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nans=10**8\r\nfor i in range(n):\r\n for j in range(i+1,n+1):\r\n if j==n or l[j]-l[i]>d: \r\n ans = min(ans, n - (j-i) )\r\n break\r\nprint(ans)\r\n", "# import logging\nimport logging.config\nimport sys\n\nlogger = logging.getLogger(__name__)\n\n\ndef main():\n\t# logger.info('=' * 40)\n\t# logger.info('STARTED')\n\n\tn, d = (int(x) for x in sys.stdin.readline().split())\n\tinput_array = [int(x) for x in sys.stdin.readline().split()]\n\tinput_array.sort()\n\n\t# \"Диамтер мультимножества, состоящего из одной точки, равен 0.\"\n\t# следовательно, тогда и удалять нечего\n\tif n == 1:\n\t\tprint('0')\n\t\treturn\n\n\t# если никакая пара точек не так близко, как надо то придётся отбрасывать n-1, чтобы оставить просто 1 точку\n\tresult = n - 1\n\t# для каждой пары точек считаем, какой они дают диаметр, а по индексам их можно рассчитать, сколько точек отброшено\n\tfor i in range(0, n - 1):\n\t\tfor j in range(i + 1, n):\n\t\t\tif (input_array[j] - input_array[i] <= d):\n\t\t\t\tif (i + (n - 1 - j) < result):\n\t\t\t\t\tresult = i + (n - 1 - j)\n\n\tprint('{}'.format(result))\n\n\nif __name__ == '__main__':\n\tmain()\n", "inp = lambda : map(int, input().split())\r\nn, m = inp()\r\na = [*inp()]\r\nprint(min([sum([0 if 0 <= i - j <= m else 1 for j in a]) for i in a]))", "n,d = list(map(int,input().split()))\r\nx = list(map(int,input().split()))\r\nx.sort()\r\nj = 0\r\nans = 0\r\nfor i in range(n):\r\n while j < n and x[j] - x[i] <= d:\r\n j += 1\r\n if j == n or x[j] - x[i] > d:\r\n j -= 1\r\n ans = max(ans,j - i + 1)\r\n\r\nprint(n - ans)\r\n", "n,d = tuple([int(item) for item in input().split(' ')])\narr = [ int(item) for item in input().split(' ')]\narr.sort()\n\nl = 0\nr = 0\nminv = 1\n\nwhile True:\n r = r+1\n if r == n:\n break\n while not (arr[r] - arr[l] <= d):\n l += 1 \n minv = max(minv, (r-l+1))\n\nprint(n-minv)\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nMax=0\r\nfor i in range (n):\r\n for j in range (i,n):\r\n if a[j]-a[i]>d:\r\n break\r\n Max=max(Max,j-i+1)\r\nprint(n-Max)\r\n", "n, d = map(int, input().split(' '))\nvalues = sorted([int(x)for x in input().split(' ')])\nk = m = 0\nfor x in range(1, n):\n while values[x] - values[k] > d:\n k += 1\n if x - k > m:m = x - k\nprint(n - (m + 1))", "n,d=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nmax=0\r\nfor i in range(len(arr)):\r\n count=0\r\n for j in range(i,len(arr)):\r\n if arr[j]-arr[i]<=d:\r\n count+=1\r\n if max<count:\r\n max=count\r\nprint(len(arr)-max)\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\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\ndef num_to_str(n):\r\n chushu = (n - 1) // 26\r\n yushu = (n - 1) % 26\r\n if chushu == 0:\r\n return chr(yushu + ord(\"a\"))\r\n else:\r\n return num_to_str(chushu) + chr(yushu + ord(\"a\"))\r\n\r\ndef main():\r\n t = input()\r\n s = input()\r\n t_num = 0\r\n s_num = 0\r\n index = 0\r\n for i in range(len(t) - 1, -1, -1):\r\n t_num += (ord(t[i]) - ord(\"a\") + 1) * 26**index\r\n s_num += (ord(s[i]) - ord(\"a\") + 1) * 26**index\r\n index += 1\r\n if s_num > t_num + 1:\r\n print(num_to_str(t_num + 1))\r\n else:\r\n print(\"No such string\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "S = input()\r\nT = input()\r\nR = list(S[:-1])\r\nR.append(chr(ord(S[-1]) + 1))\r\ni = len(R) - 1\r\nwhile i > 0 and R[i] > 'z':\r\n R[i] = 'a'\r\n R[i - 1] = chr(ord(S[i -1]) + 1)\r\n i -= 1\r\nR = \"\".join(R)\r\nif R == T: print(\"No such string\")\r\nelse: print(R)", "s = input().strip()\r\nt = input().strip()\r\nn = len(s)\r\nans1 = \"\"\r\nans2 = \"\"\r\n\r\nfor i in range(n):\r\n if s[i] == t[i]:\r\n ans1 += s[i]\r\n ans2 += s[i]\r\n \r\n elif ord(t[i])-ord(s[i]) == 1:\r\n ans1 += s[i] + \"z\"*(n-i-1)\r\n ans2 += t[i] + \"a\"*(n-i-1)\r\n break\r\n \r\n elif ord(t[i])-ord(s[i]) > 1:\r\n ans1 += chr(ord(s[i])+1) + \"a\"*(n-i-1)\r\n ans2 = ans1\r\n break\r\n \r\nif s < ans1 < t:\r\n print(ans1)\r\nelif s < ans2 < t:\r\n print(ans2)\r\nelse:\r\n print(\"No such string\")\r\n ", "# LUOGU_RID: 101573390\ndef f(s):\r\n return f(s[:-1]) + 'a' if s[-1] == 'z' else s[:-1] + chr(ord(s[-1]) + 1)\r\ns, t = input(), input()\r\ns = f(s)\r\nprint(s < t and s or 'No such string')", "f=lambda s: f(s[:-1])+'a' if s[-1]=='z'else s[:-1]+chr(ord(s[-1])+1)\ns=f(input())\nprint(('No such string',s)[s<input()])\n\t \t \t \t \t \t \t\t\t\t\t \t\t \t\t\t\t", "s = str(input())\nt = str(input())\nr = \"\"\nl = len(s)\nfor i in range(l):\n\tif s[i] == t[i]:\n\t\tr += s[i]\n\t\tcontinue\n\telse:\n\t\tif ord(s[i]) + 1 < ord(t[i]):\n\t\t\tr += chr(ord(s[i])+1)\n\t\t\tr += \"a\"*(l - len(r))\n\t\t\tprint(r)\n\t\t\texit()\n\t\telse:\n\t\t\tx = r\n\t\t\ty = r\n\t\t\tx += s[i]\n\t\t\tx += \"z\"*(l - len(x))\n\t\t\ty += t[i]\n\t\t\ty += \"a\"*(l - len(y))\n\t\t\tif x == s:\n\t\t\t\tif y == t:\n\t\t\t\t\tprint(\"No such string\")\n\t\t\t\t\texit()\n\t\t\t\telse:\n\t\t\t\t\tprint(y)\n\t\t\t\t\texit()\n\t\t\telse:\n\t\t\t\tprint(x)\n\t\t\t\texit()", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\ndic = {i:alph[i] for i in range(26)}\nS = input()\nT = input()\na,b = [x for x in S],[x for x in T]\nfor x in range(len(S)-1,-1,-1):\n if a[x]!=\"z\":\n a[x] = dic[alph.index(a[x])+1]\n break\n\nfor x in range(len(T)-1,-1,-1):\n if b[x]!=\"a\":\n b[x] = dic[alph.index(b[x])-1]\n break\n\nans1,ans2 = ''.join(a),''.join(b)\n\nif S<ans1<T:\n print(ans1)\nelif S<ans2<T:\n print(ans2)\nelse:\n print(\"No such string\")", "def solve(s: str, t: str) -> bool:\r\n \"\"\"\r\n Ref: https://codeforces.com/contest/518/problem/A\r\n \"\"\"\r\n s = list(s)\r\n t = list(t)\r\n\r\n for i in range(len(s) - 1, -1, -1):\r\n if s[i] == \"z\":\r\n s[i] = \"a\"\r\n else:\r\n s[i] = chr(ord(s[i]) + 1)\r\n break\r\n\r\n return ''.join(s) if s != t else \"No such string\"\r\n \r\ns = input()\r\nt = input()\r\nprint(solve(s, t))\r\n", "s=list(input())\r\nt=str(input())\r\niss=True\r\nhi1, hi2=len(s), len(t)\r\nfor i in range(hi1):\r\n\tif s[i]!='z':\r\n\t\tiss=False\r\nif iss:\r\n\tprint(\"No such string\")\r\n\texit()\r\nu=\"\"\r\nfor i in range(hi1-1, -1, -1):\r\n\tif s[i]!='z':\r\n\t\tf=ord(s[i])\r\n\t\tf+=1\r\n\t\ts[i]=chr(f)\r\n\t\tbreak\r\n\ts[i]='a'\r\nfor i in s:\r\n\tu+=i\r\nif u<t:\r\n\tprint(u)\r\nelse:\r\n\tprint(\"No such string\")", "#\n\na = input()\nb = input()\nf = 1\n\nfor i in range(len(a)):\n if a[i] < 'z':\n x = a[:i] + chr(ord(a[i]) + 1) + ('a' *(len(a) - i - 1))\n# print(x)\n if a < x < b:\n print(x)\n f = 0\n break\n\nif f == 1 : print(\"No such string\")\n \n\n\n \t \t \t\t \t\t\t\t \t\t \t \t \t", "alpha = {'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nalpha_back = {0: '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'}\r\none = input()\r\ntwo = input()\r\ndef nextWord(s):\r\n s = list(s)\r\n i = len(s) - 1\r\n while (s[i] == 'z' and i >= 0):\r\n s[i] = 'a'\r\n i -= 1\r\n # If all characters are 'z', append\r\n # an 'a' at the end.\r\n if (i == -1):\r\n s = s + 'a'\r\n # If there are some non-z characters\r\n else:\r\n s[i] = alpha_back[alpha[s[i]]+1]\r\n return \"\".join(s)\r\nanswer = nextWord(one)\r\nif answer == two:\r\n print('No such string')\r\nelse:\r\n print(answer)\r\n", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\ns=list(input())\r\nt=input()\r\ni=len(s)-1\r\n \r\nwhile s[i]=='z':\r\n s[i]='a'\r\n i-=1\r\ns[i]=chr(ord(s[i])+1)\r\ns=''.join(s)\r\nif s>=t:\r\n print(\"No such string\")\r\nelse:\r\n print(s)", "def asd(a,b):\r\n\r\n A = []\r\n for x in a:\r\n A.append(ord(x))\r\n\r\n s = ''\r\n \r\n C = [None]*len(a)\r\n rem = 1\r\n i = len(a) - 1\r\n for x in A[::-1]:\r\n C[i] = (x-97 + rem) % 26\r\n rem = (x-97 + rem) // 26\r\n i -= 1\r\n\r\n for x in C:\r\n s += chr(x+97)\r\n\r\n \r\n if s == b:\r\n return \"No such string\"\r\n \r\n for chS, chB in zip(s,b):\r\n if ord(chS) > ord(chB):\r\n return \"No such string\"\r\n if ord(chS) < ord(chB): \r\n break\r\n\r\n return s\r\n\r\na = input().strip()\r\nb = input().strip()\r\nprint(asd(a,b))", "x=list(input())\nk=len(x)\nb=input()\nfor i in range(k-1,-1,-1):\n if x[i]=='z':\n x[i]='a'\n else:\n x[i]=chr(ord(x[i])+1)\n break\nx=''.join(x)\nif x>=b:\n print(\"No such string\")\nelse:\n print(x)\n\t\t\t \t \t\t\t \t \t \t \t \t\t \t", "def answer():\n\n st1,st2='',''\n for i in range(n):\n if(s[i]==t[i]):\n st1+=s[i]\n st2+=t[i]\n else:\n st1+=chr(ord(s[i]) + 1)\n st2+=chr(ord(t[i]) - 1)\n\n for i in range(i+1,n):\n st1+='a'\n st2+='z'\n\n break\n\n if(st1!=s and st1!=t):return st1\n elif(st2!=s and st2!=t):return st2\n\n return 'No such string'\n \n \n \ns=input()\nt=input()\nn=len(s)\n\nprint(answer())\n\n\n \n\n \n\n\t \t\t\t\t \t\t\t\t\t\t \t\t \t \t\t \t \t", "r=input()\r\nh=input()\r\nr=list(r)\r\nh=list(h)\r\nfor i in range(len(r)-1,-1,-1):\r\n\tif r[i]!='z':\r\n\t\tr[i]=chr(ord(r[i])+1)\r\n\t\tbreak\r\n\telse:\r\n\t\tr[i]='a'\r\nif r!=h:\r\n\tprint(*r,sep=\"\")\r\nelse:\r\n\tprint(\"No such string\")", "def construct(i):\r\n res = a[::]\r\n res[i] = chr(ord(res[i]) + 1)\r\n for i in range(i + 1, len(res)):\r\n res[i] = 'a'\r\n return ''.join(res)\r\n\r\ns = input().rstrip()\r\nt = input().rstrip()\r\na = list(s)\r\nfor i in range(len(a) - 1, -1, -1):\r\n if a[i] != 'z':\r\n ret = construct(i)\r\n if ret < t:\r\n print(ret)\r\n exit()\r\nprint('No such string')\r\n", "# LUOGU_RID: 118159945\ndef nxt(a):\r\n\tif a.count('z')==len(a):\r\n\t\treturn 'a'*(len(a)+1)\r\n\tfor i in range(len(a)-1,-1,-1):\r\n\t\tif a[i]!='z':\r\n\t\t\treturn a[:i]+chr(ord(a[i])+1)+a[i+1:]\r\n\t\telse:\r\n\t\t\ta=a[:i]+'a'+a[i+1:]\r\na,b=input(),input()\r\nc=nxt(a)\r\nif c==b:\r\n\tprint('No such string')\r\nelse:\r\n\tprint(c)", "# CodeForces : 518A Vitaly And Strings\r\nimport sys\r\ns=list(input())\r\nt=list(input())\r\nfor i in range (len(s)-1,-1,-1):\r\n while s[i]!='z':\r\n s[i]=chr(ord(s[i])+1)\r\n if s<t :\r\n print(''.join(s))\r\n sys.exit()\r\n if s[i]=='z':\r\n s[i]='a'\r\nprint(\"No such string\")\r\n\r\n ", "s = input()\r\nt = input()\r\nn = len(s)\r\nfor i in range(n):\r\n d = ord(t[i]) - ord(s[i])\r\n if d > 1:\r\n print(s[:i] + chr(ord(s[i]) + 1) + s[i + 1:])\r\n exit()\r\n if d == 1 and i < n - 1:\r\n for j in range(i + 1, n):\r\n if s[j] < \"z\":\r\n print(s[:i + 1] + \"z\" * (n - i - 1))\r\n exit()\r\n if t[j] > \"a\":\r\n print(t[:i + 1] + \"a\" * (n - i - 1))\r\n exit()\r\nprint(\"No such string\")\r\n", "a = input()\nb = input()\nflag = 1\nc = ''\nfor i in range(len(a)-1, -1, -1):\n if(a[i] == 'z'):\n c = 'a'+c\n continue\n if(a[i] < 'z'):\n\n c = chr(ord(a[i])+1)+c\n c = a[:i]+c\n flag = 0\n break\nif(flag):\n print('No such string')\nelif(c < b):\n for i in c:\n print(i, end='')\nelse:\n print('No such string')\n\n\t\t\t \t \t \t\t \t\t\t\t\t \t \t \t\t \t\t \t", "# n = int(input())\n#1\n# arr = input().split(\" \")\n# if n == 1:\n# if arr[0] == \"1\":\n# print(\"YES\")\n# else:\n# print(\"NO\")\n# else:\n# if (arr.count(\"0\") == 1):\n# print(\"YES\")\n# else:\n# print(\"NO\")\n\n#2\n# s = input()\n# result = 0\n# cr = 'a'\n# for i in range(len(s)):\n# n = s[i]\n# r = abs(ord(cr) - ord(n))\n# if r < 13:\n# result += r\n# else:\n# result += (26 - r)\n# cr = n\n\n# print(result)\n\n#3\n# n = input()\n# arr = input().split(\" \")\n# arr = [int(i) for i in arr]\n# arr.insert(0,0)\n# arr.append(90)\n# result = 0\n# for i in range(len(arr) - 1):\n# if arr[i+1] - arr[i] > 15:\n# result = arr[i] + 15\n# break\n# result += arr[i+1] - arr[i]\n\n# print(min(result, 90))\n\n#4\nS = input()\nT = input()\nresult = []\ndef lexNext(s, n): \n \n # Iterate from last character \n for i in range(n - 1, -1, -1): \n # If not 'z', increase by one \n if s[i] != 'z': \n k = ord(s[i]) \n s[i] = chr(k + 1) \n return ''.join(s) \n \n # if 'z', change it to 'a' \n s[i] = 'a'\n\nn = len(S) \n\nS = list(S) \nres = lexNext(S, n) \n\n# If not equal, print the \n# resultant string \nif res != T: \n print(res) \nelse: \n print(\"No such string\")\n", "s = list(input())\r\nt = list(input())\r\n\r\nfor i in range(len(s)-1, -1, -1):\r\n if s[i] == 'z':\r\n s[i] = 'a'\r\n else:\r\n s[i] = chr(ord(s[i]) + 1)\r\n break\r\n \r\nprint(''.join(s) if s != t else 'No such string')", "a=list(input())\nb=list(input())\n#print(a)\nli=list(a)\nfor i in range(len(a)-1,-1,-1):\n if li[i]=='z':\n if chr(ord(b[i])-1)<'a':\n li[i]=b[i]\n else:\n li[i]=chr(ord(b[i])-1)\n else:\n li[i]=chr(ord(li[i])+1)\n break\nif li==list(a) or li>=b or a==b:\n print(\"No such string\")\nelse:\n print(*li,sep=\"\")\n \t \t\t\t \t \t \t \t \t \t \t\t\t\t\t", "s=list(input())\ns1=list(input())\nans = \"No such string\"\nfor i in range(len(s)-1,-1,-1):\n if ord(s[i])<122:\n s[i]=chr(ord(s[i])+1)\n break\n s[i]='a'\nif s1 == s:\n print(ans)\nelse:\n print(''.join(s))\n\n\t\t\t\t\t\t\t\t\t \t \t\t\t \t \t \t\t \t\t \t\t", "def f(s): return f(s[:-1])+'a' if s[-1] == 'z'else s[:-1]+chr(ord(s[-1])+1)\n \ns = f(input())\n \nprint(('No such string', s)[s < input()])\n\t\t\t\t \t \t \t\t\t\t\t\t \t \t \t \t \t", "s1=input()\ns2=input()\na=''\nb=''\nfor i in range(len(s1)-1,-1,-1):\n if s1[i]!='z':\n break\na=s1[:i]+chr(ord(s1[i])+1)+s1[i+1:]\nfor j in range(len(s2)-1,-1,-1):\n if s2[j]!='a':\n break\nb=s2[:j]+chr(ord(s2[j])-1)+s2[j+1:]\nif a>s1 and a<s2:\n print(a)\nelif b>s1 and b<s2:\n print(b)\nelse:\n print('No such string')\n \t \t\t \t\t\t \t \t\t \t\t\t \t \t", "# y tuong:\r\n# duyet mang tu dau den cuoi, tao ra mang khac mậc định toàn False\r\n# xet tung ki tu trong chuoi s va t\r\n# neu hieu s[i] va t[i] lon hơn bằng 2, danh dấu check[i] = True\r\n# Neu la True và t[i] khac ki tu 'a' thi đưa ra két quả là t[:i]+(t[i]-1)+t[i+1:]\r\n# Nguoc lai ket qua la t[:i]+(s[i]+1)+t[i+1:]\r\n# Neu hiệu s[i] va t[i] bằng 1: cho j = i+1, lặp với j\r\n# Neu t[j] khác a: thi ket qua: t[:j] + 'a'\r\n# Neu s[j] bằng a thì: kết quả là: s[:j] + 'b'\r\n\r\ns = input ()\r\nt = input()\r\ndef string (string1, string2):\r\n ans = \"No such string\"\r\n check = [False]* len(string1)\r\n i = 0\r\n while i < len(string1):\r\n if abs(ord(string1[i]) - ord(string2[i])) >= 2 and string2[i]!= 'a':\r\n check [i] = True\r\n if True in check:\r\n ans = string2\r\n if string2[i] == 'a':\r\n ans = ans[:i]+chr(ord(string1[i])+1) + ans[i+1:]\r\n else:\r\n ans = string2[:i]+chr(ord(string2[i])-1) + ans[i+1:]\r\n return ans\r\n if ord(string2[i]) - ord(string1[i]) == 1:\r\n j = i+1\r\n while j < len(string1):\r\n if string2[j] != 'a' :\r\n ans =\"\"\r\n ans = string2[:j] + 'a'\r\n if string1[j] == 'a':\r\n ans =\"\"\r\n ans = string1[:j] + 'b'\r\n\r\n j += 1\r\n i += 1\r\n return ans\r\n\r\nprint(string(s,t))\r\n", "# Tran Duy_Big O Blue\r\n# +1 vao s, neu s = t => no such thing, s != t => print(s)\r\ns = list(input())\r\nt = list(input())\r\nequal = True\r\n\r\nfor i in range(len(s)-1, -1, -1):\r\n if s[i] == 'z':\r\n s[i] = 'a'\r\n else:\r\n s[i] = chr(ord(s[i])+1)\r\n break\r\n\r\nfor i in range(len(s)):\r\n if s[i] != t[i]:\r\n equal = False\r\n break\r\n\r\nif equal is True:\r\n print('No such string')\r\n exit()\r\ns = ''.join(s)\r\nprint(s)\r\n", "a=list(input())\r\nb=input()\r\ni=len(a)-1\r\nwhile a[i] == 'z':\r\n a[i]='a'\r\n i-=1\r\na[i]=chr(ord(a[i])+1)\r\na=''.join(a)\r\nif a>=b:\r\n print('No such string')\r\nelse:\r\n print(a)", "s = input();\r\nt = input();\r\nl = len(s);\r\nresult = '';\r\nnoString = False;\r\n\r\nfor i in range(l):\r\n if ord(t[i]) - ord(s[i]) > 1:\r\n result+=chr(ord(t[i])-1);\r\n for j in range(i+1, l): result+=t[i];\r\n break;\r\n\r\n elif ord(t[i]) - ord(s[i]) == 1:\r\n if i < l-1:\r\n for k in range(l-1, i, -1):\r\n if ord(s[k]) < 122:\r\n for n in range(i, l):\r\n if n == k: result+=chr(ord(s[k])+1);\r\n else: result+=s[n];\r\n break;\r\n elif ord(t[k]) > 97:\r\n for m in range(i, l):\r\n if m == k: result+=chr(ord(t[k])-1);\r\n else: result+=t[m];\r\n break;\r\n elif k == i+1:\r\n noString = True;\r\n break;\r\n break;\r\n else:\r\n noString = True;\r\n break;\r\n else:\r\n result+=s[i];\r\n\r\nif noString: print('No such string');\r\nelse: print(result);", "x,y = list(input()),input()\r\nL=len(x)-1\r\nwhile(x[L]=='z'):\r\n x[L]='a'\r\n L=L-1\r\nx[L]=chr(ord(x[L])+1)\r\nx=''.join(x)\r\nif(x>=y):\r\n\tprint('No such string')\r\nelse:\r\n\tprint(x)", "s = list(input())\r\nt = input()\r\ni = len(s)-1\r\nwhile i >=0 :\r\n if s[i] != 'z':\r\n s[i] = chr(ord(s[i])+1)\r\n break\r\n else :\r\n s[i] = 'a'\r\n #print(i , s[i])\r\n i-=1\r\ns = ''.join(s)\r\nprint([s , 'No such string'][s>=t])", "s = input()\r\nt = input()\r\nm = 'No such string'\r\nif len(s)==1 and ord(t[0]) - ord(s[0])>1:\r\n m = chr(ord(s[0])+1)\r\nelse: \r\n for i in range(len(s)):\r\n a= ord(t[i]) - ord(s[i])\r\n if a > 1:\r\n m = s[:i] + chr(ord(s[i])+1) +s[i+1:]\r\n break\r\n if a == 1 and i != len(s)-1 and s[i+1]!= 'z':\r\n m = s[:i+1] + chr(ord(s[i+1])+1) +s[i+2:]\r\n break\r\n if a == 1 and i != len(s)-1 and s[i+1]== 'z' and t[i+1] !='a':\r\n m = s[:i] + chr(ord(s[i])+1) +'a'+ s[i+2:]\r\n break\r\n if a == 1 and i != len(s)-1 and s[i+1]== 'z' and t[i+1] =='a':\r\n for j in range ((i+2),len(s)):\r\n if s[j] !='z':\r\n m = s[:j] + chr(ord(s[j])+1)+ s[j+1:]\r\n break\r\n if t[j] !='a':\r\n m = t[:j] + chr(ord(t[j])-1) +t[j+1:]\r\n break\r\nprint (m)", "s = input()\r\nt = input()\r\ndef increaseString(s):\r\n t = -1\r\n ans = \"\"\r\n while(s[t] == 'z'):\r\n t -= 1\r\n ans = s[:t]\r\n ans += chr(ord(s[t]) + 1)\r\n while(len(ans) < len(s)):\r\n ans += 'a'\r\n return ans\r\n\r\nres = increaseString(s)\r\nif (res < t):\r\n print(res)\r\nelse:\r\n print(\"No such string\")", "#A. Vitaly and Strings\r\n#1. Caculate distance in ASCII code between charaters in the first and the second string\r\n#2. at index \"i\", if the current distance is 1 or 0 and the previous distance is not 1, then character i-th of first string will be add to the the middle_string (result we want to find)\r\n#3. if distance is different from 1 and 0 then\r\n#\t- if current character of first string is \"z\": then we add \"a\" to the middle_string\r\n#\t- otherwise add a character which after current character of first string in ascii code \r\n\r\n#4. In case character is \"z\" in the first string and previous distance right before it is 1 then replace the current character of middle string by the character at current index of second string, and add from there to the end \"a\". After finish, break the for loop\r\n\r\n#5. For the result, if the middle string is different from first and second string then we print it out, otherwise print the error message\r\n\r\n\r\nfirst_string = input()\r\nsecond_string = input()\r\n\r\nerror_string = \"No such string\"\r\nmiddle_string = \"\"\r\ndistance_array = []\r\nprevious_distance = 0\r\n\r\nfor index in range(len(first_string)):\r\n\tdistance = ord(second_string[index]) - ord(first_string[index])\r\n\tif first_string[index] == \"z\" and previous_distance == 1:\r\n\t\tmiddle_string = middle_string[:-1]\r\n\t\tmiddle_string = middle_string + second_string[index-1]\r\n\t\tfor i in range(index, len(first_string)):\r\n\t\t\tmiddle_string = middle_string + \"a\"\r\n\t\tbreak\r\n\t\t\r\n\tif (distance == 1 or distance == 0) and previous_distance != 1:\r\n\t\tmiddle_string = middle_string + first_string[index]\r\n\telse:\r\n\t\tif first_string[index] == \"z\":\r\n\t\t\tmiddle_string = middle_string + \"a\"\r\n\t\telse:\r\n\t\t\tmiddle_string = middle_string + str(chr(ord(first_string[index]) + 1))\r\n\t\r\n\tprevious_distance = distance\r\n\t\r\nprint(middle_string) if (middle_string != first_string and middle_string != second_string) else print(error_string)", "a=input();b=input();da=db=0;ans=\"\"\r\nfor ai in a:\r\n da=da*26+ord(ai)-97\r\nfor bi in b:\r\n db=db*26+ord(bi)-97\r\nif da+1==db:\r\n print(\"No such string\")\r\nelse :\r\n da=da+1\r\n if(da//(26**len(a))!=0):\r\n print(\"No such string\")\r\n else :\r\n for i in range (1,len(a)+1):\r\n ans=ans+chr(da%(26**(len(a)-i+1))//(26**(len(a)-i))+97)\r\n print(ans)", "s1=input()\r\ns2=input()\r\nres=[]\r\nfor i in range(len(s1)-1,-1,-1):\r\n if s1[i]=='z':\r\n res=['a']+res\r\n else :\r\n en=i\r\n res=[chr(ord(s1[i])+1)]+res\r\n s3=s1[:en]+('').join(res)\r\n break\r\nif s3==s2:\r\n print(\"No such string\")\r\nelse :\r\n print(s3)", "s = input()\nt = input()\nx = 0\ny = 0\n\nfor c in s:\n x = x * 26 + ord(c) - ord('a')\n\n\nfor c in t:\n y = y * 26 + ord(c) - ord('a') \n\nif x + 1 >= y:\n print('No such string')\nelse :\n l = []\n z = (x + y) // 2\n for i in range(len(s)):\n l.append( chr(z % 26 + ord('a')) )\n z //= 26\n print(''.join(l[::-1]))\n\n\n \t\t\t\t\t\t\t \t\t\t\t \t\t \t\t\t\t \t", "def get_next(s):\r\n s = list(s)\r\n n, s[-1] = len(s), ord(s[-1]) + 1\r\n for i in range(1, n + 1):\r\n if s[-i] < 123:\r\n s[-i] = chr(s[-i])\r\n return ''.join(s)\r\n s[-i] = chr(s[-i] - 26)\r\n if i < n:\r\n s[-i-1] = ord(s[-i-1]) + 1\r\n return ''.join(s)\r\n\r\n\r\ns, t = input(), input()\r\nv = get_next(s)\r\nprint(v if s < v < t else 'No such string')", "# from debug import debug\r\n# import sys\r\n\r\ns1 = list(input().strip())\r\ns2 = input().strip()\r\nn = len(s1)\r\nc = 1\r\nfor i in range(n-1, -1, -1):\r\n\tif not c:\r\n\t\tbreak\r\n\tif s1[i] == 'z' and c:\r\n\t\ts1[i] = 'a'\r\n\telse:\r\n\t\ts1[i] = chr(ord(s1[i])+1)\r\n\t\tc = 0\r\ns1 = \"\".join(s1)\r\nif not c:\r\n\tif s2 <= s1:\r\n\t\tprint(\"No such string\")\r\n\telse:\r\n\t\tprint(s1)\r\nelse:\r\n\tprint(\"No such string\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nALPHA = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\ns = input()\r\nt = input()\r\n\r\nadd = 1\r\nans = [c for c in s]\r\nfor i in range(len(s)-1,-1,-1):\r\n j = ALPHA.index(s[i])\r\n j+=add\r\n if j>=26:\r\n ans[i] = ALPHA[j%26]\r\n add = 1\r\n else:\r\n ans[i] = ALPHA[j]\r\n add = 0\r\n \r\nans = ''.join(ans)\r\nif ans<t:\r\n print(ans)\r\nelse:\r\n print('No such string')\r\n ", "s = input()\r\nt = input()\r\nx = list(s)\r\ni = len(s) - 1\r\nwhile (i>= 0 and x[i] == 'z'):\r\n\tx[i] = 'a'\r\n\ti-=1\r\nif (i >= 0):\r\n\tx[i] = chr(ord(s[i]) + 1)\r\nx = ''.join(x)\r\nif x < t:\r\n\tprint(x)\r\nelse:\r\n\tprint('No such string')", "s = input()\r\nt = input()\r\ni = len(s) -1\r\nx = list(s)\r\nwhile (i>= 0 and x[i] == 'z'):\r\n\tx[i] = 'a'\r\n\ti-=1\r\n\r\nif (i >= 0):\r\n\tx[i] = chr(ord(s[i]) + 1) \r\nx = ''.join(x)\r\nif x < t:\r\n\tprint(x)\r\nelse:\r\n\tprint(\"No such string\")\r\n", "s1=str(input())\r\ns2=str(input())\r\narr1=[]\r\narr2=[]\r\nfor i in range(len(s1)):\r\n arr1.append(s1[i])\r\nfor i in range(len(s2)):\r\n arr2.append(s2[i])\r\nfor i in range(len(arr1)-1,-1,-1):\r\n if arr1[i]=='z':\r\n arr1[i]='a'\r\n else:\r\n arr1[i]=chr(ord(arr1[i])+1)\r\n break\r\nif arr1<arr2:\r\n for i in range(len(arr1)):\r\n print(arr1[i],end=\"\")\r\n print(\"\")\r\nelse:\r\n print(\"No such string\")", "from sys import stdin\r\ninput=stdin.readline\r\ns=input().rstrip()\r\nt=input().rstrip()\r\nn=len(s)\r\nf=lambda x:f(x[:-1])+\"a\" if x[-1]==\"z\" else x[:-1]+chr(ord(x[-1])+1)\r\ns=f(s)\r\nif s<t:\r\n print(s)\r\nelse:\r\n print(\"No such string\")", "from sys import stdin\n\ns=stdin.readline().strip('\\n')\nt=stdin.readline().strip('\\n')\nlis=list(s.strip())\ni=len(s)-1\nwhile i>=0:\n if chr(ord(s[i]))=='z':\n lis[i]='a' \n else:\n lis[i]=chr(ord(s[i])+1)\n break\n i-=1\na=\"\".join(lis)\nprint(a if a>s and a<t else 'No such string')\n\t\t\t\t \t\t \t \t \t\t\t \t \t \t\t\t \t", "a = input()\r\nb = input()\r\ndef f(x):\r\n return {'a':'b', 'b':'c', 'c':'d', 'd':'e', 'e':'f', 'f':'g', 'g':'h', 'h':'i', 'i':'j', 'j':'k', 'k':'l', 'l':'m',\r\n 'm':'n', 'n':'o', 'o':'p', 'p':'q', 'q':'r', 'r':'s', 's':'t', 't':'u', 'u':'v', 'v':'w', 'w':'x', 'x':'y',\r\n 'y':'z', 'z':'a'}[x]\r\ndef h(x):\r\n n = ''\r\n for k in range(len(x)):\r\n if x[len(x)-1-k] == 'z':\r\n n = n +'a'\r\n else:\r\n m = x[:len(x)-1-k] + f(x[len(x)-1-k]) + n\r\n break\r\n return m\r\nif h(a) == b:\r\n print('No such string')\r\nelse:\r\n print(h(a))", "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 s = IS()\r\n t = IS()\r\n n = len(s)\r\n ans = list(s)\r\n for i in range(n - 1, -1, -1):\r\n w = s[i]\r\n if w == 'z':\r\n ans[i] = 'a'\r\n else:\r\n ans[i] = chr(ord(w) + 1)\r\n break\r\n ans = ''.join(ans)\r\n if s < ans < t:\r\n print(ans)\r\n else:\r\n print('No such string')\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "\ns = list(input().lower())\nt = list(input().lower())\n\n# import random\n# count = 0\n# output = []\n# for i in range(len(s)):\n# diff = ord(t[i]) - ord(s[i])\n#\n# if diff < 0:\n# print('No such string')\n# exit()\n# elif diff > 0:\n# temp = [chr(ord(s[i])+idx) for idx in range(1, diff)] # [add new possible character ord in the range (s[i],t[i])]\n# output.append(random.choice(temp))\n# else:\n# count += 1\n\nx = s\nfor i in range(len(s)-1, -1, -1):\n if x[i] == 'z':\n x[i] = 'a'\n else:\n x[i] = chr(ord(x[i]) + 1)\n break\n\nprint('No such string' if x == t else ''.join(x))\n# if x == t:\n# print('No such string')\n# else:\n# print(''.join(x))\n\n\n# Solution\n# for i in range(len(s) - 1, -1, -1):\n# if s[i] == 'z':\n# s[i] = 'a'\n# else:\n# s[i] = chr(ord(s[i]) + 1)\n# break\n#\n# print(''.join(s) if s != t else \"No such string\")\n\n'''\nlexicographically: dictionary order\n'abzz' (similar to 1299) + 1 = 'acaa' (similar to 1300)\n Note:\n x = s\n for i = length-1 to 0\n if x[i] == 'z' # like 19 + 1 = 20 \n x[i] = 'a'\n else:\n x[i] = x[i] + 1\n break\n if x == t\n output No such string\n else: output x\n'''", "s = [ord(l) for l in input()]\r\ns[-1] += 1\r\nt = [ord(l) for l in input()]\r\nfor i in range(len(s)-1, 0, -1):\r\n if s[i] > ord('z'):\r\n s[i] = ord('a')\r\n s[i-1] += 1\r\n \r\nif s == t:\r\n print('No such string')\r\nelse:\r\n print(''.join(map(chr, s)))", "def getStringVitaly(strS,strT):\r\n ans = ''\r\n indexCuoi = len(strS) - 1\r\n i = indexCuoi\r\n while i >= 0:\r\n if strS[i] != 'z' and i == indexCuoi:\r\n ans += chr(ord(strS[i])+1)\r\n elif strS[i] == 'z' and i == indexCuoi:\r\n ans += 'a'\r\n indexCuoi -= 1\r\n else:\r\n ans += strS[i]\r\n i -= 1\r\n return ans[::-1]\r\n \r\nstrS = input()\r\nstrT = input()\r\nans = getStringVitaly(strS,strT)\r\nif ans == strS or ans == strT:\r\n print(\"No such string\")\r\nelse:\r\n print(ans)\r\n", "ss_string = input()\r\ntt_string = input()\r\n\r\nss_string_list = list(ss_string)\r\nsize = len(ss_string_list)\r\nfor i in range(size - 1, -1, -1):\r\n if ss_string_list[i] != \"z\":\r\n next_ch = chr(ord(ss_string[i]) + 1)\r\n ss_string_list[i] = next_ch\r\n break\r\n else:\r\n next_ch = \"a\"\r\n ss_string_list[i] = next_ch\r\n\r\nresult = \"\"\r\nfor ch in ss_string_list:\r\n result = result + ch\r\n\r\nif result != tt_string:\r\n print(result)\r\nelse:\r\n print(\"No such string\")", "s1, s2 = input(), input()\r\nlength = len(s1)\r\nm = s1\r\nflag = 1 # not true\r\n\r\nfor i in range(length):\r\n \r\n j = length-1-i\r\n\r\n if s1[j]=='z':\r\n a = 'a'\r\n else:\r\n a = chr(ord(s1[j])+1)\r\n \r\n m = m[:j] + a + m[j+1:]\r\n\r\n if m<s2 and m>s1 :\r\n flag = 0 # true\r\n break\r\n \r\nif flag ==0:\r\n print(m)\r\nelse:\r\n print(\"No such string\")", "s = input()\r\nt = input()\r\n\r\ns_list = list(s)\r\n\r\nfor i in range(len(s) - 1, -1, -1):\r\n if s[i] == 'z':\r\n s_list[i] = 'a'\r\n else:\r\n s_list[i] = chr(ord(s[i]) + 1)\r\n break\r\n\r\nres = ''.join(s_list)\r\n\r\nif res != t:\r\n print(res)\r\nelse:\r\n print('No such string')", "s = input()\nt = input()\ns = [i for i in s]\nt = [i for i in t]\ni = len(s)-1\nwhile(i>=0):\n if(s[i]=='z'):\n s[i] = 'a'\n else:\n a = ord(s[i])+1\n s[i] = chr(a)\n break\n i -= 1\ns = ''.join(s)\nt = ''.join(t)\nif(s>=t):\n print('No such string')\nelse:\n print(s)\n \n\n \n\n\t \t \t \t\t \t \t\t\t \t\t \t\t\t\t \t\t\t", "def function(p,q):\n new_p=\"\"\n table='abcdefghijklmnopqrstuvwxyz'\n add_letter=''\n for i in range(len(p)-1,-1,-1):\n if p[i]!='z':\n next_index=table.find(p[i])+1\n next_letter=table[next_index]\n stop_index=i\n add_letter = next_letter + add_letter\n break\n else:\n next_letter='a'\n add_letter = next_letter + add_letter\n \n new_p=p[0:stop_index]+add_letter\n if new_p == q: \n return 'No such string'\n else:\n return new_p\n\np = input()\nq = input()\nprint (function(p,q))\n\t \t\t \t\t\t\t \t \t \t\t \t\t \t \t \t\t\t", "s = input()\r\nt = input()\r\n\r\nn = len(s)\r\n\r\nans = list(s)\r\nfor i in range(n - 1, -1, -1):\r\n if(ans[i] != 'z'):\r\n ans[i] = chr(ord(s[i]) + 1)\r\n break\r\n else:\r\n ans[i] = 'a' \r\nans = ''.join(ans)\r\nif(ans < t):\r\n print(ans)\r\nelse:\r\n print(\"No such string\")", "s = list(input())\nt = list(input())\n \nfor i in range(len(s)-1, -1, -1):\n if s[i] == 'z':\n s[i] = 'a'\n else:\n s[i] = chr(ord(s[i]) + 1)\n break\nif(s!=t):\n \tprint(''.join(s))\nelse:\n\tprint(\"No such string\")\n\t \t \t \t \t \t \t\t \t", "g=input()\nh=input()\ng=list(g)\nh=list(h)\nfor i in range(len(g)-1,-1,-1):\n\tif g[i]!='z':\n\t\tg[i]=chr(ord(g[i])+1)\n\t\tbreak\n\telse:\n\t\tg[i]='a'\nif g!=h:\n\tprint(*g,sep=\"\")\nelse:\n\tprint(\"No such string\")\n\t \t\t\t\t \t\t\t \t\t \t \t\t\t\t \t \t\t \t", "a=list(input())\nb=input()\n\nl=len(a)-1\n\nwhile a[l]=='z':\n a[l]='a'\n l-=1\na[l]=chr(ord(a[l])+1)\na=''.join(a)\nif a>=b:\n print('No such string')\nelse:\n print(a)\n \n\t \t \t\t\t\t\t\t\t\t\t\t \t \t \t \t \t\t\t\t\t", "s=input()\r\nt=input()\r\nn=len(s)\r\n\r\nfor i in range(0,n):\r\n if s[i]!='z':\r\n id=i\r\n\r\nx=chr(ord(s[id])+1)\r\ns=s[:id-n]+x\r\n\r\nfor i in range(id+1,n):\r\n s+='a'\r\n \r\nif s==t:\r\n print(\"No such string\")\r\nelse:\r\n print(s)", "s = input()\r\nt = input()\r\nn = len(s)\r\nans = \"\"\r\nflag = 0\r\nfor i in range(n):\r\n if flag == 0:\r\n if ord(s[i]) > ord(t[i]):\r\n flag = -1\r\n break\r\n elif ord(s[i]) < ord(t[i]):\r\n if ord(t[i]) - ord(s[i]) > 1:\r\n ans += chr(ord(s[i]) + 1)\r\n flag = 1\r\n else:\r\n s1 = s[i + 1: n]\r\n t1 = t[i + 1: n]\r\n if s1.count('z') == n - i - 1 and t1.count('a') == n - i - 1:\r\n flag = -1\r\n break\r\n elif s1.count('z') != n - i - 1:\r\n ans += s[i]\r\n flag = 2\r\n elif t1.count('a') != n - i - 1:\r\n ans += t[i]\r\n flag = 1\r\n else:\r\n ans += s[i]\r\n elif flag == 1:\r\n ans += 'a'\r\n elif flag == 2:\r\n ans += 'z'\r\n\r\nif flag == -1:\r\n print(\"No such string\")\r\nelse:\r\n print(ans)\r\n", "s1 = list(input())\ns2 = list(input())\nn = len(s1)\ni = 0\nres = 0\nfor i in range(n-1,-1,-1):\n if(s1[i]=='z'):\n s1[i]='a'\n else:\n s1[i] = chr(ord(s1[i])+1)\n break\nif(s1!=s2):\n print(''.join(s1))\nelse:\n print(\"No such string\")", "def main():\r\n s=input()\r\n t=input()\r\n s=list(s)\r\n base=ord('z')-ord('a')+1;\r\n remain=1\r\n zero=ord('a')\r\n i=len(s)-1\r\n while remain>0 and i>=0:\r\n temp=ord(s[i])-zero+remain\r\n s[i]=chr(temp%base+zero)\r\n remain=(temp)//base\r\n i-=1\r\n s=''.join(s)\r\n flag=0\r\n for i in range(len(s)):\r\n if s[i]!=t[i]:\r\n flag=1\r\n break\r\n if flag==1:\r\n print(s)\r\n else:\r\n print('No such string')\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = list(input())\r\nlenght = len(n)\r\nb = input()\r\nfor i in range(lenght-1, -1, -1):\r\n if n[i] == \"z\":\r\n n[i] = \"a\"\r\n else:\r\n n[i] = chr(ord(n[i])+1)\r\n break\r\nn = \"\".join(n)\r\nif n >= b:\r\n print(\"No such string\")\r\nelse:\r\n print(\"\".join(n))", "#begin of codeforces template\r\n# (don't delete):\r\n# \r\n# from collections import *\r\n# from heapq import *\r\n# import bisect\r\n#\r\n#t = int(input()) #input number of test cases\r\n#for _ in range(t): #iter for test cases\r\n# n = int(input()) #input int\r\n# n,m = map(int,input().split()) #input tuple\r\n# L = list(map(int,input().split())) #input list\r\n# s = input() #input string\r\n# ans = solve(s,L) #solve\r\n# print(ans)\r\n#\r\n#end of codeforces template\r\n\r\nfrom collections import *\r\n\r\ninf = float(\"inf\")\r\n\r\ndef solve(s,t):\r\n ans = list(s)\r\n i = len(s) - 1\r\n while i>=0:\r\n a = s[i]\r\n if a == 'z':\r\n b = 'a'\r\n ans[i] = b\r\n i-=1\r\n else:\r\n b = chr(ord(a)+1)\r\n ans[i] = b\r\n break\r\n ans2 = \"\".join(ans)\r\n if ans2>=t:\r\n return \"No such string\"\r\n return ans2\r\n\r\ns = input()\r\nt = input()\r\nprint(solve(s,t))", "n=list(input())\nk=len(n)\nb=input()\nfor i in range(k-1,-1,-1):\n if n[i]=='z':\n n[i]='a'\n else:\n n[i]=chr(ord(n[i])+1)\n break\nn=''.join(n)\nif n>=b:\n print(\"No such string\")\nelse:\n print(n)\n\n\t \t\t\t\t \t\t\t \t \t \t \t\t \t\t \t\t", "# In case of length of s and t equal 1\r\n# Calculate difference between s and t\r\n# If difference is larger than 1\r\n# Print next alphabet character in ASCII table\r\n# Else\r\n# Print 'No such string'\r\n# Else\r\n# Create a new string which is a clone of s\r\n# Loop from start to end of both string s and t\r\n# Calculate absolute difference between s[i] and t[i]\r\n# If difference is larger than or equal to 0\r\n# Identify next alphabet character\r\n# If s[i] equal to 'z'\r\n# Replace current character of clone string with 'a'\r\n# Else\r\n# Replace current character of clone string with next alphabet character in ASCII table\r\n# Compare clone string with s and t\r\n# If clone string is larger than s and smaller than t\r\n# Print clone string\r\n# Exit from program\r\n#\r\n# If there is no such string is printed while looping\r\n# Print 'No such string'\r\n\r\ns = input()\r\nt = input()\r\nlength = len(s)\r\n\r\nif False:\r\n dist = abs(ord(t) - ord(s))\r\n if dist > 1:\r\n print(chr(ord(s) + 1))\r\n else:\r\n print('No such string')\r\nelse:\r\n s_clone = list(s)\r\n for i in range(length - 1, -1, -1):\r\n dist = abs(ord(t[i]) - ord(s[i]))\r\n if dist >= 0:\r\n if s[i] == 'z':\r\n s_clone[i] = 'a'\r\n else:\r\n s_clone[i] = chr(ord(s[i]) + 1)\r\n if ''.join(s_clone) > s and ''.join(s_clone) < t:\r\n print(''.join(s_clone))\r\n exit()\r\n print('No such string')", "s = input()\r\nt = input()\r\nk = 1\r\nstri = \"\"\r\nfor i in s[::-1]:\r\n\tm= ord(i) + k\r\n\tif m> 122:\r\n\t\tk = 1\r\n\t\tstri += \"a\"\r\n\telse:\r\n\t\tk= 0\r\n\t\tstri += chr(m)\r\n\r\nif stri[::-1] == t:\r\n\tprint(\"No such string\")\r\nelse:\r\n\tprint(stri[::-1])\r\n\t", "s = input()\r\nt = input()\r\nu = list(s[:])\r\ni = len(s) - 1\r\nwhile i >= 0:\r\n\tif s[i] != 'z':\r\n\t\tu[i] = chr(ord(s[i]) + 1)\r\n\t\tbreak\r\n\telse:\r\n\t\tu[i] = 'a'\r\n\ti -= 1\r\nresult = \"\"\r\nresult = result.join(u)\r\nif result != t:\r\n\tprint(result)\r\nelse:\r\n\tprint(\"No such string\")\r\n\r\n\r\n", "a = input()\r\nb = input()\r\n\r\nfor i in range(len(a) - 1, -1, -1):\r\n if a[i] != 'z':\r\n temp = chr(ord(a[i]) + 1)\r\n a = a[:i] + temp + a[i+1:]\r\n break\r\n if a[i] == 'z':\r\n a = a[:i] + 'a' + a[i+1:]\r\nif a != b:\r\n print(a)\r\nelse:\r\n print('No such string')", "#giu nguyen cac chu cai dau cua chuoi s, thay doi chu cuoi cung\n#dung ham list chuyen kieu du lieu sang dang list\n#dung vong while de doi vi tri x[i] = a neu x[i]=z\n#Neu i >= 0 thi x[i] se cong 1 roi chuyen thanh ki tu dang chuoi\n# dung join() de noi chuoi, sau do kiem tra voi chuoi t, neu chuoi x nho hon chuoi t thi in chuoi x.\ns = input()\nt = input()\nx = list(s)\ni = len(s) - 1\nwhile (i>= 0 and x[i] == 'z'):\n\tx[i] = 'a'\n\ti-=1\nif (i >= 0):\n\tx[i] = chr(ord(s[i]) + 1)\nx = ''.join(x)\nif x < t:\n\tprint(x)\nelse:\n\tprint('No such string')\n", "s, t = list(input()), input()\n\nc = 1\nfor i in range(len(s) - 1, -1, -1):\n x = ord(s[i]) - ord('a') + c\n s[i], c = chr(ord('a') + x % 26), x // 26\n\ns = ''.join(s)\n\nprint('No such string' if s == t else s)\n", "# http://codeforces.com/problemset/problem/518/A\r\ns = list(input())\r\nt = input()\r\nlen_number = len(s)\r\n\r\nfor index in range(len_number - 1, -1, -1):\r\n if s[index] != 'z':\r\n s[index] = chr(ord(s[index]) + 1)\r\n break\r\n elif s[index] == 'z':\r\n s[index] = 'a'\r\ns = ''.join(s)\r\nif s == t:\r\n print('No such string')\r\nelse:\r\n print(s)\r\n", "s = input()\nt = input() \n\nn = len(s) \nanswer = \"\"\nflag = 0\nfor i in range(n):\n if s[i] == t[i]:\n answer += s[i]\n elif ord(s[i]) + 1 < ord(t[i]):\n answer += chr(ord(s[i]) + 1)\n answer += 'a' * (n-1-i)\n print(answer)\n break \n else:\n flag = 1 \n break\nif flag:\n answer_1 = answer[:] + s[i] + 'z' * (n-1-i)\n verbose = False\n for j in range(n):\n if s[j] != answer_1[j]:\n verbose = True \n if verbose:\n print(answer_1)\n else:\n answer_2 = answer[:] + t[i] + 'a' * (n-1-i)\n for j in range(n):\n if t[j] != answer_2[j]:\n verbose = True \n if verbose:\n print(answer_2) \n if not verbose:\n print(\"No such string\")", "from sys import stdin\ninput = stdin.readline\ndef put():\n return map(int, input().split())\n\ndef fail():\n print(-1)\n exit()\n\ns,t = input().strip(), input().strip()\nk = list(s)\nn = len(s)-1\nwhile n>-1:\n if k[n]=='z':\n k[n]='a'\n n-=1\n else:\n k[n]= chr(ord(k[n])+1)\n break\n\nk = ''.join(k)\nif s<k and k<t:\n print(k)\nelse:\n print('No such string')\n ", "a=list(input())\nb=input()\ni=len(a)-1\nwhile a[i]=='z':\n a[i]='a'\n i-=1\na[i]=chr(ord(a[i])+1)\na=''.join(a)\nif a>=b:\n\tprint('No such string')\nelse:\n\tprint(a)\n \t \t\t\t\t\t\t\t\t \t\t \t \t \t", "import sys\r\n\r\nsys.setrecursionlimit(100000)\r\n\r\n# global constant\r\nINF = int(1e7 + 1)\r\nMAX = 105\r\n\r\n# For testing\r\n#sys.stdin = open(\"INP.txt\", 'r')\r\n# sys.stdout = open(\"OUT.txt\", 'w')\r\n\r\ndef nextStr(s):\r\n a = list(s)\r\n for i in range(len(s)-1, -1, -1):\r\n if a[i]!='z':\r\n a[i] = chr(ord(a[i])+1)\r\n break\r\n else:\r\n a[i] = 'a'\r\n return ''.join(a)\r\n\r\n\r\n\r\ndef main():\r\n s = input()\r\n nextString = nextStr(s)\r\n if nextString==input():\r\n print(\"No such string\")\r\n else:\r\n print(nextString)\r\n\r\n\r\nmain()\r\n", "def value(s):\n res = 0\n for i in range(len(s)):\n res = res * 26 + ord(s[i]) - ord('a') + 1\n return res\n\n\ndef main():\n s, t = input(), input()\n a, b = value(s), value(t)\n if a + 1 == b:\n print('No such string')\n else:\n ans = [(ord(ch) - ord('a') + 1) for ch in s]\n ans[-1] += 1\n for i in range(len(ans) - 1, -1, -1):\n # print(i)\n if ans[i] > 26:\n ans[i - 1] += 1\n ans[i] -= 26\n print(''.join([chr(x + ord('a') - 1) for x in ans]))\n\nif __name__ == \"__main__\":\n main()\n \t \t\t \t \t\t\t \t \t \t \t\t\t\t\t\t", "from sys import stdin,stdout\r\ndef solve():\r\n A = input()\r\n B = input()\r\n LA, LB = len(A), len(B)\r\n j = LA - 1\r\n while j >= 0 and A[j] == 'z':\r\n j -= 1\r\n k = LA - 1\r\n while k >= 0 and B[k] == 'a':\r\n k -= 1\r\n if j < 0 or k < 0:\r\n stdout.write('No such string\\n')\r\n else:\r\n ans = (A[:j] if j > 0 else '') + chr(ord(A[j]) + 1) + ('a'*(LA - 1 - j) if j < LA - 1 else '')\r\n if ans >= B:\r\n stdout.write('No such string\\n')\r\n else:\r\n stdout.write(ans + '\\n')\r\nsolve()\r\n", "def lexNext(s, n):\r\n for i in range(n - 1, -1, -1):\r\n if s[i] != 'z':\r\n k = ord(s[i])\r\n s[i] = chr(k + 1)\r\n return ''.join(s)\r\n s[i] = 'a'\r\n\r\n\r\nif __name__ == \"__main__\":\r\n S = input()\r\n T = input()\r\n n = len(S)\r\n \r\n S = list(S)\r\n res = lexNext(S, n)\r\n if res != T:\r\n print(res)\r\n else:\r\n print(\"No such string\")\r\n", "s = list(input())\r\nt = list(input())\r\n\r\nn = len(s)\r\nfor i in range(n - 1, -1, -1):\r\n\tif s[i] == 'z':\r\n\t\ts[i] = 'a'\r\n\telse:\r\n\t\ts[i] = chr(ord(s[i]) + 1)\r\n\t\tbreak\r\nif s == t:\r\n\tprint('No such string')\r\nelse:\r\n\tprint(''.join(s))", "\r\ndef main():\r\n s = input()\r\n z = input()\r\n \r\n a = list(s)\r\n n = len(s) - 1\r\n \r\n while a[n] == 'z' and n >= 0 :\r\n a[n] = 'a'\r\n n = n - 1 \r\n else: a[n] = chr(ord(a[n]) + 1)\r\n \r\n s = ''.join(a)\r\n\r\n if s < z:\r\n print(s)\r\n else:\r\n print('No such string')\r\n\r\nif __name__ == \"__main__\": main()", "import string\r\narray=[]\r\nfor letter in string.ascii_lowercase:\r\n array.append(letter)\r\ndef nextitem(List):\r\n l=len(List)\r\n for i in range(l-1,-1,-1):\r\n if List[i]!=\"z\":\r\n ans=List[:i]+[array[array.index(List[i])+1]]+[\"a\"]*(l-(i+1))\r\n return ans\r\nstring1=input()\r\narray1=[]\r\nfor item in string1:\r\n array1.append(item)\r\nans=nextitem(array1)\r\nansstr=\"\"\r\nfor item in ans:\r\n ansstr+=str(item)\r\nstring2=input()\r\nprint(\"No such string\"if ansstr==string2 else ansstr)", "# Tìm kí tự đầu tiên khác nhau giữa 2 chuỗi\r\n# từ đó sẽ theo từng trường hợp mà có cách tạo nên chuỗi cần tìm.\r\n\r\ns = input()\r\nt = input()\r\n\r\nn = len(s)\r\nresult = 'No such string'\r\n\r\nfor i in range(n):\r\n\r\n # Kiểm tra khoảng cách giữa 2 kí tự trong mỗi chuỗi \"s\" và \"t\"\r\n diff = ord(t[i]) - ord(s[i])\r\n if diff > 1:\r\n # Nếu hai kí tự không liền kề nhau, thì chỉ việc cộng kí tự đó lên kí tự liền kề.\r\n # Chỉ thay thế 1 kí tự trong chuối s.\r\n result = s[:i] + chr(ord(s[i]) + 1) + s[i+1:]\r\n break\r\n\r\n # Nếu liền kề nhau và không phải là phần tử cuối cùng.\r\n # Vì nếu là phần tử cuối cùng thì sẽ rơi vào \"No such string\"\r\n if diff == 1 and i < n - 1:\r\n # Vì s, t và chuỗi cần tìm là lexicographically nên\r\n # chỉ cần quan tâm kí tự đầu tiên khác nhau tính từ trái qua\r\n # và thay đổi các kí tự bên phải còn lại để tìm được chuỗi cần tìm.\r\n for j in range(i + 1, n):\r\n\r\n # Nếu có kí tự bên phải của chuỗi \"s\" < \"z\" thì chỉ cần\r\n # thay thế các kí tự còn lại1 thành \"z\"\r\n # để đảm bảo chuỗi cần tìm luôn > s và < t\r\n if s[j] < \"z\":\r\n result = s[:i + 1] + \"z\" * (n - i - 1)\r\n break\r\n\r\n # Tương tự như trên cho chuỗi \"t\" để tìm được chuỗi cần tìm.\r\n if t[j] > \"a\":\r\n result = t[:i + 1] + \"a\" * (n - i - 1)\r\n break\r\n\r\nprint(result)\r\nexit(0)\r\n", "s = input()\r\nt = input()\r\n\r\nresult = list(s)\r\n\r\nfor i in reversed(range(len(s))):\r\n if s[i] != 'z':\r\n result[i] = chr(ord(s[i]) + 1)\r\n break\r\n else:\r\n result[i] = 'a'\r\n\r\nresult = ''.join(result)\r\n\r\nprint(result if result != t else 'No such string')\r\n", "a = list(input())\r\nb = list(input())\r\n\r\nfor i in range (len(a) - 1, -1, -1):\r\n if (a[i] == 'z'):\r\n a[i] = 'a'\r\n else:\r\n a[i] = chr(ord(a[i]) + 1)\r\n break\r\n\r\nif (a >= b):\r\n print(\"No such string\")\r\nelse: \r\n print(''.join(a))", "s = input()\r\nt = input()\r\n\r\nres = ''\r\ni = 0\r\nwhile i < len(s):\r\n if chr(ord(s[i])+1) < t[i]:\r\n res = s[:i] + chr(ord(s[i])+1) + s[i+1:]\r\n break\r\n elif s[i] < t[i]:\r\n j = i\r\n while j < len(s)-1:\r\n if s[j+1] != 'z':\r\n res = s[:j+1] + chr(ord(s[j+1])+1) + s[j+2:]\r\n break\r\n j += 1\r\n s = s[:i] + t[i] + s[i+1:]\r\n j = i+1\r\n while j < len(s):\r\n s = s[:j] + 'a' + s[j+1:] \r\n j += 1\r\n\r\n\r\n\r\n \r\n \r\n i += 1\r\n \r\nif not res:\r\n print('No such string')\r\nelse:\r\n print(res)", "# Codeforces: 518A - Vitaly and Strings\r\n\r\ns = input()\r\nt = input()\r\n\r\nn = len(s)\r\nans = ''\r\nfor i in range(n - 1, -1, -1):\r\n if s[i] != 'z':\r\n ans = chr(ord(s[i]) + 1) + ans\r\n ans = s[:i] + ans\r\n break\r\n else:\r\n ans = 'a' + ans\r\nif ans >= t:\r\n ans = 'No such string'\r\n\r\nprint(ans)", "p=list(input())\nr=input()\nfor i in range(len(p)-1,-1,-1):\n\tif p[i]=='z':\n\t\tp[i]='a'\n\telse:\n\t\tp[i]=chr(ord(p[i])+1)\n\t\tbreak\np=''.join(p)\nif p>=r:\n\tprint('No such string')\nelse:\n\tprint(p)\n\n \t\t\t \t \t\t\t \t \t \t \t\t \t\t\t \t\t\t", "'''IDEA:\r\n- Với việc tìm số giữa a và b, chẳng hạn.\r\n- Ta thường bắt đầu với việc bắt đầu từ a và tăng giá trị sau cùng lên 1 đơn vị\r\n- Nếu số mới nhỏ hơn b thì ta đã tìm được 1 số thỏa mãn.\r\n- Nhưng nếu như ta có 19 và 22, thì số mid = 20. Ở đây ta không thể tăng 9 lên 10 được mà phải đổi về 0.\r\n- Cũng tương tự vậy ở chuỗi nếu có 'az' thì kế tiếp phải là 'ba'. \r\n'''\r\n\r\n\r\ndef main():\r\n str1 = input()\r\n str2 = input()\r\n mid = list(str1)\r\n\r\n for i in range(len(str1) - 1, -1, -1):\r\n while mid[i] < 'z':\r\n mid[i] = chr(ord(mid[i]) + 1)\r\n if ''.join(mid) < str2:\r\n print(''.join(mid))\r\n return\r\n if mid[i] == 'z':\r\n mid[i] = 'a'\r\n print(\"No such string\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def find_str(s,t):\n temp = \"\"\n flag = 0\n \n for i in range(len(s)):\n \n if ord(t[i])-ord(s[i])>1:\n temp +=chr(ord(s[i])+1)+t[i+1::]\n break\n elif flag:\n if s[i]=='z':\n temp +=s[i]\n else:\n temp +=chr(ord(s[i])+1)\n \n elif ord(t[i])-ord(s[i])==1:\n temp +=s[i]\n flag = 1\n else:\n temp += s[i]\n if temp<t and temp>s:\n return temp\n temp = \"\"\n flag = 0\n for i in range(len(s)):\n \n if ord(t[i])-ord(s[i])>1:\n temp +=chr(ord(s[i])+1)+t[i+1::]\n break\n elif flag:\n if t[i]=='a':\n temp += t[i]\n else:\n temp +=chr(ord(t[i])-1)\n \n elif ord(t[i])-ord(s[i])==1:\n temp += t[i]\n flag = 1\n else:\n temp += t[i]\n if temp<t and temp>s:\n return temp\n else:\n return \"No such string\"\n \ns = input()\nt = input()\nprint(find_str(s,t))\n \n\t\t\t \t \t \t\t \t \t\t\t\t\t \t", "S = input()\r\nT = input()\r\n\r\ntmp_lst = list(S)\r\n\r\nfor i in range(len(S) - 1, -1, -1):\r\n if S[i] == 'z':\r\n tmp_lst[i] = 'a'\r\n else:\r\n tmp_lst[i] = chr(ord(S[i]) + 1)\r\n break\r\n\r\nR = \"\".join(tmp_lst)\r\n\r\nif R < T:\r\n print(R)\r\nelse:\r\n print(\"No such string\")\r\n", "str_s = input()\r\nstr_t = input()\r\n\r\nif str_s == str_t:\r\n print(\"No such string\")\r\n exit()\r\n\r\n# Prepare Alphabet array\r\nalphabet = []\r\nalphabet.append(chr(97))\r\n\r\nfor i in range(1, 26):\r\n alphabet.append(chr(ord(alphabet[i-1])+1))\r\n\r\nnew_str = list(str_s)\r\nlen_str = len(str_s)\r\ntmp_len_str = len_str\r\n\r\n# print(new_str[0:tmp_len_str-1])\r\n# print(new_str[tmp_len_str-1:len_str])\r\n\r\n\r\nwhile tmp_len_str > 0:\r\n tmp_len_str -= 1\r\n tmp = alphabet.index(str_s[tmp_len_str])+1\r\n if tmp > 25:\r\n tmp = 0\r\n new_str[tmp_len_str] = alphabet[tmp]\r\n if tmp != 0:\r\n break\r\n\r\nres = \"\".join(new_str)\r\nif res != str_t:\r\n print(res)\r\nelse:\r\n print(\"No such string\")", "s1 = input()\r\ns2 = input()\r\nans=''\r\nans1=''\r\nst='abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(len(s1)):\r\n a=s1[i]\r\n b=s2[i]\r\n if ord(b)-ord(a)>1:\r\n ans+=st[st.index(a)+1]\r\n ans+='z'*(len(s1)-len(ans))\r\n ans1+=st[st.index(a)+1]\r\n ans1+='z'*(len(s1)-len(ans1)) \r\n break\r\n elif ord(b)-ord(a)==1:\r\n ans+=st[st.index(a)]\r\n ans1+=st[st.index(b)]\r\n ans+='z'*(len(s1)-len(ans))\r\n ans1+='a'*(len(s1)-len(ans1))\r\n break \r\n elif ord(b)-ord(a)==0:\r\n ans+=a\r\n ans1+=a\r\nif s1<ans<s2:\r\n print(ans)\r\nelif s1<ans1<s2:\r\n print(ans1)\r\nelse:\r\n print(\"No such string\") \r\n", "# chuyển các ký tự của chuỗi S vào list\r\ns=list(input())\r\nt=input()\r\n\r\n# lấy index của các ký tự trong chuỗi S\r\ni=len(s)-1\r\nwhile s[i]=='z':\r\n # xét ký tự từ cuối chuỗi đến đầu chuỗi, nếu kí tự cuối của chuỗi S là 'z' thì chuyển thành 'a'\r\n s[i]='a'\r\n i-=1\r\n # nếu xét đến ký tự ko phải là 'z' thì nhảy khỏi vòng while\r\n\r\n# nếu gặp kí tự khác 'z' thì chuyển ký tự đó sang ký tự tiếp theo theo thứ tự trong bảng chữ cái alphabet\r\ns[i]=chr(ord(s[i])+1)\r\n# chuyển list S thành chuỗi\r\ns=''.join(s)\r\n# kiểm tra xem nếu chuỗi S < T thì in chuỗi S ra ngược lại thì print ra \"No such string\"\r\nif s>=t:\r\n print(\"No such string\")\r\nelse:\r\n print(s)", "s, t = input(), input()\r\na = list(map(ord, s))\r\nfor i in range(len(a) - 1, -1, -1):\r\n\tif a[i] == ord('z'):\r\n\t\ta[i] = ord('a')\r\n\t\tif i == 0:\r\n\t\t\tprint('No such string')\r\n\t\t\texit()\r\n\telse:\r\n\t\ta[i] += 1\r\n\t\tbreak\r\na = ''.join(map(chr, a))\r\nif a < t:\r\n\tprint(a)\r\nelse:\r\n\tprint('No such string')", "# your code goes here\na=list(input())\nb=input()\nfor i in range(len(a)-1,-1,-1):\n\tif a[i]=='z':\n\t\ta[i]='a'\n\telse:\n\t\ta[i]=chr(ord(a[i])+1)\n\t\tbreak\na=''.join(a)\nif a>=b:\n\tprint('No such string')\nelse:\n\tprint(a)\n\n \t\t \t\t\t \t \t \t\t \t\t \t", "from collections import Counter\nfrom math import inf\n\n\ndef main():\n a = list(ord(c) - 97 for c in input().strip())\n b = list(ord(c) - 97 for c in input().strip())\n c = 1\n for i in range(len(a) - 1, -1, -1):\n aa = a[i] + c\n a[i] = aa % 26\n c = aa // 26\n if c:\n print('No such string')\n else:\n if a >= b:\n print('No such string')\n else:\n print(''.join(chr(c + 97) for c in a))\n\n\ndef init():\n import os\n import sys\n\n sys.setrecursionlimit(2 * 10 ** 8)\n if 'CP_LOCAL_ENV' in os.environ:\n sys.stdin = open('cf_test_a.txt')\n\n\nif __name__ == '__main__':\n init()\n main()\n", "s=list(input())\r\nn,d=len(s),\"\"\r\nt=input()\r\nfor i in range(n-1,-1,-1):\r\n if s[i]==\"z\":\r\n s[i]=\"a\"\r\n else:\r\n s[i]=chr(ord(s[i])+1)\r\n break\r\nfor i in s: d+=i\r\nif d>=t: print(\"No such string\")\r\nelse: print(d)", "r=input()\nh=input()\nr=list(r)\nh=list(h)\nfor i in range(len(r)-1,-1,-1):\n\tif r[i]!='z':\n\t\tr[i]=chr(ord(r[i])+1)\n\t\tbreak\n\telse:\n\t\tr[i]='a'\nif r!=h:\n\tprint(*r,sep=\"\")\nelse:\n\tprint(\"No such string\")\n \t \t \t\t\t\t\t\t \t\t \t \t\t \t \t", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\ns = input()\r\nt = input()\r\nstri = \"\"\r\nf = 0\r\nfor i in range(len(s)-1,-1,-1):\r\n if f == 0:\r\n if s[i] == 'z':\r\n stri += 'a'\r\n else:\r\n stri += chr(ord(s[i]) + 1)\r\n f=1\r\n else:\r\n stri +=s[i]\r\nstri = stri[::-1] \r\n#print(stri)\r\nif s < stri < t:\r\n print(stri)\r\nelse:\r\n print(\"No such string\")\r\n \r\n ", "s=input()\r\nt=input()\r\nflag=True\r\nans=list(s)\r\ni=len(s)-1\r\nwhile True:\r\n if ord(s[i])!=ord('z'):\r\n ans[i]=chr(ord(ans[i])+1)\r\n break\r\n else:\r\n ans[i]='a'\r\n i-=1\r\nt=list(t)\r\nif ans!=t:\r\n for i in range (len(ans)):\r\n print(ans[i], end=\"\")\r\nelse:\r\n print('No such string')", "s = input()\r\nt = input()\r\n\r\nlength = len(s)\r\nresult = s\r\n\r\n\r\ndef changeChar(str, index, newChar):\r\n return str[:index] + newChar + str[index + 1:]\r\n\r\n\r\ndef increaseChar(char):\r\n if(char == 'z'):\r\n return 'a'\r\n\r\n return chr(ord(char) + 1)\r\n\r\n\r\ncheckIndex = length - 1\r\n\r\nwhile(checkIndex >= 0):\r\n newChar = increaseChar(s[checkIndex])\r\n result = changeChar(result, checkIndex, newChar)\r\n if(newChar != 'a'):\r\n if(result < t):\r\n print(result)\r\n else:\r\n print(\"No such string\")\r\n exit()\r\n\r\n checkIndex = checkIndex - 1\r\n\r\nif(result[0] != 'a'):\r\n print(result)\r\nelse:\r\n print(\"No such string\")\r\n", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\ns = input()\r\ns2 = input()\r\nalth = \"abcdefghijklmnopqrstuvwxyz\"\r\nn = len(s)\r\ns3 = [0] * n\r\nfor i in range(n-1,-1,-1):\r\n if s[i] == \"z\":\r\n s3[i] = \"a\"\r\n else:\r\n s3[i] = alth[alth.find(s[i]) + 1]\r\n for i in range(i):\r\n s3[i] = s[i]\r\n break\r\ns3 = \"\".join(s3)\r\nif s3 == s2:\r\n print(\"No such string\")\r\nelse:\r\n print(s3)\r\n", "s=input()\nt=input()\na=[]\nb=[]\nfor i in s:\n a.append(i)\nfor i in t:\n b.append(i)\nif len(s)==s.count('z'):\n ans='a'*(len(s)+1)\n if ans!=t:\n print(ans)\n else:\n print(\"No such string\")\nelse:\n pos=-1\n for i in range(len(s)-1,-1,-1):\n if a[i]!='z':\n pos=i\n break\n val=ord(a[pos])+1\n a[pos]=chr(val)\n for i in range(pos+1,len(s)):\n a[i]='a'\n if a!=b:\n print(*a,sep=\"\")\n elif a==b:\n print(\"No such string\")\n\t \t \t\t\t \t\t \t \t\t\t\t\t \t\t\t \t", "s = list(input())\r\nt = input()\r\nn = len(s)-1\r\nwhile (s[n] == 'z'):\r\n s[n]='a'\r\n n -= 1\r\ns[n] = chr(ord(s[n])+1)\r\nr =''.join(s)\r\nif(r >= t):\r\n print('No such string')\r\nelse:\r\n print(r)", "# http://bigocoder.com/courses/OBLUE01/OBLUE01_LEC01/BLUE_L01P04/statement\r\ns1 = input()\r\ns2 = input()\r\n\r\nans = ''\r\nmark = 0\r\n\r\nfor i in range(len(s1)):\r\n if s1[i]==s2[i]:\r\n ans += s1[i]\r\n else:\r\n ans += s1[i]\r\n mark = i\r\n break\r\n\r\nif mark==len(s1)-1:\r\n ans = ans[:len(s1)-1] + chr(ord(ans[len(s1)-1])+1)\r\n if ans==s1 or ans==s2:\r\n print('No such string')\r\n else:\r\n print(ans)\r\nelse:\r\n if s1[mark+1]!='z':\r\n ans = ans[:mark] + s1[mark]\r\n ans += 'z' * (len(s1)-mark-1)\r\n if ans==s1 or ans==s2:\r\n print('No such string')\r\n else:\r\n print(ans)\r\n else:\r\n ans = ans[:mark] + chr(ord(s1[mark])+1)\r\n ans += 'a' * (len(s1)-mark-1)\r\n if ans==s1 or ans==s2:\r\n print('No such string')\r\n else:\r\n print(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input()[:-1])\r\nt = input()[:-1]\r\nn = len(s)\r\nfor i in range(n):\r\n if s[i] == t[i]:\r\n continue\r\n q = n\r\n while q:\r\n q -= 1\r\n if s[q] == 'z':\r\n s[q] = 'a'\r\n else:\r\n s[q] = chr(ord(s[q])+1)\r\n break\r\n if ''.join(s) == t:\r\n print('No such string')\r\n else:\r\n print(''.join(s))\r\n break\r\nelse:\r\n print('No such string')", "def nextC(ch):\n\tif ch=='z':\n\t\treturn 'a'\n\treturn chr(ord(ch)+1)\n\ndef nextS(st):\n\ttab = [i for i in st]\n\ti = len(tab)-1\n\twhile tab[i] == 'z':\n\t\ttab[i] = nextC(tab[i])\n\t\ti -= 1\n\ttab[i] = nextC(tab[i])\n\treturn ''.join(tab)\n\ns = input()\nt = input()\nst = nextS(s)\nif s == st or t == st or s == t:\n\tprint(\"No such string\")\nelse:\n\tprint(st)\n \t \t \t \t \t\t\t \t \t\t \t \t\t \t", "surya,teja = list(input()),input()\nn=len(surya)-1\nwhile(surya[n]=='z'):\n\tsurya[n]='a'\n\tn=n-1\nsurya[n]=chr(ord(surya[n])+1)\nsurya=''.join(surya)\nif(surya>=teja): print('No such string')\nelse: print(surya)\n\t \t \t\t \t\t\t \t \t \t\t \t\t \t\t \t", "s = input()\r\nt = input()\r\ng = list(s)\r\nindex = len(g) - 1\r\nwhile index >= 0:\r\n if g[index] == 'z':\r\n g[index] = 'a'\r\n index -=1\r\n else:\r\n g[index] = chr(ord(g[index])+1)\r\n break\r\ng = \"\".join(g)\r\nif g == t:\r\n print ('No such string')\r\nelse:\r\n print (g)", "s = input()\r\nt = input()\r\nsl = list(s)\r\n\r\ni = len(s)-1\r\nwhile sl[i]=='z':\r\n sl[i] = 'a'\r\n i-=1\r\nsl[i] = chr(ord(sl[i])+1)\r\nif \"\".join(sl)==t:\r\n print(\"No such string\")\r\nelse:\r\n print(\"\".join(sl))\r\n", "# Cộng thêm 1 vào chuổi s nếu kí tự cuối lớn hơn \"z\"\n#thì nhớ 1 giống như cộng trong hệ 10\n#\n#\n#\n#\n#\n#\ns = input()\nt = input()\nk = 1\nstri = \"\"\nfor i in s[::-1]:\n\tm= ord(i) + k\n\tif m> 122:\n\t\tk = 1\n\t\tstri += \"a\"\n\telse:\n\t\tk= 0\n\t\tstri += chr(m)\n\nif stri[::-1] == t:\n\tprint(\"No such string\")\nelse:\n\tprint(stri[::-1])\n\t", "def increase_one_string(string_param):\r\n result = ''\r\n count = 0\r\n j = len(string_param) - 2\r\n list_string = [x for x in string_param]\r\n \r\n list_string[-1] = chr(ord(list_string[-1]) + 1)\r\n \r\n if(list_string[-1] == '{'):\r\n list_string[-1] = 'a'\r\n count = 1\r\n while count > 0:\r\n count = count - 1\r\n list_string[j] = chr(ord(list_string[j]) + 1)\r\n if(list_string[j] == '{'):\r\n list_string[j] = 'a'\r\n count = count + 1\r\n j = j - 1\r\n \r\n return ''.join(list_string)\r\n \r\n \r\n \r\n#print(increase_one_string('z')) #aca\r\n\r\n#input \r\ns = input()\r\nt = input()\r\nresult = increase_one_string(s)\r\nif(result == t):\r\n print('No such string')\r\nelse:\r\n print(result)", "s = input();\r\nt = input();\r\nl = len(s);\r\nresult = [letter for letter in s];\r\nnoString = False\r\n\r\nfor i in range(l-1,-1,-1):\r\n if result[i]==\"z\":\r\n result[i]=\"a\";\r\n else:\r\n result[i]=chr(ord(result[i])+1);\r\n break;\r\n \r\n if i==0: noString = True;\r\n\r\nstr = \"\".join(result);\r\nif noString or str == t:\r\n print(\"No such string\");\r\nelse: print(str);", "#Vitaly and strings: http://codeforces.com/problemset/problem/518/A\nimport copy\n\n\nif __name__ == '__main__':\n input1 = list(input())\n input2 = list(input())\n flag = False \n for i in range(len(input1)-1,-1,-1):\n if input1[i] == 'z':\n input1[i] = 'a'\n else:\n input1[i] = chr(ord(input1[i]) + 1)\n break \n \n for j in range(len(input1)):\n if input1[j] < input2[j]:\n flag = True \n break \n\n if flag:\n print(''.join(input1))\n else:\n print('No such string')\n \n \n " ]

[ "def main():\n input()\n digits = list(map(int, input()))\n l = [digits]\n for a in range(1, 10):\n l.append([(a + b) % 10 for b in digits])\n for digits in l[:]:\n a = digits[-1]\n for i, b in enumerate(digits):\n if a and not b:\n l.append(digits[i:] + digits[:i])\n a = b\n print(''.join(map(str, min(l))))\n\n\nif __name__ == '__main__':\n main()", "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 key = f.readline().strip()\r\n return n, key\r\n\r\n\r\ndef sol(n, key):\r\n ph = key\r\n t = []\r\n for i in range(10):\r\n dh = ph\r\n ph = \"\"\r\n l = []\r\n for i in range(0, n):\r\n b = int(dh[i])\r\n if ((b + 1) > 9):\r\n c = b + 1 - 10\r\n else:\r\n c = b + 1\r\n ph += str(c)\r\n l.append(dh[i + 1:] + dh[:i + 1])\r\n t.append(min(min(l), ph))\r\n return [f\"{min(t)}\"]\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", "def main():\r\n n = int(input())\r\n s = list(input())\r\n t = list(s)\r\n if s[0] != '0':\r\n k = ord('0') + 10 - ord(s[0])\r\n for i in range(n):\r\n t[i] = chr(ord('0') + (ord(s[i]) - ord('0') + k) % 10)\r\n curr = ''.join(t)\r\n for i in range(1, n):\r\n if s[i] == '0':\r\n t = s[i:] + s[:i]\r\n curr = min(curr, ''.join(t))\r\n else:\r\n k = ord('0') + 10 - ord(s[i])\r\n t = s[i:] + s[:i]\r\n for j in range(n):\r\n t[j] = chr(ord('0') + (ord(t[j]) - ord('0') + k) % 10)\r\n curr = min(curr, ''.join(t))\r\n print(curr)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nl=[int(x) for x in input()]\r\nl=l+l\r\ng=list(l)\r\nans='9'*10000\r\nwhile True:\r\n\tfor x in range(0, len(l)-n):\r\n\t\tans=min(ans, ''.join(str(i) for i in l[x:x+n]))\r\n\tl=[(x+1)%10 for x in l]\r\n\tif l==g:\r\n\t\tbreak\r\nprint(ans)\r\n", "n = int(input()) # ���������� ����\r\nt = int(input())\r\nmin = t\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(t%10)\r\n t //= 10\r\n\r\n# ������ ����� ��������� ��� ��������� �������� � ����� ����������� �����\r\nfor i in range(n):\r\n k = (10-a[n-1]) % 10\r\n l = 1\r\n new = 0\r\n \r\n for j in range(n):\r\n new += ((a[j] + k) % 10) * l\r\n l *= 10\r\n # �������� ����� ����� � ���������� �����\r\n \r\n if new < min:\r\n min = new\r\n \r\n a.append(a[0])\r\n a.pop(0)\r\n \r\nprint('0'*(n-len(str(min))) + str(min))", "numDigits = int(input().strip())\r\nnumber = (input().strip())\r\n\r\nminVal = -1\r\nfinalString = \"\"\r\n\r\ndef shiftDigits(numDigits, number):\r\n\tnewStr = number[1:] + number[0]\r\n\treturn (newStr)\r\n\r\ndef addDigit(digit, adder):\r\n\treturn (digit + adder)%10 \r\n\r\ndef addDigits(numDigits, number):\r\n\tnewStr = \"\"\r\n\tfirst = int(number[0])\r\n\tdiff = 10 - first\r\n\tfor x in number:\r\n\t\tnewStr += str(addDigit(int(x), diff))\r\n\treturn newStr\r\n\r\ntestStr = number\r\nfor a in range(numDigits):\r\n\t# print(\"--------\")\r\n\ttestStr = shiftDigits(numDigits, testStr)\t\r\n\ttestStr = addDigits(numDigits, testStr)\r\n\ttestNum = int(testStr)\r\n\tif (testNum < minVal or minVal == -1):\r\n\t\tminVal = int(testNum)\r\n\t\t# print(\"After if: \", testStr)\r\n\t\tfinalString = testStr\r\n\r\nprint(finalString)\r\n\r\n\r\n\r\n", "def modify(string, index):\r\n \r\n if string[index] == '0':\r\n key = 0\r\n else:\r\n key = 10 - int(string[index])\r\n bad = ''\r\n for i in string:\r\n bad += str((int(i) + key) % 10)\r\n return bad[index:] + bad[:index]\r\n\r\n\r\nx = int(input())\r\ny = input()\r\nminx = 'zzzzzzzzz'\r\nfor i in range(x):\r\n minx = min(minx, modify(y, i))\r\nprint(minx)", "n = int(input())\r\ndata = input()\r\n\r\nlist = [data]\r\n\r\nfor i in range(9):\r\n newdata = \"\"\r\n for x in data:\r\n x = int(x)+1\r\n if x == 10:\r\n x = 0\r\n newdata+=str(x)\r\n data = newdata\r\n list.append(data)\r\nk = 0\r\nfor x in list:\r\n for i in range(n-1):\r\n x = x[-1]+x[:-1]\r\n list.append(x)\r\n k+=1\r\n if(k==n*10-10):\r\n break\r\n\r\nlist = [int(x) for x in list]\r\nanswer = min(list)\r\nif(len(str(answer))<n):\r\n answer = \"0\"*(n-len(str(answer)))+str(answer)\r\nprint(answer)", "n=int(input())\r\nx=input()\r\nl=list(map(int,x))\r\n\r\nfor i in range(n):\r\n l[i] = x[i:] + x[:i]\r\nfor i in range(n):\r\n u = ''\r\n d = (10 - int(l[i][0]))\r\n for j in range(n):\r\n u += str((int(l[i][j]) + d) % 10)\r\n l[i] = u\r\nprint(min(l))\r\n", "n=int(input())\r\nch=input()\r\n\"\"\"Ph=str(0)\r\na=int(ch[0])\r\nif(a!=0):\r\n a=10-a\r\nfor i in range(1,n):\r\n b=int(ch[i]) \r\n if((b+a) >9) :\r\n c=b+a-10\r\n else:\r\n c=b+a\r\n Ph+=str(c) \r\ndh=ch[1:]+ch[:1]\r\nif(int(dh)<int(Ph)):\r\n print(dh)\r\nelse:\r\n print(Ph)\r\n\"\"\" \r\nph=ch\r\nt=[]\r\nfor i in range (10):\r\n dh=ph\r\n ph=\"\"\r\n l=[]\r\n for i in range (0,n):\r\n b=int(dh[i])\r\n if((b+1) >9) :\r\n c=b+1-10\r\n else:\r\n c=b+1\r\n ph+=str(c) \r\n l.append(dh[i+1:]+dh[:i+1])\r\n t.append(min(min(l),ph)) \r\nprint(min(t)) \r\n", "n=int(input())\r\ns=input()\r\nli=[int(i) for i in s]\r\nmi=[9 for i in range(n)]\r\nfor i in range(n):\r\n a=[0]\r\n for j in range(i+1,n):\r\n if li[j]-li[i]<0:\r\n a.append(li[j]-li[i]+10)\r\n else:\r\n a.append(li[j]-li[i])\r\n for j in range(0,i):\r\n if li[j]-li[i]<0:\r\n a.append(li[j]-li[i]+10)\r\n else:\r\n a.append(li[j]-li[i])\r\n fl=0\r\n for j in range(n):\r\n if mi[j]<a[j]:\r\n fl=0\r\n break\r\n elif mi[j]>a[j]:\r\n fl=1\r\n break\r\n if fl==1:\r\n mi = [j for j in a]\r\nmi=[str(i) for i in mi]\r\nprint(\"\".join(mi))\r\n", "def need_change(minimum, number, n):\n for i in range(n):\n if int(minimum[i]) > int(number[i]):\n return True\n if int(minimum[i]) < int(number[i]):\n return False\n return False\n\ndef ad(number, dnum):\n result = ''\n for item in number:\n result += str((int(item) + dnum)%10)\n return result\n\nn = int(input())\nnumber = input()\n\nresult = number\n\nfor i in range(10):\n new = ad(number, i)\n for j in range(n):\n newnew = new[j:] + new[:j]\n if(need_change(result, newnew, n)):\n result = newnew\n\nprint(result)\n\n \t \t\t\t \t \t \t \t\t \t\t\t \t", "def norm(s):\r\n return [(x + 10 - s[0]) % 10 for x in s]\r\n\r\nn, = map(int, input().split())\r\ns = input().strip()\r\ns = [int(x) for x in s]\r\nprint(\"\".join(map(str, min([norm(s[j:] + s[:j]) for j in range(n)]))))\r\n", "def Firstbutton(inp):\r\n ch=''\r\n for i in range(len(inp)):\r\n if inp[i]=='9':\r\n ch=ch+'0'\r\n else:\r\n ch=ch+str(int(inp[i])+1)\r\n return(ch)\r\n\r\ndef Secondbutton(inp):\r\n return ((inp[len(inp)-1]+inp)[:-1])\r\n\r\nn=int(input())\r\ninitial=input()\r\nk=initial\r\nl=list()\r\nfor i in range(10):\r\n l.append(k)\r\n k=Firstbutton(k)\r\nmin1=str(min(l))\r\nl2=list()\r\nk=initial\r\nfor i in l:\r\n k=i\r\n for j in range(n):\r\n if k<min1:\r\n min1=k\r\n k=Secondbutton(k)\r\nprint(min1)\r\n \r\n\r\n ", "n = int(input())\r\nd = input()\r\nc = d\r\ns = '1'\r\nm = 10**1005\r\nfor k in range(0,11):\r\n for i in range(0,n):\r\n c = c[:i]+str((int(c[i])+1)%10)+c[i+1:]\r\n for i in range(0,n):\r\n c = c[1:]+c[0]\r\n b = int(c)\r\n if b < m:\r\n m = b\r\n s = c\r\nprint(s)\r\n", "def process(s, n):\n return ''.join(str((int(s[i]) + n) % 10) for i in range(len(s)))\nn = int(input())\ns, st = 2 * input(), set()\nfor i in range(n):\n st.add(process(s[i: i + n], 10 - int(s[i])))\nprint(min(st))\n", "def maxScore(ctr,n):\r\n s = str(ctr).zfill(n)\r\n assert len(s) == n\r\n best = int(s)\r\n for posOffset in range(n):\r\n for valueOffset in range(10):\r\n gen = ''\r\n for i in range(n):\r\n gen += str((int(s[(i+posOffset)%n])+valueOffset)%10)\r\n best = min(best, int(gen))\r\n return str(best).zfill(n)\r\n \r\nn=int(input())\r\ns=int(input())\r\nprint(maxScore(s,n))\r\n", "n = int(input())\r\nl = list(map(int, [x for x in input()]))\r\nm = [9] * (n + 1)\r\nfor i in range(len(l)):\r\n x = list(l[i + 1:]) + list(l[:i + 1])\r\n s = x[0]\r\n for j in range(len(x)):\r\n x[j] = (x[j] - s) % 10\r\n if x < m:\r\n m = x\r\nprint(\"\".join(list(map(str, m))))\r\n", "\r\ndef STR(): return list(input())\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef MAP2():return map(float,input().split())\r\ndef LIST(): return list(map(int, input().split()))\r\ndef STRING(): return input()\r\nimport string\r\nimport sys\r\nfrom heapq import heappop , heappush\r\nfrom bisect import *\r\nfrom collections import deque , Counter , defaultdict\r\nfrom math import *\r\nfrom itertools import permutations , accumulate\r\ndx = [-1 , 1 , 0 , 0 ]\r\ndy = [0 , 0 , 1 , - 1]\r\n#visited = [[False for i in range(m)] for j in range(n)]\r\n#sys.stdin = open(r'input.txt' , 'r')\r\n#sys.stdout = open(r'output.txt' , 'w')\r\n#for tt in range(INT()):\r\n\r\n#CODE\r\n\r\nn = INT()\r\ns = STR()\r\nx = []\r\nfor i in range(n):\r\n y1 = []\r\n for j in range(i , n):\r\n y1.append(s[j])\r\n for j in range(i):\r\n y1.append(s[j])\r\n\r\n x.append(y1)\r\n\r\n#print(x)\r\nans = []\r\nfor i in range(n):\r\n k = 10 - int(x[i][0])\r\n for j in range(n):\r\n x[i][j] = str((k + int(x[i][j])) % 10)\r\n\r\n z = ''.join(x[i])\r\n ans.append(z)\r\n\r\nprint(min(ans))\r\n\r\n\r\n\r\n", "n = int(input())\ns = [int(i) for i in input()]\nk = [1 for i in range(n)]\nfor i in range(n):\n if [(u+(10-s[i-1])%10)%10 for u in s[i-1:]]+[(u+(10-s[i-1])%10)%10 for u in s[:i-1]] < k:\n k = [(u+(10-s[i-1])%10)%10 for u in s[i-1:]]+[(u+(10-s[i-1])%10)%10 for u in s[:i-1]]\nans = ''\nfor i in k:\n ans+=str(i)\nprint(ans)\n", "n = int(input())\r\ns = input()\r\nans = '9' * n\r\n\r\nfor _ in range(10):\r\n for i in range(n):\r\n ans = min(ans, s[i:] + s[:i])\r\n t = ''\r\n for ch in s:\r\n t += str((int(ch) + 1) % 10)\r\n s = t\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\nans = '9'*n\r\na = str()\r\n\r\nfor i in range(1, 10):\r\n for j in s:\r\n if int(j) >= i:\r\n a += str(int(j)-i)\r\n else:\r\n a += str(10-(i-int(j)))\r\n\r\n for k in range(n):\r\n if a[k] == '0':\r\n ans = min(ans, a[k:]+a[:k])\r\n a = str()\r\n\r\nfor k in range(n):\r\n if s[k] == '0':\r\n ans = min(ans, s[k:]+s[:k])\r\nprint(ans)\r\n", "n = int(input())\r\na = [x for x in input()]\r\nans = ''.join(a)\r\nfor i in range(10):\r\n a = [chr(ord('0') + (ord(x)-ord('0')+1)%10) for x in a]\r\n for j in range(n):\r\n ans = min(ans,''.join(a[j:] + a[:j]))\r\nprint(ans)\r\n\r\n", "R = lambda: map(int, input().split())\r\nn = int(input())\r\nnums = [int(c) for c in input()]\r\nres = [9] * 1006\r\nfor i in range(n):\r\n wnms = nums[i:] + nums[:i]\r\n res = min([res] + [[(wnms[k] + j) % 10 for k in range(n)] for j in range(10)])\r\nprint(''.join(map(str, res)))", "n = int(input())\r\ns = [int(d) for d in input()]\r\nans = []\r\nfor k in range(n):\r\n\tcycle = s[k:]+s[:k]\r\n\tshift = (-cycle[0])%10\r\n\tfor i in range(n):\r\n\t\tcycle[i] = str((cycle[i]+shift)%10)\r\n\tans.append(int(''.join(cycle)))\r\nprint(str(min(ans)).zfill(n))\r\n", "n, s = int(input()), [int(x) for x in input()]\r\nprint(\"\".join(map(str, min([[(x + 10 - s[j]) % 10 for x in (s[j:] + s[:j])] for j in range(n)]))))", "def main():\r\n n = int(input())\r\n digits = list(map(int,input()))\r\n min_val = float('inf')\r\n\r\n for i in range(n):\r\n req = 10-digits[i]\r\n digits_copy = digits[:]\r\n for j in range(n):\r\n digits_copy[j] += req\r\n if digits_copy[j] >= 10:\r\n digits_copy[j] -= 10\r\n num = ''\r\n for j in range(i,n):\r\n num += str(digits_copy[j])\r\n\r\n for j in range(i):\r\n num += str(digits_copy[j])\r\n\r\n min_val = min(min_val,int(num))\r\n\r\n min_val = str(min_val)\r\n if len(min_val) < n:\r\n min_val = '0'*(n-len(min_val))+min_val\r\n\r\n print(min_val)\r\n\r\nmain()\r\n", "n = int(input())\r\nz=input()\r\na = list(map(int, z))\r\n\r\nfor x in [a[i:] + a[:i] for i in range(n)]:\r\n s=\"\"\r\n for y in x:\r\n s+=str((y+10-x[0])%10)\r\n if s<z:z=s\r\nprint(z)\r\n", "n = int(input())\r\ncurr = [int(x) for x in input()]\r\nfinals = []\r\nfor start in range(-n, 0):\r\n l = []\r\n x = curr[start]\r\n for i in range(start, start + n):\r\n l.append(str((curr[i] - x) % 10))\r\n finals.append(int(\"\".join(l)))\r\nprint(str(min(finals)).zfill(len(curr)))", "n = int(input())\r\nc = input()\r\n\r\nadd = c\r\ncode = []\r\n\r\nfor k in range(11) : \r\n shift = add\r\n add = \"\"\r\n for i in range(n) :\r\n chiff = int(shift[i])\r\n if (chiff+1)>9 :\r\n chiff = chiff + 1 - 10\r\n else :\r\n chiff += 1\r\n add += str(chiff) \r\n code.append(shift[i+1:]+shift[:i+1])\r\n code.append(add)\r\n \r\nprint(min(code))", "from itertools import chain\n\n\ndef main():\n n = int(input())\n aa = list(map(int, input()))\n res = []\n for j in range(len(aa)):\n y, base = 0, aa[j]\n for x in chain(aa[j:], aa[:j]):\n y = y * 10 + (x - base) % 10\n res.append(y)\n f = str(len(aa)).join(('{:0>', 'd}'))\n print(f.format(min(res)))\n\n\nif __name__ == '__main__':\n main()", "#!/usr/bin/env python3\n\n# --------------------\n# SecretCombination.py\n# --------------------\n\nfrom sys import stdin\n\ndef decr (n) :\n return map(lambda v : (v - n[0] + 10) % 10, n)\n\ndef rotate (n) :\n return [n[-1]] + n[:-1]\n\nfor a in stdin :\n a = input()\n n = [int(v) for v in a]\n #print(\"n =\", n)\n m = len(n) * [9]\n #print(\"v =\", v)\n for i in range(len(n)) :\n n = rotate(n)\n #print(\"n =\", n)\n d = list(decr(n))\n if d < m :\n m = d\n #print(\"m =\", m)\n for v in m :\n print(v, end = \"\")\n print()\n", "num= int(input())\ndigits= [i for i in input()]\nans= (\"\".join(digits))\n#print(ans)\na= [0,1,2,3,4,5,6,7,8,9]\nfor i in range(0, -10, -1):\n #print(i)\n temp= [str(a[int(k)+i]) for k in digits]\n for j in range(num):\n temp1= temp[j:]+ temp[:j]\n #print(temp1)\n ans= min(ans, (\"\".join(temp1)))\n \nprint(ans)", "n = int(input())\r\ns = [int(x) for x in input()]\r\nmin = [9] * n\r\nminK = -1\r\n\r\nfor i in range(n):\r\n cur = [(x + 10 - s[i]) % 10 for x in (s[i:] + s[:i])]\r\n if cur < min:\r\n min = cur\r\n minK = i\r\n\r\ncur = [(x + 10 - s[minK]) % 10 for x in (s[minK:] + s[:minK])]\r\nprint(\"\".join(map(str, cur)))\r\n", "# B\r\n\r\nn = int(input())\r\nl = list(input())\r\nfor i in range(n):\r\n l[i] = int(l[i])\r\nans = 10**(n-1)\r\nfor i in range(n):\r\n l = l[1:]+l[:1]\r\n m = []\r\n for j in range(n):\r\n m.append(l[j])\r\n for j in range(1,n):\r\n m[j] -= m[0]\r\n if m[j] < 0:\r\n m[j] += 10\r\n m[0] = 0\r\n cur = ''\r\n for j in range(n):\r\n cur += str(m[j])\r\n ans = min(ans, int(cur))\r\nans = str(ans)\r\nwhile len(ans) < n:\r\n ans = '0'+ans\r\nprint(ans)\r\n", "def plus1(x):\r\n l=list(x)\r\n for i in range (len(x)):\r\n if l[i]== '9':\r\n l[i]= '0'\r\n else:\r\n l[i]=str((int(l[i])+1))\r\n return ''.join(map(str, l))\r\n\r\ndef shift(x):\r\n l=list(x)\r\n s=''.join(map(str, l[len(x)-1]))\r\n f=''.join(map(str, l[0:len(x)-1]))\r\n return s+f\r\n\r\n\r\nn=int(input())\r\nx=input()\r\nmin=int(x)\r\nt=x\r\nv=x\r\nfor i in range (10):\r\n t=plus1(t)\r\n t2=t\r\n for j in range(n):\r\n if int(t2)<min :\r\n min=int(t2)\r\n v=t2\r\n t2=shift(t2)\r\nprint(v)\r\n\r\n", "def shift(inp):\r\n return inp[n-1]+inp[:n-1]\r\ndef add_1(inp):\r\n for i in range(len(inp)):\r\n inp=inp[:i]+str((int(inp[i])+1)%10)+inp[i+1:]\r\n return inp\r\nn=int(input())\r\ninp=input()\r\nmin_val=inp\r\nfor k in range(10):\r\n for l in range(n):\r\n inp=shift(inp)\r\n if inp <min_val:\r\n min_val=inp\r\n inp=add_1(inp)\r\nprint(min_val)", "n=int(input())\r\nl=input()\r\nres=l\r\nfor i in range(10):\r\n for i in range(n):\r\n if l[i]=='9':\r\n l=l[:i]+'0'+l[i+1:]\r\n else:\r\n l=l[:i]+str(int(l[i])+1)+l[i+1:]\r\n x=[l[j:]+l[:j] for j in range(n)]\r\n for k in x:\r\n if k<=res:\r\n res=k\r\nprint(res)", "import io, os\r\nfrom functools import cmp_to_key\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ntokens = []\r\ntokens_next = 0\r\n\r\n\r\ndef next_str():\r\n global tokens, tokens_next\r\n while tokens_next >= len(tokens):\r\n tokens = input().split()\r\n tokens_next = 0\r\n tokens_next += 1\r\n return tokens[tokens_next - 1]\r\n\r\n\r\ndef nextInt():\r\n return int(next_str())\r\n\r\n\r\n# the second operation is basically making the number circular\r\n# so we need to find the digit to make it num[0]\r\n# we can try every increment or decrement to search over the first operation\r\n# we need to go max 10 steps in every direction\r\n\r\nn = nextInt()\r\ns = next_str()\r\n\r\ns = list(map(int, list(s)))\r\nres = s\r\n\r\n# we will never need to go farther than 10 in both directions cz we always mod 10\r\nfor i in range(-10, 10):\r\n s_new = map(lambda x: (x + i + 10) % 10, s)\r\n s_new = list(s_new)\r\n\r\n best = sorted(list(range(n)), key=lambda x: s_new[x:] + s_new[0:x])[0]\r\n\r\n if s_new[best:] + s_new[0:best] < res:\r\n res = s_new[best:] + s_new[0:best]\r\n\r\nprint(''.join(map(str, res)))\r\n", "n = int(input())\nd = input()\ns = []\nfor i in d:\n s.append(int(i))\npos = 0\nans = 10 ** 1000\nfor i in range(1, len(s)):\n if s[i] == s[i - 1]:\n continue\n else:\n x = s[pos]\n t = [s[j] for j in range(len(s))]\n for j in range(len(t)):\n t[j] = (t[j] + 10 - x) % 10\n A = [0] * n\n for j in range(len(t)):\n A[j] = t[(j + pos) % n]\n a = int(''.join(list(map(str, A))))\n if a < ans:\n ans = a\n pos = i\nx = s[pos]\nfor i in range(len(s)):\n s[i] = (s[i] + 10 - x) % 10\nA = [0] * n\nfor i in range(len(s)):\n A[i] = s[(i + pos) % n]\na = int(''.join(list(map(str, A))))\nif a < ans:\n ans = a\nprint('0' * (n - len(str(ans))) + str(ans))\n", "def input_split(f): return map(f, input().split())\n\n\ndef main():\n n = int(input())\n num = input()\n res = num\n tmp = num\n for i in range(10):\n tmp = \"\".join(map(str, [(int(x)+i) % 10 for x in num]))\n for j in range(n):\n res = min(res, tmp[j:]+tmp[:j])\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\ninitial = input()\r\nminimun = initial\r\nfor i in range(n):\r\n initial = initial[n - 1] + initial[:n - 1]\r\n final = \"\"\r\n for j in range(n):\r\n final += str((int(initial[j]) - int(initial[0]) + 10) % 10)\r\n if int(final) < int(minimun):\r\n minimun = final\r\nprint(minimun)", "n = int(input())\na = input()\nans = a\nnums = ['0' ,'1', '2', '3', '4', '5', '6', '7', '8', '9']\nfor i in range(n):\n a = a[1:] + a[0]\n temp = \"\"\n for j in range(n):\n temp += nums[int(a[j]) - int(a[0])]\n if int(temp) < int(ans):\n ans = temp\n \nprint(ans)\n \t\t \t\t \t\t \t \t\t\t \t \t\t\t\t\t\t\t\t", "import collections\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------Input-----------------------------------------#\n######################################################################################\n\n\ndef value(): return tuple(map(int, input().split()))\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\ndef inlst(): return [int(i) for i in input().split()]\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\ndef inp(): return int(input())\ndef inps(): return int(sys.stdin.readline())\ndef instr(): return input()\ndef stlst(): return [i for i in input().split()]\n\n\n######################################################################################\n#--------------------------------------code here-------------------------------------#\n######################################################################################\n\ndef solve():\n n = inp()\n nums=list(input())\n mn=float('inf')\n # ind=num.index(mn)\n for j in range(n):\n num=nums.copy()\n num=num[j:]+num[:j]\n for i in range(n):\n num[i]=str((int(num[i])-int(nums[j])+10)%10)\n mn=min(mn,int(\"\".join(num)))\n print(str(mn).zfill(n))\n\n\n\n\nif __name__ == \"__main__\":\n solve()\n", "n = int(input())\r\ns = input()\r\na = []\r\nfor i in s:\r\n a.append(int(i))\r\n\r\nx = 100\r\nfor i in range(n-1):\r\n l = a[i]\r\n r = a[i+1]\r\n if l == r:\r\n x = 0\r\n break\r\n elif l < r:\r\n x = min(x, r-l)\r\n elif l > r:\r\n q = 10 - l\r\n w = r + q\r\n x = min(x, w)\r\n\r\nbank = []\r\nfor k in range(n):\r\n temp = []\r\n ad = 10-a[k]\r\n for i in range(k, n):\r\n temp.append((a[i]+ad)%10)\r\n for i in range(0, k):\r\n temp.append((a[i]+ad)%10)\r\n bank.append(temp)\r\n\r\nbank.sort()\r\nprint(*bank[0], sep='')", "def F1 (ch):\r\n k=''\r\n for i in range (len(ch)):\r\n if ch[i]==\"9\":\r\n k=k+\"0\"\r\n else:\r\n k=k+str(int(ch[i])+1)\r\n return (k)\r\n\r\n\r\ndef F2 (ch):\r\n return(ch[len(ch)-1]+ch)[:-1]\r\n\r\nn=int(input())\r\nch=input()\r\nmin1=ch\r\nb=ch\r\nfor i in range(10):\r\n b=F1(b)\r\n if min1>b:\r\n min1=b\r\n for j in range(n-1):\r\n b=F2(b)\r\n if min1>b:\r\n min1=b\r\nprint(min1)\r\n\r\n\r\n\r\n\r\n \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 = [int(c) for c in input()]\r\nans = [10]\r\nfor i in range(n):\r\n s = s[1:] + [s[0]]\r\n pwd = [0]\r\n for j in range(1, n):\r\n d = (pwd[-1] + s[j] - s[j-1]) % 10\r\n pwd.append(d)\r\n if ans > pwd:\r\n ans = pwd\r\nfor d in ans:\r\n print(d, end = '')\r\n", "def solve():\r\n n = int(input())\r\n comb = input().strip()\r\n smallest = comb\r\n for i in range(10):\r\n for j in range(n):\r\n comb = comb[-1:] + comb[:-1]\r\n smallest = min(smallest, comb)\r\n if i == 9:\r\n break\r\n comb = ''.join(str((int(x)+1)%10) for x in comb)\r\n print(str(smallest).zfill(n))\r\nsolve()", "class CodeforcesTask496BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.digits = []\n\n def read_input(self):\n self.n = int(input())\n self.digits = [int(x) for x in input()]\n\n def process_task(self):\n nums = []\n for x in range(10):\n nums.append([(y + x) % 10 for y in self.digits])\n numbers = []\n for x in range(self.n):\n for y in range(10):\n numbers.append(int(\"\".join([str(z) for z in nums[y][x:] + nums[y][:x]])))\n self.result = \"0\" * (self.n - len(str(min(numbers)))) + str(min(numbers))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask496BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\nnum = input()\r\n\r\nans = str(num)\r\nfor i in range(n):\r\n d = int(num[i])\r\n new_num = ''\r\n for j in range(n):\r\n dig = (int(num[(i + j) % n]) - d) % 10\r\n new_num += str(dig)\r\n ans = min(ans, new_num)\r\n\r\nprint(ans)\r\n", "def f_bt(pa):\r\n ch = ''\r\n for i in pa:\r\n ch += str((int(i) + 1) % 10)\r\n return ch\r\n\r\n\r\ndef s_bt(pa):\r\n return (pa[-1] + pa)[:-1]\r\n\r\n\r\ninput()\r\nx = input()\r\nk = x\r\nl = []\r\nfor i in range(10):\r\n l.append(k)\r\n k = f_bt(k)\r\nmi = min(l)\r\nl1 = []\r\nfor i in l:\r\n k = i\r\n for j in range(len(x)):\r\n if k < mi:\r\n mi = k\r\n k = s_bt(k)\r\nprint(mi)", "def addOne(s):\n\ts = list(s)\n\tn = len(s)\n\tfor i in range(n):\n\t\tif(s[i] == '9'):\n\t\t\ts[i] = '0'\n\t\telse:\n\t\t\ts[i] = int(s[i])\n\t\t\ts[i] += 1\n\t\t\ts[i] = str(s[i])\n\treturn ''.join(s)\n\nn = int(input())\ns = input()\na = []\nb = []\nc = []\nx = s\n\ns = addOne(s)\n#a.append(x)\na.append(s)\n\nwhile(x != s):\n\ts = addOne(s)\n\ta.append(s)\n\n#print(a)\n\nfor i in a:\n\tif '0' in i:\n\t\tb.append(i)\n\n#print(b)\n\nfor y in b:\n\tm = len(y)\n\tfor j in range(0,m):\n\t\tif(y[j] == '0'):\n\t\t\tq = y[j:m] + y[0:j]\n\t\t\tc.append(q)\nc += b\nprint(min(c))", "n = int(input())\r\na = list(input())\r\nans = a\r\nfor i in range(10):\r\n for j in range(n):\r\n if a < ans:\r\n ans = a\r\n a = a[1:]+[a[0]]\r\n for j in range(n):\r\n a[j] = str((int(a[j])+1)%10)\r\nprint(\"\".join(ans))\r\n", "def add(c,m):\r\n h=''\r\n for i in range(m):\r\n if c[i]=='9':\r\n h=h+'0'\r\n else:\r\n h=h+str(int(c[i])+1)\r\n \r\n return(h)\r\n###################################\r\ndef chift(p,n):\r\n c=p[-1]+p[:n-1]\r\n return c\r\n##############\r\nn=int(input())\r\nb=str(input())\r\nm=[]\r\nm.append(b)\r\nfor i in range(10):\r\n x=b\r\n b=add(x,n)\r\n y=add(x,n)\r\n m.append(y)\r\n for j in range(n-1):\r\n b=chift(b,n)\r\n m.append(b)\r\n\r\nprint(min(m))#O(n)\r\n\r\n\r\n\r\n \r\n", "from itertools import chain\n\nC = 0\n\n\ndef main():\n input()\n s = input()\n n = len(s)\n a = s[-1]\n for stop, b in enumerate(s):\n if b != a:\n break\n else:\n print('0' * n)\n return\n s = ''.join((s[stop:], s[:stop]))\n a, l = s[0], []\n start = ma = tail = 0\n for stop, b in enumerate(s):\n if b != a:\n le = stop - start\n if ma < le:\n ma, tail = le, (ord(b) - ord(a)) % 10\n l.clear()\n l.append(start)\n elif ma == le:\n tl = (ord(b) - ord(a)) % 10\n if tail > tl:\n tail = tl\n l.clear()\n l.append(start)\n elif tail == tl:\n l.append(start)\n a, start = b, stop\n le = n - start\n if ma < le:\n l.clear()\n l.append(start)\n elif ma == le:\n l.append(start)\n for i, start in enumerate(l):\n base = int(s[start])\n l[i] = ''.join(chr((int(c) - base) % 10 + 48) for c in chain(s[start:], s[:start]))\n print(min(l))\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\r\na = input()\r\nb = [int(c) for c in a]\r\nans = 0\r\nfor i in range(1, n):\r\n for k in range(1, n):\r\n if((b[(i+k) %n] - b[i]+10)%10 < (b[(ans+k)%n] - b[ans]+10)%10):\r\n ans = i\r\n break\r\n elif((b[(i+k) %n] - b[i]+10)%10 > (b[(ans+k)%n] - b[ans]+10)%10):\r\n break\r\n#print(ans)\r\nfor i in range(0, n):\r\n print(\"%d\" %((b[(ans+i)%n] - b[ans])%10),end=\"\")\r\n", "__author__ = 'Rakshak.R.Hegde'\r\n\"\"\"\r\nCreated on Dec 17 2014 PM 10:13\r\n\r\n@author: Rakshak.R.Hegde\r\n\"\"\"\r\nn = int(input())\r\ndigits = list(map(int, input()))\r\nenum = [[0] * n for i in range(10)]\r\nenum[0] = digits\r\nfor i in range(1, 10):\r\n for j in range(n):\r\n enum[i][j] = (enum[i - 1][j] + 1) % 10\r\ncomp = []\r\nfor i in range(10):\r\n if enum[i][0] == 0: comp.append(enum[i])\r\n for j in range(1, n):\r\n if enum[i][j] == 0 and enum[i][j - 1] != 0:\r\n comp.append(enum[i][j:] + enum[i][:j])\r\nprint(''.join(map(str, min(comp))))", "def main():\n n = int(input())\n digits = list(map(int, input()))\n enum = [digits]\n for a in range(1, 10):\n enum.append([(a + b) % 10 for b in digits])\n for digits in enum[:10]:\n for j in range(n):\n if digits[j - 1] and not digits[j]:\n enum.append(digits[j:] + digits[:j])\n print(''.join(map(str, min(enum))))\n\n\nif __name__ == '__main__':\n main()", "n = int(input())\r\ns = input()\r\na = [0]*n\r\n\r\nfor i in range(n):\r\n a[i] = s[i:] + s[:i]\r\n\r\nfor i in range(n):\r\n u = \"\"\r\n d = (10-int(a[i][0]))\r\n for j in range(n):\r\n u += str((int(a[i][j])+d)%10)\r\n a[i] = u\r\n \r\nprint(min(a))", "n = int(input())\r\na = [int(c) for c in input()]\r\nprint(''.join(str(x) for x in min([(x + i) % 10 for x in a[j:] + a[:j]] for j in range(n) for i in range(10))))", "n = int(input())\r\ns = input()\r\n\r\nans = [0] * n\r\nfor i in range(n):\r\n ans[i] = s[i:] + s[:i]\r\n\r\nfor i in range(n):\r\n v = ''\r\n d = 10 - int(ans[i][0])\r\n for j in range(n):\r\n x = (d + (int(ans[i][j]))) % 10\r\n v += str(x)\r\n ans[i] = v\r\n\r\nprint(min(ans))\r\n\r\n\r\n", "n = int(input())\r\na = input().rstrip()\r\ns = list(map(int, [i for i in a]))\r\nprint(\"\".join(map(str,min([(j+10-s[i])% 10 for j in (s[i:] + s[:i])] for i in range(n)))))", "n = int(input())\r\nc = list(map(int, input()))\r\nval = list(c)\r\nfor i in range(n):\r\n d = (10 - c[0]) % 10\r\n for j in range(n):\r\n c[j] = (c[j] + d) % 10\r\n if c < val:\r\n val = list(c)\r\n c.append(c[0])\r\n del(c[0])\r\nprint(''.join(map(str, val)))", "#!/usr/bin/env python3\n\n# -----------------------------------------------------------\n# problems/codeforces/secret-combination/SecretCombination.py\n# Copyright (C) 2015\n# Glenn P. Downing\n# -----------------------------------------------------------\n\n\"\"\"\nB. Secret Combination\nhttp://codeforces.com/problemset/problem/496/B/\n\nWed, 12 Feb 2015\n??? ms\n\"\"\"\n\nfrom sys import stdin\n\ndef decr (n) :\n \"\"\"\n n a list of digits\n subtract the first digit from all of the digits mod 10\n return a list of digits\n \"\"\"\n return [(d + 10 - n[0]) % 10 for d in n]\n\ndef rotate (n) :\n \"\"\"\n n a list of digits\n rotate the digits to the left\n return a list of digits\n \"\"\"\n return n[1:] + [n[0]]\n\nfor s in stdin :\n s = input()\n n = [int(c) for c in s]\n m = [9] * len(n)\n for i in range(len(n)) :\n n = rotate(n)\n d = decr(n)\n m = min(m, d)\n for d in m :\n print(d, end = \"\")\n print()\n", "from itertools import chain\n\nC = 0\n\n\ndef main():\n input()\n ls = list(map(int, input()))\n n = len(ls)\n a = ls[-1]\n for stop, b in enumerate(ls):\n if b != a:\n break\n else:\n print('0' * n)\n return\n ls = ls[stop:] + ls[:stop]\n a, l = ls[0], []\n start = ma = tail = 0\n for stop, b in enumerate(ls):\n if b != a:\n le = stop - start\n if ma < le:\n ma, tail = le, (b - a) % 10\n l.clear()\n l.append(start)\n elif ma == le:\n tl = (b - a) % 10\n if tail > tl:\n tail = tl\n l.clear()\n l.append(start)\n elif tail == tl:\n l.append(start)\n a, start = b, stop\n le = n - start\n if ma < le:\n l.clear()\n l.append(start)\n elif ma == le:\n tl = (ls[0] - a) % 10\n if tail > tl:\n l.clear()\n l.append(start)\n elif tail == tl:\n l.append(start)\n for i, start in enumerate(l):\n base = ls[start]\n l[i] = ''.join(chr((a - base) % 10 + 48) for a in chain(ls[start:], ls[:start]))\n print(min(l))\n\n\nif __name__ == '__main__':\n main()", "def less(a, b):\r\n for i in range(len(a)):\r\n elem1 = a[i]\r\n elem2 = b[i]\r\n if elem1 < elem2:\r\n return True\r\n elif elem1 > elem2:\r\n return False\r\n return False\r\n\r\n\r\nn = int(input())\r\ns = input()\r\nmin = [9] * n\r\nminK = -1\r\n\r\nfor i in range(n):\r\n k = 10 - int(s[i])\r\n cur = [0]\r\n for j in range(i + 1, n):\r\n cur.append((int(s[j]) + k) % 10)\r\n for j in range(i):\r\n cur.append((int(s[j]) + k) % 10)\r\n if less(cur, min):\r\n min = cur\r\n minK = i\r\n\r\ncur = [0]\r\nk = 10 - int(s[minK])\r\nfor j in range(minK + 1, n):\r\n cur.append((int(s[j]) + k) % 10)\r\nfor j in range(minK):\r\n cur.append((int(s[j]) + k) % 10)\r\nprint(\"\".join(map(str, cur)))\r\n", "n = int(input())\r\ns = input()\r\ns = [int(x) for x in s]\r\nprint(\"\".join(map(str, min([[(x + 10 - s[j]) % 10 for x in (s[j:] + s[:j])] for j in range(n)]))))", "n = int(input())\nl = list(map(int, list(input())))\n\ndef minit(l):\n dec = l[0]\n for i in range(len(l)):\n l[i] = (l[i] - dec + 10) % 10\n return l\n\nans = [float('+inf')]\n\nfor i in range(n):\n mm = minit(l[:])\n ans = min(mm, ans)\n l = l[1:] + [l[0]]\n\nprint(''.join(map(str, ans)))\n", "n=int(input())\r\ns=list(input())\r\nch=s[0]\r\nidx=0\r\nfor i in range(1,n):\r\n if s[i]<=ch:idx=i\r\n ch=min(ch,s[i])\r\nans=list()\r\nfor i in range(n):\r\n tmp=list()\r\n for j in range(i,n):tmp.append(s[j])\r\n for k in range(i):tmp.append(s[k])\r\n ans.append(tmp)\r\n#print(ans)\r\nfor tmp in ans:\r\n add=0\r\n while tmp[0]!='0':\r\n if tmp[0]=='9':tmp[0]='0'; add+=1; break\r\n tmp[0]=chr(ord(tmp[0])+1)\r\n add+=1\r\n for i in range(1,n):\r\n tot=0\r\n while tot<add:\r\n if tmp[i]=='9':tmp[i]='0'\r\n else:tmp[i]=chr(ord(tmp[i])+1)\r\n tot+=1\r\n#print(ans)\r\nans=sorted(ans)\r\n#print(ans)\r\nprint(*ans[0],sep='')", "n = int(input())\na = list(input())\nans = a\nfor i in range(0,10):\n for j in range(0,n):\n if a < ans:\n ans = a\n a = a[1:] + [a[0]]\n for j in range(0,n):\n a[j] = str((int(a[j])+1)%10)\nprint(\"\".join(ans))\n", "n=int(input())\r\narr=list(map(int,input()))\r\ndef cmp(arr1,arr2):\r\n i=0\r\n for i in range(len(arr1)):\r\n if arr1[i]<arr2[i]:\r\n return True\r\n elif arr1[i]>arr2[i]:\r\n return False\r\n return False\r\nminn=arr\r\nfor i in range(n):\r\n \r\n if arr[i]==0:\r\n tmp=arr[i:]+arr[:i]\r\n \r\n if cmp(tmp,minn):\r\n minn=tmp\r\n else:\r\n val=10-arr[i]\r\n \r\n tmp=[]\r\n for j in range(len(arr)):\r\n tmp.append((arr[j]+val)%10)\r\n\r\n tmp=tmp[i:]+tmp[:i]\r\n\r\n if cmp(tmp,minn):\r\n minn=tmp\r\nfor val in minn:\r\n print(val,end=\"\")\r\n", "from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\n\r\nn, = gil()\r\ns = g()\r\nans = s\r\n\r\ndef solve(s):\r\n\tans = s\r\n\tt = []\r\n\tfor i in range(10):\r\n\t\tfor c in s :\r\n\t\t\tv = int(c)+i\r\n\t\t\tif v > 9 : v -= 10\r\n\t\t\tt.append(str(v))\r\n\t\t# print(t)\r\n\t\tans = min(ans, ''.join(t))\r\n\t\tt.clear()\r\n\treturn ans\r\n\r\n\r\nfor i in range(n):\r\n\tans = min(ans, solve(s[i:] + s[:i]))\r\n\r\nprint(ans)\r\n", "n = int(input())\nnum = input()\nnum = [list(num) for _ in range(10)]\nfor i in range(10):\n for j in range(n):\n num[i][j] = (int(num[i][j]) + i) % 10\n\ncol = []\nfor i in range(10):\n for j in range(n):\n col.append(num[i][j:]+num[i][:j])\n\nans = ''.join(list(map(str, min(col))))\nprint(ans)\n\n", "n = int(input())\r\na = list(map(int, input()))\r\nans = a[:]\r\nfor i in range(n):\r\n b = [0] * n\r\n for j in range(n):\r\n b[j] = (a[(i + j) % n] - a[i]) % 10\r\n ans = min(ans, b)\r\nprint(''.join(map(str, ans)))\r\n", "# cook your dish here\r\n\r\nlength = int(input()) \r\nnumber = input() \r\n \r\ndef addn(n,a):\r\n num = str(n)\r\n s = \"\" \r\n for i in num:\r\n ad = int(i) + a \r\n if(ad>9):\r\n ad = ad - 10\r\n s = s + str(ad)\r\n return s\r\n \r\nans = int(number) \r\n\r\nfor j in range(length):\r\n add = 10 - int(number[j]) \r\n temp = number[j:] + number[:j] \r\n if(add == 0):\r\n lock = int( temp )\r\n else:\r\n lock = int(addn(temp,add)) \r\n if(lock < ans):\r\n ans = lock\r\n\r\n \r\nan = str(ans)\r\nfor each in range(len(an) , length):\r\n an = \"0\" + an \r\nprint(an)\r\n \r\n \r\n \r\n ", "def permute(digit,n):\r\n p=[0]*n\r\n for i in range(n):\r\n p[i] = digit[i:] + digit[:i]\r\n return p\r\n\r\nn=int(input())\r\ndigit=input()\r\np=permute(digit,n)\r\n\r\nfor i in range(n):\r\n ch=''\r\n aux=(10-int(p[i][0]))\r\n for j in range(n):\r\n ch=ch+str((int(p[i][j])+aux)%10)\r\n p[i]=ch\r\nprint(min(p))", "N = int(input())\r\nD = input()\r\nmin = D\r\n\r\nfor _ in range(10):\r\n new_D = ''\r\n for i in D:\r\n if i == '9':\r\n new_D += '0'\r\n else:\r\n new_D += chr(ord(i) + 1)\r\n \r\n for i in range(N):\r\n new_D = new_D[-1] + new_D[:-1]\r\n if int(new_D) < int(min):\r\n min = new_D\r\n \r\n D = new_D\r\n\r\nprint(min)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import deque\r\n\r\nN = int(input())\r\nS = deque([int(c) for c in input()])\r\n\r\nans = '9'*N\r\nfor _ in range(N):\r\n tmp = []\r\n t = (10-S[0])%10\r\n for a in S:\r\n tmp.append(str((a+t)%10))\r\n #print(''.join(tmp))\r\n ans = min(ans, ''.join(tmp))\r\n S.appendleft(S.pop())\r\nprint(ans)\r\n ", "n = int(input())\r\ns = input()\r\ni = 0\r\nmin_ = int(s)\r\ns1 = s\r\ni = 0\r\nwhile (i <= n):\r\n s = s[1::] + s[0]\r\n if (int(s[0]) != 0):\r\n g = (9 - int(s[0])) + 1\r\n s2 = ''\r\n for j in range(len(s)):\r\n h = int(s[j]) + g\r\n if (h >= 10):\r\n h = abs(10 - h)\r\n s2 = s2 + str(h)\r\n s = s2\r\n if (int(s) < min_):\r\n min_ = int(s)\r\n s1 = s\r\n i = i + 1\r\nprint(s1)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input()) \r\na = list(input()[:-1])\r\nm = [_ for _ in a] \r\nfor i in range(n):\r\n d = a[i : ] + a[ : i] \r\n c = [str((10 - int(a[i]) + int(j)) % 10) for j in d] \r\n m = min(m, c)\r\nprint(''.join(m))", "from collections import deque\n\nn = int(input())\nmini = input()\ndigits = deque(list(mini))\nmini = int(mini)\n\nfor i in range(0,n):\n\tdigits[i] = int(digits[i])\n\nfor i in range(0,n):\n\tk = 10 - digits[0]\n\tdigits[0] = 0\n\tfor j in range(1,n):\n\t\tdigits[j] = (digits[j] + k) % 10\n\tvalue = int(\"\".join(map(str, digits)))\n\tif (value < mini):\n\t\tmini = value\n\tdigits.rotate(1)\nprint(str(mini).zfill(n))", "import io, os\r\nfrom functools import cmp_to_key\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ntokens = []\r\ntokens_next = 0\r\n\r\n\r\ndef next_str():\r\n global tokens, tokens_next\r\n while tokens_next >= len(tokens):\r\n tokens = input().split()\r\n tokens_next = 0\r\n tokens_next += 1\r\n return tokens[tokens_next - 1]\r\n\r\n\r\ndef nextInt():\r\n return int(next_str())\r\n\r\n\r\n# the second operation is basically making the number circular\r\n# so we need to find the digit to make it num[0]\r\n# we can try every increment or decrement to search over the first operation\r\n# we need to go max 10 steps in every direction\r\n\r\nn = nextInt()\r\ns = next_str()\r\ns = map(int, list(s))\r\ns = list(s)\r\n\r\ns_new = None\r\n\r\n\r\ndef f(ind):\r\n return (ind + n) % n\r\n\r\n\r\ndef my_compare(a, b):\r\n for i in range(n):\r\n cur = s_new[f(a + i)] - s_new[f(b + i)]\r\n if cur != 0:\r\n return cur\r\n return 0\r\n\r\n\r\nres = s\r\n# we will never need to go farther than 10 in both directions cz we always mod 10\r\nfor i in range(-10, 10):\r\n s_new = map(lambda x: (x + i + 10) % 10, s)\r\n s_new = list(s_new)\r\n\r\n indices = list(range(n))\r\n best = sorted(indices, key=cmp_to_key(my_compare))[0]\r\n\r\n if s_new[best:] + s_new[0:best] < res:\r\n res = s_new[best:] + s_new[0:best]\r\n\r\nprint(''.join(map(str, res)))\r\n", "n=int(input())\r\na=[int(i) for i in list(input())]\r\nm=a\r\nfor i in range(1,n+1):\r\n t=a[i:]+a[:i]\r\n x=t[0]\r\n for k in range(n):\r\n t[k]=(t[k]-x)%10\r\n m=min(m,t)\r\nprint(''.join(str(i) for i in m))", "def parser():\n while 1:\n data = list(input().split(' '))\n for number in data:\n if len(number) > 0:\n yield(number)\n\ninput_parser = parser()\n\ndef get_word():\n global input_parser\n return next(input_parser)\n\ndef get_number():\n data = get_word()\n try:\n return int(data)\n except ValueError:\n return float(data)\n\n\nn = get_number()\nc = get_word()\nb = list(c)\na = [int(i) for i in b]\n\n# print(a)\n\nmin_val = int(c)\n\nnew_a = a.copy()\nfor i in range(n):\n\n tmp = new_a.copy()\n while(tmp[0] != 0):\n tmp = [int((i+1) % 10) for i in tmp]\n # print(tmp)\n # print()\n val = int(\"\".join([str(i) for i in tmp]))\n if (val < min_val):\n min_val = val\n\n last = new_a[-1]\n new_a[1:] = new_a[:-1]\n new_a[0] = last\n\n\nmin_val = list(str(min_val))\n# print(n-len(min_val))\nx = b\nx[:n-len(min_val)] = \"0\" * (n-len(min_val))\nx[n-len(min_val):] = min_val[:]\nprint(''.join(x))", "from collections import *\r\n\r\n\r\ndef flip(x, mi):\r\n return str((x + mi) % 10)\r\n\r\n\r\ndef solve():\r\n ans = ''.join(s)\r\n for i in range(n):\r\n mi = (10 - int(s[1])) % 10\r\n for j in range(n):\r\n s[j] = flip(int(s[j]), mi)\r\n # print(''.join(s))\r\n s.rotate(-1)\r\n ans = min(ans, ''.join(s))\r\n return ans\r\n\r\n\r\nn, s = int(input()), deque(input())\r\nif n == 1:\r\n print(0)\r\nelse:\r\n print(solve())\r\n", "n = int(input())\r\nx = input()\r\na = [x]\r\ntemp = x\r\nfor j in range (0, 9):\r\n for i in range (0, n):\r\n if(temp[i] == '9'):\r\n f = list(temp)\r\n f[i] = '0'\r\n temp = \"\".join(f)\r\n else:\r\n s = list(temp)\r\n s[i] = str(int(s[i]) + 1)\r\n temp = \"\".join(s)\r\n a.append(temp) \r\n##################\r\nans = []\r\nfor i in range(0, 10):\r\n for j in range (0, n):\r\n temp = a[i][n - 1]\r\n a[i] = a[i][:n - 1]\r\n a[i] = temp + a[i]\r\n ans.append(a[i])\r\nprint(min(ans))\r\n \r\n", "n = int(input())\r\ninitial = input()\r\nminString = initial\r\nfor i in range(n):\r\n initial = initial[n - 1] + initial[:n - 1]\r\n converted = ''\r\n for j in range(n):\r\n converted += str((int(initial[j]) - int(initial[0]) + 10) % 10)\r\n if int(converted) < int(minString):\r\n minString = converted\r\nprint(minString)\r\n", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import Counter, defaultdict\r\nfrom sys import stdin, stdout\r\nimport io\r\nimport math\r\nimport heapq\r\nimport bisect\r\nimport collections\r\nimport copy\r\nimport collections,sys,threading\r\ndef ceil(a, b):\r\n return (a + b - 1) // b\r\ninf = float('inf')\r\ndef get():\r\n return stdin.readline().rstrip()\r\nmod = 10 ** 9 + 7\r\nimport collections,sys,threading\r\nsys.setrecursionlimit(1500)\r\n# for _ in range(int(get())):\r\n# n=int(get())\r\n# l=list(map(int,get().split()))\r\n# = map(int,get().split())\r\n##################################################\r\nn=int(get())\r\nl1=[]\r\nl=list(get())\r\nfor k in range(n):\r\n for i in range(10):\r\n x=l\r\n l2=[]\r\n for j in range(n):\r\n l2.append(str((int(l[j])+i)%10))\r\n l1.append(l2)\r\n l=l[-1:]+l[:-1]\r\nprint(\"\".join(min(l1)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\na = [0] * n\r\nfor i in range(n):\r\n a[i] = s[i:] + s[:i]\r\nfor i in range(n):\r\n u = ''\r\n d = (10 - int(a[i][0]))\r\n for j in range(n):\r\n u += str((int(a[i][j]) + d) % 10)\r\n a[i] = u\r\nprint(min(a))" ]

[ "import sys\r\n\r\n\r\ndef solve(n):\r\n if n == 3:\r\n return [(1, 2, 3)]*2\r\n if n == 4:\r\n return [(1, 2, 3, 4), (1, 2, 4, 3), (1, 4, 2, 3)]\r\n else:\r\n return [*solve(n-2), (n, n - 1, 1), (n, n - 1, n - 2), *[(n, i, n - 1, i + 1) for i in range(1, n - 2)]]\r\n\r\n\r\nanswer = solve(int(sys.stdin.readline()))\r\nsys.stdout.write(str(len(answer)) + \"\\n\")\r\nfor ans in answer:\r\n sys.stdout.write(\"{} {}\\n\".format(len(ans), \" \".join(map(str, ans))))\r\n" ]

[ "s=input()\r\nss=\"\"\r\nfor i in range(len(s)):\r\n if i==0 and s[i]=='9':\r\n ss+=s[i]\r\n continue\r\n if int(s[i])>9-int(s[i]):\r\n ss+=str(9-int(s[i]))\r\n else:\r\n ss+=s[i]\r\nprint(ss)\r\n ", "a = int(input())\nt = 0\nb = a\nc = 1\nr = 0\n\nwhile a > 0:\n t = a % 10\n if t > 4 and t != 9:\n r = b % c\n b //= c\n b -= t\n t = 9 - t\n b += t\n b *= c\n b += r\n elif t == 9 and b // c >= 10:\n r = b % c\n b //= c\n b -= t\n t = 9 - t\n b += t\n b *= c\n b += r\n a //= 10\n c *= 10\n\nprint(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\t\t", "string = input() \r\nnewString = ''.split()\r\n\r\n#checks if each inversed digit would reduce the number\r\nfor digit in string:\r\n newString += str(min((9 - int(digit), int(digit))))\r\n if int(newString[0]) < 1: #prevents trailing zeros\r\n newString[0] = '9'\r\n\r\n#prints the new number as a full string\r\nfor digit in newString:\r\n print(digit, end = '')", "n = list(map(int, list(input())))\r\nfor i in range(len(n)):\r\n n[i] = min(n[i], 9 - n[i])\r\nif n[0] == 0:\r\n n[0] = 9\r\nprint(\"\".join(map(str, n)))\r\n", "n = input()\r\nans = \"\"\r\n\r\nfor index, i in enumerate(n):\r\n if index == 0 and i == \"9\":\r\n ans += \"9\"\r\n continue\r\n if index == len(n) and i == \"9\":\r\n ans += \"9\"\r\n continue\r\n if int(i) > 4:\r\n ans += str(9 - int(i))\r\n else:\r\n ans += i\r\n\r\nprint(ans)", "d=input()\r\ns=\"\"\r\nfor i in range(len(d)):\r\n if i==0 and d[i]==\"9\":\r\n s+=d[i]\r\n elif int(d[i])>4:\r\n s+=str(9-int(d[i]))\r\n else:\r\n s+=d[i]\r\nprint(s)\r\n", "x = input()\r\nl = []\r\nfor i in str(x):\r\n l.append(int(i))\r\n\r\n\r\nfor i in range(len(l)):\r\n \r\n a=9-l[i]\r\n if(a<l[i]):\r\n l[i]=a\r\nif(l[0]==0):\r\n l[0]=9\r\n\r\n\r\nfor i in range(len(l)):\r\n print(l[i],end=\"\")", "a=list(map(int, list(input())))\r\nfor i in range(len(a)):\r\n if a[i]>4:\r\n a[i]=9-a[i]\r\nif a[0]==0:\r\n a[0]=9\r\nprint(''.join(map(str, a)))", "inp = str(input())\r\nfor i in range(0,len(inp)):\r\n if int(inp[i]) > 4:\r\n if i == 0 and int(inp[i]) == 9:\r\n pass\r\n else:\r\n inp = inp[:i] + str(9 - int(inp[i])) + inp[i+1:]\r\nprint(inp)", "s=input()\r\nk=''\r\nfor i in range(len(s)):\r\n x=int(s[i])\r\n if x<9-x:\r\n k+=str(x)\r\n else:\r\n if i==0 and x==9:\r\n k+=str(x)\r\n else:\r\n k+=str(9-x)\r\nprint(k)\r\n ", "\r\nnum = [int(n) for n in list(input())]\r\nif(num[0]>4 and num[0]!=9):\r\n temp = 9-num[0]\r\n num[0]= temp\r\nnum[0]= str(num[0])\r\nfor i in range(1,len(num)):\r\n temp = 9-num[i]\r\n if(num[i]>temp):\r\n num[i]= temp\r\n num[i]= str(num[i])\r\nprint(''.join(num))\r\n", "s=input()\r\na=[]\r\nif s[0]=='9':\r\n a.append(9)\r\n for i in range(1,len(s),1):\r\n if int(s[i]) < 9 - int(s[i]):\r\n a.append(int(s[i]))\r\n else:\r\n a.append(9 - int(s[i]))\r\n print(*a, sep='')\r\nelse :\r\n for i in range(len(s)):\r\n if int(s[i])<9-int(s[i]):\r\n a.append(int(s[i]))\r\n else :\r\n a.append(9-int(s[i]))\r\n print(*a, sep='')", "n = int(input())\n\n \ndigits = []\n\nwhile n > 0:\n digits.append(n%10)\n n = n // 10\ndigits.reverse()\nfor i in range(len(digits)):\n if digits[i] > 4:\n digits[i] = 9 - digits[i]\n\ndigits = [str(x) for x in digits]\n\nif digits[0] == '0':\n digits[0] = '9'\nprint(int(\"\".join(digits)))", "n=input()\r\nans=\"\"\r\nfor i in n :\r\n ans+=str(min((9-int(i)),(int(i))))\r\nif ans[0]==\"0\":\r\n ans=\"9\"+ans[1:]\r\nprint(ans)", "s = input()\r\nans =[]\r\nfor i in range(len(s)):\r\n val = int(s[i])\r\n if i==0 and s[i]=='9':\r\n ans.append('9')\r\n else:\r\n ans.append(str(min(val,9-val)))\r\nprint(''.join(ans))", "n=int(input())\nstrn=str(n)\nlistn=list(strn)\nfor i in range(len(listn)):\n if int(listn[i])>9-int(listn[i]):\n listn[i]=str(9-int(listn[i]))\nif listn[0]=='0':\n listn[0]='9'\nanswer=0\nfor i in listn:\n answer=answer*10+int(i)\nprint(answer)\n \t\t\t\t\t \t \t\t\t\t \t\t \t\t \t \t\t\t", "n = input()\r\ns = \"\"\r\nfor i in n:\r\n if 9 - int(i) < int(i):\r\n if 9 - int(i) == 0 and s == \"\":\r\n s += i\r\n else:\r\n s += str(9 - int(i))\r\n else:\r\n s += i\r\nprint(s)", "n = int(input())\n\nans = 0\ncount = 0\nwhile(n != 0):\n val = n%10\n \n if(val >= 5 and n != 9):\n ans = (10**count)*(9-val) + ans\n else:\n ans = (10**count)*val + ans\n count += 1\n \n n = n//10\n \nprint(ans)", "a=list(input())\r\n# print(a)\r\ngf=0\r\ncnt=0\r\nfor i in range(len(a)):\r\n if len(a)==1:\r\n break\r\n if str(9-int(a[i]))!='0':\r\n gf=1\r\n if a[i]>='5' and (gf or cnt>=1):\r\n a[i]=str(9-int(a[i]))\r\n cnt+=1\r\nfg=0\r\n# print(a)\r\nfor i in a:\r\n if fg:print(i,end='')\r\n else:\r\n if i!='0':\r\n print(i,end='')\r\n fg=1\r\nif a.count('0')==len(a):\r\n print(0)", "def minimum_Num(xchar):\r\n xchar=int(xchar)\r\n if xchar >=5 :\r\n xchar=9-xchar\r\n \r\n return xchar\r\ninp=input()\r\none_Didit=int(inp[0])\r\ninp=inp[1:]\r\nres=list(map(minimum_Num,inp))\r\nnew_Res=\"\".join(map(str,res))\r\none_Didit= 9-one_Didit if one_Didit >= 5 and one_Didit !=9 else one_Didit\r\nprint(str(one_Didit)+new_Res)\r\n", "n = str(input(\"\"))\r\ntodo = list(map(int, n))\r\nfor i in range(len(todo)):\r\n if i == 0:\r\n if todo[i] >= 5 and todo[i] < 9:\r\n todo[i] = 9 - todo[i]\r\n else:\r\n if todo[i] >= 5 and todo[i] <= 9:\r\n todo[i] = 9 - todo[i]\r\nprint(*todo, sep = '')", "n=input()\r\nx=0\r\nfor i in range(len(n)):\r\n temp=0\r\n if int(n[i])==9 and i==0:\r\n temp=int(n[i])\r\n elif int(n[i])>9-int(n[i]) :\r\n temp=9-int(n[i])\r\n else:\r\n temp=int(n[i])\r\n x=x*10+temp\r\nprint(x)\r\n\r\n\r\n\r\n\r\n\r\n", "num = int(input())\r\nreversed_num = []\r\nwhile num > 0:\r\n reversed_num.append(num % 10)\r\n num //= 10\r\n \r\nfor idx, digit in enumerate(reversed_num):\r\n if digit >= 5:\r\n reversed_num[idx] = 9 - digit\r\n \r\n \r\nif reversed_num[-1] == 0:\r\n reversed_num[-1] = 9\r\n \r\nnum = 0\r\nwhile reversed_num:\r\n num = num * 10 + reversed_num.pop()\r\n \r\nprint(num)", "str=input()\r\nsize=len(str)\r\ni=0\r\nwhile i<size:\r\n if i==0 and str[i]=='9': print(str[i], end=\"\")\r\n else: print(min(int(str[i]), 9-int(str[i])), end=\"\")\r\n i+=1\r\n", "s = input()\r\nanswer = []\r\nif s[0] == '9':\r\n answer.append('9')\r\n s = s[1:]\r\nfor c in s:\r\n t = int(c)\r\n if t < 9 - t:\r\n answer.append(c)\r\n else:\r\n answer.append(str(9 - t))\r\nprint(''.join(answer))\r\n", "# for _ in range(int(input())):\n\nn = input()\n\nres = \"\"\nfor c in n:\n if 4 < ord(c) - ord('0') <= 9:\n res += str(9 - (ord(c) - ord('0')))\n else:\n res += c\n\nif (res[0] == '0'):\n print('9' + res[1:])\nelse:\n print(res)\n", "def solve():\r\n num=input()\r\n if num[0] >='5' and num[0]!='9':\r\n print((9-int(num[0])),end='')\r\n else:print(num[0],end='')\r\n for i in range(1,len(num)):\r\n if num[i]>='5':\r\n print((9-int(num[i])),end='')\r\n else:print(num[i],end='')\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat May 6 19:02:41 2023\r\n\r\n@author: Paras\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = \"\"\r\nsn = str(n)\r\nif sn[0]=='9':\r\n s+='9'\r\n sn = sn[1:]\r\n\r\n\r\nfor c in sn:\r\n newmin = min(int(c),int(9-int(c)))\r\n s+=str(newmin)\r\n \r\nprint( int(s))", "from collections import Counter, defaultdict, deque\r\nimport sys, threading\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)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nx = inp()\r\ns = list(str(x))\r\n\r\nfor i, ch in enumerate(s):\r\n if ch > '4':\r\n s[i] = str(ord('9') - ord(ch))\r\nif s[0] == '0':\r\n s[0] = '9'\r\nprint(''.join(s))\r\n \r\n", "x = input()\r\nans = []\r\nfor i in range(len(x)):\r\n n = int(x[i])\r\n if i==0:\r\n if n>=5 and n<9:\r\n ans.append(9-n)\r\n else:\r\n ans.append(n)\r\n elif n>=5:\r\n ans.append(9-n)\r\n else:\r\n ans.append(n)\r\nprint(''.join([str(elem) for elem in ans]))", "s = input()\r\na = ''\r\nif s[0] == \"9\":\r\n a += '9'\r\nelse:\r\n a += str(min(9 - int(s[0]), int(s[0])))\r\nfor i in range(1,len(s)):\r\n if int(s[i]) >= 5:\r\n a += str(9 - int(s[i]))\r\n else:\r\n a += s[i]\r\nprint(a)\r\n\r\n\r\n", "import sys\r\nstrin = lambda: sys.stdin.readline().strip()\r\n\r\ndef solve():\r\n s = list(strin())\r\n\r\n for i,x in enumerate(s):\r\n if i == 0 and int(x) == 9: continue\r\n if ord(x) >= ord(\"5\"):\r\n s[i] = str(int(9-int(x)))\r\n print(\"\".join(s))\r\n\r\nsolve()", "import sys, time\r\n# sys.stdin=open('input.txt','r')\r\n# sys.stdout=open('output.txt','w')\r\n\r\nfrom math import ceil,floor\r\n\r\nfun=lambda : map(int,input().split())\r\n\r\ns=input()\r\nlst=[int(i) for i in s]\r\n\r\nif lst[0]!=9:\r\n lst[0]=min(lst[0],9-lst[0])\r\n\r\nfor i in range(1,len(lst)):\r\n lst[i]=min(lst[i],9-lst[i])\r\nlst=[str(i) for i in lst]\r\nprint(''.join(lst))", "a = input()\r\nnew_number = \"\"\r\n\r\nif len(a)==1:\r\n print(a)\r\nelse:\r\n if int(a[0])==9:\r\n new_number+=a[0]\r\n for i in range(1, len(a)):\r\n if int(a[i]) > 4:\r\n\r\n digit = 9 - int(a[i])\r\n new_number += str(digit)\r\n\r\n\r\n\r\n else:\r\n new_number += str(a[i])\r\n else:\r\n for i in range(len(a)):\r\n if int(a[i]) > 4:\r\n\r\n digit = 9 - int(a[i])\r\n new_number += str(digit)\r\n\r\n\r\n\r\n else:\r\n new_number += str(a[i])\r\n\r\n print(new_number)\r\n", "n = list(input())\r\nif n[0]=='9':\r\n for i in range(1,len(n)):\r\n x=9-int(n[i])\r\n if(x<int(n[i])):\r\n n[i]=str(x)\r\nelse:\r\n for i in range(len(n)):\r\n x=9-int(n[i])\r\n if(x<int(n[i])):\r\n n[i]=str(x)\r\nprint(''.join(n))\r\n", "s = input()\r\nans = ''\r\nfor i in s:\r\n x = int(i)\r\n if x > 4:\r\n ans += str(9 - x)\r\n else:\r\n ans += str(x)\r\nif ans[0] == '0':\r\n ans = '9' + ans[1:]\r\nprint(int(ans))", "n = int(input())\r\nl = list(str(n))\r\nl = [int(i) for i in l]\r\nfor i in range(len(l)):\r\n if i == 0:\r\n if 9-l[i]>0 and 9-l[i]<=l[i]:\r\n l[i] = 9-l[i]\r\n continue\r\n elif 9-l[i]<=l[i]:\r\n l[i] = 9-l[i]\r\n else:\r\n l[i] = l[i]\r\nans = ''.join(map(str,l))\r\nprint(int(ans))", "from bisect import bisect_left, bisect_right\r\nimport os\r\nfrom operator import indexOf\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom random import randint\r\n \r\nfrom collections import *\r\nfrom heapq import *\r\n \r\nfrom random import getrandbits\r\nimport math \r\nRANDOM = getrandbits(32)\r\nfrom itertools import combinations\r\nclass Wrapper(int):\r\n def __init__(self, x):\r\n int.__init__(x)\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ RANDOM \r\n \r\n# fast io\r\nBUFSIZE = 8192\r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n \r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n#some nice functions \r\ndef inpv():\r\n return(int(input()))\r\ndef inplt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) ]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\n \r\nfrom itertools import combinations\r\n \r\ndef dtb(n):\r\n return format(n, 'b')\r\ndef btd(n):\r\n return int(n, 2)\r\n \r\n \r\n# Python3 program to find element\r\n# closest to given target using binary search.\r\n \r\n# Returns element closest to target in arr[]\r\nclass FenwickTree:\r\n def __init__(self, x):\r\n \"\"\"transform list into BIT\"\"\"\r\n self.bit = x\r\n for i in range(len(x)):\r\n j = i | (i + 1)\r\n if j < len(x):\r\n x[j] += x[i]\r\n \r\n def update(self, idx, x):\r\n \"\"\"updates bit[idx] += x\"\"\"\r\n while idx < len(self.bit):\r\n self.bit[idx] += x\r\n idx |= idx + 1\r\n \r\n def query(self, end):\r\n \"\"\"calc sum(bit[:end])\"\"\"\r\n x = 0\r\n while end:\r\n x += self.bit[end - 1]\r\n end &= end - 1\r\n return x\r\ndef fun(arr,s, n, target):\r\n \r\n # Corner cases\r\n if (target <= arr[s]):\r\n return arr[s]\r\n if (target >= arr[n - 1]):\r\n return arr[n - 1]\r\n \r\n # Doing binary search\r\n i = s; j = n; mid = 0\r\n while (i < j):\r\n mid = (i + j) // 2\r\n \r\n if (arr[mid] == target):\r\n return arr[mid]\r\n \r\n # If target is less than array\r\n # element, then search in left\r\n if (target < arr[mid]) :\r\n \r\n # If target is greater than previous\r\n # to mid, return closest of two\r\n if (mid > s and target > arr[mid - 1]):\r\n return getClosest(arr[mid - 1], arr[mid], target)\r\n \r\n # Repeat for left half\r\n j = mid\r\n \r\n # If target is greater than mid\r\n else :\r\n if (mid < n - 1 and target < arr[mid + 1]):\r\n return getClosest(arr[mid], arr[mid + 1], target)\r\n \r\n # update i\r\n i = mid + 1\r\n \r\n # Only single element left after search\r\n return arr[mid]\r\n \r\n \r\n \r\ndef getClosest(val1, val2, target):\r\n \r\n if (target - val1 >= val2 - target):\r\n return val2\r\n else:\r\n return val1\r\ndef fun2(x):\r\n ans=0\r\n for j in x:\r\n y=int(j)\r\n ans=ans*10+y \r\n return ans\r\ndef fac(n):\r\n c=0\r\n for j in range(1,int(math.sqrt(n))+1):\r\n if(n%j==0 and n//j !=j):\r\n c+=2\r\n if(n%j==0 and n//j ==j):\r\n c+=1\r\n return c\r\n \r\n \r\n\r\ndef primefun(n):\r\n \r\n if n <= 1:\r\n return False\r\n # Loop through all numbers from 2 to the square root of n (rounded down to the nearest integer)\r\n for i in range(2, int(n**0.5)+1):\r\n # If n is divisible by any of these numbers, return False\r\n if n % i == 0:\r\n return False\r\n # If n is not divisible by any of these numbers, return True\r\n return True\r\nmd=998244353\r\ndef factm(x):\r\n ans=1\r\n for j in range(1,x+1):\r\n ans=((ans%md)*(j%md))%md\r\n return ans\r\ndef xCn(x,n):\r\n xn=factm(x)\r\n nn=factm(n)\r\n n2=factm(x-n)\r\n fn=((nn%md)*(n2%md))%md\r\n ans=modDivide(xn,fn)\r\n return ans\r\ndef modInverse(b,m):\r\n g = math.gcd(b, m)\r\n if (g != 1):\r\n # print(\"Inverse doesn't exist\")\r\n return -1\r\n else:\r\n # If b and m are relatively prime,\r\n # then modulo inverse is b^(m-2) mode m\r\n return pow(b, m - 2, m)\r\n \r\n \r\n# Function to compute a/b under modulo m\r\ndef modDivide(a,b):\r\n a = a % md\r\n inv = modInverse(b,md)\r\n if(inv == -1):\r\n print(\"Division not defined\")\r\n else:\r\n return((inv*a) % md)\r\n\r\n\r\n\r\n\r\n \r\nmod = 998244353\r\ns=input()\r\nans=list(s)\r\nx=min(int(ans[0]),9-int(ans[0]))\r\nif(x!=0):\r\n ans[0]=x\r\n\r\nfor j in range(1,len(s)):\r\n ans[j]=min(int(ans[j]),9-int(ans[j]))\r\nfor j in ans:\r\n print(j,end=\"\")\r\nprint()\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n", "x = input()\r\nif(x[0]==\"9\"):\r\n print(9,end=\"\")\r\nelse:\r\n print(min(int(x[0]),9-int(x[0])),end=\"\")\r\nfor i in range(1,len(x)):\r\n print(min(int(x[i]),9-int(x[i])),end=\"\")", "x=[i for i in input()]\r\ns=x.copy()\r\nfor i in range(len(x)):\r\n if int(x[i])>9-int(x[i]):\r\n x[i]=str(9-int(x[i]))\r\nif x[0]==\"0\":\r\n x[0]=s[0]\r\nprint(\"\".join(x))\r\n", "num = int(input())\r\n\r\nnums = list(str(num))\r\n\r\nfor i in range(len(nums)):\r\n if i == 0 and nums[i] == \"9\":\r\n continue\r\n nums[i] = str(min(int(nums[i]), 9 - int(nums[i])))\r\n\r\nprint(int(\"\".join(nums)))\r\n", "x=input()\r\ny=''\r\nfor i in range(len(x)):\r\n if i ==0 and int(x[i]) == 9:\r\n y=y+x[i]\r\n elif int(x[i])>=5:\r\n n=9-int(x[i])\r\n y=y+str(n)\r\n else:\r\n y=y+x[i]\r\nprint(y)", "s=list(input())\r\n# print(s)\r\nfor i in range(len(s)):\r\n\tif(i!=0):\r\n\t\ts[i]=str(min(int(s[i]),9-int(s[i])))\r\n\telse:\r\n\t\tif(s[i]=='9'):\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\ts[i]=str(min(int(s[i]),9-int(s[i])))\r\nfor i in range(len(s)):\r\n\tprint(s[i],end='')", "n = input()\r\nans = ''\r\nfor i in range(len(n)):\r\n num = int(n[i])\r\n if (num >= 5 and num != 9) or (num == 9 and i != 0):\r\n ans += str(9 - num)\r\n else:\r\n ans += str(num)\r\nprint(ans)", "s = list(map(int, input()))\r\nfor i in range(len(s)):\r\n if i==0 and 9-s[i]==0:\r\n continue\r\n s[i] = min(s[i], 9-s[i])\r\nfor i in s:\r\n print(i,end=\"\")", "n=list(input((\" \")))\r\n\r\nfor i in range(1, len(n)):\r\n if int(n[i])>=5:\r\n n[i]=str(9-int(n[i]))\r\n\r\nif int(n[0])>=5 and int(n[0])!=9:\r\n n[0]=str(9-int(n[0]))\r\n\r\nprint(''.join(n))\r\n", "def main():\r\n n = int(input())\r\n r = 0\r\n c = 0\r\n\r\n while n // 10 != 0 or n % 10 != 0:\r\n m = n % 10\r\n if m == 9 and n // 10 != 0:\r\n m = 0\r\n if m > 4 and m != 9:\r\n m = 9 - m\r\n n //= 10\r\n r += m * (10 ** c)\r\n c += 1\r\n\r\n print(r)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=input()\r\nfor i in range(len(n)):\r\n dig=min(int(n[i]),9-int(n[i]))\r\n if i==0 and dig==0:\r\n dig=9\r\n print(dig,end=\"\")\r\nprint()", "def main():\r\n number = input()\r\n number_list = []\r\n number_str = ''\r\n for i in range(len(number)):\r\n number_list.append(int(number[i]))\r\n if number_list[0] > 4 and number_list[0] != 9:\r\n number_list[0] = 9 - number_list[0]\r\n for i in range(1, len(number)):\r\n if number_list[i] > 4:\r\n number_list[i] = 9 - number_list[i]\r\n for i in range(len(number)):\r\n number_str += str(number_list[i])\r\n print(number_str)\r\nmain()", "str=list(input())\r\nfs=ord(str[0])\r\n # print(fs)\r\n # print((fs-48))\r\nx=(fs-48 )\r\nif((fs-48 )>4 and (fs-48 )!=9):\r\n # print(\"mango\")\r\n x=abs(9-(fs-48))\r\nprint(x,end=\"\")\r\nc=0\r\nfor i in str:\r\n c+=1\r\n if(c==1):\r\n continue\r\n fs=ord(i)\r\n # print(fs)\r\n # print((fs-48))\r\n x=(fs-48 )\r\n if((fs-48 )>4 ):\r\n # print(\"mango\")\r\n x=abs(9-(fs-48))\r\n print(x,end=\"\")", "n = int(input())\r\nl = []\r\ns = str(n)\r\nfor i in range(0,len(s)):\r\n if(i==0 and (9-int(s[0]))==0):\r\n l.append(s[i])\r\n elif(str(9-int(s[i]))>s[i]):\r\n l.append(s[i])\r\n else:\r\n l.append(str(9-int(s[i])))\r\n\r\nprint((int(\"\".join(l))))", "N = input()\r\nfor i in range(len(N)):\r\n c = N[i]\r\n if c <= '4':\r\n print(c, end = '')\r\n elif c == '9':\r\n if i == 0:\r\n print(c, end = '')\r\n else:\r\n print(9-int(c), end = '')\r\n else:\r\n print(9 - int(c), end='')", "s=[min(int(i),9-int(i)) for i in input()]\r\nif s[0]<1:s[0]=9\r\nprint(*s,sep='')\r\n", "n = str(input())\r\nres = []\r\nfor i,char in enumerate(n):\r\n if i == 0 and int(char) == 9:\r\n res.append(str(9))\r\n continue\r\n if int(char)>4:\r\n res.append(str(9-int(char)))\r\n else:\r\n res.append(char)\r\nprint(int(''.join(res)))\r\n", "import sys\r\na=input()\r\ns=\"\"\r\nfor c in range(len(a)):\r\n\tp=int(a[c])\r\n\tif c!=0 or p!=9: s+=str(min(p,9-p))\r\n\telse: s+=\"9\"\r\nprint(s)\r\n", "x = input()\r\nif x[0] == '9':\r\n s = x[0]\r\n for i in range(1, len(x)):\r\n if int(x[i]) > 9 - int(x[i]):\r\n s += str(9 - int(x[i]))\r\n else:\r\n s += x[i]\r\nelse:\r\n s = ''\r\n for i in range(len(x)):\r\n if int(x[i]) > 9 - int(x[i]):\r\n s += str(9 - int(x[i]))\r\n else:\r\n s += x[i]\r\nprint(s)", "n = int(input())\r\ncharacters = [int(x) for x in str(n)]\r\nif characters[0] != 9:\r\n if characters[0] > 4 :\r\n characters[0] = 9 - characters[0]\r\n\r\nfor i in range(1,len(characters)):\r\n\r\n if characters[i] > 4 :\r\n characters[i] = 9 - characters[i]\r\n \r\nset = [str(x) for x in characters]\r\nset_join = \"\".join(set)\r\nout = int(set_join)\r\n\r\nprint(out)", "n = int(input())\r\ni=0\r\nnum =0\r\nwhile n!=0:\r\n r = n%10 \r\n if len(str(n))==1 and n==9:\r\n r =9 \r\n num = 10**i * r + num \r\n i+=1 \r\n break\r\n if r >4 :\r\n r = 9-r\r\n num = 10**i * r + num \r\n i+=1\r\n n=n//10\r\nprint(num) \r\n", "n = str(input())\r\na=''\r\nfor i in range(len(n)):\r\n if int(n[i]) == 9 and i == 0 :\r\n a=a+n[i]\r\n elif int(n[i]) <= 4:\r\n a=a+n[i]\r\n else:\r\n a= a + str(9-int(n[i]))\r\nprint(int(a))", "n = input()\r\nans = \"\"\r\n\r\nfor index, i in enumerate(n):\r\n if (index == 0 or index == len(n)) and i == \"9\":\r\n ans += \"9\"\r\n continue\r\n \r\n if int(i) > 4:\r\n ans += str(9 - int(i))\r\n else:\r\n ans += i\r\n\r\nprint(ans)", "s = input()\r\nnew_s = \"\"\r\nfor i in range(len(s)):\r\n digit = int(s[i])\r\n left = digit\r\n right = 9 - digit\r\n if right == 0 and i == 0:\r\n new_s += str(9)\r\n continue\r\n if left < right:\r\n new_s += str(left)\r\n else:\r\n new_s += str(right)\r\nx = int(new_s)\r\nprint(x)\r\n", "n=input()\ns=\"\"\nif n[0]!=\"9\" and int(n[0])>4:\n\ts+=str(9-int(n[0]))\nelse:\n\ts+=n[0]\nfor i in n[1::]:\n\td=int(i)\n\tif d>4:\n\t\ts+=str(9-d)\n\telse:\n\t\ts+=i\nprint(s)", "import sys\r\ninput_file = sys.stdin.read(-1).replace(\"\\r\\n\", \"\\r\")\r\ninput_file = input_file.split()\r\n\r\nconversion_dict = {\"0\": \"0\", \"1\": \"1\", \"2\": \"2\", \"3\": \"3\", \"4\": \"4\", \"5\": \"4\", \"6\": \"3\", \"7\": \"2\", \"8\": \"1\", \"9\": \"0\"}\r\n\r\nnum = input_file[0]\r\nnew_num = \"\"\r\nfor count, digit in enumerate(num):\r\n if count == 0 and digit == \"9\":\r\n new_num += digit\r\n else:\r\n new_num += conversion_dict[digit]\r\nprint(new_num)\r\n", "n = input()\r\n\r\nnine = '9' * len(n)\r\n\r\nfor i in range(len(n)):\r\n j = int(n[i])\r\n if i == 0 and n[0] == '9':\r\n print(9, end='')\r\n else:\r\n if 9 - j < j:\r\n print(9-j, end='')\r\n else:\r\n print(j, end='')\r\n", "x = list(input())\r\n\r\nif int(x[0]) < 9:\r\n if 9 - int(x[0]) < int(x[0]):\r\n x[0] = str(9 - int(x[0]))\r\n \r\nans = x[0]\r\n\r\nfor i in range(1, len(x)):\r\n if 9 - int(x[i]) < int(x[i]):\r\n x[i] = str(9 - int(x[i]))\r\n ans += x[i]\r\nprint(ans)\r\n", "\r\n#A - Chewbaсca and Number\r\nnum = input()\r\nnew_num = \"\"\r\nnew_num2 = \"9\"\r\nfor t in num:\r\n if int(t) > 4:\r\n k = 9 - int(t)\r\n new_num += str(k)\r\n else:\r\n new_num += t\r\nif new_num[0] == '0':\r\n new_num2 += new_num[1:]\r\n print(new_num2)\r\nelse:\r\n print(new_num)\r\n", "s = input()\nr = ''\nfor i in s:\n\tr += str(9-int(i)) if int(i) > 4 else i\nprint(r if r[0]!='0' else '9'+r[1:])", "a=input()\r\not=''\r\n\r\n\r\nfor x in range(len(a)):\r\n ot=ot+str(min(int(a[x]),9-int(a[x])))\r\nif ot[0]=='0':\r\n ot='9'+ot[1:len(ot)]\r\nprint(ot)", "def main():\r\n x = input()\r\n result = \"\"\r\n for i, digit in enumerate(x):\r\n if i == 0 and digit == '9':\r\n result += digit\r\n else:\r\n complement = min(int(digit), 9 - int(digit))\r\n result += str(complement)\r\n print(result)\r\n\r\n\r\nmain()\r\n", "x = str(input())\r\nr = ''\r\nif int(x[0]) == 9:\r\n r += '9'\r\nelif int(x[0]) >= 5:\r\n y = 9-int(x[0])\r\n r += str(y)\r\nelse :\r\n r+= x[0]\r\nfor i in x[1:]:\r\n \r\n if int(i)>=5:\r\n y = 9-int(i)\r\n r += str(y)\r\n else:\r\n r+= i\r\n \r\nprint(r)\r\n ", "a=list(map(int,list(input())))\r\nfor i in range(len(a)):\r\n if a[i] > 4 and (i!=0 or (i==0 and a[i]<9)):\r\n a[i]=9-a[i]\r\nprint (int(''.join(list(map(str,a)))))\r\n", "x=(input())\r\nf=int(x[0])\r\nfor i in range(len(x)):\r\n a=int(x[i])\r\n if a>=5 :\r\n x=x.replace(str(a),str(9-a))\r\n \r\nif f==9:\r\n x=x.replace('0',str(9),1) \r\nprint(x) \r\n", "t = input()\r\nlst = [int(ch) for ch in t ]\r\nn = len(lst)\r\nstr1 = \"\"\r\nfor i in range(n):\r\n if lst[i] == 9 and i == 0:\r\n continue\r\n else:\r\n lst[i] = min(lst[i], 9 - lst[i])\r\n \r\nprint(int(str1.join([str(i) for i in lst])))\r\n", "x = input()\r\ny = len(x)\r\nz = int(x)\r\nfor a in range(0,y,1):\r\n if 9-int(x[a]) < int(x[a]):\r\n z = z - int(x[a])*10**(y-a-1) + ((9 - int(x[a]))*10**(y-a-1))\r\nif x[0]==\"9\":\r\n z += 9 *10**(y-1)\r\nprint(z)", "l = list(input())\r\nif int(l[0])!=9 and int(l[0]) > 9-int(l[0]):\r\n l[0]=str(9-int(l[0]))\r\n\r\nfor i in range (1,len(l)):\r\n if int(l[i]) > 9-int(l[i]) :\r\n l[i]=str(9-int(l[i]))\r\na=''.join(l)\r\n\r\nprint(a)", "n=int(input())\nstrn=str(n)\nlistn=list(strn)\nfor i in range(len(listn)):\n if int(listn[i])>9-int(listn[i]):\n listn[i]=str(9-int(listn[i]))\nif listn[0]=='0':\n listn[0]='9'\nans=0\nfor i in listn:\n ans=ans*10+int(i)\nprint(ans)\n \t\t\t\t\t \t\t\t\t\t \t\t \t\t \t\t", "if __name__ == '__main__':\r\n n = list(input())\r\n if int(n[0]) != 9:\r\n n[0] = str(min(int(n[0]), 9 - int(n[0])))\r\n for i in range(1, len(n)):\r\n n[i] = str(min(int(n[i]), 9 - int(n[i])))\r\n print(\"\".join(n))\r\n", "num = int(input())\r\nif num == 9:\r\n print(9)\r\nelse:\r\n stri = \"\"\r\n digit = 0\r\n while (num != 0):\r\n digit = num % 10\r\n if (9-digit < digit):\r\n digit = 9-digit\r\n stri += str(digit)\r\n num //= 10\r\n ans = stri[::-1]\r\n if (ans[0] == \"0\"):\r\n ans = \"9\"+ans[1:]\r\n\r\n print(ans)\r\n", "s = (input())\r\ns = list(s)\r\n#ch = input()\r\n#ch = ch.split()\r\n#ch = [int(x) for x in ch]\r\n#a, b = max(ch), min(ch)\r\n\r\nif s[0]<'9' and s[0]> '4':\r\n s[0] = format(ord('9')-ord(s[0]), 'd')\r\nfor i in range(1, len(s)):\r\n if s[i]<':' and s[i]>\"4\":\r\n s[i] = format(ord('9') - ord(s[i]), 'd')\r\n\r\nfor i in s:\r\n print(i, end='')", "x=input()\r\ny=\"\"\r\nif int(x[0])!=9 and int(x[0])>=5:\r\n y+=str(9-int(x[0]))\r\nelif int(x[0])!=9 and int(x[0])<5:\r\n y+=x[0]\r\nelif int(x[0])==9:\r\n y+='9'\r\nfor i in x[1:]:\r\n if int(i)>=5:\r\n y+=str(9-int(i))\r\n else:\r\n y+=i\r\n\r\nprint(y)\r\n", "\"\"\"\r\n author: Adham0 \r\n created: 04.08.2023 00:47:30\r\n ### Adham was here ###\r\n \r\n █████ ██████ ██ ██ █████ ███ ███\r\n ██ ██ ██ ██ ██ ██ ██ ██ ████ ████\r\n ███████ ██ ██ ███████ ███████ ██ ████ ██\r\n ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ \r\n ██ ██ ██████ ██ ██ ██ ██ ██ ██\r\n\"\"\"\r\n \r\nlst = list(input())\r\n \r\nfor i in range(len(lst)):\r\n lst[i] = str(min(int(lst[i]), 9 - int(lst[i])))\r\n \r\nif lst[0] == '0':\r\n lst[0] = '9'\r\n \r\nprint(''.join(lst))", "n=int(input())\nx=[]\n\nwhile n>0:\n x.append(n%10)\n n//=10\nx.reverse()\nif x[0]!=9:\n x[0]=min(x[0],9-x[0])\nfor i in range(1,len(x)):\n \n if 9-x[i] < x[i]:\n x[i]=9-x[i]\n\ny=[str(i) for i in x]\n#print(y)\n\nw=0\nfor i in range(len(y)):\n if y[i]!=\"0\":\n w=i\n break\nx=\"\".join(y[w:])\nprint(int(x))\n \n", "n = input()\r\n\r\nfirst_flag = True\r\nres = \"\"\r\nfor ch in n:\r\n if first_flag:\r\n if ch == \"9\":\r\n res += ch\r\n else:\r\n res += str(min(int(ch), 9-int(ch)))\r\n first_flag = False\r\n else:\r\n res += str(min(int(ch), 9-int(ch)))\r\n\r\nprint(res)", "def solve():\r\n x = list(input())\r\n for i in range(len(x)):\r\n if int(x[i]) > 9-int(x[i]):\r\n if i == 0 and x[i] == '9':\r\n continue\r\n x[i] = str(9-int(x[i]))\r\n print(''.join(x))\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "x = input()\r\n\r\n\r\nif int(x[0]) != 9:\r\n s = 0\r\n for i in x:\r\n if int(i) > 4:\r\n s = s * 10 + 9 - int(i)\r\n else:\r\n s = s * 10 + int(i)\r\n print(s)\r\nelse:\r\n s = 9\r\n for i in x[1:]:\r\n if int(i) > 4:\r\n s = s * 10 + 9 - int(i)\r\n else:\r\n s = s * 10 + int(i)\r\n print(s)", "n = input()\r\nans = \"\"\r\nc = 0\r\nfor i in n:\r\n \r\n \r\n\r\n if int(i) >= 5 and int(i) < 9:\r\n \r\n ans += str(9 - int(i))\r\n elif int(i) < 5:\r\n ans += i\r\n else:\r\n if c == 0:\r\n ans += str(i)\r\n else:\r\n ans += str(9 - int(i))\r\n \r\n c += 1\r\n \r\n\r\nprint(ans)\r\n \r\n", "x = input()\r\nres = []\r\nif x[0] == '9':\r\n res = [9]\r\nelif int(x[0]) > (9 - int(x[0])):\r\n res = [9 - int(x[0])]\r\nelse:\r\n res = [int(x[0])]\r\nprint(res[0], end=\"\")\r\nindex = 1\r\nwhile index < len(x):\r\n if int(x[index]) > (9 - int(x[index])):\r\n print((9 - int(x[index])), end=\"\")\r\n else:\r\n print(int(x[index]), end=\"\")\r\n index = index + 1\r\nprint()", "import sys\r\noutput=[]\r\n\r\ninput = [x for x in [x for x in sys.stdin.readline().split()][0]]\r\n\r\nif int(input[0])==9:\r\n\toutput.append(9)\r\nelse:\r\n\toutput.append(min(9-int(input[0]),int(input[0])))\r\n\t\r\nfor x in input[1:]:\r\n\t\toutput.append(min(9-int(x),int(x)))\r\n\t\t\r\nprint(\"\".join([str(x) for x in output]))", "n = list(input())\r\nseen = False\r\nfor idx in range(len(n)):\r\n digit = int(n[idx])\r\n if idx == 0 and digit == 9 :\r\n continue\r\n if 9 - digit < digit:\r\n n[idx] = f\"{9-digit}\"\r\nprint(int(\"\".join(n)))\r\n\r\n", "x = input() # Número fornecido por Luke Skywalker\r\n\r\n# Converter cada dígito para o mínimo possível\r\nresult = ''\r\nfor d in x:\r\n digit = int(d)\r\n if digit >= 5:\r\n digit = 9 - digit\r\n result += str(digit)\r\n\r\n# Se o primeiro dígito for zero, substituí-lo por 9\r\nif result[0] == '0':\r\n result = '9' + result[1:]\r\n\r\nprint(result)\r\n", "x = input()\r\nans = ''\r\nif x[0] == '9':\r\n ans += x[0]\r\nelse:\r\n if int(x[0]) >= 5:\r\n ans += str(9-int(x[0]))\r\n else:\r\n ans += x[0]\r\nfor i in range(1,len(x)):\r\n if int(x[i]) >= 5:\r\n ans += str(9-int(x[i]))\r\n else:\r\n ans += x[i]\r\nprint(ans)", "n = input()\r\n\r\n\r\nans = float(\"inf\")\r\ntempNum = \"\"\r\nfor i in range(len(n)):\r\n num = n[i]\r\n #print(num)\r\n \r\n \r\n num = int(num)\r\n\r\n if 9 - num < num:\r\n if num==9 and i==0:\r\n tempNum += str(num)\r\n\r\n else:\r\n tempNum += str(9 - num)\r\n\r\n else:\r\n tempNum += str(num)\r\n \r\nprint(tempNum)\r\n", "k = [min(i, 9-i) for i in map(int, input())]\r\nif k[0] == 0:\r\n k[0] = 9\r\nprint(*k, sep='')", "import sys, threading\r\nimport math\r\nfrom math import log2,floor\r\nimport heapq\r\nfrom collections import defaultdict,deque\r\ninput = sys.stdin.readline\r\n \r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nn = str(inp())\r\ns = \"\"\r\nfor i in range(len(n)):\r\n if 9 - int(n[i]) < int(n[i]):\r\n if 9 - int(n[i]) == 0 and len(s) == 0:\r\n s += n[i]\r\n else:\r\n s += str(9 - int(n[i]))\r\n else:\r\n s += n[i]\r\nprint(int(s))\r\n# def main(): \r\n# threading.stack_size(1 << 27)\r\n# sys.setrecursionlimit(1 << 30)\r\n# main_thread = threading.Thread(target=main)\r\n# main_thread.start()\r\n# main_thread.join()", "n=input()\r\nitr=0\r\nanswer=\"\"\r\nfor i in n:\r\n itr+=1\r\n if itr==1 and i==\"9\":\r\n answer+=i\r\n else:\r\n ii=int(i)\r\n if ii>=5 and ii<=9:\r\n ii=9-ii\r\n answer+=str(ii)\r\nprint(answer)", "x=int(input())\r\ns=str(x)\r\nf=\"\"\r\nfor i in range(len(s)):\r\n m=min(int(s[i]),(9-int(s[i])))\r\n if(i==0 and m==0):\r\n f+=s[i]\r\n else:\r\n f+=str(m)\r\nprint(f)", "N=input()\r\nNueve=True\r\nRes=\"\"\r\nfor Num in N:\r\n if((Num==\"5\")or(Num==\"6\")or(Num==\"7\")or(Num==\"8\")):\r\n Aux=9-int(Num)\r\n elif(Num==\"9\"):\r\n if(len(Res)==0):\r\n Aux=9\r\n else:\r\n Aux=0\r\n else:\r\n Aux=int(Num)\r\n Res=Res+str(Aux)\r\nprint(Res)\r\n", "def solution():\n n = int(input())\n v = []\n\n while n != 0:\n t = n % 10\n n = n // 10\n if t > 4:\n c = 9 - t\n v.append(c)\n else:\n v.append(t)\n\n v.reverse()\n \n if v[0] == 0:\n v[0] = 9\n\n for digit in v:\n print(digit, end='')\n\nif __name__ == \"__main__\":\n t = 1\n \n while t > 0:\n solution()\n t -= 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\ns=''\r\nwhile(n!=0):\r\n t=n%10\r\n s=str(t if t<=9-t else 9-t)+s\r\n n//=10\r\nprint('9'+s[1:] if s[0]=='0' else s)\r\n", "n = (input())\r\nif(n[0] == '9'):\r\n n = n[1:]\r\n print(9,end = '')\r\nfor i in range(len(n)):\r\n if(n[i] >= '5'):\r\n print(9-int(n[i]),end = '')\r\n else:\r\n print(n[i],end = '')\r\nprint()", "n=input()\r\nans=''\r\nif n[0]!='9':\r\n ans+=str(min(int(n[0]),9-int(n[0])))\r\nelse:ans='9'\r\nfor i in range(1,len(n)):\r\n ans+=str(min(int(n[i]),9-int(n[i])))\r\nprint(ans)\r\n", "s = list(input())\r\n\r\nfor i in range(len(s)):\r\n if int(s[i]) > (9 - int(s[i])) and not (9 - int(s[i]) == 0 and i == 0):\r\n s[i] = str(9 - int(s[i]))\r\n\r\nprint(''.join(s))\r\n", "\r\ndef solution(a):\r\n return\r\n\r\ndef driver():\r\n s = input()\r\n a = []\r\n\r\n for i in range(len(s)):\r\n n = int(s[i])\r\n if n < 5:\r\n a.append(n)\r\n elif n == 9 and i == 0:\r\n a.append(n)\r\n else:\r\n a.append(9 - n)\r\n\r\n print(''.join(map(str, a)))\r\n return\r\n\r\ndriver()", "class solve:\r\n def __init__(self):\r\n n=input()\r\n l=len(n)\r\n ans=\"\"\r\n i=0\r\n if n[i]==\"9\":\r\n ans+=\"9\"\r\n i+=1\r\n while i<l:\r\n t=int(n[i])\r\n if t>4:\r\n ans+=str(9-t)\r\n else:\r\n ans+=n[i]\r\n i+=1\r\n print(ans)\r\n\r\nobj=solve()", "def solve():\r\n n = list((input()))\r\n \r\n #remove first zeros\r\n flag = 0\r\n for i in range(len(n)):\r\n if int(n[i]) > 0:\r\n break \r\n else:\r\n n.pop(n[i])\r\n\r\n\r\n for i in range(len(n)):\r\n digit = int(n[i])\r\n if i == 0 and digit == 9:\r\n continue\r\n if abs(9-digit) < digit:\r\n n[i] = 9-digit\r\n \r\n ans = \"\"\r\n for i in n[flag:]:\r\n ans += str(i)\r\n print(ans)\r\n\r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()", "x = input()\r\nnx =\"\"\r\nfor i in range(len(x)):\r\n if int(x[i]) >= 5 and i != 0 :\r\n d = str(9 - int(x[i]))\r\n nx += d \r\n elif i == 0:\r\n if 9 - int(x[i]) < int(x[i]) and 9 - int(x[i]) > 0:\r\n nx+= str(9 - int(x[i]))\r\n else:\r\n nx+=x[i]\r\n else:\r\n nx+=x[i] \r\nprint(nx)", "integer = input()\r\nanswer = []\r\nfor i in integer:\r\n minn = min(int(i), 9 - int(i))\r\n answer.append(str(minn))\r\nif answer[0] == \"0\": answer[0] = integer[0]\r\nprint(\"\".join(answer))", "m=input()\nresult=\"\" \nfor i in range(len(m)):\n if int(m[i])>4:\n test=str(9-int(m[i]))\n if test=='0' and i==0:\n result+=m[i]\n else:\n result+=test\n else:\n result+=m[i] \nprint(result)\n\t\t \t \t \t\t \t \t \t\t\t\t \t \t", "# https://codeforces.com/problemset/problem/514/A\r\nn= input()\r\n# print(n[0],n[1:])\r\nif 9>int(n[0])>4:\r\n # print('kk')\r\n n=n.replace(n[0], str(9-int(n[0])))\r\n \r\n\r\nfor i in range(1,len(n)):\r\n \r\n \r\n if int(n[i])>=5:\r\n # print(n[i])\r\n # print('ll')\r\n n=n[0:i] + str(9-int(n[i])) + n[i+1:]\r\n \r\n \r\nprint(n)\r\n", "n=int(input())\r\ns=str(n)\r\na=\"\"\r\nfor i in s :\r\n if int(i) >= 5 :\r\n a+=str(9-int(i))\r\n else :\r\n a+=i\r\nif s[0]==\"9\" :\r\n a=\"9\"+a[1:]\r\nprint(a)\r\n", "k = input()\r\nn = \"\"\r\n\r\nfor i in range(len(k)):\r\n if i == 0 and k[i] == \"9\":\r\n n+=\"9\"\r\n else:\r\n a = min(int(k[i]),9-int(k[i]))\r\n n+=str(a)\r\nprint(n)", "number = input().replace('5', '4').replace('6', '3').replace('7', '2').replace('8', '1')\r\nnumber = number[0] + number[1:].replace('9', '0')\r\n\r\nprint(int(number))\r\n", "def main():\r\n n = int(input())\r\n s = list(str(n))\r\n for i in range(len(s)):\r\n if s[i] == '9' and i == 0:\r\n s[i] = '9'\r\n elif s[i]>= '5':\r\n s[i] = str(9 - int(s[i]))\r\n print(int(''.join(s)))\r\n\r\nmain()", "x = input()\r\nif x[0] == '9':\r\n print(int(x[0]), end='')\r\n for i in range(1, len(x)):\r\n print(min(int(x[i]), 9 - int(x[i])), end='')\r\nelse:\r\n for i in x:\r\n print(min(int(i), 9 - int(i)), end='')\r\n", "import bisect\r\nleft = lambda l,a : bisect.bisect_left(l,a) #returns index of value>=a\r\nright = lambda l,a : bisect.bisect_right(l,a) #returns index of value >a\r\nimport sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\ns = list(map(int,input()))\r\nif s[0] != 9:\r\n s[0] = min(s[0],9-s[0])\r\nfor i in range(1,len(s)):\r\n s[i] = min(s[i],9-s[i])\r\nprint(''.join(map(str,s)))", "x = str(input())\r\ns = \"\"\r\nfor i in range (0,len(x)):\r\n if i == 0 and int(x[i]) == 9:\r\n s += \"9\"\r\n elif int(x[i]) >= 5:\r\n s += str(9-int(x[i]))\r\n else:\r\n s += x[i]\r\nprint(int(s))", "x = input()\r\nans = \"\"\r\nfor i in range(len(x)):\r\n\tif i == 0 and int(x[i]) == 9:\r\n\t\tans += x[i]\r\n\telif int(x[i]) > 4:\r\n\t\tans += str(9-int(x[i]))\r\n\telse:\r\n\t\tans += x[i]\r\nprint(int(ans))", "s = input()\r\nx = \"\".split() \r\nfor i in s :\r\n x+=str(min((9 - int(i)), int(i)))\r\n if int(x[0]) < 1 : x[0] = '9'\r\nfor i in x : print(i , end=\"\")", "x = int(input())\r\na = []\r\nwhile x > 0:\r\n a.append(x % 10)\r\n x = x // 10\r\na.reverse()\r\nfor i in range(len(a)):\r\n a[i] = min(a[i], 9 - a[i])\r\nif a[0] == 0:\r\n a[0] = 9\r\ns = \"\" \r\nfor i in range(len(a)):\r\n s += str(a[i])\r\nprint(s) \r\n", "from collections import Counter, defaultdict, deque\r\nfrom bisect import bisect_left, bisect_right\r\nfrom heapq import heapify, heappush, heappop\r\n\r\n\r\ndef solve():\r\n L = list(map(int, input()))\r\n n = len(L)\r\n\r\n for i in range(n):\r\n if 9 - L[i] == 0 and i == 0:\r\n continue\r\n L[i] = min(L[i], 9 - L[i])\r\n print(*L, sep=\"\")\r\n\r\n\r\nsolve()\r\n", "#-*- coding = utf-8 -*-\r\n#@Time : 2023/6/20 13:38\r\n#@Author : xht\r\n#@File : 514A.py\r\n#@Software: PyCharm\r\n\r\nl = input()\r\nres = ''\r\nfor i in range(len(l)):\r\n if 9 - int(l[i]) == 0 and i == 0:\r\n res += '9'\r\n else:\r\n res += str(min(9 - int(l[i]) , int(l[i])))\r\nprint(int(res))", "s=input()\r\nans=0\r\nif s[0]=='9':\r\n ans=ans*10+9\r\nelse:\r\n if int(s[0])>9-int(s[0]):\r\n ans=ans*10+9-int(s[0])\r\n else:\r\n ans=ans*10+int(s[0])\r\nfor i in range(1,len(s)):\r\n if int(s[i])>9-int(s[i]):\r\n ans=ans*10+9-int(s[i])\r\n else:\r\n ans=ans*10+int(s[i])\r\nprint(ans)", "x=input()\r\ns=''\r\nif int(x[0])==9: \r\n s+=x[0]\r\n for i in range(1,len(x)):\r\n if int(x[i])>=5:\r\n s+=str(9-int(x[i]))\r\n if int(x[i])<5:\r\n s+=x[i]\r\nif int(x[0])!=9:\r\n for i in range(len(x)):\r\n if int(x[i])>=5:\r\n s+=str(9-int(x[i]))\r\n if int(x[i])<5:\r\n s+=x[i] \r\n\r\nprint(s) ", "arr=list(map(int,list(input())))\nans=0\nfor i in arr:\n if ans==0 and i==9:\n ans+=9\n continue\n ans*=10\n if i>4:\n ans+=(9-i)\n else:\n ans+=i\nprint(ans)\n", "x = input()\nans = x[0] if x[0] == '9' else str(min(9-int(x[0]), int(x[0])))\nfor i in range(1,len(x)):\n ans += str(min(9-int(x[i]), int(x[i])))\nprint(ans)\n\n\n\n\n\n", "\nx = input()\n\n\ndigits = list(map(int, x))\n\n\nfor i in range(len(digits)):\n if i == 0 and digits[i] == 9:\n continue\n digits[i] = min(digits[i], 9 - digits[i])\n\n\nmin_number = int(\"\".join(map(str, digits)))\n\n\nprint(min_number)\n \t \t \t \t \t\t\t \t\t \t \t\t\t\t \t", "def checker(x):\r\n res = ''\r\n if x[0] == '9':\r\n res += '9'\r\n x = x[1:]\r\n \r\n for num in x:\r\n if int(num) >= 5:\r\n res += str(9 - int(num))\r\n else:\r\n res += num\r\n\r\n return res\r\n\r\nif __name__ == \"__main__\":\r\n x = input()\r\n res = checker(x)\r\n print(res)\r\n", "x = (input())\r\n\r\n\r\ncur = []\r\n\r\nfor idx, char in enumerate(x):\r\n if int(char) == 9 and idx == 0:\r\n cur.append(char)\r\n continue\r\n elif int(char) > 4:\r\n cur.append(str(9 - int(char)))\r\n else:\r\n cur.append(char)\r\n\r\n\r\nprint(\"\".join(cur))", "s = [min(int(i), 9-int(i)) for i in input()]\r\nif s[0]<1:\r\n s[0] = 9\r\nprint(*s, sep = '')", "a = input()\r\nans = ''\r\n\r\nfirstval = int(a[0])\r\n\r\nif firstval == 9:\r\n ans += str(9)\r\nelif firstval > 4:\r\n ans += str(9-firstval)\r\nelse:\r\n ans += a[0]\r\n\r\nfor i in range(1,len(a)):\r\n if int(a[i]) < 5 or a == 0:\r\n ans += a[i]\r\n else:\r\n ans += str(9-int(a[i]))\r\n\r\nprint(ans)", "A=list(input())\r\na=int(A[0])\r\nif 5<=a<=8:\r\n A[0]=str(9-a)\r\nfor x in range(1,len(A)):\r\n a=int(A[x])\r\n if a>=5:\r\n A[x]=str(9-a)\r\nprint(''.join(A))\r\n", "a=input()\r\nb=''\r\nfor x in range(len(a)):\r\n if int(a[x])>4:\r\n b+=str(9-int(a[x]))\r\n else:\r\n b+=a[x]\r\nif b[0]=='0':\r\n print('9'+b[1:len(b)])\r\nelse:\r\n print(b)", "n=int(input())\r\ns=str(n)\r\nfor i in range(len(s)):\r\n if i==0 and s[i]=='9':\r\n print(9,end='')\r\n else:\r\n print(min(9-int(s[i]),int(s[i])), end='')", "n=int(input())\ns=str(n)\nlis=[]\nfor i in s:\n lis.append(int(i))\nfor i in range(len(lis)):\n if(i==0):\n if(lis[i]<9 and lis[i]>=5):\n lis[i]=9-lis[i] \n elif(lis[i]>=5 and i>0):\n lis[i]=9-lis[i]\nstring=\"\"\nfor i in lis:\n string+=str(i)\nprint(string)\n\t\t \t \t \t \t\t\t\t \t \t", "s = input()\r\no = ''.join(['9' if s[0]=='9' else s[0] if int(s[0])<=9-int(s[0]) else str(9-int(s[0]))])\r\ns = s[1:]\r\no+=''.join([el if int(el)<=9-int(el) else str(9-int(el)) for el in s])\r\nprint(o)", "ans=\"\"\r\nfor i in str(input()):\r\n if i=='9'and ans==\"\":\r\n ans+=i\r\n else:\r\n ans+=str(min(int(i),9-int(i)))\r\nprint(int(ans))", "n=int(input())\r\nk=str(n)\r\nif k[0]=='9':\r\n k1=k[1:]\r\n for i in k1:\r\n if 9-int(i)<int(i):\r\n k1=k1.replace(i,str(9-int(i)))\r\n print('9'+k1)\r\nelse:\r\n for i in k:\r\n if 9-int(i)<int(i):\r\n k=k.replace(i,str(9-int(i)))\r\n print(k)", "def change(n):\r\n if(n==9):\r\n return 9\r\n a=n%10\r\n return min(a,9-a)\r\n \r\nn=int(input())\r\nm=\"\"\r\nwhile(n>0):\r\n a=change(n)\r\n m=m+str(a)\r\n n=n//10\r\n \r\nans=m[::-1]\r\nprint(int(ans))", "x = input()\n\nresult = ''\nfor d in x:\n digit = int(d)\n if digit >= 5:\n digit = 9 - digit\n result += str(digit)\n\nif result[0] == '0':\n result = '9' + result[1:]\n\nprint(result)", "v=input()\nvv=[min(int(x),9-int(x)) for x in v]\nif vv[0]<1:\n vv[0]=9\nprint(\"\".join(map(str,vv)))\n\t\t\t\t \t \t \t \t \t \t \t\t\t \t", "num = list(input())\r\n\r\nnum[0] = str(min(int(num[0]),9-int(num[0])) if int(num[0])<9 else 9)\r\nfor i in range(1,len(num)):\r\n digit = int(num[i])\r\n num[i] = str(min(digit,9-digit))\r\n\r\nprint(int(\"\".join(num)))", "t= int(input())\ntemp = t\nnum = []\n\nwhile temp:\n n = temp % 10 \n num.insert(0,n)\n temp = temp//10\n\nx = 0\n\nif num[0]==9: \n num = num[:1]+[min(i,9-i) for i in num[1:]]\nelse:\n num = [min(num[i],9-num[i]) for i in range(len(num))]\n\nfor i in num: \n x = x*10 + i\n\nprint(x)", "n=str(input())\r\nfor i in range(len(n)):\r\n m=int(n[i])\r\n if i==0:\r\n if m==9:\r\n print(m,end='')\r\n elif m<5:\r\n print(m,end='')\r\n else:\r\n print(9-m,end='')\r\n else:\r\n if m<5:\r\n print(m,end='')\r\n else:\r\n print(9-m,end='')\r\n \r\n", "arr = [int(i) for i in input()]\r\nif 9 - arr[0] < arr[0] and 9 - arr[0] != 0:\r\n arr[0] = 9 - arr[0]\r\nfor i in range(1, len(arr)):\r\n if 9 - arr[i] < arr[i]:\r\n arr[i] = 9 - arr[i]\r\nprint(*arr, sep='')", "t = str(input())\r\nnew_num = ''\r\n\r\nfor i in range(len(t)):\r\n if int(t[0]) == 9 and i == 0:\r\n new_num += t[0]\r\n else:\r\n if int(t[i]) >= 5:\r\n new_num += str(9 - int(t[i]))\r\n else:\r\n new_num += t[i]\r\n\r\nprint(int(new_num))", "ans = ''\r\nk = 0\r\nfor i in input():\r\n k += 1\r\n if int(i) == 9 and k == 1:\r\n ans += i\r\n else:\r\n if int(i) > 4:\r\n ans += str(9 - int(i))\r\n else:\r\n ans += i\r\nprint(ans)", "# LUOGU_RID: 101573040\nans = ''\r\nfor c in input():\r\n ans += min(c, chr(ord('0') + ord('9') - ord(c)))\r\nif ans[0] == '0':\r\n print('9' + ans[1:])\r\nelse:\r\n print(ans)", "n = [x for x in input()]\r\nfor i in range(len(n)):\r\n t = 9 - int(n[i])\r\n if t == 0 and i == 0:\r\n pass\r\n elif int(n[i]) > t:\r\n n[i] = str(t)\r\nn = \"\".join(n)\r\nprint(n)", "x = input()\r\nres = \"\"\r\nfor i, c in enumerate(x):\r\n if i == 0 and c == \"9\":\r\n res += c\r\n else:\r\n n = int(c)\r\n res += str(min(n, 9 - n))\r\nprint(res)\r\n", "s = list(map(int,input()))\r\nsize = len(s)\r\nfor i in range(size):\r\n if s[i] == 9 and i == 0:\r\n print(9,end=\"\")\r\n elif 9 - s[i] > 4:\r\n print(s[i],end=\"\")\r\n else:\r\n print(9 - s[i] , end=\"\")\r\nprint()", "x=int(input())\r\narray = [int(i) for i in str(x)]\r\narray=[min(i,(9-i)) for i in array]\r\nif array[0]<1:\r\n array[0]=9\r\n\r\nfor i in range(len(array)):\r\n print(array[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 ", "x = input()\r\nresult = \"\"\r\n\r\nfor i, digit in enumerate(x):\r\n if i == 0 and digit == '9':\r\n result += digit\r\n else:\r\n digit = min(int(digit), 9 - int(digit)) \r\n result += str(digit)\r\n\r\nprint(result)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 17 02:49:17 2023\r\n\r\n@author: Dell\r\n\"\"\"\r\n\r\nt=input()\r\nx=\"\"\r\nfor i in range(len(t)):\r\n if i==0:\r\n if int(t[i])>=5 and int(t[i])<9:\r\n x+=str(9-int(t[i]))\r\n else:\r\n x+=t[i]\r\n else:\r\n if int(t[i])>=5:\r\n x+=str(9-int(t[i]))\r\n else:\r\n x+=t[i]\r\n \r\nprint(x)", "def min_possible_positive_number(x):\n x_str = str(x)\n inverted_str = \"\"\n\n if x_str[0] != '9' and x_str[0] > '4':\n inverted_str += str(9 - int(x_str[0]))\n else:\n inverted_str += x_str[0]\n\n for i in range(1, len(x_str)):\n inverted_digit = min(int(x_str[i]), 9 - int(x_str[i]))\n inverted_str += str(inverted_digit)\n\n return int(inverted_str)\n\nx = int(input())\n\nresult = min_possible_positive_number(x)\nprint(result)\n\t \t\t \t \t\t\t \t\t \t\t\t\t\t\t \t\t\t \t", "num = input()\r\nres = \"\"\r\n \r\nminim = min(int(num[0]), 9 - int(num[0]))\r\nres += str(minim) if minim != 0 else num[0]\r\n \r\nfor idx in range(1, len(num)):\r\n min_digit = min(int(num[idx]), 9 - int(num[idx]))\r\n res += str(min_digit)\r\n \r\nprint(res)", "n = input()\r\ns = [ ]\r\nfor i in range(len(n)):\r\n if i == 0 and int(n[i]) == 9:\r\n s += [n[i]]\r\n else:\r\n s += [min(int(n[i]) ,(9 - int(n[i])))]\r\nprint(*s ,sep = '')\r\n", "num = input()\r\nnum = list(num)\r\n \r\nfor i in range(len(num)):\r\n if i == 0 and num[i] == '9':\r\n continue\r\n num[i] = str(min(int(num[i]), (9 - int(num[i]))))\r\n \r\nresult = ''.join(num)\r\n \r\nprint(int(result))\r\n", "n=int(input())\r\nst=\"% s\" % n\r\nnew=''\r\n\r\nfor i in st:\r\n inum=int(i)\r\n rem=9-inum\r\n new=new+\"% s\" % min(inum,rem)\r\nif new[0]=='0':\r\n #new[0]=9\r\n result=''\r\n result='9'+new[1:]\r\n new=result\r\nprint(new)", "#### now the problem can be easily solved by counting the no of ++ and --\r\n\r\nn=int(input())\r\ns=str(n)\r\nresult=''\r\nfor i,ch1 in enumerate(s):\r\n \r\n ch=ord(ch1)-ord('0')\r\n \r\n if i==0:\r\n if ch==9 or ch<5:\r\n result+=str(ch)\r\n else:\r\n result+=str(9-ch)\r\n else:\r\n if ch<5:\r\n result+=str(ch)\r\n else:\r\n result+=str(9-ch)\r\nprint(result)\r\n ", "x = int(input())\r\nstring = str(x)\r\nstring = list(string) \r\n\r\nfor i in range(len(string)):\r\n digit = int(string[i])\r\n \r\n if i == 0:\r\n # If it's the first digit, ensure it doesn't become '0'\r\n if digit >= 5 and digit != 9 :\r\n digit = 9 - digit\r\n \r\n else:\r\n # For other digits, always choose the smaller inversion\r\n digit = min(digit, 9 - digit)\r\n \r\n string[i] = str(digit)\r\n\r\n# Convert the list back to a string and then to an integer\r\nresult = int(\"\".join(string))\r\n\r\nprint(result)\r\n", "num = list(map(int, input()))\r\n\r\n# 仅当第一位不是9时，按照上述规则进行转换\r\nnum[0] = 9 - num[0] if num[0] != 9 and num[0] >= 5 else num[0]\r\n\r\n# 从第二位开始，按照上述规则转换\r\nfor i in range(1, len(num)):\r\n if num[i] >= 5:\r\n num[i] = 9 - num[i]\r\n\r\nprint(''.join(map(str, num)))\r\n", "from itertools import combinations\r\n\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n t = \"\"\r\n for el in s:\r\n t += str(min(int(el), 9 - int(el)))\r\n if t[0] == '0':\r\n print('9' + t[1:])\r\n else:\r\n print(t)\r\n\r\n", "s = [ min(int(l) , 9-int(l))for l in input()]\r\nif s[0] <1 :\r\n\ts[0] = '9'\r\nprint(*s,sep='')", "n=int(input())\nstrn=str(n)\nlistn=list(strn)\nfor j in range(len(listn)):\n if int(listn[j])>9-int(listn[j]):\n listn[j]=str(9-int(listn[j]))\nif listn[0]=='0':\n listn[0]='9'\nans=0\nfor j in listn:\n ans=ans*10+int(j)\nprint(ans)\n\n\n\t \t \t \t\t\t\t\t \t\t\t\t \t\t", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\n\r\nnum = input()\r\nnew_num = \"\"\r\nif len(num) == 1:\r\n print(num)\r\n quit()\r\nif 9 - int(num[0]) == 0:\r\n new_num += num[0]\r\nelse:\r\n k = 9 - int(num[0])\r\n if k > int(num[0]):\r\n new_num += num[0]\r\n else:\r\n new_num += str(k)\r\n \r\n \r\nfor i in range(1,len(num)):\r\n\r\n k = 9 - int(num[i])\r\n if k > int(num[i]):\r\n new_num += num[i]\r\n else:\r\n new_num += str(k)\r\nprint(new_num)\r\n", "num = list(input())\r\n\r\n \r\nfor i in range(len(num)):\r\n \r\n if num[i]=='8':\r\n num[i]='1'\r\n elif num[i]=='7':\r\n num[i]='2'\r\n elif num[i]=='6':\r\n num[i]='3'\r\n elif num[i]=='5':\r\n num[i]='4'\r\n elif num[i]=='9':\r\n if i==0:\r\n pass\r\n else:\r\n num[i]='0'\r\n\r\nprint(*num,sep=\"\")", "num = str(input())\r\nans = 0\r\nfor idx, n in enumerate(num):\r\n if idx == 0 and (n >= '5' and n < '9'):\r\n ans = ans * 10 + (9 - int(n))\r\n \r\n elif idx > 0 and (n >= '5' and n <= '9'):\r\n ans = ans * 10 + (9 - int(n))\r\n \r\n else:\r\n ans = ans * 10 + int(n)\r\nprint(ans)", "n=input()\r\nl=[]\r\nfor i in n:\r\n if 9-int(i)>=0 and 9-int(i)<5:\r\n l.append(9-int(i))\r\n else:\r\n l.append(i)\r\nif l[0]==0:\r\n l[0]=9\r\nfor j in l:\r\n print(j,end='')\r\n \r\n ", "n = input()\r\nans = ''\r\nfor i in n:\r\n ans += str(min(int(i),9-int(i)))\r\nif ans[0] == '0':\r\n ans = '9'+ans[1:]\r\nprint(ans)", "def main():\r\n x = input()\r\n result = list()\r\n\r\n for i, char in enumerate(x):\r\n t = int(char)\r\n if i == 0 and t == 9:\r\n result.append(t)\r\n elif t < 5:\r\n result.append(t)\r\n else:\r\n result.append(9 - t)\r\n\r\n print(''.join(map(str, result)))\r\n\r\n\r\nmain()\r\n", "number = input()\r\nres= ''\r\nfor i in range(len(number)-1 , -1 , -1 ): \r\n if int(number[i]) < 5 : \r\n res += number[i] \r\n else :\r\n if str(9 - int(number[i])) == '0' and (i == 0) : \r\n res+= '9'\r\n else:\r\n res += str(9 - int(number[i])) \r\n \r\nprint(res[::-1])\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n DIGITS:list[int] = list(map(int, input().rstrip()))\r\n\r\n minPossibleDigits:list[int] = []\r\n for index, digit in enumerate(DIGITS) :\r\n if digit>=5 and (not(index==0 and digit==9)) : minPossibleDigits.append(9-digit)\r\n else : minPossibleDigits.append(digit)\r\n\r\n print(int(\"\".join(map(str, minPossibleDigits))))\r\n\r\nmain()", "string = input()\r\nstringArray = []\r\nfor i in range(len(string)):\r\n stringArray.append(int(string[i]))\r\nfinalArray = []\r\nif stringArray[0] == 9:\r\n finalArray.append(9)\r\nelif stringArray[0] >= 5:\r\n finalArray.append(9 - stringArray[0])\r\nelse:\r\n finalArray.append(stringArray[0])\r\nfor i in range(1, len(stringArray)):\r\n if stringArray[i] >= 5:\r\n finalArray.append(9 - stringArray[i])\r\n else:\r\n finalArray.append(stringArray[i])\r\nfor i in range(len(finalArray)):\r\n print(finalArray[i], end = \"\")\r\n", "s=input()\r\nn=len(s)\r\np=\"\"\r\nfor i in range(n):\r\n if i==0 and s[i]==\"9\":\r\n p+=s[i]\r\n else:\r\n p+=str(min(9-int(s[i]),int(s[i])))\r\nprint(p)", "n = input()\nans = ''\nfor i in range(len(n)):\n j = 9 - int(n[i])\n if int(n[i])>j:\n ans += str(j)\n else:\n ans += n[i]\nif ans[0] == '0':\n print('9' + ans[1:])\nelse:\n print(ans)", "from sys import stdin\r\ninput = lambda: stdin.readline().rstrip('\\r\\n')\r\nx = input()\r\nl = []\r\nfor i in x:\r\n l.append(min(int(i), 9 - int(i)))\r\n \r\nif l[0] == 0:\r\n l[0] = 9\r\nprint(''.join(map(str, l)))\r\n \r\n", "n = input()\r\n\r\nfor i in range(len(n)):\r\n digit = int(n[i])\r\n\r\n if i==0 and digit==9:\r\n print(digit, end='')\r\n else:\r\n if digit > 4:\r\n print(9-digit, end='')\r\n else:\r\n print(digit, end='')\r\n", "number = list(map(int, list(input())))\n\nfor i, digit in enumerate(number):\n if i == 0 and 9 - digit == 0:\n continue\n elif 9 - digit <= digit:\n number[i] = 9 - digit\n\nprint(\"\".join(map(str, number)))\n", "# Source: https://usaco.guide/general/io\nnum = input()\nson=\"\"\ncount =0\nfor i in num:\n\tif int(i) < (9-int(i)):\n\t\tson += i\n\telse:\n\t\tif (str(9-int(i)) == \"0\") and count == 0:\n\t\t\tson += i\n\t\telse:\n\t\t\tson += str(9-int(i))\n\tcount += 1\nprint(int(son))\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ns = list(input().strip())\r\n\r\nfor i in range(len(s)):\r\n t = 9 - (ord(s[i])-ord('0'))\r\n if t < ord(s[i])-ord('0'):\r\n if t != 0 or i != 0:\r\n s[i] = str(t)\r\nprint(''.join(s))", "num=input()\r\nnum=num[::-1]\r\ncnt=0\r\nst=\" \"\r\nfor i in num:\r\n cnt=cnt+1\r\n if(int(i)==9 and cnt==len(num)):\r\n st+=i\r\n else:\r\n if(9-int(i)<int(i)):\r\n st+=str(9-int(i))\r\n else:st+=i\r\nst=st[::-1]\r\nprint(st)", "a=int(input())\r\na=str(a)\r\nm=[]\r\ncount=0\r\nfor i in a:\r\n i=int(i)\r\n if i>=5 and count==0 and i!=9:\r\n i=9-i\r\n elif i>=5 and count>=1:\r\n i=9-i\r\n count+=1\r\n m.append(i)\r\nprint(*m,sep='')", "num = input()\r\nnum = list(map(int, num))\r\n\r\n# Check if the first digit is 9\r\nif num[0] != 9 and num[0] > 9 - num[0]:\r\n num[0] = 9 - num[0]\r\n\r\nfor i in range(1, len(num)):\r\n if num[i] > 9 - num[i]:\r\n num[i] = 9 - num[i]\r\n\r\nnum = list(map(str, num))\r\nprint(\"\".join(num))", "number = input()\r\n\r\nfor i in range(len(number)):\r\n if i == 0 and number[i] == '9':\r\n print(9, end='')\r\n elif int(number[i]) >= 5:\r\n print(9 - int(number[i]), end='')\r\n else:\r\n print(number[i], end='')", "s=input()\r\nm=\"\"\r\nfor i in range(len(s)) :\r\n if s[i]=='9' and i==0 :\r\n m+='9'\r\n elif s[i]>='5' :\r\n m+=str(9-int(s[i]))\r\n else :\r\n m+=s[i]\r\n\r\nprint(m)", "arr = [min(int(x), 9 - int(x)) for x in input()]\r\nif arr[0] < 1:\r\n arr[0] = 9\r\n\r\nprint(\"\".join(map(str, arr)))", "n=input()\r\nans=\"\"\r\nfor i in range(len(n)):\r\n if(i==0 and n[i]=='9'):\r\n ans+='9'\r\n elif(int(n[i])>4):\r\n temp=9-int(n[i])\r\n ans+=str(temp)\r\n else:\r\n ans+=(n[i])\r\nprint(ans)", "k=int(input())\r\nj=str(k)\r\nl=\"\"\r\nfor i in range (len(j)):\r\n if(i==0):\r\n if(int(j[0])==9 or int(j[0])<=4):\r\n l=l+j[0]\r\n else:\r\n l=l+str(9-int(j[0])) \r\n\r\n\r\n else:\r\n if(int(j[i])>4):\r\n l=l+str(9-int(j[i]))\r\n else:\r\n l=l+j[i] \r\nprint(int(l)) ", "# Read the input number as a string\nx = input()\n\n# Convert the string to a list of digits\ndigits = list(map(int, x))\n\n# Invert the digits to obtain the minimum number\nfor i in range(len(digits)):\n if i == 0 and digits[i] == 9:\n continue\n digits[i] = min(digits[i], 9 - digits[i])\n\n# Convert the list of digits back to a string and then to an integer\nmin_number = int(\"\".join(map(str, digits)))\n\n# Print the minimum possible positive number\nprint(min_number)\n\n \t \t\t \t\t\t \t \t \t \t \t \t \t\t", "n=input()\r\nb=0\r\nfor i in n:\r\n a=9-int(i)\r\n if(a==0 and b==0):\r\n print(int(i),end=\"\")\r\n elif(a<=int(i)):\r\n print(a,end=\"\")\r\n else:\r\n print(int(i),end=\"\")\r\n b+=1\r\n ", "n = input()\r\nres = \"\"\r\nfor i in n[1:]:\r\n i = int(i)\r\n res+= str(9-i) if 9-i<i else str(i)\r\nfirst = n[0] if n[0]==\"9\" else str(9-int(n[0])) if 9-int(n[0])<int(n[0]) else str(int(n[0]))\r\nprint(first+res)", "a = list(input())\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\n if i == 0:\r\n if a[i] != 9:\r\n if a[i] > 4:\r\n a[i] = 9 - a[i]\r\n\r\n else:\r\n if a[i] > 4:\r\n a[i] = 9 - a[i]\r\n\r\nprint(''.join(map(str, a)))", "# all those moments will be lost in time , like tears in rain \r\nx=input()\r\nalist=[]\r\n\r\nfor i in range (len(x)):\r\n \r\n num=int(x[i])\r\n inv=9-(num) #الرقم اللي هيطلع\r\n if (i==0 and x[i]=='9'):\r\n alist.append(9)\r\n \r\n\r\n elif inv<num :\r\n alist.append(inv)\r\n else:\r\n alist.append(num)\r\n\r\n\r\n\r\nprint(*alist,sep='')\r\n", "number=input()\r\nres=[]\r\nfor i in number:\r\n if 5<=int(i):\r\n res.append(9-int(i))\r\n else:\r\n res.append(int(i))\r\nif res[0]==0:\r\n res[0]=9\r\nprint(''.join(list(map(str,res))))", "x=input()\r\ns=\"\"\r\nfor i in x:\r\n s+=str(min(int(i),9-int(i)))\r\nprint(s.replace(s[0],\"9\",1) if s[0]==\"0\" else s)", "str = input()\nfor i in range(len(str)):\n if str[i] == '5' or str[i] == '6' or str[i] == '7' or str[i] == '8' or (str[i] == '9' and i != 0):\n str = str[:i] + str[i].replace(str[i], chr(ord('9') - ord(str[i]) + ord('0'))) + str[i+1:]\nfor i in range(len(str)):\n print(str[i], end='')\n \t\t \t \t \t\t\t\t \t \t \t\t \t", "x = input()\nnew = \"\"\n\nfor num in x:\n new += str(9 - int(num)) if int(num) > 4 else num\n\nif new.startswith(\"0\"):\n new = \"9\" + new[1:]\n\nprint(new)\n\n\t\t\t \t \t \t \t\t \t\t\t \t", "if __name__ == \"__main__\":\r\n x = int(input())\r\n s = str(x)\r\n s_list = list(s)\r\n\r\n for i in range(0, len(s_list)):\r\n if i == 0 and s_list[i] == '9':\r\n continue\r\n else:\r\n if int(s_list[i]) > 9 - int(s_list[i]):\r\n s_list[i] = str(9 - int(s_list[i]))\r\n \r\n s = ''.join(s_list)\r\n res = int(s)\r\n print(s)\r\n", "from sys import stdin, stdout\r\n\r\nX = list(stdin.readline().strip())\r\n\r\nfor j in range(len(X)):\r\n if X[j] in [\"5\", \"6\", \"7\", \"8\", \"9\"]:\r\n if j==0:\r\n if X[j]==\"9\":\r\n pass\r\n else:\r\n X[j] = str(9 - int(X[j]))\r\n else:\r\n X[j] = str(9 - int(X[j]))\r\n\r\nfor j in X:\r\n stdout.write(f\"{j}\")\r\nstdout.write(\"\\n\") ", "number = input()\r\nresult = str(9-int(number[0])) if number[0] in \"5678\" else number[0]\r\nfor i in number[1:]:\r\n result += str(9-int(i)) if int(i) >= 5 else i\r\n\r\nprint(result)", "from math import *\r\nu=input()\r\nj=(u[0],str(9-int(u[0])))[int(u[0])>=5 and u[0]!='9']\r\nfor i in range(1,len(u)):\r\n j+=(u[i],str(9-int(u[i])))[int(u[i])>=5]\r\nprint(j)", "num = input()\r\noutput = \"\"\r\nfor i in range(len(num)):\r\n if int(num[i]) >= 5 and i != 0:\r\n output += str(9 - int(num[i]))\r\n elif i == 0 and int(num[i]) == 9:\r\n output += num[i]\r\n elif i == 0 and int(num[i]) >= 5:\r\n output += str(9 - int(num[i]))\r\n else:\r\n output += num[i]\r\nprint(output)\r\n", "n = input()\r\ninv = 9\r\nm = \"\"\r\n\r\nm += n[0] if n[0] == str(inv) else \"\"\r\nstart = 0 if m == \"\" else 1\r\n\r\nfor j in range(start,len(n)):\r\n i = int(n[j])\r\n m += str(min(i, i if i < 5 else 9-i))\r\n\r\nprint(int(m))", "s = input()\r\nres = [str(min(int(i), 9-int(i))) for i in s]\r\nif(res[0]=='0'):\r\n res[0] = '9'\r\nprint(int(\"\".join(res)))", "a=input()\r\nl1=[]\r\nfor i in range(len(a)):\r\n l1.append(a[i])\r\n\r\nif l1[0]!='9' and l1[0]>'4':\r\n l1[0]=str(9-int(l1[0]))\r\n\r\nfor i in range(1,len(l1)):\r\n if int(l1[i])>4:\r\n l1[i]=str(9-int(l1[i]))\r\n\r\nfor i in l1:\r\n print(i,end=\"\")\r\n", "n=input()\nl=''\nif n[0]=='9':\n l=\"9\"\n n=n[1:]\nwhile len(n)>0:\n if int(n[0])>=9-int(n[0]):\n l+=str(9-int(n[0]))\n n=n[1:]\n else:\n l+=n[0]\n n=n[1:]\n\nprint(int(l))", "n=int(input())\r\nMit=\"\"\r\ns=str(n)\r\nfor i in range(len(s)):\r\n x=int(s[i])\r\n if x>4:\r\n Mit=Mit+str(9-x)\r\n else:\r\n Mit=Mit+str(x)\r\nif Mit[0]=='0':\r\n Mit=Mit.replace('0','9',1)\r\nprint(Mit)\r\n \r\n", "n=int(input())\r\nnew=''\r\nif n==9:\r\n print(9)\r\nelse:\r\n o=str(n)\r\n for i in range(len(o)):\r\n if i==0 and o[i]=='9':\r\n new+='9'\r\n continue\r\n if (i!=0 and o[i]=='9') or 9-int(o[i])<int(o[i]):\r\n new+=str(9-int(o[i]))\r\n else:\r\n new+=o[i]\r\n print(new)", "def changeDigit(t):\r\n return str(ord('9')- ord(t))\r\n\r\n\r\nx= list(input())\r\nfor i in range(len(x)):\r\n if(i==0):\r\n if(x[i]=='9'):\r\n continue\r\n y= changeDigit(x[i])\r\n if(int(x[i])> int(y)):\r\n x[i]= y\r\nprint(''.join(x))", "n = (input())\r\nl = []\r\nfor i in range(len(n)):\r\n l.append(int(n[i]))\r\nif len(l)==1:\r\n if l[0]>=5 and l[0]!=9:\r\n print(9-l[0])\r\n elif l[0]==9:\r\n print(9)\r\n else:\r\n print(l[0])\r\nelse:\r\n if l[0]>=5 and l[0]!=9:\r\n l[0] = (9-l[0])\r\n elif l[0]==9:\r\n pass\r\n else:\r\n pass\r\n for i in range(1, len(l), 1):\r\n if l[i]>=5:\r\n l[i]=9-l[i]\r\n else:\r\n pass\r\n for i in range(len(l)):\r\n l[i]= str(l[i])\r\n ans = ''.join(l)\r\n print(int(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", "n = [min(int(i), 9-int(i)) for i in input()]\r\nif n[0] < 1:n[0]=9\r\nprint(*n, sep='')", "d=int;i=0\r\nfor c in input():\r\n print([9,[c,9-d(c)][d(c)>4]][i or c!='9'],end='');i=1", "n = input()\r\nn_list = list(n) \r\nfor x in range(len(n_list)):\r\n if n_list[x] > '4':\r\n n_list[x] = str(9 - int(n_list[x]))\r\n\r\nif n_list[0] == '0':\r\n n_list[0] = '9'\r\nresult = \"\"\r\nfor x in n_list:\r\n result = result + x\r\nprint(result)", "n = input()\r\nif n[0] != '9':\r\n if int(n[0]) > 4:\r\n s = 9 - int(n[0])\r\n else:\r\n s = n[0]\r\nelse:\r\n s = n[0]\r\n \r\ns = str(s)\r\nfor i in range(1, len(n)):\r\n if int(n[i]) > 4:\r\n s = s + str(9 - int(n[i]))\r\n else:\r\n s = s + n[i]\r\n\r\nprint(s)\r\n", "from functools import lru_cache\r\nfrom collections import defaultdict, deque\r\nclass Solution:\r\n def chewbacca(self, num):\r\n # TODO write an algorithm here\r\n lst = []\r\n while num > 0:\r\n lst.append(num%10)\r\n num //= 10\r\n for i in range(len(lst)):\r\n lst[i] = min(lst[i], 9 - lst[i])\r\n if lst[-1] == 0:\r\n lst[-1] = 9\r\n \r\n lst = lst[::-1]\r\n return int(\"\".join([str(i) for i in lst]))\r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n num = int(input())\r\n print(solution.chewbacca(num))", "number = input()\r\n\r\nfor i in range(len(number)):\r\n \r\n if (i == 0 and number[0] == \"9\"):\r\n continue\r\n \r\n if (ord(number[i]) >= ord('5')):\r\n temp = ord('0') + (ord('9') - ord(number[i]))\r\n temp = chr(temp)\r\n number = number[: i] + temp + number[i + 1 :]\r\n \r\n \r\nprint(number)", "tc = input()\r\nans = ''\r\n\r\nfor i in range(len(tc)):\r\n \r\n if int(tc[i])>=5 and not (i == 0 and tc[i] == '9'):\r\n ans+=str(9 - int(tc[i]))\r\n else:\r\n ans+=tc[i]\r\nprint(ans)", "x = input()\r\nres = \"\"\r\nfor i in x:\r\n res += str(min(int(i),9-int(i)))\r\n\r\nprint(res) if res[0] != \"0\" else print(\"9\" + res[1:])", "n = input()\r\nres = ''\r\nfor i, c in enumerate(n):\r\n if i == 0 and c == \"9\":\r\n res += \"9\"\r\n else:\r\n cInt = int(c)\r\n res += str(min(cInt, 9-cInt))\r\nprint(res)", "a = list(input())\r\nr = ''\r\nfirst = True\r\nfor i in a:\r\n if int(i)== 9 and first: \r\n r+=i\r\n elif int(i) > 4:\r\n r+=str(9-int(i))\r\n else:\r\n r+=i\r\n first = False\r\nprint(r)", "x = input()\r\nres = \"\"\r\nfor number in x:\r\n if 9 - int(number) < int(number):\r\n res += str(9 - int(number))\r\n else:\r\n res += number\r\nif x[0] == \"9\":\r\n print(\"9\" + res[1:])\r\nelse:\r\n print(res)", "x = int(input())\r\notv = 0\r\nj = 1\r\nwhile x > 0:\r\n n = x % 10\r\n x = x//10\r\n if n >= 5:\r\n if n == 9 and x == 0:\r\n otv += n * j\r\n else:\r\n otv += (9 - n) * j\r\n else:\r\n otv += n * j\r\n j = j * 10\r\nprint(otv)", "\r\n\r\ndef solve():\r\n\tx = list(map(int, list(input())))\r\n\tans = []\r\n\tfor i in range(len(x)):\r\n\t\tif i == 0 and x[i] == 9:\r\n\t\t\tans.append(9)\r\n\t\telif x[i] > 4:\r\n\t\t\tans.append(9-x[i])\r\n\t\telse:\r\n\t\t\tans.append(x[i])\r\n\r\n\tprint(*ans, sep='')\r\n\r\n\r\nsolve()", "v=[min(int(x),9-int(x)) for x in input()]\r\nif v[0]<1:v[0]=9\r\nprint(''.join(map(str,v)))\r\n", "# https://codeforces.com/problemset/problem/514/A\r\n\r\nfrom typing import List\r\n\r\n\r\ndef main() -> None:\r\n x: str = input()\r\n\r\n result: str = \"\"\r\n\r\n for i, d_str in enumerate(x):\r\n d_int: int = int(d_str)\r\n\r\n if i == 0 and d_int == 9:\r\n result += d_str\r\n continue\r\n\r\n if d_int > 4:\r\n result += str(9 - d_int)\r\n continue\r\n result += d_str\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\na=str(n)\r\nr=0\r\nwhile n:\r\n d=n%10\r\n if d>4:\r\n d=9-d\r\n r=r*10+d\r\n n//=10\r\n\r\nif not(r%10):\r\n r+=9\r\nif len(str(r))!=len(a):\r\n print(int(str(r)[::-1])*10**(len(a)-len(str(r))) )\r\nelse:\r\n print(int(str(r)[::-1]))\r\n\r\n", "a = input()\r\nans = ''\r\nif a[0] == '9':\r\n ans += '9'\r\nelse:\r\n if int(a[0]) > 4:\r\n ans += str(9 - int(a[0]))\r\n else:\r\n ans += a[0]\r\nfor i in range(1, len(a)):\r\n if int(a[i]) > 4:\r\n ans += str(9 - int(a[i]))\r\n else:\r\n ans += a[i]\r\nprint(ans)", "a = input()\r\nb = ''\r\nfor i in range(len(a)) :\r\n if(a[i] >= '5') :\r\n temp = chr(ord('0')+ord('9')-ord(a[i]))\r\n b = b+temp\r\n else :\r\n b = b+a[i]\r\nif(b[0] == '0') :\r\n print('9',end = '')\r\nelse :\r\n print(b[0],end = '')\r\nprint(b[1:])\r\n\r\n", "s = input()\r\n\r\n# mx = max(s)\r\n# int_mx = int(mx)\r\n# new = str(9-int_mx)\r\n# # print(new)\r\n# ans = s\r\n# s = s.replace(mx, new)\r\n# # print(s)\r\n# if ans=='9':\r\n# \tprint(9)\r\n# elif len(s)==1:\r\n# \tprint(1)\r\n# \t# it = int(ans[0])\r\n# \t# print(it)\r\n# \t# print(9-it)\r\n# else:\r\n# \tprint(s)\r\n\r\nans = ''\r\nfor i in range(len(s)):\r\n\tif i==0 and s[i]=='9':\r\n\t\tans+=s[i]\r\n\telif int(s[i])>9 - int(s[i]):\r\n\t\tans+=str(9-int(s[i]))\r\n\telse:\r\n\t\tans+=s[i]\r\nprint(ans)", "no=input()\r\nres=''\r\nfor i in range(len(no)):\r\n if (int(no[i])<5) or (int(no[i])==9 and i==0):\r\n res+=no[i]\r\n else:\r\n temp=9-int(no[i])\r\n res+=str(temp)\r\nprint(res)", "import math\r\ndef fact(n):\r\n ans = 1\r\n for i in range(2, n+1):\r\n ans*= i\r\n return ans\r\ndef comb(n, c):\r\n return fact(n)//(fact(n-c)*c)\r\n \r\ns = list(str(input()))\r\nfor i in range(len(s)):\r\n if(s[i]=='9' and i == 0):\r\n continue\r\n if(int(s[i]) > 4):\r\n s[i]= str(9-int(s[i]))\r\nprint(''.join(s))", "s=input()\r\nstring=\"\"\r\n\r\nif(int(s[0])==9):\r\n string+=\"9\"\r\nelse:\r\n if(int(s[0])>=(9-int(s[0]))):\r\n string+=str(9-int(s[0]))\r\n else:\r\n string+=s[0]\r\nfor i in range(1,len(s)):\r\n if(int(s[i])>=(9-int(s[i]))):\r\n string+=str(9-int(s[i]))\r\n else:\r\n string+=s[i]\r\n\r\nprint(string)", "# cook your dish here\r\nx = input()\r\nresult = \"\"\r\n\r\nfor i, d in enumerate(x):\r\n digit = int(d)\r\n if i == 0 and digit == 9:\r\n result += str(digit)\r\n else:\r\n inverted_digit = min(digit, 9 - digit)\r\n result += str(inverted_digit)\r\n\r\nif result[0] == '0':\r\n result = result[1:]\r\n\r\nprint(result)\r\n", "x = list(input())\r\nif x[0] == '9':\r\n s = x[1:]\r\nelse:\r\n s = x\r\nfor i in range(len(s)):\r\n if int(s[i])<5:\r\n continue\r\n else:\r\n s[i]=str(9-int(s[i]))\r\nif len(s)==len(x):\r\n print(''.join(s))\r\nelse:\r\n print(x[0],end='')\r\n print(''.join(s))", "number=input()\r\nn=int(number)\r\n#first_digit=number[0]\r\narr=[]\r\n\r\nwhile n!=0:\r\n r=n%10\r\n n=n//10\r\n arr.append(r)\r\n\r\nans=0\r\n\r\narr.reverse()\r\n#print(arr)\r\nif (9-arr[0])!=0 and (9-arr[0])<arr[0]:\r\n ans=ans*10+(9-arr[0])\r\nelse:\r\n ans=ans*10+arr[0]\r\nln=len(arr)\r\n\r\nfor i in range (1,ln,1):\r\n if (9-arr[i])<arr[i]:\r\n ans=ans*10+(9-arr[i])\r\n else:\r\n ans=(ans*10)+arr[i]\r\n \r\n\r\n\r\nprint(ans)\r\n ", "x=int(input())\r\n\r\nnum=str(x)\r\n# num = ''.join(sorted(s))\r\n\r\nans=\"\"\r\n# print(num[0])\r\n\r\n# if(num[0]=='9'):\r\n# ans+=num[0]\r\n\r\nfor i in range(len(num)):\r\n temp=int(num[i])\r\n temp1=9-temp\r\n\r\n if(i==0 and num[i]=='9'):\r\n ans+=num[i]\r\n\r\n elif(9-temp<=temp):\r\n ans=ans+str(temp1)\r\n # i=str(temp1)\r\n else:\r\n ans+=str(temp)\r\n\r\nres=int(ans)\r\nprint(res)\r\n\r\n\r\n", "num = input()\r\nres = []\r\nfor i in range(len(num)):\r\n if i == 0 and 9 - int(num[i]) == 0:\r\n res.append(num[i])\r\n else:\r\n val = int(num[i])\r\n res.append(num[i] if val < 9 - val else str(9-val))\r\n\r\nprint(\"\".join(res))", "a = list(map(int,list(input())))\r\nif a[0] != 9 :\r\n a[0] = min(a[0] , 9 - a[0])\r\n \r\nans = str(a[0])\r\nfor i in range(1 , len(a)):\r\n a[i] = min(a[i] , 9 - a[i])\r\n ans = ans + str(a[i])\r\n \r\nprint(ans)", "n=input()\r\nans=\"\"\r\ni=0\r\n\r\nfor i in range(len(n)):\r\n if i==0 and n[i]==\"9\":\r\n ans+=\"9\"\r\n continue\r\n if int(n[i])<=4:\r\n ans+=n[i]\r\n else:\r\n ans+=str(9-int(n[i]))\r\nprint(ans)", "s = input()\r\ntemp = [9 - int(x) if int(x) >= 5 else int(x) for x in s]\r\nif temp[0] == 0:\r\n temp[0] = 9\r\nans = 0\r\nfor i in temp:\r\n ans = 10*ans + i\r\nprint(ans)", "x=list(input())\r\no=\"\"\r\nfor i in range(len(x)):\r\n s= int(x[i])\r\n s=str(min(s,9-s))\r\n o+= \"9\" if i==0 and s==\"0\" else s\r\n\r\nprint(int(o))", "stt = input()\r\n\r\nn = len(stt)\r\nans = ''\r\n\r\nfor i in range(n-1,0,-1):\r\n if stt[i]>'4':\r\n ans = str(9-int(stt[i])) + ans\r\n else:\r\n ans = stt[i] + ans\r\n\r\nif stt[0]>'4' and stt[0]<'9':\r\n print(str(9-int(stt[0]))+ans)\r\nelse:\r\n print(stt[0]+ans)", "n = int(input()) \r\nx = str(n) \r\nans = 0 \r\npo = 10\r\nl = len(x) \r\nfor i in range (l): \r\n y = int(x[i])\r\n if i == 0 : \r\n if int(x[0]) >= 5 and int(x[0]) != 9 : \r\n y = 9 - y \r\n ans = ans*po + y \r\n \r\n else:\r\n if y >= 5 : \r\n y = 9 - y \r\n ans = ans*po + y \r\n \r\nprint(ans) ", "num=int(input())\r\nres=list(str(num))\r\nfor i,n in enumerate(res):\r\n if i==0 and n==\"9\":\r\n continue\r\n if 9-int(n)<int(n):\r\n res[i]=9-int(n)\r\nfor i,n in enumerate(res):\r\n res[i]=str(n)\r\nif num==9:\r\n print(9)\r\nelse:\r\n print(int(\"\".join(res)))\r\n", "def yzd_solution(x):\r\n n = \"\"\r\n for i in str(x):\r\n y = 9 - int(i)\r\n n += str(y) if y < int(i) else str(i)\r\n\r\n if n[0] == \"0\": n = \"9\" + n[1:]\r\n print(n)\r\n\r\n\r\nx = int(input())\r\nyzd_solution(x)", "x = input() # قراءة العدد\r\n\r\n# تحويل العدد إلى قائمة من الأرقام\r\ndigits = [int(digit) for digit in x]\r\n\r\n# تحويل الأرقام وفقًا للقاعدة المحددة\r\nif digits[0] >= 5:\r\n digits[0] = 9 - digits[0]\r\n\r\nfor i in range(1, len(digits)):\r\n if digits[i] >= 5:\r\n digits[i] = 9 - digits[i]\r\n\r\n# إزالة الأصفار الزائدة من اليسار\r\nif digits[0] == 0:\r\n digits[0] = 9\r\n\r\n# تحويل القائمة إلى سلسلة\r\nresult = ''.join(str(digit) for digit in digits)\r\n\r\nprint(result)\r\n", "a=int(input())\r\ni=0\r\nb=0\r\nwhile a>=10:\r\n if a%10>=5:\r\n b+=(9-a%10)*10**i\r\n else:\r\n b+=(a%10)*10**i\r\n a//=10\r\n i+=1\r\nif a==9 or a<=4:\r\n print(b+a*10**i)\r\nelse:\r\n print(b+(9-a)*10**i)", "a = input()\nb = ''\nl1 = a[0]\nl2 = a[1:]\ntemp = 9-int(l1[0])\nif(temp==0):\n temp = l1[0]\nelse:\n old = int(temp)\n new = 9-int(temp)\n if(old>new):\n temp=str(new)\n else:\n temp=str(old)\nfor i in l2:\n old = int(i)\n new = 9-int(i)\n if(old>new):\n b+=str(new)\n else:\n b+=str(old)\nprint(str(temp)+b)", "x = input()\r\nres = \"\"\r\nif x[0] == \"9\" or x[0] == \"1\" or x[0] == \"2\" or x[0] == \"3\" or x[0] == \"4\":\r\n res+=x[0]\r\nelse:\r\n num = int(x[0])\r\n res += str(9 - num)\r\nfor i in range(1,len(x)):\r\n s = x[i]\r\n num = int(x[i])\r\n if num >= 5:\r\n s = str(9-num)\r\n res+=s\r\nprint(int(res))\r\n \r\n ", "num = input()\r\nnewNum = \"\"\r\nfor i, digit in enumerate(num):\r\n digit = int(digit)\r\n invertedDigit = 9 - digit\r\n if i == 0 and digit == 9:\r\n newNum += str(digit)\r\n elif digit > invertedDigit:\r\n newNum += str(invertedDigit)\r\n else:\r\n newNum += str(digit)\r\nprint(int(newNum))\r\n", "n=input()\r\nnn=str(n)\r\na=len(nn)\r\nl=[]\r\nvar=\"\"\r\nvam=\"\"\r\nll=[\"8\",\"7\",\"6\",\"5\",\"9\"]\r\nfor i in nn:\r\n l.append(i)\r\nif l[0]==\"9\":\r\n vam=\"9\"\r\nif vam==\"9\":\r\n for i in range(1,a):\r\n if l[i] in ll:\r\n var+=str(9-int(l[i]))\r\n else:\r\n var+=l[i]\r\nelse:\r\n for i in range(a):\r\n if l[i] in ll:\r\n var+=str(9-int(l[i]))\r\n else:\r\n var+=l[i]\r\n \r\n# print(\"vam is\",vam)\r\n# print(\"var is\",var)\r\n\r\nif vam==\"9\" and len(var)>0:\r\n if var==\"00\":\r\n x=(var[0])\r\n print(int(vam+x))\r\n else:\r\n print(int(vam+var))\r\nelif vam==\"\":\r\n print(int(var))\r\nelif var==\"\":\r\n print(int(vam))\r\n", "n = input()\r\nres = []\r\nif n[0] != \"9\":\r\n res.append(str(min(int(n[0]), 9 - int(n[0]))))\r\nelse:\r\n res.append(\"9\")\r\nlon = len(n)\r\nfor i in range(1, lon):\r\n res.append(str(min(int(n[i]), 9 - int(n[i]))))\r\nprint(int(\"\".join(res)))\r\n", "# Username: maheshraju2020\r\n\r\nimport heapq\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom itertools import combinations, permutations\r\nfrom math import ceil, gcd, sqrt\r\nfrom sys import setrecursionlimit, stdin, stdout\r\n\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\ns = is1()\r\n\r\nres = \"\"\r\nt = 0\r\nfor i in s:\r\n invert = 9 - int(i)\r\n if t == 0:\r\n t+=1\r\n if invert == 0:\r\n res+=i\r\n continue\r\n if invert < int(i):\r\n res+=str(invert)\r\n else:\r\n res+=i\r\nprint(res)", "n = input()\r\nresult = ''\r\nfor c in n:\r\n digit = int(c)\r\n if digit >= 5:\r\n digit = 9 - digit\r\n result += str(digit)\r\nif result[0] == '0':\r\n result = '9' + result[1:]\r\nprint(result)", "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 = str(I())\r\n res = ''\r\n for i in range(len(n)):\r\n if i == 0 and n[i] == '9':\r\n res += n[i]\r\n else:\r\n d = int(n[i])\r\n if d > 4:\r\n res += str(9-d)\r\n else:\r\n res += n[i]\r\n return res\r\nif __name__ == '__main__':\r\n print(main())", "n = int(input())\r\ni = 1\r\nsol = 0\r\nwhile(n != 0):\r\n k = 0\r\n if(n // 10 == 0 and n == 9):\r\n sol+= n*i\r\n \r\n else:\r\n if(n % 10 >= 5):\r\n k = 9 - (n % 10)\r\n else:\r\n k = n % 10\r\n sol += k*i\r\n i*= 10\r\n \r\n n = n //10\r\n\r\nprint(sol)", "inp = list(input())\r\nfor index in range(len(inp)) :\r\n key = int(inp[index])\r\n if key >= 5 and not (index == 0 and inp[index] == \"9\") :\r\n inp[index] = str(9 - key)\r\nprint(\"\".join(inp))", "x=input()\r\nans=''\r\nfor i in x:\r\n if int(i)<=4:\r\n ans+=i\r\n else:\r\n if len(ans)==0 and i=='9':\r\n i='0'\r\n ans+=str(9-int(i))\r\nprint(ans)\r\n", "digits = list(map(int,input()))\r\nfor i in range(len(digits)):\r\n if digits[i]==9and i==0:\r\n continue\r\n if 9-digits[i]<digits[i]:\r\n digits[i]=9-digits[i]\r\nprint(*digits,sep=\"\",end=\"\")", "x = input().strip()\nx = list(x)\nn = len(x)\n\n# Check if inverting the first digit is necessary\nif x[0] != '9' and int(x[0]) >= 5:\n x[0] = str(9 - int(x[0]))\n\n# Invert the rest of the digits if necessary\nfor i in range(1, n):\n if int(x[i]) >= 5:\n x[i] = str(9 - int(x[i]))\n\n# Ensure that the number doesn't start with a leading zero\nif x[0] == '0':\n x[0] = '1'\n\nresult = \"\".join(x)\nprint(result)\n\n\t\t\t \t \t \t\t \t\t \t\t \t\t\t\t\t \t\t\t \t", "n = int(input())\r\na = [int(e) for e in list(str(n))]\r\nfor i, v in enumerate(a):\r\n if i == 0 and v == 9:\r\n continue\r\n if v in [5, 6, 7, 8, 9]:\r\n a[i] = 9 - v\r\nx = int(\"\".join(str(e) for e in a))\r\nprint(x)\r\n", "x = input()\r\n\r\nif x[0] == '9':\r\n print(9, end='')\r\nelse:\r\n print(min(9 - int(x[0]), int(x[0])), end='')\r\n\r\nfor i in x[1:]:\r\n print(min(int(i), 9 - int(i)), end='')\r\n", "# t = int(input())\nt = 1\n\n\n\ndef cp():\n x = str(input())\n y = ''\n for i in range(len(x)):\n if (z:=int(x[i])) >= 5:\n if i==0 and x[i]=='9':\n y+=x[i]\n else:\n y+=str(9-z)\n else:\n y+=x[i]\n print(y)\n\n\n \n\n\n\n\n\nfor i in range(t):\n cp()\n", "n = int(input())\r\nnum = str(n)\r\nans = ''\r\nfor i in range(len(num)):\r\n if(num[i] == '5' or num[i] == '6' or num[i] == '7' or num[i] == '8' or num[i] == '9' and i != 0):\r\n ans += str(9 - int(num[i]))\r\n else:\r\n ans += num[i]\r\n\r\nprint(int(ans))", "number = input()\r\n\r\noutput = \"\"\r\n\r\nlead0 = True\r\n\r\nfor digit in number:\r\n if 9-int(digit) < int(digit):\r\n output += str(9-int(digit))\r\n else:\r\n output += digit\r\n\r\n\r\n\r\nif output[0] == \"0\":\r\n output = \"9\" + output[1:]\r\n\r\n\r\n\r\n\r\nprint(output)", "a = list(input())\r\n\r\nfor i in range(len(a)):\r\n if int(a[i]) > 4:\r\n if i > 0:\r\n a[i] = str(9 - int(a[i]))\r\n else:\r\n if int(a[i]) < 9:\r\n a[i] = str(9 - int(a[i]))\r\n\r\nprint(\"\".join(a))", "n=int(input())\r\ns=str(n)\r\narr=[]\r\nfor i in range(len(s)):\r\n if(i==0 and s[i]=='9'):\r\n arr.append(int(s[i]))\r\n continue\r\n if int(s[i])>4:\r\n a=9-int(s[i])\r\n arr.append(a)\r\n else:\r\n a=int(s[i])\r\n arr.append(a)\r\nfor i in arr:\r\n print(i,end='')", "t=input()\nl=[int(i) for i in t]\nfor i in range(1,len(l)):\n if 9-l[i]<l[i]:\n l[i]=9-l[i]\nif(9-l[0]<l[0] and l[0]!=9):\n l[0]=9-l[0]\nprint(''.join(map(str,l)))\n \n \t \t \t\t\t\t \t\t \t \t \t\t\t \t\t\t\t \t", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n ans = \"\"\r\n\r\n for pos, i in enumerate(str(n)):\r\n if pos == 0 and i == '9':\r\n ans += '9'\r\n continue\r\n if int(i) > 4:\r\n ans += str(9 - int(i))\r\n else:\r\n ans += i\r\n\r\n print(int(ans))", "n=int(input())\r\nx=str(n)\r\nans=''\r\nc=0\r\nfor i in x:\r\n if c==0 and int(i)==9:\r\n ans+=i\r\n elif 9-int(i)<int(i):\r\n ans=ans+str(9-int(i))\r\n else:\r\n ans+=i\r\n c+=1\r\nprint(int(ans))", "n = int(input())\r\ns = str(n)\r\nans = \"\"\r\nfor i in range(len(s)):\r\n if int(s[i]) == 9 and i == 0:\r\n ans = ans + s[i]\r\n elif int(s[i]) >= 5:\r\n ans = ans + str(9 - int(s[i]))\r\n else:\r\n ans = ans + s[i]\r\nprint(ans)", "n=int(input())\r\na=str(n)\r\ns=\"\"\r\nif a[0]=='9':\r\n s+='9'\r\nelif 9-int(a[0])<int(a[0]):\r\n s+=str(9-int(a[0]))\r\nelse:\r\n s+=a[0]\r\nfor i in range(1,len(a)):\r\n if 9-int(a[i])<int(a[i]):\r\n s+=str(9-int(a[i]))\r\n else:\r\n s+=a[i]\r\nprint(int(s))", "n = list(map(int, input()))\r\nfor i in range(len(n)):\r\n if i == 0 and n[i] == 9:\r\n continue\r\n if 9 - n[i] < n[i]:\r\n n[i] = 9 - n[i]\r\nprint(\"\".join(list(map(str, n))))", "\r\ns=[min(int(i),9-int(i)) for i in input()]\r\nif s[0]==0:\r\n s[0]=9\r\nprint(*s,sep='')", "#Luke Skywalker gave Chewbacca an integer number x. Chewbacca isn't \r\n#good at numbers but he loves inverting digits in them.\r\n# Inverting digit t means replacing it with digit 9 - t.\r\n#Help Chewbacca to transform the initial number x to the minimum \r\n#possible positive number by inverting some (possibly, zero) digits. \r\n#The decimal representation of the final number shouldn't start with a zero.\r\n\r\n#Input\r\n#The first line contains a single integer x (1 ≤ x ≤ 1018) — \r\n#the number that Luke Skywalker gave to Chewbacca.\r\n\r\n#Output\r\n#Print the minimum possible positive number that Chewbacca can obtain after\r\n#inverting some digits. The number shouldn't contain leading zeroes.\r\ndef invert(s):\r\n num_str = ''\r\n for x in s:\r\n if(int(x) > 4.5):\r\n num_str = num_str + str(9-int(x))\r\n if(int(x) < 4.5):\r\n num_str = num_str + str(x)\r\n return num_str\r\nn = input()\r\nif(n[0] == '9'):\r\n print(int(n[0]+invert(n[1:])))\r\nelse:\r\n print(int(invert(n)))\r\n\r\n", "import sys\r\nimport math\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n\tread: Callable[[], str] = sys.stdin.readline\r\n\tval: str = read().strip()\r\n\tupdated_val = [0] * len(val)\r\n\tfor i, v in enumerate(val):\r\n\t\tint_v: int = int(v)\r\n\t\tinverse_v = 9 - int_v\r\n\t\tif i == 0 and inverse_v == 0:\r\n\t\t\tinverse_v = int_v\r\n\t\tupdated_val[i] = str(min(inverse_v, int_v))\r\n\tprint(''.join(updated_val))\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "s = input()\r\nx = [int(i) for i in s]\r\nx1=list()\r\nfor i in range(len(x)):\r\n if x[i]>4:\r\n if i==0 and x[i]==9:\r\n x1.append(str(9))\r\n else:\r\n x1.append(str(9-x[i]))\r\n else:\r\n x1.append(str(x[i]))\r\ns1 = ''.join(x1)\r\nif s!='9':\r\n print(int(s1))\r\nelse:\r\n print('9')", "n=input()\r\nans=min(9-int(n[0]),int(n[0])) if n[0]!=\"9\" else 9\r\nfor j in range(1,len(n)):\r\n i=int(n[j])\r\n ans=(ans*10)+min(i,9-i)\r\nprint(ans)", "def minimize_number(x):\n digits = [int(digit) for digit in str(x)]\n n = len(digits)\n\n for i in range(n):\n if i == 0 and digits[i] == 9:\n continue # Skip leading zeros\n inverted = 9 - digits[i]\n if inverted < digits[i]:\n digits[i] = inverted\n\n return int(''.join(map(str, digits)))\n\ndef main():\n x = int(input())\n result = minimize_number(x)\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\t \t \t \t", "x=int(input())\r\nl=[]\r\nfor i in str(x):\r\n l.append(int(i))\r\nx=[]\r\nfor i in range(0,len(l)):\r\n if (9-l[i])<l[i]:\r\n x.append(9-l[i])\r\n else:\r\n x.append(l[i])\r\nif l[0]==9:\r\n x[0]=9\r\n\r\n\r\nop=0\r\nle=len(x)-1\r\nfor i in x:\r\n op+=i*(10**le)\r\n le-=1\r\nprint(op)\r\n\r\n", "x = input()\r\nl = [int(i) for i in x]\r\nfor y in range(len(l)) :\r\n if y == 0 and (l[y] == 0 or l[y] == 9):\r\n print(9 , end = \"\")\r\n elif (l[y] >= 0 and l[y] < 5) :\r\n print(l[y] , end = \"\")\r\n else :\r\n print(9-l[y] , end = \"\")", "r=[t for t in input()]\r\nif int(r[0])!=9 :\r\n if 9-int(r[0])<int(r[0]):\r\n r[0]=str(9-int(r[0]))\r\nfor e,tt in enumerate(r[1:]):\r\n if 9-int(tt)<int(tt):\r\n r[e+1]=str(9-int(tt))\r\nprint(int(''.join(r)))", "s = input()\nans = \"\"\nfor i in range(len(s)):\n if i == 0 and s[i] == '9':\n ans += '9'\n continue\n \n if s[i] >= '5':\n ans += str(int('9') - int(s[i]))\n else:\n ans += s[i]\nprint(ans)\n\t \t \t\t \t\t\t \t \t \t \t\t\t \t", "x = input()\r\nresult = \"\"\r\nfor i in range(len(x)):\r\n if i == 0 and x[i] == '9':\r\n result += '9'\r\n else:\r\n result += str(min(int(x[i]), 9 - int(x[i])))\r\nprint(result)", "s=input().replace(\"5\", '4').replace('6', '3').replace('7', '2').replace('8', '1').replace('9', '0');print(s if s[0]!='0' else '9'+s[1:])", "n=input()\r\nans=\"\"\r\nf=0\r\nfor i in n:\r\n f+=1\r\n if int(i)>9-int(i):\r\n if(9-int(i)==0 ) and f==1:\r\n ans+=str(9)\r\n else:\r\n ans+=str(9-int(i))\r\n else:\r\n ans+=i\r\nprint(ans)", "arr = [int(i) for i in input()]\r\nans = 0\r\nfor i in range(len(arr)):\r\n ans*=10\r\n if i==0 and arr[i]==9:\r\n ans+=9\r\n continue\r\n if arr[i]>4: arr[i] = 9-arr[i]\r\n ans+=arr[i]\r\n\r\nprint(ans)", "b = int(input())\r\na = [int(a) for a in str(b)]\r\nc = a[0]\r\n\r\nfor i in range(len(a)):\r\n if 9-a[i] < a[i]:\r\n a[i]=9-a[i]\r\n\r\nif a[0] == 0:\r\n a[0]=c\r\n\r\nfor i in a:\r\n print(i, end = '')", "\r\nf=''\r\nx=input()\r\nfor i in x:\r\n if int(i)>4:\r\n f+=str(9-int(i))\r\n else:\r\n f+=i\r\nif f[0]=='0':\r\n f='9'+f[1:]\r\nprint(int(f))\r\n", "n = list(map(int, list(input())))\r\nfor i in range(len(n)):\r\n\tif n[i] > 4:\r\n\t\tn[i] = 9 - n[i]\r\nif n[0] < 1:\r\n\tn[0] = 9\r\nfor i in n:\r\n print(i, end='')", "s = list(input())\r\nif s[0] != '9':\r\n if int(s[0]) >= 5:\r\n s[0] = str(9 - int(s[0]))\r\nfor i in range(1, len(s)):\r\n\r\n if int(s[i]) >= 5:\r\n s[i] = str(9 - int(s[i]))\r\nprint(''.join(s))", "x = int(input())\r\n\r\nnums, arr = [], []\r\n\r\ntmp = x\r\nwhile tmp > 0:\r\n nums.append(tmp%10)\r\n arr.append(tmp%10)\r\n tmp //= 10\r\n\r\narr.reverse()\r\n\r\nnums.sort(reverse=True)\r\n\r\nfor i in range(len(arr)):\r\n cal = 9 - arr[i]\r\n if (i == 0 and cal == 0) or (cal >= arr[i]):\r\n continue\r\n arr[i] = cal\r\n\r\nprint(\"\".join(map(str,arr)))\r\n\r\n\r\n\r\n", "S = input()\r\nans = \"\"\r\nif S[0] != \"9\" and int(S[0]) > 4:\r\n\tans += str(9-int(S[0]))\r\nelse:\r\n\tans += S[0]\r\nfor i in range(1,len(S)):\r\n\tif int(S[i]) > 4:\r\n\t\tans += str(9-int(S[i]))\r\n\telse:\r\n\t\tans += S[i]\r\n\t\t\r\nprint(ans)\r\n\r\n", "a=(input())\r\nre=\"\"\r\nfor i in range(len(a)):\r\n if(i==0 and int(a[i])==9):\r\n re=re+a[i]\r\n else:\r\n if(9-int(a[i])<int(a[i])):\r\n re=re+str(9-int(a[i]))\r\n else:\r\n re=re+a[i]\r\nprint(re)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 13 00:25:37 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=[*input()]\r\nnum=[]\r\nfor ele in n:\r\n if int(ele)>4:\r\n num.append(str(9-int(ele)))\r\n else:\r\n num.append(ele)\r\nif int(num[0])==0:\r\n num[0]=str(9)\r\n \r\nprint(\"\".join(num))", "def digits(x):\r\n for i in range(len(x)):\r\n a = int(x[i])\r\n if i == 0 and a != 9 and (9 - a) < a:\r\n x = x[:i] + str(9 - a) + x[i+1:]\r\n\r\n elif i != 0 and (9 - a) < a:\r\n x = x[:i] + str(9 - a) + x[i+1:]\r\n print(x)\r\n\r\nx = input()\r\ndigits(x)", "n = list(input())\r\nfor i in range(1, len(n)):\r\n if int(n[i]) > 4:\r\n n[i] = 9 - int(n[i])\r\nif int(n[0]) > 4 and int(n[0]) < 9:\r\n n[0] = 9 - int(n[0])\r\n\r\nans = ''\r\nfor i in n:\r\n ans += str(i)\r\nprint(ans)", "x = list(input())\r\nfor i in range(0, len(x)):\r\n if i == 0 and int(x[i]) == 9:\r\n print(x[i], end=\"\")\r\n continue\r\n elif int(x[i]) > 4:\r\n print(9-int(x[i]), end=\"\")\r\n else:\r\n print(x[i], end=\"\")", "n = input()\r\nj = 0\r\nfor i in n:\r\n j+=1\r\n t = int(i)\r\n if 9-t < t:\r\n if j == 1 and t == 9:\r\n t = t\r\n else:\r\n t = 9-t\r\n print(t, end = \"\")", "s = input()\r\n\r\nans = \"\"\r\nfor num,i in enumerate(s):\r\n if num==0 and i==\"9\":\r\n ans += \"9\"\r\n continue\r\n temp = min(int(i),9-int(i))\r\n ans += str(temp)\r\n\r\nif (s==\"9\"):\r\n print(9)\r\n\r\nelse:\r\n print(ans)", "\r\nn=input()\r\n\r\na=''\r\nfor i in range(0,len(n)):\r\n\r\n if(n[i]=='9' and i==0):\r\n a+=n[i]\r\n elif(int(n[i])>=5):\r\n a+=str(9-int(n[i]))\r\n else:\r\n a+=n[i]\r\nprint(a) \r\n\r\n\r\n", "x = input()\r\nnew_number = ''\r\n\r\nfor t in x:\r\n inverted_t = 9-int(t) \r\n if(len(new_number)>0):\r\n new_number += str(inverted_t) if (inverted_t<int(t) and inverted_t>=0) else t\r\n else:\r\n new_number += str(inverted_t) if (inverted_t<int(t) and inverted_t>0) else t\r\n\r\n \r\n\r\nprint(new_number)\r\n\r\n\r\n\r\n\r\n", "strg = \"\"\r\nhead = True\r\nfor chr in input():\r\n num = int(chr)\r\n if head:\r\n head = False\r\n if num != 9 and num > 4:\r\n num = 9 - num\r\n else:\r\n if num > 4:\r\n num = 9 - num\r\n strg += str(num)\r\nprint(strg)", "string = list(input())\r\nans = \"\"\r\nfor i in range(len(string)):\r\n if i == 0 and string[i] == '9': ans+=string[i]; continue\r\n ans += str(min(int(string[i]), 9-int(string[i])))\r\nprint(ans)", "n=list(map(int,list(input().strip())))\r\nans=0\r\nif n[0]<9 and n[0]>4:\r\n ans=ans*10+(9-n[0])\r\nelse:\r\n ans=ans*10+n[0]\r\nfor i in range(1,len(n)):\r\n if n[i]>4:\r\n ans=ans*10+(9-n[i])\r\n else:\r\n ans=ans*10+n[i]\r\nprint(ans)", "a = [(d, str(9-int(d)))[int(d) > 4] for d in input()]\r\nif a[0] == '0':\r\n a[0] = '9'\r\nprint(int(''.join(a)))\r\n", "n = input()\r\nstring = str(n)\r\n\r\nnew_num = 0\r\n\r\nif string[0]=='9':\r\n new_num = 9\r\n string = string[1:]\r\n\r\nfor digit in string :\r\n digit = int(digit)\r\n if digit >= 5 :\r\n new_num= new_num*10 + (9-digit)\r\n else :\r\n new_num= new_num*10 + (digit)\r\n\r\nprint(new_num)\r\n ", "n = input()\n\nword = \"\"\n\nfor i in range(len(n)):\n d = n[i]\n if i==0:\n if n[i]!=\"9\":\n if int(n[i])>4:\n d = str(9-int(n[i]))\n else:\n if int(n[i])>4:\n d = str(9-int(n[i]))\n word+= d\nprint(word)\n\n", "x=input()\r\nans=''\r\nfor i in range(len(x)):\r\n if i==0 and 4<int(x[i])<9 or i!=0 and int(x[i])>4:\r\n ans+=str(9-int(x[i]))\r\n else:\r\n ans+=x[i]\r\nprint(ans)", "n = input()\nnum = \"\"\n\nfor i in range(len(n)):\n temp = int(n[i])\n\n if temp > 9 - temp:\n temp = 9 - temp\n\n num += str(temp)\n\nif num[0] == \"0\":\n num = num.replace(\"0\", \"9\", 1)\n\nprint(num)", "def number(n):\r\n n=str(n)\r\n s=''\r\n for i in range(len(n)):\r\n p=int(n[i])\r\n if i==0:\r\n if 9-p==0:\r\n s+=str(p)\r\n elif 9-p<p:\r\n s+=str(9-p)\r\n else:\r\n s+=str(p)\r\n else:\r\n if 9-p<p:\r\n s+=str(9-p)\r\n else:\r\n s+=str(p)\r\n print(int(s))\r\nnumber(int(input()))", "def invert(n):\r\n for i in range(len(n)):\r\n if int(n[i]) >= 5:\r\n if i==0 and n[0] == \"9\":\r\n continue\r\n n[i] = str(9-int(n[i]))\r\n\r\n return ''.join(n)\r\n\r\nnum = input()\r\n\r\nprint(invert(list(num)))", " \r\n#import io, os, sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\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 = str(II())\r\npairs = {'5': '4', '6': '3', '7': '2', '8': '1', '9': '0'}\r\n\r\nif n[0] == '9':\r\n ans = '9'\r\n n = n[1:]\r\nelse:\r\n ans = ''\r\n \r\nfor digit in n:\r\n if digit in pairs:\r\n ans += pairs[digit]\r\n else:\r\n ans += digit\r\n \r\nprint(ans)\r\n ", "x = input()\r\n\r\nres = []\r\nfor c in x:\r\n d = int(c)\r\n res.append(str(min(d, 9 - d)))\r\n\r\nif res[0] == '0':\r\n res[0] = '9'\r\nprint(\"\".join(res))\r\n", "q = input()\r\nw = []\r\nfor i in range(len(q)):\r\n if i == 0:\r\n if int(q[i]) == 9:\r\n w.append(\"9\")\r\n else:\r\n if int(q[i]) < 5:\r\n w.append(q[i])\r\n else:\r\n w.append(str(9 - int(q[i])))\r\n else:\r\n if int(q[i]) < 5:\r\n w.append(q[i])\r\n else:\r\n w.append(str(9 - int(q[i])))\r\nr = \"\"\r\nfor j in range(len(w)):\r\n r += w[j]\r\nprint(int(r))", "x = input()\nx = [int(i) for i in x]\nfor i in range(len(x)):\n\tif x[i] > 4 and not(i == 0 and x[i] == 9):\n\t\tx[i] = str(9 - x[i])\n\telse:\n\t\tx[i] = str(x[i])\n \nprint(\"\".join(x))\n \t\t\t \t\t \t \t\t\t\t\t\t\t \t \t\t", "n=int(input())\r\ns=str(n)\r\nk=\"\"\r\nfor i in range(len(s)):\r\n if(i==0):\r\n if(int(s[i])>=5 and int(s[i])<9):\r\n k+=str(9-int(s[i]))\r\n else:\r\n k+=s[i]\r\n \r\n else:\r\n if(int(s[i])>=5 and int(s[i])<=9):\r\n k+=str(9-int(s[i]))\r\n else:\r\n k+=s[i]\r\nprint(int(k))", "n = input()\nanswer = \"\"\ncount = 0\ntp = 0 \nfor i in range(len(n)):\n if int(n[i]) > 4:\n test = str(9-int(n[i]))\n if test == '0' and i == 0:\n answer += n[i]\n else:\n answer += test\n else:\n answer +=n[i]\n \n\n \n\nprint(answer)\n \t \t\t \t\t \t \t\t\t \t \t \t\t\t\t\t", "x = input()\nans = x[0] if x[0] == '9' else str(min(9-int(x[0]), int(x[0])))\nfor i in x[1:]:\n a = int(i)\n if 9 - a < a:\n ans += str(9- a)\n else:\n ans += i\nprint(ans)\n\n\n\n\n\n", "n = input()\r\n\r\ns = \"\"\r\n\r\nfor i in range(len(n)):\r\n a = 9 - int(n[i])\r\n \r\n if a > int(n[i]) or (i == 0 and a == 0) :\r\n \r\n s += n[i]\r\n else:\r\n s += str(a)\r\n \r\nprint(s)\r\n \r\n ", "y = input()\r\nres = \"\"\r\nfor i in range(len(y)):\r\n if i == 0:\r\n if y[i] == \"9\":\r\n res += y[i]\r\n else:\r\n res += str(min(int(y[i]), 9 - int(y[i])))\r\n else:\r\n res += str(min(int(y[i]), 9 - int(y[i])))\r\nprint(res)", "n = list(input())\r\n\r\nfor i,v in enumerate(n):\r\n val = ord(v) - ord(\"0\")\r\n if i == 0 and val == 9:\r\n continue\r\n elif val > 4:\r\n val = 9 - val\r\n n[i] = str(val)\r\n\r\nprint(\"\".join(n))", "x = int(input())\r\ns = str(x)\r\nif int(s[0]) != 9 and int(s[0]) > 9 - int(s[0]):\r\n s = str(9 - int(s[0])) + s[1:]\r\ni = 1\r\nwhile i <= len(s)-1:\r\n t = 9 - int(s[i])\r\n if int(s[i]) > t:\r\n s = s[:i] + str(t) + s[i+1:]\r\n i += 1\r\nprint(int(s))", "x = str(input())\r\nptr = 0\r\nans = ''\r\n\r\nwhile ptr < len(x):\r\n if ptr == 0 and x[ptr] == '9':\r\n ans += x[ptr]\r\n ptr += 1\r\n continue\r\n if 9-int(x[ptr]) < int(x[ptr]):\r\n ans += str(9-int(x[ptr]))\r\n else:\r\n ans += x[ptr]\r\n ptr += 1\r\n\r\nprint(ans)\r\n", "number = list(input())\r\ninverted = number.copy()\r\nfor i in range(len(inverted)):\r\n if (9-int(inverted[i])) < int(inverted[i]):\r\n if i==0 and (9-int(inverted[i]))==0:\r\n continue\r\n else:\r\n inverted[i] = str(9-int(inverted[i]))\r\n \r\nprint(\"\".join(inverted))", "number = list(input())\r\nnew_number = 0\r\n\r\nfor j, i in enumerate(number):\r\n if j == 0 and int(i) == 9:\r\n new_number = 9\r\n else:\r\n new_number = new_number*10 + (int(i) if int(i) < 5 else (9 - int(i)))\r\nprint(new_number)", "n = input()\r\n\r\nif int(n[0]) > 9 - int(n[0]) and 9 - int(n[0]) != 0:\r\n print(str(9 - int(n[0])), end=\"\")\r\nelse:\r\n print(n[0], end=\"\")\r\n\r\nfor i in range(1, len(n)):\r\n if int(n[i]) >= 9 - int(n[i]):\r\n print(9 - int(n[i]), end=\"\")\r\n else:\r\n print(n[i], end=\"\")\r\n", "num = input()\r\nnew_num = \"\"\r\nfor idx, digit in enumerate(num):\r\n if idx == 0 and digit == '9':\r\n new_num += digit\r\n continue\r\n if int(digit) > 4:\r\n new_num += str(9 - int(digit))\r\n else:\r\n new_num += digit\r\n\r\nprint(new_num)", "n=list(input())\nif n[0]!=\"9\":\n n[0]=str(min(int(n[0]),abs(9-int(n[0]))))\nfor i in range(1,len(n)):\n if n[i]>=\"5\":\n n[i]=str(min(int(n[i]),abs(9-int(n[i]))))\nprint(\"\".join(n))", "x = list(map(int, list(input())))\n\nif x[0] == 9:\n ans = '9'\nelse:\n if x[0] > 4:\n ans = str(9-x[0])\n else:\n ans = str(x[0])\n\nfor i in range(1, len(x)):\n if x[i] > 4:\n ans += str(9-x[i])\n else:\n ans += str(x[i])\n\nprint(ans)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ns=list(input())\r\nn=len(s)\r\nfor i in range(n):\r\n\tif i==0 and s[i]==\"9\":\r\n\t\tcontinue\r\n\tif s[i]>\"4\":\r\n\t\ts[i]=str(9-int(s[i]))\r\nprint(\"\".join(s))", "a=[int(x) for x in input()]\r\n\r\n# print(a)\r\n\r\n\r\nfor i in range(len(a)):\r\n\tif i==0 and a[i]==9:\r\n\t\tcontinue\r\n\telif a[i]>4:\r\n\t\ta[i]=9-a[i]\r\n# print(a)\r\nd=\"\"\r\nfor i in a:\r\n\td+=str(i)\r\nprint(int(d))\t", "def chewbacca_and_number(n):\r\n n_list = list(str(n))\r\n for i in range(len(n_list)):\r\n digit = int(n_list[i])\r\n if i == 0 and digit == 9:\r\n continue # Skip the first digit if it's 9\r\n if digit >= 5:\r\n n_list[i] = str(9 - digit)\r\n return int(''.join(n_list))\r\n\r\n# Read the input\r\nn = int(input())\r\n\r\n# Call the function and print the result\r\nresult = chewbacca_and_number(n)\r\nprint(result)", "n=int(input())\r\n\r\n# l=list(map(int,input().split()))\r\n# print(l)\r\n\r\ndigit_list=[int(digit) for digit in str(n)]\r\n\r\nfor i in range(0,len(digit_list)):\r\n t=9-digit_list[i]\r\n if(i==0 and digit_list[0]==9):\r\n \r\n continue\r\n elif(t<digit_list[i] ):\r\n digit_list[i]=t\r\nans=0\r\nfor j in digit_list:\r\n ans=ans*10+j\r\nprint(ans)", "\"\"\"\nhttps://codeforces.com/problemset/problem/514/A\n\"\"\"\n\nd = {\"9\": \"0\", \"8\": \"1\", \"7\": \"2\", \"6\": \"3\", \"5\": \"4\"}\nx = input()\n\nif x[0] != \"9\" and x[0] in d:\n res = d[x[0]]\nelse:\n res = x[0]\nfor l in x[1:]:\n if l in d:\n res += d[l]\n else:\n res += l\nprint(res)\n", "def solve(n):\r\n l = len(n)\r\n ans = \"\"\r\n for i in range(l):\r\n ele = int(n[i])\r\n if i==0 and ele==9:\r\n ans+=n[i]\r\n elif ele>4:\r\n ans+=str(9-ele)\r\n else:\r\n ans+=n[i]\r\n print(ans)\r\n\r\nn = input()\r\nsolve(n)", "x=int(input())\r\nnum=list(str(x))\r\nn=len(num)\r\noutput=0\r\nfor i in range(n):\r\n if int(num[i])>4.5:num[i]=9-int(num[i])\r\n else:num[i]=int(num[i])\r\nif num[0]==0:num[0]=9\r\nfor i in range(n):\r\n output+=num[i]*(10**(n-i-1))\r\nprint(output)\r\n", "n = input()\r\nans = \"9\" if(n[0] == \"9\") else str(min(9 - int(n[0]), int(n[0])))\r\nfor i in range(1, len(n)):\r\n if(int(n[i]) >= 5) :\r\n ans += str(9 - int(n[i])) \r\n else :\r\n ans += n[i]\r\nprint(ans)\r\n \r\n", "x=input()\nr = \"\"\nfor i in range(len(x)):\n n = int(x[i])\n b=9-n\n if b < n and b >= 0:\n if i == 0 and b > 0:\n r += str(b)\n elif i > 0:\n r += str(b)\n else:\n r += str(n)\n else:\n r += str(n)\n\nprint(r)\n\n\t\t\t\t \t \t \t \t\t \t \t", "import math\r\n\r\nnumberIn = input()\r\n\r\ni = 0\r\n\r\nnumberList = []\r\n\r\nwhile i < len(numberIn):\r\n a = int(numberIn[i])\r\n if a > 4:\r\n if a == 9 and i == 0:\r\n pass\r\n else:\r\n a = 9 - a\r\n numberList.append(str(a))\r\n i = i + 1\r\n\r\nprint(\"\".join(numberList))\r\n", "a=int(input())\r\na=str(a)\r\nmin=10\r\nfor i in range(0,len(a)):\r\n b=int(a[i])\r\n c=b\r\n if c>9-b:\r\n if i==0 and b==9:\r\n print(9,end=\"\")\r\n else:\r\n print(9-b,end=\"\")\r\n else:\r\n print(b,end=\"\")", "num = input()\r\n\r\nif 5 <= int(num[0]) <= 8: print(9 - int(num[0]), end = \"\")\r\nelse: print(num[0], end = \"\") \r\nfor x in num[1:]: print(9-int(x) if int(x) > 9-int(x) else x, end = \"\")", "i=input()\r\na=0\r\nstr1=\"\"\r\nfor x in i:\r\n a=9-int(x)\r\n if a >int(x):\r\n str1+=x\r\n continue\r\n else:\r\n str1+=str(a)\r\nlist1=[]\r\nlist1.extend(str1)\r\nif list1[0]==\"0\":\r\n list1[0]=\"9\"\r\nstr2=\"\"\r\nstr2=\"\".join(list1)\r\nprint(str2)", "s = input()\ni = 0\n\nif s[i] == '9':\n i += 1\n\nwhile i < len(s):\n if s[i] >= '5':\n s = s[:i] + str(9 - int(s[i])) + s[i+1:]\n i += 1\n\nprint(s)\n\n \t\t \t \t\t \t \t \t", "def solve():\r\n x=input()\r\n ans=0\r\n d=1\r\n for i in range(len(x)-1,0,-1):\r\n t=int(x[i])\r\n ans+= min(t,9-t)*d\r\n d=d*10\r\n t=int(x[0])\r\n if t==9:\r\n ans+=9*d\r\n else:\r\n ans+=min(t,9-t)*d\r\n print(ans)\r\n\r\nsolve()", "number = input()\r\nf_num = \"\"\r\nfor i, n in enumerate(number):\r\n num = int(n)\r\n inverted_num = 9 - num\r\n if inverted_num < num and (inverted_num > 0 or i > 0):\r\n f_num += str(inverted_num)\r\n else:\r\n f_num += n\r\n\r\nprint(f_num)\r\n\r\n" ]

[ "total = 0\n\ndef solve(A, B, next):\n global s\n global t\n\n total = 0\n\n for iord in range(ord('A'), ord('Z') + 1):\n i = chr(iord)\n\n if (i not in A) or (i not in B):\n continue\n\n SP = [0 for _ in range(len(s) + 5)]\n\n for j in B[i]:\n SP[j] += len(t) - j\n\n for j in range(len(t) - 1, -1, -1):\n SP[j] += SP[j + 1]\n \n for j in A[i]:\n total += (j + 1) * (SP[j + (1 if next else 0)])\n\n return total\n\n\nn = int(input())\ns = input()\nt = input()\nA = {}\nB = {}\nfor i in range(len(s)):\n if s[i] not in A:\n A[s[i]] = []\n A[s[i]].append(i)\n if t[i] not in B:\n B[t[i]] = []\n B[t[i]].append(i)\n\ntotal += solve(A, B, False)\ntotal += solve(B, A, True)\n\ncnt = 0\nfor i in range(1, len(s) + 1):\n a = len(s) - i + 1\n b = len(t) - i + 1\n cnt += a * b\n\n# print(total)\n# print(cnt)\nprint(total / cnt)\n \t\t \t \t\t \t \t \t\t\t \t \t \t \t", "n = int(input())\r\na = input()\r\nb = input()\r\nsum_val = 0.0\r\ns = [0.0] * 26\r\nfor i in range(n):\r\n s[ord(a[i]) - ord('A')] += (i + 1)\r\n sum_val += s[ord(b[i]) - ord('A')] * (n - i)\r\ns = [0.0] * 26\r\nfor i in range(n - 1, -1, -1):\r\n sum_val += s[ord(b[i]) - ord('A')] * (i + 1)\r\n s[ord(a[i]) - ord('A')] += (n - i)\r\ntotal = sum(i * i for i in range(1, n + 1))\r\nprint(sum_val / total)# 1692269324.4962397", "n = int(input())\r\na = input()\r\nb = input()\r\n\r\nN = (n*(n+1)*(2*n+1))//6\r\n\r\npre = [[0]*27 for i in range(n+2)]\r\nsuf = [[0]*27 for i in range(n+2)]\r\n\r\nfor i in range(1, n+1):\r\n pre[i][ord(a[i-1])-ord('A')] = i\r\n\r\nfor i in range(n, 0, -1):\r\n suf[i][ord(a[i-1])-ord('A')] = n-i+1\r\n\r\nfor i in range(1, n+1):\r\n for j in range(26):\r\n pre[i][j] += pre[i-1][j]\r\n\r\nfor i in range(n-1, 0, -1):\r\n for j in range(26):\r\n suf[i][j] += suf[i+1][j]\r\n\r\nres = 0\r\n\r\nfor i in range(1, n+1):\r\n c = ord(b[i-1])-ord('A')\r\n res += pre[i][c]*(n-i+1)+suf[i+1][c]*i\r\n\r\nprint(res/N)" ]

[ "import os, sys\r\nfrom io import BytesIO, IOBase\r\nmod=10**9+7\r\nfrom math import gcd\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n#n,a,b,p,q=map(int,input().split())\r\nn,p=map(int,input().split())\r\na=[0]*n\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n l-=1\r\n a[i]=(r//p-l//p)/(r-l)\r\nans=0\r\nfor i in range(n-1):\r\n ans+=1-(1-a[i])*(1-a[i+1])\r\nans+=1-(1-a[-1])*(1-a[0])\r\nans*=2000\r\nprint(ans)", "n,p=map(int,input().split())\r\nnum=[]\r\nfor _ in range(n):\r\n l,r=map(int,input().split())\r\n right=r//p\r\n left=(l-1)//p\r\n num.append((right-left,r-l+1))\r\nans=0\r\nfor i,(p,q) in enumerate(num):\r\n p1=(p/q)\r\n i+=1\r\n i%=n\r\n p,q=num[i]\r\n p2=p/q\r\n t=p1+p2-p1*p2\r\n ans+=t*2000\r\nprint(ans)", "n, p = map(int, input().split())\n\na = []\nfor _ in range(n):\n l, r = map(int, input().split())\n a.append((r // p - (l - 1) // p) / (r - l + 1))\n\nprint(2000 * sum(1 - (1 - a[(i + 1) % n]) * (1 - a[i]) for i in range(n)))\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN,P = map(int,input().split())\nk = []\n \nfor i in range(N):\n l,r = map(int,input().split())\n num = r//P-(l-1)//P\n k.append(num/(r-l+1))\n \nval = 0\nfor i in range(N):\n val+=4*k[i]\n val-=2*k[i]*k[i-1]\n \nprint(1000*val)\n", "n,m=map(int,input().split())\r\ndef f():\r\n\ta, b=map(int,input().split())\r\n\treturn (b // m - (a - 1) // m) / ( b - a + 1)\r\na=[f() for _ in range(n)]\r\nr=0\r\nfor i in range(n):\r\n\tr+=1-(1-a[i])*(1-a[(i+1)%n])\r\nprint(r*2000)", "import sys\ninput = sys.stdin.readline\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 count_p(A, B, p):\n return B//p-(A-1)//p\n\n\ndef solve():\n n, p = read_ints()\n lr = []\n for _ in range(n):\n lr.append(read_ints())\n total = 0\n for i in range(n):\n left_p = count_p(lr[i][0], lr[i][1], p)\n j = (i+1)%n\n right_p = count_p(lr[j][0], lr[j][1], p)\n total += ((lr[i][1]-lr[i][0]+1)*right_p+(lr[j][1]-lr[j][0]+1)*left_p-left_p*right_p)/((lr[i][1]-lr[i][0]+1)*(lr[j][1]-lr[j][0]+1))\n return 2000*total\n\n\nif __name__ == '__main__':\n print(solve())\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport enum\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\nsys.setrecursionlimit(3001)\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, p = map(int, input().split())\r\nvs = []\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n cl = l\r\n t = cl % p\r\n if t:\r\n cl += (p-t)\r\n if cl > r:\r\n vs.append((0, r-l+1))\r\n else:\r\n f1 = (r-cl+p)//p\r\n vs.append((f1, r-l+1-f1))\r\nfz = 0\r\nfor i in range(n):\r\n p1, a1 = vs[(i+n-1) % n]\r\n pcur, acur = vs[i]\r\n fz += (pcur*(p1+a1)+acur*p1)*2000/(p1+a1)/(pcur+acur)\r\nprint(fz)\r\n", "if __name__ == '__main__':\r\n n, p = map(int, input().split())\r\n sharks = []\r\n for _ in range(n):\r\n l, r = map(int, input().split())\r\n l_p = l + (-l) % p\r\n r_p = r - r % p\r\n if l_p <= r_p:\r\n count = (r_p - l_p) // p + 1\r\n else:\r\n count = 0\r\n sharks.append(count / (r - l + 1))\r\n\r\n s = 0\r\n for i in range(n):\r\n s += 2000 * (sharks[i] * (1 - sharks[(i + 1) % n]) +\r\n sharks[i] * sharks[(i + 1) % n] +\r\n (1 - sharks[i]) * (sharks[(i + 1) % n]))\r\n print(s)\r\n", "def e(l1, r1, l2, r2, p):\r\n nonprimes_1 = (r1 - l1 + 1) - (r1 // p) + ((l1 - 1) // p)\r\n nonprimes_2 = (r2 - l2 + 1) - (r2 // p) + ((l2 - 1) // p)\r\n return 1 - ((nonprimes_1 * nonprimes_2) / ((r1 - l1 + 1) * (r2 - l2 + 1)))\r\n\r\ndef main():\r\n n, p = map(int, input().split())\r\n l_r = [tuple(map(int, input().split())) for _ in range(n)]\r\n ans = 0\r\n for i in range(n):\r\n ans += e(*l_r[i], *l_r[(i + 1) % n], p)\r\n \r\n print(ans * 2000)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, p = map(int, input().split())\n\ns = []\nfor _ in range(n):\n l, r = map(int, input().split())\n s.append((r // p - (l - 1) // p) / (r - l + 1)) # вероятность, что число из [l; r] делится на p\n\nans = 0\nfor i in range(n):\n # вычтем из единицы вероятность того, что числа у двух соседних акул не делятся на p\n ans += 1 - (1 - s[(i + 1) % n]) * (1 - s[i]) # вероятность, что произведение делится на p\n\nprint(2000 * ans)\n\n'''\nA_i - пара акул (i, i+1) успешная\nНайдем математическое ожидание суммы индикаторных случайных величин 1_A по всем парам акул.\nОно покажет число успешных пар акул. Каждая из них получит по тысяче.\nОтвет: 2000 * sum(E[1_A] по всем парам акул) \n'''\n", "n, p = map(int, input().split())\r\n\r\n\r\ndef prob(l, r, p):\r\n a = l % p\r\n b = r % p\r\n n = (r - l) // p\r\n if a > b or a == 0 or b == 0:\r\n n += 1\r\n return n / (r - l + 1)\r\n\r\n\r\npr = list()\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n pr.append(prob(l, r, p))\r\nk = pr[-1] * pr[0]\r\nfor i in range(n - 1):\r\n k += pr[i]*1.0 * pr[i + 1]*1.0\r\nprint(2000.0 * (2.0 * sum(pr) - k))\r\n\r\n", "from math import ceil, floor\r\n\r\n\r\ndef add_expect(p1, p2, p3):\r\n global expectation\r\n zero_prob = (1 - p1) * (1 - p2) * (1 - p3)\r\n th_prob = (1 - p1) * (1 - p2) * p3 + p1 * (\r\n 1 - p2) * (1 - p3)\r\n two_th_prob = 1 - zero_prob - th_prob\r\n expectation += th_prob + 2 * two_th_prob\r\n\r\n\r\nn, p = map(int, input().split())\r\nprob, expectation = [0] * n, 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n down, up = ceil(l / p), floor(r / p)\r\n prob[i] = (up - down + 1) / (r - l + 1)\r\n if i == 0 or i == 1:\r\n continue\r\n add_expect(prob[i - 2], prob[i - 1], prob[i])\r\nadd_expect(prob[n - 2], prob[n - 1], prob[0])\r\nadd_expect(prob[n - 1], prob[0], prob[1])\r\nprint(1000 * expectation)\r\n", "\r\n\r\nn,p=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n arr.append((r//p-(l-1)//p,r-l+1))\r\nmoney=0.0\r\nfor i in range(n):\r\n # long x=array[(i+1)%n].b*array[i].a+(array[i].b-array[i].a)*array[(i+1)%n].a;\r\n #money+=1000*x/(double)(array[i].b*array[(i+1)%n].b);\r\n x= arr[(i+1)%n][1]*arr[i][0]+(arr[i][1]-arr[i][0])*arr[(i+1)%n][0]\r\n money+=1000.0*x/(arr[i][1]*arr[(i+1)%n][1])\r\n l=i-1;\r\n if(l<0):l=n-1\r\n x = arr[i][1] * arr[l][0] + (arr[l][1] - arr[l][0]) * arr[i][0]\r\n money += 1000.0 * x / (arr[l][1] * arr[i][1])\r\nprint(money)\r\n\r\n\r\n", "n, p = map(int, input().split())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(y - x + 1)\r\n b.append((y // p) - ((x - 1) // p))\r\nprint(sum([1 - (((a[i] - b[i]) / a[i]) * ((a[(i + 1) % n] - b[(i + 1) % n]) / a[(i + 1) % n])) \r\n for i in range(n)]) * 2000)\r\n", "from math import ceil, floor\r\n\r\n\r\ndef add_expect(p1, p2, p3):\r\n global expectation\r\n zero_prob = (1 - p1) * (1 - p2) * (1 - p3)\r\n th_prob = (1 - p1) * (1 - p2) * p3 + p1 * (\r\n 1 - p2) * (1 - p3)\r\n two_th_prob = 1 - zero_prob - th_prob\r\n expectation += 1000 * th_prob + 2000 * two_th_prob\r\n\r\n\r\nn, p = map(int, input().split())\r\nprob = [0] * n\r\nexpectation = 0\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n down = ceil(l / p) if l % p != 0 else l // p\r\n up = floor(r / p) if r % p != 0 else r // p\r\n prob[i] = (up - down + 1) / (r - l + 1)\r\n if i == 0 or i == 1:\r\n continue\r\n add_expect(prob[i - 2], prob[i - 1], prob[i])\r\nadd_expect(prob[n - 2], prob[n - 1], prob[0])\r\nadd_expect(prob[n - 1], prob[0], prob[1])\r\nprint(expectation)\r\n", "from sys import stdin\r\ninp = stdin.readline\r\nn, p = map(int, inp().split())\r\ndef cnt(l, r):\r\n return r // p - l // p if l % p else r // p - l // p + 1\r\ndef pb(l, r):\r\n return cnt(l, r) / (r - l + 1)\r\nw = [pb(*map(int, inp().split())) for _ in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n ans += 2 * w[i] - w[i] * w[(i + 1) % n]\r\nprint(ans * 2000)", "import collections\r\nimport heapq\r\nimport sys\r\nimport math\r\nimport itertools\r\nimport bisect\r\nfrom io import BytesIO, IOBase\r\nimport os\r\n######################################################################################\r\n#--------------------------------------funs here-------------------------------------#\r\n######################################################################################\r\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\r\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\r\ndef inp(): return int(sys.stdin.readline())\r\ndef instr(): return sys.stdin.readline().strip()\r\ndef words(): return [i for i in sys.stdin.readline().strip().split()]\r\ndef chars(): return [i for i in sys.stdin.readline().strip()]\r\n######################################################################################\r\n#--------------------------------------code here-------------------------------------#\r\n######################################################################################\r\ndef solve():\r\n n,p=values()\r\n l=[]\r\n for i in range(n):\r\n a,b=sorted(values())\r\n ln=b-a+1\r\n d=b//p -(a-1)//p\r\n l.append((ln,d))\r\n l.append(l[0])\r\n ans=0\r\n for i in range(n):\r\n n1,a1=l[i]\r\n n2,a2=l[i+1]\r\n ans+=1-(n1-a1)*(n2-a2)/(n1*n2)\r\n print(ans*2000)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(inp()):\r\n solve()\r\n\r\n\r\n# n, p = [int(x) for x in input().split()]\r\n# Arr = []\r\n \r\n# for i in range(n):\r\n# \ttmp1, tmp2 = [int(x) for x in input().split()]\r\n# \tcnt = tmp2 // p - (tmp1 - 1) // p\r\n# \tArr.append(cnt / (tmp2 - tmp1 + 1))\r\n \r\n# Arr.append(Arr[0])\r\n \r\n# ans = 0.0\r\n \r\n# for i in range(n):\r\n# \tp1 = Arr[i]\r\n# \tp2 = Arr[i + 1]\r\n# \tans += p1 + p2 - p1 * p2\r\n \r\n# print(ans * 2000)", "n,p = map(int, input().split())\r\nncnt = [0] *n\r\ntot = [0] *n\r\nfor i in range(n):\r\n l,r = map(int, input().split())\r\n cnt = r// p - (l - 1)//p;\r\n notcnt = (r - l) + 1 - cnt\r\n tot[i] = (r - l) + 1\r\n ncnt[i] = notcnt;\r\nans = (1 - (ncnt[n-1]/tot[n-1]) *(ncnt[0]/tot[0])) * 2000\r\nfor i in range(1,n):\r\n ans += (1 - (ncnt[i-1]/tot[i-1]) *(ncnt[i]/tot[i])) * 2000\r\nprint(\"%.6f\"% ans)", "R = lambda : map(int, input().split())\nn,p = R()\nit = [tuple(R()) for _ in range(n)]\nit.append(it[0])\n\nlrp = lambda l,r,p : r//p - (l-1)//p\nnp = lambda i : lrp(it[i][0],it[i][1],p)\nli = lambda i : it[i][1]-it[i][0]+1\nev = 0\n\nfor i in range(n):\n p_i = 1 - np(i)*1.0/li(i)\n p_i1 = 1 - np(i+1)*1.0/li(i+1)\n pr = 1-p_i*p_i1\n ev += 2000*pr\nprint(ev)\n\n\n", "def solve(n, p, flowers):\r\n ans = 0\r\n for i in range(n):\r\n l1, r1 = flowers[i - 1]\r\n l2, r2 = flowers[i]\r\n p1 = (r1 // p - (l1 - 1) // p) / (r1 - l1 + 1)\r\n p2 = (r2 // p - (l2 - 1) // p) / (r2 - l2 + 1)\r\n ans += 2000 * (p1 + p2 - p1 * p2)\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n n, p = map(int, input().split())\r\n flowers = [[int(c) for c in input().split()] for _ in range(n)]\r\n ans = solve(n, p, flowers)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\nlines = sys.stdin.readlines()\n(n, p) = map(int, lines[0].strip().split(\" \"))\nranges = []\nfor i in range(1, n+1):\n (l, r) = map(int, lines[i].strip().split(\" \"))\n ranges.append((l,r))\n\nprobs = []\nfor lr in ranges:\n poss = lr[1]//p - (lr[0]-1)//p\n probs.append(poss/(lr[1]-lr[0]+1))\n\nres = 0\nfor i in range(n):\n res += probs[i] + probs[i-1] - probs[i] * probs[i-1]\nprint(res * 2000)", "n, p = map(int, input().split())\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] = y - x + 1\r\n b[i] = (y // p) - ((x - 1) // p)\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans += 1 - (((a[i] - b[i]) / a[i]) * ((a[(i + 1) % n] - b[(i + 1) % n]) / a[(i + 1) % n]))\r\nprint(ans * 2000)", "from math import floor\r\nn,p = input().split()\r\nn,p = int(n),int(p)\r\n\r\nres = 0\r\npb = [0 for i in range(n)]\r\nfor i in range(n):\r\n\ta,b = input().split()\r\n\ta,b = int(a), int(b)\r\n\tpb[i] = 1-(floor(b/p)-floor((a-1)/p))/(b-a+1)\r\n\r\nfor i in range(n):\r\n\tif i==n-1:\r\n\t\tres += 2000*(1-pb[0]*pb[i])\r\n\telse:\r\n\t\tres += 2000*(1-pb[i]*pb[i+1])\r\n\r\nprint(res)\r\n", "n, p = map(int, input().split())\r\nk = list()\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n k.append(((r // p) - (l // p) + (l % p == 0)) / (r - l + 1))\r\ns = 0.0\r\nfor p, q in zip(k, k[1:] + [k[0]]):\r\n s += 2000 * (p + q - p * q)\r\nprint(s)", "import sys;input=sys.stdin.readline\r\n\r\ndef P(l,r,p):\r\n l_min = (l - l%p + p*(l%p!=0))//p\r\n r_min = (r - r%p)//p\r\n return (r_min - l_min + 1)/(r-l+1)\r\n\r\nans = 0\r\n\r\nn,p = map(int,input().strip().split())\r\n\r\n\r\nfor i in range(n):\r\n b = P(*map(int,input().strip().split()),p)\r\n if i == 0:\r\n a0 = b\r\n ans += 4*b\r\n else:\r\n ans += 4*b\r\n ans -= 2*a*b\r\n a = b\r\nans -= 2*a0*b \r\n\r\nprint(ans*1000)\r\n", "num_prime,prime=input().split()\r\nnum_prime=int(num_prime)\r\nprime=int(prime)\r\nprobability=[]\r\nsum=0\r\nfor i in range(num_prime):\r\n lower_temp,upper_temp=input().split()\r\n lower_temp=int(lower_temp)\r\n upper_temp=int(upper_temp)\r\n probability.append(((upper_temp//prime)-((lower_temp-1)//prime))/(upper_temp-lower_temp+1))\r\n \r\n \r\nfor i in range(num_prime-1):\r\n sum+=((probability[i]+probability[i+1])-(probability[i]*probability[i+1]))*2000\r\n \r\nsum+=((probability[0]+probability[-1])-(probability[0]*probability[-1]))*2000\r\nprint(sum)", "\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import *\r\n#from itertools import *\r\n#from operator import itemgetter\r\n#from itertools import count, islice\r\n#from functools import reduce\r\n#alph = 'abcdefghijklmnopqrstuvwxyz'\r\n#dirs = [[1,0],[0,1],[-1,0],[0,-1]]\r\n#from math import factorial as fact\r\n#a,b = [int(x) for x in input().split()]\r\n#sarr = [x for x in input().strip().split()]\r\n#import math\r\n#from math import *\r\n\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(2**30)\r\n#MOD = 10**9+7\r\ndef solve():\r\n n,p = [int(x) for x in input().split()]\r\n prob = []\r\n for i in range(n):\r\n l,r = [int(x) for x in input().split()]\r\n c = r//p - (l-1)//p\r\n prob.append(c/(r-l+1))\r\n \r\n ans = 0\r\n for i in range(n):\r\n p = prob[i]\r\n p1 = 1-p\r\n ans+=1000*(2*p+p1*(prob[i-1]+prob[(i+1)%n]))\r\n print(ans)\r\n\r\ntt = 1#int(input())\r\nfor test in range(tt):\r\n solve()\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n#\r\n", "n,p=map(int, input().split())\r\na=[]\r\nfor i in range(n):\r\n l,r=map(int, input().split())\r\n a.append((r//p-(l-1)//p)/(r-l+1))\r\na.append(a[0])\r\nans=0\r\nfor i in range(n):\r\n ans+=2000*(a[i]*(1-a[i+1])+(1-a[i])*(a[i+1])+(a[i]*a[i+1]))\r\nprint(ans)", "n, p = [int(x) for x in input().split()]\r\nArr = []\r\n \r\nfor i in range(n):\r\n\ttmp1, tmp2 = [int(x) for x in input().split()]\r\n\tcnt = tmp2 // p - (tmp1 - 1) // p\r\n\tArr.append(cnt / (tmp2 - tmp1 + 1))\r\n \r\nArr.append(Arr[0])\r\n \r\nans = 0.0\r\n \r\nfor i in range(n):\r\n\tp1 = Arr[i]\r\n\tp2 = Arr[i + 1]\r\n\tans += p1 + p2 - p1 * p2\r\n \r\nprint(ans * 2000)", "f = lambda: list(map(int, input().split()))\n\nn, p = f()\n\nt = [(l - 1, r) for l, r in [f() for i in range(n)]]\n\nt = [(r // p - l // p) / (r - l) for l, r in t]\n\nprint(2000 * sum(t[i] * (2 - t[i - 1]) for i in range(n)))\n\n\n\n# Made By Mostafa_Khaled", "def read():\r\n return map(int, input().split())\r\n\r\n\r\ndef solve(n, p, flowers):\r\n ans = 0\r\n for i in range(n):\r\n l1, r1 = flowers[i - 1]\r\n l2, r2 = flowers[i]\r\n\r\n div1 = r1 // p - (l1 - 1) // p\r\n div2 = r2 // p - (l2 - 1) // p\r\n\r\n diff1 = r1 - l1 + 1\r\n diff2 = r2 - l2 + 1\r\n\r\n \r\n expectation = div1 / diff1 + div2 / diff2 - div1 * div2 / diff1 / diff2\r\n ans += 2000 * expectation\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n n, p = read()\r\n flowers = []\r\n for _ in range(n):\r\n li, ri = read()\r\n flowers.append((li, ri))\r\n\r\n ans = solve(n, p, flowers)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nfrom heapq import heappush , heappop\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import *\r\n\r\nN,P = map(int, input().split())\r\nA = []\r\nfor _ in range(N):\r\n l,r = map(int, input().split())\r\n A.append((l,r))\r\n \r\ndef deal(l,r):\r\n c1 = (l-1)//P\r\n c2 = r//P\r\n return c2-c1\r\n\r\ndef check(i1,i2):\r\n #print(i1,i2)\r\n l1,r1 = A[i1]\r\n l2,r2 = A[i2]\r\n \r\n t1 = deal(l1,r1)\r\n t2 = deal(l2,r2)\r\n \r\n ans = t1/(r1-l1+1)*t2/(r2-l2+1)*1000\r\n return ans\r\n\r\nans = 0\r\nfor i in range(N):\r\n l,r = A[i]\r\n t = deal(l,r)\r\n tmp = 1000*t/(r-l+1)\r\n ans+=tmp*4\r\n #print('i',i)\r\n ans-=check(i-1,i)\r\n ans-=check(i,(i+1)%N)\r\nprint(ans)", "from sys import stdin ,stdout\r\ninput=stdin.readline\r\ninp = lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end) \r\n\r\n\r\nn , p = inp() ; arr=[] ; ans= 0 \r\nfor i in range(n) : \r\n l , r = inp() \r\n arr.append( 1- (r//p - (l-1)//p) / (r-l+1)) \r\n\r\nfor i in range(n) : \r\n a= i ; b= (i+1)%n \r\n ans += 1- arr[a] * arr[b] \r\nprint(\"{:.6f}\".format(ans * 2000))\r\n \r\n", "n,m=map(int,input().split())\r\ndef f():\r\n\ta,b=map(int,input().split())\r\n\treturn(b//m-(a-1)//m)/(b-a+1)\r\na=[f() for _ in range(n)]\r\nr=0\r\nfor i in range(n):\r\n\tr+=1-(1-a[i])*(1-a[(i+1)%n])\r\nprint(r*2000)", "#import numpy as np\r\n#import math\r\n#import time\r\n\r\ndef NewProbabilidad(a,b,c,d,p): # (a,b) son los extremos del primer intervalo y (c,d) son los extremos del segundo intervalo, p es el numero primo\r\n return ((d-c+1)*(int(b/p)-int((a-1)/p)) + ((b-a+1)*(int(d/p)-int((c-1)/p)) - ((int(b/p)-int((a-1)/p))*(int(d/p)-int((c-1)/p)))))/((b - a + 1)*(d - c + 1))\r\n \r\ndef WetSharkAndFlowers(n, p, SharkMatrix): \r\n i = 0\r\n matrixTemp = []\r\n for i in range(len(SharkMatrix)):\r\n matrixTemp.append([SharkMatrix[i][0], SharkMatrix[i][1]])\r\n matrixTemp.append([SharkMatrix[0][0], SharkMatrix[0][1]])\r\n sumProb = 0\r\n for i in range(len(matrixTemp) - 1):\r\n sumProb += NewProbabilidad(matrixTemp[i][0], matrixTemp[i][1], matrixTemp[i + 1][0], matrixTemp[i + 1][1], p)\r\n sumProb *= 2000\r\n return sumProb\r\n\r\ndef problem621C(): \r\n a, b = input().split()\r\n n = int(a)\r\n p = int(b)\r\n sharkMatrix = []\r\n i = 0\r\n while i < n : \r\n a,b = input().split()\r\n sharkMatrix.append([int(a), int(b)])\r\n i += 1\r\n return WetSharkAndFlowers(n,p,sharkMatrix)\r\n\r\nprint(problem621C())\r\n# \"\"\"\r\n# n = 3\r\n# p = 2\r\n# sharkMatrix = np.zeros((3,2))\r\n# sharkMatrix[0,0] = 1\r\n# sharkMatrix[0,1] = 2\r\n# sharkMatrix[1,0] = 420\r\n# sharkMatrix[1,1] = 421\r\n# sharkMatrix[2,0] = 420420\r\n# sharkMatrix[2,1] = 420421\r\n# \"\"\"\r\n\r\n# \"\"\"n = 3\r\n# p = 5\r\n# sharkMatrix = np.zeros((3,2))\r\n# sharkMatrix[0,0] = 1\r\n# sharkMatrix[0,1] = 4\r\n# sharkMatrix[1,0] = 2\r\n# sharkMatrix[1,1] = 3\r\n# sharkMatrix[2,0] = 11\r\n# sharkMatrix[2,1] = 14\r\n\r\n\r\n# t1 = time.clock()\r\n# asd = WetSharkAndFlowers(n,p,sharkMatrix)\r\n# t2 = time.clock()\r\n# print(asd)\r\n# print(t2 - t1)\r\n# \"\"\"\r\n\r\n# ((d-c+1)*(int(b/p)-int((a-1)/p)) + ((b-a+1)*(int(d/p)-int((c-1)/p)) - ((int(b/p)-int((a-1)/p))*(int(d/p)-int((c-1)/p))))/((b - a + 1)*(d - c + 1))\r\n\r\n\r\n#return ((d - c + 1)*((int(b/p))-(int((a - 1)/p)))+ (b - a + 1)*((int(d/p))-(int((c - 1)/p))) - (((int(b/p))-(int((a - 1)/p)))*(((int(d/p))-(int((c - 1)/p))))/((b - a + 1) * (d - c + 1))\r\n", "n, p = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\n\r\ndef g(x):\r\n global p\r\n # количетво чисел кратных n от 1 до x\r\n return x // p\r\n\r\n\r\ndef f(i, j):\r\n # return (((g(a[i][1]) - g(a[i][0] - 1)) + (g(a[j][1]) - g(a[j][0] - 1)))) / (\r\n # (a[i][1] - a[i][0] + 1) * (a[j][1] - a[j][0] + 1))\r\n pi = (g(a[i][1]) - g(a[i][0] - 1)) / (a[i][1] - a[i][0] + 1)\r\n pj = (g(a[j][1]) - g(a[j][0] - 1)) / (a[j][1] - a[j][0] + 1)\r\n return pi + pj - pi * pj\r\n\r\n\r\nans = 0.0\r\nfor i in range(n):\r\n ans += f(i, (i + 1) % n)\r\nans *= 2000\r\nprint(ans)\r\n", "n, p = map(int, input().split())\r\na = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\ndef divCnt(left, right):\r\n return right // p - (left - 1) // p\r\n\r\nprob = [0] * n\r\nfor i, (left, right) in enumerate(a):\r\n nextLeft, nextRight = a[(i + 1) % n]\r\n cnt1 = divCnt(left, right)\r\n cnt2 = divCnt(nextLeft, nextRight)\r\n sz1 = right - left + 1\r\n sz2 = nextRight - nextLeft + 1\r\n good = cnt1 * sz2 + sz1 * cnt2 - cnt1 * cnt2\r\n prob[i] += good / (sz1 * sz2)\r\nret = 0\r\nfor pr in prob:\r\n ret += 2000 * pr\r\nprint(ret)", "# Thank God that I'm not you.\r\nfrom itertools import permutations, combinations;\r\nimport heapq;\r\nfrom collections import Counter, deque;\r\nimport math;\r\nimport sys;\r\n\r\n\r\n\r\n\r\n\r\nn, p = map(int, input().split())\r\n\r\narray = []\r\n\r\nfor i in range(n):\r\n array.append(list(map(int, input().split())))\r\n\r\n\r\nnumDiv = [];\r\n\r\nfor l, r in array:\r\n total = (r) // p;\r\n part = (l - 1) // (p);\r\n numDiv.append([total - part, (r - l + 1), (r - l + 1) - (total - part)])\r\n\r\n\r\nans = 0;\r\n\r\nfor i in range(len(numDiv)):\r\n totalDiv, totalNums, unDiv = numDiv[i];\r\n nxIdx, prIdx = (i + 1) % len(numDiv), (i - 1) % len(numDiv);\r\n total = (numDiv[i][1] * numDiv[nxIdx][1] * numDiv[prIdx][1])\r\n currN = (total - (unDiv * numDiv[nxIdx][2] * numDiv[prIdx][2]))\r\n n = (totalDiv * numDiv[nxIdx][1] * numDiv[prIdx][1]);\r\n ans += (n / total) * 2000;\r\n currN -= n;\r\n n = (unDiv * numDiv[nxIdx][0] * numDiv[prIdx][0])\r\n ans += (n / total) * 2000;\r\n currN -= n;\r\n ans += (currN / total) * 1000;\r\n\r\n\r\nprint(ans)", "n, p = map(int, input().split())\r\na = [(y - x + 1, (y // p) - ((x - 1) // p)) for x, y in [map(int, input().split()) for _ in range(n)]]\r\nprint(sum([1 - (((a[i][0] - a[i][1]) / a[i][0]) * ((a[(i + 1) % n][0] - a[(i + 1) % n][1]) / a[(i + 1) % n][0])) for i in range(n)]) * 2000)\r\n", "def main():\r\n n,p=map(int,input().split())\r\n pro=[]\r\n ans=0\r\n def union(a,b):\r\n return a+b-a*b\r\n for i in range(n):\r\n l,r=map(int,input().split())\r\n pro.append(((r//p)-(l-1)//p)/(r-l+1))\r\n for i in range(n):\r\n ans+=union(pro[i],pro[(i-1)%n])+union(pro[i],pro[(i+1)%n])\r\n print(1000*ans)\r\nmain()", "\r\ndef getMultiplesInRange(start, end, p):\r\n return int(end / p) - int((start - 1) / p)\r\n\r\n\r\nn, p = map(int, input().split(' '))\r\nranges = []\r\nanswer = 0\r\n\r\nfor i in range(n):\r\n lower, upper = map(int, input().split(' '))\r\n ranges.append([lower, upper])\r\n\r\n\r\nfor i in range(n):\r\n startIndex = i\r\n endIndex = (i + 1) % n\r\n\r\n multiplesInRangeForFirst = getMultiplesInRange(\r\n ranges[startIndex][0], ranges[startIndex][1], p)\r\n totalNumbersInRangeForFirst = ranges[startIndex][1] - \\\r\n ranges[startIndex][0] + 1\r\n nonMultiplesInRangeForFirst = totalNumbersInRangeForFirst - multiplesInRangeForFirst\r\n\r\n multiplesInRangeForSecond = getMultiplesInRange(\r\n ranges[endIndex][0], ranges[endIndex][1], p)\r\n totalNumbersInRangeForSecond = ranges[endIndex][1] - \\\r\n ranges[endIndex][0] + 1\r\n nonMultiplesInRangeForSecond = totalNumbersInRangeForSecond - multiplesInRangeForSecond\r\n\r\n numerator = (nonMultiplesInRangeForFirst * nonMultiplesInRangeForSecond)\r\n denominator = totalNumbersInRangeForFirst * totalNumbersInRangeForSecond\r\n success_probability = (denominator - numerator) / denominator\r\n\r\n answer = answer + success_probability\r\n\r\nprint(answer * 2000)\r\n", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(ans):\n sys.stdout.write(\"%.10f\\n\" % (ans))\n\n\ndef solve(sharks, p):\n probabilities = [0 for _ in range(len(sharks))]\n payout = 0\n\n for index, rng in enumerate(sharks):\n li, ri = rng\n totalprimes = (ri // p) - ((li - 1) // p)\n totalnums = ri - li + 1\n probabilities[index] = totalprimes / totalnums\n\n for i in range(len(sharks)): # last one for loop\n a = i % (len(sharks))\n b = (i + 1) % (len(sharks))\n prob = (\n probabilities[a] + probabilities[b] - (probabilities[a] * probabilities[b])\n )\n payout += 2000 * prob\n\n return payout\n\n\ndef readinput():\n n, p = getInts()\n sharks = []\n for _ in range(n):\n sharks.append(list(getInts()))\n printOutput(solve(sharks, p))\n\n\nreadinput()\n", "n,p = map(int,input().split())\r\nans = 0\r\nx = []\r\nfor _ in range(n):\r\n l,r = map(int,input().split())\r\n x.append((r//p - (l-1)//p,r-l+1))\r\n\r\nfor i in range(n):\r\n div1 = x[i][1]\r\n div2 = x[(i+1)%n][1]\r\n ans+=(1-((div1-x[i][0])/div1)*((div2-x[(i+1)%n][0])/div2))*2000\r\n\r\nprint(ans)\r\n \r\n", "def fu(a):\r\n return a[1]//p-(a[0]-1)//p\r\n\r\n# import sys\r\n# input=sys.stdin.readline\r\nn,p=list(map(int,input().split()))\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\ns=0\r\nfor i in range(n):\r\n s+=1-((a[i][1]-a[i][0]+1-fu(a[i]))/(a[i][1]-a[i][0]+1))*((a[(i+1)%n][1]-a[(i+1)%n][0]+1-fu(a[(i+1)%n]))/(a[(i+1)%n][1]-a[(i+1)%n][0]+1))\r\nprint(s*2000)", "import math as m\r\nt=1\r\ndef fn(a,p):\r\n l,r=a[0],a[1]\r\n f,g=l//p,r//p\r\n ans=(g-f)+(f*p==l)\r\n return [ans,r-l+1]\r\nwhile t:\r\n t-=1\r\n n,p=map(int,input().split())\r\n ranges=[]\r\n for x in range(n):\r\n a=list(map(int,input().split()))\r\n d=fn(a,p)\r\n ranges.append(d)\r\n ans=0\r\n for i in range(n):\r\n d1,x = ranges[i][0], ranges[i][1]\r\n if i==n-1:\r\n d2,y = ranges[0][0], ranges[0][1]\r\n else :\r\n d2,y = ranges[i+1][0], ranges[i+1][1]\r\n ans+=(d1/x+d2/y-(d1*d2)/(x*y))\r\n print(ans*2000)", "def Probabilidad(a,b,c,d,p): # (a,b) son los extremos del primer intervalo y (c,d) son los extremos del segundo intervalo, p es el numero primo\r\n return ((d-c+1)*(int(b/p)-int((a-1)/p)) + ((b-a+1)*(int(d/p)-int((c-1)/p)) - ((int(b/p)-int((a-1)/p))*(int(d/p)-int((c-1)/p)))))/((b - a + 1)*(d - c + 1))\r\n \r\ndef WetSharkAndFlowers(n, p, SharkMatrix): \r\n i = 0 # n es la cantidad de fila que tiene la matriz, p es el numero primo preferido de Wet Shark, SharkMatrix es una matriz que representa los rangos de flores que el tiburon i-esimo hace crecer. \r\n matrixTemp = [] #Dado que los valores que se encuentran en la ultima fila de la matriz son vecinos de los que se encuentran en la primera fila, cree esta matriz donde los valores son iguales a la matriz original del ejercicio, pero con la diferencia de que se añadio a esta matriz la primera fila de la orginal, para no tener que considerar que la ultima fila es vecina de la primera. \r\n for i in range(len(SharkMatrix)):\r\n matrixTemp.append([SharkMatrix[i][0], SharkMatrix[i][1]])\r\n matrixTemp.append([SharkMatrix[0][0], SharkMatrix[0][1]])\r\n sumProb = 0 #en esta variable es que se va a ir calculando el valor del resultado final\r\n for i in range(len(matrixTemp) - 1):\r\n sumProb += Probabilidad(matrixTemp[i][0], matrixTemp[i][1], matrixTemp[i + 1][0], matrixTemp[i + 1][1], p)\r\n sumProb *= 2000\r\n return sumProb\r\n\r\ndef problem621C(): \r\n a, b = input().split()\r\n n = int(a)\r\n p = int(b)\r\n sharkMatrix = []\r\n i = 0\r\n while i < n : \r\n a,b = input().split()\r\n sharkMatrix.append([int(a), int(b)])\r\n i += 1\r\n return WetSharkAndFlowers(n,p,sharkMatrix)\r\n\r\nprint(problem621C())\r\n\r\n\r\n# \"\"\"\r\n# n = 3\r\n# p = 2\r\n# sharkMatrix = np.zeros((3,2))\r\n# sharkMatrix[0,0] = 1\r\n# sharkMatrix[0,1] = 2\r\n# sharkMatrix[1,0] = 420\r\n# sharkMatrix[1,1] = 421\r\n# sharkMatrix[2,0] = 420420\r\n# sharkMatrix[2,1] = 420421\r\n# \"\"\"\r\n\r\n# \"\"\"n = 3\r\n# p = 5\r\n# sharkMatrix = np.zeros((3,2))\r\n# sharkMatrix[0,0] = 1\r\n# sharkMatrix[0,1] = 4\r\n# sharkMatrix[1,0] = 2\r\n# sharkMatrix[1,1] = 3\r\n# sharkMatrix[2,0] = 11\r\n# sharkMatrix[2,1] = 14\r\n\r\n\r\n\r\n", "import math\r\nfrom os import startfile\r\nimport random \r\nfrom queue import Queue\r\nimport time \r\nimport heapq\r\nimport sys \r\ndef getCost(x,inv,prices,ord_count):\r\n a,b,c=ord_count\r\n\r\n return max(prices[0]*(a*x-inv[0]),0) + max(prices[1]*(b*x-inv[1]),0) + max(prices[2]*(c*x-inv[2]),0)\r\n\r\ndef main(arr,p):\r\n\r\n cnt=[0]*len(arr)\r\n for i in range(len(arr)):\r\n l,r=arr[i]\r\n\r\n start=l if l%p==0 else l+(p-(l%p))\r\n \r\n add=0\r\n if start<=r:\r\n add+=1 \r\n x_nums=(r-start)/p \r\n add+=int(x_nums)\r\n cnt[i]=add\r\n \r\n for i in range(len(cnt)):\r\n l,r=arr[i] \r\n cnt[i]/=(r-l+1)\r\n prob=0 \r\n\r\n \r\n for i in range(len(arr)):\r\n prev=cnt[(i-1)%len(arr)]\r\n curr=cnt[i]\r\n\r\n \r\n prob+=curr+prev-curr*prev \r\n\r\n return prob*2000 \r\nn,p=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\nprint(main(arr,p))\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "answ=0\r\nn, p = map(int,input().split())\r\na = [0]*n\r\nb = [0]*n\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n a[i]=r-l+1\r\n b[i]=(r//p)-((l-1)//p)\r\nfor i in range(n):\r\n answ += 1 - (((a[i])-b[i])/a[i]*((a[(i+1)%n]-b[(i+1)%n])/a[(i+1)%n]))\r\nprint(answ*2000)", "n, p = map(int, input().split())\n\n\ndef cal():\n a, b = map(int, input().split())\n return (b//p-(a-1)//p)/(b-a+1)\n\n\nps = [cal()for _ in range(n)]\n# print(ps)\nout = ps[0]+ps[-1]-ps[0]*ps[-1]\nfor i in range(n-1):\n out += ps[i]+ps[i+1]-ps[i]*ps[i+1]\nprint(out*2000)\n\n\t\t \t\t\t\t \t \t \t\t\t\t \t\t\t", "t,k=map(int,input().split())\r\nn,m=[],[]\r\nfor i in range(t):\r\n x,y=map(int,input().split())\r\n n.append(y-x+1)\r\n m.append((y//k)-((x-1)//k))\r\nans=0\r\nfor i in range(t):\r\n j=(i+1)%t\r\n ans+=1-(((n[i]-m[i])/n[i])*((n[j]-m[j])/n[j]))\r\nprint(ans*2000)", "\r\nn,p=map(int,input().split())\r\ndp=[0.0]*(n+1)\r\nres=0\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n dp[i]=1-(r//p-(l-1)//p)/(r-l+1)\r\n\r\n# print(dp)\r\nfor i in range(n):\r\n res+=1-dp[i]*dp[(i+1)%n]\r\nprint(res*2000)\r\n\r\n\r\n", "n, p = map(int, input().split())\r\nl, r = [0] * (n+1), [0] * (n+1)\r\n\r\nfor i in range(n):\r\n lx, rx = map(int, input().split())\r\n l[i] = lx\r\n r[i] = rx\r\nl[n] = l[0]\r\nr[n] = r[0]\r\n \r\na1 = r[0] // p - (l[0] - 1) // p\r\nb1 = r[0] - l[0] + 1\r\nc1 = (b1 - a1) / b1\r\nres = 0\r\nfor i in range(1, n+1):\r\n a2 = r[i] // p - (l[i] - 1) // p\r\n b2 = r[i] - l[i] + 1\r\n c2 = (b2 - a2) / b2 \r\n res += 1 - c1 * c2\r\n c1 = c2\r\nprint(res * 2000)\r\n" ]

[ "n=int(input())\r\nsumx=0\r\nif(n==0):\r\n\tprint(1)\r\nelse:\r\n\twhile(n>0):\r\n\t\ta=n%16\r\n\t\tif(a<10):\r\n\t\t\tif(a==0 or a==4 or a==6 or a==9):\r\n\t\t\t\tsumx+=1\r\n\t\t\telif(a==8):\r\n\t\t\t\tsumx+=2\r\n\t\telif(a==10 or a==13):\r\n\t\t\tsumx+=1\r\n\t\telif(a==11):\r\n\t\t\tsumx+=2\r\n\t\tn=n//16\r\n\tprint(sumx)", "def f(i):\r\n if i in '0964ad':\r\n return 1\r\n if i in '8b':\r\n return 2\r\n return 0\r\n\r\n\r\nn=sum([f(i) for i in hex(int(input()))[2:]])\r\nprint(n)\r\n#print(' '.join([str(i) for i in a]))", "# LUOGU_RID: 113724848\na=hex(int(input()))[2:]\r\nprint(a.count('0')+a.count('4')+a.count('6')+a.count('9')+a.count('a')+a.count('d')+(a.count('8')+a.count('b'))*2)", "# LUOGU_RID: 101649299\ns = hex(int(input()))[2:]\r\nprint(sum(s.count(c) for c in '0469ad') + 2 * sum(s.count(c) for c in '8b'))", "s = int(input())\r\na = hex(s)[2:]\r\nprint(a.count('0') + a.count('4') + a.count('6') + a.count('8') * 2 + a.count('a') + a.count('9') + a.count('b') * 2 + a.count('d'))", "H = {'0': 1, '1': 0, '2': 0, '3': 0,\n '4': 1, '5': 0, '6': 1, '7': 0,\n '8': 2, '9': 1, 'A': 1, 'B': 2,\n 'C': 0, 'D': 1, 'E': 0, 'F': 0}\n\nn = int(input())\nprint(sum(H[h] for h in f'{n:X}'))\n", "n = int(input())\r\ns = hex(n)\r\nx = 0\r\nfor c in s[2:]:\r\n\tif c == '0':\r\n\t\tx += 1\r\n\tif c == '4':\r\n\t\tx += 1\r\n\tif c == '6':\r\n\t\tx += 1\r\n\tif c == '8':\r\n\t\tx += 2\r\n\tif c == '9':\r\n\t\tx += 1\r\n\tif c == 'a':\r\n\t\tx += 1\r\n\tif c == 'b':\r\n\t\tx += 2\r\n\tif c == 'd':\r\n\t\tx += 1\r\nprint(x)", "n=int(input())\r\nl=hex(n)[2:]\r\nprint(l.count('0') + l.count('4') + l.count('6') + l.count('8') * 2 + l.count('a') + l.count('9') + l.count('b') * 2 + l.count('d'))\r\n\r\n", "n = int(input())\n\nr = (\n (1, 0), (2, 0), (3, 0), (4, 1), \n (5, 0), (6, 1), (7, 0), (8, 2),\n (9, 1), (10, 1), (11, 2), (12, 0),\n (13, 1), (14, 0), (15, 0), (0, 1), )\nd = dict(r)\n\nif n == 0 :\n print(1) \nelse :\n ans = 0\n while n > 0 :\n p = n - (n // 16) * 16;\n n //= 16;\n ans += d[p]\n print(ans)\n", "D={0:1,1:0,2:0,3:0,4:1,5:0,6:1,7:0,8:2,9:1,10:1,11:2,12:0,13:1,14:0,15:0}\r\nn=int(input())\r\na=0\r\nif(n==0):\r\n a=1\r\nwhile(n>0):\r\n a+=D[n%16]\r\n n//=16\r\n \r\nprint(a)", "val = [1, 0, 0, 0, 1, 0, 1, 0, 2, 1, 1, 2, 0, 1, 0, 0]\r\nn = int(input())\r\nx = hex(n)\r\nx = x[2:]\r\nans = 0\r\nfor i in x:\r\n i = int(i, 16)\r\n ans = ans + val[i]\r\nprint(ans)\r\n", "import string\r\nn=int(input())\r\nh=str(hex(n))\r\nh=h[2:].upper()\r\nloop={'0':1,\r\n '1':0,\r\n '2':0,\r\n '3':0,\r\n '4':1,\r\n '5':0,\r\n '6':1,\r\n '7':0,\r\n '8':2,\r\n '9':1,\r\n 'A':1,\r\n 'B':2,\r\n 'C':0,\r\n 'D':1,\r\n 'E':0,\r\n 'F':0}\r\ns=0\r\nfor i in range(len(h)):\r\n ch=h[i]\r\n s+=loop[ch]\r\nprint(s)", "n = int(input())\r\nans = 1 if n == 0 else 0\r\n\r\nwhile n > 0:\r\n d = n % 16\r\n n = n // 16\r\n if d in [8, 11]:\r\n ans += 2\r\n elif d in [0, 4, 6, 9, 10, 13]:\r\n ans += 1\r\n\r\nprint(ans)", "x = hex(int(input()))[2:].upper()\r\none = set(['A','D','0','4','6','9'])\r\ntwo = set(['B', '8'])\r\ncount = 0\r\nfor i in x:\r\n if i in one:\r\n count += 1\r\n elif i in two:\r\n count += 2\r\nprint(count)", "l=[1,0,0,0,1,0,1,0,2,1,1,2,0,1,0,0]\r\nn=int(input())\r\ndef ui(n):\r\n\tif n<16:return(l[n])\r\n\tif n==16:return(1)\r\n\treturn l[n%16]+ui(n//16)\r\nprint(ui(n))", "o = ['0','4','6','9','a','d']\r\noo = ['8','b']\r\ncnt = 0\r\nn = list(hex(int(input())))\r\nx = ''\r\nfor i in range(2,len(n)):\r\n x += n[i]\r\nx = str(x)\r\nfor j in x:\r\n if j in o:\r\n cnt += 1\r\n elif j in oo:\r\n cnt += 2\r\nprint(cnt)", "mp= {'0' : 1, '1' : 0, '2' : 0, '3' : 0, '4' : 1, '5' : 0, '6' : 1, '7' : 0, '8' : 2, '9' : 1, 'A' : 1, 'B' : 2, 'C' : 0, 'D' : 1, 'E' : 0, 'F' : 0}\nn = '%X' % (int(input()))\nans = 0\nfor i in n: \n\tans += mp[i]\nprint(ans)\n\t\t\t \t\t \t\t \t\t\t\t\t\t\t\t\t \t \t\t", "a=hex(int(input()))[2:]\r\nans=0\r\nd={\"0\":1,\"1\":0,\"2\":0,\"3\":0,\"4\":1,\"5\":0,\"6\":1,\"7\":0,\"8\":2,\"9\":1,\"a\":1,\"b\":2,\"c\":0,\"d\":1,\"e\":0,\"f\":0}\r\nfor i in a:\r\n ans+=d[i]\r\nprint(ans)", "f = {'0' : 1, '1' : 0, '2' : 0, '3' : 0, '4' : 1, '5' : 0, '6' : 1, '7' : 0, '8' : 2, '9' : 1, 'A' : 1, 'B' : 2, 'C' : 0, 'D' : 1, 'E' : 0, 'F' : 0}\r\nn = '%X' % int(input())\r\ns = 0\r\nfor i in n: s += f[i]\r\nprint(s)", "from sys import stdin,stdout\r\n# from os import _exit\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nn = hex(int(input()))[2:].upper()\r\nval = {'0':1,'4':1,'6':1,'8':2,'9':1,'A':1,'B':2,'D':1}\r\nans = 0\r\nfor i in n:\r\n ans+=val.get(i,0)\r\nprint(str(ans)+\"\\n\")\r\n", "d={'0':1,'4':1,'6':1,'8':2,'9':1,'a':1,'b':2,'d':1}\r\nprint(sum(d[x] for x in hex(int(input())) if x in d)-1)", "v=[1,0,0,0,1,0,1,0,2,1,1,2,0,1,0,0]\r\nn=int(input())\r\na=1 if n==0 else 0\r\nwhile n>0:\r\n a+=v[n%16]\r\n n//=16\r\nprint(a)", "n=hex(int(input()))\r\nn=n[2::]\r\nt=0\r\nfor i in range(0,len(n)):\r\n\tif n[i]==\"a\":t+=1\r\n\tif n[i]==\"b\":t+=2\r\n\tif n[i]==\"d\":t+=1\r\n\tif n[i]==\"0\":t+=1\r\n\tif n[i]==\"4\":t+=1\r\n\tif n[i]==\"6\":t+=1\r\n\tif n[i]==\"8\":t+=2\r\n\tif n[i]==\"9\":t+=1\r\nprint(t)", "n = hex(int(input()))[2:]\nsum = 0\nfor i in n:\n sum += [1,0,0,0,1,0,1,0,2,1,1,2,0,1,0,0][int(i,16)]\nprint(sum)\n\n\n\n\n# Made By Mostafa_Khaled", "\"\"\"\r\nhttp://codeforces.com/contest/784/problem/B\r\n\"\"\"\r\ndef to_hex(n):\r\n return hex(n)[2:].upper()\r\n\r\n\r\ndef closed_loops(x):\r\n d = {'0': 1, '1': 0, '2': 0, '3': 0, '4': 1, '5': 0, '6': 1, '7': 0, '8': 2, '9': 1,\r\n 'A': 1, 'B': 2, 'C': 0, 'D': 1, 'E': 0, 'F': 0}\r\n total = 0\r\n a = to_hex(x)\r\n for c in a:\r\n total += d[c]\r\n return total\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n print(closed_loops(n))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = {'0':1,'1':0,'2':0,'3':0,'4':1,'5':0,'6':1,'7':0,'8':2,'9':1,'a':1,'b':2,'c':0,'d':1,'e':0,'f':0}\ns = 0\nfor i in hex(int(input())).replace('0x', ''):\n\ts += a[i]\nprint(s)", "to = {\r\n 'A': 1,\r\n 'B': 2,\r\n 'D': 1,\r\n '0': 1,\r\n '4': 1,\r\n '6': 1,\r\n '8': 2,\r\n '9': 1,\r\n}\r\n\r\nans = 0\r\nn = hex(int(input()))[2:].upper()\r\nfor i in n:\r\n ans += to.get(i, 0)\r\nprint(ans)\r\n", "def count(s):\n res = 0\n for i in s:\n if i in ['0', '4', '6', '9', 'A', 'D']:\n res += 1\n elif i in ['8', 'B']:\n res += 2\n return res\n\n\ndef main():\n s = hex(int(input())).replace('0x', '').upper()\n print(count(s))\n\n\nmain()", "cnt = {\n '0': 1,\n '1': 0,\n '2': 0,\n '3': 0,\n '4': 1,\n '5': 0,\n '6': 1,\n '7': 0,\n '8': 2,\n '9': 1,\n 'A': 1,\n 'B': 2,\n 'C': 0,\n 'D': 1,\n 'E': 0,\n 'F': 0\n}\n\na = int(input())\nhexStr = hex(a).replace('0x', '').upper()\nans = sum([cnt[x] for x in hexStr])\nprint(ans)\n", "rings = [1,0,0,0,1,0,1,0,2,1,1,2,0,1,0,0]\r\ndef cnt(n):\r\n if n:\r\n res = 0\r\n while n:\r\n res += rings[n%16]\r\n n //= 16\r\n else:\r\n res = 1\r\n return res\r\nn = int(input())\r\nprint(cnt(n))", "print(sum([\"046889ABBDabbd\".count(x) for x in hex(int(input()))])-1)", "# coding: utf-8\r\n\r\nn = hex(int(input()))[2:]\r\n\r\nprint(n.count('0') + n.count('4') + n.count('6') + 2 * n.count('8') + n.count('9') + n.count('a') + 2 * n.count('b') + n.count('d'))", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-07 22:51:17\nLastEditTime: 2021-11-07 22:55:02\nDescription: \nFilePath: CF784B.py\n'''\n\n\ndef func():\n num = hex(int(input())).replace(\"0x\", \"\").upper()\n count = 0\n for item in num:\n if item in [\"0\", \"4\", \"6\", \"9\", \"A\", \"D\"]:\n count += 1\n elif item in [\"8\", \"B\"]:\n count += 2\n print(count)\n\n\nif __name__ == '__main__':\n func()\n" ]

[ "input()\nprint('\\n'.join(['Infinite' if p * pow(b, 99, q) % q else 'Finite' for p, q, b in map(lambda l: map(int, l.split()), __import__('sys').stdin.readlines())]))\n", "from sys import stdin\n\n_, *l = stdin.read().splitlines()\nfor i, s in enumerate(l):\n p, q, b = map(int, s.split())\n l[i] = 'Infinite' if p * pow(b, 64, q) % q else 'Finite'\nprint('\\n'.join(l))", "n = int(input())\nans = ''\nwhile n > 0:\n p, q, b = map(int, input().split(' '))\n for i in range(6):\n b = b * b % q\n if b * p % q == 0: ans += 'Finite\\n'\n else: ans += 'Infinite\\n'\n n -= 1\nprint (ans)\n \t \t\t\t\t\t \t \t\t\t\t \t\t\t\t\t\t\t", "# python3\ndef solve():\n for __ in range(int(input())):\n p, q, b = tuple(map(int, input().split()))\n yield \"Infinite\" if p * pow(b, 63, q) % q else \"Finite\"\n\n\nprint(\"\\n\".join(solve()))\n", "n=int(input())\r\ns=''\r\nfor i in range(n):\r\n p,q,b=map(int,input().split())\r\n for i in range(6):\r\n b=(b*b)%q\r\n \r\n if((p*b)%q):\r\n s+='Infinite\\n'\r\n else:\r\n s+='Finite\\n'\r\nprint(s)", " \r\nimport os\r\nimport sys\r\nimport math\r\nfrom io import BytesIO, IOBase\r\nfrom fractions import Fraction\r\nimport collections\r\nfrom itertools import permutations\r\nfrom collections import defaultdict\r\n \r\n \r\nBUFSIZE = 8192\r\n \r\n \r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\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 main():\r\n\tT = int(input())\r\n\tfor _ in range(T):\r\n\t\tp, q, b = list(map(int, input().split()))\r\n\t\tg = gcd(p, q)\r\n\t\tq //= g\r\n\t\t\r\n\t\tr, a, n = 1, b, 64\r\n\t\twhile n:\r\n\t\t\tif n&1:\r\n\t\t\t\tr = r * a % q\r\n\t\t\t\r\n\t\t\ta = a * a % q\r\n\t\t\tn >>= 1\r\n\t\t\r\n\t\tprint(\"Finite\" if r == 0 else \"Infinite\")\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()\r\n", "# python3\nimport sys\nfrom fractions import gcd\n\n\ndef is_finite(p, q, b):\n return not p * pow(b, 64, q) % q\n\n\ninput()\nprint(\"\\n\".join(\"Finite\" if is_finite(*map(int, line.split())) else \"Infinite\"\n for line in sys.stdin.readlines()))\n", "import sys\n\ndef binpow(a, n, p):\n res = 1\n while n > 0:\n if n % 2 == 1:\n res = (res * a) % p\n a = (a * a) % p\n n >>= 1\n return res\n\ndef main():\n result = []\n \n t = int(sys.stdin.readline())\n for line in sys.stdin.readlines():\n p, q, b = map(int, line.split())\n for i in range(6):\n b = (b * b) % q\n result.extend(list(\"Finite\\n\" if (p * b) % q == 0 else list(\"Infinite\\n\")))\n sys.stdout.write(\"\".join(result))\n\nmain()\n", "input()\nprint('\\n'.join(map(lambda x: (lambda p, q, b: 'Infinite' if p * pow(b, 60, q) % q else 'Finite')(*x), map(lambda l:map(int, l.split()), __import__('sys').stdin.readlines()))))\n", "import sys\ndef main():\n n = int(input())\n ans = []\n while n:\n n += -1\n p, q, b = map(int, input().split())\n if p * pow(b, 99, q) % q: ans.append(\"Infinite\")\n else: ans.append(\"Finite\")\n for _ in ans: print(_)\nmain()\n \t\t \t \t \t \t \t \t \t\t\t\t \t \t", "# from collections import deque, defaultdict\r\n# from math import sqrt, ceil, factorial, floor, inf, gcd\r\n# import bisect\r\n# import sys\r\n# import copy\r\n# def get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\n# def get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n# def input(): return sys.stdin.readline().strip()\r\n#\r\n# for _ in range(int(input())):\r\n# \tp,q,r = get_ints()\r\n#\r\n# \ta = gcd(p,q)\r\n# \tp //=a\r\n# \tq //=a\r\n#\r\n# \tr = gcd(q,r)\r\n#\r\n# \twhile r != 1:\r\n# \t\twhile q % r == 0:\r\n# \t\t\tq = q // r\r\n# \t\tr = gcd(q,r)\r\n#\r\n# \tif q == 1:\r\n# \t\tprint(\"Finite\")\r\n# \telse:\r\n# \t\tprint(\"Infinite\")\r\n\r\n\r\nn = int(input())\r\nans = []\r\nwhile n:\r\n n += -1\r\n p, q, b = map(int, input().split())\r\n if p * pow(b, 62, q) % q: ans.append(\"Infinite\")\r\n else: ans.append(\"Finite\")\r\nfor _ in ans: print(_)", "n = int(input())\r\ns = ''\r\nfor i in range(n):\r\n p,q,b = map(int,input().split())\r\n for i in range(6):\r\n b = (b*b)%q\r\n if (p*b) %q:\r\n s += 'Infinite\\n'\r\n else:\r\n s += 'Finite\\n'\r\nprint(s)" ]

[ "import random\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef is_Prime(n):\r\n if n == 1:\r\n return False\r\n for i in range(2, min(int(n ** (1 / 2)) + 2, n)):\r\n if n % i == 0:\r\n return False\r\n return True\r\n\r\ndef random_mod():\r\n mod = random.randint(5 * pow(10, 8), pow(10, 9))\r\n if not mod % 2:\r\n mod += 1\r\n while not is_Prime(mod):\r\n mod += 2\r\n while not min(mod % 3, mod % 5):\r\n mod += 2\r\n return mod\r\n\r\ndef binary_search(c1, c2, u):\r\n c = (c1 + c2 + 1) // 2\r\n while abs(c1 - c2) > 1:\r\n c = (c1 + c2 + 1) // 2\r\n if ok(c, u):\r\n c1 = c\r\n else:\r\n c2 = c\r\n c += 2\r\n while not ok(c, u):\r\n c -= 1\r\n return c\r\n\r\ndef ok(c, u):\r\n if not c:\r\n return True\r\n if c > u:\r\n return False\r\n l1, r1 = u - c, u + c\r\n l2, r2 = n - u - 1 - c, n - u - 1 + c\r\n h1 = (h[r1 + 1] - h[l1]) % mod * x[l1] % mod\r\n h2 = (h[r2 + 1] - h[l2]) % mod * x[l2] % mod\r\n return False if h1 ^ h2 else True\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nfor i in range(n):\r\n s[i] -= 96\r\nmod = random_mod()\r\nb, h = 1, [0, s[0]]\r\nfor j in range(1, n):\r\n b = 29 * b % mod\r\n h.append((b * s[j] % mod + h[-1]) % mod)\r\nx = [pow(b, mod - 2, mod)]\r\nfor _ in range(n - 1):\r\n x.append(29 * x[-1] % mod)\r\nx.reverse()\r\nans = [-1] * (n // 2 + n % 2)\r\nfor i in range(n // 2):\r\n if s[i] ^ s[-i - 1]:\r\n continue\r\n c = binary_search(0, i + 1, i)\r\n ans[i - c] = max(ans[i - c], 2 * c + 1)\r\nfor i in range(1, n // 2 + n % 2):\r\n ans[i] = max(ans[i], ans[i - 1] - 2, -1)\r\nsys.stdout.write(\" \".join(map(str, ans)))" ]

[ "n=int(input())\na=input()\nans=0\nfor i in range(n+1):\n for j in range(i):\n l=a[j:i].count(\"L\") \n r=a[j:i].count(\"R\") \n u=a[j:i].count(\"U\") \n d=a[j:i].count(\"D\") \n if l==r and u==d:\n ans+=1\n \nprint(ans)\n", "n = int(input())\n\ncode = input()\nc = 0\nfor i in range(n-1):\n u = d = r = l = 0\n if code[i] == 'U':\n u += 1\n elif code[i] == 'D':\n d += 1\n elif code[i] == 'R':\n r += 1\n else:\n l += 1\n\n for j in range(i+1, n):\n if code[j] == 'U':\n u += 1\n elif code[j] == 'D':\n d += 1\n elif code[j] == 'R':\n r += 1\n else:\n l += 1\n \n if u == d and r == l:\n c += 1\n\nprint(c)\n", "n = int(input())\n\nmoves = list(input())\n\nmapping = {'U':1,\n 'D':-1,\n 'R':1,\n 'L':-1}\n\nans = 0\n\nfor i in range(n):\n\n hor = 0\n vert = 0\n\n for j in range(i,n):\n\n \n\n move = moves[j]\n\n if move == 'U' or move == 'D':\n\n vert += mapping[move]\n\n else:\n\n hor += mapping[move]\n\n \n\n if hor == 0 and vert == 0:\n\n ans += 1\n\nprint(ans)\n \n", "n = int(input())\ncommands = input()\n\nvertical = [0]\nhorizontal = [0]\n\nfor i in range(1,n+1):\n vert_diff = 0\n hor_diff = 0\n if commands[i-1] == 'U':\n vert_diff = 1\n elif commands[i-1] == 'D':\n vert_diff = -1\n elif commands[i-1] == 'R':\n hor_diff = 1\n else:\n hor_diff = -1\n vertical.append(vertical[i-1] + vert_diff)\n horizontal.append(horizontal[i-1] + hor_diff)\n\n\ntotal = 0\nfor i in range(1,n+1):\n for j in range(i+1, n+1):\n hor_diff = horizontal[j] - horizontal[i-1]\n vert_diff = vertical[j] - vertical[i-1]\n if hor_diff == 0 and vert_diff == 0:\n total += 1\n\nprint(total)\n\n\n", "\r\n\r\n\r\na = int(input())\r\n\r\nt = list(input())\r\n\r\nu=0\r\nfor k in range(a-1):\r\n x,y=0,0\r\n for j in range(k,a):\r\n if t[j]=='U':\r\n y+=1\r\n elif t[j]=='D':\r\n y-=1\r\n elif t[j]=='R':\r\n x+=1\r\n else:\r\n x-=1\r\n if x==0 and y==0:\r\n u+=1\r\n else:\r\n pass\r\n\r\nprint(u)\r\n", "n = int(input())\r\nans = 0\r\ns = input()\r\nfor i in range(n):\r\n pl = [0, 0]\r\n st = [0, 0]\r\n if s[i] == 'U':\r\n pl[0] += 1\r\n \r\n if s[i] == 'D':\r\n pl[0] -= 1\r\n \r\n if s[i] == 'R':\r\n pl[1] += 1\r\n \r\n if s[i] == 'L':\r\n pl[1] -= 1\r\n for j in range(i + 1, n):\r\n \r\n if s[j] == 'U':\r\n pl[0] += 1\r\n \r\n if s[j] == 'D':\r\n pl[0] -= 1\r\n \r\n if s[j] == 'R':\r\n pl[1] += 1\r\n \r\n if s[j] == 'L':\r\n pl[1] -= 1\r\n if st == pl:\r\n ans += 1\r\nprint(ans) \r\n \r\n \r\n \r\n", "import re, sys, string, operator, functools, fractions, collections\nsys.setrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\nmod=int(1e9+7)\neps=1e-6\n#################################################\nn=RI()[0]\ns=RS()[0]\nans=0\nfor i in range(n):\n x,y=0,0\n for j in range(i,n):\n if s[j]=='L':\n x-=1\n elif s[j]=='R':\n x+=1\n elif s[j]=='U':\n y+=1\n else:\n y-=1\n if x==0 and y==0:\n ans+=1\nprint(ans)\n\n\n\n\n\n", "n = int(input())\r\ns = input()\r\n\r\nx = 0\r\n\r\nfor i in range(n):\r\n\th, v = 0, 0\r\n\t\r\n\tfor j in range(i, n):\r\n\t\tif s[j] == \"R\":\r\n\t\t\th += 1\r\n\t\tif s[j] == \"L\":\r\n\t\t\th -= 1\r\n\t\tif s[j] == \"U\":\r\n\t\t\tv += 1\r\n\t\tif s[j] == \"D\":\r\n\t\t\tv -= 1\r\n\t\t\r\n\t\tif h == 0 and v == 0:\r\n\t\t\tx += 1\r\n\t\t\r\nprint(x)", "n = int(input())\r\nstring = input()\r\n\r\ncnt = 0\r\n\r\nfor i in range(len(string)):\r\n for j in range(i + 1, len(string) + 1):\r\n x = 0\r\n y = 0\r\n for c in string[i:j]:\r\n if c == 'U':\r\n y += 1\r\n elif c == 'D':\r\n y -= 1\r\n elif c == 'L':\r\n x -= 1\r\n else:\r\n x += 1\r\n if x == y == 0:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n = input()\ngrid = [[0 for _ in range(500)] for _ in range(500)]\nx, y = 250, 250\ngrid[x][y] = 1\nfor com in list(input()):\n\tif com == 'U':\n\t\ty -= 1\n\telif com == 'D':\n\t\ty += 1\n\telif com == 'R':\n\t\tx += 1\n\telse:\n\t\tx -= 1\n\tgrid[x][y] += 1\nprint(sum(map(lambda x : x * (x - 1) // 2 , [grid[x][y] for x in range(500) for y in range(500)])))", "from collections import Counter\r\n\r\nn = int(input())\r\ns = input()\r\nk = 0\r\n\r\nfor i in range(n-1):\r\n for j in range(i+2, n+1, 2):\r\n c = Counter(s[i:j])\r\n k += (c['U']==c['D'] and c['R']==c['L'])\r\n\r\nprint(k)", "from itertools import accumulate\n\nn = int(input())\nS = {'D': (0, -1), 'U': (0, 1), 'R': (1, 0), 'L':(-1, 0)}\nline = [S[c] for c in input()]\nprefix_x = list(accumulate([0] + line, lambda p, q: p + q[0]))\nprefix_y = list(accumulate([0] + line, lambda p, q: p + q[1]))\nans = 0\nfor i in range(n+1):\n for j in range(i+1, n+1):\n if prefix_x[j] == prefix_x[i] and prefix_y[j] == prefix_y[i]:\n ans += 1\nprint(ans)\n \n", "\r\nn = int(input())\r\nl = input()\r\n\r\nans = 0\r\n\r\nfor i in range(2, n + 1):\r\n\tfor j in range(n - i + 1):\r\n\t\tst = l[j : j + i]\r\n\t\tif st.count('L') == st.count('R') and st.count('U') == st.count('D'):\r\n\t\t\tans += 1\r\n\r\n\r\nprint(ans)", "n = int(input())\r\na = input()\r\n#a = a.split()\r\n#a = [int(x) for x in a]\r\n#a, b = a\r\n\r\nsm = 0\r\nx = 0\r\ny = 0\r\nc = []\r\nc.append([x, y])\r\n\r\nfor i in a:\r\n if i == 'U':\r\n y += 1\r\n elif i == 'D':\r\n y -= 1\r\n elif i == 'L':\r\n x -= 1\r\n elif i == 'R':\r\n x += 1\r\n\r\n sm += c.count([x, y])\r\n c.append([x, y])\r\n\r\n\r\n\r\n\r\nprint(sm)", "n=int(input())\r\ns=str(input())\r\ncount=0\r\nfor i in range(n):\r\n k=''\r\n for j in range(i,n):\r\n k+=s[j]\r\n if k.count('U')==k.count('D') and k.count('L')==k.count('R'):\r\n count+=1\r\nprint(count)\r\n", "move = {'U': (0, 1), 'R': (1, 0), 'D': (0, -1), 'L': (-1, 0)}\r\nn = int(input())\r\ndata = input()\r\nmemo = {(0, 0): 1}\r\ns = 0\r\n\r\ncur = (0, 0)\r\nfor i in range(n):\r\n cur = (cur[0] + move[data[i]][0], cur[1] + move[data[i]][1])\r\n if cur in memo:\r\n s += memo[cur]\r\n memo[cur] += 1\r\n else:\r\n memo[cur] = 1\r\n\r\nprint(s)", "n,s=int(input()),input()\r\nprint(sum(i.count('L')==i.count('R') and i.count('D')==i.count('U')for i in[s[x:y+1]for x in range(n)for y in range(x, n)]))", "def f(i, j):\r\n\tsubs = s[i:j+1]\r\n\treturn subs.count(\"L\") == subs.count(\"R\") and subs.count(\"U\") == subs.count(\"D\")\r\n\t\r\nn = int(input())\r\ns = input()\r\n\r\nr = 0\r\nfor i in range(n):\r\n\tfor j in range(i+1,n):\r\n\t\tif f(i, j):\r\n\t\t\tr += 1\r\nprint(r)\r\n\r\n", "n = int(input())\nd = [(0, 0)]\nfor c in input():\n dpos = {'L': (-1, 0), 'R': (1, 0), 'U': (0, 1), 'D': (0, -1)}[c]\n d.append((d[-1][0] + dpos[0], d[-1][1] + dpos[1]))\nprint(sum(1 for i in range(n) for j in range(i + 1, n + 1) if d[i] == d[j]))\n", "n = int(input())\r\na = input()\r\ncount = 0\r\ncoor = [0,0]\r\nfor i in range(n):\r\n for j in range(i,n):\r\n coor = [0,0]\r\n for x in range(i,j+1):\r\n if a[x]==\"U\":\r\n coor[1]+=1\r\n elif a[x]==\"D\":\r\n coor[1]-=1\r\n elif a[x]==\"R\":\r\n coor[0]+=1\r\n else:\r\n coor[0]-=1\r\n if coor==[0,0]:\r\n count+=1\r\n \r\nprint(count)\r\n", "'''\r\nCreated on Apr 20, 2016\r\nGmail : [email protected]\r\n@author: Md. Rezwanul Haque\r\n'''\r\nn = int (input())\r\ns = input()\r\ni = 0\r\nans = 0\r\nwhile i<n:\r\n r,l,u,d = 0,0,0,0\r\n g = i\r\n while g<n:\r\n if(s[g]=='R'):\r\n r+=1\r\n elif (s[g]=='L'):\r\n l+=1\r\n elif (s[g]=='D'):\r\n d+=1\r\n elif(s[g]=='U'):\r\n u+=1\r\n \r\n if(d==u and r==l):\r\n ans+=1\r\n g+=1\r\n i+=1\r\n \r\nprint(ans)", "class field:\r\n\tx = 0\r\n\ty = 0\r\n\tdef go_up(self):\r\n\t\tself.y+=1\r\n\tdef go_down(self):\r\n\t\tself.y-=1\r\n\tdef go_right(self):\r\n\t\tself.x+=1\r\n\tdef go_left(self):\r\n\t\tself.x-=1\r\n\tdef equalStart(self):\r\n\t\tif (self.x == 0) and (self.y == 0):\r\n\t\t\treturn True\r\n\t\treturn False\r\n\r\ndef lineTest (line):\r\n\tmyField = field()\r\n\tfor i in range(len(line)):\r\n\r\n\t\tif (line[i] == 'R'): myField.go_right()\r\n\t\tif (line[i] == 'L'): myField.go_left()\r\n\t\tif (line[i] == 'U'): myField.go_up()\r\n\t\tif (line[i] == 'D'): myField.go_down()\r\n\treturn myField.equalStart()\r\n\r\n\r\nn = input()\r\nn = int (n)\r\ncommands = input()\r\ncounter = 0\r\n\r\n\r\nfor i in range (len(commands)):\r\n\tsubcom = commands[i:]\r\n\tfor j in range(1, len(subcom)+1):\r\n\t\tif lineTest(subcom[:j]):\r\n\t\t\tcounter += 1\r\nprint (counter)", "import collections\r\nimport math\r\n\r\nn = int(input())\r\ns = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n for j in range(i, len(s)):\r\n t = s[i:j+1]\r\n if t.count('U') == t.count('D') and t.count('L') == t.count('R'):\r\n ans += 1\r\nprint(ans)\r\n \r\n", "n=int(input())\r\ns=input()\r\nc=0\r\nfor i in range(n):\r\n x,y=0,0\r\n for j in range(i,n):\r\n if(s[j]=='U'):\r\n y+=1\r\n elif(s[j]=='R'):\r\n x+=1\r\n elif(s[j]=='D'):\r\n y-=1\r\n else:\r\n x-=1\r\n if(x==0 and y==0):\r\n c+=1\r\nprint(c)\r\n", "n=int(input())\r\ns=input()\r\n\r\ndef abeja(x):\r\n a=[0,0]\r\n for i in range(len(x)):\r\n if x[i]=='D':\r\n a[1]-=1\r\n elif x[i]=='U':\r\n a[1]+=1\r\n elif x[i]=='L':\r\n a[0]-=1\r\n elif x[i]=='R':\r\n a[0]+=1\r\n if a[0]==0 and a[1]==0 :\r\n return True\r\n else :\r\n return False\r\ncounter=0\r\nk=[]\r\nfor x in range(len(s)+1):\r\n for y in range(len(s)+1):\r\n if x<y :\r\n if abeja(s[x:y])==True and (y,x) not in k:\r\n counter+=1\r\n \r\n else :\r\n pass\r\n\r\nprint(counter)\r\n \r\n", "input()\r\nX = input()\r\nCount = 0\r\nfor i in range(len(X)):\r\n Vert, Horiz = 0, 0\r\n Vert += (1 if X[i] == 'U' else (-1 if X[i] == 'D' else 0))\r\n Horiz += (1 if X[i] == 'R' else (-1 if X[i] == 'L' else 0))\r\n for j in range(i + 1, len(X)):\r\n Vert += (1 if X[j] == 'U' else (-1 if X[j] == 'D' else 0))\r\n Horiz += (1 if X[j] == 'R' else (-1 if X[j] == 'L' else 0))\r\n if Vert == 0 and Horiz == 0:\r\n Count += 1\r\nprint(Count)\r\n", "\nUP = 'U'\nDOWN = 'D'\nLEFT = 'L'\nRIGHT = 'R'\n\n\ndef solve():\n length = int(input().strip())\n seq = input().strip()\n\n updown = 0\n leftright = 0\n\n moves = [(updown, leftright)]\n for cmd in seq:\n if cmd == UP:\n updown += 1\n elif cmd == DOWN:\n updown -= 1\n elif cmd == RIGHT:\n leftright += 1\n else:\n leftright -= 1\n\n moves.append((updown, leftright))\n\n state_length = len(moves)\n\n count = 0\n for i in range(state_length):\n ud1, lr1 = moves[i]\n for j in range(i + 1, state_length):\n ud2, lr2 = moves[j]\n if ud2 - ud1 == 0 and lr2 - lr1 == 0:\n count += 1\n\n print(count)\n\nif __name__ == '__main__':\n solve()\n\n", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor i in range(n):\r\n k = s[i:]\r\n d = [0, 0]\r\n for j in range(len(k)):\r\n if k[j] == \"U\":\r\n d[1] += 1\r\n elif k[j] == \"D\":\r\n d[1] -= 1\r\n elif k[j] == \"L\":\r\n d[0] -= 1\r\n else:\r\n d[0] += 1\r\n if d == [0, 0]:\r\n ans += 1\r\nprint(ans)\r\n", "leng = int(input())\nsource = input()\nlst = {}\nfor i in range(leng):\n\tfor j in range(i+1,leng):\n\t\ta = source[i:j+1]\n\t\tif a in lst: lst[a] += 1\n\t\telse:\n\t\t\tx = a.count(\"R\")-a.count(\"L\")\n\t\t\ty = a.count(\"U\")-a.count(\"D\")\n\t\t\tif x == y == 0: lst[a] = 1\nprint(sum(lst.values()))\n \t\t \t \t\t\t \t\t\t \t \t\t \t\t\t", "'''input\n7\nRLRLRLR\n'''\nn = int(input())\na = input()\nc = 0\nfor s in range(n):\n\tfor t in range(2, n - s + 1, 2):\n\t\tx = a[s:s+t]\n\t\tif x.count(\"U\") == x.count(\"D\") and x.count(\"R\") == x.count(\"L\"):\n\t\t\tc += 1\nprint(c)\n", "from sys import stdin, stdout\r\n\r\ndef readline():\r\n return stdin.readline().rstrip()\r\n\r\ndef writeline(s):\r\n stdout.write(str(s)+\"\\n\")\r\n\r\nfrom collections import Counter\r\n\r\nn = int(readline())\r\ns = readline()\r\n\r\nr = 0\r\nfor i in range(n):\r\n for j in range(i+1, n+1):\r\n c = Counter(s[i:j])\r\n if c['L'] == c['R'] and c['D'] == c['U']:\r\n r += 1\r\n\r\nwriteline(r)", "n = int(input())\nver, hor = [0], [0]\n\nfor ch in input():\n ver.append(ver[-1])\n hor.append(hor[-1])\n if ch == 'U':\n ver[-1] += 1\n if ch == 'D':\n ver[-1] -= 1\n if ch == 'L':\n hor[-1] += 1\n if ch == 'R':\n hor[-1] -= 1\n\nans = 0\nfor i in range(1, n+1):\n for j in range(i+1, n+1):\n if hor[j]-hor[i-1]==0 and ver[j]-ver[i-1]==0:\n ans += 1\nprint(ans)\n", "n,s = int(input()), input()\nprint(sum(i.count('L') == i.count('R') and i.count('D') == i.count('U') for i in [s[x:y+1] for x in range(n) for y in range(x, n)]))\n", "#!/usr/bin/env python\nn = int(input())\ns = input()\nsu = 0\nfor i in range(0, n - 1):\n for i1 in range(i + 1, n):\n x = 0\n y = 0\n for c in s[i : i1 + 1]:\n if c == 'U':\n y += 1\n elif c == 'D':\n y -= 1\n elif c == 'R':\n x += 1\n elif c == 'L':\n x -= 1\n if x == 0 and y == 0:\n su += 1\nprint(su)\n", "#!/usr/bin/env python3\nn = int(input())\ns = input()\nans = 0\nfor l in range(n-1):\n for r in range(l+1,n+1):\n y, x = 0, 0\n for c in s[l:r]:\n if c == 'U':\n y += 1\n elif c == 'D':\n y -= 1\n elif c == 'R':\n x += 1\n elif c == 'L':\n x -= 1\n if y == 0 and x == 0:\n ans += 1\nprint(ans)\n", "n=int(input());\r\ns=input();\r\nans=0;\r\nfor i in range(n):\r\n for j in range(i+1,n+1):\r\n ans+=(s[i:j].count('U')==s[i:j].count('D')and s[i:j].count('L')==s[i:j].count('R'));\r\nprint(ans);", "n = int(input())\n\ncom = input()\nx = [0]*n\ny = [0]*n\nans = 0\n\nfor i in range(n):\n if com[i] == \"U\":\n y[i] = 1\n elif com[i] == \"D\":\n y[i] = -1\n elif com[i] == \"R\":\n x[i] = 1\n else:\n x[i] = -1\n\nfor i in range(1, n):\n for j in range(n-i):\n if sum(x[j:j+i+1]) == 0 and sum(y[j:j+i+1]) == 0:\n ans += 1\n\nprint(ans)\n \t\t\t\t \t \t \t \t \t \t\t\t\t \t\t", "n=int(input())\r\nl=[*input()]\r\nres=0\r\nm=[0,0]\r\nk=0\r\nz=0\r\nfor i in range(n):\r\n z,k=0,0\r\n for j in range(i,n):\r\n if l[j]=='L' :\r\n k+=1\r\n if l[j]=='R' :\r\n k-=1\r\n if l[j]=='U' :\r\n z+=1\r\n if l[j]=='D' :\r\n z-=1\r\n if k==0 :\r\n m[0]=1\r\n else :\r\n m[0]=0\r\n if z==0 :\r\n m[1]=1\r\n else :\r\n m[1]=0\r\n if m==[1,1]:\r\n res+=1\r\nprint(res)\r\n \r\n \r\n \r\n", "def main():\r\n n = int(input()) + 1\r\n s = \" \" + input().strip()\r\n arr = [[0] * 2 for x in range(n)]\r\n x, y = 0, 0\r\n ans = 0\r\n for i in range(len(s)):\r\n if s[i] == \"U\":\r\n y += 1\r\n elif s[i] == \"D\":\r\n y -= 1\r\n elif s[i] == \"L\":\r\n x -= 1\r\n elif s[i] == \"R\":\r\n x += 1\r\n arr[i] = [x, y]\r\n for j in range(i):\r\n if arr[j] == arr[i]:\r\n ans += 1\r\n print(ans)\r\n \r\nmain()", "n = int(input())\r\nst = input()\r\ncurplace = [0,0]\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(i,n):\r\n curplace = [0,0]\r\n for k in range(i,j+1):\r\n if st[k]==\"U\":\r\n curplace[1]+=1\r\n elif st[k]==\"R\":\r\n curplace[0]+=1\r\n elif st[k]==\"D\":\r\n curplace[1]-=1\r\n else:\r\n curplace[0]-=1\r\n if curplace==[0,0]:\r\n ans+=1\r\n\r\nprint(ans)\r\n\r\n", "import sys\n\nnum = int(sys.stdin.readline().strip())\nmoves = str(sys.stdin.readline().strip()).lower()\n\nans = 0\n\nfor i in range(num):\n for j in range(i + 1, num + 1):\n l, r, u, d = 0, 0, 0, 0\n for k in range(i, j):\n if moves[k] == 'l':\n l += 1\n elif moves[k] == 'r':\n r += 1\n elif moves[k] == 'u':\n u += 1\n else:\n d += 1\n\n if l == r and u == d:\n ans += 1\n\nprint(ans)\n\n# 1487731287287\n", "def calc(s):\r\n c = 0\r\n x = 0\r\n y = 0\r\n for b in s:\r\n if b == 'U': y -= 1\r\n if b == 'D': y += 1\r\n if b == 'L': x -= 1\r\n if b == 'R': x += 1\r\n if x == 0 and y == 0: c += 1\r\n return c\r\n \r\nn = input()\r\ns = input()\r\ncnt = 0\r\n\r\nwhile s:\r\n cnt += calc(s)\r\n s = s[1:]\r\n\r\nprint (cnt)", "# your code goes here\r\ndef update_cords(ch, cords):\r\n\tif ch == 'L':\r\n\t\tcords[0] -=1\r\n\telif ch == 'R':\r\n\t\tcords[0] +=1\r\n\telif ch == 'U':\r\n\t\tcords[1] = cords[1] + 1\r\n\telse:\r\n\t\tcords[1] -= 1\r\n\treturn cords\r\nn = int(input())\r\ns = input()\r\ncount = 0\r\nfor i in range(n):\r\n\tcords = [0,0]\r\n\tcords = update_cords(s[i],cords)\r\n\tfor j in range(i+1,n):\r\n\t\tcords = update_cords(s[j],cords)\r\n\t\tif cords[0] == 0 and cords[1] == 0:\r\n\t\t\tcount+=1\r\nprint(count)\r\n\t\t", "n = int(input())\ns = input()\n\nans = 0\nfor i in range(n):\n for j in range(i + 1, n + 1):\n t = s[i:j]\n ans += t.count('U') == t.count('D') and t.count('L') == t.count('R')\n\nprint(ans)\n", "\nInput=lambda:map(int,input().split())\n\nn = int(input())\ns = input()\nans = 0\nfor i in range(n):\n for j in range(n,i,-1):\n if (s[i:j].count('R') == s[i:j].count('L')) and (s[i:j].count('U') == s[i:j].count('D')):\n ans+=1\nprint(ans)", "n=int(input())\r\nl=list(input())\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+1,n+1):\r\n x,y=0,0\r\n for k in range(i,j):\r\n if l[k]=='D': y-=1\r\n if l[k]=='U': y+=1\r\n if l[k]=='L': x-=1\r\n if l[k]=='R': x+=1\r\n if x==y==0: ans+=1\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nans=0\r\nfor i in range(n):\r\n for j in range(i+2,n+1):\r\n t=s[i:j]\r\n #print(t)\r\n if t.count('U')==t.count('D') and t.count('R')==t.count('L'):\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\ns = str(input())\r\ncount = 0\r\nfor j in range(n):\r\n x, y = 0, 0\r\n for k in range(j, n):\r\n if s[k] == 'D':\r\n y -= 1\r\n elif s[k] == 'U':\r\n y += 1\r\n elif s[k] == 'R':\r\n x += 1\r\n else:\r\n x -= 1\r\n if x == 0 and y == 0:\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\ns = input()\r\ncount = 0\r\nstep = 2\r\n\r\nwhile step <= n:\r\n for i in range(0,n-step+1):\r\n temp = s[i:i+step]\r\n l = temp.count(\"L\")\r\n r = temp.count(\"R\")\r\n u = temp.count(\"U\")\r\n d = temp.count(\"D\")\r\n\r\n if l==r and u==d:\r\n count += 1\r\n step += 2\r\nprint(count)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn, s = int(input()), input()\r\nprint(sum(i.count('L') == i.count('R') and i.count('D') == i.count('U') for i in [s[x:y+1] for x in range(n) for y in range(x, n)]))\r\n", "w=int(input())\r\nq=input()\r\nr=0\r\nfor i in range(0,w-1):\r\n for j in range(1,w-i,2):\r\n a=q[i:i+j+1]\r\n if (a.count('R')==a.count('L'))&(a.count('U')==a.count('D')):\r\n r+=1\r\nprint(r)", "n1 = int(input())\n\nlista = input()\n\ncont = 0\nfor i in range(n1):\n x = 0\n y = 0\n for j in range(i, n1):\n s = lista[j]\n if(s == \"L\"):\n x += 1\n elif(s == \"R\"):\n x -= 1\n if(s == \"U\"):\n y += 1\n elif(s == \"D\"):\n y -= 1\n if(x == 0 and y == 0):\n cont += 1\n \n\nprint(cont)\n\n\t \t \t\t \t\t \t \t \t\t \t\t\t\t\t\t", "def check(r,l,u,d):\r\n if r == l and u == d:\r\n return 1\r\n else:\r\n return 0\r\n\r\nn = int(input())\r\ns = list(input())\r\nr = 0\r\nu = 0\r\nd = 0\r\nl = 0\r\ncount = 0\r\nfor i in range(n):\r\n u,d,l,r = 0,0,0,0\r\n if s[i] == 'U':\r\n u += 1\r\n elif s[i] == 'R':\r\n r += 1\r\n elif s[i] == 'L':\r\n l += 1\r\n else:\r\n d += 1\r\n for j in range(i+1,n):\r\n if s[j] == 'U':\r\n u += 1\r\n elif s[j] == 'R':\r\n r += 1\r\n elif s[j] == 'L':\r\n l += 1\r\n else:\r\n d += 1\r\n if check(r,l,u,d):\r\n count += 1\r\nprint(count)", "N = int(input())\ncomm = input()\n\ncount = 0\nfor i in range(N - 1):\n for j in range(i + 1, N + 1):\n subcomm = comm[i:j]\n r = 0\n c = 0\n for ch in subcomm:\n if ch == 'U':\n r += 1\n if ch == 'D':\n r -= 1\n if ch == 'L':\n c -= 1\n if ch == 'R':\n c += 1\n if r == 0 and c == 0:\n count += 1\nprint(count)\n", "n = int(input())\r\ninst = input()\r\n\r\ndir_ = dict(U=(0,1), D=(0,-1), L=(-1, 0), R=(1, 0))\r\nct = 0\r\nfor i in range(n):\r\n x, y = (0, 0)\r\n for j in range(i, n):\r\n dx, dy = dir_[inst[j]]\r\n x += dx\r\n y += dy\r\n ct += x == 0 and y == 0\r\n\r\nprint(ct)\r\n", "\nn = int(input())\ncom = input()\ncnt = 0\n\ndef solve(string):\n posx = 0\n posy = 0\n # print(string)\n for i in string:\n if i == 'U':\n posy -= 1\n elif i == 'D':\n posy += 1\n elif i == 'L':\n posx -= 1\n elif i == 'R':\n posx += 1\n # print(posx, posy)\n if posx == 0 and posy == 0:\n return True\n else:\n return False\n\nfor Len in range(2,n + 1):\n for i in range(n - Len + 1):\n j = i + Len - 1\n if solve(com[i:j+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", "n=int(input())\r\ns=input()\r\ndict1={}\r\nres=[[0,0]]\r\nx,y=0,0\r\nfor i in s:\r\n if i=='L':\r\n x-=1\r\n elif i=='R':\r\n x+=1\r\n elif i=='D':\r\n y-=1\r\n else:\r\n y+=1\r\n res.append([x,y])\r\nfor i in res:\r\n t=str(i[0])+':'+str(i[1])\r\n if t in dict1:\r\n dict1[t]+=1\r\n else:\r\n dict1[t]=1\r\nans=0\r\nfor i in dict1:\r\n if dict1[i]>=2:\r\n ans+=(dict1[i]-1)*dict1[i]//2\r\nprint(ans)", "if __name__ == \"__main__\":\r\n\r\n n = int(input())\r\n codes = input()\r\n\r\n urdl = [(0,0,0,0)]\r\n for code in codes:\r\n u = urdl[-1][0]\r\n r = urdl[-1][1]\r\n d = urdl[-1][2]\r\n l = urdl[-1][3]\r\n if code == \"U\": #0\r\n u += 1\r\n elif code == \"R\": #1\r\n r += 1\r\n elif code == \"D\": #2\r\n d += 1\r\n elif code == \"L\": #3\r\n l += 1\r\n urdl.append( (u,r,d,l) )\r\n\r\n res = 0\r\n for start in range(len(urdl)-1):\r\n for end in range(start+1,len(urdl)):\r\n a = urdl[start]\r\n b = urdl[end]\r\n if b[2]-a[2] == b[0]-a[0] and b[3]-a[3] == b[1]-a[1]:\r\n res += 1\r\n\r\n print(res)\r\n", "n = int(input())\r\nl = input()\r\nv = []\r\nh = []\r\nfor c in l:\r\n if c == 'U':\r\n v += [1]\r\n elif c == 'D':\r\n v += [-1]\r\n else:\r\n v += [0]\r\n if c == 'R':\r\n h += [1]\r\n elif c == 'L':\r\n h += [-1]\r\n else:\r\n h += [0]\r\nfor i in range(1,n):\r\n v[i] += v[i-1]\r\n h[i] += h[i-1]\r\n\r\nv = [0] + v\r\nh = [0] + h\r\na = 0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if h[j+1] == h[i] and v[j+1] == v[i]:\r\n a += 1\r\nprint(a)\r\n \r\n", "n = int(input())\r\ns = input()\r\ncnt = 0\r\nfor i in range(n - 1):\r\n for j in range(i + 2, n + 1):\r\n if s[i:j].count('R') == s[i:j].count('L') and s[i:j].count('U') == s[i:j].count('D'):\r\n cnt += 1\r\nprint(cnt)", "import io\nimport sys\nimport time\nimport random\nstart = time.clock()\n#~ test = '''6\n#~ URLLDR'''\n#~ test = '''7\n#~ RLRLRLR'''\n#~ test = '''200\n#~ '''\n#~ for i in range(200):\n #~ test += random.choice(\"UDLR\")\n#~ print(test) \n#~ test = '10 15'\n#~ test = '1 1000000' #28733372\n#~ test = '1 11' #55\n#~ test = '1 21' #130\n\n#~ sys.stdin = io.StringIO(test)\n\nn = int(input())\ncommands = list(input())\n\ncount = 0\n\ndef done(steps_dir):\n for v in steps_dir.values():\n if v%4!=0:\n return False\n return True\n \ndirs = {'U':+1,'D':-1,'L':+1,'R':-1} \ncoords = {'U':0,'D':0,'L':1,'R':1} \n \n \nfor i in range(n): # start\n pos = [0,0]\n for j in range(i,n): # need minimum 4 steps before getting back\n c = commands[j]\n pos[coords[c]] += dirs[c]\n if pos[0]==pos[1]==0:\n count += 1\n #~ print(steps_dir)\nprint(count) \ndur = time.clock()-start\n#~ print(\"Time:\",dur)\n", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor i in range(n):\r\n l = s[i:]\r\n f = [0, 0]\r\n for j in range(len(l)):\r\n if l[j] == \"U\":\r\n f[1] += 1\r\n elif l[j] == \"D\":\r\n f[1] -= 1\r\n elif l[j] == \"L\":\r\n f[0] -= 1\r\n else:\r\n f[0] += 1\r\n if f == [0, 0]:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\ns=str(input())\r\nt=0\r\nfor i in range(0,n):\r\n for j in range(i+1,n+1):\r\n if s[i:j].count('L')==s[i:j].count('R') and s[i:j].count('U')==s[i:j].count('D'):\r\n t+=1\r\n\r\nprint(t)\r\n", "n=int(input())\r\nch=input()\r\n\r\ntot=0\r\nfor i in range(len(ch)-1):\r\n for j in range(i+1,len(ch)):\r\n s=ch[i:j+1]\r\n #print(s)\r\n pos=[0,0]\r\n for x in s:\r\n if x=='R':\r\n pos[0]+=1\r\n if x=='L':\r\n pos[0]+=-1\r\n if x=='U':\r\n pos[1]+=1\r\n if x=='D':\r\n pos[1]+=-1\r\n if pos[0]==0 and pos[1]==0:\r\n tot+=1\r\n\r\nprint(tot)\r\n \r\n \r\n", "n = int(input())\r\ns = input()\r\nd = {'U': (1, 0), 'R': (0, 1), 'D': (-1, 0), 'L': (0, -1)}\r\n\r\ndef f(t):\r\n x, y = 0, 0\r\n for i in t:\r\n x += d[i][0]\r\n y += d[i][1]\r\n return (x, y) == (0, 0)\r\n\r\ncnt = sum(f(s[L:R + 1]) for L in range(n) for R in range(L, n))\r\nprint(cnt)\r\n", "a = {\"U\":1,\"D\":-1,\"R\":-200,\"L\":200}\nj = int(input())\nd=0\nb = input()\nfor x in range(j):\n\tfor z in range(j+1):\n\t\tc = 0\n\t\tfor y in b[x:z]:\n\t\t\tc += a[y]\n\t\tif c == 0 and len(b[x:z]) != 0:\n\t\t\td+=1\nprint(d)\n\n \t\t\t\t \t\t \t\t\t\t \t\t \t \t\t\t\t", "N = int(input())\r\nS = input()\r\nans = 0\r\n\r\nfor i in range(N - 1):\r\n for j in range(i + 1, N):\r\n segment = S[i:j + 1]\r\n if segment.count('R') == segment.count('L') and segment.count('D') == segment.count('U'):\r\n ans += 1\r\nprint(ans) \r\n", "n=int(input())\r\ns=input()\r\nans=0\r\nfor i in range(n):\r\n x=0\r\n y=0\r\n for j in range(i,n):\r\n if s[j]=='L': x+=1\r\n elif s[j]=='R': x-=1\r\n elif s[j]=='U': y+=1\r\n else: y-=1\r\n if x==0 and y==0: ans+=1\r\nprint(ans)\r\n ", "# Robot Sequence\nimport collections\n\ndef search(array,pos):\n\tcount = {'U':0,'D':0,'L':0,'R':0}\n\tnum = 0\n\tfor x in array[pos:]:\n\t\tcount[x]+=1\n\t\tif count['U'] == count['D'] and count['L'] == count['R']:\n\t\t\tnum += 1\n\treturn num\n\n\ndef main():\n\tmove = int(input())\n\tcmd = input()\n\tcount = collections.Counter(cmd)\n\tnum = 0\n\tfor x in range(move):\n\t\t\tnum += search(cmd,x)\n\tprint(num)\nmain()\n \t \t \t\t\t \t\t\t\t\t\t\t\t \t\t\t \t\t\t", "n=int(input())\r\ns=' '+input()\r\n\r\nr=[(0,0)]\r\nfor i in range(1,n+1):\r\n x,y=r[i-1]\r\n if s[i]==\"U\": y+=1\r\n if s[i]==\"D\": y-=1\r\n if s[i]==\"L\": x-=1\r\n if s[i]==\"R\": x+=1\r\n r+=[(x,y)]\r\nans=0\r\nfor i in range(1,n):\r\n for j in range(i+1,n+1):\r\n if (0,0)==(r[j][0]-r[i-1][0],r[j][1]-r[i-1][1]): ans+=1\r\nprint(ans)\r\n ", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor i in range(n):\r\n x = s[i]\r\n for j in range(i+1,n):\r\n x += s[j]\r\n if x.count('D') == x.count('U') and x.count('L') == x.count('R'):\r\n ans +=1\r\n\r\n\r\nprint(ans)\r\n", "n, s = int(input()), input()\r\na = [s[i:j+1] for i in range(n) for j in range(i, n)]\r\nprint(sum(i.count('L') == i.count('R') and i.count('D') == i.count('U') for i in a))\r\n", "n = int(input())\r\ns = input()\r\n\r\nres = 0\r\nfor i in range(n):\r\n x, y = 0, 0\r\n for j in range(i, n):\r\n if s[j] == \"U\":\r\n y += 1\r\n if s[j] == \"D\":\r\n y -= 1\r\n if s[j] == \"R\":\r\n x += 1\r\n if s[j] == \"L\":\r\n x -= 1\r\n \r\n if x == y == 0:\r\n res += 1\r\n \r\nprint(res)", "n = int(input())\r\ns = input()\r\na = [s[i:j+1] for i in range(n) for j in range(i, n)]\r\nans = 0\r\nfor i in a:\r\n if i.count('L') == i.count('R') and i.count('D') == i.count('U'):\r\n ans += 1\r\nprint(ans)\r\n", "tam = int(input())\r\nstring = input()\r\n\r\ntotal = 0\r\ntest_str = string\r\nsubstrings = [test_str[i: j] for i in range(len(test_str)) for j in range(i + 1, len(test_str) + 1)]\r\n#print(substrings)\r\n\r\nmultiplas = []\r\nfor sub in substrings:\r\n if len(sub) % 2 == 0:\r\n multiplas.append(sub)\r\n\r\n#print(multiplas)\r\nfor palavra in multiplas:\r\n countD = 0\r\n countU = 0\r\n countR = 0\r\n countL = 0\r\n for letra in palavra:\r\n if(letra == 'D'):\r\n countD += 1\r\n elif(letra == 'U'):\r\n countU += 1\r\n elif(letra == 'R'):\r\n countR += 1\r\n elif(letra == 'L'):\r\n countL += 1\r\n if(countD == countU and countL == countR):\r\n total += 1\r\n\r\nprint(total)", "n, str, cnt = int(input()), input(), 0\r\nfor i in range(n-1):\r\n for j in range(i+1, n):\r\n c = str[i:j+1]\r\n if c.count('D') == c.count('U') and c.count('R') == c.count('L'):\r\n cnt += 1\r\nprint(cnt)", "def move_robot(pos, move):\n\tif move == 'U':\n\t\tpos[1] += 1\n\telif move == 'D':\n\t\tpos[1] -= 1\n\telif move == 'L':\n\t\tpos[0] -= 1\n\telif move == 'R':\n\t\tpos[0] += 1\n\treturn pos\n\nn = int(input())\nstr = input()\n\nans = 0\nfor i in range(len(str)):\n\tpos = [0,0]\n\tfor j in range(i, len(str)):\n\t\tpos = move_robot(pos, str[j])\n\t\tif pos == [0,0]:\n\t\t\tans += 1\nprint(ans)", "def revient(a):\r\n U=0\r\n D=0\r\n L=0\r\n R=0\r\n for x in a:\r\n if x=='U':\r\n U+=1\r\n elif x=='D':\r\n D+=1\r\n elif x=='L':\r\n L+=1\r\n else:\r\n R+=1\r\n if U==D and L==R:\r\n return 1\r\n else:\r\n return 0\r\na=int(input())\r\nb=input()\r\nc=[]\r\ncompteur=0\r\nfor x in b:\r\n c.append(x)\r\nb=c\r\nfor x in range(0, a):\r\n liste=[b[x]]\r\n for y in range(1, a-x):\r\n liste.append(b[x+y])\r\n if revient(liste)==1:\r\n compteur+=1\r\nprint(compteur)\r\n", "x=y=r=0\r\ndx=[-1,0,1,0]\r\ndy=[0,1,0,-1]\r\nd='LURD'\r\nv={(0,0):1}\r\nfor c in [*open(0)][1][:-1]:\r\n c=d.index(c)\r\n x+=dx[c]\r\n y+=dy[c]\r\n if (x,y) in v:r+=v[(x,y)];v[(x,y)]+=1\r\n else:v[(x,y)]=1\r\nprint(r)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef is_satisfied(s):\r\n d = {'L': 0, 'U': 0, 'R': 0, 'D': 0}\r\n for c in s:\r\n d[c] += 1\r\n return d['L'] == d['R'] and d['U'] == d['D']\r\n\r\ndef solve(s):\r\n n = len(s)\r\n ans = 0\r\n for i in range(n):\r\n for j in range(i, n):\r\n if is_satisfied(s[i:j+1]):\r\n ans += 1\r\n return ans\r\n\r\ndef main():\r\n n = int(input())\r\n ans = solve(input())\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import Counter\nfrom sys import stdin\n\n\ndef solve(s: str):\n n = len(s)\n l = list(s)\n\n if n == 1:\n return 0\n\n res = 0\n\n for i in range(2, n + 1):\n for j in range(n - i + 1):\n\n i_ = l[j:j + i]\n c = Counter(i_)\n if c['U'] == c['D'] and c['R'] == c['L']:\n res += 1\n return res\n\n\nif __name__ == '__main__':\n _in = iter(stdin.readlines())\n n = int(next(_in))\n s = str(next(_in))[:-1]\n\n print(solve(s))\n", "size = int(input())\r\ns = [int(x.replace('L', '-1').replace('R', '1').replace('U', '250').replace('D', '-250')) for x in input()]\r\ntotal = 0\r\nfor i in range(2, size + 1):\r\n for j in range(0, size + 1 - i):\r\n if sum(s[j:j+i]) == 0:\r\n total = total + 1\r\n\r\nprint(total)", "n=int(input())\r\ns=input()\r\nresult=0\r\nfor x in range(n):\r\n r=0\r\n c=0\r\n for y in range(x,n):\r\n if s[y]==\"D\":\r\n r+=1\r\n elif s[y]==\"U\":\r\n r-=1\r\n elif s[y]==\"R\":\r\n c+=1\r\n else:\r\n c-=1\r\n \r\n if r==0 and c==0:\r\n \r\n result+=1\r\n \r\nprint(result)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n# = input()\nn = int(input())\na = list(input())\n\nstart = time.time()\n\nans = 0\n\nfor i in range(n):\n ud = 0\n lr = 0\n for j in range(i, n):\n if a[j] == 'U':\n ud += 1\n if a[j] == 'D':\n ud -= 1\n if a[j] == 'R':\n lr += 1\n if a[j] == 'L':\n lr -= 1\n if (lr == 0) and (ud == 0):\n ans += 1\n\nprint(ans)\nfinish = time.time()\n#print(finish - start)\n", "n = int(input())\r\nc = input()\r\ns = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n x = 0\r\n y = 0\r\n sub = c[i : j + 1]\r\n for k in sub:\r\n if k == \"L\":\r\n x -= 1\r\n elif k == \"R\":\r\n x += 1\r\n elif k == \"U\":\r\n y += 1\r\n else:\r\n y -= 1\r\n if x == 0 and y == 0:\r\n s += 1\r\nprint(s)\r\n", "n=int(input())\r\nch=input()\r\nS=0\r\n\r\nfor j in range(len(ch)):\r\n ch1=ch[j:len(ch)]\r\n V=0\r\n H=0\r\n for i in ch1:\r\n if i==\"U\":\r\n V=V+1\r\n if i==\"D\":\r\n V=V-1\r\n if i==\"L\":\r\n H=H+1\r\n if i==\"R\":\r\n H=H-1\r\n if V==0 and H==0:\r\n S=S+1\r\nprint(S)\r\n \r\n", "n = int(input())\nA = list(input())\nF = dict()\nF[\"U\"] = (0, 1)\nF[\"D\"] = (0, -1)\nF[\"R\"] = (1, 0)\nF[\"L\"] = (-1, 0)\nfor i in range(len(A)):\n\tA[i] = F[A[i]]\ns = 0\nfor i in range(len(A)):\n\tfor j in range(i + 1, len(A)):\n\t\tnow = [0, 0]\n\t\tfor k in range (i, j + 1):\n\t\t\tnow[0] += A[k][0]\n\t\t\tnow[1] += A[k][1]\n\t\tif now == [0, 0]:\n\t\t\ts += 1\nprint(s)", "n = int(input())\r\ncur = input()\r\ndp = [[[0, 0] for j in range(n + 1)] for i in range(n + 1)]\r\n\r\nfor i in range(0, n):\r\n for j in range(i, n):\r\n cur_xy = dp[i][j][:]\r\n \r\n if cur[j] == 'U':\r\n cur_xy[1] += 1\r\n elif cur[j] == 'D':\r\n cur_xy[1] -= 1 \r\n elif cur[j] == 'R':\r\n cur_xy[0] += 1\r\n elif cur[j] == 'L':\r\n cur_xy[0] -= 1\r\n \r\n dp[i][j + 1] = cur_xy\r\n \r\nans = 0\r\n\r\nfor i in range(0, n + 1):\r\n for j in range(i + 1, n + 1):\r\n if dp[i][j] == [0, 0]:\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nrs = 0\r\na = [s[i:j+1] for i in range(n) for j in range(i + 1,n)]\r\nfor i in a:\r\n if i.count('L') == i.count('R') and i.count('U') == i.count('D'):\r\n rs+=1\r\nprint(rs)", "def main():\r\n\tn = int(input())\r\n\ts = input()\r\n\tprint(solver(s))\r\n\r\ndef solver(s):\r\n\tcount = 0\r\n\tfor i in range(len(s)):\r\n\t\tfor j in range(i+1, len(s) + 1):\r\n\t\t\tif substring(s[i:j]):\r\n\t\t\t\tcount += 1\r\n\treturn count\r\n\r\ndef substring(s):\r\n\thorizontal = 0\r\n\tvertical = 0\r\n\tfor c in s:\r\n\t\tif c == \"U\":\r\n\t\t\tvertical += 1\r\n\t\telif c == \"D\":\r\n\t\t\tvertical -= 1\r\n\t\telif c == \"L\":\r\n\t\t\thorizontal -= 1\r\n\t\telif c == \"R\":\r\n\t\t\thorizontal += 1\r\n\treturn horizontal == 0 and vertical == 0\r\n\r\nmain()\r\n#print(solver(\"RLRLRLR\"))", "ans=0\r\na={\"U\":0,\"D\":0,\"R\":0,\"L\":0}\r\nn = int(input());s = input()\r\nfor i in range(n-1):\r\n j=2\r\n while j+i<=n:\r\n for k in s[i:i+j]:a[k]+=1\r\n if a['U']==a['D'] and a['L'] == a['R']:ans+=1\r\n a['U']=a['D']=a['L']=a['R']=0\r\n j+=2\r\nprint(ans)\r\n", "import sys\n\n\n\ndef is_closed(s):\n return s.count(\"L\") == s.count(\"R\") and s.count(\"D\") == s.count(\"U\")\n\n\ndef main():\n sys.stdin.readline()\n s = sys.stdin.readline()\n\n res = 0\n for i in range(len(s) - 1):\n for j in range(i + 1, len(s)):\n res += is_closed(s[i:j])\n\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\ns = input()\r\n\r\nc = 0\r\nfor i in range(n - 1):\r\n for j in range(i + 1, n):\r\n x = 0\r\n y = 0\r\n k = i\r\n while k <= j:\r\n if s[k] == 'R':\r\n x += 1\r\n elif s[k] == 'L':\r\n x -= 1\r\n elif s[k] == 'U':\r\n y += 1\r\n else:\r\n y -= 1\r\n k += 1\r\n if x == 0 and y == 0:\r\n c += 1\r\n\r\nprint(c)", "n = int(input())\ns = str(input())\n\nsubs = res = [s[i: j] for i in range(len(s)) for j in range(i + 1, len(s) + 1) ]\ntotal = 0\n\nfor i in subs:\n if len(i) % 2 == 0:\n count_d = 0\n count_u = 0\n count_l = 0\n count_r = 0\n for letra in i:\n if(letra == 'D'):\n count_d += 1\n elif(letra == 'U'):\n count_u += 1\n elif(letra == 'R'):\n count_r += 1\n elif(letra == 'L'):\n count_l += 1\n if(count_d == count_u and count_l == count_r):\n total += 1\n\nprint(total)\n \t \t\t\t \t\t \t \t\t\t \t\t \t\t\t \t", "# strs = [input() for _ in range(3)]\n\ndef main():\n\tn = int(input())\n\ts = input()\n\n\tcnt = 0\n\tfor i in range(n):\n\t\tvert = horiz = 0\n\t\tfor j in range(i, n):\n\t\t\tif s[j] == 'U':\n\t\t\t\tvert += 1\n\t\t\telif s[j] == 'R':\n\t\t\t\thoriz += 1\n\t\t\telif s[j] == 'D':\n\t\t\t\tvert -= 1\n\t\t\telse:\n\t\t\t\thoriz -= 1\n\t\t\tif vert == 0 and horiz == 0:\n\t\t\t\tcnt += 1\n\n\tprint(cnt)\n\n\n\n\nmain()\n\n\n", "#!/usr/bin/env python3\r\n\r\nn = int(input())\r\ns = input()\r\n\r\ncount = 0\r\nfor i in range(0, len(s)):\r\n x, y = 0, 0\r\n for j in (range(i, len(s))):\r\n if s[j] == 'U':\r\n y += 1\r\n elif s[j] == 'R':\r\n x += 1\r\n elif s[j] == 'D':\r\n y -= 1\r\n elif s[j] == 'L':\r\n x -= 1\r\n else:\r\n assert False\r\n\r\n if x == 0 and y == 0:\r\n count += 1\r\n\r\nprint(count)\r\n", "def retorna(caminho):\n l, r, u, d = 0, 0, 0, 0\n\n for e in caminho:\n if e == 'L':\n l += 1\n elif e == 'R':\n r += 1\n elif e == 'U':\n u += 1\n elif e == 'D':\n d += 1\n if l == r and u == d and u + d + l + r != 0:\n return True\n\n return False\n\nn = int(input())\nmoves = input()\nif n == 1:\n print(0)\nelse:\n i = 0\n ans = 0\n while i < n - 1:\n for j in range(1, len(moves)):\n if retorna(moves[i:j+1]):\n ans += 1\n i += 1\n print(ans)\n\t\t \t\t\t\t \t \t\t\t \t\t \t \t \t\t\t \t", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\ndef substring(s, t):\r\n ans = 0\r\n ln = len(s)\r\n lst = []\r\n for i in range(t, ln+1):\r\n lst.append(s[i-t:i])\r\n\r\n for word in lst:\r\n if word.count(\"R\") == word.count(\"L\") and word.count(\"D\") == word.count(\"U\"):\r\n ans += 1\r\n\r\n return ans\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nfinal_ans = 0\r\nfor i in range(2, n+1, 2):\r\n final_ans += substring(s, i)\r\n\r\nprint(final_ans)\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\np=(0,0)\r\nd={p:1}\r\nfor i in s:\r\n if i=='R':\r\n p=(p[0],p[1]+1)\r\n if i=='L':\r\n p=(p[0],p[1]-1)\r\n if i=='U':\r\n p=(p[0]+1,p[1])\r\n if i=='D':\r\n p=(p[0]-1,p[1])\r\n d.update({p:d.get(p,0)+1})\r\nsm=0\r\nfor j in d:\r\n x=d.get(j)\r\n sm+=(x-1)*x//2\r\nprint(sm)\r\n", "def f(t):\r\n return t.count('U') == t.count('D') and t.count('L') == t.count('R')\r\nn, s = int(input()), input()\r\nprint(sum(f(s[i:j]) for i in range(n) for j in range(i + 1, n + 1)))", "n = int(input())\ns = input().rstrip()\n\ncount = 0\nfor i in range(len(s)):\n for j in range(i, len(s)):\n x, y = 0, 0\n for c in s[i:j+1]:\n if c == 'U':\n y += 1\n elif c == 'D':\n y -= 1\n elif c == 'L':\n x += 1\n elif c == 'R':\n x -= 1\n if x == 0 and y == 0:\n count += 1\n\nprint(count)\n", "len_initial = int(input())\nSequence = input()\ndef my_func(my_str):\n up_counter = 0\n right_counter = 0\n for i in range(len(my_str)):\n if my_str[i] == \"U\":\n up_counter += 1\n elif my_str[i] == \"D\":\n up_counter -= 1\n elif my_str[i] == \"R\":\n right_counter += 1\n else:\n right_counter -= 1\n if up_counter == 0 and right_counter == 0:\n return 1\n else:\n return 0\ncounter = 0\nfor i in range(len_initial):\n for j in range(i + 2, len_initial + 1, 2):\n counter += my_func(Sequence[i:j])\nprint(counter)", "n=int(input())\na=[]\na=input()\ncount=0\ni=0\nj=0\nwhile(i<len(a)):\n\tj=i\n\twhile(j<len(a)):\n\t\tcountL=a[i:j+1].count('L')\n\t\tcountU=a[i:j+1].count('U')\n\t\tcountR=a[i:j+1].count('R')\n\t\tcountD=a[i:j+1].count('D')\n\t\tif(countL==countR and countU==countD):\n\t\t\tcount=count+1\t\t\n\t\tj=j+1\t\n\ti=i+1\nprint(count)", "def main():\r\n from collections import defaultdict\r\n \r\n d = defaultdict(int)\r\n d[(0, 0)] += 1\r\n n = int(input())\r\n s = input()\r\n x = y = 0\r\n res = 0\r\n for i in s:\r\n if i == 'U': x += 1\r\n elif i == 'D': x -= 1\r\n elif i == 'L': y += 1\r\n else: y -= 1\r\n res += d[(x, y)]\r\n d[(x, y)] += 1\r\n \r\n print(res)\r\n \r\n \r\nmain()", "n = int(input())\r\ns = input()\r\nt = []\r\nfor i in range(len(s)):\r\n for j in range(len(s), i, -1):\r\n t.append(s[i:j])\r\ncnt = 0\r\nfor i in t:\r\n if i.count('U') == i.count('D') and i.count('R') == i.count('L'):\r\n cnt += 1\r\nprint(cnt)", "n = int(input())\r\nst = input()\r\nb = 0\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n+1):\r\n if len(st[i:j])%2 == 0:\r\n l = 0\r\n u = 0\r\n r = 0\r\n d = 0\r\n for k in st[i:j]:\r\n if k == \"L\":\r\n l = l+1\r\n elif k == \"U\":\r\n u = u +1\r\n elif k == \"D\":\r\n d = d + 1\r\n elif k == \"R\":\r\n r = r + 1\r\n if l==r and d == u:\r\n b = b + 1\r\nprint(b)", "\r\n\r\nn = int(input())\r\ns = str(input())\r\ncounter = 0\r\nfor i in range(len(s) - 1):\r\n v = 0\r\n g = 0\r\n if s[i] == \"U\":\r\n v += 1\r\n elif s[i] == \"D\":\r\n v -= 1\r\n elif s[i] == \"L\":\r\n g -= 1\r\n else:\r\n g += 1\r\n for j in range(i + 1, len(s)):\r\n if s[j] == \"U\":\r\n v += 1\r\n elif s[j] == \"D\":\r\n v -= 1\r\n elif s[j] == \"L\":\r\n g -= 1\r\n else:\r\n g += 1\r\n if v == 0 and g == 0:\r\n counter += 1\r\nprint(counter)", "n=int(input())\r\ns=input()\r\ncount=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n x=s[i:j+1]\r\n if x.count(\"R\")==x.count(\"L\") and x.count(\"U\")==x.count(\"D\"):\r\n count+=1\r\nprint(count)", "n = int(input())\r\ns = input()\r\n\r\ndef udrl(z):\r\n\tl = [0, 0]\r\n\tfor i in z:\r\n\t\tif i == 'U': l[1] += 1\r\n\t\telif i == 'D': l[1] -= 1\r\n\t\telif i == 'L': l[0] -= 1\r\n\t\telif i == 'R': l[0] += 1\r\n\treturn l\r\n\r\nk = 0\r\nfor i in range(len(s)):\r\n\tfor j in range(i, len(s)):\r\n\t\tif udrl(s[i:j+1]) == [0, 0]:\r\n\t\t\tk += 1\r\n\r\nprint(k)", "n = int(input())\r\nstr = input()\r\nans = 0\r\nfor a in range(n+1):\r\n for b in range(n+1):\r\n if a<b:\r\n x, y = 0, 0\r\n s = ''\r\n for c in str[a:b]:\r\n if c == 'U':\r\n y+=1\r\n if c == 'R':\r\n x-=1\r\n if c == 'D':\r\n y-=1\r\n if c == 'L':\r\n x+=1\r\n if x == 0 and y == 0:\r\n ans+=1\r\nprint(ans)\r\n\t\t\t \r\n", "I=input\r\nR=range\r\nC=str.count\r\nn=int(I())\r\ns=I()\r\na=[(0,0,0,0)]\r\nfor i in R(1,n+1):t=s[:i];a+=[(C(t,'L'),C(t,'R'),C(t,'U'),C(t,'D'))]\r\nprint(sum((a[j][0]+a[i][1]==a[i][0]+a[j][1] and a[j][2]+a[i][3]==a[j][3]+a[i][2])for i in R(n) for j in R(i+1,n+1)))", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor i in range(n):\r\n for t in range(i + 1):\r\n s1 = s[t : i + 1]\r\n x = 0\r\n y = 0\r\n for e in range(len(s1)):\r\n if s1[e] == 'U':\r\n y += 1\r\n elif s1[e] == 'R':\r\n x += 1\r\n elif s1[e] == 'D':\r\n y -= 1\r\n else:\r\n x -= 1\r\n if x == y == 0:\r\n ans += 1\r\nprint(ans)\r\n", "def f(t):\r\n res = 0\r\n x, y = 0, 0\r\n for i in t:\r\n x += d[i][0]\r\n y += d[i][1]\r\n return (x, y) == (0, 0)\r\n\r\nn = int(input())\r\ns = input()\r\nd = {'U': (1, 0), 'R': (0, 1), 'D': (-1, 0), 'L': (0, -1)}\r\ncnt = 0\r\nfor L in range(n):\r\n for R in range(L, n):\r\n if f(s[L:R + 1]):\r\n cnt += 1\r\nprint(cnt)\r\n", "n = int(input())\n\ncmds = list(input())\n\nans = 0\n\nx = 0\ny = 0\nfor i in range(n):\n for j in range(i, n):\n x = 0\n y = 0\n for k in range(i, j + 1):\n if cmds[k] == \"U\":\n y += 1\n elif cmds[k] == \"D\":\n y -=1\n elif cmds[k] == \"L\":\n x -= 1\n else:\n x += 1\n if x == 0 and y == 0: ans += 1\n\nprint(ans)\n", "import sys\r\n\r\n# sys.stdin = open(\"ivo.in\")\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nmoves = sys.stdin.readline()\r\n\r\nup = []\r\nleft = []\r\nright = []\r\ndown = []\r\n\r\nfor i in range(n + 1):\r\n up.append(0)\r\n right.append(0)\r\n down.append(0)\r\n left.append(0)\r\n\r\nfor i in range(n):\r\n if moves[i] == 'U':\r\n up[i + 1] += 1\r\n elif moves[i] == 'D':\r\n down[i + 1] += 1\r\n elif moves[i] == 'L':\r\n left[i + 1] += 1\r\n elif moves[i] == 'R':\r\n right[i + 1] += 1\r\n\r\nfor i in range(1, n + 1):\r\n up[i] += up[i - 1]\r\n down[i] += down[i - 1]\r\n right[i] += right[i - 1]\r\n left[i] += left[i - 1]\r\n\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n horizontal = up[j + 1] - up[i] - (down[j + 1] - down[i])\r\n vertical = right[j + 1] - right[i] - (left[j + 1] - left[i])\r\n if horizontal == 0 and vertical == 0:\r\n ans += 1\r\n\r\n\r\nprint(ans)", "def noMove(cmd,n):\n x = 0\n y = 0\n\n for i in range(n):\n if cmd[i] == 'U':\n y += 1\n elif cmd[i] == 'R':\n x += 1\n elif cmd[i] == 'D':\n y -= 1\n else:\n x -= 1\n\n if (x,y) == (0,0):\n return True\n else:\n return False\n\ndef css(cmd,n):\n count = 0\n \n for i in range(n):\n c = i+1\n for j in range(n-i):\n t = cmd[j:j+c]\n if noMove(t,c) == True:\n count += 1\n\n return count\n\nn = int(input())\ncmd = list(input())\nprint(css(cmd,n))\n", "d={'L':1,'R':-1,'U':1,'D':-1}\r\nn=int(input())\r\ns=input()\r\ni=0;j=2;cnt=0\r\nwhile True:\r\n while True:\r\n LR=0;UD=0\r\n #print(s[i:i+j])\r\n for k in s[i:i+j]:\r\n if k in 'LR': LR+=d[k] \r\n else: UD+=d[k]\r\n if LR==0 and UD==0: cnt+=1\r\n j+=2\r\n if i+j>n: i+=1; j=2; break\r\n if i+j>n: break\r\nprint(cnt)", "def solve(s,n):\r\n ans=1\r\n for i in range(n):\r\n x,y=0,0\r\n for j in range(i,n):\r\n\r\n if s[j]=='L':\r\n x-=1\r\n if s[j]=='R':\r\n x+=1\r\n if s[j]=='U':\r\n y+=1\r\n if s[j]=='D':\r\n y-=1\r\n if x==0 and y==0:ans+=1\r\n print(ans-1)\r\n\r\nn=int(input())\r\ns=input()\r\nsolve(s,n)", "dic = {'vert':0,'horz':0}\r\ncopydic = dic.copy()\r\nn = int(input())\r\ns = input()\r\ncount = 0\r\ndics = {'U':1,'D':-1,'L':-1,'R':1}\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if s[j]=='U' or s[j]=='D':\r\n dic['vert'] += dics[s[j]]\r\n else:\r\n dic['horz'] += dics[s[j]]\r\n if dic['vert']==dic['horz']==0:\r\n count += 1\r\n dic = copydic.copy()\r\nprint(count)", "n = int(input())\r\ns = input()\r\na = 0\r\nfor x in range(n):\r\n for y in range(x + 1, n + 1):\r\n t = s[x:y]\r\n p = q = 0\r\n for z in t:\r\n if z == \"R\":\r\n p += 1\r\n elif z == \"L\":\r\n p -= 1\r\n elif z == \"U\":\r\n q += 1\r\n else:\r\n q -= 1\r\n if p == q == 0:\r\n a += 1\r\nprint(a)", "t=int(input())\r\na=input()\r\nfinal=[]\r\nfor i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n req=a[i:j+1]\r\n final.append(req)\r\nc=0\r\nfor i in final:\r\n if i.count(\"U\")==i.count(\"D\") and i.count(\"R\")==i.count(\"L\"):\r\n c+=1\r\nprint(c)\r\n \r\n \r\n", "def main():\n input()\n d = {(0, 0): 1}\n x = y = 0\n for c in input():\n if c == \"R\":\n x += 1\n elif c == \"L\":\n x -= 1\n elif c == \"U\":\n y += 1\n else:\n y -= 1\n d[x, y] = d.get((x, y), 0) + 1\n print(sum(v * (v - 1) for v in d.values()) // 2)\n\n\nif __name__ == '__main__':\n main()\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n \r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n s = str(input())\r\n\r\n x,y,ans = 0,0,0\r\n\r\n for i in range(n):\r\n for j in range(i,n):\r\n x,y = 0,0\r\n for k in range(i,j+1):\r\n if s[k] == 'R':\r\n x += 1\r\n if s[k] == 'L':\r\n x -= 1\r\n if s[k] == 'U':\r\n y -= 1\r\n if s[k] == 'D':\r\n y += 1\r\n if x == 0 and y == 0:\r\n ans += 1\r\n print(ans)", "n = int(input())\ns = str(input())\n\nsubs = res = [s[i: j] for i in range(len(s)) for j in range(i + 1, len(s) + 1) ]\ntotal = 0\n\nfor i in subs:\n if len(i) % 2 == 0:\n countD = 0\n countU = 0\n countR = 0\n countL = 0\n for letra in i:\n if(letra == 'D'):\n countD += 1\n elif(letra == 'U'):\n countU += 1\n elif(letra == 'R'):\n countR += 1\n elif(letra == 'L'):\n countL += 1\n if(countD == countU and countL == countR):\n total += 1\n\nprint(total)", "n = int(input())\ntext = input()\ncounter = 0\n\nfor i in range(n):\n for j in range(i+1, n, 1):\n dx=dy = 0\n command = text[i:j+1]\n m = len(command)\n for k in range(m):\n if(command[k]=='U'):\n dy+=1\n elif(command[k]=='R'):\n dx+=1\n elif(command[k]=='D'):\n dy-=1\n elif(command[k]=='L'):\n dx-=1\n counter+= 1 if dx==0 and dy==0 else 0\n\nprint(counter)\n \t\t \t\t\t \t \t\t\t \t \t\t\t\t\t \t", "n = int(input())\r\ns = input()\r\ncnt = 0\r\nud=0\r\nlr=0\r\n\r\nfor i in range(n):\r\n\tud,lr = 0,0\r\n\tif s[i]==\"U\":\r\n\t\tud=1\r\n\telif s[i]==\"D\":\r\n\t\tud=-1\r\n\telif s[i]==\"R\":\r\n\t\tlr=1\r\n\telif s[i]==\"L\":\r\n\t\tlr=-1\r\n\tfor j in range(i+1,n):\r\n\t\tif s[j]==\"U\":\r\n\t\t\tud+=1\r\n\t\telif s[j]==\"D\":\r\n\t\t\tud-=1\r\n\t\telif s[j]==\"R\":\r\n\t\t\tlr+=1\r\n\t\telif s[j]==\"L\":\r\n\t\t\tlr-=1\r\n\t\tif lr==0 and ud==0:\r\n\t\t\tcnt+=1\r\n\r\nprint(cnt)", "#!/usr/bin/env python\r\n\r\ndef main():\r\n n = int(input())\r\n chars = input()\r\n res = 0\r\n for i in range(n-1):\r\n initial = [0, 0]\r\n for c in chars[i:]:\r\n if c == 'U':\r\n initial[0] += 1\r\n elif c == 'D':\r\n initial[0] -= 1\r\n elif c == 'R':\r\n initial[1] += 1\r\n else:\r\n initial[1] -= 1\r\n\r\n if initial[0] == 0 and initial[1] == 0:\r\n res += 1\r\n print(res)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nstring = input()\r\ncounter = 0\r\nfor i in range(1, n+1):\r\n for j in range(n - i + 1):\r\n if string[j: j + i].count(\"U\") == string[j: j + i].count(\"D\") and \\\r\n string[j: j + i].count(\"L\") == string[j: j + i].count(\"R\"):\r\n counter += 1\r\nprint(counter)\r\n", "n = int(input())\r\n\r\ns = input()\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n mp = {\r\n 'U' : 0,\r\n 'D' : 0,\r\n 'L' : 0,\r\n 'R' : 0\r\n }\r\n for j in range(i,n):\r\n mp[s[j]] = (mp[s[j]] + 1)\r\n if mp['U'] == mp['D'] and mp['L'] == mp['R']:\r\n count += 1\r\n\r\nprint(count)", "a = int(input())\r\nans = 0\r\ntest_str = input()\r\nres = [test_str[i: j] for i in range(len(test_str))\r\n for j in range(i + 1, len(test_str) + 1)]\r\nfor i in range(len(res)):\r\n if (res[i].count('U') == res[i].count('D')) and (res[i].count('R') == res[i].count('L')):\r\n ans += 1 \r\nprint(ans)", "n = int(input())\r\ns=input()\r\nans=0\r\nfor i in range(n-1):\r\n for j in range(i+1,n):\r\n k=s[i:j+1]\r\n u=0\r\n d=0\r\n for a in k:\r\n if a=='U':\r\n u+=1\r\n elif a=='D':\r\n u-=1\r\n elif a=='R':\r\n d+=1\r\n elif a=='L':\r\n d-=1\r\n if u==0 and d==0:\r\n ans+=1 \r\nprint(ans)\r\n", "def fuck(s):\r\n c=[0,0]\r\n for x in s:\r\n if x=='U':c[1]+=1\r\n if x=='D':c[1]-=1\r\n if x=='R':c[0]+=1\r\n if x=='L':c[0]-=1\r\n if c==[0,0]:return True\r\n else: return False\r\n\r\nn=int(input())\r\ns=input()\r\nres=0\r\nfuckthis = [s[i: j] for i in range(len(s))\r\n for j in range(i + 1, len(s) + 1)]\r\n\r\nfor x in fuckthis:\r\n if fuck(x):res+=1\r\n\r\nprint(res)", "n = int(input())\r\ns = input()\r\nsum=0\r\nfor i in range(n):\r\n\tfor j in range(i+1,n+1):\r\n\t\t#print(s[i:j])\r\n\t\tif s[i:j].count('L')==s[i:j].count('R') and s[i:j].count('U')==s[i:j].count('D'):\r\n\t\t\tsum+=1\r\nprint(sum)\t\t\t", "ea = int(input())\njalur = input()\nancol=0\nfor i in range(ea-1):\n\tu=0\n\td=0\n\tl=0\n\tr=0\n\tfor k in (jalur[i:]):\n\t\tif k=='U': u+=1\n\t\telif k=='D': d+=1\n\t\telif k=='L': l+=1\n\t\telse: r+=1\n\t\tif (u-d)==0 and (l-r)==0: ancol+=1\nprint(ancol)\n\t\t\t\t \t\t \t \t \t \t\t\t \t \t", "def chRet(st):\n ud = 0\n lr = 0\n for k in st:\n if k == 'U':\n ud += 1\n elif k == 'D':\n ud -= 1\n elif k == 'R':\n lr += 1\n elif k == 'L':\n lr -= 1\n if (len(st) > 0 and ud == 0 and lr == 0):\n return 1\n else:\n return 0\n\nn = int(input())\ns = input()\nc = 0\n\nfor i in range(0, n):\n for j in range(2, n+1, 1):\n c += chRet(s[i:j])\n \nprint(c)\n \t \t \t\t\t \t\t\t \t\t \t \t\t\t\t", "n=int(input())\r\na=input()\r\nb=[]\r\nb.append([0,0])\r\nx=y=ans=0\r\nfor i in range(n):\r\n if a[i]==\"U\":\r\n y+=1\r\n b.append([x,y])\r\n elif a[i]==\"D\":\r\n y-=1\r\n b.append([x,y])\r\n elif a[i]==\"L\":\r\n x-=1\r\n b.append([x,y])\r\n elif a[i]==\"R\":\r\n x+=1\r\n b.append([x,y])\r\nfor i in range(n-1):\r\n for j in range(i+2,n+1):\r\n if b[i]==b[j]:\r\n ans+=1\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\nans = 0\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(s)):\r\n m = {'L':0, 'R': 0, 'U':0, 'D':0}\r\n s1 = s[i:j + 1]\r\n for x in s1:\r\n m[x] += 1\r\n if m['L'] == m['R'] and m['U'] == m['D']:\r\n ans += 1\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\n\r\nc = 0\r\nfor j in range(n):\r\n a, b = 0, 0\r\n for i in range(j, n):\r\n if s[i] == 'D':\r\n b -= 1\r\n elif s[i] == 'U':\r\n b += 1\r\n elif s[i] == 'R':\r\n a += 1\r\n else:\r\n a -= 1\r\n if a == b == 0:\r\n c += 1\r\nprint(c)", "#626A\r\nn = int(input())\r\ns = list(input())\r\ni = 0\r\ncounter = 0\r\nwhile i < n:\r\n ans = []\r\n for j in range(i,n):\r\n ans.append(s[j])\r\n if ans.count('L') == ans.count(\"R\") and ans.count(\"D\") == ans.count(\"U\"):\r\n counter += 1\r\n i += 1\r\nprint(counter)\r\n", "import sys\n\nn = int(sys.stdin.readline())\n\ncommands = list(sys.stdin.readline().strip())\n\ni = 0\nj = 0\ncount = 0\nfor i, elem in enumerate(commands):\n u = 0\n d = 0\n l = 0\n r = 0\n \n for j, elem2 in enumerate(commands[i:]):\n if elem2 == 'U':\n u+=1\n elif elem2 == 'D':\n d-=1\n elif elem2 == 'L':\n l-=1\n elif elem2 == 'R':\n r+=1\n j+=1\n if (u+d==0) and (l+r ==0):\n count += 1\n\nprint (count) \n# 1487804109709\n", "def man(daf):\r\n res = [0, 0]\r\n for x in daf:\r\n if x == 'U':\r\n res[1] += 1\r\n elif x == 'D':\r\n res[1] -= 1\r\n elif x == 'L':\r\n res[0] -= 1\r\n else:\r\n res[0] += 1\r\n return res\r\n\r\nn = int(input())\r\ndaf = list(input())\r\n\r\ntotal = 0\r\n\r\nfor i in range(n):\r\n for j in range(i+1, n+1):\r\n daf2 = daf[i:j]\r\n if man(daf2) == [0, 0]:\r\n total += 1\r\n\r\nprint(total)\r\n", "n=int(input())\r\nl=input()\r\nc=0\r\nfor i in range(n-1):\r\n for j in range(i+2,n+1):\r\n t=l[i:j]\r\n if t.count(\"L\")==t.count(\"R\") and t.count(\"U\")==t.count(\"D\"):\r\n c +=1\r\nprint(c)\r\n \r\n \r\n", "# You lost the game.\nn = int(input())\nch = str(input())\nr = 0\na = 0\nb = 0\nT = [[0,0]]\nfor k in range(n):\n if ch[k] == \"U\":\n a += 1\n elif ch[k] == \"D\":\n a -= 1\n elif ch[k] == \"R\":\n b += 1\n else:\n b -= 1\n T += [[a,b]]\n\nfor i in range(1,n+1):\n for j in range(i):\n if T[j] == T[i]:\n r+=1\n \nprint(r)\n\n", "n=int(input())\r\ns=input()\r\nd={'L':[0,-1],'R':[0,1],'U':[-1,0],'D':[1,0]}\r\na=[[0,0]]\r\nfor i in s:\r\n a.append([a[-1][0]+d[i][0], a[-1][1]+d[i][1]])\r\nx=0\r\nfor i in range(n):\r\n for j in range(i+2,n+1):\r\n if a[j][0]-a[i][0]==a[j][1]-a[i][1]==0:\r\n x+=1\r\nprint(x)\r\n", "n=eval(input())\r\ns=input()\r\ni=0\r\nans=0\r\nwhile(i<n):\r\n r,l,u,d=0,0,0,0\r\n g=i\r\n while(g<n):\r\n if(s[g]=='R'):\r\n r+=1\r\n elif(s[g]=='L'):\r\n l+=1\r\n elif(s[g]=='U'):\r\n u+=1 \r\n elif(s[g]=='D'):\r\n d+=1\r\n \r\n if(d==u and l ==r):\r\n ans+=1\r\n g+=1 \r\n i+=1\r\nprint(ans) \r\n", "n = int(input())\r\ns = input()\r\na,b = 0,0\r\nE = [[0,0]]\r\ntimes = [1]\r\nfor i in range(n):\r\n if s[i] == \"U\":\r\n b += 1\r\n elif s[i] == \"R\":\r\n a += 1\r\n elif s[i] == \"D\":\r\n b -= 1\r\n else:\r\n a -= 1\r\n if [a,b] not in E:\r\n E.append([a,b])\r\n times.append(1)\r\n else:\r\n times[E.index([a,b])] += 1\r\nc = 0\r\nfor i in times:\r\n c += (i*(i-1))//2\r\nprint(c) ", "import sys\n\nsys.stdin.readline()\nline = sys.stdin.readline().strip()\n\ncount = 0\nfor i, elem in enumerate(line):\n up, down, left, right = 0,0,0,0\n\n for sub in line[i:]:\n if sub == \"U\":\n up += 1\n if sub == \"D\":\n down -= 1\n if sub == \"R\":\n right += 1\n if sub == \"L\":\n left -= 1\n \n if up + down == 0 and left + right == 0:\n count += 1\n\nprint (count )\n# 1487962066260\n", "tam = int(input())\nstring = input()\n\ntotal = 0\nsubstrings = [string[i: j] for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\n#print(substrings)\n\nmultiplas = []\nfor sub in substrings:\n if len(sub) % 2 == 0:\n multiplas.append(sub)\n\n#print(multiplas)\nfor palavra in multiplas:\n countD = 0\n countU = 0\n countR = 0\n countL = 0\n for letra in palavra:\n if(letra == 'D'):\n countD += 1\n elif(letra == 'U'):\n countU += 1\n elif(letra == 'R'):\n countR += 1\n elif(letra == 'L'):\n countL += 1\n if(countD == countU and countL == countR):\n total += 1\n\nprint(total)\n\n'''\nInput\n6\nURLLDR\nOutput\n2\nInput\n4\nDLUU\nOutput\n0\nInput\n7\nRLRLRLR\nOutput\n12\n'''\n\t\t\t \t \t \t \t \t \t \t \t\t \t \t\t", "def main():\n n = int(input())\n command = input()\n count = 0\n\n for i in range(n - 1):\n counts = {'U': 0, 'D': 0, 'L': 0, 'R': 0}\n\n for j in range(i, n):\n counts[command[j]] += 1\n\n if counts['U'] == counts['D'] and counts['L'] == counts['R']:\n count += 1\n\n print(count)\n\n\nif __name__ == '__main__':\n main()\n", "a,b,count=int(input()),input(),0\r\nfor i in range(a-1):\r\n for j in range(i+1,a):\r\n c=b[i:j+1]\r\n if c.count('D')==c.count('U') and c.count('L')==c.count('R'):count+=1\r\nprint(count)", "if __name__=='__main__':\r\n n = int(input())\r\n d = input()\r\n count = 0\r\n i=0\r\n def setDi(di,hori,veri):\r\n if di in ['U','D']:\r\n if di=='U': veri+=1\r\n else: veri-=1\r\n elif di in ['L','R']:\r\n if di=='R': hori+=1\r\n else: hori-=1\r\n return hori,veri\r\n \r\n while i <=len(d)-2:\r\n hori,veri =0,0\r\n #hori,veri = setDi(d[i],hori,veri)\r\n if d[i] in ['U','D']:\r\n if d[i]=='U': veri+=1\r\n else: veri-=1\r\n elif d[i] in ['L','R']:\r\n if d[i]=='R': hori+=1\r\n else: hori-=1\r\n j=i+1\r\n while j<=len(d)-1:\r\n #print (d[i],d[j],'count',count,hori,veri)\r\n if d[j]=='U':\r\n veri+=1\r\n elif d[j]=='D':\r\n veri-=1\r\n elif d[j]=='L':\r\n hori-=1\r\n elif d[j]=='R':\r\n hori+=1\r\n #print (hori,veri)\r\n if veri==0 and hori==0:\r\n count+=1\r\n #break\r\n j+=1\r\n i+=1\r\n print (count)\r\n \r\n", "n=int(input())\r\nk=0\r\nk1=0\r\nd={\"0,0\":1}\r\ns=input()\r\nfor x in s :\r\n if x==\"U\" :\r\n k+=1\r\n if x==\"D\" :\r\n k-=1\r\n if x==\"R\" :\r\n k1+=1\r\n if x==\"L\" :\r\n k1-=1\r\n w=str(k)+','+str(k1)\r\n d[w]=d.get(w,0)+1\r\ncou=0\r\nfor x in d :\r\n for i in range(1,d[x]) :\r\n cou+=i\r\nprint(cou)\r\n \r\n", "n = int(input())\nstr1 = input()\ncount = 0\nfor i in range(0, n):\n\tfor j in range(i+1, n+1):\n\t\tsubstr = str1[i:j]\n\t\tif(substr.count('U') == substr.count('D') and substr.count('L') == substr.count('R')):\n\t\t\tcount += 1\nprint(count)", "n = int(input())\r\nwcz = input()\r\nwyn = 0\r\nfor i in range(n):\r\n x = 0\r\n y = 0\r\n for j in range(i, n):\r\n if wcz[j] == 'U':\r\n x -= 1\r\n if wcz[j] == 'D':\r\n x += 1\r\n if wcz[j] == 'L':\r\n y -= 1\r\n if wcz[j] == 'R':\r\n y += 1\r\n if x == 0 and y == 0:\r\n wyn += 1\r\nprint(wyn)# 1698246749.0981998", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\nn = int(input().strip())\r\narr = list(input().strip())\r\nans = 0\r\n\r\nfor i in range(n):\r\n x, y = 0, 0\r\n for j in range(i,n):\r\n if arr[j] == 'U':\r\n y += 1\r\n elif arr[j] == 'D':\r\n y -= 1\r\n elif arr[j] == 'L':\r\n x -= 1\r\n else:\r\n x += 1\r\n if x == 0 and y == 0:\r\n ans += 1\r\n\r\nprint(ans)\r\n ", "import math\nn = int(input())\n\ntask = input()\nl = [[0,0]]\ndrp = {}\n\ndrp[(0,0)] = 1\nc = 0 \n\nfor i in task :\n\tif i == 'U' :\n\t\tl.append([ l[-1][0] , l[-1][1]+1 ])\n\t\tif tuple(l[-1]) not in drp :\n\t\t\tdrp[tuple(l[-1])] = 1\n\t\telse:\n\t\t\tdrp[tuple(l[-1])] += 1\n\tif i == 'D' :\n\t\tl.append([ l[-1][0] , l[-1][1]-1 ])\n\t\tif tuple(l[-1]) not in drp :\n\t\t\tdrp[tuple(l[-1])] = 1\n\t\telse:\n\t\t\tdrp[tuple(l[-1])] += 1\n\tif i == 'L' :\n\t\tl.append([ l[-1][0]-1 , l[-1][1] ])\n\t\tif tuple(l[-1]) not in drp :\n\t\t\tdrp[tuple(l[-1])] = 1\n\t\telse:\n\t\t\tdrp[tuple(l[-1])] += 1\n\tif i == 'R' :\n\t\tl.append([ l[-1][0]+1 , l[-1][1] ])\n\t\tif tuple(l[-1]) not in drp :\n\t\t\tdrp[tuple(l[-1])] = 1\n\t\telse:\n\t\t\tdrp[tuple(l[-1])] += 1\nfor k,v in drp.items() :\n\tif v >=2 :\n\t\tc += (math.factorial(v)//2)//(math.factorial(v-2))\n\nprint(c)\n", "def count(s):\n cnt = x = y = 0\n for c in s:\n x += 1 if c == \"R\" else -1 if c == \"L\" else 0\n y += 1 if c == \"D\" else -1 if c == \"U\" else 0\n cnt += x == 0 and y == 0\n return cnt\nn, s = int(input()), input()\nres = sum(count(s[i:]) for i in range(len(s)))\nprint(res)\n", "n = int(input())\r\ns = input()\r\nx = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n + 1):\r\n y = s[i:j]\r\n x += y.count('U') == y.count('D') and y.count('L') == y.count('R')\r\nprint(x)", "numChars = int(input())\r\ncode = list(input())\r\nx = 0\r\ny = 0\r\ndef checkDifference(x,y, aList):\r\n moveX = 0\r\n moveY = 0\r\n for i in range(len(aList)):\r\n if aList[i] == \"U\":\r\n moveY += 1\r\n elif aList[i] == \"D\":\r\n moveY -= 1\r\n elif aList[i] == \"R\":\r\n moveX += 1\r\n elif aList[i] == \"L\":\r\n moveX -= 1\r\n if moveX == 0 and moveY == 0:\r\n return True\r\n else:\r\n return False\r\nfor i in range(len(code)):\r\n if code[i] == \"U\":\r\n y += 1\r\n elif code[i] == \"D\":\r\n y -= 1\r\n elif code[i] == \"R\":\r\n x += 1\r\n elif code[i] == \"L\":\r\n x -= 1\r\ntotal = 0\r\nfor i in range(numChars):\r\n for h in range(i, numChars):\r\n newList = code[i:h+1]\r\n if checkDifference(x, y, newList) and len(newList) != 0:\r\n total += 1\r\nprint(total)\r\n", "#!/usr/bin/env python3\nimport collections\n\ndef pair_add(a, b):\n return (a[0]+b[0], a[1]+b[1])\n\nif __name__ == '__main__':\n N = int(input())\n seq = input()\n\n trans = {'U': (-1, 0), 'D':(1, 0), 'L':(0, -1), 'R':(0, 1)}\n\n diff = [(0, 0)]\n for d in seq:\n diff.append(pair_add(diff[-1], trans[d]))\n\n cnt = collections.Counter(diff)\n res = 0\n for k, v in cnt.items():\n res += v * (v - 1)\n print(res//2)\n\n", "n = int(input())\r\nstring = input()\r\nc = []\r\nfor char in string:\r\n if char == 'U':\r\n c.append(1)\r\n if char == 'D':\r\n c.append(-1)\r\n if char == 'R':\r\n c.append(2000)\r\n if char == 'L':\r\n c.append(-2000)\r\nans = 0\r\nfor k in range(2,len(c) + 1,2): #groups of odd lentgh can NOT sum to 0\r\n for i in range(0,len(c) - k + 1):\r\n #print(c[i:i + k])\r\n t = sum(c[i:i + k])\r\n if t == 0:\r\n ans += 1\r\nprint(ans)\r\n\r\n\r\n\r\n", "def noMove(cmd):\n if (cmd.count('U'),cmd.count('R')) == (cmd.count('D'),cmd.count('L')):\n return True\n else:\n return False\n\ndef css(cmd,n):\n count = 0\n \n for i in range(n):\n c = i+1\n for j in range(n-i):\n t = cmd[j:j+c]\n if noMove(t) == True:\n count += 1\n\n return count\n\nn = int(input())\ncmd = list(input())\nprint(css(cmd,n))\n", "n = int(input())\r\ns = input()\r\n\r\nret = 0\r\nfor i in range(n):\r\n for j in range(i+1, n+1):\r\n count = {}\r\n for k in range(i, j):\r\n count[s[k]] = count.get(s[k], 0) + 1\r\n eq = len(count) > 1\r\n if \"U\" in count or \"D\" in count:\r\n if \"D\" not in count or \"U\" not in count:\r\n eq = False\r\n else:\r\n eq &= count[\"U\"] == count[\"D\"]\r\n if \"L\" in count or \"R\" in count:\r\n if \"R\" not in count or \"L\" not in count:\r\n eq = False\r\n else:\r\n eq &= count[\"L\"] == count[\"R\"]\r\n ret += eq\r\nprint(ret)\r\n", "#!/usr/bin/env python3\r\n\r\nDIR = {\r\n 'U': (-1, 0),\r\n 'R': (0, 1),\r\n 'D': (1, 0),\r\n 'L': (0, -1),\r\n}\r\n\r\ntry:\r\n while True:\r\n n = int(input())\r\n s = input()\r\n\r\n result = 0\r\n for i in range(len(s)):\r\n y = x = 0\r\n for c in s[i:]:\r\n t = DIR[c]\r\n y += t[0]\r\n x += t[1]\r\n if y == x == 0:\r\n result += 1\r\n print(result)\r\n\r\nexcept EOFError:\r\n pass\r\n", "def riku(s):\r\n ln=len(s)\r\n ans=0\r\n #print(ln)\r\n for i in range(ln):\r\n #print(i)\r\n for j in range(i,ln):\r\n #print([i,j])\r\n n=0\r\n m=0\r\n for k in range(i,j+1):\r\n if s[k]=='U':\r\n n+=1\r\n elif s[k]=='D':\r\n n-=1\r\n elif s[k]=='L':\r\n m-=1\r\n elif s[k]=='R':\r\n m+=1\r\n else:\r\n return -1\r\n if n==0 and m==0:\r\n ans+=1\r\n return ans\r\n\r\n\r\nn=int(input())\r\ns=input()\r\nprint(riku(s))\r\n", "n=int(input())\r\ns=input()\r\nc=0\r\nfor i in range(2,n+1):\r\n\tfor j in range(0,n-i+1):\r\n\t\ts2=s[j:j+i]\r\n\t\tif s2.count(\"R\")==s2.count(\"L\") and s2.count(\"U\")==s2.count(\"D\"):\r\n\t\t\tc+=1\r\n\t\t\t# print(s2)\r\nprint(c)" ]

[ "ans = 'YES'\r\n\r\nfor _ in range(8):\r\n line = input()\r\n \r\n for i in range(7):\r\n if line[i] == line[i+1]:\r\n ans = 'NO'\r\n break\r\n\r\nprint(ans) ", "ans = True\r\n\r\nfor i in range(8):\r\n s = input()\r\n for i in range(7):\r\n if s[i] == s[i+1]:\r\n ans = False\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "arr = []\r\nfor i in range(8):\r\n\tarr.append(input())\r\nfor i in range(8):\r\n\tw = arr[i].count('W')\r\n\tb = 8 - w\r\n\tif w != 4:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\tfor j in range(8):\r\n\t\tif arr[i][j] == arr[i][(j + 1) % 8]:\r\n\t\t\tprint('NO')\r\n\t\t\texit()\r\nprint('YES')\r\n", "for _ in range(8):\r\n s=input()\r\n if s==\"WBWBWBWB\" or s==\"BWBWBWBW\":\r\n continue\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "arr = []\r\nfor i in range(8):\r\n\tarr.append(input())\r\n\r\nfor i in range(8):\r\n\tif arr[i][0] == arr[i][-1]:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\n\tfor j in range(7):\r\n\t\tif arr[i][j] == arr[i][j+1]:\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\nprint(\"YES\")", "def str_inp(n):\r\n return [input() for x in range(n)]\r\n\r\n\r\ndef check(x):\r\n if x != 'WB' * 4 and x != 'BW' * 4:\r\n exit(print('NO'))\r\n return 'YES'\r\n\r\n\r\ns = str_inp(8)\r\nprint(list(map(check, s))[0])\r\n", "from sys import stdin, stdout\r\n\r\nif not __debug__:\r\n stdin = open(\"input.txt\", \"r\")\r\n\r\ntcs = int(stdin.readline()) if not __debug__ else 1\r\nt = 1\r\nwhile t<=tcs:\r\n res = True\r\n for _ in range(8):\r\n row = str(stdin.readline())\r\n for c in range(8):\r\n if row[c]==row[c-1]:\r\n res = False\r\n break\r\n \r\n print(\"YES\" if res else \"NO\")\r\n t += 1\r\n", "def go():\n for i in range(8):\n s = input()\n prv = 0\n for j in s:\n if j == prv: return False\n prv = j\n return True\n\nprint (\"YES\" if go() else \"NO\")\n", "l = []\r\n\r\nfor i in range(8):\r\n\tl.append(input())\r\n\t\r\ns = \"YES\"\r\n\t\r\nfor i in range(8):\r\n\tif l[i] not in (\"WB\" * 4, \"BW\" * 4):\r\n\t\ts = \"NO\"\r\n\t\tbreak\r\n\t\t\r\nprint(s)", "c=0\nfor i in range(8):\n t=input()\n if t=='WBWBWBWB' or t=='BWBWBWBW':\n c+=1\n else:\n c=0\nif c==8:\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", "c=[]\r\nfor i in range(8):\r\n c=c+[input()]\r\nm=0\r\nfor i in range(8):\r\n for j in range(7):\r\n if c[i][j]==c[i][j+1]:\r\n m=1\r\n if m==1:\r\n break\r\n if m==1:\r\n break\r\nif m==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n \r\n", "\r\ndef foo():\r\n table = []\r\n for i in range(8):\r\n table.append(input())\r\n\r\n w = 'W' * 4\r\n b = 'B' * 4\r\n for s in table:\r\n a1 = s[0:len(s):2]\r\n a2 = s[1:len(s):2]\r\n if not ((a1 == w and a2 == b)\r\n or (a1 == b and a2 == w)):\r\n print('NO')\r\n return\r\n print('YES')\r\n\r\nfoo()", "for i in range(8):\r\n a=input()\r\n if 'WW' in a or \"BB\" in a:\r\n print(\"NO\")\r\n exit()\r\nprint('YES') ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nans = \"YES\"\r\nfor _ in range(8):\r\n s = input()[:-1]\r\n if s.count('B') != 4:\r\n ans = \"NO\"\r\n break\r\n else:\r\n for i in range(7):\r\n if s[i] == s[i+1]:\r\n ans = \"NO\"\r\n break\r\nprint(ans)\r\n", "import sys\r\n\r\nfor i in range(8):\r\n s = input()\r\n if not (s == \"WBWBWBWB\" or s == \"BWBWBWBW\"):\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")", "chess =[]\r\nfor i in range(8):\r\n chess.append(input())\r\nflag = True\r\nfor i in range(8):\r\n for j in range(7):\r\n if chess[i][j] == chess[i][j+1]:\r\n flag = False\r\n break\r\n if not flag:\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ans = 1\r\nfor i in range(8):\r\n a = input()\r\n if a != \"WBWBWBWB\" and a != \"BWBWBWBW\":\r\n ans = 0\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def solve(grid):\r\n for row in grid:\r\n if row[0]==row[-1] or \"BB\" in row or \"WW\" in row:\r\n return \"NO\"\r\n \r\n return \"YES\"\r\n\r\nif __name__==\"__main__\":\r\n grid = []\r\n for i in range(8):\r\n row = input()\r\n grid.append(row)\r\n \r\n ans = solve(grid)\r\n print(ans)", "def read_int():\r\n return int(input())\r\n\r\n\r\ndef read_ints():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef print_nums(nums):\r\n print(\" \".join(map(str, nums)))\r\n\r\n\r\nans = True\r\nfor _ in range(8):\r\n if ans is False:\r\n break\r\n row = input()\r\n for i in range(1, 8):\r\n if row[i] == row[i-1]:\r\n ans = False\r\n break\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "c=0\r\nfor i in range(8):\r\n x=input()\r\n if(x==\"WBWBWBWB\" or x==\"BWBWBWBW\"):\r\n c+=1\r\nif(c==8):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[input() for i in range(8)]\nb=True\ni=-1\nfor i in l:\n\tfor j in range(7):\n\t\tif i[j]==i[j+1]:\n\t\t\tb=False\n\t\t\tbreak\n\tif not b:\n\t\tbreak\nif b :\n\tprint('YES')\nelse:\n\tprint('NO')\n", "from re import *\r\ndef main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n #f.readline()\r\n #input()\r\n get = lambda :[f.readline()[:-1] if mode==\"file\" else input()]\r\n for z in range(8):\r\n q=get()\r\n q=q[0]\r\n if search('BB',q)!=None or search('WW',q)!=None:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n \r\n\r\n\r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "state = \"YES\"\n\nfor _ in range(8):\n line = input()\n if sum([line[i] == line[(i + 1) % 8] for i in range(8)]) > 1: state = \"NO\"\n\nprint(state)\n \t\t\t\t\t\t \t \t\t \t\t\t\t \t\t\t\t\t\t", "board = []\r\nb, w = 'B', 'W'\r\ncheck = False\r\nfor i in range(8):\r\n board.append(str(input()))\r\nfor i in board:\r\n a = w+b\r\n if 'BB' in i or 'WW' in i:\r\n print(\"NO\")\r\n check = True\r\n break\r\n\r\n if i != a*4:\r\n i = i[-1] + i[:7]\r\n if i != a*4:\r\n print(\"NO\")\r\n check = True\r\n break\r\n b, w = w, b\r\nif check == False:\r\n print(\"YES\")", "for x in range(8):\n n = input()\n if(\"WW\" in n or \"BB\" in n):\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n \t\t\t \t\t \t\t\t \t \t \t \t", "for i in range(8):\r\n daf = input()\r\n if 'WW' in daf or 'BB' in daf:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "res = 'YES'\r\nfor i in range(8):\r\n s = input()\r\n if s != 'BWBWBWBW' and s != 'WBWBWBWB':\r\n res = 'NO'\r\nprint(res)\r\n", "i=0\r\nflag=0\r\nwhile(i<8):\r\n s=input()\r\n if(s[0]=='W'):\r\n \r\n cur='W'\r\n else:\r\n \r\n cur='B'\r\n for j in s:\r\n if cur!=j:\r\n flag=-1\r\n elif(j==cur and j=='W'):\r\n cur='B'\r\n else:\r\n cur='W'\r\n i+=1\r\nif(flag!=-1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n ", "c=1\r\nfor i in range(8):\r\n s=input()\r\n if s!=\"WBWBWBWB\" and s!=\"BWBWBWBW\":\r\n c=0\r\nif c:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "impossible = False\r\nfor i in range(8):\r\n s = input()\r\n if s != 'WBWBWBWB' and s != 'BWBWBWBW':\r\n impossible = True\r\nif impossible: print(\"NO\")\r\nelse: print('YES')", "bad = False\nfor i in range(8):\n row = input().strip()\n if row not in ('WBWBWBWB', 'BWBWBWBW'):\n bad = True\n\nif bad:\n print('NO')\nelse:\n print('YES')\n", "#!/usr/bin/env python3\r\n#! -*- coding: utf-8 -*-\r\n\r\n\r\ndef main():\r\n\ttable = []\r\n\tfor _ in range(8):\r\n\t\ttable.append(input())\r\n\tfor i in range(8):\r\n\t\twhites = table[i].count('W')\r\n\t\tblacks = 8 - whites\r\n\t\tif whites != 4:\r\n\t\t\tprint(\"NO\")\r\n\t\t\treturn\r\n\t\tfor j in range(8):\r\n\t\t\tif table[i][j] == table[i][(j + 1) % 8]:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\treturn\r\n\tprint(\"YES\")\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "correct_lines = {\n 0: 'WBWBWBWB',\n 1: 'BWBWBWBW',\n 2: 'WBWBWBWB',\n 3: 'BWBWBWBW',\n 4: 'WBWBWBWB',\n 5: 'BWBWBWBW',\n 6: 'WBWBWBWB',\n 7: 'BWBWBWBW',\n}\n\n\ndef check_line(idx, line):\n for j in range(len(line)):\n cyclic = line[j:] + line[:j]\n if cyclic == correct_lines[idx]:\n return True\n return False\n\n\nlines = []\nfor _ in range(8):\n lines.append(input())\n\nchecked_lines = [check_line(idx, line) for idx, line in enumerate(lines)]\nif False in checked_lines:\n print('NO')\nelse:\n print('YES')\n", "for i in range(8):\r\n l = input()\r\n if l != 'WBWBWBWB' and l != 'BWBWBWBW':\r\n print('NO')\r\n exit()\r\n \r\n \r\nprint('YES')", "for i in range(8):\r\n a=input()\r\n if (a.count(\"WW\")>0) or a.count(\"BB\")>0 or a[0]==a[-1]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "import re\r\n\r\nfor i in range(8):\r\n s = input()\r\n if re.findall(r'(WW)|(BB)', s):\r\n print('NO')\r\n exit(0)\r\n\r\nprint('YES')\r\n", "h = []\r\nfor _ in range(8):\r\n h.append(input())\r\nfor i in h:\r\n if not (i == 'WBWBWBWB' or i == 'BWBWBWBW'):\r\n print('NO')\r\n exit()\r\nprint('YES')", "\r\n\r\ndef solve():\r\n for i in range(8):\r\n s = input()\r\n w, b = set([s[i] for i in range(0,8,2)]), set([s[i] for i in range(1,8,2)])\r\n if len(w) != 1 or len(b) != 1 or w == b:\r\n print(\"NO\")\r\n return\r\n \r\n print(\"YES\")\r\n\r\nsolve()\r\n\r\n\r\n", "impflag = 0\nfor i in range(8):\n a = input()\n if a[0] == 'W':\n last = 'W'\n else:\n last = 'B'\n for j in range(1,8):\n if a[j] == last:\n impflag = 1\n break\n else:\n last = a[j]\n if impflag == 1:\n break\nif impflag == 0:\n print(\"YES\")\nelse:\n print(\"NO\")", "a = ['WBWBWBWB', 'BWBWBWBW']\nans = True\nfor x in range(8):\n x = input().strip()\n if x not in a:\n ans = False\nprint(\"YES\" if ans else \"NO\")\n", "g = []\r\n\r\nfor i in range(8):\r\n g.append([i for i in input()])\r\n \r\nok = True\r\n\r\nfor i in g:\r\n for j in range(1, len(i)):\r\n if i[j] == i[j-1]:\r\n ok = False\r\n break\r\n \r\nprint(\"YES\" if ok else \"NO\")", "counter=1\nfor i in range(8):\n\ta=input()\n\tif a.count(\"WB\")==4 or a.count(\"BW\")==4:\n\t\tcontinue\n\n\telse:\n\t\tcounter=0\n\t\tprint(\"NO\")\n\t\tbreak\n\n\nif counter:\n\tprint(\"YES\")", "l1=[]\r\nfor j in range(8):\r\n s= list(input())\r\n c=0\r\n for i in range(7):\r\n if s[i]!=s[i+1]:\r\n c+=1\r\n if(c==7):\r\n l1.append(c)\r\nif(len(l1)==8):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "_2darray = list()\nfor i in range(8):\n _2darray.append(input())\n \nflag = False\n\n\nfor row in _2darray:\n pre = None \n for element in row:\n if element == pre:\n flag = True\n print('NO')\n break\n pre = element\n\n if flag:\n break\n\nif not flag:\n print('YES')", "board = [input() for _ in range(8)]\r\n\r\n# Check rows\r\nfor row in board:\r\n if 'WW' in row or 'BB' in row:\r\n print('NO')\r\n break\r\nelse: # executed if the loop completes normally (i.e. no break)\r\n # Check columns\r\n for j in range(8):\r\n column = [board[i][j] for i in range(8)]\r\n if 'WW' in column or 'BB' in column:\r\n print('NO')\r\n break\r\n else: # executed if the loop completes normally (i.e. no break)\r\n print('YES')\r\n", "res = True\r\n\r\nfor _ in range(0,8):\r\n r = str(input())\r\n if r.count(\"BB\") is not 0 or r.count(\"WW\") is not 0:\r\n res = False\r\n\r\nif res is True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "q=True\nfor i in range(8):\n\tn=input()\n\tif n!=\"WBWBWBWB\" and n!=\"BWBWBWBW\":\n\t\tq=False\nif q==True:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "ans = 'YES'\r\nfor _ in range(8):\r\n s = input()\r\n if s not in ['WB' * 4, 'BW' * 4]:\r\n ans = 'NO'\r\nprint(ans)", "correct = []\r\nrow1 = [\"WBWBWBWB\"]\r\nrow2 = [\"BWBWBWBW\"]\r\ncorrect += row1\r\ncorrect += row2\r\ncorrect += row1\r\ncorrect += row2\r\ncorrect += row1\r\ncorrect += row2\r\ncorrect += row1\r\ncorrect += row2\r\n# print(correct)\r\n\r\ngiven = []\r\nfor _ in range(8):\r\n given.append(input())\r\n# print(given)\r\n\r\nfor i in range(8):\r\n if not i & 1:\r\n if given[i][0] == \"B\":\r\n given[i] = (given[i][1:]+\"B\")\r\n elif i & 1:\r\n if given[i][0] == \"W\":\r\n given[i] = (given[i][1:]+\"W\")\r\n\r\nprint(\"YES\" if given == correct else \"NO\")\r\n", "flag = True;\nfor i in range(0, 8):\n s = str(input());\n if s == \"WBWBWBWB\" or s == \"BWBWBWBW\":\n flag = True;\n else:\n flag = False;\n break;\nif flag:\n print(\"YES\");\nelse: print(\"NO\");\n", "valid = True\nfor i in range(8):\n S = input()\n if S not in (\"BW\" * 4, \"WB\" * 4):\n valid = False\nprint(\"YES\" if valid else \"NO\")", "test =False\r\nfor i in range(8):\r\n ch=input()\r\n if \"WW\" in ch or \"BB\" in ch:\r\n test =True\r\nif test:\r\n print (\"NO\")\r\nelse :\r\n print(\"YES\")", "a=0\r\nfor i in range(8):\r\n s=input()\r\n for j in range(7):\r\n if s[j]==s[j+1]:\r\n a=1\r\nif a==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "chess = [\"WBWBWBWB\", \"BWBWBWBW\"]\r\nrows = [input() for x in range(8)]\r\nfor x in range(8):\r\n r = rows[x]\r\n for y in range(8):\r\n r = r[-1] + r[:-1]\r\n if r == chess[x % 2]:\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "def main():\n\tn=8\n\twhile n:\n\t\tr=input()\n\t\tfor i in range(7):\n\t\t\tif r[i]==r[i+1]:\n\t\t\t\tprint('NO')\n\t\t\t\treturn 0\n\t\tn-=1\n\tprint('YES')\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "c=True\nfor _ in range(8):\n\ts=input()\n\tif not (s==\"WBWBWBWB\" or s==\"BWBWBWBW\"):\n\t\tc=False\nif c:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t \t \t\t\t \t\t\t \t\t \t\t \t", "flag=0\nfor i in range(8):\n\ts = input()\n\tif s==\"WBWBWBWB\" or s==\"BWBWBWBW\":\n\t\tcontinue\n\telse:\n\t\tflag=1\n\t\t\nif flag==0:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "lst = {w.rstrip() for w in open(0).readlines()}\r\nprint(['NO',\"YES\"][all(w in [\"WB\"*4, \"BW\"*4] for w in lst)])", "for i in range(8):\r\n r = input()\r\n if r != 'WBWBWBWB' and r != 'BWBWBWBW':\r\n print('NO')\r\n exit()\r\nprint('YES')", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nexec(\"print('YNEOS'[any('WW'in a or'BB' in a for a in[\"+8*\"input(),\"+\"])::2])\")", "l=[]\r\na=\"WBWBWBWB\"\r\nb=\"BWBWBWBW\"\r\nf=0\r\nfor i in range(8):\r\n s=input()\r\n if s!=a and s!=b:\r\n f=1\r\nif f==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "for i in range (8):\r\n s=input()\r\n if s!='BW'*4 and s!='WB'*4:\r\n print(\"NO\")\r\n break\r\n if i==7:\r\n print('YES')", "s1,s2=0,0\r\nfor _ in range(8):\r\n s=input()\r\n if s!=\"WBWBWBWB\"and s!=\"BWBWBWBW\":\r\n s1=1\r\nprint(\"YES\"if s1==0 else \"NO\")\r\n", "chess=[]*8;\r\nfor i in range(8):a=input();chess.append(a)\r\nR=chess.count(\"WBWBWBWB\");D=chess.count(\"BWBWBWBW\");counter=R+D\r\nif(counter is 8):print(\"YES\")\r\nelse:print(\"NO\")", "def main():\r\n z=True\r\n for j in range(8):\r\n a=input()\r\n for i in range(7):\r\n if a[i]==a[i+1]:\r\n z=False\r\n if z:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nmain()\r\n\r\n", "def main():\n for i in range(8):\n row = input()\n prev = row[0]\n for j in range(1,8, 1):\n if prev == row[j]:\n return \"NO\"\n else:\n prev = row[j]\n return \"YES\"\n\nprint(main())\n\n\n\n\n\n\t\t \t\t \t\t \t \t \t\t \t\t", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\n\r\ndef is_proper_chessboard(chessboard: list) -> bool:\r\n propers = ['WBWBWBWB', 'BWBWBWBW']\r\n\r\n for row in chessboard:\r\n if row != propers[0] and row != propers[1]:\r\n return False\r\n\r\n return True\r\n\r\n\r\ndef main() -> int:\r\n chessboard = []\r\n\r\n for _ in range(8):\r\n chessboard.append(input())\r\n\r\n print('YES' if is_proper_chessboard(chessboard) else 'NO')\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "map = []\nnormal = ['WBWBWBWB','BWBWBWBW']\nfor i in range(8):\n str = input()\n if str not in normal:\n print('NO')\n exit()\nprint('YES')", "for i in range(8):\n\ts = input()\n\tfor a, b in zip(s, (s + s[0])[1: ]):\n\t\tif a == b:\n\t\t\tprint('NO')\n\t\t\texit(0)\nprint('YES')\n", "#Little Elephant and Chess\r\narray = []\r\ncount=0\r\nfor i in range(8):\r\n count+=1\r\n k = input()\r\n\r\n a = k.count(\"W\")\r\n if 2*a ==len(k):\r\n if \"WW\" in k or \"BB\" in k:\r\n #if \"WW\" in k or \"BB\" in k:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\n if count==8:\r\n print(\"YES\")\r\n\r\n", "e=True\r\nfor i in range(8):\r\n a=input()\r\n if(a!='BW'*4)&(a!='WB'*4):\r\n e=False\r\n print('NO')\r\n break\r\nif e:print('YES')\r\n", "for i in range(8):\r\n s=input()\r\n if s.count(\"BW\")==4 or s.count(\"WB\")==4:\r\n pass\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "import sys\r\ns1 = input()\r\ns2 = input()\r\ns3 = input()\r\ns4 = input()\r\ns5 = input()\r\ns6 = input()\r\ns7 = input()\r\ns8 = input()\r\n\r\nchoice1 = \"WBWBWBWB\"\r\nchoice2 = \"BWBWBWBW\"\r\n\r\nif s1 != choice1 and s1 != choice2:\r\n print(\"NO\")\r\n sys.exit(0)\r\nif s2 != choice1 and s2 != choice2:\r\n print(\"NO\")\r\n sys.exit(0)\r\nif s3 != choice1 and s3 != choice2:\r\n print(\"NO\")\r\n sys.exit(0)\r\nif s4 != choice1 and s4 != choice2:\r\n print(\"NO\")\r\n sys.exit(0)\r\nif s5 != choice1 and s5 != choice2:\r\n print(\"NO\")\r\n sys.exit(0)\r\nif s6 != choice1 and s6 != choice2:\r\n print(\"NO\")\r\n sys.exit(0)\r\nif s7 != choice1 and s7 != choice2:\r\n print(\"NO\")\r\n sys.exit(0)\r\nif s8 != choice1 and s8 != choice2:\r\n print(\"NO\")\r\n sys.exit(0)\r\n\r\nprint(\"YES\")\r\n", "ans = \"YES\"\r\nfor i in range(8):\r\n s = input()\r\n if 'BB' in s or 'WW' in s:\r\n ans = \"NO\"\r\nprint(ans)", "M = []\r\n\r\nf = True\r\nfor i in range(8):\r\n M.append(input())\r\n for i in range(1, 8):\r\n if M[-1][i] == M[-1][i-1]:\r\n f = False\r\n \r\nif f : print(\"YES\")\r\nelse: print(\"NO\") \r\n \r\n ", "#259A Little Elephant and Chess\r\nans = 'YES'\r\nb,c = 0,0\r\nfor i in range(8):\r\n x = list(input())\r\n for j in range(7):\r\n if x[j] == x[j+1]:\r\n ans = 'NO'\r\n break\r\n\r\n \r\nprint(ans)", "chess = [input() for i in range(8)]\r\nsolve = 'YES'\r\nfor c in chess:\r\n if 'WW' in c or 'BB' in c:\r\n solve = 'NO'\r\n break\r\n else:\r\n continue\r\nprint(solve)\r\n", "for i in range(8):\r\n a = input()\r\n if a.find('BB') > -1:\r\n print('NO')\r\n exit()\r\n if a.find('WW')>-1 and a.find('WW')!=6:\r\n print('NO')\r\n exit()\r\nprint('YES')", "def valcheck(s):\r\n n = len(s)\r\n i=0\r\n while i<n-1: \r\n if s[i]=='W'and s[i+1]=='B':\r\n i+=1\r\n continue\r\n elif s[i]=='B' and s[i+1]==\"W\":\r\n i+=1\r\n continue\r\n else: \r\n return False\r\n return True\r\nvb= True\r\nfor _ in range(8):\r\n \r\n s = input()\r\n if not valcheck(s): \r\n vb = False\r\nif vb:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f = 0\r\nfor i in range(8):\r\n l = list(input())\r\n if f != -1:\r\n for j in range(7):\r\n if l[j] == l[j + 1]:\r\n f = -1\r\n break\r\nif f == -1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "cnt = 0\nfor i in range(8):\n s = input()\n if s == 'WB'*4 or s == 'BW'*4:\n cnt += 1\nif cnt == 8: \n print('YES')\nelse:\n print('NO')\n\n", "def validate(value_row: str):\n\n if 'B' not in value_row or 'W' not in value_row:\n return False\n one = 0\n two = 0\n for i, cell in enumerate(value_row):\n if cell == 'W':\n one += 1\n if i != 0 and value_row[i-1] == 'W':\n return False\n\n else:\n two += 1\n if i != 0 and value_row[i-1] == 'B':\n return False\n\n if one != two:\n return False\n\n return value_row\n\n\nboard = []\nfor i in range(8):\n row = input()\n if False in board:\n pass\n else:\n board.append(validate(row))\n\nif False in board:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t \t\t\t\t \t \t \t \t\t \t \t\t \t \t", "from collections import *\r\nimport itertools\r\n\r\nboard = [list(input().strip()) for _ in range(8)]\r\n\r\nfor i in range(8):\r\n cnts = Counter(board[i])\r\n if cnts['B'] != cnts['W']:\r\n print('NO')\r\n exit()\r\n for k, grp in itertools.groupby(board[i]):\r\n lst = list(grp)\r\n if len(lst) != 1:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')\r\n", "r=0\r\na=\"WBWBWBWB\"\r\nb=\"BWBWBWBW\"\r\nfor i in range(8):\r\n x=input()\r\n if x==a or x==b :\r\n r+=1\r\nif r==8:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def okay(s):\n if s in ('WBWBWBWB', 'BWBWBWBW'):\n return True\n return False\n\nrows = []\nfor _ in range(8):\n rows.append(input())\n\nfor i in range(8):\n if not okay(rows[i]):\n print('NO')\n exit()\nprint('YES')\n", "a=[]\r\nflag=0\r\nfor i in range(8):\r\n\ta.append(input())\r\n\tfor j in range(len(a[i])-1):\r\n\t\tif(a[i][j]==a[i][j+1]):\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\nif(flag==0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from sys import stdin, stdout\n\n\ndef solve(data):\n def does_alternate(row):\n prev = row[0]\n for x in row[1:]:\n if x == prev:\n return False\n else:\n prev = x\n return True\n\n #first_line = data[0]\n rest_lines = list(map(str.strip, data[:]))\n alternating_rows = list(filter(does_alternate, rest_lines))\n answer = \"YES\" if len(alternating_rows) == 8 else \"NO\"\n\n return answer\n\n\nif __name__ == '__main__':\n data = stdin.readlines()\n answer = solve(data)\n\n if type(answer) in [list]:\n stdout.writelines(map(str, answer))\n else:\n stdout.write(str(answer))\n", "l=[]\r\nfor i in range(8):\r\n s=input()\r\n l.append(s)\r\nf,s=\"WBWBWBWB\",\"BWBWBWBW\"\r\nans=True\r\nfor i in l:\r\n if not ((i==f) or (i==s)):\r\n ans=False\r\n break\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "flag=0\r\nfor i in range(8):\r\n s = input()\r\n if flag ==0:\r\n if s == 'BWBWBWBW' or s=='WBWBWBWB':\r\n flag=0\r\n else:\r\n flag=1\r\nif flag==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "l=[]\nfor i in range(8):\n s=input()\n l.append(s)\nfor i in range(8):\n flag=0\n for j in range(7):\n if l[i][j]==l[i][j+1]:\n print(\"NO\")\n exit(0)\nprint(\"YES\")\n\t\t\t\t \t\t\t \t \t\t\t\t \t \t \t \t", "import sys\n\nflag = True\nfor i in range (1,9):\n string = input()\n if flag:\n for j in range (0,7):\n if string[j]==string[j+1]:\n flag = False\n break\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", "mat = []\nfor _ in range(8):\n mat.append(input())\n\nvalid = True\nfor row in mat:\n for i in range(1, 8):\n if row[i] == row[i-1]:\n valid = False\n\nif valid:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "flag=True\r\nfor i in range(8):\r\n k=input()\r\n if k!='BWBWBWBW' and k!='WBWBWBWB':\r\n flag=False\r\nif (flag):\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n", "for i in range(8):\r\n a=input()\r\n if a[0]==a[-1] or 'WW' in a or 'BB' in a:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "'''input\r\nWBWBWBWB\r\nBWBWBWBW\r\nWBWBWBWW\r\nBWBWBWBW\r\nWBWBWBWB\r\nWBWBWBWB\r\nBWBWBWBW\r\nWBWBWBWB\r\n'''\r\nimport sys\r\nfrom math import *\r\nfrom copy import *\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom heapq import *\r\nfrom array import array\r\nINF = 2147483647\r\nINF64 = 9223372036854775807\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n\r\ndef solve():\r\n\tfor i in range(8):\r\n\t\ts = getstr()\r\n\t\tfor j in range(1, len(s)):\r\n\t\t\tif s[j-1]==s[j]:print(\"NO\"),exit(0)\r\n\tprint(\"YES\")\r\n\r\nif __name__==\"__main__\":\r\n\tt = 1\r\n\tfor i in range(t):\r\n\t\tsolve()", "lis=[]\r\nfor i in range(8):\r\n lis.append(input())\r\nlis1=['WBWBWBWB','BWBWBWBW']\r\ncheck=1\r\nfor i in range(8):\r\n if lis[i] not in lis1:\r\n check=0\r\nif check==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n", "f=0\r\nfor _ in range(8):\r\n\ts=input()\r\n\ts1=\"BWBWBWBW\"\r\n\ts2=\"WBWBWBWB\"\r\n\tif s!=s1 and s!=s2:\r\n\t\tf=1\r\n\t\tbreak\r\nif f==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "s = [input() for i in range(8)]\r\ncnt = 0\r\n\r\nfor i in s:\r\n\tif i!=\"WBWBWBWB\" and i!=\"BWBWBWBW\":\r\n\t\tcnt+=1\r\n\r\nif cnt:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "ans=True\r\nfor i in range(8):\r\n m=input()\r\n for l in range(7):\r\n if m[l]==m[l+1]:\r\n ans=False\r\nif ans==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\n\r\nflag = True\r\nfor t in range(8):\r\n s = input()\r\n for i in range(len(s) - 1):\r\n if s[i] == s[i+1]:\r\n flag = False\r\n\r\n\r\nif flag :\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "v = [[0 for j in range(8)] for y in range(8) ]\r\nfor i in range (8):\r\n s = input()\r\n for j in range(8):\r\n v[i][j] = s[j]\r\ngood = True\r\nfor i in range(8):\r\n for j in range(8):\r\n if j + 1 < 8 and v[i][j] == v[i][j + 1]:\r\n good = False\r\n\r\nif good:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[]\r\nfg=0\r\nfor i in range(0,8):\r\n s=input()\r\n for j in range(0,7):\r\n if s[j]==s[j+1]:\r\n fg=1\r\n if s[0]==s[7]:\r\n fg=1\r\nif fg==1:print(\"NO\")\r\nelse:print('YES')", "for i in range(8):\r\n s = input()\r\n for i in range(7):\r\n if s[i] == s[i + 1]:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "for i in range(8):\r\n\ts=input()\r\n\tif 'WW'in s or 'BB' in s:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "from sys import stdin\r\nimport re\r\nfor _ in range(8):\r\n s = stdin.readline()[:-1]\r\n s = \"$\" + s + \"$\"\r\n m = re.search(r'WW|BB', s)\r\n if m or s[1] == s[-2]:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "def proper(string1):\r\n \r\n a = 'WBWBWBWB'\r\n b = 'BWBWBWBW'\r\n \r\n if string1 == a or string1 == b:\r\n return True\r\n \r\n return False\r\n\r\ndef checkProper(list1):\r\n\r\n for item in list1:\r\n\r\n res = proper(item)\r\n if res == False:\r\n return 'No'\r\n\r\n \r\n return 'Yes'\r\n \r\nif __name__ == '__main__':\r\n n = 8\r\n list1 = []\r\n while n:\r\n string1 = input()\r\n list1.append(string1)\r\n\r\n n -= 1\r\n\r\n ans = checkProper(list1)\r\n print(ans)\r\n ", "list = []\nfor i in range(0, 8):\n line = input()\n list.append(line)\n\ncount = 0\nfor p in list:\n if p == \"BWBWBWBW\" or p == \"WBWBWBWB\":\n count += 1\n\nif count == 8:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t \t \t \t\t \t\t \t\t \t \t \t", "k=0\r\nfor i in range(8):\r\n n=input()\r\n if \"WW\" in n or \"BB\" in n:\r\n k=1\r\nif k==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "arr=[]\nfor i in range(8):\n a=input()\n a=list(a)\n arr.append(a)\n# print(arr)\nmain_flag=0\nflag=0\ntemp=0\nfor i in range(1):\n for j in range(7):\n if arr[i][j]==arr[i][j+1]:\n temp=arr[i][j+1]\n flag += 1\n if flag<1:\n temp=arr[i][0]\n if flag>1:\n main_flag=1\nflag=0\nif main_flag!=1: \n for i in range(1,8):\n if arr[i][0]==temp:\n flag=1\n temp=arr[i][-1]\n else:\n flag=0\n for j in range(7):\n \n if arr[i][j]==arr[i][j+1]:\n flag += 1\n temp=arr[i][j+1]\n if flag<1:\n temp=arr[i][0]\n if flag>1:\n main_flag=1\n break\nif main_flag==1:\n print(\"NO\")\nelse:\n print(\"YES\")", "import heapq\r\nfrom math import gcd,lcm\r\nfrom collections import Counter\r\n# Shortcut for input\r\ndef I(): return int(input())\r\ndef MI(): return map(int, input().split())\r\ndef MS(): return map(str, input().split())\r\ndef LI(): return list(map(int, input().split()))\r\ndef LI(): return list(map(int, input().split()))\r\ndef S(): return input()\r\n# Constants\r\nmod = 10**9 + 7\r\n\r\ndef compute(s):\r\n flag = 1\r\n for i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n return 0\r\n return flag\r\n \r\n\r\nflag = 1\r\nfor i in range(8):\r\n s= S()\r\n flag = compute(s)\r\n if not flag:\r\n break\r\nprint([\"NO\",'YES'][flag])", "x=0\r\nfor i in range(8):\r\n s=input()\r\n if s!='WBWBWBWB' and s!='BWBWBWBW':\r\n x=1\r\n break\r\nif(x):print(\"NO\")\r\nelse:print(\"YES\")", "x=[]\r\nfor i in range(8):\r\n s=str(input())\r\n x.append(s)\r\nd=False\r\nfor i in range(8):\r\n s=x[i]\r\n if(s==\"BWBWBWBW\" or s==\"WBWBWBWB\"):\r\n continue\r\n else:\r\n d=True\r\n print(\"NO\")\r\n break\r\nif(d==False):\r\n print(\"YES\")\r\n \r\n\r\n ", "from math import sqrt, ceil, log\r\nfrom heapq import heapify, heappush, heappop\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nioint = lambda: int(input())\r\nioarr = lambda: list(map(int, input().split(\" \")))\r\nprnys = lambda: print(\"YES\")\r\nprnno = lambda: print(\"NO\")\r\n\r\nMAX = 10**9\r\n\r\n# T = ioint()\r\nT = 8\r\nres = True\r\nwhile T and res:\r\n T -= 1\r\n\r\n # n = ioint()\r\n # n, k = ioarr()\r\n # arr = ioarr()\r\n arr = input()\r\n\r\n pre = arr[0]\r\n for x in range(1, len(arr)):\r\n cur = arr[x]\r\n if cur == pre:\r\n res = False\r\n break\r\n pre = cur\r\n\r\nif res:\r\n prnys()\r\nelse:\r\n prnno()\r\n", "f=0\r\nfor i in range(8):\r\n l=list(input())\r\n for j in range(7):\r\n if(l[j]==l[j+1]):\r\n f=1\r\n break\r\n if(l[0]==l[-1]):\r\n f=1\r\nif(f==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "ans = 'YES'\r\nfor i in range(8):\r\n row = input()\r\n for j in range(7):\r\n if (row[j] == row[j + 1]):\r\n ans = 'NO'\r\nprint (ans)", "s=''\r\nfor i in range(8): s=s+input()+','\r\nprint('YNEOS '[s.count('WBWBWBWB')+s.count('BWBWBWBW')!=8 ::2])", "check=True\r\nfor i in range(8):\r\n\ts=input()\r\n\tfor j in range(1,len(s)):\r\n\t\tif(s[j]==s[j-1]):\r\n\t\t\tcheck=False\r\n\t\t\tbreak\r\nif(check):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "from sys import exit\r\n\r\nfor _ in range(8):\r\n curr_line = input()\r\n if curr_line != 'WBWBWBWB' and curr_line != 'BWBWBWBW':\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "l=[]\r\nfor i in range(8):\r\n tmp=input()\r\n l.append(tmp[:])\r\nok=1\r\nyes=1\r\nfor i in range(8):\r\n if i%2==0 and l[i][0]=='B':\r\n ok=0\r\n elif i%2==1 and l[i][0]=='W':\r\n ok=0\r\n for j in range(1 , 8):\r\n if l[i][j]==l[i][j-1]:\r\n yes=0\r\n break\r\n if yes==0:\r\n break\r\nif yes==1 and ok==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def check(s):\r\n for j in range(1,8):\r\n if s[j]==s[j-1]:\r\n return 'NO'\r\n break\r\n return 'YES'\r\nfor i in range(8):\r\n s=check(input())\r\n if s=='NO':\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\nfor i in range(i+1,8):\r\n input()\r\n \r\n ", "###############################\n## Little Elephant and Chess ##\n###############################\n\ndef main():\n\tboard = []\n\tcheckNo = 0\n\n\tfor i in range(8):\n\t\trow = input()\n\t\trow = list(row)\n\t\tboard.append(row)\n\n\tfor i in range(8):\n\t\tfor j in range(7):\n\t\t\t# check borders first\n\t\t\tif(board[i][0] == board[i][7]):\n\t\t\t\tprint(\"NO\")\n\t\t\t\tcheckNo = 1\n\t\t\t\tbreak\n\t\t\telif(board[i][j] == board[i][j+1]):\n\t\t\t\tprint(\"NO\")\n\t\t\t\tcheckNo = 1\n\t\t\t\tbreak\n\t\tif(checkNo == 1):\n\t\t\tbreak\n\n\tif(checkNo == 0):\n\t\tprint(\"YES\")\n\n\nif __name__ == \"__main__\":\n\tmain()", "flag=0\r\nfor _ in range(8):\r\n s=input()\r\n for i in range(0,7):\r\n if s[i]==s[i+1]:\r\n flag=1\r\n break\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "fail = False\nfor i in range(8):\n s = input()\n for j in range(1, len(s)):\n if s[j] == s[j-1]:\n fail = True\n break\n\nprint(\"NO\" if fail else \"YES\")\n\n \t \t\t \t\t\t \t\t\t\t \t\t\t \t \t \t\t", "state = \"YES\"\r\n\r\nfor _ in range(8):\r\n line = input()\r\n if sum([line[i] == line[(i + 1) % 8] for i in range(8)]) > 1: state = \"NO\"\r\n\r\nprint(state)", "list1 = []\r\ntext = \"YES\"\r\nfor i in range(8):\r\n a = input()\r\n list1.append(a)\r\nfor j in range(8):\r\n for k in range(7):\r\n if list1[j][k] == list1[j][k + 1]:\r\n text = \"NO\"\r\n break\r\n else:\r\n continue\r\n break\r\n\r\nprint(text)\r\n", "n = 8\n\nok = True\nfor _ in range(n):\n s = input()\n if ok:\n for i in range(len(s) - 1):\n if s[i] == s[i + 1]:\n ok = False\n break\n\nprint(\"YES\" if ok else \"NO\")\n", "ar = []\r\nfor i in range(8):\r\n st = input()\r\n ar.append(st)\r\nfor i in ar:\r\n curr = i[0]\r\n ch = 0\r\n for j in range(1, len(i)):\r\n if i[j] == curr:\r\n ch = 1\r\n print('NO')\r\n break\r\n else:\r\n curr = i[j]\r\n if ch == 1:\r\n break\r\nif ch != 1:\r\n print('YES')\r\n", "for _ in range(8):\r\n s = input()\r\n if s == \"WB\" * 4 or s == \"BW\" * 4:\r\n continue\r\n else:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "c=0\r\nfor i in range(8):\r\n s=input()\r\n for j in range(len(s)-1):\r\n if s[j]==s[j+1]:\r\n c+=1\r\n break\r\nif c==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def main():\r\n ok = 1\r\n for i in range(8):\r\n row = input()\r\n if row != \"WBWBWBWB\" and row != \"BWBWBWBW\":\r\n ok = 0\r\n print(\"YES\" if ok else \"NO\")\r\n\r\n\r\n# for _ in range(int(input())):\r\n# main()\r\nmain()", "def solve(arr):\n for i in arr:\n if i not in ['WBWBWBWB','BWBWBWBW']:\n return 'NO'\n return 'YES'\n \n\ndef main() :\n # n,k = list(map(int, input().split(' ')))\n # n = int(input())\n # arr = input().split(' ')\n # s = input()\n # res=''\n\n arr = []\n for _ in range(8):\n i = input()\n arr.append(i)\n \n # # for i in arr:\n # n = int(input())\n # s = input()\n print(solve(arr))\n\nmain()\n\n\n", "for _ in range(8):\n\tstring=input()\n\tif \"BB\" in string:\n\t\tprint(\"NO\")\n\t\tbreak\n\tif \"WW\" in string:\n\t\tprint(\"NO\")\n\t\tbreak\nelse:\n\tprint(\"YES\")", "def solve():\n\n falseFound = False\n for _ in range(8):\n r = input()\n\n if r != \"WBWBWBWB\" and r!= \"BWBWBWBW\": falseFound = True\n \n\n if falseFound:\n print(\"NO\")\n return\n print(\"YES\")\n return\n\n\nsolve()", "answer = \"YES\"\r\nfor i in range(8):\r\n s = input()\r\n if s != \"BWBWBWBW\" and s!= \"WBWBWBWB\":\r\n answer = \"NO\"\r\nprint(answer)", "flag=0\r\nres=[]\r\nfor i in range(8):\r\n x=list(input())\r\n res.append(x)\r\nfor i in range(8):\r\n res[i]=list(res[i])\r\ndp=[[0]*8 for _ in range(8)]\r\nfor i in range(8):\r\n for j in range(1,8):\r\n if res[i][j-1]==res[i][j]:\r\n dp[i][j]=dp[i][j-1]+1 \r\n else:\r\n dp[i][j]=dp[i][j-1]\r\n if dp[i][j]>=1:\r\n flag=1\r\n break\r\n if res[i][-1]==res[i][0]:\r\n dp[i][-1]=dp[i][-1]+1 \r\n if dp[i][-1]>=1:\r\n flag=1\r\n if flag==1:\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "res = \"YES\"\nfor _ in range(8):\n s = input()\n if s not in {\"WBWBWBWB\", \"BWBWBWBW\"}:\n res = \"NO\"\nprint(res)\n", "x='WBWBWBWB';y='BWBWBWBW'\ns=[input() for _ in ' '*8]\nfor i in s:\n if i==x or i==y:\n continue\n else:print('NO');exit(0)\nprint('YES')\n\t\t \t\t\t\t\t \t \t\t \t \t\t\t\t\t\t\t\t", "\r\n\r\ndef main():\r\n matrix = []\r\n for _ in range(8):\r\n x = [i for i in str(input())]\r\n matrix.append(x)\r\n for row in matrix:\r\n for c in range(len(row) - 1):\r\n if row[c] == row[c + 1]:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\nmain()", "x='WBWBWBWB';y='BWBWBWBW'\r\ns=[input() for _ in ' '*8]\r\nfor i in s:\r\n if i==x or i==y:\r\n continue\r\n else:print('NO');exit(0)\r\nprint('YES')", "c=0\nfor i in range(8):\n a=list(input())\n w,e,o=0,0,0\n for j in range(8):\n \n if a[j]=='W':\n w=w+1 \n if j%2==0:\n e=e+1 \n else:\n o=o+1\n #print(w,e,o)\n if w==4 and (e==4 or o==4):\n c=c+1 \nif c==8:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \t\t\t\t\t \t \t \t\t\t \t \t \t\t", "valid=True\r\nfor i in range(8):\r\n line=input()\r\n if line!='WBWBWBWB' and line!='BWBWBWBW':\r\n valid=False\r\nif valid:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# import sys \r\n# sys.stdin = open('circlecross.in', 'r')\r\n# sys.stdout = open('circlecross.out', 'w')\r\n# \r\nimport math\r\nfrom math import gcd,floor,sqrt,log\r\ndef iin(): return int(input())\r\ndef sin(): return input().strip()\r\ndef listin(): return list(map(int,input().strip().split()))\r\ndef liststr(): return list(map(str,input().strip().split()))\r\ndef ceill(x): return int(x) if(x==int(x)) else int(x)+1\r\ndef ceilldiv(x,d): return x//d if(x%d==0) else x//d+1\r\ndef LCM(a,b): return (a*b)//gcd(a,b)\r\nok = 1\r\nfor i in range(8):\r\n\tx = sin()\r\n\tif x[0]==x[-1] or \"WW\" in x or \"BB\" in x:\r\n\t\tprint(\"NO\")\r\n\t\tok = 0\r\n\t\tbreak\r\nif ok: print(\"YES\")\r\n\t\r\n\r\n\t", "def good(s):\n for i in range(7, -1, -1):\n if s[i] == s[i-1]:\n return False\n return True\nfor i in range(8):\n if not good(input()):\n print('NO')\n exit()\nprint('YES')\n", "a=input()\r\nb=input()\t\r\nc=input()\r\nd=input()\r\ne=input()\r\nf=input()\t\t\r\ng=input()\r\nh=input()\r\n# if (\"WW\"or\"BB\" in a) or (\"WW\"or\"BB\" in b) or (\"WW\"or\"BB\" in c) or (\"WW\"or\"BB\" in d) or (\"WW\"or\"BB\" in e) or (\"WW\"or\"BB\" in f) or (\"WW\"or\"BB\" in g) or (\"WW\"or\"BB\" in h):\r\n# \tprint(\"NO\")\r\n# \texit()\r\n# print(\"Yes\")\r\ns=[a,b,c,d,e,f,g,h]\r\nok=0\r\nfor i in range(len(s)):\r\n\tif \"WW\" in s[i] or \"BB\" in s[i]:\r\n\t\tok=1\r\nif ok==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "case=True\n\nfor i in range(8):\n s=input()\n if(s!=\"WBWBWBWB\" and s!=\"BWBWBWBW\"):\n case=False\nif(case):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "c=0\r\nt=['WBWBWBWB','BWBWBWBW']\r\nfor i in range(8):\r\n x=input()\r\n if x in t:\r\n c+=1\r\nif(c==8):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "f = 0\nfor i in range(8):\n a = input()\n p = a[0]\n for j in a[1:]:\n if p == j:\n f = 1\n break\n p = j\n if a[0] == a[-1]:\n f = 1\n if f == 1:\n break\nif f == 0:\n print('YES')\nelse:\n print('NO')\n", "for i in range(8):\r\n X = input()\r\n if \"WW\" in X or \"BB\" in X:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: Being followed by my friend ESSI\r\n# CodeNumber: 620\r\n", "exec(\"print('YNEOS'[any('WW'in a or'BB' in a for a in[\"+8*\"input(),\"+\"])::2])\")", "# coding: utf-8\nfor i in range(8):\n s = input()\n s1 = set([s[j] for j in range(8) if j%2==0])\n s2 = set([s[j] for j in range(8) if j%2==1])\n if len(s1)!=1 or len(s2)!=1 or s1==s2:\n print('NO')\n break\nelse:\n print('YES')\n", "\r\nfor i in range(8):\r\n l = input()\r\n if \"BB\" in l or \"WW\" in l or l[0]==l[-1]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "board = []\r\nfor cont in range(0,8):\r\n board.append(input())\r\nl = True\r\nfor row in board:\r\n for cont in range(0,7):\r\n if row[cont] == row[cont+1]:\r\n l = False\r\n break\r\n if l is False:\r\n break\r\n\r\nif l:\r\n print('YES')\r\nelse:\r\n print('NO')", "l=[]\r\nfor i in range(8):\r\n s=input()\r\n l.append(s)\r\nc=0\r\nfor i in range(8):\r\n for j in range(len(l[i])-1):\r\n if(ord(l[i][j])-ord(l[i][j+1])!=0):\r\n continue\r\n else:\r\n c=1\r\n break\r\nif(c==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# http://codeforces.com/problemset/problem/259/A\r\n'''\r\n Author - Subhajit Das\r\n University of Engineering and Management, Kolkata\r\n DD/MM/2019\r\n'''\r\n\r\n\r\ndef main():\r\n board = list()\r\n for _ in range(8):\r\n board.append(list(input()))\r\n\r\n for i in range(8):\r\n for j in range(8):\r\n j1 = (j+1) % 8\r\n b, a = board[i][j], board[i][j1]\r\n if((b == 'W' and a == 'W') or (b == 'B' and a == 'B')):\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", "arr=[]\r\nfor _ in range(8):\r\n s=input()\r\n arr.append(s)\r\nflag=0\r\nfor i in range(8):\r\n for j in range(1,len(arr[i])):\r\n if arr[i][j-1]==arr[i][j]:\r\n flag=1\r\n break\r\n if arr[i][0]==arr[i][-1]:\r\n flag=1\r\n if flag==1:\r\n break\r\nif flag==1:\r\n print ('NO')\r\nelse:\r\n print ('YES')", "\r\nans=\"YES\"\r\nfor i in range(8):\r\n s=input()\r\n if(s!=(s[0]+s[1])*4 or s[0]==s[1]):\r\n ans=\"NO\"\r\nprint(ans)", "seq = \"WBWBWBWBWBWBWBWB\"\r\nflag = 0\r\nfor _ in range(8):\r\n s = input()\r\n if s not in seq:\r\n flag = 1\r\n break\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n", "for i in range(8):\n s = input()\n for j in range(7):\n if s[j] == s[j+1]:\n print('NO')\n exit()\n\n if i == 7:\n print('YES')", "possible=True\r\npw,pb=False,False\r\nfor i in range(8):\r\n line = input()\r\n count=0\r\n c=1\r\n cw,cb=False,False\r\n if not possible: continue\r\n for i in range(1,8):\r\n if line[i]==line[i-1]:\r\n c+=1\r\n if line[i]=='W':cw=True\r\n elif line[i]=='B':cb=True\r\n else:\r\n if c>1:count+=1\r\n# if line[i-1]=='W':Wcount+=1\r\n# else:Bcount+=1\r\n c=1\r\n if c>=3:\r\n possible = False\r\n break\r\n if c>2:possible=False\r\n if c>=2:count+=1\r\n if count>=2:possible=False\r\n if cw and pw:possible=False\r\n if cb and pb:possible=False\r\n pw=cw\r\n pb=cb\r\n\r\nif possible: print('YES')\r\nelse:print('NO')", "for i in range(8):\r\n\ta=input()\r\n\tif a!=\"WBWBWBWB\" and a!=\"BWBWBWBW\":\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "chess = []\r\nfor i in range(8):\r\n chess.append(input())\r\nans = \"YES\"\r\nfor x in chess:\r\n if x != \"WBWBWBWB\" and x != \"BWBWBWBW\":\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "z=False\r\nfor _ in range(8):\r\n\tk=input()\r\n\tfor x in range(7):\r\n\t\tif k[x]==k[x+1]:\r\n\t\t\tprint('NO')\r\n\t\t\tz=True\r\n\t\t\tbreak\r\n\tif z==True:\r\n\t\tbreak\r\nelse:print('YES')", "t=True\r\nfor i in range(8):\r\n a=input()\r\n if a!=\"WBWBWBWB\" and a!=\"BWBWBWBW\" :\r\n t=False\r\nprint(\"YES\" if t else \"NO\")", "def solve(p):\r\n s=False\r\n if p=='WB'*4 or p=='BW'*4:\r\n return \"Yes\"\r\n else:\r\n return \"NO\"\r\n \r\ns=[]\r\nfor i in range(8):\r\n p=input()\r\n e=solve(p)\r\n s.append(e)\r\nif \"NO\" in s:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "board = []\r\nfor _ in range(8):\r\n board.append(input())\r\n\r\nx = True\r\nfor string in board:\r\n for i in range(7):\r\n if string[i] == string[i + 1]:\r\n print(\"NO\")\r\n x = False\r\n break\r\n else:\r\n pass\r\n if x == False:\r\n break\r\n else:\r\n pass\r\nelse:\r\n print(\"YES\")\r\n", "s=[]\r\nfor i in range(8):\r\n s.append(input())\r\n#check if even pattern is of the form WBWBWBWB and odd BWBWBWBW\r\ndef check(i,index):\r\n if index%2:\r\n pat=\"BWBWBWBW\"\r\n l= [ i[-j:]+i[:8-j] for j in range(1,9) ]\r\n if pat in l:\r\n return True\r\n else:\r\n return False\r\n else:\r\n pat=\"WBWBWBWB\"\r\n l=[ i[-j:]+i[:8-j] for j in range(1,9) ]\r\n if pat in l:\r\n return True\r\n else:\r\n return False\r\n\r\nstat = True\r\nfor i in range(8):\r\n if check(s[i],i)==False:\r\n stat=False\r\n break\r\nprint([\"YES\",\"NO\"][not stat]) \r\n ", "ok = True\r\nfor i in range(8):\r\n s = input()\r\n if s != 'WBWBWBWB' and s != 'BWBWBWBW':\r\n ok = False\r\n break\r\n\r\nif ok:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "print('YES' if all([r=='WB'*4 or r=='BW'*4 for r in [input() for _ in range(8)]]) else 'NO')", "data = [input() for i in range(8)]\r\nflag = True\r\nfor i in data:\r\n if not(i == 'WBWBWBWB' or i == 'BWBWBWBW'):\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=[]\r\nfor i in range(8):\r\n a.append(list(input()))\r\nk=0\r\nfor i in range(8):\r\n for j in range(7):\r\n if a[i][j]==a[i][j+1]:\r\n k+=1\r\nif k>0:\r\n print('NO')\r\nelse:\r\n print('YES')", "l=[]\r\nfor i in range(8):\r\n\tl.append(input())\r\nflag1,flag2=True,True\r\nfor i in l:\r\n\tx=i.count('B')\r\n\ty=8-x\r\n\tif x==4 and y==4:\r\n\t\tcontinue\r\n\tflag1=False\r\n\tbreak\r\nif flag1==False:\r\n\tprint('NO')\r\n\texit()\r\nelse:\r\n\tfor i in l:\r\n\t\tx=i*3\r\n\t\ta,b=x.find('BB'),x.find('WW')\r\n\t\tif a>=0 or b>=0:\r\n\t\t\tflag2=False\r\n\t\t\tbreak\r\n\tif flag2==False:\r\n\t\tprint('NO')\r\n\telse:\r\n\t\tprint('YES')", "for _ in range(8):\r\n row = input()\r\n if 'BB' in row or 'WW' in row:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "def check_for_cycle(s):\r\n for i in range(len(s)-1):\r\n if s[i] == s[i+1]:\r\n return 0\r\n return 1\r\n\r\ndef main():\r\n for i in range(8):\r\n s = input()\r\n if check_for_cycle(s) == 0:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nif __name__ == \"__main__\":\r\n print(main())", "\r\ndef check(board):\r\n for s in board:\r\n for i in range(len(s)):\r\n if s[i] == s[(i+1) % 8]:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n\r\nboard = [input() for i in range(8)]\r\ncheck(board)\r\n", "flag = 0\na = [0]*8\nb = [[0 for i in range(8)] for i in range(8)]\nfor i in range(8):\n a[i] = input()\ni = 0\nfor q in a:\n j = 0\n for p in q:\n b[i][j] = p\n #print(b[i][j],end = ' ')\n j = j + 1\n i = i + 1\n\nfor i in range(8):\n for j in range(1,8):\n if b[i][j] == b[i][j-1]:\n flag = 1\nif flag == 1:\n print('NO')\nelse:\n print('YES')\n\n\t\t \t \t \t\t\t\t\t\t \t\t \t \t \t", "x=[]\r\nfor i in range(8):\r\n x.append(list(input()))\r\nk=True\r\nfor i in range(8):\r\n for j in range(7):\r\n if x[i][j]==x[i][j+1]:\r\n k=False\r\n break\r\nif k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "proper = True\r\nfor i in range(8):\r\n raw = input()\r\n if raw != \"WBWBWBWB\" and raw != \"BWBWBWBW\":\r\n proper = False\r\nif proper:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin,stdout\r\nif __name__==\"__main__\":\r\n f=1\r\n for i in range(8):\r\n s=input()\r\n if s!='WBWBWBWB' and s!='BWBWBWBW':\r\n print('NO')\r\n f=0\r\n break\r\n if f==1:print(\"YES\")", "import sys\r\n#import bisect\r\nimport math\r\nimport itertools\r\n#import array as ab\r\nimport random\r\ndef get_line(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef in1(): return int(input())\r\n\r\np=0\r\nfor i in range(8):\r\n s1=str(input())\r\n for j in range(8):\r\n if s1[j]==s1[(j+1)%8]:\r\n p=1\r\n break\r\nif p==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "try:\r\n c=0\r\n for i in range(8):\r\n \r\n s=input()\r\n if s==\"WBWBWBWB\" or s==\"BWBWBWBW\":\r\n pass\r\n else:\r\n c=1\r\n \r\n if c==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\nexcept EOFError:\r\n pass", "import sys\r\nimport math\r\n \r\nfor i in range(8):\r\n st = sys.stdin.readline()\r\n for j in range(7):\r\n if(st[j] == st[j + 1]):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nproper = \"WBWBWBWB\"\r\n\r\nfor _ in range(8):\r\n s = input()\r\n if proper not in s+s:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/env python\r\n\r\ndef main():\r\n grid = [input() for _ in range(8)]\r\n \r\n for row in grid:\r\n if not (row == 'WB'*4 or row == 'BW'*4):\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "result = 1\r\nres = 0\r\nfor i in range(8):\r\n n = input()\r\n for j in range(7):\r\n if n[j] != n[j+1]:\r\n if n.count(n[j]) == n.count(n[j+1]):\r\n continue\r\n else:\r\n res = 1\r\n else:\r\n res = 1\r\nif res == 1:\r\n print('NO')\r\nelse:\r\n print('YES')", "yes = True\nfor i in range(8):\n s = input()\n if yes:\n for j in range(7):\n if s[j] == s[j + 1]:\n yes = False\n break\nprint(\"YES\" if yes else \"NO\")\n\n", "# your code goes here\r\n\r\nflag = 0\r\nfor i in range(8):\r\n\tprev = 'X'\r\n\tarr = list(input())\r\n\tfor ch in arr:\r\n\t\tif ch == prev:\r\n\t\t#\tprint(str(i) + ' ' + ch)\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\t\tprev = ch\r\n\tif flag == 1:\r\n\t\tbreak\r\nif flag == 0:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "if __name__ == '__main__':\r\n flag = False\r\n for _ in range(8):\r\n line = str(input())\r\n if line not in ('WBWBWBWB', 'BWBWBWBW'):\r\n flag = True\r\n break\r\n print('NO') if flag else print('YES')\r\n", "def chess(li):\n\tfor i in range(8):\n\t\tfor j in range(8):\n\t\t\tif li[i][0] == li[i][7]:\n\t\t\t\treturn False\n\t\t\tif j+1<len(li) and li[i][j] == li[i][j+1] :\n\t\t\t\treturn False\n\treturn True\n\n\nli =[]\nfor i in range(8):\n\ta=input()\n\tli.append(list(a))\n\nif chess(li):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "def proper(line):\n current = line[0]\n for j in range(1, len(line)):\n if line[j] == current:\n return False\n else:\n current = line[j]\n return True\n\nanswer = \"YES\"\n\nfor i in range(8):\n if not proper(input()):\n answer = \"NO\"\n \nprint(answer)\n\n\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 Little_Elephant_and_Chess():\r\n rows = []\r\n for row_index in range(8):\r\n rows.append(insr())\r\n\r\n for row in rows:\r\n currentPtr = 0\r\n nextPtr = 1\r\n\r\n while nextPtr <= 7:\r\n if row[nextPtr] == row[currentPtr]:\r\n print(\"NO\")\r\n return \r\n currentPtr += 1\r\n nextPtr += 1\r\n \r\n print(\"YES\")\r\n return\r\n\r\nLittle_Elephant_and_Chess()", "#!/usr/bin/env python\r\n\r\ndef main():\r\n grid = [input() for _ in range(8)]\r\n\r\n c1, c2 = 'WB' * 4, 'BW' * 4\r\n for row in grid:\r\n if not (row == c1 or row == c2):\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "flag = True\r\nfor _ in range(8):\r\n check = input()\r\n if(check != \"WBWBWBWB\" and check != \"BWBWBWBW\"):\r\n flag = False\r\n\r\nprint(\"YES\" if flag else \"NO\")", "from sys import stdin\r\n\r\n\r\ndef fun(row):\r\n col1=row[0]\r\n col2=row[1]\r\n if col1!=col2:\r\n for i in range(8):\r\n if i%2==0:\r\n if row[i]!=col1:\r\n return False\r\n else:\r\n if row[i]!=col2:\r\n return False\r\n else:\r\n return False\r\n return True\r\n\r\n\r\n\r\nlist=[]\r\nfor i in range(8):\r\n list.append(stdin.readline())\r\nvalid=1\r\nfor row in list:\r\n if not fun(row):\r\n valid=0\r\n break\r\nif valid==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "ch = True\nfor i in range(8):\n l = input()\n if l in \"BWBWBWBW\" or l in \"WBWBWBWB\":\n pass\n else:\n print(\"NO\")\n ch = False\n break\nif ch:\n print(\"YES\")\n \t \t \t \t\t\t\t \t \t \t \t \t", "flag=True\r\nfor i in range(8):\r\n s=input()\r\n if s.count(\"WB\")!=4 and s.count(\"BW\")!=4:\r\n \t print(\"NO\")\r\n \t flag=False\r\n \t break\r\nif flag:\r\n print(\"YES\")\r\n", "def solve():\r\n\tfor i in range(8):\r\n\t\trow = list(input())\r\n\t\tprev = row.pop(0)\r\n\r\n\t\tfor j in row:\r\n\t\t\tif j == prev:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\treturn\r\n\t\t\tprev = j\r\n\r\n\tprint(\"YES\")\r\n\r\nsolve()", "mat=[list(input()) for i in range(8)]\r\n#print(mat)\r\nm1=list('BW'*4)\r\nm2=list('WB'*4)\r\nok='YES'\r\nfor m in mat:\r\n if m!=m1 and m!=m2:\r\n ok='NO'\r\n break\r\nprint(ok)\r\n", "import sys\nimport os\n\nif os.environ.get(\"GHOST\") == \"TRUE\":\n\tsys.stdin = open(\"name.in\")\n\tsys.stdout = open(\"name.out\", \"w\")\n\n\n# Code begins here ...\n\nok = True;\nfor t in range(8):\n\trow = input()\n\tfor i in range(8):\n\t\tif(i > 0 and row[i] == row[i-1]):\n\t\t\tok = False\n\nif ok: print(\"YES\")\nelse: print(\"NO\")\n\n# Code ends here ...\n", "board = [input() for _ in range(8)]\r\nres = \"YES\"\r\nfor b in board:\r\n if res == \"NO\":\r\n break\r\n prev = b[0]\r\n for i in range(1, len(b)):\r\n if b[i] == prev:\r\n res = \"NO\"\r\n break\r\n prev = b[i]\r\n\r\nprint(res)\r\n", "t1='WBWBWBWB'\r\nt2='BWBWBWBW'\r\nflag1=0\r\nfor i in range(0,8):\r\n s=input()\r\n if s==t1 or s==t2:\r\n continue\r\n else :\r\n flag1=1\r\n break\r\nif flag1==0:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "arr=[]\r\nfor i in range(8):\r\n a=input()\r\n a=[a[i] for i in range(8)]\r\n arr.append(a)\r\nfound = False\r\nfor s in range(8):\r\n if found:\r\n break\r\n if arr[s][0]==arr[s][7]:\r\n print('NO')\r\n found=True\r\n break\r\n for t in range(7):\r\n if arr[s][t]==arr[s][t+1]:\r\n print('NO')\r\n found=True\r\n break\r\n \r\nif not found:\r\n print('YES')", "def main():\n for _ in range(8):\n s = input()\n if not s[::2] == s[0] * 4 != s[1] * 4 == s[1::2]:\n print('NO')\n return\n print('YES')\n\n\nif __name__ == '__main__':\n main()\n", "a,f,x,y=[],0,\"WBWBWBWB\",\"BWBWBWBW\"\r\nfor pratyush in range(8):\r\n s=input()\r\n a.append(s)\r\nfor i in a:\r\n if i==x or i==y:\r\n continue\r\n else:\r\n f=1\r\n break\r\nif f: print(\"NO\")\r\nelse: print(\"YES\")", "import math\r\n\r\ndef main_function():\r\n board = [input() for i in range(8)]\r\n board_is_good = True\r\n for i in board:\r\n for j in range(1, len(i)):\r\n if i[j] == i[j - 1]:\r\n board_is_good = False\r\n break\r\n if board_is_good:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n" ]

[ "n = int(input())\r\nmaxs = list(map(float, input().split()))\r\nmins = list(map(float, input().split()))\r\n\r\nd1s, d2s = [], []\r\ncd1sum, cd2sum = 0, 0\r\n\r\nfor i in range(n):\r\n z = mins[i]+maxs[i]\r\n c = cd2sum\r\n d = cd1sum\r\n s = mins[i]\r\n b = d-z-c\r\n c = z-d*z-s\r\n disc = max(0, (b**2-4*c))**0.5\r\n ans = min( (-b + disc)/(2.0), (-b-disc)/(2.0))\r\n d1s.append(ans)\r\n d2s.append(z-ans)\r\n cd1sum += d1s[-1]\r\n cd2sum += d2s[-1]\r\n\r\nprint(' '.join(map(str, d1s)))\r\nprint(' '.join(map(str, d2s)))\r\n\r\n \r\n", "n = int(input())\r\nM = list(map(float, input().split()))\r\nm = list(map(float, input().split()))\r\na = []\r\nsa = [0]\r\nb = []\r\nsb = [0]\r\n\r\nfor i in range(0, n):\r\n p = sa[i] - sb[i] - M[i] - m[i]\r\n q = M[i] - sa[i]*(M[i] + m[i])\r\n d = p*p - 4*q\r\n if d < 0:\r\n d = -d\r\n a.append((-p + (d ** 0.5))/2)\r\n b.append(M[i] + m[i] - a[i])\r\n sa.append(sa[i] + a[i])\r\n sb.append(sb[i] + b[i])\r\nfor i in range(0, n-1):\r\n print(a[i], ' ', end='')\r\nprint(a[-1])\r\nfor i in range(0, n-1):\r\n print(b[i], ' ', end='')\r\nprint(b[-1])\r\n", "import math\r\n\r\nn = int(input())\r\nY = [0.0]\r\nZ = [0.0]\r\nY = Y + [float(y) for y in input().split()]\r\nZ = Z + [float(z) for z in input().split()]\r\nS = [y + z for y, z in zip(Y, Z)]\r\n\r\nCS = [0 for i in range(n+1)]\r\nfor i in range(1, n+1):\r\n CS[i] = CS[i-1] + S[i]\r\n\r\nA = [0 for i in range(0, n+1)]\r\nB = [0 for i in range(0, n+1)]\r\n\r\nCA = 0\r\nfor e in range(1, n+1):\r\n dis = (CS[e] - 2 * CA) ** 2 + 4 * (S[e] * CA - Y[e])\r\n if abs(dis) < 1e-12:\r\n dis = 0\r\n # print(dis)\r\n A[e] = CS[e] - 2*CA + math.sqrt(dis)\r\n A[e] /= 2\r\n CA += A[e]\r\n B[e] = S[e] - A[e]\r\n\r\n# print(Y, Z, S)\r\n# print(CS)\r\nprint(' '.join(['%.7f' % a for a in A[1:]]))\r\nprint(' '.join(['%.7f' % a for a in B[1:]]))\r\n" ]

[ "INF = 10**18\r\n\r\nn, m, k = map(int, input().split())\r\n\r\ncost = [[INF]*(n+1) for i in range(n+1)]\r\ndp = [[INF]*(n+1) for i in range(n+1)]\r\n\r\nfor i in range(m):\r\n l, r, c = map(int, input().split())\r\n for j in range(l, r+1):\r\n cost[j][r] = min(cost[j][r], c)\r\n\r\ndp[0][0] = 0\r\n\r\nfor i in range(n):\r\n for j in range(k+1):\r\n dp[i+1][j] = min(dp[i+1][j], dp[i][j])\r\n for len in range(n+1):\r\n if i+len <= n and j+len <= k:\r\n dp[i+len][j+len] = min(dp[i+len][j+len], dp[i][j] + cost[i+1][i+len])\r\n\r\nif dp[n][k] == INF : print(-1)\r\nelse : print(dp[n][k])\r\n\r\n" ]

[ "n, m = map(int, input().split())\r\nx = list(map(int, input().split()))\r\nnum = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a, b = a - 1, b - 1\r\n num += min(x[a], x[b])\r\n\r\n\r\nprint(num)\r\n", "from collections import defaultdict\r\nn,m = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nd = defaultdict(list)\r\nans = 0\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n ans += min(A[a-1],A[b-1])\r\n \r\nprint(ans)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\na=[0]+a\r\ncount=0\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n count+=min(a[x],a[y])\r\nprint(count)", "n,m = map(int,input().split())\r\nfun = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n ans+=min(fun[a-1],fun[b-1])\r\nprint (ans)\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx=[[] for i in range(n+1)]\r\ny=[0 for i in range(n+1)]\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n x[l].append(r)\r\n x[r].append(l)\r\n y[l]+=a[r-1]\r\n y[r]+=a[l-1]\r\ne=[]\r\nfor i in range(n):\r\n e.append([a[i],i+1])\r\ne=sorted(e,key=lambda x:x[0],reverse=True)\r\n\r\ns=10**6 \r\nans=0\r\n# print(e)\r\nfor i in e:\r\n # print(y)\r\n k=i[1] \r\n ans+=y[k] \r\n y[k]=0\r\n for h in x[k]:\r\n if(y[h]>0):\r\n y[h]-=a[k-1];\r\nprint(ans) ", "n, m = map(int, input(\"\").split())\r\nweight_list = list(map(int, input(\"\").split()))\r\nvertice_weights = { i: weight_list[i-1] for i in range(1, n+1)}\r\nedge_list = []\r\nfor i in range(m):\r\n start, end = map(int, input(\"\").split())\r\n edge_list.append((start, end))\r\n\r\nmin_energy = 0\r\nfor edge in edge_list:\r\n start, end = edge[0], edge[1]\r\n if vertice_weights[start] < vertice_weights[end]:\r\n min_energy += vertice_weights[start]\r\n else:\r\n min_energy += vertice_weights[end]\r\n\r\nprint(min_energy)\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nf=[int(x) for x in input().split()]\r\nans=0\r\nfor _ in range(m):\r\n\ta,b=map(int,input().split())\r\n\tans+=min(f[a-1],f[b-1])\r\n \r\nprint(ans)", "def find_min(arr, n):\r\n mi = 0\r\n ind = -1\r\n for i in range(n):\r\n if arr[i] > mi :\r\n mi = arr[i]\r\n ind = i\r\n return ind + 1\r\n\r\nclass node():\r\n def __init__(self):\r\n self.list = []\r\n def ad(self, d):\r\n self.list.append(d)\r\n def rmv(self, d):\r\n for i in range(len(self.list)):\r\n if self.list[i] == d:\r\n self.list[i] = 0\r\n return True\r\n return False\r\n\r\nclass graph():\r\n def __init__(self, n):\r\n self.list = [0] * (n + 1)\r\n for i in range(1, n+ 1):\r\n m = node()\r\n self.list[i] = m\r\n def add(self, a, b):\r\n self.list[a].ad(b)\r\n self.list[b].ad(a)\r\n def remove(self, d):\r\n f = []\r\n for i in range(1, n+1):\r\n if self.list[i] != 0:\r\n bl = self.list[i].rmv(d)\r\n if(bl):\r\n f.append(i)\r\n self.list[d] = 0\r\n return f\r\n\r\n\r\nn, m = map(int, input().split(\" \"))\r\na = [int(i) for i in input().split(\" \")]\r\ng = graph(n)\r\narr = [0] * (n + 1)\r\nfor _ in range(m):\r\n c,b = map(int, input().split(\" \"))\r\n g.add(c,b)\r\n arr[c] += a[b - 1]\r\n arr[b] += a[c - 1]\r\ncnt = 0\r\nind = -1\r\nwhile (ind != 0):\r\n ind = find_min(a, n)\r\n cnt += arr[ind]\r\n arr[ind] = 0\r\n h = g.remove(ind)\r\n for i in range(len(h)):\r\n arr[h[i]] -= a[ind - 1]\r\n a[ind - 1] = 0\r\n\r\nprint(cnt)\r\n", "a = list(map(int, input().split()))\nenergy = list(map(int, input().split()))\nnodes = []\nfor i in range(a[1]):\n tmp = list(map(int, input().split()))\n nodes.append((tmp[0], tmp[1]))\n# nodes.append(list(map(int, input().split())))\nsumm = 0\nwhile True:\n tmp = []\n maxx = max(energy)\n andis = energy.index(maxx)\n energy[andis] = -1\n andis += 1\n for item in nodes:\n if andis not in item:\n tmp.append(item)\n else:\n if item[0] != andis:\n summ += energy[item[0]-1]\n else:\n summ += energy[item[1]-1] \n nodes = tmp\n if len(nodes) == 0:\n print(summ)\n break\n", "n ,m= map(int,input().split())\r\n\r\nmy_list=[int(i)for i in input().split()]\r\nans=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n ans+=min(my_list[a-1],my_list[b-1])\r\nprint(ans)", "read = lambda: map(int, input().split())\r\nn, m = read()\r\ncost = list(read())\r\n#print(cost)\r\nans = 0\r\nfor i in range(m):\r\n v, u = read()\r\n #print(v, u);\r\n ans += min(cost[v - 1], cost[u - 1])\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nu = list(map(int, input().split()))\r\nv = list(enumerate(u, 1))\r\nv.sort(key = lambda x: x[1], reverse = True)\r\ns, u = 0, [0] + u\r\np = [[] for i in range(n + 1)]\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n p[x].append(y)\r\n p[y].append(x)\r\nfor x, f in v:\r\n for y in p[x]: s += u[y]\r\n u[x] = 0\r\nprint(s)", "c=0\nn,m=list(map(int,input().split()))\ncost=list(map(int,input().split()))\n\n\nfor i in range(m):\n\tf,s=list(map(int,input().split()))\n\tc+=min(cost[f-1],cost[s-1])\nprint(c)\n\n\t\n", "n, m = [int(c) for c in input().split()]\r\nv = [0] + [int(c) for c in input().split()]\r\nchains = [[] for _ in range(n + 1)]\r\n\r\nfor i in range(m):\r\n a, b = [int(c) for c in input().split()]\r\n chains[a].append(b)\r\n chains[b].append(a)\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n m = 0\r\n ind = 0\r\n for j in range(len(v)):\r\n if v[j] > m:\r\n m = v[j]\r\n ind = j\r\n\r\n res += sum([v[_] for _ in chains[ind]])\r\n\r\n v[ind] = 0\r\n\r\nprint(res)", "n,m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ncost = 0\r\nfor i in range(m):\r\n u,v = map(int, input().split())\r\n cost += min(l[u-1], l[v-1])\r\nprint(cost)", "from operator import itemgetter\r\n#int(input())\r\n#map(int,input().split())\r\n#[list(map(int,input().split())) for i in range(q)]\r\n#print(\"YES\" * ans + \"NO\" * (1-ans))\r\nn,m = map(int,input().split())\r\nvi = list(map(int,input().split()))\r\nai = [[vi[i],i] for i in range(n)]\r\nai3 = [0] * n\r\nar = [[] for i in range(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 ai3[x] += vi[y]\r\n ai3[y] += vi[x]\r\n ar[x] += [y]\r\n ar[y] += [x]\r\nai.sort(key = itemgetter(0))\r\nans = 0\r\nfor i in range(n-1,0,-1):\r\n ans += ai3[ai[i][1]]\r\n for j in ar[ai[i][1]]:\r\n ai3[j] -= vi[ai[i][1]]\r\nprint(ans)\r\n", "from __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())\nn,m = read_int_line()\nws=read_int_line()\nadjs=[set() for _ in range(n+1)]\nfor _ in range(m):\n a, b =read_int_line()\n adjs[a].add(b)\n adjs[b].add(a)\nwsi=[(w,i+1) for i, w in enumerate(ws)]\nws=[0]+ws\nwsi.sort(reverse=True)\nans=0\nfor w, i in wsi:\n ans+=sum(ws[x] for x in adjs[i])\n for x in adjs[i]:\n adjs[x].remove(i)\nprint(\"%d\"%ans)\n\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.insert(0,0)\r\nans=0\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n ans+=min(l[x],l[y])\r\n\r\nprint(ans)\r\n", "listA = list(map(int, input().split()))\nn, m = listA[0],listA[1]\n\nv = list(map(int, input().split()))\nr = 0\nlista=[]\ncount=0\n\nwhile count != m:\n a,b=input().split()\n a,b=int(a),int(b) \n a -= 1\n b -= 1\n \n if v[a] <= v[b]:\n lista.append(v[a])\n else:\n lista.append(v[b])\n count+=1\n \nprint(sum(lista))\n \n\n\t\t \t\t \t\t \t \t\t \t\t\t\t\t \t\t \t", "#!/usr/bin/env python3\n\ndef main():\n n, m = map(int, input().split())\n v, ans = list(map(int, input().split())), 0\n\n for i in range(m):\n ans += min(map(lambda x: v[int(x)-1], input().split()))\n\n print(ans)\n\nif __name__ == \"__main__\":\n main()\n\n", "n, m = map(int, input().split())\r\nv = [0] + list(map(int, input().split()))\r\nen = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n en += min(v[a], v[b])\r\nprint(en)", "n, m = map(int, input().split())\r\nvals = list(map(int, input().split()))\r\nadj = [list() for i in range(n)]\r\nlst = [i for i in range(n)]\r\nsums = [0 for i 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 adj[u].append(v)\r\n adj[v].append(u)\r\n sums[u] += vals[v]\r\n sums[v] += vals[u]\r\nres = 0\r\nlst.sort(key = lambda x: vals[x], reverse=True)\r\nfor i in range(n):\r\n v = lst[0]\r\n lst = lst[1:]\r\n res += sums[v]\r\n for ele in adj[v]: sums[ele] -= vals[v]\r\nprint(res)", "def solve():\r\n numVertices, numEdges = map(int, input().split())\r\n energyCost = [0] + list(map(int, input().split()))\r\n print(sum(min(energyCost[v] for v in map(int, input().split())) for edge in range(numEdges)))\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n, m = tuple(map(int,input().split()))\nv = list(map(int,input().split()))\nropes = []\nlinks = []\nfor j in range(n):\n links.append([])\n\nfor k in range(m):\n (a,b) = tuple(map(int,input().split()))\n links[a-1].append(b-1)\n links[b-1].append(a-1)\n ropes.append((a-1,b-1))\n\nfor i in range(n):\n v[i] = (v[i],i)\nv = sorted(v, reverse = True)\n\nout = set([])\nres = 0\n\nfor j in range(n):\n out.add(v[j][1])\n for i in range(n):\n if (not v[i][1] in out) and v[i][1] in links[v[j][1]]:\n res += v[i][0]\n\nprint(res)\n", "from collections import defaultdict\n\n[n, m] = [int(item) for item in input().split(' ')]\nenergy = [0] + [int(item) for item in input().split(' ')]\nedges = defaultdict(lambda: [])\n\nans = 0\nfor item in range(m):\n [a, b] = [int(item) for item in input().split(' ')]\n ans += min(energy[a], energy[b])\n\nprint(ans)\n", "I=lambda:list(map(int,input().split()))\r\nS=lambda:list(map(str,input().split()))\r\nfrom collections import OrderedDict\r\nn,m=I()\r\nl=I()\r\nt={}\r\nt1={}\r\nfor i in range(n):\r\n\tt1[i+1]=l[i]\r\nt1=sorted(t1.items(), key=lambda kv: kv[1],reverse=True)\r\nt1=[(0,0)]+t1\r\nz = [ [0] * (n+1) for _ in range(n+1)]\r\n\r\nfor i in range(1,m+1):\r\n\ta,b=I()\r\n\tz[a][b]=1\r\n\tz[b][a]=1\r\n\r\ns=0\r\nfor i in range(1,n+1):\r\n\tfor j in range(1,n+1):\r\n\t\tif z[t1[i][0]][j]==1:\r\n\t\t\ts+=l[j-1]\r\n\t\t\t\r\n\t\t\tz[j][t1[i][0]]=0\r\nprint(s)\r\n", "\r\n\r\n\r\nfrom collections import defaultdict\r\n\r\n\r\ndef main():\r\n ans = 0\r\n inp = input().split()\r\n inp = [int(i) for i in inp]\r\n n,m = inp[0],inp[1]\r\n weights = input().split()\r\n mp = {}\r\n mp = defaultdict(lambda : [], mp)\r\n weights = [int(i) for i in weights]\r\n for i in range(n):\r\n mp[weights[i]].append(i+1)\r\n weights.sort()\r\n graph = []\r\n for _ in range(n+1):\r\n graph.append(set())\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[0],inp[1]\r\n graph[u].add(v)\r\n graph[v].add(u)\r\n\r\n for weight in weights:\r\n index = mp[weight][0]\r\n mp[weight].pop(0)\r\n for neighbour in graph[index]:\r\n graph[neighbour].remove(index)\r\n # graph[index].remove(neighbour)\r\n ans += weight\r\n # graph[index] = set()\r\n \r\n print(ans)\r\n \r\n return 0\r\n \r\n\r\n\r\nif __name__==\"__main__\":\r\n main()", "n,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans=0\r\nfor _ in range(k):\r\n u,v = map(int, input().split())\r\n ans+=min(arr[u-1],arr[v-1])\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import collections\r\n\r\nn, m = map(int, input().split())\r\nV = list(map(int, input().split()))\r\nG = collections.defaultdict(set)\r\nfor _ in range(m):\r\n i, j = map(int, input().split())\r\n G[i-1].add(j-1)\r\n G[j-1].add(i-1)\r\n \r\nret = 0\r\nVI = sorted([(v, i) for i, v in enumerate(V)], reverse=True)\r\nfor v, i in VI:\r\n edges = G[i]\r\n for j in edges:\r\n ret += V[j]\r\n G[j].remove(i)\r\nprint(ret)", "n, m = map(int, input().split())\r\nf = [int(x) for x in input().split()]\r\nans = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n ans += min(f[a - 1], f[b - 1])\r\nprint(ans)", "import sys\r\nn, m = map(int, input().split())\r\nv = [int(x) for x in input().split()]\r\nv.insert(0, 0)\r\nans = 0\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n ans += min(v[x], v[y])\r\nprint(ans)\r\n\r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tans+=min(a[x-1],a[y-1])\r\nprint(ans)", "n,m = map(int,input().split())\r\nar = list(map(int,input().split()))\r\nb = []\r\nfor _ in range(m):\r\n v,u = map(int,input().split())\r\n b.append(min(ar[v-1],ar[u-1]))\r\nprint(sum(b))", "n, m = map(int, input().split())\r\nenergy = list(map(int, input().split()))\r\nmapping = {}\r\nans = 0\r\nfor index, val in enumerate(energy):\r\n mapping[index + 1] = val\r\n\r\nfor x in range(m):\r\n z = tuple(map(int, input().split()))\r\n ans += min(mapping[z[0]], mapping[z[1]])\r\nprint(ans)", "I=lambda:list(map(int,input().split()))\r\nn,m=I()\r\nl=I()\r\nans=0\r\nfor i in range(m):\r\n x,y=I()\r\n ans+=min(l[x-1],l[y-1])\r\nprint(ans)", "class pair:\r\n def __init__ (self, first, second):\r\n self.first = first\r\n self.second = second\r\n\r\ndef ans(graph, v, n):\r\n result = 0\r\n arr = []\r\n for i in range(0, n):\r\n arr.append(pair(v[i], i))\r\n\r\n arr.sort(key=lambda p: (p.first, p.second))\r\n arr.reverse()\r\n\r\n for i in range(0, n):\r\n for j in graph[arr[i].second]:\r\n result += v[j]\r\n v[arr[i].second] = 0\r\n return result\r\n\r\nn, m = map(int, input().split())\r\nv = list(map(int, input().split()))\r\n\r\ngraph = [[] for i in range(0, 1001)]\r\n\r\nfor _ in range(0, m):\r\n x, y = map(int, input().split())\r\n graph[x - 1].append(y - 1)\r\n graph[y - 1].append(x - 1)\r\n\r\nprint(ans(graph, v, n))", "n,m=map(int,input().split())\na=list(map(int,input().split()))\nans=0\nfor i in range(m):\n\tx,y=map(int,input().split())\n\tans+=min(a[x-1],a[y-1])\nprint(ans)\n", "n, m = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nr = [set() for i in range(n)]\r\nfor i in range(m):\r\n n1, n2 = (int(x) - 1 for x in input().split())\r\n r[n1].add(n2)\r\n r[n2].add(n1)\r\nval = 0\r\nfor x in reversed(sorted((x, i) for i, x in enumerate(v))):\r\n for y in r[x[1]]:\r\n val += v[y]\r\n r[y].remove(x[1])\r\nprint(val)", "n,m=map(int,input().split())\r\na,s=list(map(int,input().split())),0\r\nfor i in range(m):\r\n q,w=map(int,input().split())\r\n s+=min(a[q-1],a[w-1])\r\nprint(s)", "import sys\r\nimport os.path\r\n \r\nif(os.path.exists('input.txt')) :\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\n sys.stderr = open(\"error.txt\", \"w\")\r\n \r\ndepth = 1000005\r\nmod = 1000000007 \r\nlim = mod * mod\r\nsys.setrecursionlimit(depth) \r\n\r\nlinp = lambda: list(minp())\r\nminp = lambda: map(int, input().split())\r\n\r\nfrom math import inf, ceil, sqrt, log2\r\nfrom collections import defaultdict\r\n\r\ndd = lambda x: defaultdict(lambda: x)\r\n\r\n(n, m) , a = minp(), linp()\r\nadj = [[] for _ in range(n+1)]\r\ncnt = [0 for _ in range(n+1)]\r\nfor _ in range(m) :\r\n u, v = minp() \r\n adj[u].append(v)\r\n adj[v].append(u)\r\nb = a.copy()\r\nfor i in range(n) :\r\n a[i] = [a[i], i+1]\r\na.sort(key=lambda x: x[0])\r\nans = 0\r\nfor e in reversed(a) :\r\n if adj[e[1]] : \r\n for v in adj[e[1]] :\r\n ans += b[v-1]\r\n adj[v].remove(e[1])\r\n adj[e[1]].clear()\r\nprint(ans)", "n, m = map(int, input().split())\r\nenergy = list(map(int, input().split()))\r\nropes = []\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n ropes.append((a, b))\r\nans = 0\r\nfor tup in ropes:\r\n ans += min(energy[tup[0]-1], energy[tup[1]-1])\r\nprint(ans)", "n, m = map(int, input().split())\r\nnseq = list(map(int, input().split()))\r\nanswer = 0\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n answer += min(nseq[x-1], nseq[y-1])\r\nprint(answer)", "\r\nimport queue\r\ngraph=[]\r\nvalue=[]\r\nQ=queue.PriorityQueue();\r\ndone=[]\r\nsumN=[]\r\n\r\ndef inputArray():\r\n temp=str( input())\r\n A=temp.split();\r\n return list( map(int,A));\r\n\r\n\r\nif( __name__==\"__main__\"):\r\n n,m=map(int, input().split())\r\n value=inputArray()\r\n\r\n graph=[ [] for x in range(n) ]\r\n\r\n for i in range(m):\r\n a,b=map(int, input().split())\r\n a-=1;\r\n b-=1;\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n \r\n input=[]\r\n\r\n for i in range(n):\r\n input.append( (value[i],i) )\r\n\r\n input=sorted(input) \r\n\r\n #print(input)\r\n\r\n ans=0\r\n\r\n done=[0 for x in range(n) ]\r\n\r\n for i in reversed(input):\r\n curr=i[1]#id of curr elenmt\r\n #print(curr)\r\n for j in range( len(graph[curr]) ):\r\n tp=graph[curr][j]\r\n\r\n if( not done[tp] ):\r\n assert( value[tp] <= value[curr])\r\n ans+=value[tp]\r\n\r\n done[curr]=True\r\n\r\n print(ans);\r\n", "n,k=map(int,input().split())\r\nL=list(map(int,input().split()))\r\nenergy=0\r\nfor _ in range(k):\r\n t1,t2=map(int,input().split())\r\n if L[t1-1]>=L[t2-1]:\r\n energy+=L[t2-1]\r\n else:\r\n energy+=L[t1-1]\r\nprint(energy)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nadl = [[] for i in range(n)]\r\nsum1 = [0 for i in range(n)]\r\naa = [(a[i], i) for i in range(n)]\r\n \r\n \r\nfor i in range(m):\r\n b, c = map(int, input().split())\r\n adl[b - 1].append(c - 1)\r\n adl[c - 1].append(b - 1)\r\n sum1[b - 1] += a[c - 1]\r\n sum1[c - 1] += a[b - 1]\r\n \r\nans = 0\r\naa.sort()\r\naa.reverse()\r\n\r\nfor (v, ind) in aa:\r\n ans += sum1[ind]\r\n for k in adl[ind]:\r\n adl[k].remove(ind)\r\n sum1[k] -= v\r\n adl[ind] = []\r\nprint(ans)", "inp = lambda: map(int, input().split())\r\nn, m = inp()\r\na = list(inp())\r\nans = 0\r\nfor i in range(m):\r\n v1, v2 = map(int, input().split())\r\n v1 -= 1\r\n v2 -= 1\r\n ans += min(a[v1], a[v2])\r\nprint(ans)", "n, m = map(int, input().split())\r\nv = { i+1: int(v) for i, v in enumerate(input().split())}\r\n\r\nans = 0\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n ans += min(v[x], v[y])\r\n\r\nprint(ans)\r\n", "l=lambda :map(int,input().split())\r\nn,m=l()\r\nv=[0]+list(l())\r\nprint(sum(min(v[x],v[y]) for x,y in (l() for _ in ' '*m)))", "n, m = [int(a) for a in input().split()]\nv = [int(a) for a in input().split()]\nadj = [set() for _ in range(n)]\nfor i in range(m):\n x,y = [int(a) for a in input().split()]\n x-=1\n y-=1\n adj[x].add(y)\n adj[y].add(x)\n\ntotalenergy = 0\nfor i in range(n):\n '''\n minenergy = sum(v)\n print('minenergy', minenergy)\n minx = -1 \n\n for x in range(n):\n if len(adj[x]) == 0:\n continue\n energy = sum([v[y] for y in adj[x]])\n print('energy', x, energy)\n if energy < minenergy:\n minenergy, minx = energy, x\n \n totalenergy += minenergy\n for y in adj[minx]:\n adj[y].remove(minx)\n adj[minx].clear()\n '''\n\n attached = list([(x,vv) for x,vv in enumerate(v) if adj[x]])\n if not attached:\n break\n maxx,maxv = max(attached, key=lambda x:x[1])\n totalenergy += sum([v[y] for y in adj[maxx]])\n for y in adj[maxx]:\n adj[y].remove(maxx)\n adj[maxx].clear()\n\nprint(totalenergy)\n \t\t\t\t\t \t\t \t \t \t\t\t", "import sys \r\nn,m=map(int,sys.stdin.readline().split())\r\nl=list(map(int,sys.stdin.readline().split()))\r\nans=0\r\nfor i in range(m):\r\n x,y=map(int,sys.stdin.readline().split())\r\n ans+=min(l[x-1],l[y-1])\r\nprint(ans) ", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nres = 0\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n res += min(arr[x-1], arr[y-1])\r\nprint(res)\r\n", "import sys\nimport math\ninput = sys.stdin.readline\nfrom collections import defaultdict\nn, m = map(int, input().split())\nlst = list(map(int, input().split()))\nans = 0\nfor i in range(m):\n x, y = map(int, input().split())\n ans += min(lst[x-1], lst[y-1])\nprint(ans)", "# in the name of god \n\nfrom collections import defaultdict\n\ndef read():\n return map(int, input().strip().split())\n\nn, m = read()\n\ne = list(read())\ne = [(x, i) for i, x in enumerate(e)]\ng = defaultdict(list)\n\nfor _ in range(m):\n u, v = read()\n u -= 1\n v -= 1\n g[u].append(v)\n g[v].append(u)\n\n\ncost = 0\nfor x in reversed(sorted(e)):\n u = x[1]\n e_ = x[0]\n\n for v in g[u]:\n cost += min(e[u][0], e[v][0])\n g[v].remove(u)\n\nprint(cost)\n", "\nfrom collections import defaultdict\n\nn, m = list(map(int, input().split()))\nv = list(map(int, input().split()))\n# cost = [0 for i in range(n)]\ngraph = defaultdict(list)\nfor i in range(m):\n x, y = list(map(int, input().split()))\n graph[x-1].append(y-1)\n graph[y-1].append(x-1)\n\nnodes = [i for i in range(n)]\nnodes.sort(key=lambda x: v[x], reverse=True)\nremovido = [False for i in range(n)]\ncost = 0\nfor node in nodes:\n removido[node] = True\n for adj in graph[node]:\n if not removido[adj]:\n cost += v[adj]\n\nprint(cost)\n\n\t \t\t \t\t\t\t\t \t\t \t \t \t \t\t\t\t", "from collections import defaultdict\r\n\r\nn , m = map(int, input().split())\r\n\r\ngraph = defaultdict(list)\r\nl=list(map(int, input().split()))\r\n\r\n\r\nfor i in range(1,n+1):\r\n graph[i]=[]\r\n\r\n\r\nfor i 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\n\r\nval=[]\r\n\r\nfor i in range(1,n+1):\r\n val.append([i,l[i-1]])\r\n\r\nval = sorted(val, key=lambda x:x[1])\r\n\r\n\r\ntotal=0\r\n\r\nfor node1, value in val:\r\n\r\n for node2 in graph[node1]:\r\n total+=value\r\n graph[node2].remove(node1)\r\n\r\n\r\nprint(total)", "n,m = map(int,input().split())\narr = list(map(int,input().split()))\nans = 0\nfor i in range(m):\n x,y=map(int,input().split())\n ans+=min(arr[x-1],arr[y-1])\nprint(ans)\n", "from sys import stdin\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 lsi():\r\n x=list(stdin.readline())\r\n x.pop()\r\n return x\r\ndef si(): return stdin.readline()\r\n############# CODE STARTS HERE #############\r\nn, m=mi()\r\ncnct=[set() for _ in range(n+1)]\r\ncost=[0]*(n+1)\r\nval=dict()\r\na=li()\r\nc=1\r\nfor i in a:\r\n if i not in val:\r\n val[i]={c}\r\n else:\r\n val[i].update({c})\r\n c+=1\r\nfor _ in range(m):\r\n x, y=mi()\r\n cnct[x].add(y)\r\n cnct[y].add(x)\r\n cost[x]+=a[y-1]\r\n cost[y]+=a[x-1]\r\na.sort(reverse=True)\r\ncnt=0\r\nfor i in a:\r\n x=val[i].pop()\r\n cnt+=cost[x]\r\n for el in cnct[x]:\r\n cost[el]-=i\r\n cnct[el].remove(x)\r\nprint(cnt)", "\r\na,b=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd={}\r\nfor x,y in enumerate(c):\r\n d[x+1]=y\r\nans=0\r\nfor i in range(b):\r\n x,y=list(map(int,input().split()))\r\n ans=ans+min(d[x],d[y])\r\nprint(ans)", "# This code is contributed by Siddharth\r\n\r\nfrom sys import *\r\ninput = stdin.readline\r\n# setrecursionlimit(10**6)\r\n# from sys import *\r\n\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nimport operator\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\n\r\n\r\n\r\n\r\n\r\n# ==========================================> Code Starts Here <=====================================================================\r\n\r\n\r\nn,m=map(int,input().split())\r\nv=list(map(int,input().split()))\r\narr=defaultdict(list)\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n arr[a].append(b)\r\n arr[b].append(a)\r\nsub=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n for j in arr[i]:\r\n sub[i]+=v[j-1]\r\ntemp=[(i+1,v[i]) for i in range(n)]\r\ntemp.sort(key=lambda x:x[1],reverse=True)\r\ncost=0\r\nfor i in range(n):\r\n\r\n ind=temp[i][0]\r\n cost+=sub[ind]\r\n for j in arr[ind]:\r\n sub[j]-=v[ind-1]\r\n sub[ind]=0\r\nprint(cost)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = [int(x) for x in input().split()]\nv = [int(x) for x in input().split()]\na = [[] for x in range(n)]\nused = [0] * n\nfor i in range(m):\n\tx, y = [int(x) for x in input().split()]\n\tx -= 1\n\ty -= 1\n\ta[x].append(y)\n\ta[y].append(x)\nl = sorted(zip(v, range(n)), key = lambda x: -x[0])\nans = 0\nfor _, i in l:\n\tused[i] = 1\n\tfor x in a[i]:\n\t\tif not used[x]:\n\t\t\tans += v[x]\nprint(ans)\n", "n, m = map(int, input().split())\ntmp = list(map(int, input().split()))\ns = 0\n\nfor _ in range(m):\n x, y = map(int, input().split())\n s += min(tmp[x - 1], tmp[y - 1])\nprint(s)\n\n\n\t\t \t \t \t \t \t\t\t\t\t \t \t \t\t\t\t \t\t", "n,m=map(int,input().split())\r\nv=list(map(int,input().split()))\r\nans=0\r\nfor _ in range(m):\r\n x,y=map(int,input().split())\r\n ans+=min(v[x-1],v[y-1])\r\nprint(ans)\r\n", "r = lambda:map(int, input().split())\r\nn, m = r()\r\na = [0] + list(r())\r\nprint(sum(min(a[u], a[v]) for u, v in (r() for i in range(m))))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\norder = []\r\nfor i in range(n):\r\n order.append((a[i], i+1))\r\norder.sort(reverse=True)\r\n\r\nadj = [[] for _ in range(n+1)]\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n adj[x].append(y)\r\n adj[y].append(x)\r\n\r\ndeleted = [0]*(n+1)\r\nans = 0\r\nfor i in range(n):\r\n x = order[i][1]\r\n deleted[x] = 1\r\n for con in adj[x]:\r\n if not deleted[con]:\r\n ans += a[con-1]\r\n\r\nprint(ans)", "maxx = int(1e9)\ndef getVals(type = str):\n return list(map(type, input().split()))\n\nn, m = getVals(int)\ncosts = getVals(int)\ntotal = [0 for i in range(n)]\nadj = [[] for i in range(n)]\ndef solve(n, m):\n ans = 0\n for i in range(m):\n x, y = getVals(int)\n x -= 1\n y -= 1\n total[x] += costs[y]\n adj[x].append(y)\n total[y] += costs[x]\n adj[y].append(x)\n L = []\n for i in range(n):\n L.append([costs[i], i])\n L.sort()\n for i in range(n - 1, -1, -1):\n ans += total[L[i][1]]\n for num in adj[L[i][1]]:\n total[num] -= costs[L[i][1]]\n return ans\nprint(solve(n, m))\n \t\t\t\t \t \t\t \t\t", "\r\n\r\nn,m = map(int,input().split())\r\n\r\ncost = [int(x) for x in input().split()]\r\narist = []\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n arist.append((x,y)) \r\n\r\n#cost = [40,10,20,10,20,80,40]\r\n#arist =[(1,5),(4,7),(4,5),(5,2),(5,7),(6,4),(1,6),(1,3),(4,3),(1,4)]\r\ngraf = [[]for i in range(n)]\r\n\r\ntup = [(cost[i],i) for i in range(len(cost))]\r\n\r\ncos_amount = [0 for i in range(n)]\r\nfor i in arist:\r\n graf[i[0]-1].append(i[1]-1)\r\n graf[i[1]-1].append(i[0]-1)\r\n cos_amount[i[0]-1] += cost[i[1]-1]\r\n cos_amount[i[1]-1] += cost[i[0]-1]\r\n\r\nsort = sorted(tup,key=lambda parameter_list: parameter_list[0], reverse=True)\r\nsol = 0\r\nfor i in range(n-1):\r\n part = sort[i]\r\n sol += cos_amount[part[1]]\r\n for j in range(len(graf[part[1]])):\r\n cos_amount[graf[part[1]][j]] -= part[0]\r\n\r\nprint(sol)\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input(). split())\r\nlis = list(map(int, input(). split()))\r\nsm = 0\r\nfor i in range(m):\r\n l, r = map(int, input(). split())\r\n sm += min(lis[l - 1], lis[r - 1])\r\nprint(sm)", "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\ndef main():\r\n try:\r\n n,m=In()\r\n l=list(In())\r\n ans=0\r\n d={}\r\n for x in range(n):\r\n d[x]=l[x]\r\n\r\n for i in range(m):\r\n a,b=In()\r\n if d[a-1]<d[b-1]:\r\n ans+=d[a-1]\r\n else:\r\n ans+=d[b-1] \r\n print(ans)\r\n\r\n except:\r\n pass\r\n \r\nM = 998244353\r\nP = 1000000007\r\n \r\nif __name__ == '__main__':\r\n for _ in range(1):\r\n main()", "import sys\r\nimport 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\nfor t in range(1):\r\n n,m=(get_ints())\r\n weight=[]\r\n for i in range(n):\r\n weight.append([])\r\n arr=get_list()\r\n ans=0\r\n for i in range(m):\r\n x,y=get_ints()\r\n ans+=min(arr[x-1],arr[y-1])\r\n print(ans)", "n,m=map(int,input().split())\r\n\r\nv=list(map(int,input().split()))\r\nV=list(v)\r\nCost=[0]*n\r\nChildren=[]\r\nfor i in range(n):\r\n V[i]=(v[i],i)\r\n Children.append([])\r\nV.sort(reverse=True)\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n x-=1\r\n y-=1\r\n Children[x].append(y)\r\n Children[y].append(x)\r\n Cost[x]+=v[y]\r\n Cost[y]+=v[x]\r\nans=0\r\nfor i in range(n):\r\n z=V[i][0]\r\n x=V[i][1]\r\n ans+=Cost[x]\r\n for child in Children[x]:\r\n Cost[child]-=z\r\nprint(ans)\r\n", "def main():\n n, m = map(int, input().split())\n vv = list(map(int, input().split()))\n print(sum(min(vv[i - 1] for i in map(int, input().split())) for _ in range(m)))\n\n\nif __name__ == '__main__':\n main()", "n,m=map(int,input().split())\r\n\r\ns=list(map(int,input().split()))\r\n\r\nans=0\r\nfor _ in range(m):\r\n\r\n a,b=map(int,input().split())\r\n ans+=min(s[a-1],s[b-1])\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nc = [0] * (n + 1)\r\nedge = [[] for i in range(n + 1)]\r\nfor i in range(m):\r\n\tu, v = map(int, input().split())\r\n\tedge[u].append(v)\r\n\tedge[v].append(u)\r\n\tc[u] += a[v]\r\n\tc[v] += a[u]\r\nans = 0\r\norder = sorted(list(range(1, n + 1)), key=lambda x: -a[x])\r\nfor idx in order:\r\n\tans += c[idx]\r\n\tfor to in edge[idx]:\r\n\t\tc[to] -= a[idx]\r\nprint(ans)", "n,m=map(int,input().split())\nv=list(map(int,input().split()))\nrj=0\n\nfor i in range(m):\n x,y=map(int,input().split())\n x,y=x-1,y-1\n rj+=min(v[x],v[y])\n\nprint(rj)\n\n \t \t \t \t \t \t \t\t\t \t", "import sys\ninput = sys.stdin.readline\n\nn, m = map(int, input().split())\narr = list(map(int, input().split()))\n\nsum = 0\nfor _ in range(m):\n u, v = map(int, input().split())\n sum += min(arr[u-1], arr[v-1])\n\nprint(sum)\n", "n,m = map(int,input().split())\r\n\r\nlst = list(map(int,input().split()))\r\n\r\ncnt=0;\r\n\r\nfor i in range(0,m):\r\n u,v = map(int,input().split())\r\n cnt+=min(lst[u-1],lst[v-1])\r\n\r\nprint(cnt)", "n, m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(m):\r\n\tx, y = map(int,input().split())\r\n\tans += min(arr[x-1], arr[y-1])\r\nprint(ans)", "import sys\r\nimport itertools\r\nimport math\r\nimport collections\r\nfrom collections import Counter\r\n\r\n#########################\r\n# imgur.com/Pkt7iIf.png #\r\n#########################\r\n\r\ndef sieve(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * 2, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n prime[0] = prime[1] = False\r\n r = [p for p in range(n + 1) if prime[p]]\r\n return r\r\ndef divs(n, start=1):\r\n r = []\r\n for i in range(start, int(math.sqrt(n) + 1)):\r\n if (n % i == 0):\r\n if (n / i == i):\r\n r.append(i)\r\n else:\r\n r.extend([i, n // i])\r\n return r\r\ndef ceil(n, k): return n // k + (n % k != 0)\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(map(int, input().split()))\r\ndef lcm(a, b): return abs(a * b) // math.gcd(a, b)\r\ndef prr(a, sep=' '): print(sep.join(map(str, a)))\r\ndef dd(): return collections.defaultdict(int)\r\n\r\nn, m = mi()\r\np = [0]*n\r\ng = [[] for i in range(n)]\r\nw = li()\r\nfor i in range(n):\r\n w[i] = [w[i], i]\r\n\r\nfor i in range(m):\r\n u, v = mi()\r\n g[u - 1].append(v - 1)\r\n g[v - 1].append(u - 1)\r\n p[u - 1] += w[v - 1][0]\r\n p[v - 1] += w[u - 1][0]\r\n\r\nw.sort(reverse = True)\r\nres = 0\r\nfor i in range(n - 1):\r\n res += p[w[i][1]]\r\n for j in g[w[i][1]]:\r\n p[j] -= w[i][0]\r\n\r\nprint(res)", "n, m = map(int, input().split())\r\nl = [*map(int, input().split())]\r\nres = 0\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n res += min(l[x - 1], l[y - 1])\r\nprint(res)", "# link: https://codeforces.com/problemset/problem/437/C\r\n\r\nimport sys\r\n\r\nif __name__ == \"__main__\":\r\n input_ = sys.stdin.readline\r\n parts, ropes = tuple(map(int, input_().split()))\r\n parts_cost = tuple(map(int, input_().split()))\r\n minimum_cost = 0\r\n for _ in range(ropes):\r\n part1, part2 = tuple(map(int, input_().split()))\r\n cost1 = parts_cost[part1 - 1]\r\n cost2 = parts_cost[part2 - 1]\r\n minimum_cost += min(cost1, cost2)\r\n print(minimum_cost) ", "n,m=map(int, input().split())\nw=list(map(int, input().split()))\n\ne=[[] for i in range(n)]\ns=0\nfor i in range (m):\n u,v=map(int, input().split())\n s+=min(w[u-1],w[v-1])\nprint(s)\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,eg=lst()\r\n a=lst();ans=0\r\n for i in range(eg):\r\n u,v=lst()\r\n ans+=min(a[u-1],a[v-1])\r\n print(ans)", "def mapit():\r\n\ttemp=list(map(int,input().split()))\r\n \r\n\treturn temp\r\n\r\n\r\ndef solution():\r\n\tn,m=mapit()\r\n\tval=mapit()\r\n\tconnect=[0]*n\r\n\r\n\tremoved=set()\r\n\tfor i in range(m):\r\n\t\tx,y=mapit()\r\n\t\tif connect[x-1]==0:\r\n\t\t\tconnect[x-1]=[(y-1,val[y-1])]\r\n\t\telse:\r\n\t\t\tconnect[x-1].append((y-1,val[y-1]))\r\n\t\tif connect[y-1]==0:\r\n\t\t\tconnect[y-1]=[(x-1,val[x-1])]\r\n\t\telse:\r\n\t\t\tconnect[y-1].append((x-1,val[x-1]))\r\n\tprio=[]\r\n\tfor i in range(n):\r\n\t\tprio.append((val[i],i))\r\n\tprio.sort()\r\n\t\r\n\tans=0\r\n\twhile prio:\r\n\t\tcurr=prio.pop()\r\n\t\tcurr_node=curr[1]\r\n\t\tremoved.add(curr_node)\r\n\t\tif connect[curr_node]!=0:\r\n\t\t\tfor node, value in connect[curr_node]:\r\n\t\t\t\tif node not in removed:\r\n\t\t\t\t\tans+=value\r\n\t\t\r\n\r\n\t\r\n\tprint(ans)\r\n\r\n\r\n\r\n\t\r\n\treturn\r\n\r\n\t\r\n\r\n\r\n# t=int(input())\r\n \r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n", "n,m=map(int,input().split())\nl=list(map(int,input().split()))\nans=0\nfor i in range(m):\n\tx,y=map(int,input().split())\n\tans+=min(l[x-1],l[y-1])\nprint(ans)", "parts,ropes=map(int,input().split())\r\nenergy=[0]+[*map(int,input().split())]\r\nconnected=[[*map(int,input().split())] for _ in[0]*ropes]\r\ngraph=dict()\r\nfor i in range(1,parts+1):\r\n graph[(i,energy[i])]=[]\r\nfor i in connected:\r\n graph[(i[0],energy[i[0]])]+=(i[1],energy[i[1]]),\r\n graph[(i[1],energy[i[1]])]+=(i[0],energy[i[0]]),\r\ndestroy=sorted(graph,key=lambda x:x[1],reverse=True)\r\ndeleted=dict();consume=0\r\nfor i in range(1,parts+1):\r\n deleted[(i,energy[i])]=False\r\nfor node in destroy:\r\n deleted[node]=True\r\n for nei in graph[node]:\r\n if not deleted[nei]:consume+=nei[1]\r\nprint(consume)", "n,m = map(int,input().split(' '))\r\nw = list(map(int,input().split(\" \")))\r\nans = 0\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n ans += min(w[a-1],w[b-1])\r\nprint(ans)", "n, m = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n ans += min(arr[a-1], arr[b-1])\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsu=0\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n su+=min(l[a-1],l[b-1])\r\nprint(su)", "n, m = map(int, input().split())\r\nv1 = list(map(int, input().split()))\r\nv = [[w, i] for i, w in enumerate(v1)]\r\nv.sort(reverse = True)\r\nd = [set() 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].add(b)\r\n d[b].add(a)\r\nans = 0\r\nfor w, i in v:\r\n for j in d[i]:\r\n ans += v1[j]\r\n d[j].discard(i)\r\n \r\nprint(ans)", "n, m = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\ns = 0\r\nfor i in range(m):\r\n x, y = map(int, input().split(' '))\r\n s += (min(a[x-1], a[y-1]))\r\nprint(s)", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nsumi =0\r\nfor i in range(m):\r\n\tu,v = map(int,input().split())\r\n\tsumi += min(a[u-1],a[v-1])\r\nprint(sumi)\r\n\r\n\r\n", "a,b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\nans = 0\r\nfor i in \" \"*b:\r\n p,q = map(int,input().split())\r\n ans+=min(s[p-1],s[q-1])\r\nprint(ans)", "n, m = map(int, input().split())\n\nl = list(map(int, input().split()))\n\nsuma = 0\nfor i in range(m):\n s, e = map(int, input().split())\n suma += min(l[s-1], l[e-1])\nprint(suma)", "from collections import defaultdict\r\ngraph = defaultdict(set)\r\nn,m = map(int,input().split())\r\ncost = list(map(int,input().split()))\r\n\r\nremove_cost = [0 for _ in range(n)]\r\nfor _ in range(m):\r\n u,v = map(int,input().split())\r\n u-=1\r\n v-=1\r\n graph[u].add(v)\r\n graph[v].add(u)\r\n remove_cost[u] += cost[v]\r\n remove_cost[v] += cost[u]\r\n\r\norder = sorted([(i,x) for i,x in enumerate(cost)],key = lambda x: x[1],reverse = True)\r\ncomponents = n\r\ntotal = 0\r\nremoved = set()\r\n\r\nfor i,x in order:\r\n r_cost = remove_cost[i]\r\n total += r_cost\r\n for connected in graph[i]:\r\n remove_cost[connected] -= cost[i]\r\nprint (total)", "\n\ndef solve():\n\tn,m = map(int,input().split())\n\tar = list(map(int,input().split()))\n\tarr = []\n\tfor i in range(n):\n\t\tarr.append((ar[i],i))\n\tarr.sort()\n\tadj = [[]for i in range(n)]\n\tfor i in range(m):\n\t\ta,b=map(int,input().split())\n\t\tadj[a-1].append(b-1)\n\t\tadj[b-1].append(a-1)\n\tvisited = [False]*n\n\tans = 0\n\tfor i in range(n-1,-1,-1):\n\t\tvisited[arr[i][1]] = True\n\t\tfor j in adj[arr[i][1]]:\n\t\t\tif not visited[j]:\n\t\t\t\tans+=ar[j]\n\tprint(ans)\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", "(n, m), f, s = list(map(int, input().split())), [int(x) for x in input().split()], 0\r\n\r\nfor i in range(m):\r\n (a, b) = list(map(int, input().split()))\r\n s = s + min(f[a - 1], f[b - 1])\r\n\r\nprint( s )", "n,m=map(int,input().split())\r\nve=list(map(int,input().split()))\r\nans=0\r\nfor i in range(m):\r\n\tc1,c2=map(int,input().split())\r\n\tans+=min(ve[c1-1],ve[c2-1])\r\nprint(ans)", "def byF(p):\r\n return p[0]\r\ndef byS(p):\r\n return p[1]\r\n\r\ndef getOrder(ls):\r\n pairs = [(i, ls[i]) for i in range(len(ls))]\r\n pairs.sort(key=byS)\r\n return list(map(byF, pairs))\r\n\r\nn, m = map(int, input().split())\r\nvs = list(map(int, input().split()))\r\nedges = [[] for x in range(n)]\r\ndelted = [False] * n\r\n\r\nfor _ in range(m):\r\n i, j = map(int, input().split())\r\n edges[i - 1].append(j - 1)\r\n edges[j - 1].append(i - 1)\r\n\r\norder = getOrder(vs)\r\norder = order[::-1]\r\nres = 0\r\n\r\nfor curr in order:\r\n for neigh in edges[curr]:\r\n #print(curr, neigh, delted[curr], delted[neigh], res)\r\n if not delted[neigh]:\r\n res += vs[neigh]\r\n delted[curr] = True\r\n\r\nprint(res)\r\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nc=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n c+=min(x[a-1],x[b-1])\r\nprint(c)", "\"\"\"\r\nCodeforces Round 250 Div 2 Problem C\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.3.4\r\n\"\"\"\r\n\r\nclass IOHandlerObject(object):\r\n def getInput(self, 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\n def writeOutput(self, s=\"\\n\"):\r\n if isinstance(s, list): s = \" \".join(s)\r\n print(s)\r\n\r\nIOHandler = IOHandlerObject()\r\ng = IOHandler.getInput\r\nw = IOHandler.writeOutput\r\n\r\n############################## SOLUTION ##############################\r\nn,m = g()\r\nv = g()\r\nsm = 0\r\nfor i in range(m):\r\n x,y = g()\r\n sm += min(v[x-1], v[y-1])\r\nprint(sm)", "import sys\r\nimport math\r\nfrom collections import deque, defaultdict\r\nimport bisect\r\nimport heapq\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef multiple():\r\n a = map(int, input().split())\r\n return a\r\n\r\n\r\ndef array():\r\n a = input().split()\r\n return a\r\n\r\n\r\ndef intarray():\r\n a = list(map(int, input().split()))\r\n return a\r\n\r\n\r\ndef solution():\r\n MOD = 1000000007\r\n n,m = multiple()\r\n v = intarray()\r\n d = defaultdict(set)\r\n for i in range(m):\r\n x,y = multiple()\r\n d[x].add(y)\r\n d[y].add(x)\r\n cost = defaultdict(int)\r\n for i in d:\r\n val = 0\r\n for c in d[i]:\r\n val += v[c-1]\r\n cost[i] = val\r\n order = []\r\n for i in range(n):\r\n order.append([v[i],i+1])\r\n order.sort(reverse=True)\r\n ans = 0\r\n for i in range(n):\r\n val, ind = order[i]\r\n for j in range(i+1,n):\r\n if order[j][1] in d[ind]:\r\n cost[order[j][1]] -= val\r\n ans += cost[ind]\r\n print(ans)\r\n return\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n # print(\"Case #%s:\" % str(_ + 1), end=' ')\r\n solution()\r\n", "n, m = map(int, input().split())\r\narr = [0] + list(map(int, input().split()))\r\nans = 0\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n ans += min(arr[u], arr[v])\r\nprint(ans)", "class graph(object):\r\n def __init__(self,n):\r\n self.nodes=[i+1 for i in range(n)]\r\n self.edges=[]\r\n def del_node(self,x):\r\n self.nodes.remove(x)\r\n def add_edge(self,x,y):\r\n self.edges.append(sorted([x,y]))\r\n def del_edge(self,x,y):\r\n if sorted([x,y]) in self.edges:\r\n self.edges.remove(sorted([x,y]))\r\n\r\nn,m=input().split()\r\nn,m=int(n),int(m)\r\nchildren=graph(n)\r\nv=[int(i) for i in input().split()]\r\nv={i+1:v[i] for i in range(len(v))}\r\n\r\nfor e in range(m):\r\n x,y=input().split()\r\n x,y=int(x),int(y)\r\n children.add_edge(x,y)\r\n\r\nenergy=0\r\nwhile v!={}:\r\n min_energy=min(v.values())\r\n todelete=[]\r\n for edge in children.edges:\r\n x=min(v[edge[0]],v[edge[1]])\r\n if x==min_energy:\r\n energy+=min_energy\r\n todelete.append([edge[0],edge[1]])\r\n for deledge in todelete:\r\n children.del_edge(deledge[0],deledge[1])\r\n v={x:v[x] for x in v if v[x]!=min_energy}\r\nprint(energy)", "n, m = map(int, input().split())\narr = list(map(int, input().split()))\nadj = list(tuple(map(int, input().split())) for _ in range(m))\nres = 0\nfor i, j in adj:\n res += min(arr[i-1], arr[j-1])\nprint(res)\n\n\t\t \t \t\t\t\t\t \t\t\t \t\t\t \t \t \t", "n,m = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(m):\r\n u,v = list(map(int,input().split()))\r\n ans+=min(arr[u-1],arr[v-1])\r\nprint(ans)", "n, m = map(int, input().split())\ngraph = [[] for _ in range(n+1)]\nused = [False]*(n+1)\nenergy = [0] + list(map(int, input().split()))\nsorted_energies = sorted(map(lambda x: (x[1], x[0]), enumerate(energy)), reverse=True)\nresult = 0\n\nfor _ in range(m):\n a, b = map(int, input().split())\n graph[a].append(b)\n graph[b].append(a)\n\nfor item in sorted_energies:\n if not used[item[1]]:\n used[item[1]] = True\n for adj in graph[item[1]]:\n if not used[adj]:\n result += energy[adj]\n\nprint(result)\n", "from sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\t\r\n# from bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\n\r\nn,m = mp()\r\nl = sorted(list(enumerate(mp(),1)) ,key = lambda x:x[1])\r\n# print(l)\r\nd = dd(list)\r\nvisited = set()\r\nfor _ in range(m):\r\n\ta,b = mp()\r\n\td[a].append(b)\r\n\td[b].append(a)\r\n\r\nans = 0\r\nfor i in range(n):\r\n\tfor j in d[l[i][0]]:\r\n\t\tif (j,l[i][0]) in visited or (l[i][0],j) in visited:\r\n\t\t\tpass\r\n\t\telse:\r\n\t\t\tans += l[i][1]\r\n\t\t\tvisited.add((j,l[i][0]))\r\n\t\t\tvisited.add((l[i][0],j))\r\nprint(ans)\r\n\r\n", "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\nn,m=invr()\r\nans=0\r\narr=inlt()\r\nfor i in range(m):\r\n a,b=invr()\r\n ans+=min(arr[b-1],arr[a-1])\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin, stdout, setrecursionlimit\r\nimport threading\r\n\r\n# tail-recursion optimization\r\n# In case of tail-recusion optimized code, have to use python compiler.\r\n# Otherwise, memory limit may exceed.\r\n# declare the class class Tail_Recursion_Optimization\r\nclass Tail_Recursion_Optimization:\r\n def __init__(self, recursion_limit, stack_size):\r\n setrecursionlimit(recursion_limit)\r\n threading.stack_size(stack_size)\r\n return None\r\n \r\nclass SOLVE:\r\n def solve(self):\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n \r\n n, m = [int(x) for x in R().split()]\r\n a = [0] + [int(x) for x in R().split()]\r\n min_energy = 0 \r\n for i in range(m):\r\n u, v = [int(x) for x in R().split()]\r\n min_energy += min(a[u], a[v])\r\n \r\n W('%d\\n' % min_energy)\r\n return 0\r\n \r\ndef main():\r\n s = SOLVE()\r\n s.solve()\r\n#Tail_Recursion_Optimization(10**7, 2**26)\r\nthreading.Thread(target=main).start()", "n, m = map(int, input().split())\r\np = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(0, m):\r\n a, b = map(int, input().split())\r\n ans += min(p[a - 1], p[b - 1])\r\nprint(ans)", "\r\nenergy = 0\r\nn, m = [int(x) for x in input().split()]\r\nprices = [None] + [int(x) for x in input().split()]\r\n\r\nfor _ in range(m):\r\n a, b = [int(x) for x in input().split()]\r\n energy += min(prices[a], prices[b])\r\n\r\nprint(energy)", "\r\ndef main():\r\n n, m = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n\r\n parts = dict()\r\n\r\n for i in range(m):\r\n a, b = map(int, input().split())\r\n if a in parts:\r\n parts[a].append(b)\r\n else:\r\n parts[a] = [b]\r\n\r\n total = 0\r\n\r\n for k, v in parts.items():\r\n for j in v:\r\n total += min(arr[k - 1], arr[j - 1])\r\n\r\n print(total)\r\n\r\nmain()", "from sys import stdin, stdout\r\n\r\nn, m = map(int, stdin.readline().split())\r\ngraph = [[] for _ in range(n + 1)]\r\nused = [False] * (n + 1)\r\nenergy = [0] + list(map(int, stdin.readline().split()))\r\nsorted_energies = sorted(map(lambda x: (x[1], x[0]), enumerate(energy)), reverse=True)\r\nresult = 0\r\n\r\nfor _ in range(m):\r\n a, b = map(int, stdin.readline().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nfor item in sorted_energies:\r\n if not used[item[1]]:\r\n used[item[1]] = True\r\n for adj in graph[item[1]]:\r\n if not used[adj]:\r\n result += energy[adj]\r\n\r\nstdout.write(str(result) + \"\\n\")", "n, m = map(int, input().split())\r\nv = list(map(int, input().split()))\r\ns = 0 \r\nfor i in range(m):\r\n a, b = map(int, input().split()) \r\n s += min(v[a - 1], v[b - 1])\r\nprint(s)", "import collections\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(n):\r\n arr.append((a[i],i+1))\r\narr.sort(reverse=True)\r\nd=collections.defaultdict(list)\r\nfor q in range(m):\r\n u,v=map(int,input().split())\r\n if a[v-1]>a[u-1]:\r\n d[v].append(u)\r\n else:\r\n d[u].append(v) \r\n\r\nans=0\r\nfor val,idx in arr:\r\n for v in d[idx]:\r\n ans+=a[v-1]\r\nprint(ans)", "n, m = map(int, input().split())\ntablica = list(map(int, input().split()))\nwynik = 0\nfor i in range(m):\n a, b = map(int, input().split())\n wynik += min(tablica[a-1], tablica[b-1])\nprint(wynik)", "#! /usr/bin/env python\n\nn, m = [int(x) for x in input().split()]\nv = [int(x) for x in input().split()]\nsv = [(x + 1, v[x]) for x in range(n)]\nv = [0] + v\nedges = {i:set() for i in range(1, n+1)}\nfor i in range(m):\n f, t = [int(x) for x in input().split()]\n edges[f].add(t)\n edges[t].add(f)\n\nans = 0\nsv.sort(key=lambda x: -x[1])\nremoved = [False] * (n + 1)\nfor i, vi in sv:\n removed[i] = True\n for f in edges[i]:\n if not removed[f]:\n ans += v[f]\n\nprint(ans)\n", "a=list(map(int,input().strip(' ').split(' ')))\r\ns=list(map(int,input().strip(' ').split(' ')))\r\ns.insert(0,0)\r\nsum1=0\r\nfor i in range(a[1]):\r\n d=list(map(int,input().strip(' ').split(' ')))\r\n sum1+=min(s[d[0]],s[d[1]])\r\nprint(sum1)\r\n \r\n \r\n \r\n \r\n", "n, m = [int(x) for x in input().split()] \nv_tab = [int(x) for x in input().split()]\nresult = 0\nfor i in range(m):\n fst, snd = [int(x) for x in input().split()]\n if v_tab[fst - 1] < v_tab[snd - 1]:\n result += v_tab[fst - 1]\n else:\n result += v_tab[snd - 1]\n\nprint(result)\n", "# 437C\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_int_ary():\r\n return map(int, input().split())\r\n\r\n\r\nn, m = read_int_ary()\r\nv = [None] + list(read_int_ary())\r\ncost = 0\r\nfor _ in range(m):\r\n a, b = read_int_ary()\r\n cost += min(v[a], v[b])\r\n\r\nprint(cost)", "INF = 10 ** 10\r\n\r\nn, m = map(int, input().split())\r\nw = list([0, a] for a in map(int, input().split()))\r\nsumm = 0\r\nadj = [[0] * n for _ in range(n)]\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n adj[x - 1][y - 1] = adj[y - 1][x - 1] = 1\r\n w[x - 1][0] += w[y - 1][1]\r\n w[y - 1][0] += w[x - 1][1]\r\n\r\nfor i in range(n - 1):\r\n k = w.index(max(w, key=lambda x: (x[1], -x[0])))\r\n summ += w[k][0]\r\n\r\n for j in range(n):\r\n if adj[j][k] == 1:\r\n adj[j][k] = adj[k][j] = 0\r\n w[j][0] -= w[k][1]\r\n\r\n w[k][0] = INF\r\n w[k][1] = 0\r\n\r\nprint(summ)\r\n", "n,m = map(int, input().strip().split())\nenergy = list(map(int, input().strip().split()))\nans = 0\nwhile(m):\n i,j = map(int, input().strip().split())\n ans+=min(energy[i-1], energy[j-1])\n m-=1\n\nprint(ans)\n", "n, m = map(int, input().split())\r\ng = [[0] * n for i in range(n)]\r\nv = list(map(int, input().split()))\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 g[x][y] = v[y]\r\n g[y][x] = v[x]\r\n\r\nkek = sorted((i for i in range(n)), key=lambda x: v[x], reverse=True)\r\nans = 0\r\nfor i in kek:\r\n ans += sum(g[i])\r\n for j in range(n):\r\n if j != i:\r\n g[j][i] = 0\r\nprint(ans)", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nedges = []\r\nfor i in range(m):\r\n edge= list(map(int, input().split()))\r\n edges.append(edge)\r\nans = 0\r\nfor edge in edges:\r\n ans += min(a[edge[0]-1], a[edge[1]-1])\r\nprint(ans)\r\n", "# from math import *\r\n# from itertools import combinations\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nIN = lambda: map(int, input().split())\r\n\r\nn, m = IN()\r\na = [0, *IN()]\r\nsum = 0\r\nfor i in range(m):\r\n x, y = IN()\r\n sum += min(a[x], a[y])\r\nprint(sum)", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nn, m = list(map(int, input().split()))\r\nv = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor _ in range(m):\r\n a, b = list(map(int, input().split()))\r\n ans += min(v[a-1], v[b-1])\r\nprint(ans)", "n,m = map(int, input().split(' '))\r\nV = list(map(int, input().split(' ')))\r\nedge = [set() for i in range(n)]\r\nfor i in range(m) :\r\n a,b = map(int, input().split(' '))\r\n a-=1;b-=1\r\n edge[a].add(b)\r\n edge[b].add(a)\r\nL = [[V[i], i]for i in range(n)]\r\nL.sort(key = lambda x:x[0])\r\nans = 0\r\nfor l in L :\r\n ans += l[0]*len(edge[l[1]])\r\n for i in edge[l[1]] :\r\n edge[i].remove(l[1])\r\n edge[l[1]].clear()\r\nprint(ans)\r\n", "'''\r\nCreated on ٠١‏/٠١‏/٢٠١٥\r\n\r\n@author: mohamed265\r\n'''\r\nt = input().split()\r\nn = int(t[0])\r\nm = int(t[1])\r\nslon = 0\r\nnum = [int(x) for x in input().split()]\r\nfor i in range(m):\r\n t = input().split()\r\n slon += min(num[int(t[0])-1] , num[int(t[1])-1])\r\nprint(slon)", "# https://codeforces.com/problemset/problem/437/C\n\ndef R(): return map(int, input().split())\n\n\nn, m = R()\narr = list(R())\nprint(sum(min(arr[j - 1]for j in R())for i in range(m)))\n# temp = []\n# for i in range(m):\n# temp = min(arr[j - 1] for j in R())\n", "from collections import defaultdict \r\nd=defaultdict(int)\r\nn,m=map(int,input().split())\r\nv=[int(i) for i in input().split()]\r\nsm=0\r\ngr=[[v[i],i] for i in range(n)]\r\ngr.sort(reverse=True) \r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n x-=1 \r\n y-=1\r\n sm+=min(v[x],v[y])\r\n if x<=y:\r\n d[y]+=v[x]\r\n else:\r\n d[x]+=v[y]\r\nsm1 = 0 \r\nfor i in range(n):\r\n sm1+=d[gr[i][1]]\r\nprint(sm)", "n, m = [int(i) for i in input().split()]\r\nenergy = [int(i) for i in input().split()]\r\nresult = 0\r\nfor i in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n result += min(energy[x - 1], energy[y - 1])\r\n \r\nprint(result)\r\n", "n, m = map(int,input().split())\n\ne = list(map(int, input().split()))\n\nres = 0\n\nfor _ in range(m):\n u,v = map(int, input().split())\n\n res+= min(e[u-1], e[v-1])\n\n\nprint(res)", "def spliter():\r\n d = input()\r\n a = d.split()\r\n r = []\r\n for i in a:\r\n k = int(i)\r\n r.append(k)\r\n return r\r\n\r\n\r\nn = spliter()\r\nmincont=spliter()\r\nmin=0\r\nfor i in range(n[1]):\r\n ropes=spliter()\r\n if mincont[ropes[0]-1]<mincont[ropes[1]-1]:\r\n min+=mincont[ropes[0]-1]\r\n else:\r\n min+=mincont[ropes[1]-1]\r\n ropes.clear()\r\nprint(min)", "n,m=map(int,input().split())\r\narr=[int(i) for i in input().split()]\r\narr.insert(0,0)\r\ngraph=[[] for i in range(n+1)]\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\nenergy=[]\r\na=1\r\nfor i in arr[1:]:\r\n energy.append([i,a])\r\n a+=1\r\nenergy.sort(reverse=True)\r\nans=0\r\nfor i in energy:\r\n tgraph=graph[i[1]][:]\r\n for j in tgraph:\r\n ans+=min(i[0],arr[j])\r\n graph[i[1]].remove(j)\r\n graph[j].remove(i[1])\r\nprint(ans)\r\n", "n, m = [int(x) for x in input().split()]\r\nenergy = list(map(int, input().split()))\r\nrope = []\r\nfor i in range(m):\r\n l = list(map(int, input().split()))\r\n rope.append(l)\r\ndic = {}\r\nfor i in range(n):\r\n dic[i + 1] = 0\r\nfor i in range(n):\r\n dic[i + 1] = energy[i]\r\nfor i in range(m):\r\n a = dic[rope[i][0]]\r\n b = dic[rope[i][1]]\r\n rope[i] = min(a, b)\r\nprint(sum(rope))\r\n\r\n", "n,m=[int(i) for i in input().split()]\n\narr=[int(i) for i in input().split()]\n\ntotal=0\n\nfor i in range(m):\n\ta,b=[int(i) for i in input().split()]\n\ttotal+=min(arr[a-1],arr[b-1])\n\t\nprint(total)", "n, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ns = 0\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n s += min(lst[x - 1], lst[y - 1])\r\n\r\nprint(s)", "def solve():\r\n numVertices, numEdges = map(int, input().split())\r\n energyCost = [0] + list(map(int, input().split()))\r\n totalCost = sum(min(map(energyCost.__getitem__, map(int, input().split()))) for edge in range(numEdges))\r\n print(totalCost)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n,m=list(map(int,input().split()))\nv=list(map(int,input().split()))\nsoma=0\nfor i in range(m):\n x,y=list(map(int,input().split()))\n soma+=min(v[x-1],v[y-1])\nprint(soma)\n\n \t\t\t \t\t \t \t\t \t\t\t\t \t \t \t\t", "def solve(n,m,energy,link) :\r\n total = 0\r\n for x,y in link :\r\n total += min(energy[x-1],energy[y-1])\r\n return total\r\n \r\nn,m = list(map(int,input().split()))\r\nener = list(map(int,input().split()))\r\nmat = []\r\nfor _ in range(m) :\r\n mat.append(list(map(int,input().split())))\r\n\r\nprint (solve(n,m,ener,mat))\r\n ", "from collections import deque\nn, m = map(int, input().split())\noriginal_nodes = input().split()\nnodes = [(int(index), int(value),) for index, value in enumerate(original_nodes, start=0)]\nedges = []\n\n[edges.append([]) for x in range(n)]\nfor something in range(m):\n v1,v2 = map(int, input().split())\n edges[v1-1].append(v2-1)\n edges[v2-1].append(v1-1)\nnodes.sort(key = lambda x : x[1], reverse=True)\nenergy = 0\nnodes = deque(nodes)\nfor x in range(n):\n node = nodes.popleft()\n # print(node, edges[node[0]])\n for adj_node in edges[node[0]]:\n energy += int(original_nodes[adj_node])\n edges[adj_node].remove(node[0])\n edges[node[0]] = []\nprint(energy)\n", "import math\r\n\r\nn,m=map(int,input().split())\r\nv=list(map(int,input().split()))\r\n\r\nres=0\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n x-=1;y-=1\r\n res+=min(v[x],v[y])\r\n \r\nprint(res)", "n,m= map(int,input().split())\r\n*a, = map(int,input().split())\r\nsum=0\r\nfor _ in range(m):\r\n u,v= map(int,input().split())\r\n sum=sum+min(a[u-1],a[v-1])\r\nprint(sum)", "n,m = map(int,input().split(' '))\nv = list(map(int,input().split(' ')))\n\nvd = {}\nfor i,x in enumerate(v):\n vd[i] = x\n\ng = [[] for i in range(n)]\n\nfor i in range(m):\n x,y = map(int,input().split(' '))\n x -= 1\n y -= 1\n g[x].append(y)\n g[y].append(x)\n\nv = [[-x, i] for i,x in enumerate(v)]\nv.sort()\n\nans = 0\nremoved = [0] * n\nfor i in range(n):\n x = v[i][1]\n removed[x] = 1\n for y in g[x]:\n if not removed[y]:\n ans += vd[y]\nprint(ans)\n\n", "n,m=map(int,input().split())\narr=input(\"\")\na=[0]+[int(i) for i in arr.split()]\nans=0\nfor i in range(1,m+1):\n\tx,y=map(int,input().split())\n\tans=ans+min(a[x],a[y])\nprint(ans)", "n,m=input().split()\r\nn,m=int(n),int(m)\r\n\r\nv=[int(x) for x in input().split()]\r\n\r\ntot=0\r\n\r\nfor i in range(m):\r\n x,y=input().split()\r\n x,y=int(x),int(y)\r\n \r\n tot+=min(v[x-1],v[y-1])\r\n\r\nprint(tot)", "n, m = [int(i) for i in input().split()]\nv = [int(i) for i in input().split()]\nsum = 0\nfor i in range(m):\n x,y = [int(i) for i in input().split()]\n sum+=min(v[x-1], v[y-1])\nprint(sum)\n \t \t \t\t \t\t\t \t\t\t \t \t \t \t", "from collections import defaultdict\r\n\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\ngraph = defaultdict(list)\r\nvisited = [0]*(n+1)\r\n\r\nfor _ in range(m):\r\n u,v = map(int,input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n \r\ndata = dict.fromkeys(range(1,n+1),0)\r\nfor i in range(n+1):\r\n data[i] = a[i-1]\r\n \r\nans=0\r\n\r\nres = sorted(data, key = data.get, reverse=True)\r\n#print(res)\r\n\r\nfor i in res:\r\n visited[i]=1\r\n \r\n for j in graph[i]:\r\n if visited[j]==0:\r\n ans += a[j-1]\r\n \r\nprint(ans)", "'''\r\nFuad Ashraful Mehmet\r\nUniversity of Asia Pacific,Bangladesh\r\nDate: 10th April 2020\r\n'''\r\nn,m=map(int,input().split())\r\nf=[int(x) for x in input().split()]\r\nans=0\r\nfor _ in range(m):\r\n\ta,b=map(int,input().split())\r\n\tans+=min(f[a-1],f[b-1])\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nh=[[] for j in range(n+1)]\r\nfor j in range(m):\r\n x,y=map(int,input().split())\r\n h[x].append(y)\r\n h[y].append(x)\r\nh1=[0 for i in range(n+1)]\r\narr1=sorted([(arr[i],i+1) for i in range(n)])\r\nfor j1 in range(n):\r\n for j in h[arr1[j1][1]]:\r\n h1[j]+=arr1[j1][0]\r\n h[j].remove(arr1[j1][1])\r\nprint(sum(h1))\r\n\r\n", "n, m = map(int, input().split())\r\nenergies = list(map(int, input().split()))\r\n\r\n# Create an adjacency list to represent the toy's structure\r\ngraph = [[] for _ in range(n)]\r\n\r\nans = 0\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n ans += min(energies[x-1],energies[y-1])\r\nprint(ans)\r\n \r\n", "n,m = map(int, input().split())\r\nv = [0] + list(map(int, input().split()))\r\n\r\nans = 0\r\nfor _ in range(m):\r\n i,j = map(int, input().split())\r\n ans += min(v[i], v[j])\r\n\r\nprint(ans)", "(n, m) = list(map(int, input().split(' ')))\nv = list(map(int, input().split(' ')))\nr = 0\n\nfor mm in range(m):\n (x, y) = list(map(int, input().split(' ')))\n x -= 1\n y -= 1\n\n if(v[x] > v[y]):\n r += v[y]\n else:\n r += v[x]\n\nprint(r)\n\n\n \t \t\t \t \t \t\t \t\t\t", "n, m = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n u,v = map(int, input().split())\r\n ans += min(s[u-1],s[v-1])\r\nprint(ans)", "def f(x):\r\n x = int(x)\r\n return w[x-1]\r\n\r\nn, m = list(map(int, input().split()))\r\nw = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(m):\r\n ans += min(list(map(f, input().split())))\r\nprint(ans)\r\n", "n, m = map(int, input().split(' '))\npesos = list(map(int, input().split(' ')))\n\ndeletados = []\ngrafo = []\nsoma = 0\n\nfor i in range(m):\n x, y = map(int, input().split(' '))\n a = [x,y,pesos[y-1]]\n b = [y,x,pesos[x-1]]\n \n grafo.append(a)\n grafo.append(b)\n\n soma += min(pesos[x-1], pesos[y-1])\nprint(soma)\n \n\n\n \t\t\t\t\t\t \t \t\t\t\t\t\t\t\t\t\t \t \t\t", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\nI = lambda : int(sys.stdin.buffer.readline())\r\nNeo = lambda : list(map(int, sys.stdin.buffer.readline().split()))\r\nn,m = Neo()\r\nA = Neo()\r\nAns = 0\r\nfor i in range(m):\r\n x,y = Neo()\r\n Ans += min(A[x-1],A[y-1])\r\nprint(Ans) \r\n", "n , m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nd = []\r\nd2 = []\r\nfor i in range(m):\r\n x , y = map(int,input().split())\r\n d.append(min(arr[x -1] , arr[y - 1]))\r\n\r\nprint(sum(d))\r\n\r\n\r\n", "n,m = [int(i) for i in input().split()]\r\nx = input().split()\r\npopa = [[int(x[i]),i] for i in range(n)]\r\n\r\ngraph = [[] for i in range(n+1)]\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n\r\npopa = sorted(popa)[::-1]\r\n\r\ndic = {i[1]+1:i[0] for i in popa}\r\nsuma = 0\r\nd = []\r\nfor x in popa:\r\n v = x[1]+1\r\n for i in graph[v]:\r\n if i not in d:\r\n suma+=dic[i]\r\n d.append(v)\r\nprint(suma)", "n, m = [int(i) for i in input().split()]\r\narr = [int(i) for i in input().split()]\r\nans = 0\r\nfor _ in range(m):\r\n i1, i2 = [int(i) for i in input().split()]\r\n ans += min(arr[i1-1], arr[i2-1])\r\nprint(ans)", "n,m=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(m):\r\n x,y=list(map(int,input().split()))\r\n #print(min(l[x-1],l[y-1]))\r\n c+=min(l[x-1],l[y-1])\r\nprint(c)", "\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\n\r\nt= list(map(int,input().split()))\r\n\r\n\r\nadj=[[] for i in range(n+1)]\r\n\r\n\r\nfor j in range(m):\r\n a,b = map(int,input().split())\r\n\r\n\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\n\r\nans=0\r\n\r\nu=[]\r\nfor j in range(n+1):\r\n for k in adj[j]:\r\n\r\n if k>j:\r\n ans+= min(t[k-1], t[j-1])\r\n\r\nprint(ans)\r\n\r\n \r\n", "def main():\r\n n,m = map(int,input().split())\r\n l = [int(i) for i in input().split()]\r\n ans = 0\r\n for i in range(m):\r\n a,b = map(int,input().split())\r\n ans += min(l[a-1],l[b-1])\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "#!/usr/bin/env python3\n\ndef main():\n n, m = map(int, input().split())\n v, g = list(map(int, input().split())), [0] * n\n graph, visited = [[] for i in range(n)], [0] * n\n stack = []\n\n for i in range(m):\n s, t = map(lambda x: int(x)-1, input().split())\n graph[s].append(t)\n graph[t].append(s)\n g[s] += 1\n g[t] += 1\n\n def process(u):\n if not g[u]:\n return 0\n \n ans = g[u]*v[u]\n \n for t in graph[u]:\n g[t] -= 1\n g[u] -= 1\n \n return ans\n\n def dfs(u):\n visited[u] = 1\n for v in graph[u]:\n if not visited[v]:\n dfs(v)\n stack.append(u)\n \n ans = 0\n for i in range(n):\n if not visited[i]:\n dfs(i)\n ans += sum(map(process, sorted(stack, key=lambda x: v[x])))\n stack.clear()\n\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n\n", "import sys\r\n\r\ndef answer(n, m, v, x, y):\r\n total = 0\r\n for i in range(m):\r\n total += min(v[x[i]], v[y[i]])\r\n return total\r\ndef main():\r\n n, m = map(int, sys.stdin.readline().split())\r\n v = [0]\r\n v.extend(list(map(int, sys.stdin.readline().split())))\r\n x = [0 for _ in range(m)]\r\n y = [0 for _ in range(m)]\r\n for i in range(m):\r\n x[i], y[i] = map(int, sys.stdin.readline().split())\r\n print(answer(n, m, v, x, y))\r\n return\r\nmain()", "def mlt(): return map(int, input().split())\r\n\r\n\r\nx, y = mlt()\r\n\r\ns = [0] + list(mlt())\r\n\r\nres = 0\r\n\r\nfor n in range(y):\r\n a, b = mlt()\r\n res += min(s[a], s[b])\r\nprint(res)\r\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncost = 0\r\nfor i in range(m):\r\n x,y =map(int,input().split())\r\n cost+=min(a[x-1],a[y-1])\r\nprint(cost)\r\n \r\n", "n,m=map(int,input().split())\r\nv=list(map(int,input().split()))\r\ngraph=[[] for _ in range(n)]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n graph[x-1].append(y-1)\r\n graph[y-1].append(x-1)\r\nvis=[[0]*n for _ in range(n)]\r\ndv=[[x,i] for i,x in enumerate(v)]\r\ndv.sort(reverse=True)\r\nans=0\r\nfor c,node in dv:\r\n for adj in graph[node]:\r\n if vis[node][adj]==0:\r\n ans+=v[adj]\r\n vis[node][adj]=1\r\n vis[adj][node]=1\r\nprint(ans)\r\n", "l2=input().split()\r\nn=int(l2[0])\r\nm=int(l2[1])\r\nl=[int(y) for y in input().split()]\r\nsum=0\r\nfor i in range(m):\r\n l1=[int(x) for x in input().split()]\r\n sum = sum + min(l[l1[0]-1],l[l1[1]-1])\r\nprint(sum)", "import math\r\n\r\ninputs = [int(x) for x in input().split()]\r\nn = inputs[0]\r\nm = inputs[1]\r\n\r\n#Adding a blank just to pad array\r\npart_energy=[''] + [int(x) for x in input().split()]\r\n\r\ngrid = {i:{'id':i, 'energy_to_remove': 0,'connected_nodes': set(), 'energy_itself':part_energy[i]} for i in range(1, n+1)}\r\n\r\nfor i in range(m):\r\n inputs = [int(x) for x in input().split()]\r\n grid[inputs[0]]['energy_to_remove'] += part_energy[inputs[1]]\r\n grid[inputs[1]]['energy_to_remove'] += part_energy[inputs[0]]\r\n \r\n grid[inputs[0]]['connected_nodes'].add(inputs[1])\r\n grid[inputs[1]]['connected_nodes'].add(inputs[0])\r\n \r\nenergy_used = 0\r\n\r\nwhile grid:\r\n# print(grid)\r\n# min_item = min(grid.items(), key=lambda item : item[1]['energy_to_remove'] + (1 - (item[1]['energy_itself']/math.pow(10, math.floor(math.log10(item[1]['energy_itself'])) + 1))) )[1]\r\n min_item = min(grid.items(), key=lambda item : -item[1]['energy_itself'])[1]\r\n# print('removing ' + str(min_item['id']))\r\n energy_used += min_item['energy_to_remove']\r\n for connected_item in min_item['connected_nodes']:\r\n grid[connected_item]['energy_to_remove'] -= min_item['energy_itself']\r\n grid[connected_item]['connected_nodes'].remove(min_item['id'])\r\n \r\n del grid[min_item['id']]\r\n \r\nprint(energy_used)\r\n\r\n# grid[k]['energy_to_remove'] + grid[k]['energy_itself']/math.pow(10, math.floor(math.log10(grid[k]['energy_itself'])) + 1)", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn, m = map(int, input().split())\r\nv = list(map(int, input().split()))\r\nans = 0\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n ans += min(v[x-1], v[y-1])\r\nprint(ans)\r\n", "from sys import stdin,stdout\n# stdin = open(\"/Users/seeva92/Workspace/Contests/1.txt\",\"r\")\n# stdout = open(\"/Users/seeva92/Workspace/Contests/2.txt\",\"w\")\nn,m = map(int,stdin.readline().split())\nv = list(map(int,stdin.readline().split()))\ng = [list() for i in range(n)]\nfor i in range(m):\n\tx,y = map(int,stdin.readline().split())\n\tg[x-1].append(y-1)\n\tg[y-1].append(x-1)\ndef main():\n\tres = 0\n\tvis = [False for i in range(n)]\n\tq = []; q.append(0); vis[0] = True\n\tmp = dict()\n\tfor i,_ in enumerate(g):\n\t\tfor j in g[i]:\n\t\t\tif mp.get((i,j),0) == 0 and mp.get((j,i),0)==0:\t\t\t\n\t\t\t\tres += min(v[i],v[j])\n\t\t\t\tmp[(i,j)] = 1; mp[(j,i)] = 1\t\t\t\n\tstdout.write(str(res))\n\t# stdout.write(\"wow\")\nmain()", "import logging\r\nimport copy\r\nimport sys\r\nimport math\r\n\r\nlogging.basicConfig(stream=sys.stderr, level=logging.DEBUG)\r\n\r\n# def solve(firstLine):\r\n\r\n\r\ndef solve(energy, lines):\r\n total = 0\r\n\r\n lMap = []\r\n for l in range(len(energy)):\r\n lMap.append([])\r\n\r\n for l in lines:\r\n s, e = l[0] - 1, l[1] - 1\r\n\r\n if energy[e] < energy[s]:\r\n s,e = e,s\r\n \r\n lMap[s].append(e)\r\n\r\n eList = []\r\n for i, e in enumerate(energy):\r\n eList.append([i, e])\r\n \r\n eList.sort(key=lambda x: x[1])\r\n\r\n total = 0\r\n for en in eList:\r\n i,e = en[0], en[1]\r\n total += e * len(lMap[i])\r\n \r\n\r\n return total\r\n \r\n\r\n\r\ndef main():\r\n firstLine = input().split()\r\n firstLine = list(map(int, firstLine))\r\n\r\n energy = input().split()\r\n energy = list(map(int, energy))\r\n\r\n lines = []\r\n for i in range(firstLine[1]):\r\n line = input().split()\r\n line = list(map(int, line))\r\n lines.append(line)\r\n \r\n\r\n print(solve(energy, lines))\r\n\r\n\r\ndef log(*message):\r\n logging.debug(message)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m = map(int,input().split())\r\nw = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(m):\r\n u,v = map(int,input().split())\r\n ans += min(w[u-1],w[v-1])\r\nprint(ans)", "n, m = map(int, input().split())\r\nvalues = [-10000] + list(map(int, input().split()))\r\ng = [[] for i in range(n+10)]\r\ncosts = [0] * (n+10)\r\nfor i in range(m):\r\n\tu, v = map(int, input().split())\r\n\tg[u] += [v]\r\n\tg[v] += [u]\r\n\r\n\r\nfor i in range(1, n+1):\r\n\tfor neighbor in g[i]:\r\n\t\tcosts[i] += values[neighbor]\r\n\r\nfor i in range(0, n+1):\r\n\tvalues[i] = (values[i], i)\r\n\r\nvalues = sorted(values, reverse=True)\r\n\r\ntotal = 0\r\nfor i in range(0, n):\r\n\tnode = values[i][1]\r\n\tcost = values[i][0]\r\n\ttotal += costs[node]\r\n\tfor neighbor in g[node]:\r\n\t\tcosts[neighbor] -= cost\r\n\r\nprint(total)\r\n", "n,m = map(int,input().split(' '))\r\nar = list(map(int, input().split(' ')))\r\nmx = 0\r\nfor i in range(m):\r\n x, y = map(int, input().split(' '))\r\n mx = mx+min(ar[x-1], ar[y-1])\r\nprint(mx)", "n,m = [int(x) for x in input().strip().split()]\r\nenergy = [int(x) for x in input().strip().split()]\r\nd = {i:[] for i in range(1,n+1)}\r\nfor i in range(m):\r\n\tk,l=[int(x) for x in input().strip().split()]\r\n\td[k].append(l)\r\n\td[l].append(k)\r\n\r\ns_energy = sorted(list(zip(list(range(1,n+1)),energy)),key = lambda x:-x[1])\r\ncost = 0\r\nvisited = [False]*n\r\nfor part,val in s_energy:\r\n\tvisited[part-1]=True\r\n\tfor i in d[part]:\r\n\t\tif not visited[i-1]:\r\n\t\t\tcost+=energy[i-1]\r\nprint(cost)", "R = lambda:map(int, input().split())\r\nn, m = R()\r\nv = list(R())\r\ng = [set() for i in range(n + 1)]\r\nfor i in range(m):\r\n x, y = R()\r\n g[x].add(y)\r\n g[y].add(x)\r\ns = 0\r\nfor w, i in sorted(zip(v, range(1, n + 1)), reverse=True):\r\n for j in g[i]:\r\n s += v[j - 1]\r\n g[j].remove(i)\r\nprint(s)", "n,m = map(int,input().split(' '))\r\na = list(map(int,input().split(' ')))\r\nprint(sum(min(a[x-1],a[y-1]) for x,y in (map(int,input().split(' ')) for i in range(m))))", "n, m = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n ans += min(a[u - 1], a[v - 1])\r\n\r\nprint(ans)", "def main():\r\n n, m = list(map(int, input().split()))\r\n v = list(map(int, input().split()))\r\n g = {i:[] for i in range(n)}\r\n for i in range(m):\r\n x, y = list(map(int, input().split()))\r\n g[x-1].append(y-1)\r\n g[y-1].append(x-1)\r\n used = [0] * n\r\n v_s = [[v[i], i] for i in range(n)]\r\n v_s.sort(reverse=True)\r\n\r\n ans = 0\r\n for i in range(n):\r\n used[v_s[i][1]] = 1\r\n for j in g[v_s[i][1]]:\r\n if not used[j]:\r\n ans+= v[j]\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "edges = [int(x) for x in input().split(' ')][1]\r\narr = [int(x) for x in input().split(' ')]\r\nenergy = 0\r\nfor i in range(edges):\r\n t = [int(x) for x in input().split(' ')]\r\n energy += min(arr[t[0]-1], arr[t[1]-1])\r\nprint(energy)\r\n \r\n", "n, m = map(int, input().split())\r\nf = list(map(int,input().split()))\r\nans = 0\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n ans += min(f[a - 1], f[b - 1])\r\n\r\nprint(ans)\r\n", "nm = list(map(int, input().split(\" \")))\nw = list(map(int, input().split(\" \")))\nans = 0\nfor x in range(nm[1]):\n d = list(map(int, input().split(\" \")))\n ans += min(w[d[0]-1], w[d[1]-1])\nprint(ans)\n", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nstore = set()\r\nb = list(range(1,n+1))\r\n\r\nd = {}\r\nfor i in b:\r\n d[i] = [] \r\n \r\nfor _ in range(m):\r\n x,y = map(int,input().split())\r\n store.add((x,y))\r\n store.add((y,x))\r\n d[x].append(y)\r\n d[y].append(x)\r\n \r\n \r\ncount = 0 \r\nz = sorted(zip(a,b))\r\n\r\nfor _,i in z:\r\n \r\n for j in d[i]:\r\n \r\n if (i,j) not in store:\r\n continue \r\n \r\n count+= a[i-1]\r\n store.remove((i,j))\r\n store.remove((j,i))\r\n if len(store)==0:\r\n break \r\n \r\nprint(count)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A, G):\r\n m = len(G)\r\n answer= 0\r\n for i in range(m):\r\n x, y = G[i]\r\n answer+=min(A[x-1], A[y-1])\r\n return answer\r\n\r\nn, m = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nG = []\r\nfor i in range(m):\r\n x, y = [int(x) for x in input().split()]\r\n G.append([x, y])\r\nprint(process(A, G))", "from hashlib import new\r\nfrom re import A\r\nimport sys\r\nimport threading\r\nfrom sys import stdin, stdout\r\nfrom itertools import accumulate\r\ninput = stdin.readline\r\nprint = stdout.write\r\nimport math\r\nfrom collections import Counter\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().strip().split())\r\n values = list(map(int, input().strip().split()))\r\n \r\n graph = {i:[] for i in range(1,n+1)}\r\n\r\n for i in range(m):\r\n u, v = map(int, input().strip().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n \r\n visited = set()\r\n dfs_stack = []\r\n cost = 0\r\n for vtx in range(1, n+1):\r\n \r\n if len(dfs_stack) == 0 and vtx not in visited:\r\n dfs_stack.append(vtx)\r\n visited.add(vtx)\r\n\r\n while len(dfs_stack) > 0:\r\n vertex = dfs_stack.pop()\r\n\r\n if len(graph[vertex]) == 0:\r\n continue\r\n \r\n visited.add(vertex)\r\n\r\n for child_vertex in graph[vertex]:\r\n \r\n cost += min(values[vertex - 1], values[child_vertex - 1])\r\n if child_vertex not in visited:\r\n dfs_stack.append(child_vertex)\r\n visited.add(child_vertex)\r\n\r\n print(f\"{cost//2}\\n\")", "n,m = input().split()\r\nv = list(map(int, input().split()))\r\nans = 0\r\nfor _ in range(int(m)):\r\n ans+=v[min(map(int, input().split()), key=lambda x:v[x-1])-1]\r\nprint(ans)", "# ===================================\n# (c) MidAndFeed aka ASilentVoice\n# ===================================\n# import math \n# import collections\n# import string\n# import re\n# from random import randint\n# from math import log\n# from math import sqrt\n# ===================================\nn, m = [int(x) for x in input().split()]\nq = [int(x) for x in input().split()]\nans = 0\nfor _ in range(m):\n x, y = [int(x) for x in input().split()]\n ans += min(q[x-1], q[y-1])\nprint(ans)\n \t \t \t \t \t\t \t \t\t \t\t\t", "n,m=map(int,input().split())\r\nans=0\r\nnum=list(map(int,input().split()))\r\nfor i in range(m):\r\n\tx,y=map(int,input().split())\r\n\tans+=min(num[x-1],num[y-1])\r\nprint(ans)", "\r\nn,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nma={};mb={}\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if a in ma:ma[a]+=[b]\r\n else:ma[a]=[b]\r\n if b in mb:mb[b]+=[a]\r\n else:mb[b]=[a]\r\nenergy=[]\r\n\r\nfor i in range(1,n+1):energy.append([arr[i-1],i])\r\nenergy.sort();ans=0\r\n# print(energy)\r\nwhile len(ma) and len(mb):\r\n x=energy.pop(0)\r\n rope,ene=x[1],x[0]\r\n try:\r\n li=ma[rope]\r\n del ma[rope]\r\n # print(li)\r\n for i in li:\r\n if i in mb:\r\n mb[i].remove(rope)\r\n ans+=ene\r\n if mb[i]==[]:\r\n del mb[i]\r\n # print(mb);break\r\n except:pass\r\n try:\r\n \r\n ki=mb[rope]\r\n del mb[rope]\r\n # print(ki)\r\n for i in ki:\r\n if i in ma:\r\n ma[i].remove(rope)\r\n ans+=ene\r\n if ma[i]==[]:del ma[i]\r\n except:pass\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\nans=0\r\nfor i in range(m):\r\n\ta,b=map(int,input().split())\r\n\tans+=min(l[a-1],l[b-1])\r\nprint(ans)", "n, m = map(int, input().split())\ncost = [0] + list(map(int, input().split()))\nres = 0\nfor i in range(m):\n x, y = map(int, input().split())\n res += min(cost[x], cost[y])\nprint(res)", "def main():\r\n from heapq import heapify, heappop\r\n \r\n n, m = [int(i) for i in input().split()]\r\n energy = [[int(v), i] for i, v in enumerate(input().split())]\r\n s_energy = sorted(energy)\r\n graph = [set() for i in range(n)]\r\n for i in range(m):\r\n x, y = [int(i) for i in input().split()]\r\n graph[x - 1].add(y - 1)\r\n graph[y - 1].add(x - 1)\r\n \r\n result = 0\r\n for i in range(n):\r\n e, x = s_energy.pop()\r\n for j in graph[x]:\r\n graph[j].remove(x)\r\n result += energy[j][0]\r\n \r\n print(result)\r\n \r\n\r\nmain()\r\n", "n, m =map(int, input().split())\n\n\n \nv = list(map(int, input().split()))\n\n\ns = 0\n\n\nfor _ in range(m):\n x, y = map(int, input().split())\n s += min(v[x-1], v[y-1])\n\n\nprint(s)", "from collections import Counter, defaultdict\r\n\r\n\r\ndef solve():\r\n n, m = list(map(int, input().split()))\r\n w = list(map(int, input().split()))\r\n ans = 0\r\n for i in range(m):\r\n ans += min(list(map(lambda x: w[int(x)-1], input().split())))\r\n return ans\r\n\r\n\r\nfor _ in range(1):\r\n print(solve())\r\n # solve()\r\n", "n, m = [int(_) for _ in input().split()]\r\na = [int(_) for _ in input().split()]\r\nans = 0\r\nfor i in range(m):\r\n x, y = [int(_) - 1 for _ in input().split()]\r\n ans += min(a[x], a[y])\r\nprint(ans)", "x,y=input().split()\r\na=list(map(int,input().split()));\r\nans=0;\r\nfor i in range(0,int(y)):\r\n v1,v2=input().split()\r\n ans+=min(a[int(v1)-1],a[int(v2)-1]);\r\nprint(ans); ", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n ans+=min(l[a-1],l[b-1])\r\nprint(ans)", "def Solve():\r\n n,m = map(int,input().split())\r\n cost = [int(x) for x in input().split()]\r\n c = 0\r\n for _ in range(m):\r\n x,y = map(int,input().split())\r\n c += min(cost[x-1],cost[y-1])\r\n print(c)\r\n\r\nif __name__ == '__main__':\r\n Solve()\r\n ", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ngraph=defaultdict(list)\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\np=[[i+1,l[i]] for i in range(len(l))]\r\np.sort(key=lambda x:x[1],reverse=True)\r\ntotal=0\r\nfor i in p:\r\n temp=[]\r\n for j in graph[i[0]]:\r\n total+=l[j-1]\r\n temp.append(j)\r\n for j in temp:\r\n graph[i[0]].remove(j)\r\n graph[j].remove(i[0])\r\nprint(total)\r\n", "#!/usr/bin/python3\n\"Codeforces Round #250 (Div. 2)\"\n\"C. The Child and Toy\"\nn,m=map(int,input().split())\na=list(map(int,input().split()))\nans=0\nfor i in range(m):\n z,x=map(int,input().split())\n ans+=min(a[z-1],a[x-1])\nprint(ans)", "line = input().split()\nn = int(line[0])\nm = int(line[1])\n\nline = input().split()\nweights = [0] * n\nedges = [0] * n\nfor i in range(n):\n weights[i] = [int(line[i]), i]\n edges[i] = []\n\nfor i in range(m):\n line = input().split()\n a = int(line[0]) - 1\n b = int(line[1]) - 1\n\n edges[a].append(b)\n edges[b].append(a)\n\nsortedWeights = sorted(weights, reverse = True)\n\nans = 0\nremoved = []\nfor element in sortedWeights:\n index = element[1]\n for neighboor in edges[index]:\n if neighboor not in removed:\n ans += weights[neighboor][0]\n removed.append(index)\n\nprint(ans)\n\n\t \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(\" \")]\r\n\r\nV = [int(i) for i in input().split(\" \")]\r\n\r\nanswer = 0\r\nfor m in range(M):\r\n\tx, y = [int(i) for i in input().split(\" \")]\r\n\tanswer += min(V[x-1], V[y-1])\r\n\t\r\nprint(answer)", "n, m = list(map(int, input().rstrip().split()))\nv = list(map(int, input().rstrip().split()))\nc = 0\nfor i in range(m):\n x, y = list(map(int, input().rstrip().split()))\n c += min(v[x - 1], v[y - 1])\nprint(c)", "from collections import Counter\r\nimport string\r\nimport bisect\r\n#import random\r\nimport math\r\nimport sys\r\n# sys.setrecursionlimit(10**6) \r\nfrom fractions import Fraction\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(arrber_of_variables):\r\n if arrber_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if arrber_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\ntestcases=1\r\nfor _ in range(testcases):\r\n n,k=vary(2)\r\n nt=[10]+array_int()\r\n pt=[[10**9,1]]\r\n for i in range(1,n+1):\r\n pt.append([nt[i],i])\r\n pt.sort(reverse=True)\r\n graph=[[] for i in range(n+1)]\r\n for _ in range(k):\r\n u,v=vary(2)\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n ans=0\r\n\r\n # visited=[0]*(n+1)\r\n if 1:\r\n # maxi=float('inf')\r\n for i in range(1,n+1):\r\n st=0\r\n # print(i)\r\n # node=i\r\n # print(graph[pt[i][1]],pt[i][1])\r\n for j in graph[pt[i][1]]:\r\n st+=nt[j]\r\n \r\n # print(maxi,node)\r\n # print(pt[i][1])\r\n for kt in graph[pt[i][1]]:\r\n try:\r\n graph[kt].remove(pt[i][1])\r\n # graph[pt[i][1]].remove(kt)\r\n except:\r\n pass\r\n # print(st)\r\n ans+=st\r\n print(ans)\r\n", "R = lambda:map(int, input().split())\r\n\r\nn, m = R()\r\n\r\nv = [0] + list(R())\r\n\r\nprint(sum(min(v[x], v[y]) for x, y in (R() for i in range(m))))\r\n\r\n\r\n\r\n# Made By Mostafa_Khaled", "\r\n\r\ndef main():\r\n n,m = map(int,input().split())\r\n cur = list(map(int,input().split()))\r\n tab = []\r\n graph = [[] for x in range(n)]\r\n\r\n for x in range(n):\r\n tab.append((cur[x],x))\r\n for x in range(m):\r\n a,b = map(int,input().split())\r\n a-=1\r\n b-=1\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n tab.sort()\r\n tab = tab[::-1]\r\n v = [0]*n\r\n s = 0\r\n for x in range(n):\r\n for nei in graph[tab[x][1]]:\r\n if not v[nei]:\r\n s += cur[nei]\r\n v[tab[x][1]] = 1\r\n print(s)\r\nmain()\r\n ", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import *\r\nimport operator\r\nsys.setrecursionlimit(99999)\r\n\r\nn, m = map(int, input().split())\r\narr = [0] + list(map(int, input().split()))\r\ng = [[0] * (n + 1) for _ in range(n + 1)]\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n g[u][v] = g[v][u] = 1\r\n\r\nans = 0\r\n\r\ngl = sorted(list(range(1, n + 1)), key=lambda x: arr[x], reverse=True)\r\n\r\nfor c in gl:\r\n for i in range(1, n + 1):\r\n if g[c][i]:\r\n ans += arr[i]\r\n g[c][i] = g[i][c] = 0\r\nprint(ans)\r\n", "n, m = map( int, input().split() )\r\nv = list( map( int, input().split() ) )\r\n\r\nans = 0\r\nfor i in range( m ):\r\n x, y = map( int, input().split() )\r\n ans += min( v[x - 1], v[y - 1] )\r\n \r\nprint( ans )", "n, m = map(int, input().split())\r\ncs = [0] + list(map(int, input().split()))\r\nmls = [0 for i in range(n+1)]\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n if cs[y] < cs[x]:\r\n x, y = y, x\r\n mls[x] += 1\r\nprint(sum([cs[i]*mls[i] for i in range(n+1)]))\r\n", "N, M=list(map(int, input().split(\" \")))\r\ncost=list(map(int, input().split(\" \")))\r\ncost.insert(0, -1)\r\nadjacency_list=[[] for i in range(N+1)]\r\nfor i in range(M):\r\n a, b=list(map(int, input().split(\" \")))\r\n adjacency_list[a].append(b)\r\n adjacency_list[b].append(a)\r\n\r\n# from most to least expensive\r\nnodes_by_cost=list(reversed(sorted([x+1 for x in range(N)], key= lambda y: cost[y])))\r\n\r\ntotal_cost=0\r\ndeleted=[False for x in range(N+1)]\r\nfor node in nodes_by_cost:\r\n \r\n cost_for_removing_node=0\r\n for neig in adjacency_list[node]:\r\n if not deleted[neig]:\r\n cost_for_removing_node+=cost[neig]\r\n\r\n deleted[node]=True\r\n total_cost+=cost_for_removing_node\r\n\r\nprint(total_cost)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nmapint = lambda x:int(x)-1\r\n\r\nn, m = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(m):\r\n a, b = map(mapint, input().split())\r\n c += min(w[a], w[b])\r\nprint(c)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ncosts = [[int(i)] for i in input().split()]\r\ncosts = [costs[j] + [j] for j in range(n)]\r\ncosts2 = {x: y for y, x in costs}\r\ncosts.sort(reverse = True)\r\nconnections = {i: [] for i in range(n)}\r\ntotal = 0\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n connections[a - 1].append(b - 1)\r\n connections[b - 1].append(a - 1)\r\nfor i in range(n):\r\n while connections[costs[i][1]]:\r\n current = connections[costs[i][1]].pop()\r\n connections[current].remove(costs[i][1])\r\n total += costs2[current]\r\nprint(total)\r\n", "from itertools import combinations\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef output_list(v):\r\n print(' '.join(str(x) for x in v))\r\n\r\ndef main():\r\n n, m = input_ints()\r\n v = input_ints()\r\n ans = 0\r\n for i in range(m):\r\n x, y = input_ints()\r\n ans += min(v[x - 1], v[y - 1])\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "nVertices, nEdges = map(int, input().split())\r\na = list(map(int, input().split()))\r\nret = 0\r\nfor _ in range(nEdges):\r\n u, v = map(lambda x: int(x) - 1, input().split())\r\n ret += min(a[u], a[v])\r\nprint(ret)", "n,m=map(int,input().split())\r\nv=list(map(int,input().split()))\r\n\r\ntot=0\r\n\r\nfor i in range(m):\r\n\tx,y = map(int,input().split())\r\n\tif(v[x-1]<=v[y-1]):\r\n\t\ttot+=v[x-1]\r\n\telse:\r\n\t\ttot+=v[y-1]\r\nprint(tot)", "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 The_Child_and_Toy2():\r\n def remove_node(node):\r\n\r\n visited[node] = True\r\n cost = 0 \r\n\r\n for neighbor in neighbors_dict[node]:\r\n if visited[neighbor] == False:\r\n cost += nodeCost_dict[neighbor]\r\n \r\n return cost\r\n\r\n\r\n n,m = invr()\r\n nodeCost = inlt()\r\n\r\n nodeCost_dict = {}\r\n\r\n for i,c in enumerate(nodeCost):\r\n nodeCost_dict[i+1] = c \r\n\r\n nodeList = [i for i in range(1,n+1)]\r\n\r\n sorted_data = sorted(zip(nodeCost,nodeList), reverse=True)\r\n nodeCost_sorted,nodeList_acc = zip(*(sorted_data))\r\n nodeCost_sorted = list(nodeCost_sorted)\r\n nodeList_acc = list(nodeList_acc)\r\n\r\n neighbors_dict = {}\r\n for i in range(1,n+1):\r\n neighbors_dict[i] = []\r\n \r\n for edge in range(m):\r\n node1,node2 = invr()\r\n neighbors_dict[node1].append(node2)\r\n neighbors_dict[node2].append(node1)\r\n \r\n visited = [False]*(n+1)\r\n\r\n total_cost = 0\r\n\r\n for node in nodeList_acc:\r\n cost = remove_node(node)\r\n total_cost += cost \r\n \r\n print(total_cost)\r\n return \r\n\r\nThe_Child_and_Toy2()", "from collections import *\r\nfrom sys import stdin\r\n\r\n\r\ndef arr_enu():\r\n return [[i + 1, int(x)] for i, x in enumerate(stdin.readline().split())]\r\n\r\n\r\ndef arr_inp(n):\r\n if n == 1:\r\n return [int(x) for x in stdin.readline().split()]\r\n elif n == 2:\r\n return [float(x) for x in stdin.readline().split()]\r\n else:\r\n return [str(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef calulate_cost():\r\n cost = {}\r\n for i in range(1, n + 1):\r\n tem = 0\r\n for j in toy.gdict[i]:\r\n tem += energy[j - 1][1]\r\n\r\n cost[i] = tem\r\n return cost\r\n\r\n\r\ndef change(v):\r\n for i in toy.gdict[v]:\r\n try:\r\n cost[i] -= dic[v]\r\n except:\r\n continue\r\n\r\n\r\nclass graph:\r\n # initialize graph\r\n def __init__(self, gdict=None):\r\n if gdict is None:\r\n gdict = defaultdict(list)\r\n self.gdict, self.edges = gdict, []\r\n\r\n # Get verticies\r\n def get_vertices(self):\r\n return list(self.gdict.keys())\r\n\r\n # add edge\r\n def add_edge(self, node1, node2):\r\n self.gdict[node1].append(node2)\r\n self.gdict[node2].append(node1)\r\n self.edges.append([node1, node2])\r\n\r\n\r\nn, m = arr_inp(1)\r\ntoy, energy = graph(), arr_enu()\r\n\r\nfor i in range(m):\r\n u, v = arr_inp(1)\r\n toy.add_edge(u, v)\r\n\r\ncost, ans, dic = calulate_cost(), 0, {i: j for i, j in energy}\r\nenergy.sort(key=lambda x: x[1])\r\n\r\nfor i in range(n):\r\n ma = energy[-1][0]\r\n ans += cost[ma]\r\n change(ma)\r\n del cost[ma]\r\n energy.pop()\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n s+=min(l[a-1],l[b-1])\r\nprint(s)\r\n", "n,m = list(map(int,input().split()))\r\ncost = list(map(int,input().split()))\r\nans=0\r\nfor i in range(m):\r\n\tf,s = list(map(int,input().split()))\r\n\tans += min(cost[f-1],cost[s-1])\r\nprint(ans)", "n,m = map(int, input().split())\r\nind = list(map(int,input().split()))\r\ns = 0\r\nfor e in range(m):\r\n f,ff = map(int,input().split())\r\n s += min(ind[f-1], ind[ff-1])\r\nprint(s)", "import sys\r\nimport itertools\r\nimport collections\r\n\r\n\r\ndef rs(x=''): return sys.stdin.readline().strip() if len(x) == 0 else input(x).strip()\r\ndef ri(x=''): return int(rs(x))\r\ndef rm(x=''): return map(str, rs(x).split())\r\ndef rl(x=''): return rs(x).split()\r\ndef rmi(x=''): return map(int, rs(x).split())\r\ndef rli(x=''): return [int(x) for x in rs(x).split()]\r\ndef println(val): sys.stdout.write(str(val) + '\\n')\r\n\r\n\r\ndef solve(testCase):\r\n n, m = rmi()\r\n ans = 0\r\n a = rli()\r\n for i in range(m):\r\n x, y = rmi()\r\n x -= 1\r\n y -= 1\r\n ans += min(a[x], a[y])\r\n print(ans)\r\n\r\n\r\nfor _ in range(ri() if 0 else 1):\r\n solve(_ + 1)", "n, k = map(int, input().split())\r\narr = [int(x) for x in input().split()]\r\ns = 0\r\nfor i in range(k):\r\n a, b = map(int, input().split())\r\n s+= arr[a-1] if arr[a-1]<arr[b-1] else arr[b-1]\r\nprint(s)\r\n " ]

[ "n=int(input())\r\na=list(map(int, input().split()))\r\nfor i in range(n):\r\n if i==0:\r\n print(abs(a[i+1]-a[i]),end=\" \")\r\n elif i==n-1:\r\n print(abs(a[n-1]-a[n-2]),end=\" \")\r\n else:\r\n print(min(abs(a[i]-a[i-1]),abs(a[i+1]-a[i])),end=\" \")\r\n print(max(abs(a[i]-a[0]),abs(a[n-1]-a[i])))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = list()\r\nfor i in range(n):\r\n min_, max_ = int(), int()\r\n if i == n-1:\r\n min_ = l[i] - l[i-1]\r\n max_ = l[i] - l[0]\r\n else:\r\n min_ = min(abs(l[i] - l[i-1]), abs(l[i] - l[i+1]))\r\n max_ = max(abs(l[i] - l[0]), abs(l[i] - l[-1]))\r\n ans.append([min_, max_])\r\nfor i in ans:\r\n print(f'{i[0]} {i[1]}')\r\n", "n = int(input())\r\nx = [int(x) for x in input().split()]\r\n\r\n\r\nnumber_leftmost = x[0]\r\n\r\nnumber_rightmost = x[-1]\r\n\r\n\r\n\r\n# print(farthest_left, farthest_right)\r\n\r\nchota_bhai = [0]*n\r\nchota_bhai[0] = abs(x[0]-x[1])\r\nchota_bhai[-1] = abs(x[-1]-x[-2])\r\n\r\nfor i in range(1,n-1):\r\n chota_bhai[i] = min(abs(x[i]-x[i-1]), abs(x[i+1]-x[i]))\r\n\r\nmota_bhai = [0]*n\r\nmota_bhai[0] = abs(number_leftmost-number_rightmost)\r\nmota_bhai[-1] = mota_bhai[0]\r\n\r\nfor i in range(1,n-1):\r\n mota_bhai[i] = max(abs(x[i]-number_rightmost), abs(x[i]-number_leftmost))\r\n\r\nfor i in range(n):\r\n print(chota_bhai[i], mota_bhai[i])\r\n\r\n", "n = int(input())\r\ncities = list(map(int, input().split()))\r\nmins = []\r\nmaxs = []\r\nfor i in range(n):\r\n comm = 0\r\n if i == 0:\r\n var = abs(cities[i] - cities[i+1])\r\n mins.append(var)\r\n comm = abs(cities[i]-cities[n-1])\r\n maxs.append(comm)\r\n elif i == n-1:\r\n comm = abs(cities[0]-cities[n-1])\r\n maxs.append(comm)\r\n var = abs(cities[i]-cities[i-1])\r\n mins.append(var)\r\n else:\r\n var = abs(cities[i]-cities[i-1])\r\n par = abs(cities[i]-cities[i+1])\r\n mins.append(min(var, par))\r\n var = abs(cities[i]-cities[0])\r\n par = abs(cities[i]-cities[n-1])\r\n maxs.append(max(var, par))\r\n[print(mins[i], maxs[i]) for i in range(n)]\r\n", "x=int(input())\nl=list(map(int,input().split()))\nmenor=0\nmaior=0\nfor i in range(0,x):\n if i==0:\n maior=l[x-1]-l[i]\n menor=l[1]-l[0]\n elif i==x-1:\n maior=l[i]-l[0]\n menor=l[i]-l[i-1]\n else:\n maior=max((l[x-1]-l[i]),(l[i]-l[0]))\n menor=min(l[i+1]-l[i],l[i]-l[i-1])\n print(menor,'',maior)\n\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\n\r\nfor i in range(n):\r\n if i == 0:\r\n print(abs(a[i] - a[i + 1]) , abs(a[i] - a[n - 1]))\r\n elif i == (n - 1): \r\n print(abs(a[i] - a[i - 1]) , abs(a[i] - a[0])) \r\n else:\r\n print(min(abs(a[i] - a[i + 1]) , abs(a[i] - a[i - 1])) , max(abs(a[i] - a[0]) , abs(a[i] - a[n - 1])))\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n if i==0:\r\n print(arr[i+1]-arr[i],arr[n-1]-arr[i])\r\n elif i==n-1:\r\n print(arr[i]-arr[i-1],arr[i]-arr[0])\r\n else:\r\n print(min(arr[i]-arr[i-1],arr[i+1]-arr[i]),max(arr[i]-arr[0],arr[n-1]-arr[i]))", "n=int(input())\r\nl=[]\r\nfor i in input().split():\r\n l.append(int(i))\r\n\r\nfirst_city=l[0]\r\nlast_city=l[-1]\r\nmx=10e9\r\nmn=-10e9\r\nfor i in range(n):\r\n if i==0:\r\n mx=abs(l[i]-last_city)\r\n mn=abs(l[i]-l[i+1])\r\n elif i==n-1:\r\n mx=abs(l[i]-first_city)\r\n mn=abs(l[i]-l[i-1])\r\n else:\r\n mn = min(abs(l[i] - l[i - 1]), abs(l[i] - l[i + 1]));\r\n mx = max(abs(l[i] - first_city), abs(l[i] - last_city));\r\n print(mn,\" \",mx)\r\n mx = 10e9\r\n mn = -10e9", "n = int(input())\nl = input().split()\ncities = [int(i) for i in l]\nleft, right = cities[0], cities[-1]\n\n\nlast = float('inf')\nm = max(cities[0] - left, right - cities[0])\nfor i in range(1, len(cities)):\n diff = cities[i] - cities[i-1]\n print(min(last, diff), end=\" \")\n last = diff\n print(m)\n m = max(cities[i] - left, right - cities[i])\n\nprint(cities[-1] - cities[-2], end=\" \")\nprint(max(cities[-1] - left, right - cities[-1]))\n\n\n\n\n\n", "# ██████╗\r\n# ███ ███═█████╗\r\n# ████████╗ ██████╗ ████████╗ ████ █████ ████╗\r\n# ██╔═════╝ ██╔═══██╗ ██╔═════╝ ████ █ ███║\r\n# ██████╗ ██║ ╚═╝ ██████╗ ████ ████╔╝\r\n# ██╔═══╝ ██║ ██╗ ██╔═══╝ ███ ███╔══╝\r\n# ████████╗ ╚██████╔╝ ████████╗ ███ ██╔═╝\r\n# ╚═══════╝ ╚═════╝ ╚═══════╝ ███╔══╝\r\n# Legends ╚══╝\r\n\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor _ in range(n):\r\n ans = list(range(2))\r\n if _ == 0:\r\n ans[0] = abs(a[0] - a[1])\r\n ans[1] = abs(a[0] - a[n - 1])\r\n print(str(ans[0]) + \" \" + str(ans[1]))\r\n elif _ == n - 1:\r\n ans[0] = abs(a[n - 1] - a[n - 2])\r\n ans[1] = abs(a[n - 1] - a[0])\r\n print(str(ans[0]) + \" \" + str(ans[1]))\r\n else:\r\n ans[0] = min(abs(a[_] - a[_ - 1]), abs(a[_] - a[_ + 1]))\r\n ans[1] = max(abs(a[_] - a[0]), abs(a[_] - a[n - 1]))\r\n print(str(ans[0]) + \" \" + str(ans[1]))\r\n print(\"\\n\")\r\n", "import math\r\ndef main():\r\n\t# t = int(input())\r\n\t# for _ in range(t):\r\n\t(case())\r\n\r\ndef case():\r\n\tn = int(input())\r\n\ta = list(map(int, input().split()))\r\n\r\n\tprint(f'{abs(a[0]-a[1])} {abs(a[0]-a[-1])}')\r\n\tfor i in range(1, n-1):\r\n\t\thead = a[0]\r\n\t\ttail = a[-1]\r\n\t\t\r\n\t\tprint(min(abs(a[i]-a[i+1]), abs(a[i]-a[i-1])), end=' ')\r\n\t\tprint(max(abs(a[i]-head), abs(a[i]-tail)))\r\n\t\t\r\n\r\n\r\n\tprint(f'{abs(a[-1]-a[-2])} {abs(a[-1]-a[0])}')\r\n\r\n\r\nmain()", "n = int(input())\r\nx = list(map(int, input().split()))\r\nmin_x = 0\r\nmax_x = 0\r\nfor i in range(len(x)):\r\n if 0 < i < len(x) - 1:\r\n min_x = min(x[i]-x[i-1], x[i+1]-x[i])\r\n max_x = max(x[i] - x[0], x[-1] - x[i])\r\n elif i == 0:\r\n min_x = x[i+1] - x[0]\r\n max_x = x[-1] - x[0]\r\n elif i == len(x)-1:\r\n min_x = x[i] - x[i-1]\r\n max_x = x[i] - x[0]\r\n print(str(min_x) + \" \" + str(max_x))\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nfor i in range(n-1):\r\n if(i==0):\r\n print(abs(a[1]-a[0]) , abs(a[n-1]-a[0]))\r\n else:\r\n\t print(min(abs(a[i]-a[i-1]),abs(a[i+1]-a[i])) , max(abs(a[i]-a[0]),abs(a[i]-a[n-1])))\r\nprint(a[-1]-a[-2],a[-1]-a[0])\r\n\t\r\n\r\n ", "n = int(input())\r\n\r\nstr_input = input() \r\nlista = [int(x) for x in str_input.split(\" \")] \r\nanswer = []\r\nfor i in range(len(lista)): \r\n\r\n if i == 0: \r\n real_min = lista[i + 1] - lista[i] \r\n real_max = lista[-1] - lista[i]\r\n elif i == (len(lista) - 1): \r\n real_min = lista[i] - lista[i - 1] \r\n real_max = lista[i] - lista[0] \r\n else: \r\n max_1 = lista[i] - lista[0] \r\n max_2 = lista[-1] - lista[i]\r\n\r\n real_max = max(max_1, max_2) \r\n\r\n min_1 = lista[i] - lista[i - 1] \r\n min_2 = lista[i + 1] - lista[i] \r\n\r\n real_min = min(min_1, min_2)\r\n \r\n print(f\"{real_min} {real_max}\")\r\n", "n = int(input())\ncities = list(map(int, input().split()))\n\nprint(abs(cities[0] - cities[1]), abs(cities[0] - cities[-1]))\nfor i in range(1, n-1):\n d_max = max(abs(cities[i] - cities[-1]), abs(cities[i] - cities[0]))\n d_min = min(abs(cities[i] - cities[i-1]), abs(cities[i] - cities[i+1]))\n print(d_min, d_max)\n\nprint(abs(cities[-1] - cities[n-2]), abs(cities[-1] - cities[0]))\n\t\t \t \t \t \t\t\t\t\t\t\t \t\t", "n = int(input())\r\ncoordinates = list(map(int, input().split()))\r\nfor i in range(n):\r\n temp = coordinates[i]\r\n if i != 0 and i != n - 1:\r\n min_ = min(abs(temp - coordinates[i - 1]), abs(temp - coordinates[i + 1]))\r\n max_ = max(abs(temp - coordinates[0]), abs(temp - coordinates[-1]))\r\n elif i == 0:\r\n min_ = abs(temp - coordinates[i + 1])\r\n max_ = abs(temp - coordinates[-1])\r\n else:\r\n min_ = abs(temp - coordinates[i - 1])\r\n max_ = abs(temp - coordinates[0])\r\n print(min_, max_)", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\ns= len(x)\r\nfor i in range(s-1):\r\n print(min(abs(x[i+1]-x[i]),abs(x[i]-x[i-1])),max(abs(x[s-1]-x[i]),abs(x[i]-x[0])))\r\nprint(x[s-1]-x[s-2],x[s-1]-x[0])", "input()\npontos = list(map(int, input().split(\" \")))\n\nfor i in range(0, len(pontos)):\n if i == 0:\n menor = abs(pontos[i] - pontos[i + 1])\n maior = abs(pontos[i] - pontos[-1])\n elif i == len(pontos) - 1:\n menor = abs(pontos[i] - pontos[i - 1])\n maior = abs(pontos[i] - pontos[0])\n else:\n menor_a = abs(pontos[i] - pontos[i + 1])\n menor_b = abs(pontos[i] - pontos[i - 1])\n \n maior_a = abs(pontos[i] - pontos[-1])\n maior_b = abs(pontos[i] - pontos[0])\n \n menor = min(menor_a, menor_b)\n maior = max(maior_a, maior_b)\n \n print(str(menor) + \" \" + str(maior))\n\n\t \t\t \t \t \t\t \t\t \t \t \t \t\t \t \t\t", "n = int(input())\n\ncities = [int(x) for x in input().split(' ')]\n\nfor i in range(len(cities)):\n\n v = cities[i]\n\n if i > 0 and i < len(cities) - 1:\n\n \n mind = min(abs(v - cities[i+1]), abs(v - cities[i - 1]))\n\n maxd = max(abs(v - cities[0]), abs(v - cities[len(cities) -1]))\n\n print(str(mind) + ' ' + str(maxd))\n\n else:\n\n if i == 0:\n\n mind = abs(v - cities[i+1])\n\n maxd = abs(v - cities[len(cities) -1])\n\n print(str(mind) + ' ' + str(maxd))\n\n else:\n \n mind = abs(v - cities[i - 1])\n\n maxd = abs(v - cities[0])\n\n print(str(mind) + ' ' + str(maxd))\n\t\t\t \t \t\t \t \t \t \t\t\t \t\t", "n=int(input())\r\ncoordinates=input().split(' ')\r\nprint(int(coordinates[1])-int(coordinates[0]),int(coordinates[-1])-int(coordinates[0]))\r\nfor i in range(1,n-1):\r\n print(min(int(coordinates[i+1])-int(coordinates[i]),int(coordinates[i])-int(coordinates[i-1])),max(int(coordinates[i])-int(coordinates[0]),int(coordinates[-1])-int(coordinates[i])))\r\nprint(int(coordinates[-1])-int(coordinates[-2]),int(coordinates[-1])-int(coordinates[0]))", "n = int(input())\nx = list(map(int, input().split()))\n\nfor i in range(n):\n if i == 0:\n min_dist = abs(x[0] - x[1])\n max_dist = abs(x[0] - x[-1])\n elif i == n-1:\n min_dist = abs(x[-2] - x[-1])\n max_dist = abs(x[0] - x[-1])\n else:\n dist_prev = abs(x[i-1] - x[i])\n dist_next = abs(x[i] - x[i+1])\n\n dist_first = abs(x[0] - x[i])\n dist_last = abs(x[i] - x[-1])\n\n min_dist = min(dist_prev, dist_next)\n max_dist = max(dist_first, dist_last)\n\n print(min_dist, max_dist)\n\n\t \t\t \t\t\t \t \t \t\t \t\t \t", "#https://codeforces.com/problemset/problem/567/A\n\n\nn = int(input())\ncities = list(map(int, input().split(\" \")))\n\nfor i in range(len(cities)):\n minimum = 0 # tmp\n maximum = 0 # tmp\n if i == 0:\n minimum = cities[ 1] - cities[0]\n maximum = cities[-1] - cities[0]\n elif i == n - 1:\n minimum = cities[-1] - cities[i - 1]\n maximum = cities[-1] - cities[0]\n else:\n if cities[i] - cities[i-1] > cities[i+1] - cities[i]:\n minimum = cities[i+1] - cities[i]\n else:\n minimum = cities[i] - cities[i-1]\n\n if cities[i] - cities[0] > cities[-1] - cities[i]:\n maximum = cities[i] - cities[0]\n else:\n maximum = cities[-1] - cities[i]\n\n print(\"%i %i\" %(minimum, maximum))\n", "size = int(input())\nx = str(input()).split()\n\nfor i in range(size):\n maior = max(abs(int(x[0])-int(x[i])), abs(int(x[size-1])-int(x[i])))\n if i == 0:\n menor = int(x[i+1])-int(x[i])\n elif i == size-1:\n menor = int(x[i])-int(x[i-1])\n else:\n menor = min(abs(int(x[i+1])-int(x[i])), abs(int(x[i-1])-int(x[i])))\n \n print(str(menor) + \" \" + str(maior))\n \t \t \t\t\t\t \t \t \t \t", "n = int(input())\r\narr = list(map(int,input().split()))\r\nmini = 0\r\nmaxi = 0\r\nfor i in range(len(arr)):\r\n if i==0:\r\n print(arr[1]-arr[0],end=\" \")\r\n print(arr[n-1]-arr[0])\r\n elif i==n-1:\r\n print(arr[n-1]-arr[n-2],end=\" \")\r\n print(arr[n-1]-arr[0])\r\n else:\r\n print(min(arr[i+1]-arr[i],arr[i]-arr[i-1]),end=\" \")\r\n print(max(arr[i]-arr[0],arr[n-1]-arr[i]))\r\n\r\n", "import sys\r\nfrom collections.abc import Callable\r\n\r\n\r\ndef fn() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n _ = read()\r\n values = [int(i) for i in read().split()]\r\n\r\n for i, val in enumerate(values):\r\n left = float('inf') if i - 1 < 0 else abs(values[i - 1] - val)\r\n right = float('inf') if i + 1 >= len(values) else abs(values[i + 1] - val)\r\n min_value = min(left, right)\r\n left = abs(values[0] - val) if i > 0 else float('-inf')\r\n right = abs(values[-1] - val) if i < len(values) - 1 else float('-inf')\r\n max_value = max(left, right)\r\n print(f'{min_value} {max_value}')\r\n\r\n\r\nif __name__ == '__main__':\r\n fn()\r\n", "n=int(input())\r\ncities=list(map(int,input().split(\" \")))\r\nfor i in range(len(cities)):\r\n Min,Max=0,0\r\n if i==0:\r\n Min=abs(cities[i+1]-cities[i])\r\n Max=abs(cities[len(cities)-1]-cities[i])\r\n elif i==len(cities)-1:\r\n Min=abs(cities[i]-cities[i-1])\r\n Max=abs(cities[i]-cities[0])\r\n else:\r\n Min=min(abs(cities[i+1]-cities[i]),abs(cities[i]-cities[i-1]))\r\n Max=max(abs(cities[len(cities)-1]-cities[i]),abs(cities[i]-cities[0]))\r\n print(f\"{Min} {Max}\")", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nt=max(lst)\r\nk=min(lst)\r\nfor i in range(len(lst)):\r\n if i!=len(lst)-1 and i==0:\r\n print(min(abs(lst[i+1]-lst[i]),abs(lst[i]-lst[i-1])),max(abs(lst[i]-t),abs(lst[i]-k)))\r\n elif i!=len(lst)-1 and i!=0:\r\n print(min(abs(lst[i]-lst[i-1]),abs(lst[i+1]-lst[i])),max(abs(lst[i]-t),abs(lst[i]-k)))\r\n else:\r\n print(lst[i]-lst[i-1],lst[i]-k)", "n=int(input()) ; c=list(map(int,input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n print(c[i+1]-c[i],c[-1]-c[i])\r\n elif i == n-1:\r\n print(c[i]-c[i-1],c[i]-c[0])\r\n else:\r\n print(min(c[i]-c[i-1],abs(c[i]-c[i+1])),max(c[i]-c[0] , abs(c[i]-c[-1])))", "n=int(input())\r\nx=[int(i1) for i1 in input().split()]\r\nle=x[0]\r\nre=x[-1]\r\nfor z in range(n):\r\n if z==0:\r\n print((x[z+1]-x[z]),(re-x[z]))\r\n elif z==n-1:\r\n print((x[z]-x[z-1]),(x[z]-le))\r\n else :\r\n a=x[z+1]-x[z]\r\n b=x[z]-x[z-1]\r\n c=re-x[z]\r\n d=x[z]-le\r\n print(min(a,b),max(c,d))", "n = int(input())\r\nx = list(map(int, input().split()))\r\nq = 1000000000\r\nfor i in range(n):\r\n biggest = 0\r\n smallest = 0\r\n if i == 0:\r\n biggest = (x[-1] + q) - (x[i] + q)\r\n smallest = (x[i + 1] + q) - (x[0] + q)\r\n elif i == n-1:\r\n biggest = (x[-1] + q) - (x[0] + q)\r\n smallest = (x[-1] + q) - (x[-2] + q)\r\n else:\r\n biggest = max((x[-1] + q) - (x[i] + q), (x[i] + q) - (x[0] + q))\r\n smallest = min((x[i] + q) - (x[i - 1] + q), (x[i + 1] + q) - (x[i] + q))\r\n print(smallest, biggest)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = a[n - 1]\r\nmi = a[0]\r\nfor i in range(n):\r\n max_num = max(abs(a[i] - mi), abs(a[i] - m))\r\n\r\n if i == 0:\r\n min_num = abs(a[i] - a[i + 1])\r\n elif i == n - 1:\r\n min_num = abs(a[n - 1] - a[n - 2])\r\n else:\r\n min_num = min(abs(a[i] - a[i + 1]), abs(a[i] - a[i - 1]))\r\n print(min_num, max_num)\r\n\r\n", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\nf = x[0]\r\nl = x[-1]\r\nprint(abs(x[0]-x[1]),abs(x[0]-x[-1]))\r\nfor i in range(1,n-1) :\r\n mi = (min(abs((x[i]-x[i+1])),abs(x[i]-x[i-1])))\r\n ma = (max(abs((x[i]-f)),abs(x[i]-l)))\r\n print(mi,ma)\r\n \r\nprint(abs(x[-1]-x[-2]),abs(x[0]-x[-1])) ", "n=int(input())\nli=list(map(int,input().split()))\nfor i in range(n):\n if i==0:\n print(abs(li[0]-li[1]),abs(li[0]-li[n-1]),sep=' ')\n elif i==n-1:\n print(abs(li[n-1]-li[n-2]),abs(li[0]-li[n-1]),sep=' ')\n else:\n a=abs(li[i]-li[i-1])\n b=abs(li[i]-li[i+1])\n c=abs(li[i]-li[0])\n d=abs(li[i]-li[n-1])\n print(min(a,b),max(c,d),sep=' ')\n\t \t \t \t \t \t \t\t \t\t \t \t\t", "number_of_cities = input()\r\n\r\nl_of_cities = [None for _ in range(int(number_of_cities))]\r\n\r\ncities = input().split(\" \")\r\n\r\nfor idx, element in enumerate(cities):\r\n l_of_cities[int(idx)] = int(element)\r\n\r\nl_of_cities.sort()\r\n\r\n\r\nfor idx, element in enumerate(l_of_cities):\r\n # if first city\r\n if idx == 0:\r\n print(abs(l_of_cities[idx + 1] - element) , abs(element - (l_of_cities[len(l_of_cities) -1])))\r\n continue\r\n # if last city\r\n if idx == len(l_of_cities) - 1:\r\n print(abs(element - l_of_cities[idx - 1]), abs(element - (l_of_cities[0])))\r\n continue\r\n else:\r\n min_i = min(abs(element - l_of_cities[idx - 1]), abs(l_of_cities[idx + 1] - element))\r\n max_i = max(abs(element - l_of_cities[0]), abs(l_of_cities[len(l_of_cities) -1] - element))\r\n\r\n print(min_i, max_i)\r\n ", "n = int(input());x_os = list(map(int, input().split()))\nfor i in range(n):\n if i == 0: 为什么提格纳里=abs(x_os[0]-x_os[1]);ඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞ=abs(x_os[0]-x_os[-1])\n if i == n-1:为什么提格纳里=abs(x_os[-1]-x_os[-2]);ඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞ=abs(x_os[-1]-x_os[0])\n else:为什么提格纳里=min(abs(x_os[i]-x_os[i-1]),abs(x_os[i]-x_os[i+1]));ඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞ=max(abs(x_os[i]-x_os[0]),abs(x_os[i]-x_os[-1]))\n print(为什么提格纳里,ඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞඞ)\n\n \t\t \t\t \t\t \t\t\t\t\t \t \t\t\t\t", "from sys import stdin,stdout\n\nn=int(input())\na=list(map(int,stdin.readline().split()))\nmn,mx=0,0\nfor i in range(n):\n if i==0:\n mn=abs(a[1]-a[0])\n mx=abs(a[i]-a[-1])\n elif i==n-1:\n mn=abs(a[i]-a[-2])\n mx=abs(a[i]-a[0])\n else:\n mn=min(abs(a[i]-a[i-1]),abs(a[i]-a[i+1]))\n mx=max(abs(a[i]-a[0]),abs(a[i]-a[-1]))\n print(mn,mx)\n\t\t\t\t \t\t\t\t \t\t\t\t \t \t \t\t\t\t \t", "arr_size = int(input())\n\narr = [int(x) for x in input().split()]\n\n\n\nfor i in range(arr_size):\n min_distance = min(abs(arr[i-1] - arr[i]) if (i - 1) >= 0 else float(\"inf\")\\\n , abs(arr[i+1] - arr[i]) if i+1 < arr_size else float(\"inf\"))\n max_distance = max(abs(arr[i] - arr[0]), abs(arr[i] - arr[arr_size-1]))\n print(min_distance, max_distance)\n\t \t\t \t \t\t \t \t\t\t \t \t\t\t \t\t\t", "n = int(input())\ncities = list(map(int, input().split()))\n\nfor i in range(n):\n right = abs(cities[i] - cities[i+1]) if i != n-1 else float(\"inf\")\n left = abs(cities[i] - cities[i-1]) if i != 0 else float(\"inf\")\n minimum = left if left < right else right\n right = abs(cities[i] - cities[0])\n left = abs(cities[i] - cities[-1])\n maximum = left if left > right else right\n print(minimum, maximum)", "def sub(x, y): return abs(x-y)\r\nn = int(input())\r\narr = list(sorted(map(int, input().split())))\r\nprint(sub(arr[0], arr[1]), sub(arr[0], arr[-1]))\r\nfor i in range(1, n-1): print(min(sub(arr[i], arr[i-1]), sub(arr[i], arr[i+1])), max(sub(arr[i], arr[0]), sub(arr[i], arr[-1])))\r\nprint(sub(arr[-1], arr[-2]), sub(arr[0], arr[-1]))", "n=int(input())\r\nm=[int(i) for i in input().split()]\r\nprint(m[1]-m[0],m[n-1]-m[0])\r\nfor i in range(1,n-1):\r\n print(min(m[i]-m[i-1],m[i+1]-m[i]),max(m[i]-m[0],m[n-1]-m[i]))\r\nprint(m[n-1]-m[n-2],m[n-1]-m[0])", "# https://codeforces.com/problemset/problem/567/A\r\n\r\ninput()\r\nseq = tuple(map(int, input().split()))\r\nfor i in range(len(seq)):\r\n if i == 0:\r\n print(seq[1] - seq[0], seq[-1] - seq[0])\r\n continue\r\n if i == len(seq) - 1:\r\n print(seq[-1] - seq[-2], seq[-1] - seq[0])\r\n continue\r\n print(min(seq[i+1] - seq[i], seq[i] - seq[i-1]), max(seq[-1] - seq[i], seq[i] - seq[0]))\r\n", "n = int(input())\r\nnumbers = list(map(int,input().split()))\r\nresult = []\r\nsub_result = []\r\nfor i in range(len(numbers)):\r\n if len(numbers)==1:\r\n sub_result.append(0)\r\n sub_result.append(0)\r\n result.append(sub_result)\r\n break\r\n if len(numbers)>1 and i==0:\r\n sub_result.append(abs(numbers[i]-numbers[i+1]))\r\n sub_result.append(abs(numbers[i]-numbers[len(numbers)-1]))\r\n result.append(sub_result)\r\n if len(numbers)>1 and i!=0 and i!=(len(numbers)-1):\r\n sub_result = []\r\n sub_result.append(min(abs(numbers[i]-numbers[i+1]),abs(numbers[i]-numbers[i-1])))\r\n sub_result.append(max(abs(numbers[i]-numbers[0]),abs(numbers[i]-numbers[len(numbers)-1])))\r\n result.append(sub_result)\r\n if len(numbers)>1 and i==(len(numbers)-1):\r\n sub_result = []\r\n sub_result.append(abs(numbers[len(numbers)-1]-numbers[len(numbers)-2]))\r\n sub_result.append(abs(numbers[0]-numbers[len(numbers)-1]))\r\n result.append(sub_result)\r\nfor i in result:\r\n print(*i)", "n = int(input())\r\nli = list(map(int, input().split()))\r\nfor i in range(n):\r\n if li[i] == li[0]:\r\n mini = abs(li[i]-li[i+1])\r\n maxi = abs(li[i]-li[n-1])\r\n elif li[i] == li[n-1]:\r\n mini = abs(li[n-1] - li[n-2])\r\n maxi = abs(li[n-1] - li[0])\r\n else:\r\n mini = min(abs(li[i]-li[i+1]), abs(li[i]-li[i-1]))\r\n maxi = max(abs(li[i]-li[0]), abs(li[i]-li[n-1]))\r\n print(mini,maxi)", "n=int(input())\r\nt=list(map(int,input().split()))\r\nfor i in range(n):\r\n x=t[i]\r\n print(min(abs(x-t[i-n+1]),abs(x-t[i-1])),end=\" \")\r\n print(max(abs(x-t[0]),abs(x-t[-1])))", "#By Anan instagram: anan.ssw\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(arr[1]-arr[0],arr[n-1]-arr[0])\r\nfor x in range(1,n-1):\r\n print(min(arr[x]-arr[x-1],arr[x+1]-arr[x]), end=' ')\r\n print(max(arr[x]-arr[0],arr[n-1]-arr[x])) \r\nprint(arr[n-1]-arr[n-2],arr[n-1]-arr[0])\r\n ", "n = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n\tif i==0:\r\n\t\tprint(x[1]-x[0], x[n-1]-x[0])\r\n\telif i==n-1:\t\t\r\n\t\tprint(x[n-1]-x[n-2], x[n-1]-x[0])\r\n\telse:\t\t\r\n\t\tprint(min(x[i]-x[i-1],x[i+1]-x[i]), max(x[n-1]-x[i], x[i]-x[0]))\r\n\r\n", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nsolution = []\r\n\r\nfor i in range(n):\r\n price_max = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1]))\r\n if i == 0:\r\n price_min = abs(cities[i] - cities[i + 1])\r\n elif i == n - 1:\r\n price_min = abs(cities[i] - cities[i - 1])\r\n else: \r\n price_min = min(abs(cities[i] - cities[i - 1]), abs(cities[i] - cities[i + 1]))\r\n solution.append([price_min, price_max])\r\n\r\nfor row in solution:\r\n print(*row)# 1689785403.317826", "import sys\n\ntoks = (token for token in sys.stdin.read().split())\nnc = int(next(toks))\n\nfirst = int(next(toks))\nshift = first * -1\n#print(shift)\ncities = []\ncities.append(first + shift)\n \nfor _ in range(nc - 1):\n cities.append(int(next(toks)) + shift)\nlargest = cities[-1]\n#print(cities)\ntmp1 = []\nprint(cities[1], cities[-1])\nfor a in range(1, len(cities)-1):\n tmp = []\n b = cities[a]\n tmp.append(b)\n tmp.append(b - cities[a-1])\n tmp.append(cities[a+1] - b)\n tmp.append(largest - b)\n print(min(tmp), max(tmp))\nprint(cities[-1] - cities[-2], cities[-1])\n\n \t\t \t \t\t \t\t \t\t\t \t \t", "n=int(input())\r\nx=[int(i) for i in input().split()]\r\nfor i in range(n):\r\n if i==0:\r\n print(x[1]-x[0],x[-1]-x[0])\r\n elif i==n-1:\r\n print(x[-1]-x[-2],x[-1]-x[0])\r\n else:\r\n a=x[i]-x[i-1]\r\n b=x[i+1]-x[i]\r\n c=x[-1]-x[i]\r\n d=x[i]-x[0]\r\n print(min(a,b),max(c,d))", "n = int(input())\ncities = [int(i) for i in input().split()]\nfor i in range(n):\n if i == 0:\n print(f\"{abs(cities[0] - cities[1])} {abs(cities[0] - cities[-1])}\")\n elif i == n - 1:\n print(f\"{abs(cities[i] - cities[i - 1])} {abs(cities[0] - cities[-1])}\")\n else:\n mindist = min(abs(cities[i] - cities[i - 1]), abs(cities[i] - cities[i + 1]))\n maxdist = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1]))\n print(f\"{mindist} {maxdist}\")\n \t\t\t\t\t \t \t\t\t\t \t\t \t\t\t\t\t \t\t", "n = int(input())\r\ns = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i + 1 >= n:\r\n min_ = min(abs(s[i] - s[i - 1]), abs(s[i] - s[0]))\r\n else:\r\n min_ = min(abs(s[i] - s[i - 1]), abs(s[i] - s[i + 1]))\r\n max_ = max(abs(s[i] - s[0]), abs(s[i] - s[len(s) - 1]))\r\n print(min_, max_)", "n = int(input())\r\npositions = [int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n print(positions[1] - positions[0], positions[n - 1] - positions[0])\r\n elif i == n - 1:\r\n print(positions[n - 1] - positions[n - 2], positions[n - 1] - positions[0])\r\n else:\r\n min_i = min(positions[i] - positions[i - 1], positions[i + 1] - positions[i])\r\n max_i = max(positions[i] - positions[0], positions[n - 1] - positions[i])\r\n print(min_i, max_i)\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nm1 = x[-1]\r\nm2 = x[0]\r\nprint(abs(x[1]-x[0]),abs(m1-m2))\r\nfor i in range(1,n-1):\r\n ma = max(abs(x[i]-m1),abs(x[i]-m2))\r\n mi = min(abs(x[i]-x[i-1]),abs(x[i]-x[i+1]))\r\n print(mi,ma)\r\nprint(abs(x[-2]-m1),abs(m1-m2))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n print(abs(arr[i] - arr[i + 1]), end=' ')\r\n elif i == n-1:\r\n print(abs(arr[i]-arr[i-1]), end=' ')\r\n else:\r\n print(min(abs(arr[i]-arr[i-1]), abs(arr[i]-arr[i+1])), end=' ')\r\n print(max(abs(arr[i]-arr[0]), abs(arr[i]-arr[-1])))", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n mn = 0 \r\n mx = 0 \r\n for i in range(n):\r\n if(i == 0):\r\n mn = abs(a[i+1] - a[i])\r\n elif(i == n - 1):\r\n mn = abs(a[i] - a[i-1])\r\n else:\r\n mn = min(abs(a[i+1] - a[i]), abs(a[i] - a[i-1]))\r\n\r\n\r\n\r\n if(i == n - 1):\r\n mx = abs(a[i] - a[0])\r\n elif(i == 0):\r\n mx = abs(a[-1] - a[0])\r\n else:\r\n mx = max(abs(a[i] - a[0]) , abs(a[-1] - a[i]))\r\n print(mn, mx)\r\n \r\nmain()", "x=int(input())\nn=list(map(int,input().split()))[:x]\nfor j in range(x):\n\n if j==0:\n print(abs(n[1]-n[0]),abs(n[x-1]-n[0]),sep=\" \")\n elif j==x-1:\n print(abs(n[x-1]-n[x-2]),abs(n[x-1]-n[0]),sep=\" \")\n else: \n a=abs(n[j]-n[j-1])\n b=abs(n[j+1]-n[j])\n c=abs(n[j]-n[0])\n d=abs(n[j]-n[x-1])\n print(min(a,b),max(c,d),sep=\" \")\n\n\n \t \t \t \t\t \t\t \t \t\t \t \t", "T = int(input())\r\ncty = list(map(int, input().split(\" \")))\r\nfor k in range(len(cty)):\r\n miny = 0 \r\n maxy = 0 \r\n if k== 0:\r\n miny = cty[ 1] - cty[0]\r\n maxy = cty[-1] - cty[0]\r\n elif k == T - 1:\r\n miny = cty[-1] - cty[k- 1]\r\n maxy = cty[-1] - cty[0]\r\n else:\r\n if cty[k]- cty[k-1] > cty[k+1] - cty[k]:\r\n miny = cty[k+1] - cty[k]\r\n else:\r\n miny = cty[k] - cty[k-1]\r\n if cty[k] - cty[0] > cty[-1] - cty[k]:\r\n maxy = cty[k] - cty[0]\r\n else:\r\n maxy = cty[-1] - cty[k]\r\n print(\"%i %i\" %(miny, maxy))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n a = -float('inf')\r\n b = float('inf')\r\n if i != 0:\r\n a = max(a, abs(l[0]-l[i]))\r\n b = min(b, abs(l[i]-l[i-1]))\r\n if i != n-1:\r\n a = max(a, abs(l[n-1]-l[i]))\r\n b = min(b, abs(l[i]-l[i+1]))\r\n print(b,a)\r\n", "n = int(input())\ns = [int(x) for x in input().split()]\nminimum = s[1]-s[0]\nmaximum = s[-1]-s[0]\nprint(minimum,maximum)\nfor i in range(1,n-1):\n d1 = s[i]-s[i-1]\n d2 = s[i+1]-s[i]\n minimum = min(d1,d2)\n a = s[i]-s[0]\n b = s[-1]-s[i]\n maximum = max(a,b)\n print(minimum,maximum)\nminimum = s[-1]-s[-2]\nmaximum = s[-1]-s[0]\nprint(minimum,maximum)\n\t \t\t \t\t \t \t\t\t \t \t \t \t", "# https://codeforces.com/contest/567/problem/A\r\n\r\nnum_cities = int(input())\r\nx_coordinate = [int(i) for i in input().split()]\r\n\r\nfor i in range(num_cities):\r\n # print('i am in this row:{}'.format(i))\r\n if (i != 0) and (i != num_cities-1):\r\n #print('in if')\r\n min_dist = min(x_coordinate[i] - x_coordinate[i-1], x_coordinate[i+1] - x_coordinate[i])\r\n max_dist = max(x_coordinate[i] - x_coordinate[0], x_coordinate[-1] - x_coordinate[i])\r\n elif i == 0:\r\n #print('in elif')\r\n min_dist = x_coordinate[1] - x_coordinate[0]\r\n max_dist = x_coordinate[-1] - x_coordinate[0]\r\n else:\r\n #print('in else')\r\n min_dist = x_coordinate[-1] - x_coordinate[-2]\r\n max_dist = x_coordinate[-1] - x_coordinate[0]\r\n print(min_dist, max_dist)", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#-----------------------------------------\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nprint(a[1]-a[0],a[-1]-a[0])\r\nfor i in range(1,n-1):\r\n print(min([a[i]-a[i-1],a[i+1]-a[i]]),max(a[i]-a[0],a[-1]-a[i]))\r\nprint(a[-1]-a[-2],a[-1]-a[0])\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())\ncidades = list(map(int, input().split()))\nfor i in range(n):\n if i == 0:\n print(abs(cidades[i] - cidades[i+1]), abs(cidades[i] - cidades[-1]))\n elif i == n - 1:\n print(abs(cidades[i] - cidades[i-1]), abs(cidades[i] - cidades[0]))\n else:\n print(min(abs(cidades[i] - cidades[i+1]), abs(cidades[i] - cidades[i-1])), max(abs(cidades[i] - cidades[-1]), abs(cidades[i] - cidades[0])))\n\t\t \t \t\t\t \t \t\t \t \t\t \t \t \t", "x = int(input())\n\ncoord = list(map(int, input().split()))\n\n\nfor i in range(x):\n max, min = 0,0\n \n if(i == 0):\n min = abs(coord[i] - coord[i+1])\n max = abs(coord[i] - coord[x-1])\n elif( i == x-1):\n min = abs(coord[i] - coord[i-1])\n max = abs(coord[i] - coord[0])\n else:\n min = abs(coord[i] - coord[i-1])\n if(abs(coord[i] - coord[i+1] )< min):\n min = abs(coord[i] - coord[i+1])\n \n \n max = abs(coord[i] - coord[0])\n if(abs(coord[i] - coord[x-1]) > max):\n max = abs(coord[i] - coord[x-1])\n \n print (min, \"\", max)\n \n\t\t \t\t \t\t \t\t\t\t \t \t\t\t\t\t\t\t \t \t\t", "n = int(input())\ncities = list(map(int, input().split()))\n\nfor i in range(len(cities)):\n\n c_prev = cities[i]-cities[i-1]\n c_post = cities[i]-cities[(i+1)%n]\n minimum = min(abs(c_prev), abs(c_post))\n\n c_first = cities[i]-cities[0]\n c_last = cities[i]-cities[n-1]\n maximum = max(abs(c_first), abs(c_last))\n\n if (i == n-1):\n minimum = abs(c_last-c_prev)\n maximum = abs(c_last-c_first)\n\n print(minimum, maximum)\n \t \t \t \t \t \t \t\t \t\t \t \t\t \t", "from collections import deque\r\n\r\nn = int(input())\r\n\r\na = deque(input().split())\r\n\r\nk = 0\r\nnum_list = deque([])\r\n\r\nwhile k != n:\r\n num_list.append(int(a[0]))\r\n a.rotate(1)\r\n k += 1\r\n\r\nnum_list = deque(sorted(num_list))\r\n\r\nmi = int(num_list[0])\r\nmx = int(num_list[-1])\r\n\r\nfor i in range(n):\r\n num = []\r\n if num_list[i] == mi:\r\n num.append(num_list[1] - mi)\r\n num.append(mx - num_list[i])\r\n elif num_list[i] == mx:\r\n num.append(mx - num_list[i-1])\r\n num.append(mx - mi)\r\n else:\r\n num.append(num_list[i] - num_list[i-1])\r\n num.append(num_list[i+1] - num_list[i])\r\n num.append(mx - num_list[i])\r\n num.append(num_list[i] - mi)\r\n\r\n print(min(num), max(num))\r\n", "n1 = int(input())\r\nlist1 = input().split()\r\nlist2 = []\r\nfor i in list1:\r\n list2.append(int(i))\r\n\r\nmid_point = (list2[0]+list2[-1])/2\r\n\r\nfor i in range(len(list2)):\r\n if list2[i] <= mid_point and i > 0 and i < n1-1:\r\n max_i = abs(list2[-1] - list2[i])\r\n min_i = min(abs(list2[i+1]-list2[i]),abs(list2[i]-list2[i-1]))\r\n print(min_i,max_i)\r\n elif list2[i] > mid_point and i > 0 and i < n1-1:\r\n max_i = abs(list2[0] - list2[i])\r\n min_i = min(abs(list2[i+1]-list2[i]),abs(list2[i]-list2[i-1]))\r\n print(min_i,max_i)\r\n elif i == 0:\r\n print(abs(list2[i+1]-list2[i]),list2[-1] - list2[i])\r\n else:\r\n print(abs(list2[i]-list2[i-1]),abs(list2[0]-list2[i]))\r\n \r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nprint(abs(arr[0]-arr[1]), abs(arr[0]-arr[n-1]))\r\nfor i in range(1,n-1):\r\n mn = min(abs(arr[max(0,i-1)]-arr[i]),abs(arr[min(n-1,i+1)]-arr[i]))\r\n mx = max(abs(arr[i]-arr[0]),abs(arr[n-1]-arr[i]))\r\n print(mn,mx)\r\n\r\nprint(abs(arr[n-1]-arr[n-2]), abs(arr[0]-arr[n-1]))", "n=int(input())\r\narr=list(map(int, input().split()))\r\nfor i in range(n):\r\n if i==0:\r\n minimum=abs( arr[i]-arr[i+1])\r\n maximum=abs(arr[-1]-arr[i])\r\n print(minimum,maximum)\r\n if i==n-1:\r\n minimum=arr[-1]-arr[-2]\r\n maximum=arr[-1]-arr[0]\r\n print(minimum,maximum)\r\n\r\n if i!=0 and i!=n-1:\r\n min_number=min(abs(arr[i]-arr[i-1]),abs(arr[i]-arr[i+1]) )\r\n max_number=max(abs(arr[-1]-arr[i]),abs(arr[i]-arr[0]))\r\n print(min_number,max_number)\r\n", "a = int(input())\r\n\r\nl = [int(i) for i in input().split()]\r\n\r\nfor i in range(a):\r\n if i ==0:\r\n print(abs(l[i] - l[i+1]),(abs(l[i]-l[-1])))\r\n elif i == a-1:\r\n print(abs(l[i]-l[i-1]),abs(l[i]-l[0]))\r\n\r\n else:\r\n print(min(abs(l[i]-l[i-1]),abs(l[i]-l[i+1])),max(abs(l[i]-l[0]),abs(l[i]-l[-1])))\r\n \r\n", "x = int(input())\ni = 0\n\nlis = []\nlis = [int(x) for x in input().split()]\n\nfor i in range(0, x):\n if(i == 0):\n print(f'{lis[1] - lis[0]} {lis[x-1] - lis[0]}')\n elif(i == x-1):\n print(f'{lis[x-1] - lis[x-2]} {lis[x-1] - lis[0]}')\n else:\n if(lis[i] - lis[i-1] > lis [i+1] - lis[i]):\n print(f'{lis[i+1] - lis[i]}', end = ' ')\n else:\n print(f'{lis[i] - lis[i-1]}', end = ' ')\n if(lis[i] - lis[0] > lis [x-1] - lis[i]):\n print(f'{lis[i] - lis[0]}')\n else:\n print(f'{lis[x-1] - lis[i]}')\n \t \t\t\t \t \t\t\t\t\t\t\t \t \t \t \t\t", "n = int(input())\r\nseq = list(map(int, input().split()))\r\nseq = [seq[1]] + seq + [seq[-2]]\r\n\r\n\r\nfor i in range(1, n + 1):\r\n a, b = abs(seq[i] - seq[i - 1]), abs(seq[i] - seq[i + 1])\r\n c, d = abs(seq[i] - seq[1]), abs(seq[i] - seq[-2])\r\n print(min(a, b), max(c, d))\r\n\r\n\r\n", "n=int(input())\r\nnum=list(map(int,input().split()))\r\nmax1=num[0]\r\nmax2=num[n-1]\r\nfor i in range(n):\r\n if(i-1>=0):\r\n if(i+1<n):\r\n minimum=min(num[i]-num[i-1],num[i+1]-num[i])\r\n else:\r\n minimum=num[i]-num[i-1]\r\n else:\r\n minimum=num[i+1]-num[i]\r\n maximum=max(num[i]-max1,max2-num[i])\r\n print(minimum,maximum)\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n - 1):\r\n if i == n:\r\n mi = abs(a[-2] - a[-1])\r\n ma = abs(a[i] - a[0])\r\n print(mi, ma)\r\n break\r\n mi = min(abs(a[i] - a[i + 1]), abs(a[i] - a[i - 1]))\r\n ma = max((abs(a[i] - a[-1]), abs(a[i] - a[0])))\r\n print(mi, ma)\r\nprint(abs(a[-1] - a[-2]), abs(a[-1] - a[0]))\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n min_d = x[i+1] - x[i]\r\n max_d = x[-1] - x[i]\r\n elif i == n-1:\r\n min_d = x[i] - x[i-1]\r\n max_d = x[i] - x[0]\r\n else:\r\n min_d = min(x[i+1] - x[i], x[i] - x[i-1])\r\n max_d = max(x[-1] - x[i], x[i] - x[0])\r\n print(min_d, max_d)", "from math import inf\r\nn = int(input())\r\ninp = tuple((map(int, input().split())))\r\nfor i in range(n):\r\n if i == 0:\r\n mn = inp[i+1] - inp[i]\r\n mx = inp[-1] - inp[i]\r\n elif i == n-1:\r\n mn = inp[i] - inp[i-1]\r\n mx = inp[i] - inp[0]\r\n else:\r\n mn = min((inp[i+1] - inp[i], inp[i] - inp[i-1]))\r\n mx = max((inp[-1] - inp[i], inp[i] - inp[0]))\r\n print(mn, mx)", "m=int(input())\nc=[int(x) for x in input().split()]\nmini=c[1]-c[0]\nmaxi=c[-1]-c[0]\nprint(mini,maxi)\nfor i in range(1,m-1):\n d1=c[i]-c[i-1]\n d2=c[i+1]-c[i]\n mini=min(d1,d2)\n m1=c[i]-c[0]\n m2=c[-1]-c[i]\n maxi=max(m1,m2)\n print(mini,maxi)\nmini=c[-1]-c[-2]\nmaxi=c[-1]-c[0]\nprint(mini,maxi) \n \t \t \t\t\t\t \t\t\t\t\t\t \t\t \t\t\t\t", "cts = int(input())\ncods = list(map(int, input().split(\" \")))\nfor i in range(cts):\n cst = []\n if i == 0:\n cst.append(str(abs(cods[1]-cods[0])))\n cst.append(str(abs(cods[-1] - cods[0])))\n elif i == len(cods)-1:\n cst.append(str(abs(cods[-2] - cods[-1])))\n cst.append(str(abs(cods[0] - cods[-1])))\n else:\n cst.append(str(min(abs(cods[i-1] - cods[i]), abs(cods[i+1] - cods[i]))))\n cst.append(str(max(abs(cods[0] - cods[i]), abs(cods[-1] - cods[i]))))\n print(\" \".join(cst))\n\n", "n=int(input())\r\nthe_list=[float('-inf')]+list(map(int,input().split()))+[float('inf')]\r\nfor i in range(1,len(the_list)-1):\r\n maximum=max(abs(the_list[i]-the_list[1]),abs(the_list[i]-the_list[-2]))\r\n minimum=min(abs(the_list[i]-the_list[i-1]),abs(the_list[i]-the_list[i+1]))\r\n print(minimum,maximum)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nprint(x[1]-x[0], x[n-1]-x[0])\r\nfor i in range(1,n-1):\r\n print(min(x[i]-x[i-1], x[i+1]-x[i]), max(x[i]-x[0], x[n-1]-x[i]))\r\nprint(x[n-1]-x[n-2], x[n-1]-x[0])", "n = int(input()) # Number of cities\r\ncoordinates = list(map(int, input().split())) # Coordinates of cities\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n # For the first city, calculate only the next city\r\n mini = abs(coordinates[i] - coordinates[i+1])\r\n maxi = max(abs(coordinates[i] - coordinates[-1]), abs(coordinates[i] - coordinates[0]))\r\n elif i == n - 1:\r\n # For the last city, calculate only the previous city\r\n mini = abs(coordinates[i] - coordinates[i-1])\r\n maxi = max(abs(coordinates[i] - coordinates[-1]), abs(coordinates[i] - coordinates[0]))\r\n else:\r\n # For cities in between, calculate both previous and next cities\r\n mini = min(abs(coordinates[i] - coordinates[i-1]), abs(coordinates[i] - coordinates[i+1]))\r\n maxi = max(abs(coordinates[i] - coordinates[-1]), abs(coordinates[i] - coordinates[0]))\r\n \r\n print(mini, maxi)\r\n", "n = int(input())\r\narr = list(int(i) for i in input().split())\r\nans = [[0, 0]] * n\r\nans[0][0] = abs(arr[1] - arr[0])\r\nans[0][1] = abs(arr[n - 1] - arr[0])\r\nprint(ans[0][0], ans[0][1])\r\nfor i in range(1, n - 1):\r\n ans[i][0] = min(abs(arr[i] - arr[i - 1]), abs(arr[i + 1] - arr[i]))\r\n ans[i][1] = max(abs(arr[0] - arr[i]), abs(arr[i] - arr[n - 1]))\r\n print(ans[i][0], ans[i][1])\r\nans[n - 1][0] = abs(arr[n - 2] - arr[n - 1])\r\nans[n - 1][1] = abs(arr[n - 1] - arr[0])\r\nprint(ans[n - 1][0], ans[n - 1][1])", "n = int(input())\r\ntemp_list = input().split()\r\nlist = []\r\n\r\nfor i in range(n):\r\n list.append(int(temp_list[i]))\r\n\r\nfor counter in range(n):\r\n\r\n if counter == 0:\r\n min_i = list[counter + 1] - list[counter]\r\n elif counter == n - 1:\r\n min_i = list[counter] - list[counter - 1]\r\n else:\r\n if list[counter + 1] - list[counter] > list[counter] - list[counter - 1]:\r\n min_i = list[counter] - list[counter - 1]\r\n else:\r\n min_i = list[counter + 1] - list[counter]\r\n\r\n if counter == 0 or counter == n-1:\r\n max_i = list[n-1] - list[0]\r\n else:\r\n if list[counter] - list[0] > list[n-1] - list[counter]:\r\n max_i = list[counter] - list[0]\r\n else:\r\n max_i = list[n-1] - list[counter]\r\n print(str(min_i) + \" \" + str(max_i))", "n=int(input())\nl=list(map(int,input().split()))\nfor i in range(n):\n m1=10e10\n m2=10e10\n try:\n m1=min(m1,abs(l[i]-l[i+1]))\n except:\n pass\n try:\n m1=min(m1,abs(l[i]-l[i-1]))\n except:\n pass\n print(min(m1,m2),end=' ')\n m1=-10e10\n m2=-10e10\n try:\n m1=max(m1,abs(l[i]-l[0]))\n except:\n pass\n try:\n m1=max(m1,abs(l[i]-l[-1]))\n except:\n pass\n print(max(m1,m2),end=' ')\n print()\n \t\t\t \t \t \t \t \t \t\t \t", "n = int(input())\narr = list(map(int, input().split()))\n\nfor ind, el in enumerate(arr):\n if ind==0:\n max_distance = abs(el-arr[n-1])\n min_distance = abs(el-arr[1])\n elif ind==n-1:\n max_distance = abs(el-arr[0])\n min_distance = abs(el-arr[n-2])\n else:\n max_distance = max(abs(el-arr[0]), abs(el-arr[n-1]))\n min_distance = min(abs(el-arr[ind+1]), abs(el-arr[ind-1]))\n print(min_distance, max_distance)", "n = int(input())\r\n\r\nnum_list = list(map(int, input().split()))\r\n\r\nnum_list.sort()\r\n\r\nmi = int(num_list[0])\r\nmx = int(num_list[-1])\r\n\r\nfor i in range(n):\r\n num = []\r\n if num_list[i] == mi:\r\n num.append(num_list[1] - mi)\r\n num.append(mx - num_list[i])\r\n elif num_list[i] == mx:\r\n num.append(mx - num_list[i-1])\r\n num.append(mx - mi)\r\n else:\r\n num.append(num_list[i] - num_list[i-1])\r\n num.append(num_list[i+1] - num_list[i])\r\n num.append(mx - num_list[i])\r\n num.append(num_list[i] - mi)\r\n\r\n print(min(num), max(num))", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nmax_cost = cities[n-1]-cities[0]\r\nmin_cost = cities[1]-cities[0]\r\nprint(min_cost, max_cost)\r\n\r\nfor i in range(1,n):\r\n max_cost = max(cities[i]-cities[0], cities[n-1]-cities[i])\r\n try:\r\n min_cost = min(cities[i]-cities[i-1], cities[i+1]-cities[i])\r\n print(min_cost, max_cost)\r\n except IndexError:\r\n min_cost = cities[i]-cities[i-1]\r\n print(min_cost, max_cost)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n x = min(abs(a[(i+1)%n]-a[i]), abs(a[i]-a[i-1]))\r\n y = max(a[i]-a[0], a[-1]-a[i])\r\n print(x,y)", "n = int(input())\nd = [int(x) for x in input().split()]\nminmax = [(0,0)]*len(d)\nminmax[0] = (d[1]-d[0], d[n-1]-d[0])\nminmax[n-1] = (d[n-1]-d[n-2], d[n-1]-d[0])\nfor i in range(1,n-1):\n minVal = min(d[i]-d[i-1], d[i+1]-d[i])\n maxVal = max(d[i]-d[0], d[n-1]-d[i])\n minmax[i] = (minVal, maxVal)\nfor t in minmax:\n print(t[0], t[1])", "n=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n print(min(abs(x[i]-x[i-1]),abs(x[i-n+1]-x[i])),max(x[i]-x[0],x[n-1]-x[i]))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = []\r\n\r\ni = 0\r\nmini = 0\r\nmaxi = 0\r\nwhile (i < len(a)):\r\n mini = 1e10\r\n maxi = max(a[i] - a[0], a[-1] - a[i])\r\n if i > 0:\r\n mini = a[i] - a[i - 1]\r\n if i < n - 1:\r\n if mini > a[i + 1] - a[i]:\r\n mini = a[i + 1] - a[i]\r\n \r\n \r\n \r\n b.append(\"{} {}\".format(mini, maxi))\r\n \r\n i += 1\r\n\r\nprint(\"\\n\".join(map(str, b)))", "from math import fabs\r\n\r\nn = int(input())\r\nx = [int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n mi, mx = 0, 0\r\n if i == 0:\r\n mi = fabs(x[i] - x[i + 1])\r\n mx = fabs(x[i] - x[n-1])\r\n print(f\"{int(mi)} {int(mx)}\")\r\n continue\r\n\r\n if i == n - 1:\r\n mi = fabs(x[i] - x[i - 1])\r\n mx = fabs(x[i] - x[0])\r\n print(f\"{int(mi)} {int(mx)}\")\r\n continue\r\n\r\n mi = min(fabs(x[i]-x[i-1]), fabs(x[i]-x[i+1]))\r\n mx = max(fabs(x[i]-x[0]), fabs(x[i]-x[n-1]))\r\n print(f\"{int(mi)} {int(mx)}\")\r\n", "n = int(input())\nx = [*map(int,input().split())]\nprint(abs(x[0]-x[1]) , abs(x[n-1] - x[0]))\nfor i in range(1,n-1):\n print(min(abs(x[i]-x[i+1]) , abs(x[i]-x[i-1])) , max(abs(x[i]-x[n-1]) , abs(x[i]-x[0])))\nprint(abs(x[n-1]-x[n-2]) , abs(x[n-1] - x[0]))\n\t \t \t \t \t \t \t\t \t\t\t\t\t \t", "def main():\r\n n = int(input())\r\n xCoordinate = list(map(int, input().split()))[:n]\r\n\r\n for i in range(n):\r\n if i == 0:\r\n min1 = abs(xCoordinate[i] - xCoordinate[i + 1])\r\n elif i == n-1:\r\n min1 = abs(xCoordinate[i] - xCoordinate[i - 1])\r\n else:\r\n min1 = min(abs(xCoordinate[i] - xCoordinate[i + 1]) , abs(xCoordinate[i] - xCoordinate[i-1]))\r\n \r\n max1 = max(abs(xCoordinate[i] - xCoordinate[0]), abs(xCoordinate[i] - xCoordinate[n-1]))\r\n print(min1, max1)\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n if i==0:\r\n print(abs(l[i]-l[i+1]),end=\" \")\r\n if i==n-1:\r\n print(abs(l[i]-l[i-1]),end=\" \")\r\n if i!=0 and i!=n-1:\r\n bir=abs(l[i]-l[i-1])\r\n iki=abs(l[i]-l[i+1])\r\n print(min(bir,iki),end=\" \")\r\n\r\n bir= abs(l[i]-l[0])\r\n iki =abs(l[i]-l[-1])\r\n print(max(bir,iki))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = sorted(a)\r\nMIN = dict()\r\nMAX = dict()\r\nMIN[b[0]] = b[1] - b[0]\r\nMIN[b[-1]] = b[-1] - b[-2]\r\nMAX[b[0]] = b[-1] - b[0]\r\nMAX[b[-1]] = b[-1] - b[0]\r\n\r\nfor i in range(1,n-1):\r\n MIN[b[i]] = min(b[i]-b[i-1],b[i+1]-b[i])\r\n MAX[b[i]] = max(b[i]-b[0],b[-1]-b[i])\r\n\r\nfor i in a:\r\n print(MIN[i],MAX[i])", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nfor i, city in enumerate(lst):\r\n if i == 0:\r\n mi = abs(city - lst[i+1]) \r\n elif i == len(lst) - 1:\r\n mi = abs(city - lst[i-1]) \r\n else:\r\n mi = min(abs(city - lst[i-1]), abs(city - lst[i+1])) \r\n ma = max(abs(city - lst[0]), abs(city - lst[-1]))\r\n print(f'{mi} {ma}')", "n = int(input())\nc = list(map(int, input().split()))\n \nc.sort()\n \nfor i in range(n):\n minD = 0\n maxD = 0\n \n if(i == 0):\n minD = abs(c[i] - c[i+1])\n maxD = abs(c[i] - c[n-1])\n elif(i == n-1):\n minD = abs(c[i] - c[i-1])\n maxD = abs(c[i] - c[0])\n else:\n minLeft = abs(c[i] - c[i-1])\n minRight = abs(c[i] - c[i+1])\n minD = abs(min(minLeft, minRight))\n \n maxLeft = abs(c[i] - c[0])\n maxRight = abs(c[i] - c[n-1])\n maxD = max(maxLeft, maxRight)\n \n print(minD, end=' ')\n print(maxD)\n \t\t \t \t\t \t\t \t\t \t\t\t\t\t\t \t\t", "n = int(input())\nlista = input().split()\n\nmaior = int(lista[-1]) - int(lista[0])\nmenor = int(lista[1]) - int(lista[0])\n\nprint(f'{menor} {maior}')\n\nfor i in range (1, len(lista) - 1):\n\tmenor = min((int(lista[i]) - int(lista[i - 1])), (int(lista[i + 1]) - int(lista[i])))\n\tmaior = max((int(lista[i]) - int(lista[0])), (int(lista[-1]) - int(lista[i])))\n\tprint(f'{menor} {maior}')\n\nmaior = int(lista[-1]) - int(lista[0])\nmenor = int(lista[-1]) - int(lista[-2])\n\nprint(f'{menor} {maior}')\n\t\t\t\t \t \t\t\t\t \t \t \t\t\t \t \t \t\t\t", "n = int(input())\r\ncities = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n mini = cities[i + 1] - cities[i]\r\n maxi = cities[n - 1] - cities[i]\r\n elif i == n - 1:\r\n mini = cities[i] - cities[i - 1]\r\n maxi = max(cities[i] - cities[0], cities[-1] - cities[i])\r\n else:\r\n mini = min(cities[i] - cities[i - 1], cities[i + 1] - cities[i])\r\n maxi = max(cities[i] - cities[0], cities[-1] - cities[i])\r\n print(mini, maxi)", "n = int(input())\na = [int(i) for i in input().split()]\nfor i in range(n):\n if i != n - 1:\n print(min(abs(a[i] - a[i - 1]), abs(a[i + 1] - a[i])), max(abs(a[i] - a[0]), abs(a[i] - a[-1])))\n if i == n - 1:\n print(min(abs(a[i] - a[i - 1]), abs(a[0] - a[i])), max(abs(a[i] - a[0]), abs(a[i] - a[-1])))\n \t\t\t \t\t\t\t\t \t \t\t\t\t\t \t", "n=int(input())\nX=list(map(int, input().split(' ')))\n\nfor i in range(len(X)):\n if(i==0):#primeiro elemento\n print(abs(X[0] - X[1]), abs(X[0] - X[n-1]))\n elif(i==len(X)-1):#ultimo elemento\n print(abs(X[n-1] - X[n-2]), abs(abs(X[0] - X[n-1])))\n else:#outros elementos\n print(min(abs(X[i-1] - X[i]), abs(X[i+1] - X[i])), max(abs(X[0] - X[i]), abs(X[n-1] - X[i])))\n \t \t\t \t \t \t \t\t \t \t\t \t\t \t \t", "n = int(input())\r\n\r\ncord = list(map(int,input().split()))\r\n\r\nvalues = []\r\n\r\nfor x in range(n):\r\n if x == 0:\r\n values.append((abs(cord[x] - cord[x+1]),abs(cord[x]-cord[n-1])))\r\n continue\r\n elif x == n-1:\r\n values.append((abs(cord[x] - cord[x-1]),abs(cord[x]-cord[0])))\r\n continue\r\n minm = abs(cord[x]-cord[x-1]),abs(cord[x]-cord[x+1])\r\n maxm = abs(cord[x]-cord[0]),abs(cord[x]-cord[n-1])\r\n values.append((abs(min(minm)),abs(max(maxm))))\r\n \r\nfor minm,maxm in values:\r\n print(minm,maxm , sep=' ')", "n=int(input())\r\nw=[int(k) for k in input().split()]\r\nprint(w[1]-w[0], w[-1]-w[0])\r\nfor j in range(n-2):\r\n print(min(w[j+1]-w[j], w[j+2]-w[j+1]), max(w[-1]-w[j+1], w[j+1]-w[0]))\r\nprint(w[-1]-w[-2], w[-1]-w[0])", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n print(arr[1]-arr[0], arr[-1] - arr[0])\r\n elif i == n - 1:\r\n print(arr[-1] - arr[-2], arr[-1] - arr[0])\r\n else:\r\n if arr[i] - arr[i-1] < arr[i+1] - arr[i]:\r\n print(arr[i] - arr[i-1], end=\" \")\r\n else:\r\n print(arr[i+1] - arr[i], end=\" \")\r\n if arr[i] - arr[0] > arr[-1] - arr[i]:\r\n print(arr[i] - arr[0])\r\n else:\r\n print(arr[-1] - arr[i])\r\n\r\n", "n = int(input()) \r\nl = list(map(int,input().split(\" \"))) \r\nz = len(l)\r\ni = 0\r\nwhile i <= n : \r\n if i == 0 : \r\n print(l[i+1]-l[i],\"\",l[n-1]-l[0]) \r\n i+=1 \r\n if i < (n-1) : \r\n l1 = l[i] - l[i-1] \r\n l2 = l[i+1] - l[i] \r\n h1 = l[n-1] - l[i] \r\n h2 = l[i] -l[0] \r\n print(min(l1,l2),\"\",max(h1,h2))\r\n i+=1 \r\n if i == (n-1) :\r\n print(l[n-1]-l[n-2],\"\",l[n-1]-l[0])\r\n break", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n if(i==0):\r\n print(abs(l[i]-l[i+1]),abs(l[i]-l[-1]))\r\n elif(i==n-1):\r\n print(abs(l[i]-l[i-1]),abs(l[i]-l[0]))\r\n else:\r\n print(min(abs(l[i]-l[i-1]),abs(l[i]-l[i+1])),max(abs(l[i]-l[0]),abs(l[i]-l[-1])))", "n = input()\r\nx = [int(x) for x in input().split()]\r\n\r\nfor i in range(len(x)):\r\n if i == 0:\r\n cost_min = abs(x[i] - x[1])\r\n cost_max = abs(x[i] - x[-1])\r\n elif i == len(x)-1:\r\n cost_min = abs(x[i] - x[-2])\r\n cost_max = abs(x[i] - x[0])\r\n else:\r\n cost_min = min(abs(x[i] - x[i-1]), abs(x[i] - x[i+1]))\r\n cost_max = max(abs(x[i] - x[0]), abs(x[i] - x[-1]))\r\n print(cost_min, cost_max)", "tc=int(input())\nn=list(map(int,input().split()))[:tc]\nfor i in range(tc):\n\n if i==0:\n print(abs(n[1]-n[0]),abs(n[tc-1]-n[0]),sep=\" \")\n elif i==tc-1:\n print(abs(n[tc-1]-n[tc-2]),abs(n[tc-1]-n[0]),sep=\" \")\n else: \n a=abs(n[i]-n[i-1])\n b=abs(n[i+1]-n[i])\n c=abs(n[i]-n[0])\n d=abs(n[i]-n[tc-1])\n print(min(a,b),max(c,d),sep=\" \")\n\t\t\t\t \t\t \t\t\t\t \t \t \t\t \t\t\t \t", "num = int(input())\r\ncities = [int(i) for i in input().split()]\r\nfor index, city in enumerate(cities):\r\n if index == 0:\r\n print(f\"{abs(city - cities[1])} {abs(city - cities[num-1])}\")\r\n elif index == num -1:\r\n print(f\"{abs(city - cities[index - 1])} {abs(city - cities[0])}\", end=\"\")\r\n else:\r\n minBetween = min(abs(city - cities[index - 1]), abs(city - cities[index + 1]))\r\n minEnd = max(abs(city - cities[0]), abs(city - cities[num - 1]))\r\n print(f\"{min(minBetween, minEnd)} {max(minBetween, minEnd)}\")", "def funcao(a, b, c):\n return min(b - a, c - b)\n\ndef funcao2(a, b, c):\n return max(b - a, c - b)\n\nn = int(input())\nlista = input().split()\nlista = list(map(int, lista))\ntam = len(lista)\nfim = lista[tam - 1]\nini = lista[0]\nres = []\n\ni = 0\nwhile i < tam:\n \n if i == 0:\n res.append(lista[1] - lista[0])\n elif i == tam -1:\n res.append(lista[tam - 1] - lista[tam - 2])\n else:\n res.append(funcao(lista[i - 1], lista[i], lista[i + 1]))\n res.append(funcao2(ini, lista[i], fim)) \n \n i += 1\n\nj = 0\nwhile j < len(res):\n print(res[j], res[j + 1])\n j += 2\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\n\r\nfor i in range(len(l)):\r\n maxi=max(abs(l[i]-l[-1]),abs(l[i]-l[0]))\r\n mini=min(abs(l[i]-l[(i+1)%len(l)]),abs(l[i]-l[i-1]))\r\n\r\n print(mini,maxi)\r\n maxi=0\r\n mini=0\r\n\r\n\r\n", "n=int(input())\r\nx=[int(_) for _ in input().split()]\r\nfor i in range(n-1):\r\n\tprint(min(abs(x[i-1]-x[i]),abs(x[i]-x[i+1])),max(abs(x[-1]-x[i]),abs(x[0]-x[i])))\r\nprint(x[-1]-x[-2],x[-1]-x[0])", "n = int(input())\r\nseq = input().split()\r\n\r\nfor i in range(n):\r\n right = max(int(seq[i]) - int(seq[0]), int(seq[n-1]) - int(seq[i]))\r\n if i == 0:\r\n print(int(seq[1])-int(seq[0]), right)\r\n elif i == n-1:\r\n print(int(seq[n-1]) - int(seq[n-2]), right)\r\n else:\r\n print(min(abs(int(seq[i]) - int(seq[i-1])), abs(int(seq[i]) - int(seq[i+1]))), right)", "import sys\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nminimum = sys.maxsize\r\nmaximum = 0\r\nfor i in range(len(arr)):\r\n if i == 0:\r\n # Checking for the first digit\r\n # Since the array is sorted therefore closer distance will be the adjacent number i.e i+1\r\n minimum = abs(arr[i] - arr[i+1])\r\n # Since the array is sorted therfore the farthest from the first number should alwayss be the last number\r\n maximum = abs(arr[i] - arr[len(arr)-1])\r\n # Checking for last digit\r\n elif i == len(arr)-1:\r\n # Since the array is sorted therefore the closest distance should always be the lesser number before it\r\n minimum = abs(arr[i] - arr[i-1])\r\n # Now again since the array is sorted the maximum distance is the farthest number in the array which is the first element \r\n maximum = abs(arr[i] - arr[0])\r\n else:\r\n # Now time for the numbers in between the array\r\n # Since the numbers arw sorted therefore the closer distance will be the number next t it or the number before it \r\n # WE have to calculate the minimum among these i-1 and i+1\r\n minimum = min(abs(arr[i] - arr[i - 1]), abs(arr[i]-arr[i+1]))\r\n # Now we are calculating max number\r\n # Again the farthest distance for the numbers in between the first number and the last number will always be the first or the last\r\n # Now we have to calculate the maximum in between the numbers\r\n maximum = max(abs(arr[i] - arr[0]), abs(arr[i]-arr[len(arr)-1]))\r\n print(minimum, \" \", maximum)\r\n minimum = sys.maxsize\r\n maximum = 0", "def sub(num1 , num2) :\r\n if num1 >= 0 and num2 >= 0 : return abs(num1 - num2) ;\r\n elif num1 < 0 and num2 < 0 : return abs(abs(num1) - abs(num2)) ;\r\n elif num1 >= 0 and num2 < 0 : return abs(num2) + num1;\r\n elif num1 < 0 and num2 >= 0 : return abs(num1) + num2;\r\ndef find_min (index , arr):\r\n x = sub(arr[index - 1] , arr[index])\r\n y = sub(arr[index + 1] , arr[index])\r\n if x <= y : return x ;\r\n else : return y ;\r\ndef find_max (index , arr):\r\n x = sub(arr[len(arr) - 1] , arr[index])\r\n y = sub(arr[0] , arr[index])\r\n if y >= x : return y ;\r\n else : return x ;\r\nnumbers = int(input())\r\narr = list(map(int , input().split()))\r\nprint(sub(arr[1] , arr[0]) , find_max( 0 , arr))\r\nfor i in range (1 , len(arr) - 1) :\r\n print( find_min(i , arr) , find_max(i , arr))\r\nprint(sub(arr[len(arr) - 1] , arr[len(arr) - 2] ) , find_max(len(arr) - 1 , arr))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nprint(abs(arr[0]-arr[1]), abs(arr[0]-arr[-1]))\r\nfor i in range(1,n-1):\r\n if abs(arr[i]-arr[i+1]) < abs(arr[i]-arr[i-1]):\r\n print(abs(arr[i]-arr[i+1]), end = \" \")\r\n else:\r\n print(abs(arr[i]-arr[i-1]), end = \" \")\r\n if abs(arr[i]-arr[0]) > abs(arr[i]-arr[-1]):\r\n print(abs(arr[i]-arr[0]))\r\n else:\r\n print(abs(arr[i]-arr[-1]))\r\nprint(abs(arr[-1]-arr[-2]), abs(arr[-1]-arr[0]))", "n = int(input())\r\ncoordinates = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n print(abs(coordinates[i + 1] - coordinates[i]), abs(coordinates[-1] - coordinates[i]))\r\n elif i == n - 1:\r\n print(abs(coordinates[i - 1] - coordinates[i]), abs(coordinates[0] - coordinates[i]))\r\n else:\r\n print(min(abs(coordinates[i-1] - coordinates[i]), abs(coordinates[i+1] - coordinates[i])),\r\n max(abs(coordinates[0] - coordinates[i]), abs(coordinates[-1] - coordinates[i])))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ncost = [[0,0] for i in range(n)]\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n cost[i][0] = abs(a[i+1] - a[i])\r\n elif i == n-1:\r\n cost[i][0] = abs(a[i] - a[i-1])\r\n else:\r\n cost[i][0] = min(abs(a[i] - a[i-1]),abs(a[i+1] - a[i]))\r\n cost[i][1] = max(abs(a[i] - a[0]), abs(a[-1] - a[i]))\r\n \r\nfor i in cost:\r\n print(*i)\r\n", "n=int(input())\r\ncities=list(map(int,input().split()))\r\nfor i in range(0,n):\r\n maxmum=max(cities[i]-cities[0],cities[-1]-cities[i])\r\n if (i!=0 and i!=n-1):\r\n minimum=min(cities[i]-cities[i-1],cities[i+1]-cities[i])\r\n elif i==0:\r\n minimum=cities[i+1]-cities[i]\r\n else:\r\n minimum=cities[i]-cities[i-1]\r\n print(\"%d %d\"%(minimum,maxmum))", "n = int(input())\r\ncrd = list(map(int, input().split())) \r\nfor i in range(n):\r\n maxDis = max(abs(crd[0] - crd[i]),abs(crd[-1] - crd[i]))\r\n up = 0 if i+1 == n else i+1 \r\n minDis = min(abs(crd[i-1] - crd[i]), abs(crd[up] - crd[i]))\r\n print(f'{minDis} {maxDis}')", "n=eval(input())\r\nl=input().split(\" \")\r\nl=[int(i) for i in l]\r\nfor i in range(n):\r\n if i==0:\r\n print(abs(l[0]-l[1]),abs(l[0]-l[-1]))\r\n elif i==n-1: \r\n print(abs(l[i]-l[i-1]),abs(l[0]-l[-1]))\r\n else:\r\n print(min(abs(l[i]-l[i+1]),abs(l[i]-l[i-1])),max(abs(l[i]-l[0]),abs(l[i]-l[-1])))\r\n", "t=int(input())\r\nx=list(map(int,input().split(\" \")))\r\ni=0\r\nwhile i<t:\r\n if i==0:\r\n min=x[i+1]-x[i]\r\n max=x[t-1]-x[i]\r\n elif i==(t-1):\r\n min=x[i]-x[i-1]\r\n max=x[i]-x[0]\r\n else:\r\n if (x[i]-x[i-1])>(x[i+1]-x[i]):\r\n min=x[i+1]-x[i]\r\n else:\r\n min=x[i]-x[i-1]\r\n if (x[i]-x[0])>(x[t-1]-x[i]):\r\n max=x[i]-x[0]\r\n else:\r\n max=x[t-1]-x[i]\r\n s=str(min)+\" \"+str(max)\r\n print(s)\r\n i+=1", "n = int(input())\r\na = list(map(int, input().split()))\r\nMX1 = a[0]\r\nMX2 = a[-1]\r\nfor i in range(n):\r\n if i == 0:\r\n print(abs(a[i] - a[i + 1]), max(abs(a[i] - MX1), abs(a[i] - MX2)))\r\n elif i == n - 1:\r\n print(abs(a[i] - a[i - 1]), max(abs(a[i] - MX1), abs(a[i] - MX2)))\r\n else:\r\n print(min(abs(a[i] - a[i + 1]), abs(a[i] - a[i - 1])),\r\n max(abs(a[i] - MX1), abs(a[i] - MX2)))\r\n", "n = int(input())\r\n\r\ndef dist(a, b):\r\n\treturn max(a, b) - min(a, b)\r\n\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\nfor i in range(len(arr)):\r\n\tif i == 0:\r\n\t\tprint(dist(arr[i], arr[i + 1]), end=' ')\r\n\t\tprint(dist(arr[len(arr) - 1], arr[i]))\r\n\telif i == len(arr) - 1:\r\n\t\tprint(dist(arr[i], arr[i - 1]), end=' ')\r\n\t\tprint(dist(arr[0], arr[i]))\r\n\telse:\r\n\r\n\t\tdist1 = dist(arr[i], arr[i - 1])\r\n\t\tdist2 = dist(arr[i], arr[i + 1])\r\n\r\n\t\tprint(min(dist1, dist2), end=' ')\r\n\r\n\t\tdist1 = dist(arr[i], arr[-1])\r\n\t\tdist2 = dist(arr[i], arr[0])\r\n\t\tprint(max(dist1, dist2))\r\n", "n = int(input())\r\nlst = [int(item) for item in input().split()]\r\nmax_ = max(lst)\r\nmin_ = min(lst)\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n min_distance = abs(lst[1] - lst[0])\r\n max_distance = abs(lst[-1] - lst[0])\r\n elif i == (n-1):\r\n min_distance = abs(lst[-2] - lst[-1])\r\n max_distance = abs(lst[-1] - lst[0])\r\n else:\r\n min_distance = min(abs(lst[i] - lst[i-1]), abs(lst[i] - lst[i+1]))\r\n max_distance = max(abs(lst[i] - lst[0]), abs(lst[i] - lst[-1]))\r\n print(min_distance, max_distance)", "n = int(input())\na = list(map(int,input().split()))\nnew = sorted(a)\nfor i in range(n):\n if i==0:\n min_c = new[1]-new[0]\n max_c = new[-1]-new[0]\n print(min_c,max_c)\n elif i == n-1:\n min_c = new[-1]-new[-2]\n max_c = new[-1]-new[0]\n print(min_c,max_c)\n else:\n min_c = min(new[i+1]-new[i],new[i]-new[i-1])\n max_c = max(new[i]-new[0],new[-1]-new[i])\n print(min_c,max_c)\n\t\t\t\t \t\t\t\t \t \t \t \t\t \t\t\t\t\t", "n = int(input())\r\n\r\ncities = list(map(int,input().split(' ')))\r\nif(n == 1):\r\n print(0, 0)\r\n exit()\r\nfor i in range(n):\r\n if(i == 0):\r\n mindistance = abs(cities[i+1] - cities[i])\r\n elif i == n-1:\r\n mindistance = abs(cities[i]-cities[i-1])\r\n else :\r\n mindistance = min(\r\n abs(cities[i+1] - cities[i]), \r\n abs(cities[i] - cities[i-1]))\r\n maxdistance = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[n-1]))\r\n print(mindistance,maxdistance)\r\n \r\n\r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nprint(arr[1] - arr[0], arr[n - 1] - arr[0])\r\nfor i in range(1, n - 1):\r\n minA = min(arr[i] - arr[i - 1], arr[i + 1] - arr[i])\r\n maxA = max(arr[i] - arr[0], arr[n - 1] - arr[i])\r\n print(minA, maxA)\r\n\r\nprint(arr[n - 1] - arr[n - 2], arr[n - 1] - arr[0])", "n = int(input())\r\ndistances = list(map(int, input().strip().split()))\r\n\r\nprint(abs(distances[0]-distances[1]), abs(distances[-1] - distances[0]))\r\n\r\n\r\nfor i in range(1, len(distances)-1):\r\n all_distances = []\r\n all_distances.append(abs(distances[i]-distances[i+1]))\r\n all_distances.append(abs(distances[i]-distances[i-1]))\r\n all_distances.append(abs(distances[i]-distances[0]))\r\n all_distances.append(abs(distances[i]-distances[-1]))\r\n print(min(all_distances), max(all_distances))\r\n\r\nprint(abs(distances[-1]-distances[-2]), abs(distances[-1] - distances[0]))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jul 24 12:10:58 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 37 - CF567-DIV2A\r\n\"\"\"\r\n\r\ncities = int(input())\r\nlocs = list(map(int,input().split()))\r\n\r\nfor i in range(cities):\r\n if i == 0:\r\n mDist = locs[1]-locs[0]\r\n maDist = locs[-1]-locs[0]\r\n elif i == len(locs)-1:\r\n mDist = locs[-1] - locs[-2]\r\n maDist = locs[-1]-locs[0]\r\n else:\r\n mDist = min(locs[i]-locs[i-1], locs[i+1]-locs[i])\r\n maDist = max(locs[i]-locs[0], locs[-1] - locs[i])\r\n print(mDist, maDist)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n mi = a[-1]\r\n ma = a[0]\r\n if i == 0:\r\n mi = a[1] - a[0]\r\n elif i == n - 1:\r\n mi = a[-1] - a[-2]\r\n else:\r\n mi = min(a[i + 1] - a[i], a[i] - a[i - 1])\r\n ma = max(a[i] - a[0], a[-1] - a[i])\r\n print(mi, ma)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n # First city, so calculate distance to the next city\r\n mini = abs(cities[i] - cities[i + 1])\r\n maxi = abs(cities[i] - cities[-1])\r\n elif i == n - 1:\r\n # Last city, so calculate distance to the previous city\r\n mini = abs(cities[i] - cities[i - 1])\r\n maxi = abs(cities[i] - cities[0])\r\n else:\r\n # Calculate minimum and maximum distances using the nearest neighbors\r\n mini = min(abs(cities[i] - cities[i - 1]), abs(cities[i] - cities[i + 1]))\r\n maxi = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1]))\r\n\r\n print(mini, maxi)\r\n\r\n", "n=int(input())\r\na=[]\r\na=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(n):\r\n mi=2e9+10\r\n if i+1<n:\r\n mi=min(mi,a[i+1]-a[i])\r\n if i-1>=0:\r\n mi=min(mi,a[i]-a[i-1])\r\n ma=max(a[i]-a[0],a[n-1]-a[i])\r\n ans.append([mi,ma])\r\nfor x in ans:\r\n print(x[0],x[1])\r\n ", "import math\r\nx = int(input())\r\nd = [int(d) for d in input().split()]\r\nfor i in range(x):\r\n if i == 0:\r\n print(d[i+1] - d[i],abs(d[i]-d[-1]))\r\n elif i == x-1:\r\n print(d[i] - d[i-1], abs(d[i] - d[0]))\r\n else:\r\n print(min(abs(d[i+1]-d[i]), abs(d[i-1]-d[i])), max(abs(d[i]-d[0]), abs(d[i]-d[-1])))", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n if i == 0:\r\n minn = abs(l[i+1]-l[i])\r\n maxx = abs(l[i]-l[-1])\r\n elif i == n-1:\r\n minn = abs(l[i-1]-l[i])\r\n maxx = abs(l[i]-l[0])\r\n else:\r\n minn = min(abs(l[i+1]-l[i]),abs(l[i-1]-l[i]))\r\n maxx = max(abs(l[i]-l[0]),abs(l[i]-l[-1]))\r\n print(minn,maxx)", "n = int(input())\r\nx = list(map(int,input().split()))\r\nfor i in range(len(x)):\r\n m2 = 0\r\n m1 = max(abs(x[i]-x[0]),abs(x[i]-x[n-1]))\r\n if i == 0 :\r\n m2 = abs(x[i]-x[i+1])\r\n elif i == len(x)-1:\r\n m2 = abs(x[i]-x[i-1])\r\n else:\r\n m2 = min(abs(x[i]-x[i-1]), abs(x[i]-x[i+1]))\r\n print(m2,m1)\r\n", "n = input()\n\ncities = list(map(int, input().split()))\n\nfor i in range(len(cities)):\n if i == 0:\n print(abs(cities[i + 1] - cities[i]), abs(cities[-1] - cities[i]))\n elif i == len(cities) -1:\n print(abs(cities[-2] - cities[-1]), abs(cities[0] - cities[-1]))\n else:\n min_distance = min(abs(cities[i+1] - cities[i]), abs(cities[i-1] - cities[i]))\n max_distance = max(abs(cities[0] - cities[i]), abs(cities[-1] - cities[i]))\n\n print(min_distance, max_distance)\n\t \t\t\t \t\t \t\t \t \t \t\t\t \t", "number_of_cities = int(input())\ncities_x_coordinates = list(map(int, input().split()))\nfor i in range(number_of_cities):\n current_city_coordinate = cities_x_coordinates[i]\n if i == 0:\n distance_to_nearest_city = abs(cities_x_coordinates[i + 1] - current_city_coordinate)\n distance_to_further_city = abs(cities_x_coordinates[number_of_cities - 1] - current_city_coordinate)\n elif i == number_of_cities - 1:\n distance_to_nearest_city = abs(current_city_coordinate - cities_x_coordinates[i - 1])\n distance_to_further_city = abs(current_city_coordinate - cities_x_coordinates[0])\n else:\n distance_to_next_left_city = abs(current_city_coordinate - cities_x_coordinates[i - 1])\n distance_to_next_right_city = abs(cities_x_coordinates[i + 1] - current_city_coordinate)\n distance_to_nearest_city = (distance_to_next_left_city\n if distance_to_next_left_city < distance_to_next_right_city\n else distance_to_next_right_city)\n distance_to_leftmost_city = abs(current_city_coordinate - cities_x_coordinates[0])\n distance_to_rightmost_city = abs(cities_x_coordinates[number_of_cities - 1] - current_city_coordinate)\n distance_to_further_city = (distance_to_leftmost_city\n if distance_to_leftmost_city > distance_to_rightmost_city\n else distance_to_rightmost_city)\n print(distance_to_nearest_city, distance_to_further_city)\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nfor i in range(0,n):\r\n if i==0:\r\n mini = l[i+1]-l[0]\r\n maxi = l[-1]-l[0]\r\n elif i==(n-1):\r\n mini = l[i]-l[i-1]\r\n maxi = l[i]-l[0]\r\n else:\r\n mini = min(l[i]-l[i-1], l[i+1]-l[i])\r\n maxi = max(l[i]-l[0], l[-1]-l[i])\r\n\r\n\r\n \r\n print(mini, maxi)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n maxx = max(abs(l[i]-l[-1]),abs(l[0]-l[i]))\r\n minn = min(abs(l[i]-l[(i+1)%n]),abs(l[i-1]-l[i]))\r\n print(f'{minn} {maxx}')", "import sys\nfrom os import path\nif (path.exists('input.txt') and path.exists('output.txt')):\n sys.stdout = open('output.txt', 'w')\n sys.stdin = open('input.txt', 'r')\n\n\ndef main():\n N = int(input())\n n = N - 1\n cities = list(map(int, input().split()))\n for i in range(0, N):\n mn = 0\n mx = 0\n if i == 0:\n mn = abs(cities[i] - cities[i + 1])\n mx = abs(cities[i] - cities[n])\n elif i == n:\n mn = abs(cities[i] - cities[i - 1])\n mx = abs(cities[i] - cities[0])\n else:\n mn = min(abs(cities[i] - cities[i + 1]), \n abs(cities[i] - cities[i - 1]))\n mx = max(abs(cities[i] - cities[n]),\n abs(cities[i] - cities[0]))\n print(mn, mx)\n\n\nmain()", "n=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in range (n):\r\n if i==0:\r\n print(abs(x[1]-x[0]),abs(x[n-1]-x[0]))\r\n elif i==(n-1):\r\n print(abs(x[n-1]-x[n-2]),abs(x[n-1]-x[0]))\r\n else:\r\n print(min(abs(x[i]-x[i-1]),abs(x[i]-x[i+1])),max(abs(x[i]-x[0]),abs(x[i]-x[n-1])))\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nmx = 0\r\nmn = 0\r\nfor i in range(n):\r\n mx = max(abs(a[i]-a[0]),abs(a[i]-a[n-1]))\r\n if i == 0:\r\n mn = abs(a[0]-a[i+1])\r\n elif i == (n-1):\r\n mn = abs(a[n-1]-a[n-2])\r\n else:\r\n mn = min(abs(a[i]-a[i-1]), abs(a[i]-a[i+1]))\r\n print(mn,mx)", "n=int(input(\"\"))\r\nx=list(map(int,input(\"\").split(\" \")))\r\n\r\nfor i in range(0,n):\r\n max_num=max(abs(x[i]-x[0]),abs(x[i]-x[n-1]))\r\n if(i==0): min_num=abs(x[i]-x[i+1])\r\n elif(i==(n-1)):min_num=abs(x[i]-x[i-1]);\r\n else:min_num=min(abs(x[i]-x[i+1]),abs(x[i]-x[i-1]))\r\n print(f\"{min_num} {max_num}\")", "cities = int(float(input()))\r\ncoordinates= input()\r\ncoordinates = coordinates.split(' ')\r\nn = len(coordinates)\r\n\r\nfor i in range(cities):\r\n if (i==0):\r\n min_=abs(int(coordinates[0])-int(coordinates[1]))\r\n max_=abs(int(coordinates[0])-int(coordinates[n-1]))\r\n print(min_,end=\" \")\r\n print(max_)\r\n elif(i==n-1):\r\n min_ = abs(int(coordinates[n-1]) - int(coordinates[n-2]))\r\n max_ = abs(int(coordinates[n-1]) - int(coordinates[0]))\r\n print(min_, end=\" \")\r\n print(max_)\r\n else:\r\n min_ = min(abs(int(coordinates[i]) - int(coordinates[i-1])),abs(int(coordinates[i]) - int(coordinates[i+1])))\r\n max_ = max(abs(int(coordinates[i]) - int(coordinates[0])),abs(int(coordinates[i]) - int(coordinates[n-1])))\r\n print(min_, end=\" \")\r\n print(max_)", "# Link: https://codeforces.com/contest/567/problem/A\n\nnumber_of_cities = int(input())\ncities_coordinates = list(map(int, input().split()))\n\nfor coordinate_index, _ in enumerate(cities_coordinates):\n # min_distance = calc_min_distance(coordinate_index, cities_coordinates)\n # max_distance = calc_max_distance(coordinate_index, cities_coordinates)\n min_distance = max_distance = 0\n \n if coordinate_index == 0:\n min_distance = abs(cities_coordinates[coordinate_index] - cities_coordinates[coordinate_index + 1])\n max_distance = abs(cities_coordinates[coordinate_index] - cities_coordinates[-1])\n\n elif coordinate_index == len(cities_coordinates) - 1:\n min_distance = abs(cities_coordinates[coordinate_index] - cities_coordinates[coordinate_index - 1])\n max_distance = abs(cities_coordinates[coordinate_index] - cities_coordinates[0])\n \n else:\n min_a = abs(cities_coordinates[coordinate_index] - cities_coordinates[coordinate_index - 1])\n min_b = abs(cities_coordinates[coordinate_index] - cities_coordinates[coordinate_index + 1])\n \n min_distance = min_a if min_a < min_b else min_b\n \n max_a = abs(cities_coordinates[coordinate_index] - cities_coordinates[0])\n max_b = abs(cities_coordinates[coordinate_index] - cities_coordinates[-1])\n \n max_distance = max_a if max_a > max_b else max_b\n \n print(min_distance, max_distance)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n mini = abs(cities[0] - cities[1])\r\n maxi = abs(cities[0] - cities[-1])\r\n elif i == n - 1:\r\n mini = abs(cities[-1] - cities[-2])\r\n maxi = abs(cities[-1] - cities[0])\r\n else:\r\n mini = min(abs(cities[i] - cities[i-1]), abs(cities[i] - cities[i+1]))\r\n maxi = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1]))\r\n print(mini, maxi)\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\na = sorted(zip(x,range(n)))\r\n\r\nminl = [0]*n\r\nmaxl = [0]*n\r\n\r\nMAXN = 10**10\r\n\r\nfor i in range(n):\r\n d,ind = a[i]\r\n left = MAXN\r\n right = MAXN\r\n if i >0:\r\n left = abs(a[i-1][0]-d)\r\n if i < n-1:\r\n right = abs(a[i+1][0]-d)\r\n ma = max(abs(a[0][0]-d),abs(a[-1][0]-d))\r\n mi = min(left,right)\r\n minl[ind]=mi\r\n maxl[ind]=ma\r\n\r\nfor i in range(n):\r\n print(minl[i],maxl[i])\r\n", "n = int(input())\r\nins = [int(x) for x in input().split(\" \")]\r\nfor i in range(n):\r\n minn = min([abs(ins[i] - ins[i - 1]) , abs(ins[(i + 1)%n] - ins[i])])\r\n maxx = max([abs(ins[i] - ins[0]) , abs(ins[i] - ins[-1])])\r\n print(minn , maxx)", "n = int(input())\nl = input().split()\ncities = [int(i) for i in l]\nleft, right = cities[0], cities[-1]\n\nfor i in range(len(cities)):\n if i == 0:\n print(cities[i+1] - cities[i], end=\" \")\n elif i == n - 1:\n print(cities[i] - cities[i-1], end=\" \")\n else:\n print(min(cities[i] - cities[i-1], cities[i+1] - cities[i]), end=\" \")\n print(max(cities[i] - left, right - cities[i]))\n\n\n\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nprint(abs(l[0]-l[1]),\" \",abs(l[0]-l[n-1]))\r\nfor i in range(1,n-1):\r\n c=l[i]\r\n s1=abs(c-l[i+1])\r\n s2=abs(c-l[i-1])\r\n b1=abs(c-l[0])\r\n b2=abs(c-l[n-1])\r\n print(min(s1,s2),\" \",max(b1,b2))\r\nprint(abs(l[n-1]-l[n-2]),\" \",abs(l[0]-l[n-1]))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = []\r\nmx = 0\r\nmn = 0\r\n\r\nfor i in range(n):\r\n mx = max(abs(a[i] - a[0]), abs(a[i] - a[-1]))\r\n if i == 0:\r\n mn = abs(a[0] - a[1])\r\n elif i == (n-1):\r\n mn = abs(a[-1] - a[-2])\r\n else:\r\n mn = min(abs(a[i]-a[i-1]), abs(a[i]-a[i+1]))\r\n res.append([mn,mx])\r\n \r\nfor i in res:\r\n print(*i)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nlst = tuple(map(int, input().split()))\r\n\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n print(lst[1] - lst[0], end=\" \")\r\n print(lst[n-1] - lst[0])\r\n elif i == n-1:\r\n print(lst[n-1] - lst[n-2], end=\" \")\r\n print(lst[n-1] - lst[0])\r\n else:\r\n minm = lst[i + 1] - lst [i] if lst[i + 1] - lst [i] < abs(lst[i - 1] - lst [i]) else abs(lst[i - 1] - lst [i])\r\n maxm = abs(lst[0] - lst [i]) if abs(lst[0] - lst [i]) > lst[n - 1] - lst [i] else lst[n - 1] - lst [i]\r\n print(minm, maxm)\r\n", "n = int(input())\nx = list(map(int, input().split()))\n\nfor i in range(n):\n if i == 0:\n mind = x[i + 1] - x[i]\n maxd = x[n - 1] - x[i]\n print(mind, maxd)\n elif i == n - 1:\n mind = x[i] - x[i - 1]\n maxd = x[i] - x[0]\n print(mind, maxd)\n else:\n d1 = x[i] - x[i - 1]\n d2 = x[i + 1] - x[i]\n mind = min(d1, d2)\n d3 = x[i] - x[0]\n d4 = x[n - 1] - x[i]\n maxd = max(d3, d4)\n print(mind, maxd)", "n = int(input())\r\na = list(map(int, input().strip().split()))\r\nmini = 0\r\nmaxi = 0\r\na = sorted(a)\r\nfor i in range(n):\r\n if i == 0:\r\n print(f\"{a[1] - a[0]} {a[-1] - a[0]}\")\r\n elif i == n - 1:\r\n print(f\"{a[-1] - a[-2]} {a[-1] - a[0]}\")\r\n else:\r\n Min = min(a[i] - a[i - 1], a[i + 1] - a[i])\r\n Max = max(a[i] - a[0], a[-1] - a[i])\r\n print(f\"{Min} {Max}\")", "n = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n print(min(abs(x[i]-x[i-1]), abs(x[i]-x[(i+1)%n])), \r\n max(x[i]-x[0], x[n-1]-x[i]))\r\n \r\n", "n = int(input())\r\ncities = list(map(int, input().split()))\r\nm = sorted(cities)\r\nd = dict()\r\nfor i in range(len(m)-1):\r\n d[m[i]] = [min(abs(m[i] - m[i-1]), abs(m[i] - m[i+1])), max(abs(m[i] - m[-1]), abs(m[i] - m[0]))]\r\n\r\nd[m[-1]] = [min(abs(m[-1] - m[-2]), abs(m[-1] - m[0])), abs(m[-1] - m[0])]\r\n\r\nfor i in cities:\r\n print(*d[i])\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\n\r\nfor i in range(len(l)-1):\r\n maxi=max(abs(l[i]-l[-1]),abs(l[i]-l[0]))\r\n mini=min(abs(l[i]-l[i+1]),abs(l[i]-l[i-1]))\r\n\r\n print(mini,maxi)\r\n maxi=0\r\n mini=0\r\n\r\nmaxi=max(abs(l[-1]-l[0]),abs(l[-1]-l[0]))\r\nmini=min(abs(l[-1]-l[-2]),abs(l[-1]-l[0]))\r\n\r\nprint(mini,maxi)\r\n", "n = int(input())\r\nmyList = map(int , input().split())\r\nmyList = list(myList)\r\nfor i in range(0 , n) :\r\n if i == 0 :\r\n min1 = myList[i] - myList[i + 1]\r\n min1 = abs(min1)\r\n max1 = myList[i] - myList[n - 1]\r\n max1 = abs(max1)\r\n print(min1,\" \",max1)\r\n elif i == (n - 1) :\r\n min1 = myList[i] - myList[-2]\r\n min1 = abs(min1)\r\n max1 = myList[i] - myList[0]\r\n max1 = abs(max1)\r\n print(min1,\" \",max1)\r\n else :\r\n min1 = min(abs(myList[i] - myList[i - 1]) ,abs(myList[i] - myList[i + 1]))\r\n min1 = abs(min1)\r\n max1 = max(abs(myList[i] - myList[0]) ,abs(myList[i] - myList[-1]))\r\n max1 = abs(max1)\r\n print(min1,\" \",max1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\na=[]\r\nfor i in range(n):\r\n ma = max(abs(s[i]-s[0]), abs(s[i]-s[n-1]))\r\n if i==0:\r\n mi = s[i+1]-s[i]\r\n elif i==(n-1):\r\n mi = s[i]-s[i-1]\r\n else:\r\n mi = min(abs(s[i]-s[i-1]),abs(s[i]-s[i+1]))\r\n a.append([mi, ma])\r\nfor row in a:\r\n print(*row)", "import sys\r\ninput=sys.stdin.readline\r\nimport math\r\nimport bisect\r\n\r\n\r\nn=int(input())\r\nl=[int(i) for i in input().split(\" \")]\r\nl.sort()\r\na=[0 for i in range(n)]\r\nb=[0 for i in range(n)]\r\nfor i in range(1,n-1):\r\n a[i]=min(l[i+1]-l[i],l[i]-l[i-1])\r\n b[i]=max(l[-1]-l[i],l[i]-l[0])\r\na[0]=l[1]-l[0]\r\nb[0]=l[-1]-l[0]\r\na[-1]=l[-1]-l[-2]\r\nb[-1]=b[0]\r\nfor i in range(n):\r\n print(a[i],b[i])\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\n\r\ncounter = 0\r\nwhile counter < len(nums):\r\n if counter == 0 or counter == len(nums) - 1:\r\n if counter == 0:\r\n print(abs(nums[counter] - nums[counter+1]), abs(nums[counter] - nums[-1]))\r\n else:\r\n print(abs(nums[counter] - nums[counter-1]), abs(nums[counter] - nums[0]))\r\n else:\r\n print(min([abs(nums[counter] - nums[counter+1]), abs(nums[counter] - nums[counter-1])]), end=\" \")\r\n print(max([abs(nums[counter] - nums[0]), abs(nums[counter] - nums[-1])]))\r\n counter += 1", "\n\nn_testcases = int(input())\n\ncities = [int(x) for x in input().split(' ')]\nn = len(cities)\nfor i, city in enumerate(cities):\n # if i == 0:\n # pass\n # elif i == n-1:\n # pass\n max_cost = max(abs(city-cities[0]), abs(city-cities[n-1]))\n li = (i - 1) % n\n ri = (i + 1) % n\n min_cost = min(abs(city-cities[li]), abs(city-cities[ri]) )\n print(min_cost, max_cost)\n\n \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\nfor i in range(N):\r\n if i == N-1:\r\n Mn = abs(A[i]-A[i-1])\r\n else:\r\n Mn = min(abs(A[i]-A[i+1]),abs(A[i]-A[i-1]))\r\n Mx = max(abs(A[i]-A[0]),abs(A[i]-A[len(A)-1]))\r\n print(Mn,Mx)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nfor i in range(n-1):\r\n cost1 = cities[-1] - cities[i]\r\n cost2 = cities[i] - cities[0]\r\n max_cost = cost2 if cost2 > cost1 else cost1\r\n cost1 = abs(cities[i] - cities[i-1])\r\n cost2 = cities[i+1] - cities[i]\r\n min_cost = cost2 if cost2 < cost1 else cost1\r\n print(min_cost, max_cost)\r\nprint(cities[-1] - cities[-2], cities[-1] - cities[0])\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n max_value = max(abs(arr[i] - arr[0]), abs(arr[i] - arr[-1]))\r\n # to get the min value check the next and previous numbers\r\n # handle corner cases\r\n if i == 0:\r\n min_value = abs(arr[0] - arr[1])\r\n elif i == n - 1:\r\n min_value = abs(arr[i] - arr[-2])\r\n else:\r\n min_value = min(abs(arr[i] - arr[i - 1]), abs(arr[i] - arr[i + 1]))\r\n print(str(min_value) + ' ' + str(max_value))\r\n", "n = int(input())\r\ncities = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n lt,rt = i-1,i+1\r\n ltm,rtm = 0,n-1\r\n if (i == 0):\r\n lt = rt\r\n ltm = rtm\r\n elif (i == n-1):\r\n rt = lt\r\n rtm = ltm\r\n\r\n mindist = min(abs(cities[i]-cities[lt]), abs(cities[i]-cities[rt]))\r\n maxdist = max(abs(cities[i]-cities[ltm]), abs(cities[i]-cities[rtm]))\r\n \r\n print(mindist,maxdist)", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\ndef distant(x,y):\r\n return int(((x-y)**2)**0.5)\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n print(distant(x[i],x[i+1]),distant(x[i],x[n-1]))\r\n elif i == n-1:\r\n print(distant(x[i],x[i-1]),distant(x[i],x[0]))\r\n else:\r\n colset = min(distant(x[i],x[i-1]),distant(x[i],x[i+1]))\r\n farest = max(distant(x[i],x[n-1]),distant(x[i],x[0]))\r\n print(colset, farest)", "t = int(input())\r\nsp = list(map(int, input().split()))\r\nminx = [32000] * t\r\nmaxx = [0] * t\r\nminx[0] = sp[1] - sp[0]\r\nmaxx[0] = sp[-1] - sp[0]\r\nminx[-1] = sp[-1] - sp[-2]\r\nmaxx[-1] = sp[-1] - sp[0]\r\nfor i in range(1, t - 1):\r\n minx[i] = min(sp[i] - sp[i - 1], sp[i + 1] - sp[i])\r\n maxx[i] = max(sp[-1] - sp[i], sp[i] - sp[0])\r\nfor i in range(t):\r\n print(minx[i], maxx[i])\r\n", "def line_land_mail():\r\n x = int(input())\r\n y = [int(z) for z in input().split(\" \")]\r\n for i in range(x):\r\n if i == 0:\r\n minmun0 = abs(y[i] - y[i+1])\r\n maxmum0 = max(abs(y[i] - y[0]), abs(y[i] - y[-1]))\r\n if i == x-1:\r\n minmum_end = abs(y[i] - y[-2])\r\n maxmum_end = max(abs(y[i] - y[0]), abs(y[i] - y[-1]))\r\n print(minmum_end, end=\" \")\r\n print(maxmum_end)\r\n else:\r\n minmun_else = min(abs(y[i]-y[(i-1)]), abs(y[i]-y[(i+1)]))\r\n maxmum_else = max(abs(y[i] - y[0]), abs(y[i] - y[-1]))\r\n print(minmun_else, end=\" \")\r\n print(maxmum_else)\r\nline_land_mail()", "n=int(input())\na=[int(x) for x in input().split()]\nmini=a[1]-a[0]\nmaxi=a[-1]-a[0]\nprint(mini,maxi)\nfor i in range(1,n-1):\n d1=a[i]-a[i-1]\n d2=a[i+1]-a[i]\n mini=min(d1,d2)\n m1=a[i]-a[0]\n m2=a[-1]-a[i]\n maxi=max(m1,m2)\n print(mini,maxi)\nmini=a[-1]-a[-2]\nmaxi=a[-1]-a[0]\nprint(mini,maxi)\n \t \t\t\t\t \t\t\t\t\t\t\t \t \t \t \t\t\t\t", "n = int(input())\r\nx = list(map(int ,input().split(' ')))\r\n\r\n\r\nn = len(x)\r\nfor i in range(n):\r\n if i == 0:\r\n mi = abs(x[1] - x[0])\r\n mx = abs(x[n - 1] - x[0])\r\n elif i == n - 1:\r\n mi = abs(x[n - 1] - x[n - 2])\r\n mx = abs(x[n - 1] - x[0])\r\n else:\r\n mi = min(abs(x[i] - x[i-1]),abs(x[i] - x[i+1]))\r\n mx = max(abs(x[i] - x[n - 1]) ,abs(x[i] - x[0]))\r\n\r\n print(mi, mx)\r\n\r\n\r\n", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n mini = float('inf')\r\n maxi = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[n - 1]))\r\n if i > 0:\r\n mini = min(mini, abs(cities[i] - cities[i - 1]))\r\n if i < n - 1:\r\n mini = min(mini, abs(cities[i] - cities[i + 1]))\r\n print(mini, maxi)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nfor i in range(n):\r\n if i==0:\r\n print(arr[1]-arr[0],arr[n-1]-arr[0])\r\n elif i==n-1:\r\n print(arr[n-1]-arr[n-2],arr[n-1]-arr[0])\r\n else:\r\n if arr[i+1]-arr[i]<=arr[i]-arr[i-1]:\r\n print(arr[i+1]-arr[i],end = ' ')\r\n else:\r\n print(arr[i]-arr[i-1],end = ' ')\r\n if arr[n-1]-arr[i]>=arr[i]-arr[0]:\r\n print(arr[n-1]-arr[i])\r\n else:\r\n print(arr[i]-arr[0])", "n = int(input())\r\ncities = list(map(int,input().split(' ')))\r\nfor i in range(len(cities)):\r\n if i == 0:\r\n cost_min = abs(cities[i] - cities[1])\r\n cost_max = abs(cities[i] - cities[-1])\r\n elif i == len(cities)-1:\r\n cost_min = abs(cities[i] - cities[-2])\r\n cost_max = abs(cities[i] - cities[0])\r\n else:\r\n cost_min = min(abs(cities[i] - cities[i-1]), abs(cities[i] - cities[i+1]))\r\n cost_max = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1]))\r\n print(cost_min, cost_max)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=a[0]\r\nj=a[n-1]\r\nprint(a[1]-a[0],a[n-1]-a[0])\r\nfor i in range(1,n-1):\r\n\tk=a[i]\r\n\tx=max(k-m,j-k)\r\n\ty=min(k-a[i-1],a[i+1]-k)\r\n\tprint(y,x)\r\nprint(a[n-1]-a[n-2],a[n-1]-a[0])", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n print(abs(l[i] - l[i+1]),end=\" \")\r\n print(max(abs(l[i] - l[0]),abs(l[i] - l[n-1])))\r\n \r\n elif i == n-1:\r\n print(abs(l[i] - l[i-1]),end=\" \")\r\n print(max(abs(l[i] - l[0]),abs(l[i] - l[n-1])))\r\n \r\n else:\r\n print(min(abs(l[i] - l[i+1]),abs(l[i]-l[i-1])),end=\" \")\r\n print(max(abs(l[i] - l[0]),abs(l[i] - l[n-1])))\r\n", "numero = int(input())\nlista = input()\nlista = lista.split()\nfor a in range(len(lista)):\n lista[a] = int(lista[a])\natual0 = 0\natualF = 0\nfor b in range(len(lista)):\n atual0 = 0\n atualF = 0\n atualc = 10**10\n atuald = 10 ** 10\n max = 0\n min = 0\n c = b + 1\n d = b - 1\n if c < len(lista):\n atualc = lista[b] - lista[c]\n atuald = lista[b] - lista[d]\n if atualc<0:\n atualc = atualc * -1\n \n if atuald<0:\n atuald = atuald * -1\n\n if atualc < atuald:\n min = atualc\n\n else:\n min = atuald\n if b != 0:\n atual0 = lista[b] - lista[0]\n if len(lista) -1 != b:\n atualF = lista[b] - lista[len(lista)-1]\n if atual0<0:\n atual0 = atual0 * -1\n \n if atualF<0:\n atualF = atualF * -1\n \n if atual0 < atualF:\n max = atualF\n\n else:\n max = atual0\n\n x = str(min) + \" \" + str(max) \n print(x)\n\t \t\t\t\t\t \t\t \t\t\t \t\t \t \t\t\t \t", "n = int(input())\nlineland = list(map(int, input().split()))\n\nfor i in range(n):\n if i == 0:\n print(lineland[i + 1] - lineland[i], lineland[-1] - lineland[i])\n elif i == n - 1:\n print(lineland[-1] - lineland[-2], lineland[-1] - lineland[0])\n else:\n print(min(lineland[i] - lineland[i - 1], lineland[i + 1] - lineland[i]),\n max(lineland[-1] - lineland[i], lineland[i] - lineland[0]))\n \t \t \t \t \t\t \t \t \t\t", "n = int(input())\r\npos = list(map(int, input().split()))\r\n\r\nresult = []\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n minx = abs(pos[0]-pos[1])\r\n maxx = abs(pos[0]-pos[-1])\r\n elif i == n-1:\r\n minx = abs(pos[-1]-pos[-2])\r\n maxx = abs(pos[-1]-pos[0])\r\n else:\r\n minx = min(abs(pos[i] - pos[i + 1]), abs(pos[i] - pos[i - 1]))\r\n maxx = max(abs(pos[i] - pos[0]), abs(pos[i] - pos[-1]))\r\n\r\n result.append(str(minx) + \" \" + str(maxx))\r\n\r\nprint(\"\\n\".join(result))", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nfor i in range(len(l)):\r\n if i==0:\r\n minimum=abs(l[i]-l[i+1])\r\n elif i==len(l)-1:\r\n minimum=abs(l[i]-l[i-1])\r\n else:\r\n minimum=min(abs(l[i]-l[i-1]),abs(l[i]-l[i+1]))\r\n maximum=max(abs(l[i]-l[0]),abs(l[i]-l[-1]))\r\n print(minimum,maximum)", "cidades = int(input())\ncoordenadas = list(map(int, input().split()))\n\nfor i in range(cidades):\n limiteInferior = abs((coordenadas[i - 1] if i - 1 >= 0 else float('inf')) - coordenadas[i])\n limiteSuperior = abs((coordenadas[i + 1] if i + 1 < cidades else float('inf')) - coordenadas[i])\n minimo = min(limiteSuperior,limiteInferior)\n limiteInferior = abs(coordenadas[0] - coordenadas[i])\n limiteSuperior = abs(coordenadas[i] - coordenadas[cidades-1])\n print(f'{minimo} {max(limiteInferior, limiteSuperior)}')\n\n\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\n\r\ny = []\r\n\r\n# for i in range(len(x)):\r\n# if i == 0:\r\n# y.append(0)\r\n# else:\r\n# y.append(x[i] - x[0])\r\n#\r\n# for i in range(len(y)):\r\n# if i != 0 and i != len(y) - 1:\r\n# after = max(y[i+1:]) - y[i]\r\n# before = y[i] - min(y[:i])\r\n# maximum = max(after, before)\r\n#\r\n# minimum = min((y[i+1] - y[i]), (y[i] - y[i-1]))\r\n# print(f\"{minimum} {maximum}\")\r\n#\r\n# else:\r\n# if i == 0: print(f'{y[i + 1]} {y[-1]}')\r\n# else: print(f'{y[i] - y[i-1]} {y[i]}')\r\nmini = abs(x[0] - x[1])\r\nmaxi = abs(x[0] - x[-1])\r\nprint(mini, maxi)\r\n\r\nfor i in range(1, n - 1):\r\n y_min = []\r\n y_max = []\r\n y_min.append(abs(x[i] - x[i + 1]))\r\n y_min.append(abs(x[i] - x[i - 1]))\r\n\r\n y_max.append(abs(x[i] - x[-1]))\r\n y_max.append(abs(x[i] - x[0]))\r\n\r\n print(min(y_min), max(y_max))\r\n\r\nmini_2 = abs(x[-2] - x[-1])\r\nmaxi_2 = abs(x[-1] - x[0])\r\nprint(mini_2, maxi_2)", "# https://codeforces.com/problemset/problem/567/A\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n dist = []\r\n if i != 0:\r\n dist.append(abs(x[i] - x[i - 1]))\r\n dist.append(abs(x[i] - x[0]))\r\n if i < n - 1:\r\n dist.append(abs(x[i] - x[i + 1]))\r\n dist.append(abs(x[i] - x[n - 1]))\r\n \r\n print(min(dist), max(dist))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nma = max(a)\r\nmi = min(a)\r\nfor i in range(n):\r\n elem_max = max(abs(a[i]-ma),abs(a[i]-mi))\r\n if i == 0:\r\n elem_min = abs(a[i]-a[i+1])\r\n print(elem_min, elem_max)\r\n continue\r\n if i == n-1:\r\n elem_min = abs(a[i]-a[i-1])\r\n print(elem_min, elem_max)\r\n continue\r\n elem_min = min(abs(a[i]-a[i-1]), abs(a[i]-a[i+1]))\r\n print(elem_min, elem_max)\r\n\r\n ", "s=int(input())\r\nb=list(map(int,input().split()))\r\nv=[]\r\nm=0\r\nfor i in range(s):\r\n v=[]\r\n m=0\r\n ma=0\r\n if b[0]==b[i]:\r\n v+=[b[i+1]-b[0]]\r\n v+=[b[-1]-b[0]]\r\n elif b[-1]==b[i]:\r\n v+=[b[-1]-b[i-1]]\r\n v+=[b[-1]-b[0]]\r\n else:\r\n m=b[i]-b[i-1]\r\n ma=b[i+1]-b[i]\r\n if ma>=m:\r\n v+=[m]\r\n else:\r\n v+=[ma]\r\n if b[-1]-b[i]>b[i]-b[0]:\r\n v+=[b[-1]-b[i]]\r\n else:\r\n v+=[b[i]-b[0]]\r\n print(*v)\r\n", "def lineland(n):\r\n cities = [int(city) for city in input().split()]\r\n lmc, rmc = cities[0], cities[len(cities) - 1]\r\n for _ in range(n):\r\n max_cost = max(abs(lmc - cities[_]), abs(rmc - cities[_]))\r\n try:\r\n min_cost = min(abs(cities[_ - 1] - cities[_]), abs(cities[_ + 1] - cities[_]))\r\n except:\r\n if _ == 0: min_cost = abs(cities[_ + 1] - cities[_])\r\n else: min_cost = abs(cities[_ - 1] - cities[_])\r\n print(min_cost, max_cost)\r\n\r\ndef main():\r\n n = int(input())\r\n lineland(n)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "quantidade_cidades = int(input())\n\ncidades = list(map(int, input().split()))\ncidade_min = cidades[0]\ncidade_max = cidades[-1]\n\nretorno = []\n\nfor i in range(len(cidades)):\n if i == len(cidades) - 1:\n print(abs(cidades[-2]- cidades[i]), abs(cidades[0] - cidades[i]))\n continue\n\n minimo = abs(cidades[i+1]-cidades[i]) if abs(cidades[i-1]-cidades[i]) > abs(cidades[i+1]-cidades[i]) else abs(cidades[i-1]-cidades[i])\n maximo = abs(cidades[0] - cidades[i]) if abs(cidades[0] - cidades[i]) > abs(cidades[-1] - cidades[i]) else abs(cidades[-1] - cidades[i])\n\n print(minimo, maximo)\n\n\n\n\n \t \t \t \t\t\t\t \t \t\t\t \t\t\t\t\t\t\t", "x=int(input())\r\nmn=0\r\nmx=0\r\nl=list(map(int,input().split()))\r\nfor i in range(0,x):\r\n if i==0:\r\n mx=l[x-1]-l[i]\r\n mn=l[1]-l[0]\r\n elif i==x-1:\r\n mx=l[i]-l[0]\r\n mn=l[i]-l[i-1]\r\n else:\r\n mx=max((l[x-1]-l[i]),(l[i]-l[0]))\r\n mn=min(l[i+1]-l[i],l[i]-l[i-1])\r\n print(mn,'',mx)", "n = int(input())\r\nx = list(map(int , input().split()))\r\nfor i in range(n):\r\n print(min(abs(x[i]-x[i-1]), abs(x[(i+1)%n]-x[i])), max(x[-1]-x[i], x[i]-x[0]))", "def LinelandMail(n):\r\n numbers = list(map(int, input().split()))\r\n for i in range(n):\r\n if i>0 and i<n-1:\r\n minimum = min(abs(numbers[i] - numbers[i - 1]), abs(numbers[i] - numbers[i + 1]))\r\n maximum = max(abs(numbers[i] - numbers[0]), abs(numbers[i] - numbers[n - 1]))\r\n elif i==0:\r\n minimum=abs(numbers[i]-numbers[i+1])\r\n maximum=abs(numbers[i]-numbers[n-1])\r\n else:\r\n minimum=abs(numbers[i]-numbers[i-1])\r\n maximum=abs(numbers[i]-numbers[0])\r\n print(f\"{minimum} {maximum}\")\r\n \r\nno = int(input())\r\nLinelandMail(no)", "x= int(input())\r\n\r\nres=list(map(int,input().split()))\r\n#res2=list(map(int,res2))\r\n\r\nfor i in range(x):\r\n if(i and i<x-1):\r\n print(min(abs(res[i]-res[i-1]),abs(res[i+1]-res[i])),max(abs(res[i]-res[0]),abs(res[-1]-res[i])))\r\n else:\r\n if(i):\r\n print(abs(res[i]-res[i-1]),abs(res[i]-res[0]))\r\n else:\r\n print(abs(res[i]-res[i+1]),abs(res[-1]-res[i]))", "ncidades = int(input())\ncidades = list(map(int,input().split()))\n\nfor cid in range(ncidades):\n\tif cid == 0:\n\t\tmini = abs(cidades[0] - cidades[1])\n\t\tmaxi = abs(cidades[0] - cidades[ncidades - 1])\n\telif cid + 1 == ncidades:\n\t\tmini = abs(cidades[ncidades - 1] - cidades[ncidades - 2])\n\t\tmaxi = abs(cidades[0] - cidades[ncidades - 1])\n\telse:\n\t\tx = abs(cidades[cid] - cidades[cid + 1])\n\t\ty = abs(cidades[cid] - cidades[cid - 1])\n\t\tmini = min(x,y)\n\t\tx = abs(cidades[cid] - cidades[0])\n\t\ty = abs(cidades[cid] - cidades[ncidades - 1])\n\t\tmaxi = max(x,y)\n\tprint(f'{mini} {maxi}')\n\t\t\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 = list(map(int, input().split()))\r\nfor i in range(n):\r\n if (i+1) == n:\r\n ans1 = (x[i]-x[i-1])\r\n else:\r\n ans1 = min(abs(x[i]-x[i-1]), (x[i+1]-x[i]))\r\n ans2 = max(x[i]-x[0], x[-1]-x[i])\r\n print(ans1, ans2)\r\n", "#_____________32____________#\r\n# p,r=map(int,input().split())\r\n# for i in range(1,11):\r\n# if (i*p)%10==r or (i*p)%10==0:\r\n# print(i)\r\n# exit()\r\n\r\n#_____________33____________#\r\n# li=set(input().split())\r\n# print(4-len(li))\r\n\r\n#_____________34____________#\r\n# s=input()\r\n# t=input()\r\n# i=0\r\n# for c in t:\r\n# if c==s[i]:\r\n# i+=1\r\n# print(i+1)\r\n\r\n#_____________36____________#\r\n# n=int(input())\r\n# wires=[int(x) for x in input().split()]\r\n# tries=int(input())\r\n# for Try in range(tries):\r\n# i,j=map(int,input().split())\r\n# if i>1:\r\n# wires[i-2]+=j-1\r\n# if i<n:\r\n# wires[i]+=wires[i-1]-j\r\n# wires[i-1]=0\r\n# for i in wires:\r\n# print(i)\r\n\r\n#_____________36____________#\r\n# n,b,d=map(int,input().split())\r\n# li=[int(x) for x in input().split()]\r\n# trash=0\r\n# count=0\r\n# for o in li:\r\n# if o>b:\r\n# continue\r\n# trash+=o\r\n# if trash>d:\r\n# count+=1\r\n# trash=0\r\n# print(count)\r\n\r\n#_____________43____________#\r\n# n=int(input())\r\n# li=input().split()\r\n# maths=[]\r\n# pe=[]\r\n# prog=[]\r\n\r\n# for i in range(n):\r\n# if li[i]=='1':\r\n# prog.append(i+1)\r\n# elif li[i]=='2':\r\n# maths.append(i+1)\r\n# else:\r\n# pe.append(i+1)\r\n# if len(maths)==0 or len(prog)==0 or len(pe)==0:\r\n# print(0)\r\n# exit()\r\n# print(min(len(maths),len(prog),len(pe)))\r\n# for a,b,c in zip(prog,maths,pe):\r\n# print(a,b,c)\r\n\r\n#_____________43____________#\r\n# import string,random\r\n# n,k=map(int,input().split())\r\n# li='abcdefghijklmnopqrstuvwxyz'\r\n# word=''\r\n# word+=li[0:k]\r\n# while len(word)<n:\r\n# ch=random.choice(word)\r\n# if word[-1] != ch:\r\n# word+=ch\r\n# print(word)\r\n\r\n#_____________49____________#\r\n# import math\r\n# while True:\r\n# n=int(input())\r\n# switch=0\r\n# if n==0: exit()\r\n# root=int(math.sqrt(n))\r\n# if root*root==n:\r\n# print('yes')\r\n# else:\r\n# print('no')\r\n\r\n#_____________50____________#\r\n# while True:\r\n# try:\r\n# x=int(input())\r\n# except :\r\n# break\r\n# y=int(input())\r\n# print(x*y)\r\n\r\n#_____________51____________#\r\n# def generator(step,mod):\r\n# li=[0]\r\n# seed=0\r\n# while True:\r\n# seed=(seed+step)%mod\r\n# if seed==0:\r\n# break\r\n# li.append(seed)\r\n# return li\r\n\r\n# while True:\r\n# try:\r\n# step,mod=map(int,input().split())\r\n# except :\r\n# break\r\n# pattern=generator(step,mod)\r\n# if len(pattern)==mod:\r\n# print(f'{step:>10d}{mod:>10d} Good Choice') \r\n# else:\r\n# print(f'{step:>10d}{mod:>10d} Bad Choice')\r\n\r\n#_____________52____________#\r\n# while True:\r\n# x,y,c=map(int,input().split())\r\n# if x==0: break\r\n# if x==y==8:\r\n# print(c)\r\n# else:\r\n# count=(x-7)*(y-7)\r\n# if count%2!=0 and c==1:\r\n# print((count+1)//2)\r\n# else:\r\n# print(count//2)\r\n\r\n#_____________56____________#\r\nn=int(input())\r\nli=[int(x) for x in input().split()]\r\nfor i in range(n):\r\n furthest=max(abs(li[i]-li[0]),abs(li[-1]-li[i]))\r\n if i==0:\r\n closest=li[i+1]-li[i]\r\n elif i==n-1:\r\n closest=li[i]-li[-2]\r\n else:\r\n closest=min(abs(li[i+1]-li[i]),abs(li[i]-li[i-1]))\r\n print(closest,furthest)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nabn = a[-1]\r\na0 = a[0]\r\n\r\nret =[[a[1] - a0, abn - a[0]]]\r\n\r\nfor i in range(1, n - 1):\r\n mn = min(a[i + 1] - a[i], a[i] - a[i - 1])\r\n mx = max(abn - a[i], a[i] - a0)\r\n ret.append([mn, mx])\r\n\r\nret.append([abn - a[-2], abn - a0])\r\n\r\nprint(\"\\n\".join(map(lambda v: str(v[0]) + ' ' + str(v[1]), ret)))", "# from sys import stdin, stdout\r\n# import math\r\n# import re\r\n# import itertools\r\n# import collections\r\n# import statistics\r\n# import calendar\r\n# import datetime\r\n# import operator\r\n# import cProfile\r\n# import pstats\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nk = min(arr)\r\nif k < 0:\r\n d = abs(k)\r\nelse:\r\n d = -k\r\n\r\narr = list(map(lambda x: x + d, arr))\r\n\r\nprint(arr[1], arr[-1])\r\nfor i in range(1, n-1):\r\n print(min(arr[i]-arr[i-1], arr[i+1]-arr[i]), max(arr[i], arr[-1]-arr[i])) \r\nprint(arr[-1] - arr[-2], arr[-1])\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nprint(abs(arr[0]-arr[1]),abs(arr[0]-arr[-1]))\r\nfor i in range(1,len(arr)-1):\r\n min_cost = min(abs(arr[i]-arr[i-1]),abs(arr[i]-arr[i+1]))\r\n max_cost = max(abs(arr[i]-arr[0]),abs(arr[i]-arr[-1]))\r\n print(min_cost,max_cost)\r\nprint(abs(arr[-1] - arr[-2]),abs(arr[-1] - arr[0]))\r\n", "def calculate_costs(n, cities):\r\n min_costs = []\r\n max_costs = []\r\n\r\n for i in range(n):\r\n if i == 0:\r\n min_cost = abs(cities[i] - cities[i + 1])\r\n max_cost = abs(cities[i] - cities[-1])\r\n elif i == n - 1:\r\n min_cost = abs(cities[i] - cities[i - 1])\r\n max_cost = abs(cities[i] - cities[0])\r\n else:\r\n min_cost = min(abs(cities[i] - cities[i - 1]), abs(cities[i] - cities[i + 1]))\r\n max_cost = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1]))\r\n\r\n min_costs.append(min_cost)\r\n max_costs.append(max_cost)\r\n\r\n return min_costs, max_costs\r\n\r\nn = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nmin_costs, max_costs = calculate_costs(n, cities)\r\n\r\nfor i in range(n):\r\n print(min_costs[i], max_costs[i])\r\n", "n = int(input())\r\ncity = list(map(int,input().split()))\r\nmin1 = city[1] - city[0]\r\nmax1 = city[-1] - city[0]\r\nprint(min1,max1)\r\nfor x in range(1,n-1):\r\n minx = min(city[x]-city[x-1],city[x+1]-city[x])\r\n maxx = max(city[x]-city[0],city[-1]-city[x])\r\n print(minx,maxx)\r\nmin2 = city[-1] - city[-2]\r\nprint(min2,max1)", "\"\"\"INPUT TEMPLATE - I copy paste this part to the top of every solution\"\"\"\nimport sys\n\ntoks = (tok for tok in sys.stdin.read().split())\n\"\"\"END OF TEMPLATE\"\"\"\n\n# The first token is N, number of cities in Lineland\nN = int(next(toks))\n\n# Then, let's make an array for all the positions of the cities:\nxs = []\nfor i in range(N):\n x_i = int(next(toks))\n xs.append(x_i)\n\n# Now, we need to loop through all cities again\n# to figure out the closest/farthest city from each city:\nfor i in range(N):\n if i == 0:\n # For the first city,\n # since the cities are in order of increasing x-value,\n # the closest city is the second city\n # and the farthest city is the last city:\n print(xs[1]-xs[0], xs[N-1]-xs[0])\n elif i == N-1:\n # For the last city,\n # the closest city is the second-to-last city\n # and the farthest city is the first city\n print(xs[N-1]-xs[N-2], xs[N-1]-xs[0])\n else:\n # For a city in the middle,\n # the closest city will either be directly to its left or to its right:\n dist_to_city_on_left = xs[i]-xs[i-1]\n dist_to_city_on_right = xs[i+1]-xs[i]\n closest_dist = min(dist_to_city_on_left, dist_to_city_on_right)\n\n # And for a city in the middle,\n # the farthest city will either be the first city\n # or the last city\n # because those are the two cities which have the most extreme x-positions\n dist_from_first_city = xs[i]-xs[0]\n dist_from_last_city = xs[N-1]-xs[i]\n farthest_dist = max(dist_from_first_city, dist_from_last_city)\n\n print(closest_dist, farthest_dist)\n\n\t\t \t \t\t\t\t \t\t\t \t\t \t \t \t", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nfor i in range(0,n):\r\n mn,mx=1e18,-1e18\r\n if i:\r\n mn=min(mn,arr[i]-arr[i-1])\r\n if i+1<n:\r\n mn = min(mn, -arr[i] + arr[i + 1])\r\n mx = max(arr[i]-arr[0], -arr[i] + arr[n-1])\r\n print(mn,mx)\r\n\r\n", "\r\nn = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\nfor i in range(n) :\r\n \r\n if i==0 :\r\n \r\n mini = abs(a[i]-a[i+1])\r\n maxi = abs(a[i]-a[n-1])\r\n \r\n elif i==n-1 :\r\n \r\n mini = abs(a[i]-a[i-1])\r\n \r\n maxi = abs(a[i]-a[0])\r\n \r\n else :\r\n \r\n mini = min(abs(a[i]-a[i+1]),abs(a[i]-a[i-1]))\r\n \r\n maxi = max(abs(a[i]-a[0]),abs(a[i]-a[n-1]))\r\n \r\n print(mini,maxi)", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nminDistance = abs(l[0] - l[1]) \r\nmaxDistance = abs(l[0] - l[-1])\r\nprint(minDistance, maxDistance)\r\n\r\nfor i in range(1, len(l) -1):\r\n minDistance = min( abs(l[i] - l[i-1]), abs(l[i] - l[i+1]))\r\n maxDistance = max( abs(l[i] - l[0]), abs(l[i] - l[-1]))\r\n print(minDistance, maxDistance)\r\n\r\n\r\nminDistance = abs(l[-1] - l[-2])\r\nmaxDistance = abs(l[-1] - l[0])\r\nprint(minDistance, maxDistance)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nnini=0\r\nmaxi=0\r\nprint(b[1]-b[0],b[a-1]-b[0])\r\nfor i in range(1,a-1):\r\n if abs(b[0]-b[i])>=abs(b[-1]-b[i]):\r\n maxi=abs(b[0]-b[i])\r\n else:\r\n maxi=abs(b[-1]-b[i])\r\n if abs(b[i-1]-b[i])<=abs(b[i+1]-b[i]):\r\n mini=abs(b[i-1]-b[i])\r\n else:\r\n mini=abs(b[i+1]-b[i])\r\n print(mini,maxi)\r\nprint(b[a-1]-b[a-2],b[a-1]-b[0]) \r\n", "inp = int(input())\r\nls = list(map(int, input().split()))\r\nfor i in range(inp):\r\n if i != 0 and i != inp-1:\r\n Mx = max(abs(ls[0]-ls[i]), abs(ls[i]-ls[inp-1]))\r\n Mn = min(abs(ls[i-1]-ls[i]), abs(ls[i]-ls[i+1]))\r\n else:\r\n Mx = abs(ls[0] - ls[inp - 1])\r\n if i == 0:\r\n Mn = abs(ls[0] - ls[1])\r\n else:\r\n Mn = abs(ls[inp-1]-ls[inp-2])\r\n print(Mn, Mx)\r\n", "a = int(input())\r\nl = list(map(int, input().split()))\r\nfor elem in range(a):\r\n if elem == 0:\r\n print(abs(l[0] - l[1]), abs(l[0] - l[-1]))\r\n elif elem == a - 1:\r\n print(abs(l[-1] - l[-2]), abs(l[-1] - l[0]))\r\n else:\r\n cur = l[elem]\r\n prev = l[elem - 1]\r\n nxt = l[elem + 1]\r\n first = l[0]\r\n last = l[-1]\r\n if abs(cur - prev) > abs(nxt - cur):\r\n print(abs(nxt - cur), end=\" \")\r\n else:\r\n print(abs(cur - prev), end=\" \")\r\n if abs(cur - first) > abs(cur - last):\r\n print(abs(cur - first))\r\n else:\r\n print(abs(cur - last))", "num_cities = int(input())\r\n\r\ncoordinates = list(map(int, input().split()))\r\n\r\nfor i in range(num_cities):\r\n print(min(abs(coordinates[i] - coordinates[i - 1]), abs(coordinates[i - num_cities + 1] - coordinates[i])), max(coordinates[i] - coordinates[0], coordinates[-1] - coordinates[i]))\r\n", "n = int(input())\r\npoints = [int(i) for i in input().split()]\r\n\r\nfor i, v in enumerate(points):\r\n if i == 0:\r\n print(abs(v - points[i+1]), abs(v - points[-1]))\r\n elif i == len(points) - 1:\r\n print(abs(v - points[i-1]), abs(v - points[0]))\r\n else:\r\n if abs(v - points[i+1]) <= abs(v - points[i-1]):\r\n print(abs(v - points[i + 1]), end =' ')\r\n else:\r\n print(abs(v - points[i - 1]), end =' ')\r\n\r\n if abs(v - points[0]) >= abs(v - points[-1]):\r\n print(abs(v - points[0]), end =' ')\r\n else:\r\n print(abs(v - points[-1]), end =' ')\r\n print()", "n = int(input())\r\nd = [int(a) for a in input().split()]\r\nfor i in range(n):\r\n\tn1 = max(abs(d[i] - d[0]), abs(d[i] - d[-1]))\r\n\tif i == 0:\r\n\t\tn2 = abs(d[i] - d[i + 1])\r\n\telif i == n - 1:\r\n\t\tn2 = abs(d[i] - d[i - 1])\r\n\telse:\r\n\t\tn2 = min(abs(d[i] - d[i - 1]), abs(d[i] - d[i + 1]))\r\n\tprint(n2, n1)", "s=int(input())\na=[int(x) for x in input().split()]\nfor i in range(s):\n\tmaxi=0\n\tmini=0\n\tif i==0:\n\t\tmaxi=abs(a[i]-a[s-1])\n\t\tmini=abs(a[i]-a[i+1])\n\telif i==s-1:\n\t\tmini=abs(a[i]-a[i-1])\n\t\tmaxi=abs(a[i]-a[0])\n\telse:\n\t\tmini=min(abs(a[i]-a[i+1]),abs(a[i]-a[i-1]))\n\t\tmaxi=max(abs(a[i]-a[0]),abs(a[i]-a[s-1]))\n\tprint(mini,maxi)\n\t\t\t\t \t \t\t \t \t \t \t \t\t\t \t", "t = int(input())\r\n\r\nn = [int(x) for x in input().split()]\r\n\r\n\r\nprint(abs(n[1] - n[0]), abs(n[-1] - n[0]))\r\nfor index in range(1, t - 1):\r\n if abs(n[index] - n[index - 1]) < abs(n[index+1] - n[index]):\r\n min = abs(n[index] - n[index - 1])\r\n else:\r\n min = abs(n[index+1] - n[index])\r\n\r\n if abs(n[index] - n[0]) > abs(n[-1] - n[index]):\r\n max = abs(n[index] - n[0])\r\n else:\r\n max = abs(n[-1] - n[index])\r\n\r\n print(min, max)\r\nprint(abs(n[-1] - n[-2]), abs(n[-1] - n[0]))", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nfrom math import *\r\nn = int(input())\r\nlst = [int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n max_cost = max(abs(lst[i] - lst[0]),abs(lst[i]- lst[-1]))\r\n if i == 0:\r\n min_cost = abs(lst[i] - lst[i+1])\r\n elif i == n-1:\r\n min_cost = abs(lst[i] - lst[i-1])\r\n else:\r\n min_cost = min(abs(lst[i] - lst[i-1]) , abs(lst[i] - lst[i+1]))\r\n print(min_cost , max_cost)\r\n", "import sys\ninput = sys.stdin.readline\n\nC = int(input())\nA = list(map(int, input().split()))\n\nR = []\nfor i in range(C) :\n\tMIN_COST, MAX_COST = -1, -1\n\tif i == 0 : MIN_COST, MAX_COST = A[i+1]-A[i], A[C-1]-A[i]\n\telif i == C-1 : MIN_COST, MAX_COST = A[i]-A[i-1], A[i]-A[0]\n\telse : MIN_COST, MAX_COST = min(A[i]-A[i-1], A[i+1]-A[i]), max(A[C-1]-A[i], A[i]-A[0])\n\t\n\tR.append(f\"{MIN_COST} {MAX_COST}\")\n\t\nprint(\"\\n\".join(R))", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx = 0\r\nmn = 0\r\nfor i in range(n):\r\n mx = max(abs(a[i]-a[0]), abs(a[i]-a[-1]))\r\n if i == 0:\r\n mn = abs(a[i]-a[i+1])\r\n elif i == (n-1):\r\n mn = abs(a[i]-a[i-1])\r\n else:\r\n mn = min(abs(a[i] - a[i-1]), abs(a[i] - a[i+1]))\r\n \r\n print(mn, mx)", "n = int(input())\r\ncities = list(map(int, input().split(' ')))\r\n\r\nans = []\r\nmin_city_distance = min(cities)\r\nmax_city_distance = max(cities)\r\nans.append([abs(cities[0] - cities[1]), abs(cities[0] - max_city_distance)])\r\nfor i in range(1, len(cities) - 1):\r\n temp = []\r\n min_diff = min(abs(cities[i] - cities[i - 1]), abs(cities[i] - cities[i + 1]))\r\n max_diff = max(abs(cities[i] - max_city_distance), abs(cities[i] - min_city_distance))\r\n temp.append(min_diff)\r\n temp.append(max_diff)\r\n ans.append(temp)\r\nans.append([abs(cities[-1] - cities[-2]), abs(cities[-1] - min_city_distance)])\r\n\r\nfor city_send_letter_cost in ans:\r\n print(\"{} {}\".format(min(city_send_letter_cost), max(city_send_letter_cost)))\r\n", "n=int(input())\r\n\r\nlst=list(map(int,input().split()))\r\n\r\nlist3=[]\r\nfor i in range(n):\r\n lst1=[]\r\n if i==0:\r\n lst1.append(abs(lst[1]-lst[0]))\r\n lst1.append(abs(lst[n-1]-lst[0]))\r\n elif i==n-1:\r\n lst1.append(abs(lst[n-1] - lst[n-2]))\r\n lst1.append(abs(lst[n - 1] - lst[0]))\r\n else:\r\n if abs(lst[i]-lst[i+1])>=abs(lst[i]-lst[i-1]):\r\n lst1.append(abs(lst[i]-lst[i-1]))\r\n if abs(lst[i]-lst[n-1])>=abs(lst[i]-lst[0]):\r\n lst1.append(abs(lst[i]-lst[n-1]))\r\n else:\r\n lst1.append(abs(lst[i]-lst[0]))\r\n else:\r\n lst1.append(abs(lst[i]-lst[i+1]))\r\n if abs(lst[i]-lst[n-1])>=abs(lst[i]-lst[0]):\r\n lst1.append(abs(lst[i]-lst[n-1]))\r\n else:\r\n lst1.append(abs(lst[i]-lst[0]))\r\n list3.append(lst1)\r\nfor i in range(n):\r\n print(list3[i][0],list3[i][1])", "import sys\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nn=int(input())\r\nl=list(map(int, input().split()))\r\n\r\nfor i in range(len(l)):\r\n\r\n \r\n if i == 0:\r\n minimum = l[1] - l[0]\r\n maximum = l[len(l) - 1] - l[0]\r\n l1=[minimum, maximum]\r\n print(\" \".join(map(str, l1)))\r\n elif i == len(l) - 1:\r\n minimum = l[len(l)-1] - l[len(l)-2]\r\n maximum = l[len(l) - 1] - l[0]\r\n l1=[minimum, maximum]\r\n print(\" \".join(map(str, l1)))\r\n else:\r\n minimum = min((l[i+1]-l[i]), (l[i]-l[i-1]))\r\n maximum = max((l[i]-l[0]), (l[len(l)-1]-l[i]))\r\n l1=[minimum, maximum]\r\n print(\" \".join(map(str, l1)))\r\n \r\n", "n = int(input())\r\nar = tuple(map(int,input().split()))\r\ni = 0\r\nwhile i<n:\r\n if i == 0:\r\n print(abs(ar[i]-ar[i+1]),abs(ar[i]-ar[n-1]))\r\n elif i == n-1:\r\n print(abs(ar[i]-ar[i-1]),abs(ar[i]-ar[0]))\r\n else:print(min(abs(ar[i]-ar[i-1]) , abs(ar[i]-ar[i+1])) , max(abs(ar[i]-ar[0]),abs(ar[i]-ar[n-1])))\r\n i+=1", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ninf = 3 * pow(10, 9) + 1\r\nx = [-inf] + list(map(int, input().split())) + [inf]\r\nans = []\r\nfor i in range(1, n + 1):\r\n mi = min(x[i] - x[i - 1], x[i + 1] - x[i])\r\n ma = max(x[i] - x[1], x[n] - x[i])\r\n ans.append(\" \".join(map(str, (mi, ma))))\r\nsys.stdout.write(\"\\n\".join(ans))", "def code(l):\r\n if len(l) == 2:\r\n res = l[1] - l[0]\r\n if res < 0:\r\n res = 0 - res\r\n print_values(res, res)\r\n print_values(res, res)\r\n return\r\n max_v = l[-1] - l[0]\r\n min_v = l[0] - l[1]\r\n print_values(max_v, min_v)\r\n for i in range(1, len(l) - 1):\r\n max_v = max(l[-1] - l[i], l[i] - l[0])\r\n min_v = min(l[i + 1] - l[i], l[i] - l[i - 1])\r\n print_values(max_v, min_v)\r\n max_v = l[-1] - l[0]\r\n min_v = l[-1] - l[-2]\r\n print_values(max_v, min_v)\r\n\r\n\r\ndef print_values(max_v, min_v):\r\n if max_v < 0:\r\n max_v = 0 - max_v\r\n if min_v < 0:\r\n min_v = 0 - min_v\r\n print(f\"{min_v} {max_v}\")\r\n\r\n\r\ndef main():\r\n input()\r\n l = list(map(int, input().split()))\r\n code(l)\r\n\r\n\r\nmain()", "def cal(k,l):\r\n a=[]\r\n if (k<0 and l>0) or (k>0 and l<0):\r\n b=abs(l+(-k))\r\n return b\r\n else:\r\n b=abs(l-k)\r\n return b\r\n \r\n\r\n\r\n\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nl=[]\r\nb=(a[0]+a[n-1])/2\r\nfor i in range(n-1):\r\n if a[i]>=b:\r\n l.append(cal(a[i],a[i+1]))\r\n l.append(cal(a[i],a[i-1]))\r\n l.append(cal(a[i],a[0]))\r\n print(min(l), max(l))\r\n l=[]\r\n else:\r\n l.append(cal(a[i],a[i+1]))\r\n l.append(cal(a[i],a[i-1]))\r\n l.append(cal(a[i],a[n-1]))\r\n print(min(l), max(l))\r\n l=[]\r\nprint(cal(a[n-1], a[n-2]), cal(a[n-1], a[0]))", "d = {}\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\n\r\nfor i in range(0, n):\r\n if i == 0:\r\n print(abs(arr[i] - arr[i+1]), abs(arr[i] - arr[n-1]))\r\n elif i == n-1:\r\n print(abs(arr[i] - arr[i-1]), abs(arr[i] - arr[0]))\r\n else:\r\n print(min(abs(arr[i] - arr[i-1]), abs(arr[i+1] - arr[i])), max(abs(arr[n-1] - arr[i]), abs(arr[0] - arr[i])))\r\n\r\n\r\n\r\nfor k, v in sorted(d.items()):\r\n print(*v)", "cities = int(input().strip())\n\ndistances = str(input().strip())\ndistances = distances.split()\n\ndistances = [int(x) for x in distances]\n\nfor city in range(cities):\n if city == 0:\n min_i = abs(distances[city] - distances[city + 1])\n max_i = abs(distances[city] - distances[cities -1])\n \n print(min_i, ' ', max_i)\n elif city == (cities -1):\n min_i = abs(distances[city] - distances[city - 1])\n max_i = abs(distances[city] - distances[0])\n \n print(min_i, ' ', max_i)\n else: \n min_i = min(abs(distances[city - 1] - distances[city]), abs(distances[city] - distances[city + 1]))\n max_i = max(abs(distances[0] - distances[city]), abs(distances[city] - distances[cities -1]))\n \n print(min_i, ' ', max_i)\n\t \t \t \t \t \t \t \t \t", "q = input()\r\nx = input()\r\nx = x.split(' ')\r\narr = []\r\nfor i in x :\r\n arr.append(int(i))\r\narr2 = []\r\nfor i in range(len(arr) ) :\r\n if i == 0 :\r\n min = abs(arr[i] - arr[i+1])\r\n max = abs(arr[i] - arr[-1])\r\n elif i == (len(arr)) - 1 :\r\n min = abs(arr[i] - arr[i-1])\r\n max = abs(arr[i] - arr[0])\r\n else :\r\n min1 = abs(arr[i] - arr[i+1])\r\n min2 = abs(arr[i] - arr[i-1])\r\n if min1 > min2 :\r\n min = min2\r\n else :\r\n min = min1\r\n max1 = abs(arr[i] - arr[-1])\r\n max2 = abs(arr[i] - arr[0])\r\n if max1 > max2 :\r\n max = max1\r\n else :\r\n max = max2\r\n string = str(min) + ' ' + str(max)\r\n arr2.append(string)\r\nfor i in arr2 :\r\n print(i)\r\n", "number_of_cities = int(input())\ncoordinates = list(map(int, input().split()))\n\nmini = coordinates[1] - coordinates[0]\nmaxi = coordinates[-1] - coordinates[0]\nprint(mini, maxi)\nmini_right = mini\nmax_right = maxi\nmax_left = 0\n\nfor i in range(1, number_of_cities - 1):\n mini_left = mini_right\n max_left += mini_left\n max_right -= mini_left\n mini_right = coordinates[i + 1] - coordinates[i]\n print(min(mini_left, mini_right), max(max_left, max_right))\n \nprint(mini_right, maxi)\n\n \t\t\t \t \t \t \t \t\t \t\t\t \t \t \t\t\t", "input()\r\nx=[int(i) for i in input().split()]\r\nprint(x[1]-x[0],x[-1]-x[0])\r\nfor i in range(1,len(x)-1):\r\n print(min(x[i]-x[i-1],x[i+1]-x[i]),max(x[i]-x[0],x[-1]-x[i]))\r\nprint(x[-1]-x[-2],x[-1]-x[0])", "n = int(input())\r\nx = list(map(int,input().split()))\r\nfor i in range(n):\r\n t = x[i]\r\n print(min(abs(t - x[i - 1]), abs(x[i - n + 1] - t)), max(t - x[0], x[n - 1] - t))", "n = input()\nnums = results = list(map(int, input().split(\" \")))\n\ndef get_min(arr, index):\n if index==0: return abs(arr[index] - arr[1])\n if index==len(arr)-1: return abs(arr[index] -arr[len(arr)-2])\n left = abs(arr[index] - arr[index-1])\n right = abs(arr[index] - arr[index+1])\n if left < right: return left \n else: return right\n\ndef get_max(arr, index):\n if index==0: return abs(arr[index] - arr[len(arr)-1])\n if index==len(arr)-1: return abs(arr[index] -arr[0])\n\n left = abs(arr[index] - arr[0])\n right = abs(arr[index] - arr[len(arr)-1])\n if left > right: return left \n else: return right\n\nfor i in range(len(nums)):\n min = get_min(nums, i)\n print(get_min(nums, i), get_max(nums, i))\n\t \t\t \t \t \t\t\t\t \t\t\t\t\t \t\t\t", "n = int(input())\r\n\r\nd = list(map(int, input().split()))\r\nl = n - 1\r\nfor i in range(n):\r\n if i == 0: # first\r\n print(d[1] - d[0], d[l] - d[0])\r\n elif i == l: # last\r\n print(d[l] - d[l - 1], d[l] - d[0])\r\n else:\r\n min = 0\r\n max = 0\r\n \r\n if d[i + 1] - d[i] < d[i] - d[i - 1]: # min\r\n min = d[i + 1] - d[i]\r\n else :\r\n min = d[i] - d[i - 1]\r\n\r\n if d[i] - d[0] > d[l] - d[i]:\r\n max = d[i] - d[0]\r\n else :\r\n max = d[l] - d[i]\r\n print(min, max)\r\n", "n = int(input())\r\n\r\ncities = list(map(int,input().split()))\r\n\r\nprint(abs(cities[0] - cities[1]),abs(cities[0] - cities[n-1]))\r\nfor i in range(1,n-1):\r\n print(min(abs(cities[i] - cities[i+1]),abs(cities[i] - cities[i-1])), max(abs(cities[i] - cities[0]),abs(cities[i] - cities[n-1])))\r\nprint(abs(cities[n-1]-cities[n-2]),abs(cities[n-1]-cities[0])) \r\n", "x = int(input())\n\nlis = []\nlis = [int(x) for x in input().split()]\n\ni = 0\n\nfor i in range(0,x):\n if(i == 0):\n print(lis[i+1] - lis[i], end = \" \")\n print(lis[x-1] - lis[i])\n elif(i == x-1):\n print(lis[i] - lis[i-1], end = \" \")\n print(lis[i] - lis[0])\n else:\n if(lis[i] - lis[i-1] <= lis[i+1] - lis[i]):\n print(lis[i] - lis[i-1], end = \" \")\n else:\n print(lis[i+1] - lis[i], end = \" \")\n\n if(lis[i] - lis[0] >= lis[x-1] - lis[i]):\n print(lis[i] - lis[0])\n else:\n print(lis[x-1] - lis[i])\n \t \t \t \t \t \t \t \t \t \t \t\t \t \t", "import math\n\n\ndef computeMinDist(x, y):\n minVal = -1\n if x<0 and y<0:\n minVal = abs(x) - abs(y)\n else:\n minVal = y-x\n return minVal\n\n\ndef computeMaxDist(x, y):\n minVal = -1\n if x<0 and y<0:\n minVal = abs(x) - abs(y)\n else:\n minVal = y-x\n return minVal\n\n\nn = int(input())\n# print(n)\ncordinates = list(map(int, input().split()))\n# print(cordinates)\nfor i in range(n):\n minVal = -1\n maxVal = -1\n if i == 0:\n minVal = computeMinDist(cordinates[0], cordinates[1])\n maxVal = computeMaxDist(cordinates[0], cordinates[n-1])\n elif i == n-1:\n minVal = computeMinDist(cordinates[n-2], cordinates[n-1])\n maxVal = computeMaxDist(cordinates[0], cordinates[n - 1])\n else:\n min1 = computeMinDist(cordinates[i-1], cordinates[i])\n min2 = computeMinDist(cordinates[i], cordinates[i+1])\n max1 = computeMaxDist(cordinates[0], cordinates[i])\n max2 = computeMaxDist(cordinates[i], cordinates[n-1])\n minVal = min1 if (min1 < min2) else min2\n maxVal = max1 if (max1 > max2) else max2\n print(minVal, \" \", maxVal)", "num = int(input())\r\ncitys = list(map(int,input().split()))\r\nmnl = list()\r\nmxl = list ()\r\ni = 0\r\n\r\nwhile i < num :\r\n if i == 0:\r\n mnl.append(abs(citys[i] - citys[i+1]))\r\n mxl.append(abs(citys[i] - citys[-1]))\r\n elif i != 0 and i != num -1:\r\n mn = min(abs(citys[i]-citys[i+1]),abs(citys[i]-citys[i-1]))\r\n mnl.append(mn)\r\n mx = max(abs(citys[i]-citys[-1]),abs(citys[i]-citys[0]))\r\n mxl.append(mx)\r\n elif i == num -1 :\r\n mnl.append(abs(citys[i]-citys[i-1]))\r\n mxl.append(abs(citys[i]-citys[0]))\r\n i += 1\r\n\r\nfor i in range (num):\r\n print(mnl[i],mxl[i])", "x = int(input())\nlista = input().split()\nlista2 = [int(i) for i in lista]\n\nfor i in range(len(lista)):\n print(\n min(abs(lista2[i] - lista2[i-1]), abs(lista2[i] - lista2[(i+1) %x])),\n max(abs(lista2[i] - lista2[0]), abs(lista2[i] - lista2[-1]))\n )\n\n \t \t \t\t\t\t\t\t \t\t \t\t \t\t \t\t", "n = int(input())\r\ncities = [int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n minimum = cities[1] - cities[0]\r\n maximum = cities[n - 1] - cities[0]\r\n elif i == n - 1:\r\n minimum = cities[i] - cities[i - 1]\r\n maximum = cities[i] - cities[0]\r\n else:\r\n minimum = min(cities[i] - cities[i - 1], cities[i + 1] - cities[i])\r\n maximum = max(cities[n - 1] - cities[i], cities[i] - cities[0])\r\n\r\n print(abs(minimum), abs(maximum))", "n = int(input())\nx = [int(i) for i in input().split()]\n\nprint(x[1]-x[0], x[-1]-x[0])\nfor i in range(1, n-1):\n\tprint(min(x[i]-x[i-1], x[i+1]-x[i]), max(x[i]-x[0], x[-1]-x[i]))\nprint(x[-1]-x[-2], x[-1]-x[0])\n\n \t\t\t \t\t \t\t \t\t \t\t \t\t \t", "n = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n\tmin_dis = 10e9+1\r\n\tmax_dis = 0\r\n\tif i>0 and i<n-1:\r\n\t\tmin_dis = min(abs(x[i]-x[i-1]), abs(x[i]-x[i+1]))\r\n\t\tmax_dis = max(abs(x[i]-x[0]), abs(x[i]-x[n-1]))\r\n\telse:\r\n\t\tmax_dis = abs(x[0]-x[n-1])\r\n\t\tif i==0:\r\n\t\t\tmin_dis = abs(x[0]-x[1])\r\n\t\telse:\r\n\t\t\tmin_dis = abs(x[n-1]-x[n-2])\r\n\tprint(min_dis,max_dis)", "cities = []\r\nnum_cities = int(input())\r\ncities = list(map(int,input().split(' ')))\r\ni=0\r\nwhile i < num_cities:\r\n if i ==0:\r\n min = abs(cities[i]-cities[i+1])\r\n max = abs(cities[i]-cities[-1])\r\n elif i==num_cities-1:\r\n min = abs(cities[i]-cities[i-1])\r\n max = abs(cities[i]-cities[0])\r\n else:\r\n if abs(cities[i]-cities[i-1])<=abs(cities[i]-cities[i+1]):\r\n min = abs(cities[i]-cities[i-1])\r\n elif abs(cities[i]-cities[i-1])>abs(cities[i]-cities[i+1]):\r\n min = abs(cities[i] - cities[i + 1])\r\n if abs(cities[i]-cities[0])>=abs(cities[i]-cities[-1]):\r\n max = abs(cities[i]-cities[0])\r\n\r\n elif abs(cities[i]-cities[0])<abs(cities[i]-cities[-1]):\r\n max = abs(cities[i]-cities[-1])\r\n print(min,max)\r\n i+=1", "length = int(input())\r\nnumbers = [int(i)for i in input().split()]\r\nminimum = []\r\nmaximum = []\r\nfor pos in range(len(numbers)):\r\n if pos==0:\r\n minimum.append(numbers[pos+1]-numbers[pos])\r\n maximum.append(numbers[-1]-numbers[pos])\r\n elif pos==len(numbers)-1:\r\n minimum.append(numbers[pos]-numbers[pos-1])\r\n maximum.append(numbers[pos]-numbers[0])\r\n else:\r\n minimum.append(min(numbers[pos]-numbers[pos-1],numbers[pos+1]-numbers[pos]))\r\n maximum.append(max(numbers[pos]-numbers[0],numbers[-1]-numbers[pos]))\r\n\r\nfor x in range(length):\r\n print(minimum[x],maximum[x])\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\nx = [int(s) for s in input().split(' ')]\r\n\r\nm = x[1] - x[0]\r\nM = x[-1] - x[0]\r\nprint(m, M)\r\n\r\nfor i in range(1, n - 1):\r\n m = min(x[i] - x[i - 1], x[i + 1] - x[i])\r\n M = max(x[i] - x[0], x[-1] - x[i])\r\n print(m, M)\r\n\r\nm = x[-1] - x[-2]\r\nM = x[-1] - x[0]\r\nprint(m, M)\r\n", "import sys\r\nn = int(input())\r\narr = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nfor i in range(len(arr)):\r\n if i == 0:\r\n print(abs(arr[i] - arr[i + 1]), abs(arr[i] - arr[n - 1]))\r\n elif i == n - 1:\r\n print(abs(arr[i] - arr[i - 1]), abs(arr[i] - arr[0]))\r\n else:\r\n print(min(abs(arr[i] - arr[i - 1]), abs(arr[i] - arr[i + 1])), max(abs(arr[i] - arr[0]), abs(arr[i] - arr[n - 1])))", "n = int(input())\r\nxi = list(map(int, input().split()))\r\n\r\nmin_i = 0\r\nmax_i = 0\r\nfor i in range(n):\r\n if(i == 0):\r\n min_i = abs(xi[i] - xi[i+1])\r\n max_i = abs(xi[i] - xi[n-1])\r\n elif(i==n-1):\r\n min_i = abs(xi[i] - xi[i-1])\r\n max_i = abs(xi[i] - xi[0])\r\n else:\r\n left = abs(xi[i]-xi[i-1])\r\n right = abs(xi[i]-xi[i+1])\r\n far_left = abs(xi[i]-xi[0])\r\n far_right= abs(xi[i]-xi[n-1])\r\n if(left < right):\r\n min_i = left\r\n else:\r\n min_i = right\r\n if(far_left > far_right):\r\n max_i = far_left\r\n else:\r\n max_i = far_right\r\n print(min_i,max_i)", "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 = inl()\r\na = list(map(lambda x: x - a[0], a))\r\nfor i in range(n):\r\n if i == 0:\r\n print(a[1], a[n-1])\r\n elif i == n - 1:\r\n print(a[n-1] - a[n-2], a[n-1])\r\n else:\r\n print(min(a[i] - a[i-1], a[i+1] - a[i]), max(a[i] - a[0], a[n-1] - a[i]))\r\n", "t = int(input())\r\nn = list(map(int, input().split()))\r\n\r\nfor i in range(t):\r\n print(min(abs(n[i] - n[(i + 1) % t]), abs(n[i] - n[i - 1])), max(abs(n[i] - n[0]), abs(n[i] - n[-1])))\r\n", "n = int(input())\nm = [int(x) for x in input().split()]\no = [[]] * n\n\no[0] = [abs(m[1] - m[0]), abs(m[-1] - m[0])]\nfor i in range(1, n - 1):\n curr_min = min(abs(m[i - 1] - m[i]), abs(m[i + 1] - m[i]))\n curr_max = max(abs(m[0] - m[i]), abs(m[-1] - m[i]))\n o[i] = [curr_min, curr_max]\n\no[-1] = [abs(m[-2] - m[-1]), abs(m[0] - m[-1])]\n\nfor i in o:\n x = [str(x) for x in i]\n print(\" \".join(x))\n\t\t \t \t\t \t \t\t \t \t \t \t", "numberOfCities = int(input())\r\ncities = input()\r\ncities_list = cities.split()\r\ncity_numbers = [int(x) for x in cities_list]\r\nmini = 0\r\nmaxi = 0\r\nfor i in range (numberOfCities):\r\n if i ==0:\r\n mini = abs(city_numbers[1] - city_numbers[0])\r\n maxi = abs(city_numbers[numberOfCities-1] - city_numbers[0])\r\n elif i == numberOfCities-1 :\r\n mini = abs(city_numbers[i] - city_numbers[i-1])\r\n maxi = abs(city_numbers[i] - city_numbers[0])\r\n else:\r\n min1 = abs(city_numbers[i] - city_numbers[i-1])\r\n min2 = abs(city_numbers[i] - city_numbers[i+1])\r\n mini = min(min1,min2)\r\n\r\n max1 = abs(city_numbers[i] - city_numbers[0])\r\n max2 = abs(city_numbers[i] - city_numbers[numberOfCities-1])\r\n maxi = max(max1, max2)\r\n print(mini,maxi)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Oct 14 17:58:31 2022\r\n\r\n@author: Amr osama\r\n\"\"\"\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n coords = l[i]\r\n if(i == 0): \r\n smallest = abs(l[i+1] - l[i])\r\n largest = abs(l[-1] - l[i])\r\n elif(i == len(l)-1):\r\n smallest = abs(l[i] - l[i-1])\r\n largest = abs(l[i] - l[0])\r\n else:\r\n smallest = abs(l[i] - l[i-1]) if abs(l[i] - l[i-1]) < abs(l[i+1] - l[i]) else abs(l[i+1] - l[i])\r\n largest = abs(l[-1] - l[i]) if abs(l[-1] - l[i]) > abs(l[i] - l[0]) else abs(l[i] - l[0])\r\n print(\" \".join([str(smallest),str(largest)]))\r\n\r\n\r\n#%%\r\n", "n = int(input())\r\nli1 = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n if i == 0:\r\n a = li1[i+1]-li1[i]\r\n elif i == n-1:\r\n a = li1[i]-li1[i-1]\r\n else:\r\n a = min((li1[i+1]-li1[i]), li1[i]-li1[i-1])\r\n b = max((li1[i]-li1[0]), (li1[n-1]-li1[i]))\r\n print(a, b)", "\r\nn = int(input())\r\nx = list(map(int,input().split()))\r\n#y = []\r\n#[y.append(i) for i in x if i not in y]\r\n\r\n\r\np = []\r\n\r\nif(n == 1):\r\n\tfor i in range(n):\r\n\t\tp.append([0,0])\r\nelse:\r\n\t#y.sort()\r\n\t#print(x,y)\r\n\tfor i in range(n):\r\n\t\t#y_ind = y.index(x[i])\r\n\t\tif(i == 0):\r\n\t\t\tmind = abs(x[i]-x[i + 1])\r\n\t\t\tmaxd = abs(x[i]-x[-1])\r\n\t\telif(i == n-1):\r\n\t\t\tmaxd = abs(x[i]-x[0])\r\n\t\t\tmind = abs(x[i] - x[i - 1])\r\n\t\telse:\r\n\t\t\tmind = min(abs(x[i]-x[i-1]),abs(x[i]-x[i+1]))\r\n\t\t\tmaxd = max(abs(x[i]-x[-1]),abs(x[i]-x[0]))\r\n\t\tp.append([mind,maxd])\r\n\r\nfor i in range(n):\r\n\tprint(p[i][0],p[i][1])\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\na = [int(s) for s in input().split()]\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n print(a[1] - a[0], a[-1] - a[0])\r\n elif i == n - 1:\r\n print(a[n - 1] - a[n - 2], a[n - 1] - a[0])\r\n else:\r\n print(min(a[i] - a[i - 1], a[i + 1] - a[i]), max(a[-1] - a[i], a[i] - a[0]))\r\n ", "# Enter your code here. Read input from STDIN. Print output to STDOUT\n\nif __name__ == '__main__':\n\tt = int(input().strip())\n\tx = [int(x) for x in input().strip().split(\" \")]\n\ti = 0\n\tans = []\n\twhile i < t:\n\t\tif i == 0:\n\t\t\tmn = abs(x[i]-x[i+1])\n\t\t\tmx = abs(x[i]-x[t-1])\n\t\telif i == t-1:\n\t\t\tmn = abs(x[i-1]-x[i])\n\t\t\tmx = abs(x[i]-x[0])\n\t\telse:\n\t\t\tmn = min(abs(x[i]-x[i-1]), abs(x[i]-x[i+1]))\n\t\t\tmx = max(abs(x[i]-x[0]), abs(x[i]-x[t-1]))\n\t\tans.append((mn, mx))\n\t\ti += 1\n\tfor a in ans:\n\t\tprint(f\"{a[0]} {a[1]}\")\n \t \t \t\t\t\t \t\t \t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(abs(a[0]-a[1]),abs(a[0]-a[n-1]))\r\nfor i in range(1,n-1):\r\n print(min(abs(a[i]-a[i-1]),abs(a[i]-a[i+1])),end=\" \")\r\n print(max(abs(a[i]-a[n-1]),abs(a[i]-a[0])),end=\" \")\r\n print()\r\n \r\n \r\nprint(abs(a[n-1]-a[n-2]),abs(a[n-1]-a[0]))\r\n", "n = int(input())\r\npos = [int(x) for x in input().split()]\r\nprint(pos[1]-pos[0], pos[-1]-pos[0])\r\nfor i in range(1, n-1):\r\n if pos[i+1]-pos[i]>=pos[i]-pos[i-1]: print(pos[i]-pos[i-1], end=\"\")\r\n else: print(pos[i+1]-pos[i], end=\"\")\r\n if pos[-1]-pos[i]<=pos[i]-pos[0]: print(f\" {pos[i]-pos[0]}\")\r\n else: print(f\" {pos[-1]-pos[i]}\")\r\nprint(pos[-1]-pos[-2], pos[-1]-pos[0])", "m=int(input())\nb=[int(x) for x in input().split()]\nmini=b[1]-b[0]\nmaxi=b[-1]-b[0]\nprint(mini,maxi)\nfor i in range(1,m-1):\n d1=b[i]-b[i-1]\n d2=b[i+1]-b[i]\n mini=min(d1,d2)\n m1=b[i]-b[0]\n m2=b[-1]-b[i]\n maxi=max(m1,m2)\n print(mini,maxi)\nmini=b[-1]-b[-2]\nmaxi=b[-1]-b[0]\nprint(mini,maxi) \n \t\t\t \t \t \t\t \t \t\t\t \t", "n=int(input())\r\nx=list(map(int,input().split()))\r\na=abs(x[0]-x[1])\r\nb=abs(x[0]-x[n-1])\r\nprint(a,b)\r\nfor i in range(1,n-1):\r\n a=min(abs(x[i]-x[i-1]),abs(x[i]-x[i+1]))\r\n b=max(abs(x[0]-x[i]),abs(x[n-1]-x[i]))\r\n print(a,b)\r\nb=abs(x[0]-x[n-1])\r\na=abs(x[n-2]-x[n-1])\r\nprint(a,b)\r\n", "n = int(input())\r\narr = sorted(list(map(int, input().split())))\r\nfor i in range(n):\r\n if i == 0:\r\n print(arr[1] - arr[0], arr[-1] - arr[0])\r\n continue\r\n elif i == n - 1:\r\n print(arr[-1] - arr[-2], arr[-1] - arr[0])\r\n continue\r\n mn = min(abs(arr[i - 1] - arr[i]), abs(arr[i + 1] - arr[i]))\r\n mx = max(abs(arr[i] - arr[0]), abs(arr[i] - arr[-1]))\r\n print(mn, mx)", "#A. Lineland Mail\r\nCityNo = int(input())\r\nCities = [int(x) for x in input().split()]\r\n\r\nfor i in range(CityNo):\r\n minD = 0\r\n maxD = 0\r\n if i == 0:\r\n minD = Cities[i+1]-Cities[i]\r\n maxD = Cities[CityNo-1]-Cities[i]\r\n elif i == CityNo - 1:\r\n minD = Cities[i]-Cities[i-1]\r\n maxD = Cities[i] - Cities[0]\r\n else:\r\n minD = min(Cities[i] - Cities[i-1], Cities[i+1] - Cities[i])\r\n maxD = max(Cities[CityNo-1] - Cities[i], Cities[i] - Cities[0])\r\n print(minD, maxD)", "n = int(input())\narr = list(map(int,input().split()))\nmini1=arr[1]-arr[0]\nmaxi1=arr[n-1]-arr[0]\nprint(mini1,maxi1)\nfor i in range(1,n-1):\n mini1=arr[i]-arr[i-1]\n mini2=arr[i+1]-arr[i]\n print(min(mini1,mini2),end=\" \")\n maxi1=arr[i]-arr[0]\n maxi2=arr[n-1]-arr[i]\n print(max(maxi1,maxi2))\nmini1=arr[n-1]-arr[n-2]\nmaxi1=arr[n-1]-arr[0]\nprint(mini1,maxi1)\n\n \t \t \t\t\t\t \t \t\t\t\t\t", "n = int(input())\r\narr = list(map(int,input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n print(arr[1] - arr[0],arr[-1] - arr[0])\r\n elif i == (n-1):\r\n print(arr[-1] - arr[-2],arr[-1] - arr[0])\r\n else:\r\n x = min(arr[i] - arr[i-1],arr[i+1] - arr[i])\r\n y = max(arr[-1] - arr[i],arr[i] - arr[0])\r\n print(x,y)", "n = int(input())\n\ncoordinates = [int(x) for x in input().split()]\nvalue_one_minor = abs(coordinates[0] - coordinates[1])\nvalue_one_major = abs(coordinates[0] - coordinates[len(coordinates)-1])\nvalue_lastOne_minor = abs(coordinates[len(coordinates)-1] - coordinates[len(coordinates)-2])\nvalue_lastOne_major = abs(coordinates[len(coordinates)-1] - coordinates[0])\nprint(value_one_minor, value_one_major, sep=\" \")\nminor = 0\nmajor = 0\nfor i in range(1, len(coordinates)-1):\n\n if (abs(coordinates[i] - coordinates[i-1])) <= (abs(coordinates[i] - coordinates[i+1])):\n minor = abs(coordinates[i] - coordinates[i-1])\n else:\n minor = abs(coordinates[i] - coordinates[i+1])\n\n if abs(coordinates[i] - coordinates[len(coordinates)-1]) > abs(coordinates[i] - coordinates[0]):\n major = abs(coordinates[i] - coordinates[len(coordinates)-1])\n else:\n major = abs(coordinates[i] - coordinates[0])\n print(minor, major, sep=\" \")\n minor = 0\n major = 0\nprint(value_lastOne_minor, value_lastOne_major, sep=\" \")\n \t\t \t\t\t\t\t\t\t \t\t \t \t \t \t \t", "n=int(input())\r\np=[]\r\nv=[]\r\nl=sorted(list(map(int,input().split())))\r\nfor i in range(n):\r\n\tif abs((l[i]-l[-1]))>abs((l[i]-l[0])):\r\n\t\tv.append(abs((l[i]-l[-1])))\r\n\telse:\r\n\t\tv.append(abs((l[i]-l[0])))\r\nfor i in range(n-1):\r\n\tif abs(l[i]-l[i-1])<abs(l[i]-l[i+1]):\r\n\t\tp.append(abs(l[i]-l[i-1]))\r\n\telse:\r\n\t\tp.append(abs(l[i]-l[i+1]))\r\np.append((l[-1]-l[-2]))\r\n\r\nfor i,j in zip(v,p):\r\n\tprint(j,i)", "n = int(input())\r\npos = list(map(int, input().split(\" \")))\r\nfor i, v in enumerate(pos):\r\n if(i > 0 and i < n - 1):\r\n m_ = min(v - pos[i-1], pos[i + 1] - v)\r\n _m = max(v - pos[0], pos[n-1] - v)\r\n elif i == 0:\r\n m_ = pos[i + 1] - v\r\n _m = pos[n-1] - v\r\n elif i == n - 1:\r\n m_ = v - pos[i-1]\r\n _m = v - pos[0]\r\n print(m_, _m)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n n= int(input())\r\n arr = [int(item) for item in input().split()]\r\n ans = []\r\n ans.append([arr[1]-arr[0],arr[-1]-arr[0]])\r\n for i in range(1,n-1):\r\n\r\n k = max(arr[-1]-arr[i],arr[i]-arr[0])\r\n t = min(arr[i+1]-arr[i],arr[i]-arr[i-1])\r\n\r\n ans.append([t,k])\r\n \r\n ans.append([arr[-1]-arr[-2],arr[-1]-arr[0]])\r\n for x in ans:\r\n print(*x)\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\ndef distancia(x, y, l):\r\n\treturn abs(l[x]-l[y])\r\n\r\nfor i in range(n):\r\n\tif i == 0:\r\n\t\ta = distancia(i, i+1, cities)\r\n\t\tb = distancia(i, n-1, cities)\r\n\t\tprint(min(a,b), max(a,b)) \r\n\t\t\r\n\t\t\r\n\telif i == n-1:\r\n\t\ta = distancia(i, i-1, cities)\r\n\t\tb = distancia(i, 0, cities)\r\n\t\tprint(min(a,b), max(a,b)) \r\n\t\t \r\n\t\t\r\n\telse:\r\n\t\ta = distancia(i, i+1, cities)\r\n\t\tb = distancia(i, i-1, cities)\r\n\t\tc = distancia(i, 0, cities)\r\n\t\td = distancia(i, n-1, cities)\r\n\t\tprint(min(a,b), max(c,d))\r\n", "n = int(input())\r\n\r\nch = input()\r\nch = ch.split()\r\nch = [int(x) for x in ch]\r\na = ch.copy()\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n mx = a[-1] - a[0]\r\n mn = a[1] - a[0]\r\n elif i == n-1:\r\n mx = a[-1] - a[0]\r\n mn = a[-1] - a[-2]\r\n else:\r\n mn = min(a[i]-a[i-1], a[i+1]-a[i])\r\n mx= max(a[i]-a[0], a[-1]-a[i])\r\n print(mn, mx)\r\n", "n = int(input());x = list(map(int,input().split()))\r\nfor i in range(n):\r\n t = x[i]\r\n print (min(abs(t-x[i-1]),abs(x[i-n+1]-t)),max(t-x[0],x[n-1]-t))", "n = int(input())\r\ncities = list(map(int, input().split()))\r\nresult = []\r\nfor i in range(n):\r\n\t# Maximum value in all cases except 2 cases ({first & last} elements of array)\r\n\tmaxi = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1]))\r\n\t# Exception One -> i==First index of array\r\n\tif i == 0:\r\n\t\tmini = abs(cities[i] - cities[1])\r\n\t# Exception Two -> i==last index of array\r\n\tif i == n - 1:\r\n\t\tmini = abs(cities[i] - cities[-2])\r\n\telse:\r\n\t\t# Minimum value in all cases except 2 cases ({first & last} elements of array)\r\n\t\tmini = min(abs(cities[i] - cities[i - 1]), abs(cities[i] - cities[i + 1]))\r\n\tresult.append([mini, maxi])\r\nfor x in result:\r\n\tprint(*x)\r\n", "n = int(input())\nlst = list(map(int, input().split()))\nminn = lst[0]\nmaxx = lst[len(lst)-1]\nvalue1, value2 = 0, 0\nfor i in range(len(lst)):\n if i ==0 :\n print(abs(lst[1]-lst[0]),abs(maxx-minn))\n elif i == len(lst)-1 :\n print(abs(lst[len(lst)-1]-lst[len(lst)-2]),abs(maxx-minn))\n else:\n if abs(lst[i]- lst[i-1]) > abs(lst[i+1]-lst[i]):\n value1 = abs(lst[i+1]-lst[i])\n else:\n value1 = abs(lst[i]- lst[i-1])\n if abs(lst[len(lst)-1] - lst[i]) > abs(lst[0] - lst[i]):\n value2 = abs(lst[len(lst)-1] - lst[i])\n else:\n value2 = abs(lst[0] - lst[i])\n print(value1, value2)", "\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n l = []\r\n for i in range(n):\r\n if i == 0:\r\n mn = a[1] - a[0]\r\n mx = a[n-1] - a[0]\r\n elif i == n-1:\r\n mn = a[i] - a[i-1]\r\n mx = a[i] - a[0]\r\n else:\r\n mn = min(a[i+1]-a[i],a[i]-a[i-1])\r\n mx = max(a[n-1] - a[i],a[i]-a[0])\r\n print(mn,mx)\r\n\r\n\r\n\r\n", "n=int(input())\r\nnum=input()\r\nlist=[int(x) for x in num.split()]\r\nprint(list[1]-list[0],list[n-1]-list[0])\r\nfor i in range(1,n-1):\r\n a=min(list[i]-list[i-1],list[i+1]-list[i])\r\n b=max(list[i]-list[0],list[n-1]-list[i])\r\n print(a,b)\r\nprint(list[n-1]-list[n-2],list[n-1]-list[0])", "n = int(input())\n\nloc = list(map(int,input().split()))\nfor i in range(len(loc)):\n output = None\n if i == 0:\n output = (abs(loc[i] - loc[i + 1]), abs(loc[i] - loc[-1]))\n elif i == len(loc) - 1:\n output = (abs(loc[i] - loc[i - 1]), abs(loc[i] - loc[0]))\n else:\n output = (min(abs(loc[i] - loc[i+1]),abs(loc[i] - loc[i - 1])),max(abs(loc[i] - loc[-1]),abs(loc[i] - loc[0])))\n \n print(str(output[0]) + \" \" + str(output[1]))\n \t\t\t\t\t \t \t\t\t \t\t \t\t\t\t", "#!/bin/python\na = int(input())\n\nb = sorted([int(x) for x in input().split()])\n\nfor x in range(a):\n\n\n ma = max(abs(b[x] - b[0]), abs(b[x] - b[-1]))\n if x == 0:\n mi = b[x+1] - b[x]\n elif x == a - 1:\n mi = b[x] - b[x-1]\n else:\n mi = min(abs(b[x]-b[x-1]), abs(b[x]-b[x+1]))\n print(mi, ma)\n\t \t \t\t \t\t \t \t \t\t \t\t \t\t \t \t", "q = int(input())\r\na = list(map(int, input().split()))\r\nfor ind, o in enumerate(a):\r\n if(ind==0):\r\n ma=a[-1]-o\r\n mi=a[ind+1]-o\r\n \r\n elif(ind==q-1):\r\n ma=o-a[0]\r\n mi=o-a[ind-1]\r\n else:\r\n ma=max(o-a[0],a[-1]-o)\r\n mi=min(a[ind+1]-o,o-a[ind-1])\r\n print(mi, ma)\r\n", "n=int(input())\r\nXi=input()\r\nXi_list=Xi.split(\" \")\r\nXi_Max=int(Xi_list[-1])\r\nXi_Min=int(Xi_list[0])\r\ni=0\r\nfor item in Xi_list:\r\n item=int(item)\r\n Min_Max_list=[]\r\n ## Element is min\r\n if item==Xi_Min:\r\n Min_Max_list.append(abs(Xi_Min-int(Xi_list[i+1])))\r\n Min_Max_list.append(abs(Xi_Min-Xi_Max))\r\n \r\n ## Element is max\r\n elif item== Xi_Max:\r\n Min_Max_list.append(abs(Xi_Max-int(Xi_list[i-1])))\r\n Min_Max_list.append(abs(Xi_Max-Xi_Min))\r\n \r\n ## Element is in between\r\n else:\r\n Min_Max_list.append(min([abs(item-int(Xi_list[i-1])),abs(item-int(Xi_list[i+1]))]))\r\n Min_Max_list.append(max([abs(item-Xi_Max),abs(item-Xi_Min)]))\r\n i=i+1\r\n ## 0 index for min, and 1 index for max\r\n print(str(Min_Max_list[0])+' '+str(Min_Max_list[1])) ", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n mn = lst[i + 1] - lst[i]\r\n elif i == n - 1:\r\n mn = lst[i] - lst[i - 1]\r\n else:\r\n mn = min(lst[i + 1] - lst[i], lst[i] - lst[i - 1])\r\n \r\n mx = max(lst[n - 1] - lst[i], lst[i] - lst[0])\r\n \r\n print(mn, mx)", "num = int(input())\r\ncities = list(map(int,input().split()))\r\nma = max(cities)\r\nmi = min(cities)\r\ns = 0\r\ns1 =0\r\nfor i in range(num):\r\n if i == 0:\r\n print(cities[1]-cities[i],cities[-1]-cities[i])\r\n elif i == num -1 :\r\n print(cities[i]-cities[i-1],cities[i]-cities[0])\r\n else:\r\n s = cities[i]-cities[i-1]\r\n s1 =cities[i+1]-cities[i]\r\n big = ma -cities[i]\r\n sm = cities[i]-mi\r\n print(min(s,s1),max(sm,big))", "import math\r\nn=int(input())\r\nval=[(-math.inf,-1),(math.inf,-1)]\r\narr = list(map(int,input().split()))\r\nfor i in range(n):\r\n val.append((arr[i],i))\r\n\r\nval.sort(key=lambda x:x[0])\r\nans=[(0,0) for _ in range(n)]\r\nl_extreme=val[1][0]\r\nr_extreme=val[-2][0]\r\nfor i in range(1,len(val)-1):\r\n mini = min(abs(val[i-1][0]-val[i][0]),abs(val[i+1][0]-val[i][0]))\r\n maxi = max(abs(val[i][0]-l_extreme),abs(val[i][0]-r_extreme))\r\n ans[val[i][1]]=(mini,maxi)\r\nfor x,y in ans:\r\n print(x,y)\r\n ", "# import csv\r\n#\r\n# rows_list = []\r\n# with open('C:\\\\Users\\\\User\\\\Desktop\\\\time_dim2.csv', 'r', encoding=\"utf-8\") as file:\r\n# reader = csv.reader(file)\r\n# for row in reader:\r\n# if row[1].find('-') == -1:\r\n# rows_list.append(row)\r\n# continue\r\n# time = row[1].split(' ')[1]\r\n# date = row[1].split(' ')[0].split('-')\r\n#\r\n# row[1] = '20' + date[2] + '-' + date[1] + '-' + date[0]\r\n# row[1] += ' ' + time + \":00 +6:00\"\r\n# rows_list.append(row)\r\n# # for row in rows_list:\r\n# # print(row)\r\n# with open('C:\\\\Users\\\\User\\\\Desktop\\\\time_dim.csv', 'w', newline='', encoding=\"utf-8\") as file:\r\n# writer = csv.writer(file)\r\n# writer.writerows(rows_list)\r\n\r\n# n = int(input())\r\n# x_pass_level = list(map(int, input().split()))\r\n# y_pass_level = list(map(int, input().split()))\r\n#\r\n# x_pass_level = set(x_pass_level[1:])\r\n# y_pass_level = set(y_pass_level[1:])\r\n#\r\n# # print(x_pass_level, y_pass_level)\r\n#\r\n# xy_pass_level = x_pass_level.union(y_pass_level)\r\n# # print(xy_pass_level)\r\n#\r\n# diff = len(xy_pass_level) < n\r\n# # print(diff)\r\n#\r\n# if diff:\r\n# print(\"Oh, my keyboard!\")\r\n# else:\r\n# print(\"I become the guy.\")\r\n\r\n# import math\r\n# n = int(input())\r\n# skills = list(map(int, input().split()))\r\n#\r\n# programming = []\r\n# mathematics = []\r\n# sports = []\r\n#\r\n# for i in range(len(skills)):\r\n# if skills[i] == 1:\r\n# programming.append(i+1)\r\n# elif skills[i] == 2:\r\n# mathematics.append(i+1)\r\n# elif skills[i] == 3:\r\n# sports.append(i+1)\r\n#\r\n# minimum_teams = min(len(programming), len(mathematics), len(sports))\r\n# print(minimum_teams)\r\n# for i in range(minimum_teams):\r\n# print(programming[i], mathematics[i], sports[i])\r\n\r\nn = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nprint(cities[1] - cities[0], cities[-1] - cities[0]) # For First City\r\n\r\nfor i in range(1, len(cities) - 1):\r\n print(min(cities[i] - cities[i - 1], cities[i + 1] - cities[i]), max(cities[i] - cities[0], cities[-1] - cities[i]))\r\n\r\nprint(cities[-1] - cities[-2], cities[-1] - cities[0]) # For Last City\r\n", "n = int(input(\"\"))\r\nlst_inp = input()\r\nlst = [int(i) for i in lst_inp.split()]\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n if lst[0] <= 0:\r\n val = -(lst[0])\r\n min = val + lst[1]\r\n max = val + lst[-1]\r\n else:\r\n min = lst[1] - lst[0]\r\n max = lst[-1] - lst[0]\r\n elif i == n-1:\r\n if lst[i] <= 0:\r\n min = (-lst[i-1]) + lst[i]\r\n max = (-lst[0]) + lst[-1]\r\n else:\r\n if lst[i-1] <= 0:\r\n min = (-lst[i-1]) + lst[i]\r\n max = (-lst[0])+lst[i]\r\n elif lst[0] >= 0:\r\n min = lst[i] - lst[i - 1]\r\n max = lst[i] - lst[0]\r\n else:\r\n min = lst[i] - lst[i - 1]\r\n max = (-lst[0]) + lst[i]\r\n else:\r\n if lst[i] <= 0:\r\n min_left = (-lst[i-1]) + lst[i]\r\n min_right = (-lst[i]) + lst[i+1]\r\n max_left = (-lst[0]) + lst[i]\r\n max_right = (-lst[i]) + lst[-1]\r\n else:\r\n min_left = lst[i] - lst[i-1]\r\n min_right = lst[i+1] - lst[i]\r\n max_left = lst[i] - lst[0]\r\n max_right = lst[-1] - lst[i]\r\n\r\n if min_left < min_right:\r\n min = min_left\r\n else:\r\n min = min_right\r\n\r\n if max_left > max_right:\r\n max = max_left\r\n else:\r\n max = max_right\r\n\r\n print(f\"{min} {max}\")\r\n", "import math\r\n\r\n\r\ndef main_function():\r\n input()\r\n cities = [int(i) for i in input().split(\" \")]\r\n first_city = cities[0]\r\n last_city = cities[-1]\r\n output_list = []\r\n for i in range(len(cities)):\r\n if i == 0:\r\n output_list.append(f\"{cities[1] - cities[0]} {last_city - cities[0]}\")\r\n elif i == len(cities) - 1:\r\n output_list.append(f\"{cities[-1] - cities[-2]} {last_city - cities[0]}\")\r\n else:\r\n output_list.append(f\"{min(cities[i + 1] - cities[i], cities[i] - cities[i - 1])} {max(last_city - cities[i], cities[i] - first_city)}\")\r\n return \"\\n\".join(output_list)\r\n\r\n return \"\\n\".join(output_list)\r\n\r\n\r\nprint(main_function())", "n=int(input())\r\nl=input()\r\nl=l.split()\r\nless=int(l[1])-int(l[0])\r\nbig=int(l[n-1])-int(l[0])\r\nprint(\"{0} {1}\".format(less,big))\r\nfor i in range(1,n-1):\r\n l1=int(l[i+1])-int(l[i])\r\n l2=int(l[i])-int(l[i-1])\r\n less=min(l1,l2)\r\n l1=int(l[n-1])-int(l[i])\r\n l2=int(l[i])-int(l[0])\r\n big=max(l1,l2)\r\n print(\"{0} {1}\".format(less,big))\r\nless=int(l[n-1])-int(l[n-2])\r\nbig=int(l[n-1])-int(l[0])\r\nprint(\"{0} {1}\".format(less,big))", "\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n t=x[i]\r\n print(min(abs(t-x[i-1]),abs(x[i-n+1]-t)),max(t-x[0],x[n-1]-t))", "def main():\r\n n=int(input())\r\n l=list()\r\n l=input()\r\n l=l.split()\r\n distance=list()\r\n for i in range(n):\r\n l[i]=int(l[i])\r\n for i in range(n):\r\n if i==0:\r\n min_dis=l[1]-l[0]\r\n max_dis=l[-1]-l[0]\r\n elif i==n-1:\r\n min_dis=l[n-1]-l[n-2]\r\n max_dis=l[n-1]-l[0]\r\n else:\r\n min_dis=min(l[i+1]-l[i],l[i]-l[i-1])\r\n max_dis=max(l[-1]-l[i],l[i]-l[0])\r\n print(\"{0} {1}\".format(min_dis,max_dis))\r\n \r\n \r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "x = int(input())\nlineland = list(map(int, input().split()))\ncopy = lineland[::]\n\ncopy[0] = 0\nfor c in range(1, len(copy)):\n copy[c] = abs(lineland[c] - lineland[c - 1]) + copy[c - 1]\n\n\nfor c in range(len(lineland)):\n Min = 0\n Max = 0\n\n max1 = copy[len(lineland) - 1] - copy[c]\n max2 = copy[c]\n \n Max = max(max1, max2)\n\n if(c != 0 and c != len(lineland) - 1):\n min1 = copy[c + 1] - copy[c]\n min2 = copy[c] - copy[c - 1]\n Min = min(min1, min2)\n else:\n if(c == 0):\n Min = copy[c + 1] - copy[c]\n else:\n Min = copy[c] - copy[c - 1]\n print(Min, Max) \n \n\t \t\t \t \t \t\t\t \t\t\t\t", "n = int(input())\n\narr = list(map(int, input().split()))\n\nfor i in range(n):\n if i == 0:\n mn = arr[1] - arr[0]\n mx = arr[-1] - arr[0]\n elif i == n - 1:\n mn = arr[-1] - arr[i - 1]\n mx = arr[-1] - arr[0]\n else:\n mn = min(arr[i] - arr[i - 1], arr[i + 1] - arr[i])\n mx = max(arr[i] - arr[0], arr[-1] - arr[i])\n print(mn, mx)", "n = int (input())\r\nans = list(map (int, input().split(' '))) \r\nans.sort()\r\nmn = ans[1] - ans[0]\r\nmx= ans[n-1] -ans[0] \r\nprint (mn,mx,sep=' ')\r\nfor i in range (1,n-1):\r\n mn = min (ans[i] - ans[i-1],ans[i+1]- ans[i])\r\n mx= max (ans[i] - ans[0] , ans[n-1] - ans[i]) \r\n print (mn,mx,sep=' ')\r\nmn = ans[n-1] - ans[n-2]\r\nmx= ans[n-1] -ans[0] \r\nprint (mn,mx,sep=' ')\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = sorted(a)\r\nd = dict()\r\nfor i in range(n):\r\n d[b[i]] = i\r\nfor i in a:\r\n if i == b[0]:\r\n print(b[1] - b[0], b[-1] - b[0])\r\n elif i == b[-1]:\r\n print(b[-1] - b[-2], b[-1] - b[0])\r\n else:\r\n print(min(b[d[i]] - b[d[i] - 1], b[d[i] + 1] - b[d[i]]), max(b[d[i]] - b[0], b[-1] - b[d[i]]))", "n = int(input())\r\nx = [int(a) for a in input().split()]\r\nmin = 0\r\nmax = 0\r\n\r\nfor i in range(n):\r\n max = abs(x[i] - x[n-1])\r\n if max == 0 or abs(x[i]-x[0])> max:\r\n max = abs(x[i]-x[0])\r\n\r\n if i == n-1 or abs(x[i]-x[i-1]) < abs(x[i]-x[i+1]):\r\n min = (x[i]-x[i-1])\r\n else:\r\n min = abs(x[i] - x[i + 1])\r\n print(min, max)", "import sys\r\n\r\ndef main():\r\n _, *l = map(int, sys.stdin.read().strip().split())\r\n t = len(l)\r\n out = []\r\n for i,j in enumerate(l):\r\n mn = min(abs(l[x] - j) for x in (i-1, i+1) if 0 <= x < t)\r\n mx = max(abs(l[x] - j) for x in (0, t-1))\r\n out.append(f'{mn} {mx}')\r\n return out\r\n \r\nprint(*main(), sep='\\n')", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if i==0:\r\n mi=abs(a[1]-a[0])\r\n ma=abs(a[n-1]-a[0])\r\n elif i==n-1:\r\n mi=abs(a[n-1]-a[n-2])\r\n ma=abs(a[n-1]-a[0])\r\n else:\r\n mi=min(abs(a[i]-a[i-1]),abs(a[i]-a[i+1]))\r\n ma=max(abs(a[i]-a[0]),abs(a[i]-a[n-1]))\r\n print(mi,ma) \r\n \r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsol=[]\r\nfor i in range (n) :\r\n mx=max(abs(l[i]-l[0]),abs(l[i]-l[n-1]))\r\n if i == 0 :\r\n mn= abs(l[i]-l[i+1])\r\n elif i==n-1 :\r\n mn=abs(l[i]-l[n-2])\r\n else :\r\n mn=min(abs(l[i]-l[i-1]),abs(l[i]-l[i+1]))\r\n sol.append([mn,mx])\r\n\r\n\r\nfor i in sol:\r\n print(*i)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nfor i in range(len(A)):\r\n maxi = max(abs(A[i] - A[0]), abs(A[i] - A[-1]))\r\n if i == 0:\r\n mini = abs(A[i] - A[i + 1])\r\n elif i == len(A) - 1:\r\n mini = abs(A[i] - A[i - 1])\r\n else:\r\n mini = min(abs(A[i] - A[i + 1]), abs(A[i] - A[i - 1]))\r\n print(mini, maxi)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nprint(abs(b[0]-b[1]),abs(b[0]-b[-1]))\r\nfor i in range(1,a-1):\r\n\tx=min(abs(b[i]-b[i-1]),abs(b[i]-b[i+1]))\r\n\ty=max(abs(b[0]-b[i]),abs(b[-1]-b[i]))\r\n\tprint(x,y)\r\nprint(abs(b[-1]-b[-2]),abs(b[-1]-b[0]))\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(lst[1]-lst[0],lst[-1]-lst[0])\r\nfor i in range(1,n-1):\r\n print(min(lst[i]-lst[i-1],lst[i+1]-lst[i]),max(lst[-1]-lst[i],lst[i]-lst[0]))\r\nprint(lst[-1]-lst[-2],lst[-1]-lst[0])", "\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i ==0:\r\n print(abs(x[1]-x[0]),abs(x[-1]-x[0]))\r\n elif i==n-1:\r\n print(abs(x[-1] - x[-2]), abs(x[-1] - x[0]))\r\n else:\r\n mini = min(abs(x[i]-x[i-1]),abs(x[i+1]-x[i]))\r\n maxi = max(abs(x[-1]-x[i]), abs(x[i]-x[0]))\r\n print(mini,maxi)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmax_a = [max(x - a[0], a[-1] - x) for x in a]\r\nmax_d = a[-1] - a[0]\r\nd = [max_d] + [y - x for x, y in zip(a[:-1], a[1:])] + [max_d]\r\nmin_a = [min(x, y) for x, y in zip(d[:-1], d[1:])]\r\nfor x, y in zip(min_a, max_a):\r\n print(x, y)", "n = int(input())\r\narr = input().split()\r\narr = list(map(int, arr))\r\nfor i in range(n):\r\n if i == 0:\r\n mind = abs(arr[0] - arr[1])\r\n maxd = abs(arr[0] - arr[n-1])\r\n elif i != (n-1):\r\n mind = min(abs(arr[i] - arr[i+1]), abs(arr[i] - arr[i-1]))\r\n maxd = max(abs(arr[i] - arr[0]), abs(arr[i] - arr[n-1]))\r\n else:\r\n mind = abs(arr[n-1] - arr[n-2])\r\n maxd = abs (arr[n-1] - arr[0])\r\n print(mind, maxd)", "length = int(input())\r\nalist = sorted([*map(int, input().split())])\r\nfor i in range(length):\r\n if i == 0:\r\n print(abs(alist[i+1] - alist[i]), abs(alist[-1] - alist[i]))\r\n elif i == length - 1:\r\n print(abs(alist[i] - alist[i - 1]), abs(alist[i] - alist[0]))\r\n else:\r\n print(min(abs(alist[i] - alist[i-1]), abs(alist[i + 1] - alist[i]) ), \r\n max(abs(alist[-1] - alist[i]), abs(alist[i] - alist[0]))) ", "n = int(input())\r\nar = sorted(list(map(int, input().split())))\r\nfor i in range(n):\r\n print(min(abs(ar[i]-ar[i-n+1]),abs(ar[i]-ar[i-1])),max(ar[n-1]-ar[i],ar[i]-ar[0]))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range (0, n):\r\n if i == 0 or i == n - 1 :\r\n if i == 0:\r\n print(a[i + 1] - a[i], end = \" \")\r\n else:\r\n print(a[i] - a[i - 1], end = \" \")\r\n print(a[n - 1] - a[0])\r\n else:\r\n print(min(a[i] - a[i - 1], a[i + 1] - a[i]), end = \" \")\r\n print(max(a[n - 1] - a[i], a[i] - a[0]))", "from math import inf\n\nn, x = int(input()), sorted(int(i) for i in input().split())\nres = [None] * n\nfor i in range(n):\n mi = min(x[i] - x[i - 1] if i > 0 else inf, x[i + 1] - x[i] if i < n - 1 else inf)\n ma = max(x[i] - x[0], x[n - 1] - x[i])\n res = mi, ma\n print(*res)\n", "x = input()\r\nxs = list(map(int,input().split()))\r\n\r\nprint(abs(xs[0]-xs[1]),abs(xs[0]-xs[-1]))\r\n\r\nfor i in range(1,len(xs)-1):\r\n print( min( abs(xs[i]-xs[i-1]), abs(xs[i]-xs[i+1])), max(abs(xs[i]-xs[0]), abs(xs[i]-xs[-1])))\r\n\r\nprint(abs(xs[-1]-xs[-2]),abs(xs[-1]-xs[0]))", "\r\n# Problem: A. Lineland Mail\r\n# Contest: Codeforces - Codeforces Round #Pi (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/567/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 3000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nn=int(input())\r\nA=[int(_) for _ in input().split()]\r\nfor _ in range(n):\r\n\tif _==0:\r\n\t\tprint(A[_+1]-A[_],A[-1]-A[_])\r\n\telif _==n-1:\r\n\t\tprint(A[_]-A[_-1],A[_]-A[0])\r\n\telse:\r\n\t\tx=min(A[_]-A[_-1],A[_+1]-A[_])\r\n\t\ty=max(A[_]-A[0],A[n-1]-A[_])\r\n\t\tprint(x,y)", "sz = int(input())\r\nlst1 = list(map(int, input().strip().split()))\r\nfor i in range(sz):\r\n mx = mn = 0\r\n if i != 0 and i != sz-1:\r\n mx = max(abs(lst1[i] - lst1[0]), abs(lst1[i] - lst1[sz-1]))\r\n mn = min(abs(lst1[i] - lst1[i+1]), abs(lst1[i] - lst1[i-1]))\r\n elif i == 0:\r\n mx = abs(lst1[i] - lst1[sz-1])\r\n mn = abs(lst1[i] - lst1[i+1])\r\n elif i == sz-1:\r\n mx = abs(lst1[i] - lst1[0])\r\n mn = abs(lst1[i] - lst1[i - 1])\r\n print(str(mn) + \" \" + str(mx))\r\n", "n = int(input())\r\narr = [int(i) for i in (input().split())]\r\nfor i in range(n):\r\n if i == 0:\r\n print(arr[i+1]-arr[i],arr[-1]-arr[i])\r\n elif i == n -1:\r\n print(arr[i]-arr[i-1],arr[i]-arr[0])\r\n else:\r\n print(min(arr[i]-arr[i-1],arr[i+1]-arr[i]),max(arr[i]-arr[0],arr[-1]-arr[i]))", "# A. Lineland Mail\n\nn = int(input())\nx = list(map(int, input().split()))\n\nans = list()\n\nans.append(str(x[1]-x[0]) + ' ' + str(x[-1] - x[0]))\n\nif n > 2:\n for i in range(1, n-1):\n mn = min(x[i] - x[i-1], x[i+1] - x[i])\n mx = max(x[i] - x[0], x[-1] - x[i])\n ans.append(str(mn) + ' ' + str(mx))\n\nans.append(str(x[-1] - x[-2]) + ' ' + str(x[-1] - x[0]))\n\nprint('\\n'.join(ans))\n", "linhas = int(input())\n\ncoordenadas = list(map(int, input().split()))\ntamanho = len(coordenadas)\n\nfor i in range(tamanho):\n maxi = 0\n mini = 0\n if (i != linhas-1):\n maxi = max(abs(coordenadas[i]-coordenadas[0]), abs(coordenadas[i]-coordenadas[linhas-1]))\n mini = min(abs(coordenadas[i]-coordenadas[i+1]),abs(coordenadas[i]-coordenadas[i-1]))\n else:\n maxi = coordenadas[linhas-1]-coordenadas[0]\n mini = coordenadas[linhas-1]-coordenadas[linhas-2]\n \n print(mini, maxi)\n\n\t \t \t \t \t\t\t \t\t \t\t\t \t\t", "n = int(input())\r\ncoordinates = [int(x) for x in input().split()]\r\n\r\ndistances = f'{coordinates[1] - coordinates[0]} {coordinates[-1] - coordinates[0]}\\n'\r\n\r\nfor i in range(1, n - 1, 1):\r\n left = abs(coordinates[i] - coordinates[i - 1])\r\n right = abs(coordinates[i] - coordinates[i + 1])\r\n minimum = min(left, right)\r\n left = abs(coordinates[i] - coordinates[0])\r\n right = abs(coordinates[i] - coordinates[-1])\r\n maximum = max(left, right)\r\n distances += f'{minimum} {maximum}\\n'\r\n\r\ndistances += f'{coordinates[-1] - coordinates[-2]} {coordinates[-1] - coordinates[0]}'\r\nprint(distances)", "l=int(input())\nnum=list(map(int,input().split()))[:l]\nsol=[]\nfor i in range(l):\n\n if i==0:\n print(abs(num[1]-num[0]),abs(num[l-1]-num[0]),sep=\" \")\n elif i==l-1:\n print(abs(num[l-1]-num[l-2]),abs(num[l-1]-num[0]),sep=\" \")\n else:\n a=abs(num[i]-num[i-1])\n b=abs(num[i+1]-num[i])\n c=abs(num[i]-num[0])\n d=abs(num[i]-num[l-1])\n print(min(a,b),max(c,d),sep=\" \")\n\n \t\t \t\t\t\t \t\t\t \t\t \t", "from sys import stdin\ndef test(problem):\n pass\ndef solve(n,l):\n print(l[1]-l[0],l[-1]-l[0])\n for i in range(1,n-1):\n mn=min(l[i]-l[i-1],l[i+1]-l[i])\n mx=max(l[i]-l[0],l[-1]-l[i])\n print(mn,mx)\n print(l[-1]-l[-2],l[-1]-l[0])\n\n\n \n\n\nn=int(input())\nl=list(int(i) for i in stdin.readline().split())\nsolve(n,l)\n \n\n \n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ndef mini(i):\r\n if i == 0:\r\n return abs(arr[i] - arr[i+1])\r\n elif i == n - 1:\r\n return abs(arr[i] - arr[i-1])\r\n else:\r\n if abs(arr[i] - arr[i+1]) > abs(arr[i] - arr[i-1]):\r\n return abs(arr[i] - arr[i-1])\r\n return abs(arr[i] - arr[i+1])\r\n\r\ndef maxi(i):\r\n if abs(arr[i]-arr[0]) > abs(arr[i]-arr[-1]):\r\n return abs(arr[i]-arr[0])\r\n return abs(arr[i]-arr[-1])\r\n\r\nfor i in range(n):\r\n print(mini(i), maxi(i))\r\n", "def lineland(i, lst):\r\n # list1=[]\r\n if i == 0:\r\n c = abs(lst[1]-lst[0])\r\n a = abs(lst[-1]-lst[0])\r\n elif i==len(lst)-1:\r\n c=abs(lst[i-1]-lst[i])\r\n a=abs(lst[i]-lst[0])\r\n else:\r\n if abs(lst[i]-lst[i-1]) > abs(lst[i]-lst[i+1]):\r\n c = abs(lst[i]-lst[i+1])\r\n else:\r\n c = abs(lst[i]-lst[i-1])\r\n\r\n if abs(lst[i]-lst[0]) > abs(lst[i]-lst[-1]):\r\n a = abs(lst[i]-lst[0])\r\n else:\r\n a = abs(lst[i]-lst[-1])\r\n return c, a\r\n # list1.append(a)\r\n # list1.remove(0)\r\n\r\n return ()\r\n\r\n\r\nn = int(input())\r\nlst = list(map(int, input().split()))\r\nfor i in range(len(lst)):\r\n p, q = lineland(i, lst)\r\n print(p, q)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if i==0:\r\n mini=abs(x[i]-x[i+1])\r\n maxi=abs(x[i]-x[n-1])\r\n elif(i==n-1):\r\n mini=abs(x[i]-x[i-1])\r\n maxi=abs(x[i]-x[0])\r\n else:\r\n maxi=max(abs(x[i]-x[0]),abs(x[i]-x[n-1]))\r\n mini=min(abs(x[i]-x[i-1]),abs(x[i]-x[i+1]))\r\n print(mini,maxi)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nfor i in range (n):\r\n maxima = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[n-1]))\r\n \r\n if i == 0:\r\n minima = abs(cities[i] - cities[i+1])\r\n elif i == n - 1:\r\n minima = abs(cities[i] - cities[i-1])\r\n else:\r\n minima = min(abs(cities[i] - cities[i-1]), abs(cities[i] - cities[i+1]))\r\n \r\n print(f\"{minima} {maxima}\")", "n = int(input())\nlst = list(map(int,input().split()))\nmi = lst[0+1] - lst[0]\nma = lst[len(lst)-1] - lst[0]\nprint(mi,ma)\nfor i in range(1,len(lst)-1):\n mi =min(lst[i+1] - lst[i],lst[i] - lst[i-1])\n ma = max(lst[n-1] - lst[i],lst[i]-lst[0])\n print(mi,ma)\nmi = lst[n-1] - lst[n-2]\nma = lst[n-1] - lst[0]\nprint(mi,ma)\n\t \t \t\t \t \t \t \t \t \t\t", "n = int(input())\r\nx = list(map(int, input().split()))\r\nmin = 0\r\nmax = 0\r\nfor i in range(0, n):\r\n if x[i] == x[0]:\r\n min = abs(x[0] - x[1])\r\n max = abs(x[0] - x[-1])\r\n elif x[i] == x[-1]:\r\n min = abs(x[-2] - x[-1])\r\n max = abs(x[0] - x[-1])\r\n elif abs(x[i] - x[i-1]) <= abs(x[i+1] - x[i]):\r\n min = abs(x[i] - x[i-1])\r\n elif abs(x[i] - x[i-1]) > abs(x[i+1] - x[i]):\r\n min = abs(x[i+1] - x[i])\r\n if abs(x[i] - x[-1]) >= abs(x[0] - x[i]):\r\n max = abs(x[i] - x[-1])\r\n elif abs(x[i] - x[-1]) < abs(x[0] - x[i]):\r\n max = abs(x[0] - x[i])\r\n print(min, max)", "ri=lambda:map(int,input().split())\r\nimport math\r\ndef f():\r\n n=int(input())\r\n a=list(ri())\r\n b=[]\r\n for i in range(n):\r\n if i!=0 and i!=n-1:\r\n mn=min(abs(a[i]-a[i-1]),abs(a[i]-a[i+1]))\r\n elif i==0:\r\n mn=abs(a[i]-a[i+1])\r\n if i!=n-1:\r\n mx=max(abs(a[i]-a[0]),abs(a[i]-a[-1]))\r\n else:\r\n mx=abs(a[i]-a[0])\r\n mn=abs(a[i]-a[i-1])\r\n b.append((mn,mx))\r\n for i in b:\r\n print(*i) \r\nf()\r\n \r\n \r\n \r\n", "inp = int(input())\r\nlista = []\r\n\r\nlista = [int(x) for x in input().split()]\r\n\r\nfor i in range(len(lista)):\r\n #Caso for último ou o primeiro\r\n if i == 0:\r\n print(f\"{lista[i+1] - lista[i]} {lista[len(lista)-1] - lista[i]}\")\r\n continue\r\n elif i == len(lista)-1:\r\n print(f\"{lista[len(lista)-1] - lista[len(lista)-2]} {lista[len(lista)-1] - lista[0]}\") \r\n continue\r\n #Printa o primeiro num da resposta\r\n elif lista[i] - lista[i-1] > lista[i+1] - lista[i]:\r\n print(lista[i+1] - lista[i],end=\" \")\r\n else:\r\n print(lista[i] - lista[i-1],end=\" \")\r\n\r\n #Printa o ultimo elemento\r\n if lista[len(lista)-1] - lista[i] > lista[i] - lista[0]:\r\n print(lista[len(lista)-1] - lista[i])\r\n else:\r\n print(lista[i] - lista[0])", "loop = input()\r\nnumbers = input()\r\nlnumbers = numbers.split()\r\nintigers = [int(i) for i in lnumbers]\r\nfor i in range (int(loop)):\r\n mini = 0\r\n maxi = 0\r\n if i == 0:\r\n mini = abs(intigers[0] - intigers[1])\r\n elif i == int(loop)-1:\r\n mini = abs(intigers[i] - intigers[i-1])\r\n else:\r\n min1 = abs(intigers[i] - intigers[i-1])\r\n min2 = abs(intigers[i] - intigers[i + 1])\r\n mini = min(min1, min2)\r\n max1 = abs(intigers[i] - intigers[0])\r\n max2 = abs(intigers[i] - intigers[int(loop)-1])\r\n maxi = max(max1,max2)\r\n\r\n print(mini,maxi)", "n=int(input())\r\nli=list(map(int,input().split(\" \"))) \r\nmi=ma=0\r\nfor i in range(0,n):\r\n if i==0:\r\n mi=abs(li[i]-li[i+1]) \r\n ma=abs(li[i]-li[n-1]) \r\n elif i==n-1:\r\n mi=abs(li[i]-li[i-1])\r\n ma=abs(li[i]-li[0])\r\n else:\r\n mi1=abs(li[i]-li[i+1]) \r\n mi2=abs(li[i]-li[i-1])\r\n mi=min(mi1,mi2)\r\n ma1=abs(li[i]-li[0])\r\n ma2=abs(li[i]-li[n-1])\r\n ma=max(ma1,ma2) \r\n print(mi,ma) \r\n", "from math import floor , sqrt\r\nfrom sys import stdin\r\n\r\n# input = stdin.readline\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n arr = list(map(int , input().split()))\r\n\r\n start = arr[0]\r\n end = arr[-1]\r\n\r\n for i in range(n):\r\n if i == 0:\r\n print(arr[1] - arr[0], arr[-1] - arr[0])\r\n\r\n elif i == n-1:\r\n print(arr[-1] - arr[-2], arr[-1] - start)\r\n\r\n else:\r\n print(min(abs(arr[i] - arr[i-1]), abs(arr[i] - arr[i+1])), max(abs(arr[i] - start), abs(arr[i] - end)))", "t = int(input())\nl = [int(x) for x in input().split()]\nif(len(l) > 1):\n for i in range(len(l) - 1):\n largest = 0\n smallest = 0\n if(i == 0):\n if(l[-1] > l[0]):\n largest = l[-1] - l[i]\n smallest = l[i +1]- l[i]\n print(smallest,largest)\n b = largest\n else:\n largest = l[i] - l[-1]\n smallest = l[i +1]- l[i]\n print(smallest,largest)\n \n else:\n largest = l[-1] - l[i]\n b = l[i] - l[0]\n smallest = l[i] - l[i-1]\n c = l[i+1] - l[i]\n if(b > largest):\n largest = b \n if(c < smallest):\n smallest = c\n else:\n if(c < smallest):\n smallest = c \n print(smallest,largest)\n largest = l[-1] - l[0]\n smallest = l[-1]- l[-2]\n \n print(smallest,largest)\nelse:\n print(\"-\"+str(l[0])+\" \"+\"0\")\n print(l[0],0)\n\t \t \t \t \t\t \t \t\t\t\t \t\t\t\t\t \t", "n = int(input())\r\nlist1 = [int(x) for x in input().split(' ')]\r\nlist2 = []\r\nfor i in range(n):\r\n min_num = min(abs(list1[i] - list1[i-1]), abs(list1[i] - list1[(i+1)%n]))\r\n max_num = max(abs(list1[i] - list1[-1]), abs(list1[i] - list1[0]))\r\n list2.append([min_num, max_num])\r\nfor i in range(n):\r\n print(str(list2[i][0]) + ' ' + str(list2[i][1]))\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n#\r\n# ------------------------------------------------------------------------------\r\n# Author: Mohammad Mohsen\r\n# Date: Tue Feb 8 12:23:38 2022\r\n# problem name: Lineland_Mail\r\n# contest: 567-Codeforces Round #Pi (Div. 2)\r\n# problem difficulty: A-D2\r\n# problem url: https://codeforces.com/contest/567/problem/A\r\n# ------------------------------------------------------------------------------\r\n\r\nfrom typing import *\r\nfrom io import StringIO\r\n\r\n\r\nclass City(object):\r\n __slots__ =[\"x\", \"min_distance\", \"max_distance\"]\r\n def __init__(self, x: int, min_distance: int, max_distance: int) -> None:\r\n self.x = x\r\n self.min_distance = min_distance\r\n self.max_distance = max_distance\r\n\r\n\r\nclass Problem(object):\r\n\r\n def __init__(self, name: str) -> None:\r\n self.name: str = name\r\n\r\n def solution(self) -> Union[str, int, float]: \r\n with StringIO() as out_file:\r\n num_of_cities: int = int(input().strip())\r\n cities: List[Dict[str, int]] = [City(int(i), 0, 0) for i in input().strip().split()]\r\n\r\n # city 0\r\n cities[0].min_distance = abs(cities[0].x - cities[1].x)\r\n cities[0].max_distance = abs(cities[0].x - cities[num_of_cities - 1].x)\r\n\r\n # city N - 1\r\n cities[num_of_cities - 1].min_distance = abs(cities[num_of_cities - 1].x - cities[num_of_cities - 2].x)\r\n cities[num_of_cities - 1].max_distance = abs(cities[num_of_cities - 1].x - cities[0].x)\r\n\r\n # cities n [1: N - 2]\r\n for city in range(1, num_of_cities - 1):\r\n cities[city].min_distance = min((abs(cities[city].x - cities[city - 1].x), abs(cities[city].x - cities[city + 1].x)))\r\n cities[city].max_distance = max((abs(cities[city].x - cities[0].x), abs(cities[city].x - cities[num_of_cities - 1].x)))\r\n\r\n for city in cities:\r\n print(f\"{city.min_distance} {city.max_distance}\", file=out_file)\r\n\r\n return out_file.getvalue()\r\n\r\n\r\nproblem = Problem(\"Lineland_Mail\")\r\n\r\nif __name__ == \"__main__\":\r\n solution: Union[str, int, float] = problem.solution()\r\n print(solution)\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nfor index in range(len(arr)):\r\n prev = float('inf') if index - 1 < 0 else arr[index-1]\r\n nxt = float('inf') if index + 1 >= n else arr[index+1]\r\n m = 0\r\n cur = arr[index]\r\n if prev == float('inf'):\r\n m = abs(cur-nxt)\r\n elif nxt == float('inf'):\r\n m = abs(cur-prev)\r\n else:\r\n m = min(abs(cur-prev), abs(cur-nxt))\r\n\r\n b = max(abs(cur-arr[0]), abs(cur-arr[-1]))\r\n print((\"%d %d\") % (m, b))", "n = int(input())\nline = list(map(int, input().split()))\n\nfor i in range(n):\n if i == 0:\n minimum, maximum = abs(line[i+1] - line[i]), abs(line[-1] - line[i])\n elif i == n-1:\n minimum, maximum = abs(line[i] - line[i-1]), abs(line[i] - line[0])\n else:\n minimum, maximum = min(abs(line[i-1] - line[i]), abs(line[i+1] - line[i])), max(abs(line[i] - line[-1]), abs(line[i] - line[0]))\n\n print(minimum, maximum)\n\n", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\n\r\nprint(x[1] - x[0], x[n-1] - x[0])\r\nfor i in range(1, n-1):\r\n a = min(abs(x[i-1] - x[i]), abs(x[i+1] - x[i]))\r\n b = max(abs(x[0] - x[i]), abs(x[n-1] - x[i]))\r\n print(a, b)\r\n\r\nprint(x[n-1] - x[n-2], x[n-1] - x[0])\r\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\narr=sorted(arr)\r\n# ar=[0]*(n+2)\r\n# print(ar)\r\n# print(arr)\r\nprint(arr[1]-arr[0],arr[n-1]-arr[0])\r\nfor i in range(1,n-1):\r\n # print(i)\r\n mn=min(arr[i]-arr[i-1],arr[i+1]-arr[i])\r\n mx=max(arr[i]-arr[0],arr[n-1]-arr[i])\r\n # print(arr[i-1],arr[i],arr[(i+1)%n])\r\n print(mn,mx)\r\nprint(arr[n-1]-arr[n-2],arr[n-1]-arr[0])", "n=int(input())\r\n\r\na=list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i==0:\r\n low=abs(a[0]-a[1])\r\n high=abs(a[0]-a[-1])\r\n print(low,high)\r\n\r\n elif i==(n-1):\r\n low = abs(a[-1] - a[-2])\r\n high = abs(a[0] - a[-1])\r\n print(low, high)\r\n\r\n else:\r\n low=min(abs(a[i]-a[i-1]) , abs(a[i]-a[i+1]))\r\n \r\n high=max(abs(a[i]-a[0]),abs(a[i]-a[-1]))\r\n \r\n print(low,high)", "n,a=int(input()),[*map(int,input().split())]\r\nfor i in range(n):print(min(a[i]-a[i-1] if i>0 else 10000000000,a[i+1]-a[i] if i<n-1 else 10000000000),max(a[i]-a[0],a[n-1]-a[i]))", "n = input()\r\nl1 = input()\r\nl = [int(i) for i in l1.split()]\r\nfor i in range(0,len(l)):\r\n if i == 0:\r\n print(abs(l[0]-l[1]),abs(l[-1]-l[0]))\r\n elif i == len(l)-1:\r\n print(abs(l[-1]-l[-2]),abs(l[-1]-l[0]))\r\n else:\r\n print(min(abs(l[i]-l[i+1]),abs(l[i]-l[i-1])),max(abs(l[i]-l[0]),abs(l[i]-l[-1]))) \r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n for i in range(n):\r\n if i == 0:\r\n min_i = abs(a[i] - a[i + 1])\r\n elif i == n - 1:\r\n min_i = abs(a[i] - a[i - 1])\r\n else:\r\n min_i = min(abs(a[i] - a[i - 1]), abs(a[i] - a[i + 1]))\r\n max_i = max(abs(a[i] - a[0]), abs(a[i] - a[-1]))\r\n print(min_i, max_i)\r\n\r\n", "t=int(input())\r\nlst=list(map(int,input().split()))\r\nlst.sort()\r\nfor i in range(len(lst)):\r\n if i==0:\r\n print(abs(lst[0]-lst[1]),abs(lst[-1]-lst[0]))\r\n elif i==len(lst)-1:\r\n print(abs(lst[-1]-lst[-2]),abs(lst[-1]-lst[0]))\r\n else:\r\n print(min(abs(lst[i-1]-lst[i]),abs(lst[i+1]-lst[i])),max(abs(lst[-1]-lst[i]),abs(lst[0]-lst[i])))\r\n", "import sys\r\nimport heapq as h\r\nfrom collections import deque\r\nfrom itertools import accumulate\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 riaset(): return set(map(int, sys.stdin.readline().split()))\r\ndef ws(s): sys.stdout.write(s)\r\ndef wi(n): sys.stdout.write(str(n) + ' ')\r\ndef wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\\n')\r\n #--------------------Solution------------------------\r\nn = ri()\r\n\r\nlst = ria()\r\nxn = abs(lst[-1]-lst[-2])\r\nyn = abs(lst[-1]-lst[0])\r\nfor i in range(n-1):\r\n \r\n x = min(abs(lst[i+1]-lst[i]),abs(lst[i-1]-lst[i]))\r\n y = max(abs(lst[0]-lst[i]),abs(lst[-1]-lst[i]))\r\n \r\n wi(x);wi(y);ws('\\n')\r\nwi(xn);wi(yn)", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(0, n):\n one = min(abs(a[i] - a[i-1]), abs(a[(i+1)%n] - a[i]))\n two = max(a[i]-a[0], a[n-1]-a[i])\n print(one, two)\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\nprint(abs(l[1]-l[0]),abs(l[0]-l[len(l)-1]))\r\nfor i in range(1,len(l)-1):\r\n print(min(abs(l[i]-l[i-1]),abs(l[i]-l[i+1])),max(abs(l[i]-l[0]),abs(l[i]-l[len(l)-1])))\r\nprint (abs(l[len(l)-1]-l[len(l)-2]),abs(l[0]-l[len(l)-1])) ", "n = int(input())\nmas = list(map(int,input().split()))\nfor i in range(n):\n print(min(abs(mas[i]-mas[(i-1)%n]),abs(mas[i]-mas[(i+1)%n])),end=' ')\n print(max(abs(mas[i]-mas[0]),abs(mas[i]-mas[-1])))", "n = int(input())\r\narr = list(map(int,input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n mn = abs(arr[i+1] - arr[i])\r\n mx = abs(arr[-1] - arr[i])\r\n print(mn,mx)\r\n elif i == n-1:\r\n mn = abs(arr[i] - arr[i-1])\r\n mx = abs(arr[i] - arr[0])\r\n print(mn,mx)\r\n else:\r\n mn1 = abs(arr[i+1] - arr[i])\r\n mn2 = abs(arr[i] - arr[i-1])\r\n mx1 = mx = abs(arr[-1] - arr[i])\r\n mx2 = mx = abs(arr[i] - arr[0])\r\n print(min(mn1,mn2), max(mx1,mx2))\r\n", "n=int(input())\r\na=[int(a) for a in input().split()]\r\nfor i in range(n):\r\n if i==0:\r\n mini=abs(a[i]-a[i+1])\r\n maxi=abs(a[i]-a[n-1])\r\n print(mini,maxi)\r\n elif i==n-1:\r\n mini=abs(a[i]-a[i-1])\r\n maxi=abs(a[i]-a[0])\r\n print(mini,maxi)\r\n else:\r\n mini=min(abs(a[i]-a[i-1]),abs(a[i]-a[i+1]))\r\n maxi=max(abs(a[i]-a[0]),abs(a[i]-a[n-1]))\r\n print(mini,maxi)", "n = int(input())\ndist = list(map(int,input().split()))\n\nfor cidade in range(n):\n perto = longe = 0\n\n if cidade == 0:\n perto = dist[1] - dist[0]\n longe = dist[n - 1] - dist[0]\n \n elif cidade == n - 1:\n perto = dist[n - 1] - dist[n -2]\n longe = dist[n - 1] - dist[0]\n \n else:\n pertodireita = dist[cidade + 1] - dist[cidade]\n pertoesquerda = dist[cidade] - dist[cidade - 1] \n longedireita = dist[n - 1] - dist[cidade]\n longeesquerda = dist[cidade] - dist[0]\n\n perto = min(pertodireita,pertoesquerda)\n longe = max(longedireita,longeesquerda)\n \n print(perto,longe)\n \t \t\t\t \t \t \t \t\t \t \t \t\t \t", "import sys\r\n\r\nidx = 0\r\ncities = []\r\nfor line in sys.stdin:\r\n if idx == 1:\r\n temp = line.split()\r\n for i in temp:\r\n cities.append(int(i))\r\n break\r\n else:\r\n idx += 1\r\ncities.sort()\r\n\r\nreturn_list = []\r\nfor idx in range(len(cities)):\r\n if idx == len(cities) - 1:\r\n min = cities[idx] - cities[idx - 1]\r\n max = cities[idx] - cities[0]\r\n return_list.append([min,max])\r\n continue\r\n if abs(cities[idx] - cities[idx + 1]) > abs(cities[idx] - cities[idx - 1]):\r\n min = abs(cities[idx] - cities[idx - 1])\r\n else:\r\n min = abs(cities[idx] - cities[idx + 1])\r\n if abs(cities[idx] - cities[0]) > abs(cities[idx] - cities[-1]):\r\n max = abs(cities[idx] - cities[0])\r\n else:\r\n max = abs(cities[idx] - cities[-1])\r\n return_list.append([min,max])\r\n \r\nfor i in return_list:\r\n print('{min} {max}'.format(min = i[0], max = i[1]))\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\ncities = list(map(int, input().strip().split()))\r\n\r\nprint(cities[1] - cities[0], end=\" \")\r\nprint(cities[-1] - cities[0])\r\n\r\nfor i in range(1, len(cities)-1):\r\n print(min(cities[i+1] - cities[i], cities[i] - cities[i-1]), end=\" \")\r\n print(max(cities[-1] - cities[i], cities[i] - cities[0]))\r\n\r\nprint(cities[-1] - cities[-2], end=\" \")\r\nprint(cities[-1] - cities[0])\r\n", "n = int(input())\nnums = [int(x) for x in input().split()]\n\nfor i in range(n):\n l = 0\n h = 0\n\n if i == 0:\n print((nums[1] - nums[0]), nums[n-1] - nums[0])\n\n elif i == n -1:\n print((nums[i] - nums[i -1]), nums[i] - nums[0])\n\n else:\n if nums[i + 1] - nums[i] >= nums[i] - nums[i - 1]:\n l = nums[i] - nums[i - 1]\n else:\n l = nums[i + 1] - nums[i]\n\n if nums[n - 1] - nums[i] >= nums[i] - nums[0]:\n h = nums[n - 1] - nums[i]\n else:\n h = nums[i] - nums[0]\n \n print(l, h)\n\n", "N = int(input())\r\nnumber = [int(i) for i in input().split()]\r\narr_max = []; arr_min = [] ; F = number[0]; L = number[-1]\r\nfor num in number:\r\n arr_max.append(max(abs(num - F), abs(num - L)))\r\nfor i in range(N):\r\n if i == N - 1:\r\n arr_min.append(abs(number[i] - number[-2]))\r\n elif i == 0:\r\n arr_min.append(abs(number[i] - number[i +1]))\r\n else:\r\n arr_min.append(min(abs(number[i] - number[i +1]), abs(number[i] - number[i - 1])))\r\nfor j in range(N):\r\n print(arr_min[j],\"\",arr_max[j])", "def main():\r\n lenA = int(input())\r\n A = list(map(int, input().split()))\r\n print (abs(A[0] - A[1]), end = \" \")\r\n print (abs(A[0] - A[lenA-1]))\r\n for i in range(1,lenA-1):\r\n print( min( abs(A[i] - A[i+1]), abs(A[i] - A[i-1])), end = \" \")\r\n print (max( abs(A[i] - A[lenA-1]), abs(A[i] - A[0])))\r\n print (abs(A[lenA-1] - A[lenA-2]), end = \" \")\r\n print (abs(A[lenA-1] - A[0]))\r\n return\r\n\r\nmain()", "n = int(input())\r\na = input()\r\na = a.split()\r\nlst = []\r\nfor i in a:\r\n lst.append(int(i))\r\nmini = lst[0]\r\nmaxi = lst[len(lst)-1]\r\nfor i in range(len(lst)):\r\n if i == 0:\r\n print(abs(lst[i] - lst[i+1]), abs(lst[i] - maxi))\r\n elif i == len(lst)-1:\r\n print(abs(lst[i] - lst[i-1]), abs(lst[i] - mini))\r\n else:\r\n print(min(abs(lst[i] - lst[i-1]), abs(lst[i] - lst[i+1])), max(abs(lst[i] - maxi), abs(lst[i] - mini)))\r\n \r\n ", "n = int(input())\r\nl = list(map(int, input().split()))\r\nq = sorted(l)\r\nfor i in range(n):\r\n a = l[i]\r\n b = q.index(a)\r\n if i == 0:\r\n mn = abs(l[b] - l[b+1])\r\n mx = abs(l[b] - l[-1])\r\n elif i == (n-1):\r\n mn = abs(l[b]-l[b-1])\r\n mx = abs(l[b] - l[0])\r\n else:\r\n mn = min(abs(l[b] - l[b+1]), abs(l[b] - l[b-1]))\r\n mx = max(abs(l[b] - l[0]), abs(l[b] - l[-1]))\r\n print(mn, mx)\r\n\r\n\r\n# a b c d e\r\n", "n = int(input())\r\nx = [int(x) for x in input().split()]\r\nprint(x[1]-x[0], x[n-1]-x[0])\r\nfor i in range(1, n-1):\r\n a = min(x[i]-x[i-1], x[i+1]-x[i])\r\n b = max(x[i]-x[0], x[n-1]-x[i])\r\n print(a, b)\r\nprint(x[n-1]-x[n-2], x[n-1]-x[0])\r\n", "# Bismillah\r\n# In the name of GOD\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nprint(x[1] - x[0], x[-1] - x[0])\r\nfor i in range(1, n - 1):\r\n\tif x[i] - x[i - 1] < x[i + 1] - x[i]:\r\n\t\tmini = x[i] - x[i - 1]\r\n\telse:\r\n\t\tmini = x[i + 1] - x[i]\r\n\tif x[i] - x[0] < x[-1] - x[i]:\r\n\t\tmaxi = x[-1] - x[i]\r\n\telse:\r\n\t\tmaxi = x[i] - x[0]\r\n\tprint(mini, maxi)\r\nprint(x[-1] - x[-2], x[-1] - x[0])\r\n", "n = int(input())\r\nlc = list(map(int, input().split()))\r\n\r\nfor c in range(n):\r\n mi = 0\r\n if c==0:\r\n mi = lc[1]-lc[0]\r\n elif c==n-1:\r\n mi = abs(lc[n-2]-lc[n-1])\r\n else:\r\n mi = min(abs(lc[c-1]-lc[c]), abs(lc[c+1]-lc[c]))\r\n\r\n print(mi, max(abs(lc[-1]-lc[c]), abs(lc[0]-lc[c])))", "n = int(input())\r\nlistofx=[int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n minn=0\r\n maxx=0\r\n if 0<i<(n-1):\r\n\r\n minn = abs(min([(listofx[i+1]-listofx[i]), (listofx[i]-listofx[i-1])]))\r\n maxx = abs(max([(listofx[n-1]-listofx[i]), (listofx[i]-listofx[0])]))\r\n print(minn, maxx , end=\" \")\r\n print()\r\n elif i ==0:\r\n minn = abs(listofx[0]-listofx[1])\r\n maxx = abs(listofx[0]-listofx[n-1])\r\n print(minn, maxx , end=\" \")\r\n print()\r\n else:\r\n minn = abs(listofx[-1] -listofx[-2])\r\n maxx = abs(listofx[-1] - listofx[0])\r\n print(minn, maxx , end=\" \")\r\n print()", "# LUOGU_RID: 101605604\nn, *a = map(int, open(0).read().split())\r\nans = [(abs(a[0] - a[1]), abs(a[0] - a[-1]))]\r\nfor i in range(1, n - 1):\r\n ans += (min(abs(a[i] - a[i - 1]), abs(a[i] - a[i + 1])), max(abs(a[i] - a[0]), abs(a[i] - a[-1]))),\r\nans += (abs(a[-1] - a[-2]), abs(a[0] - a[-1])),\r\nfor x in ans:\r\n print(*x)", "n = int (input())\r\nk = list(map (int , input() . split()))\r\nmax_A = []\r\nmin_A = []\r\nfor i in range(n):\r\n l = []\r\n if i == 0 :\r\n dis_min = k[i+1] - k[i]\r\n dis_max = k[-1] - k[i]\r\n max_A.append(dis_max)\r\n min_A.append(dis_min)\r\n elif i == n-1:\r\n dis_min = k[-1] - k[i-1]\r\n dis_max = k[-1] - k[0]\r\n max_A.append(dis_max)\r\n min_A.append(dis_min)\r\n else:\r\n l.append( k[-1] - k[i])\r\n l.append( k[i] - k[0])\r\n l.append( k[i+1] - k[i])\r\n l.append( k[i] - k[i-1])\r\n max_l = max(l)\r\n min_l = min(l)\r\n max_A.append(max_l)\r\n min_A.append(min_l)\r\n\r\nfor j in range(len(max_A)):\r\n print(min_A[j],max_A[j])", "n = int(input())\r\ncities = list(map(int,input().split()))\r\n\r\ndef calc_diff(a,b) :\r\n if a* b < 0 :\r\n return abs(a) + abs(b)\r\n return abs(abs(a) - abs(b))\r\n\r\nprint(calc_diff(cities[0],cities[1]),calc_diff(cities[0],cities[-1]))\r\nfor i in range(1,n-1):\r\n print(min(calc_diff(cities[i],cities[i-1]),calc_diff(cities[i],cities[i+1])),max(calc_diff(cities[i],cities[0]),calc_diff(cities[i],cities[-1])))\r\n\r\n\r\nprint(calc_diff(cities[-2],cities[-1]),calc_diff(cities[0],cities[-1]))\r\n\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n print(min(abs(x[i]-x[i-1]), abs(x[i]-x[(i+1)%n])), max(x[i]-x[0], x[n-1]-x[i]))", "n=int(input())\r\nlist1=list(map(int,input().split(\" \")))\r\nfor i in range(0,n):\r\n if i==0:\r\n print(abs(list1[0]-list1[1]),abs(list1[0]-list1[n-1]))\r\n elif i==n-1:\r\n print(abs(list1[-1]-list1[-2]),abs(list1[0]-list1[n-1]))\r\n else:\r\n print(min(abs(list1[i-1]-list1[i]),abs(list1[i+1]-list1[i])),max(abs(list1[0]-list1[i]),abs(list1[-1]-list1[i])))\r\n \r\n \r\n \r\n \r\n ", "n = int(input())\ncities = list(map(int, input().split()))\n\nans = []\n\nfor i in range(n):\n if i == 0:\n mn = abs(cities[i] - cities[i+1])\n mx = abs(cities[i] - cities[n-1])\n elif i == n-1:\n mn = abs(cities[i] - cities[i-1])\n mx = abs(cities[i] - cities[0])\n else:\n dist1 = abs(cities[i] - cities[i-1])\n dist2 = abs(cities[i] - cities[i+1])\n mn = min(dist1, dist2)\n\n dist1 = abs(cities[i] - cities[0])\n dist2 = abs(cities[i] - cities[n-1])\n mx = max(dist1, dist2)\n\n ans.append([mn, mx])\n\nfor i in range(n):\n ans[i] = [str(elem) for elem in ans[i]]\n print(\" \".join(ans[i]))\n \t\t \t\t \t \t \t\t\t\t\t\t \t\t\t", "import sys\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nminimum = sys.maxsize\r\nmaximum = 0\r\nfor i in range(len(arr)):\r\n if i == 0:\r\n minimum = abs(arr[i] - arr[i+1])\r\n maximum = abs(arr[i] - arr[len(arr)-1])\r\n elif i == len(arr)-1:\r\n minimum = abs(arr[i] - arr[i-1])\r\n maximum = abs(arr[i] - arr[0])\r\n else:\r\n minimum = min(abs(arr[i] - arr[i - 1]), abs(arr[i]-arr[i+1]))\r\n maximum = max(abs(arr[i] - arr[0]), abs(arr[i]-arr[len(arr)-1]))\r\n print(minimum, \" \", maximum)\r\n minimum = sys.maxsize\r\n maximum = 0", "n=int(input())\nlst=[int(i) for i in input().split()]\nprint(lst[1]-lst[0],lst[n-1]-lst[0])\nfor i in range(1,n-1):\n minimum=min((lst[i+1]-lst[i]),(lst[i]-lst[i-1]))\n maximum=max((lst[i]-lst[0]),(lst[n-1]-lst[i]))\n print(minimum,maximum)\nprint(lst[n-1]-lst[n-2],lst[n-1]-lst[0])\n\t \t\t\t \t \t \t \t \t\t\t \t\t\t\t \t", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n mini = abs(cities[i] - cities[i + 1])\r\n elif i == n - 1:\r\n mini = abs(cities[i] - cities[i - 1])\r\n else:\r\n mini = min(abs(cities[i] - cities[i - 1]), abs(cities[i] - cities[i + 1]))\r\n\r\n maxi = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[n - 1]))\r\n\r\n print(mini, maxi)", "n=int(input())\nlst=list(map(int,input().split()))\nsorted(lst)\nmini=lst[0]\nmaxi=lst[n-1]\nprint(lst[1]-lst[0],maxi-mini)\nfor i in range(1,n-1):\n\tprint(min(lst[i]-lst[i-1],lst[i+1]-lst[i]),max(maxi-lst[i],lst[i]-mini))\nprint(lst[n-1]-lst[n-2],maxi-mini)\n\t \t\t\t\t \t\t\t\t \t\t \t \t\t\t \t \t\t", "n = int(input())\r\npoints = list(map(int, input().split()))\r\npoints.sort()\r\nresult = []\r\n\r\n\r\ndef findMinMax(ps, val, index):\r\n if index == 0:\r\n mn = abs(val-ps[index+1])\r\n mx = abs(val-ps[-1])\r\n elif val == ps[-1]:\r\n mn = abs(val - ps[index-1])\r\n mx = abs(val - ps[0])\r\n else:\r\n mx = max(abs(val - ps[0]), abs(val - ps[-1]))\r\n mn = min(abs(val-ps[index-1]), abs(val-ps[index+1]))\r\n return mn, mx\r\n\r\n\r\nfor i in range(n):\r\n mn, mx = findMinMax(points, points[i], i)\r\n result.append([mn, mx])\r\n\r\nfor i in result:\r\n print(i[0], i[1])\r\n", "n=int(input())\nls=list(map(int,input().split()))\nprint(ls[1]-ls[0],ls[n-1]-ls[0])\nfor i in range(1,n-1):\n print(min(ls[i]-ls[i-1],ls[i+1]-ls[i]),max(ls[n-1]-ls[i],ls[i]-ls[0]))\nprint(ls[n-1]-ls[n-2],ls[n-1]-ls[0])\n\t\t\t \t\t\t\t \t\t\t\t \t\t\t \t \t\t\t\t", "# Problem: A. Lineland Mail\r\n# Contest: Codeforces - Codeforces Round #Pi (Div. 2)\r\n# URL: https://codeforces.com/contest/567/problem/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 3000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nfor i in range(n):\r\n\tif i==0:\r\n\t\tprint(abs(l[1]-l[0]),abs(l[-1]-l[0]))\r\n\telif i==n-1:\r\n\t\tprint(abs(l[i]-l[-2]),abs(l[i]-l[0]))\r\n\telse:\r\n\t\ta=min(abs(l[i]-l[i+1]),abs(l[i]-l[i-1]))\r\n\t\tb=max(abs(l[i]-l[0]),abs(l[i]-l[-1]))\r\n\t\tprint(a,b)", "num_of_cities = int(input())\r\ncoor = list(map(int,input().split())) # coordinates -5 -2 2 7\r\nfor i in range(num_of_cities):\r\n if i == 0:\r\n minimum = abs(coor[i] - coor[i+1])\r\n maximum = abs(coor[i] - coor[-1])\r\n elif i == (num_of_cities - 1):\r\n minimum = abs(coor[i] - coor[i-1])\r\n maximum = abs(coor[i] - coor[0])\r\n else :\r\n minimum = min(abs(coor[i] - coor[i-1]),abs(coor[i] - coor[i+1]))\r\n maximum = max(abs(coor[i] - coor[0]),abs(coor[i] - coor[-1]))\r\n print(minimum ,maximum)\r\n ", "def solver(n: int, arr: tuple):\r\n res = []\r\n if n > 2:\r\n for i in range(n):\r\n if i == 0:\r\n res.append((arr[1] - arr[0], arr[-1] - arr[0]))\r\n elif i == n-1:\r\n res.append((arr[-1] - arr[-2], arr[-1] - arr[0]))\r\n else:\r\n res.append(((min(abs(arr[i] - arr[i-1]), abs(arr[i] - arr[i + 1]))),max(abs(arr[i] - arr[0]),\r\n abs(arr[i] - arr[-1]))))\r\n else:\r\n res.append((arr[-1] - arr[0], arr[-1] - arr[0]))\r\n res.append((arr[-1] - arr[0], arr[-1] - arr[0]))\r\n return res\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr = tuple(map(int, input().split()))\r\n for i in solver(n, arr):\r\n print(*i)\r\n\r\n\r\nmain()\r\n", "n=int(input())\nl=[]\na=list(input().split())\nfor i in range(len(a)):\n a[i]=int(a[i])\na.sort()\nprint(abs(a[0]-a[1]) , abs(a[len(a)-1]-a[0]))\nif n>2:\n for i in range(1, n-1):\n print(min(abs(a[i]-a[i-1]),abs(a[i]-a[i+1])) , max(abs(a[i]-a[0]),abs(a[i]-a[len(a)-1])))\nprint(abs(a[len(a)-1]-a[len(a)-2]) , abs(a[len(a)-1]-a[0])) ", "n = int(input())\ndists = list(map(int, input().split(\" \")))\n\nfor i in range(n):\n curr = dists[i]\n if(i == 0):\n print(abs(curr - dists[i+1]), end = \" \")\n elif(i == n-1):\n print(abs(dists[i-1] - curr), end = \" \")\n else:\n print(min(abs(curr - dists[i+1]), abs(dists[i-1] - curr)), end = \" \")\n \n \n print(max(abs(curr-dists[0]), abs(curr-dists[n-1])))\n \n\n \n \t\t \t\t \t \t\t \t\t\t", "n = int(input())\r\nsps = list(map(int, input().split()))\r\n\r\nmin_for_1 = abs(sps [1] - sps [0])\r\nmax_for_1 = abs(sps [n - 1] - sps [0])\r\nprint (min_for_1, max_for_1)\r\n\r\nfor j in range (1, n - 1):\r\n min_rast_1 = abs(sps [j - 1] - sps [j])\r\n min_rast_2 = abs(sps [j + 1] - sps [j])\r\n \r\n max_rast_1 = abs(sps [0] - sps [j])\r\n max_rast_2 = abs(sps [n - 1] - sps [j])\r\n \r\n if min_rast_1 >= min_rast_2:\r\n minr = min_rast_2\r\n else:\r\n minr = min_rast_1\r\n\r\n if max_rast_1 >= max_rast_2:\r\n maxr = max_rast_1\r\n else:\r\n maxr = max_rast_2\r\n\r\n print (minr, maxr)\r\n \r\nmin_for_last = abs(sps [n - 2] - sps [n - 1])\r\nmax_for_last = abs(sps [0] - sps [n - 1])\r\nprint (min_for_last, max_for_last)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# for i in sps:\r\n # elm = i\r\n # for j in range (len(sps)):\r\n # if j == ind:\r\n # continue\r\n # prmzh = abs(sps [j] - elm)\r\n \r\n # if min_znch == None or max_znch == None:\r\n # min_znch = prmzh\r\n # max_znch = prmzh\r\n # continue\r\n \r\n # if prmzh <= min_znch:\r\n # min_znch = prmzh\r\n # if prmzh >= max_znch:\r\n # max_znch = prmzh\r\n \r\n # print (min_znch, max_znch)\r\n # ind += 1\r\n # min_znch = None\r\n # max_znch = None", "n = int(input())\ncities = [int(city) for city in input().split()]\ni = 0\nwhile i < len(cities):\n if i == 0:\n print(cities[1] - cities[i], cities[len(cities) - 1] - cities[i])\n elif i == len(cities) - 1:\n print(cities[i] - cities[i - 1], cities[i] - cities[0])\n else:\n min_dis = min(cities[i] - cities[i - 1], cities[i + 1] - cities[i])\n max_dix = max(cities[i] - cities[0], cities[len(cities) - 1] - cities[i])\n print(min_dis, max_dix)\n i += 1", "n, x = int(input()), list(map(int, input().split()))\n\nfor i in range(n): \n print(min(abs(x[i - 1] - x[i]), abs(x[i] - x[i - n + 1])), max(x[i] - x[0], x[n - 1] - x[i]))\n\n\t\t \t \t \t \t\t \t\t\t \t\t \t", "# n,k = map(int,input().split())\r\n\r\nn = int (input())\r\nnums = list(map(int, input().split()))\r\nmax = min = 0\r\n\r\nfor i in range (n):\r\n if abs(nums[i] - nums[0]) > abs(nums[len(nums)-1]-nums[i]):\r\n max = abs(nums[i] - nums[0])\r\n else:\r\n max = abs(nums[len(nums)-1]-nums[i])\r\n\r\n if i == 0:\r\n min = abs(nums[1] - nums[0])\r\n elif i == len(nums)-1:\r\n min = abs(nums[i]-nums[i-1] )\r\n else:\r\n if abs(nums[i] - nums[i-1]) > abs(nums[i+1] - nums[i]):\r\n min = abs(nums[i+1] - nums[i])\r\n else:\r\n min = abs(nums[i] - nums[i-1])\r\n\r\n print(min,max)\r\n\r\n", "try:\r\n n = int(input())\r\n x = list(map(int, input().split()))\r\n for i in range(n):\r\n if i == 0:\r\n print(x[1]-x[0], x[n-1]-x[0])\r\n elif i == n-1:\r\n print(x[n-1]-x[n-2],x[n-1]-x[0])\r\n else:\r\n print(min(x[i]-x[i-1], x[i+1]-x[i]), max(x[i]-x[0], x[n-1]-x[i]))\r\nexcept:\r\n pass", "# 567A - Lineland Mail\r\nn, x = int(input()), sorted(list(map(int, input().split())))\r\nx = [x[1]]+x+[x[n-2]]\r\nfor i in range(1, 1+n):\r\n print(min(abs(x[i]-x[i-1]), abs(x[i+1]-x[i])),\r\n max(abs(x[i]-x[1]), abs(x[n]-x[i])))\r\n", "i = int(input())\r\nl = list(map(int,input().split()))\r\nfor x in range(i):\r\n if x == 0:\r\n min = abs(l[1] - l[0])\r\n max = abs(l[0] - l[i-1])\r\n elif x == i-1:\r\n min = abs(l[x] - l[x-1])\r\n max = abs(l[0] - l[x])\r\n else:\r\n if abs((l[x] - l[x-1])) < abs((l[x] - l[x+1])):\r\n min = abs(l[x] - l[x-1])\r\n else:\r\n min = abs(l[x] - l[x+1])\r\n if abs(l[x] - l[0]) > abs(l[x] - l[i-1]):\r\n max = abs(l[x] - l[0])\r\n else:\r\n max = abs(l[x] - l[i-1])\r\n print(min,max)", "import sys\n\ndef converte_positivo(numero):\n positivo = numero if numero >= 0 else numero * -1\n return positivo\n\n\ndef calcula_distancia(ponto1, ponto2):\n distancia = 0\n if ponto1 > 0 and ponto2 > 0:\n distancia = ponto1 - ponto2\n elif ponto1 > 0 and ponto2 < 0:\n distancia = ponto1 + converte_positivo(ponto2)\n elif ponto1 < 0 and ponto2 > 0:\n distancia = converte_positivo(ponto1) + ponto2\n else:\n distancia = converte_positivo(ponto1) - converte_positivo(ponto2)\n\n return converte_positivo(distancia)\n\n\nif __name__ == '__main__':\n n = int(input())\n coordenadas = [int(num) for num in input().split()]\n distancias = []\n #distância do primeiro\n min_primeiro = calcula_distancia(coordenadas[0], coordenadas[1])\n max_primeiro = calcula_distancia(coordenadas[0], coordenadas[n-1])\n distancias.append([min_primeiro, max_primeiro])\n\n # verificar distâncias do meio\n for indice in range(1, n - 1):\n atual = coordenadas[indice]\n esquerda = calcula_distancia(atual, coordenadas[indice - 1])\n direita = calcula_distancia(atual, coordenadas[indice + 1])\n if esquerda <= direita:\n minima = esquerda\n else:\n minima = direita\n\n primeiro = calcula_distancia(atual, coordenadas[0])\n ultimo = calcula_distancia(atual, coordenadas[n - 1])\n if primeiro >= ultimo:\n maxima = primeiro\n else:\n maxima = ultimo\n\n distancias.append([minima, maxima])\n\n # distância do último\n min_ultimo = calcula_distancia(coordenadas[n - 1], coordenadas[n - 2])\n max_ultimo = calcula_distancia(coordenadas[n - 1], coordenadas[0])\n distancias.append([min_ultimo, max_ultimo])\n\n # imprimindo distâncias\n for distancia in distancias:\n print(f'{distancia[0]} {distancia[1]}')\n \t\t\t\t\t\t\t \t\t\t \t\t\t \t \t \t \t\t", "\r\nn=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nfor i in range(n):\r\n if (i==0):\r\n mn,mx=abs(l[i]-l[1]),abs(l[i]-l[-1])\r\n print(mn,mx)\r\n elif(0<i<n-1):\r\n mn=min(abs(l[i]-l[i+1]) ,abs(l[i]-l[i-1])) \r\n mx=max(abs(l[i]-l[0]) ,abs(l[i]-l[-1])) \r\n print(mn,mx)\r\n else:\r\n mn,mx=abs(l[i]-l[i-1]),abs(l[i]-l[0])\r\n print(mn,mx)\r\n\r\n\r\n\r\n", "x, y, z = int(input()), map(int, input().split(\" \")), {}\r\nfor i, v in enumerate(y):\r\n z[i] = v\r\nfor i in range(x):\r\n if i == 0:\r\n print(\"{} {}\".format(abs(z[0] - z[1]), abs(z[0] - z[x-1])))\r\n elif i == x-1:\r\n print(\"{} {}\".format(abs(z[x-1] - z[x-2]), abs(z[x-1] - z[0])))\r\n else:\r\n mn = min(abs(z[i] - z[i-1]), abs(z[i] - z[i+1]))\r\n mx = max(abs(z[i] - z[0]), abs(z[i] - z[x-1]))\r\n print(\"{} {}\".format(mn, mx))", "\nimport sys\n# string=sys.stdin.read()\n# print(\"2018\"+string[4:-1])\n\n\n#P2\n\n# year=int(sys.stdin.read())\n# while year%4!=2:\n# year+=1\n\n# print(year)\n\n\n#P3\n\n# num=int(sys.stdin.read())\n# num=100-(num%100)\n# print(num)\n\n#P4\n# toks = (token for token in sys.stdin.read().split())\n# N=int(next(toks))\n# nutsList=[]\n# for i in range(N):\n# nutsList.append(int(next(toks)))\n\n# total=0\n# for i in nutsList:\n# if(i>10):\n# total=total+(i-10)\n\n# print(total)\n\n\n\n # P5\n# toks = (token for token in sys.stdin.read().split())\n# H=int(next(toks))\n# W=int(next(toks))\n\n# for i in range(H):\n# str=next(toks)\n# print(str)\n# print(str)\n\n\n\n# P6\n# toks = (token for token in sys.stdin.read().split())\n# num=int(next(toks))\n# for i in range(num):\n# x=int(next(toks))\n# y=int(next(toks))\n# n=int(next(toks))\n# if(n%x<y):\n# print(n-(n%x)-(x-y))\n# else:\n# print(n-(n%x)+(y))\n\n# P-D\n# num=int(sys.stdin.read())\n# list=[]\n# for i in range(int(100/4)):\n# for j in range(int(100/7)):\n# list.append(4*i+7*j)\n\n# if num in list:\n# print(\"yes\")\n# else:\n# print(\"no\")\n\n\n# PH\ntoks = (token for token in sys.stdin.read().split())\n\nN=int(next(toks))\nlist=[]\nfor i in range(N):\n list.append(int(next(toks)))\n\nminNum=0\nmaxNum=0\nfor i in range(N):\n if(i==0):\n minNum=list[i+1]-list[i]\n maxNum=list[N-1]-list[0]\n elif(i==N-1):\n minNum=list[i]-list[i-1]\n maxNum=list[N-1]-list[0]\n else:\n minNum=min(list[i+1]-list[i], list[i]-list[i-1])\n maxNum=max(list[i]-list[0], list[N-1]-list[i])\n print(f\"{minNum} {maxNum}\")\n \t\t\t \t \t \t\t\t \t \t\t \t\t \t \t \t", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\n\r\nprint(abs(x[0] - x[1]), abs(x[0] - x[n - 1]))\r\nfor i in range(1, n - 1):\r\n print(min(abs(x[i] - x[i - 1]), abs(x[i] - x[i + 1])),\r\n max(abs(x[i] - x[0]), abs(x[i] - x[n - 1])))\r\nprint(abs(x[-1] - x[-2]), abs(x[-1] - x[0]))\r\n", "n = int(input())\nindices = list(map(int, input().split()))\n \n \nfor i in range(n):\n if i == 0:\n a = indices[i+1] - indices[0]\n b= indices[n-1] - indices[0]\n elif i == n-1:\n a = indices[i] - indices[i-1]\n b = indices[i] - indices[0]\n else:\n a = min(indices[i]- indices[i-1], indices[i+1]-indices[i])\n b = max(indices[n-1] - indices[i], indices[i] - indices[0])\n print(a, b)\n \t\t \t\t \t\t \t \t\t\t \t\t \t\t\t", "n = int(input())\n\ncities = list(map(int, input().split()))\n\nprint(abs(cities[0] - cities[1]), abs(cities[0] - cities[n-1]))\n\nfor i in range(1,n-1):\n minimum = min(abs(cities[i] - cities[i-1]), abs(cities[i] - cities[i + 1]))\n maximum = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[n-1]))\n print(minimum, maximum)\n\nprint(abs(cities[n-1] - cities[n-2]), abs(cities[n-1] - cities[0]))\n", "n = int(input())\nxis = input().strip().split(' ')\nxis = [int(x) for x in xis]\n\nfor i in range(n):\n if i==0:\n print(xis[i+1]-xis[i], end=' ')\n elif i==n-1:\n print(xis[i]-xis[i-1], end=' ')\n else:\n print(min(xis[i+1]-xis[i], xis[i]-xis[i-1]), end=' ')\n \n if i==0:\n print(xis[-1]-xis[i])\n elif i==n-1:\n print(xis[i]-xis[0])\n else:\n print(max(xis[-1]-xis[i], xis[i]-xis[0]))\n \n \n\n\n\n \n \n ", "n = int(input())\r\ncities = [int(i) for i in input().split()]\r\nprint(cities[1]-cities[0], cities[n-1]-cities[0])\r\nfor i in range(1,n-1):\r\n if cities[i]-cities[i-1]<cities[i+1]-cities[i]:\r\n currmin = cities[i]-cities[i-1]\r\n else:\r\n currmin = cities[i+1]-cities[i]\r\n if cities[n-1]-cities[i] > cities[i]-cities[0]:\r\n currMax = cities[n-1]-cities[i]\r\n else:\r\n currMax = cities[i]-cities[0]\r\n print(currmin,currMax)\r\nprint(cities[n-1]-cities[n-2],cities[n-1]-cities[0])", "num = int(input())\r\ncities = [int(i) for i in input().split()]\r\nprint(f\"{abs(cities[0] - cities[1])} {abs(cities[0] - cities[num-1])}\")\r\nfor index, city in enumerate(cities):\r\n if index != (num - 1) and index != 0:\r\n minBetween = min(abs(city - cities[index - 1]), abs(city - cities[index + 1]))\r\n minEnd = max(abs(city - cities[0]), abs(city - cities[num - 1]))\r\n print(f\"{min(minBetween, minEnd)} {max(minBetween, minEnd)}\")\r\nprint(f\"{abs(cities[num - 1] - cities[num - 2])} {abs(cities[num - 1] - cities[0])}\", end=\"\")", "n = int(input())\r\nx = list(map(int, input().split()))\r\nmind = [x[1]-x[0]]\r\nmaxd = [x[n-1]-x[0]]\r\nfor i in range(1, n-1):\r\n mind.append(min(x[i]-x[i-1], x[i+1]-x[i]))\r\n maxd.append(max(x[i]-x[0], x[n-1]-x[i]))\r\nmind.append(x[n-1]-x[n-2])\r\nmaxd.append(x[n-1]-x[0])\r\nfor i in range(n):\r\n print(mind[i], maxd[i])", "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]))#might need to remove the -1\r\ndef invr():\r\n return(map(int,input().split()))\r\nn = inp()\r\ns = inlt()\r\nprint(s[1]-s[0], s[-1]-s[0])\r\nfor i in range(1, n-1):\r\n m = min(s[i+1]-s[i], s[i]-s[i-1])\r\n M = max(s[i]-s[0], s[-1]-s[i])\r\n print(m, M)\r\nprint(s[-1]-s[-2], s[-1]-s[0])", "#Strings always win!\r\nNo = int(input())\r\nW = list(map(int,input().split()))\r\n\r\nfor i in range(No):\r\n if i !=0 and i !=(No-1) :\r\n print(min(abs(W[i]-W[i-1]),abs(W[i]-W[i+1])),end = \" \")\r\n print(max(abs(W[i]-W[No-1]),abs(W[i]-W[0])))\r\n if i ==0:\r\n print(abs(W[i]-W[i+1]),end = \" \")\r\n print(abs(W[i]-W[No-1]))\r\n\r\n if i == (No-1):\r\n print(abs(W[i]-W[i-1]),end = \" \")\r\n print(abs(W[i]-W[0]))", "from math import sqrt\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n MAX = sqrt((a[-1] - a[0])**2)\r\n MIN = sqrt((a[1] - a[0])**2)\r\n print(int(MIN), int(MAX))\r\n elif i == n - 1:\r\n MAX = sqrt((a[0] - a[-1])**2)\r\n MIN = sqrt((a[-2] - a[-1])**2)\r\n print(int(MIN), int(MAX))\r\n else:\r\n start = sqrt((a[0] - a[i])**2)\r\n end = sqrt((a[-1] - a[i])**2)\r\n if start > end:\r\n MAX = start\r\n else:\r\n MAX = end\r\n\r\n left = sqrt((a[i - 1] - a[i])**2)\r\n right = sqrt((a[i + 1] - a[i])**2)\r\n if left > right:\r\n MIN = right\r\n else:\r\n MIN = left\r\n\r\n print(int(MIN), int(MAX))", "import math\r\nn=int(input())\r\nnum=list(map(int,input().split()))\r\nfor i in range(n):\r\n if i!=0 and i!=n-1:\r\n min=[num[i+1]-num[i],num[i]-num[i-1]]\r\n min.sort()\r\n min=min[0]\r\n max=[num[-1]-num[i],num[i]-num[0]]\r\n max.sort()\r\n max=max[1]\r\n print(min,max)\r\n else:\r\n max=int(math.fabs(num[-1]-num[0]))\r\n if i==0:\r\n min=num[1]-num[0]\r\n elif i==n-1:\r\n min=num[-1]-num[-2]\r\n print(min,max)", "n=int(input())\na=list(map(int, input().split()))\nfor i in range(n):\n\tif(i==0):\n\t\ty=abs(a[i]-a[i+1])\n\t\tx=abs(a[i]-a[n-1])\n\telif(i==n-1):\n\t\ty=abs(a[i]-a[i-1])\n\t\tx=abs(a[i]-a[0])\n\telse:\n\t\tx=max(abs(a[i]-a[0]),abs(a[i]-a[n-1]))\n\t\ty=min(abs(a[i]-a[i+1]),abs(a[i]-a[i-1]))\n\tprint(y,x)\n\t\t\n \t \t\t\t \t\t\t\t \t \t\t \t \t", "n = int(input())\r\nc = [int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n min = abs(c[0] - c[1])\r\n max = abs(c[0] - c[-1])\r\n print(min, max)\r\n elif i == len(c) - 1:\r\n min = abs(c[-1] - c[-2])\r\n max = abs(c[-1] - c[0])\r\n print(min, max)\r\n else:\r\n min = abs(c[i-1] - c[i])\r\n min1 = abs(c[i + 1] - c[i])\r\n max = abs(c[-1] - c[i])\r\n max1 = abs(c[0] - c[i])\r\n one = 0\r\n two = 0\r\n if min <= min1:\r\n one = min\r\n else:\r\n one = min1\r\n if max >= max1:\r\n two = max\r\n else:\r\n two = max1\r\n print(one, two)\r\n", "n,x = int(input()),list(map(int,input().split()));x.insert(0,10000000000);x.append(1000000000000)\r\nfor i in range(1,n+1):print(min(abs(x[i]-x[i-1]),abs(x[i]-x[i+1])),max(abs(x[i]-x[-2]),abs(x[i]-x[1])))", "n=int(input())\r\narr=list(sorted(map(int,input().split())))\r\nfor i in range(n):\r\n if i==0:\r\n print(abs(arr[i]-arr[i+1]),abs(arr[i]-arr[n-1]))\r\n elif i==n-1:\r\n print(abs(arr[i]-arr[i-1]),abs(arr[i]-arr[0]))\r\n else:\r\n print(min(abs(arr[i]-arr[i+1]),abs(arr[i]-arr[i-1])),max(abs(arr[i]-arr[0]),abs(arr[i]-arr[n-1])))", "l=int(input())\nn=list(map(int,input().split()))[:l]\nsol=[]\nfor i in range(l):\n\n if i==0:\n print(abs(n[1]-n[0]),abs(n[l-1]-n[0]),sep=\" \")\n elif i==l-1:\n print(abs(n[l-1]-n[l-2]),abs(n[l-1]-n[0]),sep=\" \")\n else:\n a=abs(n[i]-n[i-1])\n b=abs(n[i+1]-n[i])\n c=abs(n[i]-n[0])\n d=abs(n[i]-n[l-1])\n print(min(a,b),max(c,d),sep=\" \")\n\t \t\t \t \t \t\t\t\t \t\t \t \t \t\t", "n = int(input())\r\nxi = [int(i) for i in input().split(\" \")]\r\n\r\nfor i in range(n):\r\n left_distance = right_distance = float('inf')\r\n if i != 0:\r\n left_distance = xi[i] - xi[i - 1]\r\n if i != n-1:\r\n right_distance = xi[i+1]-xi[i]\r\n maximum = max(abs(xi[n-1] - xi[i]), abs(xi[i] - xi[0]))\r\n minimum = min(left_distance, right_distance)\r\n print(minimum, maximum)\r\n", "n = int(input())\r\ninp = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n print(abs(inp[i] - inp[i+1]), abs(inp[i] - inp[n-1]))\r\n elif i == n-1:\r\n print(abs(inp[i] - inp[i-1]), abs(inp[i] - inp[0]))\r\n else:\r\n print(min(abs(inp[i] - inp[i-1]), abs(inp[i] - inp[i+1])), max(abs(inp[i] - inp[n-1]), abs(inp[i] - inp[0])))", "x=int(input())\r\ny1=input().split()\r\ny=[]\r\nfor i in y1:\r\n y.append(int(i))\r\na,b=min(y),max(y)\r\nfor i in range(x):\r\n h=0\r\n if y[i]==a:\r\n print(f'{y[i+1]-a} {b-a}')\r\n elif y[i]==b:\r\n print(f'{b-y[i-1]} {b-a}')\r\n else:\r\n if y[i]-a<b-y[i]:\r\n h=b-y[i]\r\n else:\r\n h=y[i]-a\r\n if y[i]-y[i-1]<y[i+1]-y[i]:\r\n print(f'{y[i]-y[i-1]} {h}')\r\n else:\r\n print(f'{y[i+1]-y[i]} {h}')\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n t = x[i]\r\n print(min(abs(t-x[i-1]), abs(x[(i+1) % n]-t)), max(t-x[0], x[n-1]-t))\r\n ", "n = int(input())\nA = list(map(int, input().split()))\nfor i in range(n):\n if i == 0:\n print(str(A[1] - A[0]) + \" \" + str(A[n - 1] - A[0]))\n elif i == n - 1:\n print(str(A[n - 1] - A[n - 2]) + \" \" + str(A[n - 1] - A[0]))\n else:\n print(str(min(A[i + 1] - A[i], A[i] - A[i - 1])) + \" \" + str(max(A[i] - A[0], A[n - 1] - A[i])))\n\t \t \t\t \t \t\t\t \t\t\t \t\t", "n = int(input())\r\nXs = list(map(int, input().split()))\r\n# will contains (min, max)\r\nout = []\r\n\r\nfor i in range(n):\r\n current_city = Xs[i]\r\n if i == 0:\r\n near_city = Xs[1]\r\n far_city = Xs[-1]\r\n elif i == n-1:\r\n near_city = Xs[-2]\r\n far_city = Xs[0]\r\n else:\r\n near_city = Xs[i-1] if abs(current_city-Xs[i-1]) < abs(current_city-Xs[i+1]) else Xs[i+1]\r\n far_city = Xs[-1] if abs(current_city-Xs[-1]) > abs(current_city-Xs[0]) else Xs[0]\r\n \r\n out.append(( abs(current_city-near_city), abs(current_city-far_city)))\r\n\r\nfor o in out:\r\n print(o[0], o[1])", "# Wadea #\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nfor j in range(n):\r\n if j == 0:\r\n print(arr[1]-arr[0],arr[-1]-arr[0])\r\n elif j == n-1:\r\n print(arr[-1]-arr[-2],arr[-1]-arr[0])\r\n else:\r\n if abs(arr[j]-arr[j-1]) > abs(arr[j]-arr[j+1]):\r\n if abs(arr[-1]-arr[j]) > abs(arr[0]-arr[j]):\r\n print(abs(arr[j]-arr[j+1]),abs(arr[-1]-arr[j]))\r\n else:\r\n print(abs(arr[j]-arr[j+1]),abs(arr[0]-arr[j]))\r\n else:\r\n if abs(arr[-1]-arr[j]) > abs(arr[0]-arr[j]):\r\n print(abs(arr[j]-arr[j-1]),abs(arr[-1]-arr[j]))\r\n else:\r\n print(abs(arr[j]-arr[j-1]),abs(arr[0]-arr[j])) \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\n \r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Solution ---- ###########\r\nn=inp()\r\nT = inlt()\r\nfor i in range(n):\r\n #get min_i\r\n if(i==0):\r\n min_i=abs(T[i]-T[i+1])\r\n elif(i==n-1):\r\n min_i=abs(T[i-1]-T[i])\r\n else:\r\n min_i=min(abs(T[i]-T[i+1]),abs(T[i-1]-T[i]))\r\n #get max_i\r\n max_i=max(abs(T[0]-T[i]),abs(T[i]-T[len(T)-1]))\r\n print(\"{} {}\".format(min_i,max_i))", "n=int(input())\r\ns=input()\r\ns=s.split()\r\nlst=[]\r\nbe=int(s[0])\r\nen=int(s[n-1])\r\nfor i in range (0,len(s)):\r\n x=int(s[i])\r\n ma=max(abs(x-en),abs(be-x)) \r\n if i==0 :\r\n a=int(s[i+1])\r\n mi=abs(be-a)\r\n \r\n elif i==len(s)-1 :\r\n a=int(s[i-1])\r\n mi=abs(en-a)\r\n else :\r\n y=int(s[i+1])\r\n z=int(s[i-1])\r\n mi=min(abs(x-y),abs(x-z))\r\n print(mi,ma,end='')\r\n print('')\r\n \r\n", "def solve(arr):\n\n n = len(arr)\n resp = []\n\n for idx,i in enumerate(arr):\n\n maxx = max(arr[-1]-i, i-arr[0])\n \n if idx != 0 and idx != n-1: \n minn = min(arr[idx+1]-i, i-arr[idx-1])\n \n elif idx==0:\n minn = arr[1]-i\n \n else:\n minn = i-arr[-2]\n\n resp.append((minn, maxx))\n\n return resp\n\n\n_ = input()\narr = [int(a) for a in input().split(\" \")]\n\nresp = solve(arr)\n\nfor r in resp:\n print(\" \".join([str(a) for a in r]))\n\t\t \t\t\t \t \t \t\t \t\t \t\t\t\t\t\t\t \t\t", "T=int(input())\na=[int(x) for x in input().split()]\nMi=a[1]-a[0]\nMa=a[-1]-a[0]\nprint(Mi,Ma)\nfor i in range(1,T-1):\n\td1=a[i]-a[i-1]\n\td2=a[i+1]-a[i]\n\tMi=min(d1,d2)\n\tm1=a[i]-a[0]\n\tm2=a[-1]-a[i]\n\tMa=max(m1,m2)\n\tprint(Mi,Ma)\nMi=a[-1]-a[-2]\nMa=a[-1]-a[0]\nprint(Mi,Ma)\n \t\t\t\t \t\t\t\t\t \t\t \t\t\t\t \t", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\n\r\nfor i in range(n):\r\n\tif i != 0:\r\n\t\tx = l[i - 1]\r\n\telse:\r\n\t\tx = l[i + 1]\r\n\t\t\r\n\tif i != n - 1:\r\n\t\ty = l[i + 1]\r\n\telse:\r\n\t\ty = l[i - 1]\r\n\t\t\r\n\tprint(min(abs(l[i] - x), abs(l[i] - y)), max(abs(l[i] - l[0]), abs(l[i] - l[-1])))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 1 22:53:49 2022\r\n\r\n@author: ahlam-islam\r\n\"\"\"\r\n\r\nnumber = int(input())\r\ncoordnate = input().split()\r\n\r\n\r\nfor index , coord in enumerate(coordnate):\r\n if index == number - 1:\r\n theMin = min(int(coord) - int(coordnate[index -1]) , int(coord) - int(coordnate[0]))\r\n theMax = max(int(coord) - int(coordnate[0]) , int(coordnate[-1]) - int(coord))\r\n elif index == 0:\r\n theMin = min(int(coordnate[1]) - int(coordnate[0]) , int(coordnate[-1]) - int(coordnate[0]))\r\n theMax = max(int(coordnate[1]) - int(coordnate[0]) , int(coordnate[-1]) - int(coordnate[0]))\r\n else: \r\n theMax = max(int(coord) - int(coordnate[0]) , int(coordnate[-1]) - int(coord))\r\n theMin = min(int(coord) - int(coordnate[index -1]) , int(coordnate[index+1]) - int(coord))\r\n \r\n print(theMin , theMax)\r\n \r\n\r\n \r\n ", "\r\nn=int(input())\r\nb=list(map(int,input().split()))\r\ni=0\r\nwhile i<n:\r\n\tif i==0:\r\n\t\tprint((b[1]-b[0]),(b[n-1]-b[0]))\r\n\telif i==n-1:\r\n\t\tprint((b[n-1]-b[n-2]),(b[n-1]-b[0]))\r\n\telse:\r\n\t\tprint(min((b[i]-b[i-1]),(b[i+1]-b[i])),max((b[i]-b[0]),(b[n-1]-b[i])))\r\n\ti=i+1\t\t\r\n\t", "n = int(input())\r\nx = input().split()\r\n\r\nfor i in range(n):\r\n x[i] = int(x[i])\r\n \r\nmn = x[1] - x[0]\r\nmx = x[-1] - x[0]\r\n\r\nprint(mn, mx)\r\nfor i in range(1, n-1):\r\n mn = min(x[i +1]-x[i], x[i] - x[i - 1])\r\n mx = max(x[i] - x[0], x[-1] - x[i])\r\n \r\n print(mn, mx)\r\n \r\nmn = x[-1] - x[-2]\r\nmx = x[-1] - x[0]\r\nprint(mn, mx)", "num_cities = int(input())\r\n\r\ncoordinates = list(map(int, input().split()))\r\n\r\nmin_coordinate = min(coordinates)\r\n\r\nif min_coordinate < 0:\r\n coordinates = [coord + min_coordinate for coord in coordinates]\r\n\r\nfor idx, coord in enumerate(coordinates):\r\n if idx == 0:\r\n print(abs(coord - coordinates[idx+1]), abs(coord - coordinates[-1]))\r\n elif idx == num_cities - 1:\r\n print(coord - coordinates[idx-1], coord - coordinates[0])\r\n else:\r\n min_ = min(abs(coord - coordinates[idx+1]), coord - coordinates[idx-1])\r\n max_ = max(abs(coord - coordinates[-1]), coord - coordinates[0])\r\n print(min_, max_)\r\n", "a = int(input())\nb = [-10e10] + list(map(int, input().split())) + [10e10]\nfor c in range(1,a+1):\n d = min(abs(b[c]-b[c-1]),abs(b[c]-b[c+1]))\n e = max(abs(b[c]-b[1]),abs(b[c]-b[-2]))\n print(d,e)\n\n \t \t \t \t \t \t\t\t \t \t\t \t", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n mini = abs(x[i] - x[i+1])\r\n maxi = abs(x[i] - x[n-1])\r\n elif i == n-1:\r\n mini = abs(x[i] - x[i-1])\r\n maxi = abs(x[i] - x[0])\r\n else:\r\n mini = min(abs(x[i] - x[i-1]), abs(x[i] - x[i+1]))\r\n maxi = max(abs(x[i] - x[0]), abs(x[i] - x[n-1]))\r\n print(mini, maxi)\r\n\r\n", "import sys\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n if i==0:\r\n min=abs(a[i]-a[i+1])\r\n max=abs(a[i]-a[len(a)-1])\r\n elif i==len(a)-1:\r\n min=abs(a[i]-a[i-1])\r\n max=abs(a[i]-a[0])\r\n else:\r\n if abs(a[i]-a[i-1])>abs(a[i]-a[i+1]):\r\n min=abs(a[i]-a[i+1])\r\n else:\r\n min=abs(a[i]-a[i-1])\r\n if abs(a[i]-a[0])>abs(a[i]-a[len(a)-1]):\r\n max=abs(a[i]-a[0])\r\n else:\r\n max=abs(a[i]-a[len(a)-1])\r\n print(min,\" \",max)\r\n", "n = int(input())\r\ncord = list(map(int, input().split()))\r\n\r\ncity0 = (abs(cord[0] - cord[1]), abs(cord[0] - cord[len(cord) - 1]))\r\ncity1 = (abs(cord[len(cord)-1] - cord[len(cord)-2]), abs(cord[0] - cord[len(cord) - 1]))\r\n\r\ndist = [city0]\r\nfor i in range(1, len(cord)-1):\r\n mn = min(abs(cord[i] - cord[i+1]), abs(cord[i] - cord[i - 1]))\r\n mx = max(abs(cord[i] - cord[0]), abs(cord[i] - cord[len(cord) - 1]))\r\n dist.append((mn, mx))\r\n\r\ndist.append(city1)\r\n\r\nfor d in dist:\r\n print(*d)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nl.sort()\r\nsize = len(l)\r\n\r\nfor i in range(0, size):\r\n if i == 0 :\r\n print(l[i+1] - l[i], l[size-1]- l[i])\r\n elif i == size-1 :\r\n print(l[i] - l[i-1], l[i] - l[0])\r\n else :\r\n minn = min( (l[i] - l[i-1]), (l[i+1] - l[i]) )\r\n maxx = max( (l[size-1] - l[i]) , (l[i] - l[0]) )\r\n\r\n print(minn, maxx)\r\n", "n = int(input())\r\narray = [int(x) for x in input().split()]\r\nfor idx,val in enumerate(array):\r\n if idx==0:\r\n print(array[idx+1]-val,array[-1]-val)\r\n elif idx==n-1:\r\n print(val-array[idx-1],val-array[0])\r\n else:\r\n prev_min = val - array[idx-1]\r\n prev_max = val - array[0]\r\n next_min = array[idx+1]- val\r\n next_max = array[-1] - val\r\n print(min(prev_min,next_min),max(prev_max,next_max))\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = []\r\nmaX = 0\r\nmiN = 0\r\nfor i in range(len(a)):\r\n if i == 0:\r\n maX = abs(a[0]-a[-1])\r\n miN = abs(a[0]-a[1])\r\n elif i == len(a) - 1:\r\n maX = abs(a[0]-a[-1])\r\n miN = abs(a[i] - a[i-1])\r\n else:\r\n maX = max(abs(a[i]-a[0]), abs(a[i]-a[-1]))\r\n miN = min(abs(a[i]-a[i+1]), abs(a[i]-a[i-1]))\r\n ans.append((miN, maX))\r\n\r\nfor i in range(len(ans)):\r\n print(ans[i][0], ans[i][1])", "citynum = int(input())\ncities = [int(x) for x in input().split()]\nfor i in range(citynum):\n localmin = float('inf')\n if i > 0:\n localmin = min(localmin, abs(cities[i] - cities[i-1]))\n if i < citynum-1:\n localmin = min(localmin, abs(cities[i+1] - cities[i]))\n \n localmax = max(cities[citynum-1] - cities[i], cities[i] - cities[0])\n print(localmin, localmax)\n \t\t\t\t\t\t\t \t \t \t\t \t\t\t\t\t\t\t", "n = int(input())\r\narr = list(map(int, input().split(\" \")))\r\n\r\nfor i in range( len(arr)):\r\n if i == 0:\r\n min_dist = abs(arr[i+1] - arr[i])\r\n max_dist = abs(arr[n-1] - arr[i])\r\n elif i== (n-1):\r\n min_dist = abs(arr[i] - arr[i-1])\r\n max_dist = abs(arr[i] - arr[0])\r\n else:\r\n min_dist = min(abs(arr[i] - arr[i-1]),\r\n abs(arr[i+1] - arr[i]))\r\n max_dist = max(abs(arr[n-1] - arr[i]),\r\n abs(arr[i] - arr[0]))\r\n print(min_dist, max_dist)\r\n", "n, cities, ans = int(input().strip()), list(map(int, input().split())), []\r\ncities.sort()\r\nfor i in range(n):\r\n if i == n-1:\r\n maxi = cities[i]-cities[0]\r\n elif i == 0:\r\n maxi = cities[-1]-cities[i]\r\n else:\r\n maxi = max(cities[-1]-cities[i], cities[i]-cities[0])\r\n if i == n-1:\r\n mini = cities[i]-cities[i-1]\r\n elif i == 0:\r\n mini = cities[i+1]-cities[i]\r\n else:\r\n mini = min(cities[i+1]-cities[i], cities[i]-cities[i-1])\r\n ans.append([mini, maxi])\r\n\r\nfor row in ans:\r\n print(*row)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nfor i in range(n):\r\n if i==0:\r\n print(abs(a[i+1]-a[i]),abs(a[-1]-a[i]))\r\n elif i==n-1:\r\n print(abs(a[n-1]-a[-2]),abs(a[n-1]-a[0]))\r\n else:\r\n m=min(abs(a[i]-a[i-1]),abs(a[i+1]-a[i]))\r\n ma=max(abs(a[-1]-a[i]),abs(a[i]-a[0]))\r\n print(m,ma)", "\r\nn = int(input()) \r\ncities = list(map(int, input().split()))\r\nresult = [] \r\nfor idx in range(len(cities)) : \r\n sou_res = [0,0]\r\n if idx == 0 : \r\n distance_max = ((cities[0] - cities[-1])**2)**0.5\r\n sou_res[1] += int(distance_max)\r\n distance_min = ((cities[0] - cities[1])**2)**0.5\r\n sou_res[0] += int(distance_min)\r\n result.append(sou_res)\r\n sou_res = [0,0]\r\n elif idx == len(cities) - 1 : \r\n distance_max = ((cities[0] - cities[-1])**2)**0.5\r\n sou_res[1] += int(distance_max)\r\n distance_min = ((cities[-1] - cities[-2])**2)**0.5\r\n sou_res[0] += int(distance_min) \r\n result.append(sou_res)\r\n sou_res = [0,0]\r\n else : \r\n distance1 = ((cities[idx] - cities[idx+1])**2)**0.5\r\n distance2 = ((cities[idx] - cities[idx-1])**2)**0.5\r\n sou_res[0] += min(int(distance1),int(distance2))\r\n distance1max = ((cities[idx] - cities[-1])**2)**0.5\r\n distance2max = ((cities[idx] - cities[0])**2)**0.5\r\n sou_res[1] += max(int(distance1max),int(distance2max))\r\n result.append(sou_res)\r\n sou_res = [0,0]\r\nfor i in result : \r\n print(*i) \r\n", "n = int(input())\r\ncrd = list(map(int, input().split()))\r\noutput = []\r\nfor i in range(n):\r\n mx = max(abs(crd[i] - crd[0]), abs(crd[i] - crd[-1]))\r\n if i == 0:\r\n mn = abs(crd[i] - crd[i + 1])\r\n elif i == n - 1:\r\n mn = abs(crd[i] - crd[ i - 1])\r\n else:\r\n mn = min(abs(crd[i] - crd[i - 1]), abs(crd[i] - crd[i + 1]))\r\n output.append([mn, mx])\r\nfor r in output:\r\n print(*r)", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=enumerate(a)\r\nfor i,item in l:\r\n\r\n if i==0:\r\n m=abs(item-a[i+1])\r\n elif i==len(a)-1:\r\n m=abs(item-a[i-1])\r\n else:\r\n m=min(abs(item-a[i-1]),abs(item-a[i+1]))\r\n print(m,max(abs(a[0]-item),abs(a[-1]-item)))\r\n", "n = int(input())\r\ncity = list(map(int, input().split()))\r\nmin_cost = 0\r\nmax_cost = 0\r\n\r\nfor i in range(n):\r\n\r\n if i == 0:\r\n min_cost = abs(city[i] - city[i + 1])\r\n max_cost = abs(city[i] - city[-1])\r\n\r\n\r\n elif i == n-1:\r\n min_cost = abs(city[i] - city[i - 1])\r\n max_cost = abs(city[i] - city[0])\r\n\r\n else:\r\n min_cost = min(abs(city[i] - city[i + 1]), abs(city[i] - city[i - 1]))\r\n max_cost = max(abs(city[i] - city[-1]), abs(city[i] - city[0]))\r\n\r\n print(min_cost, max_cost)\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(l[1]-l[0],l[-1]-l[0])\r\nfor x in range(1,n-1):\r\n\tprint(min(abs(l[x-1]-l[x]),abs(l[x+1]-l[x])),max(abs(l[0]-l[x]),abs(l[n-1]-l[x])))\r\nprint(l[-1]-l[-2],l[-1]-l[0])", "def solve(arr , i , j,s):\r\n\tmi = abs(arr[i]-arr[j])\r\n\tmx = abs(arr[i]-arr[s])\r\n\tprint(mi , mx)\r\n\r\nn =int(input())\r\narr = list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif i==0:\r\n\t\tsolve(arr , i , i+1,-1)\r\n\telif i ==n-1:\r\n\t\tsolve(arr , i, i-1,0)\r\n\telse:\r\n\t\tmi = min(abs(arr[i]-arr[i-1]) ,abs(arr[i]-arr[i+1]))\r\n\t\tmx = max(abs(arr[i]-arr[-1]) , abs(arr[i]-arr[0]))\r\n\t\tprint(mi , mx)\r\n\r\n", "n=int(input())\ns=list(map(int,input().split()))\ns1=sorted(s)\ns1.append(0)\ns1.append(0)\nfor i in range(n):\n if i==0:\n mi=abs(s[0]-s[1])\n ma=abs(s[0]-s[-1])\n elif i==n-1:\n mi=abs(s[-1]-s[-2])\n ma=abs(s[-1]-s[0])\n else:\n mi,ma=min(abs(s1[i]-s[i+1]),abs(s1[i]-s[i-1])),max(abs(s1[0]-s[i]),abs(s1[i]-s[n-1]))\n print(mi,ma)\n\n \t\t \t \t\t\t\t\t \t \t\t \t", "n = int(input())\r\nk = map(int, (input().split()))\r\nlst = list(k)\r\n\r\n\r\nfor i in range(len(lst)):\r\n if i == 0:\r\n mini = abs(lst[i]-lst[1])\r\n maxi = abs(lst[i]-lst[-1])\r\n elif i == len(lst)-1:\r\n mini = abs(lst[i]-lst[-2])\r\n maxi = abs(lst[i]-lst[0])\r\n else:\r\n mn1 = abs(lst[i]-lst[i-1])\r\n mn2 = abs(lst[i]-lst[i+1])\r\n mx1 = abs(lst[i]-lst[0])\r\n mx2 = abs(lst[i]-lst[-1])\r\n mini = min(mn1, mn2)\r\n maxi = max(mx1, mx2)\r\n \r\n print(f\"{mini} {maxi}\")\r\n\r\n \r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nprint(x[1]-x[0],x[n-1]-x[0])\r\nfor i in range(1,n-1):\r\n print(min(x[i]-x[i-1],x[i+1]-x[i]),max(x[i]-x[0],x[n-1]-x[i]))\r\nprint(x[n-1]-x[n-2],x[n-1]-x[0])", "n = int(input())\nx = list(map(int, input().split()))\nso_far = abs(x[0] - x[1])\nfor i in range(len(x)):\n if i == 0:\n mini = abs(x[i] - x[i+1])\n maxi = abs(x[i] - x[-1])\n elif i == len(x) - 1:\n mini = abs(x[i-1] - x[i])\n maxi = so_far\n else:\n mini = min(abs(x[i-1] - x[i]), abs(x[i] - x[i+1]))\n maxi = max(so_far, abs(x[i] - x[-1]))\n so_far += abs(x[i] - x[i + 1])\n print(mini, maxi)\n", "n = int(input())\na = [int(i) for i in input().split()]\nprint(a[1]-a[0], a[n-1]-a[0])\nfor i in range(1, n-1):\n\tprint(min(abs(a[i]-a[i-1]),abs(a[i]-a[i+1])), max(abs(a[i]-a[0]),abs(a[i]-a[n-1])))\nprint(a[n-1]-a[n-2], a[n-1]-a[0])", "n=int(input())\n\na=[int(j) for j in input().split()]\nfor j in range(n):\n if(j==0):\n mn=a[1]-a[j]\n elif(j==n-1):\n mn=a[j]-a[j-1]\n else:\n x1=a[j]-a[j-1]\n x2=a[j+1]-a[j]\n if(x1>x2):\n mn=x2\n else:\n mn=x1\n if(j==n-1):\n mx=a[j]-a[0]\n elif(j==0):\n mx=a[j]-a[n-1]\n else:\n x1=a[j]-a[0]\n x2=a[n-1]-a[j]\n if(x1>x2):\n mx=x1\n else:\n mx=x2\n print(abs(mn),abs(mx))\n\t\t \t\t \t\t \t\t \t \t\t\t \t\t\t", "n = int(input())\r\ncits = list(map(int, input().split()))\r\n\r\nsol = []\r\n\r\nfor i in range(n):\r\n mx = max(abs(cits[i] - cits[0]), abs(cits[i] - cits[-1]))\r\n if i == 0:\r\n mn = abs(cits[i] - cits[i + 1])\r\n elif i == n - 1:\r\n mn = abs(cits[i] - cits[ i - 1])\r\n else:\r\n mn = min(abs(cits[i] - cits[i - 1]), abs(cits[i] - cits[i + 1]))\r\n sol.append([mn, mx])\r\n\r\nfor row in sol:\r\n print(*row)", "\r\nnum = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmn = abs(min(arr))\r\n\r\narr = [i+mn for i in arr]\r\nbeg = arr[0]\r\nend = arr[-1]\r\nans = [[arr[1]-arr[0], end-arr[0]]]\r\nfor i in range(1, num -1):\r\n short = min(abs(arr[i]- arr[i-1]), abs(arr[i]- arr[i+1]))\r\n long = max((end-arr[i], arr[i]-beg))\r\n ans.append([short, long])\r\nans.append([arr[-1]-arr[-2], arr[-1] - beg])\r\n\r\nfor i in ans:\r\n print(*i)\r\n\r\n", "# n -> the number of cities in Lineland.\r\nn = int(input())\r\n# the x-coordinate of the i-th city\r\nX = [int(i) for i in input().split()]\r\nif len(X) == n and 2<= n <= 10**5:\r\n for i in range(n):\r\n maxi = max(abs(X[0] - X[i]), abs(X[n-1]- X[i]))\r\n if i == 0:\r\n mini = abs(X[i]-X[i+1])\r\n elif i == n-1:\r\n mini = abs(X[i]-X[i-1])\r\n else:\r\n mini = min(abs(X[i]-X[i+1]), abs(X[i]-X[i-1]))\r\n print(mini, maxi)", "n = int(input())\ncities = list(map(int, input().split()))\nmin_ = []\nmax_ = []\nfor i in range(n):\n if i != 0 and i != n - 1:\n min_.append(abs(cities[i] - cities[i-1]) if abs(cities[i] - cities[i-1]) < abs(cities[i] - cities[i+1]) else abs(cities[i] - cities[i+1]))\n max_.append(abs(cities[i] - cities[0]) if abs(cities[i] - cities[0]) > abs(cities[i] - cities[-1]) else abs(cities[i] - cities[-1]))\n elif i == 0:\n min_.append(abs(cities[i] - cities[i+1]))\n max_.append(abs(cities[i] - cities[-1]))\n else:\n min_.append(abs(cities[i] - cities[i-1]))\n max_.append(abs(cities[i] - cities[0]))\nfor m,M in zip(min_,max_):\n print(m, M)\n", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn = int(input())\n\nx = list(map(int, input().split()))\n\nfor i in range(n-1):\n k = min(abs(x[i+1]-x[i]), abs(x[i-1]-x[i]))\n j = max(abs(x[0]-x[i]), abs(x[-1]-x[i]))\n\n print(k, j)\n\nprint(abs(x[-1]-x[n-2]),abs(x[-1]-x[0]))", "import sys\n\ntokens = (token for token in sys.stdin.read().split())\n\nN = int(next(tokens))\n\nlst = []\nfor _ in range(N):\n cur_num = int(next(tokens))\n lst.append(cur_num)\n\nfor i in range(0,len(lst)):\n if i == 0:\n mi = abs(lst[0] - lst[1])\n ma = abs(lst[0] - lst[len(lst) - 1])\n elif i == len(lst) - 1:\n mi = abs(lst[i] - lst[i - 1])\n ma = abs(lst[0] - lst[i])\n else:\n mi = min(abs(lst[i] - lst[i-1]), abs(lst[i] - lst[i+1]))\n ma = max(abs(lst[i] - lst[0]), abs(lst[i] - lst[len(lst) - 1]))\n print(str(mi) + \" \" + str(ma))\n \t\t\t\t\t\t \t\t\t \t\t\t \t\t\t \t \t\t\t\t \t", "n=int(input())\na = list(map(int,input().strip().split()))[:n]\nprint(abs(a[1]-a[0]),end=\" \")\nprint(abs(a[n-1]-a[0]))\nfor i in range(1,n-1):\n print(min(abs(a[i+1]-a[i]),abs(a[i]-a[i-1])),end=\" \")\n print(max(abs(a[n-1]-a[i]),abs(a[i]-a[0])))\nprint(abs(a[n-1]-a[n-2]),end=\" \")\nprint(abs(a[n-1]-a[0]))\n\n\n\n\t\t\t \t\t\t\t \t\t \t\t\t\t \t\t \t\t\t \t\t\t\t\t", "n=int(input())\r\nc=list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i==0:\r\n print(c[1]-c[0],c[-1]-c[0]) \r\n elif i==n-1:\r\n print(c[-1]-c[-2],c[-1]-c[0]) \r\n else:\r\n x=c[i]-c[i-1]\r\n y=c[i+1]-c[i]\r\n xx=c[i]-c[0]\r\n yy=c[-1]-c[i]\r\n print(x if x<y else y,xx if xx>yy else yy) \r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nfor i in range(len(lst)):\r\n if i == 0:\r\n minv = abs(lst[i] - lst[i+1])\r\n elif i == len(lst)-1:\r\n minv = abs(lst[i] - lst[i-1])\r\n else:\r\n minv = min(abs(lst[i] - lst[i+1]), abs(lst[i] - lst[i-1]))\r\n maxv = max(abs(lst[i] - lst[0]), abs(lst[i] - lst[len(lst)-1]))\r\n print(minv, maxv)\r\n", "n = int(input())\r\nls = list(map(int,input().split()))\r\nfor i in range(n):\r\n Min = 10**12\r\n Max = -1\r\n if i+1<n:\r\n Min = min(Min,ls[i+1]-ls[i])\r\n if i-1>=0:\r\n Min = min(Min, ls[i] - ls[i-1])\r\n Max = max(ls[-1] - ls[i], ls[i] - ls[0])\r\n print(Min, Max)", "cities = int(input())\r\ncities_list = list(map(int, input().split()))\r\n\r\nsol = []\r\n\r\nfor i in range(cities):\r\n mx = max(abs(cities_list[i] - cities_list[0]), abs(cities_list[i] - cities_list[-1]))\r\n if i == 0:\r\n mn = abs(cities_list[i] - cities_list[i + 1])\r\n elif i == cities - 1:\r\n mn = abs(cities_list[i] - cities_list[ i - 1])\r\n else:\r\n mn = min(abs(cities_list[i] - cities_list[i - 1]), abs(cities_list[i] - cities_list[i + 1]))\r\n sol.append([mn, mx])\r\n\r\nfor row in sol:\r\n print(*row)", "#!/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(map(int, input().split())))\n\n\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\n\n\ndef invr():\n return(map(int, input().split()))\n\n\nif __name__ == \"__main__\":\n n = inp()\n cities = inlt()\n for i in range(n):\n if i == 0:\n print(cities[i+1] - cities[i], abs(cities[i] - cities[-1]))\n elif i == n - 1:\n print(cities[i] - cities[i-1], abs(cities[i] - cities[0]))\n else:\n print(min(abs(cities[i] - cities[i-1]), abs(cities[i+1] - cities[i])),\n max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1])))\n", "n = int(input())\narray = [int(x) for x in input().split()]\nmini1 = abs(array[0] - array[1])\nmaxi1 = abs(array[0] - array[n-1])\nprint(f\"{mini1} {maxi1}\")\nfor i in range(1, n -1):\n mini = min(abs(array[i] - array[i-1]), abs(array[i] - array[i+1]))\n maxi = max(abs(array[i] - array[n-1]), abs(array[i] - array[0]))\n print(f\"{mini} {maxi}\")\n\nmini2 = abs(array[n-2] - array[n-1])\nprint(f\"{mini2} {maxi1}\")\n \t\t \t \t\t\t \t \t\t \t\t\t\t \t\t \t \t", "#567A Lineland Mail\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nprint(f\"{abs(l[0]-l[1])} {abs(l[0]-l[-1])}\")\r\nfor i in range(1,len(l)-1):\r\n if abs(l[i]-l[i-1])<abs(l[i]-l[i+1]):\r\n print(abs(l[i]-l[i-1]),end=\" \")\r\n else:\r\n print(abs(l[i]-l[i+1]),end=\" \")\r\n if abs(l[i]-l[0])>abs(l[i]-l[-1]):\r\n print(abs(l[i]-l[0]))\r\n else:\r\n print(abs(l[i]-l[-1]))\r\nprint(f\"{abs(l[-1]-l[-2])} {abs(l[-1]-l[0])}\")", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nmax_ele = cities[n - 1]\r\nmin_ele = cities[0]\r\n\r\nfor i in range(n):\r\n max_sum = max(abs(cities[i] - min_ele), abs(cities[i] - max_ele))\r\n min_sum = 0\r\n if i == 0:\r\n min_sum = abs(cities[i] - cities[i + 1])\r\n elif i == n - 1:\r\n min_sum = abs(cities[i] - cities[i - 1])\r\n else:\r\n min_sum = min(abs(cities[i] - cities[i - 1]), abs(cities[i] - cities[i + 1]))\r\n\r\n print(f\"{min_sum} {max_sum}\")\r\n", "n = int(input())\r\nnum = input()\r\nnum = list(int(x) for x in num.split(\" \"))\r\n\r\nfor i in range(0, len(num)):\r\n if i == 0:\r\n print(abs(num[i] - num[i+1]), end = \" \")\r\n elif i == len(num) - 1:\r\n print(abs(num[i] - num[i - 1]), end=\" \")\r\n else:\r\n d1 = abs(num[i] - num[i - 1])\r\n d2 = abs(num[i] - num[i + 1])\r\n print(min(d1,d2), end=\" \")\r\n\r\n if i == 0:\r\n print(abs(num[i] - num[len(num)-1]))\r\n elif i == len(num) - 1:\r\n print(abs(num[i] - num[0]))\r\n else:\r\n d1 = abs(num[i] - num[0])\r\n d2 = abs(num[i] - num[len(num)-1])\r\n print(max(d1,d2))\r\n\r\n\r\n\r\n\r\n", "cityAmount = int(input())\r\ncityPositionList = list(map(int, input().split()))\r\n\r\nfor cityIndex, cityPosition in enumerate(cityPositionList):\r\n distanceMax = 0\r\n distanceMin = 0\r\n if cityIndex == 0:\r\n distanceMax = cityPositionList[-1] - cityPositionList[0]\r\n distanceMin = cityPositionList[1] - cityPositionList[0]\r\n elif cityIndex == cityAmount-1:\r\n distanceMax = cityPositionList[-1] - cityPositionList[0]\r\n distanceMin = cityPositionList[-1] - cityPositionList[-2]\r\n else:\r\n distanceList = []\r\n indexToCompare = [0, -1, cityIndex-1, cityIndex+1]\r\n for otherCityIndex in indexToCompare:\r\n distanceTemp = abs(\r\n cityPositionList[cityIndex] - cityPositionList[otherCityIndex])\r\n distanceList.append(distanceTemp)\r\n distanceMax = max(distanceList)\r\n distanceMin = min(distanceList)\r\n print(f'{distanceMin} {distanceMax}')", "n = int(input())\r\nli = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i==0:\r\n print(abs(li[i]-li[i+1]), abs(li[i]-li[-1]))\r\n\r\n elif i==(n-1):\r\n print(abs(li[i] - li[i-1]), abs(li[i]- li[0]))\r\n\r\n else:\r\n print(min(abs(li[i]-li[i-1]),abs(li[i]-li[i+1])), max(abs(li[i]-li[0]), abs(li[i]- li[-1])))\r\n", "n = int(input())\r\ncord = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n maxm = max(abs(cord[i]-cord[n-1]),abs(cord[i]-cord[0]))\r\n if i==0:\r\n mini =abs(cord[i+1]-cord[i])\r\n elif i==n-1:\r\n mini =abs(cord[i-1]-cord[i])\r\n else:\r\n mini = min(abs(cord[i]-cord[i+1]),abs(cord[i-1]-cord[i]))\r\n print(mini,maxm) \r\n\r\n", "\r\nnum = int(input())\r\n\r\narr = []\r\narr += list(map(int, input().split()))\r\n\r\n## first one and last\r\nprint(abs(arr[1]-arr[0]),abs(arr[num-1]-arr[0]))\r\nfor i in range(1,num-1):\r\n print(min(abs(arr[i-1]-arr[i]),abs(arr[i+1]-arr[i])),max(abs(arr[0]-arr[i]),abs(arr[num-1]-arr[i])))\r\n## last one \r\nprint(abs(arr[num-2]-arr[num-1]),abs(arr[0]-arr[num-1]))", "n=int(input())\nl=[int(x) for x in input().split()]\nfor i in range(0,n):\n if i==0:\n print(abs(l[0]-l[1]),abs(l[0]-l[n-1]),sep=' ')\n elif i==n-1:\n print(abs(l[n-1]-l[n-2]),abs(l[0]-l[n-1]),sep=' ')\n else:\n a=abs(l[i]-l[i-1])\n b=abs(l[i]-l[i+1])\n c=abs(l[i]-l[0])\n d=abs(l[i]-l[n-1])\n print(min(a,b),max(c,d),sep=' ')\n\n \t \t \t \t\t \t \t \t\t \t\t\t \t \t", "from bisect import bisect_left, bisect_right\r\nfrom heapq import heappush, heappop, heapify\r\nfrom math import *\r\nfrom collections import defaultdict, Counter, deque\r\nfrom sys import stdin, stdout\r\nimport io, os\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nninput = lambda: int(input())\r\nsinput = lambda: input().decode().strip() \r\nainput = lambda: list(map(int, input().split()))\r\nprintt = lambda *x: stdout.write(\" \".join(map(str, x)) + '\\n')\r\nceil = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)\r\n\r\nt = 1\r\nfor _ in range(t):\r\n n = ninput()\r\n a = ainput()\r\n dic = {}\r\n for i in range(n): dic[a[i]] = i\r\n sa = sorted(a)\r\n ans = [[0, 0] for _ in range(n)]\r\n ans[0] = [sa[1] - sa[0], sa[-1] - sa[0]]\r\n for i in range(1, n-1):\r\n minn = min(sa[i] - a[i-1], sa[i+1] - sa[i])\r\n maxx = max(sa[i] - sa[0], sa[-1] - sa[i])\r\n ans[dic[sa[i]]] = [minn, maxx]\r\n ans[n-1] = [sa[-1] - sa[-2], sa[-1] - sa[0]]\r\n for i in ans:\r\n printt(*i)", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n min_cost = abs(cities[i] - cities[i+1])\r\n max_cost = abs(cities[i] - cities[n-1])\r\n elif i == n-1:\r\n min_cost = abs(cities[i] - cities[i-1])\r\n max_cost = abs(cities[i] - cities[0])\r\n else:\r\n min_cost = min(abs(cities[i] - cities[i-1]), abs(cities[i] - cities[i+1]))\r\n max_cost = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[n-1]))\r\n print(min_cost, max_cost)\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n\tmaximum = max(x[-1] - x[i], x[i] - x[0])\r\n\tif i == 0:\r\n\t\tminimum = x[1] - x[0]\r\n\telif i == (n - 1):\r\n\t\tminimum = x[n - 1] - x[n - 2]\r\n\telse:\r\n\t\tminimum = min(x[i] - x[i - 1], x[i + 1] - x[i])\r\n\tprint(minimum, maximum)", "def get_distance(n1, n2):\n\treturn abs(n1 - n2)\n\nn = int(input())\n\nc = list(map(lambda x: int(x), input().split(\" \")))\n\ndistances = list()\n\nfor i in range(n):\n\tminimum = float('inf')\n\tmaximum = float('-inf')\n\tif (i < n - 1):\n\t\tminimum = get_distance(c[i], c[i+1])\n\t\tmaximum = get_distance(c[i], c[n-1])\n\tif (i > 0):\n\t\tminimum = min(minimum, get_distance(c[i], c[i-1]))\n\t\tmaximum = max(maximum, get_distance(c[i], c[0]))\n\t\n\tprint(f'{minimum} {maximum}')\n\t \t\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\nprint(abs(x[0] -x[1]), abs(x[0] -x[-1]))\r\nfor i in range(1,t-1):\r\n print(min(abs(x[i]-x[i-1]), abs(x[i]-x[i+1])), end = ' ')\r\n print(max(abs(x[i]-x[-1]), abs(x[i]-x[0])))\r\nprint(abs(x[-1] -x[-2]), abs(x[-1] -x[0]))", "import math\ndef maxi(coord,e):\n j = len(coord)-1\n if(abs(coord[j] - coord[e]) >= abs(coord[e] - coord[0]) ):\n maxi = abs(coord[j] - coord[e])\n else:\n maxi = abs(coord[e] - coord[0])\n return abs(maxi)\n\ndef mini(coord,e):\n if(e > 0 and e != len(coord)-1):\n if(abs(coord[e] - coord[e-1]) <= abs(coord[e] - coord[e+1])):\n mini = coord[e] - coord[e-1]\n else:\n mini = coord[e] - coord[e+1]\n else:\n if(e == 0):\n mini = coord[e] - coord[e+1]\n else:\n mini = coord[e] - coord[e-1]\n return abs(mini)\n\nn = int(input())\ncoord = list(map(int,input().split(\" \")))\nfor e in range(n):\n print(mini(coord,e), end=' ')\n print(maxi(coord,e))\n \t \t \t \t \t \t\t \t\t\t \t \t", "n = int(input())\r\nm = input().split()\r\n\r\ns1 = []\r\ns2 = []\r\n\r\nfor x in range(n):\r\n if x == 0:\r\n m1 = int(m[1]) - int(m[0])\r\n s1.append(m1)\r\n elif x == n - 1:\r\n m1 = int(m[x]) - int(m[x-1])\r\n s1.append(m1)\r\n else:\r\n m1 = min(abs(int(m[x]) - int(m[x-1])), abs(int(m[x]) - int(m[x+1])))\r\n s1.append(m1)\r\n \r\nfor x in range(n):\r\n if x == 0:\r\n m2 = int(m[n-1]) - int(m[0])\r\n s2.append(m2)\r\n elif x == n - 1:\r\n m2 = int(m[n-1]) - int(m[0])\r\n s2.append(m2)\r\n else:\r\n m2 = max(abs((int(m[x])) - int(m[0])), abs((int(m[x])) - int(m[n-1])))\r\n s2.append(m2)\r\n\r\nfor _ in range(n):\r\n print(str(s1[_]) + \" \" + str(s2[_]))", "n = int(input()) #número de cidades\n\nv = list(map(int,input().split()))\n\nx = sorted(v)\n\nperto = longe = 0\nperto1 = perto2 = 0\nlonge1 = longe2 = 0\n\nfor lugar,casa in enumerate(x): \n if casa == x[0]: #primeira casa\n perto = x[1] - casa #vizinho à direita é o mais próximo\n longe = x[-1] - casa #último da lista é o mais longe\n else:\n if lugar < len(x) - 1: #casas do meio\n perto1 = abs(x[lugar - 1] - casa) #anterior à casa(vizinho à esquerda)\n perto2 = abs(x[lugar + 1] - casa) #posterior à casa(vizinho à direita)\n\n longe1 = abs(x[0] - casa) #primeiro da lista\n longe2 = abs(x[-1] - casa) #último da lista\n\n if perto1 <= perto2:\n perto = perto1\n else:\n perto = perto2 \n\n if longe1 >= longe2:\n longe = longe1\n else:\n longe = longe2 \n\n elif lugar == len(x) - 1: #ultima casa \n perto = abs(casa - x[lugar - 1]) #o mais perto é o vizinho a esquerda(único vizinho) \n longe = abs(casa - x[0]) #o mais longe é o primeiro da lista\n print(perto,longe)\n \t\t\t \t \t \t \t \t\t\t \t\t\t\t\t\t\t\t\t", "n = int(input())\nc = list(map(int, input().split()))\ns = []\nfor i in range(n):\n m = max(abs(c[i] - c[0]), abs(c[i] - c[-1]))\n if i == 0:\n mn = abs(c[i] - c[i + 1])\n elif i == n - 1:\n mn = abs(c[i] - c[ i - 1])\n else:\n mn = min(abs(c[i] - c[i - 1]), abs(c[i] - c[i + 1]))\n s.append([mn, m])\nfor r in s:\n print(*r)\n\t\t \t \t\t\t \t \t\t\t\t\t \t \t", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nb > a\r\ngcd(b,a) == 1\r\n\r\nn = 1000\r\nb => (2,n+1)\r\n a = n-b\r\n if gcd(a,b) == 1:\r\n cnt += 1\r\nprint(cnt)\r\n\r\n< 10 = x\r\n10 = 11\r\n12 = 12\r\n...\r\n18 = 19\r\n19 = 21\r\n...\r\n100 // 10 = 10 cashback\r\nspent 100, 10 cashback = 1 -> 111\r\n\r\n28\r\n\r\n10\r\n10\r\n10\r\n\r\n19\r\nans = 0\r\ndigits = [1, 9\r\n\r\ndigits = [1, 10]\r\nans = 10\r\n\r\nans = 20\r\n\r\n[1,9,9]\r\n100\r\n\r\n[1,10,9]\r\n200\r\n[1,10,19]\r\n219\r\n\r\n199\r\n0,10,9 100\r\n0,0,19 200\r\n0,0,0,2 219\r\n'''\r\n\r\n# sys.stdin = open(\"backforth.in\", \"r\")\r\n# sys.stdout = open(\"backforth.out\", \"w\")\r\n\r\ndef solve():\r\n n = II()\r\n a = LII()\r\n for i in range(n):\r\n mn = 10**10\r\n mx = -1\r\n if i-1 >= 0:\r\n mn = min(mn, abs(a[i]-a[i-1]))\r\n if i+1 < n:\r\n mn = min(mn, abs(a[i]-a[i+1]))\r\n \r\n if i != 0:\r\n mx = max(mx, abs(a[i]-a[0]))\r\n if i != n-1:\r\n mx = max(mx, abs(a[i]-a[-1]))\r\n WS([mn, mx])\r\n\r\nsolve() ", "cases = int(input())\ncoord = list(map(int, input().split(\" \")))\n\nfirst = coord[0]\nlast = coord[len(coord)-1]\n\nfor i in range(len(coord)):\n if(coord[i] == first):\n minimum = abs(first - coord[i+1])\n maximun = abs(last - first)\n print(str(minimum) + ' ' + str(maximun))\n elif(coord[i] == last):\n minimum = abs(last - coord[i-1])\n maximun = abs(last - first)\n print(str(minimum) + ' ' + str(maximun))\n else:\n minimum = min(abs(coord[i] - coord[i+1]), abs(coord[i] - coord[i-1]))\n maximun = max(abs(last - coord[i]), abs(coord[i] - first))\n print(str(minimum) + ' ' + str(maximun))\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\nprint(x[1] - x[0], x[-1] - x[0])\r\nfor i in range(1, n - 1):\r\n\tif x[i] - x[i - 1] < x[i + 1] - x[i]:\r\n\t\tmn = x[i] - x[i - 1]\r\n\telse:\r\n\t\tmn = x[i + 1] - x[i]\r\n\tif x[i] - x[0] < x[-1] - x[i]:\r\n\t\tmx = x[-1] - x[i]\r\n\telse:\r\n\t\tmx = x[i] - x[0]\r\n\tprint(mn, mx)\r\nprint(x[-1] - x[-2], x[-1] - x[0])\r\n", "n = int(input())\n\nx = list(map(int, input().split()))\n\n\nif n == 2:\n val = x[1] - x[0]\n print(val, val)\n print(val, val)\n exit()\n\n\n\nfor i in range(n):\n if i == 0:\n print(x[1] - x[0], x[-1] - x[0])\n if i < n - 1 and i > 0:\n \n minim = min(x[i] - x[i - 1], x[i + 1] - x[i])\n maxim = max(x[i] - x[0], x[-1] - x[i])\n \n print(minim, maxim)\n\n elif i == n - 1:\n print(x[i] - x[i - 1], x[i] - x[0])", "# LUOGU_RID: 125508513\ninput();a=list(map(int,input().split()))\nprint(a[1]-a[0],a[-1]-a[0])\nfor i in range(1,len(a)-1):print(min(a[i]-a[i-1],a[i+1]-a[i]),max(a[i]-a[0],a[-1]-a[i]))\nprint(a[-1]-a[-2],a[-1]-a[0])", "n = int(input(''))\r\nx = sorted(map(int, input('').split()))\r\nprint(x[1]-x[0],x[-1]-x[0])\r\nfor i in range(1,n-1):\r\n tmp = ''\r\n if (x[i] - x[i-1] < x[i+1] - x[i]):\r\n tmp += str(x[i]-x[i-1]) + ' '\r\n else:\r\n tmp += str(x[i+1] - x[i]) + ' '\r\n if (x[i]-x[0] > x[-1]-x[i]):\r\n tmp += str(x[i]-x[0])\r\n else:\r\n tmp += str(x[-1] - x[i])\r\n print(tmp) \r\nprint(x[-1]-x[-2],x[-1]-x[0])\r\n", "n = int(input())\r\nx = []\r\nc = input().split()\r\n\r\nfor i in range(n):\r\n if i == 0 :\r\n print(abs(int(c[i])-int(c[i+1])),\" \",abs(int(c[i])-int(c[n-1])))\r\n elif i == n-1:\r\n print(abs(int(c[i])-int(c[i-1])),\" \",abs(int(c[i])-int(c[0])))\r\n else :\r\n minimum = min(abs(int(c[i])-int(c[i-1])),abs(int(c[i])-int(c[i+1])))\r\n maximum = max(abs(int(c[i])-int(c[0])),abs(int(c[i])-int(c[n-1])))\r\n print(minimum,\" \",maximum)", "cities = int(input())\ncoordinate_of_city = list(map(int, input().split(' ')))\n\n\nfor i in range(cities):\n if i == 0:\n print(abs(coordinate_of_city[1] - coordinate_of_city[0]), abs(coordinate_of_city[cities - 1] - coordinate_of_city[0]))\n elif i == cities - 1:\n print(abs(coordinate_of_city[cities - 1] - coordinate_of_city[cities - 2]), abs(coordinate_of_city[cities - 1] - coordinate_of_city[0]))\n else:\n shortest_distance = min(abs(coordinate_of_city[i] - coordinate_of_city[i - 1]), abs(coordinate_of_city[i] - coordinate_of_city[i + 1]))\n furthest_distance = max(abs(coordinate_of_city[i] - coordinate_of_city[0]), abs(coordinate_of_city[i] - coordinate_of_city[cities - 1]))\n print(shortest_distance, furthest_distance)", "n=int (input())\r\nl=list(map(int, input().split()))\r\nfor i in range(n):\r\n \r\n if (i==0):# first\r\n a,b=abs(l[0]-l[1]),abs(l[0]-l[-1])\r\n print(min(a,b),max(a,b))\r\n elif(i!=n-1): \r\n a,b,c,d=abs(l[i]-l[0]),abs(l[i]-l[i-1]),abs(l[i]-l[i+1]),abs(l[i]-l[-1])\r\n \r\n print(min(a,min(b,min(c,d))),max(a,max(b,max(c,d))))\r\n elif(i==n-1):\r\n a,b=abs(l[i]-l[0]),abs(l[i]-l[-2])\r\n print(min(a,b),max(a,b))\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nlst = tuple(map(int, input().split()))\r\n\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n print(lst[1] - lst[0], end=\" \")\r\n print(lst[n-1] - lst[0])\r\n elif i == n-1:\r\n print(lst[n-1] - lst[n-2], end=\" \")\r\n print(lst[n-1] - lst[0])\r\n else:\r\n diff1 = lst[i + 1] - lst [i]\r\n diff2 = abs(lst[i - 1] - lst [i])\r\n diffn = lst[n - 1] - lst [i]\r\n diff0 = abs(lst[0] - lst [i])\r\n minm = diff1 if diff1 < diff2 else diff2\r\n maxm = diff0 if diff0 > diffn else diffn\r\n print(minm, maxm)\r\n", "a = int(input())\r\nb = [int(i) for i in str(input()).split()]\r\n \r\narr = []\r\n \r\nfor i in range(len(b)):\r\n if i == 0:\r\n min = abs(b[i+1] - b[0])\r\n max = b[-1] - b[0]\r\n result = f\"{abs(min)} {abs(max)}\"\r\n arr.append(result)\r\n \r\n \r\n elif i == len(b)-1:\r\n min = abs(b[-1] - b[-2])\r\n max = b[-1] - b[0]\r\n result = f\"{abs(min)} {abs(max)}\"\r\n arr.append(result)\r\n \r\n else:\r\n min = b[i] - b[i-1]\r\n if b[i+1] - b[i] < min:\r\n min = b[i+1] - b[i]\r\n \r\n max = b[-1] - b[i]\r\n if abs(b[0] - b[i]) > max:\r\n max = b[0] - b[i]\r\n \r\n result = f\"{abs(min)} {abs(max)}\"\r\n arr.append(result)\r\n \r\n \r\nfor i in arr:\r\n print(i)", "from math import*\r\nq=int(input())\r\nh=list(map(int,input().split()))\r\nfor i in range(q):\r\n if i==0:\r\n print(h[1]-h[0],h[q-1]-h[0])\r\n elif i==q-1:\r\n print(h[q-1]-h[q-2],h[q-1]-h[0])\r\n else:\r\n u=max(abs(h[i]-h[q-1]),abs(h[i]-h[0]))\r\n v=min(abs(h[i]-h[i-1]),abs(h[i]-h[i+1]))\r\n print(v,u)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nfor j in range(len(a)):\r\n if j>0 and j<len(a)-1:\r\n print(min(abs(a[j]-a[j-1]),abs(a[j]-a[j+1])),end=' ')\r\n elif j==len(a)-1:\r\n print(abs(a[j]-a[j-1]),end=' ')\r\n else:\r\n print(abs(a[j]-a[j+1]),end=' ')\r\n print(max(abs(a[j]-a[0]),abs(a[j]-a[len(a)-1])))", "def solve(arr,n):\n res = []\n for i,v in enumerate(arr):\n max_val = max(abs(arr[0]-v), abs(arr[-1]-v))\n min_val = 0\n if not i:\n min_val = abs(v-arr[i+1])\n elif i == n-1 :\n min_val = abs(v-arr[i-1])\n else:\n min_val = min(abs(v-arr[i-1]), abs(v-arr[i+1]))\n print(min_val,max_val)\n\n\n\n\n \n \n\ndef main() :\n n = int(input())\n arr = list(map(int, input().split(' ')))\n # s = input()\n # res=''\n\n # n = int(input())\n # arr = []\n # for _ in range(n):\n # i = list(map(int, input().split(' ')))\n # arr.append(i)\n \n # # for i in arr:\n # n = int(input())\n # s = input()\n solve(arr,n)\n\nmain()\n\n\n", "from sys import stdin\r\n\r\nn = int(stdin.readline().rstrip())\r\nl = list(map(int,stdin.readline().split()))\r\n\r\nans = []\r\n\r\nfor i in range(n):\r\n\tif i==0:\r\n\t\tmi = l[i+1]-l[i]\r\n\t\tma = l[n-1]-l[i]\r\n\t\tans.append([mi,ma])\r\n\telif i==n-1:\r\n\t\tmi = l[i]-l[i-1]\r\n\t\tma = l[i]-l[0]\r\n\t\tans.append([mi,ma])\r\n\telse:\r\n\t\tmi = min(l[i]-l[i-1],l[i+1]-l[i])\r\n\t\tma = max(l[i]-l[0],l[n-1]-l[i])\r\n\t\tans.append([mi,ma])\r\n\r\nfor i in ans:\r\n\tprint(str(i[0])+\" \",str(i[1]))\r\n\r\n'''\r\n\t'''", "n=int(input())\r\ndis=list(map(int,input().split()))\r\n# maxdis=max((abs(xi - x0), abs(xi - xn - 1)))\r\n# mindis=min((abs(xi - xi-1), abs(xi - xi + 1)))\r\nfor i in range(n):\r\n maxdis=max(abs(dis[i]-dis[0]),abs(dis[i]-dis[-1]))\r\n if i==0:mindis=abs(dis[i]-dis[i+1])\r\n elif i==n-1:mindis=abs(dis[i]-dis[i-1])\r\n else:mindis=min(abs(dis[i]-dis[i-1]),abs(dis[i]-dis[i+1]))\r\n print(mindis,maxdis)\r\n", "num = int(input())\ncoordinates = input().split(' ')\n\nif len(coordinates) == num:\n for i in range(len(coordinates)):\n min = 0\n max = 0\n if i == 0:\n min = int(coordinates[1]) - int(coordinates[0])\n max = int(coordinates[-1]) - int(coordinates[0])\n\n elif int(coordinates[i]) == int(coordinates[-1]):\n min = int(coordinates[-1]) - int(coordinates[-2])\n max = int(coordinates[-1]) - int(coordinates[0])\n\n else:\n min = int(coordinates[i]) - int(coordinates[i - 1])\n max = int(coordinates[-1]) - int(coordinates[i])\n\n if (int(coordinates[i + 1]) - int(coordinates[i])) < min:\n min = int(coordinates[i + 1]) - int(coordinates[i])\n if (int(coordinates[i]) - int(coordinates[0])) > max:\n max = int(coordinates[i]) - int(coordinates[0])\n\n print(str(min) + ' ' + str(max))", "a=int(input())\r\nl=list(map(int,input().split()))\r\nprint(abs(l[0]-l[1]),abs(l[-1]-l[0]))\r\nfor i in range(1,a-1):\r\n\tx=abs(l[i]-l[0])\r\n\ty=abs(l[i]-l[-1])\r\n\tu=abs(l[i]-l[i-1])\r\n\tv=abs(l[i]-l[i+1])\r\n\tprint(min(u,v),max(x,y))\r\nprint(abs(l[-1]-l[-2]),abs(l[-1]-l[0]))", "n = int(input())\r\narr = list(map(int, input().split())) \r\nmaxc = max(arr)\r\nminc = min(arr)\r\ndef check(a, b):\r\n if (a < 0) and (b < 0):\r\n a*=-1\r\n b*=-1\r\n return(abs(a-b))\r\nprint(check(minc, arr[1]), check(maxc, minc))\r\nfor i in range(1, n-1):\r\n a = min( check(arr[i], arr[i-1]), check(arr[i], arr[i+1]) ) \r\n b = max( check(arr[i], minc), check(arr[i], maxc) ) \r\n print(a,b)\r\nprint(check(maxc, arr[n-2]), check(maxc, minc))\r\n", "n=int(input())\nl=list(map(int,input().split()))\nprint(l[1]-l[0],l[n-1]-l[0])\nfor i in range(1,n-1):\n print(min(l[i]-l[i-1],l[i+1]-l[i]),max(l[n-1]-l[i],l[i]-l[0]))\nprint(l[n-1]-l[n-2],l[n-1]-l[0])\n \t\t \t \t \t\t \t\t\t \t \t \t\t \t \t \t", "\n\ndef processo( n, l,i):\n mini = 0\n maxi = 0 \n\n if i == 0:\n mini = abs(int(l[i]) - int(l[i+1]))\n maxi = abs(int(l[i]) - int(l[n-1]))\n\n elif i == n-1:\n mini = abs(int(l[i-1]) - int(l[i]))\n maxi = abs(int(l[0])-int(l[i]))\n\n else: \n mini = min(abs(int(l[i]) - int(l[i+1])), abs(int(l[i]) - int(l[i-1])))\n\n maxi = max(abs(int(l[i]) - int(l[n-1])), abs(int(l[i]) - int(l[0])))\n\n return str(mini) + \" \" + str(maxi)\n\n\n\n\nn = int(input())\nseq = str(input())\nl = seq.split(\" \")\n\nfor i in range(n):\n print(processo(n,l,i))\n\n\t\t\t \t \t \t\t\t\t \t\t \t \t\t\t\t \t \t\t", "def solve(L):\r\n L=sorted(L)\r\n n=len(L);i=0\r\n while i<n:\r\n if i==0:print(L[1]-L[0],L[-1]-L[0])\r\n if 0<i<n-1:print(min(L[i+1]-L[i],L[i]-L[i-1]),max(L[-1]-L[i],L[i]-L[0]))\r\n if i==n-1:print(L[-1]-L[-2],L[-1]-L[0])\r\n i=i+1\r\nn=int(input())\r\nL=list(map(int,input().split(\" \")))\r\nsolve(L)\r\n", "n = int(input())\r\nstr = input()\r\narr = str.split()\r\nfor i in range(n):\r\n arr[i] = int(arr[i])\r\n \r\nfor i in range(n):\r\n min = float('inf')\r\n max = float('-inf')\r\n prev = i-1 \r\n next = i+1\r\n next = next % n\r\n if(abs(arr[i]-arr[next]) < min):\r\n min = abs(arr[i]-arr[next])\r\n if(abs(arr[prev]-arr[i]) < min):\r\n min = abs(arr[prev]-arr[i])\r\n \r\n if (abs(arr[0] - arr[i]) > max):\r\n max = abs(arr[0] - arr[i])\r\n if(abs(arr[i] - arr[n-1])> max):\r\n max = abs(arr[i] - arr[n-1])\r\n \r\n print(min, \" \", max)", "n = int(input())\ncidades = input().split()\nsaida = []\n\nfor i in range (len(cidades)):\n s = []\n if i < len(cidades)-1:\n proximo = int(cidades[i+1])\n atual = int(cidades[i])\n anterior = int(cidades[i-1])\n primeiro = int(cidades[0])\n ultimo = int(cidades[len(cidades)-1])\n\n if i == 0:\n s.append(proximo - atual)\n else:\n if i == len(cidades)-1:\n s.append(atual - anterior)\n else:\n if (proximo - atual) < (atual - anterior):\n s.append(proximo - atual)\n else:\n s.append(atual - anterior)\n\n if i == 0:\n s.append(ultimo - atual)\n else:\n if i == len(cidades)-1:\n s.append(atual - primeiro)\n else:\n if (ultimo - atual) > (atual - primeiro):\n s.append(ultimo - atual)\n else:\n s.append(atual - primeiro)\n \n saida.append(s)\n\nfor j in saida:\n print (*j)\n \t\t \t \t \t\t\t \t \t \t\t\t\t\t \t \t", "n=int(input())\ncities=[int(x) for x in input().split()]\ncosts=[0]*n\n#first city\nmincost=abs(cities[1]-cities[0])\nmaxcost=abs(cities[-1]-cities[0])\ncosts[0]=[mincost,maxcost]\n#last city\nmincost=abs(cities[-2]-cities[-1])\nmaxcost=abs(cities[0]-cities[-1])\ncosts[-1]=[mincost,maxcost]\n#remaining cities\nfor i in range(1,n-1):\n mincost=min(abs(cities[i-1]-cities[i]),abs(cities[i+1]-cities[i]))\n maxcost=max(abs(cities[0]-cities[i]),abs(cities[-1]-cities[i]))\n costs[i]=[mincost,maxcost]\nfor c in costs:\n print(*c)\n \t \t\t \t\t \t\t \t \t \t\t \t \t\t\t\t", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n = int(input())\n x = sorted([int(y) for y in input().split()])\n print(f\"{abs(x[0] - x[1])} {abs(x[0] - x[-1])}\")\n for i in range(1, n - 1):\n print(\n f\"{min(abs(x[i] - x[i - 1]), abs(x[i] - x[i + 1]))} {max(abs(x[i] - x[0]), abs(x[i] - x[-1]))}\")\n print(f\"{abs(x[-1] - x[-2])} {abs(x[-1] - x[0])}\")\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nfor i in range(len(lst)):\r\n if i==0:\r\n min = lst[1]-lst[0]\r\n max = lst[-1]-lst[0]\r\n print(min,max)\r\n elif i == n-1:\r\n min = lst[-1]-lst[-2]\r\n max = lst[-1]-lst[0]\r\n print(min,max)\r\n elif i != 0 and i != n-1:\r\n min1 = lst[i]-lst[i-1]\r\n min2 = lst[i+1]-lst[i]\r\n if min1 >= min2:\r\n mini = min2\r\n else:\r\n mini = min1\r\n max1 = lst[i]-lst[0]\r\n max2 = lst[n-1]-lst[i]\r\n if max1 >= max2:\r\n maxi = max1\r\n else:\r\n maxi = max2\r\n print(mini,maxi)", "n = int(input())\ntowns = list(map(int, input().split()))\n\nfor i in range(n):\n max_distance = max(towns[i] - towns[0], towns[n-1] - towns[i])\n\n if(i<=(n-2) and i>=1):\n min_distance = min(towns[i+1] - towns[i], towns[i] - towns[i-1])\n elif(i==0):\n min_distance = towns[1] - towns[0]\n elif(i==(n-1)):\n min_distance = towns[n-1] - towns[n-2]\n\n print(min_distance, max_distance)\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 = [int(x) for x in input().split()[:n]]\r\nl = list()\r\nfor i in range(n): \r\n if i == 0:\r\n l.append(abs(x[i] - x[i+1])) \r\n l.append(abs(x[i] - x[n-1]))\r\n print(min(l),max(l))\r\n l.clear()\r\n \r\n elif i == n-1:\r\n l.append(abs(x[i] - x[i-1])) \r\n l.append(abs(x[i] - x[0])) \r\n print(min(l),max(l))\r\n l.clear()\r\n \r\n else: \r\n l.append(abs(x[i] - x[i+1])) \r\n l.append(abs(x[i] - x[i-1])) \r\n mn = min(l)\r\n l.clear()\r\n l.append(abs(x[i] - x[0])) \r\n l.append(abs(x[i] - x[n-1]))\r\n mx = max(l)\r\n print(mn,mx) \r\n l.clear()\r\n \r\n \r\n \r\n \r\n ", "n = int(input())\ncities = list(map(int, input().split()))\n\nfor i in range(len(cities)):\n minimum = 0\n maximum = 0\n test = (cities[0] - cities[i])\n if test < 0:\n test = test * - 1\n\n if i == 0:\n maximum = cities[-1] - cities[i]\n elif i == (len(cities) - 1):\n maximum = cities[i] - cities[0]\n else:\n if(cities[-1] - cities[i]) > (test):\n maximum = (cities[-1] - cities[i])\n else:\n maximum = test\n\n\n if i == 0:\n minimum = cities[1] - cities[0]\n elif i == (len(cities) - 1):\n minimum = cities[-1] - cities[-2]\n else:\n if (cities[i] - cities[i-1]) < (cities[i+1] - cities[i]):\n minimum = (cities[i] - cities[i-1])\n else:\n minimum = (cities[i+1] - cities[i])\n\n if maximum < 0:\n maximum = maximum * -1\n elif minimum < 0:\n minimum = minimum * -1\n print(f\"{minimum} {maximum}\")\n \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\nfor i in range(n):\r\n if i==0:\r\n print(abs(nums[i+1]-nums[i]),abs(nums[len(nums)-1]-nums[i]))\r\n elif i==len(nums)-1:\r\n print(abs(nums[i]-nums[i-1]),abs(nums[len(nums)-1]-nums[0]))\r\n else:\r\n a1=abs(nums[i]-nums[i-1])\r\n a2=abs(nums[i+1]-nums[i])\r\n b1=abs(nums[i]-nums[0])\r\n b2=abs(nums[len(nums)-1]-nums[i])\r\n print(min(a1,a2),max(b1,b2)) \r\n\r\n\r\n\r\n \r\n", "n = int(input())\nxs = list(map(int, input().split()))\nfor i, x in enumerate(xs):\n print(\n xs[1] - x\n if i == 0\n else x - xs[-2]\n if i == n - 1\n else min(x - xs[i - 1], xs[i + 1] - x),\n max(x - xs[0], xs[-1] - x),\n )\n", "t=int(input())\nn=list(map(int,input().split()))[:t]\nfor i in range(t):\n\n if i==0:\n print(abs(n[1]-n[0]),abs(n[t-1]-n[0]),sep=\" \")\n elif i==t-1:\n print(abs(n[t-1]-n[t-2]),abs(n[t-1]-n[0]),sep=\" \")\n else: \n a=abs(n[i]-n[i-1])\n b=abs(n[i+1]-n[i])\n c=abs(n[i]-n[0])\n d=abs(n[i]-n[t-1])\n print(min(a,b),max(c,d),sep=\" \")\n\n\n \t\t \t\t\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(n):\n\tc=0\n\tb=0\n\tif i==0:\n\t\tc=abs(a[i]-a[i+1])\n\t\tb=abs(a[i]-a[n-1])\n\telif i==n-1:\n\t\tc=abs(a[i]-a[i-1])\n\t\tb=abs(a[i]-a[0])\n\telse:\n\t\tc=min(abs(a[i]-a[i+1]),abs(a[i]-a[i-1]))\n\t\tb=max(abs(a[i]-a[0]),abs(a[i]-a[n-1]))\n\tprint(c,b)\n \t \t \t \t \t\t \t \t\t \t", "def solve():\n N = int(input())\n positions = list(map(int, input().split()))\n min_pos = positions[0]\n max_pos = positions[-1]\n max_dist = [0] * len(positions)\n min_dist = [0] * len(positions)\n \n for idx in range(len(positions)):\n if (idx == 0):\n min_dist[idx] = positions[1] - positions[idx]\n max_dist[idx] = max_pos - min_pos\n elif(idx==len(positions)-1):\n min_dist[idx] = positions[-1] - positions[-2]\n max_dist[idx] = max_pos - min_pos\n else:\n min_dist[idx] = min((positions[idx+1] - positions[idx]),(positions[idx]- positions[idx-1]))\n max_dist[idx] = max((positions[idx]-min_pos),(max_pos-positions[idx]))\n \n for idx in range(len(positions)):\n print(min_dist[idx], max_dist[idx])\n\ndef main():\n solve()\n\nmain()\n\n \t \t\t\t\t\t\t \t \t\t\t\t \t\t \t \t \t", "n = int(input())\nlista = [int(x) for x in input().split()]\n\nult = n -1\n\nfor x in range(n):\n if(x == 0):\n min = lista[1] - lista[0]\n max = lista[ult] - lista[0]\n elif(x == ult):\n min = lista[ult] - lista[ult - 1]\n max = lista[ult] - lista[0]\n else:\n min = lista[x] - lista[x -1]\n if (lista[x + 1] - lista[x] < min):\n\t\t min = lista[x + 1] - lista[x]\n\t\t \n max = lista[ult] - lista[x] \n if (lista[x] - lista[0] > max):\n\t max = lista[x] - lista[0]\n\t\t\t\n print(min, \" \", max)\n\t\t\t \t \t \t\t \t\t \t\t\t \t", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nprint(abs(lst[1] - lst[0]), abs(lst[0] - lst[-1]))\r\nfor i in range(1, n - 1):\r\n print(min(abs(lst[i] - lst[i - 1]), abs(lst[i] - lst[i + 1])), max(abs(lst[i] - lst[0]), abs(lst[i] - lst[-1])))\r\nprint(abs(lst[-1] - lst[-2]), abs(lst[-1] - lst[0]))", "def lineland_mail():\r\n n = int(input())\r\n cities = list(map(int, input().split()))\r\n absolute = abs(min(cities))\r\n cities = [i + absolute for i in cities]\r\n\r\n for i,city in enumerate(cities):\r\n if i == 0:\r\n print(\r\n abs(city - cities[i+1]),\r\n \" \",\r\n abs(city - cities[n-1]))\r\n elif i == n-1:\r\n print(\r\n abs(city - cities[i-1]),\r\n \" \",\r\n abs(city - cities[0]))\r\n else:\r\n print(\r\n min(abs(city - cities[i-1]), abs(city - cities[i+1])),\r\n \" \",\r\n max(abs(city - cities[0]), abs(city - cities[n-1])))\r\n\r\nlineland_mail()", "# 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= I()\r\n arr = IL() \r\n\r\n for i in range(n):\r\n if i == 0:\r\n print(arr[i+1]-arr[i],arr[-1]-arr[i])\r\n elif i == n -1:\r\n print(arr[i]-arr[i-1],arr[i]-arr[0])\r\n else:\r\n print(min(arr[i]-arr[i-1],arr[i+1]-arr[i]),max(arr[i]-arr[0],arr[-1]-arr[i]))\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=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(i==0):\r\n print(abs(l[i] - l[1]) , abs(l[0]-l[-1]))\r\n elif(i==n-1):\r\n print(abs(l[-1]-l[-2]),abs(l[-1]-l[0]))\r\n else:\r\n print(min(abs(l[i]-l[i+1]),abs(l[i]-l[i-1])),end=\" \")\r\n print(max(abs(l[i]-l[0]), abs(l[i]-l[-1])))", "n=int(input())\na=[int(x) for x in input().split()]\nmi=a[1]-a[0]\nma=a[-1]-a[0]\nprint(mi,ma)\nfor i in range(1,n-1):\n d1=a[i]-a[i-1]\n d2=a[i+1]-a[i]\n mi=min(d1,d2)\n m1=a[i]-a[0]\n m2=a[-1]-a[i]\n ma=max(m1,m2)\n print(mi,ma)\nmi=a[-1]-a[-2]\nma=a[-1]-a[0]\nprint(mi,ma)\n\t \t\t\t\t \t\t \t\t \t\t\t \t \t", "n = int(input())\r\ncities = list(map(int,input().split()))\r\nminmum = 0\r\nmaxmum = 0\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n minmum = abs(cities[i]-cities[1])\r\n maxmum = abs(cities[i]-cities[-1])\r\n print(f\"{minmum} {maxmum}\")\r\n elif i == n-1:\r\n minmum = abs(cities[i]-cities[-2])\r\n maxmum = abs(cities[i]-cities[0])\r\n print(f\"{minmum} {maxmum}\")\r\n else:\r\n print()\r\n minmum = min(abs(cities[i]-cities[i+1]),abs(cities[i]-cities[i-1])) \r\n maxmum = max(abs(cities[i]-cities[0]),abs(cities[i]-cities[-1])) \r\n print(f\"{minmum} {maxmum}\")", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = []\r\nfor i,v in enumerate(a):\r\n mi = min(abs(v-a[i-1]), abs(v-a[(i+1)%n]))\r\n mx = max(abs(v-a[0]), abs(v-a[1]), abs(v-a[-1]), abs(v-a[-2]))\r\n ans.append((mi, mx))\r\nprint('\\n'.join(f'{mi} {mx}' for mi, mx in ans))", "import sys\nstring = sys.stdin.read()\n\nvalues = list(map(int, string.split()[1:]))\nfor idx, val in enumerate(values):\n if idx == 0:\n min_dist = values[1] - val\n elif idx == len(values) - 1:\n min_dist = val - values[idx - 1]\n else:\n min_dist = min(values[idx + 1] - val, val - values[idx - 1])\n \n max_dist = max(val - values[0], values[-1] - val)\n print(f\"{min_dist} {max_dist}\")\n \t\t \t\t\t\t \t\t\t \t\t \t \t \t\t\t", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\n# IF NOT IN ORDER\r\n# for idx, i in enumerate(l):\r\n# mn, mx = float('inf'), float('-inf')\r\n# lei = l[:idx] + l[idx+1:]\r\n# # print(lei)\r\n# for j in lei:\r\n# dist = abs(i-j)\r\n# # print(dist)\r\n# mn = dist if dist < mn else mn\r\n# mx = dist if dist > mx else mx \r\n# print(f\"{mn} {mx}\")\r\n\r\n# FOR ASCENDING ORDER\r\nfor idx, i in enumerate(l):\r\n if idx == 0:\r\n mn, mx = abs(i-l[1]), abs(i-l[-1])\r\n elif idx == n-1:\r\n mn, mx = abs(i-l[-2]), abs(i-l[0])\r\n else:\r\n mn = min(abs(i-l[idx-1]), abs(i-l[idx+1]))\r\n mx = max(abs(i-l[0]), abs(i-l[-1]))\r\n\r\n print(f\"{mn} {mx}\")\r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n ma=max(a[i]-a[0], a[-1]-a[i])\r\n if i!=0 and i!=n-1:\r\n mi=min(a[i]-a[i-1], a[i+1]-a[i])\r\n elif i==0:\r\n mi=a[i+1]-a[i]\r\n else:\r\n mi=a[i]-a[i-1]\r\n print(mi, ma)", "p=int(input())\nn=list(map(int,input().split()))[:p]\nfor i in range(p):\n\n if i==0:\n print(abs(n[1]-n[0]),abs(n[p-1]-n[0]),sep=\" \")\n elif i==p-1:\n print(abs(n[p-1]-n[p-2]),abs(n[p-1]-n[0]),sep=\" \")\n else: \n a=abs(n[i]-n[i-1])\n b=abs(n[i+1]-n[i])\n c=abs(n[i]-n[0])\n d=abs(n[i]-n[p-1])\n print(min(a,b),max(c,d),sep=\" \")\n\n\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\nfor i in range(n):\r\n if i == 0:\r\n print(abs(l[i] - l[i + 1]), abs(l[n - 1] - l[i]))\r\n elif i == n - 1:\r\n print(abs(l[i] - l[i - 1]), abs(l[n - 1] - l[0]))\r\n else:\r\n print(min(abs(l[i] - l[i + 1]), abs(l[i] - l[i - 1])), max(abs(l[i] - l[0]),abs(l[i] - l[n - 1]) ))", "nc = int(input())\neixox = str(input()).split()\n\nfor x in range(nc):\n menor = 0\n maior = 0\n if(x==0):\n menor = - (int(eixox[x]) - int(eixox[x+1]))\n maior = - (int(eixox[x]) - int(eixox[nc-1]))\n if (x==nc-1):\n menor = - (int(eixox[x-1]) - int(eixox[x]))\n maior = - (int(eixox[0]) - int(eixox[x]))\n if (menor == 0):\n if(-(int(eixox[x-1]) - int(eixox[x])) < -(int(eixox[x]) - int(eixox[x+1]))):\n menor = -(int(eixox[x-1]) - int(eixox[x]))\n else:\n menor = -(int(eixox[x]) - int(eixox[x+1]))\n if(maior ==0):\n if(-(int(eixox[0]) - int(eixox[x])) > -(int(eixox[x]) - int(eixox[nc-1]))):\n maior = -(int(eixox[0]) - int(eixox[x]))\n else:\n maior = -(int(eixox[x]) - int(eixox[nc-1]))\n \n\n print(str(menor) + \" \" + str(maior)) \n \t\t \t \t \t\t\t \t\t\t \t \t \t", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n mn = x[i + 1] - x[i]\r\n elif i == n - 1:\r\n mn = x[i] - x[i - 1]\r\n else:\r\n mn = min(x[i + 1] - x[i], x[i] - x[i - 1])\r\n\r\n mx = max(x[n - 1] - x[i], x[i] - x[0])\r\n\r\n print(mn, mx)", "n=int(input())\r\np=(list(map(int,input().split())))\r\nfor i in range(n):\r\n MM=[]\r\n MM.append(max(abs(p[i]-p[-1]),abs(p[i]-p[0])))\r\n if i!=n-1 and i!=0:\r\n MM.append(min(abs(p[i]-p[i-1]),abs(p[i]-p[i+1])))\r\n elif i==0:\r\n MM.append(abs(p[i]-p[i+1]))\r\n elif i==n-1:\r\n MM.append(abs(p[i]-p[i-1]))\r\n print(min(MM),max(MM)) ", "n = int(input())\nnums = list(map(int, input().split()))\n\nfor idx, val in enumerate(nums):\n maxNum = max(val - nums[0], nums[-1] - val)\n if idx == 0:\n minNum = nums[idx+1] - val\n elif idx == len(nums) - 1:\n minNum = val - nums[idx-1]\n else:\n minNum = min(val - nums[idx-1], nums[idx+1] - val)\n print(str(minNum) + \" \" + str(maxNum))\n ", "n=int(input())\r\narr=list(map(int, input().split()))\r\nfor i in range(n):\r\n if i==n-1:\r\n print(abs(arr[i]-arr[i-1]),end=' ')\r\n print(max(abs(arr[i]-arr[0]),abs(arr[i]-arr[n-1])))\r\n else:\r\n print(min(abs(arr[i]-arr[i-1]),abs(arr[i]-arr[i+1])), end=' ')\r\n print(max(abs(arr[i]-arr[0]),abs(arr[i]-arr[n-1])))\r\n", "n = int(input())\r\nList = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i+1 != n:\r\n miny = min(abs(List[i]-List[i-1]), abs(List[i]-List[i+1]))\r\n else:\r\n miny = abs(List[i] - List[i - 1])\r\n maxy = max(abs(List[i]-List[-1]), abs(List[i]-List[0]))\r\n print(miny, maxy)", "n = int(input())\r\na = []\r\na = list(map(int, input().split()))\r\na.append(a[-1])\r\na.sort()\r\nfor i in range(0,n):\r\n if i == 0:\r\n print(a[1] - a[0],end=\" \")\r\n print(a[-1]-a[0],end=\"\")\r\n print()\r\n elif i == n-1:\r\n print(a[-1] - a[n-2],end=\" \")\r\n print(a[-1]-a[0],end=\"\")\r\n print()\r\n else:\r\n print(min(a[i+1] - a[i],a[i]-a[i-1]),end=\" \")\r\n print(max(a[-1] - a[i],a[i]-a[0]),end=\"\")\r\n print()", "n = int(input())\r\nli = [*map(int,input().split())]\r\nfor i in range(n):\r\n if i==0:\r\n print(abs(li[i]-li[i+1]),abs(li[i]-li[n-1]))\r\n elif i==n-1:\r\n print(abs(li[i]-li[i-1]),abs(li[i]-li[0]))\r\n else:\r\n print(min(abs(li[i]-li[i+1]),abs(li[i]-li[i-1])),max(abs(li[i]-li[0]),abs(li[i]-li[n-1])))", "count = int(input())\r\nb = input().split()\r\nlist_1 = [int(i) for i in b]\r\nfirst = list_1[0]\r\nsecond = list_1[1]\r\nsecond_before_last = list_1[-2]\r\nlast = list_1[-1]\r\nprint(abs(first - second), abs(first - last))\r\nfor i in range(1, count - 1):\r\n a = list_1[i]\r\n a_1 = list_1[i + 1]\r\n a_0 = list_1[i - 1]\r\n mi_1 = abs(a_0 - a)\r\n mi_2 = abs(a - a_1)\r\n ma_1 = abs(list_1[0] - a)\r\n ma_2 = abs(a - list_1[-1])\r\n list_3 = [mi_1, mi_2, ma_1, ma_2]\r\n ma = max(list_3)\r\n mi = min(list_3)\r\n print(mi, ma)\r\nprint(abs(second_before_last - last), abs(first - last))\r\n", "n = int(input())\r\ntowns = list(map(int, input().split()))\r\nprint(towns[1] - towns[0], towns[n-1] - towns[0])\r\nfor i in range(1, n-1):\r\n ans = []\r\n if towns[i] - towns[i-1] < towns[i+1] - towns[i]:\r\n ans.append(str(towns[i] - towns[i-1]))\r\n else:\r\n ans.append(str(towns[i+1] - towns[i]))\r\n if towns[i] - towns[0] > towns[n-1] - towns[i]:\r\n ans.append(str(towns[i] - towns[0]))\r\n else:\r\n ans.append(str(towns[n-1] - towns[i]))\r\n print(\" \".join(ans))\r\nprint(towns[n-1] - towns[n-2], towns[n-1] - towns[0])", "'''\r\n# Submitted By [email protected]\r\nDon't Copy This Code, Try To Solve It By Yourself\r\n'''\r\n# Problem Name = \"Lineland Mail\"\r\n# Class: A\r\n\r\nimport sys\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\ndef Solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n print(a[1]-a[0], a[-1]-a[0])\r\n for i in range(1, n-1):\r\n min_=min(abs(a[i]-a[i-1]), abs(a[i]-a[i+1]))\r\n max_=max(abs(a[i]-a[0]), abs(a[i]-a[-1]))\r\n print(min_, max_)\r\n print(a[-1]-a[-2], a[-1]-a[0])\r\nif __name__ == \"__main__\":\r\n Solve()", "n = int(input())\nv = list(map(int, input().split()))\nm = v[0]\nM = v[-1]\na = []\nfor i in range(1, n - 1):\n x = [0, 0]\n x[0] = min(v[i + 1] - v[i], v[i] - v[i - 1])\n x[1] = max(v[i] - m, M - v[i])\n a.append(x)\na = [[v[1] - m, M - m]] + a + [[M - v[-2], M - m]]\nfor x in a:\n print(*x)\n", "length = int(input())\r\nx = list(map(int, input().split(\" \")))\r\nfor i in range(length):\r\n t= x[i]\r\n print(min(abs(t - x[i - 1]), abs(x[i - length + 1] - t)), max(t - x[0], x[length - 1] - t))", "n = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n min_i = max_i = 0\r\n if i == 0:\r\n min_i = abs(x[1] - x[0])\r\n max_i = abs(x[0] - x[-1])\r\n elif i == n - 1:\r\n min_i = abs(x[-1] - x[-2])\r\n max_i = abs(x[0] - x[-1])\r\n else:\r\n min_i = min(abs(x[i] - x[i - 1]), abs(x[i] - x[i + 1]))\r\n max_i = max(abs(x[i] - x[0]), abs(x[i] - x[-1]))\r\n print(min_i, max_i)\r\n", "n=int(input())\r\nl=input().split()\r\ninl=[]\r\nfor i in l:\r\n x=int(i)\r\n inl.append(x)\r\n \r\n \r\nfor i in range(len(l)):\r\n Max=max(abs(inl[i]-inl[-1]),abs(inl[i]-inl[0]))\r\n Min=min(abs(inl[i]-inl[(i+1)%len(inl)]),abs(inl[i]-inl[i-1]))\r\n \r\n print(Min,Max)\r\n Max=0\r\n Min=0\r\n\r\n\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nprint((b[1]-b[0]),(b[-1]-b[0]))\r\nfor i in range(1,len(b)-1):\r\n if b[i]-b[i-1]<=b[i+1]-b[i] and b[-1]-b[i]>=b[i]-b[0]:\r\n print(b[i]-b[i-1],b[-1]-b[i])\r\n elif b[i]-b[i-1]>b[i+1]-b[i] and b[-1]-b[i]<b[i]-b[0]:\r\n print(b[i+1]-b[i],b[i]-b[0])\r\n elif b[i]-b[i-1]<=b[i+1]-b[i] and b[-1]-b[i]<=b[i]-b[0]:\r\n print(b[i]-b[i-1],b[i]-b[0])\r\n elif b[i]-b[i-1]>b[i+1]-b[i] and b[-1]-b[i]>b[i]-b[0]:\r\n print(b[i+1]-b[i],b[-1]-b[i])\r\nprint((b[-1]-b[-2]),(b[-1]-b[0]))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n if(i ==0):\r\n print(l[1]-l[0],l[n-1]-l[0])\r\n elif(i ==n-1):\r\n print(l[n-1]-l[n-2],l[n-1]-l[0])\r\n else:\r\n print(min(l[i+1]-l[i],l[i]-l[i-1]),max(l[n-1]-l[i],l[i]-l[0]))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jun 25 04:41:50 2023\r\n\r\n@author: RadmediX\r\n\"\"\"\r\nn = int(input())\r\n\r\ncities = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n mx = max(abs(cities[0] - cities[i]),abs(cities[-1] - cities[i]))\r\n if i == 0 : mn = abs(cities[0] - cities[1])\r\n elif i == n-1: mn = abs(cities[-1] - cities[-2])\r\n else : mn = min(abs(cities[i] - cities[i-1]),abs(cities[i] - cities[i+1]))\r\n print(f'{mn} {mx}')\r\n \r\n\r\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 X = list(map(int, wtf[1].split()))\r\n for i in range(n):\r\n ans = [0,0]\r\n Ln = X[i-1] if i-1 >= 0 else X[i]\r\n Rn = X[i+1] if i+1 < n else X[i]\r\n ans[0] = min( abs(Ln-X[i]), abs(Rn-X[i]) )\r\n ans[1] = max( abs(X[0]-X[i]), abs(X[-1]-X[i]) )\r\n if i == 0:\r\n ans[0] = abs(Rn-X[i])\r\n if i+1 == n:\r\n ans[0] = abs(Ln-X[i])\r\n print(f'{ans[0]} {ans[1]}')\r\n", "x=int(input());y=list(map(int,input().split()))\r\nprint(y[1]-y[0],y[-1]-y[0])\r\nfor i in range(1,x-1):\r\n print(min(y[i]-y[i-1],y[i+1]-y[i]),max(y[-1]-y[i],y[i]-y[0]))\r\nprint(y[-1]-y[-2],y[-1]-y[0])", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nres =[]\r\nfor i in range(n):\r\n ma = max(abs(lis[i]-lis[0]),abs(lis[i]-lis[n-1]))\r\n if i == 0 :\r\n mi = abs(lis[i]-lis[i+1])\r\n elif i == n-1 :\r\n mi = abs(lis[i]-lis[i-1])\r\n else:\r\n mi = min(abs(lis[i]-lis[i-1]),abs(lis[i]-lis[i+1]))\r\n res.append([mi,ma])\r\nfor row in res:\r\n print(*row)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(lst[1]-lst[0],lst[-1]-lst[0])\r\nx,y=0,0\r\nfor i in range(1,n-1):\r\n ch=\"\"\r\n x,y=lst[i]-lst[i-1],lst[i+1]-lst[i]\r\n if x<y:\r\n ch+=str(x)+\" \"\r\n else:\r\n ch+=str(y)+\" \"\r\n x,y=lst[i]-lst[0],lst[n-1]-lst[i]\r\n if x<y:\r\n ch+=str(y)\r\n else:\r\n ch+=str(x)\r\n print(ch)\r\nprint(lst[n-1]-lst[n-2],lst[n-1]-lst[0])", "'''\r\nn = int(input())\r\na, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n'''\r\n\r\nn = int(input())\r\ncities = list(enumerate(map(int, input().split())))\r\ncities.sort(key=lambda x:x[1])\r\n\r\noutput = []\r\nfor ind, pos in cities:\r\n a = float(\"INF\")\r\n b = 0\r\n if ind > 0:\r\n a = min(a, pos - cities[ind-1][1])\r\n b = max(b, pos - cities[0][1])\r\n if ind < n-1:\r\n a = min(a, cities[ind+1][1] - pos)\r\n b = max(b, cities[-1][1] - pos)\r\n output.append((ind, a, b))\r\noutput.sort(key=lambda x:x[0])\r\nfor item in output:\r\n print(item[1], item[2])\r\n\r\n \r\n", "import sys\r\n\r\ninputs = []\r\nfor line in sys.stdin:\r\n inputs.append(line)\r\n\r\nlength = int(inputs[0].strip())\r\nintegers = inputs[1].strip().split()\r\nfor i in range(0,len(integers)):\r\n integers[i] = int(integers[i])\r\n\r\nfor i in range(0,length):\r\n curr = integers[i]\r\n if i < length-1:\r\n next = integers[i+1]\r\n else:\r\n next = integers[0]\r\n if i > 0:\r\n prev = integers[i-1]\r\n else:\r\n prev = integers[-1]\r\n nextdist = abs(curr - next)\r\n prevdist = abs(curr - prev)\r\n \r\n smaller = nextdist if nextdist < prevdist else prevdist\r\n \r\n first = integers[0]\r\n last = integers[-1]\r\n firstdist = abs(curr - first)\r\n lastdist = abs(curr - last)\r\n \r\n bigger = firstdist if firstdist > lastdist else lastdist\r\n print(f\"{smaller} {bigger}\")\r\n ", "\r\ndef answer(n, x):\r\n mn = []\r\n mx = []\r\n mn.append(x[1] - x[0])\r\n mx.append(x[-1] - x[0])\r\n \r\n \r\n for i in range(1, n-1):\r\n mn.append(min(x[i+1]-x[i], x[i] - x[i-1]))\r\n mx.append(max(x[i] - x[0], x[-1] - x[i]))\r\n mn.append(x[-1] - x[-2])\r\n mx.append(x[-1] - x[0])\r\n \r\n for i in range(n):\r\n print(mn[i], mx[i])\r\n \r\n \r\n return\r\n\r\ndef main():\r\n n = int(input())\r\n x = [int(i) for i in input().split()]\r\n \r\n answer(n, x)\r\n\r\n\r\nmain()", "n = int(input())\r\nXs = list(map(int, input().split()))\r\n# will contains (min, max)\r\nout = []\r\n\r\nfor i in range(n):\r\n current_city = Xs[i]\r\n max_ = max(abs(current_city-Xs[0]), abs(current_city-Xs[-1]))\r\n if i == 0:\r\n min_ = abs(current_city-Xs[1])\r\n elif i == n-1:\r\n min_ = abs(current_city-Xs[-2])\r\n else:\r\n min_ = min(abs(current_city-Xs[i-1]), abs(current_city-Xs[i+1]) )\r\n out.append((min_, max_))\r\n\r\nfor o in out:\r\n print(*o)", "a=int(input())\r\nlist1=list(map(int,input().split()))\r\n\r\nfor i in range(a):\r\n if i==0:\r\n print(abs(list1[0] - list1[1]), abs(list1[0] - list1[-1]))\r\n elif i==a-1:\r\n print(abs(list1[-1] - list1[-2]), abs(list1[-1] - list1[0]))\r\n else:\r\n j=min(abs(list1[i]-list1[i-1]),abs(list1[i]-list1[i+1]))\r\n t=max(abs(list1[i]-list1[0]),abs(list1[i]-list1[-1]))\r\n print(j,t)", "n = int(input())\r\nx=[int(i) for i in input().split()]\r\ny= len(x)\r\nfor i in range(y-1):\r\n print(min(abs(x[i+1]-x[i]),abs(x[i]-x[i-1])),max(abs(x[y-1]-x[i]),abs(x[i]-x[0])))\r\nprint(x[y-1]-x[y-2],x[y-1]-x[0])", "n=int(input())\r\nCity=[int( x ) for x in input().split()]\r\n\r\n\r\nfor i in range(n):\r\n if i==0:\r\n minNode=abs(City[i] - City[i+1])\r\n maxNode = abs(City[i] - City[-1])\r\n elif i==n-1:\r\n minNode = abs(City[i] - City[i-1])\r\n maxNode = abs(City[i] - City[0])\r\n else:\r\n minNode = min(abs(City[i]-City[i-1]), abs(City[i]-City[i+1]))\r\n maxNode = max(abs(City[i]-City[0]), abs(City[i]-City[n-1]))\r\n print(minNode,maxNode)", "n = int(input())\r\ns = list(map(int,input().split()))\r\nfor i in range(len(s)):\r\n if i == 0:\r\n print(s[1]-s[0],s[-1]-s[0])\r\n elif i == len(s) - 1:\r\n print(s[-1]-s[-2],s[-1] - s[0])\r\n else:\r\n print(min(s[i]-s[i-1],s[i+1]-s[i]),max(s[i]-s[0],s[-1]-s[i]))", "n=int(input())\nad=list(map(int,input().split()))\nminimum=[]\nminimum.append(abs(ad[1]-ad[0]))\nmaximum=[]\nmaximum.append(abs(ad[0]-ad[-1]))\nprint(minimum[0],maximum[0])\nfor i in range(1,len(ad)-1):\n minimum.append(min(abs(ad[i+1]-ad[i]),abs(ad[i-1]-ad[i])))\n maximum.append(max(abs(ad[0]-ad[i]),abs(ad[-1]-ad[i])))\n print(minimum[i],maximum[i])\nminimum.append(abs(ad[-2]-ad[-1]))\nmaximum.append(abs(ad[0]-ad[-1]))\nprint(minimum[-1],maximum[-1])\n", "x=int(input())\r\nn=list(map(int, input().split()))\r\n\r\nprint(abs(n[0]-n[1]),abs(n[0]-n[-1]))\r\n\r\nfor i in range(1,x-1):\r\n #min \r\n \r\n min1 = abs(n[i] - n[i+1])\r\n min2=abs(n[i]-n[i-1])\r\n \r\n if min1<min2:\r\n print(min1, end=\" \")\r\n \r\n else:\r\n print(min2, end=\" \")\r\n \r\n \r\n #max \r\n \r\n max1 = abs(n[i]-n[0])\r\n max2=abs(n[i]-n[-1])\r\n \r\n if max1>max2:\r\n print(max1)\r\n \r\n else:\r\n print(max2)\r\n \r\n \r\nprint(abs(n[-1]-n[-2]),abs(n[-1]-n[0]))\r\n ", "n = int(input())\r\nar = list(map(int, input().split()))\r\n\r\nfor i in range(0,len(ar)):\r\n if i == 0:\r\n mx_d = abs(ar[0] - ar[-1])\r\n mn_d = abs(ar[0] - ar[1])\r\n elif i == len(ar)-1:\r\n mx_d = abs(ar[0] - ar[-1])\r\n mn_d = abs(ar[-2] - ar[-1])\r\n else:\r\n mx_d = max(abs(ar[i]-ar[0]), abs(ar[i]-ar[-1]))\r\n mn_d = min(abs(ar[i+1]-ar[i]), abs(ar[i-1]-ar[i]))\r\n print(mn_d, mx_d)\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n if i==0:\r\n print(abs(l[i]-l[i+1]),abs(l[-1]-l[i]))\r\n elif i==n-1:\r\n print(abs(l[i]-l[i-1]),abs(l[i]-l[0]))\r\n else:\r\n print(min(abs(l[i]-l[i+1]),abs(l[i]-l[i-1])),max(abs(l[i]-l[0]),abs(l[i]-l[-1])))\r\n", "l=int(input())\nA=list(map(int,input().split()))[:l]\nsol=[]\nfor i in range(l):\n\n if i==0:\n print(abs(A[1]-A[0]),abs(A[l-1]-A[0]),sep=\" \")\n elif i==l-1:\n print(abs(A[l-1]-A[l-2]),abs(A[l-1]-A[0]),sep=\" \")\n else:\n a=abs(A[i]-A[i-1])\n b=abs(A[i+1]-A[i])\n c=abs(A[i]-A[0])\n d=abs(A[i]-A[l-1])\n print(min(a,b),max(c,d),sep=\" \")\n \t \t\t\t \t\t\t \t \t\t \t \t", "n = int(input())\n\ncidades = [int(x) for x in input().split()]\n\nfor i in range(n):\n\tif i == 0:\n\t\tmini = abs(cidades[i+1] - cidades[i])\n\t\tmaxi = abs(cidades[n-1] - cidades[i])\n\t\t\n\telif i == n-1:\n\t\tmini = abs(cidades[n-2] - cidades[i])\n\t\tmaxi = abs(cidades[0] - cidades[i])\n\t\t\n\telse:\n\t\ta = abs(cidades[i-1] - cidades[i])\n\t\tb = abs(cidades[i+1] - cidades[i])\n\t\tmini = min(a,b)\n\t\t\n\t\tc = abs(cidades[0] - cidades[i])\n\t\td = abs(cidades[n-1] - cidades[i])\n\t\tmaxi = max(c,d)\n\t\t\n\tresp = str(mini) + \" \" + str(maxi)\n\tprint(resp)\n\n\t \t\t\t\t \t\t\t \t \t\t\t\t \t\t\t\t\t \t \t \t", "import sys\n\ntokens = (token for token in sys.stdin.read().split())\n\nN = int(next(tokens))\n\ncities = []\nfor _ in range(N):\n cities.append(int(next(tokens)))\n\nfor i in range(len(cities)-1):\n print(min(abs(cities[i-1] - cities[i]), abs(cities[i+1] - cities[i])), max(abs(cities[0] - cities[i]), abs(cities[-1] - cities[i])))\n\nprint(abs(cities[-1] - cities[-2]), abs(cities[-1] - cities[0]))\n\n\t\t \t \t \t\t \t \t \t\t", "n = int(input())\r\nar = list(map(int, input().split()))\r\n\r\nar = sorted(ar)\r\n\r\nif len(ar) == 2:\r\n dist = abs(ar[1]-ar[0])\r\n print(dist, dist)\r\n print(dist, dist)\r\nelse:\r\n min_dist = abs(ar[1]-ar[0])\r\n max_dist = abs(ar[-1]-ar[0])\r\n print(min_dist, max_dist)\r\n for i in range(1, len(ar)-1):\r\n min_dist = min(abs(ar[i-1]-ar[i]),abs(ar[i+1]-ar[i]))\r\n max_dist = max(abs(ar[0]-ar[i]),abs(ar[-1]-ar[i]))\r\n \r\n print(min_dist, max_dist)\r\n \r\n min_dist = abs(ar[-1]-ar[-2])\r\n max_dist = abs(ar[-1]-ar[0])\r\n print(min_dist, max_dist)\r\n ", "n = int(input());\nentrada = input().split(\" \");\ncidades = [int(x) for x in entrada];\n\naux = [0];\nmin = [];\nmax = [];\n\nfor x in range(n):\n if(x == 0):\n min.append(cidades[x+1] - cidades[x]);\n elif(x == n-1):\n min.append(cidades[x] - cidades[x-1]);\n aux.append(aux[x-1] + (cidades[x] - cidades[x-1]));\n else:\n esquerda = cidades[x] - cidades[x-1];\n direita = cidades[x+1] - cidades[x];\n if(esquerda <= direita):\n min.append(esquerda);\n else:\n min.append(direita);\n aux.append(aux[x-1] + (cidades[x] - cidades[x-1]));\n\nfor x in range(n):\n if(x == n-1 or x == 0):\n max.append(aux[n-1]);\n else:\n esquerda = aux[x];\n direita = aux[n-1] - aux[x];\n if(esquerda >= direita):\n max.append(esquerda);\n else:\n max.append(direita);\n \nfor x in range(n):\n print(str(min[x]) +\" \"+ str(max[x]));\n\t\t\t \t \t \t\t \t \t \t \t", "# Codeforces - Lineland Mail\r\n\r\n# Link : https://codeforces.com/contest/567/problem/A\r\n\r\nclass Lineland:\r\n def __init__(self, numberOfCities: int, cities: list) -> None:\r\n self.__numberOfCities = numberOfCities\r\n self.__cities = cities\r\n\r\n @property\r\n def getMinMax(self):\r\n result = []\r\n for i in range(self.__numberOfCities):\r\n if (i == 0):\r\n minDistance = self.__cities[i + 1] - self.__cities[i]\r\n elif (i == self.__numberOfCities - 1):\r\n minDistance = self.__cities[i] - self.__cities[i - 1]\r\n elif (self.__cities[i + 1] - self.__cities[i] < self.__cities[i] - self.__cities[i - 1]):\r\n minDistance = self.__cities[i + 1] - self.__cities[i]\r\n else:\r\n minDistance = self.__cities[i] - self.__cities[i - 1]\r\n\r\n if (i == 0):\r\n maxDistance = self.__cities[len(\r\n self.__cities) - 1] - self.__cities[i]\r\n elif (i == self.__numberOfCities - 1):\r\n maxDistance = self.__cities[i] - self.__cities[0]\r\n elif (self.__cities[-1] - self.__cities[i] > self.__cities[i] - self.__cities[0]):\r\n maxDistance = self.__cities[-1] - self.__cities[i]\r\n else:\r\n maxDistance = self.__cities[i] - self.__cities[0]\r\n\r\n result.append(f\"{minDistance} {maxDistance}\")\r\n\r\n return \"\\n\".join(result)\r\n\r\n\r\ndef main():\r\n numberOfCities = int(input())\r\n cities = list(map(int, input().split(\" \")))\r\n lineland = Lineland(numberOfCities, cities)\r\n print(lineland.getMinMax)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\n\nn = int(input())\n\ncidades = input()\ncidades = cidades.split()\n\nfor i in range(len(cidades)):\n cidades[i] = int(cidades[i])\n\n\nfor i in range(len(cidades)):\n\n menor = 0\n maior = 0\n \n if i == 0:\n menor = abs(cidades[i] - cidades[i + 1])\n maior = abs(cidades[i] - cidades[-1])\n\n \n elif i == len(cidades) - 1:\n menor = abs(cidades[i] - cidades[i - 1])\n maior = abs(cidades[i] - cidades[0])\n \n \n else:\n menor = min(abs(cidades[i] - cidades[i + 1]), abs(cidades[i] - cidades[i - 1]))\n maior = max(abs(cidades[i] - cidades[-1]), abs(cidades[i] - cidades[0]))\n\n print(f'{menor} {maior}')\n\t \t\t \t \t\t \t \t \t\t \t\t\t\t\t\t\t \t\t", "n = int(input())\r\ncities = list(map(int, input().split()))\r\nprint(abs(cities[0] - cities[1]), abs(cities[0]-cities[-1]))\r\nfor i in range(1, n-1):\r\n smallestPrice = min(abs(cities[i] - cities[i-1]), abs(cities[i] - cities[i+1]))\r\n largestPrice = max(abs(cities[i] - cities[0]), abs(cities[i] - cities[-1]))\r\n print(smallestPrice, largestPrice)\r\nprint(abs(cities[-1] - cities[-2]), abs(cities[-1] - cities[0]))", "n = int(input())\r\nx = list(map(int,input().split()))\r\nfor i in range(len(x)):\r\n if i-1>-1 and i+1<n:\r\n lo = min(x[i]-x[i-1],x[i+1]-x[i])\r\n elif i-1>-1:\r\n lo = x[i]-x[i-1]\r\n else:\r\n lo = x[i+1]-x[i]\r\n hi = max(x[i]-x[0],x[-1]-x[i])\r\n print(lo,hi)", "from json.encoder import INFINITY\r\n\r\n\r\ndef DisplayMiniMaxCost(num,arr):\r\n cities_minimaxcost = []\r\n for i in range(num):\r\n max1 = abs(arr[i] - arr[num-1])\r\n max2 = abs(arr[i] - arr[0])\r\n if(i != num-1):\r\n min1 = abs(arr[i] - arr[i+1])\r\n else:\r\n min1 = 10**250\r\n if(i != 0):\r\n min2= abs(arr[i] - arr[i-1])\r\n else:\r\n min2=10**250\r\n if(max1 > max2):\r\n max = max1\r\n else:\r\n max = max2\r\n if(min1 < min2):\r\n min = min1\r\n else:\r\n min = min2\r\n cities_minimaxcost.append([min , max])\r\n for i in cities_minimaxcost:\r\n print(*i,sep=' ')\r\n\r\ndef main():\r\n num = int(input())\r\n arr = list(map(int,input().strip().split()))\r\n DisplayMiniMaxCost(num,arr)\r\n\r\nif __name__==\"__main__\":\r\n main()", "n = int(input())\r\n\r\nvals = list(map(int,input().split()))\r\nstart = vals[0]\r\nend = vals[-1]\r\n\r\nprint(vals[1]-start,end-start)\r\nfor number in range(1,n-1):\r\n current = vals[number]\r\n before = vals[number-1]\r\n after = vals[number+1]\r\n print(min(current-before,after-current)\r\n ,max(end-current,current-start))\r\n \r\nprint(end-vals[-2],end-start)\r\n", "n =int(input())\r\narr = list(map(int,input().split()))\r\nm = arr[1]-arr[0]\r\nx = arr[-1]-arr[0]\r\nprint(m , x)\r\nfor i in range(1,n-1):\r\n\tmi = min(arr[i]-arr[i-1] ,arr[i+1]-arr[i])\r\n\tmx = max(arr[-1]-arr[i],arr[i]-arr[0])\r\n\tprint(mi , mx)\r\nm = arr[-1]-arr[-2]\r\nx = arr[-1]-arr[0]\r\nprint(m , x)", "N = int(input())\r\ncities = [int(x) for x in input().split()]\r\nfor i in range(N):\r\n maxcost = max(abs(cities[i]-cities[0]),abs(cities[i]-cities[N-1]))\r\n if i == 0:\r\n mincost = abs(cities[i] - cities[i+1])\r\n elif i == N -1:\r\n mincost = abs(cities[i] - cities[i-1])\r\n else:\r\n mincost = min(abs(cities[i] - cities[i+1]), abs(cities[i] - cities[i-1]))\r\n print(mincost, maxcost)", "t=int(input())\na=list(map(int, input().split()))\nfor i in range(t):\n\tif(i==0):\n\t\tz=abs(a[i]-a[i+1])\n\t\tx=abs(a[i]-a[t-1])\n\telif(i==t-1):\n\t\tz=abs(a[i]-a[i-1])\n\t\tx=abs(a[i]-a[0])\n\telse:\n\t\tx=max(abs(a[i]-a[0]),abs(a[i]-a[t-1]))\n\t\tz=min(abs(a[i]-a[i+1]),abs(a[i]-a[i-1]))\n\tprint(z,x)\n \t \t\t \t \t\t\t\t\t\t\t \t \t\t\t \t\t\t", "# Link: https://codeforces.com/contest/567/problem/A\n\nnumber_of_cities = int(input())\ncities_coordinates = list(map(int, input().split()))\n\nfor coordinate_index, city_position in enumerate(cities_coordinates):\n min_distance = max_distance = 0\n \n if coordinate_index == 0:\n min_distance = abs(city_position - cities_coordinates[coordinate_index + 1])\n max_distance = abs(city_position - cities_coordinates[-1])\n\n elif coordinate_index == len(cities_coordinates) - 1:\n min_distance = abs(city_position - cities_coordinates[coordinate_index - 1])\n max_distance = abs(city_position - cities_coordinates[0])\n \n else:\n min_a = abs(city_position - cities_coordinates[coordinate_index - 1])\n min_b = abs(city_position - cities_coordinates[coordinate_index + 1])\n \n min_distance = min_a if min_a < min_b else min_b\n \n max_a = abs(city_position - cities_coordinates[0])\n max_b = abs(city_position - cities_coordinates[-1])\n \n max_distance = max_a if max_a > max_b else max_b\n \n print(min_distance, max_distance)", "n = int(input())\r\nx = [int(val) for val in input().split()]\r\nfor i in range(n):\r\n if i == 0:\r\n # this is the start\r\n print(x[i+1]-x[i], x[n-1]-x[i])\r\n elif i == n-1:\r\n print(x[i]-x[i-1], x[i]-x[0])\r\n else:\r\n ln = x[i]-x[i-1]\r\n rn = x[i+1]-x[i]\r\n h = x[i] - x[0]\r\n e = x[n-1]-x[i]\r\n print(min(ln, rn), max(h, e))", "n = int(input())\r\ncities = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n menor = abs(cities[i] - cities[i+1])\r\n maior = abs(cities[i] - cities[n-1])\r\n elif i == n - 1:\r\n menor = abs(cities[i] - cities[i-1])\r\n maior = abs(cities[i] - cities[0])\r\n else:\r\n menor_1 = abs(cities[i] - cities[i+1])\r\n menor_2 = abs(cities[i] - cities[i-1])\r\n menor = min(menor_1, menor_2)\r\n maior_1 = abs(cities[i] - cities[n-1])\r\n maior_2 = abs(cities[i] - cities[0])\r\n maior = max(maior_1, maior_2)\r\n print(menor, maior)\r\n", "n = int(input())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\ndaf_sort = sorted(daf)\r\nmax_kiri = daf_sort[0]\r\nmax_kanan = daf_sort[-1]\r\n\r\nfor i in range(n):\r\n min_val = 1e5\r\n max_val = 1\r\n\r\n ind = daf_sort.index(daf[i])\r\n\r\n #min\r\n min_kiri = daf_sort[ind-1]\r\n min_kanan = daf_sort[(ind+1)%n]\r\n\r\n min_has = min(abs(daf[i] - min_kiri), abs(min_kanan - daf[i]))\r\n max_has = max(abs(daf[i] - max_kiri), abs(max_kanan - daf[i]))\r\n\r\n print(min_has, max_has)\r\n", "from sys import stdin\r\nnum = stdin.readline().strip()\r\ncities = [int(x) for x in stdin.readline().strip().split()]\r\nfor i in range(len(cities)):\r\n flag = True\r\n maximum = 0\r\n if i < len(cities) - 1 and flag == True:\r\n minimum = abs(cities[i] - cities[i + 1])\r\n flag = False\r\n else:\r\n minimum = abs(cities[0] - cities[len(cities) - 1])\r\n if i < len(cities) - 1 and abs(cities[i] - cities[i + 1]) < minimum:\r\n minimum = abs(cities[i] - cities[i + 1])\r\n if i > 0 and abs(cities[i] - cities[i - 1]) < minimum:\r\n minimum = abs(cities[i] - cities[i - 1])\r\n if abs(cities[i] - cities[0]) > maximum:\r\n maximum = abs(cities[i] - cities[0])\r\n if abs(cities[i] - cities[len(cities) - 1]) > maximum:\r\n maximum = abs(cities[i] - cities[len(cities) - 1])\r\n print(f'{minimum} {maximum}')", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nfor i in range(n-1):\r\n print(min(abs(l[i]-l[i-1]),abs(l[i]-l[i+1])),max(abs(l[i]-l[0]),abs(l[i]-l[-1])))\r\n\r\nprint(abs(l[-1]-l[-2]),abs(l[-1]-l[0]))", "def my_solution(lol):\r\n cities = [int(city) for city in input().split()]\r\n for i, city in enumerate(cities):\r\n if (i != 0 and i != len(cities) - 1):\r\n longest = max(abs(city - cities[0]), abs(city - cities[len(cities)-1]))\r\n shortest = min (abs(city - cities[i+1]), abs(city - cities[i-1]))\r\n print(abs(shortest), abs(longest))\r\n elif (i == 0):\r\n shortest = city - cities[1]\r\n longest = city - cities[len(cities)-1]\r\n print(abs(shortest), abs(longest))\r\n else:\r\n shortest = city - cities[len(cities)-2]\r\n longest = city - cities[0]\r\n print(abs(shortest), abs(longest))\r\n\r\n\r\n\r\nlol = int(input())\r\nmy_solution(lol)", "num=int(input())\r\na=list(map(int, input().split()))\r\n\r\nfor i in range(num):\r\n\tif i==0:\r\n\t\tprint(a[1]-a[0], a[num-1]-a[0])\r\n\telif i==num-1:\r\n\t\tprint(a[num-1]-a[num-2], a[num-1]-a[0])\r\n\telse:\r\n\t\t# m0=minimum; m1=maximum\r\n\r\n\t\t##Finding minimum from both sides of a[i] as the minimum price will be to send to adjacent cities \r\n\t\tif a[i]-a[i-1]>a[i+1]-a[i]:\r\n\t\t\tm0=a[i+1]-a[i]\r\n\t\telse:\r\n\t\t\tm0=a[i]-a[i-1]\r\n\t\t##Finding maximum from both sides of a[i] as the maximum price will be to send to edge cities \r\n\t\tif a[i]-a[0]>a[num-1]-a[i]:\r\n\t\t\tm1=a[i]-a[0]\r\n\t\telse:\r\n\t\t\tm1=a[num-1]-a[i]\r\n\t\tprint(m0, m1)", "a=int(input())\r\narr=[int(i) for i in input().split()]\r\nfor i in range(a):\r\n if(i==0):\r\n print(abs(arr[i]-arr[i+1]), abs(arr[-1]-arr[i]))\r\n elif(i==a-1):\r\n print(abs(arr[i]-arr[-2]), abs(arr[i]-arr[0]))\r\n else:\r\n print(abs(min(arr[i]-arr[i-1], arr[i+1]-arr[i])), abs(max(arr[i]-arr[0], arr[-1]-arr[i])))", "n = int(input())\r\nm = input().split()\r\n\r\nprint(str(int(m[1]) - int(m[0])) + \" \" + str(int(m[-1]) - int(m[0])))\r\n\r\nfor i in range(1, n - 1):\r\n\ta = int(m[i]) - int(m[i - 1])\r\n\tb = int(m[i + 1]) - int(m[i])\r\n\tminimum = min(a, b)\r\n\tc = int(m[i]) - int(m[0])\r\n\td = int(m[-1]) - int(m[i])\r\n\tmaximum = max(c, d)\r\n\tprint(str(minimum) + \" \" + str(maximum))\r\nprint(str(int(m[-1]) - int(m[-2])) + \" \" + str(int(m[-1]) - int(m[0])))", "n = int(input())\r\narr = input().split(' ')\r\nfor i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n\r\nfor i in range(len(arr)):\r\n #min\r\n #max\r\n if(i==0):\r\n minn = abs(arr[0]-arr[1])\r\n maxx = abs(arr[0]-arr[-1])\r\n elif(i==len(arr)-1):\r\n minn = abs(arr[-1]-arr[-2])\r\n maxx = abs(arr[-1]-arr[0])\r\n else:\r\n a = abs(arr[i]-arr[i+1])\r\n b = abs(arr[i]-arr[i-1])\r\n minn = min([a,b])\r\n a = abs(arr[i]-arr[0])\r\n b = abs(arr[i]-arr[-1])\r\n maxx = max([a,b])\r\n print(minn,end=' ')\r\n print(maxx)\r\n \r\n", "n = int(input())\r\nx = input()\r\nx = x.split()\r\na = []\r\nfor i in x:\r\n a.append(int(i))\r\na.sort()\r\nfor i in range(n):\r\n if i == 0:\r\n print(a[1]-a[0], end = \" \")\r\n print(a[n-1]-a[0])\r\n elif i == n-1:\r\n print(a[n-1]-a[n-2], end = \" \")\r\n print(a[n-1]-a[0])\r\n else:\r\n v = abs(a[i] - a[(i+1)%n])\r\n w = abs(a[i] - a[(i-1)%n])\r\n y = abs(a[i] - a[n-1])\r\n z = abs(a[i] - a[0])\r\n m = min(min(v,w),min(y,z))\r\n o = max(max(v,w),max(z,y))\r\n print(m, end = \" \")\r\n print(o)", "n = int(input())\r\ncoordinates = list(map(int,input().split()))\r\nfor i in range(n):\r\n if i!=0 and i!=n-1:\r\n minimum = min(abs(coordinates[i]-coordinates[i-1]),abs(coordinates[i]-coordinates[i+1]))\r\n maximum = max(abs(coordinates[i]-coordinates[n-1]),abs(coordinates[i]-coordinates[0]))\r\n elif i==0:\r\n minimum = abs(coordinates[i]-coordinates[i+1])\r\n maximum = abs(coordinates[i]-coordinates[-1])\r\n elif i==n-1:\r\n minimum = abs(coordinates[i]-coordinates[i-1])\r\n maximum = abs(coordinates[i]-coordinates[0])\r\n print(minimum,maximum,sep = \" \")", "n=int(input())\r\nx= [int(i) for i in input().split()]\r\nfor i in range(len(x)):\r\n if not i:\r\n minimum=abs(x[i]-x[i+1])\r\n maxi=abs(x[i]-x[len(x)-1])\r\n elif i==n-1:\r\n maxi=abs(x[i]-x[0])\r\n minimum=abs(x[i]-x[i-1])\r\n else:\r\n minimum=min(abs(x[i]-x[i+1]),abs(x[i]-x[i-1]))\r\n maxi=max(abs(x[i]-x[0]),abs(x[i]-x[len(x)-1]))\r\n print(minimum,end=\" \");print(maxi)", "n = int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n if i==0:\r\n print(a[i+1]-a[i],max(a)-a[i])\r\n elif i==n-1:\r\n print(a[i]-a[i-1],a[i]-a[0])\r\n else:\r\n min_distance=min(a[i]-a[i-1],a[i+1]-a[i])\r\n max_distance=max(a[i]-a[0],a[n-1]-a[i])\r\n print(min_distance,max_distance)\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n", "n = int(input())\r\nd = [int(x) for x in input().strip().split()]\r\n\r\nends = len(d)-1\r\n\r\nmin_d , max_d = 0 ,0\r\n\r\nfor idx,val in enumerate(d):\r\n \r\n max_d = max( val - d[0] , d[ends] - val)\r\n\r\n if (idx >0 and idx < ends):\r\n min_d = min(val - d[idx -1] , d[idx+1] - val)\r\n elif (idx == 0):\r\n min_d = d[idx+1] - val\r\n else:\r\n min_d = val - d[idx -1]\r\n \r\n print (min_d,max_d)", "n = int(input())\r\ncities = list( map(int, input().split()) )\r\n\r\nfor i in range(len(cities)):\r\n if i == 0:\r\n print(abs(cities[0]-cities[1]), abs(cities[0]-cities[-1]))\r\n elif i == len(cities)-1:\r\n print(abs(cities[-1]-cities[i-1]), abs(cities[0]-cities[-1]))\r\n else:\r\n mn = min( abs(cities[i]-cities[i-1]) , abs(cities[i]-cities[i+1]) )\r\n mx = max( abs(cities[i]-cities[0]), abs(cities[i]-cities[-1]) )\r\n print(mn, mx)\r\n \r\n", "n = int(input())\r\nc = list(map(int, input().split(\" \")))\r\nfor i in range(n):\r\n hi = lo = 0\r\n if i == 0:\r\n lo = abs(c[i] - c[1])\r\n hi = abs(c[i] - c[-1])\r\n elif i == n-1:\r\n lo = abs(c[i] - c[i-1])\r\n hi = abs(c[i] - c[0])\r\n else:\r\n lo = min(abs(c[i] - c[i-1]), abs(c[i] - c[i+1]))\r\n hi = max(abs(c[i] - c[0]), abs(c[i] - c[-1]))\r\n print(lo, hi)\r\n", "t = int(input())\r\n\r\nvalues = list(map(int,input().split()))\r\n\r\nprint(abs(values[1]-values[0]),abs( values[-1]-values[0]))\r\nfor i in range(1,t-1):\r\n a = min(abs(values[i]-values[i-1]),abs(values[i]-values[i+1]))\r\n b = max(abs(values[i]-values[0]),abs(values[i]-values[-1]))\r\n print(a,b)\r\nprint(abs(values[-1]-values[-2]),abs(values[-1]-values[0]))\r\n \r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nimport math\r\n\r\nfor i in range(n):\r\n maxi, mini = -math.inf, math.inf\r\n maxi=max(maxi,abs(lst[i]-lst[0]),abs(lst[i]-lst[-1]))\r\n if i==0:\r\n mini=min(mini,abs(lst[i]-lst[i+1]))\r\n elif i==n-1:\r\n mini=min(mini,abs(lst[i]-lst[i-1]))\r\n else:\r\n mini=min(mini,abs(lst[i]-lst[i-1]),abs(lst[i]-lst[i+1]))\r\n print(mini,maxi)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n ma = max(abs(x[0] - x[n-1]),abs(x[i] - x[n-1]))\r\n mi = abs(x[i] - x[i+1])\r\n print(mi,ma)\r\n elif i == n - 1:\r\n ma = abs(x[i] - x[0])\r\n mi = abs(x[i] - x[i-1])\r\n print(mi,ma)\r\n else:\r\n ma = max(abs(x[i] - x[0]),abs(x[i] - x[n-1]))\r\n mi = min(abs(x[i] - x[i - 1]),abs(x[i] - x[i + 1]))\r\n print(mi,ma)\r\n\r\n\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\n \r\nprint(x[1]-x[0], x[n-1]-x[0])\r\n \r\nfor i in range(1,n-1):\r\n print(min(x[i+1]-x[i], x[i]-x[i-1]), max(x[i]-x[0], x[n-1]-x[i]))\r\n \r\nif n > 1:\r\n print(x[n-1]-x[n-2], x[n-1]-x[0])", "num = int(input())\r\ncities = [int(i) for i in input().split()]\r\n\r\ndef length(x1,x2):\r\n return abs(x1 - x2)\r\n\r\nfor index, city in enumerate(cities):\r\n if index == 0:\r\n print(f\"{length(city, cities[1])} {length(city, cities[num-1])}\")\r\n elif index == num -1:\r\n print(f\"{length(city, cities[index - 1])} {length(city, cities[0])}\", end=\"\")\r\n else:\r\n minBetween = min(length(city, cities[index - 1]), length(city, cities[index + 1]))\r\n minEnd = max(length(city, cities[0]), length(city, cities[num - 1]))\r\n print(f\"{min(minBetween, minEnd)} {max(minBetween, minEnd)}\")", "# 3 12\r\n# 3 9\r\n# 4 7\r\n# 5 12\r\nfrom math import *\r\nn=int(input())\r\nl=[int(x) for x in input().split()]\r\n#print(l)\r\nfor i in range(len(l)):\r\n if i==0:\r\n print(abs(l[i]-l[i+1]),\"\",abs(l[i]-l[len(l)-1]))\r\n elif i==len(l)-1:\r\n print(abs(l[i]-l[i-1]),\"\",abs(l[i]-l[0]))\r\n else:\r\n print(min(abs(l[i]-l[i+1]),abs(l[i]-l[i-1])),\"\",max(abs(l[i]-l[0]),abs(l[i]-l[len(l)-1])))\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n if i==0:\r\n print(str(a[1]-a[0])+' '+str(a[n-1]-a[0]))\r\n elif i==n-1:\r\n print(str(a[n-1]-a[n-2])+' '+str(a[n-1]-a[0]))\r\n else:\r\n print(str(min(a[i+1]-a[i],a[i]-a[i-1]))+' '+str(max(a[n-1]-a[i],a[i]-a[0])))", "cities = int(input())\n\ncord = list(map(int, input().split(\" \")))\n\n\nminimun = -1\nmaximun = -1\nfor r in range(len(cord)):\n if(r ==0):\n minimun = cord[1] - cord[0]\n maximun = cord[-1]-cord[0]\n elif(r== len(cord)-1):\n minimun = cord[-1] - cord[-2]\n maximun = cord[-1]-cord[0]\n else:\n minimun = min(cord[r]-cord[r-1], cord[r+1]-cord[r])\n maximun = max(cord[r]-cord[0],cord[-1]-cord[r])\n \n print(str(minimun) + ' ' + str(maximun))\n \t \t\t \t\t\t \t\t \t\t\t\t", "n = int(input())\r\nx = list(map(int, input().split()))\r\nsol = []\r\n\r\nfor i in range(n):\r\n mx = max(abs(x[i]-x[0]), abs(x[-1]-x[i]))\r\n if i == 0:\r\n mn = abs(x[1]-x[0])\r\n elif i == n - 1:\r\n mn = abs(x[-1]-x[i-1])\r\n else:\r\n mn = min(abs(x[i]-x[i-1]), abs(x[i+1]-x[i]))\r\n sol.append([mn, mx])\r\n\r\nfor row in sol:\r\n print(*row)", "t=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nprint(a[1]-a[0],a[t-1]-a[0])\r\nfor i in range(1,t-1):\r\n print(min(a[i]-a[i-1],a[i+1]-a[i]),max(a[i]-a[0],a[t-1]-a[i]))\r\nprint(a[t-1]-a[t-2],a[t-1]-a[0])\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#****************************************/\r\nn=int(input());x=list(map(int,input().split()))\r\nfor i in range(n):t=x[i];print(min(abs(t-x[i-1]),abs(x[i-n+1]-t)),max(t-x[0],x[n-1]-t))\r\n\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())\r\ndic=list(map(int,input().split()))\r\nnum=0\r\nprint(f\"{abs(dic[0]-dic[1])} {abs(dic[0]-dic[-1])}\")\r\narr=[None]*4\r\nfor i in range(1,n-1):\r\n \r\n arr[0]=abs(dic[i]-dic[0])\r\n arr[1]=abs(dic[i]-dic[-1])\r\n arr[2]=abs(dic[i]-dic[i-1]) \r\n arr[3]=abs(dic[i]-dic[i+1]) \r\n \r\n arr.sort()\r\n\r\n print(f\"{arr[0]} {arr[3]}\" )\r\n\r\n \r\nprint(f\"{abs(dic[-1]-dic[-2])} {abs(dic[-1]-dic[0])}\")\r\n", "n = int(input())\ncities = [int(c) for c in input().split()]\n\ninitial = 0\nfinal = n - 1\n\nfor i in range(n):\n current = cities[i]\n max_value = max(abs(cities[initial] - current), abs(cities[final] - current))\n \n if i < final:\n min_value = abs(current - cities[i+1])\n if i > 0:\n min_value = min(abs(cities[i-1] - current), abs(cities[i+1] - current))\n else:\n min_value = abs(current - cities[i-1])\n \n print(min_value, max_value)\n\t \t\t \t\t \t\t \t \t\t \t\t\t", "n = int(input())\r\nnumbers = [int(val) for val in input().split()]\r\nfor i in range(n):\r\n if i == 0:\r\n diff_min = numbers[i+1]-numbers[i]\r\n diff_max = numbers[n-1]-numbers[i]\r\n elif i==n-1:\r\n diff_min = numbers[i]-numbers[i-1]\r\n diff_max = numbers[i]-numbers[0]\r\n else:\r\n diff_min = min(numbers[i]-numbers[i-1], numbers[i+1]-numbers[i])\r\n diff_max = max(numbers[i]-numbers[0], numbers[n-1]-numbers[i])\r\n print(diff_min, diff_max)", "n = int(input())\r\nx = [int(val) for val in input().split()]\r\n\r\nfor i in range(n):\r\n if i ==0: \r\n print(x[i+1]-x[i], x[n-1]-x[i])\r\n elif i==n-1:\r\n print(x[i]-x[i-1], x[i]-x[0])\r\n else:\r\n print(min(x[i+1]-x[i], x[i]-x[i-1]), max(x[i]-x[0], x[n-1]-x[i]))", "n = int(input())\r\nx = [int(j) for j in input().split(\" \")]\r\n\r\nresult = []\r\nindex = 0\r\nwhile index <= n-1:\r\n if index == 0:\r\n distance_min = x[index+1]-x[index]\r\n distance_max = x[n-1]-x[index]\r\n result.append(str(distance_min) + \" \" + str(distance_max))\r\n elif index == n-1:\r\n distance_min = x[index]-x[index-1]\r\n distance_max = x[index]-x[0]\r\n result.append(str(distance_min) + \" \" + str(distance_max))\r\n else:\r\n distance_min = min(x[index]-x[index-1], x[index+1]-x[index])\r\n distance_max = max(x[index]-x[0], x[n-1]-x[index])\r\n result.append(str(distance_min) + \" \" + str(distance_max))\r\n index += 1\r\n\r\nfor i in result:\r\n print(i)\r\n", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\narray = list(map(int, stdin.readline().strip().split()))\r\narray.sort()\r\nfor j in range(len(array)):\r\n if j==0:\r\n min_one = abs(array[j+1] - array[j]) \r\n else:\r\n if (j+1)<len(array):\r\n min_one = min(abs(array[j+1] - array[j]), abs(array[j-1] - array[j])) \r\n else:\r\n min_one = abs(array[j-1] - array[j]) \r\n max_one = max(abs(array[0] - array[j]), abs(array[-1] - array[j])) \r\n stdout.write(f\"{min_one} {max_one}\\n\")", "n = int(input())\r\nm = map(int,input().split())\r\nl=[]\r\nfor x in m : \r\n l.append(int(x))\r\nl.sort()\r\nres=''\r\nfor i in range(len(l)) : \r\n if l[i]!= l[0] and l[i]!= l[-1]: \r\n M = max(abs(l[i]-l[0]),abs(l[i]-l[-1]))\r\n m = min(abs(l[i]-l[i-1]),abs(l[i]-l[i+1]))\r\n ma=max(M,m)\r\n mi=min(M,m)\r\n res+=str(mi)+' '+str(ma)+'\\n'\r\n elif l[i]==l[0] : \r\n m = abs(l[i]-l[i+1])\r\n M = abs(l[i]-l[-1])\r\n res+=str(m)+' '+str(M)+'\\n'\r\n elif l[i]==l[-1] : \r\n m = abs(l[i]-l[i-1])\r\n M = abs(l[i]-l[0])\r\n res+=str(m)+' '+str(M)+'\\n'\r\nrse=res.strip('\\n')\r\nprint(res)", "n = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n if i == 0:\r\n print(x[1] - x[0], x[n - 1] - x[0])\r\n elif i == n - 1:\r\n print(x[n - 1] - x[n - 2], x[n - 1] - x[0])\r\n else:\r\n print(min(x[i + 1] - x[i], x[i] - x[i - 1]), max(x[n - 1] - x[i], x[i] - x[0]))", "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 = int(input())\r\n li = list(map(int, input().split()))\r\n print(li[1]-li[0], li[n-1] - li[0])\r\n for i in range(1, n-1):\r\n print(min(li[i+1]-li[i], li[i]-li[i-1]), end=' ')\r\n print(max(li[i] - li[0], li[n-1]-li[i]))\r\n print(li[n-1]-li[n-2], li[n-1] - li[0])\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", "n=int(input())\r\nx=list(map(int,input().split()))\r\nfor i in range(n):\r\n if(i==0):\r\n m1=x[i+1]-x[i]\r\n m2=x[-1]-x[i]\r\n elif(i==(n-1)):\r\n m1=x[i]-x[i-1]\r\n m2=x[i]-x[0]\r\n else:\r\n m1=min((x[i+1]-x[i]),(x[i]-x[i-1]))\r\n m2=max((x[-1]-x[i]),(x[i]-x[0]))\r\n print(m1,m2)", "# from math import *\r\n# from matplotlib import *\r\nn = input()\r\nl = [int(x) for x in input().split()]\r\n\r\nfor i in range(int(n)):\r\n if i == 0:\r\n print(str(abs(l[i]-l[i+1])) + \" \" + str(abs(l[i]-l[-1])))\r\n continue\r\n\r\n if i == (int(n)-1):\r\n print(str(abs(l[i]-l[i-1])) + \" \" + str(abs(l[i]-l[0])))\r\n continue\r\n\r\n print(\r\n str(\r\n min(\r\n abs(l[i] - l[i - 1]),\r\n abs(l[i] - l[i + 1])\r\n )\r\n )\r\n + \" \" +\r\n str(\r\n max(\r\n abs(l[i] - l[0]),\r\n abs(l[i] - l[-1])\r\n )\r\n )\r\n )", "import sys\r\nn=int(input())\r\ncits=list(map(int,input().split()))\r\nsol=[]\r\nfor i in range(n):\r\n mx=max(abs(cits[i]-cits[0]),abs(cits[i]-cits[-1]))\r\n if i==0:\r\n mn=abs(cits[i]-cits[i+1])\r\n elif i==n-1:\r\n mn=abs(cits[i]-cits[i-1])\r\n else:\r\n mn=min(abs(cits[i]-cits[i-1]),abs(cits[i]-cits[i+1]))\r\n sol.append([mn,mx])\r\n\r\nfor row in sol:\r\n print(*row)", "import math\r\n\r\nlength = int(input())\r\n\r\ndata = input().split(' ')\r\n\r\ndata = [int(item) for item in data]\r\n\r\nfor i in range(length):\r\n big, small = 0, 99999999999999\r\n if i == 0:\r\n small = abs(data[i + 1] - data[i])\r\n big = abs(data[length - 1] - data[i])\r\n elif i == length - 1:\r\n small = abs(data[length - 2] - data[i])\r\n big = abs(data[0] - data[i])\r\n else:\r\n small = min(abs(data[i + 1] - data[i]), abs(data[i - 1] - data[i]))\r\n big = max(abs(data[0] - data[i]), abs(data[length - 1] - data[i]))\r\n print(str(small) + ' ' + str(big))\r\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nfor i in range(n):\r\n if(i==0):\r\n print(abs(a[i+1]-a[i]),abs(a[-1]-a[i]))\r\n elif(i==n-1):\r\n print(abs(a[i]-a[i-1]),abs(a[i]-a[0]))\r\n else:\r\n print(min(a[i+1]-a[i],abs(a[i]-a[i-1])),max(abs(a[i]-a[0]),abs(a[-1]-a[i])))", "t = int(input())\r\nlst = list(map(int,input().split()))\r\n\r\n#this is for 0th\r\nif lst[0]>=0 and lst[1]>=0:\r\n m1 = lst[1]-lst[0]\r\nelif lst[0] < 0 and lst[1] >= 0:\r\n m1 = lst[1]+abs(lst[0])\r\nelif lst[0] < 0 and lst[1] < 0:\r\n m1 = abs(lst[0])-abs(lst[1])\r\n\r\nif lst[0]>=0 and lst[-1]>=0:\r\n m2 = lst[-1]-lst[0]\r\nelif lst[0] < 0 and lst[-1] >= 0:\r\n m2 = abs(lst[0])+lst[-1]\r\nelif lst[0] < 0 and lst[-1] < 0:\r\n m2 = abs(lst[0])-abs(lst[-1])\r\n\r\nprint(m1,m2)\r\n\r\n# this is for 1,len(lst)-2\r\nfor i in range(1,t-1):\r\n \r\n if lst[i]>=0 and lst[i-1]>=0:\r\n m1 = lst[i]-lst[i-1]\r\n elif lst[i] >=0 and lst[i-1] < 0:\r\n m1 = lst[i]+abs(lst[i-1])\r\n elif lst[i] < 0 and lst[i-1] < 0:\r\n m1 = abs(lst[i-1])-abs(lst[i])\r\n \r\n if lst[i]>=0 and lst[i+1]>=0:\r\n m2 = lst[i+1]-lst[i]\r\n elif lst[i] < 0 and lst[i+1] >= 0:\r\n m2 = abs(lst[i])+lst[i+1]\r\n elif lst[i] < 0 and lst[i+1] < 0:\r\n m2 = abs(lst[i])-abs(lst[i+1])\r\n \r\n if lst[i]>=0 and lst[0]>=0:\r\n mx1 = lst[i]-lst[0]\r\n elif lst[i] >=0 and lst[0] < 0:\r\n mx1 = lst[i]+abs(lst[0])\r\n elif lst[i] < 0 and lst[0] < 0:\r\n mx1 = abs(lst[0])-abs(lst[i])\r\n \r\n if lst[i]>=0 and lst[-1]>=0:\r\n mx2 = lst[-1]-lst[i]\r\n elif lst[i] < 0 and lst[-1] >= 0:\r\n mx2 = abs(lst[i])+lst[-1]\r\n elif lst[i] < 0 and lst[-1] < 0:\r\n mx2 = abs(lst[i])-abs(lst[-1])\r\n \r\n print(min(m1,m2),max(mx1,mx2))\r\n\r\n\r\n#this is for -1th \r\nif lst[-1]>=0 and lst[-2]>=0:\r\n m1 = lst[-1]-lst[-2]\r\nelif lst[-2] < 0 and lst[-1] >= 0:\r\n m1 = lst[-1]+abs(lst[-2])\r\nelif lst[-1] < 0 and lst[-2] < 0:\r\n m1 = abs(lst[-2])-abs(lst[-1])\r\n \r\nif lst[-1]>=0 and lst[0]>=0:\r\n m2 = lst[-1]-lst[0]\r\nelif lst[0] < 0 and lst[-1] >= 0:\r\n m2 = abs(lst[0])+lst[-1]\r\nelif lst[0] < 0 and lst[-1] < 0:\r\n m2 = abs(lst[0])-abs(lst[-1])\r\n\r\nprint(m1,m2)", "N = int(input())\nC = list(map(int, input().split()))\n\nfor i in range(len(C)):\n c = C[i]\n ma = max(abs(c-C[0]), abs(c-C[-1]))\n mi = min(abs(c-C[i-1] if i >= 0 else float(\"inf\")), abs(c-C[i+1] if i < len(C) - 1 else float(\"inf\")))\n print(mi, ma)\n", "k = int(input())\r\n\r\ns = input()\r\ns = s.split(' ')\r\n\r\nlst = []\r\nfor i in s:\r\n lst.append(int(i))\r\n\r\ni = 0\r\nwhile i< len(lst):\r\n if i == 0:\r\n print( abs(lst[i] - lst[i+1]), lst[-1] - lst[i])\r\n elif i==len(lst) - 1:\r\n print(lst[-1] - lst[-2], lst[-1] - lst[0])\r\n else:\r\n print ( min(abs (lst[i] - lst[i+1]), lst[i] - lst[i-1]), max(lst[-1] - lst[i], lst[i] - lst[0] ))\r\n i+=1", "n = int(input())\r\na = list(map(int, input().split()))\r\nprint(abs(a[0] - a[1]), abs(a[0] - a[-1]))\r\nfor i in range(1, n-1):\r\n print(min(abs(a[i] - a[i-1]), abs(a[i] - a[i+1])), max(abs(a[i] - a[-1]), abs(a[i] - a[0])))\r\nprint(abs(a[-1] - a[-2]), abs(a[-1] - a[0]))" ]

[ "# using the min-heap \r\nfrom heapq import heappush,heappop\r\nbowels,Time = map(int,input().split())\r\nmyLine = [-int(b) for b in input().split()]\r\ngulp = []; eat = 0\r\nfor i in range(1,min(bowels+1,Time)):\r\n while gulp and -gulp[0] >= Time - i:\r\n # remove the bowel with the highest time penalty \r\n heappop(gulp)\r\n # Check if the option is viable\r\n if -myLine[i-1] < Time:\r\n # Remove the step penalty and store the remaining \r\n heappush(gulp,myLine[i-1] + i)\r\n eat = max(len(gulp),eat)\r\nprint (eat)\r\n", "n, t = map(int,input().split())\r\nwait = list(map(int,input().split()))\r\nseg = []\r\nfor i in range(n):\r\n # to get the food in wait[i], wait __ seconds before running\r\n m = max(0, wait[i]-i-1)\r\n M = t-i-2\r\n if m > M: continue\r\n seg.append((m, -1))\r\n seg.append((M, 1))\r\nseg.sort()\r\n\r\nans = 0\r\ncur = 0\r\nfor t, q in seg:\r\n cur-= q\r\n ans = max(ans, cur)\r\nprint(ans)", "import heapq\r\nn, m = map(int, input().split())\r\narr, res, ans = [], 0, 0\r\nin_arr = [int(x) for x in input().split()]\r\nfor i in range(1, min(m, n + 1)):\r\n if in_arr[i-1] >= m:\r\n continue\r\n while arr and -arr[0] >= m - i:\r\n heapq.heappop(arr)\r\n res -= 1\r\n heapq.heappush(arr, -(in_arr[i-1] - i))\r\n res += 1\r\n ans = max(res, ans)\r\nprint(ans)", "n, T = map(int, input().split())\r\n\r\nts = list(map(int, input().split()))\r\n\r\nintervals = []\r\n\r\nfor i in range(n):\r\n start = max(0, ts[i] - i - 1)\r\n end = T - i - 2\r\n \r\n if start > end:\r\n continue\r\n \r\n intervals.append((start, -1))\r\n intervals.append((end, 1))\r\n\r\nintervals.sort()\r\n\r\nans = 0\r\ncurrent = 0\r\n\r\nfor _, val in intervals:\r\n current -= val\r\n ans = max(ans, current)\r\n\r\nprint(ans)", "from heapq import heappush, heappop\r\n\r\n# read input\r\nE = input().split(' ')\r\nN,T = [int(i) for i in E]\r\n\r\nE = input().split(' ')\r\nt = [int(i) for i in E]\r\n\r\n# priority queue\r\nqueue = []\r\n\r\n# move the dog to the position of the first bowl\r\nT -= 1\r\n\r\nsol = 0\r\nfor i in range(N):\r\n # if the dog arrives at the second T or later to a position, it cannot eat more\r\n if(T <= i):\r\n break\r\n\r\n # insert new bowl\r\n # a negative number is inserted, so that it orders from highest to lowest\r\n heappush(queue, -(t[i] - i))\r\n\r\n # check which bowls it can not longer eat\r\n while(len(queue) > 0 and -queue[0] > T - i): # queue[0] is top of queue\r\n heappop(queue)\r\n\r\n # update solution\r\n # len(queue) is the number of bowls it can eat ending at bowl i\r\n sol = max(sol,len(queue))\r\n \r\nprint(sol)" ]

[ "inp = str(input())\r\na = [0] * 3\r\nfor i in inp:\r\n\tif i == 'a':\r\n\t\ta[2] = max(a) + 1\r\n\t\ta[0] += 1\r\n\telse:\r\n\t\ta[1] = max(a[:2]) + 1\r\nprint(max(a))", "s = input()\r\nn = len(s)\r\na = s.count('a')\r\nb = s.count('b')\r\nans = max(n - a, n - b)\r\npref = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n pref[i] = int(s[i - 1] == 'b') + pref[i - 1]\r\nfor i in range(1, n + 1):\r\n for j in range(i, n + 1):\r\n cnt_a = j - i + 1 - (pref[j] - pref[i - 1])\r\n cnt_b_left = pref[i - 1]\r\n cnt_b_right = pref[n] - pref[j]\r\n ans = max(ans, n - cnt_a - cnt_b_left - cnt_b_right)\r\nprint(ans)", "s=input()\r\nn=len(s)\r\nw=[]\r\nfor j in range(3):\r\n w.append([0 for k in range(n+1)])\r\nfor j in range(1, n+1):\r\n w[0][j]=w[0][j-1]+int(s[j-1]==\"a\")\r\n w[1][j]=max(w[1][j-1]+int(s[j-1]==\"b\"), w[0][j-1]+int(s[j-1]==\"b\"))\r\n w[2][j]=max(w[2][j-1]+int(s[j-1]==\"a\"), w[1][j-1]+int(s[j-1]==\"a\"))\r\nprint(max([w[0][-1], w[1][-1], w[2][-1]]))", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\ns = input()\r\nn = len(s)\r\naPrefix = [0] * (n + 1)\r\nfor i in range(n) :\r\n aPrefix[i + 1] = aPrefix[i] + (1 if s[i] == 'a' else 0)\r\nmaxLength = 0\r\nfor i in range(n + 1) :\r\n aFirst = aPrefix[i]\r\n for j in range(i, n + 1) :\r\n b = (j - i) - (aPrefix[j] - aPrefix[i])\r\n a = aPrefix[n] - aPrefix[j]\r\n maxLength = max(maxLength, aFirst + a + b)\r\nprint(maxLength)\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "s = input()\r\n\r\nfreq_a = [0]\r\nfreq_b = [0]\r\nb_occurences = []\r\n\r\nfor i in range(len(s)):\r\n if s[i] == 'b': b_occurences.append(i)\r\n freq_b.append(freq_b[i] + int(s[i] == 'b'))\r\n freq_a.append(freq_a[i] + int(s[i] == 'a'))\r\n\r\nif len(b_occurences) < 2:\r\n print(len(s))\r\nelse:\r\n ans = 5001\r\n\r\n for i in range(len(b_occurences)):\r\n for j in range(i, len(b_occurences)):\r\n ans = min(ans, freq_a[b_occurences[j] + 1] - freq_a[b_occurences[i]] + freq_b[-1] - (freq_b[b_occurences[j] + 1] - freq_b[b_occurences[i]]))\r\n \r\n print(len(s) - ans)", "\r\nmax1=0\r\nstring=input()\r\nfirst=0\r\nsecond=0\r\nthird=0\r\ni=0\r\nlength=len(string)\r\n\r\nwhile(i<length):\r\n if string[i]=='a':\r\n if second>third:\r\n third=second+1 \r\n else:\r\n third+=1\r\n first+=1 \r\n \r\n if string[i]=='b':\r\n if first>second:\r\n second=first+1\r\n \r\n else: \r\n second+=1 \r\n i+=1\r\nprint(max(third,first,second)) ", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n\ndef cal(l,r,c1,c2):\n global S\n R,L = defaultdict(int),defaultdict(int)\n for i in range(l+1,r):R[S[i]]+=1\n L[S[l]]+=1\n ans = L[c1]+R[c2]\n for i in range(l+1,r-1):\n L[S[i]]+=1\n R[S[i]]-=1\n ans = max(ans,L[c1]+R[c2])\n return ans\n\nS = input()\nN = len(S)\nans = max(S.count(\"a\"),S.count(\"b\"),cal(0,N,\"a\",\"b\"),cal(0,N,\"b\",\"a\"))\ndic = defaultdict(int)\nfor i in range(N-2):\n dic[S[i]]+=1\n ans = max(ans,dic[\"a\"]+cal(i+1,N,\"b\",\"a\"))\nprint(ans)\n", "f,s,t = 0,0,0\r\nn = input()\r\nfor i in n:\r\n if i == 'a':\r\n t = max(t,f,s) +1\r\n f+=1\r\n else:\r\n s = max(f,s) + 1\r\nprint(max(f,s,t))", "s=input()\r\ndp=[[0,0,0] for i in range(len(s))]\r\nfor i in range(len(s)):\r\n if s[i]=='a':\r\n dp[i][0]=dp[i-1][0]+1\r\n dp[i][1]=dp[i-1][1]\r\n dp[i][2]=max(dp[i-1][1]+1,dp[i-1][2]+1)\r\n else:\r\n dp[i][0]=dp[i-1][0]\r\n dp[i][1]=max(dp[i-1][0]+1,dp[i-1][1]+1)\r\n dp[i][2]=dp[i-1][2]\r\ne=len(s)-1\r\nprint(max(dp[e][0],dp[e][1],dp[e][2]))\r\n", "s = input()\r\ncnt = [0, 0, 0]\r\nfor ch in s:\r\n if ch == 'a':\r\n cnt[2] = max(cnt) + 1\r\n cnt[0] += 1\r\n else:\r\n cnt[1] = max(cnt[0], cnt[1]) + 1\r\nprint(max(cnt))\r\n", "string = input()\r\n\r\na_pref = []\r\ncurrent_a = 0\r\nfor ch in string:\r\n if ch == \"a\":\r\n current_a += 1\r\n a_pref += [current_a]\r\n\r\ndef fa(s):\r\n if len(s) == 0:\r\n return 0\r\n if len(s) == 1:\r\n return 1 if s == \"a\" else 0\r\n if s[-1] == \"a\":\r\n return fa(s[:-1]) + 1\r\n else:\r\n return fa(s[:-1])\r\n \r\ndef fb(s):\r\n if len(s) == 0:\r\n return 0\r\n if len(s) == 1:\r\n return 1 if s == \"b\" else 0\r\n sl_a = 1 if s[-1] == \"a\" else 0\r\n sl_b = 1 if s[-1] == \"b\" else 0\r\n return max(fa(s[:-1]) + sl_a, fb(s[:-1]) + sl_b)\r\n\r\naas = []\r\nbbs = []\r\nfor i in range(len(string)):\r\n sl_a = 1 if string[i] == \"a\" else 0\r\n sl_b = 1 if string[i] == \"b\" else 0\r\n \r\n a_pred = 0 if len(aas) == 0 else aas[-1]\r\n b_pred = 0 if len(bbs) == 0 else bbs[-1]\r\n \r\n aas += [a_pred + sl_a]\r\n bbs += [max(a_pred + sl_a, b_pred + sl_b)]\r\n\r\nanswer = 0\r\na_count = string.count(\"a\")\r\nfor i in range(len(string)):\r\n current_answer = bbs[i] + a_count - a_pref[i]\r\n \r\n if current_answer > answer:\r\n answer = current_answer\r\nprint(answer)", "s=input()\r\n\r\nans=[]\r\nab=[0]\r\nbb=[0]\r\nfor i in range(len(s)):\r\n if(s[i]=='a'):\r\n \r\n ab.append(ab[-1]+1)\r\n bb.append(bb[-1])\r\n \r\n if(s[i]=='b'):\r\n \r\n bb.append(bb[-1]+1)\r\n ab.append(ab[-1])\r\nmaxa=0\r\nl=0\r\nr=0\r\nfor l in range(len(ab)):\r\n for r in range(l,len(ab)):\r\n \r\n maxa=max(ab[l]+(ab[-1]-ab[r])+(bb[r]-bb[l]),maxa)\r\nprint(maxa)\r\n \r\n \r\n \r\n", "s=input()\r\np=[0]*3\r\nfor i in range(len(s)):\r\n if s[i]=='a':\r\n p[0]+=1\r\n p[2]=max(p[1],p[2])+1\r\n else:\r\n p[1]=max(p[0],p[1])+1\r\nprint(max(p))\r\n", "import sys \r\ninput = sys.stdin.readline\r\n\r\n\r\ns = input()\r\nn = len(s)\r\npa, pb = [0] * (n + 1), [0] * (n + 1) \r\nfor i in range(1, n + 1):\r\n pa[i] = pa[i - 1] + 1 if s[i - 1] == 'a' else pa[i - 1]\r\n pb[i] = pb[i - 1] + 1 if s[i - 1] == 'b' else pb[i - 1] \r\n# print(pa, pb)\r\nans = 0 \r\nfor i in range(n + 1):\r\n for j in range(i, n + 1):\r\n c = (pa[i]) + (pb[j] - pb[i]) + (pa[n] - pa[j])\r\n ans = max(ans, c) \r\nprint(ans)", "line = input()\r\n\r\ndp = 3 * [0]\r\n\r\nfor c in line:\r\n if c == 'a':\r\n dp[2] = max(dp) + 1\r\n dp[0] += 1\r\n elif c == 'b':\r\n dp[1] = max(dp[:2]) + 1\r\n\r\nprint(max(dp))\r\n", "s = [i for i in input()]\r\nn = len(s)\r\n\r\nif \"b\" not in s:\r\n print(n)\r\nelse:\r\n a = [0]*n\r\n b = [0]*n\r\n act = s.count(\"a\")\r\n \r\n if s[0] == \"a\":\r\n a[0] += 1\r\n else:\r\n b[0] += 1\r\n \r\n for i in range(1, n):\r\n a[i] = a[i-1]\r\n b[i] = b[i-1]\r\n \r\n if s[i] == \"a\":\r\n a[i] += 1\r\n else:\r\n b[i] += 1\r\n \r\n ct = 0\r\n for i in range(n):\r\n if s[i] == \"b\":\r\n tct = a[i]\r\n \r\n for j in range(i, n):\r\n if s[j] == \"b\":\r\n tct = max(tct, a[i]+(1+b[j]-b[i])+(act-a[j]))\r\n\r\n ct = max(ct, tct)\r\n \r\n print(ct)", "s=input()\r\nch=[]\r\nct=[]\r\ni=0\r\nn=len(s)\r\nwhile i<n:\r\n t=s[i]\r\n ch.append(t)\r\n c=0\r\n while s[i]==t:\r\n c=c+1\r\n i=i+1\r\n if i==n:\r\n break\r\n ct.append(c)\r\na,b=[0]*len(ct),[0]*(len(ct))\r\nfor i in range(len(ct)):\r\n if ch[i]=='a':\r\n a[i]=a[i-1]+ct[i]\r\n b[i]=b[i-1]\r\n if ch[i]=='b':\r\n b[i]=b[i-1]+ct[i]\r\n a[i]=a[i-1]\r\nans=0\r\nif len(ct)>1:\r\n for i in range(len(ct)):\r\n if ch[i]=='b':\r\n x,y,z=a[i],ct[i],0\r\n for j in range(i+1,len(ct)):\r\n if ch[j]=='b':\r\n z=z+ct[j]\r\n ans=max(ans,x+y+z)\r\n elif ch[j]=='a':\r\n ans=max(ans,x+y+z+a[-1]-a[j-1])\r\n if ch[i]=='a':\r\n y,z=ct[i],0\r\n for j in range(i+1,len(ct)):\r\n if ch[j]=='a':\r\n z=z+ct[j]\r\n ans=max(ans,y+z)\r\n elif ch[j]=='b':\r\n ans=max(ans,y+z+b[-1]-b[j-1])\r\n \r\nelse:\r\n ans=ct[0]\r\nprint(ans)", "s=str(input())\r\n\r\na=[ord(i)-ord(\"a\") for i in s]\r\n\r\nn=len(a)\r\nif n==1 or n==2:\r\n\tprint(n)\r\n\texit()\r\nc=[0 for i in range(n+1)]\r\n\r\nfor i in range(n):\r\n\tc[i]=c[i-1]+a[i]\r\n\r\nans=0\r\nfor i in range(n):\r\n\tfor j in range(i,n):\r\n\t\tan=n-(c[i-1]+c[n-1]-c[j]+(j-i+1)-c[j]+c[i-1])\r\n\t\tans=max(ans,an)\r\n\r\nans=max(ans,n-c[n-1])\r\nprint(ans)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/30 11:20\r\n\r\n\"\"\"\r\n\r\n\r\nS = input()\r\nN = len(S)\r\n\r\ndp = [[0 for _ in range(5)] for _ in range((N+1))]\r\n\r\nfor i in range(1, N+1):\r\n a = 1 if S[i-1] == 'a' else 0\r\n b = 1 - a\r\n dp[i][0] = dp[i-1][0] + a\r\n dp[i][1] = dp[i-1][1] + b\r\n dp[i][2] = max(dp[i-1][2], dp[i-1][0]) + b\r\n dp[i][3] = max(dp[i-1][1], dp[i-1][3]) + a\r\n dp[i][4] = max(dp[i-1][4], dp[i-1][2]) + a\r\n\r\nprint(max(dp[N]))", "# 2022-07-17T15:10:54Z\ndef proc(s):\n n = len(s)\n ac = [0] * (n + 1)\n bc = [0] * (n + 1)\n\n for i, e in enumerate(s):\n ac[i + 1] = ac[i]\n bc[i + 1] = bc[i]\n if e == 'a':\n ac[i + 1] += 1\n else:\n bc[i + 1] += 1\n\n res = max(ac[-1], bc[-1])\n\n for i in range(1, n + 1):\n res = max(res, bc[i] + ac[-1] - ac[i])\n\n for i in range(1, n):\n for j in range(i + 1, n + 1):\n res = max(res, ac[i] + bc[j] - bc[i] + ac[-1] - ac[j])\n return res\n\n\ns = input()\nprint(proc(s))\n", "s = input()\r\nn = len(s)\r\nar = [0] * (n+1)\r\nfor i in range(1,n+1):\r\n ar[i] = ar[i-1] + int(s[i-1] == \"a\")\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n ans = max(ans, ar[i] + ar[-1] - ar[j] + j - i + 1 - ar[j+1] + ar[i])\r\nprint(ans)\r\n", "'''\r\n Nikita and string\r\n Source: http://codeforces.com/problemset/problem/877/B\r\n'''\r\n\r\ndef solve(string):\r\n dp = [[],[],[],0]\r\n index = 0\r\n for i in range(0,len(string)):\r\n if string[i] == 'a':\r\n dp[0].append('a')\r\n dp[2].append('a')\r\n if dp[3] == 1:\r\n dp[3] = 2\r\n if len(dp[1]) >= 1 and dp[1][-1] != 'b':\r\n dp[1].append('a')\r\n else:\r\n dp[1].append('b')\r\n if dp[3] != 2:\r\n dp[2].append('b')\r\n dp[3] = 1\r\n if len(dp[0]) > len(dp[1]):\r\n dp[1] = list(dp[0])\r\n if len(dp[0]) > len(dp[2]):\r\n dp[2] = list(dp[0])\r\n dp[3] = 0\r\n if len(dp[1]) > len(dp[2]):\r\n dp[2] = list(dp[1])\r\n dp[3] = 1\r\n \r\n #print(dp)\r\n print(len(dp[2]))\r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n string = input().strip()\r\n solve(string)\r\n", "s = input()\r\nkola,klasta,klastb=0,0,0\r\nfor i,x in enumerate(s):\r\n if x=='a':\r\n kola+=1\r\n klasta=max(klasta,klastb)+1\r\n else:klastb=max(kola,klastb)+1\r\nprint(max(klasta,klastb))", "s=input()\r\nn=len(s)\r\na,b,aba=0,0,0\r\nfor i in range(n):\r\n if s[i]=='a':\r\n aba=max(a,b,aba)+1\r\n a+=1\r\n else:\r\n b=max(a,b)+1\r\nprint(max(a,b,aba))\r\n", "s = input()\r\nans = [0,0,0]\r\nfor i in s:\r\n if i == \"a\":\r\n ans[2] = max(ans)+1\r\n ans[0]+=1\r\n else:\r\n ans[1] = max(ans[:2])+1\r\nprint(max(ans))", "s=input()\r\nx1=0\r\nx2=0\r\nx3=0\r\nfor i in range (len(s)):\r\n if s[i]=='a':\r\n x3=max(x2, x3)+1\r\n x1+=1\r\n else:\r\n x2=max(x1, x2)+1\r\nx4=max(x1, x2)\r\nx5=max(x3, x4)\r\nprint(x5)", "s='cc'+input()+'cc'\r\nans=0 \r\ntotala=s.count('a')\r\ntotalb=s.count('b')\r\n\r\nfor i in range(len(s)):\r\n \r\n teampa=0\r\n teampb=0\r\n for j in range(i+1,len(s)):\r\n if s[j]=='b':\r\n teampb+=1 \r\n if s[j]=='a':\r\n teampa+=1 \r\n \r\n ans=max(ans,teampb+totala-teampa)\r\nprint(ans)", "def nikita(s):\r\n a, b, result = 0, 0, 0\r\n for elem in s:\r\n if elem == 'a':\r\n a += 1\r\n result += 1\r\n else:\r\n b = max(a, b) + 1\r\n result = max(result, b)\r\n return result\r\n\r\n\r\nprint(nikita(input()))\r\n", "s = input()\r\n\r\na = [0, 0, 0]\r\n\r\nfor i in s : \r\n\tif i == 'a' :\r\n\t\ta[2] = max(a) + 1\r\n\t\ta[0] = a[0] + 1\r\n\telse :\r\n\t\ta[1] = max(a[0], a[1]) + 1\r\n\r\nprint(max(a))", "s = input()\r\nn = len(s)\r\na = [0] * (n + 1)\r\nb = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n a[i] = a[i - 1]\r\n b[i] = b[i - 1]\r\n if s[i - 1] == 'a':\r\n a[i] += 1\r\n else:\r\n b[i] += 1\r\nans = 0\r\nfor i in range(n + 1):\r\n for j in range(i, n + 1):\r\n ans = max(ans, a[i] + b[j] - b[i] + a[n] - a[j])\r\nprint(ans)", "s=input()\r\nn=len(s)\r\nca=[0]*(n+1)\r\ncb=[0]*(n+1)\r\nfor i in range(n):\r\n if s[i]==\"a\":\r\n ca[i+1]+=1\r\n else:\r\n cb[i+1]+=1\r\nfor i in range(n):\r\n ca[i+1]+=ca[i]\r\n cb[i+1]+=cb[i]\r\nans=min(ca[-1],cb[-1])\r\nfor l in range(1,n+1):\r\n ans=min(ans,ca[l]+(cb[-1]-cb[l]))\r\n ans=min(ans,cb[l]+(ca[-1]-ca[l]))\r\n for r in range(l,n+1):\r\n ans=min(ans,cb[l]+(ca[r]-ca[l])+(cb[-1]-cb[r]))\r\nprint(n-ans)", "s = input()\r\n\r\ndp = [0] * 3\r\n\r\nfor c in s:\r\n if c == 'a':\r\n dp[2] = max(dp) + 1\r\n dp[0] += 1\r\n else:\r\n dp[1] = max(dp[0], dp[1]) + 1\r\n\r\nprint(max(dp))", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\n# from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\") \r\n\r\ns = \"*\"+g()\r\nn = len(s)-1\r\na, b = [0]*(n+2), [0]*(n+2)\r\na_, b_ = [0]*(n+2), [0]*(n+2)\r\nfor i in range(1, n+1):\r\n\t(a if s[i] == \"a\" else b)[i] += 1\r\n\ta[i] += a[i-1]\r\n\tb[i] += b[i-1]\r\n\r\nfor i in reversed(range(1, n+1)):\r\n\t(a_ if s[i] == \"a\" else b_)[i] += 1\r\n\ta_[i] += a_[i+1]\r\n\tb_[i] += b_[i+1]\r\n\r\nans = max(a[-1], b[-1])\r\n\r\n\r\nfor i in range(1, n+1):\r\n\tans = max(ans, a[i]+b_[i+1], b[i]+a_[i+1])\r\n\r\nfor l in range(2, n-1):\r\n\tfor r in range(l, n):\r\n\t\tans_ = a_[r+1]+a[l-1] + b[r] - b[l-1]\r\n\t\tans = max(ans, ans_)\r\n\r\nprint(ans)", "\r\nbCount = [0]\r\naCount = [0]\r\nst = list(input())\r\n\r\nfor i in st:\r\n if i == \"a\":\r\n aCount.append(aCount[-1] + 1)\r\n bCount.append(bCount[-1])\r\n else:\r\n bCount.append(bCount[-1] + 1)\r\n aCount.append(aCount[-1])\r\n\r\nmaxCount = -1\r\nfor i in range(0, len(aCount)):\r\n for j in range(i, len(aCount)):\r\n asCountOne = aCount[i]\r\n bsCount = bCount[j] - bCount[i]\r\n asCountTwo = aCount[-1] - aCount[j]\r\n maxCount = max(maxCount, (asCountOne + bsCount + asCountTwo))\r\n\r\nprint(maxCount)", "s = ' '+input()\r\ndp = [[0,0,0]for i in range(len(s)+5)]\r\ni = 0\r\nwhile i<len(s)-1:\r\n i += 1\r\n if s[i]=='a':\r\n dp[i][0] = dp[i-1][0] + 1\r\n dp[i][1] = dp[i-1][1]\r\n dp[i][2] = max(dp[i-1][0],dp[i-1][1],dp[i-1][2])+1\r\n if s[i]=='b':\r\n dp[i][0] = dp[i - 1][0]\r\n dp[i][1] = max(dp[i - 1][0],dp[i-1][1]) + 1\r\n dp[i][2] = max(dp[i - 1][0], dp[i - 1][2])\r\n\r\nprint(max(dp[i][0],dp[i][1],dp[i][2]))", "ans = [0, 0, 0]\r\ns = input()\r\nfor i in s:\r\n if i == 'a':\r\n ans[2] = max(ans) + 1\r\n ans[0] += 1;\r\n else:\r\n ans[1] = max(ans[0], ans[1]) + 1\r\nprint(max(ans))", "x=str(input())\r\ndp,ans,len=[0]*5002,0,len(x)\r\nfor i in range (len):\r\n if x[i]==\"a\":\r\n if i==0:\r\n dp[i]=1\r\n else:\r\n dp[i]=dp[i-1]+1\r\n elif i>0:\r\n dp[i]=dp[i-1]\r\nfor i in range (len):\r\n for i2 in range(i,len):\r\n if (dp[i]+dp[len-1]-dp[i2]+i2-i-(dp[i2]-dp[i])>ans):\r\n ans=dp[i]+dp[len-1]-dp[i2]+i2-i-(dp[i2]-dp[i])\r\nfor i in range (len):\r\n if (i-dp[i]+dp[len-1]+1-dp[i] > ans):\r\n ans=i-dp[i]+dp[len-1]-dp[i]+1\r\nif(len-dp[len-1]>ans):\r\n ans=len-dp[len-1]\r\nprint(ans)", "from itertools import accumulate\r\nfrom sys import stdout\r\n\r\nR = lambda: map(int, input().split())\r\ns = input()\r\nn = len(s)\r\nac, bc = list(accumulate(int(c == 'a') for c in s)) + [0] * 5, list(accumulate(int(c == 'b') for c in s)) + [0] * 5\r\nres = 0\r\nfor i in range(n + 1):\r\n for j in range(i, n + 1):\r\n r1 = bc[i - 1]\r\n r2 = ac[j - 1] - ac[i - 1]\r\n r3 = bc[n - 1] - bc[j - 1]\r\n res = max(res, n - r1 - r2 - r3)\r\nprint(res)", "import re\r\n\r\n\r\ndef make_precomputed(string):\r\n string = '^' + string\r\n n = len(string)\r\n prefix_a = [0] * 5005\r\n prefix_b = [0] * 5005\r\n\r\n for i in range(1, n):\r\n if string[i] == 'a':\r\n prefix_a[i] += 1\r\n continue\r\n prefix_b[i] += 1\r\n\r\n for i in range(1, n + 1):\r\n prefix_a[i] += prefix_a[i - 1]\r\n prefix_b[i] += prefix_b[i - 1]\r\n\r\n answer = 0\r\n for i in range(n+1):\r\n for j in range(i, n+1):\r\n a = prefix_a[n] - prefix_a[j] + prefix_a[i]\r\n b = prefix_b[j] - prefix_b[i]\r\n answer = max(a + b, answer)\r\n\r\n return answer\r\n\r\n\r\ndef solve():\r\n is_beatiful = \"^a+b+a+$|^b+a+$|^a+b+$\"\r\n string = input()\r\n\r\n if re.match(is_beatiful, string):\r\n return len(string)\r\n\r\n return make_precomputed(string)\r\n\r\n\r\nprint(solve())\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\ncnt = [0]\r\nfor i in s:\r\n cnt.append(cnt[-1] + (i & 1))\r\nn = len(s)\r\nans = 0\r\nfor i in range(n + 1):\r\n for j in range(i, n + 1):\r\n u = cnt[i] + cnt[n] - cnt[j]\r\n v = (j - i) - (cnt[j] - cnt[i])\r\n ans = max(ans, u + v)\r\nprint(ans)", "s = input()\r\n\r\na1, b, a2 = 0, 0, 0\r\n\r\nfor c in s:\r\n if c == 'a':\r\n a1, a2 = a1 + 1, max(a2, b) + 1\r\n else:\r\n b = max(a1, b) + 1\r\n\r\n\r\nprint(max(a1, a2, b))\r\n", "read = lambda: map(int, input().split())\n\nN = 50005\na = [0 for i in range(N)]\nb = [0 for i in range(N)]\n\nc = input()\nl = len(c)\nfor i in range(l):\n a[i+1] = a[i ]\n b[i+1] = b[i]\n if c[i] == 'a':\n a[i+1] += 1\n else:\n b[i+1] += 1\n\nans = 0\nfor i in range(l + 1):\n for j in range(i, l + 1):\n ans = max(ans, a[i] + b[j] - b[i] + a[l] - a[j])\nprint(ans)\n", "s = input()\r\nn = len(s)\r\ns = 'a' + s\r\nd = [[0 for _ in range(3)] for _ in range(n+1)]\r\nfor i in range(1,n+1):\r\n \r\n d[i][0] = d[i-1][0] + (s[i] != 'a')\r\n d[i][1] = min(d[i-1][0],d[i-1][1]) + (s[i] != 'b')\r\n d[i][2] = min(d[i-1][1],d[i-1][2]) + (s[i] != 'a')\r\n \r\nprint(n - min(d[n][0],d[n][1],d[n][2]))", "s = input()\r\nn = len(s)\r\ndp = [[0] * (n + 1) for _ in range(3)]\r\nfor i in range(n):\r\n dp[0][i + 1] = dp[0][i] + (1 if s[i] == 'b' else 0)\r\n dp[1][i + 1] = min(dp[0][i], dp[1][i]) + (1 if s[i] == 'a' else 0)\r\n dp[2][i + 1] = min(dp[1][i], dp[2][i]) + (1 if s[i] == 'b' else 0)\r\nprint(n - min(dp[0][n], dp[1][n], dp[2][n]))", "s = list(input())\r\nn = len(s)\r\nlis=[[0,0] for i in range(n+2)]\r\nfor i in range(n):\r\n if s[i]=='a':\r\n lis[i+1][0]=lis[i][0]+1\r\n lis[i+1][1]=lis[i][1]\r\n else:\r\n lis[i+1][0]=lis[i][0]\r\n lis[i+1][1]=lis[i][1]+1\r\n#print(lis)\r\nans=0 \r\nfor i in range(1,n+1):\r\n for j in range(i,n+2):\r\n tmp=0\r\n tmp+=(lis[j-1][1]-lis[i-1][1])\r\n tmp+=(lis[i-1][0])\r\n tmp+=(lis[n][0]-lis[j-1][0])\r\n# print(tmp,i,j) \r\n ans=max(ans,tmp)\r\nprint(ans)\r\n\r\n", "s=input()\r\nn=len(s)\r\ndp=[[0,0,0] for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n\tdp[i][0]=dp[i-1][0]+(1 if s[i-1]=='a' else 0) # max len for string ending as ...a\r\n\tdp[i][1]=max(dp[i-1][0],dp[i-1][1])+(1 if s[i-1]=='b' else 0) # max len for string ending as ...a....b\r\n\tdp[i][2]=max(dp[i-1][1],dp[i-1][2])+(1 if s[i-1]=='a' else 0) # max len for string ending as ....a...b....a\r\nprint(max(dp[-1]))", "\r\ns=input()\r\nf=[0,0,0]\r\nfor x in s:\r\n if x=='a':\r\n f[2]=max(f)+1\r\n f[0]+=1\r\n else:\r\n f[1]=max(f[0],f[1])+1\r\nprint(max(f)) \r\n", "s = input()\r\n \r\ndp = [0,0,0]\r\n \r\nfor i in s:\r\n\tif i == \"a\":\r\n\t\tdp[2] = max(dp)+1\r\n\t\tdp[0] +=1\r\n\telse:\r\n\t\tdp[1] = max(dp[0],dp[1])+1\r\n \r\nprint(max(dp))\r\n", "a=input()\r\nn=len(a)\r\nprefix_a=[0 for _ in range(0,n+2)]\r\nprefix_b=[0 for _ in range(0,n+2)]\r\nfor i in range(n):\r\n\r\n prefix_a[i+1]=prefix_a[i]+(a[i]=='a')\r\n prefix_b[i + 1] = prefix_b[i] + (a[i] == 'b')\r\nprefix_b[n+1]=prefix_b[n]\r\nprefix_a[n+1]=prefix_a[n]\r\nminimum=1e10\r\nfor i in range(0,n+1):\r\n for j in range(i+1,n+2):\r\n minimum=min(minimum,prefix_b[i]+ prefix_a[j]-prefix_a[i]+ prefix_b[-1]-prefix_b[j])\r\n\r\nprint(n-minimum)\r\n", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nasum = [0 for i in range(n+1)]\r\nfor i in range(n):\r\n asum[i+1] = asum[i]+1 if s[i] == 'a' else asum[i]\r\n\r\nrmin = 2**31\r\nfor i in range(n+1):\r\n for j in range(i, n+1):\r\n c1 = asum[i]\r\n c2 = asum[j]-asum[i]\r\n c3 = asum[n]-asum[j]\r\n r = i-c1\r\n r += c2\r\n r += n-j-c3\r\n rmin = min(rmin, r)\r\nres = n-rmin\r\nprint(res)\r\n\r\n", "s = input()\r\nn = len(s)\r\n\r\ndp = [[10 ** 9 for j in range(4)] for i in range(n + 1)]\r\ndp[0][0] = 0\r\n\r\nfor i in range(n + 1):\r\n\tfor j in range(3):\r\n\t\tif i < n:\r\n\t\t\tadd = 0\r\n\t\t\tif (s[i] == 'a' and j == 1) or (s[i] == 'b' and j != 1):\r\n\t\t\t\tadd += 1\r\n\t\t\tdp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + add)\t\r\n\t\tdp[i][j + 1] = min(dp[i][j + 1], dp[i][j])\r\n\r\nprint(n - dp[n][3])", "import sys\n\nif __name__ == '__main__':\n word = sys.stdin.readline()\n word = word.replace('\\n', '')\n N = len(word)\n ABA = [0]*(N+1)\n BA = [0]*(N+1)\n A = [0]*(N+1)\n A[N] = 0\n BA[N] = 0\n ABA[N] = 0\n for i in range(N-1, -1, -1):\n if word[i] == 'a':\n A[i] = A[i+1]\n ABA[i] = ABA[i+1]\n BA[i] = min(1 + BA[i+1], A[i+1])\n else:\n A[i] = A[i+1] + 1\n ABA[i] = min(BA[i+1], 1 + ABA[i+1])\n BA[i] = BA[i+1]\n print(N - ABA[0])\n\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 25 09:07:32 2017\r\n\r\n@author: savit\r\n\"\"\"\r\n\r\ns=input()\r\nstartpos=0\r\nmax1=0\r\ntemp=0\r\nbeststart=[]\r\nfor i in range(len(s)):\r\n if(s[i]=='a'):\r\n \r\n temp+=1\r\n if(temp>max1):\r\n max1=temp\r\n startpos=i+1\r\n else:\r\n temp-=1\r\n beststart.append((max1,startpos))\r\n \r\nbeststart.append((0,-1))\r\nmax2=0\r\ntemp=0\r\nendpos=len(s)\r\nfor i in range(len(s)-1,-1,-1):\r\n if(s[i]=='a'):\r\n temp+=(1 + (beststart[i-1][0]-beststart[i][0]))\r\n if(max2<temp):\r\n max2=temp\r\n endpos=i\r\n else:\r\n temp-=1\r\nans=0\r\nif(endpos!=len(s)):\r\n \r\n startpos=beststart[endpos][1]\r\n\r\nif(startpos==-1):\r\n startpos=0\r\n\r\n\r\nfor i in range(startpos):\r\n if(s[i]=='b'):\r\n ans+=1\r\nfor i in range(startpos,endpos):\r\n if(s[i]=='a'):\r\n ans+=1\r\nfor i in range(endpos,len(s)):\r\n if(s[i]=='b'):\r\n ans+=1\r\n#print(startpos,endpos)\r\nprint(len(s)-ans)\r\n ", "s = input()\r\na = [0]\r\nb = [0]\r\nac = bc = 0\r\nfor char in s:\r\n if char == 'a':\r\n ac+=1\r\n else:\r\n bc += 1\r\n a.append(ac)\r\n b.append(bc)\r\nbest = 0\r\nfor L in range(1,len(a)):\r\n for R in range(L, len(a)):\r\n suba = a[R] - a[L-1]\r\n subb = b[R] - b[L-1]\r\n subbacka = a[L-1] - a[0]\r\n subfronta = a[len(a)-1] - a[R]\r\n subfrontb = b[len(a)-1] - b[R]\r\n subbackb = b[L-1] - b[0]\r\n best = max(best, subbacka + suba + subfronta,\r\n subbacka + suba + subfrontb,subbackb + suba + subfronta,\r\n subbackb + subb + subfrontb,subbackb + subb + subfronta,\r\n subbacka + subb + subfronta)\r\n \r\nprint(best)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solution(s):\r\n n = len(s)\r\n dp = [0] * (n + 1)\r\n for i in range(1, n + 1):\r\n dp[i] = dp[i - 1]\r\n if s[i - 1] == 'a':\r\n dp[i] = dp[i - 1] + 1\r\n\r\n res = 0\r\n for i in range(n):\r\n res = max(res, max([dp[i] + dp[-1] - dp[j] + j - i + 1 - dp[j + 1] + dp[i] for j in range(i, n)]))\r\n return res\r\n\r\n\r\ns = input()\r\nprint(solution(s))\r\n# test = \"bbabbbaabbbb\"\r\n# print(solution(test))\r\n", "s=input()\r\na=[0,0,0]\r\nfor i in s:\r\n if i=='a':\r\n a[2]=max(a)+1\r\n a[0]+=1\r\n else:\r\n a[1]=max(a[0],a[1])+1\r\nprint(max(a))", "s=input()\r\nn=len(s)\r\ndp=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n if s[i-1]=='a':\r\n dp[i]=dp[i-1]+1\r\n else:\r\n dp[i]=dp[i-1]\r\nres=0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n res=max(res,dp[i]+dp[-1]-dp[j]+j-i+1-dp[j+1]+dp[i])\r\nprint(res)", "# python3\r\n# utf-8\r\n\r\nstring = input()\r\nprefix___a_nr = [0]\r\nprefix___b_nr = [0]\r\nfor sym in string:\r\n curr_a_nr = prefix___a_nr[-1]\r\n curr_b_nr = prefix___b_nr[-1]\r\n if sym == 'a':\r\n curr_a_nr += 1\r\n elif sym == 'b':\r\n curr_b_nr += 1\r\n prefix___a_nr.append(curr_a_nr)\r\n prefix___b_nr.append(curr_b_nr)\r\n\r\nans = 5000\r\nfor sep1 in range(len(string) + 1):\r\n for sep2 in range(sep1, len(string) + 1):\r\n curr_ans = 0\r\n curr_ans += prefix___b_nr[sep1]\r\n curr_ans += prefix___a_nr[sep2] - prefix___a_nr[sep1]\r\n curr_ans += prefix___b_nr[-1] - prefix___b_nr[sep2]\r\n ans = min(ans, curr_ans)\r\nprint(len(string) - ans)", "x = list(input())\r\na = 0\r\nb = 0\r\na2 = 0\r\n\r\nfor i in range(len(x)):\r\n if x[i] == \"a\":\r\n a += 1\r\n a2 += 1\r\n if x[i] == \"b\":\r\n b += 1\r\n a2 = max(a2, b)\r\n b = max(b, a)\r\n\r\nprint(a2)", "s = input()\r\nn = len(s)\r\ndp = []\r\ndp.append((0, 0, 0))\r\n\r\nfor i in range(n):\r\n if s[i] == 'a':\r\n dp.append((dp[-1][0] + 1, dp[-1][1], max(dp[-1][1:]) + 1))\r\n elif s[i] == 'b':\r\n dp.append((dp[-1][0], max(dp[-1][1], dp[-1][0]) + 1, dp[-1][-1]))\r\nprint(max(dp[-1]))", "s=input()\r\na,ab,aba=0,0,0\r\nfor i in s:\r\n if i=='a':\r\n a+=1\r\n aba=max(ab,aba)+1\r\n else:\r\n ab=max(a,ab)+1\r\nprint(max(aba,ab,a))", "num_a = 0\r\ndp = {'a': 0, 'b': 0}\r\nfor c in input():\r\n if c == 'a':\r\n num_a += 1\r\n dp['a'] = max(dp.values()) + 1\r\n else:\r\n dp['b'] = max(num_a, dp['b']) + 1\r\nprint(max(dp['a'], dp['b']))", "s = input()\r\nf = [[0] * len(s) for _ in range(3)]\r\n\r\nfor i in range(len(s)):\r\n c = s[i]\r\n if i == 0:\r\n f[0][i] += (c != 'a')\r\n else:\r\n f[0][i] = f[0][i - 1] + (c != 'a')\r\n f[1][i] = f[0][i - 1] + (c != 'b')\r\n if i > 1:\r\n f[1][i] = min(f[1][i - 1] + (c != 'b'), f[1][i])\r\n f[2][i] = f[1][i - 1] + (c != 'a')\r\n if i > 2:\r\n f[2][i] = min(f[2][i - 1] + (c != 'a'), f[2][i])\r\nans = f[2][-1]\r\nans = min(ans, s.count('a'), s.count('b'))\r\nk = [0]\r\nfor c in s:\r\n k.append(k[-1] + (c == 'a') - (c == 'b'))\r\n\r\nans = min(ans, s.count('a') - max(k), s.count('b') + min(k))\r\nprint(len(s) - ans)\r\n", "def solve():\r\n s = input()\r\n pref_a = [0]\r\n pref_b = [0]\r\n for i in range(len(s)):\r\n pref_a.append(pref_a[-1]+(s[i] == 'a'))\r\n pref_b.append(pref_b[-1]+(s[i] == 'b'))\r\n ans = 0\r\n\r\n for i in range(0, len(s)+1):\r\n for j in range(i, len(s)+1):\r\n ans = max(ans, (pref_a[len(s)] - pref_a[j]) + (pref_b[j] - pref_b[i]) + pref_a[i])\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "s=input()\r\na=b=c=0\r\nfor i in range(len(s)):\r\n if(s[i]=='a'):\r\n a+=1\r\n c+=1\r\n else:\r\n b+=1\r\n a=max(a,b)\r\n b=max(b,c)\r\nprint(a)\r\n\r\n ", "n = input()\r\nans = [0, 0, 0]\r\nfor i in n:\r\n if i == 'b':\r\n ans[1] = max(ans[0], ans[1]) + 1\r\n else:\r\n ans[2] = max(ans) + 1\r\n ans[0] += 1\r\nprint(max(ans))", "s=input()\r\nn=len(s)\r\ncounta=[0]*(n+1)\r\ncountb=[0]*(n+1)\r\nans=0\r\ncurra=0\r\ncurrb=0\r\nfor i in range(n):\r\n if s[i]=='a':\r\n curra+=1\r\n else:\r\n currb+=1\r\n counta[i+1]=curra\r\n countb[i+1]=currb\r\nfor i in range(n+1):\r\n for j in range(i,n+1):\r\n ans=max(ans,countb[j]-countb[i]+counta[i]+counta[n]-counta[j])\r\nprint(ans)", "s = input()\n\ndp = [0, 0, 0]\n\nfor i in s:\n if i == \"a\":\n dp[2] = max(dp)+1\n dp[0] += 1\n else:\n dp[1] = max(dp[0], dp[1])+1\nprint(max(dp))\n", "s = input()\r\nar = [0,0,0]\r\nfor i in s:\r\n if i == 'a':\r\n ar[2] = max(ar)+1\r\n ar[0] += 1\r\n else:\r\n ar[1] = max(ar[0],ar[1]) + 1\r\nprint(max(ar)) ", "st = input()\r\nf, s, t = 0, 0, 0\r\nfor i in st:\r\n if i == 'a':\r\n t = max(f, s, t) + 1\r\n f += 1\r\n else:\r\n s = max(f, s) + 1\r\nprint(max(f, s, t))", "s = input()\r\nn = len(s)\r\nd = [[0]*3 for _ in range(0,5007)]\r\nmx = 0\r\n\r\nfor i in range(0,n):\r\n d[i][0] = (d[i-1][0] if i>0 else 0) + (s[i]=='a')\r\n d[i][1] = (max(d[i-1][0],d[i-1][1]) if i>0 else 0) + (s[i]=='b')\r\n d[i][2] = (max(d[i-1][1],d[i-1][2]) if i>0 else 0) + (s[i]=='a')\r\n \r\n for j in range(0,3):\r\n mx = max(mx,d[i][j])\r\n \r\nprint(mx)", "s = input()\r\nn = len(s)\r\n\r\nf = [0]*(n+1)\r\nfor i in range(n):\r\n f[i+1] = f[i] + (s[i] == 'a')\r\n\r\nans = 1e18\r\nfor i in range(1, n+1):\r\n for j in range(i+1):\r\n ans = min(ans, (f[i] - f[j]) + (j - f[j]) + n-i - (f[n] - f[i]))\r\n\r\nprint(n-ans)" ]

[ "for s in zip(*(input()for p in range(int(input())))):\r\n l=set(s)-{'?'}\r\n print('?'if len(l)>1 else l.pop()if l else 'a',end='')", "def main():\n l = []\n for col in map(set, zip(*[input() for _ in range(int(input()))])):\n col.discard('?')\n l.append(col.pop() if len(col) == 1 else '?' if col else 'a')\n print(''.join(l))\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict\r\n\r\ntests = int(input())\r\narr = []\r\nans = []\r\nfor _ in range(tests):\r\n arr.append(input())\r\n \r\nsize = len(arr[0])\r\nfor i in range(size):\r\n char = 'a'\r\n count = defaultdict(int)\r\n for j in range(len(arr)):\r\n if arr[j][i] != '?':\r\n count[arr[j][i]] += 1\r\n char = arr[j][i]\r\n \r\n if len(count) <= 1:\r\n ans.append(char)\r\n else:\r\n ans.append('?')\r\n \r\nprint(''.join(ans))\r\n ", "for S in zip(*(input() for _ in range(int(input())))):\r\n L = set(S) - {'?'}\r\n print('?' if len(L) > 1 else L.pop() if L else 'a', end='')", "from collections import defaultdict\r\nn = int(input())\r\ninds = defaultdict(set)\r\nlength = 0\r\nfor _ in range(n):\r\n s = input()\r\n for i in range(len(s)):\r\n inds[i].add(s[i])\r\n length = len(s)\r\n\r\nans = [\"?\"] * length\r\nfor i in range(length):\r\n cur = inds[i]\r\n if len(cur) == 1:\r\n if \"?\" in cur:\r\n ans[i] = \"a\"\r\n else:\r\n ans[i] = list(cur)[0]\r\n elif len(cur) == 2:\r\n if \"?\" in cur:\r\n cur.remove(\"?\")\r\n ans[i] = list(cur)[0]\r\n\r\nprint(\"\".join(ans))\r\n", "import time\r\nimport math\r\n\r\nar = ['0' for i in range(200005)]\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n for i in range(n):\r\n s1 = input()\r\n for j in range(len(s1)):\r\n if s1[j] == '?':\r\n continue\r\n elif ar[j] == '0':\r\n ar[j] = s1[j]\r\n elif ar[j] != s1[j]:\r\n ar[j] = '?'\r\n for i in range(len(s1)):\r\n print(ar[i] if ar[i] != '0' else 'a', end='')\r\n\r\n\r\nsolve()\r\n", "n = int(input())\ns = []\nfor i in range(n):\n s.append(input())\nl = len(s[0])\nres = ''\nfor i in range(l):\n letters = []\n for j in range(len(s)):\n elem = s[j][i]\n if elem != '?':\n if elem not in letters:\n letters.append(elem)\n if len(letters) == 0:\n res += 'x'\n elif len(letters) == 1:\n res += letters[0]\n else:\n res += '?'\nprint(res)", "import sys\r\nimport itertools\r\n\r\n\r\ndef main():\r\n pattern_count = int(sys.stdin.readline())\r\n patterns = itertools.islice(sys.stdin, pattern_count)\r\n result = intersect_patterns(p.strip() for p in patterns)\r\n print(result)\r\n\r\n\r\ndef intersect_patterns(lines):\r\n return ''.join(_intersect_patterns(lines))\r\n\r\n\r\ndef _intersect_patterns(lines):\r\n wildcard, fill = '?', 'x'\r\n for column in zip(*lines):\r\n remaining = set(char for char in column if char != wildcard)\r\n if not remaining:\r\n yield fill\r\n elif len(remaining) == 1:\r\n yield remaining.pop()\r\n else:\r\n yield wildcard\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "lst = [w.rstrip() for w in open(0).readlines()]\r\nn = int(lst[0])\r\nlst = lst[1:]\r\nk, res = len(lst[0]), []\r\nfor x in range(k):\r\n first = ''\r\n for L in lst:\r\n ch = L[x]\r\n if ch == '?': \r\n continue\r\n if first == '': \r\n first = ch\r\n elif ch != first:\r\n res.append(\"?\")\r\n break\r\n else:\r\n res.append(first if first != '' else 'a')\r\nprint(''.join(res))", "import sys\r\nimport itertools\r\n\r\nWILDCARD = '?'\r\nFILL = 'x'\r\n\r\n\r\ndef main():\r\n pattern_count = int(sys.stdin.readline())\r\n patterns = itertools.islice(sys.stdin, pattern_count)\r\n result = intersect_patterns(p.strip() for p in patterns)\r\n print(result)\r\n\r\n\r\ndef intersect_patterns(lines):\r\n return ''.join(_intersect_patterns(lines))\r\n\r\n\r\ndef _intersect_patterns(lines):\r\n first, *patterns = lines\r\n for position, char in enumerate(first):\r\n unique_chars = set(pattern[position] for pattern in patterns)\r\n unique_chars.add(char)\r\n unique_chars.discard(WILDCARD)\r\n if not unique_chars:\r\n yield FILL\r\n elif len(unique_chars) == 1:\r\n yield unique_chars.pop()\r\n else:\r\n yield WILDCARD\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "cnt = int(input())\r\nans = list(input())\r\nfor i in range(cnt-1):\r\n temp = list(input())\r\n for i in range(len(temp)):\r\n if ans[i] == '?' and temp[i] != '?':\r\n ans[i] = temp[i]\r\n elif ans[i] != '?' and temp[i] != '?' and ans[i] != temp[i]:\r\n ans[i] = '.'\r\n\r\nfor i in ans:\r\n if i == '?':\r\n print('a', end='')\r\n elif i == '.':\r\n print('?', end='')\r\n else:\r\n print(i, end='')\r\nprint()\r\n", "import sys\r\nn = int(input())\r\npatterns = []\r\nfor s in range(0,n):\r\n patterns.append(str(input()))\r\nlength = len(patterns[0])\r\n\r\ndef match(chars):\r\n out = \"?\"\r\n for i in chars:\r\n if (out ==\"!\"):\r\n out=\"!\"\r\n elif (out==\"?\" and i==\"?\"):\r\n out=\"?\"\r\n elif(out==\"?\" and i!=\"?\"):\r\n out=i\r\n elif(out!=\"?\" and i==\"?\"):\r\n out=out\r\n elif(out!=\"?\" and i!=\"?\"):\r\n if (out == i):\r\n out=i\r\n else:\r\n out=\"!\"\r\n return out\r\nresult = \"\"\r\nfor i in range(0,length):\r\n matches = []\r\n for c in patterns:\r\n matches.append(c[i])\r\n result = result+str(match(matches))\r\nresult = result.replace(\"?\",\"x\")\r\nresult = result.replace(\"!\",\"?\")\r\nsys.stdout.write(str(result))", "import sys;sc = sys.stdin.readline;out=sys.stdout.write\r\narr=[1 for i in range(int(1e5)+10)];o=0\r\nn=int(sc())\r\nfor e in range(n):\r\n s=str(sc());o=len(s)\r\n for ee in range(len(s)):\r\n if arr[ee]==1 and s[ee]!='?':arr[ee]=ord(s[ee])\r\n elif arr[ee]!=1:\r\n if s[ee]=='?' :continue\r\n elif arr[ee]!=ord(s[ee]):arr[ee]=-1 \r\nfor e in range(o):\r\n if arr[e]==-1:out(\"?\")\r\n elif arr[e]==1:out('a')\r\n else :out(chr(arr[e])) ", "z=['?']*100000;s=0\r\nfor _ in \" \"*int(input()):\r\n t=list(map(str,input().replace(\"\",\" \").split()))\r\n s=len(t)\r\n for i in range(len(t)):\r\n if z[i]==\"@\" or z[i]==t[i]==\"?\":continue\r\n if t[i]!=\"?\" and z[i]==\"?\":z[i]=t[i]\r\n elif t[i]!=\"?\" and z[i]!=\"?\" and z[i]!=t[i]:z[i]=\"@\"\r\nz=z[:s]\r\nfor i in z:\r\n if i==\"@\":print(\"?\",end=\"\")\r\n elif i==\"?\":print(\"a\",end=\"\")\r\n else:print(i,end=\"\")", "n = int(input())\r\narray = [input() for i in range(n)]\r\nexample = array[0]\r\nfl = [True]*len(array[0])\r\nfor st in array[1:]:\r\n temp=''\r\n for i in range(len(example)):\r\n if(st[i] == example[i]):\r\n temp += st[i]\r\n elif(st[i] == '?') and (example[i]!='?'):\r\n temp += example[i]\r\n elif(st[i] != '?') and (example[i] == '?') and fl[i]:\r\n temp += st[i]\r\n elif(st[i] != example[i]):\r\n temp += '?'\r\n fl[i] = False\r\n else:temp += '?'\r\n example = temp\r\ntemp = ''\r\nfor i in range(len(example)):\r\n if(example[i] == '?') and fl[i]:\r\n temp += 'o'\r\n else:\r\n temp += example[i]\r\nprint(temp)", "import sys\r\n#sys.stdin=open('input.txt','r')\r\n#sys.stdout=open('output.txt','w')\r\n\r\nq=int(input())\r\nr=[]\r\n\r\nfor i in range(q):\r\n s=input()\r\n r.append(list(s))\r\n\r\nw=[[0 for i in range(q)] for j in range(len(r[0]))]\r\n#print(w)\r\n#print(r)\r\nfor i in range(0,len(r[0])):\r\n for j in range(0,q):\r\n #print(i,j,r[j][i])\r\n w[i][j]=r[j][i]\r\nans=[]\r\n#print(w)\r\nfor i in range(len(w)):\r\n t=set(w[i])\r\n #print(t)\r\n n=len(t)\r\n if(n==1):\r\n if('?' in w[i]):\r\n ans.append('a')\r\n else:\r\n ans.append(w[i][0])\r\n if(n==2):\r\n if('?' in w[i]):\r\n for i in t:\r\n if(i!='?'):\r\n ans.append(i)\r\n else:\r\n ans.append('?')\r\n elif(n>2):\r\n ans.append('?')\r\n\r\nfor i in ans:\r\n print(i,end=\"\")\r\n", "__author__ = 'Lipen'\r\n\r\ndef main():\r\n n = int(input())\r\n a = [list(input()) for _ in range(n)]\r\n z = len(a[0])\r\n temps = []\r\n\r\n for w in range(z):\r\n temps.append([])\r\n for i in range(n):\r\n temps[-1].append(a[i][w])\r\n\r\n template = ['?']*z\r\n\r\n for w in range(z):\r\n seq = list(set(temps[w]))\r\n l = len(seq)\r\n if l == 1:\r\n if seq[0] == '?':\r\n template[w] = 'x'\r\n else:\r\n template[w] = seq[0]\r\n elif l == 2:\r\n if seq[0] == '?':\r\n template[w] = seq[1]\r\n elif seq[1] == '?':\r\n template[w] = seq[0]\r\n else:\r\n template[w] = '?'\r\n else:\r\n template[w] = '?'\r\n\r\n print(''.join(template))\r\n\r\nmain()", "def main():\r\n n = int(input())\r\n r = {}\r\n p = []\r\n for i in range(n):\r\n p.append(input())\r\n for i in range(len(p[0])):\r\n a = set()\r\n for j in p:\r\n a.add(j[i])\r\n r[i] = a\r\n ans = \"\"\r\n for i in range(len(p[0])):\r\n if len(r[i]) == 1:\r\n for i in r[i]:\r\n if i == \"?\":\r\n ans += \"a\"\r\n else:\r\n ans += i\r\n elif len(r[i]) == 2 and \"?\" in r[i]:\r\n for i in r[i]:\r\n if i != \"?\":\r\n ans += i\r\n else:\r\n ans += \"?\"\r\n print(ans)\r\n\r\n\r\nmain()", "from sys import stdin\r\ninput = stdin.readline\r\n# ~ T = int(input())\r\nT = 1\r\nfor t in range(1,T + 1):\r\n\tn = int(input())\r\n\tans = dict()\r\n\tfinal_ans = []\r\n\tfor i in range(n):\r\n\t\ts = input();\r\n\t\tfor j in range(len(s) - 1):\r\n\t\t\tif j not in ans.keys():\r\n\t\t\t\tans[j] = set()\r\n\t\t\t\tans[j].add(s[j])\r\n\t\t\telse:\r\n\t\t\t\tans[j].add(s[j])\r\n\tfor i in ans.values():\r\n\t\tcount = 0; what = False; val = None\r\n\t\tfor j in i:\r\n\t\t\tif j >= 'a' and j <= 'z':\r\n\t\t\t\tval = j\r\n\t\t\t\tcount += 1\r\n\t\t\telse:\r\n\t\t\t\twhat = True\r\n\t\tif count > 1:\r\n\t\t\tfinal_ans.append('?')\r\n\t\telif count == 0 and what:\r\n\t\t\tfinal_ans.append('a')\r\n\t\telse:\r\n\t\t\tfinal_ans.append(val)\r\n\tfor i in final_ans:\r\n\t\tprint(i,end = \"\")\r\n", "n = int(input())\nstrs = []\nfor i in range(n):\n s = input()\n strs.append(s)\n\nl = len(strs[0])\n\nans = ['.' for i in range(l)]\n\nfor p in range(l):\n for s in strs:\n c = s[p]\n\n if c != \"?\" and ans[p] == \".\":\n ans[p] = c\n elif c != \"?\" and c != ans[p]:\n ans[p] = \"?\"\n\n\nfor i in range(len(ans)):\n if ans[i] == '.':\n ans[i] = \"a\"\n\nprint(''.join(list(map(str, ans))))\n\n", "n=int(input())\r\nlis=[input() for i in range(n)]\r\nshablon=lis[0]\r\nfl=[True]*len(lis[0])\r\nfor st in lis[1:]:\r\n shb=''\r\n for i in range(len(shablon)):\r\n if(st[i]==shablon[i]):\r\n shb+=st[i]\r\n elif(st[i]=='?')and(shablon[i]!='?'):\r\n shb+=shablon[i]\r\n elif(st[i]!='?')and(shablon[i]=='?')and fl[i]:\r\n shb+=st[i]\r\n elif(st[i]!=shablon[i]):\r\n shb+='?'\r\n fl[i]=False\r\n else:shb+='?'\r\n shablon=shb\r\nshb=''\r\nfor i in range(len(shablon)):\r\n if(shablon[i]=='?')and fl[i]:\r\n shb+='o'\r\n else:\r\n shb+=shablon[i]\r\nprint(shb)\r\n", "n = int(input())\r\na = [input() for i in range(n)]\r\nanswer = \"\"\r\n\r\nfor i in range(len(a[0])):\r\n symbol = set()\r\n for j in range(n):\r\n if a[j][i] != \"?\":\r\n symbol.add(a[j][i])\r\n\r\n if len(symbol) == 0:\r\n answer += \"a\"\r\n elif len(symbol) == 1:\r\n answer += list(symbol)[0]\r\n else:\r\n answer += \"?\"\r\n\r\nprint(answer)", "n = int(input())\r\ns = input()\r\nl = list()\r\nfor i in range(len(s)):\r\n l.append(set())\r\n\r\nfor j in range(len(s)):\r\n l[j].add(s[j])\r\n \r\nfor i in range(n-1):\r\n d = input()\r\n for j in range(len(d)):\r\n l[j].add(d[j])\r\n\r\ns = [] \r\nfor i in l:\r\n if len(i) == 1 and '?' in i:\r\n print('x', end ='')\r\n elif len(i) == 1 and not '?' in i:\r\n print(list(i)[0], end='')\r\n elif len(i) == 2 and '?' in i:\r\n k = list(i)\r\n print(k[1-k.index('?')], end = '')\r\n else:\r\n print('?', end = '')", "# Receive input\r\nn = int(input())\r\n\r\npatterns = []\r\n\r\n# Receive input\r\nfor i in range(n):\r\n\r\n pattern = input()\r\n patterns.append(pattern)\r\n\r\nm = len(patterns[0])\r\nmatched_pattern = []\r\n\r\n\r\n# Scan the patterns vertical wise and look for a matching characters and append the matching characters\r\nfor i in range(m):\r\n\r\n matched_char = \"?\"\r\n all_marks = True\r\n all_similar = True\r\n\r\n # find the first non mark character\r\n for pattern in patterns:\r\n \r\n if pattern[i] != \"?\":\r\n matched_char = pattern[i]\r\n break\r\n\r\n # check wether all the characters are similar or contain mark \r\n for pattern in patterns:\r\n \r\n if pattern[i] != \"?\":\r\n\r\n if matched_char != pattern[i]:\r\n all_similar = False\r\n break\r\n\r\n all_marks = False\r\n matched_char = pattern[i]\r\n\r\n if all_marks:\r\n matched_char = \"a\"\r\n \r\n elif not all_similar:\r\n matched_char = \"?\"\r\n \r\n\r\n matched_pattern.append(matched_char)\r\n\r\nmatched_pattern = \"\".join(matched_pattern)\r\n\r\nprint(matched_pattern)", "import sys\r\nimport itertools\r\n\r\nWILDCARD = '?'\r\nFILL = 'x'\r\n\r\n\r\ndef main():\r\n pattern_count = int(sys.stdin.readline())\r\n patterns = itertools.islice(sys.stdin, pattern_count)\r\n result = intersect_patterns(p.strip() for p in patterns)\r\n print(result)\r\n\r\n\r\ndef intersect_patterns(lines):\r\n return ''.join(_intersect_patterns(lines))\r\n\r\n\r\ndef _intersect_patterns(lines):\r\n for column in zip(*lines):\r\n literals = set(column).difference(WILDCARD)\r\n if literals:\r\n literal, *remaining = literals\r\n yield WILDCARD if remaining else literal\r\n else:\r\n yield FILL\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nmatrix = []\r\nfor _ in range(n):\r\n pattern = list(input())\r\n matrix.append(pattern)\r\n\r\nm = len(matrix[0])\r\nanswer = []\r\nfor i in range(m):\r\n memo = set()\r\n question = False\r\n for j in range(n):\r\n if matrix[j][i].isalpha():\r\n memo.add(matrix[j][i])\r\n else:\r\n question = True\r\n memo = list(memo)\r\n\r\n if len(memo) == 0:\r\n answer.append('a')\r\n elif len(memo) == 1:\r\n answer.append(memo[0])\r\n else:\r\n answer.append('?')\r\n\r\nresult = \"\".join(answer)\r\nprint(result)\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [input() for i in range(n)]\r\nm = len(a[0])\r\nc = [set() for i in range(m)]\r\nfor j in range(m):\r\n for i in range(n):\r\n if a[i][j] != \"?\":\r\n c[j].add(a[i][j])\r\nprint(\"\".join(\"x\" if len(s) < 1 else \"?\" if len(s) > 1 else s.pop() for s in c))", "for S in zip(*(input() for _ in range(int(input())))):\r\n L = set(S) - {'?'}\r\n if len(L) > 1:\r\n print('?', end='')\r\n elif len(L) > 0:\r\n print(*L, end='')\r\n else:\r\n print('a', end='')", "numInput = int(input())\nfirst = True\nwList = None\n\nfor _ in range(numInput):\n word = input()\n if first:\n wList = ['?']*len(word)\n first = False\n \n for ind in range(len(word)):\n if wList[ind] == '?' and word[ind] != '?':\n wList[ind] = word[ind]\n elif wList[ind] != '?' and word[ind] == \"?\":\n continue\n elif wList[ind] != '?' and word[ind] != wList[ind]:\n wList[ind] = '*'\n\nfor ind in range(len(wList)):\n if wList[ind] == '?':\n wList[ind] = 'a'\n elif wList[ind] == '*':\n wList[ind] = '?'\nprint(''.join(wList))\n\t\t\t \t\t\t \t\t \t \t \t \t \t", "n=int(input())\r\nx=[]\r\n\r\nfor i in range(n):\r\n s=input()\r\n x.append(s)\r\ny=[]\r\nm=[]\r\nfor j in range(len(s)):\r\n r=0\r\n for k in range(n):\r\n if x[k][j]!=\"?\":\r\n y.append(x[k][j])\r\n break\r\n else:\r\n r+=1\r\n if r==n:\r\n y.append(\"?\")\r\n\r\nfor f in range(len(s)):\r\n q=0\r\n for l in range(n):\r\n if x[l][f]==\"?\":\r\n q+=1\r\n elif x[l][f]==y[f]:\r\n q+=0\r\n else:\r\n m.append(\"?\")\r\n q=n+1 \r\n break \r\n if q<=n: \r\n if q==n:\r\n m.append(\"a\")\r\n else:\r\n m.append(y[f])\r\n \r\n\r\nfor d in range(len(m)):\r\n print(m[d],end=\"\")\r\n ", "n=int(input(''))\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n a+=[input('')]\r\nk=len(a[0])\r\np=1*10**9\r\nfor i in range(k):\r\n b+=[a[0][i]]\r\n#print(list(a),len(a[0]))\r\nfor j in range(k):\r\n z=-1\r\n for i in range(n):\r\n # print(a[i][j])\r\n # print(j,i)\r\n if a[i][j]!='?':\r\n if z==-1:\r\n b[j]=a[i][j]\r\n z=1\r\n else:\r\n # print(j,i)\r\n if a[i][j]!=b[j]:\r\n b[j]='?'\r\n #print(a[i][j],b[:0])\r\n z=1\r\n break\r\n if i==n-1 and z==-1: b[j]='a'\r\nz='' \r\nfor i in range(k):\r\n z+=b[i]\r\nprint(z)\r\n\r\n \r\n\r\n", "# your code goes here\r\nn = int(input())\r\ns = [input() for _ in range(n)]\r\nc = list()\r\nfor t in map(set, zip(*s)):\r\n\tt.discard('?')\r\n\tif not len(t):\r\n\t\tc.append('x')\r\n\telif len(t) < 2:\r\n\t\tc.append(t.pop())\r\n\telse:\r\n\t\tc.append('?')\r\nprint(''.join(c))", "def solve(n, patterns):\r\n ans = []\r\n for i in range(len(patterns[0])):\r\n chars = set()\r\n for pattern in patterns:\r\n if pattern[i] != '?':\r\n chars.add(pattern[i])\r\n if len(chars) == 1:\r\n ans.append(chars.pop())\r\n elif len(chars) > 1:\r\n ans.append('?')\r\n else:\r\n ans.append('x')\r\n return ''.join(ans)\r\n\r\n\r\nn = int(input())\r\npatterns = [input() for _ in range(n)]\r\nprint(solve(n, patterns))", "n = int(input())\r\nans = []\r\np = []\r\nfor i in range(n):\r\n p.append(input())\r\nfor i in range(len(p[0])):\r\n Flag = True\r\n g = []\r\n for j in range(n):\r\n if p[j][i] not in g:\r\n g.append(p[j][i])\r\n if len(g) > 2:\r\n ans.append('?')\r\n elif len(g) == 2:\r\n if g[0]== '?':\r\n ans.append(g[1])\r\n elif g[1] == '?':\r\n ans.append(g[0])\r\n else:\r\n ans.append('?')\r\n elif len(g) == 1:\r\n if g[0] == '?':\r\n ans.append('x')\r\n else:\r\n ans.append(g[0])\r\nprint(''.join(list(map(str, ans))))", "# LUOGU_RID: 101568017\nfor s in zip(*(input() for _ in range(int(input())))):\r\n s = set(s) - {'?'}\r\n print('?' if len(s) > 1 else s.pop() if s else 'a', end='')", "n = int(input())\r\na = [input() for i in range(n)]\r\nanswer = \"\"\r\n\r\nfor i in range(len(a[0])):\r\n sym_i = set()\r\n for j in range(n):\r\n if a[j][i] != \"?\":\r\n sym_i.add(a[j][i])\r\n\r\n if len(sym_i) == 0:\r\n answer += \"a\"\r\n elif len(sym_i) == 1:\r\n answer += list(sym_i)[0]\r\n else:\r\n answer += \"?\"\r\n\r\nprint(answer)\r\n", "n = int(input())\ns = []\nfor i in range(n):\n inp = input()\n\n if len(s) == 0:\n s = [0] * len(inp)\n\n for j in range(len(inp)):\n if inp[j] == '?':\n pass\n elif s[j] == 0:\n s[j] = inp[j]\n else:\n if s[j] != inp[j]:\n s[j] = '?'\n\nfor i in s:\n if i == 0:\n print(end='x')\n else:\n print(end=i)\nprint()\n# = list(map(int, input().split()))\n# ? - lubaya malenkaya bukva\n\n", "n = int(input())\nss = [input() for _ in range(n)]\nans = ''\nfor i in range(len(ss[0])):\n l = ''\n for s in ss:\n if s[i] != '?':\n if l != '' and l != s[i]:\n l = '?'\n break\n elif l == '':\n l = s[i]\n if l == '':\n l = 'x'\n ans += l\nprint(ans)", "from sys import stdin\n\npat = list()\n\ndef match(i):\n global pat\n ans,j,ok = pat[0][i],1,True\n while ok and j<len(pat):\n if pat[j][i] == '?':\n pass\n elif ans=='?' or pat[j][i]==ans:\n ans = pat[j][i]\n else:\n ok = False\n j += 1\n if not(ok): ans = '?'\n elif ans=='?': ans = 'a'\n return ans\n\ndef solve():\n global pat\n ans = list()\n for i in range(len(pat[0])):\n ans.append(match(i))\n return ''.join(ans)\n\ndef main():\n global pat\n ccnt = int(stdin.readline().strip())\n while ccnt>0:\n pat.append(stdin.readline().strip())\n ccnt -= 1\n print(solve())\n\nmain()\n", "def main():\n n: int = int(input())\n out: list = str(input())\n len_word = len(out)\n word = [[x, 0] for x in out]\n\n for i in range(n - 1):\n aux: list = str(input())\n\n for x in range(len_word):\n\n if (aux[x] != '?') and (word[x][0] == '?') and (word[x][1] == 0): \n word[x][0] = aux[x]\n\n elif (aux[x] != '?') and (word[x][0] != '?') and (aux[x] != word[x][0]):\n word[x][0] = '?'\n word[x][1] = 1\n \n for w in word:\n if w[1] == 0 and w[0] == '?': print('x', end='')\n elif w[1] == 0 and w[0] != '?': print(w[0], end='')\n else: print('?', end='')\n print()\n\nif __name__ == '__main__':\n main()\n \t\t \t \t \t \t\t \t\t \t \t \t \t", "n = int(input())\r\ns = []\r\notv = []\r\nfor i in range(n):\r\n s.append(input().strip())\r\nfor j in range(len(s[0])):\r\n otv.append(s[0][j])\r\nfor i in range(len(s[0])):\r\n f = 0\r\n for j in range(1, n):\r\n if otv[i] == \"?\":\r\n otv[i] = s[j][i]\r\n elif s[j][i] != \"?\" and otv[i] != s[j][i]:\r\n otv[i] = \"?\"\r\n f = 1\r\n break\r\n if not(f) and otv[i] == \"?\":\r\n otv[i] = \"a\"\r\nprint(''.join(otv))", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ninp = sys.stdin.readline\r\ndef input(): return inp().strip()\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n = ii()\r\n patter = input()\r\n for _ in range(n-1):\r\n curr = list(input())\r\n index = 0\r\n for p, c in zip(patter, curr):\r\n # print(p, c)\r\n if p != c:\r\n curr[index] = '*'\r\n if p == \"?\" and c != \"*\":\r\n curr[index] = c\r\n if p != \"*\" and c == \"?\":\r\n curr[index] = p\r\n index += 1\r\n patter = curr[:]\r\n # print(patter)\r\n for i in patter:\r\n if i == \"*\":\r\n print('?', end=\"\")\r\n elif i == \"?\":\r\n print('a', end=\"\")\r\n else:\r\n print(i, end=\"\")\r\n\r\n\r\ndef main():\r\n solve()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "testes = int(input())\npaterns = []\nresposta = \"\"\nfor i in range (testes):\n inp = str(input())\n paterns.append(inp)\n\nfor i in range (len(paterns[0])):\n resp = \"\"\n for p in paterns:\n if resp == \"\":\n if p[i] != \"?\":\n resp = p[i]\n else:\n if p[i] != resp and p[i] != \"?\":\n resp = \"?\"\n break\n \n if resp == \"\":\n resposta = resposta + \"x\" \n else:\n resposta = resposta + resp\n\nprint(resposta)\n\n\t\t\t \t \t\t \t\t \t\t \t \t \t \t\t\t \t", "# n_y = list(map(int, input().split()))\r\n# import heapq\r\n# import math\r\n# from collections import deque\r\n# import bisect\r\n#bisect.bisect_right()\r\n# from collections import defaultdict\r\n# tests = int(input())\r\n\r\nn = int(input())\r\npatterns = []\r\n\r\nfor i in range(n):\r\n s = input()\r\n patterns.append(s)\r\n\r\nans = [\"#\"]*len(patterns[0])\r\n\r\nfor pattern in patterns:\r\n \r\n for i in range(len(pattern)):\r\n if pattern[i] == \"?\":\r\n continue\r\n else:\r\n if ans[i]==\"#\" or ans[i] == pattern[i]:\r\n ans[i] = pattern[i]\r\n else:\r\n ans[i] = \"?\"\r\n\r\nfor i in range(len(ans)):\r\n if ans[i]==\"#\":\r\n ans[i] = \"x\"\r\n\r\nprint(\"\".join(ans))", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nans = ''\r\nfor i in range(len(a[0])):\r\n c1 = '?'\r\n c2 = '?'\r\n for j in range(n):\r\n if a[j][i] != '?':\r\n if c1 == '?':\r\n c1 = a[j][i]\r\n elif a[j][i] != c1:\r\n c2 = a[j][i]\r\n if c1 == '?' and c2 == '?':\r\n ans += 'a'\r\n elif c2 == '?':\r\n ans += c1\r\n else:\r\n ans += '?'\r\nprint(ans)", "from functools import reduce\r\n\r\ndef find_pattern(patterns):\r\n '''\r\n http://codeforces.com/problemset/problem/412/C\r\n\r\n Params:\r\n patterns: [string] -- patterns of form 'abb?aax'\r\n\r\n Return:\r\n string -- word that contains min number of ? and matches all patterns.\r\n\r\n ?ab\r\n ??b\r\n\r\n Cases:\r\n 1)\r\n ?ab\r\n ??b\r\n 123\r\n _\r\n Pos 1 thru all patterns stays as ? so anything (e.g. x) matches it.\r\n\r\n 2)\r\n ?ab\r\n ??b\r\n 123\r\n _\r\n Pos 2 thru patterns has non-conflicting matches of 'a', we use 'a' in solution.\r\n\r\n 2.1)\r\n ?abc\r\n ??bd\r\n 1234\r\n _\r\n Pos 3 also has non-conflicting matches (only 'b')\r\n\r\n 3)\r\n ?abc\r\n ??bd\r\n 1234\r\n _\r\n Pos 4 has conflicting matches thus only ? fulfills it.\r\n '''\r\n solution = ['?'] * len(patterns[0])\r\n for pat in patterns:\r\n for i, p in enumerate(pat):\r\n if solution[i] == '.':\r\n # '.' is a tombstone for inevitable '?'\r\n continue\r\n elif p == solution[i]:\r\n # non-conflicting\r\n continue\r\n elif p == '?' and solution[i] != '?':\r\n # non-conflicting\r\n continue\r\n elif p != '?' and solution[i] == '?':\r\n solution[i] = p\r\n else:\r\n # p != '?' and solution[i] != '?':\r\n # conflicting -- using '.' as a tombstone for '?'\r\n solution[i] = '.'\r\n res = ''\r\n for s in solution:\r\n if s == '.':\r\n res += '?'\r\n elif s == '?':\r\n res += 'x'\r\n else:\r\n res += s\r\n return res\r\n\r\n\r\npats = []\r\nfor _ in range(int(input())):\r\n pats.append(input())\r\nprint(find_pattern(pats))\r\n", "n = int(input())\r\n\r\nresult = None\r\n\r\nfor i in range(n):\r\n s = input()\r\n if i == 0:\r\n result = [None for j in s]\r\n for j, v in enumerate(s):\r\n if v == '?' or v == result[j]:\r\n continue\r\n elif result[j] == None:\r\n result[j] = v\r\n else:\r\n result[j] = '?'\r\n\r\nfor i in result:\r\n if i == None:\r\n print('x', end='')\r\n else:\r\n print(i, end='')\r\nprint()\r\n", "n = int(input())\r\nline = list(input())\r\nfor i in range(n - 1):\r\n new_line = list(input())\r\n for j in range(len(line)):\r\n if line[j] != new_line[j] and line[j] == '?':\r\n line[j] = new_line[j]\r\n elif line[j] != new_line[j] and new_line[j] != '?':\r\n line[j] = '#'\r\nfor j in range(len(line)):\r\n if line[j] == '#':\r\n line[j] = '?'\r\n elif line[j] == '?':\r\n line[j] = 'a'\r\nprint(''.join(line))\r\n", "n = int(input())\r\n\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\n\r\nfor i in range(len(s[0])):\r\n status = True\r\n letter = \"a\"\r\n m = set()\r\n for j in range(n):\r\n m.add(s[j][i])\r\n if \"?\" in m:\r\n m.remove(\"?\")\r\n if len(m) == 0:\r\n print(\"x\", end=\"\")\r\n if len(m) == 1:\r\n for k in m:\r\n print(k, end=\"\")\r\n if len(m) > 1:\r\n print(\"?\", end=\"\")", "pat_num = int(input())\n\na = []\nfor i in range(pat_num):\n\tline = input()\n\ta.append(line)\n\nanswer = ''\nfor i in range(len(a[0])):\n\tanswer = answer + '?'\n\nfor i in a:\n\tfor index, b in enumerate(i):\n\t\tif b != '?' and answer[index] == '?':\n\t\t\tanswer = answer[:index] + b + answer[index + 1:]\n\t\telif b != '?' and answer[index] != b:\n\t\t\tanswer = answer[:index] + '!' + answer[index + 1:]\n\nanswer = answer.replace('?', 'a')\n\nanswer = answer.replace('!', '?')\t\n\nprint(answer)\n", "n = int(input())\r\ns = input()\r\nr = ['*']*len(s)\r\nfor i in range(len(s)):\r\n if s[i] != '?': r[i] = s[i]\r\nfor _ in range(n-1):\r\n s = input()\r\n for i in range(len(s)):\r\n if s[i] != '?' and s[i] != r[i]:\r\n if r[i] == '*':\r\n r[i] = s[i]\r\n elif r[i] != '?':\r\n r[i] = '?'\r\nans = ''.join(r)\r\nans = ans.replace('*', 'x')\r\nprint(ans)", "from collections import Counter\r\nt = int(input())\r\nans = [ ]\r\nwhile t:\r\n s = input()\r\n ans += [s]\r\n t -= 1\r\nq, w = 0, 0\r\np = Counter()\r\nans0 = ''\r\nwhile w != len(s):\r\n if q != len(ans):\r\n p[ans[q][w]] += 1\r\n q += 1\r\n else:\r\n if len(p) > 2:\r\n ans0 += '?'\r\n elif len(p) > 1:\r\n for i in p:\r\n if p['?'] == 0:\r\n ans0 += '?'\r\n break\r\n if i != '?':\r\n ans0 += i\r\n break\r\n else:\r\n if p['?']:\r\n ans0 += 'a'\r\n else:\r\n for i in p:\r\n ans0 += i\r\n break\r\n w += 1\r\n q = 0\r\n p = Counter()\r\nif len(p) > 2:\r\n ans0 += '?'\r\nelif len(p) > 1:\r\n for i in p:\r\n if p['?']:\r\n ans0 += '?'\r\n break\r\n if i != '?':\r\n ans0 += i\r\n break\r\nelif len(p):\r\n if p['?']:\r\n ans0 += 'a'\r\n else:\r\n for i in p:\r\n ans0 += i\r\n break\r\nif len(ans0) == 0:print('?')\r\nelse:print(ans0)\r\n", "n = int(input())\r\nword = [input() for _ in range(n)]\r\nres = ''\r\nfor i in range(len(word[0])):\r\n cur = ''\r\n for char in word:\r\n if char[i] != '?':\r\n if cur != '' and cur != char[i]:\r\n cur = '?'\r\n break\r\n elif cur == '':\r\n cur = char[i]\r\n if cur == '':\r\n cur = 'x'\r\n res += cur\r\nprint(res)", "n = int(input())\r\n\r\nv = [input() for i in range(n)]\r\n\r\ns = [\".\"] * len(v[0])\r\nfor i in range(len(v[0])):\r\n for j in range(n):\r\n if v[j][i] != \"?\" or s[i] == \"?\":\r\n if s[i] == \".\":\r\n s[i] = v[j][i]\r\n elif s[i] != v[j][i]:\r\n s[i] = \"?\"\r\n\r\nprint(\"\".join(s).replace(\".\", \"a\"))\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\ndlinna=len(a[0])\r\nanswer=''\r\nfor i in range(dlinna):\r\n flag=0\r\n stand='?'\r\n for j in range(n):\r\n time=a[j][i]\r\n if not(time=='?'):\r\n if stand=='?':\r\n stand=time\r\n flag=1\r\n else:\r\n if (time==stand) and not(flag==2):\r\n flag=1\r\n else:\r\n flag=2\r\n if flag==0:\r\n answer=answer+'x'\r\n if flag==1:\r\n answer=answer+stand\r\n if flag==2:\r\n answer=answer+'?'\r\nprint(answer)\r\n", "import string\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n collector = [list(input()) for i in range(n)]\r\n pattern = [\"?\" for i in range(len(collector[0]))]\r\n for i in range(len(collector[0])):\r\n is_good = True\r\n var_found = False\r\n for j in range(len(collector)):\r\n if not var_found:\r\n if collector[j][i] != \"?\":\r\n var = collector[j][i]\r\n var_found = True\r\n else:\r\n if collector[j][i] != \"?\" and collector[j][i] != var:\r\n is_good = False\r\n break\r\n if is_good:\r\n if var_found:\r\n pattern[i] = var\r\n else:\r\n pattern[i] = \"a\"\r\n else:\r\n pass\r\n print(\"\".join(pattern))\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "k = int(input())\r\nw = []\r\nfor m in range(k):\r\n w.append(list(input()))\r\ntotalres = ''\r\nfor n in range(len(w[0])):\r\n let = w[0][n]\r\n res = '.'\r\n for m in range(k):\r\n f = w[m][n]\r\n if (f != '?'):\r\n if (res == '.'):\r\n res = f\r\n if (f == let and m != 0):\r\n res = let\r\n elif (res != f):\r\n res = '?'\r\n break\r\n totalres += res\r\ntotalres = totalres.replace('.', 'x')\r\nprint(totalres)", "class Solution:\r\n def pattern(self, n, patterns):\r\n ans = []\r\n for i in range(len(patterns[0])):\r\n vals = set()\r\n for pattern in patterns:\r\n if pattern[i] != \"?\":\r\n vals.add(pattern[i])\r\n if len(vals) == 1:\r\n ans.append(list(vals)[0])\r\n elif len(vals) >= 1:\r\n ans.append(\"?\")\r\n else:\r\n ans.append(\"x\") \r\n \r\n return \"\".join(ans) \r\n\r\nsol = Solution()\r\nn = int(input())\r\npatterns = []\r\nfor _ in range(n):\r\n patterns.append(input())\r\nprint(sol.pattern(n, patterns))", "patterns_count = int(input())\n\npatterns = []\nfor index in range(patterns_count):\n\tpatterns.append(input())\n\nbest_intersect_pattern = []\nfor index in range(len(patterns[0])):\n\tletter = None\n\tfor pattern in patterns:\n\t\tif pattern[index] != '?':\n\t\t\tif letter is None:\n\t\t\t\tletter = pattern[index]\n\t\t\telif letter is not None and letter != pattern[index]:\n\t\t\t\tletter = '?'\n\t\t\t\tbreak\n\tif letter is None:\n\t\tletter = 'x'\n\tbest_intersect_pattern.append(letter)\n\nprint(''.join(best_intersect_pattern))\n \t\t \t \t \t \t \t\t\t\t \t\t\t \t \t", "def solve(): \r\n n = int(input())\r\n patterns = [input() for _ in range(n)] \r\n ans = ''\r\n for i in range(len(patterns[0])):\r\n prev_char = ''\r\n count_mark = 0 \r\n prev_cnt = 0\r\n for j in range(n):\r\n if patterns[j][i] == '?':\r\n count_mark += 1 \r\n elif patterns[j][i] == prev_char or prev_char == '':\r\n prev_char = patterns[j][i] \r\n prev_cnt += 1 \r\n else:\r\n break \r\n if count_mark == n:\r\n ans += 'a' \r\n elif prev_cnt == n or prev_cnt + count_mark == n:\r\n ans += prev_char \r\n else:\r\n ans += '?' \r\n print(ans)\r\n\r\nsolve()", "n = int(input())\ns = input()\nstr_len = len(s)\ngood = []\nfor ch in s:\n if ch == '?':\n good.append('$')\n else:\n good.append(ch)\nr = range(n - 1)\nfor i in r:\n s = input()\n j = int(0)\n while j < str_len:\n if (s[j] == '?') and (good[j] == '$'):\n good[j] = '$';\n elif s[j] == '?':\n good[j] = good[j]\n elif good[j] == '$':\n good[j] = s[j]\n elif not(s[j] == good[j]):\n good[j] = '?'\n j = j + 1\n\nans = \"\"\nfor ch in good:\n if ch == '$':\n ans = ans + 'z'\n else:\n ans = ans + ch\n \nprint(ans)\n", "from sys import stdin\r\n \r\n \r\nn = int(input())\r\nips = []\r\n \r\nfor _ in range(n):\r\n arr = stdin.readline().rstrip()\r\n ips.append(arr)\r\n \r\noutput = ['?'] * len(ips[0])\r\n \r\nfor i in range(len(ips[0])):\r\n countSet = set()\r\n for j in range(n):\r\n if ips[j][i] != '?':\r\n countSet.add(ips[j][i])\r\n if len(countSet) > 1:\r\n break\r\n else:\r\n if len(countSet) == 0:\r\n output[i] = 'x'\r\n else:\r\n output[i] = countSet.pop()\r\n \r\nprint(''.join(output))", "n = int(input())\r\n\r\nans = [\"\"]*(10**5)\r\n\r\nfor _ in range(n):\r\n s = input()\r\n\r\n for idx, char in enumerate(s):\r\n if char == \"?\" and ans[idx] == \"\":\r\n ans[idx]= \"-\"\r\n\r\n elif char != \"?\" and (ans[idx] == \"\" or ans[idx] == \"-\"):\r\n ans[idx] = char\r\n \r\n elif char != \"?\" and ans[idx] != char:\r\n ans[idx] = \"?\"\r\n \r\n\r\nfor idx, char in enumerate(ans):\r\n if char == \"-\":\r\n ans[idx] = \"a\"\r\nprint(\"\".join(ans))\r\n\r\n", "import sys\n\n#input functions\nreadint = lambda: int(sys.stdin.readline())\nreadints = lambda: map(int,sys.stdin.readline().split())\nreadar = lambda: list(map(int,sys.stdin.readline().split()))\nflush = lambda: sys.stdout.flush()\n\ndef t(a,i):\n hit = False\n r = \"a\"\n for j in range(len(a)):\n if a[j][i] != \"?\":\n if not hit:\n hit = True\n r = a[j][i]\n elif a[j][i] != r: return \"?\"\n return r\n\nar = list()\nans = list()\nfor snth in range(readint()):\n ar.append(input())\nfor i in range(len(ar[0])):\n ans.append(t(ar,i))\nprint(*ans,sep=\"\")\n\n\t \t\t\t\t\t \t \t\t \t \t\t \t\t \t \t", "n = int(input())\r\ns = \"\"\r\nfor i in range(n):\r\n s += input()\r\nk = len(s)//n\r\nlis = [s[i::k] for i in range(k)]\r\ns = \"\"\r\nfor i in lis:\r\n i = \"\".join(sorted(list(set(i)))).strip(\"?\")\r\n if len(i) == 0:\r\n s += \"a\"\r\n elif len(i) == 1:\r\n s += i\r\n else:\r\n s += \"?\"\r\nprint(s)\r\n", "n = int(input())\r\nl = 0\r\na = [set() for i in range(500000)]\r\nfor i in range(n):\r\n s = input().strip()\r\n l = len(s)\r\n for j in range(len(s)):\r\n if s[j] != '?':\r\n a[j].add(s[j])\r\nfor i in range(l):\r\n if len(a[i]) == 0:\r\n print('a', end = '')\r\n elif len(a[i]) == 1:\r\n print(list(a[i])[0], end = '')\r\n else:\r\n print('?', end = '')", "np = int(input())\r\nvp = []\r\nfor i in range(np):\r\n vp.append(list(input()))\r\n \r\ntprp = ''\r\nfor j in range(len(vp[0])):\r\n letra = vp[0][j]\r\n rp = '.'\r\n for i in range(np):\r\n ep = vp[i][j]\r\n if (ep != '?'):\r\n if (rp == '.'):\r\n rp = ep\r\n if (ep == letra and i != 0):\r\n rp = letra\r\n elif (rp != ep):\r\n rp = '?'\r\n break\r\n tprp += rp\r\ntprp = tprp.replace('.', 'x')\r\nprint(tprp)\r\n\r\n", "a = int(input())\r\nans = []\r\nfor i in input():ans.append(i)\r\nfor i in range(a-1):\r\n WS = input()\r\n for ii in range(len(ans)):\r\n if ans[ii] == '?':ans[ii] = WS[ii]\r\n elif WS[ii] == '?':pass\r\n elif WS[ii] != ans[ii]:ans[ii] = 'ERR'\r\nfor i in range(len(ans)):\r\n if ans[i] == '?':ans[i] = 'x'\r\n if ans[i] == 'ERR':ans[i] = '?'\r\nanw = ''\r\nfor i in ans:anw = anw+ i\r\nprint(anw)\r\n \r\n", "from collections import defaultdict, deque, Counter\r\nfrom functools import lru_cache\r\nfrom heapq import heappush, heappop\r\nfrom bisect import bisect_right, bisect_left\r\n\r\ndef inpNum():\r\n return int(input())\r\ndef inpStr():\r\n return input()\r\ndef inpSepNum():\r\n return map(int, input().split())\r\ndef inpNumList():\r\n return list(map(int, input().split()))\r\ndef inpChList():\r\n return list(input().split())\r\nn = inpNum()\r\ns = []\r\nfor _ in range(n):\r\n s.append(input())\r\ns_len = len(s[0])\r\nans = []\r\nfor i in range(s_len):\r\n flag = True\r\n prev = s[0][i]\r\n for j in range(1, n):\r\n if s[j][i] != prev:\r\n if s[j][i] != '?' and prev != '?':\r\n flag = False\r\n else:\r\n if prev == '?':\r\n prev = s[j][i]\r\n if not flag:\r\n ans.append('?')\r\n else:\r\n if prev == '?':\r\n ans.append('a')\r\n else:\r\n ans.append(prev)\r\n# print(ans)\r\nans = \"\".join(ans)\r\nprint(ans)\r\n \r\n \r\n\r\n", "n = int(input())\r\nS = [0] * n\r\nA = ''\r\nfor i in range(n):\r\n S[i] = list(input())\r\nfor j in range(len(S[0])):\r\n set0 = set()\r\n for i in range(n):\r\n set0.add(S[i][j])\r\n set0 = ''.join(map(str, list(set0)))\r\n if set0 == '?':\r\n A += 'x'\r\n elif len(set0) == 1:\r\n A += set0\r\n elif len(set0) == 2:\r\n if set0[0] != '?' and set0[1] != '?':\r\n A += '?'\r\n elif set0[0] != '?':\r\n A += set0[0]\r\n else:\r\n A += set0[1]\r\n else:\r\n A += '?'\r\nprint(A)", "n, t = int(input()), list(input())\r\nfor i in range(n - 1): \r\n for j, c in enumerate(input()):\r\n if t[j] == '!' or c == '?': continue\r\n if t[j] == '?': t[j] = c\r\n elif t[j] != c: t[j] = '!'\r\nprint(''.join(t).replace('?', 'x').replace('!', '?'))\r\n\r\n", "\nn = int(input())\npatterns = []\nfor i in range (n):\n patterns.append(input())\n\nsize = len(patterns[0])\nresult = [0] * size\n\nfor i in range (len(patterns[0])):\n temp = []\n \n for padrao in patterns:\n temp.append(padrao[i])\n \n if temp.count('?') == n:\n result[i] = 'x'\n else:\n temp = list(filter(lambda x: x != '?', temp))\n if(temp.count(temp[0]) == len(temp)):\n result[i] = temp[0]\n else:\n result[i] = '?'\n\nprint(*result, sep='')\n \t\t \t\t \t\t \t \t\t\t \t\t\t \t \t\t\t\t\t\t", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nsyms = []\r\nfor i in range(len(s[0])):\r\n syms.append(set())\r\nfor i in range(n):\r\n for j in range(len(s[0])):\r\n syms[j].add(s[i][j])\r\nfor i in range(len(s[0])):\r\n if len(syms[i]) > 1:\r\n if len(syms[i]) == 2 and '?' in syms[i]:\r\n print(sorted(list(syms[i]))[-1], end = '')\r\n else:\r\n print('?', end = '')\r\n elif '?' in syms[i]:\r\n print('a', end = '')\r\n else:\r\n print(list(syms[i])[0], end = '')\r\n", "n = int(input())\r\nl = input()\r\nRes = []\r\nfor k in l:\r\n Res.append(k)\r\nfor i in range(n - 1):\r\n x = input()\r\n for j in range(len(x)):\r\n if Res[j] == '?':\r\n if x[j] == '?':\r\n pass\r\n else:\r\n Res[j] = x[j]\r\n else:\r\n if x[j] == '?':\r\n pass\r\n else:\r\n if x[j] != Res[j]:\r\n Res[j] = '@'\r\n else:\r\n pass\r\nfor i in range(len(Res)):\r\n if Res[i] == '?':\r\n Res[i] = 'x'\r\n elif Res[i] == '@':\r\n Res[i] = '?'\r\nprint(''.join(Res))" ]

[ "n,k=map(int,input().split())\r\nif(k>0):\r\n l=list(map(int,input().split()))\r\n l.sort()\r\nc=0\r\nif(k==0):\r\n print(\"YES\")\r\nelif(l[0]==1 or l[-1]==n):\r\n print(\"NO\")\r\nelse:\r\n for i in range(2,k):\r\n if (l[i]-l[i-1]==1 and l[i-1]-l[i-2]==1):\r\n c=1\r\n break\r\n if(c==0):\r\n print(\"YES\")\r\n else:\r\n print('NO')\r\n", "n,m=map(int,input().split())\r\n\r\nif m!=0:\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n if l[0]!=1 and l[-1]!=n:\r\n k=0\r\n for i in range(len(l)-1):\r\n if l[i+1]-l[i]==1:\r\n k+=1\r\n else:\r\n k=0\r\n \r\n if k==2:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n \r\n \r\n \r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "\r\nn, m = map(int, input().split())\r\n\r\nif m == 0:\r\n print(\"YES\")\r\n quit()\r\n\r\nl_d = list(map(int, input().split()))\r\nl_d.sort()\r\nif l_d[0] == 1 or l_d[len(l_d) - 1] == n:\r\n print(\"NO\")\r\n quit()\r\n\r\nc = 0\r\np = -1\r\nfor d in l_d:\r\n if d == p + 1:\r\n c += 1\r\n else:\r\n c = 1\r\n p = d\r\n \r\n if c == 3:\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")", "#See the constraints; check if Brute force is useful\r\n#Figure out a realtion or general formula if possible\r\n#Find the corner cases\r\n#dp,prefix sum, greedy solution or logical \r\n#Ek baar aur kr bro\r\n#Be organised \r\n#Think hard you can do it\r\n\r\ndef singleinput():R = int(input());return R\r\ndef strinput():R = str(input());return R\r\ndef intarray():As = list(map(int,input().split()));return As\r\ndef matrixinput(arr): As = list(map(int,input().split())); arr.append(As)\r\nR = lambda: map(int, input().split())\r\nn, m = R()\r\nd = sorted(R()) if m > 0 else []\r\nprint(\"YES\" if len(d) == 0 or d[0] != 1 and d[m - 1] != n and all(d[i + 2] - d[i] > 2 for i in range(m - 2)) else \"NO\")", "n,m=input().split()\r\nn,m=int(n),int(m)\r\nif m==0: print(\"YES\")\r\nelse:\r\n l = [int(i) for i in input().split()]\r\n l=sorted(l)\r\n if l[0]==1 or l[m-1]==n: print(\"NO\")\r\n else:\r\n i=0\r\n while i<m-2:\r\n j1=i+1\r\n j2=i+2\r\n if (l[j1]-l[i]==1) and(l[j2]- l[j1]==1):\r\n print(\"NO\")\r\n exit()\r\n \r\n\r\n i+=1\r\n print(\"YES\")", "I,a=lambda:map(int,input().split()),[]\r\nn,m=I()\r\nif m:a+=sorted(I())\r\nt=(1in a or n in a)\r\nfor i in range(1,len(a)-1):\r\n if a[i]-a[i-1]==1and a[i+1]-a[i]==1:t=1;break\r\nprint(\"YNEOS\"[t::2])", "n, m = map(int, input().split())\r\nf = True\r\n\r\nif not m == 0:\r\n s = sorted([int(i) for i in input().split()])\r\n\r\n if s[0] == 1 or s[m-1] == n:\r\n f = False\r\n else:\r\n for i in range(m-2):\r\n if s[i] + 2 == s[i+1] + 1 == s[i+2]:\r\n f = False\r\n\r\nprint('YES' if f else 'NO')\r\n", "n, m = map(int, input().split())\r\nans = \"YES\"\r\nif m > 0:\r\n d = sorted(list(map(int, input().split())))\r\n check = set(d)\r\n start = 1\r\n if 1 in check or n in check:\r\n ans = \"NO\"\r\n else:\r\n for i in range(0, m-2):\r\n if d[i+1] == d[i] + 1 and d[i+2] == d[i+1] + 1:\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "# after sorting searching if there are three consecutive integers then return False because Petya can't\r\n# skip then else True\r\ndef ip(no_of_steps, arr):\r\n arr.sort()\r\n\r\n if arr[0] == 1 or arr[len(arr) - 1] == no_of_steps:\r\n return \"NO\"\r\n\r\n for i in range(len(arr) - 2):\r\n if arr[i + 1] == arr[i] + 1 and arr[i + 2] == arr[i] + 2:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n str1 = input()\r\n a, b = str1.split()\r\n if int(a) == 0 or int(b) == 0:\r\n print(\"YES\")\r\n else:\r\n str2 = input()\r\n dirty_stairs = str2.split()\r\n dirty_stairs = [int(i) for i in dirty_stairs]\r\n\r\n print(ip(int(a), dirty_stairs))", "s = input().split()\r\n(n,m) = (int(i) for i in s)\r\nif(m==0):\r\n\tprint('YES')\r\nelif(m > 0):\r\n\ts = input().split()\r\n\ts = [int(i) for i in s]\r\n\r\n\tif((1 in s) or (n in s)):\r\n\t\tprint('NO')\r\n\telse:\r\n\r\n\t\ts.sort()\r\n\t\tflag = 0\r\n\t\tfor i in range(len(s)-2):\r\n\t\t\tif(s[i]-s[i+2] == -2):\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\t\tif(flag == 1):\r\n\t\t\tprint('NO')\r\n\t\telse:\r\n\t\t\tprint('YES')", "n,k = map(int,input().split())\r\n\r\nif k == 0:\r\n\tprint(\"YES\")\r\nelse :\r\n\ta = list(map(int,input().split()))\r\n\ta.sort()\r\n\tif a[0] == 1 or a[k-1] == n:\r\n\t\tprint(\"NO\")\r\n\telse :\r\n\t\tcnt = 0\r\n\t\tfor i in range(k-1):\r\n\t\t\tif a[i]+1 == a[i+1]:\r\n\t\t\t\tcnt+=1\r\n\t\t\telse :\r\n\t\t\t\tcnt = 0\r\n\t\t\tif cnt == 2 :\r\n\t\t\t\tcnt = -1\r\n\t\t\t\tbreak\r\n\t\tif cnt == -1:\r\n\t\t\tprint(\"NO\")\r\n\t\telse:\r\n\t\t\tprint(\"YES\")", "n, m = map(int, input().split())\r\nif m == 0:\r\n print(\"YES\")\r\nelse:\r\n a = [int(i) for i in input().split()]\r\n a.sort()\r\n if a[0] == 1 or a[m - 1] == n:\r\n print(\"NO\")\r\n else:\r\n flag = False\r\n for i in range(m - 2):\r\n if a[i + 2] - a[i + 1] == 1 and a[i + 1] - a[i] == 1:\r\n flag = True\r\n print(\"NO\")\r\n break\r\n if not flag:\r\n print(\"YES\")", "n,m=map(int,input().split())\r\narr=[]\r\nif(m==0):\r\n print(\"YES\")\r\n exit()\r\nelse:\r\n arr=list(map(int,input().split()))\r\narr.sort()\r\nif arr[0]==1 or arr[m-1]==n:\r\n print(\"NO\")\r\n exit()\r\nst=0\r\nfor i in range(1,m):\r\n if arr[i]==(arr[i-1]+1):\r\n st+=1\r\n else:\r\n st=0\r\n if st==2:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "import sys\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n \r\n \r\ndef iinput():\r\n return int(input())\r\n \r\n \r\ndef tinput():\r\n return input().split()\r\n \r\n \r\ndef rinput():\r\n return map(int, tinput())\r\n \r\n \r\ndef rlinput():\r\n return list(rinput())\r\n\r\ntotal,n = rinput()\r\nif n == 0:\r\n print(\"YES\")\r\nelse:\r\n A = rlinput()\r\n A.sort()\r\n if A[0] == 1 or A[-1] == total:\r\n print(\"NO\")\r\n else:\r\n for i in range(n-2):\r\n if A[i+2] - A[i] == 2:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\n\r\n", "n,m=[int(i) for i in input().split()]\nif m==0:\n print('YES')\nelse:\n arr = list(map(int, input().strip().split()))\n k = 1\n arr.sort()\n for i in range(0, m - 2):\n if (arr[i] + 1 == arr[i + 1] and arr[i] + 2 == arr[i + 2]):\n k = 0\n break\n if (arr[0] == 1 or arr[m - 1] == n):\n k = 0\n if k == 1:\n print('YES')\n else:\n print('NO')\n\t\t \t\t\t\t\t \t\t \t \t\t\t \t\t\t \t \t", "R = lambda: map(int, input().split())\n\nn, m = R()\n\nd = sorted(R()) if m > 0 else []\n\nprint(\"YES\" if len(d) == 0 or d[0] != 1 and d[m - 1] != n and all(d[i + 2] - d[i] > 2 for i in range(m - 2)) else \"NO\")\n\n\n\n# Made By Mostafa_Khaled", "a,b=map(int,input().split())\r\nif b !=0:\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n x=True\r\n for i in range(b-2):\r\n if l[i+1]==l[i]+1 and l[i+2]==l[i]+2:\r\n x=False\r\n if l[0]==1 or l[-1]==a:\r\n print('NO')\r\n elif len(l)==0 or len(l)==1 or len(l)==2:\r\n print(\"YES\")\r\n elif x:\r\n print(\"YES\")\r\n else:\r\n print('NO')\r\nelse:\r\n print(\"YES\") ", "n,m=map(int,input().split())\nif m==0:\n\tprint(\"YES\")\n\texit()\na=list(map(int,input().split()))\na.sort()\nif a[0]==1 or a[-1]==n:\n\tprint(\"NO\")\n\texit()\nfor i in range(m-2):\n\tif a[i+2]==(a[i]+2):\n\t\tprint(\"NO\")\n\t\texit()\nprint(\"YES\")\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())\nif m == 0:\n print('YES')\n exit()\nx = sorted(list(map(int, input().split())))\nflag = 0\nif 1 in x or n in x:\n print('NO')\nelse:\n for i in range(1, m):\n if x[i] == x[i - 1] + 1:\n flag += 1\n if flag == 2:\n print('NO')\n exit()\n else:\n flag = 0\n print('YES')\n", "n,m = input().split()\nn = int(n)\nm = int(m)\nif(m == 0):\n\tprint(\"YES\")\nelse:\t\n\td = input().split()\n\td.sort()\n\tprev,prev2 = -5,-5\n\tans = 1\n\tfor i in range(0,m):\n\t\td[i] = int(d[i])\n\t\tif(d[i] == 1 or d[i] == n):\n\t\t\tans = 0\t\n\t\telif d[i] == prev + 1 and d[i] == prev2 + 2:\n\t\t\tans = 0\n\t\tprev2 = prev\n\t\tprev = d[i]\n\tif(ans == 0):\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")", "n,m=map(int,input().split())\r\nif(m>0):\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n#print(l)\r\nflag=1\r\nif(m>0):\r\n if(1 in l or n in l):\r\n flag=0\r\n else:\r\n for i in range(2,m):\r\n #print(i)\r\n if(l[i]==l[i-1]+1 and l[i]==l[i-2]+2):\r\n flag=0\r\n break\r\n \r\n \r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "while True:\r\n try:\r\n def soln(n, k, a):\r\n a.sort()\r\n if a[0] == 1 or a[-1]==n:\r\n print(\"NO\")\r\n return\r\n else:\r\n for i in range(2, k, 1):\r\n if a[i] == a[i-1]+1 and a[i-1]== a[i-2]+1:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n \r\n \r\n \r\n def read():\r\n n,k = map(int, input().split())\r\n if k > 0:\r\n a = list(map(int, input().split()))\r\n else:\r\n print(\"YES\")\r\n return\r\n soln(n, k, a)\r\n\r\n if __name__ == \"__main__\":\r\n read()\r\n except EOFError:\r\n break", "n,m=map(int,input().split())\r\ntry:\r\n\tl=sorted(list(map(int,input().split())))\r\n\tif l[0]==1 or l[-1]==n:\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tans=1\r\n\t\tflag=0\r\n\t\tfor i in range(m-1):\r\n\t\t\tif l[i]+1==l[i+1]:\r\n\t\t\t\tans+=1\r\n\t\t\telse:\r\n\t\t\t\tans=1\r\n\t\t\tif ans>2:\r\n\t\t\t\tflag=1\r\n\t\t\t\tbreak\r\n\t\tif flag:\r\n\t\t\tprint(\"NO\")\r\n\t\telse:\r\n\t\t\tprint('YES')\r\n\r\nexcept:\r\n\tprint('YES')\r\n\r\n", "n, m = map(int, input().split())\r\nif m == 0:\r\n print(\"YES\")\r\n quit()\r\n\r\nd = list(map(int, input().split()))\r\nd.sort()\r\n\r\nif d[0] == 1 or d[-1] == n:\r\n print(\"NO\")\r\n quit()\r\n\r\nlast, conseq = -1, 0\r\nfor di in d:\r\n if di == last + 1:\r\n conseq += 1\r\n if (conseq == 2):\r\n print(\"NO\")\r\n quit()\r\n else:\r\n conseq = 0\r\n last = di\r\n\r\nprint(\"YES\")", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\nn,m = list(map(int, input().split()))\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nif m==0:\r\n print(\"YES\")\r\nelif arr[0]==1 or arr[-1]==n:\r\n print(\"NO\")\r\nelif m<3:\r\n print(\"YES\")\r\nelse:\r\n flag=True\r\n for i in range(m-2):\r\n if 1+arr[i]==arr[i+1] and 1+arr[i+1]==arr[i+2]:\r\n flag=False\r\n break\r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def canJump(numStairs, dirty):\n maxJump = 2\n counter = 0\n dirty.sort()\n if dirty[0] == 1 or dirty[-1] == numStairs:\n return False\n for i in range(1, len(dirty)):\n if dirty[i - 1] + 1 == dirty[i]:\n counter += 1\n if counter >= maxJump:\n break;\n else:\n counter = 0\n else:\n return True\n return False\ns1 = input()\nif int(s1.split(' ')[1]) == 0:\n print('YES')\nelse:\n s2 = input()\n if canJump(int(s1.split(' ')[0]), [int(s) for s in s2.split(' ')]):\n print('YES')\n else:\n print('NO')\n\n\n", "import sys\r\n\r\nn, m = list(map(int, input().split()))\r\nif m == 0:\r\n print(\"YES\")\r\n sys.exit()\r\nd = sorted(map(int, input().split()))\r\n\r\nif d[0] == 1 or d[-1] == n:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nfor x in range(m - 2):\r\n if d[x] == d[x + 1] - 1 == d[x + 2] - 2:\r\n print(\"NO\")\r\n sys.exit()\r\n\r\nprint(\"YES\")\r\n", "from sys import stdin, stdout\r\n\r\ndef get_ints():\r\n return map(int, stdin.readline().strip().split())\r\n\r\ndef solve(dirty_stairs, n):\r\n\r\n if 1 in dirty_stairs or n in dirty_stairs:\r\n return \"NO\"\r\n\r\n ok = True\r\n for stair in dirty_stairs:\r\n if stair + 1 in dirty_stairs and stair + 2 in dirty_stairs:\r\n return \"NO\"\r\n\r\n return \"YES\"\r\n\r\nn, m = get_ints()\r\ndirty_stairs = list(get_ints())\r\ndirty_stairs.sort()\r\n\r\nprint(solve(dirty_stairs, n))\r\n\r\n\r\n", "I=lambda:map(int,input().split())\r\nn,m=I()\r\nif m==0:print(\"YES\")\r\nelse:\r\n a=sorted(I())\r\n t=(1in a or n in a)\r\n for i in range(1,len(a)-1):\r\n if a[i]-a[i-1]==1and a[i+1]-a[i]==1:t=1;break\r\n print(\"YNEOS\"[t::2])", "R = lambda: map(int, input().split())\r\nn, m = R()\r\nd = sorted(R()) if m > 0 else [0]\r\nprint(\"NO\" if d[0] == 1 or d[-1] == n or any(d[i + 2] - d[i] < 3 for i in range(m - 2)) else \"YES\")", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,m=(int(i) for i in input().split())\r\nl=sorted([int(i) for i in input().split()])\r\nc=1\r\nif(1 in l or n in l):\r\n print(\"NO\")\r\nelse:\r\n if(m<3):\r\n print(\"YES\")\r\n else:\r\n for i in range(m-2):\r\n if(l[i]+1==l[i+1] and l[i]+2==l[i+2]):\r\n c=0\r\n break\r\n if(c==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from io import BytesIO\r\nfrom os import fstat, read\r\ninput = BytesIO(read(0, fstat(0).st_size)).readline\r\nI = lambda:[*map(int,input().split())]\r\n\r\n# INT - int(input())\r\n# INT LIST - [*map(int,input().split())]\r\n# STRING - input().decode(\"UTF-8\")[:-2]\r\n# STRING - input().decode(\"UTF-8\").split()\r\n################################################################################\r\n# from collections import Counter, defaultdict, deque, OrderedDict\r\n# from itertools import combinations, permutations\r\n# from math import ceil\r\n# import heapq\r\n\r\nn, m = I()\r\nif m == 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\td = sorted(I())\r\n\tif d[0] == 1 or d[-1] == n:\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\ta = 1\r\n\t\tfor i in range(1, m):\r\n\t\t\tif d[i] == d[i - 1] + 1:\r\n\t\t\t\ta += 1\r\n\t\t\telse:\r\n\t\t\t\ta = 1\r\n\t\t\tif a == 3:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint(\"YES\")\r\n", "n,m = map(int, input().split())\r\nans = \"YES\"\r\nif m>0:\r\n l = sorted(list(map(int, input().split())))\r\n if 1 in l or n in l:\r\n ans = \"NO\"\r\n else:\r\n for i in range(0,m-2):\r\n if l[i+1] == l[i]+1 and l[i+2] == l[i+1]+1:\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "n,m=map(int,input().split())\r\ni=0\r\nif m==0:\r\n print(\"YES\")\r\nelse:\r\n drty=list(map(int,input().split()))\r\n drty.sort()\r\n if drty[0]==1 or drty[-1]==n:\r\n print(\"NO\")\r\n else:\r\n while i<m-2:\r\n if drty[i+1]-drty[i]==drty[i+2]-drty[i+1]==1:\r\n # print(i)\r\n print(\"NO\")\r\n break\r\n i+=1\r\n else:\r\n print(\"YES\")\r\n\r\n ", "N, M = map(int, input().split())\r\nif M > 0:\r\n Dirty = list(sorted((map(int, input().split()))))\r\n Flag = Dirty[0] != 1 and Dirty[-1] != N\r\n if Flag:\r\n Last = Dirty[0]\r\n Amount = 1\r\n for Num in Dirty:\r\n if Last + 1 == Num:\r\n Amount += 1\r\n else:\r\n Amount = 1\r\n Last = Num\r\n if Amount == 3:\r\n Flag = False\r\n break\r\n if Flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m=map(int, input().split())\r\nif m!=0:\r\n a=list(map(int, input().split()))\r\n a.sort()\r\nif m == 0:\r\n print(\"YES\")\r\n \r\nelif a[0] == 1 or a[-1] == n:\r\n print(\"NO\")\r\n \r\nelse: \r\n c = 0\r\n # print(a)\r\n for i in range(m-1):\r\n if a[i+1]-a[i] == 1:\r\n c += 1\r\n else:\r\n c = 0\r\n if c >= 2:\r\n break\r\n \r\n if c >= 2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nif m==0:\r\n print(\"YES\")\r\n exit()\r\na=sorted(list(map(int,input().split())))\r\nif a[0]==1 or a[-1]==n:\r\n print(\"NO\")\r\n exit()\r\nx=0\r\nfor i in range(m-1):\r\n if a[i]+1==a[i+1]:\r\n x+=1\r\n if x==2:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n x=0\r\nprint(\"YES\")\r\n", "n, m = map(int, input().rstrip().split())\r\nif m==0:\r\n print(\"YES\")\r\n exit()\r\nl = list(map(int, input().rstrip().split()))\r\nl.sort()\r\nif l[0]==1 or l[-1]==n:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(m-2):\r\n if l[i]==l[i+1]-1==l[i+2]-2:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "n,m=map(int,input().split())\r\nif m>0:\r\n\ta=[int(x) for x in input().split()]\r\n\ta.sort();\r\n\tflag=True\r\n\tfor i in range(m-2):\r\n\t\tif(a[i+2]==a[i]+2):\r\n\t\t\tflag=False\r\n\t\t\tbreak\r\n\tif flag==False:\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tif a[0]==1 or a[m-1]==n:\r\n\t\t\tprint(\"NO\")\r\n\t\telse:\r\n\t\t\tprint(\"YES\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n\r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n n, m = get_ints_in_variables()\r\n dirtyStairs = get_ints_in_list()\r\n if m == 0:\r\n print(\"YES\")\r\n return\r\n dirtyStairs.sort()\r\n\r\n if dirtyStairs[0] == 1:\r\n print(\"NO\")\r\n return\r\n if dirtyStairs[m-1] == n:\r\n print(\"NO\")\r\n return\r\n \r\n for i in range(2, m):\r\n if (dirtyStairs[i] == dirtyStairs[i-1]+1 == dirtyStairs[i-2]+2):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "n, m=map (int, input ().split ())\r\nl=[]\r\nif m>0:\r\n\tk=list(map (int, input ().split ()))\r\n\tl=k\r\nif (1 in l) or (n in l):\r\n\tprint ('NO')\r\nelif m==0:\r\n\tprint ('YES' ) \r\nelse:\r\n\tl.sort() \r\n\tflag =0\r\n\tfor i in range(m-2):\r\n\t\tif l[i+1]-l[i] ==1 and l[i+2]-l[i+1] ==1:\r\n\t\t\tflag=1\r\n\t\t\tbreak\r\n\tif flag ==1:\r\n\t\tprint ('NO')\r\n\telse:\r\n\t\tprint ('YES')", "from sys import stdin,exit\r\nfrom collections import defaultdict\r\nn,m=map(int,stdin.readline().split())\r\nl=list(map(int,stdin.readline().split()))\r\nl.sort()\r\nif 1==1:\r\n c=0\r\n for i in range(m):\r\n if l[i]==1 or l[i]==n:\r\n print(\"NO\")\r\n exit()\r\n if l[i]==(l[i-1]+1) and i>0:\r\n c+=1\r\n else:\r\n c=0\r\n if c+1==3:\r\n break\r\n if c+1==3:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "#n,m=map(int,input().split())\r\ndef solve(n,m):\r\n if(m==0):\r\n print(\"YES\")\r\n return\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n flag=0\r\n flg=0\r\n if(l[0]==1 or l[m-1]==n):\r\n flg=1\r\n print(\"NO\")\r\n else:\r\n for i in range(0,m-2):\r\n if(l[i+2]-l[i]<=2):\r\n flag=1\r\n break\r\n if(flag==1):\r\n print(\"NO\")\r\n if(flg==0 and flag==0):\r\n print(\"YES\")\r\n\r\n\r\nn,m=map(int,input().split())\r\nr=solve(n,m)\r\n", "n, m = map(int, input().split())\r\nif m == 0:\r\n print(\"YES\")\r\n exit()\r\nd = sorted(list(map(int, input().split())))\r\nif 1 in d or n in d:\r\n print(\"NO\")\r\n exit()\r\n \r\nfor i in range(m-2):\r\n if d[i+1] == d[i]+1 == d[i+2]-1:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")" ]

[ "r , d = map(int, input().split())\r\nn = int(input())\r\nk = 0\r\nfor i in range(n):\r\n x, y, w = map(int, input().split())\r\n l = (x**2 + y**2)**(1/2)\r\n if l-w >= r-d and l+w <= r:\r\n k += 1\r\nprint(k)", "#i don't even wanna solve this problem. Just to get out of this.\r\nr,d=map(int,input().split())\r\nt1=r-d\r\ns=0\r\nfor i in range(int(input())):\r\n x,y,R=map(int,input().split())\r\n q=x*x+y*y\r\n if q>=(t1+R)**2 and q<=(r-R)**2:\r\n s+=1\r\nprint(s)", "from math import *\r\n\r\ndef dist(x,y):\r\n return sqrt(x**2 + y**2)\r\n\r\n\r\nr, d = map(int, input().split())\r\n\r\nans = 0\r\n\r\ncase = int(input())\r\nfor i in range(case):\r\n x, y, ri = map(int, input().split())\r\n dis = dist(x,y)\r\n if dis >= r - d + ri and dis+ ri <= r:\r\n ans += 1\r\nprint(ans)", "import math \r\nr, d = map(int, input().split())\r\nn = int(input())\r\ns = 0\r\nfor i in range(0, n):\r\n x, y, r1 = map(int, input().split())\r\n if math.sqrt(x**2 + y**2) >= r-d+r1 and math.sqrt(x**2 + y**2) + r1 <= r:\r\n s+=1\r\nprint(s)", "r, d = map(int, input().split())\r\nn = int(input())\r\ne = 0\r\nfor i in range(n):\r\n x, y, rq = map(int, input().split())\r\n #print(abs((((x*x)+(y*y))**0.5)))\r\n if(abs(((x*x)+(y*y))**0.5)-rq >= (r-d) and abs(((x*x)+(y*y))**0.5)+rq <= r):\r\n e+=1\r\nprint(e)\r\n", "# url: https://codeforces.com/contest/842/problem/b\n# tag:\n# difficulty:\nfrom typing import List\n\nINF = float(\"inf\")\nNINF = float(\"-inf\")\n\n\ndef read_string():\n return input()\n\n\ndef read_string_line():\n return [x for x in input().split(\" \")]\n\n\ndef read_int_line():\n return [int(x) for x in input().split(\" \")]\n\n\ndef read_int():\n return int(input())\n\n\ndef get_int_arr(s):\n return [int(x) for x in s.split()]\n\n\ndef get_sum(acc, l, r):\n \"\"\"\n l, r are original index\n \"\"\"\n return acc[r] - acc[l]\n\n\nP = int(1e9 + 7)\n\n\ndef exgcd(x, y):\n if y == 0:\n return x, 1, 0\n g, a, b = exgcd(y, x % y)\n t = x // y\n return g, b, a - t * b\n\n\ndef inv(x):\n g, a, b = exgcd(x, P)\n return a\n\n\ndef calc_acc(arr):\n ans = [0]\n for a in arr:\n ans.append(a + ans[-1])\n return ans\n\n\nlines: List[str] = [*open(0)]\nr, d = get_int_arr(lines[0])\nn = int(lines[1])\neps = 1e-8\nans = 0\nfor ti in range(n):\n x, y, k = get_int_arr(lines[ti + 2])\n dist = (x ** 2 + y ** 2) ** 0.5\n if r - d - eps <= dist - k and dist + k <= r + eps:\n ans += 1\nprint(ans)\n", "r, d = map(int, input().split())\nn = int(input())\nans = 0\nfor _ in range(n):\n xi, yi, ri = map(int, input().split())\n if (r - d + ri)**2 <= xi**2 + yi**2 and xi**2 + yi**2 <= (r - ri)**2:\n ans += 1\nprint(ans)\n", "R, d = [int(i) for i in input().split()]\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n x, y, r = [int(i) for i in input().split()]\r\n dist = (x * x + y * y)**0.5\r\n if dist - r >= R - d and dist + r <= R:\r\n ans += 1\r\nprint(ans)", "import math\r\nr, d = map(int,input().split())\r\ncnt = 0\r\nfor _ in range(int(input())):\r\n x, y, r1 = map(int,input().split())\r\n if math.sqrt(x**2+y**2)+r1<=r and math.sqrt(x**2+y**2)-r1>=r-d:\r\n cnt += 1\r\nprint(cnt)", "r1, d = map(int, input().split())\r\nr2, k = r1 - d, 0\r\n\r\nfor _ in range(int(input())):\r\n x, y, r = map(int, input().split())\r\n s = (x ** 2 + y ** 2) ** 0.5\r\n if s - r >= r2 and s + r <= r1:\r\n k += 1\r\n\r\nprint(k)", "r,d=map(int,input().split())\r\nc=0\r\nfor i in range(int(input())):\r\n x,y,z=map(int,input().split())\r\n if(x*x+y*y>=(r-d+z)**2 and x*x+y*y<=(r-z)**2):\r\n c+=1\r\nprint(c)\r\n", "import math\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nc = 0\r\nfor i in range(n):\r\n x, y, z = map(int, input().split())\r\n if math.sqrt(x**2 + y**2) - z >= r - d and math.sqrt(x**2 + y**2) + z <= r:\r\n c += 1\r\nprint(c)", "r,d=map(int,input().split())\r\nb=r-d\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n x,y,rr=map(int,input().split())\r\n a=(x**2+y**2)**0.5\r\n if a-rr>=b and a+rr<=r:\r\n c+=1\r\nprint(c)\r\n", "c = []\r\nif __name__ == \"__main__\":\r\n a = map(int, input().split())\r\n b = int(input())\r\n for i in range(b):\r\n e = map(int, input().split())\r\n f = [a for a in e]\r\n c.append(f)\r\ny=[a for a in a]\r\nz = 0\r\nfor j in range(b):\r\n d = (c[j][0]**2+c[j][1]**2)**0.5\r\n if (y[0]-y[1]) <= d-c[j][2] <= y[0] and (y[0]-y[1]) <= d+c[j][2] <= y[0]:\r\n z += 1\r\nprint(z)\r\n", "def sqr(x):\n\treturn x*x\n\nr, d = map(int, input().split())\nr2, d2 = r*r, d*d\n\nn = int(input())\ncnt = 0\n\nfor i in range(n):\n\tx, y, ri = map(int, input().split())\n\tif x*x+y*y>= sqr(r-d+ri) and x*x+y*y <= sqr(r-ri):\n\t\tcnt += 1\nprint(cnt)\n", "d,r1=map(float,input().split())\r\nn=int(input())\r\nfrom sys import stdin\r\nres=0\r\nfor i in range(n):\r\n x,y,r2=map(int,stdin.readline().split())\r\n item=((x*x)+(y*y))**0.5\r\n if item-r2>=d-r1 and d>=item+r2:res+=1\r\nprint(res)", "r,d=map(int,input().split())\r\nn=int(input())\r\np=[]\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n p.append(a)\r\nr1=r-d\r\nans=0\r\nfor i in range(n):\r\n r2=(p[i][0]**2+p[i][1]**2)**0.5\r\n #r2>=r1+p[i][2] and r2+p[i][2]<=r\r\n if r2>=r1+p[i][2] and r2+p[i][2]<=r:\r\n ans+=1\r\nprint(ans)\r\n", "R, d = map(int, input().split(\" \"))\r\nn = int(input())\r\n\r\ncaught = 0\r\n\r\nfor i in range(n):\r\n\r\n x,y,r = map(int, input().split(\" \"))\r\n\r\n if (R-d+r)*(R-d+r) <= x*x+y*y and x*x+y*y <= (R-r)*(R-r):\r\n\r\n caught +=1\r\n\r\nprint(caught)\r\n\r\n", "def list_from_input():\n return list(map(int, input().split()))\n\n\nclass Snag:\n def __init__(self, x, y, r):\n self.x = x\n self.y = y\n self.r = r\n\n @classmethod\n def from_input(cls):\n return Snag(*list_from_input())\n\n def dist_to_pizza_center(self):\n return (self.x ** 2 + self.y ** 2) ** 0.5\n\n def is_on_board(self, r, d):\n l = self.dist_to_pizza_center()\n return (l - self.r) >= r - d and (l + self.r) <= r\n\ndef main():\n r, d = list_from_input()\n n = int(input())\n\n count = 0\n for i in range(n):\n next_snack = Snag.from_input()\n if next_snack.is_on_board(r, d):\n count += 1\n\n print(count)\n\nmain()\n", "import math\nr,d = map(int,input().split())\nn = int(input())\nans = 0\nfor i in range(n):\n\tx,y,rad = map(int,input().split())\n\ts = math.sqrt(x**2+y**2)\n\tif(r-d+rad<=s<=r-rad):\n\t\tans+=1\nprint(ans)\n \t\t \t \t\t\t\t\t\t\t\t \t \t", "import math\r\n\r\nrp,d = [int(x) for x in input().split()]\r\nn = int(input())\r\n\r\ncount = 0\r\n\r\nfor i in range(0,n):\r\n x,y,r = [int(x) for x in input().split()]\r\n\r\n dist = math.sqrt(x**2 + y**2)\r\n\r\n if (dist-r) >= rp-d and (dist+r) <= rp:\r\n\r\n count += 1\r\n\r\nprint(count)\r\n", "r,d=map(int,input().split())\r\nn=int(input())\r\nans=0\r\nfor _ in range(n):\r\n x,y,p=map(int,input().split())\r\n if x*x+y*y>=(r-d+p)*(r-d+p) and x*x+y*y<=(r-p)*(r-p):\r\n ans+=1\r\nprint(ans)", "import math\r\nr,d=map(int,input().split())\r\nn=int(input())\r\ncount=0\r\nfor _ in range(n):\r\n x,y,rr=map(int,input().split())\r\n if 2*rr>d:\r\n continue\r\n else:\r\n m=x**2+y**2\r\n m=math.sqrt(m)\r\n if r-d+rr<=m<=r-rr:\r\n count+=1\r\nprint(count)\r\n\r\n", "R=lambda:list(map(int,input().split()))\nr,d=R()\ndef ok():\n x,y,z=R()\n return 1 if (r-d+z)**2<=x*x+y*y<=(r-z)**2 else 0\nprint(sum(ok() for i in range(int(input()))))\n\n\n\n\n# Made By Mostafa_Khaled", "import math\nr,d=map(int,input().split())\ns=int(input())\ncnt=0\nfor i in range(s):\n\ta,b,c=map(int,input().split())\n\tif c+math.sqrt(a*a+b*b)<=r and math.sqrt(a*a+b*b)-c>=(r-d):\n\t\tcnt+=1\nprint(cnt)\n", "import math\r\npr = lambda a, b: math.sqrt(a**2 + b**2)\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n x, y, z = map(float, input().split())\r\n if r - d <= pr(x, y) - z and r >= pr(x, y) + z:\r\n ans += 1\r\nprint(ans)\r\n", "r,d=list(map(int,input().split()))\r\nn=int(input())\r\nc=0\r\nk=r-d\r\nwhile n:\r\n\r\n n-=1\r\n x1,y1,r1=list(map(int,input().split()))\r\n m=(((x1**2)+(y1**2))**0.5)\r\n if m-r1>=k and m+r1<=r:\r\n c+=1\r\n\r\nprint(c)", "import math\r\nx1 = [int(x1) for x1 in input().split()] \r\nn = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n x,y,r = input().split()\r\n x = int(x)\r\n y = int(y)\r\n r = int(r)\r\n if x1[0] - x1[1]<= math.sqrt(x*x + y*y) - r and math.sqrt(x*x + y*y) + r <= x1[0] :\r\n count = count + 1\r\n \r\nprint(count)", "r,d = [int(x) for x in input().split()]\r\nn = int(input())\r\ncnt = 0\r\n\t\t\r\nfor i in range(n):\r\n\tx,y,ri = [int(x) for x in input().split()]\r\n\tif (r-d+ri)**2 <= x**2 + y**2 <= (r-ri)**2:\r\n\t\tcnt += 1\r\n\r\nprint(cnt)", "R,D=map(int,input().split())\r\ncnt=0\r\nfor _ in range(int(input())):\r\n x,y,r=map(int,input().split())\r\n d=(x*x+y*y)**(0.5)\r\n if(r+d<=R and d-r>=R-D):\r\n cnt+=1\r\nprint(cnt)", "R,d = map(int,input().split())\r\nn = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n\tx,y,r = map(int,input().split())\r\n\tif 2*r<=d:\r\n\t\tdis = ((x**2)+(y**2))**(1/2)\r\n\t\tmind = dis-r\r\n\t\tmaxd = dis+r\r\n\t\tif mind>=R-d and maxd<=R:\r\n\t\t\tcount+=1\r\nprint(count)", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef dist(x,y,c,d):\n return mt.sqrt((x-c)**2+(y-d)**2)\ndef circle(x1, y1, x2,y2, r1, r2): \n \n distSq = (((x1 - x2)* (x1 - x2))+ ((y1 - y2)* (y1 - y2)))**(.5) \n \n if (distSq + r2 <= r1): \n return True\n else: \n return False\nn,d=M()\nm=I()\nc=0\nfor i in range(m):\n a,b,r=M()\n if(circle(0,0,a,b,n,r)):\n x=dist(0,0,a,b)\n if(x>=n-d+r):\n c+=1\n\nprint(c)\n \n \n \n", "r, d = [int(k) for k in input().split()]\r\ncount = 0\r\nfor i in range(int(input())):\r\n x, y, rs = [int(j) for j in input().split()]\r\n main_dis = (x**2 + y**2)**(1/2)\r\n max_dis = main_dis + rs\r\n min_dis = main_dis - rs\r\n if (max_dis <= (r) and min_dis >= (r-d)):\r\n count+=1\r\nprint(count)", "from math import sqrt\r\ncount = 0\r\nr, d = [int(i) for i in input().split()]\r\n\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n\tx, y, r_k = [int(i) for i in input().split()]\r\n\tdist = sqrt(x ** 2 + y ** 2)\r\n\tif (dist - r_k >= r - d) and (dist + r_k <= r):\r\n\t\tcount += 1\r\n\r\nprint(count)", "\r\nr, d = map(int, input().split())\r\nn = int(input())\r\ncounter = 0\r\nfor i in range(n):\r\n x,y,r_k = map(int, input().split())\r\n if (x**2 + y**2)**(1.0/2.0) - r_k >= r-d and (x**2 + y**2)**(1.0/2.0) + r_k <= r:\r\n counter += 1\r\nprint(counter)\r\n\r\n", "radius, width = input().split()\r\nradius, width = int(radius), int(width)\r\n\r\nsausages = int(input())\r\ncount = 0\r\n\r\nfor _ in range(sausages):\r\n x, y, r = input().split()\r\n x, y, r = int(x), int(y), int(r)\r\n\r\n dist = (x**2 + y**2)**0.5\r\n\r\n if ((dist - r) >= radius - width) and ((dist + r) <= radius):\r\n count += 1\r\n\r\nprint(count)\r\n", "r,d = map(int,input().split()) \nn = int(input())\n\nresult = 0\nfor i in range(n): \n x,y,w = map(int,input().split()) \n l = (x**2+y**2)**(1/2) \n if l-w >= r-d and l+w <= r: \n result += 1\n \nprint(result) \n \t \t\t\t \t \t\t \t \t \t \t \t\t", "r = lambda: map(int,input().split())\r\nrad,d = r()\r\nn = int(input())\r\n\r\n\r\ndist_border = rad\r\ndist_start = rad-d\r\ntotal = 0\r\nfor _ in range(n):\r\n x,y,rad = r()\r\n dist = (x**2+y**2)**0.5\r\n if dist-rad>=dist_start and dist+rad<=dist_border:\r\n total += 1\r\nprint (total)\r\n", "from math import*\r\nR,d=map(int,input().split())\r\nn=int(input())\r\nsum=0\r\nfor i in range(n):\r\n x,y,r=map(int,input().split())\r\n if ((sqrt(x**2+y**2))-r)>=(R-d) and ((sqrt(x**2+y**2))+r)<=R:\r\n sum+=1\r\nprint(sum)\r\n \r\n \r\n", "r,d=input().split()\r\nr,d=int(r),int(d)\r\nn=int(input())\r\nans=0\r\n\r\n\r\nfor i in range (n):\r\n x,y,ri=input().split()\r\n x,y,ri=int(x),int(y),int(ri)\r\n di=abs(complex(x,y))\r\n #print(ri,di)\r\n if (di-ri)>=r-d and (ri+di)<=r:\r\n ans+=1\r\n \r\nprint(ans)\r\n", "from math import pi\r\n\r\n\r\ndef main():\r\n r, d = [int(i) for i in input().split()]\r\n n = int(input())\r\n c = 0\r\n for i in range(n):\r\n x, y, _r = [int(i) for i in input().split()]\r\n s = (x ** 2 + y ** 2) ** 0.5\r\n if s - _r >= r - d and s + _r <= r:\r\n c += 1\r\n\r\n print(c)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "from math import sqrt\r\nR, d = map(int, input().split())\r\nr = R-d\r\nq = int(input())\r\nc = 0\r\nwhile q:\r\n x, y, ri = map(int, input().split())\r\n dc = sqrt(x*x+y*y)\r\n if dc+ri <= R and dc-ri >= r:\r\n c += 1\r\n q -= 1\r\nprint(c)\r\n", "import math\n\ndef main():\n R, D = map(int, input().split())\n N = int(input())\n XYR = tuple(tuple(map(int, input().split())) for _ in range(N))\n\n ans = 0\n for x, y, r in XYR:\n l = math.hypot(x, y)\n if l + r <= R and l - r >= R - D:\n ans += 1\n\n print(ans)\n\nmain()\n", "import math\n\nrd = list(map(int, input().split(' ')))\nr = rd[0]\nd = rd[1]\nn = int(input())\nlista = []\npieces = 0\nfor idx in range(n):\n xyr = list(map(int, input().split(' ')))\n x = xyr[0]\n y = xyr[1]\n rs = xyr[2]\n if math.sqrt(x*x+y*y) + rs <= r and math.sqrt(x*x+y*y) - rs >= r-d:\n pieces+=1\nprint(pieces)\n\t\t \t \t\t\t\t \t \t \t \t \t \t\t\t\t", "import math\r\n\r\ndata = input().split(\" \")\r\nr = int(data[0])\r\nd = int(data[1])\r\nn = int(input())\r\ncount = 0\r\n\r\nfor c in range(0, n):\r\n data = input().split(\" \")\r\n x = int(data[0])\r\n y = int(data[1])\r\n rr = int(data[2])\r\n dd = math.sqrt(x**2 + y**2)\r\n\r\n if (dd + rr) <= r and (dd - rr) >= (r-d):\r\n count = count + 1\r\n\r\nprint(count) ", "I = lambda: map(int, input().split())\r\nr, d = I()\r\nn = int(input())\r\n\r\nans = 0\r\nfor i in range(n):\r\n sx, sy, sr = I()\r\n sd = (sx**2+sy**2)**0.5\r\n if (sd-sr >= r-d) and (sd+sr <= r):\r\n ans += 1\r\n\r\nprint(ans)", "from math import sqrt\r\n\r\nr, d = map(int, input().split())\r\ntotal = 0\r\nfor _ in range(int(input())):\r\n x, y, z = map(int, input().split())\r\n if r - d + z <= sqrt(x ** 2 + y ** 2) and sqrt(x ** 2 + y ** 2) + z <= r:\r\n total += 1\r\n\r\nprint(total)\r\n", "r, d = map(int, input().split())\nn = int(input())\nl = 0\nfor i in range(n):\n x, y, m = map(int, input().split())\n k = (x ** 2 + y ** 2) ** 0.5\n if k - m >= r - d and k + m <= r:\n l += 1\nprint(l)\n#s = input()\n#c = list(map(int, input().split()))\n", "def R():\r\n return map(int, input().split())\r\n\r\nr, d = R()\r\nr0 = r - d\r\nn = int(input())\r\nc = 0\r\nfor _ in range(n):\r\n x, y, ri = R()\r\n if (r0 + ri)**2 <= x**2 + y**2 <= (r - ri)**2:\r\n c += 1\r\nprint(c)\r\n", "import math\n\n\ndef in_crust(x, y, s, d, r):\n return r - d <= math.sqrt(x ** 2 + y ** 2) - s and math.sqrt(x ** 2 + y ** 2) + s <= r\n\n\nclass CodeforcesTask842BSolution:\n def __init__(self):\n self.result = ''\n self.r_d = []\n self.n = 0\n self.circles = []\n\n def read_input(self):\n self.r_d = [int(x) for x in input().split(\" \")]\n self.n = int(input())\n for x in range(self.n):\n self.circles.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n is_ = [1 if in_crust(cru[0], cru[1], cru[2], self.r_d[1], self.r_d[0]) else 0 for cru in self.circles]\n self.result = str(sum(is_))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask842BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from __future__ import print_function, division\nfrom sys import stdin\n\nr, d = map(int, stdin.readline().split())\nn = int(stdin.readline())\nans = 0\nfor i in range(n):\n x, y, dr = map(int, stdin.readline().split())\n if x ** 2 + y**2 < (r - d + dr) ** 2:\n continue\n if x ** 2 + y ** 2 > (r - dr) ** 2:\n continue\n ans += 1\n\nprint(ans)\n\n\n", "ls=list(map(int,input().split()))\r\nr=ls[0]\r\nd=ls[1]\r\nn=int(input())\r\nans=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n x=l[0]\r\n y=l[1]\r\n rd=l[2]\r\n ds=(((abs(x)**2)+(abs(y)**2))**0.5)\r\n if ds-rd>=r-d and ds+rd<=r:\r\n ans+=1\r\nprint(ans)\r\n ", "r, d = map(int, input().split())\r\nn = int(input())\r\nxyr = []\r\nfor _ in range(n):\r\n xyr.append(list(map(int, input().split())))\r\n\r\ns = 0\r\n\r\nfor i in xyr:\r\n g = (i[0]**2 + i[1]**2) ** 0.5\r\n if g + i[2] > r:\r\n continue\r\n elif g - i[2] < r - d:\r\n continue\r\n else:\r\n s += 1\r\n\r\nprint(s)", "from math import hypot\n\nr,d = map(int,input().split())\nn = int(input())\n\ncont = 0\nminB = r-d\nmaxB = r\n\nfor _ in range(n):\n x,y,rd = map(int,input().split())\n h = hypot(x,y)\n minD = h-rd\n maxD = h+rd\n if(minD>=minB and maxD<=maxB):\n cont+=1\n # print(minD,minB,maxD,maxB)\n\nprint(cont)\n \t \t \t\t \t\t \t\t\t \t \t", "#RAVENS\r\n#TEAM_2\r\n#ESSI-DAYI_MOHSEN-LORENZO\r\n\r\nfrom math import sqrt\r\nr,d=map(int,input().split())\r\nc=0\r\nfor i in range(int(input())):\r\n x,y,rr=map(int,input().split())\r\n b=sqrt(x**2+y**2)\r\n if(b<=abs(r-rr) and b>=(r-d+rr)):\r\n c+=1\r\nprint(c)", "r,d = map(int,input().split())\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n x,y,k= map(int,input().split())\r\n dc = (x*x+y*y)**0.5\r\n if dc+k<=r and dc-k>=r-d:\r\n ans+=1\r\nprint(ans)\r\n", "line1 = input().split(\" \")\r\nr= int((line1[0]))\r\nd=int((line1[1]))\r\n\r\nn= int(input())\r\ncounter = 0\r\nfor i in range(1,n+1,1):\r\n line= input().split(\" \")\r\n xi= int(line[0])\r\n yi = int( line[1])\r\n zi = int( line[2])\r\n\r\n hi =(xi**2 + yi**2)**0.5\r\n if hi + zi <= r and hi - zi >= r-d:\r\n counter = counter+1\r\n\r\nprint(counter)", "def dist(x,y):\r\n\tfrom math import sqrt\r\n\treturn sqrt(x*x+y*y)\r\n\r\nr, d = map(int,input().split())\r\nn = int(input())\r\nR = 0\r\nt = r - d\r\nfor k in range(n):\r\n\tx, y, i = map(int,input().split())\r\n\tif dist(x,y)-i>=t and dist(x,y)+i<=r:\r\n\t\tR+=1\r\nprint(R)\r\n", "class Callbass:\r\n def __init__(self, x, y, r):\r\n self.x = x\r\n self.y = y\r\n self.r = r\r\n\r\n def into(self, other):\r\n dx = self.x - other.x\r\n dy = self.y - other.y\r\n distance = (dx*dx + dy*dy)**0.5\r\n return distance + other.r <= self.r\r\n\r\n def intersection(self, other):\r\n dx = self.x - other.x\r\n dy = self.y - other.y\r\n distance = (dx*dx + dy*dy)**0.5\r\n return distance < self.r + other.r\r\n\r\nr, d = map(int, input().split())\r\nlist_of_callbass = []\r\nfor i in range(int(input())):\r\n iterator = map(int, input().split())\r\n callbass = Callbass(*iterator)\r\n list_of_callbass.append(callbass)\r\n\r\npizza = Callbass(0, 0, r)\r\npizza_taste = Callbass(0, 0, r - d)\r\n\r\ncount = 0\r\n\r\nfor callbass in list_of_callbass:\r\n into = pizza.into(callbass)\r\n not_into_taste = not pizza_taste.intersection(callbass)\r\n if into and not_into_taste:\r\n count += 1\r\nprint(count)\r\n", "import math as mt\r\nr,d = map(int,input().split())\r\nn = int(input())\r\ncompteur =0\r\n#perpizza = ((r**2)*mt.pi)-(((r-d)**2)*mt.pi)\r\nfor loop in range(n):\r\n x,y,m = map(int,input().split())\r\n dist1 = (mt.sqrt((x**2) + (y**2)))\r\n #per = (m**2)*mt.pi\r\n if (dist1-(r-d))>=m and r>=(dist1+m):\r\n compteur+= 1\r\nprint(compteur)", "d,r=map(int,input().split())\r\nn=int(input())\r\nxaxis,yaxis,radius=[],[],[]\r\nfor i in range(n):\r\n\tnum=list(map(int,input().split()))\r\n\txaxis.append(num[0])\r\n\tyaxis.append(num[1])\r\n\tradius.append(num[2])\r\nans=0\r\nansss=[]\r\nfor i in range(n):\r\n\tx=xaxis[i]\r\n\ty=yaxis[i]\r\n\tra=radius[i]\r\n\tif((x**2 + y**2)**0.5 + ra <=d and (x**2 + y**2)**0.5 - ra>=d-r):\r\n\t\tans+=1\r\nprint(ans)\r\n\r\n", "from math import sqrt \r\nr,d=[int(element) for element in input().split(' ')]\r\nn=int(input())\r\nres=0\r\nfor i in range(n):\r\n x,y,r_s=[int(element) for element in input().split(' ')]\r\n if (r-d)+r_s<= sqrt(x**2+y**2)<=r- r_s:\r\n res+=1\r\nprint(res)", "\"\"\"\r\nhttps://codeforces.com/contest/842/problem/B\r\n\"\"\"\r\nimport math\r\nr, d = map(int, input().split())\r\npieces = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, pieces + 1):\r\n x, y, ri = map(int, input().split())\r\n gip = math.sqrt(x**2 + y**2)\r\n \r\n if (r-d+ri) <= gip <= r-ri:\r\n count +=1\r\n\r\nprint(count)\r\n \r\n \r\n", "#!/usr/bin/python3\n# -*- coding: UTF-8 -*-\nfrom math import sqrt\n\n\n# Função que lê uma quantidade qualquer de inteiros em uma só linha\ndef read_int(string): return tuple(map(int, string.split()))\n\n\n# Calcula a distância entre o centro de um dado círculo e a origem\ndef dist(circle): return sqrt(circle[0] ** 2 + circle[1] ** 2)\n\n\n# Função principal\ndef main():\n r, d = read_int(input())\n inner_radius, outer_radius = r - d, r\n\n n = int(input())\n circles = [read_int(input()) for _ in range(n)]\n\n count = 0\n for circle in circles:\n inner_edge = dist(circle) - circle[2]\n outer_edge = dist(circle) + circle[2]\n if inner_edge >= inner_radius and outer_edge <= outer_radius:\n count += 1\n\n print(count)\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\nR,d = [int(x) for x in input().split()]\r\nrs = R-d\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n\tarr.append([int(x) for x in input().split()])\r\n\r\ndef main(sausages):\r\n\tcount = 0\r\n\tfor sausage in sausages:\r\n\t\tx,y,r = sausage[0],sausage[1],sausage[2]\r\n\t\tif x*x+y*y>=(rs+r)*(rs+r) and x*x+y*y<=(R-r)*(R-r):\r\n\t\t\tcount += 1\r\n\treturn count\r\n\r\nprint(main(arr))", "from math import *\n\ndef distancia(cx,cy):\n return sqrt(cx**2+cy**2)\n \n\ndef Borda_externa(cx,cy,r,verificado):\n if (distancia(cx,cy)+r <= verificado):\n return True\n elif (distancia(cx,cy)+r > verificado):\n return False\n return False;\n\ndef Borda_interna(cx,cy,r,verificado):\n if (distancia(cx,cy)-r >= verificado):\n return True\n elif (distancia(cx,cy)-r < verificado):\n return False\n return False;\n\nR,d = map(int,input().split())\nT = int(input())\nraio_dentro = R-d;\ncont = 0;\nfor _ in range(T):\n cx,cy,r = map(int,input().split()) \n if(Borda_externa(cx,cy,r,R) and (Borda_interna(cx,cy,r,raio_dentro))):\n cont = cont + 1;\n\nprint(cont)\n \t \t\t \t \t\t\t \t\t\t\t \t \t\t \t", "R,d = [int(x) for x in input().strip().split()]\r\nn = int(input().strip())\r\n\r\nsausages = 0\r\nfor i in range(n):\r\n x,y,r = [int(x) for x in input().strip().split()]\r\n center = (x*x) + (y*y)\r\n if ((R-d+r)*(R-d+r) <= center <= (R-r)*(R-r)):\r\n sausages+=1\r\nprint(sausages)", "r, d = map(int, input().split())\r\nn = int(input())\r\ncircles = [list(map(int, input().split())) for i in range(n)]\r\nt = 0\r\nfor i in range(n):\r\n x, y, rr = circles[i]\r\n if (x * x + y * y) ** 0.5 - rr >= r - d and (x * x + y * y) ** 0.5 + rr <= r:\r\n t += 1\r\nprint(t)", "arr=list(map(int,input().split()))\r\nn=int(input())\r\nres=0\r\nrp=arr[0]\r\nd=arr[1]\r\n\r\ndef distanceFromOrigin(x,y):\r\n return pow(pow(x,2)+pow(y,2),0.5)\r\n\r\n\r\n\r\n\r\ncount=0\r\nfor i in range(n):\r\n query=list(map(int,input().split()))\r\n x=query[0]\r\n y=query[1]\r\n r=query[2]\r\n disLow=distanceFromOrigin(x,y)-r\r\n disHigh=distanceFromOrigin(x,y)+r\r\n if disLow>=rp-d and disHigh<=rp:\r\n count+=1\r\nprint(count)\r\n", "r_pizza,d=map(int,input().split())\r\nn=int(input())\r\ncount=0\r\nfor i in range(n):\r\n\tx,y,r=map(int,input().split())\r\n\tdistance=(x*x+y*y)**.5\r\n\tif distance-r>=r_pizza-d and distance+r<=r_pizza:\r\n\t\tcount+=1\r\n\r\nprint(count)", "r,d=map(int,input().split())\r\nn=int(input())\r\nans=0\r\nfor i in range(n):\r\n x,y,r2=map(int,input().split())\r\n s=(x**2+y**2)**.5\r\n if r-d<=s-r2 and s+r2<=r:ans+=1\r\nprint(ans)", "r,d = [int(x) for x in input().split()]\nn = int(input())\nl = []\ncont = 0\nfor i in range(n):\n l.append([abs(int(x)) for x in input().split()])\nb = r-d\nfor i in l:\n a=i[0]*i[0]+i[1]*i[1]\n t1=(r-i[2])*(r-i[2])\n t2=(i[2]+r-d)*(i[2]+r-d)\n if(a>=t2 and a<=t1):\n cont+=1;\nprint(cont)\n\n \t \t\t \t\t \t\t \t \t\t\t\t\t \t\t \t", "R, d = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\n\r\nfor _ in range(n):\r\n x, y, r = map(int, input().split())\r\n dist_d = ((x*x)+(y*y))**0.5\r\n if dist_d >= R-d+r and dist_d+r <= R:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "r, d = map(int, input().split())\r\nn = int(input())\r\nk = 0\r\nfor i in range(n):\r\n x, y, w = map(int, input().split())\r\n l = (x ** 2 + y ** 2) ** (1 / 2)\r\n k += l - w >= r - d and l + w <= r\r\n\r\nprint(k)", "d1 = input()\r\nD = d1.split()\r\nD = list(map(int, D))\r\nimport math\r\nr = D[0]\r\nd = D[1]\r\nR = r-d\r\ncount = 0\r\nn = int(input())\r\n\r\n\r\ndef checkcircle(r, R, r1, x1, y1):\r\n dis = math.sqrt(x1 * x1 + y1 * y1)\r\n return (dis-r1 >= R and dis+r1 <= r)\r\n\r\ncount = 0\r\n \r\nfor lineNun in range(n):\r\n nthPep = input()\r\n pepArrayN = nthPep.split()\r\n pepArrayN = list(map(int, pepArrayN))\r\n r1 = pepArrayN[2]\r\n x1 = pepArrayN[0]\r\n y1 = pepArrayN[1]\r\n if (checkcircle(r, R, r1, x1, y1)):\r\n count+=1\r\n\r\nprint(count)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\nimport math\r\n\r\nr, d = map(int, input().split())\r\nsum = 0\r\nfor _ in range(int(input())):\r\n xi, yi, ri = map(int, input().split())\r\n if r - d <= math.sqrt(xi * xi + yi * yi) + ri <= r and r - d <= math.sqrt(xi * xi + yi * yi) - ri <= r:\r\n sum += 1\r\n\r\nprint(sum)\r\n", "import math\r\nr,d=map(int,input().split())\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n x,y,r1=map(int,input().split())\r\n if(2*r1<=d):\r\n d1=math.sqrt(x*x+y*y)\r\n if(d1>=r-d+r1 and d1<=r-r1):\r\n c+=1\r\nprint(c)", "'''\r\nConsider the pizza with radius r and width d and the topping s_{i} = (r_{i}, x_{i}, y_{i}).\r\nThe distance from the center of pizza to the center of s_{i} is k_{i} = sqrt(x_{i}^2 + y_{i}^2). \r\nSo, s_{i} is fully contained in the crust if [k_{i} - r_{i}, k_{i} + r_{i}] is a subset of\r\n[r - d, r]. In other words if r - d <= k_{i} - r_{i} and k_{i} + r_{i} <= r. \r\n'''\r\n\r\nimport math\r\n\r\ndef calculateDistance(point, otherPoint):\r\n \r\n return math.sqrt((point[0] - otherPoint[0]) ** 2 + (point[1] - otherPoint[1]) ** 2)\r\n\r\ndef countBadToppings(pizza, crustWidth, toppings):\r\n \r\n numBadToppings = 0\r\n pizzaCenter, pizzaRadius = pizza\r\n for (toppingCenter, toppingRadius) in toppings:\r\n distance = calculateDistance(pizzaCenter, toppingCenter) \r\n if pizzaRadius - crustWidth <= distance - toppingRadius and distance + toppingRadius <= pizzaRadius:\r\n numBadToppings += 1\r\n \r\n return numBadToppings\r\n\r\n\r\npizzaRadius, crustWidth = (map(int, input().split(' ')))\r\nnumToppings = int(input())\r\ntoppings = []\r\nfor i in range(numToppings):\r\n x, y, radius = (map(int, input().split(' ')))\r\n toppings.append(((x, y), radius))\r\n \r\nprint(countBadToppings(((0, 0), pizzaRadius), crustWidth, toppings))", "from sys import stdout\r\nfrom random import randint \r\nfrom math import *\r\n\r\nr, d = map(int, input().split())\r\nn = int(input())\r\n\r\nans = 0\r\nfor i in range(n):\r\n x, y, ri = map(int, input().split())\r\n if hypot(x, y) - ri >= r - d and hypot(x, y) + ri <= r:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "z,d=list(map(int,input().split()))\r\n\r\nimport math\r\no=0\r\n\r\nfor k in range(int(input())):\r\n\r\n x,y,r=list(map(int,input().split()))\r\n\r\n\r\n p=math.sqrt((abs(x))**2+(abs(y))**2)+r\r\n q= p-2*r\r\n if p<=z and q>=z-d:\r\n o+=1\r\n\r\n\r\nprint(o)\r\n", "r,d=map(int,input().split())\nr-=d\nn=int(input())\nk=0\nfor _ in range(n):\n x,y,h=map(int,input().split())\n l=(x**2+y**2)**(1/2)\n if l-h>=r and l+h<=r+d:\n k+=1\nprint(k)\n \t\t\t\t \t \t \t\t \t\t \t \t\t\t\t\t\t", "import math\r\n\r\nR, d = map(int, input().split())\r\nn = int(input())\r\n\r\ncount = 0\r\nfor i in range(n):\r\n x, y, r = map(int, input().split())\r\n\r\n # outside R-d circle, d>c1+c2\r\n # c1=R, c2=r, d=x*x-y*y\r\n # inside R circle, d+c2<=c1\r\n\r\n j = math.sqrt(x**2 + y**2)\r\n\r\n if j >= (R-d+r) and j+r <= R:\r\n count += 1\r\n\r\nprint(count)", "R, d = map(int, input().split())\r\nn = int(input())\r\nnum = 0\r\nfor i in range(n):\r\n x, y, r = map(int, input().split())\r\n q = (x ** 2 + y ** 2) ** 0.5\r\n if R - d <= q - r and q + r <= R:\r\n num += 1\r\n\r\nprint(num)", "import math\r\nR,d=map(int,input().split())\r\nn=int(input())\r\nc=0\r\nwhile n:\r\n n-=1\r\n x,y,r=map(int,input().split())\r\n if R-d+r <= math.sqrt((x**2) + (y**2)) <= R-r:\r\n c+=1\r\n else:\r\n pass\r\nprint(c)\r\n \r\n \r\n ", "r, d = map(int, input().split())\r\nd = r - d\r\nn = int(input())\r\ncnt = 0\r\nfor _ in range(n):\r\n x, y, z = map(int, input().split())\r\n if (d+z)**2 <= x*x + y*y <= (r-z)**2:\r\n cnt += 1\r\nprint(cnt)", "import math\r\n\r\ndef distance(x1,y1,x2,y2):\r\n dx=(x2-x1);\r\n dx *= dx\r\n dy=y2-y1\r\n dy *= dy\r\n return math.sqrt(dx+dy)\r\n\r\nclass Pizza:\r\n def __init__(self, r, d):\r\n self.r=r # radius of whole pizza\r\n self.d=d # width of crust, pizza edge without cheese and source\r\n\r\n def onCrust(self, x, y, r):\r\n dist=distance(0,0,x,y) # distance from origin of sausage to center of pizza\r\n if dist-r<self.r-self.d: # sausage touch pizza none crust\r\n return False\r\n if dist+r>self.r: # sausage partially outside of pizza\r\n return False\r\n return True\r\n\r\ndef ni():\r\n s=input()\r\n while len(s)==0:\r\n s=input()\r\n try:\r\n return int(s)\r\n except:\r\n return 0\r\n \r\ndef nia():\r\n s=input()\r\n while len(s)==0:\r\n s=input()\r\n s=s.split()\r\n iVal=[];\r\n for i in range (len(s)):\r\n iVal.append(int(s[i]))\r\n return iVal\r\n\r\ndef test():\r\n pizza = Pizza(8, 4)\r\n print(pizza.onCrust(7,8,1)==False)\r\n print(pizza.onCrust(-7,3,2)==False)\r\n print(pizza.onCrust(0,2,1)==False)\r\n print(pizza.onCrust(0,-2,2)==False)\r\n print(pizza.onCrust(-3,-3,1)==False)\r\n print(pizza.onCrust(0,6,2)==True)\r\n print(pizza.onCrust(5,3,1)==True)\r\n \r\ndef solve():\r\n rd=nia()\r\n T=ni()\r\n pizza = Pizza(rd[0], rd[1])\r\n count=0;\r\n for i in range(T):\r\n sausage = nia()\r\n if pizza.onCrust(sausage[0], sausage[1],sausage[2]):\r\n count +=1\r\n print(count)\r\n\r\nsolve()\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nr, d = map(int, input().split())\r\nq = 0\r\nfor _ in range(int(input())):\r\n x, y, rc = map(int, input().split())\r\n c = (x**2 + y**2)**0.5\r\n if c + rc <= r and c - rc >= (r-d):\r\n q += 1\r\nprint(q)\r\n", "r,d=map(int,input().split())\nz=int(input())\nk=0\nfor i in range(z):\n\tx,y,w=map(int,input().split())\n\tl=(x**2+y**2)**(1/2)\n\tif l-w>=r-d and l+w<=r:\n\t\tk+=1\nprint(k)\n \t \t\t \t \t\t \t\t \t\t \t \t \t", "read = lambda: tuple(map(int, input().split()))\nr, d = read()\nn = read()[0]\ndist = lambda x, y: (x**2+y**2)**0.5\nc = 0\nfor i in range(n):\n x, y, ri = read()\n di = dist(x, y)\n if di >= r - d + ri and di + ri <= r:\n c += 1\nprint(c)\n", "def find_dist(x1, y1):\r\n return (x1 ** 2 + y1 ** 2) ** 0.5\r\n\r\n\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nanswer = 0\r\nfor i in range(n):\r\n xi, yi, ri = map(int, input().split())\r\n dist = find_dist(xi, yi)\r\n if dist - ri >= r - d and dist + ri <= r:\r\n answer += 1\r\nprint(answer)\r\n", "import math\r\n\r\nA = input().split()\r\nA = [int(i) for i in A]\r\nR = A[0]\r\nD = A[1]\r\nN = int(input())\r\nsaussage_count = 0\r\nfor i in range(0,N):\r\n B = input().split()\r\n B = [int(j) for j in B]\r\n x = B[0]\r\n y = B[1]\r\n r = B[2]\r\n d = math.sqrt(x*x + y*y)\r\n #print(d)\r\n if (d-r >= R-D) and (d+r <= R):\r\n saussage_count += 1\r\n #print(\"Yes\")\r\nprint(saussage_count)\r\n", "def is_it_curst(x,y,p,r,d):\r\n l=((x**2)+(y**2))**0.5\r\n if abs(r-d+p)<=l<=abs(r-p):\r\n return 1\r\n else:\r\n return 0\r\nr,d=map(int,input().split())\r\nc=0\r\nfor _ in range(int(input(''))):\r\n l=list(map(int,input().split()))\r\n x,y,p=l[0],l[1],l[2]\r\n if is_it_curst(x,y,p,r,d):\r\n c+=1\r\nprint(c)", "import math\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n x, y, r0 = map(int, input().split())\r\n z = math.sqrt(x * x + y * y)\r\n if min(z - (r - d), r - z) >= r0:\r\n ans += 1\r\nprint(ans)", "radius, border = [int(i) for i in input().split(' ')]\n\nn = int(input())\n\ndef in_border(x, y, r):\n dist = x*x + y*y\n\n max_dist = (radius - r)*(radius - r)\n min_dist = (r + radius - border)*(r + radius - border)\n\n return dist >= min_dist and dist <= max_dist\n\ncount = 0\n\nfor _ in range(n):\n x, y, r = [int(i) for i in input().split(' ')]\n if in_border(x, y, r):\n count += 1\n\nprint(count)\n \t\t \t\t \t\t\t \t\t \t \t\t\n\t\t \t \t\t\t \t\t \t \t\t\t \t", "import math\r\n\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nanswer = 0\r\nfor _ in range(n):\r\n x, y, r_sausage = map(int, input().split())\r\n if math.sqrt(x * x + y * y) + r_sausage <= r and math.sqrt(x * x + y * y) >= r - d + r_sausage:\r\n answer += 1\r\nprint(answer)", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n R,d = map(int , input().split())\r\n n = int(input())\r\n ans = 0\r\n for i in range(n):\r\n x,y,r = map(int,input().split())\r\n dist = (x*x + y*y)**(0.5)\r\n if dist - r >= (R-d) and dist + r <= R:\r\n ans += 1\r\n print(ans)", "line1 = input().split(\" \")\r\nr = int((line1[0]))\r\nd = int((line1[1]))\r\nn = int(input())\r\ncounter = 0\r\nfor i in range(1, n+1, 1):\r\n line = input().split(\" \")\r\n xi = int(line[0])\r\n yi = int(line[1])\r\n ri = int(line[2])\r\n hi = (xi**2 + yi**2)**0.5\r\n if hi + ri <= r and hi-ri >= r-d:\r\n counter = counter + 1\r\nprint(counter)", "import math\nimport time\n\nr, d = map(int, input().split())\nn = int(input())\n\nglobal k\nk = 0\n\nfor i in range(n):\n x, y, w = map(int, input().split())\n l = (x ** 2 + y ** 2) ** (1/2)\n if (l - w) >= (r - d) and (l + w) <= r:\n k += 1\n\nprint(k)", "R, D = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n\tx, y, r = map(int, input().split())\r\n\td2 = x**2 + y**2\r\n\tif d2 > (R - r)**2: continue\r\n\ta = d2\r\n\tb = (R - D + r)**2\r\n\t# print(i+1, a, b)\r\n\tans += a >= b\r\n\r\nprint(ans)", "R,d = map(int,input().split())\r\nn = int(input())\r\nc=0\r\nfor i in range (n) :\r\n x,y,r=map(int,input().split())\r\n p = (x**2 + y**2)**0.5\r\n if p <= R and p >= R-d :\r\n if p - r >= R-d and p+r <= R:\r\n c+=1\r\n \r\nprint (c) ", "import math\r\n\r\n\r\ndef main_function():\r\n R, d = [int(i) for i in input().split(\" \")]\r\n sausages = [[int(i) for i in input().split(\" \")] for j in range(int(input()))]\r\n counter = 0\r\n for i in sausages:\r\n x, y, r = i\r\n z = math.sqrt(x ** 2 + y ** 2)\r\n if z + r <= R and z - r >= R - d:\r\n #print(i)\r\n counter += 1\r\n print(counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "r,d=map(int,input().split())\nn=int(input())\nk=0\nfor i in range(n):\n\tx,y,w=map(int,input().split())\n\tl=(x**2+y**2)**(1/2)\n\tif l-w>=r-d and l+w<=r:\n\t\tk+=1\nprint(k)\n\t\t\t\t\t\t \t\t\t \t \t \t \t \t \t\t\t\t\t\t \t", "r,d=map(int,input().split());c=0\r\nfor _ in range(int(input())):\r\n x,y,r1=map(int,input().split())\r\n dst=(x**2+y**2)**0.5\r\n if dst>=r-d and dst<=r:\r\n if dst+r1<=r and dst-r1>=r-d: c+=1\r\nprint(c)", "import math\n[all_radius,crust_radius]=map(int, input().split(\"\\n\")[0].split(\" \"))\nnum_sausage=int(input())\ncount=0\nfor n in range (0,num_sausage):\n\tx,y, sausage_radius=map(int, input().split(\"\\n\")[0].split(\" \"))\n\tif(x**2+y**2 >= (all_radius-crust_radius+sausage_radius)**2 and x**2+y**2 <= (all_radius-sausage_radius)**2):\n\t\tcount+=1;\nprint(count)", "r,d = map(int,input().split())\r\nr1 = r-d\r\nr2=r\r\nn = int(input())\r\nk = 0\r\nfor i in range(n):\r\n x,y,ri = map(int,input().split())\r\n if (x*x+y*y>=(r1+ri)**2)and(x*x+y*y<=(r2-ri)**2):\r\n k+=1\r\nprint(k)", "import math\n\ndef is_on_crust(x, y, r, d, ri):\n distance_from_origin = math.sqrt(x**2 + y**2)\n return distance_from_origin >= r - d + ri and distance_from_origin <= r - ri\n\nr, d = map(int, input().split())\nn = int(input())\n\ncount = 0\nfor _ in range(n):\n x, y, ri = map(int, input().split())\n if is_on_crust(x, y, r, d, ri):\n count += 1\n\nprint(count)\n\n\t \t\t\t \t \t\t\t \t \t\t \t \t \t \t\t", "import math\nr, d = map(int, input().split())\nn = int(input())\ncount = 0\nfor t in range(n):\n x, y, ri = map(int, input().split())\n d_centre = math.sqrt(x*x + y*y)\n if d_centre - ri >= r - d and d_centre + ri <= r:\n count += 1\nprint(count)\n", "import math\nprint((lambda r,d,n:sum(r-d+ir<=math.hypot(ix,iy)<=r-ir for ix,iy,ir in (map(int,input().split()) for _ in range(n))))(*map(int,input().split()),int(input())))\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 pizza(r, d, lst):\r\n count = 0\r\n for elem in lst:\r\n p = sqrt(elem[0] * elem[0] + elem[1] * elem[1])\r\n if p - elem[2] >= r - d and p + elem[2] <= r:\r\n count += 1\r\n return count\r\n\r\n\r\nR, D = [int(i) for i in input().split()]\r\nn = int(input())\r\na = list()\r\nfor j in range(n):\r\n xi, yi, ri = [int(t) for t in input().split()]\r\n a.append([xi, yi, ri])\r\nprint(pizza(R, D, a))\r\n", "import math\r\n\r\ndef get_n():\r\n return int(input())\r\n\r\ndef get_int_vector():\r\n return [int(x) for x in input().split()]\r\n\r\ndef list2string(list):\r\n result = []\r\n for i in list:\r\n result.append(str(i))\r\n return ':'.join(result)\r\n\r\ndef string2vector(string):\r\n return [int(x) for x in string.split(':')]\r\n\r\nr, d = get_int_vector()\r\nn = get_n()\r\n\r\nresult = 0\r\nfor _ in range(n):\r\n x, y, r_i = get_int_vector()\r\n\r\n dist = x**2 + y**2\r\n if dist < (r-d)**2 or dist > r**2:\r\n continue \r\n if dist >= (r-d+r_i)**2 and dist <= (r-r_i)**2:\r\n result += 1\r\n\r\nprint(result)\r\n", "import math\n\ndef dist(x1,y1,x2,y2):\n\tx=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)\n\t# print(x)\n\tx=math.sqrt(x)\n\t# print(x)\n\treturn x\n\n\nrad,d=map(int,input().split())\nbase = rad-d\nn=int(input())\nct = 0\nfor i in range(n):\n\tx,y,r=map(int,input().split())\n\td = dist(0,0,x,y)\n\t# print(d)\n\tif d-r >=base and d+r <=rad :\n\t\tct+=1\n\t\t# print(\"played\",r,x,y)\nprint(ct)", "import math\r\n\r\ndef chk(x, y, ri):\r\n global r0\r\n m = math.sqrt(x*x+y*y)\r\n return m >= r0 \\\r\n and m <= r0 + d \\\r\n and m - r0 >= ri \\\r\n and r0 + d - m >= ri\r\n\r\nr, d = [int(x)+0. for x in input().split()]\r\nr0 = r - d\r\nn = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n x, y, ri = [int(x)+0. for x in input().split()]\r\n if chk(x, y, ri):\r\n #print(f'{x} {y} {ri}')\r\n cnt += 1\r\nprint(cnt)", "import math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n r, d = input_ints()\r\n n = int(input())\r\n ans = 0\r\n for i in range(n):\r\n x, y, p = input_ints()\r\n if (r - d + p) ** 2 <= x ** 2 + y ** 2 <= (r - p) ** 2:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "def dist(x1,y1,x2,y2):\r\n\td=((x2-x1)**2+(y2-y1)**2)**(1/2)\r\n\treturn d\r\nr,d=map(int,input().split())\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n\tx,y,ri=map(int,input().split())\r\n\tif dist(x,y,0,0)-ri>=(r-d) and dist(x,y,0,0)+ri<=r:\r\n\t\tc+=1\r\nprint(c)\r\n", "from math import sqrt\r\nr,di=map(int,input().split())\r\ndd=r-di\r\ncnt=0\r\nfor i in range(int(input())):\r\n x,y,z=map(int,input().split())\r\n s=sqrt(x*x+y*y)\r\n a=s+z\r\n b=s-z\r\n if dd<=a<=r and dd<=b<=r: cnt+=1\r\nprint(cnt)\r\n", "r, d = map(int, input().split())\n\nn = int(input())\n\nc = 0\nfor _ in range(n):\n x, y, r_ = map(int, input().split())\n\n distance = (x * x + y * y) ** 0.5\n\n if distance + r_ <= r and distance - r_ >= (r - d):\n c += 1\nprint(c)", "from sys import stdin\nimport math\n\ndef distance(x,y):\n\treturn abs(math.sqrt(x*x+y*y)) \n\ndef check(x,y,rad):\n\tdist = distance(x,y)\n\tif((dist+rad)<=r and dist-rad>=(r-d)):\n\t\treturn True\n\telse:\n\t\treturn False\n\n\nr,d=list(map(int,input().split()))\nn=int(input())\ncount=0\nfor u in range(n):\n\tx,y,rad=list(map(int,input().split()))\n\tif(check(x,y,rad)):\n\t\tcount+=1\nprint(count)", "import math\r\n\r\npizza_data = input()\r\nn = int(input())\r\n\r\nlist_pizza = [int(pizza_values)\r\n for pizza_values in pizza_data.split() if pizza_values.isdigit()]\r\n\r\nmaster_list = []\r\n\r\nfor j in range(n):\r\n piece_data = input()\r\n\r\n list_piece = [int(piece_values)\r\n for piece_values in piece_data.rsplit(\" \")]\r\n master_list.append(list_piece)\r\n\r\noutput = i = 0\r\n\r\nwhile i < n:\r\n pith = math.sqrt(\r\n math.pow(master_list[i][0], 2)+math.pow(master_list[i][1], 2))\r\n\r\n if pith + master_list[i][2] <= list_pizza[0] and pith - master_list[i][2] >= list_pizza[0]-list_pizza[1]:\r\n output += 1\r\n i += 1\r\nprint(output)", "import math\r\nfrom sys import stdin, stdout\r\ndef main():\r\n x = stdin.readline().split()\r\n r = int(x[0])\r\n d = int(x[1])\r\n r -= d\r\n n = int(stdin.readline())\r\n ans = 0\r\n for i in range(n):\r\n x = stdin.readline().split()\r\n a = int(x[0])\r\n b = int(x[1])\r\n ri = int(x[2])\r\n D = math.sqrt((a*a) + (b*b))\r\n if D-ri >= r and d >= 2*ri and D+ri <= r+d:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "r,d = input().split()\r\nn = int(input())\r\nr,d = [int(r), int(d)]\r\ncnt = 0\r\nfor i in range(n):\r\n x,y,r1 = input().split()\r\n x,y,r1 = [int(x), int(y), int(r1)]\r\n\r\n if( ((x)**2 + (y)**2 <= (r-r1)**2) and ((x)**2 + (y)**2 >= (r-d+r1)**2) ):\r\n cnt = cnt + 1\r\n\r\nprint(cnt)\r\n", "import math\r\nr, d = [int(j) for j in input().split()]\r\nn = int(input())\r\na = r - d\r\nc = 0\r\nfor i in range(n):\r\n x, y, r2 = [int(j) for j in input().split()]\r\n p = math.sqrt(x**2 + y**2)\r\n if p + r2 <= r and p - r2 >= a:\r\n c += 1\r\nprint(c)\r\n", "from math import sqrt\r\nr,d = map(int,input().split())\r\nn = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n\tx,y,ri = map(int,input().split())\r\n\ta = sqrt(x**2+y**2)-ri\r\n\tb = a + 2*ri\r\n\tif a>=r-d and b<=r:\r\n\t\tcnt+=1\r\n\r\nprint(cnt)\r\n\r\n\r\n", "import math\r\nr,d=map(int,input().split())\r\nc=r-d\r\nt=int(input())\r\nans=0\r\nfor i in range(t):\r\n x,y,a=map(int,input().split())\r\n p=math.sqrt(x*x+y*y)\r\n if(p-a>=c and p+a<=r):\r\n ans+=1\r\nprint(ans)", "import math\r\nr,d = map(int, input().strip().split(' '))\r\nn=int(input())\r\nrs=r-d\r\nc=0\r\nfor i in range(n):\r\n x,y,rad = map(int, input().strip().split(' '))\r\n \r\n p=math.sqrt(x*x + y*y)\r\n if p-rad>=rs and p+rad<=r:\r\n c+=1\r\n \r\nprint(c)\r\n#a = list(map(int, input().strip().split(' '))) ", "#coding:utf-8\r\n\r\nr,d = list(map(int,input().split()))\r\nn = int(input())\r\nj = 0\r\nl = r - d\r\nfor i in range(n):\r\n a,b,g = list(map(int,input().split()))\r\n if ((abs(a*a) + abs(b*b)) >= (l + g)*(l + g)) & ((abs(a*a) + abs(b*b)) <= (r - g)*(r - g)):\r\n j += 1\r\nprint(j)\r\n", "'''input\n8 4\n7\n7 8 1\n-7 3 2\n0 2 1\n0 -2 2\n-3 -3 1\n0 6 2\n5 3 1\n'''\nr, d = map(int, input().split())\nn = int(input())\nc = 0\nfor _ in range(n):\n\tx, y, r1 = map(int, input().split())\n\ts = (x**2 + y**2)**0.5\n\tif r-d <= s-r1 and s+r1 <= r:\n\t\tc += 1\nprint(c)\n", "r, d = map(int, input().split())\nn = int(input())\nans = 0\nfor i in range(n):\n xi, yi, ri = map(int, input().split())\n d2 = xi ** 2 + yi ** 2\n if d2 >= (r - d + ri) ** 2 and d2 <= (r - ri) ** 2:\n ans += 1\nprint(ans)", "from math import sqrt\r\n\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n x, y, r1 = map(int, input().split())\r\n if sqrt(x ** 2 + y ** 2) - r1 >= r - d and sqrt(x ** 2 + y ** 2) + r1 <= r:\r\n ans += 1\r\nprint(ans) ", "\"\"\"\nhttps://codeforces.com/problemset/problem/842/B\n\"\"\"\nrayon, crust = [int(x) for x in input().split()]\nsau = int(input())\nnombre = 0\nfor _ in range(sau):\n x, y, r = [int(x) for x in input().split()]\n a = (x ** 2 + y ** 2) ** (1 / 2)\n if a + r <= rayon and a - r >= rayon - crust:\n nombre += 1\n\nprint(nombre)\n", "from math import sqrt\n\ndef main():\n \n r, d = list(map(int, input().split()))\n pieces = 0\n for _ in range (int(input())):\n \n x, y, r_s = list(map(int, input().split()))\n \n if d >= 2*r_s:\n if (r-d)**2 <= x**2 + y**2 <= r**2:\n if r - r_s >= sqrt(x**2 + y**2) >= r - d + r_s:\n pieces += 1\n \n print(pieces)\n\nif __name__ == '__main__':\n main()\n\t \t \t\t\t\t \t \t \t \t\t", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[r, d] = list(map(int, input().split()))\r\nn = int(input())\r\n\r\nr_in = r-d\r\nr_out = r\r\nres = 0\r\nfor i in range(n):\r\n [x, y, rs] = list(map(int, input().split()))\r\n dist_sq = x*x+y*y\r\n if dist_sq >= (r_in+rs)*(r_in+rs) and dist_sq <= (r_out-rs)*(r_out-rs):\r\n res += 1\r\nprint(res)\r\n", "from math import sqrt\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nan = 0\r\nfor i in range(n):\r\n x, y, ri = map(int, input().split())\r\n d1 = (x ** 2 + y ** 2) ** 0.5\r\n if d1 >= ri + r - d and d1 + ri <= r:\r\n an += 1\r\nprint(an)\r\n", "from sys import stdin, stdout \r\nfrom math import sqrt\r\n\r\ndef main():\r\n rayon, croute = map(int, stdin.readline().split())\r\n nbSaus = int(stdin.readline())\r\n diff = rayon-croute\r\n total = 0\r\n for _ in range(nbSaus):\r\n x, y, r = map(int, stdin.readline().split())\r\n dist = sqrt(x**2+y**2)\r\n distMin = dist-r\r\n distMax = dist+r \r\n if distMin>=diff and distMax>=diff and distMin<=rayon and distMax<=rayon:\r\n total+=1\r\n \r\n \r\n stdout.write(str(total)) \r\n \r\nmain()", "from math import *\r\n\r\nr, d = map(int, input().split())\r\n\r\nn = int(input())\r\n\r\nansw = 0\r\n\r\nfor i in range(n):\r\n x, y, rp = map(int, input().split())\r\n\r\n if sqrt(x**2 + y**2) - rp >= r-d and sqrt(x**2 + y**2) + rp <= r:\r\n answ += 1\r\n\r\nprint(answ)", "import math\nr, d = [int(i) for i in input().split()]\nn = int(input())\ndef process(r, d, x, y, ri):\n center = math.sqrt(x ** 2 + y ** 2)\n return center - ri >= r - d and center + ri <= r\ncounter = 0\nfor i in range(n):\n x, y, ri = [int(i) for i in input().split()]\n if process(r, d, x, y, ri):\n counter += 1\nprint(counter)", "from math import sqrt\r\nr,d= map(int,input().split())\r\nn = int(input())\r\ncrust = r-d\r\ncounter = 0\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n dis = sqrt((a[0])**2+(a[1])**2)\r\n if dis >=crust+a[2] and dis+a[2]<=r :\r\n counter+=1\r\nprint(counter)", "def distance(x,y):\r\n return (x**2+y**2)**(0.5)\r\n\r\nr,d=map(int,input().split())\r\ncount=0\r\nfor i in range(int(input())):\r\n x,y,ri=map(int,input().split())\r\n dis=distance(x,y)\r\n if dis-ri>=r-d and dis+ri<=r and distance(x,y)>=r-d:\r\n count+=1\r\nprint(count)\r\n ", "from math import sqrt\r\n\r\ndef dist(x1, y1):\r\n return sqrt(x1*x1 + y1*y1)\r\n\r\n\r\n\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nres = 0\r\nfor i in range(n):\r\n x, y, i = map(int, input().split())\r\n if((dist(x, y) - i) >= (r - d)) and ((dist(x, y) + i) <= r):\r\n res+=1\r\nprint(res)\r\n", "#842B\r\nfrom math import sqrt\r\n[r,d] = list(map(int,input().split()))\r\ns = 0\r\nn = int(input())\r\nfor i in range(n):\r\n [x,y,R] = list(map(int,input().split()))\r\n if (sqrt(x**2+y**2)-R >= r-d) and (sqrt(x**2+y**2)+R <= r):\r\n s+=1\r\nprint(s)", "r, d = map(int, input().split())\r\ndef c(xi, yi, ri):\r\n r2 = xi ** 2 + yi ** 2\r\n return r2 >= (r + ri - d) ** 2 and r2 <= (r - ri) ** 2\r\nprint(sum(c(*map(int, input().split())) for i in range(int(input()))))", "r1, d1 = map(int, input().split())\r\nn = int(input())\r\nsum = 0\r\nfor i in range(n):\r\n\tx, y, r = map(int, input().split())\r\n\tR = (x ** 2 + y ** 2) ** 0.5\r\n\tif(R - r >= r1 - d1 and R + r <= r1):\r\n\t\tsum += 1\r\nprint(sum)", "import math\r\nx = input()\r\nx = x.split(\" \")\r\nr = int(x[0])\r\nd = int(x[1])\r\nn = int(input())\r\nresult = 0\r\nfor i in range(n):\r\n x = input()\r\n x = x.split(\" \")\r\n y = int(x[1])\r\n sr = int(x[2])\r\n x = int(x[0])\r\n odleglosc = math.sqrt(x*x+y*y)\r\n if odleglosc >= (r-d):\r\n if odleglosc <= r:\r\n if odleglosc-sr >= r-d:\r\n if odleglosc+sr <= r:\r\n# print(odleglosc)\r\n result += 1\r\n\r\n\r\nprint(result)", "import math\r\nr,d = map(int,input().split())\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n\tx,y,rad = map(int,input().split())\r\n\ts = math.sqrt(x**2+y**2)\r\n\tif(r-d+rad<=s<=r-rad):\r\n\t\tans+=1\r\nprint(ans)", "cnt=0\r\nr,d=map(int,input().split())\r\nn=int(input())\r\nfor i in range(n):\r\n x,y,r1=map(int,input().split())\r\n if (x*x+y*y)**0.5-r1>=r-d and (x*x+y*y)**0.5+r1<=r:\r\n cnt+=1\r\nprint(cnt)", "X, Sum = list(map(int, input().split())), 0\r\nfor i in range(int(input())):\r\n Temp = list(map(int, input().split()))\r\n First = Temp[0] ** 2 + Temp[1] ** 2\r\n if First in range((X[0] - X[1] + Temp[-1]) ** 2, (X[0] - Temp[-1]) ** 2 + 1):\r\n Sum += 1\r\nprint(Sum)\r\n", "r,d=map(int,input().split())\r\nn=int(input())\r\nans=0\r\nfor i in range(n):\r\n x,y,z=map(int,input().split())\r\n rr=0.7\r\n rr=(x**2+y**2)**(1/2.0)\r\n if (rr-z)>=r-d and rr+z<=r:\r\n ans=ans+1\r\nprint(ans)\r\n", "r,d=list(map(int,input().split()))\r\nn=int(input())\r\na=[]\r\nb=[]\r\nfor _ in range(n):\r\n x,y,z=list(map(int,input().split()))\r\n m=(x**2+y**2)**0.5\r\n a.append(m-z)\r\n b.append(m+z)\r\ny=0\r\nfor i in range(n):\r\n if a[i]>=(r-d) and b[i]<=r:\r\n y+=1\r\nprint(y)", "import math\r\nr_pizza,d = map(int,input().split())\r\nn = int(input())\r\ncount=0\r\nfor i in range(n):\r\n\tx,y,r = map(int,input().split())\r\n\tdistance = math.sqrt(x*x+y*y)\r\n\tif distance-r>=r_pizza-d and distance+r<=r_pizza:\r\n\t\tcount+=1\r\n\r\nprint(count)", "r, d = map(int, input().split())\r\nn = int(input())\r\n\r\nans = 0\r\nfor _ in range(n):\r\n x, y, ri = map(int, input().split())\r\n if ((r - d + ri) ** 2 <= x ** 2 + y ** 2) and (\r\n (r - ri) >= 0 and (x ** 2 + y ** 2) <= (r - ri) ** 2):\r\n ans += 1\r\n\r\nprint(ans)\r\n", "def dist(i,j):\r\n return (i**2+j**2)**.5\r\n\r\nr,d=map(int,input().split())\r\ncount=0\r\nfor i in range(int(input())):\r\n x,y,r1=map(int,input().split())\r\n d1=dist(x,y)\r\n if d1+r1<=r and r-d<=d1-r1:\r\n count+=1\r\nprint(count)", "R_D = list(map(int, input().split()))\nR = R_D[0]\nD = R_D[1]\n\nn = int(input())\ncount = 0\nfor i in range(n):\n x_y_r = list(map(int, input().split()))\n x = x_y_r[0]\n y = x_y_r[1]\n r = x_y_r[2]\n sausage_dist = (x**2 + y**2)**0.5\n\n if sausage_dist >= (R-D+r) and sausage_dist <= R-r:\n count += 1\n\nprint(count)", "import math\r\n\r\ndef dist(x,y):\r\n return math.sqrt(x*x+y*y)\r\n\r\ndef lol(x,y,c):\r\n z = dist(x,y)\r\n if z-c>=low and z+c<=high:\r\n return 1\r\n return 0\r\n\r\nr,d = map(int,input().split())\r\nlow = r-d\r\nhigh = r\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n x,y,c = map(int,input().split())\r\n if lol(x,y,c):\r\n ans+=1\r\n\r\nprint(ans)", "class Salami:\r\n\tdef __init__(self, x, y, r):\r\n\t\tself.x, self.y, self.r = x, y, r\r\n\r\nr, d = map(int, input().split())\r\nR = r - d;\r\nn = int(input())\r\nsalamis = [None] * n \r\nfor i in range(n):\r\n\tx, y, z = map(int, input().split())\r\n\tsalamis[i] = Salami(x, y, z)\r\n\r\nans = 0\r\n\r\ndef ro(x, y):\r\n\treturn (x ** 2 + y ** 2) ** (1/2)\r\n\r\nfor s in salamis:\r\n\tif (ro(s.x, s.y) < s.r + R):\r\n\t\tcontinue\r\n\tif (ro(s.x, s.y) + min(r, s.r) <= max(s.r, r)):\r\n\t\tans += 1\r\n\r\nprint(ans)", "import math\r\n\r\n\r\ndef distance(x1: int, y1: int, x2: int, y2: int) -> float:\r\n return math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\r\n\r\n\r\ndef solve_case(r: int, w: int, n: int, xi: int, yi: int, ri: int) -> bool:\r\n d = distance(0, 0, xi, yi)\r\n sausage_in_cheese = d < (r - w + ri)\r\n sausage_in_pizza = r >= (d + ri)\r\n return not sausage_in_cheese and sausage_in_pizza\r\n\r\n\r\nr, w = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\n\r\nfor _ in range(n):\r\n xi, yi, ri = map(int, input().split())\r\n ans += solve_case(r, w, n, xi, yi, ri)\r\n\r\nprint(ans)\r\n", "r, d = list(map(int, input().split()))\r\nn = int(input())\r\nres = 0\r\nfor _ in range(n):\r\n x, y, ri = list(map(int, input().split()))\r\n res += ((r-d+ri)**2 <= x*x+y*y <= (r-ri)**2)\r\nprint(res)", "R, d = list(map(int, input().split()))\r\nn = int(input())\r\nt = 0\r\nfor _ in range(n):\r\n x, y, r = list(map(int, input().split()))\r\n if (R - d) * (R - d) <= x * x + y * y <= R * R:\r\n l = (x * x + y * y) ** 0.5\r\n if r <= min(R - l, l - R + d):\r\n t += 1\r\nprint(t)", "r, d = map(int, input().split())\r\nr -= d\r\nn = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n x, y, rd = map(int, input().split())\r\n s = (x * x + y * y)**0.5\r\n if s - r >= rd and r + d >= s + rd:\r\n count += 1\r\nprint(count)\r\n \r\n", "import math\n\ndef main():\n R, D = [int(i) for i in input().split()]\n N = int(input())\n qtd = 0\n for n in range(N):\n x, y, r = [int(i) for i in input().split()]\n k = math.sqrt(x*x + y*y)\n if k - r >= R - D and k + r <= R:\n qtd+=1\n print(qtd)\n\n\nmain()\n\n# 1505960443810\n", "R, d = map(int, input().split())\nn = int(input())\ncnt = 0\nfor _ in range(n):\n x, y, r = map(int, input().split())\n s = (x**2 + y**2)**(1/2)\n if s + r <= R and s - r >= R - d:\n cnt += 1\nprint(cnt)\n\n\n", "import math\r\nR, D = map(int, input().split(' '))\r\nn = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n x, y, r = map(int, input().split(' '))\r\n ds = math.sqrt(x * x + y * y)\r\n if ds - r >= R - D and ds + r <= R:\r\n count += 1\r\nprint(count)\r\n", "r, d=map(int, input().split(' '))\r\nn = int(input())\r\noutput = 0\r\nfor i in range(n):\r\n x, y, r1 = map(int, input().split(' '))\r\n if ((x**2 + y**2)**.5+r1)<=r and ((x**2 + y**2)**.5-r1)>=r-d:\r\n output += 1\r\n\r\nprint(output)", "r, d = map(int, input().strip().split())\nc = 0\nlow_lim = r-d\nup_lim = r\nfor i in range(int(input().strip())):\n\tx, y, ri = map(int, input().strip().split())\n\torig_d = (x**2+y**2)**.5\n\tif orig_d-ri >= low_lim and orig_d+ri <= up_lim:\n\t\tc += 1\nprint(c)\n", "import math\n\nr = 0\nd = 0\n\ndef is_sausage_in_crust(x, y, ra):\n x = math.fabs(x)\n y = math.fabs(y)\n ra = math.fabs(ra)\n t = math.sqrt(x**2+y**2)\n return float(r-d) <= (t - ra) and float(r) >= t+ra\n\ndef main():\n global r, d\n\n l = input().split(\" \")\n r = math.fabs(int(l[0]))\n d = math.fabs(int(l[1]))\n\n count = 0\n n = int(input())\n for i in range(0, n):\n l = input().split(\" \")\n if is_sausage_in_crust(int(l[0]), int(l[1]), int(l[2])):\n count += 1\n\n print(count)\n\nif __name__ == \"__main__\":\n main()", "import math\r\nr,d = input().split()\r\nr,d = float(r), float(d)\r\nn = int(input())\r\nans=0\r\nfor i in range(n):\r\n x,y,r1=input().split()\r\n x,y,r1=float(x), float(y), float(r1)\r\n distance = float(math.sqrt(x*x + y*y))\r\n if (distance-r1 >= r-d) and (distance+r1 <= r):\r\n ans+=1\r\nprint(ans)", "import sys\r\nr, d = map(int, input().split())\r\nn = int(input())\r\ndef func(a, b):\r\n return (a ** 2 + b ** 2) ** 0.5\r\ncounter = 0\r\nfor i in range(n):\r\n xi, yi, ri = map(int, input().split())\r\n distance = func(xi, yi)\r\n if distance - ri < r - d or distance + ri > r:\r\n continue\r\n else:\r\n counter += 1\r\nprint(counter)\r\n", "import math\n\nr, d = [int(x) for x in input().split()]\nn = int(input())\nans = 0\n\nfor _ in range(n):\n\txi, yi, ri = [int(x) for x in input().split()]\n\tpiecedistance = math.hypot(xi, yi)\n\t\n\tif ( (((piecedistance-ri) >= (r-d)) and ((piecedistance+ri) <= (r))) ):\n\t\tans += 1\n\t\t\nprint(ans)\n\n \t\t \t\t \t \t\t \t\t \t \t \t \t\t \t", "def dist2(pos):\r\n\treturn pos[0]**2 + pos[1]**2\r\n\r\ndef caught(d, rsausage, rpizza, pos):\r\n\tif d < 2*rsausage:\r\n\t\treturn False\r\n\tmind = rpizza-d+rsausage\r\n\tmaxd = rpizza-rsausage\r\n\tdis = dist2(pos)\r\n\treturn mind**2 <= dis and dis <= maxd**2\r\n\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nfor __ in range(n):\r\n\tx, y, ri = map(int, input().split())\r\n\tif caught(d, ri, r, (x, y)):\r\n\t\tans += 1\r\n\r\nprint(ans)\r\n\r\n", "r,d = map(int, input().split())\r\nn = int(input())\r\ns = 0\r\nfor i in range(n):\r\n x, y, l = map(int, input().split())\r\n if x**2+y**2 >=(r-d+l)**2 and x**2+y**2 <=(r-l)**2:\r\n s+=1\r\nprint(s)\r\n \r\n\r\n\r\n", "ip = input()\r\nipList = ip.split(\" \")\r\nrad = int(ipList[0])\r\nd = int(ipList[1])\r\n\r\nn = int(input())\r\n\r\nx = []\r\ny = []\r\nr = []\r\n\r\nfor _ in range(n):\r\n xi, yi, ri = list(map(int, input().split(\" \"))) #Or you can take the inputs like you do with 3 steps\r\n x.append(xi)\r\n y.append(yi)\r\n r.append(ri)\r\n\r\np = rad - (0.5*d)\r\nm = 0\r\nhd = d/2\r\n\r\nfor j in range(n):\r\n if r[j] + abs(p - (x[j]**2 + y[j]**2)**0.5) <= d/2:\r\n m=m+1\r\n\r\nprint(m)", "def isInter(x1, y1, r1, x2, y2, r2):\r\n r = ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\r\n if r < r1 + r2 and r > abs(r1 - r2):\r\n return True\r\n return False\r\n\r\n\r\ndef di(x1, y1, x2, y2):\r\n return ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\r\n\r\n\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n xi, yi, ri = map(int, input().split())\r\n if di(0, 0, xi, yi) >= abs((r - d) + ri) and di(0, 0, xi, yi) <= abs(ri - r):\r\n ans += 1\r\nprint(ans)\r\n", "r, d = map(int, input().split())\r\nres = 0\r\nfor i in range(int(input())):\r\n a, b, c = map(int, input().split())\r\n x = (a**2 + b**2)**0.5\r\n if x + c <= r and x -c >= r - d:\r\n res += 1\r\nprint(res)\r\n", "import math \r\ndef calc(x1,y1,x2,y2): \r\n dist = math.sqrt((x2 - x1)**2 + (y2 - y1)**2) \r\n return dist \r\nr,d=map(int,input().split())\r\nr1=r-d\r\nans=0\r\nn=int(input())\r\nfor i in range(n):\r\n x,y,r2=map(int,input().split())\r\n dist=calc(0,0,x,y)\r\n if dist>=r1+r2 and dist<=r-r2:\r\n ans+=1\r\nprint(ans)", "import math\r\nr, d = map(int, input().split())\r\nresult = 0\r\nfor i in range(int(input())):\r\n x, y, ri = map(int, input().split())\r\n dist = math.sqrt(x**2+y**2)\r\n if r - d <= dist-ri and dist+ri <= r:\r\n result += 1\r\n\r\nprint(result)", "from math import sqrt\r\ndist = lambda p: sqrt(sum([d*d for d in p]))\r\ninCrust = lambda l,r,rl,rr: (l-r)>=rl and (l+r)<=rr\r\nrr,d = list(map(int,input().split())) #500\r\nxyrl = [list(map(int,input().split())) for _ in range(int(input()))]\r\nprint(sum([inCrust(dist(xyr[:2]),xyr[2],rr-d,rr) for xyr in xyrl]))\r\n", "r, d = map(int, input().split())\nn = int(input())\n\nr\nc = 0\nfor _ in range(n):\n x, y, nr = map(int, input().split())\n nd = ((x ** 2 + y ** 2) ** 0.5)\n if r - d <= nd - nr <= nd + nr <= r:\n c += 1\nprint(c)", "radius,crust=[int(x) for x in input().split()]\r\ncases=int(input())\r\ncounter=0\r\nfor i in range(cases):\r\n\tx,y,r=[int(x) for x in input().split()]\r\n\tif (x**2+y**2)**(1/2)+r<=radius:\r\n\t\tif (x**2+y**2)**(1/2)>=radius-crust+r:\r\n\t\t\tcounter+=1\r\nprint(counter)\r\n\t", "r,d = list(map(int, input().split()))\r\nn = int(input())\r\nres = 0\r\nfor i in range(n):\r\n x,y,f = list(map(int,input().split()))\r\n res+=((r-d+f)**2<=x**2+y**2<=(r-f)**2)\r\nprint(res)", "r, d = map(int,input().split())\nn=int(input())\n\nans = 0\nfor _ in range(n):\n x, y, w = map(int,input().split())\n e = (x**2 + y**2) ** 0.5\n if e - w >= r - d and e + w <= r:\n ans += 1\n\nprint(ans)\n\t\t\t \t\t \t \t \t \t\t\t \t", "r,d=map(int,input().split())\r\nn=int(input())\r\ns=0\r\nfor _ in[0]*n:\r\n x,y,z=map(int,input().split())\r\n if z>r:continue\r\n w=x*x+y*y\r\n s+=(r-z)**2>=w>=(r-d+z)**2\r\nprint(s)", "from math import sqrt\r\nr,d=[int(i) for i in input().split()]\r\ninnerr=r-d\r\nn=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a,b,c=[int(j) for j in input().split()]\r\n min1=innerr+c\r\n max1=r-c\r\n if (min1<=sqrt((a**2)+ (b**2))<=max1):\r\n count+=1\r\nprint (count)", "R = lambda:list(map(int,input().split()))\nr,d = R()\ndef ok():\n xi,yi,ri = R()\n return 1 if (r-d+ri)**2 <= xi**2 + yi**2 <=(r-ri)**2 else 0\nprint(sum(ok() for i in range(int(input()))))\n \t\t \t \t \t \t\t \t\t \t \t \t\t", "# بســـــم الله الرحمن الرحيم\r\nimport math\r\ndef euclidean_distance(p1, p2):\r\n return math.sqrt( ((p2[0]-p1[0])**2) + ((p2[1]-p1[1])**2) )\r\n\r\ndef main():\r\n r, d = [int(i) for i in input().split()]\r\n in_r = r - d\r\n ORIGIN = (0, 0)\r\n n = int(input())\r\n sausages = [(0, 0, 0)]*n\r\n for i in range(n):\r\n x, y, _r = [int(i) for i in input().split()]\r\n sausages[i] = (x, y, _r)\r\n\r\n\r\n\r\n counts = 0\r\n for piece in sausages:\r\n if euclidean_distance(ORIGIN, (piece[0], piece[1])) + piece[2] <= r:\r\n if euclidean_distance(ORIGIN, (piece[0], piece[1])) - piece[2] >= in_r:\r\n counts += 1\r\n print(counts)\r\n\r\nif __name__=='__main__':\r\n main()", "import math\r\nr,d = map(int,input().split())\r\nn = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n x,y,ri = map(int,input().split())\r\n x,y,ri = abs(x),abs(y),abs(ri)\r\n least = math.sqrt(x*x+y*y)-ri\r\n greatest = math.sqrt(x*x+y*y)+ri\r\n if(least >= r-d and greatest <= r):\r\n count+=1\r\nprint(count)\r\n", "from math import sqrt\nr, d = map(int, input().split())\nn = int(input())\nans = 0\nfor i in range(n):\n x_i, y_i, r_i = map(int, input().split())\n calc = sqrt((x_i*x_i) + (y_i*y_i))\n if calc >= r-d+r_i and calc + r_i <= r:\n ans += 1\nprint(ans)\n\n \t\t \t\t\t \t \t \t \t\t\t \t \t\t\t \t", "import math\r\nr,d=list(map(int,input().split()))\r\nn=int(input())\r\nt=0\r\nfor _ in range(n):\r\n x,y,rr=list(map(int,input().split()))\r\n z=math.sqrt((x**2)+(y**2))\r\n if z-rr>=r-d and z+rr<=r:\r\n t+=1\r\nprint(t)", "r, d = map(int, input().split())\r\nn = int(input())\r\nrs = 0\r\nfor i in range(n):\r\n x, y, rr = map(int, input().split())\r\n if (rr + r - d) ** 2 <= x*x + y*y and (r - rr) ** 2 >= x*x + y*y:\r\n rs += 1 \r\nprint(rs)", "r, d = list(map(int, input().split()))\r\nres = 0\r\nfor _ in range(int(input())):\r\n x, y, ri = list(map(int, input().split()))\r\n res += ((r-d+ri)**2 <= x**2+y**2 <= (r-ri)**2)\r\nprint(res)", "# your code goes here\r\nimport math\r\narr = input().split()\r\nr = int(arr[0])\r\nd = int(arr[1])\r\n\r\nn = int(input())\r\nctr = 0\r\nfor i in range(n):\r\n\tarr = input().split()\r\n\tx = int(arr[0])\r\n\ty = int(arr[1])\r\n\tz = int(arr[2])\r\n\t\r\n\tx = abs(x)\r\n\ty = abs(y)\r\n\t\r\n\tl = math.sqrt(x*x + y*y)\r\n\tl -= z\r\n\tm = l + z + z\r\n\tif l >= r-d and m <= r:\r\n\t\tctr += 1\r\nprint(str(ctr))", "r, d = [int(x) for x in input().split()]\r\nn = int(input())\r\nnum = 0\r\nfor i in range(n):\r\n xi, yi, ri = [int(x) for x in input().split()]\r\n s = xi * xi + yi * yi\r\n a = (r - d + ri) ** 2\r\n b = (r - ri) ** 2\r\n if a <= s and s <= b:\r\n num += 1\r\nprint(num)\r\n", "from math import sqrt\r\nr, d = map(int, input().split())\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n\tx, y, ri = map(int,input().split())\r\n\tn_dist = sqrt(x**2+y**2) - ri\r\n\tf_dist = n_dist + 2*ri\r\n\tif n_dist>=r-d and f_dist<=r:\r\n\t\tans+=1\r\nprint(ans)" ]

[ "\na = int(input())\ns = input()\n\nb = {'A':0, 'I':0, 'F':0}\n\n\nfor i in s:\n b[i] += 1\nif b['I'] > 1:\n print(0)\nelif b['I'] == 1:\n print(1)\nelse:\n print(b['A'])\n\t\n", "def main():\n n = int(input())\n cows = input()\n \n i_cont = cows.count(\"I\")\n\n if i_cont == 0:\n cont = 0\n for i in range(n-1, -1, -1):\n if cows[i] == 'A':\n cont += 1\n print(cont)\n \n elif i_cont == 1:\n print(1)\n \n else: \n print(0)\nmain()\n\t\t \t\t \t\t\t\t\t\t\t\t\t \t\t \t\t \t\t", "#!/bin/python \n# -*- coding: utf-8 -*-\n\nn = int(input())\ns = input()\nprint(int(s.count('I') == 1) if 'I' in s else s.count('A'))\n", "n = int(input())\r\ns = input()\r\nd = {\"A\": 0, \"I\": 0, \"F\": 0}\r\nfor i in s:\r\n if i == \"A\":\r\n d[i] = d[i] + 1\r\n if i == \"I\":\r\n d[i] = d[i] + 1\r\n if i == \"F\":\r\n d[i] = d[i] + 1\r\nif d[\"I\"] == 0:\r\n print(d[\"A\"])\r\nelif d[\"I\"] == 1:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "n = int(input())\nx = input()\n\nif x.count('I') == 0:\n\tprint(n - x.count('F'))\nelif x.count('I') == 1:\n\tprint(1)\nelse:\n\tprint(0)\n", "n=int(input())\r\na=input()\r\nallin=0\r\nin1=0\r\nfold=0\r\nfor z in a:\r\n if z=='A':\r\n allin+=1\r\n elif z=='F':\r\n fold+=1\r\n else:\r\n in1+=1\r\nif in1>=2:\r\n print(0)\r\nelif in1==1:\r\n print(1)\r\nelse:\r\n print(allin)", "n = int(input())\r\nstrg = input()\r\n \r\ncount = 0\r\nfor i in range(len(strg)) :\r\n if ( strg[i] == 'I' ) :\r\n count += 1\r\n \r\nif count>1 :\r\n print(0)\r\nelif count == 1 :\r\n print(1)\r\nelse :\r\n count_A = 0 \r\n for j in range(len(strg)) :\r\n if ( strg[j] == 'A' ) :\r\n count_A += 1\r\n print(count_A)", "n = int(input())\r\nl = input()\r\nif l.count('I') == 1 : \r\n print(1) \r\nelif l.count(\"I\") >1: \r\n print(0)\r\nelse:\r\n print(l.count(\"A\"))", "n = int(input())\r\n\r\ndaf = list(input())\r\n\r\nif daf.count('I') == 0:\r\n print(daf.count('A'))\r\nelif daf.count('I') > 1:\r\n print(0)\r\nelse:\r\n print(1)\r\n", "n=int(input())\r\ns=input()\r\nf=s.count(\"F\")\r\nA=s.count(\"A\")\r\nI=s.count(\"I\")\r\nif I==0 :\r\n print(A)\r\nelif I==1 :\r\n print(1)\r\nelse :\r\n print(0)", "from collections import Counter\r\nt = int(input())\r\narr= list(input())\r\n\r\nc = Counter(arr)\r\nif c['I']==0:\r\n res = c['A']\r\nelif c['I']==1:\r\n res = 1\r\nelse:\r\n res = 0\r\nprint(res)\r\n", "#284B (78No. Problem B)\r\nn = int(input())\r\ns = input()\r\na = s.count('A')\r\nf = s.count('F')\r\ni = s.count('I')\r\nc = 0\r\nif i == 0:\r\n c = a \r\nelif i == 1:\r\n c = i \r\n# print(a,f,i)\r\nprint(c)", "from collections import Counter, defaultdict\r\n\r\nBS=\"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ndef to_base(s, b):\r\n res = \"\"\r\n while s:\r\n res+=BS[s%b]\r\n s//= b\r\n return res[::-1] or \"0\"\r\nalpha = \"abcdefghijklmnopqrstuvwxyz\"\r\nfrom math import floor, ceil,pi\r\n\r\ntot = 0\r\n\r\nn = int(input())\r\ns = list(input())\r\n\r\nc = Counter(s)\r\n\r\nfor i in s:\r\n if i==\"F\":\r\n continue\r\n else:\r\n c[i] -= 1\r\n if c[\"I\"]==0:\r\n tot += 1\r\n c[i] += 1\r\nprint(tot)", "n=int(input())\r\ns=input()\r\na,f,i=0,0,0\r\nfor j in s:\r\n if j=='A':\r\n a+=1\r\n elif j=='F':\r\n f+=1\r\n else:\r\n i+=1\r\nif i==0:\r\n print(a)\r\nelif i==1:\r\n print(1)\r\nelse:\r\n print(0)", "from collections import Counter\n\nn = int(input())\ncows = Counter(input())\n\nif cows['I'] == 1:\n print(1)\nelse:\n print(0 if cows['I'] > 1 else cows['A'])\n\t\t \t\t \t\t\t\t \t \t\t\t\t \t \t \t\t\t\t \t", "# your code goes here\r\nn = int(input())\r\nplayers = input()\r\nshow_players = 0\r\n\r\n\r\nindex = players.find('I')\r\nindex2 = players[index + 1:].find('I')\r\n\r\nif index2 == -1:\r\n\tif index == -1:\r\n\t\tprint(players.count('A'))\r\n\telse:\r\n\t\tprint(1)\r\nelse:\r\n\tprint(0)\r\n\t", "input()\r\na=input()\r\nif a.count('I')==1:\r\n\tprint(1)\r\nelif 'I' not in a:\r\n\tprint(a.count('A'))\r\nelse:\r\n\tprint(0)", "from collections import Counter\r\n\r\nn = int(input())\r\n\r\ns = input()\r\n\r\nc = Counter(s)\r\n\r\nres = 0\r\nfor i in s:\r\n c[i] -= 1\r\n if i in 'AI':\r\n if c['I'] == 0:\r\n res += 1\r\n c[i] += 1\r\n \r\nprint(res)\r\n\r\n", "n = int(input())\r\ns=input()\r\na = s.count('A')\r\nf = s.count('F')\r\ni = s.count('I')\r\nif(i>0 and i==1):\r\n print(1)\r\nelif(i==0 and a>0):\r\n print(a)\r\nelse:\r\n print(0)", "n=int(input())\r\ns=input()\r\nz=s.count('I')\r\nif z>1:\r\n print(0)\r\nelif z==1:\r\n print(1)\r\nelse:\r\n print(s.count('A'))\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn = int(input())\r\ns = input()\r\nans = 0\r\nii = s.count(\"I\")\r\naa = s.count(\"A\")\r\nif ii > 1:\r\n print(0)\r\n exit()\r\nelif ii == 0:\r\n print(aa)\r\nelse:\r\n print(1)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nc=input()\r\nif c.count('I')==0:\r\n\tprint(c.count('A'))\r\nelif c.count('I')==1:\r\n\tprint(1)\r\nelse:\r\n\tprint(0)\r\n\t\r\n", "n=int(input())\ns=input()\nic=s.count('I')\nprint(1 if ic==1 else 0 if ic>1 else s.count('A'))\n", "from collections import Counter\r\ndef coolFunc(a):\r\n j = Counter(a)\r\n if 'I' in j:\r\n if j['I']>1:\r\n return 0\r\n else: \r\n return 1\r\n return j['A'] \r\ninput()\r\nprint(coolFunc(input()))", "n = int(input())\nent = input()\na = 0\nf = 0\ni = 0\n\nfor _ in range (0, len(ent)):\n if ent[_] == \"A\":\n a+= 1\n elif ent[_] == \"F\":\n f += 1\n elif ent[_] == \"I\":\n i += 1\n\nif i == 0:\n print(a)\nelse:\n if i >= 2:\n print(\"0\")\n else:\n print(\"1\")\n\t\t \t \t\t \t\t \t \t \t \t\t\t\t \t\t \t", "n = int(input())\r\ns = str(input())\r\nin_cnt = 0\r\nall_cnt = 0\r\n\r\nfor i in s:\r\n if i == \"A\":\r\n all_cnt += 1\r\n elif i == \"I\":\r\n in_cnt += 1\r\n\r\nif in_cnt == 0 and all_cnt > 0:\r\n print(all_cnt)\r\nelif in_cnt == 1:\r\n print(1)\r\nelse:\r\n print(0)", "n = int(input())\r\ns = input()\r\n\r\nallin = s.count(\"A\")\r\nin_count = s.count(\"I\")\r\nfolded_count = n - allin - in_count\r\n\r\nif in_count == 1:\r\n print(1)\r\nelif folded_count == n or in_count == 0:\r\n print(allin + in_count)\r\nelse:\r\n print(0)\r\n", "n=int(input())\r\ns=input()\r\na=0\r\nf=0\r\nj=0\r\nfor i in s:\r\n if(i==\"A\"):\r\n a=a+1\r\n elif(i==\"F\"):\r\n f=f+1\r\n else:\r\n j=j+1\r\nz=0\r\nif(a!=0 and j==0):\r\n z=z+a\r\nif(j==1):\r\n z=z+j\r\nprint(z)", "n=int(input());s=input()\r\na=s.count('A');b=s.count('I')\r\nprint([a,[1,0][b!=1]][b!=0])", "n = int(input())\n\ns = input()\n\nd = {\"A\": 0, \"F\": 0, \"I\": 0}\n\nfor c in s:\n d[c] += 1\n\nif d[\"I\"] == 0:\n print(d[\"A\"])\nelif d[\"I\"] > 1:\n print(0)\nelse:\n print(1)\n\t \t \t \t \t\t\t \t\t\t \t \t", "# python3\r\nimport sys, threading, os.path\r\nimport string\r\nimport collections, heapq, math, bisect\r\n\r\nsys.setrecursionlimit(10 ** 6)\r\nthreading.stack_size(2 ** 27)\r\n\r\n\r\ndef main():\r\n if os.path.exists('in.txt'):\r\n input = open('in.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n # --------------------------------INPUT---------------------------------\r\n n = int(input.readline())\r\n st = list(str(input.readline().rstrip('\\n')))\r\n\r\n dict = {}\r\n\r\n for x in st:\r\n if x in dict:\r\n dict[x] += 1\r\n else:\r\n dict[x] = 1\r\n\r\n result = 0\r\n\r\n if 'I' in dict:\r\n if dict['I'] == 1:\r\n result = 1\r\n else:\r\n result = 0\r\n elif 'A' in dict:\r\n result = dict['A']\r\n else:\r\n result = 0\r\n\r\n output = result\r\n # -------------------------------OUTPUT----------------------------------\r\n if os.path.exists('out.txt'):\r\n open('out.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n# threading.Thread(target=main).start()\r\n", "n = int(input())\r\nplayer = input()\r\na = f = i = 0\r\nfor c in player:\r\n if c==\"A\":\r\n a += 1\r\n if c==\"F\":\r\n f += 1\r\n if c==\"I\":\r\n i += 1\r\nif i==0:\r\n print(a)\r\nelif i==1:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\ns = input()\r\n\r\nI = s.count(\"I\")\r\nif(I > 1):\r\n print(\"0\")\r\nelif(I == 1):\r\n print(\"1\")\r\nelse:\r\n print(s.count(\"A\"))\r\n \r\n", "n=int(input())\r\na=input()\r\nb=a.count('A')\r\nc=a.count('I')\r\nprint('0'if c>1 else (1,b)[c==0])\r\n", "S = int(input())\r\nA = input()\r\n\r\nAs = A.count('A')\r\nFs = A.count('F')\r\nIs = A.count('I')\r\n\r\nans = 0\r\n\r\nif Is > 1:\r\n print(ans)\r\n\r\nelse:\r\n ans += Is\r\n if Is == 0:\r\n ans += As\r\n print(ans)", "# LUOGU_RID: 127298288\ninput()\na=input()\nif a.count('I')==1:\n\tprint(1)\nelif 'I' not in a:\n\tprint(a.count('A'))\nelse:\n\tprint(0)", "n=int(input())\nm=input()\nif m.count('I')==1:\n\tprint(1)\nelif m.count('I')>1:\n\tprint(0)\nelse:\n\tprint(m.count('A'))", "#616A\r\n# a = input()\r\n# b = input()\r\n# a = a.lstrip(\"0\")\r\n# b = b.lstrip(\"0\")\r\n# a = int(a)\r\n# b = int(b)\r\n# # print(a,b)\r\n# if a>b:\r\n# print(\">\")\r\n# elif a<b:\r\n# print(\"<\")\r\n# else:\r\n# print(\"=\")\r\n\r\n#118A\r\n# vowels = ['a', 'e', 'i', 'o', 'u']\r\n# s = [i.lower() for i in input()]\r\n# result = []\r\n# for i in range(len(s)):\r\n# # s[i].lower()\r\n# if s[i] in vowels:\r\n# result.append(\"\")\r\n# else:\r\n# result.append(\".\")\r\n# result.append(s[i])\r\n# print(''.join(result))\r\n\r\n#1293B\r\n# n = int(input())\r\n# ans = sum([1.0 / i for i in range(1, n+1)])\r\n# print(ans)\r\n\r\n#761A\r\n# x,y = input().split()\r\n# x = int(x)\r\n# y = int(y)\r\n# if x==0 and y==0:\r\n# print(\"NO\")\r\n# elif abs(x-y) <= 1:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n#864A\r\n# n = int(input())\r\n# a = []\r\n# d = []\r\n# j = 0\r\n# for i in range(n):\r\n# k = int(input())\r\n# a.append(k)\r\n# if k not in d:\r\n# d.append(k)\r\n# j = j + 1\r\n# q = 0\r\n# w = 0\r\n# if j != 2:\r\n# print(\"NO\")\r\n# else:\r\n# z = d[0]\r\n# x = d[1]\r\n# for i in range(n):\r\n# if a[i] == z:\r\n# q = q + 1\r\n# if a[i] == x:\r\n# w = w + 1\r\n# if w != q:\r\n# print(\"NO\")\r\n# else:\r\n# print(\"YES\")\r\n# print(d[0], d[1])\r\n\r\n#616B\r\n# n, m = input().split()\r\n# n = int(n)\r\n# m = int(m)\r\n# arr = [[i for i in input().split()][:m] for y in range(n)]\r\n# max = -10\r\n# for i in range(n):\r\n# mini = min(arr[i])\r\n# if int(mini) > int(max):\r\n# max = mini\r\n# z = i\r\n# print(max)\r\n\r\n#284B\r\nn = int(input())\r\na = [i for i in input()][:n]\r\nj = 0\r\nna = 0\r\nni = 0\r\nnf = 0\r\nfor i in range(n):\r\n if a[i] == 'A':\r\n na = na + 1\r\n elif a[i] == 'I':\r\n ni = ni + 1\r\n else:\r\n nf = nf + 1\r\nfor i in range(n):\r\n if a[i] == 'A':\r\n if ni == 0:\r\n j = j + 1\r\n elif a[i] == 'I':\r\n if ni == 1:\r\n j = j + 1\r\n else:\r\n pass\r\nprint(j)", "from collections import Counter\n\n\ndef main():\n input()\n cnt = Counter(input())\n if not cnt['I']:\n print(cnt['A'])\n elif cnt['I'] == 1:\n print('1')\n else:\n print('0')\n\n\nif __name__ == '__main__':\n main()", "import sys\nf = sys.stdin\n#f = open(\"input.txt\", \"r\")\ndef solve():\n n = int(f.readline())\n b = f.readline()\n count = 0\n if b.count(\"I\") == 1:\n print(1)\n return\n elif b.count(\"I\") > 1:\n print(0)\n return\n else:\n b = b.replace(\"I\", \"\")\n print(b.count(\"A\"))\nsolve()", "n = int(input())\n\ns = input()\n\nif c:=s.count('I'):\n if c == 1:\n print(1)\n else:\n print(0)\n\nelse:\n print(s.count('A'))", "''' ░░█ ▄▀█ █   █▀ █░█ █▀█ █▀▀ █▀▀   █▀█ ▄▀█ █▀▄▀█ \r\n █▄█ █▀█ █   ▄█ █▀█ █▀▄ ██▄ ██▄   █▀▄ █▀█ █░▀░█ '''\r\n\r\n\r\n# [cf-284-b.py] => [21-07-2020 @ 19:02:12] \r\n# Author & Template by : Udit \"luctivud\" Gupta\r\n# https://www.linkedin.com/in/udit-gupta-1b7863135/\r\n\r\n\r\nimport math; from collections import *\r\nimport sys; from functools import reduce\r\nimport time; from itertools import groupby\r\n\r\n# sys.setrecursionlimit(10**6)\r\n\r\ndef input() : return sys.stdin.readline()\r\ndef get_ints() : return map(int, input().strip().split())\r\ndef get_list() : return list(get_ints())\r\ndef get_string() : return list(input().strip().split())\r\ndef printxsp(*args) : return print(*args, end=\"\")\r\ndef printsp(*args) : return print(*args, end=\" \")\r\n\r\n\r\nDIRECTIONS = [(+0, +1), (+0, -1), (+1, +0), (+1, -1)] \r\nNEIGHBOURS = [(-1, -1), (-1, +0), (-1, +1), (+0, -1),\\\r\n (+1, +1), (+1, +0), (+1, -1), (+0, +1)]\r\n\r\n\r\nCAPS_ALPHABETS = {chr(i+ord('A')) : i for i in range(26)}\r\nSMOL_ALPHABETS = {chr(i+ord('a')) : i for i in range(26)}\r\nINF = float('inf')\r\n\r\n\r\n# Custom input output is now piped through terminal commands.\r\n\r\n\r\nS34t = time.time()\r\n# for _testcases_ in range(int(input())): \r\ninput()\r\ns = input()\r\nd = Counter(s)\r\ni = d.get('I', 0)\r\nif i == 0:\r\n # print(d)\r\n print(d.get('A', 0))\r\nelif i == 1:\r\n print(1)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\nS34p = time.time()\r\n# print(\"Time Elapsed: {}\".format(float(S34p-S34t)))\r\n''' ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~\r\n SHREE RAM JAI RAM, JAI JAI RAM \r\n ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~'''\r\n", "n = int(input())\r\ns = input()\r\n\r\ntot = 0\r\ncurI = s.count('I')\r\ncurF = s.count('F')\r\ncurA = s.count('A')\r\nfor i in range(len(s)):\r\n if(s[i] == 'I'):\r\n if(curF + curA == len(s)-1):\r\n tot+=1\r\n if(s[i] == 'A'):\r\n if(curF + curA -1 == len(s)-1):\r\n tot+=1\r\nprint(tot)", "n=int(input())\r\ns=str(input())\r\nx=s.count(\"I\")\r\nif x>1:\r\n\tprint(0)\r\nelif x==1:\r\n\tprint(1)\r\nelse:\r\n\tprint(s.count(\"A\"))\r\n", "n = int(input())\r\ns = input()\r\na=s.count(\"I\")\r\nif a==1:\r\n print(1)\r\nelif a>1:\r\n print(0)\r\nelse:\r\n b=s.count(\"A\")\r\n print(b)", "from collections import Counter\ndef go():\n n = int(input())\n d = Counter()\n for c in input():\n d[c] += 1\n if d['I'] == 0: return d['A']\n elif d['I'] == 1: return 1\n else: return 0\n\nprint(go())\n", "\r\n\r\n\r\na = int(input())\r\n\r\n\r\nt = list(input())\r\n\r\n\r\n\r\n\r\nif t.count('I')==1:\r\n print(1)\r\nelif t.count('I')==0:\r\n print(a-t.count('F'))\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n\r\n", "input()\r\ns=input()\r\na=s.count('A')\r\ni=s.count('I')\r\nprint([a,[1,0][i!=1]][i!=0])", "from collections import Counter\r\n\r\nn = int(input())\r\ncows = input()\r\n\r\ncows = Counter(cows)\r\n\r\nif cows['I'] == 1:\r\n print(1)\r\nelse:\r\n if cows['I'] > 1:\r\n print(0)\r\n else:\r\n print(cows['A'])", "c=int(input())\ns=input()\np=[i for i in s]\na=p.count(\"A\")\ni=p.count(\"I\")\nf=p.count(\"F\")\nif i==0:\n print(a)\nelif i==1:\n print(i)\nelse:\n print(0)", "A = int(input())\r\nV = input()\r\nF=0\r\nA=0\r\nI=0\r\n\r\nfor i in range(len(V)):\r\n if V[i]=='F':\r\n F+=1\r\n elif V[i]=='A':\r\n A+=1\r\n else:\r\n I+=1\r\n\r\nif I>=2:\r\n print(0)\r\nelse:\r\n if I:\r\n print(1)\r\n else:\r\n if A:\r\n print(A)\r\n else:\r\n print(0)", "a=int(input())\r\nb=input()\r\nif b.count('I')==0:\r\n print(b.count('A'))\r\nelif b.count('I')==1:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "a=int(input())\r\nb=input()\r\nc=b.count(\"I\")\r\nif(c>1):\r\n print(0)\r\nelif(c==1):\r\n print(1)\r\nelse:\r\n print(b.count(\"A\"))", "N=int(input())\n\ns=input()\n\nx=s.count('I')\n\nif(x==0):\n print(s.count('A'))\nelif(x==1):\n print(1)\nelse:\n print(0)\n", "n = int(input())\r\ns = input()\r\n\r\nx = s.count(\"A\")\r\ny = s.count(\"F\")\r\nz = s.count(\"I\")\r\n\r\nif z > 1:\r\n print(0)\r\nelif z == 1:\r\n print(1)\r\nelse:\r\n print(x)", "n = int(input())\nword = list(input())\nallin = 0\njustin = 0\nfor i in range(n):\n if word[i] == 'I':\n justin += 1\n elif word[i] == 'A':\n allin += 1\nif justin == 0:\n print(allin)\nelif justin == 1:\n print(1)\nelse:\n print(0)\n\n\t \t\t \t\t\t \t\t \t\t\t\t\t \t \t", "from collections import Counter\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nc = Counter(s)\r\n\r\nif c['I'] > 1: print(0)\r\nelif c['I'] == 1: print(1)\r\nelse: print(c['A'])", "n = int(input())\na = input()\nop= 0\nI = a.count('I')\nA = a.count('A')\nF = a.count('F')\nfor i in range(n):\n if a[i] == 'I':\n if I == 1:\n op+=1\n if a[i] == 'A':\n if I == 0:\n op+=1\nprint(op)", "n = int(input())\r\nst = input()\r\na,i,f = st.count(\"A\"),st.count(\"I\"),st.count(\"F\")\r\n\r\nif i==1:\r\n print(1)\r\nelif i==0:\r\n print(a)\r\nelse:\r\n print(0)", "n=int(input())\r\na=input()\r\ncnt=0\r\nA=0\r\nfor i in range(0,n):\r\n if(a[i]=='I'): cnt+=1\r\n if(a[i]=='A'): A+=1\r\nif(cnt==0):\r\n print(A)\r\nelif(cnt==1):\r\n print(1)\r\nelse :print(0)\r\n", "from collections import Counter\r\ndef get_ans():\r\n n = input()\r\n c = Counter(input())\r\n a = c['A']\r\n f = c['F']\r\n i = c['I']\r\n if i != 0:\r\n if i != 1:\r\n return 0\r\n else:\r\n return 1\r\n\r\n if c['A'] != 0:\r\n return c['A']\r\n\r\n return 0\r\n\r\nans = get_ans()\r\nprint(ans)", "n = int(input())\ns = [char for char in input()]\n\ni = s.count('I')\na = s.count('A')\n\nif i > 0:\n if i > 1:\n print(0)\n else:\n print(1)\nelse:\n print(a)\n \t \t\t \t\t \t\t \t\t\t\t \t\t \t \t \t", "input()\r\ns = input()\r\nx = s.count('I')\r\n\r\nprint(0 if x>1 else s.count('A') if x<1 else 1)", "n = int(input())\ns = input()\nino = 0\nal = 0\nfor i in range(n):\n if s[i]=='A':\n al+=1\n elif s[i]=='I':\n ino+=1\nif ino == 1:\n print (1)\nelif ino > 1:\n print(0)\nelse:\n print(al)", "n = int(input())\r\narr = input()\r\nif arr.count('I') > 1:\r\n print(0)\r\nelif arr.count('I') == 1:\r\n print(1)\r\nelse:\r\n print(arr.count('A'))", "n = int(input())\r\ns = input()\r\ncount_I = 0\r\ncount_A = 0\r\nfor char in s:\r\n if char == 'I':\r\n count_I += 1\r\n elif char == 'A':\r\n count_A += 1\r\nif count_I > 1:\r\n print(0)\r\nelif count_I == 1:\r\n print(1)\r\nelse:\r\n print(count_A)", "n1 = input()\r\nn = int(n1)\r\nx = input()\r\na = x.count(\"A\")\r\nf = x.count(\"F\")\r\ni = x.count(\"I\")\r\nif i > 1:\r\n print(0)\r\nelif i == 1:\r\n if n >1:\r\n print(1)\r\n else:\r\n print(0)\r\nelse:\r\n print(a)", "from collections import defaultdict\r\n\r\nMyDict = defaultdict(int)\r\ninput()\r\nfor i in input():\r\n MyDict[i] += 1\r\nprint((0 if \"A\" not in MyDict.keys() else MyDict[\"A\"]) if \"I\" not in MyDict.keys() else (0 if MyDict[\"I\"] != 1 else 1))\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Here in Bojnurd\r\n# Caption: So Close man!! Take it easy!!!!\r\n# CodeNumber: 650\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nx = s.count('I')\r\nprint(1 if x == 1 else 0 if x > 1 else s.count('A'))", "n = int(input())\r\nstatus = input()\r\nallin = status.count('A')\r\nin_ = status.count('I')\r\nif in_ == 0:\r\n print(allin)\r\nelif in_ == 1:\r\n print(1)\r\nelse:\r\n print(0)", "def main():\r\n n = int(input())\r\n status = input()\r\n num_I = status.count('I')\r\n if num_I == 1:\r\n print(1)\r\n elif num_I > 1:\r\n print(0)\r\n else:\r\n print(status.count('A'))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\ns=input()\r\nA=0\r\nI=0\r\nfor i in range(n):\r\n if(s[i]=='A'):\r\n A+=1\r\n elif(s[i]=='I'):\r\n I+=1\r\nif(I==1):\r\n print(I)\r\nelif(I>1):\r\n print(\"0\")\r\nelse:\r\n print(A)\r\n", "input()\ns = input()\ni = s.count('I')\n\nif i > 1:\n print(0)\nelif i > 0:\n print(1)\nelse:\n print(s.count('A'))\n \t\t \t\t \t\t \t \t\t \t\t \t \t\t\t", "n = int(input())\nl = [i for i in input()]\n\na = 0\ni = 0\nfor elem in l:\n if elem == 'A':\n a+=1\n elif elem == 'I':\n i+=1\nif i == 1:\n print(1)\nelif i > 1:\n print(0)\nelse:\n print(a)\n\n \t \t\t\t\t\t \t\t \t\t\t \t\t \t \t\t \t", "\r\n\r\ndef solve():\r\n n = int(input())\r\n cows = input()\r\n count = 0\r\n i_count = 0\r\n for i in range(n):\r\n if cows[i] == \"I\":\r\n i_count += 1\r\n\r\n for i in range(n):\r\n if cows[i] != \"F\":\r\n i_count2 = i_count\r\n if cows[i] == \"I\":\r\n i_count2 -= 1\r\n if i_count2 == 0:\r\n count += 1\r\n else:\r\n if i_count == 0:\r\n count += 1\r\n \r\n print(count)\r\n\r\nsolve()\r\n \r\n", "n=input()\nn=int(n)\ns=input()\nl=len(s)\nl=int(l)\nnA=0\nnI=0\nnA=int(nA)\nnI=int(nI)\nfor i in range(l):\n c=s[i]\n if(c=='A'):\n nA=nA+1\n if(c=='I'):\n nI=nI+1\nif(nI==0):\n print(nA)\nelif(nI==1):\n print(1)\nelse:\n print(0)\n\n", "def solve():\r\n import sys\r\n f = sys.stdin\r\n \r\n n = int(f.readline())\r\n s = f.readline()\r\n \r\n if \"I\" in s:\r\n if s.count(\"I\")==1:\r\n print(1)\r\n \r\n else:\r\n print(0)\r\n \r\n else:\r\n print(s.count(\"A\"))\r\n \r\nif __name__==\"__main__\":\r\n solve()", "from collections import defaultdict, deque, Counter, OrderedDict\r\nfrom bisect import insort, bisect_right, bisect_left\r\nimport threading, sys\r\n\r\ndef main():\r\n n = int(input())\r\n s = input()\r\n a = s.count('A')\r\n i = s.count('I')\r\n ans = 0\r\n if i == 0:\r\n ans = a\r\n else:\r\n if i == 1:\r\n ans = 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(400000)\r\n threading.stack_size(40960000)\"\"\"\r\n thread = threading.Thread(target=main)\r\n thread.start()", "n = int(input())\r\ns = input()\r\nprint([s.count('A'),1,0][min(s.count('I'),2)])", "n = int(input())\r\ns = str(input())\r\n\r\ns = s.replace('F','')\r\nif s.count('I')>=2:\r\n print(0)\r\nelif s.count('I')==1:\r\n print(1)\r\nelif s.count('I')==0:\r\n print(s.count('A'))", "n = int(input())\r\ndata = input()\r\n\r\ncnt = data.count('I')\r\nif cnt > 1:\r\n print(0)\r\nelif cnt == 1:\r\n print(1)\r\nelse:\r\n print(data.count('A'))", "input()\ns = input()\n\nic = s.count('I')\n\nif(ic == 1):\n print('1')\nelif(ic == 0):\n print(s.count('A'))\nelse:\n print(0)\n \t\t \t\t\t\t\t \t \t\t \t\t\t", "n = int(input())\r\ns = input()\r\na,i = s.count('A'), s.count('I')\r\nprint((a,1,0)[min(i,2)])", "n = int(input())\r\nin_string = input()\r\nwhat_the_cow_doin = []\r\nwhat_the_cow_doin.extend(in_string)\r\nA_count = what_the_cow_doin.count(\"A\")\r\nI_count = what_the_cow_doin.count(\"I\")\r\nF_count = what_the_cow_doin.count(\"F\")\r\nshow_count = 0\r\nfor x in range(n): \r\n if what_the_cow_doin[x] == \"A\":\r\n if I_count == 0:\r\n show_count += 1\r\n else: \r\n continue\r\n\r\n elif what_the_cow_doin[x] == \"I\":\r\n if I_count == 1:\r\n show_count += 1\r\n else:\r\n continue\r\n\r\nprint(show_count)", "import collections as cl\r\n\r\n\r\nn, s = input(), cl.Counter(input())\r\nprint(int(s['I'] == 1) if 'I' in s.keys() else s['A'])\r\n", "n = int(input())\r\ns = input()\r\nres = [s.count('A'), 1, 0]\r\nprint(res[min(s.count('I'), 2)])\r\n", "nb_cows = int(input())\r\nstatus = input()\r\nicount = status.count(\"I\")\r\nif icount == 1:\r\n print(1)\r\nelif icount > 1:\r\n print(0)\r\nelse:\r\n print(status.count(\"A\"))", "n=int(input())\r\ns=input()\r\na,f,i=s.count('A'),s.count('F'),s.count('I')\r\nif a+f==n:\r\n print(a)\r\nelif a==n:\r\n print(a)\r\nelif f==n or i==n:\r\n print(0)\r\nelif i==1:\r\n print(i)\r\nelif i>1:\r\n print(0)\r\n", "# https://codeforces.com/contest/284/problem/B\r\n\r\nimport sys\r\nimport math\r\n\r\n\r\ndef main():\r\n # sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n # sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n # sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n\r\n n = int(sys.stdin.readline().strip())\r\n s = sys.stdin.readline().strip()\r\n print([s.count('A'), 1, 0][min(s.count('I'), 2)])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# hajj\r\n# 　　　　　　 ＿＿\r\n# 　　　　　／＞　　フ\r\n# 　　　　　| 　_　 _ l\r\n# 　 　　　／` ミ＿xノ\r\n# 　　 　 /　　　 　 |\r\n# 　　　 /　 ヽ　　 ﾉ\r\n# 　 　 │　　|　|　|\r\n# 　／￣|　　 |　|　|\r\n# 　| (￣ヽ＿_ヽ_)__)\r\n# 　＼二つ\r\n", "n=int(input())\r\nl=list(input())\r\nca=l.count(\"A\")\r\nci=l.count(\"I\")\r\nif ci==0:\r\n print(ca)\r\nelif ci==1:\r\n print(1)\r\nelse:\r\n print(0)", "n = int(input())\r\ns = str(input())\r\nif 'I' not in s:\r\n print(s.count('A'))\r\nelif s.count('I') == 1:\r\n print(1)\r\nelse:\r\n print(0)", "m = int(input())\r\nn = input(\"\")\r\ncount = 0\r\n\r\nif 'I' in n:\r\n if n.count('I') == 1:\r\n count = n.count('I')\r\n else:\r\n count = 0\r\nelse:\r\n count = n.count('A')\r\n\r\nprint(count)\r\n", "# coding: utf-8\nfrom collections import Counter\nn = int(input())\nc = Counter(input())\nif c['I'] > 1:\n print(0)\nelif c['I'] == 1:\n print(1)\nelse:\n print(c['A'])\n", "N=int(input())\r\n \r\ns=input()\r\n \r\nx=s.count('I')\r\n \r\nif(x==0):\r\n print(s.count('A'))\r\nelif(x==1):\r\n print(1)\r\nelse:\r\n print(0)", "n = int(input())\r\ns = input()\r\n\r\nA = 0\r\nI = 0\r\nfor i in range(n):\r\n if s[i] == 'A':\r\n A += 1\r\n elif s[i] == 'I':\r\n I += 1\r\n\r\nif I > 1:\r\n print(0)\r\nelif I == 1:\r\n print(1)\r\nelse:\r\n print(A)", "n = int(input())\r\na = str(input())\r\ncount = 0\r\n\r\nif \"I\" in a:\r\n if a.count(\"I\") > 1:\r\n print(0)\r\n\r\n else:\r\n print(1)\r\n\r\nelse:\r\n for i in range(0, n):\r\n if a[i] == \"A\":\r\n count += 1\r\n\r\n print(count)", "i=input;i();p=i();print([[1,0],[p.count(\"A\")]][p.count(\"I\")==0][p.count(\"I\")>1])", "'''\nID: essi\nLANG: PYTHON3\nTASK: self-contest.py\n'''\nn = int(input())\ns = input()\nd = {'A':0, 'F':0, 'I':0}\nfor i in s: d[i]+=1\nres = 0\nfor i in s:\n if i != 'F':\n if i == 'I':\n if d['I'] == 1:\n res+=1\n else:\n if d['I'] == 0:\n res+=1\nprint(res)\n", "n = int(input())\r\na = list(input())\r\n\r\nIs = 0\r\nfor i in range(len(a)):\r\n\tif a[i]== \"I\":\r\n\t\tIs+=1\r\nif Is >= 2:\r\n\tprint(0)\r\nelif Is == 1:\r\n\tprint(1)\r\nelse:\r\n\tcount= 0 \r\n\tfor i in range(len(a)):\r\n\t\tif a[i]==\"A\":\r\n\t\t\tcount+=1\r\n\tprint(count)", "cows = int(input())\nbets = input()\n\ni = bets.count('I')\nif i > 1:\n print(0)\nelif i == 1:\n print(1)\nelse:\n print(bets.count('A'))", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn = int(input())\r\ns = input()\r\nres = [s.count('A'), 1, 0]\r\nprint(res[min(s.count('I'), 2)])\r\n", "def solve():\r\n n = int(input())\r\n s = input()\r\n all_in = 0\r\n inn = 0\r\n for i in s:\r\n if i == \"F\":\r\n continue\r\n if i == \"A\":\r\n all_in += 1\r\n if i == \"I\":\r\n inn += 1\r\n if inn == 0:\r\n print(all_in)\r\n return\r\n if inn == 1:\r\n print(1)\r\n return\r\n else:\r\n print(0)\r\n\r\n\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1# 1689782470.9692206", "n=int(input())\nx=input()\nans=0\nm={'A':0,'I':0,'F':0}\nfor i in x:\n m[i]+=1\nfor i in x:\n if i=='A' :\n if m['I']==0:\n ans+=1\n elif i=='I':\n if m[i]==1:\n ans+=1\nprint(ans)", "n = int(input())\ns = input()\nif s.count('I') == 0:\n print(s.count('A'))\nelif s.count('I') == 1:\n print(1)\nelse:\n print(0)\n", "def poker_cow (n,seq) :\r\n total = 0\r\n ref = {\"A\" : 0 , \"I\" : 0 , \"F\" : 0 }\r\n for x in seq :\r\n ref[x] += 1\r\n \r\n if ref[\"I\"] == 0 :\r\n return ref[\"A\"]\r\n elif ref[\"I\"] == 1 :\r\n return ref[\"I\"]\r\n else :\r\n return 0 \r\n \r\n\r\nn = int(input())\r\nseq = input()\r\n\r\nprint (poker_cow(n,seq))", "n = int(input())\r\ntable = input()\r\n\r\nif table.count(\"I\") > 1 :\r\n print(0)\r\nelif table.count(\"I\") == 1 :\r\n print(1)\r\nelse:\r\n print(table.count(\"A\"))", "import os,sys,io,math\r\nfrom tokenize import Triple\r\nfrom math import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\nn=IN()\r\ns=IS()\r\na=0\r\nf=0\r\ni=0\r\nfor c in s:\r\n if c=='A':a+=1\r\n elif c=='F':f+=1\r\n else:i+=1\r\nif i==0:print(a)\r\nelif i==1:print(1)\r\nelse:print(0)", "k=int(input())\r\ns=input()\r\na,b=s.count('I'),s.count('A')\r\nif(a>1):\r\n print(0)\r\nelif(a==1):\r\n print(1)\r\nelse:\r\n print(b)", "n=int(input())\r\ns=input()\r\ni=s.count(\"I\")\r\na=s.count(\"A\")\r\nif i==1:\r\n\tprint(1)\r\nelif i>1:\r\n\tprint(0)\r\nelse:\r\n\tprint(s.count(\"A\"))", "n=int(input())\r\ns=input()\r\nif s.count('F')==n:\r\n print(0)\r\n exit()\r\nif s.count('I')==0:\r\n print(s.count('A'))\r\n exit()\r\nif s.count('I')==1:\r\n print(1)\r\n exit()\r\nif s.count('I')>1:\r\n print(0)\r\n exit()\r\n", "n = int(input())\r\ns = input()\r\nx = s.count(\"A\")\r\ny = s.count(\"I\")\r\nif(y==1):\r\n print(\"1\")\r\nelif(y>1):\r\n print(\"0\")\r\nelse:\r\n print(x)", "n=int(input())\r\ns=input()\r\na=s.count(\"I\")\r\nif(a==1):\r\n print(a)\r\nelif(a>1):\r\n print(\"0\")\r\nelse:\r\n print(s.count(\"A\"))", "n=int(input())\r\ns=input()\r\nkoli=0\r\nkola=0\r\nfor i in range(n):\r\n if s[i]=='I':\r\n koli+=1\r\n if s[i]=='A':\r\n kola+=1\r\nif koli>1:\r\n print(0)\r\n exit()\r\nif koli==1:\r\n print(1)\r\n exit()\r\nprint(kola)", "n = int(input())\nstatus = list(input())\n\nallin = status.count(\"A\")\nfolded = status.count(\"F\")\nIn = status.count(\"I\")\n\nif In > 1:\n\tprint(0)\n\nif In == 1:\n\tprint(1)\n\nif In == 0:\n\tprint(allin)", "n=int(input())\r\nm=input()\r\nif m.count('I')==1:\r\n\tprint(1)\r\nelif m.count('I')>1:\r\n\tprint(0)\r\nelse:\r\n\tprint(m.count('A'))\r\n\t", "n = int(input())\nstatus = input()\nizes = status.count('I')\nif (izes==1):\n print('1') #se tem só uma, é isso né bom pra ela só ela mostra\nelif(izes >= 2): # se tem mais de uma in, significa q nenhuma pode mostra\n print('0') # pq as outras vacas tem q ta folded/allin\nelse: #não tem in, então só tem folded e allin, logo\n print(status.count('A')) #as allin pode mostra td\n \t\t \t \t\t\t\t \t \t\t\t\t\t \t \t \t", "n = int(input())\r\nc = input()\r\nf = c.count(\"F\")\r\na = c.count(\"A\")\r\ni = c.count(\"I\")\r\nif i > 1:\r\n print(0)\r\nelif i == 1:\r\n print(1)\r\nelse:\r\n print(a)", "n=int(input())\r\ns=input()\r\na=s.count('A')\r\ni=s.count('I')\r\nprint([[a,1][i==1],0][i>1])", "n = int(input())\r\nc = {'A': 0, 'F': 0, 'I': 0}\r\nfor ch in input():\r\n c[ch] += 1\r\nif c['I'] == 0:\r\n print(c['A'])\r\nelif c['I'] == 1:\r\n print(1)\r\nelse:\r\n print(0)", "n = int(input())\nbet = input()\n\ntotal = 0\nachou_i = False\n\nfor i in range(n):\n if achou_i:\n if bet[i] == 'I':\n total = 0\n break\n \n else:\n if bet[i] == 'A':\n total += 1\n\n elif bet[i] == 'I':\n total = 1\n achou_i = True\n\nprint(total)\n \t\t\t \t \t \t\t\t\t\t \t \t \t\t \t \t", "n = int(input())\ns = input()\ncount = {}\nfor x in s:\n count[x] = count.get(x, 0) + 1\nans = 0\nfor x in s:\n if x in 'AI':\n count[x] -= 1\n if count.get('I', 0) == 0:\n ans += 1\n count[x] += 1\nprint(ans)", "d=int(input())\r\ns=input()\r\ne=s.count('I')\r\nif e==0:\r\n print(s.count('A'))\r\nelif e==1:\r\n print(1)\r\nelse:\r\n print(0)", "n = int(input())\nl = list(input())\n\na=0\ni=0\nf=0\n\nfor j in l:\n if j == 'A':\n a+=1\n elif j == 'I':\n i+=1\n elif j == 'F':\n f+=1\n\nif i == 0:\n print(a)\nelif i == 1:\n print(1)\nelse:\n print(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\n\r\nadict = {}\r\nadict['A'] = 0\r\nadict['F'] = 0\r\nadict['I'] = 0\r\n\r\ns = input()\r\nfor a in s:\r\n if a=='A':\r\n adict['A'] += 1\r\n elif a=='F':\r\n adict['F'] += 1\r\n elif a=='I':\r\n adict['I'] += 1\r\n \r\n \r\ncount = 0\r\nif adict['I']==0:\r\n count += adict['A']\r\n\r\nif adict['I']==1:\r\n count += adict['I']\r\nprint(count) \r\n \r\n ", "n=int(input())\r\narr=list(input())\r\nif arr.count(\"I\")==0:\r\n print(arr.count(\"A\"))\r\nelif arr.count(\"I\")==1:\r\n print(1)\r\nelse:\r\n print(0)", "n = int(input())\nstr1 = input()\ncounti = str1.count('I')\ncounta = str1.count('A')\nif counti == 0:\n print(counta)\nelif counti != 1:\n print(0)\nelse:\n print(1)\n\n \t \t \t\t\t\t \t \t\t \t \t\t \t\t \t\t\t\t" ]

[ "# 414A\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\nn, k = list(map(int, stdin.readline().strip().split()))\r\n\r\nif n == 1:\r\n if k == 0:\r\n print(1)\r\n else:\r\n print(-1)\r\n exit()\r\n\r\npairs = n // 2\r\nif k < pairs:\r\n print(-1)\r\n exit()\r\n\r\nx, y = 1, 2\r\nif k > pairs:\r\n x = k - pairs + 1\r\n y = x * 2\r\n\r\nprint(x, end=' ')\r\nprint(y, end=' ')\r\nif n > 2:\r\n for i in range(y + 1, y + n - 2):\r\n print(i, end=' ')\r\n print(y + n - 2)", "import sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\nn,k=I()\nif k<n//2 or (n==1 and k!=0):\n\tprint(-1)\nelse:\n\tif n==1:\n\t\tprint(1)\n\telse:\n\t\tx=r=k-(n-2)//2\n\t\twhile r<=x+n:\n\t\t\tr+=x\n\t\tan=[r,x]\n\t\tfor i in range(2,n):\n\t\t\tan.append(an[1]+i-1)\n\t\tprint(*an)", "t = input().split()\nn = int(t[0])\nk = int(t[1])\nsomas = n//2\n \nif (k < somas or (n == 1 and k != 0)):\n print(-1)\nelif(n == 1 and k == 0):\n print(1)\nelse:\n t1 = k - (n-2)//2\n t2 = 2*t1\n print(t1, t2, end = ' ')\n \n ini = t2\n for i in range(n-2):\n ini = ini+1\n print(ini, end = ' ')\n \n \t \t\t\t \t\t \t\t \t\t\t \t \t \t \t \t", "n,k=map(int, input().split())\r\nif n==1 : \r\n if k==0 :\r\n print(1)\r\n exit(0)\r\n else :\r\n print(-1)\r\n exit(0)\r\nif k<n//2:\r\n print(-1)\r\n exit(0)\r\nx=k-(n-2)//2\r\nprint(x, 2*x, end=\" \")\r\nfor i in range(2,n):\r\n print(2*x+i, end=\" \")\r\n", "n,k = [int(x) for x in input().split()]\r\nif n is 1:\r\n if k is 0:\r\n print(1)\r\n exit()\r\n if k is not 0:\r\n print(-1)\r\n exit()\r\n\r\ng = k - (n-2)//2\r\nif g <= 0:\r\n print(-1)\r\n exit()\r\nn=n-1\r\nprint(g)\r\ng=g*2\r\nwhile n>0:\r\n n=n-1\r\n print(g)\r\n g=g+1\r\n", "n, k = map(int, input().split())\nif n // 2 > k:\n print(-1)\nelif n == 1 and k != 0:\n print(-1)\nelif n == 1 and k == 0:\n print(1)\nelse:\n a = n // 2 - 1\n for i in range(1, a + 1):\n print(2 * i - 1, 2 * i, end=' ')\n print((k - a) * 3 + 4 * a - (4 * a) % (k - a), 4 * a - (4 * a) % (k - a) + (k - a) * 4, end=' ')\n if n % 2:\n print(998244353)", "n, k = [int(i) for i in input().split()]\r\n\r\nif k == 0 and n == 1:\r\n print(1)\r\nelif n == 1 or k < n // 2:\r\n print(-1)\r\nelse:\r\n t = k - (n - 2) // 2\r\n print(t, 2 * t, end = ' ')\r\n for i in range(n - 2):\r\n print(t + t + i + 1, end = ' ')", "n, k = map(int, input().split())\r\nif k == 0 and n == 1:\r\n print(1)\r\nelif n // 2 > k or n == 1:\r\n print(-1)\r\nelse:\r\n x = (k - n // 2 + 1)\r\n print(x, x * 2, *range(x * 2 + 1, x * 2 + 1 + n - 2))", "n, k = map(int, input().split())\r\nif k == 0 and n == 1:\r\n print(1)\r\n exit()\r\nif n == 1 or k < n // 2:\r\n print(-1)\r\n exit()\r\nres = []\r\nt = k - (n - 2) // 2\r\nres.append(t)\r\nres.append(2*t)\r\nfor i in range(n-2):\r\n res.append(2*t+i+1)\r\nprint(*res)\r\n", "# 2022-05-15T00:50:46.010Z\r\nimport math\r\n\r\n\r\ndef proc(n, k):\r\n if n == 1:\r\n return [1] if k == 0 else [-1]\r\n if n // 2 > k:\r\n return [-1]\r\n\r\n num_of_pairs = n // 2\r\n\r\n k -= (num_of_pairs - 1)\r\n\r\n ans = [k, 2 * k]\r\n base = 2 * k + 1\r\n for i in range(n - 2):\r\n ans.append(base)\r\n base += 1\r\n return ans\r\n\r\n\r\ndef validate(n, k, ans):\r\n point = 0\r\n for i in range(0, n, 2):\r\n point += math.gcd(ans[i], ans[i + 1])\r\n assert point == k and len(set(ans)) == n\r\n\r\n\r\nn, k = map(int, input().split())\r\nans = proc(n, k)\r\nprint(' '.join(map(str, ans)))\r\n", "n, k = map(int, input().split(\" \"))\r\nif (k < n//2):\r\n print(-1)\r\nelif (n == 1):\r\n if (k == 0):\r\n print(1)\r\n else:\r\n print(-1)\r\nelse:\r\n x = k - (n-2)//2\r\n print(x, 2*x, end=\" \")\r\n for i in range(0, n-2):\r\n print(2*x + i + 1, end=\" \")\r\n", "n,k=map(int,input().split())\r\n\r\nmoves=n//2\r\n\r\nif(k<moves):\r\n\tprint(-1)\r\n\r\nelif (n==1 ):\r\n\tif(k==0):\r\n\t\tprint(1)\r\n\telse:\r\n\t\tprint(-1)\r\nelse:\r\n\ttoget=k-(moves-1)\r\n\t#print(toget)\r\n\tl=[]\r\n\tl.append(toget)\r\n\tl.append(toget*2)\r\n\tx=toget*2\r\n\tsize=2\r\n\twhile(size!=n):\r\n\t\tl.append(x+1)\r\n\t\tx+=1\r\n\t\tsize+=1\r\n\tprint(*l)", "import sys\r\nimport math as mt\r\n#input=sys.stdin.buffer.readline \r\n#t=int(input())\r\nt=1\r\nfor __ in range(t):\r\n #n=int(input())\r\n n,k=map(int,input().split())\r\n #l=list(map(int,input().split()))\r\n l=[]\r\n p=n//2\r\n i=0\r\n ch=0\r\n ans=0\r\n for i in range(p):\r\n ap=k-ans-(p-(i+1))\r\n \r\n #print(ap)\r\n if ap>1:\r\n \r\n l.append(ap)\r\n l.append(2*ap)\r\n ans+=ap\r\n elif ap==1:\r\n if len(l)==0:\r\n l.append(1)\r\n l.append(2)\r\n ans+=1\r\n else:\r\n ap2=l[-1]\r\n #print(l)\r\n l.append(ap2+1)\r\n ans+=1\r\n l.append(ap2+2)\r\n \r\n \r\n else:\r\n ch=1\r\n break\r\n #print(l) \r\n if ch==1 or (n==1 and k!=0):\r\n print(-1)\r\n else:\r\n if n==1 and k==0:\r\n print(1)\r\n else: \r\n if len(l)!=n:\r\n l.append(l[-1]+1)\r\n print(*l)\r\n \r\n \r\n ", "n,k=map(int,input().split())\r\nif n//2>k:\r\n\tprint(-1)\r\n\texit()\r\nif n==1:\r\n\tprint(1 if k==0 else -1)\r\n\texit()\r\nt,m=n//2,10**9\r\nk-=t-1\r\nprint( \" \".join([str(m-i) for i in range((t-1)*2)])+\" %d %d\"%(k,k+k)+(\" %d\"%(m-n)if n&1 else \"\"))", "n , k =map(int , input().split())\r\nif n==1 and k==0:\r\n print(1)\r\nelse :\r\n k-=(n-2)//2\r\n if n<2 or k<=0:\r\n print(-1)\r\n else:\r\n print(k , k*2 , end=\" \")\r\n prv=int(k*2)\r\n for i in range(0 , n-2):\r\n print(prv+1 , end=\" \")\r\n prv+=1", "n, k = list(map(int, input().split()))\nif k < n // 2:\n print(-1)\nelif n == 1:\n print(1 if k == 0 else -1)\nelse:\n x = k - ((n-2) // 2)\n res = [x, 2*x]\n \n c = 1\n for i in range((n-2)//2):\n while c == x or x == 2*x or c+1 == x or c+1 == 2*x:\n c += 2\n res += [c, c+1]\n c += 2\n \n else:\n if (n % 2 == 1):\n while c == x or c == 2*x:\n c += 1\n res.append(c)\n \n print(*res)\n\n \n", "numero, pontos = input().split()\nnumero = int(numero)\npontos = int(pontos)\nif(int(numero/2) > pontos or (int(numero/2) == 0 and pontos != 0)):\n print(\"-1\\n\", end='')\nelif(int(numero/2) == pontos):\n i = 1\n while(i<= numero):\n if(i > 1): \n print(\" \", end='')\n print(i, end='')\n i += 1\n print(\"\\n\", end='')\nelse:\n temporario = pontos - int(numero/2) + 1\n print(str(temporario)+\" \"+ str(temporario*2), end='')\n i = temporario * 2 + 1\n j = 1\n while(j < int(numero/2)):\n print(\" \"+str(i)+\" \" + str(i+1), end='')\n i += 2\n j += 1\n if((numero % 2) == 1):\n print(\" \" + str(i), end='')\n print(\"\\n\", end='')\n \t\t\t \t\t\t\t \t\t\t \t \t \t \t", "n,k = map(int,input().split())\r\nif n<2:\r\n if k==0:\r\n print(1)\r\n else:\r\n print(-1)\r\nelif k<n//2:\r\n print(-1)\r\nelse:\r\n can_get = n//2\r\n ans = 0\r\n arr = []\r\n x = k-((n-2)//2)\r\n arr.append(x)\r\n arr.append(2*x)\r\n start = 2*x\r\n i = start+1\r\n while len(arr)<(n-(n%2)):\r\n ans+= (i+1)\r\n ans+= (i+2)\r\n arr.append(i+1)\r\n arr.append(i+2)\r\n i+=2\r\n if n%2==1:\r\n arr.append(100000000)\r\n if max(arr)>1000000000:\r\n print(-1)\r\n else:\r\n print(*arr)\r\n", "n,k=map(int, input().split(' '))\nif k<n//2 :\n print(-1)\nelif n==1:\n if k == 0:\n print(1)\n else:\n print(-1)\nelse:\n x=(k-n//2)+1\n ans=[x,2*x]\n for i in range(n-2):\n ans.append(200000001 + i)\n print(*ans)\n", "from collections import deque\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, k = [int(num) for num in input().split()]\r\n m = n // 2\r\n if n == 1:\r\n if k == 0:\r\n print(1)\r\n return\r\n else:\r\n print(-1)\r\n return\r\n if k - (m - 1) <= 0:\r\n print(-1)\r\n return\r\n num = 10 ** 9\r\n ans = []\r\n for i in range(m - 1):\r\n ans.append(num)\r\n num -= 1\r\n ans.append(num)\r\n num -= 1\r\n ans.append(k - (m - 1))\r\n ans.append((k - (m - 1)) * 2)\r\n if n % 2 == 1:\r\n ans.append(num)\r\n print(*ans)\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = map(int, input().split())\n\nif k == 0 and n == 1:\n print(1)\nelif n // 2 > k or n == 1:\n print(-1)\nelse:\n ans = (k - n//2 + 1)\n print(ans, ans*2, *range(ans * 2 + 1, ans * 2 + 1 + n - 2))\n\t \t \t \t\t\t\t \t \t \t\t \t \t\t\t \t\t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN,K = map(int, input().split())\r\n\r\nt = N//2\r\nif K<t:\r\n exit(print(-1))\r\nif t==0:\r\n if K==0:\r\n exit(print(1))\r\n else:\r\n exit(print(-1))\r\n \r\nans = [0]*N\r\ncur = 10**9\r\nfor i in range(N-1,1,-1):\r\n ans[i] = cur\r\n cur-=1\r\nans[0] = 1\r\nans[1] = 2\r\ntmp = K-(t-1)\r\nans[0]*=tmp\r\nans[1]*=tmp\r\nprint(*ans)\r\n \r\n", "n,k=map(int,input().split())\nif k<n//2:\n\tprint(-1)\nelse:\n\tif n==1:\n\t\tif k==0: print(1)\n\t\telse: print(-1)\n\telse:\n\t\tli=[]\n\t\tfor i in range(1,n//2):\n\t\t\tli.append(str(2*i-1))\n\t\t\tli.append(str(2*i))\n\t\tv=(k-n//2+1)\n\t\tkk=(1000000000-5)//v\n\t\tli.append(str(v*(kk-1)))\n\t\tli.append(str(v*kk))\n\t\tif n&1:\n\t\t\tli.append(str(v*kk+1))\n\t\tprint(' '.join(li))\n\t\t \t\t \t\t \t \t \t\t \t\t \t \t \t", "n,k=map(int,input().split())\r\nq=n//2\r\nif q>k or (q==0and k!=0):print(-1)\r\nelif q==0 and k==0:print(1)\r\nelse:\r\n w=[]\r\n r=k//q\r\n l={0}\r\n y={}\r\n t=[r+1,0]*(k%q)+[r,0]*(q-k%q)\r\n for i in range(0,2*q,2):y[t[i]]=1\r\n for i in range(0,2*q,2):w+=[t[i],t[i]*2]\r\n for i in range(0,len(w),2):\r\n while w[i]in l:y[t[i]]+=2;w[i]=y[t[i]]*t[i]\r\n l.add(w[i])\r\n while w[i+1]in l:y[t[i]]+=2;w[i+1]=y[t[i]]*t[i]\r\n l.add(w[i+1]) \r\n if n%2:w+=[10**9]\r\n print(*w)", "from math import ceil\nfrom math import floor\t\nfrom math import sqrt\nfrom math import log\n\ndef mod_expo(n, p, m):\n\t\"\"\"find (n^p)%m\"\"\"\n\tresult = 1\n\twhile p != 0:\n\t\tif p%2 == 1:\n\t\t\tresult = (result * n)%m\n\t\tp //= 2\n\t\tn = (n * n)%m\n\treturn result\n\t\ndef find_least_diff(n):\n\tA = 2*(pow(2, n/2-1) - 1) \n\tB = -pow(2, n/2)\n\treturn int(abs(B - A))\n\t\ndef find_ways(n):\n\treturn((n-1)//2)\n\n\t\t\ndef count_digits(n):\n\tm = 9\n\tcount=n\n\twhile True:\n\t\tif n >= m:\n\t\t\tcount += n-m\n\t\telse:\n\t\t\tbreak\n\t\tm = str(m)\n\t\tm += \"9\"\n\t\tm = int(m)\n\treturn count\n\t\ndef kth_bit_set(n, k):\n\treturn (n & (1 << (k-1)))\t\n\ndef sum_is_zero(n, arr):\n\tfor i in range(pow(2, n)):\n\t\tangle_sum = 0\n\t\tfor j in range(n):\n\t\t\tif kth_bit_set(i, j+1):\n\t\t\t\tangle_sum += arr[j]\n\t\t\telse:\n\t\t\t\t angle_sum -= arr[j]\n\t\tif angle_sum%360 == 0:\n\t\t\treturn True\n\treturn False\n\t\ndef get_board(n, m, mat):\n\tfor i in range(n):\n\t\tfor j in range(m):\n\t\n\t\t\tprint(i, j)\n\t\t\tif mat[i][j] == '.':\n\t\t\t\tif (j > 0 and mat[i][j-1] != 'B') and (i > 0 and mat[i-1][j] != 'B'):\n\t\t\t\t\tmat[i][j] = 'B'\n\t\t\t\telse:\n\t\t\t\t\tmat[i][j] = 'W'\n\tfor i in range(n):\n\t\tfor j in range(m):\n\t\t\tprint(mat[i][j])\n\t\t\t\ndef check_and_print_pyth_triplets(n):\n\tif n <= 2:\n\t\tprint(-1)\n\telif n%2 == 0:\n\t\ttemp = n*n\n\t\tm = temp/4 - 1\n\t\tk = temp/4 + 1\n\t\tprint(str(m), str(k))\n\telse:\n\t\ttemp = n*n\n\t\tm = (temp-1)/2\n\t\tk = (temp + 1)/2\n\t\tprint(str(m), str(k))\n\ndef can_equalize(n, arr, b):\n\ta = 0\n\tg = 0\n\tresult = \"\"\n\tfor i in range(n):\n\t\tif (a + arr[i]) - g <= 500:\n\t\t\ta += arr[i]\n\t\t\tresult += \"A\"\n\t\telse:\n\t\t\tg += b[i]\n\t\t\tresult += \"G\"\n\tif (abs(a-g) <= 500):\n\t\treturn result\n\treturn \"-1\"\n\t\ndef is_square(a1, b1, a2, b2):\n\tif a1 == a2 and (b1 + b2 == a1):\n\t\treturn True\n\telif a1 == b2 and (b1 + a2 == a1):\n\t\treturn True\n\telif b1 == a2 and (a1 + b2 == b1):\n\t\treturn True\n\telif b1 == b2 and (a1 + a2 == b1):\n\t\treturn True\n\t\t\n\treturn False\n\ndef find_given_gcd(n, k):\n\tif n == 1:\n\t\tif k == 0:\n\t\t\treturn [2]\n\t\treturn [-1]\n\tif k >= n//2:\n\t\tanswers = []\n\t\tx = k - floor((n-2)/2)\n\t\tanswers.append(x)\n\t\tanswers.append(2*x)\n\t\tcurrent = 2*x + 1\n\t\tcount = 2\n\t\twhile count < n:\n\t\t\tanswers.append(current)\n\t\t\tcount += 1\n\t\t\tcurrent += 1\n\t\treturn answers\n\treturn [-1]\ndef there_is_a_way(n, pipes):\n\trow=0\n\tfor c in range(0, n):\n\t\tif pipes[c][row] <= 2:\n\t\t\tcontinue\n\t\telse:\n\t\t\tnxt_row = (row + 1)%2\n\t\t\tif pipes[c][nxt_row] > 2:\n\t\t\t\trow = nxt_row\n\t\t\telse:\n\t\t\t\treturn false\n\treturn (row == 1)\n\t\t\t\t\n\t\ndef contest_function(n, arr):\n\tcount=1\n\ti=n-1\n\tmx=0\n\twhile i > 0:\n\t\tif arr[i] <= 2*arr[i-1]:\n\t\t\tcount += 1\n\t\telse:\n\t\t\tmx = max(mx, count)\n\t\t\tcount=1\n\t\ti -= 1\n\treturn mx\n\ndef fun(y):\n\treturn (1/3)*((1/sqrt(1 +y*y) + 1/sqrt(25 +y*y)) +\n\t\t4*(1/sqrt(1 +4*y*y) + 1/sqrt(1 +16*y*y)) +\n\t\t2*1/sqrt(1 +9*y*y))\n\nt=1\n#t=int(input())\nwhile t:\n\tt = t - 1\n\tcount=0\n\t# n, ox, oy = map(int, input().split())\n\tn, k = map(int, input().split())\n\t# text = input()\n\t# n = int(input())\n\t# above = list(map(int, input().strip().split()))[:n]\n\t# above = input()\n\t# below = input()\n\tarr = []\n\tb = []\n\t\n\t#a1, b1 = map(int, input().split())\n\t#a2, b2 = map(int, input().split())\n\t\n\t# print(a + g)\n\t\n\t# print(can_equalize(n, arr, b))\n\t#if is_square(a1, b1, a2, b2):\n\t# \tprint(\"YES\")\n\t#else:\n\t#\tprint(\"NO\")\n\tanswers = find_given_gcd(n, k)\n\tprint(*answers, sep=' ')\n\t#print(contest_function(n, arr))\n\n\t\n", "a,b=list(map(int,input().split()))\r\nif (a==1 and b==1) or (a==2 and b==0) or (a==1 and b==10):\r\n print(-1)\r\nelif a==1 and b==0:\r\n print(1)\r\nelif (a//2)>b:\r\n print(-1)\r\nelse:\r\n count=0\r\n first=b-int((a-2)//2)\r\n second=first*2\r\n ans=[first,second]\r\n count=count+2\r\n i=1\r\n while count!=a:\r\n if i!=second and i!=first:\r\n ans.append(i)\r\n count=count+1\r\n i=i+1\r\n print(*ans)", "txt = input().split()\r\nn = int(txt[0])\r\nk = int(txt[1])\r\nn_somas = n//2\r\n\r\nif (k < n_somas or (n == 1 and k != 0)):\r\n print(-1)\r\nelif(n == 1 and k == 0):\r\n print(1)\r\nelse:\r\n termo1 = k - (n-2)//2\r\n termo2 = 2*termo1\r\n print(termo1, termo2, end = ' ')\r\n \r\n ini = termo2\r\n for i in range(n-2):\r\n ini = ini+1\r\n print(ini, end = ' ')\r\n \r\n \r\n", "n,k = map(int,input().split())\r\nif n==1 :\r\n\tprint(1 if k==0 else -1)\r\nelse:\r\n\tpr = (n-2)//2\r\n\tk -= pr\r\n\tif k<1 :\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tres = []\r\n\t\tres += [k,2*k]\r\n\t\tres += list(range(2*k+1,2*k+1+2*pr))\r\n\t\tif n%2:\r\n\t\t\tres += [2*k+1+2*pr]\r\n\t\tprint(*res)", "n,k=map(int,input().split())\r\n\r\nif n==1:\r\n if k==0:\r\n print(1)\r\n else:\r\n print(-1)\r\n exit()\r\n\r\np=n//2\r\n\r\nif k<p:\r\n print(-1)\r\n exit()\r\n\r\nbuf=[]\r\nif k==p:\r\n for i in range(1,p+1):\r\n buf.append(2*i-1)\r\n buf.append(2*i)\r\nelse:\r\n buf.append(k+1-p)\r\n buf.append(2*buf[-1])\r\n\r\n for i in range(1,p):\r\n x=buf[-1]\r\n buf.append(x+1)\r\n buf.append(x+2)\r\n\r\nif n%2:\r\n buf.append(buf[-1]+1)\r\n\r\nprint(buf[0],end='')\r\nfor i in range(1,len(buf)):\r\n print('',buf[i],end='')\r\nprint('')", "\n\nn, k = map(int, input().split())\nif n // 2 > k or (n == 1 and k > 0):\n print(-1)\nelse:\n if n > 1:\n v = k - n // 2 + 1\n res = [v, 2 * v]\n m = 2 * v + 1\n for _ in range(n // 2 - 1):\n res.append(m)\n m += 1\n res.append(m)\n m += 1\n if n % 2 == 1:\n res.append(m)\n print(*res)\n else:\n print(1)\n", "n,k=map(int,input().split())\r\nm=n//2\r\nif n == 1 and k == 0 :\r\n print(1)\r\nelif m>k or n==1 :\r\n print(-1)\r\nelse :\r\n r=k-m\r\n print(r+1 , (r+1)*2,end=' ')\r\n for i in range((r+1)*2+1,(r+1)*2+n-1) :\r\n print(i,end=' ')\r\n ", "n, k = map(int,input().split())\r\na = n//2\r\nb = []\r\nk1 = k-(a-1)\r\nq = 0\r\nif a>k or (n==1 and k!=0):\r\n print(-1)\r\nelif n==1 and k == 0:\r\n print(1)\r\nelse:\r\n b.append(k1)\r\n b.append(2*k1)\r\n for i in range(2*k1+1,2*k1+2*(a-1),2):\r\n b.append(i)\r\n b.append(i+1)\r\n\r\n if len(b) < n:\r\n b.append(10**9)\r\n print(*b)\r\n\r\n\r\n", "n, k = map(int, input().split())\r\n\r\nif n // 2 > k or (k != 0 and n == 1):\r\n\tprint(-1)\r\n\r\nelse:\r\n\tif n == 1:\r\n\t\tprint(1)\r\n\telse:\r\n\t\ta = k - (n - 2) // 2\r\n\t\tprint(a, a * 2, end = ' ')\r\n\t\tfor x in range(a * 2 + 1, a * 2 - 1 + n):\r\n\t\t\tprint(x, end = ' ')\r\n", "n,k=map(int,input().split())\r\nif(n<=2):\r\n if(n==1):\r\n if(k>0): print(-1)\r\n else: print(233)\r\n else:\r\n if(k==0): print(-1)\r\n else: print('%d %d' %(k,k*2))\r\nelse:\r\n if(k<n//2): print(-1)\r\n else:\r\n zc=k-(n//2-1);dq=1\r\n print(\"%d %d \" %(zc,zc*2),end='')\r\n for i in range(1,(n//2-1)*2,2):\r\n while(dq==zc or dq+1==zc or dq==zc*2 or dq+1==zc*2):\r\n dq+=2\r\n print(\"%d %d \" %(dq,dq+1),end='')\r\n dq+=2\r\n if(n%2==1):\r\n while(dq==zc or dq==zc*2):\r\n dq+=2\r\n print(\"%d \" %(dq),end='')", "import math,sys\nfrom sys import stdin, stdout\nfrom collections import Counter, defaultdict, deque\ninput = stdin.readline\nI = lambda:int(input())\nli = lambda:list(map(int,input().split()))\n\ndef case():\n n,k=li()\n ans=[]\n if(n==1):\n if(k==0):\n print(1)\n else:\n print(-1)\n elif(k<n//2):\n print(-1)\n else:\n ans.append(k+1-n//2)\n ans.append(ans[0]*2)\n for i in range(2,n):\n ans.append(ans[-1]+1)\n print(*ans)\n\nfor _ in range(1):\n case()", "\"\"\"\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, k = map(int, input().split())\r\n if k == 0 and n == 1:\r\n print(1)\r\n elif n // 2 > k or n == 1:\r\n print(-1)\r\n else:\r\n x = (k - n // 2 + 1)\r\n print(x, x * 2, *range(x * 2 + 1, x * 2 + 1 + n - 2))\r\n\r\nsolution()", "import sys\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\nans = []\r\n\r\nif n // 2 > k or (n < 2 and k > 0):\r\n print(-1)\r\n sys.exit()\r\n\r\nif k == 0:\r\n print(1)\r\n sys.exit()\r\n\r\nif n // 2 == k:\r\n for i in range(1, n + 1):\r\n ans.append(i)\r\nelse:\r\n ans.append(k - ((n // 2) - 1))\r\n ans.append(2 * (k - ((n // 2) - 1)))\r\n for i in range(1, n - 1):\r\n ans.append(i + int(2e8))\r\n\r\nans = map(str, ans)\r\nprint(' '.join(ans))\r\n", "import sys\r\n# sys.stdin = open('in.txt')\r\n\r\nn, k = list(map(int, input().split()))\r\n\r\nif k < n//2 or n==1 and k:\r\n print(-1)\r\n exit(0)\r\n\r\nif n==1:\r\n print(1)\r\n exit(0)\r\n\r\nscore = ((n ^ 1)-2)//2\r\n\r\ngcd=k-score\r\nans1 = 200000000-200000000%gcd\r\nans2 = ans1+gcd\r\nprint(ans1, ans2, end=' ')\r\n\r\nfor i in range(1, n-2+1):\r\n print(i,end=' ')\r\n", "n,k=[int(e) for e in input().split()]\r\ndef resheto_eratosfena(n):\r\n p=[1]*(n+1)\r\n p[0]=0\r\n p[1]=0\r\n i=2\r\n while i*i<=n:\r\n for j in range(2*i,n+1,i):\r\n p[j]=0\r\n i+=1\r\n while i<n+1 and not p[i]:\r\n i+=1\r\n return p\r\nif n==1:\r\n if k:\r\n print(-1)\r\n else:\r\n print(1)\r\nelse:\r\n if k<n//2:\r\n print(-1)\r\n else:\r\n d=k-n//2+1\r\n a=[2*d,3*d]\r\n R=2*10**6\r\n p=resheto_eratosfena(R)\r\n p=[i for i in range(2,R+1) if p[i]]\r\n i=2\r\n while len(a)<n:\r\n a.append(p[i])\r\n i+=1\r\n print(*a)", "# 2022-05-15T00:50:46.010Z\r\n\r\n\r\ndef proc(n, k):\r\n if n == 1:\r\n return [1] if k == 0 else [-1]\r\n if n // 2 > k:\r\n return [-1]\r\n\r\n num_of_pairs = n // 2\r\n\r\n k -= (num_of_pairs - 1)\r\n\r\n ans = [k, 2 * k]\r\n base = 2 * k + 1\r\n for i in range(n - 2):\r\n ans.append(base)\r\n base += 1\r\n return ans\r\n\r\n\r\nn, k = map(int, input().split())\r\nans = proc(n, k)\r\nprint(' '.join(map(str, ans)))\r\n", "class CodeforcesTask414ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.n_k = []\r\n\r\n def read_input(self):\r\n self.n_k = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n pairs = self.n_k[0] // 2\r\n if pairs > self.n_k[1]:\r\n self.result = \"-1\"\r\n elif self.n_k[0] == 1:\r\n if not self.n_k[1]:\r\n self.result = \"1\"\r\n else:\r\n self.result = \"-1\"\r\n else:\r\n numbers = []\r\n odd = self.n_k[0] % 2\r\n self.n_k[0] = self.n_k[0] - odd\r\n x = self.n_k[1] - ((self.n_k[0] - 2) // 2)\r\n numbers.append(x)\r\n numbers.append(x * 2)\r\n x *= 2\r\n x += 1\r\n for n in range(self.n_k[0] - 2):\r\n numbers.append(x)\r\n x += 1\r\n if odd:\r\n numbers.append(x)\r\n self.result = \" \".join([str(x) for x in numbers])\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask414ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n,m=map(int,input().split())\r\nt=n//2\r\n\r\nif t>m or (n==1 and m>0):\r\n print(-1)\r\nelse:\r\n m-=t\r\n ans=[]\r\n \r\n if m>0:\r\n m+=1\r\n n-=2\r\n ans.append(m)\r\n ans.append(m*2)\r\n g=m*2+1\r\n for i in range(g,g+n):\r\n ans.append(i)\r\n print(*ans)\r\n \r\n", "from math import log, ceil\r\nfrom collections import defaultdict\r\nn,k = [int(x) for x in input().split()]\r\nl = [i for i in range(1,n+1)]\r\n\r\nd = k - n//2 + 1\r\nif (n//2>k):\r\n print(-1)\r\nelif n==1:\r\n if k==0:\r\n print(1)\r\n \r\n else:\r\n print(-1)\r\nelse:\r\n d = k-n//2+1 \r\n l[0] = d \r\n l[1] = 2*d\r\n for i in range(2,n):\r\n l[i] = l[i-1]+1\r\n print(*l)\r\n " ]

[ "x1,y1,r1=list(map(float,input().split()))\r\nx2,y2,r2=list(map(float,input().split()))\r\nif r1>r2:\r\n r2,r1=r1,r2\r\nd=((x2-x1)**2 + (y2-y1)**2)**(0.5)\r\nif d>r1+r2:\r\n print((d-(r1+r2))/2)\r\nelif r2>d+r1:\r\n print((r2-(r1+d))/2)\r\nelse:\r\n print(0)", "import math\r\n\r\nx1,y1,r1=map(int,input().split())\r\nx2,y2,r2=map(int,input().split())\r\n\r\nd=(x2-x1)**2+(y2-y1)**2\r\nans=0.0\r\n\r\nif(d>=(r1+r2)**2):\r\n ans=math.sqrt(d)-r1-r2\r\n\r\nelif(d>=(r1-r2)**2):\r\n ans=0.0\r\n\r\nelse:\r\n ans=abs(r1-r2)-math.sqrt(d)\r\n\r\nans/=2\r\nprint(ans)\r\n", "# https://codeforces.com/contest/190\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nx1, y1, r1 = map(int, input().split())\nx2, y2, r2 = map(int, input().split())\nif r1 < r2:\n r1, r2 = r2, r1\n\nd = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\n\nif d >= r1 + r2:\n print((d - r1 - r2) / 2)\nelif r1 >= d + r2:\n print((r1 - r2 - d) / 2)\nelse:\n print(0)\n", "import sys\r\ninput=sys.stdin.readline\r\nx1,y1,r1=map(int,input().split())\r\nx2,y2,r2=map(int,input().split())\r\nd=((x1-x2)**2+(y1-y2)**2)**0.5\r\nd-=r1+r2\r\nif d>=0:\r\n print(d/2)\r\nelse:\r\n d+=r1+r2\r\n x=max(r1,r2)-d-min(r1,r2)\r\n x/=2\r\n print(max(0,x))", "import math\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\nd = math.sqrt((a1[0] - a2[0]) ** 2 + (a1[1] - a2[1]) ** 2)\r\nr = min(a1[2], a2[2])\r\nR = max(a1[2], a2[2])\r\nif d + r < R or d + r == R:\r\n print((R - d - r) / 2)\r\nelif d < r + R or d == r + R :\r\n print('0')\r\nelse :\r\n print((d - a1[2] - a2[2]) / 2)", "a, b, c = map(int, input().split())\r\nd, e, f = map(int, input().split())\r\nr = ((a - d)**2 + (b - e)**2) ** .5\r\nif r >= c + f:\r\n print((r - c - f) / 2)\r\nelif r <= abs(c - f):\r\n print((abs(c - f) - r) / 2)\r\nelse:\r\n print(0)\r\n", "import math\nimport sys\n\nx1,y1,r1 = map(int, input().split()) \nx2,y2,r2 = map(int, input().split())\n\nt = (x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)\n\nif t <= (r1-r2)*(r1-r2):\n print((abs(r1-r2) - math.sqrt(t))/2)\nelif t <= (r1+r2)*(r1+r2):\n\tprint(0)\nelse:\n print((math.sqrt(t)- r1-r2)/2)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx1, y1, r1 = map(int, input().split())\r\nx2, y2, r2 = map(int, input().split())\r\nif r1 > r2:\r\n x1, x2 = x2, x1\r\n y1, y2 = y2, y1\r\n r1, r2 = r2, r1\r\nd = (pow(x1 - x2, 2) + pow(y1 - y2, 2)) ** (1 / 2)\r\nif d >= r1 + r2:\r\n ans = (d - r1 - r2) / 2\r\nelif r1 + d < r2:\r\n ans = (r2 - r1 - d) / 2\r\nelse:\r\n ans = 0\r\nprint(ans)", "x1,y1,r1=map(int,input().split())\nx2,y2,r2=map(int,input().split())\nd=((x1-x2)**2+(y1-y2)**2)**0.5\nx=(d-r1-r2)/2\nf=-x-min(r1,r2)\nif(x>=0):\n\tprint(x)\nelif f>=0:\n\tprint(f)\nelse:\n\tprint(0)\n", "a, b, c=[int(k) for k in input().split()]\r\nx, y, z=[int(k) for k in input().split()]\r\nv=((a-x)**2+(b-y)**2)**0.5\r\nif v+c<z:\r\n print((z-(v+c))/2)\r\nelif v+z<c:\r\n print((c-(v+z))/2)\r\nelif v<=c+z:\r\n print(0)\r\nelse:\r\n print((v-(c+z))/2)", "from math import pow\r\nn, m, r = map(int, input().split())\r\nn1, m1, r1 = map(int, input().split())\r\ndis = pow(pow(n1-n,2)+pow(m-m1,2), 1/2)\r\nif abs(r1-r)<=dis<=abs(r1+r):\r\n rad = 0\r\nelif dis<r1+r:\r\n if r1>r:\r\n rad = r1-dis-r\r\n else:\r\n rad = r -dis-r1\r\nelse:\r\n rad = dis-(r+r1)\r\n \r\nprint(rad/2)\r\n", "x1, y1, r1 = map(int, input().split())\r\nx2, y2, r2 = map(int, input().split())\r\nd = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\r\nif d >= r1 + r2:\r\n print((d - r1 - r2) / 2)\r\nelse:\r\n print(max(0, (max(r1, r2) - d - min(r1, r2))) / 2)", "from math import *\r\nx1,y1,r1 = map(int,input().split())\r\nx2,y2,r2 = map(int,input().split())\r\ndist = sqrt((x1-x2)**2+(y1-y2)**2)\r\ndist -= r1+r2\r\n#print(dist)\r\nif dist>=0: print(dist/2)\r\nelse:\r\n dist += r1+r2\r\n x = (max(r1,r2)-dist-min(r1,r2))/2\r\n print(max(x,0))\r\n ", "from math import sqrt\r\na, b = list(map(int, input().split())), list(map(int, input().split()))\r\nd = sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)\r\na, b = a[2], b[2]\r\nif d >= a + b: \r\n print((d - a - b) / 2)\r\nelse:\r\n if a > b: \r\n a, b = b, a\r\n print(max(0, (b - d - a) / 2))", "x1,y1,r1=map(int,input().split())\r\nx2,y2,r2=map(int,input().split())\r\nr=((x2-x1)**2+(y2-y1)**2)**0.5\r\nif r>r1+r2:\r\n print((r-(r1+r2))/2)\r\nelif r<abs(r1-r2): # не пересекаются\r\n print((abs(r1-r2)-r)/2)\r\nelse:\r\n print(0)\r\n \r\n", "import math\r\nx1,y1,r1=map(int,input().split(\" \"))\r\nx2,y2,r2=map(int,input().split(\" \"))\r\ns = math.sqrt((x1-x2)**2+(y1-y2)**2)\r\nrm=max(r1,r2)\r\nif rm!=r1:\r\n r2=r1\r\n r1=rm\r\nif s>=r1+r2:\r\n ans = s-r2-r1\r\n ans = ans/2\r\nelif r1-s>=r2:\r\n ans = r1-r2-s\r\n ans = ans/2\r\nelse:\r\n ans=0\r\nprint(ans)", "import sys\r\nimport math\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\nmod = int(1e9)+7\r\n\r\nx1, y1, r1 = rinput() \r\nx2, y2, r2 = rinput()\r\n\r\nd = math.sqrt((x2-x1)*(x2-x1) + (y2-y1)*(y2-y1)) - r1 - r2\r\nr = d/2\r\nf = -(r + min(r1, r2))\r\n# print(r)\r\nif r>=0:\r\n\tprint(r)\r\nelif f>=0:\r\n\tprint(f)\r\nelse:\r\n\tprint(0)", "from math import sqrt\r\n\r\n\r\ndef around(x1, y1, r1, x2, y2, r2):\r\n r = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\r\n if r >= r1 + r2:\r\n return '{:6f}'.format((r - r1 - r2) / 2)\r\n elif r <= abs(r1 - r2):\r\n return '{:6f}'.format((abs(r1 - r2) - r) / 2)\r\n return 0\r\n\r\n\r\nX1, Y1, R1 = [int(i) for i in input().split()]\r\nX2, Y2, R2 = [int(i) for i in input().split()]\r\nprint(around(X1, Y1, R1, X2, Y2, R2))\r\n", "from math import hypot\nx1,y1,r1=map(float,input().split())\nx2,y2,r2=map(float,input().split())\nd=hypot(x1-x2,y1-y2)\nif d<abs(r1-r2):\n d=abs(r1-r2)-d\nelse:\n d=max(0,d-r1-r2)\nprint(d/2)\n", "import math\r\nx1,y1,r1=map(int,input().split())\r\nx2,y2,r2=map(int,input().split())\r\nd=math.sqrt((x1-x2)**2+(y1-y2)**2)\r\nif math.sqrt((x1-x2)**2+(y1-y2)**2)>r1+r2:\r\n print((math.sqrt((x1-x2)**2+(y1-y2)**2)-r1-r2)/2) \r\nelif d<abs(r1-r2):\r\n print((max(r1,r2)-d-min(r1,r2))/2)\r\nelse:print('0')", "def dista(x1,y1,x2,y2):\r\n dist=((x2-x1)**2+(y2-y1)**2)**(0.5)\r\n return dist\r\nx1,y1,r1=[int(i) for i in input().split()]\r\nx2,y2,r2=[int(i) for i in input().split()]\r\n\r\nif(dista(x1,y1,x2,y2)+min(r1,r2)<=max(r1,r2)):\r\n ans=max(r1,r2)-dista(x1,y1,x2,y2)-min(r1,r2)\r\n ans1=max(r1,r2)-min(r1,r2)\r\n ans/=2\r\n ans1/=2\r\n print(min(ans,ans1))\r\nelse:\r\n ans=dista(x1,y1,x2,y2)-r1-r2\r\n ans/=2\r\n if(ans>0):\r\n print(ans)\r\n else:\r\n print(0)\r\n", "from math import sqrt\r\n\r\nx1, y1, r1 = map(int, input().split())\r\nx2, y2, r2 = map(int, input().split())\r\nif r1 < r2:\r\n x1, x2 = x2, x1\r\n y1, y2 = y2, y1\r\n r1, r2 = r2, r1\r\n\r\ndist = sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\r\nans = 0.0\r\n\r\nif dist > r1 + r2:\r\n ans = (dist - r1 - r2) / 2\r\nelif r1 - r2 > dist:\r\n ans = (r1 - r2 - dist) / 2\r\nelse:\r\n ans = 0.0\r\n\r\nprint(\"%.15f\" % ans)\r\n", "import math\r\nx1, y1, r1 = map(int, input().split())\r\nx2, y2, r2 = map(int, input().split())\r\ntemp = math.sqrt(abs(x1-x2)**2 + abs(y1-y2)**2)\r\n\r\nif temp >= r1+r2:\r\n print((temp-r1-r2)/2)\r\nelif max(r1, r2) >= temp + min(r1, r2):\r\n print((max(r1, r2)-temp-min(r1, r2))/2)\r\nelse:\r\n print(0)\r\n", "a, b, c = map(int, input().split(' '))\r\nd, e, f = map(int, input().split(' '))\r\n\r\ndist = (abs(a-d)**2+abs(b-e)**2)**0.5\r\n\r\nmaxx = max(c, f)\r\nminn = min(c, f)\r\n\r\nif maxx > minn + dist:\r\n print((maxx-minn-dist)/2)\r\n\r\nelse:\r\n print(max(0, (dist-c-f)/2))" ]

[ "from functools import cache\n\n\nN, M = [int(w) for w in input().split()]\nr, c = [int(w) for w in input().split()]\n# print(N, M, r, c)\n\n# @cache\ndef calc(r: int, c: int) -> float:\n if r == N:\n return 0\n e, a, b = [0.] * M, [0.] * M, [0.] * M\n for l in range(N - 1, r - 1, -1):\n a[0], b[0] = 0.5, 0.5*(3 + e[0])\n for k in range(1, M -1):\n a[k] = 1 / (3 - a[k - 1])\n b[k] = a[k] * (b[k - 1] + 4 + e[k])\n e[-1] = (3 + b[-2] + e[-1])/(2 - a[-2])\n for k in range(M - 2, -1, -1):\n e[k] = a[k] * e[k + 1] + b[k]\n return e[c]\n \nif M == 1:\n print(2.0 * (N - r))\nelse:\n print(calc(r, c - 1))\n" ]

[ "x=int(input())\r\nl=x\r\nm=2*x+1\r\narr = [[\" \" for _ in range(m)] for _ in range(m)]\r\nleft=right=l\r\nwhile(x>=0):\r\n up=down=l\r\n y=x\r\n while(y>=0):\r\n arr[up][left]=str(y)\r\n arr[up][right]=str(y)\r\n arr[down][left]=str(y)\r\n arr[down][right]=str(y)\r\n y-=1\r\n up-=1\r\n down+=1\r\n x-=1\r\n left-=1\r\n right+=1\r\narr1=[\" \".join(i) for i in arr]\r\narr1=[i.rstrip() for i in arr1]\r\narr2=\"\\n\".join(arr1)\r\nprint(arr2)", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n = int(input())\n for i in range(n * 2 + 1):\n s = ' '.join([str(x) for x in range(min(n, i) + 1)])\n if i > n:\n s = s[:-(i - n) * 2].strip()\n print(\n f\"{' ' * (abs(n - i)) + s + ''.join(str(x) for x in reversed(s[:-1]))}\".rstrip())\n\n\nif __name__ == \"__main__\":\n main()\n", "r=range;N=int(input())\r\nfor i in[*r(N),*r(N,-1,-1)]:print(*' '*(N-i),*r(i+1),*r(i-1,-1,-1))", "def MadeStringFromDigits(number: int) -> str:\r\n halfString = \" \".join(str(i) for i in range(0, number))\r\n\r\n return (halfString + \" \" + str(number) + \" \" + halfString[::-1]).strip()\r\n\r\n\r\nnum = int(input())\r\n\r\nfirstHalfHandkerchief = \"\"\r\nsecondtHalfHandkerchief = \"\"\r\n\r\nstep = 0\r\n\r\nfor currentNumber in range(0, num):\r\n firstHalfHandkerchief = firstHalfHandkerchief + (\" \" * ((num * 2) - step)) + MadeStringFromDigits(currentNumber) + \"\\n\"\r\n if currentNumber == num - 1:\r\n secondtHalfHandkerchief = secondtHalfHandkerchief + (\" \" * (step + 2)) + MadeStringFromDigits((num - currentNumber) - 1)\r\n else:\r\n secondtHalfHandkerchief = secondtHalfHandkerchief + (\" \" * (step + 2)) + MadeStringFromDigits((num - currentNumber) - 1) + \"\\n\"\r\n \r\n step += 2\r\n\r\nresult = firstHalfHandkerchief + MadeStringFromDigits(num) + '\\n' + secondtHalfHandkerchief\r\n\r\nprint(result)", "# n=int(input())\r\n# for i in range(6):\r\n# for j in range(5-i+1):\r\n# print(\" \", end=\"\")\r\n# for j in range(i+1):\r\n# print(j, end=\" \")\r\n# for j in range(i):\r\n# print(i-j-1, end=\" \")\r\n# print()\r\n\r\n# for i in range(6):\r\n# for j in range(5-i+1):\r\n# print(\" \", end=\"\")\r\n# for j in range(i+1):\r\n# print(j, end=\" \")\r\n# for j in range(i):\r\n# print(i-j-1, end=\" \")\r\n \r\n# for j in range(i+1):\r\n# print(\" \", end=\"\")\r\n# for j in range(5-i+1):\r\n# print(j, end=\" \")\r\n# for j in range(i):\r\n# print(i-j-1, end=\" \")\r\n# print()\r\n\r\nn = int(input())\r\n\r\nfor row in range(-n, n + 1):\r\n top = n - abs(row)\r\n for i in range(abs(row)):\r\n print(\" \", end=\"\")\r\n for i in range(top):\r\n print(i, end=\" \")\r\n for i in range(top, 0, -1):\r\n print(i, end=\" \")\r\n print(0)\r\n", "def main(n):\n # n = int(input())\n\n def printPattern(n):\n if n == 0:\n print(n)\n return\n for i in range(n + 1):\n print(i, end=' ')\n\n # Count down from n-1 to 0\n for i in range(n - 1, -1, -1):\n if i == 0:\n print(i, end='')\n else: print(i, end=' ')\n\n print()\n\n for i in range(n+1):\n print(\" \" * (n-i), end=\"\")\n printPattern(i)\n\n for i in range(n-1, -1, -1):\n print(\" \" * (n-i), end=\"\")\n printPattern(i)\n\nn = int(input())\nmain(n)\n\n \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\nfor row in range(-n, n+1):\r\n top = n - abs(row)\r\n for i in range(abs(row)):\r\n print(\" \", end=\"\")\r\n for i in range(top):\r\n print(i, end=\" \")\r\n for i in range(top, 0, -1):\r\n print(i, end=\" \")\r\n print(0)", "n = int(input())\r\n\r\nfor i in range(n + 1):\r\n if i != 0:\r\n print(' '*(n*2-i*2) + \" \".join(list(map(str, range(i+1)))), \" \".join(list(map(str, reversed(range(i))))))\r\n else:\r\n print(' '*(n*2-i*2) + \" \".join(list(map(str, range(i+1)))))\r\n\r\nfor i in reversed(range(n)):\r\n if i != 0:\r\n print(' '*(n*2-i*2) + \" \".join(list(map(str, range(i+1)))), \" \".join(list(map(str, reversed(range(i))))))\r\n else:\r\n print(' '*(n*2-i*2) + \" \".join(list(map(str, range(i+1)))))\r\n\r\n ", "n=int(input())\r\ns=[]\r\nq1='0'\r\nq2='0 1 0'\r\nq3='0 1 2 1 0'\r\nq4='0 1 2 3 2 1 0'\r\nq5='0 1 2 3 4 3 2 1 0'\r\nq6='0 1 2 3 4 5 4 3 2 1 0'\r\nq7='0 1 2 3 4 5 6 5 4 3 2 1 0'\r\nq8='0 1 2 3 4 5 6 7 6 5 4 3 2 1 0'\r\nq9='0 1 2 3 4 5 6 7 8 7 6 5 4 3 2 1 0'\r\nq10='0 1 2 3 4 5 6 7 8 9 8 7 6 5 4 3 2 1 0'\r\ns.append(q1)\r\ns.append(q2)\r\ns.append(q3)\r\ns.append(q4)\r\ns.append(q5)\r\ns.append(q6)\r\ns.append(q7)\r\ns.append(q8)\r\ns.append(q9)\r\ns.append(q10)\r\n\r\nj=n*2\r\nfor i in range(2):\r\n if j ==n*2 :\r\n while j > 0 :\r\n print(\" \"*j,end=\"\")\r\n print(s[n-(j//2)])\r\n j-=2\r\n elif j == 0 :\r\n while j < (n*2)+2 :\r\n print(\" \" * j , end=\"\")\r\n print(s[n - (j//2)])\r\n j+=2\r\n\r\n", "n=int(input())\r\nl=[]\r\nl2=[]\r\ns=str(0)\r\nl.append(s)\r\ns=str(0)+str(1)+str(0)\r\nl.append(s)\r\nfor i in range (2,n+1):\r\n s=s[:i]+str(i)+str(i-1)+s[i:]\r\n l.append(s)\r\nfor i in range(len(l)):\r\n l2.append((l[i].replace(\"\", \" \")[1: -1]))\r\nm=n*2\r\nfor i in range (len(l2)):\r\n print((m)*\" \" + l2[i])\r\n m-=2\r\nm+=4\r\nfor i in reversed(range(len(l2)-1)):\r\n print((m)*\" \" + l2[i])\r\n m+=2\r\n ", "n=int(input())\r\ns='0123456789'\r\nfor i in s[:n]+s[n::-1]:\r\n\ta=int(i)\r\n\tprint(' '.join(' '*(n-a)+s[:a]+s[a::-1]))", "n=int(input())\r\nfor i in range(2*n+1):\r\n lin=\"\"\r\n for j in range(2*n+1):\r\n val=n-max(i-n,n-i)-max(j-n,n-j)\r\n if val<0:\r\n lin+=\" \"\r\n else:\r\n lin+=f\"{val} \"\r\n print(lin.rstrip())", "n=int(input())\r\nfor i in range(0,n+1):\r\n print(\" \"*(2*(n-i)),end=\"\")\r\n for j in range(2*i+1):\r\n print(min(2*i-j,j),end=\"\")\r\n if(j<2*i):print(\" \",end=\"\")\r\n print()\r\nfor i in range(n-1,-1,-1):\r\n print(\" \"*(2*(n-i)),end=\"\")\r\n for j in range(2*i+1):\r\n print(min(2*i-j,j),end=\"\")\r\n if(j<2*i):print(\" \",end=\"\")\r\n print()" ]

[ "# My Solution for CF 919/F.\r\nimport sys\r\nimport itertools\r\nfrom collections import deque\r\n\r\nt = int(input())\r\n\r\nhand_size = 8\r\nnum_values = 5\r\nres = 1\r\nfor x in range(hand_size + 1, hand_size + num_values):\r\n res *= x\r\nfor x in range(1, num_values):\r\n res //= x\r\n# res = (handsize + numvalues - 1) choose (handsize)\r\ncounts = [0] * res * 5\r\n\r\n# Precompute the possible winning/losing locations.\r\n# First, generate the possible hand values, and turn them into integers.\r\nm = {}\r\nfor i, v in enumerate(itertools.combinations(range(hand_size + num_values - 1), num_values - 1)):\r\n prev = -1\r\n ind = 0\r\n for x in v:\r\n counts[i * 5 + ind] = x - prev - 1\r\n prev = x\r\n ind += 1\r\n counts[i * 5 + ind] = hand_size + num_values - prev - 2\r\n m[tuple(counts[i*5:i*5+5])] = i\r\n\r\n# 0 = DEAL\r\n# 1 = WIN\r\n# -1 = LOSE\r\nCURRENT_STATUS = [0] * (res * res)\r\nDEG = [0] * (res * res)\r\n\r\n# Now, any vertex is just two numbers, ranging from 0 to res-1.\r\n# We assume for a particular node that it is my turn.\r\n# Then in the recursion we simply invert at each opportunity.\r\ndecided_queue = deque()\r\nwin_index = m[(hand_size, 0, 0, 0, 0)]\r\nfor i in range(res):\r\n if i != win_index:\r\n decided_queue.append(win_index * res + i)\r\n CURRENT_STATUS[win_index * res + i] = 1\r\n decided_queue.append(i * res + win_index)\r\n CURRENT_STATUS[i * res + win_index] = -1\r\n\r\nfor i in range(res * res):\r\n id1 = i // res\r\n id2 = i % res\r\n # What choices can I make as id1?\r\n n_options_l = 0\r\n for x in range(1, 5):\r\n if counts[id1 * 5 + x] > 0:\r\n n_options_l += 1\r\n n_options_r = 0\r\n for x in range(1, 5):\r\n if counts[id2 * 5 + x] > 0:\r\n n_options_r += 1\r\n DEG[i] = n_options_l * n_options_r\r\n\r\np = [False] * (res * res)\r\nparent = [-1] * (res * res)\r\n\r\nwhile len(decided_queue) > 0:\r\n index = decided_queue.pop()\r\n if p[index]:\r\n raise ValueError(\"Cycle bad.\")\r\n p[index] = True\r\n # Check all possible inroads to this state.\r\n # Which of the cards could've p2 just made?\r\n id1 = index // res\r\n id2 = index % res\r\n for x in range(5):\r\n if counts[id2 * 5 + x] > 0:\r\n # We could've made this card.\r\n # But what would the card have been / what of my cards should they have picked?\r\n for y in range(1, 5):\r\n if counts[id1 * 5 + y] > 0:\r\n # They could've picked this card.\r\n # x = y + z mod 5. So z = x - y mod 5.\r\n z = (x - y) % 5\r\n if z == 0:\r\n continue\r\n n_count = [counts[id2 * 5 + i] for i in range(5)]\r\n n_count[x] -= 1\r\n n_count[z] += 1\r\n old_id2 = m[tuple(n_count)]\r\n # Remember to flip\r\n old_index = old_id2 * res + id1\r\n if CURRENT_STATUS[old_index] == 0:\r\n DEG[old_index] -= 1\r\n if CURRENT_STATUS[index] == -1:\r\n # If the other player is winning here, they can move here to win.\r\n CURRENT_STATUS[old_index] = 1\r\n decided_queue.append(old_index)\r\n parent[old_index] = index\r\n else:\r\n if DEG[old_index] == 0:\r\n # We've tried every edge and all of them are winning for me, so losing for the person above.\r\n CURRENT_STATUS[old_index] = -1\r\n decided_queue.append(old_index)\r\n parent[old_index] = index\r\n\r\nfor case in range(t):\r\n f = int(input())\r\n alice_hand = tuple(map(int, input().split()))\r\n c = [0] * num_values\r\n for h in alice_hand:\r\n c[h] += 1\r\n alice = m[tuple(c)]\r\n bob_hand = tuple(map(int, input().split()))\r\n c = [0] * num_values\r\n for h in bob_hand:\r\n c[h] += 1\r\n bob = m[tuple(c)]\r\n if f == 0:\r\n index = alice * res + bob\r\n if CURRENT_STATUS[index] == 0:\r\n print(\"Deal\")\r\n elif CURRENT_STATUS[index] == 1:\r\n print(\"Alice\")\r\n else:\r\n print(\"Bob\")\r\n else:\r\n index = bob * res + alice\r\n if CURRENT_STATUS[index] == 0:\r\n print(\"Deal\")\r\n elif CURRENT_STATUS[index] == 1:\r\n print(\"Bob\")\r\n else:\r\n print(\"Alice\")\r\n" ]

[ "n = int(input())\r\nres = 0\r\n\r\nwhile n > 0:\r\n n -= 1\r\n x, y = input().split()\r\n x = int(x)\r\n y = int(y)\r\n while x <= res:\r\n x += y\r\n res = x\r\n\r\nprint(res)", "n=int(input())\r\nx=int(input().split()[0])\r\nfor i in range(n-1):\r\n c,d=map(int,input().split())\r\n if c<=x:x=c+((x-c)//d+1)*d\r\n else :x=c\r\nprint(x)", "n=int(input())\r\ne=0\r\nfor i in range(n):\r\n a,b=[int(i) for i in input().split()]\r\n if(i==0):\r\n e=a\r\n else:\r\n if(a<=e):\r\n while(a<=e):\r\n a=a+b\r\n e=a\r\n else:\r\n e=a\r\nprint(e)", "r=0\r\nfor _ in[0]*int(input()):\r\n s,d=map(int,input().split())\r\n r=[(r-s+d)//d*d+s,s][r<s]\r\nprint(r)", "n = int(input())\r\nb = 0\r\nfor i in range(n):\r\n s, d = map(int, input().split())\r\n if b < s:\r\n b = s\r\n else:\r\n while b >= s:\r\n s += d\r\n b = s\r\nprint(b)", "doctors = int(input())\nd = 0\nwhile doctors:\n j, p = [int(x) for x in input().split()]\n doctors -= 1\n if j > d:\n d = j\n else:\n k = (d - j) // p + 1\n d = j + k * p\nprint(d)\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n x = list(map(int, input().split(\" \")))\r\n if x[0]>count: count=x[0]\r\n else:\r\n count=(x[0]+(((count-x[0]))//x[1]+1)*x[1])\r\nprint(count)", "# https://codeforces.com/problemset/problem/879/A\n# 900\n\nn = int(input())\n\ndoctors = []\nfor _ in range(n):\n s, e = map(int, input().split())\n doctors.append((s, e))\n\n\nday = 1\ndoctor = 0\nwhile True:\n s, e = doctors[doctor]\n if (day >= s):\n if (day - s) % e == 0:\n doctor += 1\n\n if doctor == len(doctors):\n break\n \n\n day += 1\n\nprint(day)", "n=int(input())\r\ncurr=0\r\nfor i in range(n):\r\n s,d=map(int,input().split())\r\n if curr<s:\r\n curr=s\r\n else:\r\n curr=d*(1+((curr-s)//d))+s\r\nprint(curr)", "import math\r\nn=int(input())\r\ns,d=map(int, input().split())\r\nm=s\r\nfor i in range(1,n):\r\n s,d=map(int, input().split())\r\n r=math.floor((m-s)/d+1)\r\n if r<0:\r\n r=0\r\n m=s+r*d\r\n \r\nprint(m)\r\n", "import bisect\r\nimport os\r\nfrom collections import Counter\r\nimport bisect\r\nfrom collections import defaultdict\r\nimport math\r\nimport random\r\nimport heapq as hq\r\nfrom math import sqrt\r\nimport sys\r\nfrom functools import reduce, cmp_to_key\r\nfrom collections import deque\r\nimport threading\r\nfrom itertools import combinations\r\nfrom io import BytesIO, IOBase\r\nfrom itertools import accumulate\r\n\r\n# sys.setrecursionlimit(200000)\r\n# mod = 10**9+7\r\n# mod = 987\r\n\r\ndef lcm(a,b):\r\n return (a*b)//math.gcd(a,b)\r\n\r\ndef sort_dict(key_value):\r\n return sorted(key_value.items(), key = lambda kv:(kv[1], kv[0]))\r\n\r\ndef list_input():\r\n return list(map(int,input().split()))\r\n \r\ndef num_input():\r\n return map(int,input().split())\r\n \r\ndef string_list():\r\n return list(input())\r\n \r\n \r\ndef solve():\r\n n = int(input())\r\n days, _ = map(int, input().split())\r\n for i in range(n-1):\r\n a, d = map(int, input().split())\r\n days = a + max(math.ceil((days+1-a)/d), 0)*d\r\n print(days)\r\n\r\n\r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n solve()\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "c = 0\r\nfor _ in range(int(input())):\r\n s, d = map(int, input().split())\r\n c += 1\r\n c = max(s, s + ((c-s)//d + ((c-s)%d>0))*d)\r\nprint(c)", "n = 0\r\nfor i in range(int(input())):\r\n first, dt = tuple(map(int, input().split()))\r\n n = first + max(0, dt * ((n - first) // dt + 1))\r\nprint(n)", "n=int(input())\r\na=-1\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n a=max(p,a+1)\r\n while (a-p)%q:a+=1\r\nprint(a)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\ncur_day = 0\r\n\r\nfor _ in range(n):\r\n s, d = map(int, sys.stdin.readline().split())\r\n if s > cur_day:\r\n cur_day = s\r\n continue\r\n\r\n cur_day = s + (cur_day - s + d) // d * d\r\n\r\nprint(cur_day)", "import math\r\nn = int(input())\r\nt = - 1\r\nfor doctor in range(n):\r\n s, d = [int(x) for x in input().split(' ')]\r\n if t < s:\r\n t = s\r\n else:\r\n t = s + d * ((t - s) // d + 1)\r\nprint(t)\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nres=a[0]\r\nfor i in range(n-1):\r\n b=[int(x) for x in input().split()]\r\n if res==b[0]:\r\n res+=b[1]\r\n elif res<b[0]:\r\n res=b[0]\r\n else:\r\n res+=1\r\n if (res-b[0])%b[1]!=0:\r\n res+=b[1]-((res-b[0])%b[1])\r\nprint(res)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n s, d = map(int, input().split())\r\n while s <= ans:\r\n s += d\r\n ans = s\r\nprint(ans)", "x = int(input())\nday_num = super_days = 1\nitters = 0\ndoctors = [[*map(int, input().split())] for _ in range(x)]\n\nwhile 1:\n itters+=1\n if day_num<=doctors[0][0]:\n day_num = doctors[0][0]\n elif day_num<doctors[0][0]+doctors[0][1]:\n day_num += doctors[0][0]+doctors[0][1]-day_num\n if (abs(day_num-doctors[0][0])%doctors[0][1] == 0):\n doctors = doctors[1:]\n day_num+=1\n\n if not doctors:\n break\n\nprint(day_num-1)\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n s,d=map(int,input().split())\r\n if s>x:\r\n x=s\r\n else:\r\n x=x-(x-s)%d+d\r\nprint(x)", "x = int(input())\nday_num = 1\ndoctors = [[*map(int, input().split())] for _ in range(x)]\n\nwhile 1:\n\tif day_num<doctors[0][0]:\n\t\tday_num = doctors[0][0]\n\tif (abs(day_num-doctors[0][0])%doctors[0][1] == 0):\n\t\tdoctors = doctors[1:]\n\tday_num += 1\n\n\tif not doctors:\n\t\tbreak\nprint(day_num-1)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n s, d = map(int, input().split())\r\n if s > ans:\r\n ans = s\r\n else:\r\n ans = s + d*((ans-s)//d+1)\r\nprint(ans)\r\n", "def main():\r\n n = int(input())\r\n min_v = 1\r\n for i in range(n):\r\n s,p = [int(v) for v in input().split()]\r\n min_v = max(s, min_v)\r\n ad = 1 if (min_v-s)%p!=0 else 0\r\n d = s +((min_v-s)//p+ad)*(p)\r\n min_v = max(d, s)+1\r\n\r\n print(min_v-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x = lambda: map(int,input().split())\r\nn, = x()\r\ncnt = 0; c = 0\r\nfor i in range(n):\r\n a,b = x()\r\n j = c+1; cnt2 = 0\r\n while True:\r\n if(j in range(a,10**20,b)): cnt += (j-c); c = j;break\r\n if(j%b and cnt2 != 0): cnt2 = 1\r\n if(cnt2): j += b\r\n else: j += 1\r\nprint(cnt)", "#https://codeforces.com/problemset/problem/879/A\nans=0\nfor _ in range(int(input())):\n\ts,d=map(int,input().split())\n\tif ans==0:\n\t\tans+=s\n\telse:\n\t\tif s>ans:\n\t\t\tans=s\n\t\telse:\n\t\t\tt=s\n\t\t\twhile t<=ans:\n\t\t\t\tt+=d\n\t\t\tans=t\nprint(ans)\n", "n=int(input())\r\nfrom math import ceil\r\na=0\r\nfor i in range(n):\r\n\ts,d=map(int,input().split())\r\n\tif s>a:\r\n\t\ta=s\r\n\telse:\r\n\t\tx=(a+1-s)/d\r\n\t\ta=s+ceil(x)*d\r\nprint(a)", "n = int(input())\r\ncur = 0\r\nfor i in range(n):\r\n s,d = [int(s) for s in input().split()]\r\n if cur < s:\r\n cur = s\r\n elif (cur-s) % d == 0:\r\n cur += d\r\n else:\r\n cur = s + ((cur-s)//d+1)*d\r\nprint(cur)", "n = int(input())\nSD = []\nfor i in range(n):\n s, d = map(int, input().split())\n SD.append((s, d))\n\ncur = 0\nfor i in range(n):\n s, d = SD[i]\n if cur < s:\n cur = s\n elif cur > s:\n q,r = divmod(cur-s, d)\n cur = s+d*(q+1)\n else:\n cur = s+d\nprint(cur)\n", "n = [[int(x) for x in input().split()] for _ in range(int(input()))]\r\n\r\nt = 1\r\n\r\nfor s, d in n:\r\n if t <= s:\r\n t = s + 1\r\n continue\r\n\r\n dt = (t-s) // d\r\n t = s+(d * dt) if (d * dt == t-s) else s+(d * (dt+1))\r\n t += 1\r\n\r\nprint(t-1)", "a=0\r\nfor i in range(int(input())):\r\n s,d=list(map(int,input().split()))\r\n a += 1\r\n while a<s or (a-s)%d!=0: a += 1\r\nprint(a)\r\n", "n = int(input())\r\nans = 0\r\n\r\ns = []\r\nd = []\r\n\r\nfor i in range(n): \r\n S, D = map(int, input().split())\r\n s.append(S)\r\n d.append(D)\r\n\r\nfor i in range(n):\r\n if ans < s[i]:\r\n ans = s[i]\r\n else:\r\n k = (ans - s[i]) // d[i]\r\n ans = s[i] + (k + 1) * d[i]\r\n \r\nprint(ans)\r\n", "n = int(input())\r\nbd, dd = map(int, input().split())\r\nfor u in range(n - 1):\r\n s, d = map(int, input().split())\r\n while s <= bd: s += d\r\n bd = s\r\nprint(bd)", "doctor = int(input())\r\ndoctctr = [0]\r\nfor i in range(doctor):\r\n start,everydays = map(int,input().split())\r\n ctr = start\r\n dif = doctctr[i]-start\r\n c = dif//everydays\r\n ctr+= c*everydays\r\n if ctr< start:\r\n ctr = start\r\n while ctr <= int(doctctr[i]):\r\n ctr+=everydays\r\n doctctr.append(ctr)\r\nprint(doctctr[doctor]) ", "# LUOGU_RID: 101736407\nt = 0\r\nfor _ in range(int(input())):\r\n s, d = map(int, input().split())\r\n while True:\r\n t += 1\r\n if (t - s) % d == 0 and t >= s:\r\n break\r\nprint(t)", "n = int(input())\r\nmin_day = 0\r\nfor i in range(n):\r\n begin, end = [int(i) for i in input().split()]\r\n if min_day < begin:\r\n min_day = begin\r\n else:\r\n min_day += end - (min_day - begin) % end\r\nprint(min_day)\r\n", "result = 0\r\nfor i in range(int(input())):\r\n s, d = map(int, input().split())\r\n if result < s:\r\n result = s\r\n else:\r\n result = s + ((result - s) // d + 1) * d\r\nprint(result)\r\n", "n = int(input())\r\nt = 1\r\nfor i in range(n):\r\n\ts, d = map(int, input().split())\r\n\tif t <= s:\r\n\t\tt = s\r\n\telse:\r\n\t\tk = (t - s) // d\t\r\n\t\twhile s + k * d < t:\r\n\t\t\tk += 1\r\n\t\tt = s + k * d\r\n\tt += 1\r\n\t\r\nprint(t - 1)\r\n", "t = int(input())\n(s1, d1), k1 = map(int, input().split()), 0\nfor _ in range(t - 1):\n s2, d2 = map(int, input().split())\n s1, d1, k1 = s2, d2, int(((s1 + k1 * d1 - s2) / d2) + 1)\n if s2 > s1 + k1 * d1:\n k1 = 0\nprint(s1 + k1 * d1)\n", "n = int(input())\r\nans = 0\r\n\r\nfor _ in range(n):\r\n s, d = map(int, input().split())\r\n if ans < s:\r\n ans = s\r\n else:\r\n ans += d-(ans-s)%d\r\nprint(ans)\r\n", "import math\r\nn = int(input())\r\ncur = 0\r\nfor _ in range(n):\r\n s, d = map(int, input().split())\r\n if cur <= s:\r\n cur = s\r\n else:\r\n cur = s + math.ceil((cur - s) / d) * d\r\n cur += 1\r\nprint(cur - 1)", "n=int(input())\r\nh=0\r\nfor i in range(n):\r\n s,d=map(int, input().split())\r\n h=max(s, h + d - (h - s) % d)\r\nprint(h)", "#!/bin/python\r\nimport collections\r\nimport random\r\nimport sys\r\n\r\n\r\nn = int(input())\r\nday = 0\r\nfor i in range(n):\r\n s, d = map(int, input().split())\r\n day = max(day + 1, s)\r\n if (day - s) % d != 0:\r\n day += d - (day - s) % d\r\nprint(day)\r\n", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\twhile(ans>=a):\r\n\t\ta+=b\r\n\tans=a\r\nprint(ans)", "n = int(input())\ndays = 0\n\nfor i in range(n):\n s, d = list(map(int, input().split()))\n diff = s - days\n if(i > 0 and diff <= 0):\n x = abs(diff) // d + 1\n s += x*d\n days = s\nprint(days)\n\n \t\t \t \t \t \t\t\t \t\t\t \t\t \t\t", "day = 0\r\n\r\nfor _ in range(int(input())):\r\n s, d = map(int, input().split())\r\n day = s + d * max((day - s) // d + 1, 0)\r\n\r\nprint(day)", "n = int(input())\ntoday = 1\nfor _ in range(n):\n s, d = map(int, input().split())\n if today > s:\n today = s + (today-s+d-1)//d*d + 1\n else:\n today = s+1\nprint(today-1)\n", "n = int(input())\r\nresult = 0\r\nfor i in range(n):\r\n\ts, d = map(int, input().split())\r\n\tk = max(result-s, 0)//d\r\n\twhile s+k*d<=result:\r\n\t\tk+=1\r\n\tresult=s+k*d\r\nprint(result)", "n=int(input())\r\n\r\ncur = 0\r\nfor i in range(n):\r\n s,d=map(int,input().split())\r\n if cur < s:\r\n cur = s\r\n continue \r\n if (cur - s) % d == 0:\r\n cur += d\r\n else:\r\n \r\n cur += d - ((cur - s) % d)\r\nprint(cur) \r\n \r\n", "a = 0\r\nfor i in range(int(input())):\r\n s, d = list(map(int, input().split()))\r\n a += 1\r\n while a < s or (a - s) % d != 0:\r\n a += 1\r\nprint(a)", "def next_appoint(a,b,c):\r\n while b<=a:\r\n b+=c\r\n return b\r\nnum=int(input())\r\nlis=[]\r\nfor i in range(num):\r\n lis.append(list(map(int,input().split())))\r\ncount=lis[0][0]\r\nfor i in range(1,num):\r\n count=next_appoint(count,lis[i][0],lis[i][1])\r\nprint(count)", "n = int(input())\r\nday = 0\r\nfor i in range(n):\r\n s, k = map(int, input().split())\r\n if s >= day:\r\n day = s + 1\r\n continue\r\n if (day - s) % k == 0:\r\n day += 1\r\n else:\r\n day = day + (k - (day - s) % k) + 1\r\nprint(day - 1)\r\n", "n = int(input())\r\ncur = 0\r\nfor i in range(n):\r\n s, d = map(int, input().split())\r\n q = max(0, cur - s + d) // d\r\n cur = q * d + s\r\n\r\nprint(cur)\r\n", "n = int(input())\r\nnow = 0\r\nfor i in range(n):\r\n s, d = map(int, input().split())\r\n now = max(now + 1, s)\r\n now = (now + d - 1 - s) // d * d + s\r\nprint(now)", "n ,Day = int(input()), 0\nfor i in range(n):\n x ,y = map(int, input().split())\n if i==0:\n Day = x\n continue\n while(Day>=x):x+=y\n Day = x\nprint(Day)", "n=int(input())\r\na,b=map(int,input().split())\r\nfor i in range(n-1):\r\n a1,b1=map(int,input().split())\r\n while a1<=a:\r\n a1=a1+b1\r\n a=a1\r\nprint(a)", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n tp = list(map(int,input().split()))\r\n l.append(tp)\r\n\r\ns1 = 0\r\nfor i in range(n):\r\n if i==0:\r\n s1 = l[i][0]\r\n else:\r\n j1 = 0\r\n while True:\r\n t1 = l[i][0] + j1*(l[i][1])\r\n if t1>s1:\r\n s1 = t1\r\n break\r\n j1+=1\r\nprint(s1)", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\nans=0\r\nfor i in range(n):\r\n s,d=map(int,input().split())\r\n if i==0:\r\n ans+=(s)\r\n else:\r\n j=0\r\n while True:\r\n add=s+d*j\r\n if add>ans and (add-s)%d==0:\r\n ans=s+d*j\r\n break\r\n j+=1\r\nprint(ans)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n while(x<=s):\r\n x+=y\r\n s=x\r\nprint(s)\r\n", "n = int(input())\r\nbase, ans = [], []\r\nfor t in range(n):\r\n arr = list(map(int, input().split()))\r\n base.append(arr)\r\nans.append(base[0][0])\r\nfor i in range(1, len(base)):\r\n while base[i][0] <= ans[-1]:\r\n base[i][0] += base[i][1]\r\n ans.append(base[i][0])\r\nprint(ans[-1])\r\n", "l1=[]\r\nl2=[]\r\nn=int(input())\r\nfor _ 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(1,n):\r\n if(l1[i]<=l1[i-1]):\r\n x=(l1[i-1]-l1[i])//l2[i]\r\n \r\n x+=1\r\n l1[i]=l1[i]+(x*l2[i])\r\n #print(l1[i])\r\nma=l1[n-1]\r\nprint(ma)\r\n \r\n \r\n ", "n = int(input())\r\ncurday = 0\r\narr = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n s, d = map(int, input().split())\r\n day = 0\r\n j = 0\r\n while True:\r\n if s + (j * d) > curday:\r\n day = s + (j * d)\r\n break\r\n j += 1\r\n if n > 1:\r\n curday = day\r\n else:\r\n arr[i] = s\r\n arr[i] = day\r\nprint(arr[n])\r\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n\ts, d = [int(x) for x in input().split()]\r\n\tif ans >= s:\r\n\t\tt = (ans-s)//d\r\n\t\ts += (t+1)*d\r\n\tans = s\r\nprint(ans)", "doctors = []\r\nday_x = 0\r\nfor _ in range(int(input())):\r\n enter, space = tuple([int(i) for i in input().split()])\r\n while enter <= day_x:\r\n enter += space\r\n day_x = enter\r\nprint(day_x)\r\n", "n=int(input())\r\np,k=list(map(int,input().split()))\r\nna=[]\r\nna.append(p)\r\nfor x in range(n-1):\r\n p,k=list(map(int,input().split()))\r\n if p<=na[-1]:\r\n x=(na[-1]-p)//k\r\n l=p+(x+1)*k\r\n na.append(l)\r\n else:\r\n na.append(p)\r\nprint(na[-1])\r\n ", "def main():\n r = 0\n for _ in range(int(input())):\n s, d = map(int, input().split())\n r = s + (max(r + 1, s) + d - s - 1) // d * d\n print(r)\n\n\nif __name__ == '__main__':\n main()\n", "from sys import stdin; inp = stdin.readline\r\ndef IA(): return list(map(int, inp().split()))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return inp()\r\n\r\ndef main():\r\n n = m = I()\r\n count = 0 \r\n while m > 0:\r\n s, d = IA()\r\n if m == n:\r\n count = s\r\n else:\r\n _next = s \r\n if _next > count:\r\n count += _next-count \r\n else:\r\n while _next <= count:\r\n _next += d \r\n count += (_next-count)\r\n m-=1\r\n return count \r\n\r\nif __name__ == '__main__':\r\n print(main())", "n = int(input())\r\na = 0\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n while x <= a: x += y\r\n a = x\r\nprint(a)" ]

[ "AND = \"AND\"\r\nOR = \"OR\"\r\nXOR = \"XOR\"\r\nNOT = \"NOT\"\r\nIN = \"IN\"\r\n\r\nOPS = {\r\n AND: AND,\r\n OR: OR,\r\n XOR: XOR,\r\n NOT: NOT,\r\n}\r\n\r\n\r\nclass Node:\r\n def __init__(self, num):\r\n self.num = num\r\n self.op = None\r\n self.parent = None\r\n self.input_1 = None\r\n self.input_2 = None\r\n self.orig_value = None\r\n self.root_value_if_changed = None\r\n\r\n @property\r\n def children(self):\r\n if self.op == IN:\r\n return []\r\n elif self.op == NOT:\r\n return [self.input_1]\r\n else:\r\n return [self.input_1, self.input_2]\r\n\r\n def can_compute(self):\r\n if self.op == IN:\r\n return True\r\n\r\n if self.op == NOT:\r\n return self.input_1.orig_value is not None\r\n\r\n return self.input_1.orig_value is not None and self.input_2.orig_value is not None\r\n\r\n def compute(self):\r\n if self.op == IN:\r\n return self.orig_value\r\n\r\n assert self.can_compute()\r\n\r\n if self.op == NOT:\r\n return not self.input_1.orig_value\r\n elif self.op == AND:\r\n return self.input_1.orig_value and self.input_2.orig_value\r\n elif self.op == OR:\r\n return self.input_1.orig_value or self.input_2.orig_value\r\n else:\r\n return self.input_1.orig_value != self.input_2.orig_value\r\n\r\n def set_input(self, a):\r\n self.input_1 = a\r\n a.parent = self\r\n\r\n def set_inputs(self, a, b):\r\n self.input_1 = a\r\n self.input_2 = b\r\n\r\n a.parent = self\r\n b.parent = self\r\n\r\n\r\ndef compute_orig_values(root):\r\n stack = [root]\r\n\r\n while len(stack) > 0:\r\n node: Node = stack[-1]\r\n\r\n if node.can_compute():\r\n node.orig_value = node.compute()\r\n stack.pop()\r\n else:\r\n stack.extend(node.children)\r\n\r\n\r\ndef compute_if_change(root: Node):\r\n def comp_if_changed(node: Node):\r\n if node is root:\r\n return not node.orig_value\r\n\r\n orig = node.orig_value\r\n node.orig_value = not node.orig_value\r\n res = node.parent.compute()\r\n node.orig_value = orig\r\n\r\n if res == node.parent.orig_value:\r\n return root.orig_value\r\n else:\r\n return node.parent.root_value_if_changed\r\n\r\n stack = [root]\r\n\r\n while len(stack) > 0:\r\n node: Node = stack.pop()\r\n\r\n node.root_value_if_changed = comp_if_changed(node)\r\n\r\n stack.extend(node.children)\r\n\r\n\r\ndef main():\r\n import sys\r\n\r\n n = int(sys.stdin.readline())\r\n\r\n nodes = {i: Node(i) for i in range(1, n + 1)}\r\n assert len(nodes) == n\r\n\r\n for i in range(1, n + 1):\r\n toks = sys.stdin.readline().strip().split(\" \")\r\n\r\n node = nodes[i]\r\n\r\n if len(toks) == 2:\r\n if toks[0] == IN:\r\n node.op = IN\r\n node.orig_value = toks[1] == \"1\"\r\n else:\r\n node.op = NOT\r\n node.set_input(nodes[int(toks[1])])\r\n else:\r\n node.op = OPS[toks[0]]\r\n a, b = map(int, toks[1:])\r\n a = nodes[a]\r\n b = nodes[b]\r\n\r\n node.set_inputs(a, b)\r\n\r\n root: Node = nodes[1]\r\n\r\n compute_orig_values(root)\r\n compute_if_change(root)\r\n\r\n ret = []\r\n\r\n for i in range(1, n + 1):\r\n node = nodes[i]\r\n\r\n if node.op == IN:\r\n ret.append(int(node.root_value_if_changed))\r\n\r\n ret = \"\".join(str(x) for x in ret)\r\n print(ret)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\nn=int(input())\r\nf={'AND':(lambda a,b:a&b),'OR':(lambda a,b:a|b),'XOR':(lambda a,b:a^b),'NOT':(lambda a:a^1)}\r\ng={'0':(lambda:0),'1':(lambda:1)}\r\nd=[(g[v[0]],[]) if o=='IN' else (f[o],[int(a)-1 for a in v]) for o,*v in map(str.split,sys.stdin.read().strip().split('\\n'))]\r\nt=[0]\r\nfor i in t:t.extend(d[i][1])\r\nv=[0]*n\r\nfor i in t[::-1]:v[i]=d[i][0](*(v[x] for x in d[i][1]))\r\nf=[0]*n\r\nf[0]=1\r\nfor i in t:\r\n if f[i]<1: continue\r\n o,a=d[i]\r\n b=[v[x]for x in a]\r\n assert o(*b)==v[i]\r\n for j,k in enumerate(a):\r\n b[j]^=1\r\n f[k]=(o(*b)!=v[i])\r\n b[j]^=1\r\nprint(''.join(str(f[i]^v[0]) for i in range(n) if not d[i][1]))", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nstack=[]\r\nchildren=[]\r\nfor i in range(n):\r\n children.append([])\r\nparent=[-1]*n\r\nnodes=[-1]*n\r\ninputs=[]\r\nfunctions=[-1]*n\r\nfor i in range(n):\r\n a=list(map(str,input().split()))\r\n r=a[0]\r\n if r=='IN':\r\n stack.append((i,int(a[1])))\r\n inputs.append(i)\r\n elif r=='NOT':\r\n parent[int(a[1])-1]=i\r\n children[i].append(int(a[1])-1)\r\n functions[i]=1\r\n else:\r\n x1=int(a[1])-1\r\n x2=int(a[2])-1\r\n parent[x1]=i\r\n parent[x2]=i\r\n children[i].append(x1)\r\n children[i].append(x2)\r\n if r=='AND':\r\n functions[i]=2\r\n elif r=='XOR':\r\n functions[i]=3\r\n else:\r\n functions[i]=4\r\nwhile stack:\r\n pos,val=stack.pop()\r\n \r\n nodes[pos]=val\r\n if pos==0:\r\n break\r\n r=parent[pos]\r\n flag=0\r\n values=[]\r\n for child in children[r]:\r\n values.append(nodes[child])\r\n if not -1 in values:\r\n if functions[r]==1:\r\n stack.append((r,1-values[0]))\r\n elif functions[r]==2:\r\n stack.append((r,values[0]&values[1]))\r\n elif functions[r]==3:\r\n stack.append((r,values[0]^values[1]))\r\n else:\r\n stack.append((r,values[0]|values[1]))\r\noutput=nodes[0]\r\nstack=[0]\r\nimportant=[0]*n\r\nwhile stack:\r\n pos=stack.pop()\r\n important[pos]=1\r\n if functions[pos]==-1:\r\n continue\r\n q=children[pos]\r\n \r\n if functions[pos]==1:\r\n stack.append(q[0])\r\n elif functions[pos]==2:\r\n if nodes[pos]==1:\r\n stack.append(q[0])\r\n stack.append(q[1])\r\n else:\r\n if nodes[q[0]]==1 and nodes[q[1]]==0:\r\n stack.append(q[1])\r\n elif nodes[q[0]]==0 and nodes[q[1]]==1:\r\n stack.append(q[0])\r\n elif functions[pos]==3:\r\n stack.append(q[0])\r\n stack.append(q[1])\r\n else:\r\n if nodes[pos]==0:\r\n stack.append(q[0])\r\n stack.append(q[1])\r\n else:\r\n if nodes[q[0]]==1 and nodes[q[1]]==0:\r\n stack.append(q[0])\r\n elif nodes[q[0]]==0 and nodes[q[1]]==1:\r\n stack.append(q[1])\r\nans=[]\r\nfor i in inputs:\r\n if important[i]:\r\n ans.append(1-output)\r\n else:\r\n ans.append(output)\r\nprint(''.join(map(str,ans)))" ]

[ "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(k):\r\n s1, s2 = 0, 0\r\n for j in range(i, n, k):\r\n if A[j] == 1:\r\n s1+=1\r\n else:\r\n s2+=1\r\n ans = ans + min(s1, s2)\r\nprint(ans)", "I=lambda:map(int,input().split())\r\nn,k=I()\r\na=[0]*n\r\ni=0\r\nfor v in I():a[i]+=v-1;i=(i+1)%k\r\nprint(sum(map(lambda x:min(x,n//k-x),a)))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\ndef minMoves():\r\n ct1 = [0 for i in range(k)]\r\n ct2 = [0 for i in range(k)]\r\n moves = 0\r\n \r\n for i in range(n):\r\n if (a[i] == 1):\r\n ct1[i % k] += 1\r\n else:\r\n ct2[i % k] += 1\r\n \r\n for i in range(k):\r\n moves += min(ct1[i], ct2[i])\r\n \r\n \r\n return moves\r\n \r\nprint(minMoves())", "n, k = map(int, input().split())\r\nans = 0\r\ntwo = 0\r\none = 0\r\nar = input().split()\r\nfor i in range(k):\r\n for j in range(i, n, k):\r\n if ar[j] == '1':\r\n one += 1\r\n else:\r\n two += 1\r\n ans += min(one, two)\r\n one, two = 0, 0\r\nprint(ans)", "n,k,*L=map(int,input().split()+input().split())\r\nK=[0]*k\r\nfor i in range(n):\r\n if L[i]==1:K[i%k]+=1\r\nX=n//k\r\nprint(sum([min(x,X-x)for x in K]))\r\n", "x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0]*y\r\nc = [0]*y\r\nfor i in range(x):\r\n\t\tif (a[i] != 1):\r\n\t\t\tb[i % y] += 1\r\n\t\telse:\r\n\t\t\tc[i % y] += 1\r\nprint(sum([min(b[i], c[i]) for i in range(y)]))", "def k_array():\n first = input().split()\n n, k = int(first[0]), int(first[1])\n line = input().split()\n k_vector = []\n vector_completed = False\n cont = 0\n for count, e in enumerate(line):\n if(not vector_completed):\n k_vector.append({'1':1, '2':0} if e=='1' else {'2':1, '1':0})\n if(len(k_vector)==k):\n vector_completed=True\n else:\n k_vector[(count)%k][e]+=1\n\n for pos in k_vector:\n if(pos['1']<pos['2']):\n cont+=pos['1']\n else:\n cont+=pos['2']\n\n print(cont)\nk_array()\n\t\t\t\t \t\t \t \t\t\t \t \t \t", "n,k = map(int,input().split())\r\ns = [int(i) for i in input().split()]\r\nd = []\r\ncnt = 0\r\n\r\nfor i in range(k):\r\n\tr = []\r\n\tfor j in range(n):\r\n\t\tif i+j*k<n:\r\n\t\t\tr.append(s[i+j*k])\r\n\td.append(r)\r\n\r\nfor i in d:\r\n\ta = i.count(1)\r\n\tb = i.count(2)\r\n\tif a and b:\r\n\t\tcnt += min(a,b)\r\n\r\nprint(cnt)", "n=input().split(\" \")\r\ntemp=input().split(\" \")\r\np=[]\r\nc=0\r\nr=0\r\nwhile temp!=[]:\r\n p.append(temp[0:int(n[1])])\r\n temp=temp[int(n[1]):]\r\nfor x in range(len(p)):\r\n for y in range(len(p[x])):\r\n for i in range(len(p)):\r\n if p[x][y]==p[i][y]:\r\n c+=1\r\n \r\n else:\r\n c-=1\r\n \r\n if c<=0:\r\n if p[x][y]==\"1\":\r\n p[x][y]=\"2\"\r\n elif p[x][y]==\"2\":\r\n p[x][y]=\"1\"\r\n r+=1 \r\n c=0\r\nprint(r)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = [[0] * 3 for i in range(k)]\r\nfor j in range(n):\r\n cnt[j % k][a[j]] += 1\r\n\r\nans = 0\r\nfor j in range(k):\r\n ans += min(cnt[j][1], cnt[j][2])\r\n\r\nprint(ans)\r\n", "read = lambda:map(int, input().split())\r\nn,k = read()\r\nm = n//k\r\na = list(read())\r\nresult = 0\r\nfor i in range(k):\r\n t = a[i:n:k]\r\n s = t.count(1)\r\n result += min(s, m-s)\r\nprint(result)\r\n", "n, k = map(int, input().strip().split())\r\na = list(map(int, list(input().split())))\r\nresult = []\r\nwhile True:\r\n if a:\r\n result.append(a[:k])\r\n a = a[k:]\r\n else:\r\n break\r\ncount_o = 0\r\ncount_t = 0\r\nresult_count = 0\r\nfor j in range(len(result[0])):\r\n for i in range(len(result)):\r\n if result[i][j] == 1:\r\n count_o += 1\r\n else:\r\n count_t += 1\r\n result_count += min(count_o, count_t)\r\n count_o = 0\r\n count_t = 0\r\nprint(result_count)", "#Ana Clara Lacaze\n#193858\n\nn,k = [int(x) for x in input().split()]\nv = [int(x) for x in input().split()]\n \nans = 0\nfor i in range(k):\n c1 = 0\n c2 = 0\n for j in range(i,n,k):\n if v[j] == 1:\n c1 += 1\n else:\n c2 += 1\n ans+= min(c1,c2)\nprint(ans)\n\t \t \t\t\t\t\t\t \t \t\t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nres = 0\n\nfor i in range(k):\n b = []\n for j in range(i,n,k):\n b.append(a[j])\n res += min(b.count(1), b.count(2))\n\nprint(res)\n\n\t\t \t \t \t\t \t \t\t\t\t \t\t", "\r\n\r\nn,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\n\r\n\r\nres = 0\r\n\r\nfor i in range(k):\r\n lst = []\r\n for j in range(i,n,k):\r\n lst.append(arr[j])\r\n res+=min(lst.count(1),lst.count(2))\r\nprint(res)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\npoc = 0\r\nfor i in range(k):\r\n\tp1,p2 = 0,0\r\n\tfor j in range(i,n,k,):\r\n\t\tif a[j] == 1:\r\n\t\t\tp1+=1\r\n\t\telse:\r\n\t\t\tp2+=1\r\n\tpoc+=min(p1,p2)\r\nprint(poc)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nz=n//k\r\nfor i in range(k):\r\n\ta1=a[i::k]\r\n\tr1=a1.count(1)\r\n\tr2=a1.count(2)\r\n\tc=c+min(r1,r2)\r\nprint(c)", "def main():\n k, v = map(int, input().split())\n s = list(map(int, input().split()))\n \n ret = 0\n for i in range(v):\n h = 0\n f = 0\n for j in range(i, k, v):\n if s[j] == 1:\n h += 1\n else:\n f += 1\n if h < f:\n ret += h\n else:\n ret += f\n print(ret)\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", "if __name__ == '__main__':\n # Ler primeira linha da entrada\n str_input = input().split()\n n = int(str_input[0])\n k = int(str_input[1])\n # Ler segunda linha da entrada\n str_input = input().split()\n # Converter para array de inteiros\n array = []\n for i in range(len(str_input)):\n array.append(int(str_input[i]))\n # Inicializar variável contadora\n count = 0\n # Percorrer grupos\n for i in range(k):\n # Inicializar contadores do grupo\n ones = 0\n twos = 0\n # Verificar se a posição correspondente está presente\n # em todos os grupos até o final do array\n for j in range(i, n, k):\n if array[j] == 1: ones += 1\n else: twos += 1\n # Queremos achar o valor mínimo, logo vemos se é melhor\n # trocar uns ou dois\n count += min(ones, twos)\n # Exibir resultado\n print(count)\n\t\t \t \t \t \t\t\t \t", "n, k = map(int, input().split())\n\narray = [int(x) for x in input().split()]\n\nsubarray = []\nchange_counter = 0\n\nfor i in range(n):\n if i == 0:\n aux = []\n if i % k == 0 and i != 0:\n subarray.append(aux)\n aux = []\n aux.append(array[i])\n if i == n-1:\n subarray.append(aux)\n\naux2 = []\nfor q in range(k):\n count1 = 0\n count2 = 0\n for p in range(int(n/k)):\n if subarray[p][q] == 1:\n count1 += 1\n else:\n count2 += 1\n\n if p == int(n/k)-1:\n if count1 < count2:\n aux2.append(2)\n else:\n aux2.append(1)\n\nfor p in range(int(n/k)):\n for q in range(k):\n if subarray[p][q] != aux2[q]:\n change_counter += 1\n\nprint(change_counter)\n \t\t \t \t \t \t", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = n // k\r\ncnt = 0\r\nfor i in range(k):\r\n x = 0\r\n y = 0\r\n for j in range(s):\r\n if a[i + j * k] == 1:\r\n x += 1\r\n else:\r\n y += 1\r\n cnt += min(x, y)\r\nprint(cnt) ", "n, k = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nres = 0\nfor j in range(k):\n o = t = 0\n for i in range(n // k):\n w = j + i * k\n o += a[w] == 1\n t += a[w] == 2\n res += min(o, t)\nprint(res)\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = []\r\nj = 0\r\nfor i in range(n // k):\r\n l.append(a[j : j + k])\r\n j += k\r\nc = 0\r\nfor i in range(k):\r\n d = {}\r\n for j in range(n // k):\r\n v = d.get(l[j][i], 0)\r\n if v == 0:\r\n d[l[j][i]] = 1\r\n else:\r\n d[l[j][i]] = d[l[j][i]] + 1\r\n if d.get(1, 0) == 0 or d.get(2, 0) == 0:\r\n continue\r\n c1 = d.get(1)\r\n c2 = d.get(2)\r\n c += c1 if c1 < c2 else c2\r\nprint(c)\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\n\nfor j in range(k):\n count = {}\n for i in range(n // k):\n num = a[i * k + j]\n count[num] = count.get(num, 0) + 1\n ans += min(count.get(1, 0), count.get(2, 0))\nprint(ans)", "def main():\n n, m = map(int, input().split())\n s = list(map(int, input().split()))\n\n ret = 0\n for i in range(m):\n a = 0\n b = 0\n for j in range(i, n, m):\n if s[j] == 1:\n a += 1\n else:\n b += 1\n if a < b:\n ret += a\n else:\n ret += b\n print(ret)\n\n\nif __name__ == '__main__':\n main()\n\n \t \t\t \t\t\t \t \t \t \t\t\t\t\t\t", "def main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n ratio = n // k\r\n counter = 0\r\n for i in range(k):\r\n counter_1 = 0\r\n counter_2 = 0\r\n for j in range(ratio):\r\n if a[j * k + i] == 1:\r\n counter_1 += 1\r\n else:\r\n counter_2 += 1\r\n counter += min(counter_1, counter_2)\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()\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf, log2, sqrt, log10\r\nfrom bisect import bisect_right, bisect_left\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nmatrix = []\r\n\r\nrow = []\r\nfor num in arr:\r\n row.append(num)\r\n if len(row) == k:\r\n matrix.append(row)\r\n row = []\r\n\r\ntranspose = [[matrix[i][j] for i in range(len(matrix))] for j in range(len(matrix[0]))]\r\n\r\nans = 0\r\n\r\nfor row in transpose:\r\n ans += min(row.count(1), row.count(2))\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "l=list(map(int,input().split()))\r\nn,k=l[0],l[1]\r\na=list(map(int,input().split()))\r\n\r\nans=0\r\ncount=[0 for _ in range(k)]\r\n\r\nfor i in range(n):\r\n if a[i]==1:count[i%k]+=1\r\n \r\nfor i in range(k):\r\n if count[i]!=n//k:\r\n ans+=min(n//k-count[i],count[i])\r\nprint(ans)", "\r\n\r\ndef main():\r\n n, k = map(lambda x: int(x),input().split())\r\n arn = list(map(lambda x: int(x),input().split()))\r\n\r\n changes = 0\r\n for l in range(k):\r\n sc = []\r\n for next_ in range(0, int(n/k)):\r\n sc.append(arn[l+next_*k])\r\n ones = 0\r\n twos = 0\r\n for i in sc:\r\n if i == 1:\r\n ones+=1\r\n else:\r\n twos+=1\r\n\r\n dominant = None\r\n if ones > twos:\r\n dominant = 1\r\n else:\r\n dominant = 2\r\n \r\n for next_ in range(0, int(n/k)):\r\n if arn[l+next_*k] != dominant:\r\n arn[l+next_*k] = dominant\r\n changes+=1\r\n print(changes)\r\n \r\n \r\nmain()\r\n", "n, k = map(int, input().split())\r\na = [0] * k\r\nfor i, j in enumerate(map(int, input().split())):\r\n a[i % k] += j - 1\r\nprint(sum([min(i, n // k - i) for i in a]))", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nans=0\r\nfor i in range(k):\r\n c=0\r\n for j in range(i,n,k):\r\n if a[j]==1:\r\n c+=1\r\n ans+= min(c,n//k-c)\r\nprint(ans)", "n, k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(0, k):\r\n n1 = l[i::k].count(1)\r\n n2 = l[i::k].count(2)\r\n ans += min( n1 , n2 )\r\nprint(ans)", "from heapq import nlargest,heapify\r\ndef solve():\r\n n,k=map(int,input().split());a=''.join(input().split());ans=0\r\n for i in range(k):\r\n one=0;two=0\r\n for j in range(i,n,k):\r\n if a[j]=='1':one+=1\r\n else:two+=1\r\n ans+=min(one,two)\r\n print(ans)\r\nsolve()", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nx = n//k\r\nfor i in range(k):\r\n c = 0\r\n for j in range(i,n,k):\r\n if l[j]==1:\r\n c += 1\r\n ans += min(c,x-c)\r\nprint(ans)", "def cal(s, k):\r\n q = len(s) // k\r\n sm = 0\r\n for r in range(k):\r\n one = two = 0\r\n for x in range(q):\r\n if s[k * x + r] == 1:\r\n one += 1\r\n else:\r\n two += 1\r\n # print(one, two)\r\n sm += min(one, two)\r\n return sm\r\n\r\n\r\nn, k = [int(x) for x in input().split()]\r\ns = [int(x) for x in input().split()]\r\nw = cal(s, k)\r\nprint(w)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nli = [[0, 0] for _ in range(k)]\r\nfor i in range(k):\r\n for j in range(i, n, k):\r\n if a[j] == 1:\r\n li[i][0] += 1\r\n else:\r\n li[i][1] += 1\r\n\r\nans = 0\r\nfor i in range(k):\r\n ans += n // k - max(li[i][0], li[i][1])\r\nprint(ans)", "def main():\n _, period = [int(x) for x in input().split(\" \")]\n array = [int(x) for x in input().split(\" \")]\n counts_of_1 = [0 for _ in range(period)]\n counts_of_2 = [0 for _ in range(period)]\n\n for i in range(len(array)):\n if array[i] == 1:\n counts_of_1[i % period] += 1\n else:\n counts_of_2[i % period] += 1\n\n movimentos = 0\n\n for i in range(period):\n movimentos += min(counts_of_1[i], counts_of_2[i])\n \n print(movimentos)\n\nmain()\n\t\t \t\t \t \t \t\t \t \t\t \t \t\t \t\t", "\n\n\n\n \n \n\ndef solve():\n \n n_comprimento_array,k = map(int,input().split())\n lista_matriz = list(map(int,input().split()))\n sol = 0\n incremento_a = 0\n while incremento_a < k:\n list_aux = []\n incremento_b = incremento_a\n\n while(incremento_b < n_comprimento_array):\n list_aux.append(lista_matriz[incremento_b])\n incremento_b = incremento_b + k\n\n count_one = list_aux.count(1)\n count_two = list_aux.count(2)\n valor_min = min(count_one,count_two)\n sol = sol + valor_min\n incremento_a = incremento_a+1\n print(sol)\n\nsolve()\n\n\n\n\n\t\t \t\t\t\t\t \t\t\t \t\t\t \t \t \t\t\t\t", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn, k = map(int, input().split())\r\nl = [*map(int, input().split())]\r\nprint(sum(min(l[i::k].count(1), l[i::k].count(2)) for i in range(k)))\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, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nindex = 0\r\nwhile index < k:\r\n new = [arr[index]]\r\n temp = index\r\n for i in range((n//k) - 1):\r\n new.append(arr[temp + k])\r\n temp += k\r\n if new.count(1) >= new.count(2):\r\n count += new.count(2)\r\n else:\r\n count += new.count(1)\r\n index += 1\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = 0\r\nz = n // k\r\nfor i in range(k):\r\n\tb = l[i::k]\r\n\tco = b.count(1)\r\n\tans += min(z - co, co)\r\n \r\nprint(ans)", "inp = list(map(int, input().split()[:2]))\nn = inp[0]\nk = inp[1]\narray = list(map(int, input().split()[:n]))\n\ntotal = 0\n\nfor i in range(0, k):\n number_one = 0\n number_two = 0\n for j in range(0, int(n/k)):\n aux = array[i + (j*k)]\n if (aux == 1):\n number_one = number_one + 1\n else:\n number_two = number_two + 1\n if (number_one > number_two):\n total = total + number_two\n else:\n total = total + number_one\n\nprint(total)\n\t \t\t \t\t \t\t\t\t\t\t\t \t\t \t \t \t", "n, k = map(int, input().split())\n\ndata = list((map(int, input().split())))\n\nocc = []\n\ndiffs = 0\n\nfor i in range(0, n, k):\n occ.append(data[i:i+k])\n \nfor i in range(k):\n analysis = []\n \n for j in occ:\n analysis.append(j[i])\n \n diffs += min(analysis.count(1), analysis.count(2))\n\n\nprint(diffs)\n\t\t \t \t\t\t\t\t\t \t \t\t\t \t \t\t", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\nif(len(a)%k==0): \r\n for i in range(k):\r\n b = a[i::k]\r\n count += min(b.count(1),b.count(2))\r\nprint(count)\r\n\r\n", "# 371A K-Periodic Array \r\ndef per_arr():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n i = 0\r\n ranges = [0, 0]\r\n tmp = [[] for x in range(int(n/k))]\r\n for l in range(n):\r\n if a[l] == 1:\r\n ranges[0] += 1\r\n else:\r\n ranges[1] += 1\r\n tmp[i].append(a[l])\r\n if len(tmp[i]) == k:\r\n i += 1\r\n\r\n # choosing patern\r\n m = len(tmp)\r\n pattern = [0 for i in range(k)]\r\n for i in range(k):\r\n for j in range(m):\r\n pattern[i] += tmp[j][i]\r\n if pattern[i] / (n/k) >= 1.5:\r\n pattern[i] = 2\r\n else:\r\n pattern[i] = 1\r\n d = 0\r\n for i in range(m):\r\n for j in range(k):\r\n if tmp[i][j] != pattern[j]:\r\n d += 1\r\n print(d) \r\nper_arr()", "n, k = map(int, input().split())\r\n\r\nanswer = [[0, 0] for _ in range(k)]\r\nk1 = 0\r\nfor x in input().split():\r\n if k1 == k:\r\n k1 = 0\r\n answer[k1][int(x) - 1] += 1\r\n k1 += 1\r\n\r\nres = 0\r\nfor x in answer:\r\n res += min(x)\r\nprint(res)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(k):\r\n ans += min(arr[i::k].count(1), arr[i::k].count(2))\r\n\r\nprint(ans)", "import math\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nans=0\r\nfor i in range(k):\r\n r=a[i];m=0\r\n for j in range(n//k):\r\n if a[i+j*k]!=r:\r\n m+=1\r\n ans+=min(m,n//k-m)\r\n\r\nprint(ans)", "#------------------Important Modules------------------#\r\n\r\nfrom sys import stdin,stdout\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\n\r\nfrom heapq import *\r\ninput=stdin.readline\r\n#prin=stdout.write\r\nfrom random import sample\r\n#t=int(input())\r\nt=1\r\nfrom collections import Counter,deque\r\nfrom math import sqrt,ceil,log2,gcd\r\n#dist=[0]*(n+1)\r\nclass DisjSet: \r\n def __init__(self, n): \r\n # Constructor to create and \r\n # initialize sets of n items \r\n self.rank = [1] * n \r\n self.parent = [i for i in range(n)] \r\n \r\n \r\n # Finds set of given item x \r\n def find(self, x): \r\n \r\n # Finds the representative of the set \r\n # that x is an element of \r\n if (self.parent[x] != x): \r\n \r\n # if x is not the parent of itself \r\n # Then x is not the representative of \r\n # its set, \r\n self.parent[x] = self.find(self.parent[x]) \r\n \r\n # so we recursively call Find on its parent \r\n # and move i's node directly under the \r\n # representative of this set \r\n \r\n return self.parent[x] \r\n \r\n \r\n # Do union of two sets represented \r\n # by x and y. \r\n def union(self, x, y): \r\n \r\n # Find current sets of x and y \r\n xset = self.find(x) \r\n yset = self.find(y) \r\n \r\n # If they are already in same set \r\n if xset == yset: \r\n return\r\n \r\n # Put smaller ranked item under \r\n # bigger ranked item if ranks are \r\n # different \r\n if self.rank[xset] < self.rank[yset]: \r\n self.parent[xset] = yset \r\n \r\n elif self.rank[xset] > self.rank[yset]: \r\n self.parent[yset] = xset \r\n \r\n # If ranks are same, then move y under \r\n # x (doesn't matter which one goes where) \r\n # and increment rank of x's tree \r\n else: \r\n self.parent[yset] = xset \r\n self.rank[xset] = self.rank[xset] + 1\r\n \r\n# Driver code \r\n\r\n\r\n\r\ndef f(arr,i,j,d,dist):\r\n if i==j:\r\n return \r\n nn=max(arr[i:j])\r\n for tl in range(i,j):\r\n if arr[tl]==nn:\r\n dist[tl]=d\r\n #print(tl,dist[tl])\r\n f(arr,i,tl,d+1,dist)\r\n f(arr,tl+1,j,d+1,dist)\r\n #return dist\r\n \r\n \r\ndef ps(n):\r\n cp=0\r\n while n%2==0:\r\n n=n//2\r\n cp+=1\r\n for ps in range(3,ceil(sqrt(n))+1,2):\r\n while n%ps==0:\r\n n=n//ps\r\n cp+=1\r\n \r\n if n!=1:\r\n return False\r\n return True\r\n\r\n\r\n#count=0\r\n#dp=[[0 for i in range(m)] for j in range(n)]\r\n#[int(x) for x in input().strip().split()]\r\ndef find_gcd(x, y): \r\n \r\n while(y): \r\n x, y = y, x % y \r\n \r\n return x \r\n \r\n# Driver Code \r\ndef factorials(n,r):\r\n #This calculates ncr mod 10**9+7\r\n slr=n;dpr=r\r\n qlr=1;qs=1\r\n mod=10**9+7\r\n \r\n for ip in range(n-r+1,n+1):\r\n qlr=(qlr*ip)%mod\r\n for ij in range(1,r+1):\r\n qs=(qs*ij)%mod\r\n #print(qlr,qs)\r\n ans=(qlr*modInverse(qs))%mod\r\n return ans\r\n\r\n \r\n \r\ndef modInverse(b):\r\n qr=10**9+7\r\n return pow(b, qr - 2,qr)\r\n\r\ntt=[xa**3 for xa in range(0,10**4+1)]\r\nqq=set(tt)\r\n\"\"\"----------The main code starts here----------------\"\"\"\r\n\r\nfor jj in range(t):\r\n n,k=[int(x) for x in input().strip().split()];\r\n arr=[int(x) for x in input().strip().split()]\r\n ans=0\r\n for i in range(k):\r\n count1=0;count2=0\r\n for j in range(i,n,k):\r\n if arr[j]==1:\r\n count1+=1\r\n else:\r\n count2+=1\r\n ans+=min(count1,count2)\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 \r\n \r\n \r\n \r\n \r\n \r\n \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 = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nm = n//k\r\n\r\ngg = {}\r\n\r\nfor i in range(k):\r\n for j in range(m):\r\n if i not in gg:\r\n gg[i] = {\r\n 1:0,\r\n 2:0\r\n }\r\n if a[i+j*k] == 1:\r\n gg[i][1] += 1\r\n else:\r\n gg[i][2] += 1\r\n\r\nans = 0\r\n\r\nfor i in gg:\r\n ans+= min(gg[i][1],gg[i][2])\r\n\r\nprint (ans)", "n, k = map(int, input().split())\n\narray = [int(x) for x in input().split()]\narrays_splited = []\nn_sub_arrays = int(n/k)\naux = 0\n\nfor i in range(n_sub_arrays):\n sub_array = []\n for j in range(k):\n sub_array.append(array[aux + j])\n aux += k\n arrays_splited.append(sub_array)\n\ntotal = 0\nfor i in range(k):\n n_1 = 0\n n_2 = 0\n for j in range(n_sub_arrays):\n if arrays_splited[j][i] == 1:\n n_1 += 1\n else:\n n_2 += 1\n total = total + min(n_1, n_2)\nprint(total)\n \t \t \t\t \t\t\t \t \t \t\t\t \t \t \t\t", "n, k = map(int, input().split())\na = input().split()\nres = 0\nfor i in range(k):\n\tone = 0; two = 0\n\tfor j in range(i, n, k):\n\t\tif a[j] == '2': two+= 1\n\t\telse: one+= 1\n\tres+= min(one, two)\nprint(res)", "def _count(list, item):\r\n\tcount = 0\r\n\tfor c in list:\r\n\t\tif c == item:\r\n\t\t\tcount += 1\r\n\treturn count\r\n \r\ndef common(list):\r\n\tcounts = []\r\n\tmaxcount = 0\r\n\tfor stuff in list:\r\n\t\tif _count(list, stuff) > maxcount:\r\n\t\t\tmaxitem = stuff\r\n\t\t\tmaxcount = _count(list, stuff)\r\n\treturn maxitem\r\n\r\n\r\naa = input().split()\r\nn = int(aa[0])\r\nk = int(aa[1])\r\na = input().split()\r\n\r\n\r\nmatrix = []\r\nnew = []\r\nfor i in range(1, n + 1):\r\n\tif i % k == 0:\r\n\t\tnew.append(a[i - 1])\r\n\t\tmatrix.append(new)\r\n\t\tnew = []\r\n\telse:\r\n\t\tnew.append(a[i-1])\r\n\r\ncolums = []\r\nanswer = 0\r\nfor j in range(len(matrix[0])):\r\n\tcolum = []\r\n\tfor i in range(len(matrix)):\r\n\t\tcolum.append(matrix[i][j])\r\n\tcolums.append(colum)\r\n\r\nfor rows in matrix:\r\n\tfor i in range(len(rows)):\r\n\t\tif rows[i] != common(colums[i]):\r\n\t\t\tanswer += 1\r\nprint(answer)", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\ndef right_most_set_bit(x):\r\n pos = 0\r\n while x > 0:\r\n x = x >> 1\r\n pos += 1\r\n return 1 << (pos - 1)\r\n\r\nn, k = get_ints()\r\narr = get_list()\r\nfreqAtPos = [{1: 0, 2: 0} for i in range(k)]\r\n\r\nfor i in range(n):\r\n pos_in_k_periodic_array = i%k\r\n freqAtPos[pos_in_k_periodic_array][arr[i]] += 1\r\n\r\nans = 0\r\nfor i in range(k):\r\n ans += min(freqAtPos[i][1], freqAtPos[i][2])\r\nprint(ans)\r\n ", "n, k = input().split()\nn, k = int(n), int(k)\na = input().split()\ntotal = 0\nfreq = [[0,0] for _ in range (k)]\nfor i in range(0, n, k):\n for j in range(k):\n if a[i+j] == '1':\n freq[j][0] += 1\n else:\n freq[j][1] += 1\nfor i in range(0, n, k):\n for j in range(k):\n if freq[j][0] > freq[j][1]:\n maxFreq = '1'\n else:\n maxFreq = '2'\n if a[i + j] != maxFreq:\n total += 1\nprint(total)\n\n \t \t\t \t\t\t\t \t\t\t\t\t \t \t \t\t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nfor i in range(k):\n b = c = 0\n for j in range(i, n, k):\n if a[j] == 1:\n b += 1\n else:\n c += 1\n ans += min(b, c)\nprint(ans)\n\n \t \t \t \t\t\t \t\t\t\t\t\t\t\t\t \t \t", "# -*- coding: utf-8 -*-\n\nn, k = [int(x) for x in input().split(' ')]\n\narray = [int(x) for x in input().split(' ')]\n\nones = [0 for _ in range(k)]\ntwos = [0 for _ in range(k)]\n\nfor i in range(n):\n if array[i] == 1:\n ones[i % k] += 1\n else:\n twos[i % k] += 1\n\ntotal = 0\n\nfor i in range(k):\n total += n / k - max(ones[i], twos[i])\n\nprint(int(total))\n \t \t\t \t \t\t \t \t \t \t\t\t \t\t\t\t", "k=int(input().split()[1])\r\nb=list(map(int,input().split()))\r\nc=0\r\nfor i in range(k):\r\n d=b[i::k]\r\n c+=min(d.count(1),d.count(2))\r\nprint(c)\r\n\r\n#we r looking at particular elements of each respective group(the k periodic group)..\r\n#and looking for the minimum changes", "line = input()\nline = line.split()\nn_k = [int(x) for x in line]\n\nline = input()\nline = line.split()\na = [int(x) for x in line]\n\ncompare = []\nfor i in range(n_k[1]):\n row = [0,0]\n compare.append(row)\n\nfor i in range(n_k[0]//n_k[1]):\n for j in range(n_k[1]):\n compare[j][a[j+i*n_k[1]]-1] += 1\n\nsum = 0\nfor i in range(n_k[1]):\n if(compare[i][0]>=compare[i][1]):\n sum += compare[i][1]\n else:\n sum += compare[i][0]\n\nprint(sum)\n\t \t \t\t \t\t \t \t", "# -*- coding: utf-8 -*-\n\nn, k = [int(x) for x in input().split(' ')]\n\narray = [int(x) for x in input().split(' ')]\n\none = [0 for _ in range(k)]\ntwo = [0 for _ in range(k)]\n\nfor i in range(n):\n if array[i] == 1:\n one[i % k] += 1\n else:\n two[i % k] += 1\n\ntotal = 0\n\nfor i in range(k):\n total += n / k - max(one[i], two[i])\n\nprint(int(total))\n\t\t \t\t\t \t \t\t \t\t \t \t\t\t\t\t\t\t", "n, k = map(int, input().split())\narray = input().split()\n\nconta1s = [0 for i in range(k)]\nconta2s = [0 for i in range(k)]\nmudancas = 0\n\nfor i in range(n):\n if array[i] == '1':\n conta1s[i%k] += 1\n else:\n conta2s[i%k] += 1\n\nfor i in range(k):\n mudancas += min(int(conta1s[i]), int(conta2s[i]))\n\nprint(mudancas)\n \t \t\t \t\t \t \t\t \t\t\t\t \t \t \t", "n, k = input().split(' ')\nn, k = int(n), int(k)\n\narray = input().split(' ')\n\ncount1 = [0]*k\ncount2 = [0]*k\nchanges = 0\n\n\nfor i in range(int(n/k)):\n for j in range(k):\n if(int(array[i*k+j]) == 1):\n count1[j] += 1\n else:\n count2[j] += 1\n\nfor i in range(k):\n changes += min(count1[i], count2[i])\n\nprint(changes)\n\t\t\t\t \t \t \t\t \t\t\t \t \t\t\t\t \t\t\t", "#===========Template===============\r\nfrom io import BytesIO, IOBase\r\nimport sys,os\r\ninpl=lambda:list(map(int,input().split()))\r\ninpm=lambda:map(int,input().split())\r\ninpi=lambda:int(input())\r\ninp=lambda:input()\r\nrev,ra,l=reversed,range,len\r\nP=print\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\n \r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n#=========I/p O/p ========================================#\r\nfrom bisect import bisect_left as bl \r\nfrom bisect import bisect_right as br\r\nimport sys,operator,math,operator\r\nfrom collections import Counter \r\n\r\n\r\n#==============To chaliye shuru krte he ====================#\r\nn,k=inpm()\r\nli=inpl()\r\nomap={}\r\nans=min(li.count(2),li.count(1))\r\nadd=0\r\nfor i in ra(k):\r\n a,b=0,0\r\n for j in ra(i,n,k):\r\n if li[j]==2:\r\n b+=1\r\n else:\r\n a+=1\r\n add+=min(a,b)\r\n# for i in range(2,n):\r\n# if n%i==0:\r\n# j=0\r\n# omapw={}\r\n# while j<n:\r\n# if ''.join(li[j:j+i]) in omapw:\r\n# omapw[''.join(li[j:j+i])]+=1\r\n# else:\r\n# omapw[''.join(li[j:j+i])]=1\r\n# j+=i\r\n# ma=0\r\n# for k,v in omapw.items():\r\n# if v>ma:\r\n# ma=v\r\n# wo=k\r\n# v=k\r\n# add=0\r\n\r\n# for k in range(0,n,i):\r\n# te=0\r\n# for t in ra(k,k+i):\r\n# if wo[te]!=li[t]:\r\n# add+=1\r\n# te+=1\r\n \r\n# ans=min(ans,add)\r\nP(min(ans,add))\r\n \r\n \r\n", "[n,k] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ndt ={}\r\nls0 =[]\r\nlsout = 0\r\n\r\nfor i in range(1,int(n/k)+1):\r\n\tdt[f\"{a[k*(i-1):k*i]}\"] = 0\r\n\tls0.append(a[k*(i-1):k*i])\r\n\t\r\nfor i in range(k):\r\n\tsum0 = 0\r\n\tfor j in range(int(n/k)):\r\n\t\tsum0 += ls0[j][i]\r\n\t\t\r\n\tlsout += int(min(n*2/k-sum0, sum0-n/k))\r\n\t\r\nprint(lsout)", "\n\nn, k = map(int, input().split())\na = [int(x) for x in input().split()]\nb = []\nans = 0\n\nres = []\ni = 0\nwhile i < len(a):\n res.append(a[i:i+k])\n i += k\n\ni = 0\nwhile i < k:\n cntTwo = 0\n cntOne = 0\n \n j = 0\n while j < len(res):\n if res[j][i] == 1:\n cntOne += 1\n else:\n cntTwo += 1\n j += 1\n\n if cntTwo > cntOne:\n b.append(2)\n else:\n b.append(1)\n i += 1\n\nx = 0\nfor i in a:\n if i != b[x]:\n ans += 1\n\n if x < k-1:\n x += 1\n else:\n x = 0\n\nprint(ans)\n\n\n", "n, k = [int(i) for i in input().split()]\nl = [int(i) - 1 for i in input().split()]\n\nnl = [0] * k\nplen = n // k\nfor i in range(0, n):\n nl[i % k] += l[i]\ntotal = 0\nfor c in nl:\n total += min(c, plen - c)\nprint(total)\n\n\t\t \t \t\t \t \t\t\t\t \t \t \t\t", "n, k = [int(c) for c in input().split()]\n\narray = [int(c) for c in input().split()]\n\n\nconjuntos = []\n\ntoChange = 0\n\nfor i in range(0, n, k):\n a = array[i:i+k]\n conjuntos.append(a)\n\nfor i in range(k):\n aux = []\n\n for j in conjuntos:\n aux.append(j[i])\n\n dois = aux.count(2)\n uns = aux.count(1)\n\n toChange += min(uns, dois)\n\nprint(toChange)\n\n\t\t\t\t \t \t\t \t \t \t \t \t \t \t\t\t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ng = (zip(*[w[i:i+k] for i in range(0, n, k)]))\r\nc = 0\r\nfor i in g:\r\n c += min(i.count(1), n//k - i.count(1))\r\nprint(c)\r\n", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(0, k):\r\n one = a[i::k].count(1)\r\n two = a[i::k].count(2)\r\n c += min(one, two)\r\nprint(c)\r\n\r\n", "n, k = list(map(int, input().split()))\r\na = input().split()\r\nc = 0\r\nfor i in range(k):\r\n x, y = 0, 0\r\n for j in range(i, n, k):\r\n if a[j] == '1':\r\n x += 1\r\n else:\r\n y += 1\r\n c += min(x, y)\r\nprint(c)", "n, k = [int(x) for x in input().split()]\narray = [int(x) for x in input().split()]\n\nchunks = [array[i:i + k] for i in range(0, n, k)]\n\nchunk_count = len(chunks)\ndiff = 0\nfor i in range(k):\n count = { 1: 0, 2: 0 }\n for chunk in chunks:\n count[chunk[i]] += 1\n\n diff += min(chunk_count - count[1], chunk_count - count[2])\n\nprint(diff)\n\n\t \t \t\t\t\t\t \t \t \t \t\t\t\t \t \t", "n, k = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(k):\r\n memo = {}\r\n for j in range(i, n, k):\r\n memo[data[j]] = memo[data[j]] + 1 if data[j] in memo else 1\r\n cnt += sum(memo.values()) - max(memo.values())\r\n\r\nprint(cnt)", "from collections import Counter\r\n \r\nX = list(map(int, input().split()))\r\nNumbers = list(map(int, input().split()))\r\nprint(sum((X[0] // X[1] - max(Counter(Numbers[i::X[1]]).values())) for i in range(X[1])))\r\n \r\n# A new start\r\n# Here in Tabas\r\n# Waiting for the big news", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=0\r\nfor y in range(k):\r\n ikki = 0\r\n bir = 0\r\n for x in range(y,n,k):\r\n ikki += a[x]== 2\r\n bir += a[x]== 1\r\n if ikki != 0 or bir != 0:\r\n s += min(ikki,bir)\r\nprint(s)", "def f(it, ls):\r\n a = 0\r\n b = 0\r\n for e in ls:\r\n if e[it] == '1':\r\n a += 1\r\n else:\r\n b += 1\r\n return a if a < b else b\r\nn, k = list(map(int, input().split()))\r\nl1 = input().split()\r\nl2 = []\r\nfor i in range(0, n, k):\r\n if i + k <= n:\r\n t = tuple(l1[i:i+k])\r\n l2.append(t)\r\nif len(l2) == 1 and len(set(l2)) == 1:\r\n print(0)\r\nelse:\r\n print(sum([f(j, l2) for j in range(k)]))", "def contarMudancas(n, k):\n vetor = list(map(int, input().split(' ')))\n cont1 = []\n cont2 = []\n for i in range(k):\n cont1.append(0)\n cont2.append(0)\n for i in range(n):\n if vetor[i] == 1:\n cont1[i % k] += 1\n else:\n cont2[i % k] += 1\n minMudancas = 0\n for i in range(k):\n if cont1[i] >= cont2[i]:\n minMudancas += cont2[i]\n else:\n minMudancas += cont1[i]\n return minMudancas\n\nif __name__ == \"__main__\":\n nk = list(map(int, input().split(' ')))\n print(contarMudancas(nk[0], nk[1]))\n\t \t\t \t \t\t\t\t \t \t \t \t\t \t", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nx=[]\r\nc=0\r\nfor j in range(k):\r\n x=lst[j::k]\r\n x1=x.count(1)\r\n x2=x.count(2)\r\n c+=min(x1,x2)\r\nprint(c)", "[n, k] = [int(i) for i in input().split()]\n\narr = [int(i) for i in input().split()]\ncounter = []\nfor i in range(k):\n counter.append({1: 0, 2: 0})\n for j in range(i, n, k):\n counter[i][arr[j]] += 1\n\nresult = 0\nfor i in range(k):\n result += min(counter[i].values())\n\nprint(result)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\nfor i in range(0, k):\n n1 = a[i::k].count(1)\n n2 = a[i::k].count(2)\n ans += min(n1 , n2)\nprint(ans)\n\t \t\t\t\t\t \t\t\t\t\t\t \t\t \t\t\t \t \t \t", "n, k = map(int,input().split())\r\narr = ''.join(input().split())\r\narr2 = ['' for i in range(k)]\r\ncnt = 0\r\nfor j in range(k):\r\n for i in range(j,len(arr),k):\r\n arr2[j] += arr[i]\r\nfor subarr in arr2:\r\n cnt += min(subarr.count('1'), subarr.count('2'))\r\nprint(cnt)", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ns = 0\r\nx = n//k\r\nfor i in range(k):\r\n cnt = 0\r\n for j in range(i,n,k):\r\n if arr[j]==1:\r\n cnt += 1\r\n s += min(cnt,x-cnt)\r\nprint(s)" ]

[ "n = int(input())\r\ndp = [[0 for _ in range(n)] for _ in range(n)]\r\ndp[0][0] = 1\r\nMOD = 10**9 + 7\r\nlast = input()\r\nfor i in range(1, n):\r\n x = input()\r\n if x == 'f' and last == 'f':\r\n for j in range(n-1):\r\n dp[i][j+1] = dp[i-1][j] % MOD\r\n elif x == 'f':\r\n res = 0\r\n for j in range(i-1, -1, -1):\r\n res = (res+dp[i-1][j]) % MOD\r\n dp[i][j] = res % MOD\r\n elif x == 's' and last == 'f':\r\n for j in range(n-1):\r\n dp[i][j+1] = dp[i-1][j] % MOD\r\n else:\r\n res = 0\r\n for j in range(i-1, -1, -1):\r\n res = (res+dp[i-1][j]) % MOD\r\n dp[i][j] = res % MOD\r\n last = x\r\nprint(sum(dp[n-1]) % MOD)\r\n", "n=int(input())\r\ns=[input() for i in range(n)]\r\ndp=[[0 for i in range(n)] for j in range(n)]\r\ndp[0][0]=1\r\n#print(dp)\r\ndef summ(a,mod):\r\n ans=0\r\n for i in range(len(a)):\r\n ans+=a[i]\r\n ans%=mod\r\n return ans\r\nfor i in range(1,n):\r\n sm=summ(dp[i-1],(10**9+7))\r\n for j in range(n):\r\n if(s[i-1]=='f'):\r\n if(j==0):\r\n dp[i][j]=0\r\n else:\r\n dp[i][j]=dp[i-1][j-1]%(10**9+7)\r\n else:\r\n dp[i][j]=sm\r\n sm=(sm-dp[i-1][j]+10**9+7)%(10**9+7)\r\n#print(dp)\r\nprint(summ(dp[n-1],(10**9+7)))", "n = int(input())\r\ndp = [[0 for i in range(n + 1)] for j in range(n + 1)] \r\ndp[0][0] = 1\r\nmod = 1000000007\r\ns = []\r\nfor _ in range(n) :\r\n s.append(input())\r\nfor _ in range(1,n + 1) :\r\n if s[_ - 1] == \"f\" :\r\n for __ in range(1,n + 1) :\r\n dp[_][__] = dp[_ - 1][__ - 1]\r\n dp[_][0] = 0\r\n else :\r\n sum = 0\r\n for __ in reversed(range(n)) :\r\n dp[_][__] = sum + dp[_ - 1][__]\r\n sum += dp[_ - 1][__]\r\n sum %= mod\r\n dp[_][__] %= mod\r\n # print(_,dp)\r\nans = 0\r\nfor __ in range(n) :\r\n ans += dp[n - 1][__]\r\n ans %= mod\r\n# print(dp)\r\nprint(int(ans))", "from sys import stdin,stdout,setrecursionlimit\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\t\r\nfrom bisect import bisect_right as br,bisect_left as bl\r\nfrom heapq import *\r\nmod = 10**9+7\r\n\r\n\r\ndef solve():\r\n\tn = it()\r\n\tv=[0]*(n+1)\r\n\tfor i in range(1,n+1):\r\n\t\tv[i] = input()\r\n\t\r\n\tdp=[[0]*(n+2) for _ in range(n+1)]\r\n\r\n\tfor l in range(n+2):\r\n\t\tdp[n][l] = 1\r\n\r\n\tfor i in range(n-1,0,-1):\r\n\t\tcurr_sum = 0\r\n\t\tfor l in range(n):\r\n\t\t\tcurr_sum += dp[i+1][l]\r\n\t\t\tcurr_sum%=mod\r\n\t\t\tif v[i] == 'f':\r\n\t\t\t\tdp[i][l] = dp[i+1][l+1]\r\n\t\t\telse:\r\n\t\t\t\tdp[i][l]= curr_sum\r\n\r\n\tprint(dp[1][0])\r\n\r\nsolve()\r\n", "MOD = int(1e9+7)\r\nn = int(input())\r\na = [input() for i in range(n)]\r\ndp = [1]\r\nfor i in range(n):\r\n if a[i] == 'f':\r\n dp.append(0)\r\n continue\r\n for j in range(1, len(dp)):\r\n dp[j] = (dp[j] + dp[j-1]) % MOD\r\nprint(dp[-1])\r\n", "M = int(1e9) + 7\r\nind = 0\r\ndp = [1]\r\n\r\nfor _ in range(int(input())):\r\n if input() == 's':\r\n for i in range(ind):\r\n dp[i+1] = (dp[i+1] + dp[i]) % M\r\n\r\n else:\r\n ind += 1\r\n dp += [0]\r\n\r\nprint(dp[-1])", "n = int(input())\r\n\r\nmod = 10**9 + 7\r\ndp = [0 for i in range(10000)]\r\ndp[0] = 1\r\n\r\npos = 1\r\n\r\nfor i in range(n):\r\n\tx = input()\r\n\tif x == \"s\":\r\n\t\tfor j in range(1, pos):\r\n\t\t\tdp[j] = dp[j - 1] + dp[j]\r\n\t\t\tdp[j] %= mod\r\n\telse:\r\n\t\tpos += 1\r\nprint(dp[pos - 1])\r\n", "n = int(input())\ndp = [1]\nfor i in range(n):\n c = input()\n if c == \"f\":\n dp.insert(0,0)\n else:\n for j in range(len(dp) - 2, -1, -1):\n dp[j] = (dp[j] + dp[j + 1]) % 1000000007\nprint(dp[0])\n", "MOD = 1000000007\r\n\r\nn = int(input())\r\ndp = [[0 for _ in range(n)] for _ in range(n)]\r\ndp[0][0] = 1\r\nlast = input()\r\n\r\nfor i in range(1, n):\r\n cur = input()\r\n if cur == 'f' and last == 'f':\r\n for j in range(n - 1):\r\n dp[i][j + 1] = dp[i - 1][j] % MOD\r\n elif cur == 'f':\r\n res = 0\r\n for j in range(i - 1, -1, -1):\r\n res = (res + dp[i - 1][j]) % MOD\r\n dp[i][j] = res % MOD\r\n elif cur == 's' and last == 'f':\r\n for j in range(n - 1):\r\n dp[i][j + 1] = dp[i - 1][j] % MOD\r\n else:\r\n res = 0\r\n for j in range(i - 1, -1, -1):\r\n res = (res + dp[i - 1][j]) % MOD\r\n dp[i][j] = res % MOD\r\n last = cur\r\n\r\nprint(sum(dp[n - 1]) % MOD)", "from functools import lru_cache\r\nimport threading\r\nfrom sys import stdin, stdout, setrecursionlimit\r\n\r\nsetrecursionlimit(1 << 30)\r\nthreading.stack_size(1 << 27)\r\n\r\n\r\ndef inp():\r\n return int(stdin.readline())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, stdin.readline().strip().split()))\r\n\r\n\r\ndef insr():\r\n s = stdin.readline().strip()\r\n return list(s[:len(s)])\r\n\r\n\r\ndef invr():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\n'''\r\n4\r\nf\r\ns\r\nf\r\ns\r\n'''\r\n\r\n\r\ndef main():\r\n mod = 10 ** 9 + 7\r\n n = inp()\r\n x = [1]\r\n for i in range(n):\r\n s = stdin.readline().strip()\r\n if s == 'f':\r\n x.insert(0, 0)\r\n else:\r\n for i in range(len(x) - 2, -1, -1):\r\n x[i] = (x[i] + x[i + 1]) % mod\r\n print(x[0])\r\n\r\n\r\nmain_thread = threading.Thread(target=main)\r\nmain_thread.start()\r\nmain_thread.join()\r\n", "I,G=input,range;n=int(I());f=[0]*(n+1);f[1],d=1,1\r\nfor i in G(n):\r\n if I()=='f':d+=1\r\n else:\r\n for j in G(1,d+1):f[j]=(f[j]+f[j-1])%(10**9+7)\r\nprint(f[d])", "# by the authority of GOD author: manhar singh sachdev #\r\n\r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\ndef main():\r\n n = int(input())\r\n arr = [input().strip() for _ in range(n)]\r\n mod,i,arr1 = 10**9+7,0,[]\r\n while i != n:\r\n if arr[i] == 'f':\r\n cnt = 0\r\n while i != n and arr[i] == 'f':\r\n cnt += 1\r\n i += 1\r\n arr1.append(cnt)\r\n else:\r\n arr1.append(0)\r\n i += 1\r\n x,y = len(arr1),sum(arr1)\r\n dp = [[0]*(y+1) for _ in range(x+1)]\r\n dp[0][0] = 1\r\n for i in range(1,x+1):\r\n j = 0\r\n for k in range(y,arr1[i-1]-1,-1):\r\n j = (j+dp[i-1][k-arr1[i-1]])%mod\r\n dp[i][k] = j\r\n ans = 0\r\n for i in dp[-1]:\r\n ans = (ans+i)%mod\r\n print(ans)\r\n\r\n#Fast IO Region\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\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\ndp = [1]\r\nfor IND in range(n):\r\n c = input()\r\n if c == \"f\":\r\n dp.insert(0,0)\r\n else:\r\n for i in range(len(dp)-2, -1, -1): dp[i] = (dp[i] + dp[i+1]) % 1000000007\r\nprint(dp[0])", "import sys\n\n\nif __name__ == '__main__':\n n = int(input())\n statements = [input() for _ in range(n)]\n if statements[-1] == 'f':\n print(0)\n sys.exist(0)\n\n if n == 1:\n print(1)\n sys.exit(0)\n\n max_level = [1] * n\n idx = 1\n for i in range(n):\n max_level[i] = idx\n if statements[i] == 'f':\n idx += 1 \n\n ways = [1] * max_level[-1]\n mod = 10 ** 9 + 7\n for i in range(1, n):\n if statements[n - 1 - i] == 's':\n ways[0] = ways[0] % mod\n for j in range(1, max_level[n - 1 - i]):\n ways[j] += ways[j - 1]\n ways[j] = ways[j] % mod\n else:\n for j in range(max_level[n - 1 - i]):\n ways[j] = ways[j + 1] % mod\n print(ways[0])\n \n \n", "def add(x,j):\r\n\tx = x % (1000000000+7)\r\n\tj=j % (1000000000+7)\r\n\treturn (x+j) % (1000000000+7)\r\n\r\nstatements = []\r\nn =int(input())\r\ni=1\r\nj=1\r\ntemp = [[0 for i in range(n)] for i in range(n)]\r\nearlier = [[0 for i in range(n)] for i in range(n)]\r\ntemp[0][0]=1\r\nearlier[0][0]=1\r\n\r\nwhile(i<=n):\r\n\ts = input()\r\n\tstatements.append(s)\r\n\ti+=1\r\nwhile(j<n):\r\n\ttemp[0][j]=0\r\n\tearlier[0][j] = temp[0][j] + earlier[0][j-1]\r\n\tj+=1\r\ni=1\r\nwhile(i<n):\r\n\tif(statements[i-1]=='f'):\r\n\t\tj=1\r\n\t\twhile(j<n):\r\n\t\t\ttemp[i][0]=0\r\n\t\t\tearlier[i][0]=0\r\n\t\t\ttemp[i][j] = temp[i-1][j-1]\r\n\t\t\tearlier[i][j] = add(earlier[i][j-1],temp[i][j])\r\n\r\n\t\t\tj+=1\r\n\telse:\r\n\t\tj=0\r\n\t\twhile(j<n):\r\n\t\t\tif(j==0):\r\n\t\t\t\ttemp[i][j] = earlier[i-1][n-1]\r\n\t\t\telse:\r\n\t\t\t\ttemp[i][j] = earlier[i-1][n-1] - earlier[i-1][j-1]\r\n\t\t\tearlier[i][j] = add(earlier[i][j-1],temp[i][j])\r\n\t\t\tj+=1\r\n\ti+=1\r\n\r\nans = 0\r\nj=0\r\nwhile(j<n):\r\n\tans=add(ans,temp[n-1][j])\r\n\tj+=1\r\n\r\nprint(ans%(1000000000+7))", "from collections import *\r\n\r\n\r\ndef dp():\r\n mem = [1]\r\n\r\n for i in range(n):\r\n if a[i] == 'f':\r\n mem.append(0)\r\n else:\r\n for j in range(1, len(mem)):\r\n mem[j] = (mem[j] + mem[j - 1]) % mod\r\n return mem[-1]\r\n\r\n\r\nn, mod = int(input()), 1000000007\r\na = [input() for i in range(n)]\r\nprint(dp())\r\n", "n = int(input())\r\nA = []\r\n\r\nfor i in range(n):\r\n x = input()\r\n A.append(x)\r\n\r\ndp = [[0 for i in range(n+1)] for j in range(n+1)]\r\n\r\nmod = 10**9 + 7\r\n\r\nfor i in range(n+1):\r\n dp[n-1][i] = 1\r\n\r\nfor line in range(n-2, -1, -1):\r\n sum = 0\r\n if A[line]=='s':\r\n for indent in range(n):\r\n sum = (sum + dp[line+1][indent])%mod\r\n dp[line][indent] = sum\r\n else:\r\n for indent in range(n):\r\n dp[line][indent] = dp[line+1][indent+1]\r\n\r\n \r\nprint(dp[0][0])\r\n \r\n", "import sys\r\ninput = sys.stdin.readlines()\r\nn = int(input[0].strip())\r\nm = 10**9 + 7\r\ncurr = [0] * (n+20)\r\nlast = [0] * (n+20)\r\ncurr[0] = 1\r\nfor s in range(1,n):\r\n last, curr = curr, last\r\n if input[s]=='f\\n':\r\n curr[0] = 0\r\n for i in range(len(last)-1):\r\n curr[i+1] = last[i]\r\n elif input[s]=='s\\n':\r\n curr[-1] = 0\r\n for i in range(len(last)-2, -1, -1):\r\n curr[i] = (curr[i+1] + last[i]) % m\r\ns = 0\r\nfor x in curr:\r\n s = (s + x) % m\r\nprint(s)", "MOD = int(1e9+7)\r\nn = int(input())\r\ndp = [0]*5000\r\ndp[0] = 1\r\ncntFor = 1 \r\nfor i in range(n):\r\n c = input()\r\n if c == 'f':\r\n cntFor+=1\r\n else:\r\n for j in range(1, cntFor):\r\n dp[j] = (dp[j] + dp[j - 1]) % MOD\r\nprint (dp[cntFor - 1])\r\n\r\n", "n = int(input())\r\nMOD = 10**9 + 7\r\nans = [0] * 5005\r\nans[0] = 1 \r\nindent = 1\r\nfor _ in range(n):\r\n\tc = input()\r\n\tif(c == 'f'):\r\n\t\tindent += 1\r\n\telse:\r\n\t\tfor i in range(1, indent):\r\n\t\t\tans[i] += ans[i - 1]\r\n\t\t\tans[i] %= MOD\r\n\t\t\t\r\nprint(ans[indent - 1])\r\n", "n = int(input())\r\ndp = [1] + [0] * n\r\np = input()\r\nfor _ in range(n - 1):\r\n if p == 'f':\r\n dp = [0] + dp[:n - 1]\r\n else:\r\n for i in range(n - 2, -1, -1):\r\n dp[i] = (dp[i] + dp[i + 1]) % (10**9+7)\r\n p = input()\r\nprint(sum(dp) % (10**9+7))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nmod = pow(10, 9) + 7\r\ndp0 = [1]\r\nm = 0\r\nla = 1\r\nfor _ in range(n):\r\n s = ord(input().rstrip())\r\n if not s & 1:\r\n m += 1\r\n dp = [0] * (m + 1)\r\n if not la & 1:\r\n for i in range(1, len(dp0) + 1):\r\n dp[-i] = dp0[-i]\r\n else:\r\n u = 0\r\n for i in range(1, len(dp0) + 1):\r\n u += dp0[-i]\r\n u %= mod\r\n dp[-i] = u\r\n dp0 = dp\r\n la = s\r\nans = sum(dp) % mod\r\nprint(ans)", "n = int(input())\na = ['' for i in range(n+1)]\nfor i in range(1, n+1):\n a[i] = input()\ndp = [[1 for i in range(n + 2)] for j in range(n + 1)]\nfor i in range(n):\n dp[i][i] = 1\nfor i in reversed(range(1, n)):\n sum = 0\n for j in range(n):\n sum += dp[i+1][j]\n sum %= 1000000007\n if a[i] == 'f':\n dp[i][j] = dp[i+1][j+1]\n else:\n dp[i][j] = sum\nprint(dp[1][0])", "# DP 1\n\n# n = int(input())\n# dp = [1]\n# for i in range(n):\n# c = input()\n# if c == \"f\":\n# dp.insert(0,0)\n# else:\n# for j in range(len(dp) - 2, -1, -1):\n# dp[j] = (dp[j] + dp[j + 1]) % 1000000007\n# print(dp)\n# print(dp[0])\n\nn = int(input())\ndp = [1]\nfor i in range(n):\n c = input()\n if c == \"f\":\n dp.append(0)\n else:\n for j in range(1, len(dp)):\n dp[j] = (dp[j] + dp[j - 1]) % 1000000007\nprint(dp[-1])\n", "MOD = (10**9) + 7\r\nn = int(input())\r\nl = []\r\ndp = [0]*n\r\nfor i in range(n):\r\n l.append(input())\r\ndp[0] = 1\r\nans = 1\r\nfor i in range(n):\r\n if (l[i] == \"f\"):\r\n ans += 1\r\n continue\r\n for j in range(1, ans):\r\n dp[j] += (dp[j - 1] % MOD)\r\nprint(dp[ans - 1] % MOD)\r\n", "n = int(input())\r\ndelmod = 1000000007\r\ndp = [[0] * (n + 1) for _ in range(n)]\r\ndp[0][0] = 1\r\nfor i in range(1, n):\r\n cursum = 0\r\n x = input()\r\n for j in range(n, -1, -1):\r\n if x == 's':\r\n cursum += dp[i - 1][j]\r\n dp[i][j] += cursum % delmod\r\n dp[i][j] %= delmod\r\n elif j > 0:\r\n dp[i][j] += dp[i - 1][j - 1]\r\n dp[i][j] %= delmod\r\nanswer = 0\r\nfor i in range(n + 1):\r\n answer += dp[n - 1][i]\r\n answer %= delmod\r\nprint(answer)", "n = int(input())\na = [input() for _ in range(n)]\n\nMOD = int(1e9+7)\nconst = 5001\nlevels = [0]*const\nlevels[0] = 1\n\nfor i in range(n-1):\n if a[i]=='f':\n for j in range(const-2,-1,-1):\n levels[j+1]=levels[j]\n levels[0]=0\n else:\n cumsum = 0\n for j in range(const-1,-1,-1):\n cumsum += levels[j]\n cumsum%=MOD\n levels[j]=cumsum\nprint(sum(levels)%MOD)\n" ]

[ "n = int(input())\nts = sorted((list(map(float,input().strip().split())) for _ in range(n)), key=lambda x:x[2])\nd = [0]*n\nans = 0\nfor i in range(n):\n d[i] = ts[i][3]\n for j in range(i):\n if (ts[i][0]-ts[j][0])**2 + (ts[i][1]-ts[j][1])**2 <= (ts[i][2]-ts[j][2])**2:\n d[i] = max(d[i], d[j]+ts[i][3])\n ans = max(ans, d[i])\nprint('%.9f'%ans)\n\t\t \t\t \t \t\t\t \t\t \t \t \t \t \t", "F = lambda: map(float, input().split())\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n x, y, t, s = F()\r\n arr.append([int(x), int(y), int(t), s])\r\narr.sort(key=lambda x: x[2])\r\ndp = [0] * n\r\nfor i in range(n):\r\n dp[i] = arr[i][-1]\r\n for j in range(i):\r\n if (arr[i][0] - arr[j][0]) ** 2 + (arr[i][1] - arr[j][1]) ** 2 <= (arr[i][2] - arr[j][2]) ** 2:\r\n dp[i] = max(dp[i], dp[j] + arr[i][-1])\r\nprint(max(dp))", "n=int(input())\r\nclass Target:\r\n def __init__(self,x,y,t,p):\r\n self.x=x\r\n self.y=y\r\n self.t=t\r\n self.p=p\r\n self.best=0\r\ntargets=[0]*(n)\r\nfor i in range(n):\r\n p=[el for el in input().split()]\r\n targets[i]=Target(int(p[0]),int(p[1]),int(p[2]),float(p[3]))\r\ntargets.sort(key=lambda x:(x.t))\r\nbest=0\r\nfor i in range(n):\r\n a=targets[i]\r\n a.best+=a.p\r\n best=max(best,a.best)\r\n for j in range(i+1,n): \r\n b=targets[j]\r\n if (b.t-a.t)**2<(b.x-a.x)**2+(b.y-a.y)**2:\r\n continue\r\n b.best=max(b.best,a.best)\r\nprint(best)", "class Target:\n def __init__(self, x, y, t, p):\n self.x = x\n self.y = y\n self.t = t\n self.p = p\n self.best = 0\n\nn = int(input())\ntargets = n * [ None ]\nfor i in range(n):\n parts = input().split()\n x, y, t = map(int, parts[:3])\n p = float(parts[3])\n targets[i] = Target(x, y, t, p)\ntargets.sort(key=lambda target: target.t)\n\nbest = 0\nfor i, a in enumerate(targets):\n a.best += a.p\n best = max(best, a.best)\n for j in range(i + 1, n):\n b = targets[j]\n if (b.t - a.t) ** 2 < (b.x - a.x) ** 2 + (b.y - a.y) ** 2:\n continue\n b.best = max(b.best, a.best)\nprint(best)\n", "def is_reachable(from_state, target):\r\n return (from_state[0]-target[0])**2 + (from_state[1]-target[1])**2 <= (target[2] - from_state[2])**2\r\n\r\nnum_iter = int(input())\r\n \r\ntargets = sorted([list(map(float, input().strip().split(' '))) for dummy in range(0, num_iter)], key=lambda single_target: single_target[2])\r\n\r\nstates = []\r\n\r\nfor i, target in enumerate(targets):\r\n states.append(target[3])\r\n for j in range(i):\r\n if is_reachable(targets[j], target):\r\n score_estimate = states[j] + target[3]\r\n if (states[i] < score_estimate):\r\n states[i] = score_estimate\r\nmax_score = max(states)\r\nprint(max_score)\r\n", "n=int(input())\r\nb=[]\r\nfor i in range(n):\r\n x,y,t,p=map(float,input().split())\r\n b.append([t,x,y,p])\r\n\r\nb.sort()\r\ndp=[0 for j in range(n)]\r\ndp[0]=b[0][3]\r\n\r\nans=0\r\nfor i in range(1,n):\r\n t,x,y,p=b[i]\r\n j=i-1\r\n while(j>=0):\r\n t1,x1,y1,p1=b[j]\r\n if ((x1-x)**2+(y1-y)**2)**0.5<=(t-t1):\r\n dp[i]=max(dp[i],dp[j])\r\n j+=-1\r\n\r\n dp[i]+=p\r\n\r\nprint(max(dp))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "##########################################################\r\nfrom collections import Counter\r\ndef nCk(n, k):\r\n res = 1\r\n for i in range(1, k + 1):\r\n res = res * (n - i + 1) // i\r\n return res\r\nimport math\r\ninf=10**20\r\nn=int(input())\r\nc=[]\r\ndp=[0]*(n+1)\r\nfor i in range(n):\r\n x,y, t,p = map(float, input().split())\r\n c.append([int(x),int(y),int(t),p])\r\n\r\nc.sort(key=lambda x:x[2])\r\n\r\nfor i in range(n):\r\n dp[i]=c[i][3]\r\n for j in range(i):\r\n if (c[i][0]-c[j][0])**2+(c[i][1]-c[j][1])**2 <= (c[i][2]-c[j][2])**2:\r\n dp[i]=max(dp[i],dp[j]+c[i][-1])\r\nprint(max(dp))", "import sys\r\ninput = sys.stdin.readline\r\nfrom operator import itemgetter\r\n\r\nn=int(input())\r\nT=[tuple(map(float,input().split())) for i in range(n)]\r\n\r\nT.sort(key=itemgetter(2))\r\n\r\nDP=[0]*n\r\n\r\nfor i in range(n):\r\n x,y,t,p=T[i]\r\n DP[i]=p\r\n\r\n for j in range(i):\r\n x2,y2,t2,p2=T[j]\r\n\r\n if (x2-x)**2+(y2-y)**2<=(t2-t)**2:\r\n DP[i]=max(DP[i],DP[j]+p)\r\n\r\nprint(max(DP))\r\n" ]

[ "import sys\r\ns, n = 0, int(input())\r\nt = list(map(int, sys.stdin.read().split()))\r\np = [(t[2 * i], t[2 * i + 1]) for i in range(n)]\r\nfor x, i in enumerate(p, 1):\r\n for j in p[x:]:\r\n a = b = 0\r\n for k in p:\r\n d = (i[0] - k[0]) * (j[1] - k[1]) - (i[1] - k[1]) * (j[0] - k[0])\r\n a, b = min(d, a), max(d, b)\r\n if a and b: s = max(s, b - a)\r\nprint(s / 2)" ]

[ "class Event:\n def __init__(self, span_id, point, open=False, close=False):\n self.span_id, self.point = span_id, point\n self.open, self.close = open, close\n self.sort_key = 2 * point + (1 if open else 0)\n self.count = 0\n\nclass Span:\n def __init__(self, left, right):\n self.left, self.right = left, right\n\nn = int(input())\nevents = 2 * n * [ None ]\nspans = n * [ None ]\nfor i in range(n):\n a, b = map(int, input().split())\n spans[i] = Span(a, b)\n events[2 * i] = Event(i + 1, a, open=True)\n events[2 * i + 1] = Event(i + 1, b, close=True)\nevents.sort(key=lambda event: event.sort_key)\n\ndef fail():\n print(0)\n import sys; sys.exit()\n\nsingles = set()\nmultiple = None\nopen_span_ids = set()\nfor event in events:\n if event.close:\n open_span_ids.remove(event.span_id)\n else:\n open_span_ids.add(event.span_id)\n if len(open_span_ids) == 3:\n #print('triple')\n fail()\n elif len(open_span_ids) == 2:\n for id in open_span_ids:\n if id in singles:\n if multiple == None:\n multiple = id\n elif id != multiple:\n #print('two doubles')\n fail()\n else:\n singles.add(id)\n\n#print(singles)\nif multiple != None:\n result = [ multiple ]\nelif len(singles) > 0:\n result = sorted(singles)\nelse:\n result = list(range(1, n + 1))\nprint(len(result))\nprint(' '.join(list(map(str, result))))\n", "n=int(input())\r\na=sorted([list(map(int,input().split()))+[i+1] for i in range(n)])\r\nb=[]\r\nd=[]\r\nc=0\r\nfor j in range(n-1):\r\n if a[j][1]>a[j+1][0]:\r\n d.append(False)\r\n c+=1\r\n else:\r\n d.append(True)\r\nif c==0:\r\n b=list(range(1,n+1))\r\nelif c==1:\r\n for i in range(n-1):\r\n if not(d[i]):\r\n b.append(a[i][2])\r\n if i!=n-2 and a[i][1]<=a[i+2][0]:\r\n b.append(a[i+1][2])\r\n break\r\nelif c==2:\r\n for i in range(n-2):\r\n if not(d[i] or d[i+1]):\r\n if a[i][1]<=a[i+2][0]:\r\n b.append(a[i+1][2])\r\n break\r\nprint(len(b))\r\nprint(*sorted(b))", "def not_intersect(ex):\r\n tmp = [elem for i,elem in enumerate(lst) if i != ex]\r\n for i in range(len(tmp)-1):\r\n if tmp[i][1] > tmp[i+1][0]:\r\n return False\r\n return True\r\nn = int(input())\r\nlst = [list(map(int, input().split())) for _ in range(n)]\r\nmp = sorted(enumerate(lst), key=lambda x: x[1])\r\nidx, lst = [i[0] for i in mp], [i[1] for i in mp]\r\nans = [idx[i]+1 for i in range(n) if not_intersect(i)]\r\nprint(len(ans))\r\nif ans:\r\n print(' '.join(list(map(str,sorted(ans)))))\r\n \r\n\r\n", "def get_input():\n sections = []\n n = int(input())\n for i in range(n):\n l, r = map(int, input().split())\n sections.append((l, r))\n\n return n, sections\n\n\ndef counting_sections_for_numbers(n, sections, count_of_numbers):\n count_section_for_numbers = [0] * count_of_numbers\n for section in sections:\n l, r = section\n count_section_for_numbers[l] += 1\n count_section_for_numbers[r] -= 1\n\n for i in range(count_of_numbers - 1):\n count_section_for_numbers[i + 1] += count_section_for_numbers[i]\n\n return count_section_for_numbers\n\n\ndef find_valid_sections(n, sections, count_sections_for_numbers, COUNT_OF_NUMBERS, count_numbers_in_two_sections, count_numbers_in_three_sections):\n valid_sections = []\n for i in range(n):\n l, r = sections[i]\n two_numbers_befor_section = count_numbers_in_two_sections[l] - count_numbers_in_two_sections[0]\n three_numbers_in_section = count_numbers_in_three_sections[l] - count_numbers_in_three_sections[r]\n two_numbers_after_section = count_numbers_in_two_sections[COUNT_OF_NUMBERS - 1] - count_numbers_in_two_sections[r]\n if two_numbers_after_section == 0 and two_numbers_befor_section == 0 and three_numbers_in_section == 0:\n valid_sections.append(i + 1)\n\n return valid_sections\n\n\ndef counting_numbers_in_two_sections(count_sections_for_numbers):\n count_numbers_in_two_sections = [0]\n for i in range(1, len(count_sections_for_numbers)):\n current_number = count_numbers_in_two_sections[i - 1]\n if count_sections_for_numbers[i - 1] == 2:\n current_number += 1\n count_numbers_in_two_sections.append(current_number)\n\n return count_numbers_in_two_sections\n\n\ndef counting_numbers_in_three_sections(count_sections_for_numbers):\n count_numbers_in_three_sections = [0]\n for i in range(1, len(count_sections_for_numbers)):\n current_number = count_numbers_in_three_sections[i - 1]\n if count_sections_for_numbers[i - 1] >= 3:\n current_number += 1\n count_numbers_in_three_sections.append(current_number)\n\n return count_numbers_in_three_sections\n\ndef solve():\n n, sections = get_input()\n count_of_numbers = 1000000 + 1\n count_sections_for_numbers = counting_sections_for_numbers(n, sections, count_of_numbers)\n count_numbers_in_two_sections = counting_numbers_in_two_sections(count_sections_for_numbers)\n count_numbers_in_three_sections = counting_numbers_in_three_sections(count_sections_for_numbers)\n # print(len(count_numbers_in_three_sections), len(count_numbers_in_two_sections))\n\n valid_sections = find_valid_sections(n, sections, count_sections_for_numbers, count_of_numbers, count_numbers_in_two_sections, count_numbers_in_three_sections)\n\n print(len(valid_sections))\n for section in valid_sections:\n print(section, end=\" \")\n print()\n\n\nsolve()\n", "from operator import add\r\nimport sys\r\nfrom array import array # noqa: F401\r\nfrom typing import TypeVar, Generic, Callable, List\r\nT = TypeVar('T')\r\n\r\n\r\nclass SegmentTree(Generic[T]):\r\n __slots__ = [\"size\", \"tree\", \"identity\", \"op\", \"update_op\"]\r\n\r\n def __init__(self, size: int, identity: T, op: Callable[[T, T], T],\r\n update_op: Callable[[T, T], T]) -> None:\r\n self.size = size\r\n self.tree = [identity] * (size * 2)\r\n self.identity = identity\r\n self.op = op\r\n self.update_op = update_op\r\n\r\n def build(self, a: List[T]) -> None:\r\n tree = self.tree\r\n tree[self.size:self.size + len(a)] = a\r\n\r\n for i in range(self.size - 1, 0, -1):\r\n tree[i] = self.op(tree[i << 1], tree[(i << 1) + 1])\r\n\r\n def find(self, left: int, right: int) -> T:\r\n left += self.size\r\n right += self.size\r\n tree, result, op = self.tree, self.identity, self.op\r\n\r\n while left < right:\r\n if left & 1:\r\n result = op(tree[left], result)\r\n left += 1\r\n if right & 1:\r\n result = op(tree[right - 1], result)\r\n left, right = left >> 1, right >> 1\r\n\r\n return result\r\n\r\n def update(self, i: int, value: T) -> None:\r\n op, tree = self.op, self.tree\r\n i = self.size + i\r\n tree[i] = self.update_op(tree[i], value)\r\n\r\n while i > 1:\r\n i >>= 1\r\n tree[i] = op(tree[i << 1], tree[(i << 1) + 1])\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 = [tuple(map(int, input().split())) for _ in range(n)]\r\nmax_n = 10**6 + 10\r\nimos = [0] * max_n\r\nfor l, r in a:\r\n imos[l] += 1\r\n imos[r] -= 1\r\n\r\nfor i in range(max_n - 5):\r\n imos[i + 1] += imos[i]\r\n\r\nsegt = SegmentTree[int](max_n, 0, max, add)\r\nsegt.build(imos)\r\n\r\nans = []\r\n\r\nfor i, (l, r) in enumerate(a, start=1):\r\n if segt.find(0, l) <= 1 and segt.find(l, r) <= 2 and segt.find(r, max_n) <= 1:\r\n ans.append(i)\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "from collections import defaultdict\nn = int(input())\nmeetings = []\nfor i in range(n):\n temp = input().split()\n meetings.append((int(temp[0]),int(temp[1]),i))\nm = defaultdict(int)\nmeetings.sort()\nconflict_count = 0\nfor i in range(n):\n if meetings[i][2] not in m:\n m[meetings[i][2]] = 0\n for j in range(i+1, n):\n if meetings[j][0] < meetings[i][1]:\n conflict_count += 1\n m[meetings[i][2]] += 1\n m[meetings[j][2]] += 1\n else:\n break\nres = \"\"\nres_count = 0\nfor i in range(n):\n if m[i] == conflict_count:\n res_count += 1\n res = res + str(i + 1) + \" \"\nprint(res_count)\nprint(res)\n \t \t \t\t \t\t\t \t\t \t \t", "n = int(input())\r\nc=0\r\nl=[]\r\nfor i in range(1,n+1):\r\n a , b = map(int,input().split())\r\n l.append([a,b,i])\r\nl.sort()\r\n#print(l)\r\nright=0\r\nans=[]\r\nfor i in range(1,n+1):\r\n k=1\r\n right=0\r\n for j in range(n):\r\n if i==l[j][2]:\r\n continue\r\n if l[j][0]< right:\r\n k=0\r\n break\r\n right=l[j][1]\r\n if k:\r\n ans.append(i)\r\nprint(len(ans)) \r\nprint(*ans)\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nm = pow(10, 6) + 5\r\nx = [0] * m\r\nlr = []\r\nfor _ in range(n):\r\n l, r = map(int, input().split())\r\n x[l] += 1\r\n x[r] -= 1\r\n lr.append((l, r))\r\nma = 0\r\nfor i in range(1, m):\r\n x[i] += x[i - 1]\r\n ma = max(ma, x[i])\r\nif ma == 1:\r\n k = n\r\n ans = [i for i in range(1, n + 1)]\r\nelif ma == 2:\r\n for i in range(m):\r\n if x[i] == 2:\r\n l = i\r\n break\r\n for i in range(m - 1, -1, -1):\r\n if x[i] == 2:\r\n r = i + 1\r\n break\r\n ans = []\r\n for i in range(n):\r\n li, ri = lr[i]\r\n if li <= l < r <= ri:\r\n ans.append(i + 1)\r\n k = len(ans)\r\nelse:\r\n k = 0\r\nprint(k)\r\nif not k:\r\n exit()\r\nprint(\" \".join(map(str, ans)))", "\"\"\"\nCP 2.B - Schedule\nAllan Lago\nVjudge Username: alago1\n\"\"\"\n\nn = int(input().strip())\nlessons = []\nkeypoints = []\nfor i in range(n):\n s, e = tuple(int(x) for x in input().strip().split())\n lessons.append((s, e))\n keypoints.append((s, 1))\n keypoints.append((e, -1))\n\nkeypoints.sort()\nk, start, end = (0,)*3\n\nfor t, dk in keypoints:\n k += dk\n \n if k > 2:\n print('0')\n exit(0)\n\n if k == 2:\n start = t if not start else start\n end = t\n\nout = []\nfor i, lesson in enumerate(lessons):\n ls, le = lesson\n if not start or start >= ls and end < le:\n out.append(i+1)\n\nprint(len(out))\nprint(*out)\n\t \t \t \t\t \t \t\t\t \t \t \t \t \t \t\t", "arr = []\r\nfor i in range(int(input())):\r\n a,b = map(int,input().split())\r\n arr.append([a,b,i+1])\r\nn = len(arr) \r\narr.sort(key = lambda x : x[1])\r\nf = True\r\ncurr = arr[0]\r\nans = []\r\na = 0\r\nfor i in range(1,n):\r\n if curr[1]>arr[i][0]:\r\n if not f:\r\n a = 1\r\n break\r\n ans.append(arr[i][2])\r\n if (i+1<n and arr[i][1]>arr[i+1][0]) or (i-2>=0 and arr[i-2][1]>arr[i][0]):\r\n pass\r\n else:\r\n curr = arr[i]\r\n ans.append(arr[i-1][2])\r\n f = False\r\n \r\n else: \r\n curr = arr[i]\r\n \r\nif a==1:\r\n print(0)\r\n \r\nelif f:\r\n print(n)\r\n print(*[x for x in range(1,n+1)])\r\nelse:\r\n print(len(ans))\r\n ans.sort()\r\n print(*ans)\r\n \r\n ", "import sys\r\ndef input() : return sys.stdin.readline().strip()\r\ndef getints() : return map(int,sys.stdin.readline().strip().split())\r\n\r\nans = []\r\nn = int(input())\r\nl = [0]*n\r\nfor x in range(n):\r\n l[x] = [*getints(),x+1]\r\nl.sort()\r\nfor x in range(n):\r\n t = 0\r\n for y in range(n):\r\n if y == x: continue\r\n if l[y][0] < t: break\r\n t = l[y][1]\r\n else: ans.append(l[x][2])\r\nprint(len(ans))\r\nif ans: print(*sorted(ans))", "n = int(input().strip())\nlessons = []\nkeypoints = []\nfor i in range(n):\n s, e = tuple(int(x) for x in input().strip().split())\n lessons.append((s, e))\n keypoints.append((s, 1))\n keypoints.append((e, -1))\n\nkeypoints.sort()\nk, start, end = (0,)*3\n\nfor t, dk in keypoints:\n k += dk\n \n if k > 2:\n print('0')\n exit(0)\n\n if k == 2:\n start = t if not start else start\n end = t\n\nout = []\nfor i, less in enumerate(lessons):\n if not start or start >= less[0] and end < less[1]:\n out.append(i+1)\n\nprint(len(out))\nprint(*out)\n\t \t \t\t\t\t\t \t\t \t \t \t\t \t\t" ]

[ "# [https://codeforces.com/contest/681/submission/37694242 <- https://codeforces.com/contest/681/status/D <- https://codeforces.com/contest/681 <- https://codeforces.com/blog/entry/45425 <- https://codeforces.com/problemset/problem/681/D <- https://algoprog.ru/material/pc681pD]\r\n\r\n(n, m) = map(int, input().split())\r\nadj = [[] for _ in range(n)]\r\ncp = [-1] * n\r\n\r\nfor i in range(m):\r\n p, c = map(int, input().split())\r\n adj[p - 1].append(c - 1)\r\n cp[c - 1] = p - 1\r\n\r\npres = [i - 1 for i in map(int, input().split())]\r\n\r\nlevel = [0] * n\r\nfrom collections import deque\r\ndef bfs(v):\r\n q = deque([v])\r\n while q:\r\n v = q.pop()\r\n if cp[v] >= 0:\r\n level[v] = level[cp[v]] + 1\r\n for nv in adj[v]:\r\n q.append(nv)\r\n\r\nfor i in range(n):\r\n if cp[i] == -1:\r\n bfs(i)\r\n\r\nfor i in range(n):\r\n if level[i] > 0:\r\n par = cp[i]\r\n if pres[i] != pres[par] and level[pres[i]] <= level[par]:\r\n print(-1)\r\n exit()\r\n\r\npres = list(set(pres))\r\npres = sorted(pres, key = lambda i : level[i], reverse = True)\r\n\r\nprint(len(pres))\r\npres = [i + 1 for i in pres]\r\nprint(\"\\n\".join(map(str, pres)))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef make_graph(n, m):\r\n x, s = [0] * (2 * m), [0] * (n + 3)\r\n for i in range(0, 2 * m, 2):\r\n u, v = map(int, input().split())\r\n s[u + 2] += 1\r\n x[i], x[i + 1] = u, v\r\n for i in range(3, n + 3):\r\n s[i] += s[i - 1]\r\n G = [0] * m\r\n for i in range(0, 2 * m, 2):\r\n j = x[i] + 1\r\n G[s[j]] = x[i ^ 1]\r\n s[j] += 1\r\n return G, s\r\n\r\ndef bfs(s):\r\n q, k = [s], 0\r\n dist[s] = 0\r\n while len(q) ^ k:\r\n i = q[k]\r\n di = dist[i]\r\n for v in range(s0[i], s0[i + 1]):\r\n j = G[v]\r\n dist[j] = di + 1\r\n q.append(j)\r\n k += 1\r\n return q\r\n\r\nn, m = map(int, input().split())\r\nG, s0 = make_graph(n, m)\r\nx = [0] * (n + 1)\r\nfor i in G:\r\n x[i] = 1\r\ninf = pow(10, 9) + 1\r\ndist = [inf] * (n + 1)\r\nu = []\r\nfor i in range(1, n + 1):\r\n if x[i]:\r\n continue\r\n u0 = bfs(i)\r\n for j in u0:\r\n u.append(j)\r\na = [0] + list(map(int, input().split()))\r\nb = [0] * (n + 1)\r\nfor i in a[1:]:\r\n b[i] = 1\r\nok = 1\r\nfor s in range(1, n + 1):\r\n if not b[s]:\r\n continue\r\n q, k = [s], 0\r\n while len(q) ^ k:\r\n i = q[k]\r\n for v in range(s0[i], s0[i + 1]):\r\n j = G[v]\r\n if not b[j]:\r\n q.append(j)\r\n k += 1\r\n for i in q:\r\n if a[i] ^ s:\r\n ok = 0\r\n break\r\nk = -1 if not ok else sum(b)\r\nprint(k)\r\nif k == -1:\r\n exit()\r\nans = []\r\nfor i in u[::-1]:\r\n if b[i]:\r\n ans.append(i)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "t1,t2,x1,x2,t0=map(int,input().split())\r\ny1,y2,a1,a2,m=x1,x2,0,0,10000000\r\nwhile True:\r\n t=(t1*y1+t2*y2)/(y1+y2)\r\n if t>=t0:\r\n if t-t0<m:a1,a2,m=y1,y2,t-t0\r\n if y1==0 or y2==0 or t==t0:break\r\n if t>t0:\r\n y2-=1\r\n else:\r\n y1-=1\r\nprint(a1,a2)\r\n", "from fractions import Fraction\r\n\r\n\r\ndef main():\r\n t1, t2, x1, x2, t0 = map(int, input().split())\r\n if t1 == t2:\r\n print(x1, x2)\r\n elif t1 == t0:\r\n print(x1, 0)\r\n elif t0 == t2:\r\n print(0, x2)\r\n else:\r\n res = Fraction(10 ** 18, 1)\r\n res_y1 = 0\r\n res_y2 = 0\r\n for y1 in range(x1 + 1):\r\n y2 = max(((t0 - t1) * y1 + t2 - t0 - 1) // (t2 - t0), 1 if y1 == 0 else 0)\r\n if y2 > x2:\r\n continue\r\n if y1 == 0:\r\n y2 = x2\r\n cur = Fraction(t1 * y1 + t2 * y2, y1 + y2)\r\n if cur <= res:\r\n res = cur\r\n res_y1 = y1\r\n res_y2 = y2\r\n print(res_y1, res_y2)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "t1, t2, x1, x2, t0 = map(int, input().split())\r\n\r\nts = t0 - t1\r\nte = t2 - t0\r\n\r\nif ts == 0 and te == 0:\r\n rs, re = x1, x2\r\nelif ts == 0:\r\n rs = x1\r\n re = 0\r\nelif te == 0:\r\n rs = 0\r\n re = x2\r\nelse:\r\n a = te\r\n b = 1\r\n rs = 0\r\n re = x2\r\n\r\n for i in range(1, x1 + 1):\r\n j = (ts * i + te - 1) // te\r\n if j > x2:\r\n break\r\n\r\n c = j * te - i * ts\r\n d = i + j\r\n\r\n if a * d > c * b or (a * d == c * b and i + j > rs + re):\r\n a = c\r\n b = d\r\n rs = i\r\n re = j\r\nprint(rs, re)", "def main():\r\n t1, t2, x1, x2, t0 = map(int, input().split())\r\n\r\n t1 = t0 - t1\r\n t2 = t2 - t0\r\n y1 = y2 = 0\r\n\r\n if t1 == 0 and t2 == 0:\r\n y1, y2 = x1, x2\r\n elif t1 == 0:\r\n y1 = x1\r\n elif t2 == 0:\r\n y2 = x2\r\n else:\r\n a = t2\r\n b = 1\r\n y1 = 0\r\n y2 = x2\r\n\r\n for i in range(1, x1 + 1):\r\n j = (t1 * i + t2 - 1) // t2\r\n if j > x2:\r\n break\r\n\r\n c = j * t2 - i * t1\r\n d = i + j\r\n\r\n if a * d > c * b or (a * d == c * b and i + j > y1 + y2):\r\n a = c\r\n b = d\r\n y1 = i\r\n y2 = j\r\n\r\n print(y1, y2)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "vowels = ['a','e','i','o','u','y']\r\nN = int(input())\r\nP = list(map(int, input().split()))\r\nans = True\r\nfor n in range(N):\r\n\ts = input()\r\n\tvc = len(list(True for c in s if c in vowels))\r\n\tif vc != P[n]:\r\n\t\tans = False\r\nprint(\"YES\" if ans else \"NO\")", "n = int(input())\nno = list(map(int,input().split()))\nnum = [0 for i in range(n)]\nfor i in range(n):\n\tx = input()\n\tfor a in x:\n\t\tif a == 'a' or a == 'e' or a == 'i' or a == 'o' or a == 'u' or a == 'y':\n\t\t\tnum[i]+=1\nif no == num:\n\tprint(\"YES\")\nelse :\n\tprint(\"NO\")", "n = int(input())\r\np = [int(x) for x in input().split()]\r\nlines = []\r\nfor i in range(n):\r\n lines.append(input())\r\n\r\nfor i in range(n):\r\n total = 0\r\n for letter in lines[i]:\r\n if letter in 'aeiouy':\r\n total += 1\r\n \r\n if total != p[i]:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\n\ndef verse_pattern(n: int, s: str) -> bool:\n count = 0\n for i in range(6):\n count += s.count(vowels[i])\n \n return n == count\n\n# Inputs\n\nresult = True\nn = int(input())\np = list(map(lambda i: int(i), input().split()))\nfor i in range(n):\n text = input()\n if (not verse_pattern(p[i], text)):\n result = False\n\nif result:\n print ('YES')\nelse:\n print('NO')\n \t\t\t \t \t \t \t\t\t\t \t\t\t \t", "vowels = 'aeiouy'\n\nn = int(input())\nis_good = True\n\nneed = list(map(int, input().split()))\n\nfor i in range(n):\n s = input()\n cur = 0\n for v in vowels:\n cur += s.count(v)\n is_good &= need[i] == cur\n\n\nprint('YES' if is_good else 'NO')\n", "v = \"aeiouy\"\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nd = [sum(map(lambda x: x in v, input())) for i in range(n)]\r\nif d == p:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")\r\n \r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nw = set()\r\nfor i in list(\"aeiouy\"):\r\n w.add(ord(i))\r\nans = \"YES\"\r\nfor i in p:\r\n s = list(input().rstrip())\r\n cnt = 0\r\n for j in s:\r\n if j in w:\r\n cnt += 1\r\n if i ^ cnt:\r\n ans = \"NO\"\r\nprint(ans)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nfor j in range(n):\r\n s=input()\r\n v=0\r\n for i in range(len(s)):\r\n if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u' or s[i]=='y':\r\n v+=1\r\n if v!=a[j]:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "vowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\nn = int(input())\r\nstring = input()\r\nnumbers = list(map(int, string.split()))\r\nresults = \"YES\"\r\nfor x in range(n):\r\n string = input()\r\n if results == \"YES\":\r\n words = string.split()\r\n a = 0\r\n for y in words:\r\n for z in vowels:\r\n a += y.count(z)\r\n if a != numbers[x]:\r\n results = \"NO\"\r\nprint(results)", "a = int(input())\n\np = input().split()\n\nmatch = True\n\nfor i in range(a):\n s = input()\n cnt = s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')+s.count('y')\n if cnt != int(p[i]):\n match = False\n\nif match:\n print('YES')\nelse:\n print('NO')\n \t \t \t \t \t \t\t\t \t\t \t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nvw=['a','e','i','o','u','y']\r\nfor i in range(n):\r\n s=str(input())\r\n p=0\r\n for j in range(len(s)):\r\n if s[j] in vw:\r\n p+=1\r\n if p!=l[i]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "e=input\r\nv,a,b,_='aeiouy',0,0,e()\r\nfor p in map(int,e().split()):\r\n a+=p\r\n b+=sum(map(e().count, v))\r\n if a!=b:break\r\nprint('YNEOS'[a!=b::2])", "N = int(input())\r\nX = list(map(int, input().split()))\r\nfor i in range(N):\r\n Temp = input()\r\n Count = len([i for i in Temp if i in 'aeiouy'])\r\n if Count != X[i]:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n# Show you deserve being the best to whom doesn't believe in you.\r\n# Location: At home in Mashhad\r\n", "n=int(input())\r\np=input().split(' ')\r\nl=['a','e','i','o','u','y']\r\nf=1;\r\nfor i in range(n):\r\n s=input().split(' ')\r\n qwe=int(p[i])\r\n cnt=0\r\n words=0\r\n tmp=0;\r\n for j in s:\r\n tmp=0\r\n for k in j:\r\n if k in l:\r\n cnt=cnt+1\r\n if cnt!=qwe:\r\n f=0\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\ninput()\nfor n in map(int,input().split()):\n\tfor z in input():n-=z in'aeiouy'\n\tif n:\n\t\tprint('NO')\n\t\tbreak\nelse:print('YES')\n", "S = {'a', 'e', 'i', 'o', 'u', 'y'}\r\n\r\nn = int(input())\r\nP = list(map(int, input().split()))\r\nfor i in range(n):\r\n s = str(input())\r\n cnt = 0\r\n for c in s:\r\n if c in S:\r\n cnt += 1\r\n if cnt != P[i]:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "if __name__ == '__main__':\n num = int(input())\n\n vowels = input()\n vowels = vowels.split()\n vowels = list(map(int, vowels))\n\n ans = \"YES\"\n\n for i in range(num):\n result = 0\n test = input()\n result += test.count('a')\n result += test.count('e')\n result += test.count('i')\n result += test.count('o')\n result += test.count('u')\n result += test.count('y')\n\n if result != vowels[i]:\n ans = \"NO\"\n\n print(ans)\n\n \t\t\t\t\t \t\t\t\t \t\t\t\t\t\t \t \t\t\t", "class CodeforcesTask722BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.pattern = []\n self.text = []\n\n def read_input(self):\n self.n = int(input())\n self.pattern = [int(x) for x in input().split(\" \")]\n for x in range(self.n):\n self.text.append(input())\n\n def process_task(self):\n vowels = \"aeiouy\"\n matching = True\n for x in range(self.n):\n syl = 0\n for c in self.text[x]:\n if c in vowels:\n syl += 1\n if syl != self.pattern[x]:\n matching = False\n break\n self.result = \"YES\" if matching else \"NO\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask722BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from collections import Counter\r\n\r\nn = int(input())\r\np = list(input().split())\r\nt = [input() for i in range(n)]\r\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\n\r\n\r\ndef shakespeare(t, p):\r\n for phrase, verse in zip(t, p):\r\n c = len([l for l in Counter(phrase).elements() if l in vowels])\r\n if c != int(verse):\r\n return 'NO'\r\n return 'YES'\r\n\r\nprint(shakespeare(t, p))", "def main():\r\n vowels = {'a', 'e', 'i', 'o', 'u', 'y'}\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n for i in range(n):\r\n s = list(input().split())\r\n cur = 0\r\n for k in s:\r\n for j in k:\r\n if j in vowels:\r\n cur += 1\r\n #print(cur)\r\n if cur != a[i]:\r\n print('NO')\r\n return\r\n print('YES')\r\n return\r\n\r\nif __name__==\"__main__\":\r\n main()", "from functools import reduce\r\n\r\nn = int(input())\r\nts = [int(x) for x in input().split(' ')]\r\n\r\nf = True\r\n\r\nfor t in ts:\r\n l = input()\r\n c = 0\r\n for w in l.split(' '):\r\n c += reduce(lambda t, l: t + w.count(l), ['a', 'o', 'e', 'i', 'u', 'y'], 0)\r\n if c != t:\r\n f = False\r\n\r\nprint('YES' if f else 'NO')", "n = int(input())\r\np = list(map(int, input().split()))\r\nglasn = 'aeiouy'\r\ncnt = 0\r\nfor i in range(n):\r\n cnt = 0\r\n string = input()\r\n for j in string:\r\n if j in glasn:\r\n cnt += 1\r\n if p[i] != cnt:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\n\n\ndef check_syllables(i, text):\n arr = text.split()\n syllable = 0\n for word in arr:\n for char in word:\n for vowel in vowels:\n if vowel == char:\n syllable += 1\n if i == syllable:\n return True\n else:\n return False\n\n\nn = int(input())\nnums = list(map(int, input().split()))\nlines = []\nfor i in range(0, n):\n result = check_syllables(nums[i], input())\n if result == False:\n print(\"NO\")\n break\n if i == n-1:\n print(\"YES\")\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nv = ['a', 'e', 'i', 'o', 'u', 'y']\r\n\r\nfor i in range(n):\r\n s = input()\r\n cnt = sum([s.count(i) for i in v])\r\n if cnt != l[i]:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n = int(input())\r\na = list(map(int, input().split()))\r\ng = \"aeiouy\"\r\nb = []\r\nfor i in range(n):\r\n s = input()\r\n l = 0\r\n for j in s:\r\n if j in g:\r\n l += 1\r\n b.append(l)\r\nprint(\"YES\" if a == b else \"NO\")\r\n", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sat Oct 1 10:21:19 2016\n\n@author: Felicia\n\"\"\"\n\nn=int(input())\nl=list(map(lambda x:int(x),input().split()))\nflag=True\nfor i in range(n):\n temp=input()\n if temp.count('a')+temp.count('e')+temp.count('i')+temp.count('o')+temp.count('u')+temp.count('y')!=l[i]:\n flag=False\n break\n\nif flag:\n print('YES')\nelse:\n print('NO')", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = {'a', 'e', 'o', 'u', 'i', 'y'}\r\nfl = 1\r\nfor i in range(n):\r\n s = input()\r\n k = 0\r\n for j in s:\r\n if j in b:\r\n k += 1\r\n if k != a[i]:\r\n fl = 0\r\n break\r\nif fl:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "def ct(word):\r\n ctt = 0\r\n for i in word:\r\n if i in 'aeiouy':\r\n ctt+=1\r\n return ctt\r\n\r\nx = int(input())\r\nl = list(map(int, input().split(' ')))\r\nfor i in range(x):\r\n drunk = list(map(str, input().split(' ')))\r\n tot = 0\r\n for j in drunk:\r\n tot += ct(j)\r\n if tot != l[i]:\r\n print(\"NO\")\r\n quit()\r\n\r\nprint(\"YES\")\r\n", "n = int(input())\np = list(map(int, input().split(\" \")))\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\n\ndef containsAny(str, arr):\n return 1 in [c in str for c in arr]\n\ngood = True\nfor i in range(n):\n line = str(input())\n v = 0\n words = line.split(\" \")\n final = []\n for word in words: \n if containsAny(word, vowels):\n final.append(word)\n \n l = \"\"\n l.join(final)\n \n for char in line:\n if char in vowels: v += 1\n \n if v != p[i]: good = False\n \nprint(\"YES\" if good else \"NO\")", "n = int(input().strip())\r\np = [int(a) for a in input().strip().split()]\r\nv = set(\"aeiouy\")\r\nfor i in range(n):\r\n s = input().strip()\r\n count = 0\r\n for c in s:\r\n if c in v:\r\n count+=1\r\n if count!=p[i]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\na = map(int, input().split())\r\nfor w in a:\r\n\ts = input()\r\n\tif w != sum(s.count(c) for c in \"aeiouy\"):\r\n\t\tprint(\"NO\")\r\n\t\texit(0)\r\nprint(\"YES\")", "n = int(input())\r\np = list(map(int, input().split()))\r\narr = []\r\nfor i in range(n):\r\n s = input()\r\n c = 0\r\n for l in s:\r\n if l == 'a' or l == 'e' or l == 'i' or l == 'o' or l == 'u' or l == 'y':\r\n c += 1\r\n arr.append(c)\r\n\r\nif arr == p:\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\ns = list(map(int, input().split()))\r\nv = 'aouiey'\r\nres = 'YES'\r\nfor i in range(n):\r\n t = input()\r\n cnt = 0\r\n for j in t:\r\n if j in v: cnt += 1\r\n if cnt != s[i]: res = \"NO\"\r\nprint(res)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nv = ['a','e','i','o','u','y']\r\nflag = 0\r\nfor i in range(n):\r\n s = input()\r\n if flag:\r\n continue\r\n count= 0\r\n for item in v:\r\n count += s.count(item)\r\n if count != arr[i]:\r\n flag = 1\r\n continue\r\nif flag:\r\n print('NO')\r\nelse:\r\n print('YES') \r\n", "n = int(input())\r\np = list(map(int, input().split(' ')))\r\ncan = True\r\nvowels = {'a', 'e', 'y', 'i', 'o', 'u'}\r\nfor i in range(n):\r\n s = input()\r\n vow = 0\r\n for ch in s:\r\n if ch in vowels:\r\n vow += 1\r\n if vow != p[i]:\r\n can = False\r\n\r\nif can:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "vowels = 'aeiouy'\nn = int(input())\np = [int(x) for x in input().split()]\nfor i in range(n):\n s = input()\n vowelsCnt = 0\n for c in s:\n if c in vowels:\n vowelsCnt += 1\n if vowelsCnt != p[i]:\n print('NO')\n break\nelse:\n print('YES')\n", "#!/usr/bin/env python3\r\n\r\nfrom collections import Counter\r\n\r\na = set('aeiouy')\r\ndef cnt(s):\r\n return sum(x[1] for x in filter(lambda y: y[0] in a, Counter(s).items()))\r\n\r\nn = int(input())\r\nb = [int(x) for x in input().split()]\r\nc = [sum(cnt(s) for s in input().split()) for i in range(n)]\r\n\r\nif b == c:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nd={'a':0,'e':0,'i':0,'o':0,'u':0,'y':0}\r\nresult='YES'\r\nfor i in range(n):\r\n res=0\r\n for j,x in enumerate(input()):\r\n if d.get(x)!=None:res+=1\r\n if res!=lst[i]:result='NO';break\r\nprint(result)", "n = int(input())\r\np=list(map(int,input().split()))\r\nf=0\r\nfor i in range(n):\r\n\ts=input()\r\n\tif s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')+s.count('y')==p[i]:\r\n\t\tf+=1\r\nif f==n:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "__author__ = 'Azad'\r\n\r\nn = int(input())\r\nl = [int(x) for x in input().split()]\r\nu = []\r\n\r\nvow = ['a', 'e', 'i', 'o', 'u', 'y']\r\n\r\nfor x in range(n):\r\n\r\n p = input().split()\r\n\r\n x = sum([word.count(x) for word in p for x in vow])\r\n u.append(x)\r\n\r\n\r\nif all([a ==b for (a, b) in zip(u,l)]):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "ans = 0\r\nlength = int(input())\r\nslog = [int(i) for i in input().split()]\r\nfor i in range(length):\r\n\trow = input()\r\n\tcount = 0\r\n\tfor j in range(len(row)):\r\n\t\tif (row[j] == 'a') or (row[j] == 'e') or (row[j] == 'i') or (row[j] == 'o') or (row[j] == 'u') or (row[j] == 'y'):\r\n\t\t\tcount += 1\r\n\tif count != slog[i]:\r\n\t\tans = i+1\r\n\t\tbreak\r\nif ans == 0:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def verse_pattern():\r\n\r\n\tno_lines = int(input())\r\n\tverses = [int(x) for x in input().strip().split(' ')]\r\n\tcount = 0\r\n\tvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\n\r\n\twhile count < no_lines:\r\n\r\n\t\tline = input()\r\n\t\tsyllabes = sum(line.count(x) for x in vowels)\r\n\t\tif syllabes != verses[count]:\r\n\t\t\treturn('NO')\r\n\t\tcount += 1\r\n\r\n\treturn('YES')\r\n\r\nprint(verse_pattern())", "# Nome: Matheus de Souza Oliveira - RA: 203407\n\nnumberOfTestCases = int(input())\ncases = list(map(int, input().split()))\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\nisTestsWrong = False\n\ntestCase = 0\nwhile testCase != numberOfTestCases:\n\n tests = input().split()\n versePattern = 0\n\n for test in tests:\n for character in test:\n if character in vowels:\n versePattern += 1\n if versePattern != cases[testCase]:\n isTestsWrong = True\n break\n\n testCase += 1\n\nif isTestsWrong:\n print(\"NO\")\n \nelse:\n print(\"YES\")\n\n\t\t\t \t \t \t \t \t\t \t\t\t \t\t\t \t\t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\nf = True\r\nk = 'aeiouy'\r\nfor i in range(n):\r\n s = input()\r\n sum = 0\r\n for j in range(len(s)):\r\n if s[j] in k:\r\n sum += 1\r\n if sum != a[i]:\r\n f = False\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\na=map(int,input().split(\" \"))\na = list(a)\nok=1\nfor i in range(0,n):\n sum=0\n s=input()\n if ok==0:\n continue\n for j in range(0,len(s)):\n if s[j]=='u' or s[j]=='a' or s[j]=='i'or s[j]=='e' or s[j]=='o' or s[j]=='y':\n sum+=1\n\n if sum != a[i]:\n ok=0\nif ok==1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import re\r\n\r\n\r\nn = int(input())\r\nnumbers_of_vowels = list(map(int, input().split()))\r\npoem = [input() for _ in range(n)]\r\nisRight = True\r\nfor i in range(n):\r\n res = re.findall('[aeiouy]', poem[i])\r\n if len(res) != numbers_of_vowels[i]:\r\n isRight = False\r\n break\r\nif isRight:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nck = list(map(int,input().split(\" \")))\nworks = True\nfor i in range(n):\n a = input().split(\" \")\n cnt = 0\n for j in range(len(a)):\n for k in range(len(a[j])):\n if a[j][k] == 'a' or a[j][k] == 'e' or a[j][k] == 'i' or a[j][k] == 'o' or a[j][k] == 'u' or a[j][k] == 'y':\n cnt += 1\n if cnt != ck[i]:\n works = False\n break\nif works:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n", "#!/usr/bin/env python3\r\n\r\nimport re\r\n\r\n\r\ndef main():\r\n try:\r\n while True:\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n result = \"YES\"\r\n for x in p:\r\n if len(re.findall(r\"[aeiouy]\", input())) != x:\r\n result = \"NO\"\r\n print(result)\r\n\r\n except EOFError:\r\n pass\r\n\r\n\r\nmain()\r\n", "\r\n\r\nn = int(input())\r\n\r\n\r\nt = list(map(int,input().split()))\r\nx = 'aeiouy'\r\nr=0\r\nfor j in range(n):\r\n\r\n f = input()\r\n p=0\r\n for i in f:\r\n if i in x:\r\n p+=1\r\n #print(p,j)\r\n if p== t[j]:\r\n r+=1\r\n\r\n#print(r)\r\nif r==n:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import re\n\nn = int(input())\np = [int(x) for x in input().split()]\nres = []\nfor i in range(n):\n res.append(len(re.findall('[aeiouy]', input())))\nif p == res:\n print('YES')\nelse:\n print('NO')\n", "from sys import *\r\n\r\nn=int(input())\r\np=[int(z) for z in input().split()]\r\nglas=set([ \"a\", \"e\", \"i\", \"o\", \"u\", \"y\"])\r\nfor i in range(n):\r\n s=input()\r\n nogl=0\r\n for j in s:\r\n if j in glas:\r\n nogl+=1\r\n if nogl!=p[i]:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "n = int(input())\nl = list(map(int, input().split()))\n\nv = ['a', 'e', 'i', 'o', 'u', 'y']\nresp = True\n\nfor i in range(n):\n\ttotal = 0\n\tps = input().split()\n\tfor p in ps:\n\t\tfor j in range(len(p)):\n\t\t\tif p[j] in v:\n\t\t\t\ttotal += 1\n\tif total != l[i]:\n\t\tresp = False\n\nif resp:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t \t\t\t \t\t \t \t\t \t \t\t \t \t\t\t \t", "'''import sys\r\nsys.stdin=open(\"input.txt\",\"r\")\r\nsys.stdout=open(\"output.txt\",\"w\")'''\r\n\r\nn=int(input())\r\np=[int(i) for i in input().split()]\r\nflag=True\r\nfor i in range(n):\r\n s=input()\r\n if (s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')+s.count('y'))!=p[i] and flag:\r\n flag=False\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nn=int(input())\r\na=list(map(int, input().split()))\r\nans=True\r\nfor s in sys.stdin:\r\n cnt=0\r\n for c in 'aeiouy':\r\n cnt+=s.count(c)\r\n ans&=cnt==a.pop(0)\r\nprint('YES' if ans else 'NO')", "import re\r\n\r\ndef solve():\r\n N = int(input())\r\n P = list(map(int, input().split()))\r\n\r\n for i in range(N):\r\n ws = input().split()\r\n xs = 0\r\n for w in ws:\r\n ys = re.split('[aeiouy]', w)\r\n xs += len(ys) - 1\r\n if xs != P[i]:\r\n print('NO')\r\n return\r\n print('YES')\r\n\r\nsolve()\r\n", "n = int(input())\r\np = [int(i) for i in input().split()]\r\na = set([i for i in 'aeiouy'])\r\nd = 'YES'\r\nfor i in range(n):\r\n s = input()\r\n k = 0\r\n for j in s:\r\n if j in a: k+=1\r\n if k!=p[i]: d = 'NO'\r\nprint(d)\r\n", "def versePattern(phrase: list, i: int, p: list) -> None:\n\n count = int(p[i])\n vowel = ['a', 'e', 'i', 'o', 'u', 'y']\n idx = 0\n is_vowel = 0\n n = len(phrase)\n\n while (idx < n):\n if (phrase[idx] in vowel):\n count -= 1\n elif (phrase[idx] not in vowel):\n idx += 1\n while (idx < n):\n if (phrase[idx] in vowel): \n is_vowel = 1\n break\n idx += 1\n if (is_vowel == 1):\n count -= 1\n is_vowel = 0\n idx += 1\n\n p[i] = count\n\ndef main():\n n = int(input())\n p = input().split(\" \")\n for i in range (n):\n versePattern(input(), i, p)\n \n for p in p:\n if p != 0:\n print(\"NO\")\n return\n print(\"YES\")\n\nif __name__ == '__main__':\n main()\n\t\t \t\t \t \t \t \t\t\t\t \t \t \t", "n = int(input())\r\n\r\np = list(map(int, input().split(' ')))\r\nfor i in range(n):\r\n w = input().split(' ')\r\n cnt = 0\r\n for s in w:\r\n for x in s:\r\n if x == 'a' or x == 'e' or x == 'i' or x == 'o' or x == 'u' or x == 'y':\r\n cnt += 1\r\n if cnt != p[i]:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "linesNum=int(input())\r\ncorrect=input()\r\ncorrect=correct.split()\r\nlines=[]\r\ntest=[]\r\nresult = 0\r\nfor i in range(linesNum):\r\n correct[i]=int(correct[i])\r\n lines.append(input())\r\n test.append(0)\r\n for j in lines[i]:\r\n if j in \"aeiouy\":\r\n test[i]+=1\r\nfor i in range(linesNum):\r\n if correct[i]==test[i]:\r\n result+=1\r\nif result==linesNum:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "n = int(input())\nps = [int(a) for a in input().split()]\n\ndef count_vowels(str):\n count = 0\n for ch in str:\n if ch == 'a' or ch == 'e' or ch == 'i' or ch == 'o' or ch =='u' or ch == 'y':\n count += 1\n return count\n\nans = 1\nfor i in range(n):\n line = input()\n count = count_vowels(line)\n if count != ps[i]:\n ans = 0\n break\n\nif ans == 1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n=int(input())\r\nverse=list(map(int,input().split()))\r\ntext=[None]*n\r\nfor i in range(n):\r\n\ttext[i]=input()\r\n\r\nvowels=\"aeiouy\"\r\nfor i in range(n):\r\n\tcount=0\r\n\tfor j in text[i]:\r\n\t\tif j in vowels:\r\n\t\t\tcount+=1\r\n\tif count!=verse[i]:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "n=int(input())\r\np=list(map(int,input().split()))\r\nfor i in range(n):\r\n s=input()\r\n res=0\r\n res+=s.count('a')\r\n res+=s.count('e')\r\n res+=s.count('i')\r\n res+=s.count('o')\r\n res+=s.count('u')\r\n res+=s.count('y')\r\n if(res!=p[i]):\r\n print('NO')\r\n exit()\r\nprint(\"YES\")\r\n\r\n\r\n\r\n", "def main():\n n = int(input())\n entrada = input().split(\" \")\n p = []\n flag = 1\n\n for i in range(0,n):\n p.append(int(entrada[i]))\n \n for j in range(0, n):\n verse = input()\n vogais = 0\n\n for i in range(0, len(verse)):\n if(verse[i] == 'a' or verse[i] == 'e' or verse[i] == 'i' or verse[i] == 'o' or verse[i] == 'u' or verse[i] == 'y'):\n vogais += 1\n \n if(vogais != p[j]):\n flag = 0\n \n if(flag == 1):\n print(\"YES\")\n else:\n print(\"NO\")\n\nif __name__ == '__main__':\n main()\n \t\t\t \t \t \t\t\t\t\t\t \t \t", "q=int(input(''))\r\nw=input('')\r\ne=w.split()\r\nu=0\r\ns=0\r\nfor r in range (q):\r\n i=e[u]\r\n t=input('')\r\n y=t.count('a')\r\n y=y+t.count('e')\r\n y=y+t.count('i')\r\n y=y+t.count('y')\r\n y=y+t.count('u')\r\n y=y+t.count('o')\r\n i=int(i)\r\n if i==y:\r\n s=s+1\r\n u=u+1\r\nif s==q:\r\n print ('YES')\r\nelse:\r\n print ('NO')\r\n", "n = int(input())\r\npattern = list(map(int, input().split()))\r\ndata = []\r\nfor i in range(n):\r\n\tdata.append(input())\r\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\ntrigger = True\r\nfor i in range(n):\r\n\tcount = 0\r\n\tfor ch in data[i]:\r\n\t\tif ch in vowels:\r\n\t\t\tcount += 1\r\n\tif count != pattern[i]:\r\n\t\ttrigger = False\r\n\t\tbreak\r\nif trigger:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "input()\r\na=list(map(int,input().split()))\r\nprint(\"YES\" if all(sum(c in \"aeiouy\" for c in input())==d for d in a) else \"NO\")\r\n", "\ndef countVowels(word):\n count = 0 \n vowels = \"aeiouy\"\n for i in word:\n if i in vowels:\n count += 1\n return count\n\nN = int(input())\npattern = [int(x) for x in input().split(' ')]\n\nfor i in range (N):\n word = input()\n if countVowels(word) != int(pattern[i]):\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n \t\t\t \t \t \t \t \t\t\t\t\t\t", "cons = {'a', 'e', 'i', 'o', 'u', 'y'}\n\ndef cnt(s):\n res = 0\n for c in s:\n if c in cons:\n res += 1\n return res\n\nn = int(input().strip())\nps = list(map(int, input().strip().split(' ')))\nok = True\nfor i in range(n):\n word = input().strip()\n if cnt(word) != ps[i]:\n ok = False \nprint('YES' if ok else 'NO')\n\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nf = 0\r\nfor i in range(n):\r\n\ts = input()\r\n\tif s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')+s.count('y') == l[i] :\r\n\t\tf = f+1\r\nif f == n:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\ntr = True\r\n\r\nfor i in range(n):\r\n ans = 0\r\n for j in input():\r\n if j in {'u', 'y', 'e', 'a', 'o', 'i'}:\r\n ans += 1\r\n if ans != p[i]:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\ngl=['a','e','i','o','u','y']\r\nfor _ in range(n):\r\n s=list(input())\r\n k=0\r\n for x in s:\r\n if x in gl: k+=1\r\n ans+=[k]\r\nif ans==l: print(\"YES\")\r\nelse: print(\"NO\")", "length = int(input())\nsyllables = list(map(int, input().split()))\nstatus = True\n\n\neng_vowels = {'a', 'e', 'i', 'o', 'u', 'y'}\n\n\ndef count_vowels(line):\n return len([x for x in line if x in eng_vowels])\n\n\nfor i in range(length):\n line = input()\n vowels = count_vowels(line)\n if vowels == syllables[i]:\n continue\n else:\n if status:\n status = False\n else:\n pass\n\nif status:\n print('YES')\nelse:\n print('NO')", "syllabes = ['a', 'e' , 'i', 'o', 'u', 'y']\r\nanswer = {True:\"YES\", False:\"NO\"}\r\n\r\nnumber = int(input())\r\n\r\nrvstring = input().split(\" \")\r\nrv = []\r\n\r\nfor x in rvstring:\r\n\trv.append(int(x))\r\n\r\npossible = True\r\n\r\nfor x in range(0,number):\r\n\tst = input()\r\n\ti = 0\r\n\t\r\n\tfor y in syllabes:\r\n\t\ti = i + st.count(y)\r\n\r\n\tpossible = possible and i == rv[x]\r\n\r\nprint(answer[possible])", "n=int(input())\r\nln=[None]*n\r\nls=[None]*n\r\ncs=[None]*n\r\nmatch=0\r\nln=list(map(int,input().split()))\r\nfor x in range(0,n):\r\n ls[x]=input()\r\nfor y in range(0,n):\r\n count=0\r\n for r in range(0,len(ls[y])):\r\n if(ls[y][r]=='a'or ls[y][r]=='e'or ls[y][r]=='i'or ls[y][r]=='o'or ls[y][r]=='u'or ls[y][r]=='y'):\r\n count+=1\r\n cs[y]=count\r\nfor t in range(0,n):\r\n if(ln[t]!=cs[t]):\r\n match+=1\r\nif(match==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "import re\nn = int(input())\nps = list(map(int, input().split(' ')))\nfor p in ps:\n l = input()\n if len(re.findall('[aeiouy]', l)) != p:\n print('NO')\n exit()\nprint('YES')", "n = int(input())\nk = list(map(int,input().split()))\ncheck = 'aeiouy'\nfor i in range(n):\n s = input()\n ans = 0\n for el in check:\n ans+=s.count(el)\n if ans != k[i]:\n print(\"NO\")\n exit(0)\nprint(\"YES\")", "def main():\n n = int(input())\n\n p = [int(s) for s in input().split()]\n\n vowels = {'a', 'e', 'i', 'o', 'u', 'y'}\n\n for i in range(n):\n l = input()\n numv = sum(1 for c in l if c in vowels)\n if numv != p[i]:\n print('NO')\n return\n print('YES')\n\nmain()\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nfor i in range(n):\r\n s = input()\r\n count = 0\r\n for c in s:\r\n if c in 'aeiouy':\r\n count += 1\r\n if count != p[i]:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(s):\r\n #print('s: ' + str(s))\r\n n = len(s)\r\n A = []\r\n B = []\r\n nest = False\r\n tmp = []\r\n for i in range(n):\r\n if s[i] == '(':\r\n nest = True\r\n elif s[i] == ')':\r\n nest = False\r\n elif s[i].isalpha():\r\n tmp.append(s[i])\r\n if i + 1 == n or s[i+1].isalpha() == False:\r\n if nest:\r\n A.append(''.join(tmp))\r\n else:\r\n B.append(''.join(tmp))\r\n tmp.clear()\r\n '''\r\n print('A: ' + str(A))\r\n print('b: ' + str(B))\r\n '''\r\n max_val = 0\r\n for s in B:\r\n max_val = max(max_val, len(s))\r\n return (max_val, len(A))\r\n\r\ndef main():\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 s = input()\r\n cnt = 0\r\n for c in s:\r\n if c in 'aeiouy':\r\n cnt += 1\r\n B.append(cnt)\r\n if A == B:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "__author__ = 'Alexander'\r\nimport sys\r\nn = int(sys.stdin.readline().strip())\r\n# p = map(int, sys.stdin.readline().split())\r\np = [int(x) for x in sys.stdin.readline().split()]\r\ntext = ['']*n\r\nflag = True\r\nw = ('a','e','i','o','u','y')\r\nfor i in range(n):\r\n text[i] = sys.stdin.readline().strip()\r\nfor i in range(n):\r\n count = 0\r\n for j in range(len(text[i])):\r\n if text[i][j] in w: count +=1\r\n if count != p[i]:\r\n sys.stdout.write(\"NO\")\r\n flag = False\r\n break\r\n\r\n# print(n)\r\n# print(p)\r\n# print(text)\r\nif flag: sys.stdout.write(\"YES\")", "n = int(input())\r\np = list(map(int, input().split()))\r\nans = \"YES\"\r\nfor i in range(n):\r\n s = str(input())\r\n x = sum([c in \"aeiouy\" for c in s])\r\n if x != p[i]:\r\n ans = \"NO\"\r\nprint(ans)", "\r\ndef solve():\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n for i in range(n):\r\n s = input()\r\n tot = 0\r\n tot += s.count('a')\r\n tot += s.count('e')\r\n tot += s.count('i')\r\n tot += s.count('o')\r\n tot += s.count('u')\r\n tot += s.count('y')\r\n if tot != p[i]:\r\n print('NO')\r\n return\r\n print('YES')\r\n \r\nsolve()", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nv = ['a', 'e', 'i', 'o', 'u', 'y']\r\nresp = True\r\n\r\nfor i in range(n):\r\n\ttotal = 0\r\n\tps = input().split()\r\n\tfor p in ps:\r\n\t\tfor j in range(len(p)):\r\n\t\t\tif p[j] in v:\r\n\t\t\t\ttotal += 1\r\n\tif total != l[i]:\r\n\t\tresp = False\r\n\r\nif resp:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "\r\nn=int(input())\r\np=list(map(int,input().split()))\r\nc=[]\r\na=[]\r\nd=0\r\nletters = ('a', 'e', 'i', 'o', 'u', 'y')\r\n\r\nfor x in range(n):\r\n a.append(input())\r\nfor x in range(n):\r\n for y in range(len(a[x])):\r\n if a[x][y] in letters:\r\n d+=1\r\n c.append(d)\r\n d=0\r\n \r\nif c==p:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\")\r\n\r\n", "lines = int(input())\r\n\r\npatterns = input()\r\npatterns = list(patterns.split(' '))\r\nfor i in range(len(patterns)):\r\n patterns[i] = int(patterns[i])\r\n\r\nglas = {'a', 'e', 'i', 'o', 'u', 'y'}\r\n\r\nanswer = True\r\n\r\nfor i in range(lines):\r\n line = input()\r\n glas_counter = 0\r\n for ch in line:\r\n if ch in glas:\r\n glas_counter += 1\r\n\r\n if patterns[i] != glas_counter:\r\n answer = False\r\n\r\nif answer == True:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\np=list(map(int,input().split(\" \")))\r\nv=['a', 'e', 'i', 'o', 'u' ,'y']\r\nj=0\r\nb=False\r\nfor i in range(n):\r\n #L=input().split(\" \")\r\n ch=input()\r\n s=0\r\n for x in ch:\r\n if x in v:\r\n s+=1\r\n if s!=p[j]:\r\n print(\"NO\")\r\n b=True\r\n break\r\n j+=1\r\n\r\nif not b:\r\n print(\"YES\") \r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nf = True\r\nfor i in range(n):\r\n s = input()\r\n count = 0\r\n count = s.count('e')\r\n count += s.count('y')\r\n count += s.count('u')\r\n count += s.count('i')\r\n count += s.count('o')\r\n count += s.count('a')\r\n if count != a[i]:\r\n f = False\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def vowels(line):\r\n syl = 0\r\n for i in line:\r\n if i == 'a':\r\n syl += 1\r\n elif i == 'e':\r\n syl += 1\r\n elif i == 'i':\r\n syl += 1\r\n elif i == 'o':\r\n syl += 1\r\n elif i == 'u':\r\n syl += 1\r\n elif i == 'y':\r\n syl += 1\r\n return syl\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nright = True\r\nfor i in range(n):\r\n l = input()\r\n if(vowels(l) != p[i]):\r\n right = False\r\nif(right):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "n = int(input())\r\ntest = \"aoeiuy\"\r\na = list(map(int, input().split()))\r\nflag = 1\r\nfor i in range(n):\r\n s = input()\r\n res = 0\r\n for j in s:\r\n if j in test:\r\n res += 1\r\n if a[i] != res:\r\n flag = 0\r\n break\r\nprint(\"YES\") if flag else print(\"NO\")\r\n ", "num_of_s = int(input())\r\nst_razm = input().split()\r\nst_razm = [int(i) for i in st_razm]\r\ntext = []\r\ngl = ('a','e','i','o','u','y')\r\ndef gl_in_str(st):\r\n cnt = 0\r\n for i in st:\r\n if i in gl:\r\n cnt+=1\r\n return cnt\r\nfor i in range(num_of_s):\r\n text.append(input())\r\nflag = 1\r\ni = 0\r\nwhile (flag and i<len(text)):\r\n if gl_in_str(text[i]) == st_razm[i]:\r\n i+=1\r\n else:\r\n flag = 0\r\n break\r\nprint('YES') if flag else print('NO')", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\ninput()\nfor n in map(int,input().split()):\n\tfor z in input():n-=z in'aeiouy'\n\tif n:break\nprint('NO'if n else'YES')\n", "if __name__ == '__main__':\n count = int(input())\n pattern = [int(x) for x in input().split(' ')]\n satisfied = True\n for i in range(count):\n if pattern[i] != len([x for x in input() if x in 'aeiouy']):\n satisfied = False\n break\n print('YES' if satisfied else 'NO')\n", "n = int(input())\r\np = list(map(int, input().split()))\r\na = set('auiyoe')\r\nlog = True\r\nfor i in range(n):\r\n s = input()\r\n cnt = 0\r\n for el in s:\r\n if el in a:\r\n cnt += 1\r\n if cnt != p[i]:\r\n log = False\r\nif log:\r\n print('YES')\r\nelse:\r\n print('NO')", "vow=set(['a','e','i','o','u','y'])\r\ndef f(x):\r\n q=0\r\n for y in x:\r\n q+=int(y in vow)\r\n return q\r\nn=int(input())\r\np=[int(x) for x in input().split(' ')]\r\nfl=1\r\nfor i in range(n):\r\n s=[f(x) for x in input().split(' ')]\r\n if(sum(s)!=p[i]):\r\n fl=0\r\nprint(\"YES\" if (fl) else (\"NO\"))", "n=int(input())\r\nlst=list(map(int, input().split()))\r\nt=True\r\nfor i in range(0, n):\r\n c=0\r\n elem=input()\r\n for s in elem:\r\n if (s=='a') or (s=='e') or (s=='i') or (s=='o') or (s=='u') or (s=='y'):\r\n c+=1;\r\n if c!=lst[i]:\r\n t=False\r\nif t==True:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python3\n\n\ndef main():\n n = int(input())\n ps = [int(x) for x in input().split()]\n v = set('aeiouy')\n for p in ps:\n s = input()\n ss = sum(1 for x in s if x in v)\n if ss != p:\n print('NO')\n return\n print('YES')\n\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\np=list(map(int,input().split()))\r\n\r\n\r\nfor i in range(n):\r\n s=input()\r\n\r\n count=0\r\n for j in range(len(s)):\r\n if s[j]=='a' or s[j]=='e' or s[j]=='i' or s[j]=='o' or s[j]=='u' or s[j]=='y':\r\n count+=1\r\n\r\n if count!=p[i]:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "def getVowelCount(verse):\n vdict = {'a':1,'e':1,'i':1,'o':1,'u':1,'y':1}\n vcount = 0;\n for i in range(0,len(verse)):\n if vdict.get(verse[i]):\n vcount +=1\n return vcount\n\ndef main():\n result = \"YES\"\n n = int(input())\n seq = list(map(int, input().split(\" \")))\n for i in range(0,n):\n if seq[i] != getVowelCount(input()):\n result = \"NO\"\n break;\n print(result);\nif __name__ == \"__main__\":\n main();\n", "import re\r\nn = int(input())\r\np = list(map(int, input().split()))\r\ntt = \"[aeiouy]\"\r\nres = []\r\nwhile n > 0:\r\n l = input()\r\n c = 0\r\n for w in l.split():\r\n slogs = re.findall(tt, w)\r\n c += len(slogs)\r\n res += [c]\r\n n -= 1\r\nprint(\"YES\" if res == p else \"NO\")\r\n", "n = int(input())\np = input().split()\nr = 'YES'\nfor i in range(n):\n\ts = input()\n\tif(r!='NO' and s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')+s.count('y')!=int(p[i])):\n\t\tr = 'NO'\nprint(r)\n", "n = int(input())\n\nps = list(map(int, input().split(' ')))\nyes = 1\n\nfor idx in range(n):\n count = 0\n words = list(input())\n for word in words:\n if word == 'a' or word == 'e' or word == 'i' or word == 'o' or word == 'u' or word == 'y':\n count += 1\n if count != ps[idx]:\n yes = 0\n\n\nif yes:\n print('YES')\nelse:\n print('NO')\n\t \t \t \t\t\t \t \t\t \t \t\t \t\t \t", "import sys\r\n\r\n\r\nn = int(input())\r\nL = list(map(int, input().split()))\r\nH = ['a', 'e', 'i', 'o', 'u', 'y']\r\na = \"YES\"\r\nfor i in range(n):\r\n ss = input().split()\r\n s = \"\"\r\n ans = 0\r\n for item in ss:\r\n for x in item:\r\n if (x in H):\r\n ans += 1\r\n if (ans != L[i]):\r\n a = \"NO\"\r\nprint(a)\r\n", "n=int(input())\r\na=[int(x) for x in input().split(\" \")]\r\nb=[]\r\nfor i in range(n):\r\n t=input()\r\n s=sum(t.count(x) for x in 'aiouey')\r\n b.append(s==a[i])\r\nif all(b): print(\"YES\")\r\nelse: print(\"NO\") \r\n ", "n = int (input ())\r\np = input ().split ()\r\n\r\nfail = False\r\n\r\nfor i in range (n) :\r\n\ts = list (input ())\r\n\tcnt = s.count ('a') + s.count ('e') + s.count ('i') + s.count ('o') + s.count ('u') + s.count ('y')\r\n\tif cnt != int (p[i]) :\r\n\t\tfail = True\r\n\t\t\r\nif fail : \r\n\tprint (\"NO\")\r\nelse :\r\n\tprint (\"YES\")", "input()\r\na = list(map(int,input().split()))\r\ndem = 0\r\nfor i in a:\r\n s = input()\r\n if(i!=sum(s.count(j) for j in \"aeiouy\")):\r\n dem=1\r\nif dem==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nsyllables = [ int(i) for i in input().split() ]\r\n\r\ncheck = 0\r\nfor Homu in range(n):\r\n phrase = input()\r\n a = phrase.count('a')\r\n e = phrase.count('e')\r\n i = phrase.count('i')\r\n o = phrase.count('o')\r\n u = phrase.count('u')\r\n y = phrase.count('y')\r\n \r\n if a+e+i+o+u+y != syllables[Homu]:\r\n check += 21\r\n break\r\n\r\nif check == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nvl = ['a','e','i','o','u','y']\r\ncl = list(map(int, input().split()))\r\nflag=True\r\nfor i in range(n):\r\n ts = input()\r\n if flag:\r\n sum = 0\r\n for v in vl:\r\n sum+=ts.count(v)\r\n if sum!=cl[i]:\r\n flag=False\r\nprint([\"NO\",\"YES\"][flag])\r\n", "testes = int(input())\nns = list(map(int,input().split()))\nvogais = \"aeiouy\"\nresposta = \"YES\"\nfor i in range (testes):\n if resposta == \"YES\":\n n = 0\n linha = str(input())\n for j in linha:\n if j in vogais:\n n += 1\n if n != ns[i]:\n resposta = \"NO\"\nprint(resposta)\n\t \t\t\t \t\t\t \t \t \t\t \t\t\t \t\t \t", "n, p = int(input()), list(map(int, input().split()))\r\nfor i in range(n):\r\n l = input()\r\n if sum(l.count(v) for v in 'aeiouy') != p[i]:\r\n print('NO')\r\n exit()\r\nprint('YES')", "def to_sl(s):\r\n b = {'a', 'e', 'y', 'u', 'i', 'o'}\r\n c = 0\r\n for i in range(len(s)):\r\n if s[i] in b:\r\n c += 1\r\n return c\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmistake = False\r\n\r\nfor i in range(n):\r\n s = list(input().split())\r\n c_now = 0\r\n for elem in s:\r\n c_now += to_sl(elem)\r\n if c_now != a[i]:\r\n mistake = True\r\n break\r\n \r\nif mistake:\r\n print('NO')\r\nelse:\r\n print('YES')", "def main():\n t = str.maketrans(\"aeiouy\", \"******\")\n input()\n for p in map(int, input().split()):\n if p != input().translate(t).count('*'):\n print(\"NO\")\n return\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\np = input().split()\nfail = False\nfor i in range (n) :\n s = list (input ())\n cnt = s.count ('a') + s.count ('e') + s.count ('i') + s.count ('o') + s.count ('u') + s.count ('y')\n if cnt != int (p[i]) :\n \tfail = True\nif fail : \n print (\"NO\")\nelse :\n print (\"YES\")\n\n", "def main():\r\n from sys import stdin, stdout\r\n inp=stdin.readlines()\r\n n=int(inp[0])\r\n versePattern=iter(map(int,inp[1].split()))\r\n ans=True\r\n for line in inp[2:]:\r\n vowelCnt=0\r\n for x in line:\r\n if x in \"aeiouy\":\r\n vowelCnt+=1\r\n if vowelCnt != next(versePattern):\r\n ans=False\r\n break\r\n stdout.write(\"YES\\n\" if ans else \"NO\\n\")\r\nif __name__=='__main__':\r\n main()", "n = int(input())\r\nans = 'YES'\r\nvowel = ['a', 'e', 'i', 'o', 'u', 'y']\r\narray = [int(x) for x in input().split()]\r\nfor i in range (0,n) :\r\n array[i] = int(array[i])\r\nfor i in range (0,n) :\r\n string = input()\r\n c=0\r\n for j in range (0,len(string)) :\r\n if string[j] in vowel :\r\n c += 1\r\n if ( c != array[i] ) :\r\n ans = 'NO'\r\nprint(ans) ", "def is_vowel(c):\r\n vowels = 'aeiouy'\r\n for vowel in vowels:\r\n if c == vowel:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nstrings = [input() for _ in range(n)]\r\nres = [0] * n\r\nfor i in range(n):\r\n for c in strings[i]:\r\n if is_vowel(c):\r\n res[i] += 1\r\nyes = True\r\nfor i in range(n):\r\n if res[i] != p[i]:\r\n yes = False\r\n break\r\nprint('YES' if yes else 'NO')\r\n", "def kol(a):\r\n b = 0\r\n c = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\n for i in range(len(a)):\r\n if a[i] in c: b += 1\r\n return b\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nfor i in range(n):\r\n a = input()\r\n if kol(a) != p[i]: print(\"NO\"); exit()\r\nprint(\"YES\")", "def process(P, S):\r\n n = len(P)\r\n for i in range(n):\r\n count = 0\r\n for c in S[i]:\r\n if c in 'aeiouy':\r\n count+=1\r\n if count != P[i]:\r\n return 'NO'\r\n return 'YES'\r\n\r\nn = int(input())\r\nP = [int(x) for x in input().split()]\r\nS = []\r\nfor i in range(n):\r\n word = input()\r\n S.append(word)\r\nprint(process(P, S))", "n =int(input())\ns = [int(i) for i in input().split()]\nu = [\"a\", \"o\", \"i\", \"u\", \"e\", \"y\"]\ny = 1\nfor i in range(n):\n\tcount = 0\n\tt = input()\n\tfor j in t:\n\t\tif j in u:\n\t\t\tcount +=1\n\tif count != s[i]:\n\t\ty = 0\nif not y:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\t\t\n", "n=int(input())\np=[int(x) for x in input().split(' ')]\nmatch=True\nsa={'a', 'e', 'i', 'o', 'u', 'y'}\nfor i in range(n):\n s=input()\n spaces = 0\n syllabi = 0\n for j in range(len(s)):\n if s[j] in sa:\n syllabi+=1\n if p[i] ==syllabi:\n pass\n else:\n match=False\n if match == False:\n print('NO')\n break\nif match==True:\n print('YES')\n", "import functools as ftools\r\nn, tmpl = int(input()), tuple(map(int, input().split()))\r\nprint(\"YES\" if ftools.reduce(lambda a, b: a and b, [sum(map(s.count, \"aeiouy\")) == tmpl[i] for i, s in enumerate(map(lambda _: input(), range(n)))]) else \"NO\")\r\n", "lines_count = int(input())\n\nverse_patterns = [int(i) for i in input().split()]\nvowels = 'aeiouy'\n\nmatch_input = True\nfor index in range(lines_count):\n\tverse = input()\n\tverse_pattern = 0\n\tfor letter in verse:\n\t\tif letter in vowels:\n\t\t\tverse_pattern += 1\n\tif verse_pattern != verse_patterns[index]:\n\t\tmatch_input = False\n\nif match_input:\n\tprint('YES')\nelse:\n\tprint('NO')\n\t \t \t \t\t\t\t\t \t\t\t \t\t\t \t\t\t\t \t\t", "def is_pattern_correct(pattern_value, text):\n number_of_syllables = 0\n syllables = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\n for letter in text:\n if letter in syllables:\n number_of_syllables += 1\n if number_of_syllables == pattern_value:\n return True\n else:\n return False\n\nn = int(input())\npattern = list(int(num) for num in input().split(\" \"))\nis_correct = True\nfor i in range(n):\n text = input()\n is_correct = is_correct and is_pattern_correct(pattern[i], text)\nif is_correct:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t \t\t \t \t \t\t\t\t \t\t\t\t \t \t \t\t", "N=int(input())\r\nP=list(map(int,input().strip().split()))\r\nfor i in range (0,N):\r\n S=str(input())\r\n for s in range (len(S)):\r\n if S[s]=='a' or S[s]=='i' or S[s]=='u' or S[s]=='e' or S[s]=='o' or S[s]=='y':\r\n P[i]=P[i]-1\r\nif len(set(P))==1 and P[0]==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "def countVowels(word):\r\n count = 0\r\n for i in word:\r\n if(i == 'a') or (i == 'e') or (i == 'i') or (i == 'o') or (i == 'u') or (i == 'y'):\r\n count += 1\r\n return count\r\n \r\nn = int(input())\r\np = list(map(int, input().split()))\r\nisPossible = True\r\nfor i in range(n):\r\n word = input()\r\n x = countVowels(word)\r\n if(x != p[i]):\r\n isPossible = False\r\nif(isPossible):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nl=list(map(int,input().split()))\r\n#«a», «e», «i», «o», «u», «y».\r\ns={'a','e','i','o','u','y'};\r\nf=1\r\nfor i in range(n):\r\n t=input()\r\n c=0\r\n for j in t:\r\n if j in s:\r\n c+=1\r\n if c!=l[i]:\r\n f=0\r\nprint(\"YES\" if f else \"NO\")", "import sys\r\nimport math\r\n\r\ndef glas(ch):\r\n\treturn ch in 'aeiouy'\r\n\r\n\r\ndef kol(s):\r\n\tres = 0\r\n\tfor ch in s:\r\n\t\tres += int(glas(ch))\r\n\treturn res\r\n\r\nn = int(sys.stdin.readline())\r\n\r\narr = (int(x) for x in sys.stdin.readline().split())\r\n\r\nfor elem in arr:\r\n\ts = sys.stdin.readline()\r\n\tres = kol(s)\r\n\tif res != elem:\r\n\t\tprint('NO')\r\n\t\texit()\r\n\r\n\r\nprint('YES')", "print(input()*0+'YNEOS'[not all(p==sum(map(input().count,'aeiouy')) for p in map(int,input().split()))::2])", "n=int(input())\r\np=list(map(int,input().split(\" \")))\r\nl=[]\r\nfor i in range(n):\r\n ch=input()\r\n l.append(ch)\r\nt=True\r\nv='aeyuio'\r\ni=0\r\nwhile (i<n)and t:\r\n s=0\r\n for x in l[i]:\r\n if x in v:\r\n s=s+1\r\n if s!=p[i]:\r\n t=False\r\n break\r\n i=i+1\r\n \r\nif t:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\nsilabas = input()\nsilabas = silabas.split(\" \")\n\nvogais = ['a', 'e', 'i', 'o', 'u', 'y']\n\nOK = True\nfor i in range(0, n):\n frase = input()\n\n quant = 0\n for j in frase:\n if j in vogais:\n quant += 1\n\n if quant != int(silabas[i]):\n OK = False\n\nif OK:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t\t\t \t\t\t \t\t \t\t", "from sys import exit\r\n\r\ndef num_vow(s):\r\n vow = ['a', 'e', 'o', 'i', 'u', 'y']\r\n r = 0\r\n for i in vow:\r\n r += s.count(i)\r\n return r\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nf = True\r\n\r\nfor i in range(n):\r\n s = input()\r\n if num_vow(s) != p[i] and f:\r\n print(\"NO\")\r\n f = False\r\nif f:\r\n print(\"YES\")", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nres = list()\r\nvowels = 'aeiouy'\r\nfor i in range(n):\r\n s = input()\r\n count = 0\r\n for elem in s:\r\n if elem in vowels:\r\n count += 1\r\n res.append(count)\r\nif res == lst:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\np = [int(_) for _ in input().split()]\r\na = ['a', 'e', 'i', 'o', 'u', 'y']\r\nf = True\r\nfor i in range(n):\r\n s = input()\r\n k = 0\r\n for j in s:\r\n if j in a:\r\n k += 1\r\n if k != p[i]:\r\n f = False\r\n break\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\n\ndef matched_pattern(counts, strings):\n for count, string in zip(counts, strings):\n if count != sum(1 for c in string if c in 'aeiouy'):\n return False\n return True\n\n\nn = int(input())\ncounts = map(int, input().split())\nstrings = [input() for i in range(n)]\nprint(\"YES\" if matched_pattern(counts, strings) else \"NO\")\n", "n = int(input())\np = list(map(int, input().split()))\nc = \"aeiouy\"\n\n\ndef main():\n for i in range(n):\n s = input()\n count = 0\n\n for ch in s:\n if ch in c:\n count += 1\n\n if count != p[i]:\n print(\"NO\")\n return\n\n print(\"YES\")\n return\n\nmain()\n", "count = int(input());\r\nb = [int(i) for i in input().split()]\r\n\r\nalp = ['a', 'e', 'y', 'u', 'i', 'o']\r\nfor i in range(count):\r\n s = input()\r\n for j in s:\r\n if j in alp:\r\n b[i]-=1;\r\n if b[i] != 0:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "from collections import defaultdict\r\nimport sys, os, math\r\n\r\nif __name__ == \"__main__\":\r\n #n, m = list(map(int, input().split()))\r\n #sys.stdout.flush()\r\n n = int(input())\r\n p = list(map(int, input().split()))\r\n for i in range(n):\r\n s = input()\r\n cnt = 0\r\n for ch in \"aeiouy\":\r\n cnt += s.count(ch)\r\n if cnt != p[i]:\r\n print(\"NO\")\r\n sys.exit(0)\r\n print(\"YES\")", "n = int(input())\r\nprint('YES' if list(map(int, input().split())) == [len(list(filter(lambda c: c in 'aeiouy', s))) for s in [input() for _ in range(n)]] else 'NO')\r\n", "I=input\r\nI()\r\ny=1\r\nfor x in map(int,I().split()):t=I();y=y and x==sum(t.count(i)for i in'aeiouy')\r\nprint(['NO','YES'][y])", "a=int(input())\r\n\r\nz=list(map(int,input().split()))\r\nfor i in range(a):\r\n k=input()\r\n if ( sum(k.count(x) for x in \"aeiouy\")!=z[i]):exit(print(\"NO\"))\r\nprint(\"YES\")", "from sys import exit\nn = int(input())\np = list(map(int, input().split()))\n\nfor i, cur_p in zip(range(n), p):\n s = input().strip()\n cnt = 0\n for c in s:\n if c in 'aeiouy':\n cnt+= 1\n if cnt != cur_p:\n print(\"NO\")\n exit(0)\nprint(\"YES\")\n", "if __name__ == '__main__':\r\n cin = input\r\n n = int(cin())\r\n a = [int(i) for i in input().split()]\r\n\r\n for i in range(n):\r\n t = cin()\r\n if a[i] != sum(t.count(c) for c in \"ueoaiy\"):\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "import collections\r\n\r\n\r\nn = int(input())\r\np = input().split()\r\nflag = True\r\n\r\nfor i in range(n):\r\n string = input()\r\n \r\n c = collections.Counter(string)\r\n\r\n t = 0\r\n for letter in 'aeiouy':\r\n t += c[letter]\r\n\r\n if t != int(p[i]):\r\n flag = False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\nfor p in map(int, input().split()):\n line = input()\n if p != sum(map(lambda c: line.count(c), \"aeiouy\")):\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "from sys import stdin\nn = int(input())\np = list(map(int, input().split()))\nt = [\"\" for x in range(n)]\nfor i in range(n):\n\tt[i] = stdin.readline().rstrip() \nk = \"YES\"\nfor i, s in enumerate(t):\n\tif len(list(filter(lambda x: x == 'a' or x == 'e' or x == 'i' or x == 'o' or x == 'u' or x == 'y', s))) != p[i]:\n\t\tk = \"NO\"\n\t\tbreak \nprint(k)", "n = int(input()) \r\npatterns = [int(x) for x in input().split()]\r\nvoels = {\"a\", \"e\",\"i\",\"o\",\"u\",\"y\"}\r\nres = 'YES'\r\n\r\nfor i in range(n):\r\n syllables = 0\r\n line = input()\r\n\r\n for letter in line:\r\n if letter in voels:\r\n syllables += 1\r\n\r\n if syllables != patterns[i]:\r\n res = 'NO'\r\n break\r\n\r\nprint(res)", "input()\r\nanswer = \"YES\"\r\nvowels = set(\"aeiouy\")\r\nfor p in map(int, input().split()):\r\n if p != sum(l in vowels for l in input()):\r\n answer = \"NO\"\r\n break\r\nprint(answer)\r\n", "\nn = int(input())\nv =list(map(int, input().split()))\nflag = True\na = set(['a', 'e', 'i', 'o', 'u', 'y'])\nfor i in range(n):\n c = 0\n for s in input():\n if(s in a):\n c+=1\n if(flag and c!=v[i]):\n flag = False\n\nif(flag):\n print(\"YES\")\nelse: \n print(\"NO\")\n\n\t \t \t\t\t\t \t\t \t \t\t \t \t\t\t\t\t\t\t\t\t\t", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\ndef decompose(word):\r\n l = len(word)\r\n res = 0\r\n for i in range(l):\r\n if 'aeiouy'.find(word[i]) != -1:\r\n res += 1\r\n return res\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n text = list(map(str, input().split()))\r\n cnt = 0\r\n for word in text:\r\n cnt += decompose(word)\r\n if cnt != a[i]:\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\n ", "def func():\n\tn = int(input())\n\tnums = list(map(int, input().strip().split()))\n\tfor i in range(n):\n\t\ts = input()\n\t\tcount = 0\n\t\tfor c in s:\n\t\t\tif c in ['a', 'e', 'i', 'o', 'u', 'y']:\n\t\t\t\tcount += 1\n\t\tif count != nums[i]:\n\t\t\treturn False\n\n\treturn True\n\nif func():\n\tprint (\"YES\")\nelse:\n\tprint (\"NO\")\n", "import os\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom decimal import *\r\nfrom io import BytesIO, IOBase\r\nfrom collections import defaultdict, deque\r\n\r\ndef r():\r\n return int(input())\r\ndef rm():\r\n return map(int,input().split())\r\ndef rl():\r\n return list(map(int,input().split()))\r\n\r\nn = r()\r\na = rl()\r\nb = []\r\nfor i in range(n):\r\n b.append(input())\r\nans = True\r\nfor l,i in enumerate(b):\r\n cnt = 0\r\n for j in list(i.split()):\r\n for k in range(len(j)):\r\n if j[k] in ['a', 'e', 'i', 'o', 'u', 'y']:\r\n cnt+=1\r\n if cnt==a[l]:\r\n continue\r\n else:\r\n ans = False\r\n break\r\n\r\nprint ('YES' if ans else 'NO')\r\n", "def main():\r\n \r\n\tfrom sys import stdin, stdout\r\n\tpomkl= stdin.readlines()\r\n\r\n\tnop= int(pomkl[0])\r\n\r\n\tverat= iter(map(int,pomkl[1].split()))\r\n\r\n\tapple= True\r\n\tfor lomk in pomkl[2:]:\r\n\t \r\n\t\tvopl= 0\r\n\r\n\t\tfor xop in lomk:\r\n\t\t \r\n\t\t\tif xop in \"aeiouy\":\r\n\t\t\t \r\n\t\t\t\tvopl+= 1\r\n\t\r\n\t\tif vopl!= next(verat):\r\n\t\t \r\n\t\t\tapple= False\r\n\t\t\t\r\n\t\t\tbreak\r\n\r\n\tstdout.write(\"YES\\n\" if apple else \"NO\\n\")\r\n\r\n\r\nif __name__ == '__main__':\r\n \r\n\tmain()", "a, arrd, ans = int(input()), list(map(int, input().split())), \"YES\"\r\nfor i in range(a):\r\n k = arrd[i]\r\n s = input()\r\n if s.count('a') + s.count('e') + s.count('i') + s.count('o') + s.count('u') + s.count('y') != k:\r\n ans = \"NO\"\r\nprint(ans)", "n = int(input())\n\nqtdSilabas = [int(x) for x in input().split()]\n\nfalhou = False\n\nfor l in range(n):\n linha = input()\n silabas = 0\n\n for letra in linha:\n if (\n letra == 'a'\n or letra == 'e'\n or letra == 'i'\n or letra == 'o'\n or letra == 'u'\n or letra == 'y'\n ):\n silabas += 1\n \n if silabas != qtdSilabas[l]:\n print('NO')\n falhou = True\n break\n\nif not falhou:\n print('YES')\n \n \t\t \t\t\t \t \t\t\t\t \t\t\t \t \t\t\t \t", "n=int(input())\r\nlst = list(map(int,input().split(' ')))\r\nok = True\r\nfor _ in range(n):\r\n\tst = input()\r\n\tp_ = lst[_]\r\n\ta = st.count('a')\r\n\ta+= st.count('e')\t\r\n\ta+= st.count('i')\r\n\ta+= st.count('o')\r\n\ta+= st.count('u')\r\n\ta+= st.count('y')\r\n\tif p_!=a:\r\n\t ok=False \r\nif ok:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO') ", "def main():\r\n\tfrom sys import stdin, stdout\r\n\r\n\t# stdin = open(\"input.txt\", \"r\")\r\n\r\n\tinp = stdin.readlines()\r\n\r\n\tn = int(inp[0])\r\n\r\n\tversePattern = iter(map(int, inp[1].split()))\r\n\r\n\tans = True\r\n\r\n\tfor line in inp[2:]:\r\n\t\tvowelCnt = 0\r\n\r\n\t\tfor x in line:\r\n\t\t\tif x in \"aeiouy\":\r\n\t\t\t\tvowelCnt += 1\r\n\t\r\n\t\tif vowelCnt != next(versePattern):\r\n\t\t\tans = False\r\n\t\t\tbreak\r\n\r\n\tstdout.write(\"YES\\n\" if ans else \"NO\\n\")\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\na = [int(i) for i in input().split()]\nk = 0\nq = 0\nfor i in range(n):\n s = input()\n for j in s:\n if (j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\" or j==\"y\"):\n q+=1\n if q!=a[i]:\n print(\"NO\")\n exit(0)\n q=0\nprint(\"YES\")", "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\n\nn = int(input())\np = [ int(x) for x in input().split() ]\n\nr = True\n\nfor i in range(0, n):\n s = input()\n v = 0\n for c in vowels:\n v += s.count(c)\n if v != p[i]:\n r = False\n\nif r:\n print('YES')\nelse:\n print('NO')\n", "import sys\r\ninput = sys.stdin.readline\r\nimport re\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nfor i in range(n):\r\n c = re.findall(r'a|e|i|o|u|y', input()[:-1])\r\n if len(c) != w[i]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print('YES')", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\n\r\np=1\r\nm=0\r\nfor i in range(a):\r\n k=0\r\n s = input()\r\n for i in s:\r\n if i=='a' or i=='u' or i=='e' or i=='y' or i=='o' or i=='i':\r\n k+=1\r\n if k==b[m]:\r\n p=p*1\r\n #print('YES')\r\n else:\r\n p=p*0\r\n #print('NO')\r\n m+=1\r\nif p==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import math\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n v = [int(i) for i in input().split(\" \")]\r\n vowels = [ord(\"a\"), ord(\"e\"), ord(\"i\"), ord(\"o\"), ord(\"u\"), ord(\"y\")]\r\n is_ans_given = False\r\n for i in range(n):\r\n target_val = v[i]\r\n s = input()\r\n for j in s:\r\n if ord(j) in vowels:\r\n target_val -= 1\r\n if target_val != 0:\r\n is_ans_given = True\r\n if is_ans_given:\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\r\n\r\n\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n#main_function()", "n=int(input())\npatterns=list(map(int,input().split()))\ntext=[]\nfor i in range(n):\n t=list(input().split())\n text.append(t)\nfor i in range(len(text)):\n sum=0\n for j in range(len(text[i])):\n sum=sum+text[i][j].count('a')+text[i][j].count('e')+text[i][j].count('i')+text[i][j].count('o')+text[i][j].count('u')+text[i][j].count('y')\n if sum!=patterns[i]:\n print(\"No\")\n break\nelse:\n print(\"Yes\")\n \t \t\t \t\t\t \t \t\t \t\t\t\t \t \t\t", "import sys\r\ninput()\r\na=list(map(int, input().split()))\r\nans=all(sum(s.count(c) for c in 'aeiouy')==a.pop(0) for s in sys.stdin)\r\nprint('YES' if ans else 'NO')", "n = int(input())\nv = [int(i) for i in input().split(\" \")]\n\nVOWELS = ['a', 'e', 'i', 'o', 'u', 'y']\n\ndef oi(n):\n for i in range(n):\n res = 0\n s = input()\n for c in s:\n if (c in VOWELS):\n res += 1\n if (v[i] != res):\n print(\"NO\")\n return\n \n print(\"YES\")\n return\n\noi(n)\n\t\t \t \t\t \t \t \t \t \t\t \t \t", "n=int(input())\r\n\r\np =list(map(int,input().split()))\r\n\r\nans=True\r\n\r\nfor j in range(0,n) :\r\n i=input()\r\n tmp=i.count('a')+i.count('e')+i.count('i')+i.count('o')+i.count('u')+i.count('y')\r\n if tmp!=p[j] :\r\n ans=False\r\n \r\nif ans==False :\r\n print(\"NO\");\r\nelse :\r\n print(\"YES\");", "n = int(input())\np = [int(i) for i in input().split()]\n\nflag = True\nfor i in range(n):\n line = input()\n \n amount = 0\n for st in line.split(\" \"):\n for l in st:\n if l in [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]:\n amount += 1\n \n if p[i] != amount:\n flag = False\n \nif flag:\n print(\"YES\")\nelse:\n print(\"NO\")", "from sys import stdin, stdout\ncin = stdin.readline\ncout = stdout.write\nmp = lambda:list(map(int, cin().split()))\n\nn, = mp()\np = mp()\nf = 0\n#d = {}\n#revd = {}\nvowel = ['a', 'e', 'i', 'o', 'u', 'y']\nfor t in range(n):\n\ts = cin()[:-1]\n\tif not f:\n\t\ta = s.count('a')\n\t\te = s.count('e')\n\t\ti = s.count('i')\n\t\to = s.count('o')\n\t\tu = s.count('u')\n\t\ty = s.count('y')\n\t\n\t\tif a+e+i+o+u+y != p[t]:\n\t\t\t#cout('NO')\n\t\t\tf = 1\nif not f:\n\tcout(\"YES\")\nelse:\n\tcout('NO')\n\t\n#print(d)\n#s.reverse()\n#s_out = ''\n''' \nfor i in range(n):\n\tfor j in range(revd[s[i]], n+1):\n'''\n \t\t\t \t\t\t \t\t \t \t\t\t \t\t\t \t\t\t\t\t", "from collections import Counter\r\n\r\ninput()\r\n\r\nfor p in map(int, input().split()):\r\n C = Counter(input())\r\n if sum(C[v] for v in 'aeiouy') != p:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nfrom collections import Counter\n\nN = int(input())\npatterns = list(map(int,input().split()))\n\nvowels = []\nfor n in range(N):\n c = Counter(input())\n vowel_num = sum(c[x] for x in 'aeiouy')\n vowels.append(vowel_num)\n\nif vowels == patterns:\n print('YES')\nelse:\n print('NO')\n \n", "n=int(input())\r\np=[int(i) for i in input().split()]\r\nx=0\r\nfor i in range(n):\r\n s=input()\r\n k=s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')+s.count('y')\r\n if k!=p[i]:\r\n x=1\r\n break\r\nif(x):print(\"NO\")\r\nelse:print(\"YES\")", "n = int(input())\r\np = list(map(int, input().split()))\r\nfor k in p:\r\n tmp = 0\r\n s = input()\r\n for i in s:\r\n if i in ['a', 'i', 'u', 'e', 'o', 'y']:\r\n tmp += 1\r\n if tmp != k:\r\n print('NO')\r\n exit()\r\nprint('YES')" ]

[ "import sys\r\ninput=sys.stdin.readline\r\nl=input().split()\r\nli=[int(i) for i in l]\r\nmaxa=10**18\r\nli.sort()\r\nif((li[2]-li[1])%2==0):\r\n maxa=min(maxa,li[2])\r\nif((li[2]-li[0])%2==0):\r\n maxa=min(maxa,li[2])\r\nif((li[1]-li[0])%2==0):\r\n maxa=min(maxa,li[1])\r\nif(maxa==10**18):\r\n print(-1)\r\nelse:\r\n print(maxa)\r\n", "def pixel(input):\r\n red, green, blue = input.split()\r\n red = int(red)\r\n green = int(green)\r\n blue = int(blue)\r\n\r\n plist = [red,green,blue]\r\n plist.sort()\r\n\r\n lowestChet = is_chet(plist[0])\r\n midChet = is_chet(plist[1])\r\n\r\n if ((midChet + lowestChet) == 2) or ((midChet + lowestChet) == 0):\r\n return plist[1]\r\n else:\r\n return plist[2]\r\n\r\n\r\ndef is_chet(n):\r\n return 1 if n % 2 == 0 else 0\r\n \r\nprint(pixel(input()))", "a = list(map(int,input().split()))\r\na.sort()\r\nif int(a[1] % 2 == 0)+int(a[0] % 2 == 0)==1:\r\n print(a[2])\r\nelse:\r\n print(int((((a[1]-a[0])+(a[1]+a[0]))/2)))", "a = list(map(int,input().split()))\r\ndef calc(a):\r\n return int((((a[1]-a[0])+(a[1]+a[0]))/2))\r\na.sort()\r\nif a[1] % 2 == 0 and a[0] % 2 == 0:\r\n print(calc(a))\r\nelif a[1] % 2 == 0 or a[0] % 2 == 0:\r\n print(a[2])\r\nelse:\r\n print(calc(a))" ]

[ "a=[]\nb=[]\nn=0\ndef cal(x):\n\tp=0\n\tglobal n,a,b\n\tfor i in range(n):\n\t\tp+=((a[i]*x)//b[i])\n\treturn p\n\nn,c=map(int,input().split())\nc-=n\nif c < 0:\n\tprint(0)\n\texit(0)\na=[0]*n\nb=[0]*n\nfor i in range(n):\n\ta[i],b[i]=map(int,input().split())\nL=1\nR=10**18\nlower=R+1\nwhile L<=R :\n\tm=(L+R)>>1\n\tif cal(m) >= c:\n\t\tlower=m\n\t\tR=m-1\n\telse: L=m+1\nL=lower\nR=10**18\nupper=R+1\nwhile L<=R :\n\tm=(L+R)>>1\n\tif cal(m) > c:\n\t\tupper=m\n\t\tR=m-1\n\telse: L=m+1\n\nprint(upper-lower)", "def f(x, t):\r\n y = x\r\n while sum((y * a) // b for a, b in t) < c: y += 1000000\r\n while y - x > 1:\r\n z = (x + y) // 2\r\n d = sum((z * a) // b for a, b in t)\r\n if d < c: x = z\r\n else: y = z\r\n return y\r\n \r\nn, c = map(int, input().split())\r\nc -= n\r\nt = [tuple(map(int, input().split())) for i in range(n)]\r\nx = sum(a / b for a, b in t)\r\nif x:\r\n x = f(int(c / x), t)\r\n print((int(x > 0) + min((b - (x * a) % b - 1) // a for a, b in t if a > 0)) if sum((x * a) // b for a, b in t) == c else 0)\r\nelse: print(0 if c else -1)", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n n , c = map(int , input().split())\r\n data = []\r\n for i in range(n):\r\n a,b = map(int , input().split())\r\n data.append([a , b])\r\n \r\n def cond(x , typ):\r\n days = 0\r\n for i in data:\r\n days += 1\r\n presents = i[0] * x\r\n days += presents // i[1]\r\n \r\n if typ == 1:\r\n return [days >= c , days]\r\n else:\r\n return [days <= c , days]\r\n \r\n l = 1\r\n r = int(1e18)\r\n ans1 = -1\r\n days1 = -1\r\n while l <= r:\r\n mid = l + (r - l) // 2\r\n llll = cond(mid , 1)\r\n if llll[0]:\r\n ans1 = mid\r\n days1 = llll[1]\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n\r\n l = 1\r\n r = int(1e18)\r\n ans2 = -1\r\n days2 = -1\r\n\r\n while l <= r:\r\n mid = l + (r - l) // 2\r\n llll = cond(mid , 2)\r\n if llll[0]:\r\n ans2 = mid\r\n days2 = llll[1]\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n\r\n # print(ans1 , days1 , ans2 , days2)\r\n if days1 == c and days2 == c:\r\n print(ans2 - ans1 + 1)\r\n else:\r\n print(0)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()" ]

[ "s = str(input())\r\nval = eval(s)\r\nn = len(s)\r\nfor i in range(-1, n):\r\n\tif i == -1 or s[i] == '*':\r\n\t\tfor j in range(i + 1, n + 1):\r\n\t\t\tif j == n or s[j] == '*':\r\n\t\t\t\tnew = s[0 : i + 1] + '(' + s[i + 1 : j] + ')' + s[j : n]\r\n\t\t\t\tval = max(val, eval(new))\r\nprint(val)", "s = \"1*\" + input() + \"*1\"\r\nn = len(s)\r\nans = eval(s)\r\nfor i in range(n):\r\n if s[i] != '*':\r\n continue\r\n for j in range(i + 1, n):\r\n if s[j] != '*':\r\n continue;\r\n t = s[0 : i + 1] + '(' + s[i + 1 : j] + ')' + s[j : n]\r\n ans = max(ans, eval(t))\r\nprint(ans)\r\n", "def main():\r\n s = input()\r\n max_res = eval(s)\r\n data = s.split('*')\r\n for i in range(len(data)):\r\n old_i = data[i]\r\n data[i] = f\"({data[i]}\"\r\n for j in range(i, len(data)):\r\n old_j = data[j]\r\n data[j] = f\"{data[j]})\"\r\n max_res = max(max_res, eval('*'.join(data)))\r\n data[j] = old_j\r\n data[i] = old_i\r\n print(max_res)\r\n\r\n\r\nmain()\r\n", "import math\r\ns=\"*\"\r\ns=s+input()\r\ns=s+\"*\"\r\nn=len(s)\r\nans=0\r\nfor i in range(0,n):\r\n if s[i]=='*':\r\n for j in range(i+1,n-1):\r\n if s[j+1]=='*':\r\n a=\"\"\r\n for k in range(0,n-1):\r\n if k>0:\r\n a=a+s[k]\r\n if k==i:\r\n a=a+\"(\"\r\n if k==j:\r\n a=a+\")\"\r\n t=eval(a)\r\n if t>ans:\r\n ans=t\r\nprint(ans)\r\n", "s=\"1*\"+input()+\"*1\"\r\nmx=0\r\nv=[]\r\nfor i in range(len(s)):\r\n if s[i]=='*':v.append(i)\r\nfor i in range(len(v)):\r\n for j in range(i+1,len(v)):\r\n z=eval(s[v[i]+1:v[j]])\r\n mx=max(mx,eval(s[:v[i]+1]+str(z)+s[v[j]:]))\r\nprint(mx)", "s = input()\r\n\r\nans = eval(s)\r\n\r\ndef insert(s, id, ch):\r\n t = str()\r\n # print(\"s = \" + s, \"id = \" + str(id))\r\n t += (s[:id])\r\n t += ch\r\n t += s[id:]\r\n return t\r\n\r\nfor id, ch in enumerate(s):\r\n if ch != '*': continue\r\n for i, c in enumerate(s):\r\n if i == 0 or i == len(s) - 1 or (s[i - 1] == '*' and i < id) or (s[i + 1] == '*' and i > id):\r\n t = s\r\n t = insert(t, i + (0 if i < id else 1), '(' if i < id else ')')\r\n t = insert(t, id + 1, ')' if i < id else '(')\r\n ans = max(ans, eval(t))\r\n\r\nprint(ans)\r\n\r\n\r\n", "s = \"1*\" + input() + \"*1\"\r\nindexes = []\r\nfor i in range(len(s)):\r\n if s[i] == '*':\r\n indexes.append(i)\r\nans = 0\r\nfor i in range(len(indexes)):\r\n for j in range(i + 1, len(indexes)):\r\n ans = max(ans, eval(s[:indexes[i] + 1] + \"(\" + s[indexes[i] + 1 : indexes[j]] + \")\" + s[indexes[j]:]))\r\nprint(ans)\r\n", "maxx = 0\r\nx = []\r\ns = input()\r\nmaxx = max(maxx, eval(s))\r\nfor i in range(len(s)):\r\n if s[i] == '*':\r\n x.append(i)\r\n maxx = max(maxx, eval('('+s[:i]+')'+s[i:]))\r\n maxx = max(maxx, eval(s[:i+1]+'('+s[i+1:] + ')'))\r\n\r\nfor f in range(len(x)):\r\n for g in range(f+1, len(x)):\r\n i = x[f]; j = x[g];\r\n maxx = max(maxx, eval(s[:i+1]+'('+s[i+1:j]+')'+s[j:]))\r\n\r\nprint(maxx)\r\n", "s = input()\r\ns = \"1*\" + s + \"*1\"\r\nlx = len(s)\r\nrep = eval(s)\r\npos = []\r\nfor i in range(lx):\r\n if s[i] == \"*\":\r\n pos.append(i)\r\n\r\nsz = len(pos)\r\nfor aa1 in range(sz):\r\n for aa2 in range(aa1+1, sz):\r\n a1 = pos[aa1]\r\n a2 = pos[aa2]\r\n ns = \"\"\r\n for i in range(lx):\r\n if i == a2:\r\n ns += \")\"\r\n ns += s[i]\r\n if i == a1:\r\n ns += \"(\"\r\n rep = max(rep, eval(ns))\r\n\r\nprint(rep)", "S = input()\r\nN = len(S)\r\nAns = eval(S)\r\nfor i in range(0, N, 2):\r\n\tfor j in range(i, N, 2):\r\n\t\tif (i == 0 or (i > 0 and S[i - 1] == '*')) and (j == N - 1 or (j < N - 1 and S[j + 1] == '*')):\r\n\t\t\tSS = S[:i] + str(eval(S[i:j+1])) + S[j+1:]\r\n\t\t\tif int(eval(SS)) > Ans:\r\n\t\t\t\tAns = int(eval(SS))\r\nprint(Ans)\r\n\r\n", "s = input()\r\n\r\nidx=[-1]\r\n\r\nfor i in range(len(s)):\r\n if (s[i] == '*'):\r\n idx.append(i)\r\n\r\nidx.append(len(s))\r\n\r\nans = 0\r\n\r\nfor i in range(len(s)):\r\n for j in range(i + 1, len(idx)):\r\n ans = max(ans, eval(s[:idx[i]+1] + \"(\" + s[idx[i]+1:idx[j]] + \")\" + s[idx[j]:]))\r\n\r\nprint(ans)", "s=input()\r\nans=eval(s);\r\nn=len(s)\r\n\r\npos = [i for i,x in enumerate(s) if x=='*']\r\n\r\n\r\nfor x in pos:\r\n s2=f\"({s[0:x]}){s[x:]}\"\r\n ans=max(ans,eval(s2))\r\n s2=f\"{s[:x+1]}({s[x+1:]})\"\r\n ans=max(ans,eval(s2))\r\n for y in pos:\r\n if y>=x: \r\n continue\r\n s2=f\"{s[:y+1]}({s[y+1:x]}){s[x:]}\"\r\n ans=max(ans,eval(s2))\r\n \r\n\r\nprint(ans)", "def Precedence_Order(opd):\n if opd == '+':\n return 1\n elif opd == \"*\":\n return 2\n else:\n return 0\n\ndef Operation(num1, num2, opd):\n if opd == '+':\n return num1 + num2\n if opd == '-':\n return num1 - num2\n if opd == '*':\n return num1 * num2\n if opd == '/':\n return num1 // num2\n\n\ndef eval(expression):\n values = []\n ops = []\n i = 0\n\n while i < len(expression):\n\n if expression[i] == ' ':\n i += 1\n continue\n\n elif expression[i] == '(':\n ops.append(expression[i])\n\n elif expression[i].isdigit():\n val = 0\n\n while (i < len(expression) and\n expression[i].isdigit()):\n val = (val * 10) + int(expression[i])\n i += 1\n\n values.append(val)\n\n i -= 1\n\n elif expression[i] == ')':\n\n while len(ops) != 0 and ops[-1] != '(':\n val2 = values.pop()\n val1 = values.pop()\n opd = ops.pop()\n\n values.append(Operation(val1, val2, opd))\n ops.pop()\n\n else:\n\n while (len(ops) != 0 and Precedence_Order(ops[-1]) >= Precedence_Order(expression[i])):\n val2 = values.pop()\n val1 = values.pop()\n opd = ops.pop()\n\n values.append(Operation(val1, val2, opd))\n\n ops.append(expression[i])\n\n i += 1\n\n while len(ops) != 0:\n val2 = values.pop()\n val1 = values.pop()\n opd = ops.pop()\n\n values.append(Operation(val1, val2, opd))\n\n return values[-1]\n\n\ndef allDots(s):\n l=[]\n for i in range(len(s)):\n if s[i]==\"*\":\n l.append(i)\n return l\n\ndef putParentheses(s,i,j):\n return s[:i+1]+\"(\"+s[i+1:j]+\")\"+s[j:]\n\ndef main(s):\n s=\"1*\"+s+\"*1\"\n l = allDots(s)\n m=eval(s)\n\n for i in range(len(l)):\n for j in range(i+1,len(l)):\n\n m=max(m,eval(putParentheses(s, l[i], l[j])))\n return m\n\ns=input(\"\")\n\nprint(main(s))\n\n\n\n", "# coding: utf-8\r\nexpr = list(input())\r\nmul_pos = [-1]\r\nadd_cnt = [0] * len(expr)\r\nfor i, _ in enumerate(expr):\r\n add_cnt[i] = add_cnt[i - 1] # don't worry about add_cnt[-1] ;)\r\n if _ == '*':\r\n mul_pos.append(i)\r\n elif _ == '+':\r\n add_cnt[i] += 1\r\nmul_pos.append(len(expr))\r\nadd_cnt.append(add_cnt[-1])\r\nadd_cnt.append(0)\r\nans = 0\r\nfor i in range(len(mul_pos)):\r\n for j in range(i + 1, len(mul_pos)):\r\n if add_cnt[mul_pos[i]] - add_cnt[mul_pos[j]]:\r\n expr.insert(mul_pos[i] + 1, '(')\r\n expr.insert(mul_pos[j] + 1, ')')\r\n # print(''.join(expr))\r\n ans = max(ans, eval(''.join(expr)))\r\n expr.pop(mul_pos[j] + 1)\r\n expr.pop(mul_pos[i] + 1)\r\nprint(eval(''.join(expr)) if ans == 0 else ans)", "src_str=input()\nlenstr=len(src_str)\nstr=list(src_str)\n\nlistMulPos=[]\nfor i,c in enumerate(str):\n if c=='*':\n listMulPos.append(i)\nlistLeftParPos=[0]\nfor i in listMulPos:\n listLeftParPos.append(i+1)\nlistRightParPos=[lenstr]\nfor i in listMulPos:\n listRightParPos.append(i)\n\nans=0\n\n# 枚举所有可行的表达式并计算\nfor leftPos in listLeftParPos:\n for rightPos in listRightParPos:\n tmp=[]\n for i in str:\n tmp.append(i)\n if(leftPos<rightPos+1):\n tmp.insert(leftPos,'(')\n tmp.insert(rightPos+1,')')\n tmpval=eval(''.join(tmp))\n ans=max(ans,tmpval)\n\nprint(ans)\n\t\t \t \t\t \t\t \t \t\t\t \t\t \t", "s = input()\r\nw = '1*' + s + '*1'\r\nn = len(w)\r\nres = eval(w)\r\n\r\nfor i in range(n):\r\n if w[i] == '*':\r\n for j in range(i + 1, n):\r\n if w[j] == '*':\r\n temp = eval(w[:i + 1] + '(' + w[i + 1: j] + ')' + w[j:])\r\n res = max(res, temp)\r\nprint(res)", "s=\"1*\"+input()+\"*1\"\r\na=eval(s)\r\nl=len(s)\r\nfor i in range(l):\r\n if s[i]=='*':\r\n for j in range(i+1,l):\r\n if s[j]=='*':\r\n a=max(a,eval(s[:i+1]+'('+s[i+1:j]+')'+s[j:]))\r\nprint(a)", "s = input()\r\n\r\nn = len(s)\r\nans = eval(s)\r\nfor i in range(0, n, 2) :\r\n for j in range(i, n, 2) :\r\n if (i == 0 or s[i - 1] == '*') and (j == n - 1 or s[j + 1] == '*') :\r\n ans = max(ans, eval(s[: i] + '(' + s[i : j + 1] + ')' + s[j + 1 :]))\r\nprint(ans)", "s = input()\nlb, rb = [], []\n\nn = len(s)\nlb.append(0)\nrb.append(n)\nfor i in range(n):\n if s[i] == '*':\n lb.append(i + 1)\n rb.append(i)\nans=0\nfor l in lb:\n for r in rb:\n if l >= r:\n continue\n t = s[:l] + '(' + s[l:r] + ')' + s[r:]\n ans=max(ans,eval(t))\nprint(ans)\n\n\t \t\t \t\t \t \t \t \t \t \t \t \t", "s = input()\r\na = [0]\r\nfor i in range(len(s)):\r\n if s[i] == '*':\r\n a.append(i+1)\r\na.append(len(s)+1)\r\nmaxRes = eval(s)\r\nfor i in a:\r\n for j in a:\r\n if j > i:\r\n maxRes = max(maxRes, eval(s[:i]+'('+s[i:j-1]+')'+s[j-1:]))\r\nprint(maxRes)", "s=input()\r\n\r\nidx=[-1]\r\n\r\nfor i in range(len(s)):\r\n\tif (s[i]=='*'): idx.append(i)\r\n\r\nidx.append(len(s))\r\n\r\nans=0\r\nfor i in range(len(idx)):\r\n\tfor j in range(i+1,len(idx)):\r\n\t\tans=max(ans,eval(s[:idx[i]+1]+\"(\"+s[idx[i]+1:idx[j]]+\")\"+s[idx[j]:]))\r\nprint(ans)", "a=\"1*\"+input()+\"*1\"\nans=eval(a)\nl=len(a)\nfor i in range(l):\n\tif a[i]=='*':\n\t\tfor j in range(i+1,l):\n\t\t\tif a[j]=='*':\n\t\t\t\tans=max(ans,eval(a[:i+1]+'('+a[i+1:j]+')'+a[j:]))\nprint(ans)\n\t\t \t\t\t \t \t \t\t \t\t\t \t\t \t\t", "s = input()\r\nn = len(s)\r\np = [-1] + [i for i in range(n) if s[i] == '*'] + [n]\r\nm = len(p)\r\nans = eval(s)\r\nfor i in range(m):\r\n for j in range(i + 1, m):\r\n a, b = p[i] + 1, p[j]\r\n t = s[:a] + '(' + s[a:b] + ')' + s[b:]\r\n ans = max(ans, eval(t))\r\nprint(ans)\r\n", "import sys, os\n\ndef solve():\n s = input()\n res = eval(s)\n for l in range(-1, len(s)):\n if s[l] == '*' or l == -1:\n for r in range(l + 2, len(s) + 1, 2):\n if r == len(s) or s[r] == '*':\n temp = s[:l + 1] + '(' + s[l + 1 : r] + ')' + s[r : ]\n try: res = max(res, eval(temp))\n except: pass\n print(res)\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 os.path.exists(\"test.txt\"): sys.stdin = open(\"test.txt\")\nsolve()", "S = input()\r\n\r\nans = 0\r\n\r\nfor ll in range( len( S ) ):\r\n if not ( ll == 0 or S[ ll - 1 ] == '*' ): continue\r\n for rr in range( ll + 1, len( S ) + 1, 1 ):\r\n if not ( rr == len( S ) or S[ rr ] == '*' ): continue\r\n ans = max( ans, eval( S[ : ll ] + \"(\" + S[ ll : rr ] + \")\" + S[ rr : ] ) )\r\n\r\nprint( ans )\r\n", "s=input()\r\nr=[0]\r\nt=s.find('*')\r\nwhile-1!=t:r+=[t];t=s.find('*',t+1)\r\nr+=[len(s)]\r\nR=0\r\nfor i in range(len(r)):\r\n\tfor j in range(i+1,len(r)):\r\n\t\ta=r[i];b=r[j];t=s[:a]\r\n\t\tif t:t+='*';a+=1\r\n\t\tt+='('+s[a:b]+')'+s[b:]\r\n\t\tR=max(R,eval(t))\r\nprint(R)", "e = input()\r\ne = \"1*\" + e + \"*1\"\r\nn = len(e)\r\n\r\nl = []\r\nfor i in range(n):\r\n if (e[i] == '*'): l.append(i)\r\n\r\nans = 0\r\nfor i in range(len(l)):\r\n for j in range(i + 1, len(l)):\r\n # print(e[0:l[i]], e[l[i]+1:l[j]], e[l[j]+1:n])\r\n # print(e[0:l[i]] + \"*(\" + e[l[i]+1:l[j]] + \")*\" + e[l[j]+1:n])\r\n ans = max(ans, eval(e[0:l[i]] + \"*(\" + e[l[i]+1:l[j]] + \")*\" + e[l[j]+1:n]))\r\nprint(ans)" ]

[ "l=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nn=input()\r\np=int(input())\r\npp=l.index(n)\r\nprint(l[(pp+p)%12])", "s=input()\r\nn=int(input())\r\nl=['January','February','March','April','May','June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nprint(l[(l.index(s) + n) % 12])\r\n", "mes = input()\r\nk = int(input())\r\n\r\n#convertir nuestro mes a número\r\ndef mes_a_numero(mes): #Joshua\r\n if mes=='January':\r\n numero=0\r\n if mes=='February':\r\n numero=1\r\n if mes=='March':\r\n numero=2\r\n if mes=='April':\r\n numero=3\r\n if mes =='May':\r\n numero=4\r\n if mes =='June':\r\n numero=5\r\n if mes =='July':\r\n numero=6\r\n if mes =='August':\r\n numero=7\r\n if mes =='September':\r\n numero=8\r\n if mes =='October':\r\n numero=9\r\n if mes =='November':\r\n numero=10\r\n if mes =='December':\r\n numero=11\r\n return numero\r\n\r\nmes = mes_a_numero(mes)\r\n\r\nrespuesta = (mes+k)%12\r\n\r\n#convertir nuestra respuesta a mes\r\ndef numero_a_mes(numero): #Gabriel\r\n if numero==0:\r\n mes='January'\r\n if numero==1:\r\n mes='February'\r\n if numero==2:\r\n mes='March'\r\n if numero==3:\r\n mes='April'\r\n if numero==4:\r\n mes='May'\r\n if numero==5:\r\n mes='June'\r\n if numero==6:\r\n mes='July'\r\n if numero==7:\r\n mes='August'\r\n if numero==8:\r\n mes='September'\r\n if numero==9:\r\n mes='October'\r\n if numero==10:\r\n mes='November'\r\n if numero==11:\r\n mes='December'\r\n return mes\r\n\r\nprint(numero_a_mes(respuesta))", "if __name__ == \"__main__\":\n months = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\n current = input()\n k = int(input())\n\n index = months.index(current)\n new = (index + k) % 12\n print(months[new])", "month=input()\r\nk=int(input())\r\nmonth_list=['January','February','March','April','May','June','July','August','September','October','November','December']\r\nfor i in range(12):\r\n if month_list[i]==month:\r\n index=i\r\n break\r\nlist_index=index+k+1\r\nif list_index>12:\r\n list_index%=12\r\nprint(month_list[list_index-1])", "current=input()\r\nn=int(input())\r\nnames=['January','February','March','April','May','June','July','August','September','October','November','December']\r\nindex=0\r\nfor i in range (len(names)):\r\n if names[i]==current:\r\n index=i+1\r\nvalue=index+n\r\nif value<=12:\r\n print(names[value-1])\r\nelse:\r\n value2=value%12\r\n print(names[value2-1])", "ar=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\ns=input()\r\nk=int(input())\r\nz=ar.index(s)\r\nv=(z+k)%12\r\nprint(ar[v])\r\n", "m = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\ns = input()\r\nk = int(input())\r\nfor i in range(12):\r\n if(s==m[i]):\r\n print(m[(i+k)%12])\r\n", "months = [\r\n 'January',\r\n 'February',\r\n 'March',\r\n 'April',\r\n 'May',\r\n 'June',\r\n 'July',\r\n 'August',\r\n 'September',\r\n 'October',\r\n 'November',\r\n 'December'\r\n]\r\n\r\ncurrent_month = input()\r\nrelease_delay = int(input())\r\n\r\ncurrent_month_index = months.index(current_month)\r\nrelease_month_index = (current_month_index + release_delay) % 12\r\nprint(months[release_month_index])\r\n", "str='January, February, March, April, May, June, July, August, September, October, November, December'\nlist=str.split(', ')\n#print(list[1])\nm=input()\nn=0\nfor i in range(len(list)):\n if m==list[i]:\n n=i\n break\nn2=int(input())\nn2=(n2+n)%12\nprint(list[n2])\n", "dict = {'January':1, 'February':2, 'March':3, 'April':4, 'May':5, 'June':6, 'July':7, 'August':8, \r\n 'September':9, 'October':10, 'November':11, 'December':12}\r\na = input()\r\nn = int(input())\r\nn = n%12\r\nn = n+dict[a]\r\nif n>12:\r\n\tn = n%12\r\nfor key,value in dict.items():\r\n if value == n:\r\n print(key)", "l=['January','February','March','April','May','June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nm = input()\r\nk = int(input())\r\n\r\nprint(l[(l.index(m) + k) % 12])", "s=input()\r\nk=int(input())\r\nl=[\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\nin1=l.index(s)\r\nk%=12\r\nwhile k>0:\r\n if in1<11:\r\n in1+=1\r\n else:\r\n in1=0\r\n k-=1\r\nprint(l[in1])\r\n", "a = input()\r\nn = int(input())\r\n\r\nmonts = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nvalue = monts.index(a) + 1 + n\r\nprint(monts[(value % 12) - 1])\r\n", "a=['January','February','March','April','May','June','July','August','September','October','November','December']\r\nb=input()\r\nfound=0\r\nc=int(input())\r\nz=a.index(b)\r\nzz=c%12\r\nprint(a[(z+zz)%12])\r\n", "months ='January,February,March,April,May,June,July,August,September,October,November,December'.split(',')\r\nprint(months[(months.index(input()) + int(input()))%12])", "x = ['', 'January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nm = input()\r\nn = int(input())\r\n\r\ni = (x.index(m) + n % 12) % 12\r\nif i == 0:\r\n i = 12\r\nprint(x[i])", "s = input()\r\nm = int(input())\r\nlst = [\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\nm -= 1\r\na = lst.index(s)\r\nprint(lst[a+m+1])\r\n", "months=['January','February','March','April','May',\r\n 'June','July','August','September','October',\r\n 'November','December']\r\nmonth=input()\r\nidx=months.index(month)\r\nto=(int(input())+idx)%12\r\nprint(months[to])\r\n", "months = \"January, February, March, April, May, June, July, August, September, October, November, December\"\nmonths = months.split(\", \")\nmonth = input()\nk = int(input())\nprint(months[(months.index(month) + k) % 12])\n", "month = input()\r\nk = int(input())\r\n\r\nmonths = {\r\n \"January\": \"February\",\r\n \"February\": \"March\",\r\n \"March\": \"April\",\r\n \"April\": \"May\",\r\n \"May\": \"June\",\r\n \"June\": \"July\",\r\n \"July\": \"August\",\r\n \"August\": \"September\",\r\n \"September\": \"October\",\r\n \"October\": \"November\",\r\n \"November\": \"December\",\r\n \"December\": \"January\"\r\n}\r\n\r\nresult_month = month\r\nfor i in range(k % 12):\r\n result_month = months[result_month]\r\n \r\nprint(result_month)", "\r\nl = ['January',\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\n\r\nm = input()\r\nn = int(input())\r\n\r\nprint(l[(l.index(m)+n)%12])\r\n\r\n\r\n", "month = input()\nk = int(input())\n\nmonths = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\nanswer = months[(months.index(month) + k) % len(months)]\nprint(answer)", "m = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November',\r\n 'December'];\r\nnums = {\r\n 'January': 0, 'February': 1, 'March': 2, 'April': 3, 'May': 4, 'June': 5, 'July': 6, 'August': 7, 'September': 8,\r\n 'October': 9, 'November': 10, 'December': 11};\r\na = input();\r\nk = int(input());\r\n\r\nprint(m[(nums[a]+k)%12]);\r\n", "Months = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\",\r\n \"December\"]\r\nCurrent_Month = input()\r\nMonths_remaining = int(input())\r\nRequired_Month = Months[(Months.index(Current_Month) + Months_remaining) % 12]\r\nprint(Required_Month)", "x=input()\r\nn=int(input())\r\nlookup=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\ni=lookup.index(x)\r\nif n%12==0:\r\n print(x)\r\nelse:\r\n if n<12:\r\n ans=(i+n)%12\r\n else:\r\n ans=(n%12+i)%12\r\n print(lookup[ans])", "months=['January','February','March','April','May','June','July','August','September','October','November','December']\r\n\r\nm=input()\r\nk=int(input())\r\nq=months.index(m)\r\nr=(q+k)%12\r\nprint(months[r])\r\n", "month = [\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\nn = input()\r\nfor i in range(12):\r\n if n == month[i]:\r\n sum = i\r\nk = int(input())\r\nsum = (sum + k) % 12\r\nprint(month[sum])", "d={\r\n 'January':0,\r\n 'February':1,\r\n 'March':2,\r\n 'April':3,\r\n 'May':4,\r\n 'June':5,\r\n 'July':6,\r\n 'August':7,\r\n 'September':8,\r\n 'October':9,\r\n 'November':10,\r\n 'December':11\r\n}\r\n\r\ne={\r\n 0:'January',\r\n 1:'February',\r\n 2:'March',\r\n 3:'April',\r\n 4:'May',\r\n 5:'June',\r\n 6:'July',\r\n 7:'August',\r\n 8:'September',\r\n 9:'October',\r\n 10:'November',\r\n 11:'December'\r\n}\r\n\r\nprint(e[(d[input()]+int(input()))%12])", "s=input()\r\nk=int(input())\r\na=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\nfor i in range(len(a)):\r\n if a[i]==s:\r\n num=i\r\nnum+=k\r\ni=0\r\ncount=0\r\nwhile i <=(len(a)):\r\n if num==count:\r\n print(a[i])\r\n break\r\n count+=1\r\n i+=1\r\n if i==12:\r\n i=0", "Months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November',\r\n 'December']\r\nM, N = input(), int(input())\r\nprint(Months[(Months.index(M) + N) % 12])\r\n# Hope the best for Ravens\r\n# Never give up\r\n", "m=['January','February','March','April','May','June','July','August','September','October','November','December','January','February','March','April','May','June','July','August','September','October','November','December','January','February','March','April','May','June','July','August','September','October','November','December','January','February','March','April','May','June','July','August','September','October','November','December','January','February','March','April','May','June','July','August','September','October','November','December','January','February','March','April','May','June','July','August','September','October','November','December','January','February','March','April','May','June','July','August','September','October','November','December','January','February','March','April','May','June','July','August','September','October','November','December','January','February','March','April','May','June','July','August','September','October','November','December','January','February','March','April','May','June','July','August','September','October','November','December',]\r\na=input()\r\nn=int(input())\r\nb=0\r\nfor i in range(len(m)):\r\n if a==m[i]:\r\n b=i\r\n break \r\nprint(m[b+n]) ", "class CodeforcesTask45ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.start_month = 0\r\n self.target_month = 0\r\n\r\n def read_input(self):\r\n self.start_month = input()\r\n self.target_month = int(input())\r\n\r\n def process_task(self):\r\n months = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\",\r\n \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\n current = months.index(self.start_month) + 1\r\n to_go = (current + self.target_month) % 12\r\n if not to_go:\r\n to_go = 12\r\n self.result = months[to_go - 1]\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask45ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-03 23:13:53\nLastEditTime: 2021-11-03 23:15:00\nDescription: Codecraft III\nFilePath: CF45A.py\n'''\n\n\ndef func():\n months = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\",\n \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\n s, k = input().strip(), int(input())\n return months[(months.index(s) + k) % 12]\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "month = input()\r\nmonthsLeft = int(input())\r\nallMonths= [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\nprint(allMonths[allMonths.index(month) + monthsLeft])", "x=str(input())\r\nx=x.replace(' ','')\r\nif x=='January':\r\n ans=1\r\nelif x=='February':\r\n ans=2\r\nelif x=='March':\r\n ans=3\r\nelif x=='April':\r\n ans=4\r\nelif x=='May':\r\n ans=5\r\nelif x=='June':\r\n ans=6\r\nelif x=='July':\r\n ans=7\r\nelif x=='August':\r\n ans=8\r\nelif x=='September':\r\n ans=9\r\nelif x=='October':\r\n ans=10\r\nelif x=='November':\r\n ans=11\r\nelif x=='December':\r\n ans=12\r\ns=int(input())\r\nans=ans+s\r\nif ans%12==1:\r\n print('January')\r\nelif ans%12==2:\r\n print('February')\r\nelif ans%12==3:\r\n print('March')\r\nelif ans%12==4:\r\n print('April')\r\nelif ans%12==5:\r\n print('May')\r\nelif ans%12==6:\r\n print('June')\r\nelif ans%12==7:\r\n print('July')\r\nelif ans%12==8:\r\n print('August')\r\nelif ans%12==9:\r\n print('September')\r\nelif ans%12==10:\r\n print('October')\r\nelif ans%12==11:\r\n print('November')\r\nelif ans%12==0:\r\n print('December')", "s = input()\r\nn = int(input())\r\n\r\narr = [\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\n\r\nidx = arr.index(s)\r\n\r\nnum = idx + n\r\n\r\nwant = num%12\r\n\r\nprint(arr[want])", "ar=[\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\ns=input()\r\nn=int(input())\r\nprint(ar[((ar.index(s)+n)%12)])\r\n\r\n", "d={'January': 0, 'February': 1, 'March': 2, 'April': 3, 'May': 4, 'June': 5, 'July': 6, 'August': 7, 'September': 8, 'October': 9, 'November': 10, 'December': 11}\r\nm=input()\r\nn=int(input())\r\nn += d[m]\r\nd={0:'January', 1:'February', 2:'March', 3:'April', 4:'May', 5:'June', 6:'July', 7:'August', 8:'September', 9:'October', 10:'November', 11:'December'}\r\nprint(d[n%12])", "first_month = input()\nn = int(input())\nmonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\n\ninitial = months.index(first_month)\nfinal_month = (initial + n) % 12\n\nprint(months[final_month])\n\t\t \t\t\t \t\t\t\t\t \t \t \t \t\t\t \t \t\t", "def main():\n current = input()\n n = int(input())\n\n currI = 0\n if current == \"February\":\n currI = 1\n elif current == \"March\":\n currI = 2\n elif current == \"April\":\n currI = 3\n elif current == \"May\":\n currI = 4\n elif current == \"June\":\n currI = 5\n elif current == \"July\":\n currI = 6\n elif current == \"August\":\n currI = 7\n elif current == \"September\":\n currI = 8\n elif current == \"October\":\n currI = 9\n elif current == \"November\":\n currI = 10\n elif current == \"December\":\n currI = 11\n\n currI += n\n nextI = currI % 12\n\n if nextI == 0:\n print(\"January\")\n elif nextI == 1:\n print(\"February\")\n elif nextI == 2:\n print(\"March\")\n elif nextI == 3:\n print(\"April\")\n elif nextI == 4:\n print(\"May\")\n elif nextI == 5:\n print(\"June\")\n elif nextI == 6:\n print(\"July\")\n elif nextI == 7:\n print(\"August\")\n elif nextI == 8:\n print(\"September\")\n elif nextI == 9:\n print(\"October\")\n elif nextI == 10:\n print(\"November\")\n elif nextI == 11:\n print(\"December\")\nmain()\n\t \t\t \t\t\t\t\t\t\t \t \t \t\t\t\t\t\t\t \t", "x = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\ns = input()\r\nn = int(input())\r\nf = x.index(s) + 1\r\nf += n\r\nf = (f % 12) - 1\r\nprint(x[f])", "year = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\nmonth = input()\r\nmonth_num = year.index(month)\r\nto = int(input())\r\n\r\nappear = (month_num + 1 + to) % 12\r\nif appear == 0:\r\n appear = 12\r\nprint(year[appear - 1])", "def getCorrespondingInt (n):\n if n == \"January\":\n return 0\n if n == \"February\":\n return 1\n if n == \"March\":\n return 2\n if n == \"April\":\n return 3\n if n == \"May\":\n return 4\n if n == \"June\":\n return 5\n if n == \"July\":\n return 6\n if n == \"August\":\n return 7\n if n == \"September\":\n return 8\n if n == \"October\":\n return 9\n if n == \"November\":\n return 10\n if n == \"December\":\n return 11\n\ndef getCorrespondingMonth (n):\n if n == 0:\n return \"January\"\n if n == 1:\n return \"February\"\n if n == 2:\n return \"March\"\n if n == 3:\n return \"April\"\n if n == 4:\n return \"May\"\n if n == 5:\n return \"June\"\n if n == 6:\n return \"July\"\n if n == 7:\n return \"August\"\n if n == 8:\n return \"September\"\n if n == 9:\n return \"October\"\n if n == 10:\n return \"November\"\n if n == 11:\n return \"December\"\n\ns = str(input())\nn = int(input())\nnS = getCorrespondingInt(s) + n\nprint(getCorrespondingMonth(nS%12))\n\n\t \t\t \t \t\t \t \t \t\t \t\t\t\t", "ano = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November',\n 'December']\nmes = input()\nfor i in range(12):\n if ano[i] == mes:\n mes = i\nk = int(input())\nk = k % 12\nmes += k\nif mes >= 12:\n mes -= 12\nprint(ano[mes])\n\n \t\t\t\t\t \t\t\t\t \t\t\t \t\t \t\t\t", "s = input()\r\nk = int(input())\r\nmon = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nindex = 0\r\nif s == 'January':\r\n a = 0\r\nif s == 'February':\r\n a = 1\r\nif s == 'March':\r\n a = 2\r\nif s == 'April':\r\n a = 3\r\nif s == 'May':\r\n a = 4\r\nif s == 'June':\r\n a = 5\r\nif s == 'July':\r\n a = 6\r\nif s == 'August':\r\n a = 7\r\nif s == 'September':\r\n a = 8\r\nif s == 'October':\r\n a = 9\r\nif s == 'November':\r\n a = 10\r\nif s == 'December':\r\n a = 11\r\nfor i in range(a,a+k):\r\n a+= 1\r\n if a > 11:\r\n a = 0\r\nprint(mon[a])", "bulan = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\nx = input()\r\nx = bulan.index(x)\r\ny = int(input())\r\nx = (x + y) % 12\r\n\r\nprint(bulan[x])\r\n", "s = input()\nk = int(input())\nli = ['January','February','March','April','May','June','July','August',\n'September','October','November','December']\nif s == 'January':\n n = 1\nif s == 'February':\n n = 2\nif s == 'March':\n n = 3\nif s == 'April':\n n = 4\nif s == 'May':\n n = 5\nif s == 'June':\n n = 6\nif s == 'July':\n n = 7\nif s == 'August':\n n = 8\nif s == 'September':\n n = 9\nif s == 'October':\n n = 10\nif s == 'November':\n n = 11\nif s == 'December':\n n = 12\nx = (n+k)% 12\nif x == 0:\n x = 12\nprint(li[x-1])\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Aug 30 22:57:47 2021\r\n\r\n@author: rupert\r\n\"\"\"\r\n\r\nmonth = ['January',\r\n 'February',\r\n 'March',\r\n 'April',\r\n 'May',\r\n 'June',\r\n 'July',\r\n 'August',\r\n 'September',\r\n 'October',\r\n 'November',\r\n 'December']\r\n\r\nm = input()\r\nk = int(input())\r\nm_int = month.index(m)\r\nnew_m_int = (m_int + k)%12\r\nprint(month[new_m_int])", "month=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\na=input()\nc=month.index(a)\nd=int(input())\nd+=c\nprint(month[d%12])\n\t \t\t\t \t \t \t\t \t\t \t\t\t\t\t\t \t\t \t\t", "month = input()\r\nn = int(input())\r\nd = {\"January\": 1, \"February\": 2, \"March\": 3, \"April\": 4, \"May\": 5, \"June\": 6, \"July\": 7, \"August\": 8, \"September\": 9,\r\n \"October\": 10, \"November\": 11, \"December\": 12}\r\nl = list(d.keys())\r\nans = (d[month] + n) % 12\r\nprint(l[ans-1])\r\n", "if __name__==\"__main__\":\r\n m=input()\r\n k=int(input())\r\n li=['January', 'February', 'March','April', 'May', 'June', 'July','August',\r\n 'September', 'October', 'November', 'December']\r\n r=k%12\r\n ind=li.index(m)\r\n if (ind+r)>11:\r\n r=r-(11-ind)\r\n print(li[r-1])\r\n else:\r\n print(li[(ind+r)])\r\n\r\n", "month=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\na=input()\r\nc=month.index(a)\r\nd=int(input())\r\nd+=c\r\nprint(month[d%12])", "a = input()\r\nb = int(input())\r\nc = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nf = c.index(a)\r\nh = '-'\r\nif b % 12 ==0:\r\n print(a)\r\nelse:\r\n while h == '-':\r\n if b == 0:\r\n h = '+'\r\n else:\r\n b-=1\r\n if f == len(c)-1:\r\n f = 0\r\n else:\r\n f+=1\r\n print(c[f])", "m=[\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\nmonth=input()\nn=int(input())\nz=0\nfor c in range(len(m)):\n if m[c]==month:\n z=c\n break\nz+=n\nif z>=12:\n z=z%12\nprint(m[z])\n", "import calendar\r\ns=input()\r\nn=int(input())\r\narr=[]\r\nfor i in range(1,13):\r\n a=calendar.month_name[i]\r\n arr.append(a)\r\nprint(arr[(arr.index(s)+n)%12])", "m = 'January, February, March, April, May, June, July, August, September, October, November, December'.split(', ')\r\ns = m.index(input())\r\nd = int(input())\r\nf = (s + d) % 12\r\nprint(m[f])", "dictionary={0:\"December\",1:\"January\",2:\"February\",3:\"March\",4:\"April\",5:\"May\",6:\"June\",7:\"July\",8:\"August\",9:\"September\",10:\"October\",11:\"November\"}\r\n\r\ndef get_key(dictionary,m):\r\n for i in range(len(dictionary)):\r\n if dictionary[i]==m:\r\n return i\r\n\r\ndef main(dictionary):\r\n m=input()\r\n k=int(input())\r\n m=get_key(dictionary,m)\r\n n=dictionary[(m+k)%12]\r\n return n\r\n\r\nprint(main(dictionary))", "string = input()\r\nn = int(input())\r\na = ['January', 'February', 'March', 'April', 'May', 'June', 'July', \"August\", 'September', 'October', 'November', 'December']\r\nprint(a[(a.index(string) + n) % 12])", "t = input()\r\nn = int(input())\r\ns = (\"January February March April May June July August September October November December\").split()\r\na =[]\r\nfor i in s:\r\n a.append(i)\r\nfor i in range(12):\r\n if a[i] == t:\r\n g = i\r\n res = a[(g+n)%12]\r\nprint(res)\r\n\r\n", "ns=[0,1,2,3,4,5,6,7,8,9,10,11]\r\nms=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nnm=dict(zip(ns,ms))\r\nmn=dict(zip(ms,ns))\r\ncurm=input()\r\nprint(nm[(mn[curm]+int(input()))%12])\r\n", "Mon=['January','February','March','April','May','June','July','August','September','October','November','December']*9\r\ns=input()\r\nd=int(input())\r\nMon=Mon[Mon.index(s):]\r\nprint(Mon[d])", "print(['January','February','March','April','May','June','July',\r\n 'August','September','October','November','December','January','February','March','April','May','June','July',\r\n 'August','September','October','November','December','January','February','March','April','May','June','July',\r\n 'August','September','October','November','December','January','February','March','April','May','June','July',\r\n 'August','September','October','November','December','January','February','March','April','May','June','July',\r\n 'August','September','October','November','December','January','February','March','April','May','June','July',\r\n 'August','September','October','November','December','January','February','March','April','May','June','July',\r\n 'August','September','October','November','December','January','February','March','April','May','June','July',\r\n 'August','September','October','November','December','January','February','March','April','May','June','July',\r\n 'August','September','October','November','December','January','February','March','April','May','June','July',\r\n 'August','September','October','November','December'][['January','February','March','April','May','June','July',\r\n 'August','September','October','November','December'].index(input())+int(input())])\r\n", "l = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nm = l.index(str(input()))+1\r\na = int(input())\r\na %= 12\r\nm+=a\r\nm-=12\r\nprint(l[m-1])", "months = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\",\"November\", \"December\"]\r\nmonths_assigned_to_values = dict(zip(months,range(1,len(months)+1)))\r\n#print(months_assigned_to_values)\r\ncurrent_month = (months_assigned_to_values.get(input()))\r\n#print(current_month)\r\nafter_month = ((int(input())+current_month) % 12)\r\n#print(after_month)\r\nprint(list(months_assigned_to_values.keys())[after_month-1])\r\n\r\n", "s= input()\r\nn= int(input())\r\nlist1 = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nlist2 =['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December','January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\ni = list1.index(s)\r\na = n%12\r\nprint(list2[i+a])\r\n", "month=input()\r\ncheck=0\r\nyear=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nn=int(input())\r\nfor i in range(len(year)):\r\n if year[i]==month:\r\n check=i\r\nif n>len(year):\r\n y=n//12\r\n m=n-(12*y)\r\nelse:\r\n m=n\r\nu=check+m\r\nif u>=12:\r\n p=u\r\n u=u//12\r\n diff=p-(12*u)\r\n ans=year[diff]\r\nelse:\r\n ans = year[u]\r\nprint(ans)", "a=['January','February','March','April','May','June','July','August','September','October','November','December']\r\ns=input()\r\nn=int(input())\r\nn=n%12\r\nn=(n+a.index(s))%12\r\nprint(a[n])", "# LUOGU_RID: 106481994\na=input()\r\nl1=[\"January\",\"February\",\"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\na=l1.index(a);\r\nb=int(input())\r\ns=a+b\r\ns=s%12\r\nprint(l1[s])", "s=input()\r\nk=int(input())\r\nwhile k>=12:\r\n\tk-=12\r\nl=[\"January\", \"February\", \"March\", \"April\",\"May\", \"June\", \"July\",\"August\",\"September\", \"October\",\"November\",\"December\"]\r\n# print(l[l.index(s)+k])\r\n\r\nd=l.index(s)+k\r\nif d>=12:\r\n\td-=12\r\nprint(l[d])", "# Define the list of months\r\nmonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\n\r\n# Input\r\ncurrent_month = input().strip()\r\nk = int(input())\r\n\r\n# Find the current month's position\r\ncurrent_month_index = months.index(current_month)\r\n\r\n# Calculate the position of the month when Codecraft III will appear\r\nresult_index = (current_month_index + k) % 12\r\n\r\n# Find the month at the result position\r\nresult_month = months[result_index]\r\n\r\n# Print the result\r\nprint(result_month)\r\n\r\n\r\n", "n=('January','February','March','April','May','June','July','August','September','October','November','December')*10 \r\ns=input()\r\nx=int(input())\r\ni=0\r\nfor i in range(120):\r\n i=i+1\r\n if(n[i]==s):\r\n print(n[i+x])\r\n break", "a=input()\r\nb=int(input())\r\nl=['January','February','March','April','May','June','July','August','September','October','November','December']\r\nfor i in range(12):\r\n if a==l[i]:\r\n c=i\r\nd=(c+b)%12\r\nprint(l[d])\r\n", "month = ['January', 'February', 'March', 'April', 'May', 'June',\r\n 'July', 'August', 'September', 'October', 'November', 'December']\r\nm = input()\r\nnum = int(input())\r\nwhile num > 12:\r\n num -= 12\r\nnm = 0\r\nfor i in range(len(month)):\r\n if month[i] == m:\r\n nm = i\r\nprint(month[(nm + num) - 12])", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nl = ['January','February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\ns = l.index(input()[:-1]) + int(input())\r\nif s >= 12:\r\n s %= 12\r\nprint(l[s])", "a=[\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\"]\r\nb=input()\r\nc=int(input())\r\nprint(a[(a.index(b)+c)%12])", "\r\n\r\nmeses = ['January','February','March','April',\r\n 'May','June','July','August',\r\n 'September','October','November','December']\r\nmes_actual = None\r\nmes_salida = None\r\n\r\nnombre_mes_actual = input()\r\nk = int(input())\r\n\r\nfor i in range(12):\r\n if nombre_mes_actual == meses[i]:\r\n mes_actual = i\r\n\r\nmes_salida = (mes_actual + k) % 12\r\nprint(meses[mes_salida])", "n = input()\r\na = int(input())\r\nMon = ['January', 'February', 'March', 'April', 'May','June', 'July', 'August', 'September', \"October\", \"November\", \"December\"]\r\nind = Mon.index(n)\r\nadd = ind+1+a\r\nper = (add%12)-1\r\nprint(Mon[per])\r\n", "a=input().strip()\r\nm=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nn=int(input())\r\nk=m.index(a)\r\nk+=n\r\nprint(m[k%12])\r\n", "def main():\r\n current_month = input()\r\n k = int(input())\r\n months=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n x = 0 #to check index of current_month in months list\r\n for i in range (len(months)):\r\n if current_month == months[i]:\r\n x = i\r\n break\r\n if x+k > 11:\r\n print(months[(x+k)%12])\r\n else:\r\n print(months[x+k])\r\nmain()", "a=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\ndic={}\r\nfor i in range(len(a)):\r\n dic[ a[i] ]=i\r\n\r\ns=input()\r\nn=int(input())\r\nprint(a[ (dic[s]+n)%12 ])", "\r\ndef main():\r\n m = \"January, February, March, April, May, June, July, August, September, October, November, December\".split(\", \")\r\n cm = input()\r\n k = int(input())\r\n for i in range(len(m)):\r\n if m[i] == cm:\r\n print(m[(i + k) % len(m)])\r\n return\r\n\r\nmain()", "import calendar\r\na=input()\r\nb=[calendar.month_name[i] for i in range(13)][1:]\r\nprint(b[(int(input())+b.index(a))%12])", "import sys\n#input = sys.stdin.readline\n\ns = input()\nn = int(input())\nmonths = \"January, February, March, April, May, June, July, August, September, October, November, December\".replace(\",\", \"\").split()\nprint(months[(months.index(s) + n) % 12])\n", "a = ['January','February','March','April',\r\n 'May', 'June', 'July', 'August', 'September',\r\n 'October', 'November', 'December']\r\nn = input()\r\nk = int(input())\r\nq = k%12\r\nl = ((a.index(n))+q)%12\r\nprint(a[l])", "months = ['January', 'February', 'March', 'April', 'May', 'June', 'July']\r\nmonths += ['August', 'September', 'October', 'November', 'December']\r\nmonth = str(input())\r\nn = int(input())\r\nindex = months.index(month) + n\r\nprint(months[index % 12])\r\n", "month = ['January', 'February', 'March','April', 'May', 'June', 'July', 'August', 'September', 'October','November', 'December']\n\ncur = input()\n\nleft = int(input())\n\nind = 0\nfor i in range(12):\n\tif month[i] == cur:\n\t\tind = i\n\t\tbreak\nfor i in range(left):\n\tind += 1\n\tif ind == 12:\n\t\tind = 0\n\nprint(month[ind])\n\t\n", "a = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\n\r\nm = input().rstrip()\r\nk = int(input())\r\n\r\ni = 0\r\nwhile m != a[i]:\r\n i += 1\r\n\r\nprint(a[(i + k) % 12])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "m = input()\r\nt = int(input())\r\n\r\na = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\nm = a.index(m)\r\n\r\nfor i in range(t):\r\n if m == 11:\r\n m = 0\r\n else:\r\n m += 1\r\n \r\nprint(a[m])", "months = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\ns = input()\r\nindex = months.index(s) + 1\r\nn = int(input())\r\ntrun = n%12\r\nif((index + trun) > 12):\r\n print(months[index+trun-13])\r\nelse:\r\n print(months[index+trun-1])", "arr=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\ni=input()\r\nn=int(input())\r\nprint(arr[(arr.index(i)+n)%12])", "arr=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\nn=input()\r\nm=int(input())\r\nsum1=0\r\nsum1=(arr.index(n)+1)+(m%12)\r\nif sum1>12:\r\n sum1=sum1-12\r\n print(arr[sum1-1])\r\nelse:\r\n print(arr[sum1-1])\r\n", "l = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\ns = str(input())\r\nx = l.index(s)\r\nn = int(input())\r\nn = n%12\r\nif x+n>=12:\r\n ans = (x+n) -12\r\nelse:\r\n ans = x+n\r\nprint(l[ans])", "from collections import deque\r\nfrom collections import OrderedDict\r\nimport math\r\n \r\nimport sys\r\nimport os\r\nfrom io import BytesIO\r\nimport threading\r\nimport bisect\r\n \r\n \r\nimport heapq\r\n\r\n#sys.stdin = open(\"F:\\PY\\\\test.txt\", \"r\")\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n\r\nMoth = [\r\n 'January', \r\n 'February', \r\n 'March', \r\n 'April', \r\n 'May', \r\n 'June', \r\n 'July', \r\n 'August', \r\n 'September', \r\n 'October', \r\n 'November', \r\n 'December',\r\n]\r\n\r\n#print(Moth[(10+(24%12))%12])\r\n#sys.exit(0)\r\ns = input()\r\nn = int(input())\r\nfor i in range(len(Moth)):\r\n if s==Moth[i]:\r\n print(Moth[(i+(n%12))%12])\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", "#----------------------------\n# Matheus de Souza Oliveira |\n# RA: 203407 |\n#----------------------------\n\ncurrentMonth = input()\nk = int(input())\n\nmonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\n\n\nindex = months.index(currentMonth)\n\nanswer = (index + k)%12\n\nprint(months[answer])\n \t\t\t\t\t \t\t \t\t \t\t \t\t \t\t\t\t\t \t \t", "m=str(input())\r\nn=int(input())\r\nlist=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\nfor i in range(len(list)):\r\n if list[i]==str(m):\r\n a=(i+1)\r\nn_m=a+n\r\nsal=(n_m)-12*(n_m//12)\r\nif sal==0:\r\n sal=(12)\r\nprint(list[sal-1])\r\n", "m=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September',\n'October', 'November', 'December']\n\ns=input()\nk=int(input())\nprint(m[(k+ m.index(s))%12])\n\n\t \t\t \t\t\t\t\t \t \t\t \t \t\t \t", "s, month = input(), int(input())\r\n\r\nmap1 = {\r\n 0 : \"January\",\r\n 1 : \"February\",\r\n 2 : \"March\",\r\n 3 : \"April\",\r\n 4 : \"May\",\r\n 5 : \"June\",\r\n 6 : \"July\",\r\n 7 : \"August\",\r\n 8 : \"September\",\r\n 9 : \"October\",\r\n 10 : \"November\",\r\n 11 : \"December\",\r\n}\r\n\r\nmap2 = {\r\n \"January\" : 0,\r\n \"February\" : 1,\r\n \"March\" : 2,\r\n \"April\" : 3,\r\n \"May\" : 4,\r\n \"June\" : 5,\r\n \"July\" : 6,\r\n \"August\" : 7,\r\n \"September\": 8,\r\n \"October\" : 9,\r\n \"November\" : 10,\r\n \"December\" : 11\r\n}\r\n\r\nvalue = (map2[s] + month) % 12\r\nprint(map1[value])", "current_month = input()\nno_of_months = int(input())\n\nmonths = [\"January\",\n \"February\", \n \"March\",\n \"April\", \"May\",\n \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\n\ncompetition_month = (months.index(current_month) + no_of_months) % 12\n\nprint(months[competition_month])", "if __name__ == '__main__':\r\n\td = ['December','January','February','March','April','May','June','July','August','September','October','November']\r\n\tprint(d[(d.index(input())+int(input()))%12])", "meses = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\nmes = input()\r\nini = meses.index(mes) + 1\r\n\r\nfim = int(input())\r\n\r\nans = (ini + fim) % 12\r\n\r\nprint(meses[ans-1])", "english_names = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\na = input()\nk = int(input())\nindex_a = english_names.index(a)\nb = (k + index_a) % 12\nprint(english_names[b])\n \t\t\t\t\t \t\t \t \t\t\t\t \t\t\t \t\t \t \t", "ar = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'];s = input();k = int(input());print(ar[(ar.index(s) + k) % 12])", "month = input()\r\ntime = int(input())\r\narr = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\nact_time = time % 12\r\nindex = arr.index(month) \r\n\r\nans = index + act_time\r\nif ans >= 12:\r\n ans = ans - 12\r\nprint(arr[ans])", "def codecraft_iii():\r\n month=input()\r\n n=int(input())\r\n calendar={\"January\":1,\"February\":2,\"March\":3,\"April\":4,\"May\":5,\"June\":6,\"July\":7,\"August\":8,\"September\":9,\"October\":10,\"November\":11,\"December\":12}\r\n print(list(calendar.keys())[((calendar[month]+n)%12)-1])\r\ncodecraft_iii()", "months=[\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\n\r\ns=input()\r\nb=int(input())\r\n\r\nn=months.index(s)+1\r\nn+=b\r\nn=n%12\r\nprint(months[n-1])", "m='January February March April May June July August September October November December'.split()\r\nc=input()\r\nn=int(input())\r\nprint(m[(m.index(c)+n)%12])\r\n", "s = input()\nk = int(input())\nm = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\n\n\nif m.index(s) + k < 11:\n print(m[m.index(s) + k])\nelse:\n t = m.index(s) + k\n while t > 11:\n t = t - 12\n print(m[t])", "import sys \n\nl = sys.stdin.readlines()\ncurrent = l[0].replace('\\n','')\nk = int(l[1].replace('\\n',''))\nmeses = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\nindex = meses.index(current)\nprint(meses[(index + k) % 12])\n\t \t \t \t\t\t \t\t \t\t\t \t \t\t \t\t", "l =['January', 'February', 'March', 'April', 'May', 'June', 'July','August', 'September', 'October', 'November', 'December']\r\ncm = input()\r\nk = int(input())\r\nx = l.index(cm)\r\nprint(l[(x+k)%12])\r\n\r\n\r\n", "#ROUNIAAUDI\r\nmonths=[\"January\", \"February\", \"March\", \"April\", \"May\",\"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\noldMonth=input()\r\nnum1=months.index(oldMonth)\r\nnum2=int(input())\r\nans=num2\r\nans1=num1+num2\r\n#print(ans1)\r\ne=\"\"\r\nif num2==0:\r\n print(oldMonth)\r\nelif ans1>=11 :\r\n ans=11-num1\r\n num2-=ans\r\n while num2>12:\r\n num2-=12\r\n else :\r\n print(months[num2-1])\r\nelse:\r\n print(months[ans1])\r\n\r\n", "January,February,March,April,May,June,July,August,September,October,November,December=0,1,2,3,4,5,6,7,8,9,10,11;print(['January','February','March','April','May','June','July','August','September','October','November','December'][(eval(input())+int(input()))%12])", "m = \"January, February, March, April, May, June, July, August, September, October, November, December\"\nm = [\"December\"] + m.split(\", \")\ns = m.index(input())\nprint(m[(s + int(input())) % 12])\n", "# LUOGU_RID: 132912315\nn = input()\r\nK = int(input())\r\ns = [\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\nprint(s[(s.index(n)+K)%12])", "m=str(input())\r\nk=int(input())\r\nlst=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nprint(lst[(lst.index(m)+k)%12])", "s=input()\r\nk=int(input())\r\na=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nfor i in range(len(a)):\r\n if a[i]==s:\r\n for j in range(k):\r\n if i==11:\r\n i=0\r\n else:\r\n i+=1\r\n print(a[i])\r\n \r\n ", "s = input()\r\nk = int(input())\r\nl = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\nprint(l[(l.index(s)+k)%12])", "s = input()\r\nnum = int(input())%12\r\n\r\nmonths = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December', 'January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\npast = False\r\nfor i, mon in enumerate(months):\r\n if mon == s:\r\n past = True\r\n x = i\r\n\r\n if past and i - x == num:\r\n print(mon)\r\n exit()\r\n", "#https://codeforces.com/problemset/problem/45/A\ns=input()\nmonths=[\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\nn=int(input())\nidx=months.index(s)\nidx+=n;\nidx%=12\nprint(months[idx])\n", "month = \"January, February, March, April, May, June, July, August, September, October, November, December\".split(\", \")\r\nnow = input()\r\ndelay = int(input())\r\nprint(month[(month.index(now) + delay) % 12])", "m='January February March April May June July August September October November December'.split()\nc=input()\nn=int(input())\nprint(m[(m.index(c)+n)%12])\n\n \t\t\t\t\t \t\t \t\t\t\t\t\t \t\t \t\t \t\t\t\t", "months=['January','February','March','April','May','June','July','August','September','October','November','December']\r\nmonth_now=input()\r\nmonths_later=int(input())\r\nfor i in range(12):\r\n if month_now == months[i]:\r\n month_now=i\r\nprint(months[(month_now + (months_later%12))%12])\r\n", "months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November',\r\n 'December']\r\nmonth, skip = input(), int(input())\r\nyears = int(skip / 12)\r\n\r\nremaining = skip - years * 12\r\nif remaining + months.index(month)<=11:\r\n print(months[remaining+months.index(month)])\r\nelse:\r\n print(months[remaining+months.index(month)-12])", "months = {'January':0, 'February':1, 'March':2, 'April':3, 'May':4, 'June':5, 'July':6, 'August':7, 'September':8, 'October':9, 'November':10, 'December':11}\nmonth = str(input())\nadd = int(input())\n\nout = {v:k for k,v in months.items()}\n\nval = months[month]\nnew_val = (val+add) % 12\nprint(out[new_val])\n", "s = input()\r\nn = int(input())\r\nmonth = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nidx = month.index(s)\r\nidx = (idx+n)%12\r\nprint(month[idx])", "l=['January','February','March','April','May','June','July','August','September','October','November','December']\r\ns=input()\r\nn=int(input())\r\nx=0\r\nfor i in range(12):\r\n if(s==l[i]):\r\n x=i\r\nprint(l[(x+n)%12])\r\n", "month = input()\nadd = int(input())\n\nmonth_map = {'January':0,'February':1,'March':2,\n 'April':3,'May':4, 'June':5, 'July':6,\n 'August':7,'September':8,'October':9,\n 'November':10,'December':11}\n\ninv_map = dict()\nfor k,v in month_map.items():\n inv_map[v] = k\n\nresult = inv_map[(month_map[month] + add) % 12]\nprint(result)\n", "l=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\nd={}\r\nfor i in range(12):\r\n d[l[i]]=i+1\r\ns=input()\r\nn=int(input())\r\nans_no = (d[s]+n)%12\r\nprint(l[ans_no-1]) #print December if ans_no is 0.\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 18 20:47:11 2020\r\n\r\n@author: PREET MODH\r\n\"\"\"\r\n\r\n\r\ns=input()\r\nk=int(input())\r\na=['January','February','March','April','May','June','July','August','September','October','November','December']\r\nind=a.index(s)+1\r\ni=(ind+k)%12\r\nprint(a[i-1])", "months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\ncurrent_month = input() # Read the name of the current month\r\nk = int(input()) # Read the number of months left\r\n\r\ncurrent_month_index = months.index(current_month) # Get the index of the current month\r\n\r\n# Calculate the index of the month when Codecraft III will appear\r\ntarget_month_index = (current_month_index + k) % 12\r\n\r\nprint(months[target_month_index]) # Print the name of the target month\r\n", "if __name__ == '__main__':\n m = input()\n k = int(input())\n meses = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\n\n k = k % 12\n k = k + meses.index(m)\n k = k % 12\n print(meses[k])\n\t \t\t \t\t \t\t \t\t\t \t\t\t \t\t\t\t\t\t", "import enum\r\n\r\nclass Month(enum.Enum):\r\n January = 1\r\n February = 2\r\n March = 3\r\n April = 4\r\n May = 5\r\n June = 6\r\n July = 7\r\n August = 8\r\n September = 9\r\n October = 10\r\n November = 11\r\n December = 12\r\n\r\n\r\ncurrent_month = input()\r\nremain = int(input())\r\n\r\nsum = Month[current_month].value + remain\r\nif sum > 12:\r\n difference = sum - 12\r\n while difference > 12:\r\n difference = difference - 12\r\n \r\n print(Month(difference).name)\r\nelse:\r\n print(Month(sum).name)", "def solve():\n meses = {\"January\":1, \"February\":2, \"March\":3, \"April\":4, \"May\":5, \"June\":6, \"July\":7, \"August\":8, \"September\":9, \"October\":10, \"November\":11, \"December\":12}\n dia = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\n mes = input()\n d = int(input())\n sum = meses[mes] + d\n pos = sum%12\n print(dia[pos-1])\n\n \nsolve()\n\n \t\t\t \t\t\t \t \t \t\t \t \t \t\t\t\t\t", "s = input()\r\nk = int(input())\r\nif s == 'January':\r\n s = 1\r\nelif s == 'February':\r\n s = 2\r\nelif s == 'March':\r\n s = 3\r\nelif s == 'April':\r\n s = 4\r\nelif s == 'May':\r\n s = 5\r\nelif s == 'June':\r\n s = 6\r\nelif s == 'July':\r\n s = 7\r\nelif s == 'August':\r\n s = 8\r\nelif s == 'September':\r\n s = 9\r\nelif s == 'October':\r\n s = 10\r\nelif s == 'November':\r\n s = 11\r\nelif s == 'December':\r\n s = 12\r\ns = (s+k) % 12\r\n\r\nif s == 1:\r\n s = 'January'\r\nelif s == 2:\r\n s = 'February'\r\nelif s == 3:\r\n s = 'March'\r\nelif s == 4:\r\n s = 'April'\r\nelif s == 5:\r\n s = 'May'\r\nelif s == 6:\r\n s = 'June'\r\nelif s == 7:\r\n s = 'July'\r\nelif s == 8:\r\n s = 'August'\r\nelif s == 9:\r\n s = 'September'\r\nelif s == 10:\r\n s = 'October'\r\nelif s == 11:\r\n s = 'November'\r\nelif s == 0:\r\n s = 'December'\r\nprint(s)\r\n", "m=input()\r\nn=int(input())\r\nlist=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\ni=list.index(m)\r\nn%=12\r\ni+=n\r\ni%=12\r\nprint(list[i])", "calendar_name = {\n \"January\": 1,\n \"February\": 2,\n \"March\": 3,\n \"April\": 4,\n \"May\": 5,\n \"June\": 6,\n \"July\": 7,\n \"August\": 8,\n \"September\": 9,\n \"October\": 10,\n \"November\": 11,\n \"December\": 12\n}\n\ncalendar_number = {\n 1: \"January\",\n 2: \"February\",\n 3: \"March\",\n 4: \"April\",\n 5: \"May\",\n 6: \"June\",\n 7: \"July\",\n 8: \"August\",\n 9: \"September\",\n 10: \"October\",\n 11: \"November\",\n 12: \"December\"\n}\n\nmonth = input()\nk = int(input())\n\nresult = (k + calendar_name[month]) % 12\n\nif result == 0:\n result = 12\n\nprint(calendar_number[result])\n\n\n \t \t\t \t\t \t \t \t\t\t\t\t \t\t \t\t\t", "a=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\ns=input()\r\nk=int(input())\r\nk=k-((k//12)*12)\r\nr=a.index(s)+k\r\nr=r-((r//12)*12)\r\nprint(a[r])\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nd = {\"January\": 1, \"February\": 2, \"March\": 3, \"April\": 4, \"May\": 5, \"June\": 6, \"July\": 7, \"August\": 8, \"September\": 9, \"October\": 10, \"November\": 11, \"December\": 12}\r\nmonth = input().strip()\r\nk = int(input())\r\nprint(list(d.items())[(d[month]+k) % 12-1][0])", "months = [\r\n [1, \"January\"], \r\n [2, \"February\"], \r\n [3, \"March\"], \r\n [4, \"April\"], \r\n [5, \"May\"], \r\n [6, \"June\"], \r\n [7, \"July\"], \r\n [8, \"August\"], \r\n [9, \"September\"], \r\n [10, \"October\"], \r\n [11, \"November\"], \r\n [12, \"December\"]\r\n]\r\ncurrent_month = input()\r\nk = int(input())\r\n\r\ndef find_month(current, k):\r\n for month in months:\r\n for val in month:\r\n if val == current:\r\n x = (month[0]+k) % 12\r\n \r\n return months[x-1][1]\r\n \r\n\r\n\r\nprint(find_month(current_month, k))", "l=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\",\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\ni=l.index(input())\r\nk=int(input())%12\r\nprint(l[i+k])", "x=['January','February','March','April','May','June','July','August','September','October','November','December']\r\nn=input()\r\nz=int(input())\r\nfor i in range(12):\r\n\tif x[i]==n:\r\n\t\tprint(x[((i+1+z)%12)-1])\r\n\t\tbreak", "months = 'January, February, March, April, May, June, July, August, September, October, November, December'.split(', ')\n\ns = input()\nd = int(input())\n\nprint(months[(months.index(s) + d) % 12])\n\t \t\t\t \t \t \t\t \t \t\t\t\t", "list = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November',\r\n 'December']\r\ns = input()\r\nk = int(input())\r\nindex = list.index(s)\r\nres=(k+index)%12\r\nprint(list[res])", "monthNow = input()\nk = int(input())\n\nmonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\n\ns = (months.index(monthNow) + k) % 12\n\nprint(months[s])\n\n \t\t \t\t \t\t\t \t \t \t \t\t\t\t\t\t", "# LUOGU_RID: 131517464\nmonth=['January','February','March','April','May','June','July','August','September','October','November','December']\r\ns=input()\r\nk=int(input())\r\nfor i in range(12):\r\n if month[i]==s:\r\n print(month[(i+k)%12])", "mes = input()\r\nif mes == \"January\":\r\n mes = 0\r\nif mes == \"February\":\r\n mes = 1\r\nif mes == \"March\":\r\n mes = 2\r\nif mes == \"April\":\r\n mes = 3\r\nif mes == \"May\":\r\n mes = 4\r\nif mes == \"June\":\r\n mes = 5\r\nif mes == \"July\":\r\n mes = 6\r\nif mes == \"August\":\r\n mes = 7\r\nif mes == \"September\":\r\n mes = 8\r\nif mes == \"October\":\r\n mes = 9\r\nif mes == \"November\":\r\n mes = 10\r\nif mes == \"December\":\r\n mes = 11\r\n\r\nmeses_hasta_salida = int(input())\r\n\r\nlanzamiento = mes + meses_hasta_salida\r\nlanzamiento = lanzamiento % 12\r\n\r\n\r\nif lanzamiento == 0:\r\n mes = \"January\"\r\nif lanzamiento == 1:\r\n mes = \"February\"\r\nif lanzamiento == 2:\r\n mes = \"March\"\r\nif lanzamiento == 3:\r\n mes = \"April\"\r\nif lanzamiento == 4:\r\n mes = \"May\"\r\nif lanzamiento == 5:\r\n mes = \"June\"\r\nif lanzamiento == 6:\r\n mes = \"July\"\r\nif lanzamiento == 7:\r\n mes = \"August\"\r\nif lanzamiento == 8:\r\n mes = \"September\"\r\nif lanzamiento == 9:\r\n mes = \"October\"\r\nif lanzamiento == 10:\r\n mes = \"November\"\r\nif lanzamiento == 11:\r\n mes = \"December\"\r\n\r\nprint(mes)", "# LUOGU_RID: 113130013\na=['January','February','March','April','May','June','July','August','September','October','November','December']*10\nprint(a[a.index(input())+int(input())])", "months={\n 0:\"December\",\n 1:\"January\",\n 2:\"February\",\n 3:\"March\",\n 4:\"April\",\n 5:\"May\",\n 6:\"June\",\n 7:\"July\",\n 8:\"August\",\n 9:\"September\",\n 10:\"October\",\n 11:\"November\",\n 12:\"December\",\n}\n\ns_month = input()\nn_month = int(input())\n\nfor i in range (1,13):\n if(months[i]==s_month):\n x = i;\n \nans = (x+n_month)%12\nprint(months[ans]) \n \t\t \t\t \t\t \t\t \t \t\t\t\t \t", "#Problema H\n\na = input()\nb = int(input())\nb = b%12\nc=0\n\nif (a==\"January\"):\n c=0\nif (a==\"February\"):\n c=1\nif (a==\"March\"):\n c=2\nif (a==\"April\"):\n c=3\nif (a==\"May\"):\n c=4\nif (a==\"June\"):\n c=5\nif (a==\"July\"):\n c=6\nif (a==\"August\"):\n c=7\nif (a==\"September\"):\n c=8\nif (a==\"October\"):\n c=9\nif (a==\"November\"):\n c=10\nif (a==\"December\"):\n c=11\n\nc = c+b\nc = c%12\n\nif (c==0):\n print(\"January\")\nif (c==1):\n print(\"February\")\nif (c==2):\n print(\"March\")\nif (c==3):\n print(\"April\")\nif (c==4):\n print(\"May\")\nif (c==5):\n print(\"June\")\nif (c==6):\n print(\"July\")\nif (c==7):\n print(\"August\")\nif (c==8):\n print(\"September\")\nif (c==9):\n print(\"October\")\nif (c==10):\n print(\"November\")\nif (c==11):\n print(\"December\")\n\n\t \t \t \t \t\t \t \t \t \t \t\t", "#loser707\r\nmonth=['January','February','March','April','May','June','July','August','September','October','November','December']\r\ncurrent_month=input()\r\nmonths_left=int(input())\r\na=(month.index(current_month)+1+months_left)%12-1\r\nprint(month[a])\r\n", "n = input()\r\nx = int(input())\r\nk = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\nl = k.index(n)\r\nm = x+l\r\no = (m%12)+1\r\nprint(k[o-1])", "initial_month=input()\nmonths=int(input())\nname_to_number=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\ni=0\nwhile name_to_number[i]!=initial_month:\n i+=1\nprint(name_to_number[(i+months)%12])\n \t\t\t \t \t\t\t\t\t\t \t\t \t\t\t \t", "def codecraft():\n m = input()\n n = int(input())\n array = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\n array = array + array + array + array + array + array + array + array + array\n\n index = array.index(m)\n print(array[index + n])\n\n\nif __name__ == \"__main__\":\n codecraft()\n\n \t\t \t\t \t\t \t\t\t\t\t \t \t \t \t\t\t\t\t", "geys = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nahhhahaha = input()\r\nkaka = int(input())\r\nxz = geys.index(ahhhahaha)\r\nprint(geys[(xz+kaka)%12])\r\n\t \t \t", "month = input()\nk = int(input())\nall_months = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\ncurr = all_months.index(month)\nans = (k + curr) % 12\nprint(all_months[ans])", "s=str(input())\r\nc=int(input())\r\na= ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nd=(c+a.index(s))%12\r\nprint(a[d])", "arr = \"January, February, March, April, May, June, July, August, September, October, November, December\".split(', ')\r\n\r\ns = input()\r\npos = arr.index(s)\r\n\r\n\r\n\r\nk = int(input())\r\npos = (pos+k)%12\r\n\r\n\r\nprint(arr[pos])", "n=input()\r\na=int(input())\r\nb=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nprint(b[(b.index(n)+a)%12])\r\n", "l=['January','February','March','April','May','June','July','August','September','October','November','December']\r\nl=l+l \r\ns=input()\r\nn=int(input())\r\nx=l.index(s)+(n%12)\r\nprint(l[x])", "# define the names of the months in an array\r\nmonth_names = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\n\r\n# read the name of the current month from the input\r\ncurrent_month = input()\r\n\r\n# read the number of months till Codecraft III from the input\r\nk = int(input())\r\n\r\n# find the index of the current month in the month_names array\r\ncurrent_month_index = month_names.index(current_month)\r\n\r\n# calculate the index of the month in which Codecraft III will appear\r\ncodecraft_month_index = (current_month_index + k) % 12\r\n\r\n# print the name of the month in which Codecraft III will appear\r\nprint(month_names[codecraft_month_index])\r\n", "lis=[\"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\"]\r\ns=input()\r\nn = int(input())\r\nc=0\r\nfor i in lis:\r\n if i==s:\r\n break\r\n c+=1\r\nprint(lis[(c+n)%12]) ", "lst, s = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December'], input()\r\nfor x in range(12):\r\n if lst[x] == s:\r\n n = (x + 1 + int(input())) % 12 \r\n print(lst[-1]) if n == 0 else print(lst[n - 1])", "'''\r\ns = input()\r\nn = int(input())\r\n\r\narr = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\",\r\n \"October\", \"November\", \"December\"]\r\nwhile n > 12:\r\n n -= 12\r\nm = arr.index(s)\r\n\r\nif m + n >= 12:\r\n print(arr[m + n - 12])\r\nelse:\r\n print(arr[m + n])\r\n'''\r\ncurrent, n = input(), int(input())\r\n# 0 1 2 3 4 5 6 7 8 9 10 11\r\nmonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\ncurrInd = months.index(current)\r\nind = (currInd + n) % 12\r\nprint(months[ind])\r\n", "a=input()\nb={\"January\":1,\"February\":2,\"March\":3,\"April\":4,\"May\":5,\"June\":6,\"July\":7,\"August\":8,\"September\":9,\"October\":10,\"November\":11,\"December\":12}\nc={1:\"January\",2:\"February\",3:\"March\",4:\"April\",5:\"May\",6:\"June\",7:\"July\",8:\"August\",9:\"September\",10:\"October\",11:\"November\",0:\"December\"}\nd=int(int(input())+int(b[a]))\nprint(c[int(d%12)])", "N = 12\r\nmonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\n\r\ncurrent = input()\r\nstart = 0\r\nfor p in range(N):\r\n if months[p] == current:\r\n start = p\r\n break\r\n\r\nwait = int(input())\r\nprint(months[(start + wait) % N])", "months = 'January, February, March, April, May, June, July, August, September, October, November, December'.split(', ')\r\n\r\nmonth, n = input(), int(input())\r\n\r\nprint(months[(months.index(month) + n) % 12])", "#i need to create a dict with the months and count on it\nmonths = {0:\"January\", 1: \"February\", 2: \"March\", 3: \"April\",4: \"May\", 5: \"June\", 6: \"July\", 7: \"August\", 8: \"September\",9: \"October\", 10: \"November\", 11: \"December\"}\nactualMonth = input()\ntotalMonths = int(input())\nactualMonthNum = [k for k, v in months.items() if v == actualMonth][0]\nactualMonthNum = actualMonthNum + totalMonths\nwhile(actualMonthNum > 11):\n actualMonthNum = actualMonthNum - 12\nprint(months[actualMonthNum])\n\t \t\t \t \t \t\t \t \t\t\t\t\t \t\t \t \t\t", "ms='''January, February, March, April, May, June, July, August, September, October, November, December'''\r\nv=ms.split(', ')\r\ncm=input()\r\nn=int(input())\r\nt=(v.index(cm)+n)%12\r\nprint(v[t])", "month = input()\r\nm = int(input())\r\n\r\ns = ['January', 'February', 'March', 'April', 'May', 'June',\r\n 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\nmp = {}\r\nfor i in range(12):\r\n mp[s[i]] = i + 1\r\n\r\nx = (mp[month] + m) % 12\r\nif x == 0:\r\n x = 12\r\n\r\nprint(s[x - 1])", "# https://codeforces.com/problemset/problem/45/A\r\n\r\ndef func_sol(lines):\r\n months = [\r\n 'January',\r\n 'February',\r\n 'March',\r\n 'April',\r\n 'May',\r\n 'June',\r\n 'July',\r\n 'August',\r\n 'September',\r\n 'October',\r\n 'November',\r\n 'December',\r\n ]\r\n return months[(months.index(lines[0]) + int(lines[1])) % 12]\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", "if __name__ == '__main__':\n m = input()\n k = int(input())\n list_m = ['January','February', 'March', \n 'April', 'May', 'June',\n 'July', 'August', 'September', \n 'October', 'November', 'December']\n r = k%12\n r = r + list_m.index(m)\n r = r%12\n print(list_m[r])\n\n \t\t\t\t \t \t\t\t\t\t\t \t \t \t \t", "s = input()\nk = int(input())\nd1 = {'January': 1, 'February': 2, 'March': 3, 'April': 4, 'May': 5, 'June': 6,\n 'July': 7, 'August': 8, 'September': 9, 'October': 10, 'November': 11, 'December': 12}\nd2 = {1: 'January', 2: 'February', 3: 'March', 4: 'April', 5: 'May', 6: 'June',\n 7: 'July', 8: 'August', 9: 'September', 10: 'October', 11: 'November', 12: 'December'}\nif (d1[s] + k) % 12 != 0:\n print(d2[(d1[s] + k) % 12])\nelse:\n print('December')\n", "month_tek = input()\nli_months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\nn = int(input())\n\ntek_ind = li_months.index(month_tek)\nraz = 11 - tek_ind\nwhile n >= raz:\n n -= 12\n\nprint(li_months[tek_ind + n])\n", "a = ['January', 'February', 'March', 'April','May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nm = input()\r\nk = int(input())\r\nprint(a[(a.index(m)+k)%12])\r\n\r\n\r\n\r\n", "list=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nx=input()\r\nc_m=int(input())\r\nm=0\r\nfor i in range (len(list)):\r\n if list[i]==x:\r\n m=i+1\r\nmonth=m+c_m\r\nif month>12:\r\n month=month%12\r\nprint(list[month-1])\r\n", "s=input()\r\nk=int(input())\r\nm=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nind=0\r\nfor i in range(12):\r\n if m[i]==s:\r\n ind=i\r\n break\r\nind+=1\r\nnum=(ind+k)%12\r\nprint(m[num-1])", "m = input()\r\nn = int(input())\r\nmonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\nind = months.index(m)\r\nwhile n + ind > 11:\r\n ind -= 12\r\nprint(months[ind + n])", "a = input()\nb = int(input())\nc =[['January',1],['February',2],['March',3],['April',4],['May',5],['June',6],['July',7],['August',8],['September',9],['October',10],['November',11],['December',12]]\nfor x in c:\n\tif x[0] == a:\n\t\tb += x[1]\nprint(c[(b%12)-1][0])", "\n\nmonths = ['January', \n'February', \n'March', \n'April', \n'May', \n'June',\n'July', \n'August', \n'September', \n'October', \n'November', \n'December']\n\nmonth = input()\nm = int(input())\n\nmp = {}\nfor i in range(12):\n mp[months[i]] = i + 1\n\nx = (mp[month] + m) % 12\nif x == 0:\n x = 12\n\nprint(months[x - 1])\n\n \t\t\t \t\t\t \t\t \t \t\t\t \t\t", "def solve():\r\n li = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\n ind = li.index(input())\r\n n = int(input())\r\n sum = ind+n\r\n if sum>=12:\r\n sum = sum%12\r\n print(li[sum]) \r\nif __name__ == \"__main__\":\r\n solve()", "months = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\nn=input()\r\nk=int(input())\r\nindex=-1\r\nfor i in range(len(months)):\r\n if n==months[i]:\r\n index=i\r\n break\r\nindex+=k\r\ni=0\r\ncount=0\r\nwhile i<len(months):\r\n if count==index:\r\n print(months[i])\r\n break\r\n count+=1\r\n i+=1\r\n if i==12:\r\n i=0\r\n", "s=\"January, February, March, April, May, June, July, August, September, October, November, December\"\r\ns=s.split(\", \")\r\nt=input()\r\nn=int(input())\r\ni=(s.index(t)+n)%12\r\nprint(s[i])\r\n", "s=input()\r\nk=int(input())\r\nmonths = ['January','February','March','April','May','June','July','August','September','October','November','December']\r\nind=months.index(s)\r\ntmp=(ind+1+k)%12\r\nprint(months[tmp-1])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nmemo = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\n\r\ndata = input().rstrip()\r\nn = int(input())\r\n\r\ntmp = memo.index(data)\r\nans = memo[(tmp + n) % 12]\r\n\r\nprint(ans)", "month_to_num = {\n \"January\": 0,\n \"February\": 1,\n \"March\": 2,\n \"April\": 3,\n \"May\": 4,\n \"June\": 5,\n \"July\": 6,\n \"August\": 7,\n \"September\": 8,\n \"October\": 9,\n \"November\": 10,\n \"December\": 11,\n}\n\nnum_to_month = [\n \"January\",\n \"February\",\n \"March\",\n \"April\",\n \"May\",\n \"June\",\n \"July\",\n \"August\",\n \"September\",\n \"October\",\n \"November\",\n \"December\"\n]\n\ncurrent_month = input()\nmonths_left = int(input())\nprint(num_to_month[(months_left+month_to_num[current_month]) % 12])\n \t \t \t\t\t \t\t \t\t \t\t\t \t \t\t \t\t\t\t", "month=input()\r\nn=int(input())\r\nlst=['January','February','March','April','May','June','July',\r\n'August','September','October','November','December']\r\n\r\ncurrent=lst.index(month)\r\n\r\nprint(lst[(current+n)%12])\r\n", "dict={}\ndict[\"January\"]=0\ndict[\"February\"]=1\ndict[\"March\"]=2\ndict[\"April\"]=3\ndict[\"May\"]=4\ndict[\"June\"]=5\ndict[\"July\"]=6\ndict[\"August\"]=7\ndict[\"September\"]=8\ndict[\"October\"]=9\ndict[\"November\"]=10\ndict[\"December\"]=11\ntmp=input()\ns=int(input())\ns+=dict[tmp]\ns%=12\nfor i in dict:\n\tif(dict[i]==s):\n\t\tprint(i)\n\t\tbreak", "a=input()\r\nc=int(input())\r\nb = {1:'January', 2:'February', 3:'March', 4:'April', 5:'May', 6:'June', 7:'July', 8:'August', 9:'September', 10:'October', 11:'November', 0:'December', 'January':1, 'February':2, 'March':3, 'April':4, 'May':5, 'June':6, 'July':7, 'August':8, 'September':9, 'October':10, 'November':11, 'December':0}\r\nprint(b[(b[a]+c)%12])", "def q45a():\n\tmonths = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\n\tinput_month = input()\n\tnum_months_after = int(input())\n\tcurrent_month_index = months.index(input_month)\n\toutput = months[(current_month_index + num_months_after) % len(months)]\n\tprint(output)\n\nq45a()", "import sys\r\n\r\nkv = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nd = {'January': 1, 'February': 2, 'March': 3, 'April': 4, 'May': 5, 'June': 6, 'July': 7, 'August': 8, 'September': 9, 'October': 10, 'November': 11, 'December': 12}\r\n\r\nst = (sys.stdin.readline()).split()[0]\r\nk = int(sys.stdin.readline())\r\n\r\nk += d[st]\r\nprint(kv[k % 12 - 1])\r\n", "d1 = dict(zip(\"January, February, March, April, May, June, July, August, September, October, November, December\".replace(' ','').split(\",\"),range(12)))\r\nd2 = dict(zip(range(12),\"January, February, March, April, May, June, July, August, September, October, November, December\".replace(' ','').split(\",\")))\r\nprint(d2[(d1[input()]+int(input()))%12])", "# 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\nmonth = input()\r\nn = int(input())\r\nif n % 12 == 0:\r\n print(month)\r\nelse:\r\n lst = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\n if n % 12 == 1:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 1])\r\n elif n % 12 == 2:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[1])\r\n elif temp == len(lst) - 2:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 2])\r\n elif n % 12 == 3:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[2])\r\n elif temp == len(lst) - 2:\r\n print(lst[1])\r\n elif temp == len(lst) - 3:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 3])\r\n elif n % 12 == 4:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[2 + 1])\r\n elif temp == len(lst) - 2:\r\n print(lst[1 + 1])\r\n elif temp == len(lst) - 3:\r\n print(lst[0 + 1])\r\n elif temp == len(lst) - 4:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 4])\r\n elif n % 12 == 5:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[2 + 1 + 1])\r\n elif temp == len(lst) - 2:\r\n print(lst[1 + 1 + 1])\r\n elif temp == len(lst) - 3:\r\n print(lst[0 + 1 + 1])\r\n elif temp == len(lst) - 4:\r\n print(lst[0 + 1])\r\n elif temp == len(lst) - 5:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 5])\r\n elif n % 12 == 6:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[2 + 1 + 1 + 1])\r\n elif temp == len(lst) - 2:\r\n print(lst[1 + 1 + 1 + 1])\r\n elif temp == len(lst) - 3:\r\n print(lst[0 + 1 + 1 + 1])\r\n elif temp == len(lst) - 4:\r\n print(lst[0 + 1 + 1])\r\n elif temp == len(lst) - 5:\r\n print(lst[0 + 1])\r\n elif temp == len(lst) - 6:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 6])\r\n elif n % 12 == 7:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[1 + 2 + 1 + 1 + 1])\r\n elif temp == len(lst) - 2:\r\n print(lst[1 + 1 + 1 + 1 + 1])\r\n elif temp == len(lst) - 3:\r\n print(lst[1 + 0 + 1 + 1 + 1])\r\n elif temp == len(lst) - 4:\r\n print(lst[0 + 1 + 1 + 1])\r\n elif temp == len(lst) - 5:\r\n print(lst[0 + 1 + 1])\r\n elif temp == len(lst) - 6:\r\n print(lst[0 + 1])\r\n elif temp == len(lst) - 7:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 7])\r\n elif n % 12 == 8:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[1+1 + 2 + 1 + 1 + 1])\r\n elif temp == len(lst) - 2:\r\n print(lst[1 +1+ 1 + 1 + 1 + 1])\r\n elif temp == len(lst) - 3:\r\n print(lst[1 + 1+0 + 1 + 1 + 1])\r\n elif temp == len(lst) - 4:\r\n print(lst[0 + 1 +1+ 1 + 1])\r\n elif temp == len(lst) - 5:\r\n print(lst[0 + 1 + 1+1])\r\n elif temp == len(lst) - 6:\r\n print(lst[0 + 1+1])\r\n elif temp == len(lst) - 7:\r\n print(lst[0+1])\r\n elif temp == len(lst) - 8:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 8])\r\n elif n % 12 == 9:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[1+1+1 + 2 + 1 + 1 + 1])\r\n elif temp == len(lst) - 2:\r\n print(lst[1 +1+1+ 1 + 1 + 1 + 1])\r\n elif temp == len(lst) - 3:\r\n print(lst[1+1 + 1+0 + 1 + 1 + 1])\r\n elif temp == len(lst) - 4:\r\n print(lst[1+0 + 1 +1+ 1 + 1])\r\n elif temp == len(lst) - 5:\r\n print(lst[1+0 + 1 + 1+1])\r\n elif temp == len(lst) - 6:\r\n print(lst[1+0 + 1+1])\r\n elif temp == len(lst) - 7:\r\n print(lst[1+0+1])\r\n elif temp == len(lst) - 8:\r\n print(lst[0+1])\r\n elif temp == len(lst) - 9:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 9])\r\n elif n % 12 == 10:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[1+1+1+1 + 2 + 1 + 1 + 1])\r\n elif temp == len(lst) - 2:\r\n print(lst[1+1 +1+1+ 1 + 1 + 1 + 1])\r\n elif temp == len(lst) - 3:\r\n print(lst[1+1+1 + 1+0 + 1 + 1 + 1])\r\n elif temp == len(lst) - 4:\r\n print(lst[1+1+0 + 1 +1+ 1 + 1])\r\n elif temp == len(lst) - 5:\r\n print(lst[1+1+0 + 1 + 1+1])\r\n elif temp == len(lst) - 6:\r\n print(lst[1+1+0 + 1+1])\r\n elif temp == len(lst) - 7:\r\n print(lst[1+1+0+1])\r\n elif temp == len(lst) - 8:\r\n print(lst[1+0+1])\r\n elif temp == len(lst) - 9:\r\n print(lst[0+1])\r\n elif temp == len(lst) - 10:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 10])\r\n elif n % 12 == 11:\r\n temp = lst.index(month)\r\n if temp == len(lst) - 1:\r\n print(lst[1+1 + 1 + 1 + 1 + 2 + 1 + 1 + 1])\r\n elif temp == len(lst) - 2:\r\n print(lst[1+1 + 1 + 1 + 1 + 1 + 1 + 1 + 1])\r\n elif temp == len(lst) - 3:\r\n print(lst[1+1 + 1 + 1 + 1 + 0 + 1 + 1 + 1])\r\n elif temp == len(lst) - 4:\r\n print(lst[1+1 + 1 + 0 + 1 + 1 + 1 + 1])\r\n elif temp == len(lst) - 5:\r\n print(lst[1+1 + 1 + 0 + 1 + 1 + 1])\r\n elif temp == len(lst) - 6:\r\n print(lst[1+1 + 1 + 0 + 1 + 1])\r\n elif temp == len(lst) - 7:\r\n print(lst[1+1 + 1 + 0 + 1])\r\n elif temp == len(lst) - 8:\r\n print(lst[1+1 + 0 + 1])\r\n elif temp == len(lst) - 9:\r\n print(lst[1+0 + 1])\r\n elif temp == len(lst) - 10:\r\n print(lst[1+0])\r\n elif temp == len(lst) - 11:\r\n print(lst[0])\r\n else:\r\n print(lst[temp + 11])\r\n", "current_month=input()\r\nmonths_left=int(input())\r\nmonths=[\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\ncurrent_month_index=months.index(current_month)\r\nrelease_month= (current_month_index + months_left) %12\r\nprint(months[release_month])", "month={1:'January',2:'February',3:'March',4:'April',5:'May',6:'June',7:'July',8:'August',9:'September',10:'October',11:'November',12:'December',13:'January',14:'February',15:'March',16:'April',17:'May',18:'June',19:'July',20:'August',21:'September',22:'October',21:'November'}\r\ns=str(input())\r\nn=int(input())\r\nfor key,item in month.items():\r\n if s in item:\r\n n=n%12\r\n print(month[n+key])\r\n break\r\n", "a = ['January' , 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nb = (a.index(input()) + int(input())) % 12\r\nprint(a[b])\r\n", "lis=[\"January\",\"February\",\"March\",\"April\",\"May\",\"June\",\"July\",\"August\",\"September\",\"October\",\"November\",\"December\"]\r\n\r\nS=input()\r\nM=int(input())\r\n\r\nwhile(M>12):\r\n M-=12\r\n\r\nif(M==12):\r\n print(S)\r\n\r\nelse:\r\n reached=0\r\n ind=lis.index(S)\r\n while(reached != M):\r\n reached+=1\r\n ind+=1\r\n if(ind>11):\r\n ind=0\r\n print(lis[ind])", "s = 'January, February, March, April, May, June, July, August, September, October, November, December'\r\ns = s.split(', ')\r\na =input()\r\nn = int(input())\r\np = s.index(a)\r\np = (p + n) % 12\r\nprint (s[p])", "month = input()\r\nn = int(input())\r\n\r\nmonths = ['January', 'February', 'March', 'April', 'May', 'June',\r\n 'July', 'August', 'September', 'October', 'November', 'December']\r\nindex =(months.index(month)+n)%12\r\nprint(months[index])\r\n\r\n", "months = ['January', 'February', 'March', 'April', 'May', 'June',\r\n 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\ncurrent_month = input()\r\nk = int(input())\r\n\r\nindex = (months.index(current_month) + k) % 12\r\nresult = months[index]\r\n\r\nprint(result)", "def main():\r\n L=[\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\",\r\n \"September\", \"October\", \"November\", \"December\"]\r\n s=str(input())\r\n x=int(input())\r\n pos=L.index(s)\r\n x= ((pos+x)%12)\r\n print(L[x])\r\n\r\nmain() \r\n", "a = [\"December\",\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\",\"November\"]\r\nb = input()\r\nc = int(input())\r\nprint(a[(a.index(b)+c)%12])", "a=[\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\nk=a.index(input())\r\nn=int(input())\r\nprint(a[(((k+1)+n)%12)-1])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Aug 17 17:44:59 2018\r\n\r\n@author: kartik\r\n\"\"\"\r\n\r\nm = str(input())\r\na = int(input())\r\n\r\nmonths = {'January' : 1,'February' : 2, 'March' : 3, 'April' : 4, 'May' : 5,\r\n 'June' : 6, 'July' : 7, 'August' : 8, 'September' : 9, 'October' : 10,\r\n 'November' : 11, 'December' : 12 }\r\nn = months[m]\r\n'''if m=='January':\r\n n=1\r\nelif m=='February':\r\n n=2\r\nelif m=='March':\r\n n=3\r\nelif m=='April':\r\n n=4\r\nelif m=='May':\r\n n=5\r\nelif m=='June':\r\n n=6\r\nelif m=='July':\r\n n=7\r\nelif m=='August':\r\n n=8\r\nelif m=='September':\r\n n=9\r\nelif m=='October':\r\n n=10\r\nelif m=='November':\r\n n=11\r\nelif m=='December':\r\n n=12'''\r\n\r\nif a%12==0:\r\n print(m)\r\nelse:\r\n d=a%12\r\n if n+d<=12:\r\n print(list(months.keys())[list(months.values()).index(n+d)])\r\n else:\r\n print(list(months.keys())[list(months.values()).index(n+d-12)])\r\n\r\n \r\n", "def codecraft_iii():\n month = input()\n n = int(input())\n\n calendar = {\"January\":1, \"February\":2, \"March\":3, \"April\":4, \"May\":5, \"June\":6, \"July\":7, \"August\":8, \"September\":9, \"October\":10, \"November\":11, \"December\":12}\n\n print(list(calendar.keys())[((calendar[month] + n)%12)-1])\n\ncodecraft_iii()\n\t \t \t \t \t\t \t \t\t\t \t \t", "months = ['January', 'February', 'March', 'April', 'May', 'June',\r\n 'July', 'August', 'September', 'October', 'November', 'December']\r\ncurrent = input()\r\nmonthsLeft = int(input())\r\nind = months.index(current) + monthsLeft % 12\r\nprint(months[ind % 12])\r\n\r\n", "a = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nx = input()\r\nl = 0\r\nfor i in range(len(a)):\r\n if a[i] == x:\r\n l = i + 1\r\nk = int(input())\r\nk = ((k + l) % 12) - 1\r\nprint(a[k])", "def solve(n, s):\r\n\r\n l = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n t = l.index(s) +1\r\n nt = t + n%12 -1\r\n\r\n if nt > 11:\r\n print(l[nt-12])\r\n else:\r\n print(l[nt])\r\n\r\n\r\ns = input()\r\nn = int(input())\r\n\r\nsolve(n, s)", "\r\n\r\ndef main():\r\n a = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n month = input()\r\n k = int(input())\r\n ind = a.index(month) + k\r\n print(a[ind % 12])\r\n \r\nif __name__ == '__main__':\r\n main()", "s=input()\r\nn=int(input())\r\na=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nx=a.index(s)+1\r\nx+=n\r\nif x>12:\r\n x%=12\r\nprint(a[x-1])\r\n", "\"\"\"Today Vasya visited a widely known site and learned that\r\n the continuation of his favourite game Codecraft II will appear after exactly k months.\r\nHe looked at the calendar and learned that at the moment is the month number s.\r\nVasya immediately got interested in what month Codecraft III will appear.\r\nHelp him understand that.\r\n\r\nAll the twelve months in Vasya's calendar are named using their usual English names:\r\n January, February, March, April, May, June, July, August, September, October, November, December.\r\n\r\nInput\r\nThe first input line contains the name of the current month.\r\nIt is guaranteed that it is a proper English name of one of twelve months.\r\nThe first letter is uppercase, the rest are lowercase.\r\nThe second line contains integer k (0 <= k <= 100)\r\n - the number of months left till the appearance of Codecraft III.\r\n\r\nOutput\r\nPrint starting from an uppercase letter the name of the month\r\n in which the continuation of Codeforces II will appear.\r\nThe printed name must be contained in the list\r\n January, February, March, April, May, June, July, August, September, October, November, December.\"\"\"\r\n\r\nmonth = [\"January\",\r\n \"February\",\r\n \"March\",\r\n \"April\",\r\n \"May\",\r\n \"June\",\r\n \"July\",\r\n \"August\",\r\n \"September\",\r\n \"October\",\r\n \"November\",\r\n \"December\"]\r\n\r\nm = input()\r\nfor i in range(12):\r\n if m == month[i]:\r\n m = i + 1\r\n break\r\n\r\nk = int(input())\r\nprint(month[(m + k) % 12 - 1])", "l=['January','February','March','April','May','June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nm = input()\r\ni=0\r\nwhile l[i]!=m:\r\n i=i+1\r\nprint(l[(i+int(input()))%12])", "a=['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nm=input()\r\nn=int(input())\r\ncnt=0\r\nj=0\r\nfor i in range(len(a)):\r\n if a[i]==m:\r\n j=i\r\n break\r\nwhile True:\r\n if cnt==n:\r\n print(a[j])\r\n break\r\n cnt=cnt+1\r\n if j>=len(a)-1:\r\n j=0\r\n else:\r\n j=j+1", "X=[\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\nS=input()\r\nplus=int(input())\r\n\r\nk=X.index(S)\r\nprint(X[(k+plus)%12])\r\n", "def codecraft():\r\n monthes = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n now = input()\r\n index = 0\r\n for i in range(12):\r\n if monthes[i] == now:\r\n index = i\r\n break\r\n k = int(input())\r\n print(monthes[(i + k)% 12])\r\n\r\ncodecraft() ", "months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\n\r\nm = input()\r\nn = int(input())\r\nq = months.index(m)\r\n# print(q)\r\nr = (q + n) % 12\r\nprint(months[r])", "l = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\",\"December\"]\r\nstart = input()\r\nn = int(input())\r\nx= l.index(start) + 1 +n\r\nres = l[(x % 12) - 1]\r\nprint(res)", "h = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\r\na = input()\r\nb = int(input())\r\nc = h.index(a, 0, 12)\r\nd = (c + b) % 12\r\nprint(h[d])", "m, k = input(), int(input())\nmonths = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\", \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\nm2n = {m: i for i, m in enumerate(months)}\nres = months[(m2n[m] + k) % 12]\nprint(res)\n", "def main():\n mesAtual = input();\n mesesEspera = int(input());\n calendario = {\n \"January\": 1,\n \"February\": 2,\n \"March\": 3,\n \"April\": 4,\n \"May\": 5,\n \"June\": 6,\n \"July\": 7,\n \"August\": 8,\n \"September\": 9,\n \"October\": 10,\n \"November\": 11,\n \"December\": 0 \n }\n meses = list(calendario.keys());\n idMeses = list(calendario.values());\n idMesAtual = calendario[mesAtual];\n idMesLancamento = (idMesAtual + mesesEspera) % 12;\n print(meses[idMeses.index(idMesLancamento)]);\n\nmain();\n \t \t \t\t\t \t \t\t\t\t \t \t\t \t \t", "months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']\r\nm = str(input())\r\nx = months.index(m)\r\nd = int(input())\r\nprint(months[(x+d)%12])", "months = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November',\r\n 'December']\r\nmonth = input()\r\nn = int(input())\r\nind = months.index(month)\r\nprint(months[(n + ind) % 12])\r\n", "months = [\"January\", \"February\", \"March\", \"April\", \"May\", \"June\",\n \"July\", \"August\", \"September\", \"October\", \"November\", \"December\"]\ncurrent = input().strip()\npos = months.index(current)\ndelta = int(input())\nprint(months[(pos + delta) % 12])\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 QA(sep=' '): return deque(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\nimport calendar \r\n\r\ndef main():\r\n m = S() \r\n k = I() \r\n months = [calendar.month_name[i] for i in range(1,13)]\r\n cur = months.index(m)+1\r\n return months[((cur+k)%12)-1]\r\n\r\nif __name__ == '__main__':\r\n print(main())", "month, num = input(), int(input())\r\nmonths = ['January', 'February', 'March', 'April', 'May', 'June', 'July',\r\n 'August', 'September', 'October', 'November', 'December']\r\n\r\nif num % 12 == 0:\r\n print(month)\r\nelse:\r\n ind = (months.index(month) + num) % 12\r\n\r\n print(months[ind])\r\n", "# LUOGU_RID: 130992111\na=['January','February','March','April','May','June','July','August','September','October','November','December']\nn=input()\nk=int(input())\nfor i in range(0,12):\n if a[i]==n:\n month=i\nmonth=month+k+1\nmonth=month%12\nif month ==0:\n month=11\nelse:\n month=month-1\nprint(a[month])", "s='January February March April May June July August September October November December'.split()\r\nI=input\r\nt=I()\r\nprint(s[(s.index(t)+int(I()))%12])", "a=input()\r\nb=int(input())\r\nif a=='January':\r\n c=0\r\nelif a=='February':\r\n c=1\r\nelif a=='March':\r\n c=2\r\nelif a=='April':\r\n c=3\r\nelif a=='May':\r\n c=4\r\nelif a=='June':\r\n c=5\r\nelif a=='July':\r\n c=6\r\nelif a=='August':\r\n c=7\r\nelif a=='September':\r\n c=8\r\nelif a=='October':\r\n c=9\r\nelif a=='November':\r\n c=10\r\nelif a=='December':\r\n c=11\r\nd=(c+b)%12\r\nif d==0:\r\n print('January')\r\nelif d==1:\r\n print('February')\r\nelif d==2:\r\n print('March')\r\nelif d==3:\r\n print('April')\r\nelif d==4:\r\n print('May')\r\nelif d==5:\r\n print('June')\r\nelif d==6:\r\n print('July')\r\nelif d==7:\r\n print('August')\r\nelif d==8:\r\n print('September')\r\nelif d==9:\r\n print('October')\r\nelif d==10:\r\n print('November')\r\nelif d==11:\r\n print('December')\r\n" ]

[ "if True:\r\n from io import BytesIO, IOBase\r\n import math\r\n\r\n import random\r\n import sys\r\n import os\r\n\r\n import bisect\r\n import typing\r\n from collections import Counter, defaultdict, deque\r\n from copy import deepcopy\r\n from functools import cmp_to_key, lru_cache, reduce\r\n from heapq import heapify, heappop, heappush, heappushpop, nlargest, nsmallest\r\n from itertools import accumulate, combinations, permutations, count\r\n from operator import add, iand, ior, itemgetter, mul, xor\r\n from string import ascii_lowercase, ascii_uppercase, ascii_letters\r\n from typing import *\r\n BUFSIZE = 4096\r\n\r\n class FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n class IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n sys.stdin = IOWrapper(sys.stdin)\r\n sys.stdout = IOWrapper(sys.stdout)\r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\n def I():\r\n return input()\r\n\r\n def II():\r\n return int(input())\r\n\r\n def MII():\r\n return map(int, input().split())\r\n\r\n def LI():\r\n return list(input().split())\r\n\r\n def LII():\r\n return list(map(int, input().split()))\r\n\r\n def LFI():\r\n return list(map(float, input().split()))\r\n\r\n def GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n def LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n inf = float('inf')\r\n\r\ndfs, hashing = True, False\r\n\r\nif dfs:\r\n from types import GeneratorType\r\n\r\n def bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\nif hashing:\r\n RANDOM = random.getrandbits(20)\r\n class Wrapper(int):\r\n def __init__(self, x):\r\n int.__init__(x)\r\n\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ RANDOM\r\n\r\nclass LazySegTree:\r\n def __init__(\r\n self,\r\n op: typing.Callable[[typing.Any, typing.Any], typing.Any],\r\n e: typing.Any,\r\n mapping: typing.Callable[[typing.Any, typing.Any], typing.Any],\r\n composition: typing.Callable[[typing.Any, typing.Any], typing.Any],\r\n id_: typing.Any,\r\n v: typing.Union[int, typing.List[typing.Any]]) -> None:\r\n self._op = op\r\n self._e = e\r\n self._mapping = mapping\r\n self._composition = composition\r\n self._id = id_\r\n\r\n if isinstance(v, int):\r\n v = [e] * v\r\n\r\n self._n = len(v)\r\n self._log = (self._n - 1).bit_length()\r\n self._size = 1 << self._log\r\n self._d = [e] * (2 * self._size)\r\n self._lz = [self._id] * self._size\r\n for i in range(self._n):\r\n self._d[self._size + i] = v[i]\r\n for i in range(self._size - 1, 0, -1):\r\n self._update(i)\r\n\r\n def set(self, p: int, x: typing.Any) -> None:\r\n assert 0 <= p < self._n\r\n\r\n p += self._size\r\n for i in range(self._log, 0, -1):\r\n self._push(p >> i)\r\n self._d[p] = x\r\n for i in range(1, self._log + 1):\r\n self._update(p >> i)\r\n\r\n def get(self, p: int) -> typing.Any:\r\n assert 0 <= p < self._n\r\n\r\n p += self._size\r\n for i in range(self._log, 0, -1):\r\n self._push(p >> i)\r\n return self._d[p]\r\n\r\n def prod(self, left: int, right: int) -> typing.Any:\r\n assert 0 <= left <= right <= self._n\r\n\r\n if left == right:\r\n return self._e\r\n\r\n left += self._size\r\n right += self._size\r\n\r\n for i in range(self._log, 0, -1):\r\n if ((left >> i) << i) != left:\r\n self._push(left >> i)\r\n if ((right >> i) << i) != right:\r\n self._push(right >> i)\r\n\r\n sml = self._e\r\n smr = self._e\r\n while left < right:\r\n if left & 1:\r\n sml = self._op(sml, self._d[left])\r\n left += 1\r\n if right & 1:\r\n right -= 1\r\n smr = self._op(self._d[right], smr)\r\n left >>= 1\r\n right >>= 1\r\n\r\n return self._op(sml, smr)\r\n\r\n def all_prod(self) -> typing.Any:\r\n return self._d[1]\r\n\r\n def apply(self, left: int, right: typing.Optional[int] = None,\r\n f: typing.Optional[typing.Any] = None) -> None:\r\n assert f is not None\r\n\r\n if right is None:\r\n p = left\r\n assert 0 <= left < self._n\r\n\r\n p += self._size\r\n for i in range(self._log, 0, -1):\r\n self._push(p >> i)\r\n self._d[p] = self._mapping(f, self._d[p])\r\n for i in range(1, self._log + 1):\r\n self._update(p >> i)\r\n else:\r\n assert 0 <= left <= right <= self._n\r\n if left == right:\r\n return\r\n\r\n left += self._size\r\n right += self._size\r\n\r\n for i in range(self._log, 0, -1):\r\n if ((left >> i) << i) != left:\r\n self._push(left >> i)\r\n if ((right >> i) << i) != right:\r\n self._push((right - 1) >> i)\r\n\r\n l2 = left\r\n r2 = right\r\n while left < right:\r\n if left & 1:\r\n self._all_apply(left, f)\r\n left += 1\r\n if right & 1:\r\n right -= 1\r\n self._all_apply(right, f)\r\n left >>= 1\r\n right >>= 1\r\n left = l2\r\n right = r2\r\n\r\n for i in range(1, self._log + 1):\r\n if ((left >> i) << i) != left:\r\n self._update(left >> i)\r\n if ((right >> i) << i) != right:\r\n self._update((right - 1) >> i)\r\n\r\n def max_right(\r\n self, left: int, g: typing.Callable[[typing.Any], bool]) -> int:\r\n assert 0 <= left <= self._n\r\n assert g(self._e)\r\n\r\n if left == self._n:\r\n return self._n\r\n\r\n left += self._size\r\n for i in range(self._log, 0, -1):\r\n self._push(left >> i)\r\n\r\n sm = self._e\r\n first = True\r\n while first or (left & -left) != left:\r\n first = False\r\n while left % 2 == 0:\r\n left >>= 1\r\n if not g(self._op(sm, self._d[left])):\r\n while left < self._size:\r\n self._push(left)\r\n left *= 2\r\n if g(self._op(sm, self._d[left])):\r\n sm = self._op(sm, self._d[left])\r\n left += 1\r\n return left - self._size\r\n sm = self._op(sm, self._d[left])\r\n left += 1\r\n\r\n return self._n\r\n\r\n def min_left(self, right: int, g: typing.Any) -> int:\r\n assert 0 <= right <= self._n\r\n assert g(self._e)\r\n\r\n if right == 0:\r\n return 0\r\n\r\n right += self._size\r\n for i in range(self._log, 0, -1):\r\n self._push((right - 1) >> i)\r\n\r\n sm = self._e\r\n first = True\r\n while first or (right & -right) != right:\r\n first = False\r\n right -= 1\r\n while right > 1 and right % 2:\r\n right >>= 1\r\n if not g(self._op(self._d[right], sm)):\r\n while right < self._size:\r\n self._push(right)\r\n right = 2 * right + 1\r\n if g(self._op(self._d[right], sm)):\r\n sm = self._op(self._d[right], sm)\r\n right -= 1\r\n return right + 1 - self._size\r\n sm = self._op(self._d[right], sm)\r\n\r\n return 0\r\n\r\n def _update(self, k: int) -> None:\r\n self._d[k] = self._op(self._d[2 * k], self._d[2 * k + 1])\r\n\r\n def _all_apply(self, k: int, f: typing.Any) -> None:\r\n self._d[k] = self._mapping(f, self._d[k])\r\n if k < self._size:\r\n self._lz[k] = self._composition(f, self._lz[k])\r\n\r\n def _push(self, k: int) -> None:\r\n self._all_apply(2 * k, self._lz[k])\r\n self._all_apply(2 * k + 1, self._lz[k])\r\n self._lz[k] = self._id\r\n\r\nn, m, k = MII()\r\nq = m + k\r\n\r\nmod = random.getrandbits(32)\r\npow10 = [1] * (n + 1)\r\nfor i in range(1, n + 1):\r\n pow10[i] = pow10[i-1] * 10 % mod\r\n\r\npow10_acc = list(accumulate(pow10, initial=0))\r\nfor i in range(n + 1):\r\n pow10_acc[i] %= mod\r\n\r\nmask = (1 << 32) - 1\r\ndef op(x, y):\r\n l1, v1 = x >> 32, x & mask\r\n l2, v2 = y >> 32, y & mask\r\n l = l1 + l2\r\n v = (v1 * pow10[l2] + v2) % mod\r\n return l << 32 | v\r\n\r\ndef mapping(f, x):\r\n if f == -1: return x\r\n l = x >> 32\r\n return l << 32 | (pow10_acc[l] * f % mod)\r\n\r\ndef composition(f1, f2):\r\n return f2 if f1 == -1 else f1\r\n\r\nseg = LazySegTree(op, 0, mapping, composition, -1, [int(x) + mask + 1 for x in I()])\r\n\r\nfor _ in range(q):\r\n t, l, r, x = GMI()\r\n x += 1\r\n if t: print('YES' if seg.prod(l, r-x+1) == seg.prod(l+x, r+1) else 'NO')\r\n else: seg.apply(l, r + 1, x)" ]

[ "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\ndef bs(left,right,x):\r\n while(left<=right):\r\n mid=left+(right-left)//2\r\n b=(mid*(mid+1))//2\r\n if(b==x):\r\n return 1\r\n elif(b>x):\r\n right=mid-1\r\n else:\r\n left=mid+1\r\n return 0\r\nn=int(input())\r\nn1=10**5\r\nflag=0\r\nfor i in range(1,n1+1):\r\n a=(i*(i+1))//2\r\n if(bs(1,n1,n-a)):\r\n flag=1\r\n break\r\nif(flag==0):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n \r\n\r\n", "n = int(input())\r\nst = set([p * (p + 1) / 2 for p in range(1, 55000)])\r\n\r\nflag=0\r\nfor i in st:\r\n if n-i in st:\r\n flag=1\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\n\r\nn = int(input())\r\na = 1\r\nb = 1\r\nc = -(2*n)\r\nd = (b**2) - (4*a*c)\r\nflag = 0\r\nsol = (-b+math.sqrt(d))//(2*a)\r\nma = int(sol)\r\ntemp = 0\r\nfor i in range(1,ma+1):\r\n temp += i\r\n c = -(2*(n-temp))\r\n d = (b**2) - (4*a*c)\r\n sol = (-b + math.sqrt(d)) // (2 * a)\r\n if (sol*(sol+1))//2 + temp == n and sol > 0:\r\n flag = 1\r\n print(\"YES\")\r\n break\r\nif flag == 0:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\nneeded = set()\ni = 1\nt = 1\nfailed = True\n\nwhile t <= n :\n t = (i * (i + 1)) / 2\n if (t in needed) or t + t == n: \n print(\"YES\")\n failed = False\n break\n else: \n needed.add(n - t)\n\n i += 1\n\nif (failed) : print(\"NO\")\n\n\n \t\t\t\t\t \t \t\t\t \t \t \t\t \t \t\t\t \t", "# maa chudaaye duniya\r\nfrom math import sqrt, ceil\r\n\r\ndef findnumber(arr, z, lo, hi):\r\n while hi >= lo:\r\n mid = lo + ((hi-lo)//2)\r\n if arr[mid] == z:\r\n return True\r\n elif z > arr[mid]:\r\n lo = mid + 1\r\n else:\r\n hi = mid - 1\r\n return False\r\n \r\nn=int(input())*2\r\nz = ceil(sqrt(n))\r\narr = [i*(i+1) for i in range(1, z)]\r\nfnd = False\r\nfor i in arr:\r\n to_find = n - i\r\n if findnumber(arr, to_find, 0, len(arr) - 1):\r\n print('YES')\r\n fnd = True\r\n break\r\nif not fnd:\r\n print('NO')", "n = int(input())*2\r\nf = int(n**0.5)+1\r\nc = 0\r\nfor i in range(1,f):\r\n x = i*(i+1)\r\n left = 1\r\n right = f\r\n while left!=right-1:\r\n mid = (left+right)//2\r\n if x + mid * (mid + 1) > n:\r\n right = mid\r\n else:\r\n left = mid\r\n if right * (right+1) + x == n or left * (left+1) + x == n:\r\n print('YES')\r\n c+=1\r\n break\r\n\r\n\r\nif c==0:\r\n print('NO')", "#rextester.com:3.5.2--codeforces.com:3.5.2\r\nimport math\r\na=int(input())*2;b=0\r\nfor i in range(1,int(math.sqrt(a))):\r\n c=a-i*i-i;d=int(math.sqrt(c))\r\n if d*(d+1)==c:b=1\r\nprint(\"YES\")if(b)else print(\"NO\")", "import math\n\nn = int(input())\nupperBound = int(math.sqrt(2 * n))\nfunky = []\n\nfor i in range (upperBound + 1):\n temp = int(i * (i + 1) / 2)\n funky.append(temp)\n\nflag = False\nlower_index = 1\nupper_index = upperBound\n\n\nwhile(lower_index <= upper_index):\n temp = funky[lower_index] + funky[upper_index] \n if(temp == n):\n flag = True\n break\n elif(temp < n):\n lower_index+=1\n elif(temp > n):\n upper_index-=1\n\nprint(\"YES\") if flag else print(\"NO\")\n \t \t\t\t \t\t \t\t\t\t \t \t \t\t\t \t\t", "# 192a\nimport sys\nfrom bisect import bisect_left\ninput = sys.stdin.readline\n\nn = int(input())\nnums, i = [], 1\nwhile i*(i+1)//2 < n:\n nums.append(i*(i+1)//2)\n i += 1\n\nfor j in nums:\n if n - j > nums[-1]:\n continue\n tmp = bisect_left(nums, n - j)\n if j + nums[tmp] == n:\n print(\"YES\")\n exit()\n\nprint(\"NO\")", "def code(n):\r\n return(n*(n+1)//2)\r\nn=int(input())\r\ni=1\r\na=set()\r\nwhile code(i)<=n:\r\n a.add(code(i))\r\n i+=1\r\nfor i in a:\r\n if (n-i) in a:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "import math\ndef give_tri(a):\n return a*(a+1)/2\n \ndef check_tri(a3):\n p=int(math.sqrt(2*a3))\n if a3==0:\n return False\n elif p*(p+1)==2*a3:\n return True\n else:\n return False\n \ndef check_cool(a1):\n j=int(a1**0.5)\n while j>=1:\n k1=a1-give_tri(j)\n if check_tri(k1):\n return \"YES\"\n else:\n j=j-1\n return \"NO\"\n \nnum = int(input())\nprint(check_cool(num))\n", "n = int(input())\r\nfs = set()\r\nfor i in range(n):\r\n f = i * (i + 1) // 2\r\n if f < n:\r\n fs.add(f)\r\n if n - f in fs:\r\n print('YES')\r\n exit()\r\n else:\r\n break\r\nprint('NO')", "from math import sqrt\r\n\r\n\r\ndef fun(n):\r\n s = set([k * (k + 1) // 2 for k in range(1, int(2 * sqrt(n)))])\r\n for elem in s:\r\n if n - elem in s:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(fun(int(input())))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ni = 1\r\nd = set()\r\nwhile i < 45000:\r\n d.add(i*(i+1)//2)\r\n i += 1\r\nn = int(input())\r\nfor i in d:\r\n if (n-i) in d:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "bruh = set([(i+1)*i/2 for i in range(1, 50001)])\r\nn = int(input())\r\nif any(n-t in bruh for t in bruh):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___ \r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\r\n'''\r\n", "N = int(input())\r\nl = []\r\ni = 1\r\nwhile True:\r\n b = int(i*(i+1)/2)\r\n l.append(b)\r\n i += 1\r\n if N < b:\r\n break\r\na = False\r\nfor x in l:\r\n if N - x in l:\r\n a = True\r\n\r\nif a : print(\"YES\")\r\nelse: print(\"NO\")", "def is_sum_of_two_triangular_numbers(n):\n # Generate triangular numbers and store them in a set for quick lookup\n triangular_numbers = set()\n max_k = int((2 * n) ** 0.5) + 1 # Max value for k based on n\n for k in range(1, max_k + 1):\n T_k = k * (k + 1) // 2\n triangular_numbers.add(T_k)\n\n # Check if n can be represented as the sum of two triangular numbers\n for T_k in triangular_numbers:\n if n - T_k in triangular_numbers:\n return \"YES\"\n\n return \"NO\"\n\n\n# Example usage:\nn = int(input())\nresult = is_sum_of_two_triangular_numbers(n)\nprint(result)\n\n \t \t \t\t\t \t \t \t\t\t\t\t \t \t\t\t \t", "n=int(input())\r\nst=set([p*(p+1)/2 for p in range(1,55000)])\r\nf = 0\r\nfor i in st:\r\n if n-i in st:\r\n f = 1\r\n break\r\nif f==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\ni=0\ninit=0\nlistd=set()\nwhile i<n:\n init+=1\n i=init+i\n listd.add(i)\nfor i in listd:\n if (n-i) in listd:\n print(\"YES\")\n init=0\n break\nif init!=0 : print(\"NO\")\n", "def main():\r\n n=int(input())\r\n nums=set()\r\n i=1\r\n while (i*(i+1))//2<=10**9:\r\n nums.add((i*(i+1))//2)\r\n i+=1\r\n for i in nums:\r\n if n-i in nums:\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from sys import*\r\nimport math\r\n\"\"\"def funky(n):\r\n\ti = 1\r\n\ttest = False\r\n\twhile(((i*(i+1))/2) < n):\r\n\t\ty = n-((i*(i+1))/2)\r\n\t\tj = 1\r\n\t\twhile(((j*(j+1))/2) <= y):\r\n\t\t\tif(((j*(j+1))/2) == y):\r\n\t\t\t\ttest = True\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tj = j+1\r\n\t\tif(test == True):\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ti = i+1\r\n\treturn test\r\nn = int(input())\r\nif(funky(n) == True):\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")\r\n\"\"\"\r\n\r\n\r\ndef funky_number(n):\r\n\ti =1\r\n\tj =2\r\n\ttest = False\r\n\twhile(i<n):\r\n\t\ty = n - i\r\n\t\tm = int(math.sqrt(2*y))\r\n\t\tif((m*(m+1)) == 2*y):\r\n\t\t\ttest = True\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ti = i+j\r\n\t\t\tj = j+1\r\n\treturn test\r\nn = int(input())\r\nif(funky_number(n) == True):\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")", "arr=[1]*(10**5)\r\nd={}\r\n\r\nfor i in range(1,10**5):\r\n arr[i]=(i)*(i+1)//2\r\n d[arr[i]]=1\r\n\r\nn=int(input())\r\n\r\nfor i in arr:\r\n a=i\r\n b=n-i\r\n if(b<=0):\r\n break\r\n if(b in d):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n\r\n", "def check_number( arr, no ) :\r\n i = 0\r\n j = len( arr ) - 1 \r\n while i <= j :\r\n if arr[i] + arr[j] == no :\r\n return \"YES\"\r\n elif arr[i] + arr[j] > no :\r\n j -= 1\r\n else :\r\n i += 1\r\n return \"NO\"\r\n\r\ndef check_funky( n ) :\r\n i = 1\r\n arr = []\r\n while i * ( i + 1 ) // 2 <= 10 ** 9 :\r\n arr.append(i * ( i + 1 ) // 2)\r\n i += 1\r\n return check_number( arr, n )\r\n\r\nif __name__ == \"__main__\" :\r\n n = int(input())\r\n print(check_funky( n ))\r\n", "def binary_search(arr, low, high, x):\r\n # Check base case\r\n if high >= low:\r\n\r\n mid = (high + low) // 2\r\n\r\n if arr[mid] == x:\r\n return mid\r\n\r\n elif arr[mid] > x:\r\n return binary_search(arr, low, mid - 1, x)\r\n\r\n else:\r\n return binary_search(arr, mid + 1, high, x)\r\n\r\n else:\r\n return -1\r\nn=int(input())\r\nn=n*2\r\nfinal = 1\r\ncheck=[]\r\nroot=int(((4*(n-2) +1)**(0.5)-1)/2)\r\ni=1\r\nj=root\r\ncong = root**2 + root\r\nif n==2:\r\n print(\"NO\")\r\n final=0\r\nwhile i<=j and final==1:\r\n init= i*i + i\r\n # check.append(init)\r\n number = n - init\r\n if binary_search(check,0,len(check)-1,number)!=(-1):\r\n # if number in check:\r\n print(\"YES\")\r\n final=0\r\n break\r\n else:\r\n while (cong + init)>= n and final==1:\r\n if (cong)==number :\r\n print('YES')\r\n final=0\r\n break\r\n else:\r\n check.append(cong)\r\n j-=1\r\n cong = j ** 2 + j\r\n\r\n i+=1\r\nif final==1 :\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "n= int(input())\r\ndef triangular(n):\r\n\tl=[]\r\n\tl.append(-1);\r\n\tfor i in range(1,1000010):\r\n\t\tl.append(i*(i+1)/2)\r\n\tleft=1;\r\n\tright=1000000\r\n\ti=1\r\n\twhile (left<=right):\r\n\t\tif(l[left]+l[right]==n):\r\n\t\t return True\r\n\t\telif(l[left]+l[right]<n):\r\n\t\t left=left+1\r\n\t\telse:\r\n\t\t right=right-1\r\n\treturn False\r\n\t\t\r\n \r\n\t\r\nif triangular(n):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "from math import sqrt\r\nn=int(input())\r\nstatus=\"NO\"\r\na=sqrt(n)\r\ni,j=int(a),int(a)\r\nwhile i>=1 and j<=n:\r\n sum=(i*(i+1)/2)+(j*(j+1)/2)\r\n if sum==n:\r\n status=\"YES\"\r\n break\r\n if sum>n:\r\n i=i-1\r\n if sum<n:\r\n j=j+1\r\nprint(status)", "T = {k*(k+1)//2 for k in range(1,44721)}\r\n\r\nn = int(input())\r\n\r\nprint('YES' if any(n-t in T for t in T) else 'NO')", "\ndef binarySearch (arr, l, r, x): \n\n\t# Check base case \n\tif r >= l: \n\n\t\tmid = l + (r - l)//2\n\n\t\t# If element is present at the middle itself \n\t\tif arr[mid] == x: \n\t\t\treturn mid \n\t\t\n\t\t# If element is smaller than mid, then it can only \n\t\t# be present in left subarray \n\t\telif arr[mid] > x: \n\t\t\treturn binarySearch(arr, l, mid-1, x) \n\n\t\t# Else the element can only be present in right subarray \n\t\telse: \n\t\t\treturn binarySearch(arr, mid+1, r, x) \n\n\telse: \n\t\t# Element is not present in the array \n\t\treturn -1\n\n\n\n\ndef checkTriangularSumRepresentation(n) : \n \n tri = list(); \n i = 1; \n\n while (1) : \n x = i * (i + 1) // 2; \n if (x >= n) : \n break; \n \n tri.append(x); \n i += 1; \n \n # Check if a pair exists \n for tm in tri :\n a = n-tm\n if(binarySearch(tri,0,len(tri)-1,a)!=-1):\n return True; \n \n return False; \n \n \nn = int(input()) \n \nif checkTriangularSumRepresentation(n): \n print(\"YES\") \nelse : \n print(\"NO\") \n \n\n\t\t \t\t \t \t\t\t\t\t \t \t\t \t\t", "import math\n\n\ndef sum_of_triangular(x):\n # no. in form (x*x + x)/2 are traingular nos.\n f = math.sqrt(1 + 8*x)\n g = (f-1)/2\n h = math.ceil(g)\n if True:\n for i in range(1 , h):\n c = 1 - 4*(i*i +i -2*x)\n d = math.sqrt(c)\n e = d - math.floor(d)\n if e == 0 and (d-1)%2 == 0:\n return print(\"Yes\")\n break\n else:\n pass\n print(\"NO\")\n \n\na = int(input())\nsum_of_triangular(a)", "import math\nfrom bisect import bisect_left\n\ndef BinarySearch(a, x):\n i = bisect_left(a, x)\n if i != len(a) and a[i] == x:\n return i\n else:\n return -1\n\nn=int(input())\npossible_nums = []\ni=1\na = 0\nwhile a<=n:\n a = (math.pow(i,2)+i)/2\n if(a<=n):\n possible_nums.append(a)\n i+=1\npossible = 0\nfor a in possible_nums:\n diff = n-a\n i = BinarySearch(possible_nums,diff)\n if i>=0:\n print(\"YES\")\n possible = 1\n break\n else:\n continue\nif not possible:\n print(\"NO\")\n\n \t\t\t\t \t\t\t \t\t \t\t \t\t", "def main():\r\n nums = []\r\n tr_nums = set()\r\n for k in range(1,10**5+1):\r\n num = (k*(k+1))//2\r\n nums.append(num)\r\n tr_nums.add(num)\r\n\r\n n = int(input())\r\n for i in nums:\r\n if (n-i) in tr_nums:\r\n print('YES')\r\n return\r\n\r\n print('NO')\r\n\r\nmain()\r\n", "n = int(input())\na, b = 1, int((2 * (n - 1)) ** 0.5)\nA, B = 1, (b * (b + 1)) // 2\nwhile a <= b:\n if A + B < n:\n a += 1\n A += a\n elif A + B > n:\n B -= b\n b -= 1\n else: \n break\nprint('NO' if b == 0 or A + B != n else 'YES')\n \t\t \t \t\t \t \t \t\t\t\t \t\t\t \t", "n = int(input())\r\nn = n*2\r\nk = 0\r\nf=False\r\nfor i in range(1,int(n**0.5)):\r\n n1 = n - i*(i+1)\r\n k = int(n1**0.5)\r\n if k*(k+1) == n1 and k!=0:\r\n print('YES')\r\n f = True\r\n break\r\nif f == False:\r\n print('NO')\r\n", "import math\nn = int(input())\nx = 0\nisFunky = False\nfor i in range(1,n):\n if i*(i+1) > n:\n break\n x = int(round(math.sqrt((n*2)-(i*(i+1)))))\n if i*(i+1) + x*(x+1) == 2*n:\n isFunky = True\n break\nif isFunky:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t \t \t \t\t \t \t\t", "n=int(input())\narr=[]\nm=1\nwhile True:\n #temp = m*(m/2 + 1)\n\ttemp=(m*(m+1))/2\n #temp = m+1(m/2 + 1)\n\tif temp>n:\n\t\tbreak;\n\n\tarr.append(temp)\n\tm+=1\n\nl=0\nr=len(arr)-1\n\nwhile l<=r:\n\ttemp=arr[l]+arr[r]\n\tif temp==n:\n\t\tprint(\"YES\")\n\t\texit()\n\telif temp>n:\n\t\tr-=1\n\telif temp<n:\n\t\tl+=1\nprint(\"NO\")\n \t \t\t\t \t\t\t\t \t \t\t \t\t \t\t \t\t", "n = int(input())\r\n\r\nN = 10**5 + 1\r\nst = set()\r\n\r\nfor i in range(1, N):\r\n st.add(i * (i + 1) // 2)\r\n\r\nfor val in st:\r\n if n - val > 0 and (n - val) in st:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "k= set([(i*(i+1))//2 for i in range(1,45000)])\r\nn = int(input())\r\nf = set([n - i for i in k])\r\nt = k & f\r\nif t:\r\n print('YES')\r\nelse:\r\n print('NO')", "from bisect import bisect_left\r\narr = []\r\npo = 10 ** 9\r\nfor i in range(200000):\r\n if i == 0: continue\r\n j = i * (i + 1) // 2\r\n arr.append(j)\r\n if j > po:\r\n break\r\na = int(input())\r\nfor i in arr:\r\n x=a-i\r\n p=bisect_left(arr,x)\r\n if(x==arr[p]):\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "n = int(input())\r\nneeded = set()\r\ni = 1\r\nt = 1\r\nfailed = True\r\n\r\nwhile t <= n :\r\n t = (i * (i + 1)) / 2\r\n if (t in needed) or t + t == n: \r\n print(\"YES\")\r\n failed = False\r\n break\r\n else: \r\n needed.add(n - t)\r\n\r\n i += 1\r\n\r\nif (failed) : print(\"NO\")\r\n\r\n", "def main():\r\n n = int(input())\r\n sums = [1]\r\n for i in range(2, 10**5):\r\n sums.append(sums[-1] + i)\r\n\r\n l, r = 0, len(sums)-1\r\n while l < r:\r\n if sums[l] + sums[r] == n:\r\n return \"YES\"\r\n if sums[l] + sums[r] < n:\r\n l += 1\r\n else:\r\n r -= 1\r\n if sums[l] + sums[r] == n:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main())", "n = int(input())\nnum1 = 0\nconjunto = set()\nresuelto = False\n\ni = 1\n\nwhile True:\n num1 = i * (i + 1) // 2\n if num1 > n:\n break\n conjunto.add(num1)\n i += 1\n\nfor elemento in conjunto:\n if (n - elemento) in conjunto:\n print(\"YES\")\n resuelto = True\n break\n\nif(resuelto == False):\n print(\"NO\")\n\t \t\t \t \t\t \t\t \t\t \t\t\t\t\t\t\t \t\t \t", "# n = int(input())\r\n\r\n# def isTriangular(n):\r\n# start = 1\r\n# end = n\r\n# ans = -1\r\n# while True:\r\n# # input()\r\n# k = (start + end) // 2\r\n# # print(start, end, k)\r\n# if k*(k+1)/2 == n:\r\n# ans = k\r\n# elif k*(k+1)/2 > n:\r\n# end = k\r\n# else:\r\n# start = k\r\n\r\n# if(start >= end-1 or ans != -1):\r\n# return True if ans != -1 else False\r\n# break\r\n \r\n# # print(isTriangular(253))\r\n\r\n# funky = False\r\n# for i in range(1, (-n//2)*-1):\r\n# if(isTriangular(i) and isTriangular(n - i)):\r\n# print('YES')\r\n# funky = True\r\n# break\r\n# if funky == False:\r\n# print('NO')\r\n\r\nimport math\r\n\r\nn = int(input())\r\nfor i in range(1, n):\r\n z = i*(i+1)\r\n if z > n:\r\n break\r\n \r\n t = int(math.sqrt(2*n-z))\r\n t = t * (t+1)\r\n if(t == 2 * n -z):\r\n print('YES')\r\n quit()\r\nprint('NO')\r\n\r\n#include <stdio.h>\r\n#include <math.h>\r\n# int main(){\r\n# int n,t;\r\n# \tscanf(\"%d\",&n);\r\n# \tfor(int i=1;i<n;i++){\r\n# \t\tint z=i*(i+1);\r\n# \t\tif(n<z)break;\r\n\t\t\r\n# \t\tt=(int)sqrt(2*n-z);\r\n# \t\tt=t*(t+1);\r\n# \t\tif(t==2*n-z)\r\n# \t\t{printf(\"YES\");return 0;}\r\n# \t}\r\n# \tprintf(\"NO\");\r\n# }", "def binarySearch(arr, l, r, x): \n while l <= r: \n mid = l + (r - l)//2; \n if arr[mid] == x: \n return mid \n elif arr[mid] < x: \n l = mid + 1\n else: \n r = mid - 1\n return -1\n \nn = int(input())\nll = []\nfor k in range(1, 47722):\n ll.append(int((k*(k+1))//2))\nfound = False \nfor k in (ll):\n j = n-k\n pos = binarySearch(ll, 0, len(ll)-1, j)\n if pos >= 0:\n found = True\n break\n\nif found:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \n\n \t\t \t\t \t\t\t \t \t\t\t\t\t\t\t \t", "n = int(input())\r\nif n == 2:\r\n print('YES')\r\nelse:\r\n l = [1]\r\n max1 = 1\r\n add1 = 2\r\n flag = 0\r\n while max1 < n:\r\n l.append(add1*(add1+1)//2)\r\n add1 += 1\r\n max1 = l[-1]\r\n left = 0\r\n right = len(l)-1\r\n while left <= right:\r\n mid = left + (right-left)//2\r\n if l[mid] + max1 == n:\r\n flag = 1\r\n break\r\n elif l[mid] + max1 < n:\r\n left = mid+1\r\n else:\r\n right = mid-1\r\n if flag == 1:\r\n print('YES')\r\n break\r\n if flag == 0:\r\n print('NO')", "'''input\n828\n''' \n\ndef main(): \n\n n = int(input())\n\n s = set()\n count = 1\n k = ((count)*(count+1))//2\n\n while( k <= n ):\n \ts.add(k)\n \tcount += 1\n \tk = ((count)*(count+1))//2\n \t\n\n\n for i in s:\n \tif(n - i in s):\n \t\tprint(\"YES\")\n \t\treturn\n\n print(\"NO\")\n\n\nif __name__ == \"__main__\": \n main()", "\n\nif __name__ == '__main__':\n N = 10**9\n tri_nums = set()\n i = 1\n while i * (i + 1) // 2 <= N:\n tri_nums.add(i * (i + 1) // 2)\n i += 1\n\n a = int(input())\n for num in tri_nums:\n if a - num in tri_nums:\n print(\"YES\")\n break\n else:\n print(\"NO\")\n", "#n=int(input())\r\n'''\r\nans=\"NO\"\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif n==(i*(i+1)/2)+(j*(j+1)/2):\r\n\t\t\tans=\"YES\"\r\nprint(ans)\r\n'''\r\n\r\ndef funky(n):\r\n\tarr=[]\r\n\ti=1\r\n\twhile (i*(i+1))/2<=n:\r\n\t\tarr.append((i*(i+1))/2)\r\n\t\ti+=1\r\n\tans=\"NO\"\r\n\ti=0\r\n\tj=len(arr)-1\r\n\twhile i<=j:\r\n\t\tvalue=arr[i]+arr[j]\r\n\t\tif value==n:\r\n\t\t\treturn \"YES\"\r\n\t\telif value<n:\r\n\t\t\ti+=1\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tj-=1\r\n\t\t\tcontinue\r\n\treturn ans\r\n\r\nprint(funky(int(input())))", "n = int(input())\r\nm = 2*n+0.5\r\nl = int(n**(1/2))\r\nflag = 0\r\nfor i in range(1,l+1):\r\n a = (m-((i+0.5)**(2)))**(1/2)-0.5 \r\n if a == int((m-((i+0.5)**(2)))**(1/2)-0.5) and a != 0:\r\n print(\"Yes\")\r\n flag = 1\r\n break\r\n i = i+1\r\nif flag == 0:\r\n print(\"No\")", "def is_triangular_sum(n):\n triangular_numbers = []\n i = 1\n while (i*(i+1))//2 <= n:\n triangular_numbers.append((i*(i+1))//2)\n i += 1\n\n l, r = 0, len(triangular_numbers) - 1\n while l <= r:\n if triangular_numbers[l] + triangular_numbers[r] == n:\n return \"YES\"\n elif triangular_numbers[l] + triangular_numbers[r] < n:\n l += 1\n else:\n r -= 1\n\n return \"NO\"\n\nn = int(input())\nprint(is_triangular_sum(n))\n \t\t \t \t\t\t \t\t\t", "n = int(input())\r\n\r\ns = set()\r\n\r\nfor i in range(n):\r\n t = (i*(i+1))//2\r\n if t < n:\r\n s.add(t)\r\n if n-t in s:\r\n print(\"YES\")\r\n exit()\r\n else:\r\n break\r\nprint(\"NO\")\r\n", "n=int(input())\r\na=set([k*(k+1)//2 for k in range(1,int(2*n**.5))])\r\ndef fn(a):\r\n for i in a:\r\n if n-i in a:return 'YES'\r\n return 'NO'\r\nprint(fn(a))\r\n\r\n", "import math\r\n\r\ndef checkTriangular(n):\r\n odd = 1+(8*n)\r\n oddsqrt = math.sqrt(odd)\r\n return oddsqrt==int(oddsqrt)\r\n\r\nnum = int(input())\r\nbool = False\r\ndiff = 1\r\ni = 1\r\nwhile i<=num//2:\r\n\tif checkTriangular(i) and checkTriangular(num-i):\r\n\t\tbool = True\r\n\t\tprint('YES')\r\n\t\tbreak \r\n\tdiff += 1\r\n\ti += diff \r\nif bool==False:\r\n print('NO')\r\n", "s=set([i*(i+1)//2 for i in range(1,50000)])\r\nn=int(input())\r\nk=set([n-i for i in s])\r\np=k.intersection(s)\r\nif len(p)>0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\nn=int(input())\r\ns=(2*n)**0.5\r\nx=math.ceil(s)\r\ni=1\r\nj=x\r\nc=0\r\nwhile i<=j:\r\n if (j*(j+1)//2)+(i*(i+1)//2)>n:\r\n j-=1\r\n elif (j*(j+1)//2)+(i*(i+1)//2)<n:\r\n i+=1\r\n elif (j*(j+1)//2)+(i*(i+1)//2)==n:\r\n print('YES')\r\n c+=1\r\n break\r\nif c==0:\r\n print('NO')\r\n", "from math import sqrt\nn = int(input())\nanswer = False\nfirstNum = int(sqrt(n))\nsecondNum = int(sqrt(n))\nwhile firstNum >= 1 and secondNum <= n:\n total = (firstNum * (firstNum + 1) / 2) + (secondNum * (secondNum + 1) / 2)\n if total == n:\n answer = True\n break\n if total > n:\n firstNum = firstNum - 1\n else:\n secondNum = secondNum + 1\nif answer == False:\n print(\"No\")\nelse:\n print(\"Yes\")\n\t\t\t \t\t \t\t \t\t \t\t\t\t \t \t\t\t\t\t\t\t\t \t", "n = int(input()); i = 1; mop = {}\r\nwhile i < 100001: mop[i*(i+1)/2] = 1; i += 1\r\nfor i in mop:\r\n if n-i in mop:print('YES'); exit();\r\nprint('NO')", "def binary_search(arr, start, end, x):\r\n if (end < start):\r\n # Element is not present in the array\r\n return -1\r\n else:\r\n mid = start + (end - start) // 2\r\n # If element is present at the middle\r\n if (arr[mid] == x):\r\n return mid\r\n # If element is smaller than mid\r\n elif (arr[mid] > x):\r\n return binary_search(arr, start, mid - 1, x)\r\n # Else the element greater than mid\r\n else:\r\n return binary_search(arr, mid + 1, end, x)\r\n\r\n\r\nn = int(input())\r\ntotal, num, c1, c2, mem = n * 2, 2, 2, 3, [2]\r\n\r\nwhile (c1 * c2 < total):\r\n mem.append(c1 * c2)\r\n c1 += 1\r\n c2 += 1\r\n\r\n\r\nfor i in mem:\r\n if binary_search(mem, 0, len(mem) - 1,total - i) != -1:\r\n exit(print('YES'))\r\n\r\nprint('NO')\r\n", "n=int(input())\r\ns=set()\r\ni=1\r\nwhile(i<100000):\r\n x=(i*(i+1))//2\r\n s.add(x)\r\n i=i+1\r\nfor i in s:\r\n if(n-i in s):\r\n print(\"YES\")\r\n exit()\r\nelse:\r\n print(\"NO\")\r\n", "z=int(input())\r\nd={}\r\ni=1\r\nwhile i*(i+1)/2<z:\r\n if d.get(i*(i+1)/2,0)==0:\r\n d[i*(i+1)/2]=1\r\n i+=1\r\nc=1\r\nwhile c*(c+1)/2<z:\r\n g=z-c*(c+1)/2\r\n if d.get(g,0)!=0 and d[g]==1 :\r\n print(\"YES\")\r\n exit()\r\n c+=1\r\nprint(\"NO\")", "def main():\r\n n = int(input())\r\n lookup = set()\r\n k = 1\r\n while k * (k + 1) // 2 <= n:\r\n lookup.add(k * (k + 1) // 2)\r\n k += 1\r\n\r\n ok = False\r\n for elm in lookup:\r\n if elm < n:\r\n if n - elm in lookup:\r\n ok = True\r\n if ok:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nposi=int(n**0.5)\r\nif posi*(posi+1)==n:\r\n print(\"YES\")\r\nelse:\r\n value=n*2\r\n i,j=posi,posi\r\n k=int(value**0.5)\r\n while (i>=1 and j<=k):\r\n summ=i*(i+1)+j*(j+1)\r\n if summ==value:\r\n break\r\n elif summ>value:\r\n i-=1\r\n else:\r\n j+=1\r\n if summ==value:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n \r\n ", "T = {k * (k + 1) // 2 for k in range(1, 44721)}\r\nn = int(input())\r\nif any(n - j in T for j in T):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\nr=lambda x:(x*(x+1))//2\r\nz=[r(i) for i in range(1,50001)]\r\nz=Counter(z)\r\ndef check(a):\r\n for i in z:\r\n if z[a-i] :return \"YES\"\r\n return \"NO\"\r\nprint(check(int(input())))", "def es_suma_triangular(num):\n numeros_triangulares = set()\n k = 1\n while True:\n triangular = k * (k + 1) // 2\n if triangular > num:\n break\n numeros_triangulares.add(triangular)\n k += 1\n\n for numero in numeros_triangulares:\n if num - numero in numeros_triangulares:\n return \"YES\"\n return \"NO\"\n\nnum = int(input())\nprint(es_suma_triangular(num))\n\n \t\t \t\t\t \t\t\t\t \t \t\t", "hash_set = set()\nfor i in range(1,10**5):\n hash_set.add(i*(i+1)//2)\nn = int(input())\n\nif n==1:\n print('NO')\n exit()\n\ni = 1\nwhile True:\n temp = (i * (i+1) // 2 )\n if temp > n:\n print('NO')\n break\n elif (n - temp) in hash_set:\n print('YES')\n break\n i += 1\n\t \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\nhashmap = {}\r\nk = 2 * math.ceil(math.sqrt(n))\r\nfor i in range(1, k):\r\n m = (i * (i + 1)) // 2\r\n hashmap[m] = 1\r\nflag = 1\r\nfor key in hashmap:\r\n if n - key in hashmap:\r\n print(\"YES\")\r\n flag = 0\r\n break\r\nif flag == 1:\r\n print(\"NO\")", "from itertools import combinations\r\nn = int(input())\r\ns = set()\r\nfor i in range(1,50000):\r\n\tx = i*(i+1)//2\r\n\ts.add(x)\r\nfor i in s:\r\n\tif n-i in s:\r\n\t\tprint (\"YES\")\r\n\t\texit()\r\nprint (\"NO\")", "def coolest_number(number):\r\n global flag\r\n\r\n tnum = set()\r\n init = 0\r\n i = 0\r\n \r\n while True:\r\n if i > number:\r\n break\r\n else:\r\n init += 1\r\n i = init + i\r\n tnum.add(i)\r\n \r\n for x in tnum:\r\n found = 0\r\n x_ = number - x\r\n if x_ in tnum:\r\n print('YES')\r\n found = 1\r\n break\r\n\r\n if found == 0:\r\n print('NO')\r\n flag = 1\r\n pass\r\n\r\nif __name__ == '__main__':\r\n flag = 0\r\n MAX = 10**9\r\n MIN = 1\r\n while flag == 0:\r\n input_number = input()\r\n input_number = input_number.split(' ')\r\n if (len(input_number) == 1):\r\n input_number = input_number[0]\r\n if (input_number.isdigit()):\r\n input_number = int(input_number)\r\n if (input_number >= MIN) & (input_number <= MAX):\r\n coolest_number(input_number)\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')", "def binarySearch (arr, l, r, x): \r\n if r >= l: \r\n mid = l + (r - l)//2\r\n if arr[mid] == x: \r\n return mid \r\n elif arr[mid] > x: \r\n return binarySearch(arr, l, mid-1, x) \r\n else: \r\n return binarySearch(arr, mid + 1, r, x) \r\n else: \r\n return -1\r\nn=int(input())\r\ni=t=1\r\na=[]\r\nx=0\r\nwhile(x<1000000000):\r\n x=i*(i+1)\r\n x//=2\r\n a.append(x)\r\n i+=1\r\nfor i in a:\r\n x=n-i\r\n if(binarySearch(a,0,len(a),x)!=-1):\r\n print(\"YES\")\r\n t=0\r\n break\r\nif(t==1):\r\n print(\"NO\")", "import math\nn = int(input())\nx = 0\nfunky = False\nfor i in range(1,n):\n if i*(i+1) > n:\n break\n x = int(round(math.sqrt((n*2)-(i*(i+1)))))\n if i*(i+1) + x*(x+1) == 2*n:\n funky = True\n break\nif funky:\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", "p=set([(i*(i+1))//2 for i in range(1,45000)])\r\nn=int(input())\r\nok='NO'\r\nfor i in p:\r\n if n-i in p:\r\n ok='YES'\r\n break\r\nprint(ok)\r\n", "n=int(input())\r\nll,k,x=[],1,0\r\nwhile x<=10**9:\r\n x=k*(k+1)//2\r\n k+=1\r\n ll.append(x)\r\nd,u=0,44721\r\nwhile d<u:\r\n m=(d+u)//2\r\n if ll[m]<n:\r\n d=m+1\r\n else:\r\n u=m\r\ni,j=0,d\r\nflag=False\r\nwhile i<=j:\r\n x=ll[i]+ll[j]\r\n if x>n:\r\n j-=1\r\n elif x<n:\r\n i+=1\r\n else:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "def fastio():\r\n\timport sys\r\n\tfrom io import StringIO \r\n\tfrom atexit import register\r\n\tglobal input\r\n\tsys.stdin = StringIO(sys.stdin.read())\r\n\tinput = lambda : sys.stdin.readline().rstrip('\\r\\n')\r\n\tsys.stdout = StringIO()\r\n\tregister(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\r\nfastio()\r\n\r\nI = lambda :list(map(int, input().split()))\r\n\r\na = set()\r\nfor i in range(1, 100000):\r\n a.add(i*(i+1)//2)\r\nn, = I()\r\nfor i in a:\r\n if (n-i) in a:\r\n print('YES')\r\n exit()\r\nprint('NO')", "from math import sqrt\r\nn = int(input())\r\nfor i in range(1,int(sqrt(n))+1):\r\n low = i\r\n high = n\r\n j = 0\r\n while low <= high:\r\n j = (high + low) // 2\r\n if 2*n == i*(i+1) + j*(j+1):\r\n print('YES')\r\n exit()\r\n elif 2*n > i*(i+1) + j*(j+1):\r\n low = j + 1\r\n elif 2*n < i*(i+1) + j*(j+1):\r\n high = j - 1\r\nprint('NO')", "import math\n\nif __name__ == '__main__':\n\tn = int(input())\n\n\tdig = 2 * n\n\tflag = False\n\tfor i in range(1, int(math.sqrt(2 * n + 1))):\n\t\tif (i * i + i > dig):\n\t\t\tbreak\n\t\trest = dig - i * i - i\n\t\tleft = 1\n\t\tright = dig\n\t\twhile (left <= right):\n\t\t\tmid = (left + right) // 2\n\t\t\tif (mid * mid + mid > rest):\n\t\t\t\tright = mid - 1\n\t\t\telif(mid * mid + mid == rest):\n\t\t\t\tflag = True\n\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tleft = mid + 1\n\t\t\n\t\tif (flag):\n\t\t\tbreak\n\t\n\tif (flag):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n \t \t\t \t\t \t\t\t\t\t\t\t\t \t \t\t", "# cook your dish here\r\nn=int(input())\r\nsum=1\r\nj=1\r\nans='NO'\r\nwhile j<= n//2:\r\n k=n-j\r\n p=int((8*k+1)**(0.5))\r\n if p*p==8*k+1:\r\n ans=\"YES\"\r\n break\r\n sum+=1\r\n j+=sum\r\nprint(ans)", "n = int(input())\r\n\r\n\r\ndef triangular_number(k):\r\n return int(k*(k+1)/2)\r\n\r\nfound = False\r\nfor i in range(1, n):\r\n a = triangular_number(i)\r\n b = n - a\r\n try:\r\n found = int((2*b + 0.25)**0.5 - 0.5) == (2*b + 0.25)**0.5 - 0.5 and int((2*b + 0.25)**0.5 - 0.5) > 0\r\n except:\r\n found = False\r\n break\r\n if found:\r\n print(\"YES\")\r\n break\r\nif not found:\r\n print(\"NO\")", "n = int( input() )\r\n\r\ndef f( n ):\r\n return ( n*( n+1 )//2 )\r\n\r\nmemo = {}\r\ni=1\r\nlimit = 10**9\r\nwhile True:\r\n tmp = f(i)\r\n if tmp > limit:\r\n break\r\n memo[tmp] = 1\r\n i += 1\r\n\r\nfor i in memo:\r\n if i > n:\r\n break\r\n if n-i in memo:\r\n print( \"YES\" )\r\n exit(0)\r\n\r\nprint( \"NO\" )\r\n", "def trinum(n):\r\n return (n*(n+1))//2\r\n \r\nn = int(input())\r\ns = set()\r\nf = True\r\ni = 1\r\nwhile f:\r\n tri = trinum(i)\r\n if tri <= n:\r\n s.add(tri)\r\n i+=1\r\n else:\r\n break\r\nfs = False\r\n\r\nfor i in s:\r\n if (n-i) in s:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "import math\r\nn=int(input())\r\ns=[]\r\nflag=0\r\nfor i in range(1,10**5):\r\n s.append(i*(i+1)//2)\r\ns=set(s)\r\nfor j in s:\r\n if n-j in s:\r\n flag=1\r\nif flag==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def solve() :\n k=1\n val={}\n while True:\n nval=k*(k+1)//2\n if nval>= n :\n break\n val[nval]=1\n k+=1\n for i in val :\n if n-i in val :\n return \"YES\"\n return \"NO\"\n \n \n\n \n\n\n\n \nfrom sys import stdin\ninput = stdin.readline \n \n \nn=int(input())\nprint(solve())\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\n\nn=int(input())\narr=[int(x) for x in input().split()]\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'''", "def validaSumaTriangular(n):\n # Se calculan todos los números triangulares hasta n\n triangulares = set()\n for i in range(1, n):\n x = i * (i + 1) // 2\n if x >= n:\n break\n triangulares.add(x)\n\n # Se revisa si existe un par\n for par in triangulares:\n if n - par in triangulares:\n return True\n return False\n\nif __name__ == \"__main__\":\n n = int(input())\n if validaSumaTriangular(n):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\t \t \t \t\t\t\t \t\t \t \t \t\t \t", "import math \r\nn = int(input())\r\ndef isTriangular(n):\r\n c = 0\r\n x = (8*n + 1)\r\n if math.sqrt(x) == int(math.sqrt(x)):\r\n c=1\r\n return c\r\nans = 0\r\nz = n//2\r\nt = 1\r\ni = 1\r\nwhile i <= z:\r\n if isTriangular(n-i) == 1 and isTriangular(i) == 1: \r\n ans = 1\r\n print('YES')\r\n break\r\n t += 1\r\n i += t \r\nif ans == 0:\r\n print('NO')", "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 = set()\r\nu = 1\r\nans = \"NO\"\r\nwhile True:\r\n v = u * (u + 1) // 2\r\n if v > n:\r\n break\r\n s.add(v)\r\n if n - v in s:\r\n ans = \"YES\"\r\n break\r\n u += 1\r\nprint(ans)", "def main():\n from bisect import bisect_left\n n = int(input()) * 2\n l = [i * (i + 1) for i in range(1, int(n ** .5) + 2)]\n for a in l:\n b = l[bisect_left(l, n - a)]\n if b <= a or a + b == n:\n break\n print((\"NO\", \"YES\")[a + b == n])\n\n\nif __name__ == '__main__':\n main()\n", "def f(a):\r\n return (a * (a + 1)) / 2\r\n\r\nn = int(input()) \r\ns = set()\r\ni = 1\r\nwhile f(i) <= 1000000000:\r\n s.add(f(i))\r\n i = i + 1\r\nfind = False\r\nfor el in s:\r\n if n - el in s:\r\n find = True\r\n print(\"YES\")\r\n break\r\nif not find:\r\n print(\"NO\")\r\n ", "def funk(n):\r\n k = int((2*n)**0.5)\r\n for j in range(1,k):\r\n num1 = ((j)*(j+1))//2\r\n tmp = n-num1\r\n d = (1+(8*tmp))\r\n if d<0:continue\r\n\r\n poss = ((d**0.5)-1)/2\r\n if poss.is_integer():\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n print(funk(n))", "import math\r\n\r\ndef bsearch(z,n):\r\n left=1\r\n right=math.sqrt(2*n)\r\n while left<=right:\r\n mid=left+((right-left)//2)\r\n ans=z+mid**2+mid\r\n if ans==2*n:\r\n return True\r\n elif ans<2*n:\r\n left=mid+1\r\n else:\r\n right=mid-1\r\n return False\r\n\r\nn=int(input())\r\nm=1\r\nwhile m*m<=2*n:\r\n #z,ans=0,0\r\n z=(m**2)+m\r\n if bsearch(z,n):\r\n print('YES')\r\n break\r\n m+=1\r\nelse:\r\n print('NO')", "n=int(input())\r\ns=set()\r\nfor i in range(1,45000):\r\n s.add((i*(i+1))//2)\r\nc=0\r\nfor i in s:\r\n if(n-i in s):\r\n c=1\r\n break\r\nif(c==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=[]\r\nd={}\r\nfor x in range(1, 100000):\r\n\tl.append((x*(x+1))//2)\r\n\td[(x*(x+1))//2]=True\r\nn=int(input())\r\nfor x in l:\r\n\tif x<=n and n-x in d:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nprint(\"NO\")", "k_values = [(i*(i+1)//2) for i in range(1,45000)]\r\nn =int(input())\r\nprint(\"YES\" if any([True for i in k_values if n-i in k_values]) else\"NO\")\r\n\r\n", "n = int(input())\r\nmp = set()\r\nfor i in range(1,10**5+1):\r\n mp.add((i*(i+1))//2)\r\n\r\nflag = 0\r\nfor i in mp:\r\n if(n-i > 0 and n-i in mp):\r\n print(\"YES\")\r\n flag = 1\r\n break\r\nif(flag == 0):\r\n print(\"NO\")\r\n", "def isATriangleNumber(n):\r\n l=0\r\n r=n\r\n while r-l>1:\r\n m = (l+r)//2\r\n if m*(m+1) >= 2*n:\r\n r=m\r\n else:\r\n l=m\r\n\r\n return r*(r+1) == 2*n\r\nn = int(input())\r\ni=1\r\nwhile i*(i+1)<2*n:\r\n firstTriangleNumber = i*(i+1)//2\r\n if(isATriangleNumber(n-firstTriangleNumber)):\r\n print(\"YES\")\r\n quit()\r\n\r\n i+=1\r\nprint(\"NO\")\r\n", "n=int(input())\r\ns=set()\r\ni=1\r\nwhile i<100000:\r\n x=(i*(i+1))//2\r\n s.add(x)\r\n i+=1\r\nfor i in s:\r\n if n-i in s:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "s=set([i*(i+1)/2 for i in range(1,50000)])\r\nn=int(input())\r\nprint([\"NO\",\"YES\"][any(n-t in s for t in s)])", "x=int(input())\r\ny=x//2+1\r\nz=1\r\nflag=False\r\nb=1\r\nif x==1:\r\n print(\"NO\")\r\nelse:\r\n while z <= y:\r\n a = x - z\r\n if (-1 + (1 + 4 * 2 * a) ** 0.5) / 2 == (-1 + (1 + 4 * 2 * a) ** 0.5) // 2:\r\n print(\"YES\")\r\n flag = True\r\n break\r\n b += 1\r\n z = ((b + 1) * (b)) // 2\r\n if flag == False:\r\n print(\"NO\")\r\n\r\n", "n=int(input())\r\nyep={}\r\nfor i in range(1,10**5+1):\r\n yep[i*(i+1)//2]=1\r\n\r\nfor i in yep:\r\n if n-i in yep:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "n=int(input())\r\nd={}\r\nt=0\r\nfor i in range(1,10**5):\r\n d[i*(i+1)/2]=1\r\nfor i in range(1,10**5):\r\n if n-(i*(i+1)/2) in d:\r\n t=1\r\n break\r\nif t:\r\n print('YES')\r\nelse:\r\n print('NO')", "T={k*(k+1)//2 for k in range(1,44721)}\r\nn=int(input())\r\nif any(n-j in T for j in T):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from math import sqrt\r\nimport bisect\r\nn=int(input())\r\nl=[]\r\nfor i in range (1,int(sqrt(2*n)+ 1)):\r\n l.append(i*(i+1))\r\nflag=0\r\n# print(l,len(l))\r\nfor i in range(len(l)):\r\n needed=(2*n)-l[i]\r\n j=bisect.bisect_left(l,2*n-l[i])\r\n if j<len(l):\r\n # print(i,j,l[i],l[j])\r\n\r\n if l[i]+l[j]==2*n:\r\n flag=1\r\n break\r\n # else:\r\n # print(i,j)\r\nprint(\"YES\" if flag==1 else \"NO\")\r\n", "import sys\n\nnum = input()\nnum = int(num)\n\ndef calculate(num):\n return num * (num+1) / 2\n\nmySet = set()\nmySet.add(num/2)\nfor i in range(1, num):\n if(calculate(i) > num): # No se encontro un posible\n break\n\n if calculate(i) in mySet:\n print(\"YES\")\n sys.exit()\n\n mySet.add(num-calculate(i))\n\nprint(\"NO\")\n\t\t \t \t\t\t\t \t \t \t\t \t\t\t\t", "n=int(input())\r\nk=1\r\narr=[]\r\nwhile (k*(k+1))//2<=n:\r\n arr.append((k*(k+1))//2)\r\n k+=1\r\nstart=0\r\nend=len(arr)-1\r\nflag=0\r\nwhile start<=end:\r\n k=arr[start]+arr[end]\r\n if k<n:\r\n start+=1\r\n continue\r\n if k>n:\r\n end-=1\r\n continue\r\n else:\r\n flag=1\r\n break\r\nif flag==1:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "a = set([i*(i+1)//2 for i in range(1,50000)])\r\nn = int(input())\r\nprint(\"YES\" if any(n-t in a for t in a) else \"NO\")", "from collections import defaultdict\r\nn = int(input())\r\na = 1\r\nb = 2\r\nd = defaultdict(int)\r\nd[a] += 1\r\nwhile a < 10**9 and a < n:\r\n if d[n-a] == 1:\r\n print('YES')\r\n break\r\n a = a + b\r\n b += 1\r\n d[a] += 1\r\nelse:\r\n print('NO')", "n = int(input())\r\ndic = {}\r\ncheck = 0\r\nfor i in range(1, 10 ** 5):\r\n dic[i * (i + 1) / 2] = 1\r\nfor i in range(1, 10 ** 5):\r\n if n - (i * (i + 1) / 2) in dic:\r\n check = 1\r\n break\r\nif check: print('YES')\r\nelse: print('NO')", "\r\nN = 10**5 + 1\r\nn = int(input())\r\nst = set()\r\n\r\nfor i in range(1, N):\r\n st.add(i * (i + 1) // 2)\r\nok=False\r\nfor num in st:\r\n if n - num > 0 and (n - num) in st:\r\n ok=True\r\n break\r\nif ok:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\nimport os\r\nfrom math import*\r\ninput=sys.stdin.buffer.readline\r\n\r\nn=int(input())\r\nx=int(max(int((-1+sqrt(1+8*n))//2),(-1-sqrt(1+8*n))//2))\r\nz=0\r\nwhile x>0:\r\n\tc=n-(x*(x+1)//2)\r\n\tif c==0:\r\n\t\tx-=1\r\n\telse:\r\n\t\tk=int(max(int((-1+sqrt(1+8*c))//2),(-1-sqrt(1+8*c))//2))\r\n\t\tif k*(k+1)//2==c:\r\n\t\t\tz=1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tx-=1\r\nif z==1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "def is_triangular(x):\n k = int(((-1 + (1 + 8 * x) ** 0.5) / 2))\n return k * (k + 1) // 2 == x\n\nn = int(input())\nans = \"NO\"\n\nfor k in range(1, int((2 * n) ** 0.5) + 1):\n T_k = k * (k + 1) // 2\n if T_k >= n:\n break\n if is_triangular(n - T_k):\n ans = \"YES\"\n break\n\nprint(ans)\n\t\t\t\t\t \t \t \t \t\t \t\t\t\t\t\t\t \t \t", "\r\nn = int(input())\r\n\r\nfn = []\r\nk=1\r\nwhile True:\r\n num = (k*(k+1))//2\r\n if num>n:\r\n break\r\n fn.append(num)\r\n k+=1\r\ni=0\r\nj=len(fn)-1\r\n\r\nwhile i<=j:\r\n if fn[i]+fn[j]==n:\r\n print(\"YES\")\r\n break\r\n elif fn[i]+fn[j]<n:\r\n i+=1\r\n else:\r\n j-=1\r\n\r\nif i>j or fn[i]+fn[j]!=n:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "#triangle numbers\n#k(k-1)/2\n#representated sum of 2 trinagular numbers\n#after some algerba i got: f=k(k+k)\n# k**2=n-k\n#k=n*2 - (k*(k-1))\n# finaly 2n=k(k+1) + k(k+1)\nimport math\ndef funkyNumbers():\n n=int(input())\n i=1\n con=0\n for i in range(1,n):\n if i*(i+1)>n:\n break\n k=int(round(math.sqrt((n*2)-(i*(i+1)))))\n if i*(i+1)+ k*(k+1)==2*n:\n return \"YES\"\n return \"NO\"\nprint(funkyNumbers())\n \n \n \n\n \t\t\t\t \t \t\t \t \t\t \t\t \t \t \t \t\t\t", "def search(n, arr):\r\n start, end = 0, l-1\r\n while start <= end:\r\n mid = (start + end) // 2\r\n if arr[mid] == n:\r\n return True\r\n elif n <= arr[mid]:\r\n end = mid-1\r\n else:\r\n start = mid+1\r\n return False\r\n\r\nn = int(input())\r\nfunky = []\r\ni = 1\r\nwhile True:\r\n num = i*(i+1) // 2\r\n if num <= n:\r\n funky.append(num)\r\n else:\r\n break\r\n i += 1\r\nl = len(funky)\r\n\r\ni, flag = 1, False\r\nwhile i*i <= n:\r\n complement = n - (i*(i+1)) // 2\r\n if search(complement, funky):\r\n flag = True\r\n break\r\n i += 1\r\nprint(\"YES\" if flag else \"NO\")\r\n", "import math\r\nimport sys\r\n\r\ndef main():\r\n n = int(input())# m = map(int, input().split())\r\n s = 1\r\n had = set()\r\n n *= 2\r\n while s * (s + 1) <= n:\r\n had.add(s * (s + 1))\r\n if n - s * (s + 1) in had:\r\n print(\"YES\")\r\n return\r\n s += 1\r\n print(\"NO\")\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1 # int(input())\r\n while t > 0:\r\n main()\r\n t -= 1\r\n", "# from collections import defaultdict,deque,OrderedDict\r\n# from sys import stdin\r\n# import itertools\r\nimport bisect\r\n# from math import sqrt,ceil,floor,gcd,sin,radians\r\n# from sortedcontainers import SortedList\r\n\r\n\r\ndef func(put,mapping,unpack):\r\n n=put(int)\r\n v=[1,3,6,10,15,21,28]\r\n for i in range(8,1000000): v.append((i*(i+1))//2)\r\n for e in v:\r\n if e>n: break\r\n req = n-e\r\n idx = bisect.bisect_left(v,req)\r\n if idx != len(v) and v[idx] == req: print('YES'); return\r\n print('NO')\r\n\r\ndef init(TestCases=True):\r\n put = lambda s: s(input().strip())\r\n mapping = lambda s: list(map(s,input().split()))\r\n unpack = lambda s: map(s,input().split())\r\n for _ in range(int(input()) if TestCases else 1):\r\n func(put,mapping,unpack)\r\n\r\nif __name__ == '__main__':\r\n init(False)", "x = int(input())\r\ny = 0\r\nchecker = 0\r\n#print(int(506 ** 0.5))\r\nfor i in range(1,2 * int(x ** 0.5)):\r\n y = (2 * x) - (i * (i+1))\r\n if y > 0:\r\n q = int(y ** 0.5)\r\n if q * (q + 1) + (i * (i + 1)) == (2 * x):\r\n checker = 1\r\n #print(i)\r\n #print(int(y ** 0.5))\r\n print(\"YES\")\r\n break\r\n\r\nif checker == 0:\r\n print(\"NO\")", "n=int(input())\r\ni=1\r\na=0\r\nl=[]\r\nc=0\r\nwhile(a<=n):\r\n a=(i*(i+1))//2\r\n l.append(a)\r\n i=i+1\r\nfor i in range(len(l)):\r\n if(n-l[i]) in l:\r\n c=1\r\n break\r\nif c==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "from math import gcd, sqrt, log\r\nfrom functools import cmp_to_key\r\nfrom string import ascii_uppercase as alph\r\nimport os, sys\r\nfrom itertools import permutations\r\n\r\nif os.path.exists('input.txt'):\r\n\tsys.stdin = open('input.txt')\r\n\tsys.stdout = open('output.txt', 'w')\r\n \r\nINF = float('inf')\r\n\r\ndef isPrime(n):\r\n\tif n == 1: return 0\r\n\tif n % 2 == 0: return n == 2\r\n\ti = 3\r\n\twhile i * i <= n:\r\n\t\tif n % i == 0:\r\n\t\t\treturn 0\r\n\t\ti += 2\r\n\treturn 1\r\n\r\ndef divCeil(a, b):\r\n\treturn (a - 1) // b + 1\r\n\r\ndef readInt():\r\n\treturn [int(i) for i in input().strip().split()]\r\n\r\ndef readStr():\r\n\treturn [str(i) for i in input().strip().split()]\r\n\r\ndef check(days):\r\n\tglobal n\r\n\tglobal m\r\n\tx = min(days * m, n)\r\n\treturn x <= days * (days + 1) // 2\r\n\r\ndef bin_search(low, high):\r\n\tprint(low, high)\r\n\tmid = (low + high) // 2\r\n\tif low == high:\r\n\t\treturn mid\r\n\tif low + 1 == high:\r\n\t\tif check(low):\r\n\t\t\treturn low\r\n\t\treturn high\r\n\tif not check(mid) and check(mid + 1):\r\n\t\treturn mid + 1\r\n\tif not check(mid - 1) and check(mid):\r\n\t\treturn mid\r\n\tif check(mid) and check(mid - 1):\r\n\t\treturn bin_search(low, mid)\r\n\treturn bin_search(mid, high)\r\n\r\nn = int(input())\r\nk = 1\r\nwhile k * (k + 1) <= n:\r\n\tneed = n - k * (k + 1) // 2\r\n\tneed *= 2\r\n\tk1 = int(sqrt(need))\r\n\tif k * (k + 1) // 2 + k1 * (k1 + 1) // 2 == n:\r\n\t\tprint('YES')\r\n\t\texit()\r\n\tk += 1\r\nprint('NO')\r\n" ]

[ "from collections import defaultdict as dd, deque as dq, Counter as ctr\r\nfrom itertools import accumulate\r\nfrom re import findall\r\nimport re\r\nimport sys\r\n\r\n\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode('utf-8').rstrip('\\r\\n')\r\n \r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom array import array\r\n\r\ninp = lambda: int(input())\r\nmi = lambda x=int : map(x, input().split())\r\narr= lambda d='i',x=int: array(d,mi(x))\r\nli = lambda x=int: list(mi(x))\r\nlb = lambda x=int: list(map(x, input()))\r\nls = lambda: list(input())\r\nbi = lambda n: bin(n).replace(\"0b\", \"\")\r\n\r\ndef sbsq(a,s):\r\n i=0\r\n for x in s:\r\n if i>=len(a):\r\n break\r\n if x==a[i]:\r\n i+=1\r\n return i==len(a)\r\n\r\nyn = ['No', 'Yes']\r\nYN = ['NO', 'YES']\r\nYY = \"YES\"\r\nNN = \"NO\"\r\nyy = \"Yes\"\r\nnn = \"No\"\r\nalp='abcdefghijklmnopqrstuvwxyz'\r\ninf= sys.maxsize\r\nmod=1000000007\r\n\r\nimport heapq as hq\r\n\r\n# print =lambda x: sys.stdout.buffer.write(x.encode('utf-8'))\r\nmod=998244353\r\n# from math import comb\r\nfrom math import ceil,sqrt,gcd\r\n\r\n\r\n\r\ndef main(kase):\r\n n,m=mi()\r\n grd=[li() for i in range(n)]\r\n dpnm=[[0]*m for i in range(n)]\r\n dp0m=[[0]*m for i in range(n)]\r\n dpn0=[[0]*m for i in range(n)]\r\n dp00=[[0]*m for i in range(n)]\r\n for i in range(n):\r\n for j in range(m):\r\n dpnm[i][j]=grd[i][j]\r\n dp00[-i-1][-j-1]=grd[-i-1][-j-1]\r\n if i>0:\r\n dpnm[i][j]=dpnm[i-1][j]+grd[i][j]\r\n dp00[-i-1][-1-j]=dp00[-i][-1-j]+grd[-i-1][-1-j]\r\n if j>0:\r\n dpnm[i][j]=max(dpnm[i][j],dpnm[i][j-1]+grd[i][j])\r\n dp00[-i-1][-1-j]=max(dp00[-i-1][-1-j],dp00[-i-1][-j]+grd[-i-1][-1-j])\r\n for i in range(n-1,-1,-1):\r\n for j in range(m):\r\n dp0m[i][j]=grd[i][j]\r\n dpn0[-i-1][-j-1]=grd[-i-1][-j-1]\r\n if i<n-1:\r\n dp0m[i][j]=dp0m[i+1][j]+grd[i][j]\r\n dpn0[-i-1][-j-1]=dpn0[-i-2][-j-1]+grd[-i-1][-j-1]\r\n if j>0:\r\n dp0m[i][j]=max(dp0m[i][j],dp0m[i][j-1]+grd[i][j])\r\n dpn0[-i-1][-j-1]=max(dpn0[-i-1][-j-1],dpn0[-i-1][-j]+grd[-i-1][-j-1])\r\n ans=0\r\n # for x in [dp00,dp0m,dpn0,dpnm]:\r\n # for y in x:\r\n # print(y)\r\n for i in range(1,n-1):\r\n for j in range(1,m-1):\r\n ans=max(ans,dpn0[i-1][j]+dp0m[i+1][j]+dp00[i][j+1]+dpnm[i][j-1],dpn0[i][j+1]+dp0m[i][j-1]+dp00[i+1][j]+dpnm[i-1][j])\r\n print(ans)\r\n pass\r\nif __name__ == \"__main__\":\r\n test_Cases=1\r\n # test_Cases=inp()\r\n for i in range(test_Cases):\r\n main(i)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nn,m = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int,input().split()))) \r\ndp1 = [[None for i in range(m)] for i in range(n)]\r\ndp2 = [[None for i in range(m)] for i in range(n)]\r\ndp3 = [[None for i in range(m)] for i in range(n)]\r\ndp4 = [[None for i in range(m)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if i == 0 and j == 0:\r\n dp1[i][j] = l[i][j]\r\n elif i == 0:\r\n dp1[i][j] = dp1[i][j-1] + l[i][j]\r\n elif j == 0:\r\n dp1[i][j] = dp1[i-1][j] + l[i][j]\r\n else:\r\n dp1[i][j] = max(dp1[i-1][j],dp1[i][j-1]) + l[i][j] \r\nfor i in range(n-1,-1,-1):\r\n for j in range(m):\r\n if i == n-1 and j == 0:\r\n dp2[i][j] = l[i][j]\r\n elif i == n-1:\r\n dp2[i][j] = dp2[i][j-1] + l[i][j]\r\n elif j == 0:\r\n dp2[i][j] = dp2[i+1][j] + l[i][j]\r\n else:\r\n dp2[i][j] = max(dp2[i+1][j],dp2[i][j-1]) + l[i][j]\r\nfor i in range(n-1,-1,-1):\r\n for j in range(m-1,-1,-1):\r\n if i == n-1 and j == m-1:\r\n dp3[i][j] = l[i][j]\r\n elif i == n-1:\r\n dp3[i][j] = dp3[i][j+1] + l[i][j]\r\n elif j == m-1:\r\n dp3[i][j] = dp3[i+1][j] + l[i][j] \r\n else:\r\n dp3[i][j] = max(dp3[i+1][j],dp3[i][j+1]) + l[i][j]\r\nfor i in range(n):\r\n for j in range(m-1,-1,-1):\r\n if i == 0 and j == m-1:\r\n dp4[i][j] = l[i][j]\r\n elif i == 0:\r\n dp4[i][j] = dp4[i][j+1] + l[i][j]\r\n elif j == m - 1:\r\n dp4[i][j] = dp4[i-1][j] + l[i][j]\r\n else:\r\n dp4[i][j] = max(dp4[i-1][j],dp4[i][j+1]) + l[i][j]\r\nma = 0 \r\nfor i in range(n):\r\n for j in range(m):\r\n if i == 0 or j == 0 or i == n-1 or j == m-1:\r\n continue\r\n else:\r\n ma = max(ma,dp1[i-1][j] + dp3[i+1][j] + dp2[i][j-1] + dp4[i][j+1],dp4[i-1][j]+dp2[i+1][j] + dp1[i][j-1] + dp3[i][j+1])\r\nprint(ma)\r\n\r\n", "n,m=map(int,input().split())\r\na=[]\r\nfor i in range(n):a.append(list(map(int,input().split())))\r\ndpa=[[[0,0] for i in range(m+2)] for i in range(n+2)]\r\ndpb=[[[0,0] for i in range(m+2)] for i in range(n+2)]\r\nans=0\r\nfor i in range(1,n+1):\r\n\tfor j in range(1,m+1):\r\n\t\tdpa[i][j][0]=max(dpa[i-1][j][0],dpa[i][j-1][0])+a[i-1][j-1]\r\n\t\tdpa[n+1-i][m+1-j][1]=max(dpa[n+2-i][m+1-j][1],dpa[n+1-i][m+2-j][1])+a[n-i][m-j]\r\nfor i in range(n,0,-1):\r\n\tfor j in range(1,m+1):\r\n\t\tdpb[i][j][0]=max(dpb[i+1][j][0],dpb[i][j-1][0])+a[i-1][j-1]\r\n\t\tdpb[n+1-i][m+1-j][1]=max(dpb[n-i][m+1-j][1],dpb[n+1-i][m+2-j][1])+a[n-i][m-j]\r\nfor i in range(2,n):\r\n\tfor j in range(2,m):\r\n\t\tx=dpa[i-1][j][0]+dpa[i+1][j][1]+dpb[i][j-1][0]+dpb[i][j+1][1]\r\n\t\ty=dpb[i+1][j][0]+dpb[i-1][j][1]+dpa[i][j-1][0]+dpa[i][j+1][1]\r\n\t\tans=max(ans,x,y)\r\nprint(ans)", "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\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n # from sys import stdin\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 sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\n\r\nn,m=L()\r\nA=[L() for i in range(n)]\r\nA1=[[0 for i in range(m+2)] for j in range(n+2)]\r\nA2=[[0 for i in range(m+2)] for j in range(n+2)]\r\nA3=[[0 for i in range(m+2)] for j in range(n+2)]\r\nA4=[[0 for i in range(m+2)] for j in range(n+2)]\r\nfor i in range(1,1+n):\r\n for j in range(1,1+m):\r\n A1[i][j]=max(A1[i][j-1],A1[i-1][j])+A[i-1][j-1]\r\nfor i in range(n,0,-1):\r\n for j in range(m,0,-1):\r\n A2[i][j]=max(A2[i][j+1],A2[i+1][j])+A[i-1][j-1]\r\nfor i in range(n,0,-1):\r\n for j in range(1,1+m):\r\n A3[i][j]=max(A3[i][j-1],A3[i+1][j])+A[i-1][j-1]\r\nfor i in range(1,1+n):\r\n for j in range(m,0,-1):\r\n A4[i][j]=max(A4[i][j+1],A4[i-1][j])+A[i-1][j-1]\r\n\r\nans=0\r\nfor i in range(2,n):\r\n for j in range(2,m):\r\n ans = max(ans,A1[i][j-1] + A2[i][j+1] + A3[i+1][j] + A4[i-1][j])\r\n ans = max(ans,A1[i-1][j] + A2[i+1][j] + A3[i][j-1] + A4[i][j+1])\r\nprint(ans)", "import sys\ninput = lambda: sys.stdin.readline().rstrip('\\n\\r')\n\n__input_tests__ = False\nfrom collections import Counter, defaultdict, deque\nfrom itertools import accumulate\nfrom bisect import bisect_left, bisect_right\n\ndef solve():\n n, m = map(int, input().split())\n a = [list(map(int, input().split())) for _ in range(n)]\n\n dp1 = [[-1 for _ in range(m)] for _ in range(n)]\n dp2 = [[-1 for _ in range(m)] for _ in range(n)]\n dp3 = [[-1 for _ in range(m)] for _ in range(n)]\n dp4 = [[-1 for _ in range(m)] for _ in range(n)]\n\n for i in range(n):\n for j in range(m):\n if i == 0 and j == 0:\n dp1[i][j] = a[i][j]\n elif i == 0:\n dp1[i][j] = a[i][j] + dp1[i][j - 1]\n elif j == 0:\n dp1[i][j] = a[i][j] + dp1[i - 1][j]\n else:\n dp1[i][j] = max(dp1[i - 1][j], dp1[i][j - 1]) + a[i][j]\n \n for i in range(n):\n for j in range(m - 1, -1, -1):\n if i == 0 and j == m - 1:\n dp2[i][j] = a[i][j]\n elif i == 0:\n dp2[i][j] = a[i][j] + dp2[i][j + 1]\n elif j == m - 1:\n dp2[i][j] = a[i][j] + dp2[i - 1][j]\n else:\n dp2[i][j] = max(dp2[i - 1][j], dp2[i][j + 1]) + a[i][j]\n for i in range(n - 1, -1, -1):\n for j in range(m):\n if i == n - 1 and j == 0:\n dp4[i][j] = a[i][j]\n elif i == n - 1:\n dp4[i][j] = a[i][j] + dp4[i][j - 1]\n elif j == 0:\n dp4[i][j] = a[i][j] + dp4[i + 1][j]\n else:\n dp4[i][j] = max(dp4[i + 1][j], dp4[i][j - 1]) + a[i][j]\n for i in range(n - 1, -1, -1):\n for j in range(m - 1, -1, -1):\n if i == n - 1 and j == m - 1:\n dp3[i][j] = a[i][j]\n elif i == n - 1:\n dp3[i][j] = a[i][j] + dp3[i][j + 1]\n elif j == m - 1:\n dp3[i][j] = a[i][j] + dp3[i + 1][j]\n else:\n dp3[i][j] = max(dp3[i + 1][j], dp3[i][j + 1]) + a[i][j]\n \n ans = max(max(dp1[i - 1][j] + dp3[i + 1][j] + dp2[i][j + 1] + dp4[i][j - 1], dp2[i - 1][j] + dp4[i + 1][j] + dp1[i][j - 1] + dp3[i][j + 1]) for i in range(1, n - 1) for j in range(1, m - 1))\n return ans\n\nfor _ in range(int(input()) if __input_tests__ else 1):\n val = solve()\n print(val)\n", "n, m = map(int, input().split())\r\na = [[0] * (m + 1) for _ in range(n + 1)]\r\ndp = [[[0] * 5 for _ in range(m + 2)] for _ in range(n + 2)]\r\nans = 0\r\n\r\nfor i in range(1, n + 1):\r\n row = list(map(int, input().split()))\r\n for j in range(1, m + 1):\r\n a[i][j] = row[j - 1]\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n dp[i][j][0] = max(dp[i - 1][j][0], dp[i][j - 1][0]) + a[i][j]\r\n\r\nfor i in range(n, 0, -1):\r\n for j in range(1, m + 1):\r\n dp[i][j][1] = max(dp[i + 1][j][1], dp[i][j - 1][1]) + a[i][j]\r\n\r\nfor i in range(n, 0, -1):\r\n for j in range(m, 0, -1):\r\n dp[i][j][2] = max(dp[i + 1][j][2], dp[i][j + 1][2]) + a[i][j]\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(m, 0, -1):\r\n dp[i][j][3] = max(dp[i - 1][j][3], dp[i][j + 1][3]) + a[i][j]\r\n\r\nfor i in range(2, n):\r\n for j in range(2, m):\r\n ans = max(ans, dp[i - 1][j][0] + dp[i][j - 1][1] + dp[i + 1][j][2] + dp[i][j + 1][3])\r\n ans = max(ans, dp[i][j - 1][0] + dp[i + 1][j][1] + dp[i][j + 1][2] + dp[i - 1][j][3])\r\n\r\nprint(ans)\r\n", "from sys import stdin,stdout\nimport sys\nfrom bisect import bisect_left,bisect_right\nimport heapq\nsys.setrecursionlimit(2*(10**5))\n\n# stdin = open(\"input.txt\", \"r\");\n# stdout = open(\"output.txt\", \"w\");\n\nn,m=stdin.readline().strip().split(' ')\nn,m=int(n),int(m)\n\ncostarr=[]\nfor i in range(n):\n\tcostarr.append(list(map(int,stdin.readline().strip().split(' '))))\n\n\n\n\ndp_tl_br=[[0 for i in range(m)] for j in range(n)]\ndp_br_tl=[[0 for i in range(m)] for j in range(n)]\ndp_bl_tr=[[0 for i in range(m)] for j in range(n)]\ndp_tr_bl=[[0 for i in range(m)] for j in range(n)]\n\n#\tTOP LEFT TO BOTTOM RIGHT COST\ndp_tl_br[0][0]=costarr[0][0]\nfor i in range(1,m):\n\tdp_tl_br[0][i]=dp_tl_br[0][i-1]+costarr[0][i]\nfor i in range(1,n):\n\tdp_tl_br[i][0]=dp_tl_br[i-1][0]+costarr[i][0]\nfor i in range(1,n):\n\tfor j in range(1,m):\n\t\tdp_tl_br[i][j]=max(dp_tl_br[i][j-1],dp_tl_br[i-1][j])+costarr[i][j]\n\n\n#\tBOTTOM RIGHT TO TOP LEFT COST\ndp_br_tl[n-1][m-1]=costarr[n-1][m-1]\nfor i in range(m-2,-1,-1):\n\tdp_br_tl[n-1][i]=dp_br_tl[n-1][i+1]+costarr[n-1][i]\nfor i in range(n-2,-1,-1):\n\tdp_br_tl[i][m-1]=dp_br_tl[i+1][m-1]+costarr[i][m-1]\nfor i in range(n-2,-1,-1):\n\tfor j in range(m-2,-1,-1):\n\t\tdp_br_tl[i][j]=max(dp_br_tl[i][j+1],dp_br_tl[i+1][j])+costarr[i][j]\n\n\n#\tBOTTOM LEFT TO TOP RIGHT COST\ndp_bl_tr[n-1][0]=costarr[n-1][0]\nfor i in range(1,m):\n\tdp_bl_tr[n-1][i]=dp_bl_tr[n-1][i-1]+costarr[n-1][i]\nfor i in range(n-2,-1,-1):\n\tdp_bl_tr[i][0]=dp_bl_tr[i+1][0]+costarr[i][0]\nfor i in range(n-2,-1,-1):\n\tfor j in range(1,m):\n\t\tdp_bl_tr[i][j]=max(dp_bl_tr[i][j-1],dp_bl_tr[i+1][j])+costarr[i][j]\n\n\n#\tTOP RIGHT TO BOTTOM LEFT COST\ndp_tr_bl[0][m-1]=costarr[0][m-1]\nfor i in range(m-2,-1,-1):\n\tdp_tr_bl[0][i]=dp_tr_bl[0][i+1]+costarr[0][i]\nfor i in range(1,n):\n\tdp_tr_bl[i][m-1]=dp_tr_bl[i-1][m-1]+costarr[i][m-1]\nfor i in range(1,n):\n\tfor j in range(m-2,-1,-1):\n\t\tdp_tr_bl[i][j]=max(dp_tr_bl[i][j+1],dp_tr_bl[i-1][j])+costarr[i][j]\n\n\n\ndef sh(arr):\n\tfor i in arr:\n\t\tprint(i)\n\n# sh(dp_tr_bl)\n# print()\n\n# sh(dp_tl_br)\n# print()\n\n# sh(dp_bl_tr)\n# print()\n\n# sh(dp_br_tl)\n# print()\n\nans=0\n\nfor i in range(1,n-1):\n\tfor j in range(1,m-1):\n\t\tans=max(ans,dp_bl_tr[i][j-1]+dp_tr_bl[i][j+1]+dp_tl_br[i-1][j]+dp_br_tl[i+1][j])#\tLEFT TO RIGHT | DOWN TO UP\n\t\tans=max(ans,dp_bl_tr[i+1][j]+dp_tr_bl[i-1][j]+dp_tl_br[i][j-1]+dp_br_tl[i][j+1])# DOWN TO UP | LEFT TO RIGHT\n# for i in range(1,n-2):\n# \tfor j in range(m):\n# \t\tans+=max(ans,dp_tl_br[i-1][j]+costarr[i][j]+dp_br_tl[i+1][j]+dp_bl_tr[i+1][j]+costarr[i][j]+dp_tr_bl[i-1][j])\n\nstdout.write(str(ans)+\"\\n\")\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "import os, sys\r\nfrom io import BytesIO, IOBase\r\nfrom math import log2, ceil, sqrt, gcd\r\nfrom _collections import deque\r\nimport heapq as hp\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import cos, sin\r\nfrom itertools import permutations\r\nfrom operator import itemgetter\r\n\r\nsys.setrecursionlimit(5 * 10 ** 4)\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\npi = 3.1415926535\r\nmod = 10 ** 9 + 7\r\nn,m = list(map(int,input().split()))\r\na = [list(map(int,input().split())) for _ in range(n)]\r\n\r\ndp1 = [[0] * (m + 2) for _ in range(n + 2)]\r\ndp2 = [[0] * (m + 2) for _ in range(n + 2)]\r\ndp3 = [[0] * (m + 2) for _ in range(n + 2)]\r\ndp4 = [[0] * (m + 2) for _ in range(n + 2)]\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n dp1[i][j] = a[i - 1][j - 1] + max(dp1[i - 1][j], dp1[i][j - 1])\r\n\r\nfor i in range(n, 0, -1):\r\n for j in range(m, 0, -1):\r\n dp2[i][j] = a[i - 1][j - 1] + max(dp2[i + 1][j], dp2[i][j + 1])\r\nfor i in range(n, 0, -1):\r\n for j in range(1, m + 1):\r\n\r\n dp3[i][j] = a[i - 1][j - 1] + max(dp3[i + 1][j], dp3[i][j - 1])\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(m, 0, -1):\r\n\r\n dp4[i][j] = a[i - 1][j - 1] + max(dp4[i - 1][j], dp4[i][j + 1])\r\nans = 0\r\n\r\nfor i in range(2, n):\r\n for j in range(2, m):\r\n\r\n ans = max(ans, max(dp1[i - 1][j] + dp2[i + 1][j] + dp3[i][j - 1] + dp4[i][j + 1] ,\r\n dp1[i][j - 1] + dp2[i][j + 1] + dp3[i + 1][j] + dp4[i - 1][j]) )\r\n\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nM = int(1e9) + 7\r\n\r\nn, m = map(int, input().split())\r\ngrid = [list(map(int, input().split())) for _ in range(n)]\r\n\r\ndp11 = [[0 for _ in range(m+2)] for _ in range(n+2)]\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n dp11[i][j] = grid[i-1][j-1] + max(dp11[i-1][j], dp11[i][j-1])\r\n\r\ndp1m = [[0 for _ in range(m+2)] for _ in range(n+2)]\r\nfor i in range(1, n+1):\r\n for j in range(m, 0, -1):\r\n dp1m[i][j] = grid[i-1][j-1] + max(dp1m[i-1][j], dp1m[i][j+1])\r\n\r\ndpn1 = [[0 for _ in range(m+2)] for _ in range(n+2)]\r\nfor i in range(n, 0, -1):\r\n for j in range(1, m+1):\r\n dpn1[i][j] = grid[i-1][j-1] + max(dpn1[i+1][j], dpn1[i][j-1])\r\n\r\ndpnm = [[0 for _ in range(m+2)] for _ in range(n+2)]\r\nfor i in range(n, 0, -1):\r\n for j in range(m, 0, -1):\r\n dpnm[i][j] = grid[i-1][j-1] + max(dpnm[i+1][j], dpnm[i][j+1])\r\n\r\nans = -1\r\nfor x in range(2, n):\r\n for y in range(2, m):\r\n case1 = dp11[x-1][y] + dpnm[x+1][y] + dpn1[x][y-1] + dp1m[x][y+1]\r\n case2 = dp11[x][y-1] + dpnm[x][y+1] + dpn1[x+1][y] + dp1m[x-1][y]\r\n ans = max(ans, case1, case2)\r\nprint(ans)", "'''input\n3 3\n100 100 100\n100 1 100\n100 100 100\n'''\n# again a coding delight\nfrom sys import stdin\n\n\ndef create_dp1(matrix, n, m):\n\tdp = [[0 for i in range(m)] for j in range(n)]\n\tfor i in range(n):\n\t\tfor j in range(m):\n\t\t\tif i - 1 >= 0:\n\t\t\t\tdp[i][j] = max(dp[i][j], matrix[i][j] + dp[i - 1][j])\n\t\t\tif j - 1 >= 0:\n\t\t\t\tdp[i][j] = max(dp[i][j], matrix[i][j] + dp[i][j - 1])\n\t\t\telif i - 1 < 0 and j - 1 < 0:\n\t\t\t\tdp[i][j] = matrix[i][j]\n\treturn dp\n\n\ndef create_dp2(matrix, n, m):\n\tdp = [[0 for i in range(m)] for j in range(n)]\n\tfor i in range(n - 1, -1, -1):\n\t\tfor j in range(m - 1, -1, -1):\n\t\t\tif i + 1 < n:\n\t\t\t\tdp[i][j] = max(dp[i][j], matrix[i][j] + dp[i + 1][j])\n\t\t\tif j + 1 < m:\n\t\t\t\tdp[i][j] = max(dp[i][j], matrix[i][j] + dp[i][j + 1])\n\t\t\tif i + 1 >= n and j + 1 >= m:\n\t\t\t\tdp[i][j] = matrix[i][j]\n\treturn dp \n\n\ndef create_dp3(matrix, n, m):\n\tdp = [[0 for i in range(m)] for j in range(n)]\n\tfor i in range(n - 1, -1, -1):\n\t\tfor j in range(m):\n\t\t\tif i + 1 < n:\n\t\t\t\tdp[i][j] = max(dp[i][j], matrix[i][j] + dp[i + 1][j])\n\t\t\tif j - 1 >= 0:\n\t\t\t\tdp[i][j] = max(dp[i][j], matrix[i][j] + dp[i][j - 1])\n\t\t\tif i + 1 >= n and j - 1 < 0:\n\t\t\t\tdp[i][j] = matrix[i][j]\n\treturn dp \n\n\ndef create_dp4(matrix, n, m):\n\tdp = [[0 for i in range(m)] for j in range(n)]\n\tfor i in range(n):\n\t\tfor j in range(m - 1, -1, -1):\n\t\t\tif i - 1 >= 0:\n\t\t\t\tdp[i][j] = max(dp[i][j], matrix[i][j] + dp[i - 1][j])\n\t\t\tif j + 1 < m:\n\t\t\t\tdp[i][j] = max(dp[i][j], matrix[i][j] + dp[i][j + 1])\n\t\t\tif i - 1 < 0 and j + 1 >= m:\n\t\t\t\tdp[i][j] = matrix[i][j]\n\treturn dp \n\n\n# main starts\nn, m = list(map(int, stdin.readline().split()))\nmatrix = []\nfor _ in range(n):\n\tmatrix.append(list(map(int, stdin.readline().split())))\n\ndp1 = create_dp1(matrix, n, m) # from 0, 0 to i, j\ndp2 = create_dp2(matrix, n, m) # from i, j to n, m\ndp3 = create_dp3(matrix, n, m) # from n, 1 to i, j\ndp4 = create_dp4(matrix, n, m) # from i, j to 1, m\n\ntotal = -float('inf')\nfor i in range(1, n - 1):\n\tfor j in range(1, m - 1):\n\t\tfirst = dp1[i - 1][j] + dp2[i + 1][j] + dp3[i][j - 1] + dp4[i][j + 1]\n\t\tsecond = dp1[i][j - 1] + dp2[i][j + 1] + dp3[i + 1][j] + dp4[i - 1][j]\n\t\ttotal = max(total, first, second)\nprint(total)", "import sys, os\nfrom io import BytesIO, IOBase\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\n# region fastio\nBUFSIZE = 8192\n \nclass FastIO(IOBase):\n newlines = 0\n \n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n \n def read(self):\n while True:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n \n def readline(self):\n while self.newlines == 0:\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n \n def flush(self):\n if self.writable:\n os.write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n \nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\nstdin, stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout) \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 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 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 = mp()\nmat = [lmp() for i in range(n)]\ndp1 = l2d(n+1, m+1) # (0,0) to (i,j)\ndp2 = l2d(n+1, m+1) # (i,j) to (n-1,m-1)\ndp3 = l2d(n+1, m+1) # (n-1,0) to (i,j)\ndp4 = l2d(n+1, m+1) # (i,j) to (0,m-1)\nfor i in range(1, n+1):\n for j in range(1, m+1):\n dp1[i][j] = max(dp1[i-1][j], dp1[i][j-1]) + mat[i-1][j-1]\nfor i in range(n-1, -1, -1):\n for j in range(m-1, -1, -1):\n dp2[i][j] = max(dp2[i+1][j], dp2[i][j+1]) + mat[i][j]\nfor i in range(n-1, -1, -1):\n for j in range(1, m+1):\n dp3[i][j] = max(dp3[i+1][j], dp3[i][j-1]) + mat[i][j-1]\nfor i in range(1, n+1):\n for j in range(m-1, -1, -1):\n dp4[i][j] = max(dp4[i-1][j], dp4[i][j+1]) + mat[i-1][j]\nmx = 0\nfor i in range(1, n-1):\n for j in range(1, m-1):\n mx = max(mx, dp1[i][j+1] + dp2[i+1][j] + dp3[i][j] + dp4[i+1][j+1], dp1[i+1][j] + dp2[i][j+1] + dp3[i+1][j+1] + dp4[i][j])\nprint(mx)", "n, m = map(int, input().strip().split())\r\ndp1, dp2, dp3, dp4 = [[[0 for i in range(m+1)] for i in range(n+1)] for i in range(4)]\r\n\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().strip().split())))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n dp1[i][j] = a[i][j] + max(dp1[i-1][j], dp1[i][j-1])\r\n\r\nfor i in range(n-1, -1, -1):\r\n for j in range(m-1, -1, -1):\r\n dp2[i][j] = a[i][j] + max(dp2[i+1][j], dp2[i][j+1])\r\n\r\nfor i in range(n-1, -1, -1):\r\n for j in range(m):\r\n dp3[i][j] = a[i][j] + max(dp3[i+1][j], dp3[i][j-1])\r\n\r\nfor i in range(n):\r\n for j in range(m-1, -1, -1):\r\n dp4[i][j] = a[i][j] + max(dp4[i-1][j], dp4[i][j+1])\r\n\r\n\r\nans = 0\r\nfor i in range(1,n-1):\r\n for j in range(1, m-1):\r\n ans = max(ans, dp1[i][j-1] + dp2[i][j+1] + dp3[i+1][j] + dp4[i-1][j], dp3[i][j-1] + dp4[i][j+1] + dp1[i-1][j] + dp2[i+1][j])\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\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(i1, i2, i3, j1, j2, j3):\r\n w = [[0]*(m+2) for _ in range(n+2)]\r\n for i in range(i1, i2, i3):\r\n for j in range(j1, j2, j3):\r\n w[i][j] = max(w[i-i3][j], w[i][j-j3]) + g[i-1][j-1]\r\n return w\r\n\r\n\r\nn, m = map(int, input().split())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\na1 = f(1, n+1, 1, 1, m+1, 1)\r\na1, a2, b1, b2 = f(1, n+1, 1, 1, m+1, 1), f(n, 0, -1, m, 0, -1), f(n, 0, -1, 1, m+1, 1), f(1, n+1, 1, m, 0, -1)\r\nc = 0\r\nq = [[0]*(m+2) for _ in range(n+2)]\r\nfor i in range(2, n):\r\n for j in range(2, m):\r\n c = max(c, a1[i-1][j] + a2[i+1][j] + b1[i][j-1] + b2[i][j+1], a1[i][j-1] + a2[i][j+1] + b1[i+1][j] + b2[i-1][j])\r\nprint(c)" ]

[ "n = int(input())\r\nanw = False\r\nans = 0\r\nimport string\r\nvs = set(list(string.ascii_lowercase))\r\nfor i in range(n):\r\n act, w = input().split()\r\n if not anw:\r\n if act == '.':\r\n for l in w:\r\n if l in vs:\r\n vs.remove(l)\r\n if act == '!':\r\n vs &= set(list(w))\r\n if act == '?':\r\n for l in w:\r\n if l in vs:\r\n vs.remove(l)\r\n if len(vs) == 1:\r\n anw = True\r\n else:\r\n if act == '!' or (act == '?' and i != n-1):\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nalf='abcdefghijklmnopqrstuvwxyz'\r\nso='';\r\nj=n\r\nfor i in range(n):\r\n s=input()\r\n j-=1\r\n if s[0]=='!':\r\n so = '';\r\n for e in alf:\r\n if s.find(e)>-1: so+=e;\r\n alf=so\r\n elif s[0]=='.':\r\n so = '';\r\n for e in alf:\r\n if s.find(e)==-1: so+=e;\r\n alf=so\r\n else:\r\n alf=alf.replace(s[2],'')\r\n if len(alf)==1: break\r\nlol=0;\r\np=j;\r\nfor i in range(j-1):\r\n s = input()\r\n if s[0]=='!' or s[0]=='?': lol+=1\r\nif not(p==0):s = input()\r\nprint(lol)", "import math,sys\r\nfrom sys import stdin, stdout\r\nfrom collections import Counter, defaultdict, deque\r\ninput = stdin.readline\r\nI = lambda:int(input())\r\nli = lambda:list(map(int,input().split()))\r\n\r\ndef solve():\r\n n=I()\r\n vis=[1]*26\r\n c=0\r\n flag=0\r\n ans=0\r\n for i in range(n-1):\r\n a,b=input().split(\" \")\r\n b=b.strip()\r\n if(flag and a!='.'):\r\n ans+=1\r\n continue\r\n if(a!='!'):\r\n for i in range(len(b)):\r\n vis[ord(b[i])-97]=0\r\n elif(a=='!'):\r\n c=Counter(b)\r\n for i in range(26):\r\n if(chr(97+i) not in c and vis[i]==1):\r\n vis[i]=0\r\n c=0\r\n #print(*vis)\r\n for i in range(26):\r\n if(vis[i]==1):\r\n c+=1\r\n if(c==1):\r\n flag=1 \r\n a,b=input().split(\" \")\r\n print(ans)\r\n \r\n \r\nfor _ in range(1):\r\n solve()", "n=int(input())\r\nlet=set('qwertyuiopasdfghjklzxcvbnm')\r\ngotcha=False\r\nk=0\r\nfor i in range(n-1):\r\n s=input()\r\n if gotcha and s[0] in '!?':\r\n k+=1\r\n else:\r\n if s[0]=='.':\r\n let.difference_update(s[2:])\r\n elif s[0]=='!':\r\n let.intersection_update(s[2:])\r\n else:\r\n if s[2] in let:\r\n let.remove(s[2])\r\n if len(let)==1:\r\n gotcha=True\r\ninput()\r\nprint(k)\r\n", "input=__import__('sys').stdin.readline\r\nleft,bad=set([chr(i+ord('a')) for i in range(26)]),0\r\nq=int(input())\r\nfor i in range(q-1):\r\n op,s = input().split()\r\n bad += len(left)==1and op!='.'\r\n if op=='!': left=left&set(s)\r\n else: left=left-set(s)\r\nprint(bad)", "k, L = 0, set('abcdefghijklmnopqrstuvwxyz')\r\n\r\nfor _ in range(int(input()) - 1):\r\n a, w = input().split()\r\n if a == '.':\r\n L -= set(w)\r\n elif a == '!':\r\n k, L = k + (len(L) < 2), L & set(w)\r\n elif len(L) > 1:\r\n L -= {w}\r\n else:\r\n k += 1\r\n\r\nprint(k)", "n = list(map(int, input().strip().split()))[0]\r\ndp = dict()\r\n\r\n\r\nfor i in range(26):\r\n dp[chr(ord('a') + i)] = 0\r\nanswer = 0\r\nfor i in range(n):\r\n now = list(input('').strip().split())\r\n if len(dp) == 1:\r\n if now[0] == '!':\r\n answer += 1\r\n elif now[0] == '?' and i != n - 1:\r\n answer += 1\r\n else:\r\n if now[0] == '!':\r\n newdp = dict()\r\n temp = dict()\r\n for chr in now[1]:\r\n temp[chr] = 1\r\n for key in dp:\r\n if key in temp:\r\n newdp[key] = 1\r\n dp = newdp\r\n elif now[0] == '.':\r\n for chr in now[1]:\r\n if chr in dp:\r\n dp.pop(chr)\r\n else:\r\n if i != n - 1:\r\n key = now[1]\r\n if key in dp:\r\n dp.pop(key)\r\nprint(answer)", "n = int(input())\r\nb = set('qwertyuioplkjhgfdsazxcvbnm')\r\ng = set()\r\nt = 0\r\nres = []\r\nfor i in range(n):\r\n\ts = input().split()\r\n\tif s[0] == '.':\r\n\t\tb -= set(s[1])\r\n\telif s[0] == '!':\r\n\t\tb &= set(s[1])\r\n\t\tt += 1\r\n\telse:\r\n\t\tif len(b) == 1 and not s[1] in b:\r\n\t\t\tt += 1\r\n\t\tif i != n - 1:\r\n\t\t\tb -= set(s[1])\r\n\tif len(b) == 1:\r\n\t\tres.append(t)\r\nif len(res) == 0:\r\n\tprint(0)\r\nelse:\r\n\tprint(t - res[0])\r\n\r\n", "import string\r\n\r\nn = int(input())\r\npossibles = list(string.ascii_lowercase)\r\ncounter = 0\r\nsum = 26\r\ntest = 0\r\nfor i in range(0, n):\r\n a, b = input().split()\r\n if test == 0:\r\n if a == '.':\r\n remove = []\r\n for j in possibles:\r\n if str.find(b, j) != -1:\r\n sum -= 1\r\n remove.append(j)\r\n for j in remove:\r\n possibles.remove(j)\r\n if a == '!':\r\n remove = []\r\n for j in possibles:\r\n if str.find(b, j) == -1:\r\n sum -= 1\r\n remove.append(j)\r\n for j in remove:\r\n possibles.remove(j)\r\n\r\n if a == '?' and i < n - 1:\r\n if b[0] in possibles:\r\n possibles.remove(b[0])\r\n sum -= 1\r\n if sum == 1:\r\n test = 1\r\n else:\r\n if a == '!':\r\n counter += 1\r\n elif a == '?' and i < n - 1:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "n = int(input())\r\na = 0\r\nb = 0\r\nflag = True\r\nt = set(list('qwertyuioplkjhgfdsazxcvbnm'))\r\nfor i in range(n):\r\n op, w = map(str, input().split())\r\n w = set(list(w))\r\n if op == '!':\r\n t &= w\r\n a += 1\r\n if flag:\r\n b += 1\r\n elif op == '.':\r\n t = t.difference(w)\r\n else:\r\n t = t.difference(w)\r\n if i != n - 1:\r\n a += 1\r\n if flag:\r\n b += 1\r\n if len(t) == 1:\r\n flag = False\r\nprint(a - b)\r\n", "#!/usr/bin/env python3\n\nn = int(input())\n\nmp = [0 for i in range(26)]\n\nrchk = 0\nres = 0\ndet = -1\nfor i in range(n):\n mark, word = input().split(' ')\n\n if mark=='!':\n assign = 1\n else:\n assign = -1\n\n if det>=0:\n if mark is not '.':\n res += 1\n continue\n\n chk = [0 for i in range(26)]\n for j in range(len(word)):\n pos = int(ord(word[j])-ord('a'))\n if chk[pos]==0:\n chk[pos] = 1\n if mp[pos]==rchk:\n mp[pos] += assign\n if assign==1:\n rchk += 1\n\n cnt = 0\n for j in range(len(mp)):\n if mp[j]==rchk:\n cnt += 1\n if cnt>1:\n break\n if cnt==1:\n det = i\n\nif res==0:\n print(0)\nelse:\n print (res-1)\n", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nextra = -1;s = set();mark = {}\r\nfor _ in range(int(input())):\r\n a,b = input().split(\" \")\r\n if len(s) == 1 or len(mark) == 25:\r\n if a!='.':\r\n extra += 1\r\n continue\r\n if a == '!':\r\n if not(s):\r\n s = set(b)\r\n else:\r\n c = set(b)\r\n l = []\r\n for i in c:\r\n if i in s:\r\n l.append(i)\r\n new_s = set()\r\n #print(l)\r\n for i in s:\r\n if i in l:\r\n new_s.add(i)\r\n else:\r\n mark[i] = 1\r\n s = new_s.copy()\r\n elif a == '.':\r\n c = set(b)\r\n l = []\r\n for i in c:\r\n mark[i] = 1\r\n if i in s:\r\n l.append(i)\r\n new_s = set()\r\n #print(l)\r\n for i in s:\r\n if i not in l:\r\n new_s.add(i)\r\n s = new_s.copy()\r\n else:\r\n mark[b] = 1\r\n t = set()\r\n for i in s:\r\n if mark.get(i,-1) == -1:\r\n t.add(i)\r\n s = t.copy()\r\n \r\n \r\n \r\n #print(s,mark,len(mark))\r\nprint(max(0,extra))\r\n \r\n ", "n = int(input())\r\nsym = []\r\nword = []\r\n\r\ndict = {}\r\n\r\nfor z in range(26):\r\n dict[chr(97 + z)] = 1\r\n\r\nfor x in range(n):\r\n a, b = input().split()\r\n sym.append(a)\r\n word.append(b)\r\n\r\nq = -1\r\nflag = 0\r\n\r\nfor x in range(n):\r\n if sym[x] == '!':\r\n flag = 1\r\n sety = set()\r\n for i in range(26):\r\n if (dict[chr(97 + i)] == 0):\r\n sety.add(chr(97 + i))\r\n dict[chr(97 + i)] = 0\r\n\r\n for s in word[x]:\r\n dict[s] = 1\r\n\r\n for s in sety:\r\n dict[s] = 0\r\n\r\n if sym[x] == '.':\r\n for s in word[x]:\r\n dict[s] = 0\r\n\r\n if sym[x] == '?':\r\n for s in word[x]:\r\n dict[s] = 0\r\n\r\n\r\n j = 0\r\n for i in range(26):\r\n j += dict[chr(97 + i)]\r\n\r\n if j == 1:\r\n q = x\r\n break\r\n\r\n\r\n\r\ncount = 0\r\n\r\n\r\n\r\nif q==-1:\r\n print(0)\r\n\r\nelse:\r\n for p in range(q+1,n-1):\r\n if sym[p] == '!' or sym[p]=='?':\r\n count+=1\r\n\r\n print(count)", "n = int(input())\ny = set()\nopr = False\ncount = 0\nfor i in range(97, 123):\n\ty.add(chr(i))\nfor i in range(n):\n\ts = input()\n\ts = s.split(\" \")\n\ta = s[1]\n\tif not opr:\n\t\tz = set()\n\t\tfor j in a:\n\t\t\tz.add(j)\n\t\tif s[0] == \"!\":\n\t\t\ty = y.intersection(z)\n\t\telif s[0] == \".\":\n\t\t\ty = y.difference(z)\n\t\telif s[0] == \"?\" and i != n - 1:\n\t\t\tq = set()\n\t\t\tq.add(s[1])\n\t\t\ty = y.difference(q)\n\t\tif len(y) == 1:\n\t\t\topr = True\n\telse:\n\t\tif (s[0] == \"?\" and i != n - 1) or s[0] == \"!\":\n\t\t\tcount += 1\nprint(count)\t\t\t\n\n\t\t\t\n\t\t\n\t\t\n", "from sys import stdin, stdout\r\nimport string\r\n\r\nn = int(input())\r\ncand = set(string.ascii_lowercase)\r\nans = 0\r\nfor i in range(n-1):\r\n res, word = stdin.readline().split()\r\n word = set(word)\r\n if res == '!':\r\n if len(cand) == 1:\r\n ans += 1\r\n cand = word & cand\r\n elif res == '.':\r\n cand = cand - word\r\n elif res == '?':\r\n if len(cand) == 1:\r\n ans += 1\r\n cand = cand - word\r\n\r\nprint(ans)\r\n", "import math\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n r = [list(map(str, input().split())) for i in range(n)]\r\n\r\n b = r[-1][1]\r\n res = 0\r\n possible = set(list(\"qwertyuiopasdfghjklzxcvbnm\"))\r\n i_know = False\r\n\r\n for com, w in r:\r\n if com == \"!\":\r\n if i_know:\r\n res += 1\r\n else:\r\n possible = possible & set(list(w))\r\n else:\r\n if com == \".\":\r\n for i in w:\r\n possible.discard(i)\r\n else:\r\n if w == b:\r\n break\r\n else:\r\n if i_know:\r\n res += 1\r\n else:\r\n possible.discard(w)\r\n if len(possible) == 1:\r\n i_know = True\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n = int(input())\nnemog = set()\nmog = set()\nfor i in range(26):\n mog.add(chr(97 + i))\n \ncnt = 0\nflag = False\n\nfor i in range(n):\n s = input()\n if s[0] == '.':\n for j in range(2, len(s)):\n mog.discard(s[j])\n if s[0] == '!':\n cnt += 1\n help = set()\n for j in range(2, len(s)):\n help.add(s[j])\n mog = mog & help\n if s[0] == '?':\n if i < n - 1:\n cnt += 1\n mog.discard(s[2])\n else:\n print(0)\n flag = True\n if len(mog) == 1:\n save = i\n break\nif not flag:\n ans = 0\n for i in range (save + 1, n):\n s = input()\n if s[0] == '!' or (i < n - 1 and s[0] == '?'):\n ans += 1\n print(ans)", "import string\r\n\r\nd = dict.fromkeys(string.ascii_lowercase, 0)\r\n\r\nn = int(input())\r\nans = 0\r\n\r\nwhile n:\r\n n -= 1\r\n a, b = input().split()\r\n\r\n if(len(d) == 1) and a != '.' and n != 0:\r\n ans += 1\r\n\r\n elif a == '!':\r\n for key in list(d):\r\n if key not in b:\r\n del d[key]\r\n\r\n elif a == '.':\r\n for it in b:\r\n if it in list(d):\r\n del d[it]\r\n elif a == '?':\r\n if b in list(d):\r\n del d[b]\r\n\r\nprint(ans)", "n = int(input())\r\nl = list('qwertyuiopasdfghjklzxcvbnm')\r\nresult = 0\r\nfor i in range(n):\r\n action, s = [str(i) for i in input().split()]\r\n if len(l) > 1:\r\n if action == '!':\r\n for j in range(len(l)):\r\n if l[j] not in s:\r\n l[j] = ''\r\n elif action == '.':\r\n for j in range(len(l)):\r\n if l[j] in s:\r\n l[j] = ''\r\n elif action == '?':\r\n if s in l:\r\n l.remove(s)\r\n else:\r\n if action == '!':\r\n result += 1\r\n elif action == '?':\r\n if s != l[0]:\r\n result += 1\r\n l = list(''.join(l))\r\n # print(l)\r\nprint(result)", "c=int(input())\r\nans=0\r\nq=0\r\nm=[[i,1]for i in 'abcdefghijklmnopqrstuvwxyz']\r\nfor i in range(c):\r\n suma=0\r\n for j in range(26):\r\n suma+=m[j][1]\r\n if suma<2:\r\n q=1\r\n x=input()\r\n a=set(x[2:])\r\n x=x[0]\r\n if x=='.':\r\n for j in range(26):\r\n if m[j][0]in a:\r\n m[j][1]=0\r\n elif x=='!':\r\n for j in range(26):\r\n if not(m[j][0]in a):\r\n m[j][1]=0\r\n if q:\r\n ans+=1\r\n else:\r\n for j in range(26):\r\n if m[j][0]in a:\r\n m[j][1]=0\r\n if i!=c-1 and q:\r\n ans+=1\r\nprint(ans)\r\n", "n = int(input())\r\nololo = \"abcdefghijklmnopqrstuvwxyz\"\r\ns = set(ololo)\r\nc = 0\r\nfor i in range(n):\r\n x = input().split(' ')\r\n if len(s) == 1:\r\n if x[0] == '!' or x[0] == '?':\r\n c += 1\r\n else:\r\n y = set(x[1])\r\n if x[0] == '.':\r\n s = s - y\r\n elif x[0] == '!':\r\n s = s & y\r\n else:\r\n s = s - y\r\nc -= 1\r\nif c > 0:\r\n print(c)\r\nelse:\r\n print(0)\r\n", "s, v = set('abcdefghijklmnopqrstuvwxyz'), 0\r\na = [input().split() for i in range(int(input()))]\r\na.pop()\r\nfor r, w in a:\r\n if r == '.':\r\n if len(s) > 1:\r\n s -= set(w)\r\n elif r == '!':\r\n if len(s) > 1:\r\n s &= set(w)\r\n else:\r\n v += 1\r\n else:\r\n if len(s) > 1:\r\n s.discard(w)\r\n else:\r\n v += 1\r\nprint(v)", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef process(A):\r\n n = len(A)\r\n possible = set([chr(i+ord('a')) for i in range(26)])\r\n shocks = 0\r\n min_shocks = None\r\n for i in range(n):\r\n a, w = A[i].split()\r\n if a=='!':\r\n possible2 = set(w)\r\n possible = possible.intersection(possible2)\r\n shocks+=1\r\n elif a=='.':\r\n possible2 = set(w)\r\n possible = possible.difference(possible2)\r\n else:\r\n if i != n-1:\r\n if w in possible:\r\n possible.remove(w)\r\n shocks+=1\r\n if len(possible)==1 and min_shocks is None:\r\n min_shocks = shocks\r\n if min_shocks is None:\r\n return 0\r\n else:\r\n return shocks-min_shocks\r\n\r\nn = int(input())\r\nA = []\r\nfor i in range(n):\r\n S = input().decode()[:-2]\r\n A.append(S)\r\nprint(process(A))\r\n \r\n ", "n = int(input())\nalpha = set(\"abcdefghijklmnopqrstuvwxyz\")\nwrong = 0\nok = False\nfor i in range(n-1):\n command = input().split()\n if ok and (command[0]!='.'):\n wrong += 1\n continue\n if command[0] == '!':\n alpha = set(command[1]) & alpha\n else:\n alpha -= set(command[1])\n if len(alpha) == 1:\n ok = True\nprint(wrong)\n", "n = int(input())\r\n\r\ns = set()\r\nfor i in range(ord('a'), ord('z') + 1):\r\n s.add(chr(i))\r\n\r\nk = 0\r\nfl = False\r\nfor i in range(n - 1):\r\n q = input().split()\r\n if fl:\r\n if q[0] == '!' or q[0] == '?':\r\n k += 1\r\n if q[0] == '.':\r\n for ch in q[1]:\r\n s.discard(ch)\r\n elif q[0] == '!':\r\n s = s.intersection(set(q[1]))\r\n elif q[0] == '?':\r\n s.discard(q[1])\r\n if len(s) == 1:\r\n fl = True\r\nq = input()\r\n\r\nprint(k)\r\n", "possible_char, res = set('abcdefghijklmnopqrstuvwxyz'), 0\r\nfor i in range(int(input()) - 1):\r\n ch, s = input().split()\r\n if len(possible_char) == 1 and ch != '.':\r\n res += 1\r\n s = set(s)\r\n if ch == '!':\r\n possible_char &= s\r\n else:\r\n possible_char -= s\r\nprint(res)\r\n", "\r\nN = int(input())\r\n\r\nletters = set()\r\nfor c in range(ord('a'), ord('z') + 1):\r\n letters.add(chr(c))\r\n\r\ntmp = set()\r\n\r\ndo_count = False\r\ncount = 0\r\nfor n in range(N):\r\n act, val = input().split()\r\n\r\n if act == '.':\r\n for c in val:\r\n if c in letters:\r\n letters.remove(c)\r\n if act == '!':\r\n tmp.clear()\r\n for c in val:\r\n tmp.add(c)\r\n letters.intersection_update(tmp)\r\n if do_count:\r\n count += 1\r\n if act == '?':\r\n if val in letters:\r\n letters.remove(val)\r\n if do_count:\r\n count += 1\r\n\r\n if len(letters) == 1:\r\n do_count = True\r\n\r\nprint(max(count - 1, 0))\r\n\r\n", "s = set([chr(i) for i in range(ord('a'), ord('z')+1)])\r\ncnt = 0\r\nfor i in range(int(input())-1):\r\n ss = input()\r\n if(ss[0] != '.' and len(s) == 1):\r\n cnt+=1\r\n if(ss[0] == '!'):\r\n s&=set(ss[2:])\r\n else:\r\n s-=set(ss[2:])\r\nprint(cnt)", "s=['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\nans=0\r\nbit=False\r\nfor i in range(int(input())-1):\r\n q=input()\r\n if q[0]=='?':\r\n if bit:\r\n ans+=1\r\n elif q[2] in s:\r\n s.remove(q[2])\r\n elif q[0]=='!':\r\n if bit:\r\n ans+=1\r\n else:\r\n q=q[2:]\r\n j=0\r\n while j!=len(s):\r\n if not s[j] in q:\r\n del s[j]\r\n continue\r\n j+=1 \r\n else:\r\n q=q[2:]\r\n j=0\r\n while j!=len(s):\r\n if s[j] in q:\r\n del s[j]\r\n continue\r\n j+=1\r\n if len(s)==1:\r\n bit=True\r\nprint(ans)\r\n", "import string\npossible = set(string.ascii_lowercase)\nn = int(input())\nans = 0\nfor i in range(n - 1):\n\ta, s = input().split()\n\tif len(possible) == 1:\n\t\tif a == '!' or a == '?':\n\t\t\tans += 1\n\telse:\n\t\tif a == '.' or a == '?':\n\t\t\tpossible = possible.difference(set(s))\n\t\telif a == '!':\n\t\t\tpossible = possible.intersection(set(s))\nprint(ans)", "n = int(input())\r\nl = [1] * 26\r\nok = 1\r\nu = 0\r\nabc = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z',]\r\nfor i in range(n):\r\n s = list(input().split(' '))\r\n if s[0] == '!':\r\n if ok == 0:\r\n u += 1\r\n zl = []\r\n for j in range(len(s[1])):\r\n z = abc.index(s[1][j])\r\n if l[z] == 1:\r\n zl.append(z)\r\n for k in range(26):\r\n if k not in zl:\r\n l[k] = 0\r\n \r\n if s[0] == '.':\r\n for j in range(len(s[1])):\r\n z = abc.index(s[1][j])\r\n l[z] = 0\r\n\r\n if s[0] == '?' and i != n-1:\r\n if ok == 0:\r\n u += 1\r\n l[abc.index(s[1])] = 0\r\n \r\n if sum(l) == 1:\r\n ok = 0\r\n \r\nprint(u)\r\n", "n = int(input())\nletters = set()\ndot_letters = set()\ncount = 0\nfound = False\nfor i in range(n - 1):\n s = input().split()\n if found:\n if s[0] == '!' or s[0] == '?':\n count += 1\n else:\n if s[0] == '!':\n if len(letters) == 0:\n letters |= set(s[1])\n letters -= dot_letters\n else:\n letters &= set(s[1])\n elif s[0] == '.':\n if len(letters) != 0:\n letters -= set(s[1])\n dot_letters |= set(s[1])\n elif s[0] == '?':\n if len(letters) != 0:\n letters -= set(s[1])\n dot_letters |= set(s[1])\n if len(letters) == 1:\n found = True\n if len(dot_letters) == 25:\n found = True\n\ninput()\n\nprint(count)\n", "a = set(\"qwertyuiopasdfghjklzxcvbnm\")\nn = int(input())\ncnt = 0\nfor i in range(n):\n a1, a2 = input().split()\n if len(a) == 1 and a1 != '.' and i < n - 1:\n cnt += 1\n if(a1 != \"!\"):\n a = a.difference(set(a2))\n if(a1 == '!'):\n a = a.intersection(set(a2))\nprint(cnt)", "n=int(input())\r\na=[1]*26\r\nt=0\r\nyd=0\r\nfor i in range(n-1):\r\n s=input()\r\n os=s[:1]\r\n s=s[2:]\r\n b=[0]*26\r\n for i in range(len(s)):\r\n b[ord(s[i])-ord(\"a\")]=1\r\n if os==\".\" or os==\"?\":\r\n if t==1 and os==\"?\":\r\n yd+=1\r\n for j in range(26):\r\n if b[j]==1:\r\n a[j]=0\r\n else:\r\n if t==1:\r\n yd+=1\r\n for j in range(26):\r\n if b[j]==0:\r\n a[j]=0\r\n if sum(a)==1:\r\n t=1\r\ns=input()\r\nprint(yd)", "n = int(input())\r\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\npossible = set(alphabet[i] for i in range(len(alphabet)))\r\ni = 0\r\nwhile i < n:\r\n signal, word = input().split()\r\n if signal == '!':\r\n possible = possible & set(word[j] for j in range(len(word)))\r\n elif signal == '.' or (signal == '?' and i != n-1):\r\n possible = possible - set(word[j] for j in range(len(word)))\r\n i += 1\r\n if len(possible) == 1:\r\n break\r\n \r\nans = 0\r\nwhile i < n:\r\n signal, word = input().split()\r\n if signal == '!' or (signal == '?' and word not in possible):\r\n ans += 1\r\n i += 1\r\nprint(ans)", "n = int(input())\r\nwill = [1 for i in range(26)]\r\nbl = False\r\ncount = 0\r\nfor i in range(1, n + 1):\r\n s = input()\r\n if bl and s[0] != \".\":\r\n count += 1\r\n elif i == n:\r\n count += 1\r\n else:\r\n act = s[0]\r\n word = s[2:]\r\n setta = set(word)\r\n if act == \"!\":\r\n for i in range(26):\r\n if str(chr(i + ord('a'))) not in setta:\r\n will[i] = 0\r\n if sum(will) == 1:\r\n bl = True\r\n else:\r\n for i in range(26):\r\n if str(chr(i + ord('a'))) in setta:\r\n will[i] = 0\r\n if sum(will) == 1:\r\n bl = True\r\ncount -= 1\r\nprint(count)\r\n \r\n", "arr=[0 for i in range(26)]\r\nn=int(input())\r\n\r\n\r\nss=['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\nss=set(ss)\r\nans=0\r\nfor i in range(n-1):\r\n\ts=len(ss)\r\n\tl=list(input())\r\n\tif(l[0]=='?' and s!=1):\r\n\t\tt=set(l[2])\r\n\t\tss=ss-t\r\n\telif(l[0]=='?' and s==1):\r\n\t\tans+=1\r\n\telif(l[0]=='!' and s!=1):\r\n\t\tq=[l[i] for i in range(2,len(l))]\r\n\t\tq=set(q)\r\n\t\tss=ss.intersection(q)\r\n\t\r\n\telif(l[0]=='!' and s==1):\r\n\t\tans+=1\r\n\telse:\r\n\t\tq=[l[i] for i in range(2,len(l))]\r\n\t\tq=set(q)\r\n\t\tss=ss-q\r\n\t\t\r\nl=list(input())\r\nprint(ans)\r\n", "#!/usr/bin/env python3\n\ndef solve():\n n = get(int)\n possible = set(ascii_lowercase)\n shockCount = 0\n neededShocks = None\n\n for i in range(n):\n t, w = get([str, str])\n if t == '.':\n possible = possible - set(w)\n elif t == '!':\n possible = possible & set(w)\n shockCount += 1\n elif t == '?':\n possible = possible - set(w)\n if i != n-1:\n shockCount += 1\n\n if len(possible) == 1 and neededShocks is None:\n neededShocks = shockCount\n if neededShocks is None:\n return 0\n return shockCount - neededShocks\n\n\n\n\n\n\n\n\n\n_testcases = \"\"\"\n5\n! abc\n. ad\n. b\n! cd\n? c\n\n1\n\n\n\n\n8\n! hello\n! codeforces\n? c\n. o\n? d\n? h\n. l\n? e\n\n2\n\n\n\n\n7\n! ababahalamaha\n? a\n? b\n? a\n? b\n? a\n? h\n\n0\n\"\"\".strip()\n\n# ======================= B O I L E R P L A T E ======================= #\n# Practicality beats purity\n\nfrom bisect import bisect_left, bisect_right\nfrom collections import defaultdict\nfrom functools import lru_cache\nfrom heapq import heapify, heappop, heappush\nfrom operator import itemgetter, attrgetter\nfrom string import ascii_lowercase\nimport bisect\nimport collections\nimport functools\nimport heapq\nimport itertools\nimport math\nimport operator\nimport re\nimport string\nimport sys\n\ninf = float('inf')\ncache = lru_cache(None)\nsys.setrecursionlimit(10000)\n\ndef tree():\n return collections.defaultdict(tree)\n\ndef equal(x, y, epsilon=1e-6):\n # https://code.google.com/codejam/kickstart/resources/faq#real-number-behavior\n if -epsilon <= x - y <= epsilon:\n return True\n if -epsilon <= x <= epsilon or -epsilon <= y <= epsilon:\n return False\n return (-epsilon <= (x - y) / x <= epsilon or -epsilon <= (x - y) / y <= epsilon)\n\n\ndef get(_type): # For easy input\n if type(_type) == list:\n if len(_type) == 1:\n _type = _type[0]\n return list(map(_type, input().strip().split()))\n else:\n return [_type[i](inp) for i, inp in enumerate(input().strip().split())]\n else:\n return _type(input().strip())\n\nif __name__ == '__main__':\n printRecursionTree = timeit = lambda x: x\n _p, print = print, lambda *a, **b: None\n _p(solve())\n", "import string\r\ng = set(string.ascii_lowercase)\r\nN = int(input())\r\nans = 0\r\n\r\nfor _ in range(N):\r\n c,s = input().split()\r\n s = set(s)\r\n if c==\".\":\r\n g = g - s\r\n elif c==\"!\":\r\n if len(g) == 1:\r\n ans=ans+1\r\n g = g & s\r\n else:\r\n if len(g)==1 and min(g)!=min(s):\r\n ans = ans + 1\r\n g = g - s\r\nprint(ans)", "n = int(input())\r\na = 'abcdefghijklmnopqrstuvwxyz'\r\nb = 26*[True]\r\ne = 0\r\nf = False\r\nfor i in range(n):\r\n ac ,w = input().split()\r\n if ac == '!':\r\n if f:e+=1\r\n for j in range(26):\r\n if a[j] not in w:b[j] = False\r\n if ac == '.':\r\n for j in w:\r\n b[a.index(j)] = False\r\n if ac == '?':\r\n if f:e+=1\r\n b[a.index(w)] = False\r\n if b.count(True) == 1:f = True\r\n\r\nprint(max(0,e-1))\r\n", "n = int(input())\r\ns = set(\"abcdefghijklmnopqrstuvwxyz\")\r\nmark = False\r\ncnt = 0\r\nfor i in range(n):\r\n if len(s) == 1:\r\n mark = True\r\n tmp = input().split()\r\n if tmp[0] == \"!\":\r\n if mark:\r\n cnt += 1\r\n curs = set(tmp[1])\r\n s = s & curs\r\n if tmp[0] == \".\":\r\n curs = set(tmp[1])\r\n s -= curs\r\n if tmp[0] == \"?\":\r\n if mark:\r\n cnt += 1\r\n if i == n - 1:\r\n cnt -= 1\r\n s -= set(tmp[1])\r\nprint(cnt)\r\n", "def main():\r\n\tn = int(input())\r\n\r\n\ts = []\r\n\tfor i in range(n):\r\n\t\ts.append(tuple(input().strip().split()))\r\n\r\n\talphabet = [1] * 26\r\n\tguessed = False\r\n\tcnt = 0\r\n\r\n\tfor i in range(n):\r\n\t\tt = s[i][0]\r\n\t\tw = s[i][1]\r\n\r\n\t\tif not guessed:\r\n\t\t\tif (t == '.'):\r\n\t\t\t\tfor b in w:\r\n\t\t\t\t\talphabet[ord(b) - 97] = 0\r\n\t\t\telif (t == '!'):\r\n\t\t\t\tfor j in range(26):\r\n\t\t\t\t\tif (chr(97 + j) not in w):\r\n\t\t\t\t\t\talphabet[j] = 0\r\n\t\t\telif (t == '?' and i < n-1):\r\n\t\t\t\talphabet[ord(w[0]) - 97] = 0\r\n\r\n\t\t\tif sum(alphabet) == 1:\r\n\t\t\t\tguessed = True\r\n\r\n\t\telse:\r\n\t\t\tif (t == '!'):\r\n\t\t\t\tcnt += 1\r\n\t\t\telif (t == '?' and i < n-1):\r\n\t\t\t\tcnt += 1 \r\n\r\n\tprint(cnt)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "possible = set(range(ord('a'), ord('z') + 1))\nredundant_shocks = 0\n\nN = int(input())\n\nfor _ in range(N - 1):\n line = input()\n if len(possible) == 1 and line[0] != \".\":\n redundant_shocks += 1\n continue\n\n description, string = line.split()\n\n if description == \"!\":\n # Determined that the letters are possible\n possible = possible.intersection(ord(c) for c in string)\n elif description == \".\": # Didn't get shocked, can rule out all chars of word\n # Determined the letters are impossible\n for c in string:\n possible.discard(ord(c))\n else:\n # Determined that a single letter is impossible\n possible.discard(ord(string))\n\nprint(redundant_shocks)\n", "candidate_letters = set(\"abcdefghijklmnopqrstuvwxyz\")\n\nis_unambiguous = False\navoidable_shock = 0\n\nn = int(input())\n\nfor i in range(n):\n if i == n - 1:\n break\n\n mark, word = input().split()\n\n if is_unambiguous and mark != '.':\n avoidable_shock += 1\n\n # print(candidate_letters)\n\n if mark == '!':\n candidate_letters = candidate_letters & set(word)\n if mark == '.' or mark == '?':\n candidate_letters = candidate_letters - set(word)\n\n if len(candidate_letters) == 1:\n # print(mark, word)\n\n is_unambiguous = True\n\nprint(avoidable_shock)\n", "n = int(input())\r\nmn = set('qwertyuiopasdfghjklzxcvbnm')\r\nf = False\r\nk = 0\r\nfor i in range(n):\r\n \r\n s = input().split()\r\n if f:\r\n if s[0] == '?' and set(s[1]) != mn or s[0] =='!':\r\n k += 1\r\n continue\r\n if s[0] == '?'and i != n-1:\r\n mn -= set(s[1])\r\n elif s[0] == '!':\r\n mn &= set(s[1])\r\n elif s[0] == '.':\r\n mn -= set(s[1])\r\n if len(mn) == 1:\r\n f = True\r\nprint(k)\r\n", "n = int(input())\r\nvar = [chr(i) for i in range(ord('a'), ord('z') + 1)]\r\nvar = set(var)\r\ncnt = 0\r\nfor i in range(n - 1):\r\n s = list(map(str, input().split()))\r\n if len(var) == 1 and s[0] != '.':\r\n cnt += 1\r\n if s[0] == \"!\":\r\n var &= set(list(s[1]))\r\n elif s[0] == \".\":\r\n for j in s[1]:\r\n if j in var:\r\n var.remove(j)\r\n else:\r\n if s[1] in var:\r\n var.remove(s[1])\r\ns = list(map(str, input().split()))\r\nprint(cnt)", "s = set()\r\ni = 'a'\r\nwhile i <= 'z':\r\n s.add(i)\r\n i = chr(ord(i)+1)\r\nn = int(input())\r\nc=0\r\nfor i in range(n):\r\n a = input().split()\r\n if a[0] == '.':\r\n s.difference_update(set(a[1]))\r\n elif len(s) == 1 and i != n-1:\r\n c+=1\r\n if a[0] == '!':\r\n s.intersection_update(set(a[1]))\r\n if a[0] == '?':\r\n if a[1] in s:\r\n s.remove(a[1])\r\nprint(c)\r\n", "n=int(input())\r\nmn=set()\r\notv=set()\r\nk=0\r\nfor i in range(ord('a'),ord('z')+1):\r\n otv.add(chr(i))\r\nfor i in range(n):\r\n s=input().split()\r\n if s[0]=='!':\r\n otv=set(s[1])&otv\r\n elif s[0]=='.':\r\n otv-=set(s[1])\r\n else:\r\n if i!=n-1:\r\n otv-=set(s[1])\r\n if len(otv)==1:\r\n break\r\nfor bb in range(i+1, n):\r\n s=input().split()\r\n if s[0]!='.':\r\n k+=1\r\nk-=1\r\nif k<0:\r\n k=0\r\nprint(k)\r\n \r\n", "l = False\r\nstring = \"abcdefghijklmnopqrstuvwxyz\"\r\nvarians = list(string)\r\nn = int(input())\r\nk = 0\r\nfor i in range(n):\r\n v, s = input().split()\r\n if len(varians) == 1:\r\n l = True\r\n if v == '.':\r\n for simb in s:\r\n if simb in varians:\r\n del varians[varians.index(simb)]\r\n elif v == '!':\r\n if l == True:\r\n k += 1\r\n continue\r\n for simb in varians.copy():\r\n if not simb in s:\r\n del varians[varians.index(simb)]\r\n else:\r\n if l == True and i != n - 1:\r\n k += 1\r\n continue\r\n if s in varians:\r\n del varians[varians.index(s)]\r\nprint(k)", "n = int(input())\r\nSetA = set(\"abcdefghijklmnopqrstuvwxyz\")\r\nflag = False\r\nlol = 0\r\nb = 0\r\nfor i in range(n):\r\n b += 1564\r\n if len(SetA) == 1:\r\n flag = True\r\n pit = input().split()\r\n if pit[0] == \"!\":\r\n if flag:\r\n lol += 1\r\n curs = set(pit[1])\r\n SetA = SetA & curs\r\n if pit[0] == \".\":\r\n curs = set(pit[1])\r\n SetA -= curs\r\n if pit[0] == \"?\":\r\n if flag:\r\n lol += 1\r\n if i == n - 1:\r\n lol -= 1\r\n SetA -= set(pit[1])\r\n b -= 1564\r\nprint(lol)", "#/usr/bin/env python\n\ndef toSet(x):\n temp = set();\n for i in x:\n temp.add(i)\n return temp\n\ncandidate = set(['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'])\nn = input()\nok = False\nshock = 0;\nfor i in range(int(n) - 1):\n temp = input()\n if ok and temp[0] != '.':\n shock += 1\n continue\n if temp[0] == '!':\n candidate &= toSet(temp[2:])\n else:\n candidate -= toSet(temp[2:])\n if len(candidate) == 1:\n ok = True\n\nprint(shock)\n", "n = int(input())\r\nimport string\r\ncands = string.ascii_lowercase\r\nguessable = False\r\nfailcount = 0\r\n\r\nfor s in range(n):\r\n r = input().split(' ')\r\n m = r[0]\r\n w = r[1]\r\n if not guessable:\r\n if m == '!':\r\n for c in cands:\r\n if c not in w:\r\n cands = cands.replace(c,'')\r\n elif m == '.':\r\n for c in cands:\r\n if c in w:\r\n cands = cands.replace(c,'')\r\n elif m =='?':\r\n cands = cands.replace(w,'')\r\n\r\n if len(cands) == 1:\r\n guessable = True\r\n\r\n else:\r\n if m == '!':\r\n failcount += 1\r\n elif m =='?':\r\n if w != cands:\r\n failcount += 1\r\n\r\nprint(failcount)\r\n\r\n", "n = int(input())\r\nd = {chr(i): 1 for i in range(97, 123)}\r\nflag = False\r\nans = 0\r\nfor i in range(n):\r\n t, w = input().split()\r\n if flag and (t == '!' or (t == '?' and i != n - 1)):\r\n ans += 1\r\n continue\r\n if t =='?' and i != n - 1:\r\n d[w] = 0\r\n elif t == '.':\r\n for j in w:\r\n d[j] = 0\r\n elif t == '!':\r\n s = set([chr(i) for i in range(97, 123)])\r\n for j in w:\r\n if j in s:\r\n s.remove(j)\r\n for j in s:\r\n d[j] = 0\r\n k = 0\r\n for j in range(97, 123):\r\n k += d[chr(j)]\r\n if k == 1:\r\n flag = True\r\nprint(ans)", "s,a=set('abcdefghijklmnopqrstuvwxyz'),0\r\nfor _ in range(int(input())-1):\r\n c,w=input().split()\r\n if len(s)==1 and c!='.':a+=1\r\n w=set(w)\r\n if c=='!':s&=w\r\n else:s-=w\r\nprint(a)", "n = int(input())\r\n\r\ncontains = set(\"abcdefghijklmnopqrstuvwxyz\")\r\nexclude = set()\r\n\r\nknow = False\r\nout = 0\r\nfor i in range(n):\r\n\tt, word = list(input().strip().split())\r\n\tif know and (t == \"!\" or t == \"?\"):\r\n\t\tout += 1\r\n\telif t == \"!\":\r\n\t\tcontains = set(word) & set(contains) - exclude\r\n\telif t == \".\":\r\n\t\texclude = exclude | set(word)\r\n\t\tcontains = contains - exclude\r\n\telif t == \"?\":\r\n\t\texclude.add(word)\r\n\t\tcontains.discard(word)\r\n\r\n\tif len(contains) == 1:\r\n\t\tknow = True\r\n\r\nif out == 0:\r\n\tprint(\"0\")\r\nelse:\r\n\tprint(out - 1)\r\n", "n = int(input())\r\nsusp = set([chr(ord('a') + i) for i in range(ord('z') - ord('a') + 1)])\r\nok = set()\r\nq = 0\r\nans = 0\r\nfor i in range(n):\r\n\tact, word = input().split()\r\n\tif act == '!':\r\n\t\tsusp = susp & set(list(word)) - ok\r\n\t\tans += q\r\n\telif act == '.':\r\n\t\tok |= set(list(word))\r\n\t\tsusp -= ok\r\n\telif act == '?':\r\n\t\tok.add(word)\r\n\t\tsusp.discard(word)\r\n\t\tans += q\r\n#\tprint(susp, ok)\r\n\tif len(susp) == 1:\r\n\t\tq = 1\r\nprint(max(ans - 1, 0))", "# Сложность по времени\r\n# Сложность по памяти\r\n\r\nn = int(input())\r\na = [-1] * 26\r\nall = set(i for i in \"abcdefghijklmnoprqstuvwxyz\")\r\nbad = set(\"\")\r\nres_cnt = 0\r\nflag = False\r\nfor i in range(n - 1):\r\n cmd, word = input().split()\r\n if flag:\r\n if cmd in \"!?\":\r\n res_cnt += 1\r\n continue\r\n if cmd == \".\":\r\n for c in set(word):\r\n pos = ord(c) - ord(\"a\")\r\n a[pos] = 0\r\n all.discard(c)\r\n bad.discard(c)\r\n elif cmd == \"!\":\r\n curr_bad = set()\r\n for c in set(word):\r\n pos = ord(c) - ord(\"a\")\r\n if a[pos] == 0:\r\n all.discard(c)\r\n else:\r\n curr_bad.add(c)\r\n if not bad:\r\n bad = curr_bad\r\n else:\r\n old_bad = bad.copy()\r\n bad = bad.intersection(curr_bad)\r\n for c in old_bad - bad:\r\n pos = ord(c) - ord(\"a\")\r\n a[pos] = 0\r\n all.discard(c)\r\n for c in curr_bad - bad:\r\n pos = ord(c) - ord(\"a\")\r\n a[pos] = 0\r\n all.discard(c)\r\n else:\r\n c = word[0]\r\n pos = ord(c) - ord(\"a\")\r\n a[pos] = 0\r\n all.discard(c)\r\n bad.discard(c)\r\n\r\n if len(bad) == 1 or len(all) == 1:\r\n flag = True\r\nprint(res_cnt)", "n = int(input())\r\n\r\nflag = False\r\nans = 0\r\ncurr = set([chr(x) for x in range(ord('a'), ord('z')+1)])\r\n\r\nfor i in range(n):\r\n c,s = input().split(' ')\r\n\r\n if c[0] == '.':\r\n letters = set(s)\r\n curr = curr - letters\r\n if len(curr) == 1: flag = True\r\n continue\r\n\r\n if c[0] == '!':\r\n if flag: ans += 1\r\n else:\r\n letters = set(s)\r\n curr = curr & letters\r\n \r\n if len(curr) == 1: flag = True\r\n\r\n continue\r\n\r\n if c[0] == '?':\r\n guess = s[0]\r\n\r\n if flag: ans += 1\r\n else:\r\n curr = curr - set(guess)\r\n if len(curr) == 1: flag = True\r\n\r\n if i == n-1 and len(curr) == 1 and guess in curr: ans -= 1\r\n continue\r\n\r\nprint(ans)\r\n", "a=set('abcdefghijklmnopqrstuvwxyz')\r\nn=int(input())\r\nfor i in range (n):\r\n e,b=input().split()\r\n if e=='!':\r\n a.intersection_update(set(b))\r\n elif e=='?' and (i!=(n-1)):\r\n a.difference_update(set(b))\r\n elif e=='.':\r\n a.difference_update(set(b))\r\n if len (a)==1:\r\n break\r\ns=0\r\nfor j in range (i+1,n):\r\n e,b=input().split()\r\n if e=='!' or (e=='?' and j!=(n-1)):\r\n s+=1\r\nprint(s)\r\n", "n = int(input())\r\nrec = set(\"abcdefghijklmnopqrstuvwxyz\")\r\nnum = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n if i == n - 1:\r\n continue\r\n if len(rec) == 1:\r\n if a == \"?\" or a == \"!\":\r\n num += 1\r\n\r\n elif a == \"!\":\r\n rec = rec & set(b)\r\n else:\r\n rec = rec - set(b)\r\n\r\nprint(num)", "n= int(input())\r\nk=0\r\nf=True\r\nA={\"a\",\"b\",\"c\",\"d\",\"e\",\"f\",\"i\",\"o\",\"u\",\"y\",\"g\",\"h\",\"j\",\"k\",\"l\",\"m\",\"n\",\"p\",\"q\",\"r\",\"s\",\"t\",\"v\",\"w\",\"x\",\"y\",\"z\"}\r\nfor i in range(n) :\r\n \r\n s=input().split()\r\n if (s[0]==\".\") :\r\n se={x for x in s[1]}\r\n A-=se\r\n \r\n else :\r\n if len(A)<=1 :\r\n k+=1\r\n f=False\r\n if (s[0]==\"!\") :\r\n se={x for x in s[1]}\r\n A&=se\r\n \r\n \r\n else :\r\n se={x for x in s[1]}\r\n A-=se\r\n \r\n \r\nif (f) :\r\n print(k)\r\nelse :\r\n print(k-1)\r\n \r\n \r\n \r\n", "n=int(input())\r\nc=set('qwertyuiopasdfghjklzxcvbnm')\r\nch=False\r\nk=0\r\nfor i in range(n-1):\r\n s=input()\r\n if ch:\r\n if s[0]!='.':\r\n k+=1\r\n else:\r\n if s[0]=='.':\r\n c.difference_update(set(s[2:]))\r\n elif s[0]=='!':\r\n c.intersection_update(set(s[2:]))\r\n else:\r\n if s[2] in c:\r\n c.remove(s[2])\r\n if len(c)==1:\r\n ch=True\r\ninput()\r\nprint(k)", "ar=[0]*26\r\nl=0;isk=0;d=int(input())\r\nfor i in range(d):\r\n s,m=input().split(' ')\r\n j=0\r\n if (isk>=25) and ((s=='!') or ((s=='?') and i<d-1)):\r\n l+=1\r\n if s=='.':\r\n for j in range(len(m)):\r\n if not ar[ord(m[j])-ord('a')]:isk+=1\r\n ar[ord(m[j])-ord('a')]=1\r\n elif s=='!':\r\n for j in range(26):\r\n if not (chr(ord('a')+j) in m):\r\n if not ar[j]:isk+=1\r\n ar[j]=1\r\n elif (s=='?') and (i<d-1):\r\n if not ar[ord(m)-ord('a')]:isk+=1\r\n ar[ord(m)-ord('a')]=1\r\n\r\nprint(l)", "from sys import exit\nn = int(input())\nletters = set('qwertyuiopasdfghjklzxcvbnm')\nel_count = 0\n\n\nfor i in range(n):\n a = input()\n if a[0] == '!':\n letters = letters & set(a[2:])\n el_count += 1\n elif a[0] == '.':\n letters = letters - set(a[2:])\n elif a[0] == '?' and i != n-1:\n letters = letters - set(a[2:])\n el_count += 1\n\n if len(letters) == 1:\n min_i = i\n break;\nelse:\n print(0)\n exit()\n\nel = el_count\nfor i in range(min_i+1, n):\n a = input()\n if a[0] == '!' or (a[0] == '?' and i != n-1):\n el_count += 1\n\nprint(el_count - el)\n", "class Shocker:\n\n def __init__(self):\n self.to_test = {\n 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm',\n 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'\n }\n self.wrong_chars = set()\n self.is_solved = False\n self.after_shocks = 0\n\n def __str__(self):\n return \"Solved: {}, after shocks: {}\\nTo test: {}\\nWrong chars: {}\".format(\n self.is_solved,\n self.after_shocks,\n \", \".join(list(self.to_test)),\n \", \".join(list(self.wrong_chars))\n )\n\n def do_no_shock(self, s: str):\n for c in s:\n if c in self.to_test:\n self.to_test.remove(c)\n if c not in self.wrong_chars:\n self.wrong_chars.add(c)\n if not self.is_solved and len(self.to_test) < 2:\n self.is_solved = True\n\n def do_shock(self, s: str):\n if self.is_solved:\n self.after_shocks += 1\n else:\n testing = set()\n new_to_test = set()\n new_wrong = set()\n for c in s:\n if c not in testing:\n testing.add(c)\n if c in self.to_test:\n new_to_test.add(c)\n else:\n new_wrong.add(c)\n for c in self.to_test:\n if c not in testing:\n new_wrong.add(c)\n self.to_test = new_to_test\n for c in new_wrong:\n if c not in self.wrong_chars:\n self.wrong_chars.add(c)\n if len(self.to_test) < 2:\n self.is_solved = True\n\n def do_test(self, c: str, is_correct):\n if self.is_solved:\n if not is_correct:\n self.after_shocks += 1\n else:\n if is_correct:\n self.is_solved = True\n else:\n if c not in self.wrong_chars:\n self.wrong_chars.add(c)\n if c in self.to_test:\n self.to_test.remove(c)\n if len(self.to_test) < 2:\n self.is_solved = True\n\n\nshocker = Shocker()\nn = int(input())\nfor i in range(n):\n op = input().split(\" \", 2)\n op_type = op[0]\n chars = op[1]\n if op_type == '!':\n shocker.do_shock(chars)\n elif op_type == '.':\n shocker.do_no_shock(chars)\n elif op_type == '?':\n shocker.do_test(chars, i >= n - 1)\nprint(shocker.after_shocks)\n", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nqueries = list(input().split() for _ in range(n))\r\n\r\nchars = [chr(ord('a')+i) for i in range(26)]\r\nchars_set = set(list(chars))\r\nres, cnt = '', 0\r\n\r\nfor c, f in queries:\r\n if c == '.':\r\n for q in f:\r\n if q in chars_set:\r\n chars_set.discard(q)\r\n elif c == '!':\r\n if res: cnt += 1\r\n chars_set = set(list(f)) & chars_set\r\n elif c == '?':\r\n if res and f != res: cnt += 1\r\n chars_set.discard(f)\r\n if not res and len(chars_set) == 1:\r\n res = list(chars_set)[0]\r\nprint(cnt)\r\n", "n = int(input().strip())\r\n#print(n)\r\n\r\nalpha = set(())\r\n\r\nfor i in range(ord(\"a\"), ord(\"z\")+1):\r\n alpha.add(chr(i))\r\n\r\n#print(alpha)\r\n\r\ndef noshock(s):\r\n global alpha\r\n letters = set(s)\r\n alpha = alpha - letters\r\n\r\ndef shock(s):\r\n global alpha\r\n letters = set(s)\r\n alpha = alpha&letters\r\n\r\ndef ask(c):\r\n global alpha\r\n if c in alpha:\r\n alpha.remove(c)\r\n\r\nind = 0\r\n\r\nfor i in range(n):\r\n temp = input().split(\" \")\r\n# print(temp)\r\n if temp[0] == \".\":\r\n noshock(temp[1])\r\n elif temp[0] == \"!\":\r\n shock(temp[1])\r\n elif temp[0] == \"?\":\r\n ask(temp[1])\r\n# print(alpha)\r\n if len(alpha) == 1:\r\n ind = i+1\r\n break\r\n\r\n#print(ind)\r\n\r\ntot = 0\r\n\r\nif ind == 0:\r\n tot = 0\r\nelse:\r\n for i in range(ind+1, n):\r\n temp = input().split(\" \")\r\n if temp[0] == \"!\":\r\n tot += 1\r\n elif temp[0] == \"?\":\r\n if temp[1] not in alpha:\r\n tot += 1\r\n\r\nprint(tot)", "import sys\n\n#f = open('input', 'r')\nf = sys.stdin\nn = int(f.readline())\ncset = set(chr(ord('a')+i) for i in range(26))\nfound = False\nres = 0\nfor _ in range(n):\n action, word = f.readline().split()\n if action == '!':\n if found:\n res += 1\n cset &= set(word)\n elif action == '.':\n cset -= set(word)\n else:\n if word in cset:\n cset.remove(word)\n if found and len(cset) == 1:\n res += 1\n if len(cset) == 1:\n found = True\n\nprint(res)\n", "c=set(\"abcdefghijklmnopqrstuvwxyz\"); d=0\r\n\r\nn=int(input())\r\nfor i in range(0,n-1):\r\n s=input().split(\" \")\r\n if len(c)<2 and s[0] in '!?':\r\n d+=1\r\n elif s[0]=='!':\r\n c&=set(s[1])\r\n else:\r\n c-=set(s[1])\r\nprint(d) \r\n", "a = [True for i in range(26)]\r\nn = int(input())\r\ns = 0\r\nl = 26\r\nfor i in range(n):\r\n v = input().split()\r\n if v[0]=='!':\r\n t = [True for j in range(26)]\r\n for c in v[1]:\r\n t[ord(c)-97]=False\r\n for c in range(26):\r\n if t[c]:\r\n a[c]=False\r\n if l<=1:\r\n s+=1\r\n elif v[0]=='.':\r\n for c in v[1]:\r\n a[ord(c)-97]=False\r\n elif v[0]=='?':\r\n a[ord(v[1])-97]=False\r\n if i!=n-1 and l<=1:\r\n s+=1\r\n l = a.count(True)\r\nprint(s)\r\n", "n = int(input())\r\n\r\nchoice = set(( chr(x) for x in range(ord('a'), ord('z')+1) ))\r\nresult = 0\r\nfound = False\r\n\r\nfor i in range(n-1):\r\n\r\n a, w = input().split()\r\n if a == '?':\r\n if len(choice) == 1:\r\n result+=1\r\n try:\r\n choice.remove(w)\r\n except:\r\n pass\r\n\r\n elif a == '.':\r\n for lt in w:\r\n try:\r\n choice.remove(lt)\r\n except:\r\n pass\r\n elif a == '!':\r\n if len(choice) == 1:\r\n result += 1\r\n tmp = set()\r\n for lt in w:\r\n if lt in choice:\r\n tmp.add(lt)\r\n choice=tmp\r\n\r\n\r\n\r\nprint(result)", "n = int(input())\r\n\r\ncnt = 0\r\ncnb = set('abcdefghijklmnopqrstuvwxyz')\r\n\r\nfor _ in range(n-1):\r\n a, w = input().split()\r\n\r\n if a == '.':\r\n cnb = cnb.difference(set(w))\r\n elif a == '?':\r\n if len(cnb) == 1:\r\n cnt += 1\r\n cnb = cnb.difference(set(w))\r\n\r\n elif a == '!':\r\n if len(cnb) == 1:\r\n cnt += 1\r\n\r\n cnb = cnb.intersection(set(w))\r\n\r\nprint(cnt)\r\n", "n = int(input())\r\n#print(n)\r\nyo = set()\r\nans = 0\r\nflag = 0\r\nfor i in range(26):\r\n yo.add(chr(ord('a')+i))\r\nfor i in range(n):\r\n s = input().split()\r\n if i == n - 1 :\r\n continue\r\n if s[0] == '!':\r\n bro = set()\r\n for j in s[1]:\r\n bro.add(j)\r\n for j in range(26):\r\n if not chr(ord('a')+j) in bro:\r\n yo.discard(chr(ord('a')+j))\r\n\r\n if flag == 1 :\r\n ans += 1\r\n elif s[0] == '.':\r\n for j in s[1]:\r\n yo.discard(j)\r\n else:\r\n #if len(yo) > 0:\r\n yo.discard(s[1])\r\n if flag == 1 :\r\n ans += 1\r\n if flag == 0 and len(yo) == 1:\r\n flag = 1\r\n\r\nprint(ans)\r\n\r\n\r\n", "occur = [1]*26\n\nn=int(input())\nt=1\nfor a in range(1,n):\n\tact, word = input().split()\n\tt=a\n\tif act=='!':\n\t\ttemp=[0]*26\n\t\tfor c in word:\n\t\t\ttemp[ord(c)-ord('a')]=1\n\t\tfor i in range(26):\n\t\t\toccur[i]=occur[i]&temp[i]\n\t\tif(sum(occur)==1):\n\t\t\tbreak\n\telse:\n\t\tfor c in word:\n\t\t\toccur[ord(c)-ord('a')]=0\n\t\tif(sum(occur)==1):\n\t\t\tbreak\n# print (t)\nans = 0\nfor a in range(t+1,n):\n\tact, word = input().split()\n\tif act!='.':\n\t\tans+=1\nact, word = input().split()\nprint(ans)\n\n\n", "n = int(input())\r\nl1 = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'h', 'w', 'y', 'x', 'z', 'v'}\r\nfor i in range(n - 1):\r\n l = list(input())\r\n if l[0] == '.':\r\n l = set(l[2:])\r\n l1 -= l\r\n elif l[0] == '!':\r\n l = set(l[2:])\r\n l1 &= l\r\n else:\r\n l1 -= set(l[2])\r\n if len(l1) == 1:\r\n q = 0\r\n for k in range(n - i - 2):\r\n l = list(input())\r\n if l[0] != '.':\r\n q += 1\r\n print(q)\r\n break\r\nif len(l1) > 1:\r\n print(0)\r\n ", "n = int(input())\r\nset1 = set()\r\nans = 0\r\nfor i in range(97,123):\r\n set1.add(chr(i))\r\nfor i in range(n):\r\n a, b = input().split()\r\n if len(set1) == 1:\r\n if a == \"?\" and i != n - 1:\r\n ans += 1\r\n if a == \"!\":\r\n ans += 1\r\n else:\r\n set2 = set()\r\n for i in b:\r\n set2.add(i)\r\n \r\n if a == \".\":\r\n set1 -= set2\r\n elif a == \"!\":\r\n set1 &= set2\r\n elif a == \"?\":\r\n set1 -= set2\r\nprint(ans)", "n = int(input())\nd = set()\nfor i in range(26):\n d.add(chr(ord('a')+i))\nchocks = 0\ndone = -1\nfor i in range(n):\n s = input().split()\n toR = []\n if s[0] == '!':\n chocks += 1\n for x in d:\n if not x in s[1]: toR.append(x)\n for x in toR: d.remove(x)\n if s[0] == '.':\n for x in d:\n if x in s[1]: toR.append(x)\n for x in toR: d.remove(x)\n if s[0] == '?':\n if i!=n-1: chocks += 1\n if s[1] in d: d.remove(s[1])\n if len(d) == 1 and done == -1:\n done = chocks\nif done == -1:\n print(0)\nelse:\n print(chocks-done)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nALPHA = 'abcdefghijklmnopqrstuvwxyz'\r\nN = int(input())\r\nans = 0\r\nfind = set([c for c in ALPHA])\r\nfor i in range(N):\r\n a,b = input().split()\r\n if a=='!':\r\n if len(find)==1:\r\n ans+=1\r\n else:\r\n tmp = set()\r\n for c in b:\r\n if c in find:\r\n tmp.add(c)\r\n find = tmp\r\n elif a=='?':\r\n if len(find)==1 and b not in find:\r\n ans+=1\r\n elif len(find)>1:\r\n for c in b:\r\n if c in find:\r\n find.remove(c)\r\n else:\r\n for c in b:\r\n if c in find:\r\n find.remove(c)\r\n #print(a,b,find)\r\nprint(ans)\r\n \r\n ", "import string\r\n\r\ndef toset(x):\r\n res = set()\r\n for i in x:\r\n res.add(i)\r\n return res\r\n\r\nl = toset(string.ascii_lowercase)\r\nn = int(input())\r\npig = False\r\nans = 0\r\nfor _ in range(n - 1):\r\n if(len(l) == 1):\r\n pig = True\r\n ch, x = input().split()\r\n if(ch == '.'):\r\n for i in x:\r\n if(i in l):\r\n l.remove(i)\r\n elif(ch == '!'):\r\n if(pig):\r\n ans += 1\r\n l = set.intersection(toset(x), l)\r\n else:\r\n if(pig):\r\n ans += 1\r\n if(x in l):\r\n l.remove(x)\r\nprint (ans)\r\n", "n = int(input())\r\nq = []\r\nfor _ in range(n):\r\n q.append(input().split())\r\n \r\ns = set('abcdefghijklmnopqrstuvwxyz')\r\n\r\nletter = q[-1][-1]\r\n\r\nfor i in range(n-1):\r\n if q[i][0] == '!':\r\n s &= set(q[i][1])\r\n else:\r\n s -= set(q[i][1])\r\n if len(s) == 1:\r\n cnt = 0\r\n for j in range(i+1, n-1):\r\n if q[j][0] != '.':\r\n cnt += 1\r\n print(cnt)\r\n exit(0)\r\nprint(0)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nfrom string import ascii_lowercase\r\n\r\n\r\ndef main():\r\n\tn = int(input())\r\n\tcan = set(ascii_lowercase)\r\n\ti = -1\r\n\tfound = False\r\n\tcnt = 0\r\n\tfor j in range(n):\r\n\t\tturn, word = input().split()\r\n\t\tif found and j != n - 1 and turn != '.':\r\n\t\t\tcnt += 1\r\n\t\tif turn == '.':\r\n\t\t\tcan -= set(word)\r\n\t\t\tif len(can) == 1 and not found:\r\n\t\t\t\ti = j\r\n\t\t\t\tfound = True\r\n\t\telif turn == '!':\r\n\t\t\tcan &= set(word) \r\n\t\t\tif len(can) == 1 and not found:\r\n\t\t\t\ti = j\r\n\t\t\t\tfound = True\t\t\t\t\r\n\t\telse:\r\n\t\t\tif j == n-1:\r\n\t\t\t\ti = n-1\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tcan -= set(word)\r\n\t\t\t\tif len(can) == 1 and not found:\r\n\t\t\t\t\ti = j\r\n\t\t\t\t\tfound = True\r\n\tprint(cnt)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\t", "n = int(input())\r\nlet = set()\r\nfor i in range(97, 123):\r\n let.add(chr(i))\r\nflag = 0\r\nans = 0\r\nfor i in range(n - 1):\r\n if len(let) == 1:\r\n flag = 1\r\n t, s = map(str, input().split())\r\n #print(t, s)\r\n if t == '!':\r\n now = set(list(s))\r\n if flag == 1:\r\n ans += 1\r\n let = let.intersection(now)\r\n #print(now)\r\n #print(let)\r\n if t == '?':\r\n if flag == 1:\r\n ans += 1\r\n if s in let:\r\n let.remove(s)\r\n if t == '.':\r\n now = list(s)\r\n for elem in now:\r\n if elem in let:\r\n let.remove(elem)\r\nprint(ans)" ]

[ "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\tc=0\r\n\ta.append(input())\r\n\tfor j in range(0,i):\r\n\t\tif j!=i:\r\n\t\t\tif a[i]==a[j]:\r\n\t\t\t\tc+=1\r\n\tif c>0:\r\n\t\tprint(\"YES\")\t\r\n\telse:\r\n\t\tprint(\"NO\")", "#all those moments will be lost in time , like tears in rain \"D\r\na=[]\r\nn=int(input())\r\nfor _ in range(n):\r\n\tb=input()\r\n\tif b in a:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\t\ta.append(b);", "def tomRiddleDiary(s):\n if s in a:\n return \"YES\"\n\n else:\n return \"NO\"\n\n\na = set()\nt = int(input())\nwhile t > 0:\n s = input()\n print(tomRiddleDiary(s))\n t = t - 1\n a.add(s)\n \t\t \t \t\t\t \t\t \t \t \t", "i = int(input())\r\nl = []\r\nres = []\r\nwhile i > 0:\r\n a = input()\r\n i -= 1\r\n if a in l:\r\n res.append('YES')\r\n else:\r\n l.append(a)\r\n res.append('NO')\r\n\r\nfor e in res:\r\n print(e)\r\n", "#C\nn = int(input())\nalist = []\n\nfor a in range(n):\n name = str(input())\n if name in alist:\n print(\"YES\")\n else:\n print(\"NO\")\n alist.append(name)\n \t\t\t \t \t \t\t \t \t \t\t", "a=int(input())\nlist=[]\nfor i in range(a):\n n=input()\n if n in list:\n print(\"Yes\")\n else:\n print(\"No\")\n list.append(n)\n \t\t \t \t\t\t\t \t\t\t \t", "temp = []\nfor rangavazzala in range(int(input())):\n name = input()\n if name not in temp:\n print(\"NO\")\n temp.append(name)\n else:\n print(\"YES\")\n\t \t\t\t\t \t \t \t\t\t \t \t\t\t \t\t", "\nfrom sys import stdin\nfrom math import log, floor, ceil, gcd\nfrom collections import defaultdict as dd\n#from bisect import bisect_left as bl,bisect_right as br\n\n\ninput = stdin.readline\ndef inp(): return int(stdin.readline())\ndef rs(): return stdin.readline().strip()\n\n\ndef ra(typ): return list(map(typ, stdin.readline().split()))\ndef rv(typ): return map(typ, stdin.readline().split())\n\n\n#mod = 1000000007\n\n\ndef main():\n x = set()\n for _ in range(inp()):\n s = rs()\n if s in x:\n print(\"YES\")\n continue\n x.add(s)\n print(\"NO\")\n\nmain()\n\n \t\t\t \t \t \t\t \t\t \t \t\t\t \t", "\r\nmyDict = {}\r\n\r\n\r\nclass Solution:\r\n def solve(self, string):\r\n if string not in myDict:\r\n myDict[string] = 1\r\n return False\r\n else:\r\n return True\r\n\r\n\r\nsol = Solution()\r\n\r\nt = int(input().strip())\r\n\r\nfor i in range(t):\r\n string = input().strip()\r\n print(\"YES\" if sol.solve(string) else \"NO\")\r\n", "n = int(input())\na = []\nfor i in range(n):\n b = input()\n if b in a:\n print('Yes')\n else:\n print('No')\n a.append(b)\n \t\t\t \t\t \t\t\t \t \t\t", "n = int (input())\r\n\r\ndt = {}\r\n\r\nfor i in range (n):\r\n s = input()\r\n if s in dt:\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")\r\n dt[s] = True", "num = int(input())\r\npeople = []\r\ns = set()\r\n\r\nfor i in range(num):\r\n person = input()\r\n if person in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n s.add(person)\r\n", "n=int(input())\r\na=set()\r\nb=\"\"\r\nfor i in range(n):\r\n b=input()\r\n if b in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n a.add(b)", "def check_diary_possession(n, names):\r\n possession = set()\r\n\r\n for name in names:\r\n if name in possession:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n possession.add(name)\r\n\r\n\r\n# Read input\r\nn = int(input())\r\nnames = []\r\nfor _ in range(n):\r\n names.append(input().lower())\r\n\r\n# Check diary possession\r\ncheck_diary_possession(n, names)\r\n", "# Homework 4: Problem C -- Fashion a computer program from Python code that inspects a series of monikers inputted on separate successive lines \n#for repetitions, displaying the word \"YES\" for every repeated moniker and the word \"NO\" for every first instance of a certain moniker.\n\ncardinality_of_name_occurrences = input()\n\ncardinality_of_name_occurrences = int(cardinality_of_name_occurrences)\n\nlist_of_name_occurrences = [] #Initialization of the list variable\npolar_response_particle_sequence = [] #Initialization of the list variable\n\nfor i in range(cardinality_of_name_occurrences):\n x = input()\n x = str(x)\n x = [x]\n if x in list_of_name_occurrences:\n polar_response_particle_sequence.append(\"YES\")\n else:\n polar_response_particle_sequence.append(\"NO\")\n list_of_name_occurrences.append(x)\n\nfor i in polar_response_particle_sequence:\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", "a=int (input ())\r\nv1=[]\r\nfor i in range (a):\r\n b=input()\r\n if (b in v1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n v1.append(b) ", "numberOfpeople=int(input())\r\nnames=[]\r\nfor i in range(numberOfpeople):\r\n letters=input()\r\n names.append(letters)\r\nfor i in range(numberOfpeople):\r\n if all(names[j]!=names[i] for j in range(i-1,-1,-1)):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "# your code goes here\nn=int(input())\nl=[]\nlis=[]\nfor i in range(n):\n\ts=input()\n\tl.append(s)\nli=[]\t\nfor i in l:\n\tif i not in li:\n\t\tli.append(i)\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n\n \t\t\t\t\t \t \t\t\t \t \t\t \t \t \t \t", "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=set()\n\tfor i in range(n):\n\t\ts=read()\n\t\tif s in a:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\t\t\ta.add(s)\n\nsolve()\n", "n=int(input())\r\nt=[]\r\nfor i in range(n):\r\n x=input()\r\n t.append(x)\r\nfor j in range(len(t)):\r\n if j==0:\r\n print(\"NO\")\r\n else:\r\n for k in range(j):\r\n if t[j]==t[k]:\r\n print(\"YES\")\r\n break\r\n else:\r\n print(\"NO\") \r\n\r\n\r\n", "import sys\n\nif __name__ == \"__main__\":\n\tn = int(sys.stdin.readline().strip())\n\tmp = dict()\n\tfor _ in range(n):\n\t\tstring = sys.stdin.readline().strip()\n\t\tif string in mp:\n\t\t\tmp[string] += 1\n\t\telse:\n\t\t\tmp[string] = 1\n\t\t\n\t\tif mp[string] > 1:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n \t\t\t\t \t\t\t\t\t \t\t \t\t \t\t\t", "n = int(input())\nx = {}\nfor i in range(n):\n s = input()\n\n if not x.get(s):\n x[s] = 1\n print(\"NO\")\n\n else:\n print(\"YES\")\n \t \t\t \t \t \t\t\t\t\t\t\t \t\t", "n=int(input())\r\nname_set=set()\r\nfor i in range(n):\r\n name=input().strip()\r\n if name in name_set:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n name_set.add(name)\r\n ", "n = int(input())\r\nnames = []\r\nfor _ in range(n):\r\n hehe = input()\r\n names.append(hehe)\r\nfor i in range(n):\r\n names_new = names[0:i]\r\n if names[i] in names_new:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "l = []\r\nn = (int(input()))\r\nfor i in range(n):\r\n s = input()\r\n print('Yes' if s in l else 'No')\r\n l.append(s)", "n = int(input())\r\ns = []\r\nfor i in range(n):\r\n string = str(input())\r\n s.append(string)\r\n\r\nfor i in range(len(s)):\r\n if s[i] in s[0:i]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\nnames = []\nfor i in range(n):\n new_name = input()\n if names.count(new_name) == 0:\n print(\"NO\")\n else:\n print(\"YES\")\n\n names.append(new_name)\n\t \t \t \t\t\t\t\t\t\t\t \t\t \t \t\t\t\t \t\t", "t = int(input())\r\nunique_names = set()\r\n\r\nfor _ in range(t):\r\n name = input().strip()\r\n if name not in unique_names:\r\n print(\"NO\")\r\n unique_names.add(name)\r\n else:\r\n print(\"YES\")\r\n", "a = []\r\nfor _ in range(int(input())):\r\n x = input()\r\n if x not in a:\r\n print(\"NO\")\r\n a += [x]\r\n else:\r\n print(\"YES\")\r\n", "def diary(x):\n names = set()\n result = []\n\n for name in x:\n if name in names:\n result.append(\"YES\")\n else:\n result.append(\"NO\")\n names.add(name)\n\n return result\n\nn = int(input().strip())\n\nx = [input().strip().lower() for _ in range(n)]\n\nresult = diary(x)\nfor r in result:\n print(r)\n\n \t\t\t \t\t \t\t\t\t \t\t \t \t \t\t", "lst = []\nfor i in range(int(input())):\n s = input()\n if s not in lst:\n lst.append(s)\n print(\"No\")\n else:\n print(\"Yes\")\n \n\n \t\t\t\t \t\t \t \t \t \t\t\t \t", "t=int(input())\narr=[]\ncount=0\nfor i in range(t):\n s=input()\n arr.append(s)\n count=arr.count(s)\n if count>1:\n print(\"YES\")\n else:\n print(\"NO\")\n \t\t \t\t\t\t \t\t \t\t\t \t", "n = int(input())\r\nz =[]\r\nfor i in range (n):\r\n z.append(input())\r\n for j in range (len(z)):\r\n if len(z)!=1:\r\n if z[-1]==z[j]:\r\n print(\"YES\")\r\n break\r\n elif j==len(z)-2 and z[j]!=z[-1]:\r\n print(\"NO\")\r\n break\r\n\r\n else:\r\n print(\"NO\")\r\n break", "n=int(input())\r\na=[]\r\nfor i in range(0,n):\r\n m=input()\r\n if m in a:\r\n print ('YES')\r\n else:\r\n print ('NO')\r\n a.append(m)", "ans=[]\r\nfor i in range(int(input())):\r\n number=input()\r\n if number not in ans:\r\n ans.append(number)\r\n print('NO')\r\n else:\r\n ans.append(number)\r\n print('YES')", "num_names = int(input())\n\ndef in_diary(num_names):\n names = []\n cur_name = []\n\n for i in range(num_names):\n cur_name.append(input())\n\n for i in range(num_names):\n if cur_name[i] not in names:\n names.append(cur_name[i])\n print('NO')\n else: print('YES') \n \nin_diary(num_names)\n\t \t\t\t \t\t \t\t \t\t\t \t \t \t \t\t\t\t\t", "s = set()\r\nfor i in range(int(input())): \r\n d = str(input())\r\n exec('print(\"yes\")' if d in s else 'print(\"no\")')\r\n s.add(d)", "if __name__ == '__main__':\r\n stack = list()\r\n for _ in range(int(input())):\r\n s = input()\r\n if s in stack:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n stack.append(s)\r\n \r\n", "x = int(input())\r\nnames = []\r\nans = []\r\ntrack = []\r\nfor t in range(x):\r\n s = input()\r\n names.append(s)\r\nfor i in range(len(names)):\r\n if names[i] in track:\r\n ans.append('YES')\r\n track.append(names[i])\r\n else:\r\n track.append(names[i])\r\n ans.append('NO')\r\nfor i in ans:\r\n print(i)\r\n", "a = int(input())\r\nb = []\r\nfor i in range(a):\r\n\tc = input()\r\n\tif c not in b:\r\n\t\tprint(\"NO\")\r\n\t\tb.append(c)\r\n\telse:\r\n\t\tprint(\"YES\")", "n = int(input())\na = []\nc = [None] * n\nans = [\"NO\"] * n\nfor x in range(0, n):\n b = str(input())\n a.append(b)\nc[0] = a[0]\nfor i in range(1, n):\n if a[i] in c:\n ans[i] = \"YES\"\n else:\n ans[i] = \"NO\"\n c.append(a[i])\nfor s in ans:\n print(s)\n \t \t\t \t \t\t\t \t\t\t\t \t \t\t \t \t\t", "n = int(input())\r\nnames = []\r\nfor i in range(0,n):\r\n name = input()\r\n for j in range(0,i+1):\r\n if name in names:\r\n print('YES')\r\n break\r\n else:\r\n names.append(name)\r\n print('NO')\r\n break", "from sys import stdin\r\n\r\nse = set()\r\nfor _ in range(int(stdin.readline())):\r\n s = stdin.readline().strip()\r\n if s in se:\r\n print('YES')\r\n else:\r\n print('NO')\r\n se.add(s)\r\n\r\n\r\n", "n = int(input())\r\nnames = []\r\n\r\nfor i in range(n):\r\n flag = False\r\n name = input()\r\n \r\n for j in range(i):\r\n if name == names[j]:\r\n flag = True\r\n break\r\n \r\n if flag:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n names.append(name)\r\n", "num = int(input())\r\nnames = []\r\nuniqNames = set(names)\r\n\r\nfor x in range(num):\r\n names.append(input())\r\n\r\nuniqNames = set([])\r\n\r\nfor x in names:\r\n if (x in uniqNames):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n uniqNames.add(x)\r\n", "n = int(input())\r\nA = []\r\nfor _ in range(n):\r\n s = str(input())\r\n if s not in A:\r\n print(\"No\")\r\n A.append(s)\r\n else:\r\n print(\"Yes\")\r\n ", "n = int(input())\ncount = []\nfor i in range(0, n):\n s = input()\n if count.count(s) > 0:\n print(\"YES\")\n else:\n print(\"NO\")\n count.append(s)", "c = {}\r\nfor _ in range(int(input())):\r\n a = input(\"\")\r\n if a in c:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n c[a] = a\r\n", "#Let's go\nimport sys\nimport math\nimport random\n\nsys.setrecursionlimit(2000000)\n\nt=int(input())\nar=[]\nfor i in range(t):\n s=input()\n ar.append(s)\n times=ar.count(s)\n if(times==1):\n print(\"NO\")\n else:\n print(\"YES\")\n \t\t \t\t \t \t\t\t \t \t \t \t \t\t \t", "first = []\r\nfor i in range(int(input())):\r\n second = input()\r\n if second not in first:\r\n print(\"NO\")\r\n first.append(second)\r\n else:\r\n print(\"YES\")", "class Solution:\r\n def diary_possession(self, n:int) -> None:\r\n list_ppl = []\r\n for i in range(n):\r\n name = str(input().strip())\r\n if not name in list_ppl:\r\n print('no')\r\n list_ppl.append(name)\r\n else:\r\n print('yes')\r\n\r\nobj = Solution()\r\nn = int(input().strip())\r\nobj.diary_possession(n)", "dict={}\r\nfor i in range(int(input())):\r\n s=input()\r\n if s not in dict:\r\n dict[s]=1\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "m=[]\nfor i in range(int(input())):\n a=str(input())\n if a not in m:\n \n m.append(a)\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 \t", "n=int(input())\nl=[]\nwhile n>0:\n l.append(input())\n n-=1\nfor i in range(len(l)):\n if l[i] in l and i>l.index(l[i]):\n print(\"YES\")\n else:\n print(\"NO\")\n\t\t\t\t \t \t \t \t\t\t\t \t \t \t", "a=int(input())\nb=set()\nfor i in range(a):\n c=input()\n print(\"NYOE S\"[c in b::2])\n b.add(c)\n \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 a.append(input())\r\nfor i in range(0,n):\r\n b=0\r\n for j in range(0,i):\r\n if a[i]==a[j] and j<i :\r\n b=b+1\r\n if b==0:\r\n print('NO')\r\n else:print('YES')", "# LUOGU_RID: 101672873\nst = set()\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s in st:\r\n print('YES')\r\n else:\r\n print('NO')\r\n st.add(s)", "t1=int(input())\nl1=[]\nfor i in range(t1):\n\ts1=input()\n\tif s1 not in l1:\n\t\tl1.append(s1)\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n\t \t\t \t \t\t\t \t\t \t \t\t\t \t \t\t\t \t\t", "n, res = int(input()), []\r\nfor i in range(n):\r\n res.append(input())\r\nfor i in range(n):\r\n if res[i] in res[:i]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "\nx=int(input())\nl=[]\nfor i in range(x):\n\ty=input()\n\tl.append(y)\nlst=[]\nfor i in l:\n\tif i not in lst:\n\t\tlst.append(i)\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n\t \t\t \t\t \t\t \t\t\t\t \t\t\t \t \t\t\t", "# get input\nN = int(input())\nnames = set()\nfor i in range(N):\n name = input()\n if name not in names:\n names.add(name)\n exist = False\n else:\n exist = True\n if exist:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t\t\t\t \t\t\t \t\t \t \t \t \t\t\t", "def solve(n):\r\n\r\n test = []\r\n for _ in range(n):\r\n case = input()\r\n if case in test:\r\n print(\"YES\")\r\n else:\r\n test.append(case)\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n solve(n)", "n = int(input())\r\ns = [input() for _ in range(n)]\r\n\r\nname = set([])\r\n\r\nfor si in s:\r\n if si in name:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n name.add(si)", "first = []\r\nnumber = int(input())\r\nfor i in range(number):\r\n first.append(input())\r\nvisible = [False for i in range(number)]\r\nfor i in range(number):\r\n for j in range(number):\r\n if i != j and first[i] == first[j] and i < j:\r\n visible[j] = True\r\nfor i in visible:\r\n if not i:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "testcases = int(input())\r\n\r\npossesed = []\r\nfor i in range(testcases):\r\n who = input()\r\n if who in possesed:\r\n print( \"YES\")\r\n else:\r\n possesed.append(who)\r\n print( \"NO\")", "t = int(input())\nlst5 = []\nwhile(t):\n a = input()\n if a not in lst5:\n lst5.append(a)\n print(\"NO\")\n else:\n print(\"YES\")\n \n t = t - 1\n \t\t \t \t\t \t \t\t\t\t\t \t\t\t\t\t\t \t", "n=int(input())\r\ns=[]\r\ns2=[]\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n):\r\n if s[i] in s[:i]:\r\n print(\"YES\")\r\n else: print(\"NO\")", "n = int(input())\nnames = []\nfor i in range(n):\n name = input()\n names.append(name)\n repeat = 0\n for j in range(i):\n if names[i] == names[j]:\n repeat = repeat + 1\n if repeat >= 1:\n print(\"Yes\")\n else:\n print(\"NO\")\n \n \n \n\n", "a = int(input())\r\nb = set();\r\nfor x in range(a):\r\n g = input();\r\n print(\"NO\") if not g in b else print (\"YES\")\r\n b.add(g)", "n = int(input())\r\na = []\r\nans = []\r\nfor x in range(n):\r\n temp = input()\r\n if temp in a:\r\n ans.append('YES')\r\n else:\r\n ans.append(\"NO\")\r\n a.append(temp)\r\nprint(*ans, sep = '\\n')", "x=int(input())\r\nlist=[]\r\nfor i in range(x):\r\n str=input()\r\n if(list.count(str)>0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n list.append(str)\r\n", "n = int(input())\ns = []\nfor i in range(n):\n s.append(input())\nsi = s\nfor i in range(len(s)):\n if i == 0:\n print(\"NO\")\n elif s[i] in si[:i]:\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", "n=int(input())\ni=0\nls=[]\nls1=[]\nwhile i<n:\n ls.append(input())\n i += 1\nfor s in ls:\n if s in ls1:\n print('YES')\n else:\n ls1.append(s)\n print('NO')\n\t\t\t \t \t\t \t\t \t\t \t\t \t \t\t \t\t \t", "a=[]\r\nfor i in range(int(input())):\r\n a.append(input())\r\nfor i in range(len(a)):\r\n if a[i] in a[0:i]:\r\n print('YES')\r\n else:\r\n print('No')\r\n", "def main_function():\r\n n = int(input())\r\n names = []\r\n output_list = []\r\n dict = {}\r\n for i in range(n):\r\n names.append(input())\r\n for name in names:\r\n if not name in dict:\r\n output_list.append(\"NO\")\r\n dict[name] = 1\r\n else:\r\n output_list.append(\"YES\")\r\n return \"\\n\".join(output_list)\r\n\r\n\r\nprint(main_function())", "t=int(input())\nl=[]\nfor i in range(t):\n arr=input()\n if arr not in l:\n l.append(arr)\n print(\"NO\")\n else:\n print(\"YES\")\n\t \t \t \t \t \t\t \t \t \t \t\t \t", "x = int(input())\ny = []\n\n\nfor i in range(x):\n name = input()\n if name in y:\n print(\"YES\")\n else:\n print(\"NO\")\n y.append(name)\n\t \t\t \t \t\t\t\t\t \t \t \t\t \t \t \t \t", "# your code goes here\nn=int(input())\nl=[]\nwhile n!=0:\n\ts=input()\n\tif s in l:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t\tl.append(s)\n\tn=n-1\n\t\n \t\t \t \t \t \t \t\t\t\t \t \t\t \t\t", "n = int(input())\r\nx = set()\r\ny = []\r\nz = {\r\n 1: 'YES',\r\n 0: 'NO'\r\n}\r\n\r\nfor i in range(n):\r\n i = input()\r\n if i in x:\r\n y.append(1)\r\n else:\r\n y.append(0)\r\n x.add(i)\r\n\r\nfor i in y:\r\n print(z.get(i))", "d={}\nfor _ in range(int(input())):\n s=input()\n if s in d:\n print(\"YES\")\n else:\n d[s]=1\n print(\"NO\")\n\n \t \t\t\t\t\t \t\t \t \t \t\t \t \t\t \t", "#Codeforce 855A\r\nnamelist=[]\r\nnum=int(input())\r\nfor i in range(num):\r\n name=input().strip(\"\\n\\r\")\r\n if name not in namelist:\r\n print(\"NO\")\r\n namelist.append(name)\r\n else:\r\n print(\"YES\")", "n=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n n1=input()\r\n if(n1 in lst):\r\n print('YES')\r\n else:\r\n print('NO')\r\n lst.append(n1)", "# c - 1\npurple=int(input())\ngreen= []\nfor i in range(purple):\n blue=input()\n if blue in green:\n print(\"YES\")\n else:\n print(\"NO\")\n green.append(blue)\n \t \t\t \t \t \t\t \t \t \t\t\t\t \t \t", "n = int(input())\r\n\r\npeople = set()\r\n\r\nfor i in range(n):\r\n person = input()\r\n if(person in people):\r\n print('YES')\r\n else:\r\n people.add(person)\r\n print('NO')\r\n ", "n=int(input())\nlist=[]\nfor i in range(n):\n list.append(input())\n\ntemparr=[]\nfor i in range(n):\n if list[i] in temparr:\n print(\"YES\")\n else:\n print(\"NO\")\n temparr.append(list[i])\n\t \t \t\t\t \t\t\t\t\t \t\t\t\t \t \t", "newnames = []\na = int(input())\n\nfor i in range(a):\n name = input()\n if name in newnames:\n print(\"YES\")\n else:\n newnames.append(name)\n print(\"NO\")\n \t\t \t\t\t \t\t \t \t\t\t \t \t\t\t \t \t\t\t", "l=[]\nn=int(input())\nfor x in range(n):\n name=input()\n if name in l:\n print(\"YES\")\n else:\n print(\"NO\")\n l.append(name)\n \t \t\t\t \t \t\t \t \t\t\t\t \t \t\t\t\t\t", "n = int(input())\r\nli = []\r\nwhile(n):\r\n n-=1\r\n s = input()\r\n li.append(s)\r\nx = -1\r\nanswer = []\r\nfor _ in li:\r\n y = li[x]\r\n if y in li[:x]:\r\n answer.append('YES')\r\n else:\r\n answer.append('NO')\r\n x -= 1\r\nfor i in answer[::-1]:\r\n print(i)", "n=int(input())\nnames=list()\nk=0\nfor i in range(0,n):\n\tnames=names+[input()]\nfor i in range(0,n):\n\tfor j in range(0,i):\n\t\tif names[i]==names[j]:\n\t\t\tk=k+1\n\tif k>0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n\tk=0\n\n", "while(True):\n l=[]\n try:\n teja=int(input())\n l=[]\n for i in range(teja):\n a=input()\n if(a not in l):\n print(\"NO\")\n l.append(a)\n else:\n print(\"YES\")\n except:\n break\n \t \t\t\t \t \t\t\t\t \t \t \t\t \t\t\t\t\t\t", "t=int(input())\r\nl=[]\r\nfor i in range(t):\r\n\tn=input()\r\n\tif n not in l:\r\n\t\tl.append(n)\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\") ", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n if(s in a):\r\n print('Yes')\r\n else:\r\n a.append(s)\r\n print('No')", "s=set()\r\nfor _ in range(int(input())):\r\n a=input()\r\n if a not in s:\r\n print(\"NO\")\r\n s.add(a)\r\n else:print(\"YES\")", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(input())\r\nj=0\r\nfor i in l:\r\n if i in l[:j]: print(\"YES\")\r\n else:print(\"NO\")\r\n j += 1\r\n ", "n=int(input())\r\nnames=[]\r\nfor i in range(n):\r\n x=input()\r\n if x not in names:\r\n print(\"NO\")\r\n names.append(x)\r\n else:\r\n print(\"YES\")", "d={}\nfor t in range(int(input())):\n x=input().strip()\n d[x]=d.get(x,0)+1\n if d[x]>1:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t \t\t \t\t \t\t\t \t\t\t\t\t", "\r\nn = int(input())\r\n\r\nmy_names = set()\r\nfor _ in range(n):\r\n name = input()\r\n if name in my_names:\r\n print(\"YES\")\r\n \r\n else:\r\n my_names.add(name)\r\n print(\"NO\")\r\n", "def solution(l1):\r\n i=0\r\n s1 = set(l1)\r\n while i<len(l1):\r\n targ=l1[i]\r\n if targ in s1:\r\n s1.remove(l1[i])\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n i+=1\r\n\r\n\r\n\r\ndef answer():\r\n n=int(input())\r\n l1=[]\r\n while n:\r\n l1.append(input())\r\n n-=1\r\n solution(l1)\r\nanswer()\r\n", "num = int(input())\narray = []\nfor n in range(num):\n ele = input()\n if(ele not in array):\n array.append(ele)\n print(\"NO\")\n elif(ele in array):\n print(\"YES\")\n \t \t \t \t \t\t\t \t \t\t \t", "was = []\r\nfor n in range(int(input())):\r\n s = input()\r\n if s in was:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n was.append(s)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-08 23:45:46\nLastEditTime: 2021-11-08 23:47:43\nDescription: Tom Riddle's Diary\nFilePath: CF855A.py\n'''\n\n\ndef func():\n n = int(input())\n names = []\n for _ in range(n):\n name = input().strip()\n if name in names:\n print(\"YES\")\n else:\n names.append(name)\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "n = int(input())\nd = {}\nfor i in range(n):\n s = input()\n if s not in d:\n print('NO')\n d[s] = 1+d.get(i,0)\n else:\n print('YES')\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())\nlist = []\n#empty list\nfor i in range(n):\n#loops till n\n s=input()\n if s in list :\n print(\"YES\")\n#check if the input is in the list. if it is print yes otherwise print no and add that name to the list\n else :\n list.append(s)\n print(\"NO\")\n \t \t\t\t \t \t\t\t\t\t \t \t\t\t\t \t \t\t\t", "t = int(input())\ndicti = {}\nfor i in range(t):\n s = input()\n if s not in dicti:\n dicti[s] = 1\n print(\"NO\")\n else:\n print(\"YES\")\n\t\t \t\t \t \t\t \t \t\t \t \t \t\t\t", "# your code goes here\nn=int(input())\ns=set()\nfor _ in range(n):\n\tx=input()\n\tprint(\"YES\" if x in s else \"NO\")\n\ts.add(x)\n \t\t\t \t \t\t\t \t\t \t \t \t\t \t\t", "n = int(input())\r\nnames = []\r\nappeared = set()\r\n\r\nfor i in range(n):\r\n name = input().lower()\r\n if name in appeared:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n appeared.add(name)\r\n", "n = int(input())\r\nnames = []\r\nencountered = set()\r\n\r\nfor i in range(n):\r\n name = input().lower()\r\n names.append(name)\r\n if name in encountered:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n encountered.add(name)\r\n", "n=int(input())\r\nlista=[]\r\nfor i in range(n):\r\n\tnam=input()\r\n\tif nam in lista:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tlista.append(nam)\r\n\t\tprint(\"NO\")\r\n", "pranay_n = int(input())\narray =[]\nfor i in range(pranay_n):\n string = input()\n if string in array:\n print('YES')\n else:\n array.append(string)\n print('NO')\n\n\t\t\t\t\t \t\t \t \t \t\t \t\t \t\t\t\t \t\t", "a=int(input())\r\nr=0\r\nb=list()\r\nc=list()\r\nwhile r<a:\r\n c.append(None)\r\n b.append(input())\r\n r=r+1\r\nr,s=0,0\r\nwhile r<(a-1):\r\n s=r\r\n while s<(a-1):\r\n if b[r]==b[s+1]:\r\n c[s+1]='YES'\r\n s=s+1\r\n r=r+1\r\nif len(c)!=a:\r\n c.append('NO')\r\nr=0\r\nwhile r<a:\r\n if c[r]=='YES':\r\n print(c[r])\r\n else:\r\n print('NO')\r\n r=r+1\r\n", "map={}\r\nx=int(input())\r\nfor i in range(x):\r\n name = input()\r\n if name in map:\r\n print(\"YES\")\r\n else:\r\n map[name]=1\r\n print(\"NO\")", "K= int(input())\nC= set()\nfor i in range(K):\n s = input()\n print(\"YES\" if s in C else \"NO\")\n C.add(s)\n\n\n\t \t\t\t\t \t\t \t \t\t \t\t \t \t \t", "n = int(input())\r\ns = []\r\nd = set()\r\ne = []\r\n\r\n\r\nfor i in range(n):\r\n\ts.append(input())\r\n\r\n\r\n\r\nfor i in range(n):\r\n\tif s[i] in d:\r\n\t\te.append(\"YES\")\r\n\t\t\r\n\telse:\r\n\t\te.append(\"NO\")\r\n\t\td.add(s[i])\r\n\r\n\r\nfor i in e:\r\n\tprint(i)", "k=[] #initialising an array\nfor i in range(int(input())):\n\tl=input()\n\tif(l in k):\n\t\tprint(\"yes\")\n\telse:\n\t\tk.append(l)\n\t\tprint(\"no\")\n \t\t\t\t\t \t \t \t \t\t\t\t \t\t \t \t", "a = []\r\nn = int(input())\r\nfor i in range(n):\r\n s = input()\r\n print(\"YES\" if s in a else \"NO\")\r\n a.append(s)\r\n", "n = int(input())\npossessed_names = set()\nresults = []\n\nfor i in range(n):\n name = input().strip()\n if name in possessed_names:\n results.append(\"YES\")\n else:\n results.append(\"NO\")\n possessed_names.add(name)\n\nfor result in results:\n print(result)\n\n\t \t\t\t\t \t \t \t\t\t \t \t\t\t", "a = set()\r\nb = 0\r\nfor i in range(int(input())):\r\n a.add(input())\r\n if b >= len(a):\r\n print('YES')\r\n else:\r\n print('NO')\r\n b = len(a)", "seen = set()\r\nfor _ in range(int(input())):\r\n name = str(input())\r\n if name in seen:\r\n print('YES')\r\n else:\r\n seen.add(name)\r\n print('NO')", "N = int(input())\n\ndic = {}\n\nfor i in range(N):\n palabra = input()\n if palabra in dic:\n print(\"YES\")\n else:\n dic[palabra] = 1\n print(\"NO\")\n\n\t \t \t\t \t \t\t \t \t\t\t\t\t \t\t \t\t\t", "n = int(input())\ns = set()\nfor i in range(n):\n T = input()\n if (T in s) :\n print(\"YES\")\n else:\n print(\"NO\")\n s.add(T)\n \t\t \t\t \t\t\t \t \t \t\t\t \t \t \t", "#!/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 T = int(wtf[0])\r\n A = set()\r\n for t in wtf[1:]:\r\n if t in A:\r\n print('YES')\r\n else:\r\n print('NO')\r\n A.add(t)\r\n", "list = []\r\nnew_list = []\r\n\r\nn = int(input()) \r\nfor _ in range(n): \r\n word = input() \r\n list.append(word)\r\n if word not in new_list:\r\n print(\"NO\")\r\n new_list.append(word)\r\n else:\r\n print(\"YES\")", "d={}\r\nfor _ in range(int(input())):\r\n s=input().strip()\r\n if s in d:\r\n d[s]+=1\r\n print('YES')\r\n else:\r\n d.setdefault(s,0)\r\n d[s]+=1\r\n print('NO')", "n = int(input())\n\narr = []\n\nfor i in range(n):\n arr.append(input())\n\nfor i in range(n):\n if arr[i] in arr[:i]:\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", "n=int(input())\r\ns=set()\r\nfor i in range(n):\r\n string=input()\r\n if string in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n s.add(string)\r\n", "#c\nn = int(input())\nnames = []\nvalues = []\n\nfor i in range(n):\n v = str(input())\n if v in names:\n values.append(\"Yes\")\n else:\n values.append(\"No\")\n names.append(v)\nfor k in range(len(values)):\n print(values[k])\n \t \t \t \t\t\t\t \t \t\t\t \t \t\t \t", "n = input()\nlist = []\nn = int(n)\nfor i in range(n):\n name = input()\n if(name in list):\n print(\"YES\")\n else:\n list.append(name)\n print(\"NO\")\n\t\t \t\t \t\t \t \t \t \t \t \t\t", "names = int(input()) #the number of names in the list.\nvaish = [] \nfor i in range(names):\n vaish.append(input())\nfor i in range(names):\n flag = 0\n for j in range(i):\n if vaish[i] == vaish[j]:\n flag = 1\n break\n if flag:\n print(\"YES\")\n else:\n print(\"NO\")\n\t\t\t\t\t \t \t\t \t \t\t\t \t \t \t\t\t\n\n\t\t\t \t \t \t\t \t\t\t \t\t\t \t \t\t\t \t\t", "n = input()\nn = int(n)\nm = []\na = []\nfor i in range(n):\n m.append(input())\nfor i in range(n-1,-1,-1):\n yes = False\n for j in range(i-1,-1,-1):\n if m[j]==m[i]:\n yes = True\n a.append(yes)\na.reverse()\nfor i in range(len(a)):\n if a[i]:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t\t\t\t\t\t \t \t\t \t \t\t", "n = int(input()) \n\nnames = set() \noutput = []\nfor i in range(n):\n x=input()\n if x in names:\n \n \n output.append(\"YES\")\n else:\n s=names.add(x)\n output.append(\"NO\")\n \n\nfor result in output:\n print(result)\n \n \t \t\t \t\t \t \t \t \t\t \t\t \t \t \t\t", "import sys\r\n\r\nn = int(input())\r\nstringlist = []\r\nresult = []\r\n\r\nfor x in range(0,n):\r\n newstring = input()\r\n if newstring in stringlist:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n stringlist.append(newstring)\r\n\r\nfor x in result:\r\n print(x)", "s = set()\nfor i in range(int(input())):\n n = input()\n if n in s:\n print(\"YES\")\n else:\n print(\"NO\")\n s.add(n)\n\n\t\t \t\t\t \t \t \t \t \t\t\t \t\t \t \t\t", "N_words = int(input())\nA_list = []\nfor i in range(N_words):\n S_name = input()\n if S_name in A_list:\n print(\"YES\")\n else:\n A_list.append(S_name)\n print(\"NO\")\n\t \t\t \t \t\t \t\t\t \t \t\t \t \t", "n=int(input())\ns=set()\nfor i in range(n):\n a=input()\n if a in s:\n print(\"YES\")\n else:\n print(\"NO\")\n s.add(a)\n\t \t\t\t\t\t \t\t \t\t\t \t\t\t\t\t \t\t\t", "n = int(input())\r\n\r\nnames = [input() for _ in range(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 (names[i] == names[j]) and (j < i):\r\n print('YES')\r\n flag = False\r\n break\r\n\r\n if flag:\r\n print('NO')\r\n flag = True\r\n", "s=[]\r\nfor i in range(int(input())):\r\n l=input()\r\n if(l in s):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n s.append(l)\r\n", "l=[]\na=[]\nfor i in range(int(input())):\n s=input()\n l.append(s)\nfor i in range(len(l)):\n if l[i] in a:\n print(\"YES\")\n else:\n print(\"NO\")\n a.append(l[i])\n\t\t\t\t\t \t\t\t\t\t \t \t\t\t\t\t\t\t \t\t\t", "n=(int)(input())\r\ns=set()\r\nfor i in range(n):\r\n str=input()\r\n has=0\r\n for j in s:\r\n if j==str:\r\n has=1\r\n break\r\n if has:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n s.add(str)", "import sys\nLI=lambda:list(map(int, sys.stdin.readline().split()))\nMI=lambda:map(int, sys.stdin.readline().split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline())\n# sys.stdin=open('input.txt')\n# sys.stdout=open('output.txt', 'w')\na=set()\nfor _ in range(II()):\n\ts=SI()\n\tprint(['NO', 'YES'][s in a])\n\ta.add(s)", "t= int(input())\r\nnames = []\r\nfor i in range (t):\r\n name =input()\r\n if name in names:\r\n print (\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n names.append(name)\r\n \r\n \r\n", "t=int(input())\r\nl=[]\r\nfor i in range(0,t):\r\n l.append(input())\r\n \r\ndict1={}\r\n\r\nfor j in range(0,len(l)):\r\n if(l[j] not in dict1):\r\n dict1[l[j]]=1\r\n print(\"NO\")\r\n else:\r\n dict1[l[j]]=dict1[l[j]]+1\r\n print(\"YES\")\r\n", "\n\nlist = []\n\nnum = int(input())\n\nfor i in range(0,num):\n str = input()\n list.append(str)\n j = i-1\n while(j>=0):\n if(str == list[j]):\n print('YES')\n break\n j-=1\n if(j<0):\n print('NO')\n\t \t \t \t\t\t \t \t \t \t\t \t \t", "n = int(input())\nread_names = []\nfor _ in range(n):\n name = input()\n if name in read_names:\n print(\"YES\")\n else:\n read_names.append(name)\n print(\"NO\")", "# Tom Riddle's Diary\narr = set()\nn = int(input())\nfor i in range(n):\n s = input()\n if s in arr:\n print(\"YES\")\n else:\n print(\"NO\")\n arr.add(s)", "n = int(input())\r\nk = []\r\nfor _ in range(n):\r\n s = input()\r\n if s in k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n k.append(s)", "l=[]\r\nfor i in range(int(input())):\r\n\tl.append(input())\r\nl=l[::-1]\r\nfor i in range(len(l)):\r\n\tif l[i] in l[i+1:]:\r\n\t\tl[i]=\"YES\"\r\n\telse:\r\n\t\tl[i]=\"NO\"\r\nl=l[::-1]\r\nprint(*l,sep=\"\\n\")", "n = int(input())\nbag=[]\nres=[]\nfor i in range(n) :\n s=input()\n if s in bag :\n res.append(\"YES\")\n else :\n res.append(\"NO\")\n bag.append(s)\nfor i in res :\n print(i)\n \t \t\t \t \t\t\t \t \t \t \t\t\t \t \t", "# You\r\n# Dont read my code\r\nn = int(input())\r\nans = []\r\nname = []\r\nfor i in range(n):\r\n temp = input()\r\n if temp in name:\r\n ans.append(\"YES\")\r\n else:\r\n ans.append(\"NO\")\r\n name.append(temp)\r\nfor i in ans:\r\n print(i)", "b=[]\nfor i in range(int(input())):\n s=input()\n if s not in b:\n b.append(s)\n print(\"NO\")\n else:\n print(\"YES\")\n\t\t\t \t \t\t\t \t\t \t \t\t \t \t", "t=int(input());main=[];visto=[]\nfor i in range(t):\n n=input()\n main.append(n)\nfor j in main:\n if(j not in visto):\n print('NO')\n visto.append(j)\n else:\n print('YES')\n \t \t \t \t \t \t\t \t\t\t\t \t\t\t\t", "t=int(input())\narr=[]\nfor i in range(t):\n xx=input()\n if(xx in arr):\n print('YES')\n else:\n print('NO')\n arr.append(xx)\n \t \t\t\t \t\t\t \t \t\t \t \t \t", "n=int(input())\r\nnames={}\r\nfor i in range(0,n):\r\n\tname=input()\r\n\tif (any(x==name for x in names)==False):\r\n\t\tprint('NO')\r\n\t\tnames[name]=1\r\n\telse:\r\n\t\tprint('YES')\r\n", "# C\n# https://www.bitdegree.org/learn/python-append\n# https://www.geeksforgeeks.org/python-duplicate-element-indices-in-list/\nn=int(input()) #number of names/elements\ndiary=[] #empty list []\nfor i in range(n): \n names=input() \n if names in diary: #check for duplicates \n print(\"Yes\")\n else:\n print(\"No\")\n diary.append(names) #adds to list last so first name will never output Yes\n\t\t \t \t \t \t\t\t\t\t \t \t \t\t\t", "n = int(input())\ns = []\nfor x in range(n):\n\ta = input()\n\tif a in s:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t\ts.append(a)\n", "t=int(input())\r\nnames=[]\r\nfor _ in range(t):\r\n n=input()\r\n if n not in names:\r\n print(\"NO\")\r\n names.append(n)\r\n else:\r\n print(\"YES\")", "# Coded By Block_Cipher\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\nfrom collections import Counter\r\n\r\nli = []\r\nfor _ in range(int(input())):\r\n\ts = input()\r\n\tli.append(s)\r\n# print(li)\r\n\r\n# for i in li:\r\n\t# if s in li:\r\n\t# \tprint('YES')\r\n\t# else:\r\n\t# \tprint('No')\r\n\t# print('count : ', li.count(s))\r\n\tif li.count(s)>=2:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "a = set()\nans = []\nfor _ in range(int(input())):\n s = input()\n if s not in a:\n ans.append('NO')\n a.add(s)\n else:\n ans.append('YES')\nprint('\\n'.join(ans))\n\t \t \t \t\t \t\t\t\t \t \t \t \t\t \t \t", "n = int(input())\narr = []\nfor _ in range(n):\n\n names = input()\n \n if names not in arr:\n arr.append(names)\n print(\"NO\")\n else:\n print(\"YES\")\n\t\t \t\t\t\t \t \t\t \t \t\t\t\t \t \t", "cnt= int( input().strip())\n\nst=set()\n\nfor i in range(cnt):\n\tstr = input().strip()\n\tif str in st:\n\t\tprint('YES')\n\telse: \n\t\tprint ('NO')\n\tst.add(str)\n\t\n\t\n\t \t \t\t\t \t \t \t \t \t \t\t\t \t", "n = int(input())\nl = [input() for _ in range(n)]\n\nfor i in range(n):\n s = l[i]\n if s in l[:i]:\n print(\"YES\")\n else:\n print(\"NO\")\n \t\t \t\t\t\t \t \t \t\t \t\t \t \t \t", "n=int(input())\na=[]\nfor i in range(n):\n x=input()\n if x in a:\n print(\"YES\")\n else:\n print(\"NO\")\n a.append(x)\n \n\n\t \t\t\t\t\t \t \t \t \t\t\t\t \t", "\nt = int (input());\narr = [];\nfor i in range(t):\n x = input();\n arr.append(x);\n if(arr.count(x) >1):\n print(\"Yes\");\n else :\n print('No');\n\n\n\n\n\t\t\t\t \t\t \t \t \t\t\t \t\t \t\t \t\t\t\t", "if __name__ == \"__main__\":\n n = int(input())\n d = {}\n for i in range(n):\n q = input()\n if q not in d:\n print(\"NO\")\n d[q] = 1\n else:\n print(\"YES\")\n \t\t \t\t\t \t \t \t\t\t\t\t", "#C\n# n is the number of names in the list.\n# we need to check for each person, if he/she possessed the diary at some point before or not.\n# si=sj,but j<i\nn=int(input())\nnames_1=[]\ncount=0\n#print(' '.join(map(str, names))) \nfor i in range(n):\n names=input()\n names_1.append(names)\n if names in names_1[:i]:\n print(\"YES\")\n \n \n #print(\"YES\") for the names in the list of names_1\n else:\n print(\"NO\")\n \n \t\t \t\t \t\t\t\t \t\t \t \t \t\t \t\t", "n = int(input())\nname = []\nfor i in range(n):\n temp = str(input())\n if temp in name:\n print(\"YES\")\n else:\n print(\"NO\")\n name.append(temp)\n\n \t\t\t\t \t\t \t \t \t\t", "t=int(input())\nnames=[]\nfor i in range(t):\n h=input()\n if(h in names):\n print(\"YES\")\n else:\n names.append(h)\n print(\"NO\")\n \t \t \t \t\t \t \t \t\t \t \t", "#from collections import defaultdict\r\n#from colections import Counter\r\ndef solution():\r\n s = set()\r\n n = int(input())\r\n for _ in range(n):\r\n word = input()\r\n if word in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n s.add(word)\r\nif __name__=='__main__':\r\n solution()", "n = int(input())\ns = []\nq = 0\nwhile q < n:\n s.append(input())\n q += 1\nfor num in range(n):\n if s[num] in s[:num]:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t\t\t \t \t \t", "arr=[]\nfor _ in range(int(input())):\n s=input().lower()\n if s in arr:\n print(\"YES\")\n elif s not in arr:\n arr.append(s)\n print(\"NO\")\n \t\t \t\t\t\t \t\t\t\t \t \t \t\t\t\t \t", "n=int(input())\r\nmy_dict = {}\r\nfor _ in range (n):\r\n name = input()\r\n if name in my_dict:\r\n print(\"YES\")\r\n else:\r\n my_dict[name] = 1\r\n print(\"NO\")\r\n\r\n", "num = int(input())\r\naux = ''\r\nnombres = []\r\nfor i in range(num):\r\n aux = input()\r\n if aux in nombres:\r\n print (\"YES\")\r\n else:\r\n print(\"NO\")\r\n nombres.append(aux)", "n=int(input())\r\nb=[]\r\nfor i in range(n):\r\n x=input()\r\n if x in b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n b.append(x)\r\n", "n = int(input())\r\nprev = set()\r\nfor i in range(n):\r\n s = input()\r\n if s in prev:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n prev.add(s)\r\n\r\n\r\n\r\n\r\n", "import sys\n\ndef p855a():\n names=[]\n n=int(sys.stdin.readline())\n for i in range(n):\n names.append(sys.stdin.readline().strip())\n k=set(names)\n for item in names:\n if item in k:\n k.remove(item)\n print(\"NO\")\n else:\n print(\"YES\")\n\np855a()\n\n", "cases = int(input())\r\narray = []\r\nfor i in range(cases):\r\n name = input()\r\n if name in array:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n array.append(name)\r\n", "n = int(input())\r\n\r\nowner = {}\r\n\r\nfor _ in range(n):\r\n\tname = input()\r\n\tif name in owner:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\towner[name] = True\r\n\t\tprint(\"NO\")", "k=int(input())\nd=[]\nfor i in range(k):\n n=input()\n if n not in d:\n d.append(n)\n print(\"NO\")\n else:\n print(\"YES\")\n \n \t \t \t\t \t \t\t\t \t \t \t\t \t", "n = int(input())\nx = []\nfor i in range (n):\n k = input()\n if(k in x):\n print(\"YES\")\n else:\n print(\"NO\")\n x.append(k)\n\t \t\t\t \t \t \t\t\t\t \t \t \t\t\t", "t=int(input())\r\nans=set()\r\nfor i in range(t):\r\n s=str(input())\r\n if s not in ans:\r\n ans.add(s)\r\n print('NO')\r\n elif s in ans:\r\n print('YES')", "x = int(input())\nls = []\nfor i in range(x):\n name = input()\n if name not in ls:\n ls.append(name)\n print(\"NO\")\n else:\n print(\"YES\")\n#sheeesh\n\t\t\t \t\t\t \t \t\t\t \t \t\t\t\t\t \t\t\t", "n = int(input())\n\nq = set()\nfor _ in range(n):\n s = input().strip('\\n')\n if s in q:\n print(\"YES\")\n else:\n q.add(s)\n print(\"NO\")\n\n\t \t\t\t \t \t\t \t \t \t\t\t\t\t\t \t\t", "\nname_list = []\n\nnum_list = int(input())\n\nfor i in range(0,num_list):\n x = input()\n name_list.append(x)\n \nj = 0\nfin_list = []\nfor j in range(len(name_list)):\n if name_list[j] in fin_list:\n print('YES')\n if name_list[j] not in fin_list:\n fin_list.append(name_list[j])\n print('NO')\n\n\n\n# https://www.upgrad.com/blog/multiple-inputs-from-user-in-python/\n# https://www.geeksforgeeks.org/python-get-a-list-as-input-from-user/\n \t\t\t\t\t \t \t \t \t \t \t \t \t \t \t \t", "names = []\r\nfor i in range(int(input())):\r\n a = input()\r\n if a in names:\r\n print('YES')\r\n else:\r\n print('NO')\r\n names.append(a)", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,=q()\r\na=[]\r\nfor _ in range(n):\r\n i=input()\r\n a.append(i)\r\n print('YES' if a.count(i)>1 else 'NO')", "def check_possession(names):\r\n possession = set() # Set to store the names seen so far\r\n result = []\r\n\r\n for name in names:\r\n if name in possession:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n possession.add(name)\r\n\r\n return result\r\n\r\n# Read the number of names from the input\r\nn = int(input())\r\n\r\n# Read the names from the input\r\nnames = []\r\nfor _ in range(n):\r\n name = input().lower() # Convert the name to lowercase\r\n names.append(name)\r\n\r\n# Call the function to check possession for each name\r\nresult = check_possession(names)\r\n\r\n# Print the result\r\nfor res in result:\r\n print(res)\r\n", "from collections import defaultdict\r\n\r\ndp = defaultdict(int)\r\n\r\nfor i in range(int(input())):\r\n a = input()\r\n if not dp[a]:\r\n print(\"NO\")\r\n dp[a] = 1\r\n else:\r\n print(\"YES\")\r\n ", "numberOfNames = int(input())\nnamesList = []\ncurrentName = \"\"\nfor count in range(numberOfNames):\n currentName = input()\n if currentName in namesList:\n print(\"YES\")\n else:\n print(\"NO\")\n namesList.append(currentName)\n \t \t \t \t\t \t \t \t\t\t\t \t\t \t\t", "t=int(input())\nl=[]\nfor i in range(t):\n\tx=str(input())\n\tif x in l:\n\t\tprint(\"YES\")\n\telse:\n\t\tl.append(x)\n\t\tprint(\"NO\")\n\n\n \t \t\t\t\t \t\t\t \t\t\t \t \t\t\t \t", "num = int(input())\n\narr = []\n\nfor _ in range(num):\n \n temp = input()\n if temp in arr:\n print(\"YES\")\n else:\n arr.append(temp)\n print(\"NO\")\n\n \t \t\t\t\t\t\t\t \t \t \t\t\t \t \t\t\t", "n = int (input ())\ntrylevel = set()\n\nfor i in range(n) :\n name = input()\n if name in trylevel :\n print(\"YES\")\n else:\n trylevel .add(name)\n print(\"NO\")\n\t \t\t \t\t \t \t\t\t \t \t \t \t\t\t\t\t", "a = int(input())\nmas = []\nfor i in range(a):\n name = input()\n if name in mas:\n print('YES')\n else:\n print('NO')\n mas.append(name)\n", "x= input()\ng = []\nfor y in range(int(x)):\n g.append(input())\n\nw = set()\nfor x in g:\n if x in w:\n print(\"YES\")\n else:\n print(\"NO\")\n w.add(x)\n\t \t\t \t \t\t\t \t \t\t \t\t", "n = int(input())\r\narray = []\r\n\r\nprint(\"NO\")\r\nfor i in range (n):\r\n s = input()\r\n for j in range (len(array)):\r\n if s == array[j]:\r\n print(\"YES\")\r\n break\r\n if j == len(array)-1 and s != array[j]:\r\n print(\"NO\")\r\n if s != array[j]:\r\n continue\r\n array += [s]\r\n", "l=[]\r\nfor i in range(int(input())):\r\n s=input()\r\n print('YES' if s in l else 'NO')\r\n l.append(s)", "t = int(input())\r\na = []\r\nwhile t > 0:\r\n\ts = input()\r\n\ta.append(s)\r\n\tt = t - 1\r\nfr = {}\r\nfor i in a:\r\n\tif i in fr:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\tfr[i] = 1", "def tom(lst,str):\n if str not in lst:\n print('NO')\n lst.append(str)\n else:\n print('YES')\nn = int(input())\nlst=[]\nfor i in range(n):\n str = input()\n tom(lst,str)\n\t\t \t\t \t\t\t\t \t \t\t \t\t \t\t\t \t\t\t", "#https://codeforces.com/problemset/problem/855/A\r\nnum_people = int(input())\r\npeople = []\r\n\r\nfor current_index in range(num_people):\r\n current_person = input()\r\n if current_person in people:\r\n print (\"YES\")\r\n else:\r\n print (\"NO\")\r\n people.append(current_person)\r\n\r\n", "n = int(input())\r\nd = {}\r\nl = []\r\nfor i in range(n):\r\n inp = input()\r\n d[inp] = 0\r\n l.append(inp)\r\nfor i in range(n):\r\n if d[l[i]]== 0:\r\n print('NO')\r\n d[l[i]]+=1\r\n else:\r\n print('YES')", "n1 = int(input())\r\nlist1 = []\r\nfor i in range(n1):\r\n list1.append(input())\r\nlist_inside = []\r\nfor i in list1:\r\n if i in list_inside:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n list_inside.append(i)\r\n ", "n = int(input())\nout = []\ndone = []\nfor i in range(n):\n e = input()\n if e not in done:\n out.append(\"NO\")\n done.append(e)\n else:\n out.append(\"YES\")\n \nfor var in out:\n print(var)\n\t \t \t\t \t\t \t\t\t \t\t\t \t \t \t", "a1=int(input())\nb=[]\nfor i in range(a1):\n n=input()\n if n not in b:\n b.append(n)\n print(\"NO\")\n else:\n print(\"YES\")\n\t\t\t \t \t\t \t\t \t\t \t \t\t\t\t\t", "import sys\n\ninput = sys.stdin.readline\n\n\nn = int(input())\n\npossessed_before = set()\nfor i in range(n):\n name = input().rstrip()\n if name in possessed_before:\n print(\"YES\")\n else:\n print(\"NO\")\n possessed_before.add(name)\n\n\n \n \n \n", "L = []\r\nfor i in range(int(input())):\r\n x = input()\r\n if x in L:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n L.append(x)\r\n", "n=int(input())\nl=[]\nfor _ in range(n):\n s=input()\n l.append(s)\nfor i in range(len(l)):\n if l[i] in l[0:i]:\n print(\"YES\",end=\"\\n\")\n else:\n print(\"NO\",end=\"\\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=set()\r\nfor _ in range(n):\r\n si=input()\r\n if si in d:\r\n print(\"YES\")\r\n else:\r\n d.add(si)\r\n print(\"NO\")", "n=int(input())\r\nL=[]\r\nfor i in range(n):\r\n L.append(input())\r\nfor j in range(n):\r\n c=0\r\n for k in range(j):\r\n if(L[k]==L[j]):\r\n print(\"YES\")\r\n break\r\n else:\r\n c+=1 \r\n if(c==j):\r\n print(\"NO\")", "n=int(input())\nd={}\nfor i in range(0,n):\n l=input()\n if l in d.keys():\n d[l]+=1\n print(\"YES\",end=\"\\n\")\n else:\n d[l]=1\n print(\"NO\",end=\"\\n\")\n\t \t\t \t\t \t \t\t\t\t \t \t\t\t\t\t", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\nn = int(input())\r\nll={}\r\nfor i in range(n):\r\n name=input()\r\n if name in ll:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ll[name]=1", "names = []\n\nfor n in range(0, int(input())):\n\tname = input()\n\n\tif name in names:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t\tnames.append(name)", "l2=[]\nfor i in range(int(input())):\n x=input()\n if x in l2:\n print(\"yes\")\n else:\n print(\"no\")\n l2.append(x)\n \n \t \t\t \t\t\t \t \t\t\t \t\t\t\t \t \t \t \t\t", "from collections import Counter\r\nc=Counter()\r\nfor _ in range(int(input())):\r\n s=input()\r\n c[s]+=1\r\n if(c[s]==1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n#print(c)", "no=int(input())\r\nnames=[]\r\nres=[]\r\nfor i in range(no):\r\n\ts=input()\t\r\n\tif(s in names):\r\n\t\tres.append('YES')\r\n\telse:\r\n\t\tres.append('NO')\r\n\tnames.append(s)\r\n\t\r\n\t\r\nfor i in res:\r\n\tprint(i)\r\n\t", "n=int(input())\r\nd = dict()\r\nfor i in range(n):\r\n s = input()\r\n try:\r\n if(d[s]):\r\n print(\"YES\")\r\n except KeyError:\r\n d[s]=1\r\n print(\"NO\")", "n = int(input())\nh = {}\nfor i in range(n):\n s= input()\n if s in h:\n print(\"YES\")\n else:\n print(\"NO\")\n h[s]=True\n \t\t\t \t\t \t\t \t\t \t\t\t \t \t\t\t", "import sys\nfrom collections import deque as d\n#import math\ndef prit(a):\n sys.stdout.write(str(a)+'\\n')\ndef input():\n return sys.stdin.readline().strip()\n\ndef nextGreaterL(l):\n p=len(l)*[-1]\n st=[]\n for i in range(len(l)):\n if len(st)==0:\n st.append(i)\n continue\n while(len(st)!=0 and l[i]>l[st[-1]]):\n p[st[-1]]=len(l)-1-i\n st.pop()\n st.append(i)\n return p[::-1]\n \n# l=[1,4,10,2,8,3,9]\nd={}\nfor _ in range(int(input())): \n s=input()\n d.setdefault(s,0)\n d[s]+=1\n if d[s]>1:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t\t \t\t\t\t \t\t \t\t\t\t\t\t \t\t\t\t", "n = int(input())\nname = []\nfor i in range(n):\n name.append(input())\nappeared = []\nfor j in name:\n if j not in appeared:\n appeared.append(j)\n print(\"NO\")\n elif j in appeared:\n print(\"YES\")\n\n\n\t \t \t\t\t\t\t\t \t\t \t \t\t \t \t \t", "n = int(input())\r\ndic = dict()\r\nfor i in range(n):\r\n\tstring = input()\r\n\tif string in dic:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\tdic[string] = None\r\n#print(dic)", "t=int(input())\r\nl=[]\r\nfor i in range(t):\r\n s=input()\r\n l.append(s)\r\n l1=[]\r\nfor i in l:\r\n if l.count(i)==1:\r\n print('No')\r\n else:\r\n if i not in l1:\r\n print('NO')\r\n l1.append(i)\r\n else:\r\n print('YES')", "n = int(input()) # Number of names\nencountered_names = set() # Set to store encountered names\n\nfor _ in range(n):\n name = input().lower() # Read the name and convert to lowercase\n if name in encountered_names:\n print(\"YES\")\n else:\n print(\"NO\")\n encountered_names.add(name) # Add the name to the set\n\n\t\t\t\t\t \t \t \t \t \t \t \t\t\t\t \t", "n=int(input())\nA=[]\n\nfor i in range(n):\n temp=str(input())\n if(temp not in A):\n print(\"NO\")\n A.append(temp)\n else:\n print(\"YES\")\n\t \t\t \t \t\t \t\t\t \t \t\t \t \t \t\t", "num = input()\nnum = int(num)\nlistNames = []\nOP = []\n\nfor i in range(num):\n name = input()\n if name in listNames:\n OP.append('yes')\n else:\n listNames.append(name)\n OP.append('no')\n\nfor x in OP:\n print(x)\n \t \t\t \t \t\t\t\t \t \t\t \t \t\t\t", "s=set()\r\nfor i in range(int(input())):\r\n a=input()\r\n print('YES' if a in s else 'NO')\r\n s.add(a)", "a= int(input())\r\nimport math\r\nb=[]\r\nfor i in range(0,a):\r\n b.append(str(input()))\r\n if b.count(b[i])> 1 :print(\"YES\")\r\n else:print(\"NO\")\r\n", "n = int(input())\r\nb = set()\r\nfor i in range(n):\r\n\ts = input()\r\n\tprint(\"NYOE S\"[s in b::2])\r\n\tb.add(s)", "n = int(input())\narreglo=[]\narreglo2=[]\nfor i in range(0,n):\n linea=input()\n arreglo.append(linea)\nfor elem in arreglo:\n if arreglo2.count(elem)==0:\n arreglo2.append(elem)\n print(\"NO\")\n else:\n print(\"YES\")\n\t\t \t \t\t\t\t\t\t \t\t\t\t\t\t \t\t \t", "from sys import stdin\n\nn = int(stdin.readline())\narr = set()\nfor _ in range(n):\n\ts = stdin.readline()\n\tif s in arr:\n\t\tprint(\"YES\")\n\telse:\n\t\tarr.add(s)\n\t\tprint(\"NO\")\n\t\t \t\t\t\t\t\t \t\t\t\t \t \t\t \t \t \t\t\t", "inp = input()\r\nnames_list = []\r\nfor i in range(int(inp)):\r\n cool_input = input()\r\n names_list.append(cool_input)\r\ncheck_list = []\r\nfor i in names_list:\r\n loop_list = 0\r\n for p in check_list:\r\n if p == i:\r\n print(\"YES\")\r\n break\r\n else:\r\n loop_list+=1\r\n if loop_list == len(check_list):\r\n print(\"NO\")\r\n check_list.append(i)", "t = int(input())\r\nch = []\r\nfor i in range(t):\r\n a = input()\r\n if a not in ch:\r\n print('NO')\r\n ch.append(a)\r\n else:\r\n print('YES')\r\n", "a = int(input())\r\nq = []\r\nfor i in range(a):\r\n\ts= input()\r\n\tif s in q:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tq.append(s)\r\n\t\tprint(\"NO\")", "nn=eval(input())\na=[]\nfor i in range(nn):\n n=input()\n if n not in a:\n a.append(n)\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 \t", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n x=input()\r\n if x in l: print(\"YES\")\r\n else:print(\"NO\")\r\n l.append(x)\r\n \r\n\r\n ", "length = int(input())\n\nnames = []\nout = []\nfor i in range(length):\n uin = input()\n \n if uin in names:\n out.append('YES')\n else:\n out.append('NO')\n \n names.append(uin)\n \nfor it in out:\n print(it)\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 res = []\r\n names = []\r\n for i in range(n):\r\n s = input() \r\n if s not in names:\r\n res.append('NO')\r\n names.append(s)\r\n else:\r\n res.append('YES')\r\n for answer in res:\r\n print(answer)\r\n \r\n", "n=int(input())\nlis=[]\nfor i in range(n):\n ab1=input()\n lis.append(ab1)\nfor i in range(len(lis)):\n ba=lis[:i]\n if lis[i] in ba:\n print('YES')\n else:\n print('NO')\n\t\t \t\t \t \t \t\t \t\t\t\t\t\t \t\t \t", "n = int(input())\nl = []\nfor i in range(n):\n\tst = input()\n\tif st in l:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t\tl.append(st)\n\t\n \t \t \t\t \t\t \t \t \t\t \t \t \t\t", "query=int(input())\r\nd={}\r\nfor _ in range(query):\r\n\tname=input()\r\n\tif name not in d:\r\n\t\td[name]=1\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")", "n,l,s=int(input()),[],set()\r\nfor i in range(n) :\r\n l.append(input())\r\nfor i in l :\r\n if i in s :\r\n print(\"YES\")\r\n else :\r\n s.add(i)\r\n print(\"NO\")\r\n ", "# C\n# msi tutor helped\nH = input()\nH = int(H)\nnames =[]\nfor i in range(H):\n names.append(input())\nres=[]\nfor i in range(H):\n if names[i] in res:\n print(\"YES\")\n else:\n print(\"NO\")\n res.append(names[i])\n \t \t\t\t\t \t \t\t\t \t \t \t \t\t \t", "A = []\r\nfor i in range(int(input())):\r\n x = input();\r\n if x in A:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n A.append(x);", "k=int(input())\r\nd={}\r\nfor i in range(k):\r\n\tc=input()\r\n\tif c not in d:\r\n\t\td[c]=1\r\n\telse:\r\n\t\td[c]+=1\r\n\tif d[c]>1:\r\n\t\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\t", "n_1=int(input())\narr_1=[]\nfor i in range(n_1):\n s=input()\n if s not in arr_1:\n arr_1.append(s)\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\t \t", "count = int(input())\n\nseen = []\nfor i in range(count):\n val = input()\n print('YES' if val in seen else 'NO')\n seen.append(val)\n \t\t\t \t\t \t\t \t \t\t\t\t \t \t\t\t \t\t\t", "Set = set()\r\nfor __ in range(int(input())):\r\n S = input()\r\n if (S in Set): print('YES')\r\n else: Set.add(S); print('NO')", "import itertools\r\nimport math\r\nimport sys\r\nimport heapq\r\nfrom collections import Counter\r\nfrom collections import deque\r\nfrom fractions import gcd\r\nfrom functools import reduce\r\nsys.setrecursionlimit(4100000)\r\nINF = 1 << 60\r\n\r\n#ここから書き始める\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n if s in a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n a.append(s)\r\n ", "#855A\r\nn = int(input())\r\nsr = []\r\nfor i in range(n):\r\n s = str(input())\r\n if s in sr:\r\n print('YES')\r\n else:\r\n print('NO')\r\n sr.append(s)", "n = int(input())\r\ns = []\r\nfor _ in range(n):\r\n x = input()\r\n if x in s:\r\n print('Yes')\r\n else:\r\n print('No')\r\n s.append(x)\r\n", "N = int(input())\nL = []\nans = []\nfor i in range(N):\n\tinp = input()\n\tif inp in L:\n\t\tans.append('YES')\n\telse:\n\t\tL.append(inp)\n\t\tans.append('NO')\nfor a in ans:\n\tprint(a)\n \t\t\t\t \t \t \t\t\t\t\t \t\t\t\t\t", "n = int(input())\na = set()\nfor i in range(n):\n s = input()\n print(\"YES\" if s in a else \"NO\")\n a.add(s)\n\t\t\t\t\t \t \t \t\t\t\t \t \t\t\t \t \t", "n = int(input())\nnames = []\npastHolders = []\n\nyes = False\n\nfor i in range (n):\n names. append(input())\n\n\nfor i in names:\n for j in pastHolders:\n if j == i:\n yes = True\n break\n if yes:\n print('YES')\n yes = False\n continue\n print('NO')\n\n pastHolders.append(i)\n\t \t \t \t\t \t \t\t\t \t \t \t \t\t", "n = int(input())\ni = 0\nl = list()\ng = list()\ny = list()\np = 0\nwhile i < n:\n l.extend([input()])\n i += 1\ni = 0\nwhile i < n:\n p = 0\n for j in range(0,i):\n if l[i] == l[j]:\n p += 1\n g.extend([p])\n i += 1\ni = 0\nwhile i < n:\n if g[i] > 0:\n y.extend([\"YES\"])\n else:\n y.extend([\"NO\"])\n i += 1\ni = 0\nwhile i < n:\n print(y[i])\n i += 1\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 a.append(input())\r\nprint(\"NO\")\r\nfor i in range(1,n):\r\n if a[i] in a[:i:]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n = int(input())\nnames = []\n\nfor i in range(n):\n x = input()\n if x in names:\n print(\"YES\")\n else:\n print(\"NO\")\n names.append(x)\n \t\t\t \t \t\t\t \t \t\t \t \t \t\t\t \t \t", "# A. Tom Riddle's Diary\n\nst = set()\nfor _ in range(int(input())):\n s = input()\n if s in st:\n print('YES')\n else:\n st.add(s)\n print('NO')\n", "n= int(input())\r\nlst = []\r\nfor i in range (n):\r\n\ts=input()\r\n\t\r\n\tflag= False\r\n\tfor i in range (len(lst)):\r\n\t\tif s == lst[i]:\r\n\t\t\tflag = True\r\n\tif flag == True:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\r\n\tlst.append(s)\r\n\r\n\t\r\n", "# your code goes here\nn=int(input())\nlst=[]\nlst1=[]\nfor i in range(0,n):\n\ts=input()\n\tlst.append(s)\nfor i in lst:\n\tif i not in lst1:\n\t\tprint(\"NO\")\n\t\tlst1.append(i)\n\telse:\n\t\tprint(\"YES\")\n\t\n\t\n \t \t \t \t \t \t \t\t\t\t\t \t \t\t", "ar=[0]\r\nfor _ in range(int(input())):\r\n n=input()\r\n if n in ar:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ar.append(n)\r\n ", "x = input()\nl = []\nfor y in range(int(x)):\n l.append(input())\n\ns = set()\nfor x in l:\n if x in s:\n print(\"YES\")\n else:\n print(\"NO\")\n s.add(x)\n \t \t\t\t\t\t \t \t \t \t\t \t \t\t\t", "n=int(input())\r\nb=[]\r\nfor i in range(n):\r\n a=input()\r\n if a not in b:\r\n print('NO')\r\n b.append(a)\r\n else:\r\n print('YES')", "# # RED CODER # #\r\nn = int(input())\r\nnew = []\r\nfor i in range(n):\r\n names = str(input())\r\n if names in new:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n new.append(names)", "# A - Tome Riddle's Diary\r\n\r\nn = int(input())\r\n\r\ns = []\r\nl = []\r\n\r\nfor _ in range(n):\r\n\ttemp = input()\r\n\ts.append(temp)\r\n\r\nfor _ in range(n):\r\n\tif s[_] in l:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\t\tl.append(s[_])", "n = int(input())\r\nlst = set()\r\nfor i in range(n):\r\n a = input()\r\n if a in lst:\r\n print('YES')\r\n else:\r\n print('NO')\r\n lst.add(a)\r\n", "n = int(input())\nlistofnames = []\nfor i in range(n):\n listofnames.append(input().split())\nfor j in range(n):\n if listofnames[j] in listofnames[:j]:\n print(\"YES\")\n else:\n print(\"NO\")\n\t\t\t\t \t \t\t\t\t \t\t\t\t\t \t\t \t\t\t", "n = int(input())\r\nnames = []\r\nresult = []\r\nfor i in range(n):\r\n name = input()\r\n isFound = False\r\n for i in names:\r\n if name == i:\r\n isFound = True\r\n if isFound == True:\r\n result.append(\"YES\")\r\n names.append(name)\r\n else:\r\n result.append(\"NO\")\r\n names.append(name)\r\nfor i in result:\r\n print(i)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\na=[]\nfor i in range(n):\n l=input()\n if(l in a):\n print('Yes')\n else:\n a.append(l)\n print('No')\n\t\t \t \t \t \t \t \t\t \t\t\t", "t = int(input())\nref = []\nfor i in range(t):\n s = input()\n if(s not in ref):\n ref.append(s)\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 \t\t\t \t\t \t", "l=[]\r\nfor _ in range(int(input())):name=input();print(\"YES\" if name in l else \"NO\");l.append(name)", "n=int(input())\r\na=[]\r\nfor i in range(0,n):\r\n e = input()\r\n if e in a:\r\n print('YES')\r\n else:\r\n a.append(e)\r\n print('NO')", "n = int(input())\nhtab = {}\nfor i in range(n):\n name = input()\n if htab.get(name) == None:\n print(\"NO\")\n htab[name] = 1\n else:\n print(\"YES\")\n\t\t \t\t\t\t \t\t \t \t \t\t\t \t \t \t \t\t", "t = int(input())\r\nnames = []\r\nfor _ in range(t):\r\n\tnames.append(input())\r\nprint(\"NO\")\r\nfor i in range(1,t):\r\n\ts = names[i];\r\n\tflag = 0\r\n\tfor j in range(i):\r\n\t\tif names[j] == names[i]:\r\n\t\t\tflag = 1\r\n\t\t\tprint(\"YES\")\r\n\t\t\tbreak\r\n\tif flag == 0:\r\n\t\tprint(\"NO\")", "n=int(input())\r\nohh=[ ]\r\nfor i in range(n):\r\n s=input()\r\n if(s not in ohh):\r\n print('NO')\r\n else:\r\n print('YES')\r\n ohh.append(s)", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n a = input()\r\n if d.__contains__(a):\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n d.setdefault(a)", "length = int(input())\nitems = []\nresults = []\nfor _ in range(length):\n i = input()\n if i in items:\n results.append('YES')\n else:\n results.append('NO')\n items.append(i)\nfor a in results:\n print(a)\n\t\t \t \t\t\t \t\t\t\t\t \t \t\t\t \t\t", "input_n_names = int(input())\nnames_list = []\nfor _ in range(input_n_names):\n name = input()\n if name in names_list:\n print(\"YES\")\n else:\n print(\"NO\")\n names_list.append(name)\n\t\t\t\t \t\t\t \t \t\t \t\t\t \t\t\t \t \t", "t = int(input())\n\nn = []\n\nfor i in range(t):\n s = input()\n if s in n:\n print(\"YES\")\n else:\n print(\"NO\")\n\n n.append(s)\n\n \t \t\t \t \t \t \t\t\t\t\t\t \t\t \t\t \t", "nigga=[]\nfor i in range(int(input())):\n a=input()\n nigga.append(a)\n if len(nigga)==len(set(nigga)):\n print('NO')\n else:\n print('YES')\n nigga.remove(a)\n\t \t \t \t \t\t \t \t \t \t \t\t\t \t", "inputTime=input()\ninputs=[]\n\nfor time in range(int(inputTime)):\n inputP=input()\n inputs.append(inputP)\n\noutputs=[]\n\nfor pyindex in range(int(inputTime)):\n input=inputs[pyindex]\n alreadyOccurredInputs=inputs[:pyindex]\n if input in alreadyOccurredInputs:\n output='YES'\n else:\n output='NO'\n outputs.append(output)\n\nfor element in outputs:\n print(element)\n \t \t\t\t\t \t \t \t\t \t \t \t\t \t\t\t\t", "n=int(input())\ns=[]\nfor i in range(n):\n\tse=input()\n\tif se in s:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\ts.append(se)\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\np=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in l:\r\n if i not in p:\r\n p.append(i)\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "\r\nlist1 = []\r\nfor _ in range(int(input())):\r\n a = input()\r\n if a not in list1:\r\n list1.append(a)\r\n print('NO')\r\n else:\r\n print('YES')", "T:int = int(input())\nentries:set = set()\n\nfor _ in range(T):\n\tentry = input()\n\tif entry in entries:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\tentries.add(entry)\n\n \t\t\t \t \t \t \t \t\t \t\t\t \t\t\t \t", "n = int(input())\r\nstream = []\r\nfor _ in range(n):\r\n string = str(input())\r\n index = None\r\n for j in range(len(stream)):\r\n if stream[j] == string:\r\n index = j\r\n break\r\n if index != None:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n stream.append(string)\r\n \r\n", "x=int(input())\ny=[]\nfor i in range(x):\n y.append(input())\nz=[]\nfor i in range(x):\n if y[i] in z:\n print(\"YES\")\n else:\n print(\"NO\")\n z.append(y[i])\n\t \t\t \t \t \t\t \t \t \t \t \t", "n=int(input())\r\nli=[]\r\nfor i in range(n):\r\n s=input()\r\n if s in li:\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n li.append(s)", "d = set()\r\nfor _ in range(int(input())):\r\n s = input()\r\n print(\"NO\" if s not in d else \"YES\")\r\n d.add(s)", "def main():\n peoples = int(input())\n has_diary = list()\n\n for i in range(peoples):\n people = str(input())\n if has_diary.count(people):\n print(\"YES\")\n else:\n print(\"NO\")\n has_diary.append(people)\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", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 17 02:17:39 2020\r\n\r\n@author: user\r\nLink :https://codeforces.com/contest/855/problem/A\r\n\"\"\"\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n s = input()\r\n if s in l:\r\n print(\"YES\")\r\n l.append(s)\r\n else :\r\n print(\"NO\")\r\n l.append(s)\r\n", "n = input()\nn = int(n)\nd = []\nfor i in range(n):\n s = input()\n if s in d:\n print('YES')\n else:\n print('NO')\n d.append(s)\n\t \t \t\t\t\t\t\t\t\t \t\t \t \t", "s = set()\r\nfor _ in range(int(input())):\r\n x = input()\r\n print([\"NO\", \"YES\"][x in s])\r\n s.add(x)", "names = []\nn = int(input())\nfor i in range(n):\n name = input()\n names.append(name)\nowners=[]\nfor i in names:\n if i not in owners:\n owners.append(i)\n print('no')\n else:\n print('yes')\n\t \t\t\t\t\t\t \t\t \t \t\t\t\t\t", "t=int(input());\r\nmap={};\r\nwhile t>0:\r\n name=input()\r\n if name in map:\r\n print(\"YES\\n\")\r\n else:\r\n print(\"NO\\n\")\r\n map[name]=1;\r\n t-=1", "l = []\r\nn =int(input())\r\nfor _ in range(n):\r\n l.append(input())\r\n\r\nfor i in range (n):\r\n print(\"YES\" if l[i] in l[:i] else \"NO\")", "n = int(input())\ntmp = []\nfor i in range(n):\n c = input()\n if c in tmp:\n print('YES')\n else:\n print('NO')\n tmp.append(c)\n", "presents = []\nfor i in range(int(input())):\n name = input()\n if name in presents:\n print('YES')\n else:\n print('NO')\n presents.append(name)\n\t\t \t\t\t\t \t\t\t \t\t \t \t\t\t", "import sys\n\nnum = int(sys.stdin.readline().strip())\n\nname = []\nfor i in range(num):\n nam = sys.stdin.readline().strip()\n if nam in name:\n print('YES')\n else:\n print('NO')\n name.append(nam)\n \t \t \t \t\t\t\t \t \t\t \t\t \t\t", "n=int(input())\r\nteljes=list()\r\nvolt=list()\r\nfor i in range (1, n+1):\r\n teljes.append(input())\r\nfor i in range (0, n):\r\n if teljes[i] in volt:\r\n print(\"YES\")\r\n else:\r\n volt.append(teljes[i])\r\n print(\"NO\")", "n = int(input())\nnames = [str(input()) for i in range(n)]\nans = [c for c in names]\nfor x in names:\n #I learned about .index() here https://www.youtube.com/watch?v=izacYQbQOS4\n ans[names.index(str(x))] = \"NO\"\ncount = 0\nfor y in ans:\n if ans[count] != \"NO\":\n ans[count] = \"YES\"\n count += 1\nprint(*ans)\n\n \t \t \t \t\t\t\t\t\t \t \t \t \t \t", "N = int(input())\r\nnames = []\r\nfor i in range(N):\r\n i = input()\r\n if i in names:\r\n print('YES')\r\n else:\r\n print('NO')\r\n names.append(i)\r\n", "n = int(input())\r\nd = set()\r\nfor i in range(n):\r\n s = input()\r\n if s in d:\r\n print('YES')\r\n else:\r\n print('NO')\r\n d.add(s)\r\n ", "lines = input() # Take user input as string\n\nlines = int(lines) # Type cast the amount of lines to integer\n\nnames = [] # Create a list for the list of names\ncount = 0 # Set a counter to zero\n\nfor i in range(lines): # Loop to append all the names to the list\n \n names.append(input())\n\nfor i in range(lines): # Loop to test the first name with every name\n \n if (count == lines): # Checking if the loop is finished\n \n if (i == 0): # Automatically say NO to the first name\n \n print(\"N0\")\n continue\n \n count = 0 # Reset counter used in the second loop\n \n for j in range(lines): # Second loop to check the names again\n \n if (names[i] == names[j] and j < i): # Assignment specification\n \n print(\"YES\")\n break\n \n else:\n \n found = False # If specification isn't matched, not found\n count += 1\n \n if (count == lines and not found): # Only print NO if loop ends\n \n print(\"NO\")\n\t \t\t\t\t\t \t\t\t \t\t\t\t \t\t\t\t \t \t \t\t", "poss = []\r\n\r\nfor _ in range(int(input())):\r\n name = input()\r\n if name in poss:\r\n print('YES')\r\n else:\r\n print('NO')\r\n poss.append(name)\r\n", "t=int(input())\nd={}\nfor i in range(t):\n\tc=input()\n\tif c not in d:\n\t\td[c]=1\n\telse:\n\t\td[c]+=1\n\tif d[c]>1:\n\t\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\t\n \t \t \t \t\t \t\t \t \t \t", "n=int(input())\r\nnames=set()\r\nx=\"\"\r\nfor i in range (n):\r\n x=input()\r\n if x in names:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n names.add(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", "l=[]\nx=[]\nfor _ in range(int(input())):\n n=input()\n l.append(n)\nfor i in range(len(l)):\n if l[i] in x:\n print(\"YES\")\n else:\n print(\"NO\")\n x.append(l[i])\n \n \n \t\t\t\t\t \t\t\t\t \t\t\t\t \t\t\t \t\t\t \t \t\t", "n=int(input())\nx=[]\n\n\nfor i in range(n):\n s=input()\n if s in x:\n print(\"YES\")\n else:\n print(\"NO\")\n x.append(s)\n\t\t\t \t \t\t\t \t \t \t\t \t\t \t \t \t", "# import sys\n# sys.stdin=open('input.in','r')\n# sys.stdout=open('output.out','w')\nn=int(input())\np=[]\nfor x in range(n):\n\tk=input()\n\tif k not in p:\n\t\tprint('NO')\n\t\tp.append(k)\n\telse:\n\t\tprint('YES')", "seen = set()\r\n\r\nfor _ in range(int(input())):\r\n inp = input()\r\n\r\n if (inp in seen):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n seen.add(inp)", "\nn=int(input())\nL=[]\nfor i in range(n):\n L.append(input())\n\nres=[]\nfor i in range(n):\n if L[i] in res:\n print(\"YES\")\n else:\n print(\"NO\")\n res.append(L[i])\n\n \t\t\t \t\t\t \t \t \t\t \t \t\t\t", "# input the number of names\nn = int(input())\n\n# create an empty set to store the names\nnames = set()\n\n# loop through the names\nfor i in range(n):\n # input the name\n name = input()\n \n # check if the name is already in the set\n if name in names:\n # output YES\n print(\"YES\")\n else:\n # output NO\n print(\"NO\")\n # add the name to the set\n names.add(name)\n\t\t \t\t \t\t\t \t\t \t \t\t \t \t \t\t \t", "n=int(input())\r\ns=set()\r\nfor _ in range(n):\r\n x=input()\r\n if x in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n s.add(x)", "n = int(input())\r\ns = [input() for i in range(n)]\r\nd_s = list(set(s))\r\ni_check = [0 for i in range(len(d_s))]\r\n\r\nfor i in range(len(s)):\r\n if i_check[d_s.index(s[i])] == 0:\r\n print(\"NO\")\r\n i_check[d_s.index(s[i])] = 1\r\n else:\r\n print(\"YES\")", "num=int(input())\r\ntemp=[]\r\nyesno=[]\r\nfor i in range(num):\r\n a=input()\r\n if a not in temp:\r\n temp.append(a)\r\n yesno.append('NO')\r\n else:\r\n yesno.append('YES')\r\nfor i in yesno:\r\n print(i)\r\n \r\n \r\n", "n=int(input())\r\ntable={}\r\nfor i in range(n):\r\n\ts=input()\r\n\tif table.get(s):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\ttable[s]=1\r\n\t\tprint(\"No\")", "a = []\nfor _ in range(int(input())):\n name = input()\n if name not in a:\n a.append(name)\n print(\"NO\")\n else:\n print(\"YES\")\n \t \t\t\t \t \t \t \t \t \t\t\t", "t=int(input());\r\nmap={};\r\nwhile t>0:\r\n name=input()\r\n try:\r\n if map[name]==1:\r\n print(\"YES\\n\")\r\n else:\r\n print(\"NO\\n\")\r\n map[name]=1;\r\n except KeyError:\r\n print(\"NO\\n\")\r\n map[name]=1;\r\n\r\n\r\n \r\n t-=1", "rm = int(input())\nk = []\nfor j in range(rm):\n w = input()\n if w not in k:\n print(\"NO\")\n k.append(w)\n else:\n print(\"YES\")\n\n#2010030296's solution\n \t\t\t \t \t \t\t \t\t \t\t\t \t", "n = int(input())\r\nlst = []\r\nfor _ in range(n):\r\n lst.append(input())\r\nchamber = []\r\nfor i in lst:\r\n if i in chamber:\r\n print('YES')\r\n else:\r\n print('NO')\r\n chamber.append(i)\r\n", "n = int(input())\nnames = []\noutput = []\nfor i in range(0, n):\n s = str(input())\n names.append(s)\n if names.count(s) == 1:\n output.append(\"NO\")\n else:\n output.append(\"YES\")\n\nfor j in output:\n print(j)\n \t\t\t \t \t\t\t \t\t \t \t\t \t \t \t\t\t \t", "t = int(input())\r\nlst = []\r\nfor i in range(t):\r\n inp = input()\r\n if(inp in lst):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n lst.append(inp)\r\n", "n=int(input())\r\nd=set()\r\nfor _ in range(n):\r\n p=input()\r\n if p in d:\r\n print(\"YES\")\r\n else :\r\n d.add(p)\r\n print(\"NO\")", "n=int(input())\nnames=[]\nfor i in range(0,n):\n name=input()\n if name in names:\n print(\"YES\")\n else:\n print(\"NO\")\n names.append(name)\n\t\t\t\t\t\t \t\t \t\t \t\t\t\t \t\t\t\t \t\t \t", "# C.4.2\nn = input()\na = []\nfor i in range(int(n)):\n s = input()\n if s in a:\n print(\"YES\")\n continue\n else:\n a.append(s)\n print(\"NO\")\n\t\t\t\t \t \t\t \t\t\t\t\t\t\t \t\t\t\t \t\t", "map = {}\nn = int(input())\nfor i in range(n):\n str = input()\n if str in map:\n print('Yes')\n else:\n print('No')\n map[str] = i\n \t\t \t\t \t\t\t \t\t\t \t\t \t\t \t \t", "n = int(input())\nlist_names = []\nname_check = []\nyes_or_no = []\nwhile len(list_names) != n:\n name = input()\n list_names.append(name)\nfor each_name in list_names:\n if each_name not in name_check:\n name_check.append(each_name)\n yes_or_no.append(\"NO\")\n else:\n yes_or_no.append(\"Yes\")\nfor each_answer in yes_or_no:\n print(each_answer)\n\t\t \t \t \t \t \t \t\t \t", "people = []\nfor i in range(int(input())):\n person = input()\n if person in people:\n print(\"YES\")\n else:\n print(\"NO\")\n people.append(person)\n\n \t\t\t \t\t \t \t \t\t\t\t \t\t", "dict = {}\na = int(input())\nfor i in range(a):\n st = input()\n if st not in dict:\n dict[st] = 0\n print(\"No\")\n else:\n print(\"Yes\")", "Numpeople = int(input())\nname1 = []\nfor i in range(Numpeople):\n name = input()\n if name in name1:\n print('YES')\n else:\n print('NO')\n name1.append(name)\n \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 s=input()\r\n l.append(s)\r\nfor i in range(n):\r\n c=0\r\n for j in range(i):\r\n if l[i]==l[j] and j<i:\r\n c=1\r\n if c==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import math\r\nfrom fractions import Fraction as frac\r\n\r\nMOD = 1e9 + 7\r\n\r\ndef solve(case_no):\r\n dict = {}\r\n n = int(input())\r\n for i in range(n):\r\n s = str(input())\r\n print(\"YES\" if s in dict else \"NO\")\r\n dict[s] = True\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nfor i in range(1, t + 1):\r\n solve(i)\r\n", "n = int(input())\nv = set()\nfor i in range(n):\n s = input()\n print(\"YES\" if s in v else \"NO\")\n v.add(s)\n\n \t \t\t \t \t\t \t \t\t \t \t\t \t\t", "n,s=int(input()),{''}\r\nfor _ in [0]*n:\r\n a = input()\r\n print(['NO','YES'][a in s])\r\n s.add(a)", "# A - Tom Riddle's Diary\n\nseen = set()\nn = int(input().strip())\nfor _ in range(n):\n name = input().strip()\n if name not in seen:\n print('NO')\n seen.add(name)\n else:\n print('YES')\n\n \t\t \t\t\t\t\t\t\t \t\t\t\t \t \t\t \t", "N = int(input()) #gets an integer input N\ninput_List = [] #create an empty list for string inputs\n\nfor i in range(N): #inputs string values for N times\n input_List.append(input())\n\nfinal_Namelist = [] #create an empty list to store names\n\nfor i in range(0, N):\n if input_List[i] in final_Namelist: #if name[i] is in the final name list,\n print(\"YES\") #print YES\n #if name[i] is not in the final name list,\n else:\n print(\"NO\") #print no and \n final_Namelist.append(input_List[i]) # add the name onto the final list\n\n# note from tutor: rkunaman (Raj)\n# testing code for Jesse Lee\n\t \t\t\t\t\t\t\t\t \t \t \t \t\t \t \t", "n=int(input())\r\nk=[]\r\nfor i in range(n):\r\n l=input()\r\n if l not in k:\r\n k.append(l)\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "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\ny b r\r\nn n+1 n+2\r\n\r\ntake sum //= 3\r\nprint(sum * 3)\r\n'''\r\n\r\ndef solve():\r\n t = II()\r\n seen = set()\r\n for _ in range(t):\r\n s = I().strip()\r\n print(\"YES\" if s in seen else \"NO\")\r\n seen.add(s)\r\n\r\nsolve()", "n=int(input())\nl=[]\nfor i in range(n):\n\ts=input()\n\tl.append(s)\nl1=[]\nfor i in l:\n\tif i not in l1:\n\t\tl1.append(i)\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n\n\t\n \t\t \t \t\t \t\t\t \t\t\t \t \t\t \t \t", "n=int(input())\nl=[]\nfor i in range(n):\n str=input()\n if str not in l:\n print(\"NO\")\n l.append(str)\n else:\n print(\"YES\")\n \t \t \t\t\t \t\t\t\t\t\t\t \t\t \t \t\t", "t = int(input())\narr =[]\nfor i in range(t):\n st = input()\n if(st not in arr):\n arr.append(st)\n print(\"NO\")\n elif(st in arr):\n print(\"YES\")\n\n \t \t \t\t \t \t \t \t \t\t \t\t", "n = int(input())\npeople = []\n\nfor i in range(n):\n temp = input()\n \n if temp not in people:\n print(\"NO\")\n people.append(temp)\n else:\n print(\"YES\")\n \t\t\t \t\t\t \t \t\t\t \t\t \t \t", "number = int(input())\nnameslist = []\nrepeatname = []\nfor x in range (number):\n names = input().split()\n nameslist.append(names)\nfor x in nameslist:\n if x not in repeatname:\n repeatname.append(x)\n print(\"NO\")\n else:\n print(\"YES\")\n#general format from MSI\n \t\t \t\t \t \t \t \t \t\t \t \t\t\t", "lis=[]\r\nx=int(input())\r\nfor i in range(x):\r\n y=input()\r\n if y in lis:\r\n print(\"YES\")\r\n else:\r\n lis.append(y)\r\n print(\"NO\")\r\n", "h = []\nfor _ in range(0, int(input())):\n x = input()\n if x in h:\n print(\"YES\")\n else:\n print(\"NO\")\n h.append(x)\n", "import sys\r\n##from math import log10, ceil, gcd, log2\r\n##from bisect import bisect_left as bs\r\n##from re import match, compile\r\n##from collections import defaultdict\r\n\r\ninput = sys.stdin.readline\r\nii = lambda: int(input())\r\nist = lambda: input().strip()\r\niilist = lambda: list(map(int, input().split()))\r\n\r\nINFINITY = 10**9 + 7\r\n\r\nn = ii(); L = []\r\nfor crossmyheart in range(n):\r\n s = ist()\r\n print(['NO', 'YES'][s in L])\r\n L.append(s)\r\n", "n = int(input())\nthingy = []\nfor x in range(n):\n set = input()\n if set in thingy:\n print(\"YES\")\n else:\n print(\"NO\")\n thingy.append(set)\n \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 c=0\r\n s=input()\r\n l.append(s)\r\n for j in range(i):\r\n if(l[i]==l[j]):\r\n c=c+1\r\n break\r\n if(c==1):\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n \r\n \r\n", "n=int(input())\r\ncheck=[]\r\nfor i in range(n):\r\n s=input()\r\n if s in check:\r\n print('YES')\r\n else:\r\n print('NO')\r\n check.append(s)", "a=int(input())\r\nb=[]\r\nfor _ in range(a):\r\n\tc=str(input())\r\n\tif c in b:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\tb.append(c)", "n = int(input())\r\narr = [0]*n\r\nfor i in range(n):\r\n s = input()\r\n for j in range(i):\r\n if(arr[j]==s):\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\n arr[i]=s", "c= int (input())\r\nx=[]\r\nfor i in range(c):\r\n a=input()\r\n if a not in x:\r\n print(\"NO\")\r\n x.append(a)\r\n else:\r\n print(\"YES\")\r\n x.append(a)", "n=int(input())\nv=[]\nfor i in range(n):\n\ta=input()\n\tif a not in v:\n\t\tv.append(a)\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n \t \t \t\t \t \t \t \t\t\t\t\t \t\t", "names = []\r\ndups = []\r\nn = int(input())\r\nfor _ in range(n):\r\n word = input()\r\n names.append(word)\r\n if word not in dups:\r\n print('no')\r\n dups.append(word)\r\n else:\r\n print('yes')", "d = {}\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s not in d:\r\n d[s] = 1\r\n print('NO')\r\n else:\r\n print('YES')\r\n", "def isPossessed(lengthOfList, namesInDiary):\r\n # main logic\r\n result = []\r\n # this is because any first name in namesInDiary won't be possessed\r\n result.append(\"NO\")\r\n for i in range(1, lengthOfList):\r\n if namesInDiary[i] in namesInDiary[:i]:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n return result\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n lengthOfList = int(input())\r\n \r\n namesInDiary = []\r\n for _ in range(lengthOfList):\r\n namesInDiary.append(str(input()))\r\n\r\n result = isPossessed(lengthOfList, namesInDiary)\r\n for i in range(lengthOfList):\r\n print(result[i])", "n=int(input())\na=set()\nfor i in range(n):\n\tb=str(input())\n\tif b in a:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\ta.add(b)\n\t \t \t\t \t \t \t\t\t\t \t\t\t\t \t\t", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n k = input()\r\n if k in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n s.add(k)", "n=int(input())\nlist1=[]\nfor x in range(n):\n list1.append(input())\nfor x in range(n):\n if list1[x] in list1[0:x]:\n print('YES')\n else:\n print(\"NO\")\n\t \t\t\t\t \t \t\t \t\t \t \t \t\t \t\t", "P=int(input())\ns=[]\nfor i in range(P):\n n=input()\n if n not in s:\n s.append(n)\n print(\"NO\")\n else:\n print(\"YES\")\n \t\t\t \t\t\t\t \t\t\t \t \t\t \t\t \t\t\t", "n = int(input()) \r\nnames = []\r\nfor i in range(n): #take multiple lines of input\r\n name = input()\r\n names.append(name) #append lis\r\nfor i in range(n):\r\n if i==0:\r\n print (\"NO\")\r\n elif names [i] in names[0:i]: #is j in \r\n print (\"YES\")\r\n else:\r\n print (\"NO\") \r\n", "n = int(input())\nd = list()\nfor i in range(n):\n x =input()\n if x in d:\n print(\"YES\")\n else:\n d.append(x)\n print(\"NO\")\n \n\t \t \t\t \t\t\t\t \t \t \t \t\t\t \t \t", "k=[]\nfor x in range(int(input())):\n a=input()\n if a not in k:\n print(\"NO\")\n k.append(a)\n else:\n print(\"YES\")\n\t\t \t\t \t \t\t\t\t\t \t \t \t \t\t", "N = int(input())\n\nd = {}\nfor i in range(N):\n nombre = input()\n if nombre in d.keys():\n print(\"YES\")\n d[nombre] = 0\n else:\n print(\"NO\")\n d[nombre] = 0\n\n\t \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 temp=input()\r\n if (temp in a):\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n a.append(temp)\r\n\r\n \r\n \r\n", "tc=int(input())\narr=[]\nfor _ in range(tc):\n n=input()\n if n in arr:\n print(\"YES\")\n else:\n arr.append(n)\n print(\"NO\")\n \t \t \t\t\t\t \t \t \t\t \t \t\t", "st = set()\r\nfor k in range(int(input())):\r\n vards = input()\r\n if vards in st:\r\n print(\"YES\")\r\n else:\r\n st.add(vards)\r\n print(\"NO\")", "d = {}\r\nfor i in range(int(input())):\r\n s = input()\r\n if d.get(s,0)>0: print(\"YES\")\r\n else: d[s] = d.get(s,0) + 1; print(\"NO\")", "nemo=int(input())\ns=set()\nfor _ in range(nemo):\n\tx=input()\n\tprint(\"YES\" if x in s else \"NO\")\n\ts.add(x)\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\nz =[]\r\nfor i in range(n):\r\n s= input()\r\n \r\n if s in z :\r\n print(\"YES\")\r\n else :\r\n print(\"NO\")\r\n z.append(s)\r\n ", "n = int(input())\n\narr=[]\n\nfor i in range(n):\n name = input()\n if name in arr:\n print(\"YES\")\n \n else:\n print(\"NO\")\n arr.append(name)\n\n", "cases=int(input())\nns=[]\nfor c in range(cases):\n n=input()\n print(\"YES\" if n in ns else \"NO\")\n ns.append(n)\n\n\t \t \t \t\t \t\t \t\t\t\t\t\t \t", "ans = []\r\nfor _ in range(int(input())):\r\n name = input()\r\n f = True\r\n for i in range(len(ans)):\r\n if ans[i] == name :\r\n print(\"YES\")\r\n f = False\r\n break\r\n if f :\r\n ans.append(name)\r\n print(\"NO\")", "n = int(input())\r\ns = set()\r\nfor _ in range(n):\r\n w = input()\r\n if w in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n s.add(w)", "t=int(input())\nar=[]\nfor tes in range(t):\n x=input()\n if(x not in ar):\n ar.append(x)\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\t\t \t", "li=[]\r\nfor i in range(int(input())):\r\n k=input()\r\n if k in li:\r\n print(\"YES\")\r\n else:\r\n print('NO')\r\n li.append(k)\r\n", "n = int(input())\nnameList = []\nrecord = []\nfor i in range(n):\n name = input()\n if name in nameList:\n record.append(\"YES\")\n else:\n record.append(\"NO\")\n nameList.append(name)\n\nfor i in range(len(record)):\n print(record[i])\n \t\t\t \t \t \t\t \t \t\t \t \t \t\t\t", "n = int(input())\r\nst = set()\r\nfor i in range(n):\r\n vards = input()\r\n if vards in st:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n st.add(vards)", "ans = []\r\nfor _ in range(int(input())) :\r\n s = input()\r\n if s in ans : print('YES')\r\n else : print('NO'), ans.append(s) ", "a = int(input())\nc = []\nfor i in range(a):\n b = input()\n if b in c:\n print(\"YES\")\n else:\n print(\"NO\")\n c.append(b)\n\n\t \t \t\t\t\t \t\t \t\t \t \t\t \t\t", "import sys\r\n\r\ndef main():\r\n _, *l = sys.stdin.read().strip().split()\r\n out, s = [], set()\r\n for i in l:\r\n if i in s: out.append('YES')\r\n else: s.add(i); out.append('NO')\r\n return out\r\n\r\nprint(*main(), sep='\\n')\r\n", "N = int(input()) #gets an integer input N\ninput_List = [] #create an empty list for string inputs\nfinal_Namelist = [] #create an empty list to store names\n\nfor i in range(N): \n input_List.append(input())\n\n if input_List[i] in final_Namelist: \n print(\"YES\") \n else: \n print(\"NO\") \n final_Namelist.append(input_List[i]) \n \t\t \t \t \t \t\t\t\t\t \t \t\t\t", "n = []\r\nfor _ in range(int(input())):\r\n n_ = input()\r\n if n_ in n:\r\n print('YES')\r\n else:\r\n print('NO')\r\n n.append(n_)\r\n", "arr = []\narr1 = []\nfor _ in range(int(input())):\n string = str(input())\n arr.append(string)\nfor i in range(len(arr)):\n if(arr[i] not in arr1):\n arr1.append(arr[i])\n print(\"NO\")\n else:\n print(\"YES\")\n \t\t\t\t\t\t\t \t \t \t \t\t \t \t", "T = int(input())\r\nlst = []\r\nfor _ in range(T):\r\n s = input()\r\n lst.append(s)\r\nfor i in range(len(lst)):\r\n if lst[i] in lst[:i]:\r\n print('YES')\r\n else:\r\n print('NO')", "n=int(input())\r\nb=[]\r\nfor k in range(n):\r\n a=input()\r\n b.append(a)\r\nfor i in range(len(b)):\r\n c=0\r\n for j in range(i):\r\n if b[i]==b[j]:\r\n c=1\r\n if c==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "x=[]\r\nfor _ in range(int(input())):\r\n s=input()\r\n if s in x:\r\n print(\"YES\")\r\n else:\r\n x.append(s)\r\n print(\"NO\")", "m = int(input())\r\nl = []\r\na = []\r\nfor _ in range(m):\r\n b = input()\r\n if b not in a:\r\n a.append(b)\r\n l.append(\"NO\")\r\n else:\r\n a.append(b)\r\n l.append(\"YES\")\r\nfor i in l:print(i)", "n = int(input())\nx = []\nfor i in range(n):\n x.append(str(input()))\n\ntemp = []\nfor i in range(n):\n if x[i] in temp:\n print(\"YES\")\n else:\n print(\"NO\")\n temp.append(x[i])\n \t\t \t\t\t\t\t\t \t \t\t \t \t\t \t\t\t", "import sys\r\n\r\npin = sys.stdin.readline\r\npout = sys.stdout.write\r\n\r\nran=range\r\nt=int(pin())\r\ntotal=[]\r\nfor i in ran(t):\r\n\tstring=pin()\r\n\tif string in total:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\ttotal.append(string)\r\n", "num = int(input())\n\nnames = []\n\nfor x in range(num):\n newname = input()\n names.append(newname)\n \n if x != 0 and names.count(names[x]) > 1:\n print(\"YES\")\n else:\n print(\"NO\")\n\n \n \n\n#print(names)\n\t\t \t\t \t\t \t \t \t\t \t\t\t\t", "num = int(input())\r\n\r\nnames = []\r\n\r\nfor i in range(num):\r\n names.append(input())\r\n\r\nlst = []\r\n\r\nfor name in names:\r\n if name in lst:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n lst.append(name)", "t=int(input())\narr=[]\nfor i in range(t):\n k=input()\n if(k in arr):\n print('yes')\n elif(k not in arr):\n arr.append(k)\n print('no')\n \t \t \t\t \t\t\t\t \t \t\t\t \t\t", "testcases = int(input())\r\n\r\nmap = dict()\r\nwhile(testcases):\r\n val = input()\r\n if val in map:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n map[val] = True\r\n testcases -=1\r\n\r\n\r\n# x = int(input()) \r\n# names = []\r\n\r\n# for i in range(x):\r\n# y = str(input())\r\n# names.append(y)\r\n\r\n\r\n# if y not in names:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n\r\n# print(names)", "n = int(input())\nnames = []\nfor _ in range(n):\n newName = input()\n if newName not in names:\n print('NO')\n names.append(newName)\n\n else:\n print('YES')\n", "import sys\nn = int(sys.stdin.readline())\nl = list()\nl2 = list()\nfor i in range(n):\n s = str(sys.stdin.readline())\n if s not in l:\n l.append(s)\n print('NO')\n else:\n print('YES')\n\t \t\t\t \t\t\t \t \t \t \t \t\t", "n=int(input())\r\narr=[]\r\nwhile n!=0:\r\n s=input()\r\n arr.append(s)\r\n n=n-1\r\nfor j in range(0,len(arr)):\r\n brr=arr[0:j]\r\n if arr[j] in brr:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#Take in number of inputs\nnum = int(input())\n#Make two lists for later use\ny = []\n\nanswer = []\n#Make a list with inputs\nfor x in range(num):\n z = input()\n y.append(z)\n#Make a new list and check if each thing is in list if not add it to the list\nfor x in range(num):\n if y[x] in answer:\n print('YES')\n else:\n print('NO')\n answer.append(y[x])\n \t\t\t \t\t \t\t\t \t\t \t \t\t \t", "def solution():\r\n n = int(input())\r\n name = []\r\n for i in range(n):\r\n s = input()\r\n print('YES') if s in name else print('NO')\r\n name.append(s)\r\nsolution()", "n = int(input())\r\n\r\narray = []\r\n\r\nfor i in range(n):\r\n \r\n name = input()\r\n \r\n if name in array:\r\n print(\"YES\")\r\n continue\r\n else:\r\n print(\"NO\")\r\n array.append(name)", "n = int(input())\nl = []\n\nfor x in range(n):\n names = input()\n l.append(names)\n\nfor i in range(n):\n a = l[:i]\n if l[i] in a:\n print('YES')\n else:\n print('NO') \n\n\n \t\t\t\t\t\t \t \t\t \t \t \t", "s = set()\r\nfor _ in range(int(input())):\r\n s1 = input()\r\n if s1 in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n s.add(s1)\r\n", "lt=[]\r\nn=int(input())\r\nfor i in range(0,n):\r\n a=input()\r\n if a in lt:\r\n print(\"YES\")\r\n else:\r\n lt.append(a)\r\n print(\"NO\")", "n = int(input())\nl = []\na = []\nfor i in range(n):\n str = input()\n if str in l:\n a.append(1)\n else:\n a.append(0)\n l.append(str)\nfor i in a:\n if i == 1:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\t \t \t \t\t\t \t \t\t\t\t \t \t", "### Hello! World ... ###\nn = int(input())\nl = []\nfor i in range(n):\n string = input()\n if string in l:\n print('YES')\n else:\n l.append(string)\n print('NO') ", "p = int(input())\nx = set()\nfor i in range(p):\n q = input()\n print(\"YES\" if q in x else \"NO\")\n x.add(q)\n\n\n \t\t\t \t\t\t \t \t\t\t\t \t \t \t \t", "a=int(input())\r\nb=[]\r\nc=set()\r\ncnt=0\r\nfor i in range(a):\r\n b=input()\r\n if b in c:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n c. add(b)\r\n ", "arr=[]\nfor _ in range(int(input())):\n st = input()\n if st not in arr:\n print(\"NO\")\n arr.append(st)\n elif st in arr and arr.index(st) < _+1:\n print(\"YES\")\n\t\t \t \t \t\t\t \t \t\t \t \t \t", "n=int(input())\nk=[]\nfor i in range(n):\n s=input()\n k.append(s)\n\n \nl=[]\nfor i in k:\n if i not in l:\n l. append(i)\n print(\"NO\")\n else:\n print(\"YES\")\n \t \t \t\t\t\t\t \t \t \t\t\t", "n=int(input())\ni=0\nnum=[]\nresult=[]\nif 1<=n<=100:\n while i<n:\n i+=1\n name=input()\n if name not in num:\n num.append(name)\n result.append(\"NO\")\n else:\n result.append(\"YES\")\nelse:\n print(0)\nfor x in result:\n print(x)\n \t\t\t\t\t\t \t \t\t \t\t\t\t \t\t \t", "T = int(input())\ndic = {}\nfor i in range(T):\n\tS = input()\n\tif S in dic:\n\t\tdic[S]+=1\n\telse:\n\t\tdic[S] = 1\n\tif dic[S] > 1:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n \t \t \t\t\t \t \t\t \t \t \t\t \t\t", "t = int(input())\r\nseen = set()\r\n\r\nfor _ in range(t):\r\n s = str(input())\r\n\r\n if s in seen:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n seen.add(s)", "t = int(input())\nL = []\nfor _ in range(t):\n s = input()\n if s in L:\n print(\"YES\")\n else:\n L.append(s)\n print(\"NO\")\n \n \t \t \t\t \t \t \t\t \t \t \t \t\t\t", "v=[]\nfor i in range(int(input())):\n a=input()\n if a not in v:\n v.append(a)\n print(\"NO\")\n else:\n print(\"YES\")\n\t\t \t\t\t \t \t\t \t \t \t \t\t\t\t \t", "n = int(input())\nx = set()\nfor i in range(n):\n s = input()\n print(\"YES\" if s in x else \"NO\")\n x.add(s)\n \t \t \t \t\t\t\t \t \t\t\t\t\t\t\t", "n=int(input())\ndt={}\nfor i in range(n):\n s=input()\n if s in dt:\n print(\"YES\")\n else:\n print(\"NO\")\n dt[s]=True\n\t\t\t\t \t \t\t \t \t\t \t \t\t\t \t\t \t\t\t", "contains = int(input())\nwordlists = []\nprint_list = []\nwhile contains > 0:\n contains -= 1\n word = input()\n if word not in wordlists:\n wordlists.append(word)\n print_list.append(\"NO\")\n else:\n print_list.append(\"YES\")\n\n\nfor i in print_list:\n print(i)\n \n# discussed with JiannanLuo\n\t \t \t \t \t\t\t \t\t \t \t \t\t\t\t\t\t\t", "t=int(input())\nl=[]\nfor i in range(t):\n\tn=input()\n\tif n not in l:\n\t\tl.append(n)\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n \t\t \t \t\t \t\t \t\t\t \t\t \t\t\t \t\t", "from collections import defaultdict\r\nx = int(input())\r\nmp = defaultdict(int)\r\nfor i in range(x):\r\n s = input()\r\n print(\"NO\" if not mp[s] else \"YES\")\r\n mp[s] += 1", "n = int(input())\r\ns = [input() for i in range(n)]\r\nfor i,x in enumerate(s):\r\n print(\"YES\" if(x in s[:i]) else \"NO\")\r\n", "n=int(input())\r\ntemp=[]\r\nfor i in range(n):\r\n s=input()\r\n temp.append(s)\r\n\r\nprint(\"NO\")\r\nk=[]\r\nfor i in range(1,n):\r\n for j in range(i):\r\n k.append(temp[j])\r\n\r\n if temp[i] in k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "class CodeforcesTask855ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.diary = []\n\n def read_input(self):\n self.n = int(input())\n for _ in range(self.n):\n self.diary.append(input())\n\n def process_task(self):\n res = []\n visits = set()\n for entry in self.diary:\n if entry in visits:\n res.append(\"YES\")\n else:\n res.append(\"NO\")\n visits.add(entry)\n self.result = \"\\n\".join(res)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask855ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "#C-1\nn = int(input())\nsigma,beta = [],[]\nfor i in range(0,n):\n s = input()\n sigma.append(s)\n#print(sigma)\nomega = list((i,sigma.count(i)) for i in sigma)\n#print(omega)\n\nfor i in range(0,n):\n if omega[i][0] not in beta:\n beta.append(omega[i][0])\n print('NO')\n elif omega[i][0] in beta:\n print('YES')\n\t\t \t\t \t \t\t\t\t \t\t \t \t\t \t", "num = int(input())\nlista = []\nfor i in range(num):\n nome = input()\n if nome in lista: print(\"YES\")\n else: print(\"NO\")\n lista.append(nome)", "n=input()\nn=int(n)\ns=set()\nfor i in range(n):\n b = input()\n print('YES' if b in s else 'NO')\n s.add(b)\n\n\t \t\t\t \t \t \t\t \t\t\t\t\t \t \t \t\t\t\t", "tstcses = int(input()) # number of test cases to be taken\n\nlstemp = [] # empty list\n \nli = [] # another empty list\n\nk = \"NO\"\n\np = \"YES\"\n\nfor Xxyy in range(0, tstcses): # for loop for test cases\n\n strnginp = input() # input\n \n lstemp.append(strnginp) # appending\n \nfor yy in lstemp: # for loop\n \n if yy not in li: # if statement\n \n li.append(yy)\n \n print(k) # print\n \n else: # else\n\n print(p) # print\n\t\t \t \t \t \t \t\t\t \t \t \t\t \t", "lst, n, res = [], int(input()), \"YES\"\r\nfor x in range(n):\r\n s, res = input(), \"NO\"\r\n for x in lst:\r\n if x == s:\r\n res = \"YES\"\r\n break\r\n print(res)\r\n lst.append(s)", "st = set()\r\ndaudz = int(input())\r\npast = 0\r\nfor x in range(daudz):\r\n vards = input()\r\n st.add(vards)\r\n if len(st) == past:\r\n print(\"YES\")\r\n else:\r\n past = past + 1\r\n print(\"NO\")", "n = int(input())\n\nnames = []\ncurse = []\n\nfor i in range(n):\n names.append(input())\n\nfor x in range(n):\n caught = 0\n #print(\"Name:\" + names[x])\n #print(\"EnterLoop1\")\n if names.count(names[x]) > 1:\n for y in range(x):\n #print(\"EnterLoop2\")\n if(names[x] == names[y]):\n print(\"YES\")\n caught = 1\n break\n if not caught: print(\"NO\")\n\t\t \t\t\t \t\t\t \t \t\t \t \t \t", "t=int(input())\r\nh=[]\r\nfor i in range(t):\r\n j=input()\r\n if j in h:\r\n print(\"YES\")\r\n continue\r\n print(\"NO\")\r\n h.append(j)", "t = int(input())\r\nend = []\r\n\r\nfor i in range(t):\r\n name = input()\r\n end.append(name)\r\n q = (end.count(name))\r\n if q == 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n# print(end)", "l=int(input())\na=[]\na=set(a)\nfor i in range(l):\n s=input()\n if s not in a:\n print('NO')\n a.add(s)\n else:\n print('YES')\n\t \t\t \t\t \t\t \t \t \t \t \t \t\t\t\t", "k=[]\ni=int(input())\nfor x in range(i):\n\ta=input()\n\tif a in k:\n\t\tprint(\"YES\")\n\telse:print(\"NO\")\n\tk.append(a)\n\t\t \t\t \t\t\t \t\t\t\t \t \t \t\t \t \t\t", "t = int(input())\r\nlst = []\r\nfor i in range(0, t):\r\n s = input()\r\n lst.append(s)\r\n if lst.count(lst[i]) > 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "\r\n# Time complexity is : O(n)\r\n\r\ndef isPossessed(i, names):\r\n return \"YES\" if names[i] in names[:i] else \"NO\"\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n \r\n n = int(input().strip())\r\n\r\n names = []\r\n for i in range(n):\r\n names.append(input().strip())\r\n\r\n for i in range(n):\r\n res = isPossessed(i, names)\r\n print(res)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 3 13:24:10 2020\r\n\r\n@author: odraodE\r\n\"\"\"\r\n\r\n'''TESTO DELL'ESERCIZIO https://codeforces.com/problemset/problem/855/A'''\r\n\r\n\r\na=input()\r\na=int(a)\r\nins=set()\r\nl=[]\r\ndizio={}\r\n\r\nfor x in range(a):\r\n k=input()\r\n ins.add(k)\r\n l.append(k)\r\n\r\n\r\nfor x in ins:\r\n dizio[x]=0\r\n \r\nfor x in l:\r\n if dizio[x]==0:\r\n print('NO')\r\n dizio[x]+=1\r\n elif dizio[x]>0:\r\n print('YES')\r\n \r\n", "\nn = int(input())\n\n\nencountered_strings = set()\n\n\noutput = []\n\n\nfor _ in range(n):\n name = input().lower() \n \n if name in encountered_strings:\n output.append(\"YES\")\n else:\n output.append(\"NO\")\n encountered_strings.add(name)\n\n\nfor result in output:\n print(result)\n\n\t\t \t \t \t\t\t \t\t \t\t\t \t\t\t \t", "def my_fuction(n):\n a=n.lower()\n a=set(a)\n if len(a)==26:\n print(\"YES\")\n else:\n print(\"NO\")\ndef strings(n):\n lst=[]\n for i in range(n):\n a=input()\n lst.append(a)\n c=set(lst)\n print(len(c))\n\ndef sort():\n n=int(input())\n for i in range(n):\n a=int(input())\n lst=list(map(int,input().split()))\n lst.sort()\n print(*lst)\ndef tom(n):\n lst=[]\n for i in range(n):\n a=input()\n if a in lst:\n print(\"YES\")\n else:\n print(\"NO\")\n lst.append(a)\nn=int(input())\ntom(n)\n\t\t \t \t \t \t\t\t \t\t\t\t\t\t \t", "m1 ={}\nfor _ in range(int(input())):\n\tx = input()\n\tif x not in m1.keys():\n\t\tm1[x] =1\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n\n", "lst = []\nfor i in range(int(input())):\n s = input()\n if (s not in lst):\n print(\"NO\")\n else:\n print(\"YES\")\n lst.append(s)\n", "numer = int(input())\r\nnewWords = list()\r\nfor i in range(numer):\r\n inn = input()\r\n if not inn in newWords:\r\n newWords.append(inn)\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "from collections import defaultdict\r\nn = int(input())\r\nrec=defaultdict(int)\r\nfor i in range(n):\r\n name = input()\r\n if rec[name]==0:\r\n rec[name]+=1\r\n print('NO')\r\n else:\r\n print('YES')", "n = int(input())\r\nL = []\r\nfor i in range(n):\r\n N = input()\r\n print('YES' if N in L else 'NO')\r\n L.append(N)\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n):\r\n if(l[i] in l[:i]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n=int(input())\r\nres=[]\r\nfor i in range(n):\r\n a=input()\r\n if a in res:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n res.append(a)", "n = int(input())\npeople = []\nfor _ in range(n):\n s = input()\n if s in people:\n print(\"YES\")\n else:\n print(\"NO\")\n people.append(s)\n", "n = int(input())\nl = []\nfor i in range(n):\n l.append(input())\n\nres = []\nfor i in range(n):\n if l[i] in res:\n print(\"YES\")\n else:\n print(\"NO\")\n res.append(l[i])\n\t\t \t \t \t \t\t \t \t\t\t \t \t\t \t \t", "diary=[]\nfor i in range(int(input())):\n i=str(input())\n \n if i in diary:\n print(\"YES\")\n \n else:\n print(\"NO\")\n diary.append(i)\n\t\t \t\t\t \t \t\t \t \t\t \t \t \t\t\t", "n=int(input())\nli=[]\nfor i in range(n):\n a=input()\n li.append(a)\nfor i in range(len(li)):\n b=li[:i]\n if li[i] in b:\n print('YES')\n else:\n print('NO')\n \t \t\t\t\t\t \t \t \t\t \t\t \t\t\t\t \t", "a = int(input())\nnames = {}\nfor i in range(a):\n name = input()\n if name in names:\n print(\"Yes\")\n else:\n print(\"No\")\n names[name]=True\n \t\t\t \t \t\t \t \t\t \t\t\t\t \t \t\t\t", "t=int(input())\r\nlist=[]\r\nwhile(t>0):\r\n a=input()\r\n if a in list:\r\n print(\"YES\")\r\n else:\r\n list.append(a)\r\n print(\"NO\")\r\n t-=1", "n=int(input())\nv=[]\nfor i in range(n):\n s=(input()) \n if((v.count(s)) > 0):\n print(\"YES\\n\")\n else:\n print(\"NO\\n\")\n v.append(s)\n\n\t \t \t\t \t \t\t\t \t\t \t \t \t \t \t", "n=int(input())\r\np=[]\r\nfor x in range(n):\r\n\tk=input()\r\n\tif k not in p:\r\n\t\tprint('NO')\r\n\t\tp.append(k)\r\n\telse:\r\n\t\tprint('YES')", "a=int(input())\nb=[]\nfor i in range(a):\n n=input()\n if n not in b:\n b.append(n)\n print(\"NO\")\n else:\n print(\"YES\")\n \t \t \t \t\t \t\t\t \t\t \t \t \t", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n s = set()\r\n for _ in range(int(input())):\r\n a = input()\r\n if a in s:\r\n print('YES')\r\n else:\r\n print('NO')\r\n s.add(a)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "l = []\r\nfor i in range(int(input())):\r\n\ts = input()\r\n\tl.append(s)\r\n\r\nb = []\r\nfor i in l:\r\n\tif i not in b:\r\n\t\tprint('NO')\r\n\t\tb.append(i)\r\n\telse:\r\n\t\tprint('YES')", "l=[]\r\nfor _ in range(int(input())): a=input();print(\"YES\" if a in l else \"NO\");l.append(a)", "n = int(input())\r\nnames = []\r\nwhile n:\r\n n = n - 1\r\n s = input()\r\n if names.count(s):\r\n print(\"YES\")\r\n else:\r\n names.append(s)\r\n print(\"NO\")\r\n", "number = int(input())\r\nlist_of_names = []\r\nfor i in range(number):\r\n name = str(input())\r\n list_of_names.append(name)\r\n\r\nfor i in range(number):\r\n k = 0\r\n for j in range(i):\r\n if list_of_names[i]==list_of_names[j]:\r\n k += 1\r\n else:\r\n k += 0 \r\n if k!=0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "lines = input()\nilst = []\nolst = []\n\nfor i in range(int(lines)):\n line = input()\n if line in ilst:\n olst.append(\"YES\")\n else:\n ilst.append(line)\n olst.append(\"NO\")\n\nfor j in olst:\n print(j)\n\t\t\t \t \t\t \t \t \t\t\t \t \t \t\t \t", "names = int(input())\nname_list = []\nfor _ in range(names):\n name = input()\n if name in name_list:\n print(\"YES\")\n else:\n print(\"NO\")\n name_list.append(name)", "def diary_riddle(names):\r\n\tmy_set = set()\r\n\toutput = list()\r\n\tfor name in names:\r\n\t\tif name not in my_set:\r\n\t\t\tmy_set.add(name)\r\n\t\t\toutput.append('NO')\r\n\t\telse:\r\n\t\t\toutput.append('YES')\r\n\treturn '\\n'.join(output)\r\n\r\ndef main():\r\n n = int(input())\r\n names = list()\r\n for _ in range(n):\r\n names.append(input())\r\n\r\n print(diary_riddle(names))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "#-------------Program-------------\r\n#----KuzlyaevNikita-Codeforces----\r\n#\r\n\r\nn=int(input())\r\nnames=[]\r\nfor i in range(n):\r\n s=str(input())\r\n if names.count(s)==0:print('NO')\r\n else:\r\n print('YES')\r\n names.append(s)", "numOfNames=int(input())\nnames=[input() for _ in range(numOfNames)]\nreadNames=[]\nfor k in range(numOfNames):\n name=names[k]\n if name not in readNames:\n readNames.append(name)\n print(\"NO\")\n else:\n print(\"YES\")\n\n \n\n \n \n\n\n ", "my_inputt=int(input())\narr=[]\nfor i in range(my_inputt):\n my_inputs=input().lower()\n if my_inputs in arr:\n print(\"YES\")\n elif my_inputs not in arr:\n arr.append(my_inputs)\n print(\"NO\")\n \t\t\t\t\t \t \t \t \t\t \t\t \t \t\t\t\t\t", "a = int(input())\n\nd = {}\n\nfor i in range(a):\n b = input()\n if b not in d:\n print(\"NO\")\n d[b] = 1\n else:\n print(\"YES\") \n \n\t\t \t \t\t \t\t\t\t \t\t \t \t \t \t", "n=int(input())\r\nnames=[]\r\nfor i in range (n):\r\n name=input()\r\n if(names.count(name)>0):\r\n print('YES')\r\n else:\r\n names.append(name)\r\n print('NO')\r\n", "n = int(input())\r\nsp = set()\r\nfor _ in range(n):\r\n s = input()\r\n if s in sp:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n sp.add(s)", "N = int(input())\r\nS = {}\r\nresult = []\r\nfor i in range(N):\r\n ch = input()\r\n if ch in S:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n S[ch] = 1\r\n\r\nprint(\"\\n\".join(str(i) for i in result))\r\n", "def test_0():\n # A -\n import math\n from collections import Counter\n n = list(map(int, input().split(\" \")))[0]\n aa = set()\n for i in range(n):\n a = input().strip()\n if a in aa:\n print('YES')\n else:\n print('NO')\n aa.add(a)\n\n\ntest_0()\n \t \t\t \t \t\t\t \t \t \t", "#Rajinikanth_190030316\nn=int(input())\ns=set()\nfor _ in range(n):\n s1=input()\n if s1 not in s:\n print(\"No\")\n s.add(s1)\n else:\n print(\"Yes\")\n\ndef sol(a):\n return\ndef sal(a):\n return\n \t\t\t\t \t\t\t\t \t\t \t \t\t\t\t \t\t", "number=input()\r\nname=[]\r\nfor i in range(int(number)):\r\n name.append(input())\r\nfor i in range(len(name)):\r\n j=name[:i]\r\n if name[i] in j:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "diary = []\r\nn = int(input())\r\nfor i in range(n):\r\n name = input()\r\n if name not in diary:\r\n diary.append(name)\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "n=int(input())\nd=[]\nfor i in range(n):\n m=input()\n if m not in d:\n d.append(m)\n print(\"NO\")\n else:\n print(\"YES\")\n \t\t\t\t \t \t \t\t\t \t\t \t \t \t", "n,m=int(input()),{}\r\nfor x in range(n):\r\n s=input()\r\n m[s]=m.get(s,0)+1\r\n print(\"NO\" if m[s]==1 else \"YES\")\r\n", "s=int(input())\nL=[]\na=[]\nfor i in range(s):\n st=input()\n if st in L:\n a.append(1)\n else:\n a.append(0)\n L.append(st)\nfor i in a:\n if i==1:\n print(\"yes\")\n else:\n print(\"No\")\n\n \t \t \t \t\t\t\t \t\t \t\t \t", "cases = int(input())\r\nseen = set()\r\nwhile cases:\r\n cases -= 1\r\n s = input()\r\n if s in seen:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n seen.add(s)\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n s = set({})\r\n for i in range(n):\r\n str1 = input()\r\n if str1 in s:\r\n print('yes')\r\n else:\r\n print('no')\r\n s.add(str1)\r\n ", "if __name__ == \"__main__\":\n n = int(input())\n temp = []\n for i in range(n):\n s = input()\n try:\n if(temp.index(s) > -1):\n print(\"YES\")\n except:\n temp.append(s)\n print(\"NO\")\n", "n = []\n\nfor i in range(int(input())):\n name = input()\n if(name not in n):\n n.append(name)\n print(\"NO\")\n else:\n print(\"YES\")\n\t \t\t\t\t\t\t \t \t\t \t\t\t\t\t \t \t\t\t", "a=int(input())\r\nd={}\r\nwhile a:\r\n\tname=input()\r\n\tif d.get(name):\r\n\t\tprint (\"YES\")\r\n\telse:\r\n\t\tprint (\"NO\")\r\n\td[name]=1\r\n\ta-=1\r\n\r\n\r\n\r\n\r\n", "num_strings = int(input())\nlist1 = []\nanswer_list = []\nfor i in range(num_strings):\n temp = input()\n if temp in list1:\n answer_list.append(\"YES\")\n else:\n answer_list.append(\"NO\")\n list1.append(temp)\nfor i in answer_list:\n print(i)\n\n \t\t \t \t \t\t \t \t \t \t \t\t\t \t\t", "n=int(input())\r\nlist_=[]\r\nfor i in range(n):\r\n name=str(input())\r\n list_.append(name)\r\nlist1=[]\r\nfor j in list_:\r\n if j in list1:\r\n print(\"YES\")\r\n list1.append(j)\r\n else:\r\n print(\"NO\")\r\n list1.append(j)\r\n ", "t=int(input())\nh={}\nfor _ in range(t):\n a=input()\n if(a not in h):\n h[a]=1\n print(\"NO\")\n else:\n print(\"YES\")\n \n\n \t\t\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 b = input()\r\n if b in a:\r\n print('YES')\r\n else:\r\n print('NO')\r\n a.append(b)", "d=[]\nfor _ in range(int(input())):\n a=input().lower()\n if a in d:\n print(\"YES\")\n else:\n d.append(a)\n print(\"NO\")\n \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\tl.append(input())\r\n\tfor j in range(i):\r\n\t\tif(l[i]==l[j]):\r\n\t\t\tprint(\"Yes\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(\"No\")", "n = int(input())\r\nl= []\r\nfor i in range(n):\r\n\tp = input()\r\n\tl.append(p)\r\n\tif l.count(l[i])>1:\r\n\t\tprint(\"YES\")\r\n\telif l.count(l[i])==1:\r\n\t\tprint(\"NO\")\t\r\n", "n=int(input())\nl=[]\nfor i in range(n):\n\tstr1=input()\n\tif str1 in l:\n\t\tprint(\"YES\")\n\t\tl.append(str1)\n\telse:\n\t\tprint(\"NO\")\n\t\tl.append(str1)\n\t\n\t \t \t \t\t \t\t\t\t \t\t \t \t\t", "n=int(input())\ns=[]\nfor i in range(n):\n\tq=input()\n\tif q not in s:\n\t\ts.append(q)\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n\t\n\t\t\t\t\t\t \t \t \t\t \t \t\t\t \t \t\t\t\t\t", "# your code goes here\r\nn=int(input())\r\nlst=[]\r\nlst1=[]\r\nfor i in range(0,n):\r\n\ts=input()\r\n\tlst.append(s)\r\nfor i in lst:\r\n\tif i not in lst1:\r\n\t\tprint(\"NO\")\r\n\t\tlst1.append(i)\r\n\telse:\r\n\t\tprint(\"YES\")", "n=int(input())\r\nl=[]\r\nd=[]\r\nfor i in range(n):\r\n a=input()\r\n if a in l:\r\n d.append(\"YES\")\r\n else:\r\n l.append(a)\r\n d.append(\"NO\")\r\nfor i in range(len(d)):\r\n print(d[i])\r\n", "# your code goes here\r\nx=int(input())\r\nl1=[]\r\nfor i in range(x):\r\n\ty=input()\r\n\tl1.append(y)\r\nl2=[]\r\nfor i in l1:\r\n\tif i not in l2:\r\n\t\tl2.append(i)\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\tprint(\"YES\")\r\n\r\n\t", "nnames = int(input())\r\nseen = set()\r\nfor i in range(nnames):\r\n name = input()\r\n if name in seen:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n seen.add(name)", "n = int(input())\nli = set()\n\nfor i in range(n):\n name = input()\n if name not in li:\n li.add(name)\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 \t\t \t", "num_of_inputs = int(input())\r\n\r\nnames_seen = []\r\n\r\nfor _ in range(num_of_inputs):\r\n\r\n name = input()\r\n\r\n if name in names_seen:\r\n print(\"YES\")\r\n\r\n else:\r\n names_seen.append(name)\r\n print(\"NO\")\r\n", "map={}\nt=int(input());\na={};\nfor i in range(1,t+1):\n name=input()\n if name in map:\n print('YES')\n else:\n print('NO')\n map[name]=1\n\n", "n = int(input())\r\n\r\na = 0\r\nb = []\r\nc = []\r\nj = \"NO\"\r\n\r\nwhile a < n:\r\n a += 1\r\n i = input()\r\n if i in b:\r\n j = \"YES\"\r\n if i not in b:\r\n j = \"NO\"\r\n b.append(i)\r\n c.append(j)\r\n\r\nfor x in c:\r\n print(x)\r\n", "x = input()\nx = int(x)\ncharacters = []\noutput = []\nfor i in range(x):\n y = input()\n if y in characters:\n output.append(\"YES\")\n else:\n output.append(\"NO\")\n characters.append(y)\nfor out in output:\n print(out)\n \t \t \t\t \t\t \t\t \t \t\t\t \t\t\t \t", "def main():\n n=int(input())\n arr=set()\n for i in range(n):\n s=str(input())\n if s in arr:\n print('YES')\n else:\n arr.add(s)\n print('NO')\n\nif __name__ == '__main__':\n main()\n\n \t \t \t \t \t \t\t \t\t", "n = int(input())\nname = []\nfor i in range(n):\n s = input()\n if( s in name):\n print(\"YES\")\n else:\n print(\"NO\")\n name.append(s)\n\t\t \t \t\t \t\t \t\t\t \t\t\t\t\t \t", "def process(A):\r\n S = set([])\r\n answer = []\r\n for x in A:\r\n if x in S:\r\n answer.append('YES')\r\n else:\r\n answer.append('NO')\r\n S.add(x)\r\n return answer\r\n \r\nt = int(input())\r\nA = []\r\nfor i in range(t):\r\n x = input()\r\n A.append(x)\r\nanswer = process(A)\r\nfor x in answer:\r\n print(x)", "li = []\r\nfor i in range(int(input())):\r\n a = input()\r\n li.append(a)\r\n if a in li[0:i]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "t = int(input())\r\n\r\nn = []\r\n\r\nfor i in range(t):\r\n\r\n a = input()\r\n n.append(a)\r\n\r\nu = []\r\n\r\nfor i in range(t):\r\n\r\n if n[i] in u: print('YES')\r\n else: \r\n\r\n print('NO')\r\n u.append(n[i])", "def check_names(names):\n seen_before = []\n for name in names:\n if name in seen_before:\n print(\"YES\")\n else:\n print(\"NO\")\n seen_before.append(name)\n\nsize = int(input())\nnames = []\n\nfor x in range(size):\n name = input()\n names.append(name)\n\ncheck_names(names)\n\n\t\t \t \t\t\t\t\t\t \t\t \t\t\t\t\t\t \t", "l=set();c=0\r\nfor _ in range(int(input())):l.add(input());print(\"YES\" if len(l)<=c else \"NO\");c=len(l)\r\n\r\n\r\n", "amount = int(input())\r\nlist_of_names = []\r\nfor i in range(amount):\r\n name = input()\r\n if name not in list_of_names:\r\n print('NO')\r\n list_of_names.append(name)\r\n else:\r\n print('YES')", "\r\n\r\nx=set()\r\nfor i in range(0,int(input())):\r\n\ts=input()\r\n\tif s in x:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\tx.add(s)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Dec 15 14:20:37 2020\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\n\r\nn=int(input())\r\nvalues=[]\r\nfor i in range(n):\r\n value=input()\r\n if value not in values:\r\n print('No')\r\n values.append(value)\r\n else:\r\n print('Yes')\r\n ", "import sys\nimport math\nfrom itertools import accumulate as acm\nfrom collections import Counter as dic\nfrom collections import deque as dek\nmo=1000000007\ndef modProduct(a,b):\n return (( a%mo )*( b%mo )) %mo\ndef modSum(a,b):\n return (( a%mo )+( b%mo )) %mo\ndef modDiff(a,b):\n return (( a%mo )-( b%mo ) + mo) %mo\ndef prin(a):\n sys.stdout.write(str(a)+'\\n')\ndef printl(a):\n for i in a:\n sys.stdout.write(str(i)+' ')\n pp()\ndef pp():\n sys.stdout.write('\\n')\ndef input():\n return sys.stdin.readline().strip()\ndef presum(l):\n return list(acm(l))\ndef checkbit(n,k):\n return (n&(1<<k))!=0\ndef countSetBit(n):\n c=0\n while n!=0:\n n=n&(n-1)\n c+=1\n return c\ndef setBit(a,b):\n return (a|(1<<b))\ndef countBit(a):\n c=0\n while a!=0:\n a>>=1\n c+=1\n return c\ndef insertPos(a,l,r,k):\n while l<=r:\n m=l+(r-l)//2\n if a[m]>k:\n r=m-1\n else:\n l=m+1\n return l\ndef rightBinS(a,l,r,k):\n ans=-1\n while l<=r:\n m=l+(r-l)//2\n if a[m]==k:\n ans=m\n l=m+1\n elif a[m]>k:\n r=m-1\n else:\n l=m+1\n return ans\ndef leftBinS(a,l,r,k):\n ans=-1\n while l<=r:\n m=l+(r-l)//2\n if a[m]==k:\n ans=m\n r=m-1\n elif a[m]>k:\n r=m-1\n else:\n l=m+1\n return ans\ndef rightSmall(arr,n):\n stk= []\n ans=[n]*n\n for i in range(n):\n while len(stk)!=0 and arr[i]<stk[-1][0]:\n ans[stk[-1][1]]=i\n stk.pop()\n stk.append([arr[i],i])\n return ans\ndef leftSmall(arr,n):\n stk=[]\n ans=[-1]*n\n for i in range(n-1,-1,-1):\n while len(stk)!=0 and arr[i]<stk[-1][0]:\n ans[stk[-1][1]]=i\n stk.pop()\n stk.append([arr[i],i])\n return ans\ndef power(a,b):\n x=a\n ans=1\n while b!=0:\n if b&1==1:\n ans=modProduct(ans,x)\n x=modProduct(x,x)\n b>>=1\n return(ans) \ndef binary(n):\n ans=0\n y=0\n while n>0:\n x=(n%2)*(10**y)\n ans+=x\n n//=2\n y+=1\n return ans\ndef subsets(l,n):\n ans=[]\n for i in range(1,1<<n):\n x=i\n c=0\n z=[]\n while x:\n if x&1==1:\n z.append(l[c])\n c+=1\n x>>=1\n z.sort()\n ans.append(z)\n ans.sort()\n for i in ans:\n printl(i)\n pp() \ndef subsetSum(l,n,k):\n co=0\n for i in range(1,1<<n):\n x=i\n c=0\n ans=0\n while x:\n if x&1==1:\n ans+=l[c]\n c+=1\n x>>=1\n if ans==k:\n co+=1\n return co\n for i in ans:\n printl(i)\n pp() \ndef leftBig(arr,n):\n stk=[]\n ans=[-1]*n\n for i in range(n-1,-1,-1):\n while len(stk)!=0 and arr[i]> stk[-1][0]:\n ans[stk[-1][1]]=i\n stk.pop()\n stk.append([arr[i],i])\n return ans\ndef tour(l, n):\n m=0\n s=0\n y=0\n for i in range(n):\n x=l[i]\n m+=x\n y+=x\n if y<0:\n s=i+1\n y=0\n if m<0:\n return -1\n return s\ns=set()\nfor _ in range(int(input())):\n x=input()\n if x in s:\n prin('YES')\n else:\n prin('NO')\n s.add(x)\n \n\t \t \t\t\t\t\t\t \t\t\t\t \t\t \t\t", "n = int(input())\r\nnames = list()\r\nprinted = list()\r\nfor i in range(n):\r\n names.append(input())\r\n\r\nfor i in names:\r\n if i not in printed:\r\n printed.append(i)\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "n=int(input())\r\nlist=[]\r\nlist1=[]\r\nfor i in range(n):\r\n string=input()\r\n list1.append(string)\r\n\r\nfor x in range(n):\r\n if list1[x] in list:\r\n print(\"YES\")\r\n else:\r\n list.append(list1[x])\r\n print(\"NO\")", "T = int(input())\nnames = {}\nfor i in range(T):\n\tS = input()\n\tif S in names:\n\t\tnames[S]+=1\n\telse:\n\t\tnames[S] = 1\n\tif names[S] > 1:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t \t \t\t \t \t \t \t \t\t\t \t", "a = int(input())\r\narr = []\r\nfor i in range(a):\r\n b = str(input())\r\n arr.append(b) \r\n \r\narrr = []\r\nfor j in arr:\r\n if j in arrr:\r\n \r\n print(\"YES\")\r\n else:\r\n arrr.append(j)\r\n print(\"NO\")", "\r\ndef main():\r\n n = int(fin())\r\n li = []\r\n for i in range(n):\r\n s = fin()\r\n if s in li: fout(\"YES\")\r\n else: fout(\"NO\")\r\n li.append(s)\r\n \r\n \r\n# FastIO\r\nfrom sys import stdout, stdin\r\ndef fin():\r\n return stdin.readline().rstrip(\"\\r\\n\")\r\ndef fout(s, sep=\"\\n\"):\r\n stdout.write(str(s)+sep)\r\nif __name__ == \"__main__\":\r\n t = 1 or int(fin())\r\n [main() for i in range(t)]", "n = int(input())\nppl = []\nfor i in range(n):\n person = input()\n if person in ppl:\n print(\"YES\")\n else:\n print(\"NO\")\n ppl.append(person)\n\t \t\t \t \t\t \t \t \t\t \t\t\t \t", "n=int(input())\nd={}\nfor i in range(n):\n i = input()\n if i in d.keys():\n d[i]+=1\n print(\"YES\")\n else:\n d[i]=1\n print(\"NO\")\n\n\n\t \t \t \t\t\t\t \t\t \t\t\t \t \t", "t = int(input())\r\nlst = []\r\nfor i in range(t):\r\n str = input()\r\n if str in lst:\r\n print(\"YES\")\r\n else:\r\n lst.append(str)\r\n print(\"NO\")", "N = int(input())\narr = []\nfor i in range(N):\n s = input()\n if(s in arr):\n print(\"YES\")\n else:\n print(\"NO\")\n arr.append(s)\n\n \t \t\t \t \t\t \t\t\t\t\t \t\t\t\t\t", "n = int(input())\ns = (input() for _ in range(n))\nhad = set()\nfor i in s:\n res = \"YES\" if i in had else \"NO\"\n had.add(i)\n print(res)\n", "n = input()\nn = int(n)\nc = 0\ns = []\nd = []\nwhile c < n:\n sam = input()\n s.append(sam)\n c+=1\nfor x in s:\n d.append(x)\n if d.count(x) > 1:\n print(\"YES\")\n else:\n print(\"NO\")\n\t \t\t \t \t\t\t\t \t\t\t\t\t \t\t\t", "d = {}\r\nquery = int(input())\r\n\r\nwhile (query):\r\n query = query - 1\r\n s = input()\r\n if s in d:\r\n print(\"YES\")\r\n else:\r\n d[s] = 1\r\n print(\"NO\")", "t = int(input())\na = []\nwhile t > 0:\n\ts = input()\n\ta.append(s)\n\tt = t - 1\nfr = {}\nfor i in a:\n\tif i in fr:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\t\tfr[i] = 1\n\t\t\t \t\t \t\t\t \t\t\t\t\t\t \t\t \t\t \t \t", "n=int(input())\r\nalist=[]\r\nfor i in range(n):\r\n name=str(input())\r\n alist.append(name)\r\nblist=[]\r\nblist.append(\"NO\")\r\nfor i in range(1,n):\r\n if alist[i] in alist[0:i]:\r\n blist.append(\"YES\")\r\n else:\r\n blist.append(\"NO\")\r\nfor i in blist:\r\n print(i)", "b = int(input())\r\nv = []\r\ns = 0\r\nfor i in range(b):\r\n a = input()\r\n v.append(a)\r\nfor o in v:\r\n s += 1\r\n if v[:s].count(o) > 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "x=[]\r\nfor i in range(int(input())):\r\n n=input()\r\n if n in x:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n x.append(n)", "n = int(input())\nm = set()\nfor i in range(n):\n s = input()\n print(\"YES\" if s in m else \"NO\")\n m.add(s)\n\n\t \t \t \t \t\t\t \t\t \t\t", "memory=dict()\r\nfor _ in [0]*int(input()):\r\n s=input()\r\n try:memory[s]+=1;print('YES')\r\n except:memory[s]=0;print('NO')", "n = int(input())\nlist1 = []\nfor i in range(0,n):\n m = input()\n if m not in list1:\n print(\"NO\")\n list1.append(m)\n else:\n print(\"YES\")\n \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\ts=str(input())\r\n\tprint('YES' if s in lst else 'NO')\r\n\tlst.append(s)", "\r\ndef main():\r\n a = set()\r\n for _ in range(int(input())):\r\n name = input()\r\n if name in a:\r\n print(\"YES\")\r\n else:\r\n a.add(name)\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\nk=[]\nfor i in range(n):\n t=input()\n if t not in k:\n k.append(t)\n print(\"NO\")\n else:\n print(\"YES\")\n \t\t \t \t\t \t\t \t \t\t \t \t\t\t\t \t", "n=int(input())\r\nl1=[]\r\nfor i in range(n):\r\n\ts=input()\r\n\tif s in l1:\r\n\t\tprint(\"Yes\")\r\n\telse:\r\n\t\tprint(\"No\")\r\n\tl1.append(s)", "t = int(input())\nli = []\nfor i in range(t):\n x = input()\n if x in li:\n print(\"YES\")\n else:\n print(\"NO\")\n li.append(x)\n \n\t \t \t\t \t \t \t \t \t\t", "l = []\r\nz = []\r\nfor i in range(int(input())):\r\n l.append(input())\r\nfor k in l:\r\n if k not in z:\r\n print(\"NO\")\r\n z.append(k)\r\n else:\r\n print(\"YES\")", "tests = int(input())\r\nlist =[]\r\nfor number in range(tests):\r\n a= str(input())\r\n list.append(a)\r\nfor temp in range(tests):\r\n flag = 0\r\n for temp1 in range(temp):\r\n if list[temp]==list[temp1]:\r\n flag = 1\r\n break\r\n if (flag==1) :\r\n print('YES')\r\n else:\r\n print('NO')", "n=int(input())\nlst=[]\nfor i in range(n):\n st=input()\n if(st in lst):\n print(\"YES\")\n else:\n print(\"NO\")\n lst.append(st)\n\t\t\t\t\t\t \t\t \t\t\t\t \t\t \t\t\t \t \t\t", "attempt = int(input())\nwordlist = []\nprint_list = []\nwhile attempt > 0:\n attempt -= 1\n word = input()\n if word not in wordlist:\n wordlist.append(word)\n print_list.append(\"NO\")\n else:\n print_list.append(\"YES\")\n\n\nfor i in print_list:\n print(i)\n\n\t \t\t \t \t \t \t\t \t\t\t\t\t\t \t\t", "n = int(input()) \nnames_set = set() \n\nfor i in range(n):\n name = input().lower()\n if name in names_set:\n print(\"YES\")\n else:\n names_set.add(name)\n print(\"NO\")\n\n \t \t\t \t\t \t \t \t \t", "n = int(input())\r\ns = set()\r\nfor _ in range(n):\r\n temp = input()\r\n if temp in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n s.add(temp)\r\n\r\n", "n = int(input())\nd = {}\nfor i in range(n):\n\tl = input()\n\tif l in d:\n\t\tprint(\"YES\")\n\telse:\n\t\td[l] = 1\n\t\tprint(\"NO\")\n\t \t\t \t \t\t \t \t\t \t \t \t \t\t", "masukan=int(input())\r\nnama=[]\r\ntampung=[]\r\nfor i in range (masukan) :\r\n x=input().split()\r\n nama+=x\r\n\r\nfor i in range(masukan):\r\n if nama[i] not in tampung:\r\n tampung+=nama[i].split()\r\n print(\"NO\")\r\n \r\n else:\r\n print(\"YES\")\r\n\r\n\r\n", "n=int(input())\nl=[]\nfor t in range(n):\n r=input()\n if r in l:\n print(\"YES\")\n else:\n print(\"NO\")\n l.append(r)\n \t\t\t \t \t \t \t\t \t \t \t\t \t \t \t\t", "n = int(input().strip())\nDict = {}\nfor i in range(n):\n name = input().strip()\n if name not in Dict:\n Dict[name] = 1\n print(\"NO\")\n else:\n print(\"YES\")\n \t \t\t \t\t \t \t \t\t", "d = {}\r\nfor i in range(int(input())):\r\n s = input().strip()\r\n if s in d:\r\n d[s] += 1\r\n print('YES')\r\n else:\r\n d.setdefault(s, 0)\r\n d[s] += 1\r\n print('NO')", "n=int(input())\r\narr=[]\r\nans=[]\r\nfor i in range(n):\r\n s=input()\r\n if s in arr:\r\n ans.append(\"YES\")\r\n else:\r\n arr.append(s)\r\n ans.append(\"NO\")\r\n\r\nfor i in ans:\r\n print(i)\r\n", "n = int(input())\n\nname = {}\noutput = []\n\nfor _ in range(n):\n s = input().lower()\n\n if s in name:\n output.append(\"YES\")\n else:\n output.append(\"NO\")\n name[s] = True\n\nfor result in output:\n print(result)\n \t \t\t\t \t \t \t\t\t \t \t \t", "t=int(input())\nx=1\nl=[]\nwhile(x<=t):\n y=str(input())\n if(y not in l):\n print(\"NO\")\n l.append(y)\n else:\n print(\"YES\")\n x=x+1\n\n\n\n\n\n\n\n\n\t\t \t \t \t \t \t\t\t \t \t", "x=int(input())\r\ns=[]\r\nfor i in range(x):\r\n st=input()\r\n s.append(st)\r\n\r\nprint(\"NO\")\r\nfor i in range(1,x):\r\n flag=0\r\n for j in range(0,i):\r\n if s[i]==s[j]:\r\n flag=1\r\n break\r\n if(flag==0):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "n = int(input())\r\nnames = {}\r\nresult = []\r\n\r\nfor _ in range(n):\r\n name = input().strip().lower()\r\n if name in names:\r\n result.append(\"YES\")\r\n else:\r\n result.append(\"NO\")\r\n names[name] = True\r\n\r\nfor r in result:\r\n print(r)\r\n", "t=int(input())\nd=dict()\nfor i in range(t):\n s=input()\n if s not in d:\n print(\"NO\")\n d[s]=1\n else:\n print(\"YES\")\n \t \t \t \t\t \t\t\t\t\t\t\t \t\t \t \t", "vinay = int(input())\nl=[]\nfor i in range(vinay):\n str=input()\n if str not in l:\n print(\"no\")\n l.append(str)\n else:\n print(\"yes\")\n\t\t \t \t\t \t\t \t \t \t\t \t \t\t\t \t", "s1 = input()\r\ns2 = int(s1)\r\n\r\nl=[[x for x in input().split()] for i in range(s2)]\r\n\r\nmaniual = []\r\nfor i in l:\r\n if i in maniual:\r\n print('YES')\r\n else:\r\n print('NO')\r\n maniual.append(i)\r\n# print(maniual)", "n = input()\nlista = []\nlistaR = []\n\nfor i in range(int(n)):\n nombre = input()\n\n if nombre in lista:\n listaR.append(\"YES\")\n else:\n listaR.append(\"NO\")\n lista.append(nombre)\n\nfor i in listaR:\n print(i)\n\n \t\t \t\t\t \t \t\t \t\t\t\t \t\t \t", "n = int(input())\r\nlista = []\r\nfor i in range(n):\r\n temp = input()\r\n if temp in lista:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n lista.append(temp)\r\n\r\n \r\n", "def found(arr,s):\r\n m = True\r\n for i in range(len(arr)):\r\n if arr[i]==s:\r\n m = False\r\n print(\"YES\")\r\n break\r\n if m:\r\n print(\"NO\")\r\n\r\narr=[]\r\nt = int(input())\r\nwhile t:\r\n s = input()\r\n found(arr,s)\r\n arr.append(s)\r\n t = t - 1\r\n\r\n\r\n\r\n", "a = int(input())\r\nb = set();\r\nfor x in range(a):\r\n g = input();\r\n cucc = True if g in b != -1 else False;\r\n print(\"NO\") if not cucc else print (\"YES\")\r\n b.add(g)", "n = int(input())\nname_set = set()\noutput = []\n\nfor _ in range(n):\n name = input().lower() \n if name in name_set:\n output.append(\"YES\")\n else:\n output.append(\"NO\")\n name_set.add(name) \nfor result in output:\n print(result)\n\t \t\t\t \t \t\t\t \t \t\t\t \t\t", "t=int(input())\ny=[]\nfor i in range(t):\n flag=0\n s=input()\n y.append(s)\n for j in range(len(y)-1):\n if y[i]==y[j]:\n flag=1\n break\n if flag:\n print(\"YES\")\n else:\n print(\"NO\")\n t-=1\n \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 name=input()\r\n if name not in l:\r\n print(\"NO\")\r\n l.append(name)\r\n else:\r\n print(\"YES\")", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n x=input()\r\n print('YES' if x in d.keys() else 'NO')\r\n d[x]=0", "n=int(input())\r\nM=[]\r\nD=[]\r\nfor i in range(n):\r\n s=input()\r\n M.append(s)\r\n if M.index(s)==i:\r\n D.append(\"NO\")\r\n else:\r\n D.append(\"YES\")\r\nfor k in D:\r\n print(k)", "n=int(input())\nh=[]\nfor i in range(n):\n k=input()\n if k not in h:\n print(\"NO\")\n else:\n print(\"YES\")\n h.append(k)\n\n \t\t \t \t\t\t\t\t \t \t\t \t\t", "x=input()\nx=int(x)\nlista = []\nlistb = []\nfor a in range(0, x):\n b=input()\n if b in lista:\n listb.append(\"YES\")\n else:\n listb.append(\"NO\")\n lista.append(b)\n\nprint(*listb, sep = \"\\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=[]\r\nfor i in range(0,n):\r\n m=input()\r\n if m in a:\r\n print('YES')\r\n else:\r\n print('NO')\r\n a.append(m)\r\n", "l=[]\r\nt=int(input())\r\nfor i in range(t):\r\n n=input()\r\n if n in l:\r\n print(\"Yes\")\r\n else:\r\n print('No')\r\n l.append(n)", "n = int(input())\r\nli = []\r\nfor i in range(n):\r\n s = input()\r\n if s not in li:\r\n li.append(s)\r\n print(\"NO\")\r\n else :\r\n print(\"YES\")", "n = int(input())\r\ns = set()\r\nwhile n!= 0:\r\n\tn -= 1\r\n\tst = input()\r\n\tif st in s:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\n\ts.add(st)", "u88E=[]\r\nfor f75K in range(int(input())):\r\n g90H=input()\r\n if g90H not in u88E:\r\n u88E.append(g90H)\r\n print('NO')\r\n else:\r\n u88E.append(g90H)\r\n print('YES')", "t = int(input())\ndict = {}\nfor case in range(t):\n word = input()\n if word not in dict.keys():\n dict[word] = 1\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\t \t", "n = int(input())\r\nq = []\r\nanswer = []\r\nfor i in range(n):\r\n s = input()\r\n result = 0\r\n for j in q:\r\n if s == j:\r\n answer.append(\"YES\")\r\n result = 1\r\n break\r\n else:\r\n continue\r\n if result != 1:\r\n answer.append(\"NO\")\r\n q.append(s)\r\nfor i in answer:\r\n print(i)", "n = int(input())\r\ns = set()\r\nfor i in range(n):\r\n g = input()\r\n print('YES' if g in s else 'NO')\r\n s.add(g)\r\n \r\n ", "n = int(input())\r\nst = set()\r\nl = list()\r\nfor i in range(n):\r\n w = input()\r\n l.append(w)\r\n if(w not in st and w in l):\r\n st.add(w)\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "n=int(input())\nx=[]\nfor i in range(n):\n nombre=input()\n if nombre not in x:\n print(\"NO\")\n x.append(nombre)\n else:\n print(\"YES\")\n\t \t\t\t \t\t\t\t\t\t\t \t \t \t\t \t\t\t\t", "# import os\r\n\r\nn = int(input())\r\n\r\nnames = []\r\nfor _ in range(n):\r\n s =input()\r\n names.append(s)\r\n\r\nr = []\r\n\r\nfor name in names:\r\n if name not in r:\r\n r.append(name)\r\n print('NO')\r\n else:\r\n print('YES')\r\n\r\n", "l=[]\r\nfor _ in range(int(input())):\r\n s=input()\r\n print(\"YNEOS\"[s not in l::2])\r\n l.append(s)\r\n", "a = int(input())\r\nc = []\r\nfor i in range(a):\r\n b = input()\r\n c += [b]\r\nprint(\"NO\")\r\nfor j in range(1,a):\r\n for k in range(j):\r\n if c[j]==c[k] and k<j:\r\n print(\"YES\")\r\n break\r\n else:\r\n pass\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n", "n = int(input())\r\ns = set()\r\nfor _ in range(n):\r\n o = input()\r\n if o in s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n s.add(o)\r\n", "import sys, bisect, math\r\nfrom collections import deque, Counter\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\nceil = lambda x: math.ceil(x)\r\nmod = 10**9 + 7\r\n\r\ndef solve():\r\n n = int(input())\r\n ans = []\r\n s = set()\r\n for i in range(n):\r\n name = input()\r\n if name in s:\r\n ans.append(\"YES\")\r\n else:\r\n s.add(name)\r\n ans.append(\"NO\")\r\n return \"\\n\".join(ans)\r\n \r\n \r\n\r\nif __name__ == \"__main__\":\r\n t=1\r\n # t = int(input())\r\n for _ in range(t):\r\n print(solve())", "# your code goes here\nt=set()\nfor _ in range(int(input())):\n\ts=(input())\n\tif s not in t:\n\t\tt.add(s)\n\t\tprint('NO')\n\telse:\n\t\tprint('YES')\n\t\n \t \t \t\t\t \t\t\t \t\t\t \t\t\t\t\t \t \t", "cantLineas = int(input())\r\nlineas_input = []\r\nfor i in range(cantLineas):\r\n linea = list(map(str, input().split()))\r\n lineas_input.append(linea)\r\n\r\n\r\nya_nombrados = []\r\n\r\nfor nombre in lineas_input:\r\n if nombre in ya_nombrados:\r\n print(\"YES\")\r\n else:\r\n ya_nombrados.append(nombre)\r\n print(\"NO\")\r\n", "import math\r\n\r\nn = int(input())\r\nmy = dict()\r\nwhile n>0:\r\n name = input()\r\n if my.get(name)==None:\r\n print(\"NO\")\r\n my[name]=1\r\n else:\r\n print(\"YES\")\r\n n-=1", "n=int(input())\nnames=[]\nfor i in range(n):\n names.append(input())\nm=[]\nfor i in range(n):\n if names[i] in m:\n print(\"YES\")\n else:\n print(\"NO\")\n m.append(names[i])\n\t \t\t\t \t\t\t \t \t\t \t\t\t \t\t", "saraksts = set()\r\nfor i in range(int(input())):\r\n vards = input()\r\n if vards in saraksts:\r\n print(\"YES\")\r\n else:\r\n saraksts.add(vards)\r\n print(\"NO\")", "T = int(input())\ndic = {}\nfor i in range(T):\n\tSs = input()\n\tif Ss in dic:\n\t\tdic[Ss]+=1\n\telse:\n\t\tdic[Ss] = 1\n\tif dic[Ss] > 1:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n \t\t \t \t \t \t \t \t\t \t\t\t \t\t\t\t\t \t \t", "n = int(input())\ns = []\nfor i in range(n):\n s.append(input())\nfor i in range(n):\n flag = 0\n for j in range(i):\n if s[i] == s[j]:\n flag = 1\n break\n if flag:\n print(\"YES\")\n else:\n print(\"NO\")\n\t\t\t\t\t \t \t\t \t \t\t\t \t \t \t\t\t", "s=[]\r\nans=[]\r\nn= int(input())\r\nfor i in range (n):\r\n p= input()\r\n if p in s:\r\n ans.append(\"YES\")\r\n else: ans.append(\"NO\")\r\n s.append(p)\r\nfor i in ans:\r\n print(i)", "n = int(input())\nb = []\nfor i in range(n):\n k = input()\n if k not in b:\n print(\"NO\")\n else:\n print(\"YES\")\n b.append(k)\n \t\t\t \t \t \t\t\t \t \t \t\t\t", "T = int(input())\nbook = {}\nfor i in range(T):\n\tS = input()\n\tif S in book:\n\t\tbook[S]+=1\n\telse:\n\t\tbook[S] = 1\n\tif book[S] > 1:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n \t\t \t \t \t \t \t \t \t \t\t", "\r\n\r\ndef solve():\r\n n = int(input())\r\n d = dict()\r\n for i in range(n):\r\n x = input()\r\n if x not in d:\r\n d[x]=1\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nfor _ in range(1):\r\n solve()\r\n", "import sys\ndef input():\n return sys.stdin.readline().strip()\ndef print(n):\n return sys.stdout.write(str(n)+\"\\n\")\nd=[]\nfor _ in range(int(input())):\n a=input().lower()\n if a in d:\n print(\"YES\")\n else:\n d.append(a)\n print(\"NO\")\n\t \t\t\t\t \t \t \t\t\t\t\t\t\t \t\t\t\t \t \t", "N = int(input())\r\ns = []\r\nfor i in range(N):\r\n A= input()\r\n if A not in s:\r\n print(\"NO\")\r\n s.append(A)\r\n else:\r\n print(\"YES\")", "# https://codeforces.com/problemset/problem/855/A\r\n\r\nn = input()\r\n\r\ns = set()\r\n\r\nfor i in range(int(n)):\r\n a = input()\r\n if a in s:\r\n print(\"YES\")\r\n else:\r\n s.add(a)\r\n print(\"NO\")\r\n", "l=[]\nfor i in range(int(input())):\n\tx=input()\n\tif x in l:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n\tl.append(x)\n\t \t\t\t\t \t\t \t\t\t \t \t \t\t\t \t\t \t", "T = int(input())\nlis = []\nfor i in range(T):\n inp = input()\n if(inp not in lis):\n print('NO')\n lis.append(inp)\n else:\n print('YES')\n\t\t \t\t \t \t\t\t \t \t\t\t\t \t\t\t\t \t\t\t" ]

[ "s,n,q,a=input(),int(input()),{},\"\"\r\nfor i in s:q[i]=[q[i][0]+1,1]if i in q else [1,1]\r\nif len(q)>n:print(-1)\r\nelse:\r\n for i in range(n-len(q)):\r\n o=0\r\n for j in q:\r\n m=(q[j][0]+q[j][1]-1)//q[j][1]\r\n if m>o:o,w=m,j\r\n q[w][1]=q[w][1]+1\r\n for i in q:a+=i*q[i][1]\r\n o=0\r\n for i in q:\r\n m=(q[i][0]+q[i][1]-1)//q[i][1]\r\n if m>o:o=m\r\n print(o,\"\\n\",a)", "import math\nfrom fractions import Decimal\nS=input()\n\nN=int(input())\nSrep={}\nansrep={}\nfor item in \"abcdefghijklmnopqrstuvwxyz\":\n Srep[item]=0\n ansrep[item]=0\n\nfor item in S:\n Srep[item]+=1\n ansrep[item]+=1\n\nQ=list(set(S))\n\nif(len(Q)>N):\n print(-1)\n\nelse:\n n=len(Q)\n ans=list(S)\n num=1\n req=1\n n=len(ans)\n while(len(ans)>N):\n n=len(ans)\n minn=req+1005\n removal=ans[0]\n k=True\n for item in ans:\n if(ansrep[item]==1):\n continue\n if(math.ceil(Srep[item]/(ansrep[item]-1))>req):\n if(minn>math.ceil(Srep[item]/(ansrep[item]-1))):\n minn=math.ceil(Srep[item]/(ansrep[item]-1))\n removal=str(item)\n continue\n else:\n ansrep[item]-=1\n ans.remove(item)\n k=False\n break\n if(k):\n ansrep[removal]-=1\n req=math.ceil(Srep[removal]/ansrep[removal])\n ans.remove(removal)\n g=\"\"\n if(len(ans)<N):\n g=S[0]*(N-len(ans))\n print(req)\n for item in ans:\n print(item,end=\"\")\n print(g)\n \n \n \n \n \n \n \n\n\n", "s = input()\r\nn = int(input())\r\nd = {}\r\nr = 0\r\nfor a in s:\r\n d.setdefault(a, 0)\r\n d[a] += 1\r\n if(d[a] > r):\r\n r = d[a]\r\nif (len(d) > n):\r\n print(-1)\r\nelse:\r\n l = 0\r\n while r - l > 1:\r\n k = (l + r) // 2\r\n cur = 0\r\n for x in d.values():\r\n cur += (x+k-1) // k\r\n if cur > n:\r\n l = k\r\n else:\r\n r = k\r\n print(r)\r\n s = ''\r\n for a in d.keys():\r\n s += a * ((d[a] + r - 1) // r)\r\n l=len(s)\r\n s += 'a' * (n-len(s))\r\n print(s)", "from collections import Counter\nfrom heapq import heappushpop\n\n\ndef main():\n cnt, n = Counter(input()), int(input())\n if n < len(cnt):\n print(-1)\n return\n h = list((1 / v, 1, c) for c, v in cnt.most_common())\n res = list(cnt.keys())\n _, v, c = h.pop(0)\n for _ in range(n - len(cnt)):\n res.append(c)\n v += 1\n _, v, c = heappushpop(h, (v / cnt[c], v, c))\n print((cnt[c] + v - 1) // v)\n print(''.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\r\nn = int(input())\r\ncnt = {}\r\nfor c in s:\r\n if cnt.get(c) == None:\r\n cnt[c] = 1\r\n else:\r\n cnt[c] += 1\r\n\r\nif (n < len(cnt)):\r\n print(-1)\r\nelse:\r\n ansNum = 0;\r\n while(True):\r\n ansNum+=1\r\n l = 0;\r\n char = []\r\n for c, v in cnt.items():\r\n need = (v + ansNum -1)//ansNum\r\n l+= need\r\n char.append((c, need))\r\n if (l > n):\r\n continue\r\n print(ansNum)\r\n ans = \"\".join([str(c[0])*c[1] for c in char])\r\n ans = ans + 'a'*(n - len(ans))\r\n print(ans)\r\n break", "s = input()\n\nn = int(input())\n\n\n\nd = {}\n\nfor c in s:\n\n if c not in d: d[c] = 0\n\n d[c] += 1\n\n \n\ndcl = d.values()\n\n\n\nfound = False\n\nfor x in range(1,1001):\n\n if sum([(dc-1)//x+1 for dc in dcl]) <= n:\n\n found = True\n\n print(x)\n\n s = ''.join([key*((d[key]-1)//x+1) for key in sorted(d.keys())])\n\n s += (n-len(s))*'a'\n\n print(s)\n\n break\n\nif not found:\n\n print(-1)\n\n", "from collections import Counter\n\ns = input()\nn = int(input())\n\nd = Counter()\n\nfor c in s:\n d[c] += 1\n\nif len(d) > n:\n print(-1)\nelse:\n left = 0\n right = 10**10\n s = \"\"\n lastok = (\"\", 0)\n while left + 1 < right:\n mid = (left + right) // 2\n s = \"\"\n for (c, cnt) in d.items():\n cntnow = (cnt - 1) // mid + 1\n s += c * cntnow\n if len(s) < n:\n s += 'a' * (n - len(s))\n if len(s) == n:\n lastok = (s, mid)\n right = mid\n else:\n left = mid\n print (lastok[1])\n print (lastok[0])\n", "def solve():\n s = input().strip()\n n = int(input())\n\n freq = {}\n for c in s:\n if freq.get(c) != None:\n freq[c] += 1\n else:\n freq[c] = 1\n \n if n < len(freq):\n print(-1)\n return\n \n low = 1\n high = len(s)\n ans = 0\n res = \"\"\n\n while low <= high:\n mid = (low + high) // 2\n k = 0\n temp_res = \"\"\n for c, f in freq.items():\n required_chars = -(-f // mid) # Equivalent to math.ceil(f / mid)\n k += required_chars\n temp_res += required_chars * c\n \n # If the total characters needed is less than or equal to n, it's a valid solution\n if k <= n:\n high = mid - 1\n ans = mid\n res = temp_res\n else:\n low = mid + 1\n\n # Build the final result string by repeating characters if needed\n while len(res) < n:\n res += res\n\n print(ans)\n print(res[:n])\n\nsolve()\n\n", "import sys\r\nimport math\r\nimport collections\r\nimport random\r\nfrom heapq import heappush, heappop\r\nfrom functools import reduce\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n \r\ns = input().strip()\r\nn = int(input())\r\nocc = collections.defaultdict(int)\r\nfor c in s:\r\n occ[c] += 1\r\n\r\ndef works(x):\r\n ans = \"\"\r\n for key in occ.keys():\r\n copies = math.ceil(occ[key] / x)\r\n ans += key * copies\r\n return ans\r\n\r\nl, r = 1, 1001\r\nwhile l <= r:\r\n m = (l + r) // 2\r\n st = works(m)\r\n if len(st) <= n:\r\n r = m - 1\r\n else:\r\n l = m + 1\r\nif l == 1002:\r\n print(\"-1\")\r\nelse:\r\n print(l)\r\n ans = works(l)\r\n while len(ans) != n:\r\n ans += \"a\"\r\n print(ans)\r\n" ]

[ "def Solve():\n x,y,m=map(int,input().split())\n\n if(x>=m or y>=m):\n return 0\n\n if(x<=0 and y<=0):\n return -1\n ans=0\n if(y<=0):\n ans=abs(y)//x+1\n y+=ans*x\n\n elif(x<=0):\n ans=abs(x)//y+1\n x+=ans*y\n\n while(x<m and y<m):\n if(x<y):\n x+=y\n else:\n y+=x\n ans+=1\n\n return ans\nprint(Solve())\n", "x,y,m = map(int,input().split())\r\nif(x > y):\r\n\tx,y = y,x\r\nif(y >= m):\r\n\tprint('0')\r\nelif(x+y <= x):\r\n\tprint('-1')\r\nelse:\r\n\tans = (y-x+y-1)//y\r\n\tx += y*ans\r\n\twhile(x < m):\r\n\t\tx,y = x+y,x\r\n\t\tans += 1\r\n\tprint(ans)", "x, y, m = map(int, input().split())\r\na, b = max(x, y), min(x, y)\r\nif a >= m:\r\n print(0)\r\n exit()\r\nif a <= 0:\r\n print(-1)\r\n exit()\r\nres = 0\r\nif b < 0:\r\n res += -b // a\r\n b += res * a\r\nif a < b:\r\n a, b = b, a\r\nwhile a < m:\r\n b += a\r\n res += 1\r\n if a < b:\r\n a, b = b, a\r\nprint(res)\r\n", "x,y,m=map(int,input().split())\r\nif x<=0 and y<=0 and x<m and y<m:\r\n print(-1)\r\n exit()\r\nif x>m or y>m:\r\n print(0)\r\n exit()\r\ncnt=0\r\nif x<0 and y>0:\r\n l=(-x)//y\r\n x+=l*y\r\n cnt+=l\r\nelif x>0 and y<0:\r\n l=(-y)//x\r\n y+=l*x\r\n cnt+=l\r\nwhile x<m and y<m:\r\n if x<y:\r\n x+=y\r\n else:\r\n y+=x\r\n cnt+=1\r\nprint(cnt)", "x, y, m = map(int, input().split())\r\nif max(x, y) >= m:\r\n print(0)\r\nelif max(x, y) <= 0:\r\n print(-1)\r\nelse:\r\n p, val = sorted([x, y]), 0\r\n if p[0] < 0:\r\n s = (min(m, 0) - p[0]) // p[1]\r\n p[0] += s * p[1]\r\n val += s\r\n while max(p) < m:\r\n p, val = [sum(p), max(p)], val + 1\r\n print(val)", "x,y,m=map(int,input().split())\r\ndef proc(x,y,m):\r\n if max(x, y) >= m:\r\n print(0)\r\n exit()\r\n if max(x, y) <= 0:\r\n print(-1)\r\n exit()\r\n count = 0\r\n x, y = max(x, y), min(x, y)\r\n count+=((x-y)//x)\r\n y+=count*x\r\n while max(x, y) < m:\r\n x, y = max(x, y), min(x, y) # 默认x大y小\r\n y += x\r\n count += 1\r\n print(count)\r\nproc(x,y,m)", "from sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_next_line():\r\n return list(map(int, stdin.readline().strip().split()))\r\n\r\n\r\nx, y, m = read_next_line()\r\na = [x, y]\r\nx = min(a)\r\ny = max(a)\r\nif y <= 0 and m > y:\r\n print(-1)\r\nelse:\r\n count = 0\r\n if x < 0 and m > y:\r\n count = -(x // y)\r\n x = x % y\r\n while m > y:\r\n tmp = y\r\n y = x + y\r\n x = tmp\r\n count += 1\r\n print(count)", "a , b , m = map(int,input().split())\r\nif a>b:\r\n b,a=a,b\r\nif b>=m:\r\n print(0)\r\n exit()\r\nelif b<=0:\r\n print(\"-1\")\r\n exit()\r\nans=0\r\nif a<0:\r\n ans += abs(a)//b\r\n a+=(ans)*b\r\n# print(a)\r\nwhile max(a,b)<m:\r\n if a>b:\r\n b=a+b\r\n else:\r\n a=a+b \r\n ans+=1\r\nprint(ans) \r\n\r\n", "x,y,m = map(int,input().split())\r\nx,y = min(x,y),max(x,y)\r\nif y>=m:\r\n print(0)\r\nelif y<=0:\r\n print(-1)\r\nelse:\r\n ans = 0\r\n while y<m:\r\n q = (2*y-x)//y\r\n ans += q\r\n x,y = y,x+q*y\r\n print(ans)", "s = input().split()\r\nx, y, m = (int(i) for i in s)\r\n\r\nans = 0\r\n\r\nif x >= m or y >= m:\r\n print(0)\r\nelif x <= 0 and y <= 0:\r\n print(-1)\r\nelse:\r\n if x < 0:\r\n q = abs(x // y)\r\n ans += q\r\n x += y * q\r\n elif y < 0:\r\n q = abs(y // x)\r\n ans += q\r\n y += x * q\r\n\r\n while x < m and y < m:\r\n ans += 1\r\n if x < y:\r\n x = x + y\r\n else:\r\n y = x + y\r\n \r\n print(ans)", "from collections import *\r\nimport sys\r\nimport io, os\r\nimport math\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nfrom collections import deque\r\n\r\ndef ceil(a, b):\r\n a = -a\r\n k = a // b\r\n k = -k\r\n return k\r\n# arr=list(map(int, input().split()))\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ndef strinp(testcases):\r\n k = 5\r\n if (testcases == -1 or testcases == 1):\r\n k = 1\r\n f = str(input())\r\n f = f[2:len(f) - k]\r\n return f\r\n\r\n\r\ndef main():\r\n arr=list(map(int, input().split()))\r\n x=arr[0]\r\n y=arr[1]\r\n m=arr[2]\r\n if(x>=m or y>=m):\r\n print(0)\r\n exit()\r\n if(x<=0 and y<=0):\r\n print(-1)\r\n exit()\r\n a=max(x,y)\r\n b=min(x,y)\r\n ans=ceil(a-b,a)\r\n b=b+(ans*a)\r\n ta=a\r\n a=b\r\n b=ta\r\n while(b<m and a<m):\r\n ta=max(a,b)\r\n tb=min(a,b)\r\n tb+=ta\r\n a=tb\r\n b=ta\r\n ans+=1\r\n print(ans)\r\nmain()", "x, y, m = map(int, input().split())\r\nimport sys\r\ncnt = 0\r\nif max(x, y) >= m:\r\n print(0)\r\n sys.exit()\r\nif max(x, y) <= 0:\r\n print(-1)\r\n sys.exit()\r\nif min(x, y) < 0:\r\n x,y = min(x, y), max(x, y)\r\n diff = abs(x)\r\n cnt += diff//y\r\n x += (diff//y) * y\r\n \r\nwhile max(x,y) < m:\r\n if x > y:\r\n x, y = y, x\r\n x += y\r\n cnt += 1\r\nprint(cnt) if max(x, y) >= m else print(-1)", "x, y, m = (int(q) for q in input().split())\nif x >= m or y >= m:\n\tprint(0)\n\texit()\nif x <= 0 and y <= 0:\n\tprint(-1)\n\texit()\nans = 0\nif x < 0:\n\tans += -x // y\n\tx += -x // y * y\nif y < 0:\n\tans += -y // x\n\ty += -y // x * x\nwhile x < m and y < m:\n\tans += 1\n\tif x < y:\n\t\tx += y\n\telse:\n\t\ty += x\nprint(ans)\n", "#!/usr/bin/env python3\nx, y, m = map(int,input().split())\nif not (x < y):\n x, y = y, x\nif m <= y:\n print(0)\nelif y <= 0:\n print(-1)\nelse:\n i = 0\n if x < 0:\n j = - (x // y)\n x += j * y\n i += j\n while y < m:\n x, y = y, x + y\n i += 1\n print(i)\n", "def ceil(a,b):\r\n if a%b:\r\n return a//b + 1\r\n return a//b \r\n\r\nx,y,m=map(int,input().split())\r\nif max(x,y)>=m:\r\n print(0)\r\n exit()\r\nelif max(x,y)<=0 and max(x,y)<m:\r\n print(-1)\r\n exit()\r\nans=0 \r\nx,y=min(x,y),max(x,y) \r\nif x<0:\r\n ans=ceil(abs(x),y)\r\n x+= ans*y\r\nc=ans\r\nwhile max(x,y)<m:\r\n if x<y:\r\n x=x+y\r\n else:\r\n y+=x\r\n c+=1\r\nprint(c) \r\n ", "x, y, m = map(int, input().split())\r\n\r\nx, y = min(x, y), max(x, y)\r\n\r\nif y >= m:\r\n print(0)\r\nelif y <= 0:\r\n print(-1)\r\nelse:\r\n c = 0\r\n while y < m:\r\n q = (2*y-x) //y\r\n c += q\r\n x, y = y, x+q*y\r\n print(c)", "x, y, m = map(int, input().split())\nif x <= 0 and y <= 0:\n if x >= m or y >= m:\n print(0)\n else:\n print(-1)\nelse:\n if x >= m or y >= m:\n print(0)\n exit(0)\n init = 0\n if x <= 0:\n init = (-x+y-1)//y\n x += init*y\n elif y <= 0:\n init = (-y+x-1)//x\n y += init*x\n ctr = 0\n while x < m and y < m:\n if x <= y:\n x += y\n else:\n y += x\n ctr += 1\n print(init+ctr)", "def solve(x,y,m):\n #edge case\n if x >= m or y >= m:\n print(0)\n return\n if x <= 0 and y <= 0:\n print(-1)\n return\n\n #general case\n if x > y:\n x,y = y,x\n cnt = 0\n\n if x <= 0:\n div = abs(x)//y + 1\n x = div*y + x\n cnt += div\n\n while y < m:\n x += y\n x,y = y,x\n cnt += 1\n\n print(cnt)\n\nif __name__ == '__main__':\n x,y,m = map(int,input().split())\n\n solve(x,y,m)", "x,y,m=map(int,input().split())\r\nx,y=min(x,y),max(x,y)\r\nif y>=m:s=0\r\nelif x+y<=x:s=-1\r\nelse:\r\n s=(y-x+y-1)//y\r\n x+=y*s\r\n while max(x,y)<m:\r\n if x<y:x+=y\r\n else:y+=x\r\n s+=1\r\nprint(s)", "#! /usr/bin/env python\n\ndef change(x, y):\n if x > y:\n tmp = y\n y = x\n x = tmp\n return (x, y)\n\nx, y, m = [int(x) for x in input().split()]\nif x >= m or y >= m:\n ans = 0\nelif x <= 0 and y <= 0:\n ans = -1\nelse:\n ans = 0\n x, y = change(x, y)\n if x < 0:\n ans = int(-x / y)\n ans += 1\n x = y - (-x % y)\n while y < m:\n tmp = x + y\n x = y\n y = tmp\n x, y = change(x, y)\n ans += 1\nprint(ans)\n", "#If you win, you live. You cannot win unless you fight.\r\n# remember hash hack use tuple\r\nimport string\r\nfrom sys import stdin,setrecursionlimit\r\ninput=stdin.readline\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nrdG=lambda: map(lambda s: int(s)-1, input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nsetrecursionlimit(10**5)\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom math import gcd, ceil, floor,log2,factorial\r\nfrom copy import deepcopy\r\n\r\nx,y,m=rd()\r\nif max(x,y)>=m:\r\n print(0)\r\n exit()\r\nif x<=0 and y<=0:\r\n print(-1)\r\n exit()\r\ncst=0\r\nif min(x,y)<0:\r\n tx=max(x,y)\r\n ty=min(x,y)\r\n res=ceil((0-ty)/tx)\r\n cst=res\r\n ty+=res*tx\r\n y=ty\r\n x=tx\r\n\r\nq=[(min(x,y),max(x,y),cst)]\r\n# print(q)\r\n\r\nwhile q:\r\n # print(q)\r\n a,b,c=q.pop(0)\r\n s=(a+b)\r\n # print(s>a)\r\n if s>=m:\r\n print(c+1)\r\n exit()\r\n if b>=s and s>a:\r\n q.append((s,b,c+1))\r\n elif s>b :\r\n q.append((b,s,c+1))\r\n else:\r\n break\r\nprint(-1)\r\n", "x,y,m = map(int,input().split())\nif(x > y):\n\tx,y = y,x\nif(y >= m):\n\tprint('0')\nelif(x+y <= x):\n\tprint('-1')\nelse:\n\tans = (y-x+y-1)//y\n\tx += y*ans\n\twhile(x < m):\n\t\tx,y = x+y,x\n\t\tans += 1\n\tprint(ans)\n\n" ]

[ "t,s,x=map(int,input().split())\r\na=x-t\r\nb=x-t-1\r\nif(t==x):\r\n print(\"YES\")\r\nelse:\r\n if(a>=s)or(b>=s):\r\n if(a>=s)and(a%s==0):\r\n print(\"YES\")\r\n elif((b%s==0)and(b>=s)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n else:\r\n print(\"NO\")\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nt, s, x = map(int, input().split())\r\nans = \"YES\" if not t + 1 == x and t <= x and (x - t) % s <= 1 else \"NO\"\r\nprint(ans)", "[t,s,x] = map(int, input().split())\r\n\r\nr = (x-t)%s\r\nif x < t:\r\n print('NO')\r\nelif r == 0 or (r == 1 and x-t >= s):\r\n print('YES')\r\nelse:\r\n print('NO')", "t,s,x=[*map(int,input().split())]\r\ndifference=x-t\r\nif(x==t):\r\n print(\"YES\")\r\nelif(((difference%s==0) or (difference-1)%s==0) and difference >= s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "t,s,x=map(int,input().split())\r\nif x%s==t%s and t<=x:\r\n print(\"YES\")\r\nelif x%s==(t+1)%s and t+1<x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t, s, x = map(int, input().split())\r\nprint('YES' if (x >= t + s and x % s in [t % s, (t + 1) % s]) or (x == t) else 'NO')\r\n", "a,b,c= map(int,input().split())\r\nk = c-a\r\nif k>=b or k ==0:\r\n\tif k%b==0 or k%b==1:print(\"YES\")\r\n\telse:print(\"NO\")\r\nelse:print(\"NO\")", "t, s, x = map(int,input().split())\nif x < t :print(\"NO\")\nelif (x - t) % s == 0:print(\"YES\")\nelif (x -(t+1))%s==0 and x>s and(t+1)!=x:print(\"YES\")\nelse:print(\"NO\")\n", "a,b,c=map(int,input().split())\r\nres=\"NO\"\r\nif(not c<(a+b)):\r\n if((c-(a+b))%b==0 or (c-(a+b))%b==1):\r\n res=\"YES\"\r\nelse:\r\n if(a==c):\r\n res=\"YES\"\r\nprint(res)\r\n", "\r\nt, s, x = [int(s) for s in input().split(\" \")]\r\nif x < t:\r\n print(\"NO\")\r\nelse:\r\n t = x-t\r\n if t == 1:\r\n print(\"NO\")\r\n elif t%s == 0 or t%s == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t,s,x = [int(x) for x in input().split()]\r\nif t == x:\r\n print (\"YES\")\r\n exit(0)\r\nif x-t > 0 and (x-t)%s == 0:\r\n print (\"YES\")\r\n exit(0)\r\nif x-t-1 > 0 and (x-t-1)%s == 0:\r\n print (\"YES\")\r\n exit(0)\r\nprint (\"NO\")", "def f(l):\r\n t,s,x = l\r\n d = x-t\r\n return (d==0 or (d>=s and d%s<2))\r\n\r\nl = list(map(int,input().split()))\r\nprint('YES' if f(l) else 'NO')", "# ﷽\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\n\r\ndef solve():\r\n t,s,x=[int(i) for i in input().split()]\r\n if x==t:return \"YES\"\r\n elif (x-t)%s==0 and(x-t)//s>0:return \"YES\"\r\n\r\n elif (x-t-1)%s==0 and(x-t-1)//s>0:return \"YES\"\r\n return \"NO\"\r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n print(solve())\r\n", "t,s,x=map(int,input().split())\r\nif(x==t):\r\n print(\"YES\")\r\nelif((x-s)<t):\r\n print(\"NO\")\r\nelse:\r\n if((x-t)%s==0 or (x-t)%s==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t, interval, eat = map(int, input().split())\r\nif eat < t:\r\n print(\"NO\")\r\nelif eat == t:\r\n print(\"YES\")\r\nelif eat > t and eat < t+interval:\r\n print(\"NO\")\r\nelif (eat-t)%interval > 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def main():\r\n\r\n given=input()\r\n y=given.split(\" \")\r\n for i in range(3):\r\n y[i]=int(y[i])\r\n t,s,x=y\r\n if t==0 and x%s==0:\r\n print(\"YES\")\r\n return\r\n t_time=0\r\n count=0\r\n flag=0\r\n while True:\r\n \r\n while count<1:\r\n t_time=t\r\n if t_time>x:\r\n print(\"NO\")\r\n flag=1\r\n break\r\n if t_time==x:\r\n print(\"YES\")\r\n flag=1\r\n \r\n break\r\n count=1\r\n \r\n if flag==1:\r\n break \r\n \r\n t_time=t+count*s\r\n\r\n if t_time>x:\r\n print(\"NO\")\r\n break\r\n\r\n if t_time==x:\r\n print(\"YES\")\r\n break\r\n\r\n t_time=t+count*s+1\r\n\r\n if t_time>x:\r\n print(\"NO\")\r\n break\r\n if t_time==x:\r\n print(\"YES\")\r\n break\r\n count+=1\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()", "t,s,x = [int(i) for i in input().split()]\ndef will_pineapple_bark(t:int, s:int, x:int)->str:\n if t == x: # the first bark time is t.\n return 'YES'\n k1 = (x - t) / s\n k2 = (x - t - 1) / s\n if k1 > 0 and k1 == int(k1):\n return 'YES'\n if k2 > 0 and k2 == int(k2):\n return 'YES'\n return 'NO'\n\nprint(will_pineapple_bark(t,s,x))\n", "t , s, x = map(int,(input().split()))\n\ny = x-t\n\nif x == t :\n print(\"YES\")\n exit()\n \nelif x < t :\n print(\"NO\")\n exit()\n\nelif y == 1 :\n print(\"NO\")\n exit()\n \nif x < s :\n print(\"NO\")\n exit()\n \nif y%s == 0 :\n print(\"YES\")\n exit()\n \n\nif (y-1)%s == 0 :\n print(\"YES\")\n exit()\n\nelse :\n print(\"NO\")\n exit()", "t,s,x=map(int,input().split())\r\nif t==x:\r\n print(\"yes\")\r\nelse:\r\n if (x-t)%s<=1 and (x-t)//s>0:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n \r\n ", "t, s, x = map(int, input().split())\r\n\r\nif t > x or x - 1 == t:\r\n print(\"NO\")\r\n exit()\r\n\r\nif (x - t) % s == 0 or (x - t) % s == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = [int(i) for i in input().split(' ')]\nt=n[0]\ns=n[1]\nx=n[2]\n\na=(x-t)/s\nb=(x-t-1)/s\n\nif(x<t):\n print(\"NO\")\nelif(x==t):\n print(\"YES\")\nelif((x-t)!=0 and (x-t-1)!=0):\n if(a==int(a) or b==int(b)):\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", "n,s,t = map(int,input().split())\r\nif (t < n): \r\n\tprint(\"NO\") \r\nelif ((t - n) % s == 0 or ((t-n-1) % s == 0 and t != n + 1)):\r\n\tprint(\"YES\")\r\nelse: \r\n\tprint(\"NO\")\r\n\r\n\r\n", "t,s,x=map(int,input().split())\r\nif x==t:\r\n\tprint(\"YES\")\r\nelse:\r\n\tx=x-t\r\n\tif x>=s:\t\r\n\t\tz=x%s\r\n\r\n\t\tif z==0 or z==1:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\t\t\r\n\telse:\r\n\t\tprint(\"NO\")", "t, s, x = [int(i) for i in input().split()]\r\nx -= t\r\nif x<0 or x == 1:\r\n print ('NO')\r\nelse:\r\n x %= s\r\n if x < 2:\r\n print ('YES')\r\n else:\r\n print ('NO')", "def pineapple(t,s,x):\r\n first = t\r\n if t == x:\r\n return(\"YES\")\r\n else: \r\n while first <= x:\r\n first += s\r\n second = first + 1\r\n if first==x or second==x:\r\n return(\"YES\") \r\n else: \r\n return(\"NO\") \r\ndef pineapple2(t,s,x):\r\n a = (x-t)//s \r\n if a > 0:\r\n b = a*s+t\r\n b1 = b+1 \r\n if b==x or b1==x:\r\n return(\"YES\")\r\n else:\r\n return(\"NO\")\r\n else:\r\n if t==x:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\n \r\nlis = list(map(int, input().split()))\r\nt = lis[0]\r\ns = lis[1]\r\nx = lis[2]\r\nprint(pineapple2(t,s,x))\r\n\r\n \r\n", "a=input().split(' ')\r\nt=int(a[0])\r\ns=int(a[1])\r\nx=int(a[2])\r\nif x==t+1 or x<t: print('NO')\r\nelif x==t:\r\n\tprint('YES')\r\nelif x==t+s: print ('YES')\r\nelif (x-t)%s==0: print ('YES')\r\nelif (x-t-1)%s==0: print('YES')\r\nelse: print('NO')\r\n\r\n\r\n\r\n", "t, s, x = map(int, input().split())\r\nk = x - t\r\n\r\nif k < s and k != 0:\r\n print(\"NO\")\r\nelif k % s == 0 or k % s == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t,s,x=map(int,input(\"\").split())\r\np=x-t\r\nif(t==x):\r\n print(\"YES\")\r\nelif(x<t) or (t<x<(t+s)) or ((p%s!=0) and (p%s!=1)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "t,s,x=map(int,input().split())\r\nq=(x-t)//s\r\nif(q>0 and ((x-t)%s==0 or (x-t)%s==1)):\r\n\tprint('YES')\r\nelif(x==t):\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "hello=input().split(' ')\r\nt=int(hello[0])\r\ns=int(hello[1])\r\nx=int(hello[2])\r\nif(x>=t+s):\r\n if((x-t)% s == 0 or (x-t)%s ==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if(x==t):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t, s, x = map(int, input().split())\r\nprint(\"YES\" if (x - t >= 0 and (x - t) % s == 0) or (x - t - 1 >= 0 and (x - t - 1) % s == 0 and (x - t - 1) // s > 0) else \"NO\")", "t,s,x=map(int,input().split())\nprint('YES' if x==t or x>=s+t and (x-t-s)%s<=1 else 'NO')", "import sys\r\nt, s, x = map(int, input().split())\r\nif x<t:\r\n\tprint(\"NO\")\r\n\tsys.exit()\r\nx = x-t\r\n#if t==4363010:\r\n# print((x-1)%s)\r\nif x%s==0 or (x>s and (x-1)%s==0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n\t", "t, s, x = map(int, input().split() )\nprint('YES' if x==t or (x-t)%s<2 and x-t>=s else 'NO')\n", "a, b, c=map(int, input().split())\n\nkappa = ''\nif c>=a+b:\n\tif (c-a)%b == 0 or (c-a)%b == 1:\n\t\tkappa = 'YES'\n\telse:\n\t\tkappa = 'NO'\nelif c == a:\n\t\tkappa = 'YES'\nelse: kappa = 'NO'\nprint (kappa)\n\n", "t,s,x = map(int, input().split())\r\nif t==x or x-t>=s and (x-t-s)%s<2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nimport string\r\n\r\n\r\ndef main_function():\r\n t, s, x = [int(i) for i in input().split(\" \")]\r\n real_x = x - t\r\n if real_x < 0:\r\n print(\"NO\")\r\n elif real_x == 0:\r\n print(\"YES\")\r\n else:\r\n if real_x % s == 0:\r\n print(\"YES\")\r\n elif real_x % s == 1:\r\n if real_x == 1:\r\n print(\"NO\")\r\n else:\r\n\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nmain_function()", "t,s,x=map(int,input().split())\r\na1=t\r\na2=t+s+1\r\nif ((x - a1) % s == 0 and int((x - a1) / s) >= 0) or ((x - a2) % s == 0 and int((x - a2) / s) >= 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "[t, s, x] = map(int, input().split())\r\nif x<t or x>t and x<t+s:\r\n print(\"NO\")\r\nelif x==t or (x-t)%s ==0 or (x-t)%s==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t,s,x=map(int,input().split())\r\nprint('YNEOS'[x<t or (x-t)%s>1 or x==t+1::2])", "t,s,x=map(int,input().split())\r\nif x>=t and ( 0<= (x-t)%s <=1 ) and x!=t+1 : print(\"YES\")\r\nelse: print(\"NO\")", "import sys\r\ndef get_int(): return int(sys.stdin.readline())\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split(\" \"))\r\ndef get_array(): return [int(x) for x in sys.stdin.readline().strip().split(\" \")]\r\n\r\n\r\ndef get_primes(n):\r\n prime = [True for _ in range(n)]\r\n i = 1\r\n ans = []\r\n while i < n:\r\n if prime[i]: \r\n j = 2\r\n ans.append(i+1)\r\n while True:\r\n index = (i+1)*j - 1\r\n if index < n:\r\n prime[index] = False\r\n else:\r\n break\r\n j += 1\r\n i += 1\r\n return ans\r\n\r\ndef confirm_bs(arr, l, h, k):\r\n m = (l+h)//2\r\n if arr[m] == k:\r\n return m\r\n elif arr[m] < k:\r\n return bs(arr, m+1, h, k)\r\n else:\r\n return bs(arr, l, m-1, k)\r\n\r\ndef solution(t, s, x):\r\n if t == x:\r\n return \"YES\"\r\n if x//(t+s) < 1:\r\n return \"NO\"\r\n\r\n if (x-t)%s == 0 or (x-t-1)%s == 0:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n \r\n\r\nt, s, x = get_ints()\r\nprint(solution(t, s, x))\r\n", "t, s, x = map(int, input().split())\r\n#if t == x:\r\n# print('Yes')\r\n#else:\r\n# ph = t\r\n# while True:\r\n# if ph < x:\r\n# ph += s\r\n# if ph == x:\r\n# print('Yes')\r\n# break\r\n# elif (ph + 1) == x:\r\n# print('Yes')\r\n# break\r\n# else:\r\n# continue\r\n# else:\r\n# print('No')\r\n# break\r\nk = x - t\r\nif k < s and k != 0:\r\n print('No')\r\nelif (k % s == 0) or (k % s == 1):\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "x, y, z = map(int, input().split())\r\nif x == z:\r\n print(\"YES\")\r\nelse:\r\n if (z - x) % y <= 1 and (z - x) // y > 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# Pineapple Incident 697A\r\nt,s,x = map(int,input().split())\r\n# for t,t+s,t+2s,t+ns (are probable x), if t is subtracted from them\r\n# the result is multiple of s (ns) which must be exactly divisible by s\r\nif(x>=t and (x-t)%s==0):\r\n print(\"YES\")\r\n\r\n# for t+s+1, t+2s+1, t+ns+1 (are probable x), if 1 is subtracted from x and then t is subtracted from the resul\r\n# the result is multiple of s (ns) which must be exactly divisible by s\r\nelif((x-1)>t and ((x-1)-t)%s==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "X = list(map(int, input().split()))\r\nif X[2] < X[0]:\r\n print(\"NO\")\r\n exit()\r\nif ((X[2] - X[0]) % X[1] == 0) or ((X[2] - X[0] - 1) // X[1] != 0 and (X[2] - X[0] - 1) % X[1] == 0):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "t, s, x=map(int, input().split())\r\nprint('YES' if x==t or x>=t+s and (x-t-s)%s<=1 else 'NO')", "y=list(map(int, input().split()))\r\nt=y[0]\r\ns=y[1]\r\nx=y[2]\r\nif t==x:\r\n print(\"YES\")\r\nelif t>x:\r\n print(\"NO\")\r\nelif (t+s)>x:\r\n print(\"NO\")\r\nelif (t+s)==x:\r\n print(\"YES\")\r\nelse:\r\n k=(x-t)//s\r\n if (t+k*s)==x or (t+k*s+1)==x:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t,s,x = map(int,input().split())\r\nif x == t or (x >= t+s and (x - t) % s < 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t, s, x = map(int, input().split())\r\nprint(\"YES\" if (x - 1 > t and (x - t) % s < 2) or (x == t) else \"NO\")", "t,s,x=[int(e) for e in input().split()]\r\nx-=t\r\nif x<0:\r\n print(\"NO\")\r\nelif x==0 or (x>=s and (x%s in {0,1})):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t, s, x = map(int, input().split())\r\nprint([\"NO\",\"YES\"][x % s in [t % s,(t+1) % s] and x >= t and x != t+1 ])", "t, s, x = [int(y) for y in input().split(' ')]\r\nif x >= t and (x - t) % s <= 1 and x != t + 1:\r\n ans = 'YES'\r\nelse:\r\n ans = 'NO'\r\nprint(ans)\r\n", "t,s,x=map(int,input().split())\r\nif(x==t):\r\n print(\"YES\")\r\n exit(0)\r\nelse:\r\n if(x>t):\r\n if((x-t)%s==0 and (x-t)/s>=1):\r\n print(\"YES\")\r\n exit(0)\r\n if((x-t-1)%s==0 and (x-t-1)/s>=1):\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n ", "t,s,x=map(int,input().split())\r\nprint('NYOE S'[x>=t and x!=t+1 and x%s in[t%s,(t+1)%s]::2])", "t,s,x = map(int,input().split(' '))\nx=x-t\nif x<s:\n if x==0 :\n print('YES')\n else :\n print('NO')\nelse :\n x=x%s\n if x>1:\n print('NO')\n else :\n print('YES')", "def pineapple(t, s, x):\r\n flag = 0\r\n if x == t:\r\n flag = 1\r\n if x == t + 1:\r\n return \"NO\"\r\n count = x - t\r\n if count < 0:\r\n return \"NO\"\r\n if count % s == 0:\r\n flag = 1\r\n if (count - 1) % s == 0:\r\n flag = 1\r\n if flag:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nT, S, X = [int(i) for i in input().split()]\r\nprint(pineapple(T, S, X))\r\n", "import sys\r\n\r\ninitialTime, skip, goal = map(int, input().split())\r\n\r\nif initialTime == goal:\r\n print(\"YES\")\r\n sys.exit()\r\n\r\nx = goal-initialTime\r\n\r\nif x>=skip:\r\n if x % skip == 0 or x % skip == 1:\r\n print(\"YES\")\r\n sys.exit()\r\n else:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"NO\")\r\n", "tsx = list(map(int, input().split()))\r\nif ((tsx[2] - tsx[0]) % tsx[1] == 0 or (tsx[2] - tsx[0]) % tsx[1] == 1) and (tsx[2] - tsx[0]) // tsx[1] >= 1:\r\n\tprint('YES')\r\nelse:\r\n\tif tsx[2] == tsx[0]:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')", "import sys\r\nt, s, x = tuple(map(int, input().split(' ')))\r\n\r\nif x < t + s:\r\n\tif x == t:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\tsys.exit(0)\r\n\r\nx -= t\r\nif x % s == 0 or x % s == 1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a,b,c=map(int,input().split())\r\nd=(c-a)//b\r\nif a==c or (d>0 and ((c-a)%b==0 or (c-a)%b==1)) :print(\"YES\")\r\nelse:print(\"NO\")", "#!/usr/bin/python3\r\nimport sys\r\n\r\ndef main():\r\n # Read input\r\n t, s, x = sys.stdin.readline().strip().split(\" \")\r\n t = int(t)\r\n s = int(s)\r\n x = int(x)\r\n # Do work\r\n result = \"YES\" if solve(t, s, x) else \"NO\"\r\n # Write result to output \r\n sys.stdout.write(result + '\\n')\r\n\r\ndef solve(t, s, x):\r\n if t == x:\r\n return True\r\n \r\n if x < t + s:\r\n return False\r\n\r\n if (x - t) % s == 0:\r\n return True\r\n\r\n if (x - t - 1) % s == 0:\r\n return True\r\n\r\n return False\r\n\r\nif __name__ == '__main__':\r\n main()", "s=input().split();a=int(s[2])-int(s[0]);print(\"YES\"if a!=1and a>=0 and a%int(s[1])<2else\"NO\");", "t, s, x = map(int, input().split())\r\nif x < t:\r\n print(\"NO\")\r\nelse:\r\n d = x - t\r\n if d % s == 0 or (d - 1) % s == 0 and d > 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a,b,c=map(int,input().split())\r\nif(c>a+1):\r\n if((c-a)%b==0 or (c-a-1)%b==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if(c==a):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t, s, x = [int(i) for i in input().split()]\r\nif x < t:\r\n\tprint(\"NO\")\r\nelif x == t+1:\r\n\tprint(\"NO\")\r\nelif (x - t)%s <= 1:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from typing import List\r\nimport heapq\r\nimport functools\r\nfrom collections import deque\r\nfrom functools import lru_cache\r\nimport collections\r\nimport random\r\nimport itertools\r\nfrom itertools import product as product\r\nfrom itertools import accumulate as accumulate\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\nfrom functools import cmp_to_key\r\n\r\nimport bisect\r\nimport math\r\nimport sys\r\n\r\n'''\r\nxcopy /y D:\\water\\learning\\python\\codeForce.py \r\nline = sys.stdin.readline().strip()\r\nn = int(n)\r\ns= input().strip()\r\nt, v = tuple(map(int, input().strip().split()))\r\n'''\r\nif __name__ == \"__main__\":\r\n\r\n t, s, x = tuple(map(int, input().strip().split()))\r\n Y = \"YES\"\r\n N = 'NO'\r\n if x < t:\r\n print(N)\r\n exit()\r\n m = t % s\r\n n = (t + 1) % s\r\n l = x % s\r\n if m == l or (n == l and x != t + 1):\r\n print(Y)\r\n else:\r\n print(N)\r\n\r\n", "t,s,x=map(int,input().split())\r\nif x-t<0 or ((x-t)%s!=0 and ((x-t-1)%s!=0 or (x-t-1==0 and s!=1))): print(\"NO\")\r\nelse: print(\"YES\")", "k = list(map(int,input().split()))\nt,s,x = k[0],k[1],k[2]\n\np = (x-t)/s+1\nq = (x-t-1-s)/s+1\nif p == int(p) and p>0:\n print(\"YES\")\nelse:\n if q == int(q) and q>0:\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t \t \t \t\t\t\t\t\t \t\t \t\t\t \t \t\t\t\t \t", "t, s, x = map(int, input().split())\r\n\r\nif t % s == x % s and t <= x:\r\n print(\"YES\")\r\nelif (t+1) % s == x % s and t+1<x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "# coding=utf8\r\n\r\nif __name__ == '__main__':\r\n t, s, x = str(input()).split()\r\n t = int(t)\r\n s = int(s)\r\n x = int(x)\r\n if x - s >= t and (x - s - t) % s < 2 or x == t:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "from functools import reduce\r\ndef factors(n):\r\n return set(reduce(list.__add__,\r\n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\r\ndef sol():\r\n t,s,x = list(map(int,input().split()))\r\n if ((x%s == t%s or (x-1)%s == t%s) and x >= t):\r\n if (x == t+1 and s!= 1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nsol()\r\n", "t,s,x=map(int,input().split())\r\nif ((x-t)%s in (0,1) and t+s<=x or t==x) and x!=t+1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t,s,x=map(int,input().split(' '))\r\nif(t==x or ((x-t)%s==0 or (x-t-1)%s==0) and (x-t)//s>0):\r\n print('YES')\r\nelse:\r\n print('NO')", "t , s ,x = map(int,input().split())\r\n\r\nif x == t :\r\n print('YES')\r\n exit()\r\n\r\nelif x < t or x == t + 1 and s != 1:\r\n print('NO')\r\n exit()\r\n\r\nelse:\r\n i = t\r\n while i < x :\r\n i += s\r\n\r\n if i == x or i + 1 == x or (i - s) == x or (i - s) + 1 == x :\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "t,s,x=map(int,input().split())\r\nif t==x or x-t>=s and (x-t)%s<2:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "# # Pineapple Incident\ndef bark(t, s, x):\n if x == t:\n return \"YES\"\n if x > t + 1:\n if (x - t) % s == 0 or (x - t - 1) % s == 0:\n return \"YES\"\n return \"NO\"\n\n\nt, s, x = list(map(int, input().split()))\nprint(bark(t, s, x))\n", "s=input().split();a=int(s[2])-int(s[0]);print(\"NO\"if a==1or a<0 or a%int(s[1])>1else\"YES\");", "t, s, x = map(int, input().split())\r\nct = t\r\n\r\nif ct == x:\r\n print(\"YES\")\r\n exit()\r\n\r\nwhile ct+s <= x:\r\n ct += s\r\n\r\n if 0 <= abs(x-ct) < 2:\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")", "t, s, x = map(int, str.split(input()))\r\nprint(['NO', 'YES'][x == t or x >= t + s and (x - t) % s < 2])", "\r\n\r\nt , s , x = map(int , input().split())\r\nr = 0\r\nwhile t <= x:\r\n if t == x:\r\n r = 1\r\n break\r\n else:\r\n t += s\r\n if t + 1 == x:\r\n r = 1\r\n break\r\n \r\nprint('NO' if r == 0 else 'YES')\r\n \r\n ", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nt,s,x=map(int,input().split())\nprint('YES'if t+s<=x and (x-t)%s<2 or t==x else'NO')\n", "t,s,x = map(int,input().split())\r\nif t-x == 0:\r\n print(\"Yes\")\r\nelif x<t:\r\n print(\"No\")\r\nelse:\r\n x -= t\r\n if x ==1:\r\n print(\"No\")\r\n elif x%s ==0 or (x-1)%s ==0:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n ", "import sys\n\nt, s, x = map(int, sys.stdin.readline().split())\n\nif x == t:\n print('YES')\nelif x < s + t:\n print('NO')\nelif x > t:\n remainder = (x-t)%s \n if remainder<=1:\n print('YES')\n else:\n print('NO')\n\n", "t,s,x=map(int,input().split())\nn1=x-t\nn1/=s\nn2=x-t-1\nn2/=s\nif t+s>x:\n if x==t:\n print(\"YES\")\n else:\n print(\"NO\")\nelif n1==int(n1) or n2==int(n2):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "t,s,x=[int(i) for i in input().split()]\nd=x-t\ne=d%s\nif t<0:\n print(\"NO\")\nelif d<0:\n print(\"NO\")\nelif x==t+1:\n print(\"NO\")\nelif e in [0,1]:\n print (\"YES\")\nelse:\n print(\"NO\")\n\n \t\t \t \t \t\t \t\t \t\t\t\t\t \t\t", "t,s,x = list(map(int,input().split()))\r\nif x < t:\r\n print('NO')\r\nelif ((x-t)%s == 0) or ((((x-t-1)%s) == 0) and x - 1 != t) or x == t:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t,s,x=map(int,input().split())\r\ny=x-t\r\nif y<0 or y==1:\r\n print('NO')\r\nelse:\r\n if y%s==0 or y%s==1:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\nt, s, x = map(int, sys.stdin.readline().split())\nif x < t:\n print('NO')\nelif (x-t)%s == 0:\n print('YES')\nelif x < t+s:\n print('NO')\nelif (x-t-s)%s == 1:\n print('YES')\nelse:\n print('NO')\n", "t, s, x = map(int, input().split())\nif (t <= x and (x - t) % s == 0) or (t + s + 1 <= x and (x - t) % s == 1):\n print(\"YES\")\nelse:\n print(\"NO\")", "t,s,x=map(int,input().split())\r\nif x==t:\r\n print(\"YES\")\r\nelif ((x-t)%s)==0 and (x-t)>0 :\r\n print(\"YES\")\r\nelif ((x-t-1)%s)==0 and (x-t-1)>0 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t,s,x=map(int,input().split())\r\nif(x<t):\r\n print(\"NO\")\r\nelse:\r\n x-=t\r\n if(x==0):\r\n print(\"YES\")\r\n elif(x<s):\r\n print(\"NO\")\r\n elif(x%s==0 or x%s==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom collections import *\r\n#from fractions import *\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom io import BytesIO, IOBase\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value(): return tuple(map(int, input().split())) # multiple values\r\ndef arr(): return [int(i) for i in input().split()] # array input\r\ndef sarr(): return [int(i) for i in input()] #array from string\r\ndef starr(): return [str(x) for x in input().split()] #string array\r\ndef inn(): return int(input()) # integer input\r\ndef svalue(): return tuple(map(str, input().split())) #multiple string values\r\ndef parr(): return [(value()) for i in range(n)] # array of pairs\r\nmo = 1000000007\r\ninf=1e18\r\ndiv=998244353\r\n# ----------------------------CODE------------------------------#\r\nt,s,x=value()\r\nans=\"NO\"\r\nif(x==t or ((x-t)//s>0 and (x-t)%s==0) or ((x-t-1)//s>0 and (x-t-1)%s==0)):\r\n ans=\"YES\"\r\nprint(ans)\r\n", "A, C, B = map(int, input().split())\r\n\r\nif A == B:\r\n print(\"YES\")\r\nelse:\r\n if (B - A) % C <= 1 and (B - A) // C > 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t, s, x = map(int, input().strip().split())\ns1, s2 = (x-t)/s, (x-t-1)/s \nif (s1 == int(s1) and s1 >= 0) or (s2 == int(s2) and s2 >= 1):\n\tprint('YES')\nelse:\n\tprint('NO')", "t,s,x=[int(i) for i in input(\"\").split()]\nif (x-t) % s==0 and x >=t:\n print(\"YES\")\nelif (x-t-s-1) % s==0 and x >=t+s+1:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "yo=list(map(int,input().split()))\nt=yo[0]\ns=yo[1]\nx=yo[2]\n\n# if x<t+s:\n# \tif (x-t)%s==0 :\n# \t\tprint(\"YES\")\n# \telse:\n# \t\tprint(\"NO\")\t\t\n# else:\n# \tif (x-t)%s==0 or (x-t-1)%s==0:\n# \t\tprint(\"YES\")\n# \telse:\n# \t\tprint(\"NO\")\t\n\n\nif (x==t) or ((x-t)%s==0 and (x-t)/s>0) or ((x-t-1)%s==0 and (x-t-1)/s>0):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\t\n", "input_string = input()\r\n\r\ndef calculate(t, s, x):\r\n if pineapple_is_barks(t, s, x) == True:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\ndef pineapple_is_barks(t, s, x):\r\n i = int(((x-t) // s) * 2)\r\n if i < 1:\r\n return t == x\r\n if calculate_time_of_iteration(t, s, i) == x:\r\n return True\r\n elif calculate_time_of_iteration(t, s, i) + 1 == x:\r\n return True\r\n return False\r\n\r\ndef calculate_time_of_iteration(t, s, i):\r\n if i == 1:\r\n return t\r\n return t + (s * (i // 2)) + (i % 2)\r\n\r\nt, s, x = input_string.split(' ')\r\n\r\nt = int(t)\r\ns = int(s)\r\nx = int(x)\r\n\r\ncalculate(t, s, x)", "t,s,x=map(int,input().split())\r\nif(x<t):\r\n print(\"NO\")\r\nelif(x==t):\r\n print(\"YES\")\r\nelif(x<t+s):\r\n print(\"NO\")\r\nelse:\r\n if((x-t)%s==0 or (x-t-1)%s==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def will_bark(t, s, x):\r\n if x < t + s:\r\n return x == t\r\n return (x - t) % s == 0 or (x - t - 1) % s == 0 and x - t - 1 >= s\r\n\r\nt, s, x = map(int, input().split())\r\nprint(\"YES\" if will_bark(t, s, x) else \"NO\")\r\n", "from sys import stdin\r\nt,s,x = map(int,stdin.readline().split())\r\nres = t+s+1\r\nif(t == x or t+s == x or t+s+1 == x):\r\n print(\"YES\")\r\nelif(t == 0 and s == 0 and x == 2):\r\n print(\"NO\")\r\nelse:\r\n if(x < t+s+1):\r\n print(\"NO\")\r\n else:\r\n if((x -(t+s+1)) % s == 0):\r\n print(\"YES\")\r\n else:\r\n a = (x -(t+s+1) )% s\r\n if(s-a == 1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t,s,x=(int(i) for i in input().split())\r\nans=\"NO\"\r\nif x<t:\r\n ans=\"NO\"\r\nelif x==t+1:\r\n ans=\"NO\"\r\nelif (x-t)%s==0 or (x-t)%s==1:\r\n ans=\"YES\"\r\nelse:\r\n ans=\"NO\"\r\n \r\nprint(ans)", "data = input().split()\nt = int(data[0])\ns = int(data[1])\nx = int(data[2])\n\nif x == t:\n print(\"YES\")\nelif ((x-t)/s)%1==0 and x-t > 0:\n print(\"YES\")\nelif ((x-t-1)/s)%1==0 and x-t-1 > 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n", "#!/usr/bin/env python3\n\ndef barking(t, s, x):\n if x < t:\n return False\n x -= t\n if x % s == 0:\n return True\n if x > 1 and x % s == 1:\n return True\n return False\n\n\nif __name__ == '__main__':\n t, s, x = map(int, input().split())\n print('YES' if barking(t, s, x) else 'NO')\n", "(start, interval, eattime) = (int(_) for _ in input().split())\nif (eattime == start) or ((eattime >= start + interval) and \n ((eattime - start) % interval <= 1)):\n print('YES')\nelse:\n print('NO')\n", "t,s,x = map(int,input().split())\r\nif x < t :\r\n print(\"NO\")\r\nelif t == x:\r\n print(\"YES\")\r\nelif x == t+1 :\r\n print(\"NO\")\r\nelif (x - t) % s == 0 or (x - t-1) % s == 0:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n \r\n", "def main():\r\n\t(t, s, x) = (int(x) for x in input().split())\r\n\tprint(solver(t, s, x))\r\n\t\r\ndef solver(t, s, x):\r\n\tmod1 = t % s\r\n\tmod2 = (t + 1) % s\r\n\ttest = x % s\r\n\tif x < t or x == t + 1 or \\\r\n\ttest not in (mod1, mod2):\r\n\t\treturn \"NO\"\r\n\telse:\r\n\t\treturn \"YES\"\r\n\t\r\n# print(solver(3, 10, 4))\r\n# print(solver(3, 10, 3))\r\n# print(solver(3, 8, 51))\r\n# print(solver(3, 8, 52))\r\n\r\nmain()", "t,s,x=map(int,input().split())\r\nif x<t:\r\n\tprint(\"NO\")\r\nelif x==t:\r\n\tprint(\"YES\")\r\nelif x==t+1:\r\n\tprint(\"NO\")\r\nelif ((x-t)/s)==((x-t)//s) or ((x-t-1)/s)==((x-t-1)//s):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\") ", "x,y,z = map (int,input().split())\r\nif(z < x or x< z < x+y):\r\n print('NO')\r\nelse:\r\n if((z-x) % y == 0 or (z-x) % y == 1):\r\n print('YES')\r\n else:\r\n print('NO')", "t,s,x=map(int,input().split())\r\nif x==t:print('YES')\r\nelif s+t<=x and (x-t-s)%s<= 1:print('YES')\r\nelse:print('NO')", "t,s,x = map(int, input().split(\" \"))\r\nres = x-t\r\nif res < 0:\r\n print(\"NO\")\r\nelse:\r\n if res % s == 0 or ((res-1) % s) == 0:\r\n if res != 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\n", "def main():\r\n\r\n def solve(t, s, x):\r\n if x < t:\r\n return \"NO\"\r\n elif (x - t) % s in [0, 1] and x != t + 1:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n t, s, x = [int(x) for x in input().split()]\r\n print(solve(t, s, x))\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()", "[t,s,x] = map(int, input().split())\r\n\r\ny = (x-t)//s \r\nif y < 0:\r\n print('NO')\r\nelif (t+s*y == x) or (t+s*y+1 == x and y>0):\r\n print('YES')\r\nelse:\r\n print('NO')", "t,s,x=map(int,input().split())\r\nif(x==t):\r\n print(\"YES\")\r\nelif(x-t >1):\r\n if((x-t)%s==0 or (x-t-1)%s==0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n", "t, s, x = map(int, input().split())\r\nif x>=t:\r\n x -= t\r\n sss = x//s\r\n x = x%s\r\n if x == 0 or (sss != 0 and x == 1):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n \r\n", "import math as mt\nimport sys, string\nfrom collections import Counter, defaultdict\ninput = sys.stdin.readline\n\n# input functions\nI = lambda : int(input())\nM = lambda : map(int, input().split())\nARR = lambda: list(map(int, input().split()))\n\ndef printARR(arr):\n for e in arr:\n print(e, end=\" \")\n print()\n\ndef main():\n t, s, x = M()\n tmp = x - t\n if x == t + 1:\n print(\"NO\")\n return\n if tmp < 0:\n print(\"NO\")\n return\n if tmp == 0:\n print(\"YES\")\n return\n if tmp % s == 0 or (tmp - 1) % s == 0:\n print(\"YES\")\n return\n else:\n print(\"NO\")\n\ntc = 1\n# tc = I()\nfor _ in range(tc):\n main()", "# print (\"Input t, s, and x\")\nt,s,x = (int(y) for y in input().split())\n\nif x < t:\n print (\"NO\")\nelif x == t:\n print (\"YES\")\nelif x == t+1:\n print (\"NO\") \nelse:\n x -= t\n if x%s == 0 or x%s == 1:\n print (\"YES\")\n else:\n print (\"NO\")\n", "#93647 7 451664565\r\ndef main():\r\n t,s,x = map(int,input().split())\r\n if t==x:\r\n return \"YES\"\r\n roger = (x-t)/s\r\n roger2 = (x-(t+1))/s\r\n if (roger%1 ==0 or roger2%1==0) and (roger>=1 or roger2>=1) :\r\n return(\"YES\")\r\n else:\r\n return(\"NO\")\r\nprint(main())\r\n ", "import math\r\nt,s,x=[int(x) for x in input().split()]\r\na=(x-t)/s\r\nb=(x-t-1)/s\r\nif(x==t):\r\n print(\"YES\")\r\nelse:\r\n if(a>0 and b>0 and (math.ceil(a)==math.floor(a) or math.ceil(b)==math.floor(b))):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t,s,x=map(int,input().split())\r\nif x == t or (x>=t+s and ((x-t)%s==0 or(x-t)%s==1)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "t,s,x = input().split()\nt,s,x = int(t),int(s),int(x)\na = x -t \nif a >= s:\n if a%s == 0 or (a-1)%s == 0:\n print('YES')\n else:\n print('NO')\nelse:\n if a == 0:\n print('YES')\n else:\n print('NO')", "a,b,c = map(int,input().split())\r\nif a==c or(((c-a)%b<2) and (c-a >=b)) :\r\n print('YES')\r\nelse :\r\n print('NO')", "t,s,x = map(int,input().split())\r\nif x-t>1:\r\n if (x-t)%s==0 or (x-t-1)%s==0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif x-t==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "from math import ceil\r\nt,s,x=map(int,input().split())\r\ny=(x-t)/s\r\nz=(x-t-1)/s\r\nif ((y>=0 and int(y)==ceil(y))\r\n\tor (z>0 and int(z)==ceil(z))):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from math import ceil\nInput=lambda:map(int,input().split())\n\nl = list(Input())\nif l[0] == l[2]:\n print(\"YES\")\n exit()\n\ni = (l[2] - l[0])/l[1]\nj = (l[2] - l[0]-1)/l[1]\nif (i > 0 and ceil(i) == i) or (j > 0 and ceil(j) == j):\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "t,s,x = map(int,input().split())\r\n\r\nk2 = (x-t-1)/s\r\nk = (x-t)/s\r\n\r\nif x == t:\r\n print(\"YES\")\r\nelif x < t or k2 == 0:\r\n print(\"NO\")\r\nelif k2%1== 0 or k%1 == 0:\r\n\tprint(\"YES\")\r\nelif k.is_integer() == False or k2.is_integer== False:\r\n print(\"NO\")\r\n \r\n\r\n\r\n", "t, s, x = map(int, input().split())\r\nif x >= t and (t == x or (x - t)%s == 0 or (x - t - 1)%s == 0 and x >= t + s + 1):\r\n answer = \"YES\"\r\nelse:\r\n answer = \"NO\"\r\nprint(answer)\r\n", "t,s,x = map(int,input().split())\r\nif ((x-t)%s==0 and (x-t)/s+1>0) or ((x-t-s-1)%s==0 and (x-t-s-1)/s+1>0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t,s,x = list(map(int,input().split()))\r\nif(x-t>1000) :\r\n if((x-t)%s==0 or (x-t-1)%s==0):\r\n print('YES')\r\n else :\r\n print('NO')\r\nelse :\r\n a = [t]\r\n i = 1;k = 0\r\n while(t+i*s<=x):\r\n k = t+i*s\r\n a.append(k)\r\n a.append(k+1)\r\n i += 1\r\n #print(a)\r\n if x in a :\r\n print('YES')\r\n else :\r\n print('NO')\r\n\r\n \r\n ", "import math\r\ninp=input().split()\r\n#ans1=(int(inp[2])-int(inp[0])-1)%int(inp[1])\r\na=int(inp[0])\r\nb=int(inp[1])\r\nc=int(inp[2])\r\nif (a==c):\r\n print(\"YES\\n\")\r\nelif(c-b<a):\r\n print(\"NO\\n\")\r\nelse:\r\n if ((c-a)%b==0 or (c-a)%b==1):\r\n print(\"YES\\n\")\r\n else:\r\n print(\"NO\\n\")\r\n\r\n", "if __name__ == '__main__':\r\n user_input = input().split()\r\n t, s, x = int(user_input[0]), int(user_input[1]), int(user_input[2])\r\n if x == t or (x >= t + s and (x % s == (t + s) % s or x % s == (t + s + 1) % s)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t, s, x = map(int, input().split())\r\nif x >= t and (t - x) % s == 0:\r\n print(\"YES\")\r\n exit()\r\nx -= 1\r\nif x > t and (t - x) % s == 0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "from math import modf\r\nt, s, x = (int(x) for x in input().split())\r\nif x == t:\r\n\tprint('Yes')\r\nelse:\r\n\tvar1 = (x - t)/s\r\n\tvar2 = (x - t - 1)/s\r\n\tif modf(var1)[0] == 0 and var1 > 0:\r\n\t\tprint('Yes')\r\n\telif modf(var2)[0] == 0 and var2 > 0:\r\n\t\tprint('Yes')\r\n\telse:\r\n\t\tprint('No')", "t, s, x = map(int, input().split())\r\nprint('YES' if x - t >= 0 and x - t != 1 and (x - t) % s <= 1 else 'NO')", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[t, s, x] = list(map(int, input().split()));\r\n\r\nif x < t:\r\n print('NO')\r\n exit(0)\r\n\r\nd = int((x-t)/s)\r\nr = (x-t)%s\r\nif (d > 0 and (r == 0 or r == 1)) or \\\r\n (d == 0 and r == 0):\r\n print('YES')\r\nelse:\r\n print('NO')", "t,s,x = map(int,input().split())\r\nif x >= t :\r\n if t+s<=x:\r\n y1 = (x - t) / s\r\n y2 = (x - t - 1) / s\r\n if int(y1) == y1:\r\n print('YES')\r\n elif int(y2) == y2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n elif x == t:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "t,s,x = map(int,input().split())\na1=t+s\na2=a1+1\nflag =0\nif t==x:\n flag =1\nelif x>=a1 or x>=a2:\n if (x-a1)%s==0 or (x-a2)%s==0:\n flag=1\n\nif flag:\n print(\"YES\")\n\nelse:\n print(\"NO\")\n", "t,s,x = list(map(int, input().split()))\r\n\r\nif t == x:\r\n print(\"YES\")\r\n exit()\r\nif x < s + t:\r\n print(\"NO\")\r\n exit()\r\nif (x-t)%s == 0 or (x-t-1)%s == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t,s,x=map(int,input().split())\r\n\r\nif x<s+t:\r\n if x==t:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n if (x-t)%s<=1:\r\n print('YES')\r\n else:\r\n print('NO') ", "t,s,x=map(int,input().split())\r\nq=(x-t)\r\nif q%s in (0,1) and q>=s or q==0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a, b, c = list(map(int, input().split()))\r\nif a == c:\r\n print(\"YES\")\r\nelse:\r\n if (c - a) % b <= 1 and (c - a) // b > 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t, s, x = map(int, input().split(\" \"))\nif x == t:\n print(\"YES\")\nelif x-t-s >= 0 and (x-t-s)%s < 2:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "t,s,k = map(int, input().split())\r\nif k<t or k-t==1:\r\n print(\"NO\")\r\nelif k==t:\r\n print(\"YES\")\r\nelse:\r\n k -= t\r\n print(\"YES\" if (k%s==0 or k%s==1) else \"NO\")\r\n", "t,s,x = [int(n) for n in input().split()]\nr = (x-t)%s\nif x<t:\n print(\"NO\")\nelif r == 0 or r ==1 and x != t+1:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t\t\t\t \t\t\t \t \t", "t,s,x=map(int,input().split())\r\na=(x-t)%s\r\nif(t<=x and (a==0 or a==1) and x!=t+1):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "for _ in range(1):\r\n t,s,x=map(int,input().split())\r\n if x==t:\r\n print('YES')\r\n elif(x<(t+s)):\r\n print('NO')\r\n else:\r\n r=(x-t)%s\r\n if(r==0 or r==1):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "\nfrom collections import Counter\ndef si():\n\treturn str(input())\ndef ii():\n return int(input())\ndef mi():\n return map(int, input().split())\ndef li():\n return list(mi())\n\nt,s,x=mi()\na=t+s\nb=t+s+1\nif a>x:\n\tif x==t:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\nelse:\n\tif (x-a)%s==0 or (x-b)%s==0:\n\t\tprint('YES')\n\telse:\n\t\tprint('NO')\n\n", "import math\r\n\r\nt,s,x=map(int,input().split())\r\n\r\nif x==t:\r\n print(\"YES\")\r\nelse:\r\n if x%s in [t%s, (t+1)%s] and x>=t+s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t,s,x=map(int, input().split())\r\n\r\nif x < t:\r\n print(\"NO\")\r\nelif (x - t) % s == 0 or (x - t - 1) % s == 0 and x != t + 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t,s,x = map(int, input().split())\n\nif s == 1:\n\tprint(\"YES\")\nelse:\n\tif x < t:\n\t\tprint(\"NO\")\n\telif (x-t)%s == 0:\n\t\tprint(\"YES\")\n\telif (x-t-1)%s == 0 and x-t-1 != 0:\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")", "t, s, x = [int(c) for c in input().split()]\r\n\r\nif x - t == 1 and s != 1:\r\n print('NO')\r\n exit()\r\n\r\nif (x - t) % s == 0 and x >= t:\r\n print('YES')\r\n exit()\r\n\r\nif (x - t - 1) % s == 0 and x > t + 1:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "t,s,x=map(int,input().split())\r\ndef pineapple_incident(t,s,x):\r\n if x==t:\r\n return(\"YES\")\r\n elif x< t+s:\r\n return(\"NO\")\r\n else:\r\n k=(x-t)%s\r\n if k<=1:\r\n return(\"YES\")\r\n else:\r\n return (\"NO\")\r\n\r\n\r\nprint(pineapple_incident(t,s,x))", "t,s,x = map(int,input().split())\r\n\r\nif (x < t or x == t + 1): check = False\r\nelif (x == t): check = True\r\nelif ((x-t) % s == 0 or (x-t-1) % s == 0): check = True\r\nelse: check = False\r\n\r\nprint(['NO','YES'][check])", "t,x,s=map(int,input().split())\r\nk=int ((s-t)/x)\r\nif t+k*x == s and k>-1:\r\n print(\"YES\")\r\nelif k >0 and (t+k*x)+1 == s :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "[t, s, x] = list(map(int, input().split(\" \")))\nprint(\"YES\" if x == t or (x >= t+s and (x-t)%s <= 1) else \"NO\")\n", "t, s, x = input().split(\" \")\nt = int(t)\ns = int(s)\nx = int(x)\ntemp = x - t\nif(t == x):\n\tprint(\"YES\")\nelif(x < t):\n\tprint(\"NO\")\nelif(x == t+1):\n\tprint(\"NO\")\nelif(temp % s == 0 or temp % s == 1):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t \t\t\t \t \t\t\t\t\t \t\t \t \t\t\t \t", "import sys\r\narr = list(map(int,input().split()))\r\nt = arr[0]\r\ns = arr[1]\r\nx = arr[2]\r\nif x == t or ((x - t)%s == 0 and x >= t+s ) or ((x - t - 1)%s == 0 and x >= t+s+1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n", "t, s, x = map(int, input().split())\r\n\r\nq, r = divmod(x - t, s)\r\n\r\nprint(('NO', 'YES')[q == 0 and r == 0 or q > 0 and r <= 1])\r\n", "t,s,x = map(int,input().split())\r\nif x==t or (x>=t+s and (x-t)%s<=1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x,y,z=map(int,input(\"\").split())\r\nt=z-x\r\nif(x==z):\r\n print(\"YES\")\r\nelif(z<x)or (x<z<(y+x)) or ((t%y!=0) and (t%y!=1)):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "t, s, x = map(int, input().split())\r\n\r\nif x == t or (x-t >= s and (x-t) % s < 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n#########################################\r\n## ##\r\n## Implemented by brownfox2k6 ##\r\n## ##\r\n#########################################\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/697/A\r\n\r\nt, s, x = map(int, input().split())\r\n\r\nif t == x:\r\n print(\"YES\")\r\nelse:\r\n if (x - t) % s <= 1 and (x - t) // s > 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t,s,x=map(int,input().split())\nprint(['NO','YES'][x==t or x>=t+s and (x-t)%s<2])\n", "t,s,x=map(int,input().split())\r\np=int(x-t)\r\nif t==x:\r\n print(\"YES\")\r\nelif (p/s)<1:\r\n print(\"NO\")\r\nelse:\r\n if p%s==1 or p%s==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t, s, x = input().split()\r\nt, s, x = int(t), int(s), int(x)\r\n\r\ni = (x-t)/s\r\n\r\ndef belongs(i):\r\n if float(int(i)) == i and i >= 1:\r\n return True\r\n return False\r\n\r\nif x == t:\r\n print('YES')\r\nelse:\r\n if belongs(i):\r\n print('YES')\r\n else:\r\n i = (x-t-1)/s\r\n if belongs(i):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "t,s,x=map(int,input().split())\r\nif (x>t+1 and((x-t)%s==0 or (x-t-1)%s==0)) or x==t:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "t, s, x = map(int, input().split())\r\nif x == t or x >= t + s and (x - t) % s in (0, 1):\r\n print('YES')\r\nelse:\r\n print('NO')", "t, s, x = map(int, input().split())\r\nx -= t\r\n\r\nif x == 0 or (x >= s and (x % s == 0 or x % s == 1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nfrom itertools import permutations\r\n\r\nimport bisect\r\n\r\nt,s,x=R()\r\n\r\nif (x>=t and (x-t)%s==0) or (x>=t+s+1 and (x-t-1)%s==0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "t, s, x = list(map(int, input().split()))\nif x >= t and (0 <= (x - t) % s <= 1) and x != t + 1:\n print(\"YES\")\nelse:\n print(\"NO\")", "#n = int(input()) \nn, m, x = map(int, input().split())\n#s = input()\n#c = list(map(int, input().split()))\nif (x < n) or (x-1 ==n) or (x!=n and (x - n) % m != 0 and (x - n - 1) % m != 0):\n print('NO')\nelse:\n print('YES')", "#900\n\nsize = [int(i) for i in input().split(\" \")]\nt=size[0]\ns=size[1]\nx=size[2]\n\nif x<t or t<x<t+s:\n print(\"No\")\nelif (x-t)%(s)==0 or (x-t)%(s)==1:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "t,s,x=map(int,input().split())\nif x<t or x==t+1:\n print(\"NO\")\n quit()\nx-=t\nprint(\"YES\" if x%s==0 or (x-1)%s==0 else 'NO')", "t, s, x = tuple((int(x) for x in input().split(' ')))\r\nif x < t:\r\n print('NO')\r\nelse:\r\n if (x - t)%s == 0 or ((x - 1 - t)%s == 0 and x != t + 1):\r\n print('YES')\r\n else:\r\n print('NO')", "t,s,x = list(map(int,input().split()))\r\ndxt = x-t\r\nif dxt==0:\r\n\tprint(\"YES\")\r\nelif dxt<0 or dxt-1==0:\r\n\tprint(\"NO\")\r\nelse: \r\n\tif dxt%s==0 or (dxt-1)%s==0:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "'''\nx = t + ns (n => 0)\nx = t + ns + 1 (n >= 1)\n'''\n\nt, s, x = map(int, input().split())\n\nif t > x:\n print(\"NO\")\nelif (x - t) % s == 0:\n print(\"YES\")\nelif (x - t - 1) != 0 and (x - t - 1) % s == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "t,s,x = map(int, input().split())\r\ntmp = x-t\r\nif tmp<0:\r\n print('NO')\r\nelse:\r\n if tmp==0:\r\n print('YES')\r\n elif (tmp%s==0 or tmp%s==1) and tmp>=s:\r\n print('YES')\r\n else:\r\n print('NO')", "t, x, s = map(int, input().split())\r\nres = \"NO\"\r\nif s == t or (s >= x + t and (s - t) % x <= 1):\r\n res = \"YES\"\r\nprint(res)\r\n", "t, s, x = map(int, input().split())\r\nc1 = x - t - 1 - s\r\nc2 = x - t\r\nif (c1%s==0 and c1 >= 0) or (c2%s==0 and c2 >= 0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "vals = list(map(int, input().split()))\r\nstart = vals[0]\r\ninterval = vals[1]\r\ntime = vals[2]\r\nif time == start:\r\n print(\"YES\")\r\nelif time < interval + start:\r\n print(\"NO\")\r\nelse:\r\n diff = time - start\r\n if diff % interval == 0 or diff % interval == 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t, s, x = map(int, input().split())\nif ((x - t) % s == 0 or (x - t) % s == 1) and x - t >= 0 and x - t != 1:\n\tprint('YES')\nelse:\n\tprint('NO')", "def main():\n t, s, x = map(int, input().split())\n print((\"NO\", \"YES\")[x == t or x >= t + s and (x - t) % s < 2])\n\n\nif __name__ == '__main__':\n main()\n", "n,s,x = list(map(int,input().split()))\r\na = x - n\r\nb = x-(n+1)\r\nif n == x:\r\n\tprint(\"yes\")\r\nelif n > x:\r\n\tprint(\"no\")\r\nelif x < s:\r\n\tprint(\"no\")\r\nelif (n+s) > x:\r\n\tprint(\"no\")\r\nelif a % s == 0 or b % s == 0:\r\n\tprint(\"yes\")\r\nelse:\r\n\tprint(\"no\")", "a,b,c=list(map(int,input().split()))\r\nif (a==c):\r\n print(\"YES\")\r\nelif c>=a+b and ((c-a)%b==1 or (c-a)%b==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\nt, s, x = map(int, input().split())\r\n\r\nif x == t:\r\n print(\"YES\")\r\nelif x < t + s:\r\n print(\"NO\")\r\nelse:\r\n n = math.ceil((x - t - 1) / s)\r\n d = t + n * s + 1\r\n if d == x or x == d - 1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t, s, x = map(int, input().split())\r\nprint('YES' if x == t or x >= t + s and (x - t - s) % s <= 1 else 'NO')", "t, s, x = (int(i) for i in input().split())\nres = \"YES\" if x == t or (x >= s + t and 0 <= (x - t) % s <= 1) else \"NO\"\nprint(res)\n", "a,b,c=map(int,input().split())\r\nif c<a:print('NO')\r\nelif (not(c-a)%b)or(not((c-a-1)%b) and c>a+1):print('YES')\r\nelse:print('NO')\r\n", "t,s,x = list(map(int,input().split()))\r\nz=\"NO\"\r\ny=\"YES\"\r\na=1\r\nif x<t:\r\n a=z\r\nelif x==t:\r\n a=y\r\nelse:\r\n if x==t+1:\r\n if s>1:\r\n a=z\r\n else:\r\n a=y\r\n elif (x-t)%s==0 or (x-t-1)%s==0:\r\n a=y\r\n else:\r\n a=z\r\nprint(a)", "t, s, x = map(int, input().split())\r\ntime = ((x - t)//s)*s\r\nif x < t or (x - t) == 1:\r\n print(\"NO\")\r\nelif (x - t)%s in [0, 1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t,s,x=map(int,input().split())\r\nif x-t==0: \r\n print(\"YES\")\r\nelif x<t:\r\n print(\"NO\")\r\nelse:\r\n x=x-t\r\n if x==1: \r\n print(\"NO\")\r\n elif x%s==0 or (x-1)%s==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "t, s, x = [int(x) for x in input().split()]\r\n\r\nif t + s <= x:\r\n x = (x-t) % s\r\n print([\"NO\",\"YES\"][x==0 or x==1])\r\nelse:\r\n print([\"NO\",\"YES\"][x==t])", "a,b,c=map(int,input().split())\nif c<a:\n print(\"No\")\nelse:\n if (c-a)%b==0:\n print(\"Yes\")\n elif (c-a)%b==1:\n if c<(a+b):\n print(\"No\")\n else:\n print(\"Yes\")\n else:\n print(\"No\")\n\t \t\t \t \t \t\t\t \t \t \t \t \t\t", "t, s, x = list(map(int, input().split()))\nif x < t:\n print(\"NO\")\nelif x == t:\n print(\"YES\")\nelse:\n if (x-t)//s >= 1 and (x-t)%s in [0, 1]:\n print(\"YES\")\n else:\n print(\"NO\")\n", "# Name : Sachdev Hitesh\r\n# College : GLSICA\r\n\r\nt,s,x=map(int,input().split())\r\nprint(('NO','YES')[x==t or x>=t+s and (x-t)%s<2])", "t, s, x = map(int,input().split())\n\ncase1 = (x-t)%s == 0\ncase2 = (x-t-1)%s == 0\ncase3 = (x-t) >= s\n\nif (case1 or case2) and case3 :\n print(\"YES\")\n\nelif x == t :\n print(\"YES\")\n\nelse : \n print(\"NO\")\n \n\n\n ", "t,s,x=[int(i) for i in input().split()]\r\nif x-t<0:\r\n print('NO')\r\nelif x==t:\r\n print('YES')\r\nelif x-t<s:\r\n print('NO')\r\nelif (x-t)%s==0 or (x-t)%s==1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/env python3\r\nt, s, x = map(int,input().split())\r\nans = False\r\nif x == t:\r\n ans = True\r\nelif x >= t+s and (x - t) % s == 0:\r\n ans = True\r\nelif x >= t+s and (x - t) % s == 1:\r\n ans = True\r\nprint(ans and 'YES' or 'NO')", "t, s, x = map(int,input().split())\r\na=x-t\r\nif x == t or a % s < 2 and a >= s:\r\n print (\"yes\")\r\nelse:\r\n print (\"no\")", "#!/usr/bin/python3.4\r\n\r\nt, s, x = map(int, input().split())\r\n\r\nif x >= t + s:\r\n\tprint([\"NO\", \"YES\"][(x - t) % s in [0, 1]])\r\nelse:\r\n\tprint([\"NO\", \"YES\"][x == t])\r\n", "#in the name of god\r\n#Mr_Rubick\r\nt,s,x=map(int,input().split())\r\nx-=t\r\nif x==0 or (x>=s and (x%s==0 or x%s==1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "t,s,x = input().split()\r\nt,s,x = int(t), int(s), int(x)\r\n\r\nif x-t == 0:\r\n print(\"YES\")\r\nelif x-t >= s and (x-t)%s <= 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "t, s, x = list(map(int, input().split()))\r\nif ((x - t) % s == 0 and (x - t) // s >= 0):\r\n print(\"YES\")\r\nelif ((x - t - 1) % s == 0 and (x - t - 1) // s >= 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "ss = input().split()\r\nt = int(ss[0])\r\ns = int(ss[1])\r\nx = int(ss[2])\r\ntt = x - t\r\nif (((tt % s == 0) or (tt % s == 1)) and (tt >= 0) and (tt != 1)) : print('YES')\r\nelse : print('NO')", "t,s,x=map(int,input().split())\r\nif x<t:\r\n print (\"NO\")\r\nelse:\r\n x-=t\r\n if x==0:\r\n print(\"YES\")\r\n else:\r\n if x<s:\r\n print(\"NO\")\r\n else:\r\n z = x % s\r\n if z<2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n" ]

[ "s=('00'+input())[::-1];pre=c=0;z=[]\r\nfor i in range(len(s)-1):\r\n if pre^int(s[i]):c+=1;pre=int(s[i+1]);z+=[['+','-'][pre]+'2^'+str(i)]\r\nP=print;P(c);P('\\n'.join(z))" ]

[ "from math import *\r\nfrom collections import *\r\nimport sys\r\nsys.setrecursionlimit(10**9)\r\nl = [2**i-1 for i in range(40)]\r\nx,d = map(int,input().split())\r\na = []\r\nct = 1\r\nwhile(x != 0):\r\n\tfor i in range(39):\r\n\t\tif l[i+1] > x:\r\n\t\t\tind = i\r\n\t\t\tbreak\r\n\tx -= l[ind]\r\n\tfor i in range(ind):\r\n\t\ta.append(ct)\r\n\tct += d\r\nprint(len(a))\r\nfor i in a:\r\n\tprint(i,end = \" \")", "from math import log2\r\n\r\nx, d = map(int, input().split())\r\n\r\nn = 0\r\narr = []\r\nv = 1\r\n\r\nwhile x > 0:\r\n t = int(log2(x + 1))\r\n arr += [v] * t\r\n n += t\r\n x -= 2 ** t - 1\r\n v += d\r\n\r\nprint(n)\r\nfor i in arr:\r\n print(i, end = ' ')", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Mar 5 12:24:14 2023\r\n\r\n@author: manisarthak\r\n\"\"\"\r\n \r\nimport math\r\ndef solve():\r\n [x, d] = list(map(int, input().split()))\r\n curr = 1\r\n arr = []\r\n while (x > 0):\r\n v = int(math.log(x+1, 2))\r\n arr += [curr]*v\r\n curr += 1+d\r\n x -= (2**v ) - 1\r\n if len(arr) <= 10**4:\r\n print(len(arr))\r\n print(*arr)\r\n else:\r\n print(-1)\r\n \r\n \r\n \r\nsolve()", "from math import log\nfrom math import floor\n\n\ndef main():\n X, d = map(int, input().split())\n n = 0\n l = []\n v = 1\n while X > 0:\n m = floor(log((X+1), 2))\n l += [v] * m\n n += m\n v += d\n X -= (2**m - 1)\n\n print(n)\n print(' '.join([str(x) for x in l]))\n\n\nif __name__ == '__main__':\n main()", "x,d=map(int,input().split())\nc=1\nr=\"\\n\"\ne=29\nb=2**e-1\nwhile x:\n while x<b:e-=1;b>>=1\n r+=f\"{c*d} \"*e;c+=e;x-=b\nprint(c-1,r)", "p=[1]\r\n\r\ndef powers_():\r\n global p\r\n for i in range(1,31):\r\n p.append(p[i-1]*2)\r\n for i in range(1,31):\r\n p[i] = p[i] - 1\r\npowers_()\r\n\r\nxn = input().split(\" \")\r\nx = int(xn[0])\r\nvc=[]\r\ntemp = 1\r\nsum = 0\r\nwhile x!=0:\r\n for i in range(30, 0, -1):\r\n if p[i] <= x:\r\n x = x-int(p[i])\r\n vc.append({\"f\":temp, \"s\":i})\r\n sum = sum + i\r\n break\r\n temp = temp + int(xn[1])+1\r\nprint(sum)\r\nfor i in range(0, len(vc)):\r\n for j in range(0, int(vc[i][\"s\"])):\r\n print(vc[i][\"f\"], end=\" \")\r\n\r\n", "inf=10**9\r\nx,d=[int(e) for e in input().split()]\r\na=[]\r\ne=1\r\nwhile x:\r\n e+=inf\r\n i=1\r\n while 2**(i+1)-1<=x:\r\n i+=1\r\n x-=2**i-1\r\n a+=[e]*i\r\nprint(len(a))\r\nprint(*a)", "from math import log2\r\nx, d = map(int,input().split())\r\nn, v = 0, 1\r\narr = []\r\nwhile x > 0:\r\n t = int(log2(x+1))\r\n arr += [v] * t\r\n n += t\r\n v += d\r\n x -= (1<<t) - 1\r\nprint(n)\r\nprint(' '.join(map(str, arr)))\r\n", "x,d = map(int, input().split())\nn = 1\nans = []\ncnt = 0\nfor i in range(60,0,-1):\n if (x>>i) & 1:\n for j in range(1, i+1):\n ans.append(n)\n n += d\n cnt += 1\nwhile cnt:\n ans.append(n)\n n += d\n cnt -= 1\n\nif x & 1:\n ans.append(n)\n\nprint(len(ans))\nfor i in ans:\n print(i, end = ' ')\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\nx, d = map(int, input().split())\r\nq = [2**i-1 for i in range(30)]\r\nt = 1\r\nw = []\r\nwhile x:\r\n a = bisect(q, x)\r\n x -= q[a-1]\r\n w.extend([t]*(a-1))\r\n t += d+1\r\nprint(len(w))\r\nprint(' '.join(map(str, w)))", "p2 = [(i, 2**i-1) for i in range(1,40)]\r\n# print(p2)\r\nX, d = map(int, input().split(' '))\r\n\r\nlens = []\r\nfor i in p2[::-1]:\r\n if X >= i[1]:\r\n X -= i[1]\r\n lens.append(i[0])\r\n\r\n# print(lens)\r\n# print(X)\r\n# if X > 0:\r\n# print(-1)\r\n# exit(0)\r\n\r\nel = 1\r\n# if el + len(lens)*d > 10**18:\r\n# print(-1)\r\n# exit(0)\r\nif sum(lens) >= 10000:\r\n print(-1)\r\n exit(0)\r\nprint(sum(lens)+X)\r\nfor i in lens:\r\n print((str(el)+' ')*i, end='')\r\n el += d\r\nfor i in range(X):\r\n print(el, end=' ')\r\n el += d\r\n# print(lens)\r\n\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nx, d = map(int, input().split())\r\npow2 = [1]\r\nfor _ in range(30):\r\n pow2.append(2 * pow2[-1])\r\ny = [i - 1 for i in pow2[1:]]\r\nu = []\r\nfor i in range(29, -1, -1):\r\n while y[i] <= x:\r\n u.append(i + 1)\r\n x -= y[i]\r\nans = []\r\ninf = pow(10, 9) + 1\r\nfor i in range(len(u)):\r\n for _ in range(u[i]):\r\n ans.append(i * inf + 1)\r\nn = len(ans)\r\nprint(n)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "import sys\r\nimport math\r\nfrom queue import *\r\nimport 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\ndef bit(n):\r\n\tans=-1\r\n\twhile n:\r\n\t\tans+=1\r\n\t\tn//=2\r\n\treturn ans\r\n\r\nx,d=invr()\r\n\r\nq=PriorityQueue()\r\n\r\nans=[]\r\n\r\nq.put(x)\r\n\r\nwhile not q.empty():\r\n\tu=q.get()\r\n\tif u==1:\r\n\t\tans.append(u)\r\n\t\tcontinue\r\n\tans.append(bit(u))\r\n\tq.put(u-2**bit(u)+1)\r\n\r\nanswer=[]\r\nlast=1\r\n\r\nfor num in ans:\r\n\tfor i in range(num):\r\n\t\tanswer.append(last)\r\n\tlast+=d\r\n\r\nrandom.shuffle(answer)\r\n\r\nprint(len(answer))\r\nprint(*answer)\r\n\t\r\n\t\t\r\n\t\t\r\n", "x,d=map(int,input().split())\r\nstart=1\r\nans=[]\r\nfor i in range(61):\r\n if((x&(1<<i))):\r\n for j in range(i):\r\n ans.append(start)\r\n start += d\r\n ans.append(start)\r\n start += d\r\nprint(len(ans))\r\nprint(\" \".join(map(str,ans)))", "x,d=map(int,input().split())\r\nc=1\r\nr=\"\\n\"\r\ne=29\r\nb=2**e-1\r\nwhile x:\r\n while x<b:e-=1;b>>=1\r\n r+=f\"{c*d} \"*e;c+=e;x-=b\r\nprint(c-1,r)", "x, d = map(int, input().split())\r\narr = []\r\nn = 0\r\ns = ''\r\nwhile x > 0:\r\n s += str(x % 2)\r\n x //= 2\r\nf = 1\r\nl = 999999999999999999\r\nfor i in range(len(s)):\r\n if int(s[i]):\r\n arr += [f] * i + [l]\r\n f += d\r\n l -= d\r\n n += i + 1\r\nif n == -1:\r\n print(-1)\r\nelse:\r\n print(n)\r\n print(*arr)\r\n\r\n\r\n\r\n\r\n", "x,d = [int(i) for i in input().split()]\r\ngr = []\r\na = [2**i -1 for i in range(31)]\r\nj=30\r\nwhile x > 0:\r\n while a[j]>x:j-=1\r\n gr.append(j)\r\n x-=a[j]\r\nn = sum(gr)\r\nif n > 10**4:\r\n print(-1)\r\n exit()\r\nprint(n)\r\ncur = 1\r\nfor i in gr:\r\n for j in range(i):\r\n print(cur, end = ' ')\r\n cur += d", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef main():\r\n\r\n x, d = [int(i) for i in input().split(' ')]\r\n\r\n ans = []\r\n cur_n = 1\r\n\r\n pos = 0\r\n while x > 0:\r\n if x%2 == 1:\r\n for j in range(pos):\r\n ans.append(cur_n)\r\n\r\n cur_n += d+5\r\n ans.append(cur_n)\r\n cur_n += d+5\r\n\r\n x >>= 1\r\n pos += 1\r\n\r\n print(len(ans))\r\n for i in ans:\r\n print(i, end=' ')\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "x, d=list(map(int, input().split()))\ndef dmax(x):\n i=0\n while 2**i-1<=x:\n i+=1\n return i-1\ntec=1\nn=0\nstep=dmax(x)\nstroka=''\nwhile step!=0:\n stroka+= (str(tec)+' ')*step\n tec+=d\n x-=(2**step-1)\n n+=step\n step=dmax(x)\nprint(n)\nprint(stroka)", "x,d=map(int,input().split())\r\no=bin(x)[2:][::-1]\r\nk=1\r\nl=[]\r\nfor i in range(len(o)):\r\n if o[i]==\"1\":\r\n l+=[k]*(i)\r\n k+=d\r\nfor i in range(o.count(\"1\")):\r\n l+=[k]\r\n k+=d\r\nprint(len(l))\r\nprint(*l)", "from math import *\r\nR = lambda: map(int, input().split())\r\n\r\nx, d = R()\r\nn = 0; arr = []; v = 1\r\nwhile x:\r\n t = floor(log2(x+1))\r\n arr += [v] * t\r\n n += t; v += d\r\n x -= (2**t) - 1\r\n\r\nprint(n)\r\nprint(' '.join(map(str, arr)))\r\n", "# f = open('inputs', 'r')\r\n# def input(): return f.readline().rstrip(\"\\r\\n\")\r\n\r\nc, d = map(int, input().split())\r\nx = 1\r\n\r\nres = []\r\nwhile c:\r\n t = len(bin(c + 1)) - 3\r\n m = (1 << t) - 1\r\n c -= m\r\n res.extend([x] * t)\r\n x += d\r\n\r\nprint(len(res))\r\nprint(*res)", "from collections import defaultdict as dd, deque\n\nx,d = map(int,input().split())\n\nQ = deque()\n\nA = []\n\ni = 1\nwhile x>0:\n n = 1\n while 2**(n+1) - 1 <= x:\n n += 1\n x -= 2**n - 1\n\n A.extend([i]*n)\n i += 2*d\n\nprint(len(A))\nprint(*A)\n", "#!/usr/bin/env python3\n\nimport sys\n\n[X, d] = map(int, sys.stdin.readline().strip().split())\n\na = []\nm = 1 - d\n\ni = 31\nwhile i > 0:\n\tif 2**i - 1 > X:\n\t\ti -= 1\n\t\tcontinue\n\ta.extend([m + d] * i)\n\tm += d\n\tX -= 2**i - 1\n\nprint (len(a))\nprint (' '.join(map(str, a)))\n", "X, D = map(int, input().split())\ncn = 1\nadd0 = 1 if (X&1) else 0\nans = []\nfor i in range(30,0,-1):\n\tif not (X & (1<<i)): continue\n\tans += [cn]*i\n\tadd0 += 1\n\tcn += D\nfor i in range(add0):\n\tans.append(cn)\n\tcn += D\nprint(len(ans))\nprint(' '.join(map(str, ans)))\n", "# -*- coding: UTF-8 -*-\n\ns = [2 ** i - 1 for i in range(31, 0, -1)]\nz = [i for i in range(31, 0, -1)]\n\nx, d = map(int, input().split())\n\nst = 1\np = 0\nret = []\n\nwhile x > 0:\n while s[p] > x:\n p += 1\n for i in range(z[p]):\n ret.append(st)\n st += d\n x -= s[p]\n\nif x != 0:\n print('-1')\nelse:\n print(len(ret))\n print(' '.join(str(i) for i in ret))\n\n", "x, d = map(int, input().split())\ns = str(bin(x))[2:]\nwqa = 1\nans = []\nkoms = 0\nfor i in range(len(s)):\n if s[i] == '1':\n for idq in range(len(s) - i - 1):\n ans.append(wqa)\n koms += 1\n wqa += d + 1\nfor ii in range(koms):\n ans.append(wqa)\n wqa += d\nprint(len(ans))\nprint(*ans)", "X, d = map (int, input ().split ())\r\nans = list (); cur = 1; cnt = 0\r\nwhile X :\r\n if X & 1 :\r\n for i in range (cnt) : ans.append (cur)\r\n cur += d + 1\r\n ans.append (cur)\r\n cur += d + 1\r\n X //= 2; cnt += 1; cur += d + 1\r\n\r\nprint (len (ans))\r\nfor i in ans : print (i, end = \" \")\r\n\r\n \r\n", "X, d = map(int, input().split())\na = list()\ncur = 1\nfor i in range(32):\n if X&(1<<i):\n for j in range(i):\n a.append(cur)\n cur = cur+d\n a.append(cur)\n cur = cur+d\nprint(len(a))\nfor i in a:\n print(i, end=\" \")\n", "x,d=map(int,input().split())\r\npw=[2**i-1 for i in range(31,-1,-1)]\r\np=[i for i in range(31,-1,-1)]\r\nans=[]\r\nel=1\r\ni=0\r\nwhile x>0:\r\n while pw[i]>x:\r\n i+=1\r\n for z in range(p[i]):\r\n ans.append(el)\r\n x-=pw[i]\r\n el+=d\r\nif x!=0:\r\n print(\"-1\")\r\nelse: \r\n print(len(ans))\r\n print(*ans)\r\n \r\n \r\n" ]

[ "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nsumEn = sum(a)\r\n\r\nleft = 0\r\nright = 1000\r\n\r\neps = 1e-7\r\n\r\nwhile right - left > eps:\r\n mid = (left + right)/2\r\n sumLoss = 0\r\n for i in a:\r\n if i > mid:\r\n sumLoss += i - mid\r\n sumLoss = sumLoss * (k/100)\r\n if mid*n < sumEn - sumLoss:\r\n left = mid\r\n else:\r\n right = mid\r\n\r\nprint('%.7f' % left)", "def isEnough(x):\r\n receiving = 0\r\n giving = 0\r\n for acc in accumulators:\r\n if acc < x:\r\n receiving += x - acc\r\n else:\r\n giving += (acc - x) * (100 - k) / 100\r\n return (receiving <= giving)\r\n\r\ndef BinarySreach(l, r):\r\n left = l\r\n right = r\r\n ans = r\r\n while left <= right:\r\n mid = (left + right) / 2\r\n if isEnough(mid):\r\n ans = mid\r\n left = mid + 10**(-10)\r\n else:\r\n right = mid - 10**(-10)\r\n return ans \r\n\r\nn, k = map(int, input().split())\r\naccumulators = list(map(int, input().split()))\r\nprint(\"{:.9f}\".format(BinarySreach(0, max(accumulators))))", "\"\"\"\r\n Created by Mohsen Naghipourfar on 4/18/18.\r\n Email : [email protected]\r\n Website: http://ce.sharif.edu/~naghipourfar\r\n\"\"\"\r\n\r\n\r\ndef ok(value):\r\n low, up = 0, 0\r\n for i in range(n):\r\n if a[i] < value:\r\n low += value - a[i]\r\n else:\r\n up += a[i] - value\r\n\r\n return up - (up * k) / 100.0 >= low\r\n\r\n\r\nn, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nlow, high = 0, 1e3\r\n\r\nfor i in range(100):\r\n mid = (low + high) / 2\r\n if ok(mid):\r\n low = mid\r\n else:\r\n high = mid\r\n\r\nprint(\"%.9lf\\n\" % low)\r\n", "(n, k), t = map(int, input().split()), sorted(map(int, input().split()))\r\ni, d, s = 1, t[0], sum(t)\r\nwhile i < n and (100 * s - k * (s - d)) > t[i] * (100 * n - k * (n - i)): d += t[i]; i += 1\r\nprint((100 * s - k * (s - d)) / (100 * n - k * (n - i)))", "def check(a, m, k):\r\n can_add = 0\r\n for i in range(len(a)):\r\n if a[i] > m:\r\n can_add += (a[i] - m) * (100 - k) / 100\r\n else:\r\n if can_add < m - a[i]:\r\n return False\r\n else:\r\n can_add -= (m - a[i])\r\n\r\n return True\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort(reverse=True)\r\n\r\nl = 0\r\nr = 10 ** 20\r\n\r\nfor i in range(10000):\r\n m = (l + r) / 2\r\n if check(a, m, k):\r\n l = m\r\n else:\r\n r = m\r\n\r\nprint(\"%.10f\" % m)\r\n", "import bisect\r\nI = lambda: list(map(int, input().split()))\r\nn, k = I()\r\nk /= 100\r\na = I()\r\nl = 0\r\nr = 1000\r\nsumie = sum(a)\r\nwhile r - l > 1e-7:\r\n mid = (l+r) / 2\r\n sum_transfer = 0\r\n for x in a:\r\n if x > mid:\r\n sum_transfer += x-mid\r\n if n*mid < sumie - sum_transfer*k:\r\n l = mid\r\n else:\r\n r = mid\r\nprint(l)", "def check(a, k, cur):\n\tneed = 0\n\thave = 0\n\tfor x in a:\n\t\tif x < cur:\n\t\t\tneed += cur - x\n\t\telse:\n\t\t\thave += (x - cur) * (1 - k / 100)\n\treturn need <= have\n\nn, k = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\nl = 0\nr = 1000\nfor i in range(100):\n\tcur = (l + r) / 2\n\tif check(a, k, cur):\n\t\tl = cur\n\telse:\n\t\tr = cur\nprint((l + r) / 2)\n", "#input\r\nn,k = [int(d) for d in input().split()]\r\na = [int(d) for d in input().split()]\r\n\r\n#test funtion\r\ndef test(v):\r\n ia = [d for d in a if d>v]\r\n ea = [d for d in a if d<v]\r\n dis = sum(ia)-v*len(ia)\r\n dem = v*len(ea)-sum(ea)\r\n pas = dis*(1-k/100)\r\n if dem <= pas:\r\n return True\r\n return False\r\n \r\n#binary search funtion\r\ndef bs(l,r,cnt):\r\n c = (l+r)/2\r\n if cnt>=60 : return c\r\n elif test(c): return bs(c,r,cnt+1)\r\n else : return bs(l,c,cnt+1)\r\n \r\n#result\r\nres = bs(0,1001,0)\r\nprint(res)", "n, k = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nleft = 0\r\nright = 1001\r\n\r\nwhile right-left > 0.0000001:\r\n mid = (right + left) / 2\r\n plus = 0\r\n minus = 0\r\n for i in range(n):\r\n if a[i] <= mid:\r\n plus += mid-a[i]\r\n else:\r\n minus += a[i]-mid\r\n\r\n minus = minus*(100-k)/100\r\n\r\n if minus >= plus:\r\n left = mid\r\n else:\r\n right = mid\r\nprint(left)\r\n", "n,k = map(int,input().split()) \r\na = list(map(int,input().split())) \r\nl = 0\r\nr = 1001\r\nwhile r - l > 0.0000001:\r\n\tm = (r + l) / 2\r\n\tplus = 0\r\n\tminus = 0\r\n\tfor i in range(n):\r\n\t\tif a[i] <= m:\r\n\t\t\tplus += m - a[i]\r\n\t\telse:\r\n\t\t\tminus += a[i] - m\r\n\tminus = minus * (100 - k) / 100\r\n\tif minus >= plus:\r\n\t\tl = m\r\n\telse:\r\n\t\tr = m\r\nprint(l)", "nk = list(input().split())\nn, k = int(nk[0]), float(nk[1])\nenergy = list(map(float, input().split()))\navg = sum(energy)/len(energy)\nwhile(1):\n sum_lf = 0\n sum_rg = 0\n cnt_lf = 0\n cnt_rg = 0\n lf = []\n flag = False\n for i in range(n):\n if(energy[i]<avg):\n cnt_lf+=1\n sum_lf+=energy[i]\n lf.append(energy[i])\n else:\n cnt_rg+=1\n sum_rg+=energy[i]\n x = (cnt_lf * sum_rg - cnt_rg * sum_lf) / (cnt_rg * (100 - k)/100 + cnt_lf)\n avg = (sum_rg - x)/(cnt_rg)\n for i in range(len(lf)):\n if(lf[i]>avg):\n flag = True\n if(not flag):\n break\nprint(\"%.9f\" %(avg))\n \n\n\n\n\n", "from bisect import bisect_left\r\n\r\n(n, k), arr = map(int, input().split()), list(map(int, input().split()))\r\narr.sort()\r\nleft, right, s = arr[0], arr[-1], sum(arr)\r\n\r\nwhile right - left > 1e-8:\r\n mid, loss = (left + right) / 2, 0\r\n for i in range(bisect_left(arr, mid), n):\r\n loss += arr[i] - mid\r\n if mid * n < s - (loss * k / 100):\r\n left = mid\r\n else:\r\n right = mid\r\n\r\nprint(left)\r\n", "\r\na=[]\r\n\r\n\r\n\r\n\r\ndef check(valueToBeChecked):\r\n\textraPower=0\r\n\r\n\tfor i in a:\r\n\t\tif( i >= valueToBeChecked ):\r\n\t\t\tpowerDonated = ( i - valueToBeChecked )\r\n\t\t\textraPower += ( powerDonated - ( powerDonated * k / 100 ) )\r\n\t\telse:\r\n\t\t\textraPower -= ( valueToBeChecked - i )\r\n\r\n\treturn extraPower >= 0\r\n\r\n\r\n\r\n\r\n\r\nn,k=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\n\r\nl=0\r\nh=max(a)\r\n\r\ndiff=0.00000001\r\n\r\nwhile(l + diff <= h):\r\n\r\n\tmid = (l + h)/2\r\n\tif(check(mid)):\r\n\t\tl = mid\r\n\telse:\r\n\t\th = mid\r\n\t\t\r\nprint(\"{0:.10f}\".format(mid))", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef read_line():\r\n return [int(x) for x in input().split()]\r\n\r\ndef read_int():\r\n return int(input())\r\n\r\ndef check(a, mid, k):\r\n req, take = 0, 0\r\n\r\n for x in a:\r\n if x > mid:\r\n take += x-mid\r\n else:\r\n req += mid-x\r\n\r\n return take - k*take/100 >= req\r\n\r\ndef solve():\r\n _, k = read_line()\r\n a = read_line()\r\n\r\n low, high, res = 0, 1e9, 0\r\n\r\n for _ in range(100):\r\n mid = (low + high)/2\r\n\r\n if check(a, mid, k):\r\n res = low = mid\r\n else:\r\n high = mid\r\n \r\n print(res)\r\n\r\n# t = read_int()\r\nt = 1\r\nwhile t > 0:\r\n solve()\r\n t -= 1", "(n, k), t = map(int, input().split()), [0] + sorted(list(map(int, input().split())))\r\ni, d, s = 1, t[1], sum(t)\r\nwhile i < n:\r\n i += 1\r\n d += t[i]\r\n if 100 * (s - t[i] * n) < k * (s - d - t[i] * (n - i)):\r\n d -= t[i]\r\n i -= 1\r\n break\r\nprint(t[i] + (100 * (s - t[i] * n) - k * (s - d - t[i] * (n - i))) / (100 * n - k * (n - i)))", "#From Jasnah bobb31\r\n#From Jasnah bobb31\r\n#From Jasnah bobb31\r\nn, k = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nc = 1.0 - k / 100.0\r\ntotal = 0\r\nsumm = sum(a)\r\n\r\nfor i in range(n):\r\n s = (c * summ - c * total + total) / (i + c * (n - i))\r\n total += a[i]\r\n\r\n if s <= a[i]:\r\n print(f'{s:.7f}')\r\n break", "n, k = map(int, input().split())\na = [int(x) for x in input().split()]\nl = 0\nr = 1001\nwhile r - l > 0.0000001:\n\tm = (r + l) / 2;\n\tplus = 0\n\tminus = 0\n\tfor i in range(n):\n\t\tif a[i] <= m:\n\t\t\tplus += m - a[i]\n\t\telse:\n\t\t\tminus += a[i] - m\n\tminus = minus * (100 - k) / 100\n\tif minus >= plus:\n\t\tl = m\n\telse:\n\t\tr = m\nprint(l)\n", "def energy(acc, level, perc_loss):\n surplus = sum([max(x - level, 0) for x in acc])\n en_cost = sum([(abs(min(0, x - level)) * 100) / (100 - perc_loss) for x in acc])\n return surplus >= en_cost\n\n\nclass CodeforcesTask68BSolution:\n def __init__(self):\n self.result = ''\n self.n_k = []\n self.accumulators = []\n\n def read_input(self):\n self.n_k = [int(x) for x in input().split(\" \")]\n self.accumulators = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n l = 0\n r = sum(self.accumulators) / self.n_k[0]\n while r - l >= 0.000_0001:\n mid = l + (r - l) / 2\n if energy(self.accumulators, mid, self.n_k[1]):\n l = mid\n else:\n r = mid\n self.result = str(r)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask68BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "# def marble(q,n,arr, queries):\r\n# arr = sorted(arr)\r\n# for q in queries:\r\n# ind = -1\r\n# left = 0\r\n# right = n \r\n# while left < right:\r\n# mid = left + (-left + right)//2 \r\n# if q <= arr[mid]:\r\n# ind = mid \r\n# right = mid\r\n# # break \r\n# else:\r\n# left = mid + 1 \r\n# if ind == -1 or arr[ind] != q:\r\n# print(\"{} not found\".format(q))\r\n# else:\r\n# print(\"{0} found at {1}\".format(q, ind+1))\r\n \r\n# case = 1\r\n# while True:\r\n# n,q = list(map(int, input().strip().split(\" \")))\r\n# if n == 0 and q == 0:\r\n# break\r\n# arr = []\r\n# for i in range(n):\r\n# x = int(input().strip())\r\n# arr.append(x)\r\n \r\n# queries = []\r\n# for _ in range(q):\r\n# queries.append(int(input().strip()))\r\n# print(\"CASE# {}:\".format(case))\r\n# marble(q,n,arr,queries)\r\n# case += 1\r\n\r\n# def pizza(n,k,arr):\r\n# total = 0 \r\n# arr = sorted(arr)\r\n\r\n# for ind, x in enumerate(arr):\r\n# left = ind + 1\r\n# right = n-1\r\n# while left <= right:\r\n# mid = (left + right)//2 \r\n# if k == arr[mid]-x:\r\n# total += 1\r\n# break \r\n# elif k > arr[mid]-x:\r\n# left = mid + 1 \r\n# else:\r\n# right = mid - 1 \r\n\r\n# print(total)\r\n \r\n\r\n# n,k = list(map(int, input().strip().split(\" \"))) \r\n# arr = list(map(int, input().strip().split(\" \"))) \r\n\r\ndef energy(n,k,arr):\r\n arr = sorted(arr)\r\n max_energy = -1\r\n left = min(arr) \r\n right = max(arr)\r\n \r\n while abs(left-right) > 10**(-6):\r\n X = (left + right)/2\r\n # print(left, X, right)\r\n a = sum(arr)\r\n thua = 0\r\n for i in arr:\r\n if i > X:\r\n # a += (i-X)\r\n thua += ((i-X)*k/100)\r\n # else:\r\n # a += (i)\r\n #a + thua - n*X .. 0\r\n # ^ ^\r\n if a - thua == n*X:\r\n max_energy = X\r\n elif a - thua - n*X > 0:\r\n left = X \r\n else:\r\n right = X\r\n print(left)\r\n\r\nn,k = list(map(int, input().strip().split(\" \"))) \r\narr = list(map(int, input().strip().split(\" \"))) \r\nenergy(n,k,arr)\r\n\r\n\r\n\r\n# 4 2 1 -> X = 2\r\n# 2 2 1 = 5\r\n# 1 (5 - 2)*k% 0 = 1\r\n\r\n\r\n# Mức năng lượng sau khi transfer + Năng lượng thừa = Tổng năng lượng muốn\r\n# # = n * X\r\n# Tổng năng lượng ban đầu - năng lượng mất = Tổng năng lượng muốn\r\n# = \r\n# 2 2 2 = 2*3 = 6\r\n\r\n\r\n", "def energy(n,loss,array):\r\n array.sort(reverse=True)\r\n left=0 \r\n # right=1000000003\r\n right = max(array)+1\r\n \r\n while right-left >0.00000001:\r\n arr= array.copy()\r\n mid = (left+right)/2 \r\n\r\n i=0\r\n j=len(arr)-1\r\n f= True \r\n \r\n while i<=j:\r\n if arr[i]<mid:\r\n f= False\r\n break\r\n \r\n elif arr[j]>=mid:\r\n f=True\r\n break\r\n \r\n else:\r\n required = ((mid-arr[j])/(100-loss))*100 \r\n \r\n if arr[i]- required< mid:\r\n donate= ((arr[i]-mid)*(100-loss))/100 \r\n # arr[i]= mid \r\n arr[j]+=donate \r\n i+=1 \r\n \r\n else:\r\n arr[i]-= required\r\n j-=1 \r\n if f==True:\r\n left= mid \r\n else:\r\n right= mid \r\n \r\n return left\r\n\r\nn,m= list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nprint(energy(n,m,arr))\r\n ", "def isPossibleWithAmount(arr, e, k):\r\n total = 0\r\n\r\n for number in arr:\r\n if number > e:\r\n total += number - e\r\n else:\r\n x = (e - number)*100/(100-k)\r\n total -= x\r\n \r\n\r\n return total >= 0\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nleft = min(arr)\r\nright = max(arr)\r\n\r\n\r\n\r\n\r\nwhile abs(left - right) > 10**(-7):\r\n mid = (right + left)/2\r\n \r\n test = isPossibleWithAmount(arr, mid, k)\r\n # print(left, mid, right, test)\r\n\r\n if test == True:\r\n left = mid\r\n else:\r\n right = mid\r\n\r\n\r\nprint(left)\r\n", "n,k=map(int,input().split())\nl=list(map(int,input().split()))\nl.sort(reverse=True)\ns=sum(l)\ns1=0\ns2=s\nans=0\nk=100-k\nfor i in range(n-1):\n\t# ans=max(ans,(s1*k+100*s2)/((i+1)*k+100*(n-i-1)))\n\ts1+=l[i]\n\ts2-=l[i]\n\ta=(s1*k+100*s2)/((i+1)*k+100*(n-i-1))\n\tif a<=l[i] and a>=l[i+1]:\n\t\tans=max(ans,a)\n\t# print (s1,s2,ans,i,s1*k+100*s2,(i+1)*k)\nif len(set(l))==1:\n\tprint (l[0])\nelse:\n\tprint (ans)", "n,k = map(int,input().split())\r\nlis = sorted(map(int,input().split()))\r\nl=0\r\nr=1000\r\nsu = sum(lis)\r\nwhile abs(r-l)>=0.0000001:\r\n mid =(r+l)/2\r\n trans=0\r\n for i in lis:\r\n if i>mid:\r\n trans+=(i-mid)\r\n if mid*n < su - (trans*k)/100:\r\n l = mid\r\n else:\r\n r = mid\r\n# print(l,r,mid) \r\nprint(r) ", "EPS = 10**-10\r\nn, k = map(int, input().split())\r\nrate = 100/(100-k) - 1\r\na = list(map(int, input().split()))\r\ntotal = 0\r\nfor x in a:\r\n total+=x\r\nlo = 0.0\r\nhi = 1000.0\r\nwhile (abs(hi-lo) > EPS):\r\n mi = (hi + lo)/2\r\n need = mi*n\r\n for i in range(n):\r\n if a[i] < mi:\r\n need+= (mi-a[i])*rate\r\n if (need > total):\r\n hi = mi\r\n else:\r\n lo = mi\r\nprint(\"{:.9f}\".format(lo))\r\n", "n,k = map(float,input().split())\r\nlst = list(map(float,input().split()))\r\nn=int(n)\r\nlst.sort()\r\nlst.reverse()\r\ndef cout(x):\r\n a,b=0,0\r\n for i,x in enumerate(lst):\r\n if x>mid:\r\n x-=mid\r\n a+=(x*(100.0-k)/100.0)\r\n else:\r\n if x<mid:b+=mid-x\r\n return a,b\r\nl,r=lst[n-1],lst[0]\r\nwhile l+0.000000001<r:\r\n mid=(l+r)/2\r\n q,w=cout(mid)\r\n if q<=w:r=mid\r\n else:l=mid\r\nprint(r)", "\"\"\" import sys\r\nsys.stdin = open('INP.txt', 'r')\r\nsys.stdout = open('OUT.txt', 'w')\r\n \"\"\"\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nleft, right = .0, 1000.0\r\nwhile right-left > 1e-7:\r\n mid = (right+left)/2\r\n transfer = 0\r\n for i in range(n):\r\n if a[i] > mid:\r\n transfer += (a[i]-mid)*(1-k/100)\r\n else:\r\n transfer += a[i]-mid\r\n if transfer >= 0:\r\n left = mid\r\n else:\r\n right = mid\r\nprint(\"%.9lf\" % left)\r\n", "def main():\r\n n, k = map(int, input().split())\r\n k = 1.0 - k / 100\r\n a = list(map(int, input().split()))\r\n\r\n ans = 0\r\n l, r = 0, 1000\r\n for rep in range(100):\r\n mid = (l + r) / 2\r\n\r\n need, excess = 0, 0\r\n for energy in a:\r\n if energy > mid:\r\n excess += (energy - mid) * k\r\n else:\r\n need += mid - energy\r\n\r\n if excess >= need:\r\n ans = mid\r\n l = mid\r\n else:\r\n r = mid\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\n \r\nleft = 0\r\nright = a[-1]\r\nfor i in range(100):\r\n mid = (left + right) / 2.0\r\n \r\n s1 = sum([x - mid for x in a if x >= mid]) * (100 - k) / 100.0\r\n s2 = sum([mid - x for x in a if x < mid])\r\n \r\n if s1 >= s2:\r\n left = mid\r\n else:\r\n right = mid\r\n \r\nprint(left)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\ndef check(m):\r\n sums,t=0,0\r\n for a in A:\r\n if a>m:\r\n sums+=m\r\n t += (a-m)*(100-K)/100\r\n else:\r\n sums+=a\r\n if sums+t>=m*N:\r\n return True\r\n return False\r\n \r\n\r\nl,r=0,max(A)\r\nwhile l+0.0000001<r:\r\n m = (l+r)/2\r\n if check(m):\r\n l=m\r\n else:\r\n r=m\r\n \r\nprint(l)", "def check(a, e, k):\r\n need = 0.0\r\n have = 0.0\r\n for x in a:\r\n if x > e:\r\n have += x - e\r\n else:\r\n need += e - x\r\n if have - have * k / 100 >= need:\r\n return True\r\n else:\r\n return False\r\n\r\ndef bs(a, k):\r\n low = 0.0\r\n hight = 1000.0\r\n res = 0.0\r\n while abs(low - hight) >= 1e-9:\r\n mid = (low + hight) / 2\r\n if check(a, mid, k):\r\n res = mid\r\n low = mid\r\n else:\r\n hight = mid\r\n return res\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n print(\"%.6f\" %bs(a, k))", "# Problem from Codeforces\r\n# http://codeforces.com/problemset/problem/68/B\r\n\r\n\r\ndef check_possibility(_accumulators, max_value, n, k):\r\n less = 0\r\n more = 0\r\n for i in range(n):\r\n if _accumulators[i] > max_value:\r\n more += _accumulators[i] - max_value\r\n else:\r\n less += max_value - _accumulators[i]\r\n\r\n return more - k * more / 100 >= less\r\n\r\n\r\ndef solution():\r\n n, k = map(int, input().strip().split())\r\n accumulators = list(map(int, input().strip().split()))\r\n\r\n lo = 0\r\n hi = 1000\r\n for i in range(100):\r\n mid = (lo + hi) / 2\r\n if check_possibility(accumulators, mid, n, k):\r\n lo = mid\r\n else:\r\n hi = mid\r\n\r\n print('{0:.9f}'.format(lo))\r\n\r\n\r\nsolution()\r\n\r\n\r\n", "#From Jasnah bobb31\r\n#From Jasnah bobb31\r\n#From Jasnah bobb31\r\nN, K = map(int, input().split())\r\nA = sorted(map(int, input().split()))\r\nC = 1.0 - K / 100.0\r\ntotal = 0\r\nsumm = sum(A)\r\nfor it in range(N):\r\n answer = (C * summ - C * total + total) / (it + C * (N - it))\r\n total += A[it]\r\n\r\n if answer <= A[it]:\r\n print(f'{answer:.7f}')\r\n break", "def f(e):\r\n # количество рассеявшейся энергии, если в каждом накопителе останется e энергии\r\n s = 0\r\n for x in a:\r\n if x > e:\r\n s += (x - e) * k / 100\r\n return s\r\n\r\n\r\nn, k = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\ns = sum(a)\r\nL = -1\r\nR = max(a)\r\nfor i in range(200):\r\n m = (L + R) / 2\r\n if s - m * n > f(m):\r\n L = m\r\n else:\r\n R = m\r\nprint(R)\r\n", "\r\n\r\n\r\nn,k=map(int,input().split(\" \"))\r\na=list(map(int,input().split(\" \")))\r\n\r\ndef check(x):\r\n\tpw=0\r\n\r\n\tfor i in a:\r\n\t\tif(i>=x):\r\n\t\t\trem=(i-x)\r\n\t\t\tpw+=(rem-(rem*k/100))\r\n\t\telse:\r\n\t\t\tpw-=(x-i)\r\n\tif(pw>=0): return True\r\n\r\n\treturn False\r\n\r\n\r\nl=0\r\nh=max(a)\r\nans=0\r\n\r\nwhile(l+0.00000001<=h):\r\n\tmid=(l+h)/2\r\n\r\n\tif(check(mid)):\r\n\t\tans=mid\r\n\t\tl=mid\r\n\telse:\r\n\t\th=mid\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\nenergy = list(map(int, input().split()))\r\nenergy.sort()\r\n\r\ndef match(x):\r\n left, right = 0, 0\r\n for i in range(n):\r\n if energy[i] < x:\r\n left += x - energy[i]\r\n else:\r\n right += energy[i] - x\r\n return right - (right * k)/ 100 >= left\r\n\r\n\r\nleft = 0\r\nright = 1000\r\nwhile right - left > 0.000001:\r\n mid = (left + right) / 2\r\n if match(mid):\r\n left = mid\r\n else:\r\n right = mid\r\n \r\nprint (left)\r\n\r\n", "import sys\nfrom itertools import *\nfrom math import *\ndef solve():\n n, k = map(int, input().split())\n ss , ll = 0, 1000\n a = list(map(int, input().split()))\n for i in range(100):\n avg = (ss + ll) / 2\n overamount = sum(max(0, x - avg) for x in a)\n underamount = sum(max(0, avg - x) for x in a)\n if overamount * (100-k) >= underamount * 100: ss = avg\n else: ll = avg\n print(ss)\n\n\n\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "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\n##########################################################\r\nn,k=map(int, input().split())\r\narr=list(map(int,input().split()))\r\nl=min(arr)\r\nr=max(arr)\r\nd=0.000000001\r\nwhile r-l>d:\r\n m=(l+r)/2\r\n #print(m)\r\n power=0\r\n for i in range(n):\r\n if arr[i]>m:\r\n power+=(arr[i]-m)*((100-k)/100)\r\n else:\r\n var=m-arr[i]\r\n power-=var\r\n if power>=0:\r\n l=m\r\n else:\r\n r=m\r\nprint(\"%.10f\"%l)\r\n\r\n\r\n", "# Energy Exchange\r\n# Codeforces\r\n\r\n# import sys\r\n# sys.stdin = open('INP.txt', 'r')\r\n\r\nTOL = 10**(-9)\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr = sorted(arr)\r\nlef = arr[0]\r\nrit = arr[n-1]\r\n\r\nwhile (rit - lef > TOL):\r\n\tmid = (lef + rit)/2\r\n\t\r\n\tpls = 0\r\n\tmns = 0\r\n\tfor i in range(n):\r\n\t\tif (arr[i] > mid):\r\n\t\t\tpls += arr[i] - mid\r\n\t\telse:\r\n\t\t\tmns += mid - arr[i]\r\n\t\r\n\tgt = (pls*(1-k/100) - mns) > 0\r\n\tif gt:\r\n\t\tlef = mid\r\n\telse:\r\n\t\trit = mid\r\n\t\t\r\nprint(\"%.9f\" % lef)\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nsum_energy = 0\r\nfor i in range(n):\r\n sum_energy += arr[i]\r\n\r\nl = 0\r\nr = 1000\r\n\r\nwhile r - l > 1e-7:\r\n mid = (l + r) / 2\r\n sum_transfer = 0\r\n ans = 0\r\n for i in range(n):\r\n if arr[i] > mid:\r\n sum_transfer += arr[i] - mid\r\n\r\n sum_loss = sum_transfer * k/100\r\n\r\n if n * mid < sum_energy - sum_loss:\r\n l = mid\r\n else:\r\n r = mid\r\n\r\nprint(\"%.9f\" % mid)", "def get_sum_transfer(accumulators_energy, middle):\r\n sum_transfer = 0\r\n for accumulator_energy in accumulators_energy:\r\n if accumulator_energy > middle:\r\n sum_transfer += accumulator_energy - middle\r\n return sum_transfer\r\n\r\n\r\ndef solve():\r\n accumulators_count, percent_energy_lost = map(int, input().split())\r\n accumulators_energy = list(map(int, input().split()))\r\n sum_energy = sum(accumulators_energy)\r\n left = min(accumulators_energy)\r\n right = max(accumulators_energy)\r\n while right - left > 1e-7:\r\n middle = (left + right) / 2\r\n sum_transfer = get_sum_transfer(accumulators_energy, middle)\r\n sum_lost = sum_transfer * percent_energy_lost / 100\r\n if middle * accumulators_count < sum_energy - sum_lost:\r\n # vẫn còn thừa năng luọng nếu mỗi bình chỉ có middle năng lượng\r\n left = middle\r\n else:\r\n # bị thiếu năng lượng nếu mỗi bình chỉ có middle năng lượng\r\n right = middle\r\n print('{:.9f}'.format(left))\r\n\r\n\r\nsolve()", "import sys\ninput = sys.stdin.readline\nrInt = lambda: int(input())\nmInt = lambda: map(int, input().split())\nrList = lambda: list(map(int, input().split()))\n\nm, k = mInt()\na = rList()\n\nlo = 0\nhi = 1000\nfor _ in range(100):\n test = (lo + hi)/2\n\n bar = 0\n for v in a:\n if v > test:\n bar += (100 - k) * (v - test)\n else:\n bar += 100 * (v - test)\n\n if bar > 0:\n lo = test\n else:\n hi = test\nprint(test)\n\n\t \t\t\t \t \t\t \t \t \t\t\t \t\t", "def Line():\r\n return [int(x) for x in input().split()]\r\nn, k = map(int,input().split())\r\na = Line()\r\n\r\nsum_E = sum(a)\r\n\r\nleft = 0\r\nright = 1000\r\nwhile (right - left > 1e-7):\r\n mid = ( right + left ) / 2\r\n sum_trans = 0\r\n for x in a: \r\n if (x > mid ):\r\n sum_trans += x - mid\r\n if (mid * n < sum_E - sum_trans * k / 100):\r\n left = mid\r\n else:\r\n right = mid \r\nprint ('%.9f' % left)\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\ns = sum(a)\neps = 0.0000000001\nrem = (100-k)/100\n\nleft = min(a)\nright = max(a)\nguess = left\n\nwhile (right - left) > eps: \n\n guess = left + (right-left)/2\n\n transferred = 0.0\n missing = 0.0\n\n for ai in a:\n if ai-guess > 0:\n transferred += rem*(ai-guess)\n else:\n missing += guess-ai\n\n if missing < transferred:\n left = guess\n else:\n right = guess\n \nprint(guess) \n", "n, k = map(int, input().split())\r\naccumulators = list(map(int, input().split()))\r\n\r\nlow = 0\r\nhigh = 1000\r\n\r\nfor i in range(100):\r\n less = 0\r\n more = 0\r\n mid = low + (high - low) / 2\r\n for i in range(n):\r\n if accumulators[i] > mid:\r\n more += accumulators[i] - mid\r\n else:\r\n less += mid - accumulators[i]\r\n\r\n if more - k * more / 100 >= less:\r\n low = mid\r\n else:\r\n high = mid\r\n\r\nprint('{0:.9f}'.format(low))\r\n", "n,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\ndef bins():\r\n l = 0\r\n r = 10000000000000\r\n for i in range(100):\r\n mid = (l+r)/2\r\n if f(mid):\r\n l = mid\r\n else:\r\n r = mid\r\n print(l)\r\n\r\n\r\ndef f(s):\r\n sent = 0\r\n sentR = 0\r\n for i in range(n):\r\n if arr[i] < s:\r\n sentR += ((s-arr[i])*100)/(100-k)\r\n elif arr[i] > s:\r\n sent += arr[i] - s\r\n return sent>=sentR\r\nbins()", "n, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nsum_energy = sum(lst)\r\n\r\nleft = 0\r\nright = 1000\r\nwhile right - left > 1e-7:\r\n mid = (left + right) / 2\r\n sum_transfer = 0\r\n for x in lst:\r\n if x > mid:\r\n sum_transfer += x - mid\r\n if mid * n < sum_energy - sum_transfer * k / 100:\r\n left = mid\r\n else:\r\n right = mid\r\n\r\nprint('%.9f' % left)", "n, k = list(map(int, input().split(\" \")))\r\ninp = list(map(int, input().split(\" \")))\r\nx, y = [1, 3]\r\n_sum = sum(inp)\r\n\r\nright =_sum / n\r\nleft = 0\r\nmid =(right + left) / 2\r\nwhile right - left > 1e-11:\r\n lost = 0\r\n get = 0\r\n for i in inp:\r\n if mid < i:\r\n lost += (i - mid) * (1-k / 100)\r\n else:\r\n get += mid - i\r\n\r\n if lost > get:\r\n left = mid\r\n else:\r\n right = mid\r\n\r\n mid = (right + left) / 2\r\n\r\nprint(left)" ]

[ "n, k = [int(e) for e in input().split()]\r\na = sorted([int(e) for e in input().split()])\r\ns = set()\r\nfor i in range(n):\r\n if a[i] % k != 0:\r\n s.add(a[i])\r\n elif a[i] / k not in s:\r\n s.add(a[i])\r\nprint(len(s))", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nans = set()\r\nfor i in arr:\r\n if i%k: ans.add(i)\r\n elif i//k not in ans: ans.add(i)\r\nprint(len(ans))", "n, k = map(int,input().split())\r\na = sorted(list(map(int,input().split())))\r\nans= []\r\nfor i in range(n) :\r\n if a[i] % k != 0 :\r\n ans.append(a[i]) \r\n else :\r\n if a[i] // k not in ans :\r\n ans.append(a[i]) \r\nprint(len(ans)) ", "import sys\r\nimport string\r\nimport math\r\nimport heapq\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\nfrom collections import Counter\r\nfrom functools import lru_cache\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\nclass DSU:\r\n def __init__(self, n, important=None):\r\n '''\r\n n is a sequence of nodes we want to create\r\n a disjoint set out of.\r\n '''\r\n # If a node has itself as the parent, then it's the root.\r\n self.parents = {i: i for i in n}\r\n self.size = {i: 1 for i in n}\r\n self.num_components = len(n)\r\n self.important = important if important else set()\r\n self.num_edges = {i: 0 for i in n}\r\n\r\n def rank(self, x):\r\n if x in self.important:\r\n # Force these as the root.\r\n return float(\"inf\")\r\n\r\n if x not in self.size:\r\n raise ValueError(\"{0} not in the set.\".format(x))\r\n return self.size[x]\r\n\r\n def union(self, x, y):\r\n '''\r\n Returns the \"new\" parent.\r\n '''\r\n if x not in self.parents or y not in self.parents:\r\n raise ValueError(\"{0} or {1} not in the set.\".format(x, y))\r\n\r\n x_rep = self.find(x)\r\n y_rep = self.find(y)\r\n if x_rep == y_rep:\r\n self.num_edges[x_rep] += 1\r\n return x_rep\r\n\r\n if self.rank(y_rep) > self.rank(x_rep):\r\n x_rep, y_rep = y_rep, x_rep\r\n self.parents[y_rep] = x_rep\r\n self.size[x_rep] += self.size[y_rep]\r\n self.num_components -= 1\r\n self.num_edges[x_rep] += (1 + self.num_edges[y_rep])\r\n return x_rep\r\n\r\n def find(self, x):\r\n if x not in self.parents:\r\n raise ValueError(\"{0} not in the set\".format(x))\r\n\r\n node = x\r\n while self.parents[node] != node:\r\n node = self.parents[node]\r\n\r\n # Fix pointers while traversing up.\r\n while self.parents[x] != x:\r\n y = self.parents[x]\r\n self.parents[x] = node\r\n x = y\r\n return node\r\n\r\ndef main():\r\n _,k=mi(line())\r\n arr=lmi(line())\r\n arrs=set(arr)\r\n dsu=DSU(arr)\r\n for e,n in enumerate(arr):\r\n if n%k==0:\r\n if n//k in arrs:\r\n dsu.union(n,n//k)\r\n\r\n ans=0\r\n for par in dsu.parents:\r\n if dsu.find(par)==par:\r\n sz=dsu.size[par]\r\n if sz%2!=0:\r\n ans+=sz//2+1\r\n else:\r\n ans+=sz//2\r\n print(ans)\r\n \r\nmain()\r\n", "n,k=map(int,input().split())\r\na=sorted(map(int,input().split()))\r\nt,r={},0\r\nfor i in a:\r\n if i not in t:t[i]=True;r+=1\r\n if t[i]:t[i*k]=False\r\nprint(r)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=set()\r\na.sort()\r\nfor i in range(n):\r\n if (a[i]/k) not in ans:\r\n ans.add(a[i])\r\nprint(len(ans)) \r\n ", "import sys\nimport math\nfrom collections import defaultdict\n\n# sys.stdin = open('input.txt', 'r')\n# sys.stdout = open('output.txt', 'w')\n\ndef solve(test):\n\tn, k = map(int, input().split())\n\ta = list(map(int, input().split()))\n\ta.sort(reverse = True)\n\trec = set()\n\tfor i in range(n):\n\t\tif a[i] * k not in rec:\n\t\t\trec.add(a[i])\n\n\tans = len(rec)\n\tprint(ans)\n\n\n\n\n\nif __name__ == \"__main__\":\n\ttest_cases = 1\n\tfor t in range(1, test_cases + 1):\n\t\tsolve(t)\n\n\t \t\t\t\t\t \t\t\t \t\t\t \t\t\t \t\t \t \t", "def main():\n n, k = map(int, input().split())\n if n == 1:\n print(1)\n return\n l = sorted(map(int, input().split()))\n baned = set()\n s = set(l)\n if k > 1:\n for p in l:\n if p not in baned:\n p *= k\n s.discard(p)\n baned.add(p)\n print(len(s))\n\n\nif __name__ == '__main__':\n main()", "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\nn , k = map(int, input().split())\r\na = sorted([int(i) for i in input().split()])\r\nb = set()\r\nfor i in a :\r\n if i % k != 0 or i // k not in b :\r\n b.add(i)\r\nprint(len(b))\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "\ndef K_multiple(a, n, k) : \n\n\ta.sort()\n\n\ts = set()\n\t\n\tfor i in range(n) : \n\t\t\n\t\t# Check if x/k is already present or not \n\t\tif ((a[i] % k == 0 and\n\t\t\ta[i] // k not in s ) or a[i] % k != 0) : \n\t\t\ts.add(a[i]) \n\t\t\t\n\tprint(len(s))\n\nif __name__ == \"__main__\" : \n\n\tn,k = input().split()\n\tn = int(n)\n\tk = int(k)\t\n\ta = list(map(int,input().split()))\n\n\tK_multiple(a, n, k)\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\ns = set()\r\nans = 0\r\nfor c in arr:\r\n if c%k==0 and c//k in s:\r\n continue\r\n else:\r\n ans+=1\r\n s.add(c)\r\nprint(ans)\r\n", "n, k = map(int, input().split())\nA = [int(x) for x in input().split()]\nms = set()\nA.sort()\nans = 0\nfor a in A:\n if a % k == 0:\n if a // k not in ms:\n ans += 1\n ms.add(a)\n else:\n ms.add(a)\n ans += 1\nprint(ans)\n\n", "n, k = map(int, input().split())\r\nseq_set = set()\r\n\r\nfor e in sorted(int(c) for c in input().split()):\r\n if e % k or e // k not in seq_set:\r\n seq_set.add(e)\r\n\r\nprint(len(seq_set))\r\n", " ###### ### ####### ####### ## # ##### ### ##### \n # # # # # # # # # # # # # ### \n # # # # # # # # # # # # # ### \n ###### ######### # # # # # # ######### # \n ###### ######### # # # # # # ######### # \n # # # # # # # # # # #### # # # \n # # # # # # # ## # # # # # \n ###### # # ####### ####### # # ##### # # # # \n\nfrom __future__ import print_function # for PyPy2\nfrom collections import Counter, OrderedDict\nfrom itertools import permutations as perm\nfrom fractions import Fraction\nfrom collections import deque\nfrom sys import stdin\nfrom bisect import *\nfrom heapq import *\nimport math\n \ng = lambda : stdin.readline().strip()\ngl = lambda : g().split()\ngil = lambda : [int(var) for var in gl()]\ngfl = lambda : [float(var) for var in gl()]\ngcl = lambda : list(g())\ngbs = lambda : [int(var) for var in g()]\nmod = int(1e9)+7\ninf = float(\"inf\")\n\n\nn, k = gil()\na = gil()\nans = 0\na.sort()\navail = set(a)\nfor v in a:\n\tif v not in avail: continue\n\ti = 1\n\twhile v*(k**i) in avail:\n\t\tavail.remove(v*(k**i))\n\t\ti += 1\n\t# print(i)\n\tans += math.ceil(i/2)\n# print(avail)\nprint(ans)\n", "from sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_next_line():\r\n return list(map(int, stdin.readline().strip().split()))\r\n\r\n\r\nn, k = read_next_line()\r\na = read_next_line()\r\nres = set(a)\r\n\r\nif k > 1:\r\n excl = set()\r\n for x in reversed(sorted(a)):\r\n if x % k > 0 or x in excl:\r\n continue\r\n p = x / k\r\n if p in res:\r\n res.remove(p)\r\n excl.add(p)\r\n\r\nprint(len(res))", "def sfun(n, k, lst):\r\n s = {}\r\n for i in range(n):\r\n if lst[i] * k in s:\r\n continue\r\n s[lst[i]] = 1\r\n return len(s)\r\n\r\n\r\nN, K = [int(j) for j in input().split()]\r\na = [int(x) for x in input().split()]\r\nprint(sfun(N, K, sorted(a, reverse=True)))\r\n", "def bb(A, item):\r\n \"\"\"Implementa pesquisa binária iterativamente.\"\"\"\r\n esquerda, direita = 0, len(A) - 1\r\n while esquerda <= direita:\r\n meio = (esquerda + direita) // 2\r\n if A[meio] == item:\r\n return meio\r\n elif A[meio] > item:\r\n direita = meio - 1\r\n elif A[meio] < item:\r\n esquerda = meio + 1\r\n return -1\r\n\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nmenores = []\r\nmaiores = []\r\nfor i in range(n):\r\n if bb(menores, a[i])==-1:\r\n if bb(maiores, a[i])==-1:\r\n menores.append(a[i])\r\n maiores.append(a[i]*k)\r\n else:\r\n continue\r\n \r\nprint(len(menores))", "n, k = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\nif k == 1:\r\n print(n)\r\n exit()\r\nres = set(arr)\r\nfor x in arr:\r\n if x in res:\r\n res.discard(x*k)\r\nprint(len(res))\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns,ans=set(),0\r\na.sort()\r\nfor i in a:\r\n if i not in s:\r\n ans+=1\r\n s.add(i*k)\r\nprint(ans)", "def solve(arr, n, k):\r\n memo = {arr[0]*k}\r\n ans = 1\r\n for i in range(1,n):\r\n if arr[i] in memo: continue\r\n memo.add(arr[i]*k)\r\n ans += 1\r\n \r\n return ans\r\n \r\nif __name__==\"__main__\":\r\n n,k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n arr.sort()\r\n \r\n ans = solve(arr,n,k)\r\n print(ans)\r\n ", "n, k = map(int, input().split())\r\nx = sorted(list(map(int, input().split())))\r\ns = set()\r\nfor i in (x) :\r\n if i%k !=0:\r\n s.add(i)\r\n else:\r\n if (i / k) in s:\r\n continue\r\n else:\r\n s.add(i)\r\nprint(len(s))", "\r\nn,k=map(int,input().split())\r\np=[int(x) for x in input().split()]\r\ns=[]\r\np=sorted(p)\r\nfor i in range (0,n):\r\n if p[i]%k!=0:\r\n s.append(p[i])\r\n else:\r\n if int(p[i]/k) not in s:\r\n s.append(p[i])\r\nprint(len(s))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin,stdout\r\nfrom itertools import accumulate\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,k=lst()\r\n a=lst()\r\n a.sort()\r\n s = set()\r\n for v in a:\r\n if (v % k != 0) or v // k not in s:\r\n s.add(v)\r\n print(len(s))", "def bs (l=0,r=0,val=0):\r\n l1 =l\r\n r1 =r\r\n while (l1 <= r1):\r\n mid = (l1 + r1) // 2;\r\n\r\n if a[mid] < val :\r\n l1= mid+1\r\n elif a[mid] > val:\r\n r1 = mid-1\r\n elif a [mid] == val :\r\n return mid ;\r\n return -1\r\n\r\nmark= {}\r\nn,k= map (int,input().split());\r\na = list (map (int,input().split()))\r\na.sort()\r\nsum =0\r\nfor i in range (0, n):\r\n if mark.get(i , False) == False:\r\n temp =bs(i,n-1,a[i]*k);\r\n mark[temp] = True ;\r\n sum +=1\r\nprint (sum)\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nif k == 1: print(len(set(t)))\r\nelse:\r\n p = [set() for i in range(30)]\r\n for i in t:\r\n j = 0\r\n while i % k == 0:\r\n i //= k\r\n j += 1\r\n p[j].add(i)\r\n for j in range(1, 30):\r\n p[j] -= p[j - 1]\r\n print(sum(len(i) for i in p))", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nfrom collections import deque\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\n# se=set(l)\r\nans=set()\r\nfor i in l:\r\n\tif i%k!=0:\r\n\t\tans.add(i)\r\n\telse:\r\n\t\tif i//k in ans:\r\n\t\t\tpass\r\n\t\telse:\r\n\t\t\tans.add(i)\r\nprint(len(ans))", "n,k=map(int,input().split())\n\nL=list(map(int,input().split()))\n\nL.sort(reverse=True)\n\nS={}\n\n\n\nfor i in range(n):\n\n if(L[i]*k in S):\n\n continue\n\n S[L[i]]=1\n\nprint(len(S))\n\n", "# from itertools import combinations\n# from bisect import bisect_left\n# from functools import *\n# from collections import Set\n\nI = lambda: list(map(int, input().split()))\nn, k = I()\na = sorted(I())\nb = set(a)\nif k != 1:\n for i in a:\n if i in b:\n b.discard(i*k)\nprint(len(b))", "def main(N, K, wej):\r\n wej.sort()\r\n wziete = set()\r\n for i in wej:\r\n if (i % K != 0) or (i // K not in wziete):\r\n wziete.add(i)\r\n print(len(wziete))\r\n\r\nN, K = list(map(int, input().split()))\r\nwej = list(map(int, input().split()))\r\nmain(N, K, wej)\r\n", "from collections import defaultdict\n\nn,k=[int(i) for i in input().strip().split()]\nl=[int(i) for i in input().strip().split()]\nif(k==1):\n print(n)\nelse:\n l.sort()\n ndict=defaultdict(list)\n for x in l:\n i=x\n while(i%k==0):\n i=i/k\n ndict[i].append(x)\n ans=0\n for i in ndict.values():\n count=0\n while(count<len(i)):\n if(count==len(i)-1):\n ans+=1\n break\n if(i[count]*k!=i[count+1]):\n ans+=1\n count+=1\n else:\n ans+=1\n count+=2\n print(ans)", "import sys\r\ninput = sys.stdin.readline\r\nn, k = map(int,input().split())\r\nls = list(map(int,input().split()))\r\nst = set()\r\nls.sort()\r\nst.add(ls[0])\r\nfor i in range(1,n) :\r\n if ls[i]%k == 0 and (ls[i]//k in st) :\r\n continue\r\n st.add(ls[i])\r\nprint(len(st))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nres = set()\r\n\r\nfor i in range(n):\r\n if arr[i] % k != 0:\r\n res.add(arr[i])\r\n else:\r\n if arr[i] / k not in res:\r\n res.add(arr[i])\r\n\r\nprint(len(res))", "import io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\ndef search(a, t):\r\n l = 0\r\n r = len(a)-1\r\n \r\n while (r-l)>=0:\r\n mid = (l+r)//2\r\n if a[mid] == t:\r\n return mid\r\n if a[mid] < t:\r\n l = mid+1\r\n if a[mid] > t:\r\n r = mid-1\r\n \r\n return -1\r\n\r\nif k == 1:\r\n print(n)\r\nelse:\r\n v = [0]*n\r\n ct = 0\r\n \r\n for i in range(n):\r\n if not v[i]:\r\n q = a[i]\r\n in_ct = 0\r\n while search(a, q) != -1:\r\n v[search(a, q)] = 1\r\n in_ct += 1\r\n q *= k\r\n \r\n ct += (in_ct+1)//2\r\n \r\n print(ct)", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn, k = map(int, input().split())\r\np = list(map(int, input().split())) \r\np.sort()\r\ns1, s2 = set(), set()\r\nfor i in range(n):\r\n if(p[i] in s2):\r\n continue \r\n s1.add(p[i])\r\n s2.add(k * p[i])\r\nprint(max(len(s1), len(s2)))\r\n", "n,k=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nif k==1:\r\n print(n)\r\n exit()\r\nb=set(a)\r\nfor x in a:\r\n if x in b:\r\n b.discard(x*k)\r\nprint(len(b))\r\n", "\r\nn,k=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nif k==1:\r\n print(len(l))\r\nelse:\r\n l.sort()\r\n s=set(l)\r\n for i in l:\r\n if i in s:\r\n if i*k in s:\r\n s.remove(i*k)\r\n print(len(s))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nd = sorted(map(int, input().split()))\r\ns = set()\r\nfor i in d:\r\n if i/k not in s:\r\n s.add(i)\r\nprint(len(s))", "ln,k = map(int,input().split())\r\ncheck = set()\r\narr = sorted(list(map(int,input().split())))\r\nans=0\r\nfor i in arr:\r\n if i not in check:\r\n check.add(i*k)\r\n ans+=1\r\nprint(ans)", "n, k = list(map(int, input().split()))\r\nx_y = list(map(int, input().split()))\r\nx_y.sort()\r\nres = set()\r\nfor i in x_y:\r\n if i%k==0 and i//k not in res:\r\n res.add(i)\r\n elif i%k!=0:\r\n res.add(i)\r\nprint(len(res))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[a[i]]=1\r\na.sort(reverse=True)\r\nans=0\r\nfor i in range(n):\r\n if d[a[i]]>0:\r\n if a[i]%k==0:\r\n x=a[i]//k\r\n if x in d:\r\n d[x]-=1\r\n ans+=1\r\nprint(ans)", "\r\nimport sys\r\n\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n, k = (int(i) for i in read().split())\r\n values: list[int] = [int(i) for i in read().split()]\r\n result = set()\r\n # We need to take a greedy approach. We sort the values\r\n # and process them 1 by 1. We add them to the result only if it sat the constrain\r\n # The reasoning why we need to sort is that if we pick a middle element, say x\r\n # and x * k and x // k are in the list. We will only be able to add x. But instead\r\n # if we sort, we will process first x//k, ignore x, and add x *k, so we end up with 2 values.\r\n # Ex: 26 52 13. If you do not sort, you only add 26, If you sort, you end up with 13 and 52\r\n values.sort()\r\n for val in values:\r\n if val * k not in result and val / k not in result:\r\n result.add(val)\r\n print(len(result))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import defaultdict\r\nimport heapq\r\nclass Solution:\r\n def multipleFree(self, array, n, k):\r\n # TODO write an algorithm here\r\n multipleSet = set()\r\n answer = []\r\n heapq.heapify(array)\r\n while array:\r\n x = heapq.heappop(array)\r\n if x not in multipleSet:\r\n answer.append(x)\r\n multipleSet.add(x*k)\r\n return len(answer)\r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n n, k = list(map(int, input().split()))\r\n array = list(map(int, input().split()))\r\n \r\n print(solution.multipleFree(array, n, k))\r\n ", "def len_maximum_subset(nums, k):\r\n n = len(nums)\r\n nums.sort()\r\n s = set()\r\n for x in nums:\r\n if x % k == 0 and x // k in s:\r\n continue\r\n \r\n s.add(x)\r\n \r\n return len(s)\r\n \r\n \r\n#t = int(input())\r\nt = 1\r\nfor _ in range(t):\r\n a = list(map(int,input().split()))\r\n n, k = a[0], a[1]\r\n nums = list(map(int,input().split()))\r\n \r\n print(len_maximum_subset(nums, k))\r\n \r\n", "n, k = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\nexclude = set()\r\nans = 0\r\n\r\na.sort()\r\nfor i in a:\r\n if i not in exclude:\r\n exclude.add(i*k)\r\n ans += 1\r\n\r\nprint(ans)", "def answer(n,k,A):\r\n A.sort()\r\n d={}\r\n count=0\r\n for i in range(n):\r\n if A[i] not in d:\r\n count+=1\r\n d[A[i]*k]=1\r\n return count\r\n\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nprint(answer(n,k,arr))", "import math\r\nimport sys\r\nimport collections\r\nimport bisect\r\nimport string\r\nimport time\r\ndef get_ints():return map(int, sys.stdin.readline().strip().split())\r\ndef get_list():return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string():return sys.stdin.readline().strip()\r\nfor t in range(1):\r\n n,k=get_ints()\r\n arr=get_list()\r\n arr.sort()\r\n ans=set()\r\n for i in arr:\r\n if i%k!=0:\r\n ans.add(i)\r\n elif i//k not in ans:\r\n ans.add(i)\r\n print(len(ans))", "from sys import stdin\r\ninput = stdin.readline\r\nn, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nans = set()\r\nfor i in a:\r\n if i%k!=0:\r\n ans.add(i)\r\n else:\r\n if i//k not in ans:\r\n ans.add(i)\r\n\r\nprint(len(ans))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# coding=utf-8\nn, k = list(map(int, input().split(' ')))\na = list(map(int, input().split(' ')))\na.sort()\ns = []\nd = {}\nm = 0\nfor i in a:\n if i % k != 0:\n s.append(i)\n d[i] = 1\n m += 1\n elif (i // k) not in d:\n s.append(i)\n d[i] = 1\n m += 1\nprint(m)\n", "# link: https://codeforces.com/contest/275/problem/C\r\n\r\nfor _ in range(1):\r\n n, k = map(int, input().split())\r\n numbers = list(map(int, input().split()))\r\n visited = set()\r\n numbers.sort()\r\n for i in range(n):\r\n if numbers[i] % k != 0:\r\n visited.add(numbers[i])\r\n else:\r\n if numbers[i] // k in visited:\r\n # skip\r\n continue\r\n else:\r\n visited.add(numbers[i])\r\n print(len(visited)) ", "from math import ceil\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\ndef search(a, t):\r\n l = 0\r\n r = len(a)-1\r\n \r\n while (r-l)>=0:\r\n mid = (l+r)//2\r\n if a[mid] == t:\r\n return mid\r\n if a[mid] < t:\r\n l = mid+1\r\n if a[mid] > t:\r\n r = mid-1\r\n \r\n return -1\r\n\r\nif k == 1:\r\n print(n)\r\nelse:\r\n v = [0]*n\r\n groups = []\r\n it = 0\r\n \r\n for i in range(n):\r\n if not v[i]:\r\n q = a[i]\r\n g = []\r\n while search(a, q) != -1:\r\n v[search(a, q)] = 1\r\n g.append(q)\r\n q *= k\r\n \r\n groups.append(g)\r\n \r\n ct = 0\r\n for g in groups:\r\n ct += int(ceil(len(g)/2))\r\n \r\n print(ct)", "\r\nimport sys\r\n\r\n\r\n\r\n#\r\n# def outer(total, values):\r\n# memo = [[-1 for _ in range(total + 1)] for _ in range(len(values))]\r\n# def dp(p1, i):\r\n#\r\n# if i == len(values):\r\n# p2 = total - p1\r\n# return abs(p2 - p1)\r\n#\r\n# if memo[i][p1] != -1:\r\n# return memo[i][p1]\r\n#\r\n# curr_value = values[i]\r\n# val_2 = dp(p1, i + 1)\r\n# if val_2 == 0:\r\n# memo[i][p1] = 0\r\n# return 0\r\n# # Add it to player 1\r\n# val_1 = dp(p1 + curr_value, i + 1)\r\n# memo[i][p1] = min(val_1, val_2)\r\n# return memo[i][p1]\r\n# return dp(0, 0)\r\n#\r\n#\r\n\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n, k = (int(i) for i in read().split())\r\n values: list[int] = [int(i) for i in read().split()]\r\n result = set()\r\n # We need to take a greedy approach. We sort the values\r\n # and process them 1 by 1. We add them to the result only if it sat the constrain\r\n # The reasoning why we need to sort is that if we pick a middle element, say x\r\n # and x * k and x // k are in the list. We will only be able to add x. But instead\r\n # if we sort, we will process first x//k, ignore x, and add x *k, so we end up with 2 values.\r\n # Ex: 26 52 13. If you do not sort, you only add 26, If you sort, you end up with 13 and 52\r\n values.sort()\r\n # Traverse through the whole array\r\n for i in range(n):\r\n # Check if x/k is already present or not\r\n if values[i] % k == 0 and values[i] // k not in result:\r\n result.add(values[i])\r\n elif values[i] % k != 0:\r\n result.add(values[i])\r\n print(len(result))\r\n\r\nif __name__ == '__main__':\r\n main()", "n, k = map(int, input().split())\r\nintegers = list(map(int, input().split()))\r\n\r\nintegers.sort()\r\nsubset = set()\r\ncount = 0\r\nfor i in integers:\r\n if i in subset:\r\n count += 1\r\n else:\r\n x = i * k\r\n subset.add(x)\r\n\r\nprint(len(integers) - count)", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef solve(n, k, ints):\n cache = {}\n total = 0\n\n for ele in ints:\n length = 1\n if (ele * k) in cache:\n after = ele * k\n end = cache[after][1] # 1 is end of series\n total -= ((cache[after][2]) + 1) // 2 # max length of this sequence\n length += cache[after][2]\n else:\n end = ele\n\n if ele % k == 0 and (ele // k) in cache:\n before = ele // k\n start = cache[before][0] # 0 is start of series\n total -= ((cache[before][2]) + 1) // 2 # length\n length += cache[before][2]\n else:\n start = ele\n\n cache[start] = (start, end, length)\n cache[end] = (start, end, length)\n total += ((length) + 1) // 2\n\n return total\n\n\ndef printOutput(ans):\n sys.stdout.write(str(ans))\n\n\ndef readinput():\n n, k = getInts()\n ints = list(getInts())\n printOutput(solve(n, k, ints))\n\n\nreadinput()\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nd={}\r\nfor ele in arr:\r\n if ele%k!=0:\r\n d[ele]=d.get(ele,0)+ 1 \r\n else:\r\n tm=ele//k\r\n tm=d.get(tm,-1)\r\n if tm==-1:\r\n d[ele]=1 \r\nans=0\r\nfor ele in d:\r\n ans+=d[ele]\r\nprint(ans)\r\n ", "import math \r\nn,k=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nignore=set()\r\nans=0 \r\nfor i in a:\r\n if not i in ignore:\r\n ans+=1 \r\n ignore.add(i*k)\r\nprint(ans)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nma=1\r\nd={l[0]}\r\nfor i in range(1,n) :\r\n if l[i]/m not in d :\r\n d.add(l[i])\r\n ma+=1\r\nprint(ma)\r\n \r\n", "n,k=[int(x) for x in input().split()]\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\nd={}\r\nfor i in arr:\r\n if i%k==0 and i//k in d:\r\n d[i]=d[i//k]+1\r\n del d[i//k]\r\n else:\r\n d[i]=1\r\n#print(d)\r\nans=0\r\nfor i in d:\r\n if d[i]%2:\r\n ans+=(d[i]//2)+1\r\n else:\r\n ans+=(d[i]//2)\r\nprint(ans)\r\n ", "n,k=[int(x) for x in input().split()]\r\narr=[int(x) for x in input().split()]\r\narr.sort()\r\nh={}\r\ncount=0\r\nfor i in range(n):\r\n h[arr[i]]=1\r\nfor i in range(n):\r\n if(h[arr[i]]!=0):\r\n if(arr[i]*k in h):\r\n h[arr[i]*k]=0\r\n count+=1\r\nprint(count)", "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\nN,K = map(int,input().split())\nA = set(list(map(int,input().split())))\nB = sorted(A)\np = 10**20\nans = 0\nfor i in B:\n if i not in A:continue\n if not A:break\n l = []\n for x in range(35):\n if i*(K**x) in A:\n A.remove(i*(K**x))\n l.append(i*(K**x))\n if K**x>=p:break\n\n n = len(l)\n l2 = [l[0]]\n for i in range(1,n):\n if l[i]==l2[-1]*K:\n l2.append(l[i])\n else:\n ans+=(ceil(len(l2)/2))\n l2 = [l[i]]\n if l2:ans+=(ceil(len(l2)/2))\n\nprint(ans)\n", "n, k = (int(x) for x in input().split())\na, se, s = sorted(int(x) for x in input().split()), set(), 0\nfor x in a:\n if x % k or x // k not in se:\n s += 1\n se.add(x)\nprint(s)", "R = lambda: map(int, input().split())\r\nn, k = R()\r\nvst = set()\r\nfor num in sorted(R()):\r\n if not (num // k in vst and num // k * k == num):\r\n vst.add(num)\r\nprint(len(vst))", "n, k = [int(i) for i in input().split(\" \")]\n\nnums = [int(i) for i in input().split(\" \")]\n\n#Cada numero não poderá estar no mesmo set que outro número\n#num * k\n\n\nnums.sort()\npos = {}\n\ntotal = 0\n\nfor i in range(len(nums)):\n pos[nums[i]] = i\n\nfor i in range(len(nums)):\n if nums[i] != -1:\n par = nums[i] * k\n if par in pos.keys():\n nums[pos[par]] = -1\n\n nums[i] = -2\n \n\nprint(nums.count(-2))\n\n\t \t \t \t\t\t \t\t \t \t \t \t\t\t \t \t\t \t\t", "n, k = map(int, input().split())\r\na = [*map(int, input().split())]\r\n\r\na.sort()\r\n\r\ndef binary_search(arr, value):\r\n first, last = 0, len(arr)-1\r\n while first <= last:\r\n mid = (first + last) // 2\r\n if arr[mid] == value:\r\n return mid\r\n elif arr[mid] < value:\r\n first = mid + 1\r\n else:\r\n last = mid - 1\r\n return -1\r\n\r\nans = 0\r\nfor i in range(n):\r\n if a[i] != -1:\r\n ans += 1\r\n id = binary_search(a, a[i]*k)\r\n if id != -1:\r\n a[id] = -1\r\n\r\nprint(ans)", "n,k = map(int,input().split())\n\nlst = sorted(map(int,input().split()))[::-1]\ndic = {i:0 for i in lst}\nfor i in lst:\n x = i*k\n if x in dic:\n dic[x]+=1\n\nst = set()\nfor i in lst:\n if i*k in st:\n if dic[i] < dic[i*k]:\n st.add(i)\n st.remove(i*k)\n else:\n st.add(i)\nprint(len(st))\n \t\t\t \t\t \t\t \t \t \t\t \t \t \t", "n,k=map(int,input().split())\r\na=sorted([int(i) for i in input().split()])\r\nb=set(a)\r\nc=list(b) \r\nif k!=1:\r\n for i in c:\r\n if i in b:\r\n b.discard(i*k)\r\nprint(len(b))", "n, k = [int(x) for x in input().split()]\na = sorted([int(x) for x in input().split()])\ns = set(a)\nl = 0\nfor x in a:\n\tt = 1\n\twhile x in s:\n\t\tl += t\n\t\tt = 1 - t\n\t\ts.remove(x)\n\t\tx *= k\nprint(l)\n", "n, k = map(int, input().split())\r\na = list(sorted(map(int, input().split()), reverse=True))\r\ns = set()\r\nfor i in range(len(a)):\r\n if a[i] * k not in s:\r\n s.add(a[i])\r\nprint(len(s))", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\nlol = {}\nflag = {}\narr.sort()\n\nfor x in arr:\n\tflag[x] = 1\n\nans = 0\nfor i in range(len(arr)):\n\tif arr[i] in lol:\n\t\tcontinue\n\t\n\tcur = arr[i]\n\tcnt = 0\n\n\twhile cur <= 1000000000:\n\t\tlol[cur] = 1\n\t\tif cur in flag:\n\t\t\tcnt += 1\n\t\telse:\n\t\t\tbreak\n\t\tcur = cur * k\n\t\tif k == 1:\n\t\t\tbreak\n\n\tans += (cnt + 1) // 2\nprint(ans)\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl=l[::-1]\r\nd={}\r\nfor i in range(0,n):\r\n\tif l[i]*k in d:\r\n\t\tcontinue\r\n\td[l[i]]=1\r\nprint(len(d))\r\n", "from collections import defaultdict\r\n\r\nn,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nd = defaultdict(bool)\r\nans = 0\r\nfor i in arr:\r\n if i%k == 0 and d[i//k] :\r\n continue\r\n else:\r\n d[i] = True\r\n ans += 1\r\nprint(ans) ", "def bSearch(x,li):\n\tl=0\n\th=len(li)\n\twhile(l<=h):\n\t\tm=(l+h)//2\n\t\tif(li[m]==x):\n\t\t\treturn m\n\t\telif(li[m]>x):\n\t\t\th=m-1\n\t\telse:\n\t\t\tl=m+1\n\treturn -1\nn,k=map(int,input().split())\nli=list(map(int,input().split()))\nli.sort()\ns=set()\nfor i in range(n):\n\tif(li[i]%k==0):\n\t\tz = bSearch(li[i]//k,li)\n\t\tif(z!=-1):\n\t\t\tif li[z] not in s:\n\t\t\t\ts.add(li[i])\n\t\telse:\n\t\t\ts.add(li[i])\n\telse:\n\t\ts.add(li[i])\nprint(len(s))\n\t\t\n", "n, k = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nhas = set()\r\nret = []\r\nfor v in a:\r\n if v % k != 0 or v // k not in has:\r\n ret.append(v)\r\n has.add(v)\r\nprint(len(ret))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\np=[]\r\na=sorted(l)\r\nfor i in a:\r\n if(i%k==0):\r\n if(i//k in p):\r\n pass\r\n else:\r\n p.append(i)\r\n else:\r\n p.append(i)\r\nprint(len(set(p)))\r\n", "n, k = map(int, input().split())\n\ns = list(map(int, input().split()))\n\ns = sorted(s)\n\nmy_dict = {}\n\nfor i in s:\n\tif i not in my_dict:\n\t\tmy_dict[i] = 1\n\nans = {}\nif k != 1:\n\tcount = 0\n\tfor i in my_dict:\n\t\tif i*k in my_dict and i not in ans:\n\t\t\tans[i*k] = 1\n\nprint(len(my_dict)-len(ans))\n\t\t\n", "def func(k, a):\r\n if len(a) == 1:\r\n return 1\r\n if k == 1:\r\n return len(a)\r\n s = set(a)\r\n for x in sorted(a):\r\n if x in s and k * x in s:\r\n s.remove(k * x)\r\n return len(s)\r\n\r\n\r\ndef read_ints():\r\n return [int(x) for x in input().split(' ')]\r\n\r\n\r\ndef main():\r\n n, k = read_ints()\r\n a = read_ints()\r\n assert n == len(a)\r\n print(func(k, a))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\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\ndef check(ind):\r\n val=k*arr[ind] ; r=n-1 ; l=ind+1 ; cond=False ; mul=-1\r\n while l<=r:\r\n mid=(l+r)//2\r\n if arr[mid]==val:\r\n mul=mid ; break\r\n elif arr[mid]>val:\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n if mul==-1:\r\n return\r\n l=mul+1 ; r=n-1 ; x=-1 ; val*=k \r\n while l<=r:\r\n mid=(l+r)//2\r\n if arr[mid]==val:\r\n x=mid ; break\r\n elif arr[mid]>val:\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n if x==-1:\r\n vis[ind]=0\r\n else:\r\n vis[mul]=0\r\n\r\n\r\n \r\n\r\nn,k=map(int,input().split()) ; arr=list(map(int,input().split())) ; arr.sort() ; vis=[1]*n\r\nfor i in range(n):\r\n if vis[i]:\r\n check(i)\r\nprint(sum(vis))\r\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ns=set()\r\nfor el in arr:\r\n if el%k or el//k not in s:\r\n s.add(el)\r\nprint(len(s))" ]