Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "def answer(a, b, c):\r\n if a == b and b == c:\r\n return 0\r\n if a + b + c == 1:\r\n return 0\r\n m = max(a,b,c)\r\n if m == a:\r\n pass\r\n elif m == b:\r\n a,b,c=b,c,a\r\n else:\r\n a,b,c=c,a,b\r\n if a == b:\r\n d = c\r\n elif a == c:\r\n d = b\r\n else:\r\n d = b + c\r\n if a == b or a == c:\r\n m -= 1\r\n else:\r\n m = (m - 1) * 2\r\n return m - d\r\n\r\n\r\na, b, c = map(int, input().split())\r\nprint(answer(a, b, c))", "b, d, s= map(int, input().split())\r\nm= max(b, d, s)\r\na= abs(m-b)\r\nc= abs(m-d)\r\ne= abs(m-s)\r\n\r\nif a <= 1 and c <= 1 and e <= 1:\r\n print(0)\r\nelse:\r\n ans= 0\r\n f= m-1\r\n\r\n if b != m:\r\n ans += f-b\r\n if d != m:\r\n ans += f-d\r\n if s != m:\r\n ans += f-s\r\n\r\n print(ans)\r\n", "# from collections import defaultdict,deque\r\n# from sys import stdin\r\n# import itertools\r\n# import bisect\r\n# from math import sqrt,ceil,floor,gcd\r\n# from sortedcontainers import SortedList\r\n\r\n\r\ndef func(put,mapping,unpack):\r\n v = mapping(int)\r\n v.sort(reverse = True)\r\n if len(set(v)) == 1: print(0); return\r\n ans = 0\r\n if v[0] != v[1]: ans += v[0] - (v[1]+1)\r\n ans += v[0] - (v[2]+1)\r\n print(ans)\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)", "a,b,c=map(int, input().split())\r\nmx=max(a,b,c)\r\nn=0\r\nif mx-a>1: n+=mx-a-1\r\nif mx-b>1: n+=mx-b-1\r\nif mx-c>1: n+=mx-c-1\r\nprint(n)\r\n", "a, b, c = sorted(map(int, input().split()))\r\n \r\nif b == c:\r\n if a == b:\r\n print(0)\r\n else:\r\n print(b-1-a)\r\nelse:\r\n print(c-1-b + c-1-a)", "a=list(map(int,input().split()))\r\nf=max(a)\r\nans=0\r\nfor i in a:\r\n ans+=max(0,(f-1)-i)\r\nprint(ans)", "s=input().split()\r\not=0\r\nx1=int(s[0])\r\nx2=int(s[1])\r\nx3=int(s[2])\r\nmx=max(x1,x2,x3)\r\nif x1<mx:\r\n ot=ot+(mx-x1-1)\r\nif x2<mx:\r\n ot=ot+(mx-x2-1)\r\nif x3<mx:\r\n ot=ot+(mx-x3-1)\r\nprint(ot)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nb, d, s = map(int, input().split())\r\nx = [b, d, s]\r\nsx = sum(x)\r\nm = max(x) - 1\r\npow2 = [1, 2, 4, 8]\r\ninf = 3 * pow(10, 18) + 1\r\nans = inf\r\nfor _ in range(2):\r\n for i in range(8):\r\n y = [m] * 3\r\n for j in range(3):\r\n if i & pow2[j]:\r\n y[j] += 1\r\n ok = 1\r\n for j, k in zip(x, y):\r\n if j > k:\r\n ok = 0\r\n break\r\n if ok:\r\n ans = min(ans, sum(y) - sx)\r\n m += 1\r\nprint(ans)", "# LUOGU_RID: 134816135\nb, d, s = map(int, input().split())\r\n\r\nmax_meals = max(b, d, s)\r\nmissed_meals = max(max_meals - b - 1, 0) + max(max_meals - d - 1, 0) + max(max_meals - s - 1, 0)\r\n\r\nprint(missed_meals)\r\n", "#!/usr/bin/env\tpython\r\n#-*-coding:utf-8 -*-\r\na,b,c=sorted(map(int,input().split()))\r\nc-=1\r\nprint(max(0,c-a)+max(0,c-b))\r\n", "b, d, s = map(int, input().split())\n\nmax_meals = max(b, d, s)\nmissed_meals = max(max_meals - b - 1, 0) + max(max_meals - d - 1, 0) + max(max_meals - s - 1, 0)\n#11\nprint(missed_meals)\n\n \t\t\t \t \t\t \t \t \t\t\t \t \t", "a = list(map(int, input().split()))\na.sort()\na.reverse()\nc=0\nif a[0]==a[1]==a[2]:\n print(\"0\")\n n=1\nelif a[0]-1<=a[1] and a[0]-1<=a[2]:\n print(\"0\")\n n=1\nelse:\n if a[0]-1-a[1]>0:\n c=c+a[0]-1-a[1]\n if a[0]-1-a[2]>0:\n c = c+a[0]-1-a[2]\n print(c)\n\n\n\n\n\n\n\n\n\n\n\n\n\n \t \t\t\t\t \t \t\t \t\t\t \t\t", "a, b, c = map(int, input().split())\r\nans = 0\r\nx, y, z = max(a, b, c), (a + b + c) - (max(a, b, c) + min(a, b, c)), min(a, b, c)\r\nif x > y:\r\n ans += x - y - 1\r\nif x > z:\r\n ans += x - z - 1\r\nprint(ans)", "a,b,c = map(int,input().split())\r\nif a>b and a>c:\r\n print(a-b+a-c-2)\r\nelif a>b and c>b:\r\n mx = max(a,c)\r\n eq = mx-a+mx-c+mx-b-2\r\n print(eq if a!=c else eq+1)\r\nelif b>a and b>c:\r\n print(b-a+b-c-2)\r\nelif b>a and c>a:\r\n mx = max(b,c)\r\n eq = mx-a+mx-c+mx-b-2\r\n print(eq if b!=c else eq+1)\r\nelif c>a and c>b:\r\n print(c-a+c-b-2)\r\nelif a>c and b>c:\r\n mx = max(a,b)\r\n eq = mx-a+mx-c+mx-b-2\r\n print(eq if a!=b else eq+1)\r\nelse:\r\n print(0)", "a=list(map(int,input().split(' ')))\r\nprint(sum(max(0,max(a)-x-1)for x in a))", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(b, s, d):\r\n #day 1: [0], [d], [s, d], [b, s, d]\r\n #last day: [0], [b], [b, s], [b, s, d]\r\n #b,s d = x, x, x + ([0, 0, 1], [0, 1, 1], \r\n answer = float('inf')\r\n for n in [0, b-3, b-2, b-1, b, b+1, b+2, b+3, s-3, s-2, s-1, s, s+1, s+2, s+3, d-3, d-2, d-1, d, d+1, d+2, d+3]:\r\n if n >= 0:\r\n for first_day in [[0, 0, 0], [0, 0, 1], [0, 1, 1], [1, 1, 1]]:\r\n for last_day in [[0, 0, 0], [1, 0, 0], [1, 1, 0], [1, 1, 1]]:\r\n true_b = n+first_day[0]+last_day[0]\r\n true_s = n+first_day[1]+last_day[1]\r\n true_d = n+first_day[2]+last_day[2]\r\n if true_b >= b and true_s >= s and true_d >= d:\r\n answer = min(answer, true_b+true_s+true_d-b-s-d)\r\n for b1, s1, d1 in [[1, 1, 1], [1, 1, 0], [0, 1, 1], [0, 1, 0], [1, 0, 0], [0, 0, 1], [0, 0, 0]]:\r\n if b1 >= b and s1>= s and d1>=d:\r\n answer = min(answer, b1+s1+d1-b-s-d)\r\n print(answer)\r\n \r\n return \r\n\r\nb, s, d = [int(x) for x in input().split()]\r\nprocess(b, s, d)" ]

[ "from sys import stdin, stdout, maxsize\r\nfrom typing import List\r\n\r\ndef sdiameter_axes(axis_one, axes_two):\r\n \"\"\"calcula el diametro**2 entre elementos de un mismo eje\"\"\"\r\n return int(pow(axis_one-axes_two, 2))\r\n\r\ndef sdiameter_xy(x, y):\r\n \"\"\"calcula el diametro**2 entre elementos de ambos ejes\"\"\"\r\n return int(pow(x, 2))+int(pow(y, 2))\r\n\r\nprefix_max_y = None\r\nsufix_max_y = None\r\nprefix_min_y =None\r\nsufix_min_y = None\r\n\r\ndef check(D, n, points):\r\n global prefix_max_y, prefix_min_y, sufix_max_y, sufix_min_y\r\n limit_right = 1\r\n for limit_left in range(1,n+1):\r\n while limit_right < n and sdiameter_axes(points[limit_left][0], points[limit_right+1][0])<= D and abs(points[limit_left][0])>=abs(points[limit_right+1][0]):\r\n limit_right+=1\r\n while abs(points[limit_left][0])<abs(points[limit_right][0]):\r\n limit_right-=1\r\n y_min = min(prefix_min_y[limit_left-1], sufix_min_y[limit_right+1])\r\n y_max = max(prefix_max_y[limit_left-1], sufix_max_y[limit_right+1])\r\n d1 = sdiameter_axes(y_min, y_max)\r\n d2 = max(sdiameter_xy(points[limit_left][0], y_min), sdiameter_xy(points[limit_left][0], y_max))\r\n if max(d1,d2) <= D:\r\n return True \r\n limit_left = n\r\n for limit_right in range(n,0,-1):\r\n while limit_left > 1 and sdiameter_axes(points[limit_left-1][0], points[limit_right][0])<= D and abs(points[limit_left-1][0])<=abs(points[limit_right][0]):\r\n limit_left-=1\r\n while abs( points[limit_left][0])>abs(points[limit_right][0]):\r\n limit_left+=1\r\n y_min = min(prefix_min_y[limit_left-1], sufix_min_y[limit_right+1])\r\n y_max = max(prefix_max_y[limit_left-1], sufix_max_y[limit_right+1])\r\n d1 = sdiameter_axes(y_min, y_max)\r\n d2 = max(sdiameter_xy(points[limit_right][0], y_min), sdiameter_xy(points[limit_right][0], y_max))\r\n if max(d1,d2) <= D:\r\n return True\r\n return False\r\n\r\ndef tp_solution(n:int, points:List):\r\n if n==1:\r\n return 0\r\n # creo los arreglos para computar los maximos y minimos de las <y> por sufijos y prefijos\r\n # todo sobre el conjunto de puntos ordenados por las x \r\n # prefix_max_y[i] es la max <y> en el [0-i]\r\n # prefix_min_y[i] es la min <y> en el [0-1]\r\n # sufix_max_y[i] es la max <y> en el [i-n)\r\n # sufix_min_y[i] es la min <y> en el [i-n)\r\n global prefix_max_y, prefix_min_y, sufix_max_y, sufix_min_y\r\n prefix_max_y, sufix_max_y = [0]*(n+2), [0]*(n+2) \r\n prefix_min_y, sufix_min_y = [0]*(n+2), [0]*(n+2)\r\n points.sort(key= lambda t: t[0])\r\n points.insert(0,None)\r\n prefix_max_y[0], sufix_max_y[-1] = -int(1e8 + 1), -int(1e8 + 1)\r\n prefix_min_y[0], sufix_min_y[-1] = int(1e8 + 1), int(1e8 + 1)\r\n\r\n for i in range(1, n+1):\r\n prefix_max_y[i] = max(points[i][1], prefix_max_y[i-1])\r\n prefix_min_y[i] = min(points[i][1], prefix_min_y[i-1])\r\n for i in range(n,0,-1):\r\n sufix_max_y[i] = max(points[i][1], sufix_max_y[i+1])\r\n sufix_min_y[i] = min(points[i][1], sufix_min_y[i+1])\r\n \r\n #min_sd diametro**2, guarda el menor diametro resultante de mover todos los puntos a uno de los ejes respectivamente.\r\n #la respuesta optima tiene que estar acotada por el minimo de los d**2 resultantes de proyectar en uno de los ejes todos los puntos\r\n min_sd = min(sdiameter_axes(points[1][0], points[-1][0]),sdiameter_axes(prefix_min_y[-2], prefix_max_y[-2]))\r\n left, right = 0, min_sd \r\n while( left <= right):\r\n D = (left + right)//2\r\n if check(D, n, points):\r\n min_sd = D #sabemos que el ultimo si sera la solucion\r\n right = D-1\r\n else:\r\n left = D+1\r\n return min_sd \r\n\r\nif __name__ == \"__main__\":\r\n n = int(stdin.readline())\r\n in_points = []\r\n for _ in range(n):\r\n x, y = map(int, stdin.readline().split())\r\n in_points.append((x,y))\r\n min_sd = tp_solution(n, in_points)\r\n stdout.write(str(min_sd))" ]

[ "import math\r\nl = [int(x) for x in input().split(\" \")]\r\nl.sort(reverse=True)\r\nif l[0] > (l[1]+l[2])*2:\r\n l[0] = (l[1]+l[2])*2\r\nprint(math.floor(sum(l)/3))", "r,g,b=map(int,input().split())\r\nprint(min((r+g+b)//3,r+g,g+b,b+r))", "[r,g,b] = [int(x) for x in input().split()]\r\nprint(min(r+g,r+b,b+g,(r+b+g)//3))", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n r, g, b = sorted(int(x) for x in stdin.readline().split())\r\n\r\n if b >= (r + g) * 2:\r\n print(r + g)\r\n return\r\n\r\n print((r + g + b) // 3)\r\n\r\n\r\nsolve()\r\n", "r, g, b = list(map(int, input().split()))\r\n\r\ncnt = min((r+g+b) // 3, r+g, g+b, r+b)\r\n\r\nprint(cnt)\r\n", "R,G,B = map(int,input().split())\n\nA,B,C = sorted([R,G,B])\ndAB, dBC = B-A,C-B\nans = 0\n\nif dBC < dAB:\n BC = B-dBC\n ans += dBC\n\n dA_BC = BC-A\n BC -= (dA_BC // 3) * 3\n ans += (dA_BC // 3) * 2\n\n if BC - A == 2:\n ans += A+1\n else:\n ans += A\n\nelif dAB < dBC:\n AB = A\n C -= 2 * dAB\n ans += dAB\n\n dAB_C = C-AB\n d0_AB = AB\n\n AB -= min(d0_AB, dAB_C // 3)\n C -= min(d0_AB, dAB_C // 3)\n ans += min(d0_AB, dAB_C // 3) * 2\n\n ans += AB\n\nelse:\n ans = A + dAB\n\nprint(ans)", "a = list(map(int, input().split()))\r\na.sort()\r\nprint(a[0] + a[1] if (a[0] + a[1]) * 2 < a[2] else int(sum(a)/3))", "r,g,b=map(int, input().split())\r\n\r\ns=r+g+b-max(r,g,b)\r\n\r\nm=(r+g+b)//3\r\n\r\nprint(min(m,s))", "c = list(map(int, input().split()))\r\nprint(min(sum(c) // 3, c[0] + c[1] + c[2] - max(c)))\r\n", "r,g,b = [int(i) for i in input().split()]\r\n\r\nnew = [r,g,b]\r\nnew.sort()\r\n\r\nans = min((r+g+b)//3 , new[0]+new[1])\r\n\r\nprint(ans)", "r, g, b = map(int, input().split())\r\nif max(r, g, b) - min(r, g, b) <= 1:\r\n exit(print((r + g + b) // 3))\r\nif max(r, g, b) >= 2*(r+g+b - max(r, g, b)):\r\n exit(print(r+g+b-max(r, g, b)))\r\nprint((r + g + b) // 3)", "from sys import stdin\r\ninp = stdin.readline\r\n\r\narr = [int(x) for x in inp().split()]\r\n\r\narr.sort()\r\n\r\nif (arr[2]+1)//2 > arr[0] + arr[1]:\r\n print(arr[0] + arr[1])\r\nelse:\r\n print(sum(arr)//3)\r\n", "c=list(map(int,input().split()))\nprint(min(sum(c)//3,c[0]+c[1]+c[2]-max(c)))", "l = [*map(int,input().split())]\r\nl.sort()\r\nans = 0\r\nprint(min(sum(l) // 3, l[0] + l[1]))", "r,g,b=map(int,input().split())\r\nprint(min((r+g+b)//3,(r+g+b)-max(r,g,b)))", "def func(a,b,c):\r\n if a<=b+c and b<=a+c and c<=a+b:\r\n return (a+b+c)//3\r\n elif a>=2*(b+c) :\r\n return b+c\r\n elif b>=2*(c+a):\r\n return c+a\r\n elif c>=2*(a+b):\r\n return a+b\r\n else:\r\n res=0\r\n m=max(a,b,c)\r\n n=a+b+c-m\r\n while n<m:\r\n q=(m-n+1)//2\r\n m=m-2*q\r\n n=n-q\r\n res=res+q\r\n res=res+((n+m)//3)\r\n return res\r\na,b,c=input().split()\r\nprint(func(int(a),int(b),int(c)))", "zoop = list(map(int, input().split()))\r\nzoop.sort()\r\nprint(min(sum(zoop)//3, zoop[0]+zoop[1]))\r\n", "a = [int(i) for i in input().split()]\r\na.sort()\r\n\r\nprint(min(sum(a)//3, a[0]+a[1]))", "A,g,b=map(int,input().split())\nprint(min(A+g,A+b,b+g,(A+b+g)//3))\n\t\t \t \t\t\t\t \t\t \t \t\t\t\t\t \t\t", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop, heapify\nfrom bisect import bisect_right, bisect_left\nfrom random import randint\nfrom fractions import Fraction as frac\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef solution():\n arr = list(map(int, input().split()))\n arr.sort()\n a,b,c = arr\n return print(min(a + b, sum(arr)//3))\n \n\n\ndef test():\n pass\n\ndef main():\n #test()\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "def Table_decoration(arr):\r\n s = int(sum(arr) / 3)\r\n a = arr[0] + arr[1]\r\n b = arr[1] + arr[2]\r\n c = arr[0] + arr[2] \r\n #print('Наибольшее количество столов, которые можно украсить:')\r\n print(min(s, a ,b, c))\r\n\r\n\r\n#print('Введите количесвто шаров красного, зеленого и синего цвета через пробел:')\r\narr = [int(i) for i in input().split()]\r\nTable_decoration(arr)\r\n", "#Navneet Kumar\r\n#Indian Institute Of Technology, Jodhpur\r\ndef exe():\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n c=0\r\n c+=l[0]\r\n y=[l[1]-l[0],l[2]-l[0]]\r\n k=sum(l)//3;\r\n if(l[2]>=2*(l[1]+l[0])):\r\n k-=(l[2]-2*(l[1]+l[0]))//3;\r\n print(k)\r\n\r\n return\r\n \r\n\r\n \r\nexe()", "a=list(map(int,input().split()))\r\nprint(min(sum(a)//3,sum(a)-max(a)))", "r=list(map(int,input().split()))\r\nr.sort()\r\nif r[0]+r[1]>r[2]//2:\r\n print((r[0]+r[1]+r[2])//3)\r\nelse:\r\n print(r[0]+r[1])", "def solve(r,g,b):\n val1 = max(r,g,b)\n val2 = r+g+b\n val3 = val2-val1\n if(val1 >= 2*val3):\n return val3\n return (r+g+b)//3\n\n\nr,g,b = [int(ele) for ele in input().split()]\nans = solve(r,g,b)\nprint(ans)", "r, g, b = map(int, input().split())\r\ncnt = 0\r\nx = [r, g, b]\r\nx.sort(reverse=True)\r\nif x[0] - x[2] <= 1:\r\n print((r + g + b) // 3)\r\nelif x[0] >= 2 * (r + g + b - x[0]):\r\n print(r + g + b - x[0])\r\nelse:\r\n print(min(x[2] + x[1], (x[2] + x[1] + x[0]) // 3))\r\n", "a=sorted(list(map(int,input().split())))\r\nSum=sum(a)\r\nans=int(Sum/3)\r\nans1=min(ans,int(a[0]+a[1]))\r\nans2=min(ans,int(abs(Sum-a[2])))\r\nprint(min(ans,ans1,ans2))\r\n", "def iinp(): return int(input())\r\ndef linp():return list(map(int, input().split())) \r\ndef lsinp():return input().split()\r\ndef digit():return [int(i) for i in (list(input()))]\r\ndef char():return list(input())\r\nfrom collections import defaultdict,Counter \r\n\r\n\r\ndef solve():\r\n n=linp() \r\n n.sort()\r\n ans=n[0]\r\n r=n[2]+n[1]-n[0]*2\r\n if r>=3:\r\n ans+=min(n[1],r//3) \r\n #print(r,n)\r\n print(ans)\r\n \r\n \r\n \r\nq=1\r\nfor _ in range(q):\r\n solve()", "a,b,c = map(int,input().split())\na,b,c = sorted([a,b,c])\nif c > (b+a)*2:\n print(b+a)\nelse:\n print((a+b+c)//3)", "# /**\r\n# * author: brownfox2k6\r\n# * created: 12/06/2023 01:57:10 Hanoi, Vietnam\r\n# **/\r\n\r\na = [*map(int, input().split())]\r\ns = sum(a)\r\nprint(min(s//3, s-max(a)))", "colors = sorted(map(int, input().split()))\r\nprint(min(sum(colors) // 3, sum(colors) - colors[-1]))", "a,b,c=map(int,input().split())\r\narr=[a,b,c]\r\narr.sort()\r\nprint(min((a+b+c)//3,arr[0]+arr[1]))", "# ﷽\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\ndef inlst():return [int(i) for i in input().split()]\r\n\r\ndef solve():\r\n # n=int(input())\r\n l=sorted(inlst())\r\n if l[-1]//2>l[0]+l[1]:\r\n print(l[0]+l[1])\r\n else: \r\n print(sum(l)//3)\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "import gc\r\nimport math\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import *\r\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 rgb = I()\r\n right, left = sum(rgb) // 3 + 1, 0\r\n while right - left > 1:\r\n mid = (left + right) // 2\r\n s = sum([min(rgb[i], 2 * mid) for i in range(3)])\r\n if s >= mid * 3:\r\n left = mid\r\n else:\r\n right = mid\r\n\r\n print(left)\r\n\r\n\r\nif __name__ == '__main__':\r\n # for t in range(II()):\r\n # main()\r\n main()\r\n", "lst=list(map(int, input().split()))\r\nif lst.count(0)==1 and lst.count(1)==1:\r\n print(1)\r\nelif lst.count(0)==1 and lst.count(1)==2:\r\n print(0)\r\nelif lst.count(0)==2:\r\n print(0)\r\nelse:\r\n if lst[0]>=lst[1]*2+lst[2]*2 or lst[1]>=lst[0]*2+lst[2]*2 or lst[2]>=lst[0]*2+lst[1]*2:\r\n maxl=max(lst)\r\n x=0\r\n for i in lst:\r\n if i!=maxl:\r\n x+=i\r\n print(x)\r\n else:\r\n print(sum(lst)//3)", "r,g,b=map(int,input().split())\r\nt=min(r,g,b)\r\nm=max(r,g,b)\r\nsr=r+g+b-m-t\r\nost=m-2*t-2*sr\r\nif ost>0:\r\n print(t+sr)\r\nelse:\r\n print((t+m+sr)//3)\r\n", "x = list(map(int, input().split()))\r\nx = sorted(x)\r\n\r\nif x[2] <=2*( x[0] + x[1]):#\r\n print(sum(x)//3)\r\nelse:\r\n print(x[0]+x[1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nM = int(1e9) + 7\r\n\r\na = sorted(list(map(int, input().split())))\r\nprint(min(sum(a) // 3, a[0] + a[1]))", "r, g, b = input().split()\r\nr, g, b = int(r), int(g) , int(b)\r\n\r\nleft = 1\r\nright = 2 * 10 ** 9\r\n\r\nans = 0\r\n\r\nwhile (left <= right):\r\n\r\n mid = left + (right - left) //2\r\n\r\n rem_r = min(r, 2 * mid)\r\n rem_b = min(b, 2 * mid)\r\n rem_g = min(g, 2 * mid)\r\n\r\n # print(str(rem_r) + \" \" + str(rem_b) + \" \" + str(rem_g))\r\n\r\n if (rem_r + rem_b + rem_g >= 3 * mid):\r\n ans = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\n\r\nprint(ans)", "r, g, b = list(map(int, input().split()))\r\nprint(min(r + g, b + r, g + b, (r + g + b) // 3))\r\n", "r,g,b=map(int, input().split())\r\nt=(r+g+b)//3\r\ndef max(x,y,z): \r\n if x>=z and x>=y:\r\n return x\r\n if y>=x and y>=z:\r\n return y\r\n if z>=x and z>=y :\r\n return z\r\n \r\nif r+g+b-max(r,g,b)<t:\r\n t= r+g+b-max(r,g,b)\r\nprint(t)", "\r\nl=list(map(int,input().split(' ')))\r\n\r\nl.sort()\r\na=l[2]\r\nb=l[1]\r\nc=l[0]\r\n\r\nans=0\r\nlo, hi=0, 10000000000\r\n\r\ndef check(x):\r\n aa = min(a,2*x)\r\n bb = b\r\n if(aa>=x):\r\n bb=min(bb,3*x-aa)\r\n else:\r\n bb=min(bb,2*x)\r\n if(aa+bb<x):\r\n return False\r\n cc=min(c, 3*x-aa-bb)\r\n return (aa+bb+cc)//3>=x\r\nwhile(lo<=hi):\r\n mid=(lo+hi)//2\r\n if(check(mid)):\r\n ans=mid\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\nprint(ans)", "import sys\r\ninput=lambda: sys.stdin.readline().strip()\r\na,b,c=map(int,input().split())\r\nnlist=sorted([a,b,c])\r\nif 2*(nlist[0]+nlist[1])<nlist[2]:\r\n print(nlist[0]+nlist[1])\r\nelse:\r\n print(sum(nlist)//3)\r\n ", "lst = list(map(int, input().split(' ')))\nlst.sort()\nn,m,k = lst\nprint(min((n + m + k)//3, n + m))", "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\nA = list(map(int,input().split()))\nans = sum(A)//3\nfor i in range(3):\n l = 0\n for j in range(3):\n if i!=j:l+=A[j]\n if A[i]>l*2:ans=l;break\nprint(ans)", "a = sorted(list(map(int, input().split())))\r\nif a[0] + a[1] < sum(a)//3:\r\n print(a[0] + a[1])\r\nelse:\r\n print(sum(a)//3)", "l=list(map(int,input().split()))\r\ns=sum(l)\r\nprint(min(s//3,s-max(l)))\r\n", "r,g,b=map(int,input().split())\r\nx=max(r,g,b)\r\nif x<=2*(r+g+b-x):\r\n print(int((r+g+b)/3))\r\n exit()\r\nprint(r+g+b-x)\r\n", "a = list(map(int , input().split()))\r\na.sort()\r\nx = sum(a)//3\r\nif(a[0] + a[1] < x):\r\n x = a[0] + a[1]\r\nprint(x)", "\r\nr, g, b = map(int, input().split())\r\nsm, mx = r+g+b, max(r,g,b)\r\n\r\nprint(min((r+g+b)//3, sm-mx))\r\n", "r,g,b=map(int,input().split(\" \"))\r\ntable=(r+g+b)//3\r\nk=max(r,g,b)\r\nif k==r:\r\n print(min(table,g+b))\r\nelif k==g:\r\n print(min(table,r+b))\r\nelse:\r\n print(min(table,g+r))", "r, g, b = list(map(int, input().split()))\r\ncount = min((r+g+b) // 3, r+g, g+b, r+b)\r\nprint(count)\r\n", "r,g,b = map(int,input().split())\r\nout = 0\r\nif 2*(r+b+g - max(r,b,g)) < max(r,b,g) :\r\n print(r+b+g - max(r,b,g))\r\nelse :\r\n print((r+b+g)//3)", "from sys import stdin, setrecursionlimit\r\n#from math import ceil\r\nfrom collections import Counter\r\ninput = stdin.readline\r\n#setrecursionlimit(1000000)\r\n\r\na,b,c = map(int,input().split())\r\nif max(a,b,c)>2*(sum([a,b,c])-max(a,b,c)):\r\n print(sum([a,b,c])-max(a,b,c))\r\nelse:\r\n print(int(sum([a,b,c])/3))", "a = sorted(map(int, input().split()))\r\nprint(min(sum(a)//3, a[0]+a[1]))", "lst = list(map(int, input().split(' ')))\nn,m,k = lst\nres = (min(n, 2*m+2*k) + min(m, 2*n+2*k) + min(k, 2*m+2*n));\nprint(res//3);", "r,g,b = map(int,input().split()) \r\na = [r,g,b] \r\na.sort() \r\nprint(min(sum(a)//3 , (a[0]+a[1])))", "x=list(map(int,input().split()))\r\nx.sort()\r\nprint(min(sum(x)//3,x[0]+x[1]))", "l=sorted(map(int,input().split()))\r\nm1=l[-1]\r\nt=sum(l)//3\r\nif m1>t*2:\r\n print(min((l[0]+l[1]),t))\r\nelse:\r\n print(t)", "x,y,z=sorted([int(i) for i in input().split()])\r\nprint(min( (x+y+z)//3 , x+y ))", "a=list(map(int,input().split()))\r\nr, g, b = 0, 0, 0\r\nmini, maxi, ans = 0, 0, 0\r\na.sort()\r\nans = min(a[0] + a[1], (a[0] + a[1] + a[2]) // 3)\r\nprint(ans)", "nums = list(map(int,input().split()))\nnums.sort()\nfirst = nums[0] + nums[1]\nsecond = nums[2]\nanswer = first if first * 2 <= second else (first + second)//3\nprint(answer)", "a, b, c = map(int, input().split())\r\nprint(min(sum([a, b, c])//3, sum([a, b, c]) - max(a, b, c)))", "import bisect\nimport 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\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\ndef solve():\n r, g, b = get_ints()\n arr = [r, g, b]\n arr.sort()\n\n ans = arr[0]\n arr[-1] -= ans\n\n a = arr[1]\n b = arr[2]\n\n a, b = min(a, b), max(a, b)\n diff = b - a\n\n if diff >= arr[0]:\n b -= arr[0]\n else:\n b -= diff\n arr[0] -= diff\n req = arr[0]\n\n if req % 2 == 0:\n a -= req // 2\n b -= req // 2\n else:\n a -= (req//2 + 1)\n b -= req//2\n\n\n l = 0\n r = min(a, b)\n best = 0\n\n while l <= r:\n m = (l+r)//2\n\n a1 = a\n b1 = b\n\n a1 -= m\n b1 -= m\n\n if a1+b1 >= m:\n best = m\n l = m + 1\n else:\n r = m - 1\n \n best += ans\n\n print(best)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nsolve()", "a=sorted(list(map(int,input().split())))\r\nans=min(int((a[0]+a[1]+a[2])/3),int(a[1]+a[0]))\r\nprint(ans)", "a = list(map(int, input().split()))\r\n\r\na[0] = min(a[0], 2*(a[1]+a[2]))\r\na[1] = min(a[1], 2*(a[0]+a[2]))\r\na[2] = min(a[2], 2*(a[0]+a[1]))\r\n\r\nans = (a[0] + a[1] + a[2])//3\r\n\r\nprint(ans)\r\n", "r,g,b = map(int,input().split())\nprint(min(r+g,r+b,b+g,(r+b+g)//3))\n", "# 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\na = ints()\r\na.sort()\r\n\r\nif a[-1]>=2*(a[0]+a[1]):\r\n print(a[0]+a[1])\r\nelse:\r\n print(sum(a)//3)\r\n", "arr = tuple(map(int, input().split()))\narr = sorted(arr)\nans = sum(arr) // 3\nif 2 * (arr[0] + arr[1]) <= arr[2]:\n ans = arr[0] + arr[1]\nprint(ans) ", "r, g, b = sorted(map(int, input().split()))\r\n\r\nif b / 2 > r + g:\r\n print(r + g)\r\nelse:\r\n print((r + g + b) // 3)\r\n", "def main():\r\n r, b, g = map(int, input().split())\r\n print(min((r + b + g) // 3, min(r + b, min(r + g, b + g))))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "R , G , B = map(int ,input().split())\r\nif R+G==0 or R+B==0 or B+G==0:\r\n print(0)\r\n exit(0)\r\nl=[]\r\nl.append(R)\r\nl.append(G)\r\nl.append(B)\r\nl = sorted(l)\r\nx = l[2]//2\r\ny = x//2\r\nz = l[0] - min(y,l[0])\r\ng = l[1] - (x - min(y,l[0]))\r\nif l[0] + l[1]>x:\r\n l[2]-=x*2\r\n print(x + (l[2] + z + g)//3)\r\nelse:\r\n print(l[0] + l[1])\r\n\r\n", "a=list(map(int,input().split()))\r\na.sort()\r\nif 2*(a[0]+a[1])<=a[2]:\r\n print(a[0]+a[1])\r\nelse:\r\n print((a[0]+a[1]+a[2])//3)", "L=input().split()\r\nr=int(L[0])\r\ng=int(L[1])\r\nb=int(L[2])\r\nif (r>2*(g+b)):\r\n print(g+b)\r\nelif(g>2*(r+b)):\r\n print(r+b)\r\nelif(b>2*(g+r)):\r\n print(r+g)\r\nelse:\r\n print((r+g+b)//3)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\nimport math\r\n\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\ndef check(A):\r\n A[2] = min(A[2],(A[0]+A[1])*2)\r\n ans = sum(A)//3\r\n return ans\r\n\r\nans = check(A[::])\r\nprint(ans)", "a=sorted(list(map(int,input().split())))\r\nprint(min(a[0]+a[1],sum(a)//3))", "import math\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nc = [int(i) for i in input().split()]\r\nc.sort()\r\nprint(min(sum(c)//3, c[0]+c[1]))" ]

[ "s = input()\r\na = []\r\nfor i, c in enumerate(s):\r\n if c == '.':\r\n a.append(i)\r\nn = len(s)\r\nif not a or not 1 <= a[0] <= 8 or not 1 <= n - a[-1] - 1 <= 3:\r\n print('NO')\r\nelif not all(2 <= abs(y - x - 1) <= 11 for x, y in zip(a, a[1:])):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n st = 0\r\n for i in range(len(a) - 1):\r\n ed = a[i] + (1 if a[i + 1] - a[i] - 1 < 4 else 3) + 1\r\n print(s[st: ed])\r\n st = ed\r\n if st < n:\r\n print(s[st:])", "import sys\n\ndef fail():\n print('NO')\n sys.exit()\n\nparts = input().strip().split('.')\nn = len(parts)\nif n < 2:\n fail()\n\nresult = (n - 1) * [ None ]\nfor i in range(1, n):\n s, t = parts[i - 1], parts[i]\n a, b = len(s), len(t)\n if a < 1 or a > 8:\n fail()\n if b == 0:\n fail()\n c = max(1, min(3, b - 1))\n t, parts[i] = t[:c], t[c:]\n result[i - 1] = '%s.%s' % (s, t)\nresult[-1] += parts[-1]\nif len(result[-1][result[-1].index('.') + 1:]) > 3:\n fail()\n\nprint('YES')\nprint('\\n'.join(result))\n", "s = input()\nwords = []\nn = len(s)\ni = 0\nj = 0\nflag = 1\nword = \"\"\nwhile i < n and j < n and flag == 1:\n if s[i] != \".\":\n word += s[i]\n i += 1\n else:\n if 8>= (i - j) >= 1:\n word += \".\"\n i += 1\n # print(i, n, word)\n if i < n - 2 and \".\" not in s[i:i + 4]:\n # print(\"Here-1\")\n word += s[i:i + 3]\n i += 3\n j = i\n elif i < n - 1 and \".\" not in s[i:i + 3]:\n # print(\"Here-2\")\n word += s[i:i + 2]\n i += 2\n j = i\n elif i < n and \".\" not in s[i:i + 2]:\n # print(\"Here-3\")\n word += s[i:i + 1]\n i += 1\n j = i\n else:\n flag = 0\n break\n words.append(word)\n word = \"\"\n else:\n flag = 0\n break\n\nif flag == 0 or len(word) != 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n for x in words:\n print(x)", "s=input().split('.')\r\nif len(s[0])>8 or len(s[0])==0:\r\n print(\"NO\")\r\n exit()\r\nif len(s)<2:\r\n print(\"NO\")\r\n exit()\r\nif len(s[-1])>3 or len(s[-1])==0:\r\n print(\"NO\")\r\n exit()\r\nans,n=[],s[0]\r\nfor i in range(1,len(s)-1):\r\n if len(s[i])<2 or len(s[i])>11:\r\n print(\"NO\")\r\n exit()\r\n z=min(3,len(s[i])-1)\r\n ans.append(n+\".\"+s[i][:z])\r\n n=s[i][z:]\r\nans.append(n+\".\"+s[-1])\r\nprint(\"YES\")\r\nfor x in ans:\r\n print(x)\r\n", "s = input()\narr = s.split('.')\n\nfor i in arr:\n if len(i) == 0:\n print('NO')\n exit(0)\n\nif len(arr) < 2:\n print('NO')\n exit(0)\n\nans = ['']\nans[0] = arr[0]\n\nfor i in range(1, len(arr) - 1, 1):\n ans.append('')\n if len(arr[i]) > 3:\n ans[i - 1] = ans[i - 1] + '.' + arr[i][:3]\n ans[i] = arr[i][3:]\n else:\n ans[i - 1] = ans[i - 1] + '.'\n ans[i] = ''\n if len(arr[i]) == 1:\n ans[i] += arr[i]\n elif len(arr[i]) == 2:\n ans[i - 1] += arr[i][0]\n ans[i] += arr[i][1]\n elif len(arr[i]) == 3:\n ans[i - 1] += arr[i][:2]\n ans[i] += arr[i][2]\n\n # print(ans[i - 1], ans[i])\n\nans[len(ans) - 1] += '.' + arr[len(arr) - 1]\n\nfor i in ans:\n x = i.split('.')\n # print(x)\n if len(x) != 2 or len(x[0]) < 1 or len(x[0]) > 8 or len(x[1]) < 1 or len(x[1]) > 3:\n print('NO')\n exit(0)\n\nprint('YES')\nfor i in ans:\n print(i)\n\n \t\t\t \t \t\t \t \t \t \t \t \t", "s = input()\r\nparts = s.split(\".\")\r\n\r\nisPossible = len(parts) > 1 and 1 <= len(parts[0]) <= 8 and 1 <= len(parts[-1]) <= 3\r\nfor i in range(1, len(parts) - 1):\r\n isPossible &= 2 <= len(parts[i]) <= 11\r\n\r\nif isPossible:\r\n print(\"YES\")\r\n deleteFromStart = 0\r\n for i in range(1, len(parts)):\r\n print(parts[i - 1][deleteFromStart:], \".\", sep=\"\", end=\"\")\r\n deleteFromStart = max(1, len(parts[i]) - 8)\r\n if i == len(parts) - 1:\r\n print(parts[i])\r\n else:\r\n print(parts[i][:deleteFromStart])\r\nelse:\r\n print(\"NO\")", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n s = input()\r\n a = list(s.split('.'))\r\n # print(a)\r\n if len(a) == 1:\r\n print('NO')\r\n return\r\n if '' in a:\r\n print('NO')\r\n return\r\n if len(a[0]) > 8:\r\n print('NO')\r\n return\r\n if len(a[-1]) > 3:\r\n print('NO')\r\n return\r\n for i in range(1 , len(a)-1):\r\n if len(a[i]) > 11 or len(a[i]) <= 1:\r\n print('NO')\r\n return\r\n print('YES')\r\n print(a[0],end='.')\r\n for i in range(1,len(a)-1):\r\n if len(a[i]) > 3:\r\n print(a[i][:3])\r\n print(a[i][3:] , end='.')\r\n else:\r\n print(a[i][0])\r\n print(a[i][1:] , end = '.')\r\n print(a[-1])\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "str = input()\r\nlen_str = len(str)\r\np = [-1] * (len_str + 1)\r\np[len_str] = len_str\r\nfor i in range(len_str, 0, -1):\r\n if p[i] != -1:\r\n j = i - 1\r\n while j >= i - 4 and j >= 0 and str[j] != '.':\r\n j -= 1\r\n if j == i - 1 or j < i - 4 or j < 0:\r\n continue\r\n k = j - 1\r\n while k >= j - 8 and k >= 0 and str[k] != '.':\r\n p[k] = i\r\n k -= 1\r\nif p[0] == -1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n now = 0\r\n while now != len_str:\r\n for i in range(now, p[now]):\r\n print(str[i], end='')\r\n print()\r\n now = p[now]# 1691159126.7204769", "\"\"\"\nhttps://codeforces.com/problemset/problem/174/B\n\"\"\"\nchaine = input().split(\".\")\n\n\ndef extrait(c):\n if not (1 < (ll := len(c)) < 12):\n return False, 0, 0\n else:\n if ll == 11:\n return True, c[:3], c[3:]\n elif ll == 10:\n return True, c[:2], c[2:]\n else:\n return True, c[:1], c[1:]\n\n\nnoms = []\ntemp = chaine[0]\ntest = False\n\nif 0 < len(temp) < 9 and len(chaine) > 1:\n test = True\n for c in chaine[1:-1]:\n test, ext, suite = extrait(c)\n if not test:\n break\n noms.append((temp, ext))\n temp = suite\nif test:\n suite = chaine[-1]\n if 0 < len(suite) < 4:\n noms.append((temp, suite))\n else:\n test = False\nif test:\n print(\"YES\")\n for a, b in noms:\n print(a + \".\" + b)\nelse:\n print(\"NO\")\n", "import sys\r\n\r\ns = next(sys.stdin)\r\n\r\ndef cus_gen(post_iter, prefix, suffix):\r\n for _suffix, _prefix in post_iter:\r\n yield prefix+'.'+_suffix\r\n prefix = _prefix\r\n yield prefix+'.'+suffix\r\n \r\n\r\ndef gettoDaZe(x):\r\n n = len(x)\r\n front = min(3, n-1)\r\n return (x[:front], x[front:])\r\n\r\ndef solve(s):\r\n result = list()\r\n \r\n l = s.strip('\\s\\n').split('.')\r\n if len(l) < 2:\r\n return iter(result)\r\n else:\r\n if not (len(l[0]) >= 1 and len(l[0]) <= 8 and len(l[-1]) >= 1 and len(l[-1]) <= 3):\r\n return iter(result)\r\n if len(l) == 2:\r\n return iter([l[0]+'.'+l[1]])\r\n if not all(map(lambda x: len(x)<=11 and len(x) >=2, l[1:-1])):\r\n return iter(result)\r\n return cus_gen(map(gettoDaZe, l[1:-1]), l[0], l[-1])\r\n \r\nresult = solve(s)\r\nv = next(result, None)\r\nif v is None:\r\n sys.stdout.write('NO')\r\nelse:\r\n sys.stdout.write('YES')\r\n sys.stdout.write('\\n'+v)\r\n for v in result:\r\n sys.stdout.write('\\n'+v)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\n@Time ： 2022/11/19 12:27\r\n@Auth ： BHLL\r\n@File ：147B.py.py\r\n@IDE ：PyCharm\r\n@Motto:咕咕嘎嘎\r\n\"\"\"\r\nif __name__ == '__main__':\r\n S = input()\r\n t = S.split(\".\")\r\n F = True\r\n ans = []\r\n if len(t)==1:\r\n F = False\r\n else:\r\n # ans = []\r\n pre = \"\"\r\n n = len(t)\r\n for i in range(n):\r\n s = t[i]\r\n if i==0:\r\n if len(s)<1 or len(s)>8:\r\n F = False\r\n break\r\n else:\r\n pre = s\r\n elif i==n-1:\r\n if len(s)<1 or len(s)>3:\r\n F = False\r\n break\r\n else:\r\n ans.append(pre+'.'+s)\r\n else:\r\n if len(s)<2 or len(s)>11:\r\n F = False\r\n break\r\n else:\r\n endLen = max(1,len(s)-8)\r\n end = s[:endLen]\r\n ans.append(pre+'.'+end)\r\n pre = s[endLen:]\r\n if F is False:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n for item in ans:\r\n print(item)\r\n\r\n", "s=input()\r\nn=len(s)\r\na=s.find('.')\r\nb=s.rfind('.')\r\nfrom sys import exit\r\nif a==b==-1:print('NO');exit()\r\nif a==0 or n-b-1==0:print('NO');exit()\r\nif not 0<a<9 or not 0<n-b-1<4:print('NO');exit()\r\ns2=s[a+1:b+1]\r\nres=[s[:a+1]]\r\napp=res.append\r\nlength,item=0,''\r\nfor i,x in enumerate(s2):\r\n if x=='.':\r\n if not 1<length<12:print('NO');exit()\r\n k=0\r\n if length==11:res[-1]+=item[:3];k=3\r\n elif length==10:res[-1]+=item[:2];k=2\r\n else:res[-1]+=item[0];k=1\r\n app(item[k:]+'.')\r\n length,item=0,''\r\n else:length+=1;item+=x\r\nres[-1]+=s[b+1:]\r\nprint('YES')\r\nfor i,x in enumerate(res):print(x)", "s=input().split('.')\r\ny=0<len(s[0])<9and 0<len(s[-1])<4 and len(s)>1\r\nfor i in range(1,len(s)-1):\r\n\tif len(s[i])<2or len(s[i])>11:y=0\r\nprint(['NO','YES'][y])\r\nif y<1:exit()\r\nprint(s[0],end='')\r\nfor i in range(1,len(s)-1):print('.'+[s[i][0]+'\\n'+s[i][1:],s[i][:3]+'\\n'+s[i][3:]][len(s[i])>3],end='')\r\nprint('.'+s[-1])" ]

[ "n = int(input())\na = [int(i) for i in input().split()]\n\na.sort()\n\nif n % 2 == 0:\n\tx = n // 2\nelse:\n\tx = (n + 1) // 2\n\nprint(a[x-1])\n\n", "n=int(input())\nintList=list(map(int,input().split()))\nintList.sort()\nif(n%2):\n print(intList[n//2])\nelse:\n print(intList[n//2-1])\n\t\t\t\t\t\t\t\t \t\t \t \t \t \t\t\t \t\t", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nprint(A[n//2 - (1 if n % 2 == 0 else 0)])", "def main():\n n = int(input())\n points = [int(x) for x in input().split()]\n points.sort()\n print(points[(n - 1) // 2])\n\nmain()\n", "n = int(input())\nline = sorted(list(map(int, input().split())))\na = 0\nfor i in range(1, n):\n a += (line[i] - line[0])\nind = line[0]\nrasst = a\nfor i in range(1, n):\n r = abs(line[i] - line[i - 1])\n a1 = a - (n - i - 1) * r + (i - 1) * r\n if a1 < rasst:\n rasst = a1\n ind = line[i]\n a = a1\nprint(ind)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-07 17:25:33\nLastEditTime: 2021-11-07 17:31:42\nDescription: Optimal Point on a Line\nFilePath: CF710B.py\n'''\n\n\ndef func():\n n = int(input())\n position = sorted(map(int, input().strip().split()))\n if n % 2 == 0:\n print(position[n // 2 - 1])\n else:\n print(position[n // 2])\n\n\nif __name__ == '__main__':\n func()\n", "positions_number = int(input())\nsec_line_input = input()\nsec_line = sec_line_input.split(\" \")\nsec_line = [int(i) for i in sec_line]\nsec_line = sorted(sec_line)\nif len(sec_line)%2 == 0:\n print(sec_line[len(sec_line)//2-1])\nelse:\n print(sec_line[len(sec_line)//2])\n\t\t\t\t\t\t\t\t\t \t\t\t\t \t\t \t\t \t \t\t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif(n%2==0):\r\n i=int(n/2)\r\n i=i-1\r\n print(l[i])\r\nelse:\r\n i=int((n+1)/2)\r\n print(l[i-1])\r\n", "n = int(input())\na = input().split(\" \")\nfor i in range(len(a)):\n a[i] = int(a[i])\na.sort()\nif(len(a)%2==0):\n print(a[int(len(a)/2)-1])\nelse:\n print(a[int(len(a)/2)])\n", "n = int(input())\r\na = sorted(map(int, input().split()))\r\nprint(a[n // 2 - (1 if n & 1 == 0 else 0)])\r\n", "n = int(input())\nx = sorted(list(map(int, input().split())))\nP, N = 0, 0\na = n * [0]\nfor i in range(1, n):\n P = abs((x[i] - x[i - 1])) * i + P\n N = abs(x[-i] - x[-i - 1]) * i + N\n a[i] += P\n a[-i - 1] += N\nprint(x[a.index(min(a))])\n", "n = int(input())\ndata = list(map(int,input().split(\" \")))\ndata.sort()\nif n%2 ==0:\n print(\"%d\"%(data[n//2-1]),end=\"\")\nelse :\n print(\"%d\"%(data[n//2]),end=\"\")\n\n\n\n\n\n\n \t \t \t \t\t \t \t \t\t\t \t\t\t\t\t \t", "n = int(input())\r\nw = sorted(map(int, input().split()))\r\nprint(w[(n-1)//2])\r\n", "def find_optimal_point(n, a):\r\n a.sort() \r\n return a[(n + 1) // 2 - 1] \r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n result = find_optimal_point(n, a)\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1690651633.731189", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\ndef solve():\r\n n=int(input())\r\n data=list(map(int,input().split()))\r\n data.sort()\r\n print(data[(n-1)//2]) # 4 - 1 5 2 \r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "a = int(input())\r\nb = sorted(list(map(int , input().split())))\r\nprint(b[(a-1)//2])", "\r\nn = int(input())\r\nl = list(map(int, input().strip().split(' ')))\r\nl.sort()\r\na = {0:'even',1:'odd'}\r\ns = sum(l)\r\nif a[n%2] is 'even' :\r\n n-=1\r\n sum1 = 0\r\n for k in l:\r\n sum1 += abs(k-l[int(n/2)])\r\n sum2 = 0\r\n for k in l:\r\n sum2 += abs(k-l[int((n+1)/2)])\r\n if sum1 > sum2 :\r\n print(l[int((n+1)/2)])\r\n else :\r\n print(l[int(n/2)])\r\n\r\nelse :\r\n n-=1\r\n print(l[int(n/2)])", "n=int(input())\r\npos=sorted(list(map(int,input().split())))\r\n\r\nprint(pos[n//2-(1-n%2)])", "n=int(input())\nnums = list(map(int,input().split(' ')))\nnums=sorted(nums)\nif n%2==1:\n print(nums[n//2])\nelse:\n print(nums[n//2-1])\n\t\t\t\t \t \t \t \t\t\t\t\t\t \t\t \t\t \t", "a = int(input())\r\ng = list(map(int, input().split()))\r\ng.sort()\r\nprint(g[(a-1)//2])", "n = int(input())\nxs = list(map(int, input().split()))\nxs.sort()\n\nif n % 2 == 0:\n print(xs[(n - 1)// 2])\nelse:\n print(xs[n // 2])\n", "#arr.sort(key=lambda x:x[0])\r\n#print(arr)\r\n\r\nn = int(input())\r\nls = list(map(int, input().split()))\r\nls.sort()\r\nprint(ls[(n//2)] if n%2!=0 else ls[(n//2)-1])\r\n\r\n\r\n", "n=int(input())\r\ns=input().split()\r\nfor i in range(n):\r\n\ts[i]=int(s[i])\r\ns.sort()\t\r\nif n%2!=0:\r\n print(s[n//2])\r\nelse:\r\n print(s[n//2-1]) ", "def main():\n n = int(input())\n\n arr = map(int, str(input()).split())\n arr = list(sorted(arr))\n\n if n % 2 == 0:\n n = int(n / 2)\n else:\n n = int(n/2 + 1)\n\n print(arr[n - 1])\nmain()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nx=n//2\r\nif n%2==0:\r\n x-=1\r\nprint(l[x])", "def solve():\r\n n = int(input())\r\n arr = sorted(list(map(int, input().split())))\r\n ans = n // 2 if n % 2 == 1 else n//2-1\r\n print(arr[ans])\r\n \r\n \r\nif __name__ == '__main__':\r\n solve()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nls=[0 for i in range(1,n+1)]\r\nls[0]=l[0]\r\nfor i in range(1,n):\r\n ls[i]=l[i]+ls[i-1]\r\ndis=(10**15)*(4)\r\n#print(ls)\r\nans=10**15\r\nfor i in range(0,n):\r\n x=l[i]*(i+1)-l[i]*(n-(i+1))-ls[i]+ls[-1]-ls[i]\r\n #print(x)\r\n if x<dis:\r\n dis=x\r\n ans=l[i]\r\nprint(ans)", "n=int(input())\r\nnums = list(map(int,input().split(' ')))\r\nnums=sorted(nums)\r\nif len(nums)%2==0:\r\n print(nums[len(nums)//2 -1])\r\nelse:\r\n print(nums[len(nums)//2])\r\n", "import sys\ninput=sys.stdin.readline\nn=int(input())\npoints=list(map(int,input().strip().split()))\npoints.sort()\n\nif n%2==1:\n n=(n//2)\nelse:\n n=(n//2)-1\nprint(points[n])\n\t\t\t \t\t \t\t \t\t\t\t\t\t \t \t\t \t\t\t", "# Enter your code here. Read input from STDIN. Print output to STDOUT\r\n\r\nif __name__ == '__main__':\r\n\tt = int(input().strip())\r\n\tn = [int(x) for x in input().strip().split(\" \")]\r\n\tn.sort()\r\n\tif t % 2 == 0:\r\n\t\ta = (t//2)-1\r\n\telse:\r\n\t\ta = t//2\r\n\tprint(n[a])", "n=int(input().strip())\na=list(map(int,input().split()))\na.sort()\nprint(a[int((n-1)/2)])\n \t \t \t \t \t\t \t \t \t \t", "n=int(input())\nl=input().split(\" \")\np=[int(x) for x in l]\np.sort()\nif (n&1==0): ans=n//2-1\nelse: ans=n//2\nprint(p[ans])", "n = int(input())\r\nL = list(map(int,input().split()))\r\nL.sort()\r\nif n%2 == 0:\r\n ans = n//2 - 1\r\nelse:\r\n ans = n//2\r\n\r\nprint(L[ans])", "n = int(input())\narr = list(map(int,input().split()))\narr.sort()\nif n%2:\n print(arr[n//2])\nelse:\n print(arr[n//2-1])\n\t\t\t \t\t \t\t \t\t \t \t \t\t \t\t\t", "#in the name of god\r\n#Mr_Rubick\r\nn=int(input())+1\r\nprint(sorted(map(int,input().split()))[n//2-1])", "n = int(input())\nlst = list(map(int, input().split()))\n\n\nlst.sort()\n\nif n%2 == 0:\n\tn = n//2-1\nelse:\n\tn = n//2\nprint(lst[n])", "import sys\ninput=sys.stdin.readline\nn=int(input())\nseq=sorted([int(i) for i in input().split()])\nprint(seq[(n-1)//2])\n\n\t\t\t \t \t \t \t \t\t\t \t \t \t", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\nb.sort()\r\nif a%2==0:\r\n print(b[a//2-1])\r\nelse:\r\n print(b[a//2])", "input()\nl = list(map(int, input().split(\" \")))\nif len(l) % 2 == 0:\n print(sorted(l)[len(l)//2 - 1])\nelse:\n print(sorted(l)[len(l) // 2])\n\n# minSum = float('inf')\n# candidates = []\n#\n# for x in range(0, len(l)):\n# sum = 0\n#\n# for index in range(0, len(l)):\n# sum += abs(l[x] - l[index])\n#\n# if sum < minSum:\n# minSum = sum\n# candidates = [x]\n# elif sum == minSum:\n# candidates.append(x)\n#\n# print(l[sorted(candidates)[0]])\n", "if __name__ == '__main__':\n n = int(input())\n nums = list(map(int, input().split()))\n nums.sort()\n if n % 2 == 0:\n ans = n // 2 - 1\n else:\n ans = n // 2\n print(nums[ans])\n\n \t \t \t \t\t \t\t \t\t\t \t\t\t\t \t\t\t\t", "MOD = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn=ii()\r\nl=sorted(il())\r\nprint(l[(n-1)//2])", "N = int(input())\r\nnumber_list = list(map(int, input().split(\" \")))\r\nnumber_list.sort()\r\n\r\nmid = len(number_list) // 2\r\nif len(number_list) % 2 == 0:\r\n median = (number_list[mid - 1] + number_list[mid]) / 2.0\r\nelse:\r\n median = number_list[mid]\r\n\r\nmin_value = min(abs(i - median) for i in number_list)\r\n\r\ntemp = []\r\nfor j in number_list:\r\n if abs(j - median) == min_value:\r\n temp.append(j)\r\n\r\nprint(temp[0])", "n=int(input())\na=list(input().split())\nfor i in range(len(a)):\n a[i]=int(a[i])\na.sort()\nif n%2==0:\n print(a[int((n/2)-1)])\nelse:\n print(a[int(((n+1)/2)-1)])\n ", "def main():\r\n n = int(input())\r\n dots = [int(el) for el in input().split()]\r\n dots.sort() # O(n*log(n))\r\n \r\n print(dots[(n + 1) // 2 - 1])\r\n \r\n\r\nif __name__ == '__main__':\r\n main()", "if __name__ == \"__main__\":\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n arr.sort()\r\n print(arr[(1+n)//2-1])", "import sys\r\nreadline=sys.stdin.readline\r\nN=int(readline())\r\nX=list(map(int,readline().split()))\r\nX.sort()\r\nans=X[(N-1)//2]\r\nprint(ans)", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nlst.sort()\r\nprint(lst[int(n / 2 + 0.5) - 1])", "n= int(input())\r\nx = sorted(list(map(int,input().split())))\r\nprint(x[int((len(x)-0.5)/2)])\r\n", "import heapq\ndef heapsort(iterable):\n h = []\n for value in iterable:\n heapq.heappush(h, value)\n return [heapq.heappop(h) for i in range(len(h))]\n\na = int(input())\nb = list(map(int, input().split(\" \")))\nb = heapsort(b)\nif a%2 == 1:\n print(b[a//2])\nelse:\n print(b[a//2 - 1])\n \t\t\t\t\t\t\t\t\t\t \t\t\t\t\t\t\t\t\t\t \t\t", "n=int(input())\nx=sorted([int(i) for i in input().split()])\n\nprint(x[(n-1)//2])\n\t \t \t \t \t\t \t\t\t\t\t \t \t\t \t \t \t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nmid = (n-1)//2\r\nprint(a[mid])", "n, x = int(input()), sorted(list(map(int, input().split())))\r\nprint(x[(n - 1) // 2])", "n = int(input())\r\narr = sorted(list(map(int,input().split())))\r\nif len(arr) % 2 == 0:\r\n print(arr[len(arr) // 2 - 1])\r\nelse:\r\n print(arr[len(arr) // 2])", "n = int(input().strip())\nxis = list(map(int, input().strip().split(' ')))\n\nsort_xis = sorted(xis)\nif n % 2 == 0:\n print(sort_xis[int(n/2)-1])\nelse:\n print(sort_xis[n//2])\n\n\n \t\t\t \t\t \t\t\t\t\t \t\t \t\t\t\t \t\t", "n = int(input())\nx = sorted(list(map(int, input().split())))\nprint(x[n // 2 - 1]) if n % 2 == 0 else print(x[n // 2])\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\nif(n%2==1):\r\n print(l[n//2])\r\nelse:\r\n k1=l[n//2]\r\n k2=l[(n//2)-1]\r\n d1,d2=0,0\r\n for i in range(n):\r\n d1+=abs(l[i]-k1)\r\n for i in range(n):\r\n d2+=abs(l[i]-k2)\r\n if(d1<d2):\r\n print(k1)\r\n else:\r\n print(k2)", "import math\nimport re\n\nn = int(input())\n\narr = list(map(int, input().split()))\narr = sorted(arr)\nprint(arr[math.ceil(n/2) - 1])\n\n\n\n# arr = list(map(int, input().split()))\n# m = int(input())\n# spis = list(map(int, input().split()))\n#\n# arr1 = sorted(arr, reverse=True)\n# a = [n - arr1.index(arr[el - 1]) for el in spis]\n# print(' '.join(map(str, a)))", "n = int(input())\r\na = map(int, input().split())\r\na = list(a)\r\na.sort()\r\nprint(a[(n - 1) // 2])\r\n", "n,s = int(input()),sorted(list(map(int,input().split())))\r\nif n % 2:\r\n print(s[n // 2])\r\nelse:\r\n print(s[n // 2 - 1])", "n = int(input())\nX = [int(i) for i in input().split()]\nX.sort()\nprint(X[(n-1)//2])\n\t \t\t\t\t\t\t\t\t\t\t\t\t \t\t\t\t\t \t \t\t\t", "amount = int(input())\r\ndots = [int(i) for i in input().split()]\r\ndots = sorted(dots)\r\nprint(dots[int((amount-1)/2)])", "# B. Optimal Point on a Line\r\nn = int(input())\r\nx = [int(val) for val in input().split()]\r\n\r\nx.sort()\r\n\r\nprint(x[(n-1)//2])", "# LUOGU_RID: 101608380\nn, *a = map(int, open(0).read().split())\r\nprint(sorted(a)[(n - 1) // 2])", "n = int(input())\r\npoints = list(map(int,input().strip().split()))\r\npoints.sort()\r\nif n == 1:\r\n print(points[0])\r\nelse:\r\n print(points[n//2+(-1)*(n%2 == 0)])", "n=int(input())\r\nx=[int(q) for q in input().split()]\r\nx=sorted(x)\r\n\r\nif n&1==0:\r\n print(x[n//2 -1])\r\nelse:\r\n print(x[n//2])", "n = int(input())\n\nx = list(map(int, input().split()))\n\nx.sort()\n\nif n % 2 == 1:\n print(x[n//2])\nelse:\n print(x[n//2-1])", "N=int(input())\r\nnumbers = [int(n) for n in input().split()]\r\nnumbers.sort()\r\nif(N%2==1):\r\n Ans=numbers[N//2]\r\n print(Ans)\r\nelse:\r\n Ans=numbers[(N//2)-1]\r\n print(Ans)\r\n", "n=int(input())\ns=list(map(int,input().split()))\ns.sort()\nif(n%2==0):\n index=int(n/2)-1\n print(s[index])\nelse:\n index=int(n/2)\n print(s[index])\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 = sorted(map(int, input().split()))\r\nprint(x[n//2+n%2-1])", "N = int(input())\r\nx = list(map(int, input().split()))\r\nprint(sorted(x)[(N - 1) // 2])", "n=int(input())\r\nq=sorted(list(map(int,input().split())))\r\nprint(q[(n-1)//2])\r\n ", "def opPoint(arr, point):\r\n range = 0\r\n for t in arr:\r\n range += abs(point - t)\r\n return range\r\n\r\ndef diff(len, ind, val):\r\n return (2 * ind - len ) * val\r\n\r\nlen = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nav = sum(a) / len\r\nmin_ind = a[0]\r\nmin_range = opPoint(a, a[0])\r\nlast_r = min_range\r\nfor i in range(1, len):\r\n last_r = last_r + diff(len, i, a[i] - a[i-1])\r\n if(min_range > last_r):\r\n min_range = last_r\r\n min_ind = a[i]\r\n\r\nprint(min_ind)\r\n", "from sys import stdin\r\nn = int(input())\r\narr = list(map(int,stdin.readline().split()))\r\narr.sort()\r\n\r\nm = int(n/2)\r\nif(n % 2 == 0):\r\n print(arr[m-1])\r\nelse:\r\n print(arr[m])", "x = int(input())\r\nls = list(map(int, input().split()))\r\nls.sort()\r\nif (x & 1):\r\n print(ls[x // 2])\r\nelse:\r\n print(ls[(x // 2) - 1])", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nif n % 2 != 0:\r\n print(a[(n+2)//2-1])\r\nelse:\r\n print(a[n//2-1])", "n = int(input())\nX = list(map(int, input().split()))\nX.sort()\nif n%2 == 1:\n print(X[n//2])\nelse:\n print(X[n//2-1])\n", "\ndef solve(n, x):\n x.sort()\n return x[(n-1)//2]\n\nn = int(input())\nx = [int(_) for _ in input().split()]\nprint(solve(n, x))\n \n", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nh=len(l)\r\nif h%2==0:\r\n h=int((h/2)-1)\r\nelse:\r\n h=int(h//2)\r\nprint(l[h])", "#\n# Joseph Matsushita\n# Problem D\n#\n\nn = int(input())\na = list(map(int, input().split()))\n\na.sort()\nif(n % 2 == 0):\n print(a[int(n/2)-1])\nelse:\n print(a[int(n/2)])\n\n\t \t \t \t\t\t \t \t\t \t \t\t \t\t", "n=int(input())\narr=list(map(int,input().split()))\narr.sort()\nindex=int((n+1)/2)-1\nprint(arr[index])\n\t\t \t\t\t \t \t \t \t\t", "a=int(input())\r\nx=sorted(list(map(int,input().split())))\r\nprint(x[(a+1)//2-1])", "count = int(input())\nnums = sorted([int(num) for num in input().split()])\n\nprint(nums[(count - 1) // 2])\n\n\t \t \t \t \t\t\t \t \t\t\t\t \t\t", "\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nfrom collections import defaultdict, Counter\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nimport math\r\n\r\ndef I():\r\n return(int(input()))\r\ndef lint():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n# Python program to print all\r\n# primes smaller than or equal to\r\n# n using Sieve of Eratosthenes\r\n\r\nimport heapq\r\n\r\ndef ask(a,b,c):\r\n print(f\"? {a} {b} {c}\")\r\n sys.stdout.flush()\r\n res=int(input())\r\n sys.stdout.flush()\r\n return res\r\n\r\n\r\n\r\nn=I()\r\ns=lint()\r\n\r\nq=sum(s)\r\n\r\n\r\ns.sort()\r\np=0\r\nr=0\r\nans=1e20\r\nfor i in s:\r\n tmp=(q-p)-(n-r)*i+r*i-p\r\n if ans>tmp:\r\n ans=tmp\r\n idx=i\r\n \r\n \r\n r+=1\r\n p+=i\r\nprint(idx)\r\n", "def start():\r\n a=int(input())\r\n b=list(map(int,input().split()))\r\n b.sort()\r\n l=a//2-1\r\n if a%2==1:\r\n l+=1\r\n print(b[l])\r\nstart()\r\n", "a = int(input())\nb = [int(i) for i in input().split()]\nb.sort()\nprint(b[((len(b)+1)//2)-1])", "# Name: Sachdev Hitesh\r\n# College : GLSICA\r\nn = int(input())\r\nls = sorted(list(map(int,input().split())))\r\nif (n&1==0):\r\n\tans=n//2-1\r\nelse:\r\n\tans=n//2\r\nprint(ls[ans])\r\n", "n = int(input())\nnumbers = list(map(int, input().split()))\nnumbers.sort()\nnumbers\n\nprint(numbers[((n+1)//2)-1])\n \t\t\t \t\t\t \t \t \t \t\t \t \t\t\t\t", "n = int(input())\r\nlist1 = sorted(list(map(int, input().split())))\r\nprint(list1[(n - 1) // 2])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(sorted(l)[(n-1)//2])", "from math import ceil\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nx.sort()\r\nprint(x[ceil(n/2) - 1])", "n = int(input())\r\nx = sorted(map(int, input().split()))\r\nans = x[(n - 1) // 2]\r\nprint(ans)\r\n", "n = int(input())\narr = list(map(int , input().split()))\narr.sort()\nprint(arr[int((n-1)/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\nl.sort()\r\n\r\nif n % 2 == 0:\r\n print(l[int(n / 2) - 1])\r\nelse:\r\n print(l[n // 2])", "n=int(input());a=[int(i) for i in input().split()]\r\na.sort()\r\nif n%2:i=n//2\r\nelse:i=n//2-1\r\nprint(a[i])", "n = int(input())\r\nx = sorted(map(int,input().split()))\r\nprint(x[(n-1)//2])", "import math\r\nn = int(input())\r\nT = input()\r\nnum = [int(x) for x in T.split()]\r\nnum.sort()\r\np = math.ceil(n / 2)\r\nprint(num[p - 1])", "n = int(input())\r\na = input().split(\" \")\r\na = sorted([int(i) for i in a])\r\nprint(a[int((n-1) / 2)])\r\n", "n = int(input())\r\ns = list(map(int, input().strip().split()))\r\ns.sort()\r\nprint(s[int(n/2) - 1] if n % 2 == 0 else s[int(n/2)])", "n = int(input())\r\ns = list(map(int, input().split()))\r\ns.sort()\r\nprint(s[(len(s) - 1) // 2])", "n = int(input())\r\nar = list(map(int, input().split()))\r\nar.sort()\r\npos = int((n+1)/2)\r\nprint(ar[pos-1])", "n = int(input())\nli = list(map(int, input().split()))[:n]\nli.sort()\nif n % 2 == 0:\n m = n // 2 - 1\nelse:\n m = n // 2 \nprint(li[m])\n\t\t \t \t \t\t \t\t \t\t\t\t\t \t \t\t\t", "n=int(input())+1\r\nprint(sorted(map(int,input().split()))[n//2-1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif(len(l)%2==0):\r\n print(l[len(l)//2-1])\r\nelse:\r\n print(l[len(l)//2])", "# @name: E - Optimal Point on a Line\n# @author: AbrarShakhi\n# @link: https://vjudge.net/contest/593770#problem/E\n\ndef solution():\n n = int(input())\n a = sorted(cin.asList())\n\n if n % 2 == 0:\n print(a[n//2 - 1])\n else:\n print(a[n//2])\n\n# endef\n\n\nclass Console:\n def asList(self, func=int, sep=\" \"):\n return [func(i) for i in input().split(sep)]\n\n def asIter(self, func=int, sep=\" \"):\n return map(func, input().split(sep))\n\n\ncin = Console()\ntc = 1\n# tc = int(input())\nwhile tc > 0:\n solution()\n tc -= 1\n\n \t\t \t\t\t\t\t \t \t\t \t\t\t\t \t\t\t \t\t", "n=int(input())\r\na=sorted(list(map(int, input().split())))\r\ntemp=n//2\r\nif n%2:\r\n \r\n print(a[temp])\r\nelse:\r\n ele1=a[temp]\r\n ele2=a[temp-1]\r\n sum1=0\r\n sum2=0\r\n for i in range(n):\r\n sum1+=abs(a[i]-ele1)\r\n sum2+=abs(a[i]-ele2)\r\n if sum2 <= sum1:\r\n print(ele2)\r\n else:\r\n print(ele1)", "\r\nn = int(input())\r\na =list(map(int, input().split()))\r\nprint(sorted(a)[(n-1)//2])", "__author__ = 'Think'\r\nn=int(input())\r\npoints=sorted([int(i) for i in input().split()])\r\nprint(points[(n-1)//2])\r\n" ]

[ "n, m = map(int, input().split())\r\nstop = False\r\nfor _ in range(m):\r\n k, *a = map(int, input().split())\r\n s = set(a)\r\n if all(x > 0 or -x not in s for x in a):\r\n stop = True\r\nif stop:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def compare(x):\r\n\treturn abs(x)\r\n\r\na = []\r\nn, m = map(int, input().split())\r\nfor i in range(m):\r\n\tx = list(map(int, input().split()))\r\n\tx = x[1:]\r\n\ta.append(x)\r\nfor i in range(0, len(a)):\r\n\ta[i].sort(key=compare)\r\n\r\nfor i in a:\r\n\tx = i[0]\r\n\tcnt = 0\r\n\tfor j in i[1:]:\r\n\t\tif x + j != 0:\r\n\t\t\tcnt += 1\r\n\t\tx = j\r\n\tif cnt == len(i) - 1:\r\n\t\tprint(\"YES\")\r\n\t\texit(0)\r\nprint(\"NO\")\r\n", "n, m = map(int, input().split())\r\ndp_amount = 0\r\nfor i in range (m):\r\n array = list(map(int, input().split()))\r\n dp_array1 = [False] * n\r\n dp_array2 = [False] * n\r\n dp_proof = True\r\n for i in range (1, len(array)):\r\n if (array[i] > 0):\r\n dp_array1[array[i] - 1] = True\r\n else:\r\n dp_array2[abs(array[i]) - 1] = True\r\n if ((dp_array2[abs(array[i]) - 1]) and (dp_array1[abs(array[i]) - 1])):\r\n dp_proof = False\r\n break \r\n if (dp_proof):\r\n dp_amount += 1\r\n break\r\nif (dp_amount == 0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def main():\n n, m = map(int, input().split())\n ans = False\n for _ in range(m):\n group = list(map(int, input().split()))[1:]\n group = set(group)\n\n safe = False\n for x in group:\n if -x in group:\n safe = True\n\n ans = ans or (not safe)\n\n print(\"YES\" if ans else \"NO\")\n\nmain()\n", "n, m = map(int, input().split())\r\nfor i in range(m):\r\n\tl = list(map(int, input().split()))\r\n\tl = set(l[1:])\r\n\tfor e in l:\r\n\t\tif (-e) in l:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(\"YES\")\r\n\t\texit(0)\r\nprint(\"NO\")", "n, m = map(int, input().split())\r\n\r\nbad = 0\r\nfor _ in range(m):\r\n v = [0]*(n+1)\r\n ok = 0\r\n for u in [int(i) for i in input().split()[1:]]:\r\n au = abs(u)\r\n su = 1 if u < 0 else 2\r\n v[au] |= su\r\n if v[au] == 3: ok = 1\r\n if not ok: bad = 1\r\n\r\nprint(\"YES\" if bad else \"NO\")\r\n", "n,m=map(int,input().split())\r\nflag=True\r\nfor i in range(m):\r\n t=list(map(int,input().split()))\r\n if flag:\r\n del t[0]\r\n p=list(set(t))\r\n length=len(p)\r\n kk=set()\r\n for a in p:\r\n kk.add(abs(a))\r\n if len(kk) == length:\r\n flag=False\r\n print(\"YES\")\r\nif flag:\r\n print(\"NO\")\r\n", "n,m = map(int, input().split())\r\nfor i in range(m):\r\n a = list(map(int, input().split()))\r\n s = set()\r\n for i in range(1,len(a)):\r\n s.add(a[i])\r\n k = list(s)\r\n isok = 0\r\n for i in range(len(k)):\r\n if -k[i] in s:\r\n isok = 1\r\n if not isok:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n \r\n \r\n \r\n ", "q,p= map(int, input().split())\r\ndestroy = False\r\n \r\nwhile p > 0:\r\n group = [int(grp) for grp in input().split()][1:]\r\n \r\n if len(group) == 1:\r\n destroy = True\r\n break\r\n \r\n group = [abs(grp) for grp in list(set(group))]\r\n old_size = len(group)\r\n group = list(set(group))\r\n \r\n if len(group) == old_size:\r\n destroy = True\r\n break\r\n \r\n p -= 1\r\n \r\nif destroy:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# https://codeforces.com/problemset/problem/787/B\r\n\r\nn, m = map(int, input().split()) # n = number of universes, m = number of gorups\r\ngroup_information = [None for _ in range(m)] # List of lists containing group information\r\nfor i in range(m):\r\n group_information[i] = list(map(int, input().split()[1:])) # Remove first element (number of people in group)\r\n\r\n'''\r\nThe first element in group information is the number of people in that group\r\nThe remaining elements are the people in that group\r\n\r\nIf the person is denoted with a negative number, it is a Rick\r\nIf the person is denoted with a positive number, it is a Morty\r\nThe universe they are from is the absolute value of the number\r\n\r\nWe should assume evil (greedy approach), so the only way that it will be safe for Summer\r\nis if within all groups, there contains some (-i, i) such that it is then impossible for\r\nit to be only evil members.\r\n'''\r\n\r\nflag = True # Will be set to false if it is not safe\r\ni = 0\r\nwhile (flag and i < m):\r\n\r\n group_nums = set() # Set people the same people can join a group -- faster lookup\r\n all_evil = True # Assume all evil until proven otherwise\r\n\r\n for num in group_information[i]:\r\n if -1*num in group_nums: # If the opposite person is in the group, it is safe because only one can be evil\r\n all_evil = False\r\n break\r\n group_nums.add(num)\r\n \r\n if all_evil:\r\n flag = False # Not safe\r\n \r\n i +=1\r\n\r\nif not flag: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\n\n\ndef possibly_all_traitors(group):\n member_set = set()\n for member in group[1:]:\n if (-member in member_set):\n return False\n else:\n member_set.add(member)\n return True\n \n\nin1 = input()\n#in1 = '4 2'\n\nin_str = in1.split()\nplanets = int(in_str[0])\ngroups = int(in_str[1])\n\n\nfor i in range(groups):\n g = list(map(int, input().split()))\n if possibly_all_traitors(g):\n print('YES')\n sys.exit(0)\n \nprint('NO')", "n, m = map(int, input().split()) # Universe, Group\n\nfor i in range(m):\n members = list(map(int, input().split()))[1:]\n h1 = set()\n h2 = set()\n for m in members:\n if m < 0:\n h1.add(abs(m))\n else:\n h2.add(m)\n if not h1.intersection(h2):\n print(\"YES\")\n exit(0)\n\nprint(\"NO\")\n\n\n", "def main():\n n, m = map(int, input().split())\n for _ in range(m):\n _, *l = input().split()\n rm = set()\n for a in l:\n if a[0] == '-':\n if a[1:] in rm:\n break\n else:\n if '-' + a in rm:\n break\n rm.add(a)\n else:\n print(\"YES\")\n return\n print(\"NO\")\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\r\nfor i in range(m):\r\n good = 0\r\n morty = set()\r\n rick = set()\r\n now = list(map(int, input().split()))[1:]\r\n for c in now:\r\n if c < 0:\r\n morty.add(abs(c))\r\n if abs(c) in rick:\r\n good = 1\r\n if c > 0:\r\n rick.add(abs(c))\r\n if abs(c) in morty:\r\n good = 1\r\n if not good:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "# - *- coding: utf- 8 - *-\r\n\"\"\"\r\nCreated on Thu Mar 23 23:30:23 2017\r\n\r\nName: MD. Khairul Basar\r\nPhone: 01760446942\r\nEmail: [email protected]\r\n\"\"\"\r\n\r\nn,m = map(int, input().split());\r\nans = \"NO\";\r\n\r\nfor i in range(m):\r\n arr = list(map(int, input().split()));\r\n map_it = dict();\r\n flag = True;\r\n for j in range(1, arr[0]+1):\r\n if(arr[j] not in map_it):\r\n map_it.update({arr[j]:True});\r\n for j in range(1, arr[0]+1):\r\n if((arr[j] in map_it) and (-arr[j] in map_it)):\r\n flag = False;\r\n break;\r\n if(flag):\r\n ans = \"YES\";\r\nprint(ans);", "s = input().split()\nn, m = map(int, s)\n# print(n, m)\n\ngroups = []\n\nfor i in range(m):\n s = input().split()\n s = list(map(int, s))\n k = s[0]\n vi = set(s[1:])\n groups.append(vi)\n# print(groups)\n\ndef check_safe(group):\n for v in group:\n if -v in group:\n return True\n return False\n\nshould_cancel = 'NO'\nfor g in groups:\n if not check_safe(g):\n should_cancel = 'YES'\n break\n\nprint(should_cancel)", "n, m = map(int,input().split())\r\nfor i in range(m):\r\n a, *b = map(int,input().split())\r\n b = set(b)\r\n for j in b:\r\n if -j in b:\r\n break\r\n else:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nflag1 = 0\r\nfor i in range(m):\r\n\ta = list(map(int, input().split()))\r\n\ta = set(a[1:])\r\n\tflag = 0\r\n\tfor x in a:\r\n\t\tif -x in a:\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\tif not flag:\r\n\t\tflag1 = 1\r\n\t\tbreak\r\nprint('YES' if flag1 else 'NO')", "n,m = map(int, input().split(\" \"))\nans = False\nfor i in range(m):\n\tpsg = []\n\tk, *psg = map(int, input().split(\" \"))\n\n\tok = False\n\ts = set()\n\tfor j in range(k):\n\t\tif -psg[j] in s:\n\t\t\tok = True\n\t\t\tbreak\n\t\telse:\n\t\t\ts.add(psg[j])\n\n\tif not ok:\n\t\tans = True\n\t\tbreak\n\nif ans:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n, m = (int(x) for x in input().strip().split(' '))\ngroups = []\nfor _ in range(m):\n group = [int(x) for x in input().strip().split(' ')][1:]\n groups.append(group)\n\ndef verify_group(group):\n checked = set([])\n for x in group:\n if -x in checked:\n return True\n checked.add(x)\n return False\n\nresult = True\nfor group in groups:\n if not verify_group(group):\n result = False\n break\n\nprint('NO') if result else print('YES')\n", "n, m = [int(i) for i in input().split()]\r\n\r\ndef check(line):\r\n\tfor i in line:\r\n\t\tif -i in line:\r\n\t\t\treturn True\r\n\treturn False\r\n\t\r\nfor _ in range(m):\r\n\tline = set([int(i) for i in input().split()][1:])\r\n\tif not check(line):\r\n\t\tprint('YES')\r\n\t\texit()\r\n\r\nprint('NO')\r\n", "n,m=map(int,input().split())\nflag=0\nfor i in range(m):\n\tarr=list(map(int,input().split()))\n\td={}\n\tfor j in range(arr[0]):\n\t\tif (-arr[j+1] in d):\n\t\t\tflag+=1\n\t\t\tbreak\n\t\telse:\n\t\t\td[arr[j+1]]=True\nif flag==m:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")", "n,k=map(int,input().split(' '))\r\nfor i in range(k):\r\n m=set((list(map(int,input().split(' '))))[1:])\r\n for x in m:\r\n if -x in m:\r\n break\r\n else:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "N, M = map( int, input().split() )\r\nfor _1 in range( M ):\r\n A = list( map( int, input().split() ) )[ 1 : ]\r\n bag, found = set(), False\r\n for v in A:\r\n if - v in bag:\r\n found = True\r\n bag.add( v )\r\n if not found:\r\n exit( print( \"YES\" ) )\r\nprint( \"NO\" )\r\n", "\r\n\r\nn,m=[int(j) for j in input().split()]\r\nflag=0\r\nc=0\r\nfor k in range(m):\r\n\tseen = set()\r\n\tx=[int(j) for j in input().split()]\r\n\tx=x[1:]\r\n\tx=list(set(x))\r\n\ty=[abs(int(a)) for a in x]\r\n\tif (not any(i in seen or seen.add(i) for i in y))==True:\r\n\t\tflag=1\r\n\t\tbreak\r\n\telse:\r\n\t\tc+=1\r\n\r\nif flag==1:\r\n\tprint(\"YES\")\r\nif c==m:\r\n\tprint(\"NO\")\r\n\r\n", "R=lambda:list(map(int,input().split()))\r\nn,m=R()\r\na=0\r\nwhile m>0 and a==0:\r\n b=R()[1:]\r\n d,k=dict(),0\r\n for i in b:\r\n if -i in d: k=1\r\n d[i]=1\r\n if k==0: a=1\r\n m-=1\r\nprint(\"NO\"if a==0 else\"YES\")", "\n\nn, m = map(int, input().split())\n\ndont_end = True\n\nfor _ in range(m):\n k, *elements = list(map(int, input().split()))\n some_set = set(elements)\n good = False\n for x in some_set:\n if (-x) in some_set:\n good = True\n break\n if not good:\n dont_end = False\n\nif dont_end:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "k, m = map(int, input().split())\r\n\r\n\r\nfor i in range(m):\r\n x = False\r\n a = list(map(int, input().split() ))\r\n a.remove(a[0])\r\n \r\n for char in a:\r\n if -1*char in a:\r\n x = True\r\n break\r\n if not x:\r\n break\r\nif x:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "def solution(vals):\n lis = []\n for val in vals:\n if -val not in lis:\n lis.append(val)\n else:\n #no hay pedo\n return False\n #si no rompio arriba, si hay pedo\n return True\n\ndef main():\n universos, grupos = [int(x) for x in input().split()]\n for i in range(grupos):\n n, *vals = [int (x) for x in input().split()]\n\n if solution(vals):\n print(\"YES\")\n return\n print(\"NO\")\nmain()\n", "n, m = map(int,input().split())\r\nfor i in range(m):\r\n k,*l = map(int,input().split())\r\n l = set(l)\r\n for j in l:\r\n if -j in l:\r\n break\r\n else:\r\n exit(print(\"YES\"))\r\nprint(\"NO\")\r\n", "n, m = (int(x) for x in input().split())\r\n\r\nres = False\r\n\r\nfor l in range(m):\r\n\tk, *a = (int(x) for x in input().split())\r\n\tsafe = False\r\n\tmem = []\r\n\tfor i in range(len(a)):\r\n\t\tif -(a[i]) in mem:\r\n\t\t\tsafe = True\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tmem.append(a[i])\r\n\tif not safe:\r\n\t\tres = True\r\nprint(\"YES\" if res else \"NO\")", "def func(arr,k):\r\n lst = [0]*(n+2)\r\n for i in arr:\r\n if i>=0:\r\n lst[i] = 1\r\n for i in arr:\r\n if i<0:\r\n if lst[-i] == 1:\r\n return False\r\n return True\r\ncheck = 0\r\nn,m = map(int,input().split())\r\nfor i in range(m):\r\n k,*arr = list(map(int,input().split()))\r\n if func(arr,k):\r\n print('YES')\r\n check = 1\r\n break\r\nif check==0:\r\n print('NO')\r\n", "n, m = map(int, input().split())\r\nfor i in range(m):\r\n a = list(map(int, input().split()))\r\n a = a[1:]\r\n used = set()\r\n st = False\r\n for j in a:\r\n if -j in used:\r\n st = True\r\n else:\r\n used.add(j)\r\n if not st:\r\n break\r\nif st:\r\n print(\"NO\")\r\nelse:\r\n print('YES')\r\n", "n, m = map(int, input().split(' '))\ngroupsAnswers = []\nflag = True\n\n\n\ndef main(gropNum, rms):\n\tglobal flag, groupsAnswers\n\tRicks = []\n\tMorties = []\n\tfor man in rms:\n\t\tif man < 0:\n\t\t\tRicks.append(abs(man))\n\t\telse:\n\t\t\tMorties.append(man)\n\tif flag:\n\t\tfor Rick in Ricks:\n\t\t\tfor Morty in Morties:\n\t\t\t\tif Rick == Morty:\n\t\t\t\t\tgroupsAnswers.append('NO')\n\t\t\t\t\treturn\n\t\tgroupsAnswers.append('YES')\n\t\tflag = False\n\t\treturn\n\nfor i in range(m):\n\tgropNum, *rms = map(int, input().split(' '))\n\tmain(gropNum, rms)\n\nif 'YES' in groupsAnswers:\n\tprint('YES')\nelse:\n\tprint('NO')", "from sys import stdin, stdout\r\n\r\nn, m = map(int, stdin.readline().split())\r\n\r\nfor i in range(m):\r\n challengers = list(set(list(map(int, stdin.readline().split()))[1:]))\r\n s = set()\r\n label = 1\r\n \r\n for j in range(len(challengers)):\r\n if -challengers[j] in s:\r\n label = 0\r\n \r\n s.add(challengers[j])\r\n \r\n \r\n if label:\r\n stdout.write('YES')\r\n break\r\nelse:\r\n stdout.write('NO')", "n, m = map(int, input().split())\r\n\r\nfor i in range(m):\r\n bad = True\r\n l = set(map(int, input().split()[1:]))\r\n for j in l:\r\n if -j in l:\r\n bad = False\r\n break\r\n \r\n if bad:\r\n break\r\n \r\nprint(\"YES\" if bad else \"NO\")", "from collections import Counter as c\r\na,b=map(int,input().split())\r\nfor _ in \" \"*b:\r\n c,*d=map(int,input().split())\r\n for i in d:\r\n if -i in d:\r\n break\r\n else:exit(print(\"YES\"))\r\nprint(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\nuni,g = map(int,input().split())\r\ncheck = 0\r\nfor i in range(g):\r\n lst = list(map(int,input().split()))\r\n myset = set(lst[1:])\r\n z = 0\r\n for i in myset:\r\n if -i not in myset:\r\n z+=1\r\n if z==len(myset):\r\n check=g\r\nif check:\r\n print('YES')\r\nelse:\r\n print('NO')", "a,b = map(int, input().split())\r\nd = False\r\n\r\nwhile b > 0:\r\n group = [int(g) for g in input().split()][1:]\r\n\r\n if len(group) == 1:\r\n d = True\r\n break\r\n\r\n group = [abs(g) for g in list(set(group))]\r\n old_size = len(group)\r\n group = list(set(group))\r\n\r\n if len(group) == old_size:\r\n d = True\r\n break\r\n\r\n b -= 1\r\n\r\nif d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\r\nans = \"NO\"\r\nfor i in range(m):\r\n v = set(list(map(int, input().split()))[1:])\r\n ans = \"YES\"\r\n for vi in v:\r\n if -vi in v:\r\n ans = \"NO\"\r\n break\r\n if ans == \"YES\":\r\n break\r\nprint(ans)", "n,m = map(int,input().split())\r\nf = 0\r\nfor _ in range(m):\r\n arr = set(list(map(int,input().split()))[1:])\r\n sa = set(abs(x) for x in arr)\r\n if len(sa)!=len(arr):\r\n continue\r\n else:\r\n f = 1\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = map(int, input().split())\r\nfor j in range(m):\r\n s = set(map(int, input().split()[1:]))\r\n if all(-x not in s for x in s):\r\n print('YES')\r\n exit()\r\nprint('NO')", "n, m = list(map(int, input().split()))\r\nans = \"NO\"\r\nfor i in range(m):\r\n a = set()\r\n line = list(map(int, input().split()))\r\n answer = False\r\n for j in range(1, len(line)):\r\n if -line[j] in a:\r\n answer = True\r\n break\r\n a.add(line[j])\r\n if not answer:\r\n ans = \"YES\"\r\n break\r\nprint(ans)", "import sys\r\n\r\ndef isDoomed(l):\r\n s = set(l)\r\n for e in s:\r\n if -e in s:\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\nfor mm in range(m):\r\n l = list(map(int, input().split()))[1:]\r\n if isDoomed(l):\r\n print('YES')\r\n sys.exit()\r\nprint('NO')", "n, m = map(int, input().split())\n\ndestroy = False\nwhile m > 0:\n\tgroup = [int(g) for g in input().split()][1:]\n\n\tif len(group) == 1:\n\t destroy = True\n\t break\n\n\tgroup = [abs(g) for g in list(set(group))]\n\told_size = len(group)\n\tgroup = list(set(group))\n\n\tif len(group) == old_size:\n\t destroy = True\n\t break\n\n\tm -= 1\n\nif destroy:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "\r\nn,m=map(int,input().split())\r\nfor _ in range(m):\r\n k,*l=map(int,input().split())\r\n l=set(l)\r\n for x in l:\r\n if -x in l: break\r\n else: print('YES'); break\r\nelse: print('NO')", "n, m = map(int, input().split())\r\nfor _ in range(m):\r\n q = list(map(int, input().split()))\r\n q = q[1:]\r\n alen = len(set(q))\r\n q = list(map(abs, q))\r\n if alen == len(set(q)):\r\n print('YES')\r\n exit()\r\nprint('NO')", "# -*- coding: utf-8 -*-\r\nn, m = map(int, input().split(' '))\r\nt = []\r\nr = \"NO\"\r\nfor i in range(m):\r\n l = list(map(int, input().split(' ')))[1::]\r\n t.append(l)\r\nfor i in t:\r\n rik = []\r\n morti = []\r\n if r == \"YES\": break\r\n for j in i:\r\n if j<0 and j not in rik:\r\n j = abs(j)\r\n rik.append(j)\r\n if j in morti:\r\n r = \"NO\"\r\n break\r\n else:\r\n r = \"YES\"\r\n elif j>0 and j not in morti:\r\n morti.append(j)\r\n if j in rik:\r\n r = \"NO\"\r\n break\r\n else:\r\n r = \"YES\"\r\nprint(r)", "def test(l):\r\n l1=[]\r\n l2=[]\r\n for i in range(len(l)):\r\n if l[i]<0 and l[i] not in l2:\r\n l2.append(l[i])\r\n elif l[i]>0 and l[i] not in l1:\r\n l1.append(l[i])\r\n if len(l1)==0 or len(l2)==0:\r\n return False\r\n for x in l1:\r\n if (x*(-1)) in l2:\r\n return True\r\n for x in l2:\r\n if (x*(-1)) in l1:\r\n return True\r\n return False\r\nn,m=input().strip().split(' ')\r\nn,m=(int(n),int(m))\r\nfor t_0 in range(m):\r\n list1=list(map(int,input().strip().split(' ')))\r\n if test(list1[1:])==False:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "from collections import Counter as c\r\na,b=map(int,input().split())\r\nfor _ in \" \"*b:\r\n z=c(list(map(abs,set(map(int,input().split()[1::])))))\r\n if max(z.values())==1:exit(print(\"YES\"))\r\nprint(\"NO\")", "def main():\r\n n,m = map(int,input().split())\r\n\r\n for i in range(0,m):\r\n mk = True\r\n mp = set()\r\n ar = [int(i) for i in input().split()[1:]]\r\n #print(ar)\r\n for i in ar:\r\n if (-i) in mp:\r\n mk = False\r\n break\r\n mp.add(i)\r\n if mk:\r\n print(\"YES\")\r\n return;\r\n print(\"NO\")\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "R = lambda: map(int, input().split())\r\nn,m= R()\r\nfor _ in range(m):\r\n x=set(list(R())[1:])\r\n l=set(map(abs,x))\r\n if len(x)==len(l):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "n, m = map(int, input().split())\r\n\r\nans = 'NO'\r\nfor i in range(m):\r\n a = list(map(int, input().split()))[1: ]\r\n s = set()\r\n new_ans = False\r\n for j in range(len(a)):\r\n s.add(a[j])\r\n if -a[j] in s:\r\n new_ans = True\r\n break\r\n \r\n if not new_ans:\r\n ans = 'YES'\r\n break\r\n\r\nprint(ans)", "n, m = map(int, input().split())\r\nglflag = False\r\nfor i in range(m):\r\n arr = list(map(int, input().split()))\r\n used = [0] * n\r\n flag = False\r\n for j in range(1, len(arr)):\r\n if arr[j] * used[abs(arr[j]) - 1] < 0:\r\n flag = True\r\n break\r\n else:\r\n if arr[j] < 0:\r\n used[abs(arr[j]) - 1] = -1\r\n else:\r\n used[abs(arr[j]) - 1] = 1\r\n \r\n if not flag:\r\n print('YES')\r\n glflag = True\r\n break\r\nif not glflag:\r\n print('NO')", "n,k=map(int,input().split())\r\nf=1 \r\nfor i in range(k):\r\n l=[int(i) for i in input().split()]\r\n l=l[1:]\r\n f=0 \r\n for i in l:\r\n if -i in l:\r\n f=1 \r\n if not f:\r\n print('YES')\r\n exit() \r\nprint('NO')\r\n ", "n, m = input().split()\r\nn, m = int(n), int(m)\r\ngroups = []\r\nfor i in range(m):\r\n\traw = [int(x) for x in input().split()]\r\n\tgroups.append(set(raw[1:]))\r\nfor group in groups:\r\n\thas_opposite = [(-x in group) for x in group]\r\n\tif not any(has_opposite):\r\n\t\tprint('YES')\r\n\t\texit()\r\nprint('NO')\r\n\t\t", "n, m = map(int, input().split())\n\n\ndef main():\n for i in range(m):\n g = list(map(int, input().split()))\n k = g[0]\n\n free = set()\n maybe = True\n for j in range(1, k + 1):\n if -g[j] in free:\n maybe = False\n break\n else:\n free.add(g[j])\n\n if (len(free) > 0) and maybe:\n return \"YES\"\n\n return \"NO\"\n\nprint(main())", "from collections import Counter, defaultdict\r\n\r\n\r\ndef main():\r\n n, m = [int(i) for i in input().split()]\r\n for _ in range(m):\r\n lista = defaultdict(lambda : False)\r\n for i in input().split()[1::]:\r\n lista[i]=True\r\n meh = Counter([abs(int(i)) for i in lista]).most_common(1)\r\n if meh[0][1]==1:\r\n print(\"YES\")\r\n return None\r\n print(\"NO\")\r\n\r\nmain()\r\n", "n,m = map(int,input().split())\r\nisDanger = False\r\nfor i in range(m):\r\n if isDanger:\r\n break\r\n isDanger = True\r\n l=input().split()\r\n k=int(l.pop(0))\r\n s=set()\r\n for no in l:\r\n no=int(no)\r\n if -no in s:\r\n isDanger = False\r\n break\r\n s.add(no)\r\n\r\nif isDanger:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\n\r\nn, m = map(int, input().split())\r\n\r\na = []\r\nfor _ in range(m):\r\n a.append(set(map(int, input().split()[1:])))\r\n\r\nfor i in a:\r\n for j in i:\r\n if -j in i:\r\n break\r\n else:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nfor _ in range(m):\r\n c, *w = list(map(int, input().split()))\r\n d = dict()\r\n x = 0\r\n for i in w:\r\n if d.get(-i, 0) < 1:\r\n d[i] = 1\r\n else:\r\n x = 1\r\n break\r\n if x == 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "n, m = list(map(int, input().split()))\nls = [list(map(int, input().split())) for _ in range(m)]\nans = 'NO'\nfor kv in ls:\n k = kv[0]\n v = kv[1:]\n s = set(v)\n if len(s) == len(set(map(abs, s))):\n ans = 'YES'\n break\n\nprint(ans)\n", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\nfrom collections import defaultdict\n\ndef ri():\n return map(int, input().split())\n\n\nn, m = ri()\n\nfor i in range(m):\n aa = defaultdict(lambda : set())\n a = list(ri())\n for i in range(1, len(a)):\n aa[abs(a[i])].add(a[i])\n\n if len(aa[abs(a[i])]) > 1:\n break\n else:\n print(\"YES\")\n exit()\nprint(\"NO\")\n\n\n\n", "n,m=map(int,input().split())\r\nfor i in range(m):\r\n l=list(map(int,input().split()));d={}\r\n for i in l[1:]:\r\n d[i]=d.get(i,0)+1\r\n flag=True\r\n for i in d:\r\n if -i in d:flag=False;break\r\n if flag:print(\"YES\");exit()\r\nprint(\"NO\")\r\n\r\n", "R=lambda:list(map(int,input().split()))\nn,m=R()\na=0\nwhile m>0 and a==0:\n b=R()[1:]\n d,k=dict(),0\n for i in b:\n if -i in d: k=1\n d[i]=1\n if k==0: a=1\n m-=1\nprint(\"NO\"if a==0 else\"YES\")\n", "n, m = map(int, input().split())\nc = False\nfor i in range(m):\n\tflag = True\n\tg = list(map(int, input().split()))[1:]\n\tif c: continue\n\tg = list(set(g))\n\tg.sort(key=lambda x: abs(x))\n\tfor i in range(len(g)-1):\n\t\tif g[i]==-g[i+1]:\n\t\t\tflag = False\n\t\t\tbreak\n\tif flag:\n\t\tc = True\n\nif c:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "from sys import stdin, stdout\n\ndoomed=False\nn, m = map(int, stdin.readline().rstrip().split())\n\nfor _ in range(m):\n groupInfo = [int(a) for a in stdin.readline().rstrip().split()]\n groupSet=set()\n doomGroup=True\n for i in groupInfo[1:]:\n if -i in groupSet:\n doomGroup=False\n break\n else:\n groupSet.add(i)\n if doomGroup:\n doomed=True\n\nif doomed:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import sys\r\n\r\n\r\ndef is_dangerous(group):\r\n finded = [0] * 10001\r\n if len(group) < 2:\r\n return True\r\n for e in group:\r\n universe = e if e > 0 else -e\r\n if finded[universe] != 0 and finded[universe] != e:\r\n return False\r\n finded[universe] = e\r\n return True\r\n\r\n\r\n[n, m] = [int(x) for x in input().split(\" \")]\r\ngroups = [[]]*m\r\n\r\nfor g in range(m):\r\n groups[g] = [int(x) for x in input().split(\" \")]\r\n groups[g].pop(0)\r\n\r\nfor group in groups:\r\n if (is_dangerous(group)):\r\n print(\"YES\")\r\n sys.exit()\r\n\r\nprint(\"NO\")\r\nsys.exit()\r\n\r\n# print(groups)\r\n", "from collections import Counter\nR = lambda: map(int, input().rstrip().split())\nn, m = R()\nmat = []\nfor _ in range(m):\n mat.append(list(R()))\nfor x in mat:\n c = Counter(x[1:x[0] + 1])\n flag = 0\n for y in c:\n if c[y] > 0 and c[-y] > 0:\n flag = 1\n if flag == 0:\n print(\"YES\")\n exit()\nprint(\"NO\")" ]

[ "n = int(input())\r\nper = list(map(int,input().split()))\r\nd = [0] + list(map(int,input().split()))\r\np = [i for i in range(n+1)]\r\ndef find(node):\r\n while p[node] != node:\r\n p[node] = p[p[node]]\r\n node = p[node]\r\n return node\r\n\r\ndef union(n1,n2):\r\n p1 = find(n1)\r\n p2 = find(n2)\r\n\r\n if p1 != p2:\r\n p[p1] = p2\r\n\r\nfor i in range(1,n+1):\r\n if i-d[i] > 0 and i - d[i] <= n:\r\n union(i,i-d[i])\r\n if i + d[i] > 0 and i + d[i] <= n:\r\n union(i,i+d[i])\r\nfor i in range(n):\r\n pa = find(per[i])\r\n pa1 = find(i+1)\r\n if pa != pa1: print(\"NO\");break\r\nelse:\r\n print(\"YES\")", "import sys; R = sys.stdin.readline\r\nS = lambda: map(int,R().split())\r\nfrom collections import deque\r\n\r\nn = int(R())\r\na = [0]+[*S()]\r\nb = [*S()]\r\ne = [[] for _ in range(n+1)]\r\nfor i,x in enumerate(b,1):\r\n if i+x<=n: e[i] += i+x,; e[i+x] += i,\r\n if 1<=i-x: e[i] += i-x,; e[i-x] += i,\r\n\r\nvv = [0]*(n+1)\r\nfor i in range(1,n+1):\r\n if not vv[i]:\r\n vv[i] = 1\r\n c,d = [i],[a[i]]\r\n q = deque([i])\r\n while q:\r\n u = q.popleft()\r\n for v in e[u]:\r\n if not vv[v]:\r\n vv[v] = 1\r\n c += v,; d += a[v],; q += v,\r\n if sorted(c)!=sorted(d): print(\"NO\"); exit()\r\nprint(\"YES\")", "import collections\r\nn=int(input())\r\narr=[i+1 for i in range(n)]\r\ntar=[int(i) for i in input().split()]\r\nfav=[int(i) for i in input().split()]\r\npar=[i for i in range(n)]\r\n\r\ndef find(x):\r\n if x!=par[x]:\r\n par[x]=find(par[x])\r\n return par[x]\r\n \r\ndef union(x,y):\r\n px,py=par[find(x)],par[find(y)]\r\n par[px]=py\r\n\r\nfor i in range(len(arr)):\r\n if i+fav[i]<n:union(i,i+fav[i])\r\n if i-fav[i]>=0:union(i,i-fav[i])\r\n\r\n \r\ncnt=[collections.Counter() for i in range(n)]\r\nfor idx,i in enumerate(arr):\r\n cnt[find(idx)][i]+=1 \r\n \r\ncheck=True\r\nfor idx,i in enumerate(tar):\r\n gr=find(idx)\r\n if not cnt[gr][i]:\r\n check=False\r\n break \r\n cnt[gr][i]-=1 \r\nprint('YES' if check else 'NO')", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[[] for i in range(n)]\r\nfor i in range(n):\r\n if i-b[i]>=0:\r\n c[i].append(i-b[i])\r\n c[i-b[i]].append(i)\r\n if i+b[i]<n:\r\n c[i].append(i+b[i])\r\n c[i+b[i]].append(i)\r\nv=[1]*n\r\ndef dfs(u):\r\n global v,c\r\n v[u]=0\r\n for i in c[u]:\r\n if v[i]:\r\n dfs(i)\r\nfor i in range(n):\r\n v=[1]*n\r\n dfs(a[i]-1)\r\n if v[i]:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "import math,sys,bisect,heapq,os\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\nfrom functools import lru_cache\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ndef input(): return sys.stdin.readline().rstrip('\\r\\n')\r\n#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\naj = lambda: list(map(int, input().split()))\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\ndef solve():\r\n\tG = defaultdict(list)\r\n\r\n\tdef addEdge(a,b):\r\n\t\tG[a].append(b)\r\n\t\tG[b].append(a)\r\n\r\n\tdef dfs(node):\r\n\t\td = deque()\r\n\t\td.append(node)\r\n\t\tvis[node] = True\r\n\t\tind = [];t = []\r\n\t\twhile d:\r\n\t\t\tx = d.pop()\r\n\t\t\tind.append(x)\r\n\t\t\tt.append(A[x])\r\n\t\t\tfor i in G.get(x,[]):\r\n\t\t\t\tif not vis[i]:\r\n\t\t\t\t\tvis[i] = True\r\n\t\t\t\t\td.append(i)\r\n\t\tind.sort(reverse = True)\r\n\t\tt.sort(reverse = True)\r\n\t\twhile t:\r\n\t\t\tAns[ind.pop()] = t.pop()\r\n\r\n\r\n\tn, =aj()\r\n\tvis = [False]*(n+1)\r\n\r\n\tA = aj()\r\n\tB = aj()\r\n\tfor i in range(n):\r\n\t\tp = B[i]\r\n\t\tif i - p >= 0:\r\n\t\t\taddEdge(i-p,i)\r\n\t\tif i + p < n:\r\n\t\t\taddEdge(i,i+p)\r\n\r\n\tAns = [-1]*n\r\n\tfor i in range(n):\r\n\t\tif not vis[i]:\r\n\t\t\tdfs(i)\r\n\tY(Ans == sorted(Ans))\r\n\r\n\r\n\r\ntry:\r\n\t#os.system(\"online_judge.py\")\r\n\tsys.stdin = open('input.txt', 'r') \r\n\tsys.stdout = open('output.txt', 'w')\r\nexcept:\r\n\tpass\r\n\r\nsolve()", "n=int(input())\r\nperm=list(map(int,input().split()))\r\nfav=list(map(int,input().split()))\r\nadj=[[] for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n if (i-fav[i-1]) in range(1,n+1):\r\n adj[i].append(i-fav[i-1])\r\n adj[i-fav[i-1]].append(i)\r\n if (i+fav[i-1]) in range(1,n+1):\r\n adj[i].append(i+fav[i-1])\r\n adj[i+fav[i-1]].append(i)\r\nfor i in range(n):\r\n q=[perm[i]];vis=[True]*(n+1)\r\n vis[perm[i]]=False;flag=0\r\n if perm[i]==i+1:flag=1\r\n while len(q)!=0:\r\n r=q.pop()\r\n for j in adj[r]:\r\n if vis[j]:\r\n vis[j]=False\r\n q.append(j)\r\n if i+1==j:\r\n flag=1;break\r\n if flag==1:break\r\n if flag==0:\r\n exit(print('NO'))\r\nprint('YES')", "n=int(input())\r\norden= input().split()\r\nfav= input().split()\r\narr=[]\r\n\r\nfor i in range(n):\r\n orden[i]=int(orden[i])\r\n fav[i]=int(fav[i])\r\n arr.append(i)\r\n\r\ndef union(el):\r\n if arr[el] != el: \r\n arr[el] = union(arr[el])\r\n return arr[el]\r\n\r\ncont=0\r\nfor i in fav:\r\n if cont >= i: \r\n arr[union(cont)] = union(cont - i)\r\n if cont < n - i: \r\n arr[union(cont)] = union(cont + i)\r\n cont += 1\r\n\r\nflag = True\r\nfor i in range(n):\r\n if union(arr[i])==union(orden[i]-1):\r\n continue\r\n else:\r\n flag = False\r\n \r\nif flag: \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nfrom collections import defaultdict,Counter\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nD = [i for i in range(1,N+1)]\r\n\r\nP = [[] for _ in range(N)]\r\nfor i in range(N):\r\n b = B[i]\r\n if i-b>=0:\r\n P[i].append(i-b)\r\n P[i-b].append(i)\r\n if i+b<N:\r\n P[i].append(i+b)\r\n P[i+b].append(i)\r\n \r\nseen = [0]*N\r\ndef paint(idx, color):\r\n v = [idx]\r\n while v:\r\n i = v.pop()\r\n if seen[i]:continue\r\n seen[i] = color\r\n for j in P[i]:\r\n if seen[j]:continue\r\n v.append(j)\r\n \r\ncolor = 0\r\nfor i in range(N):\r\n if seen[i]==0:\r\n color+=1\r\n paint(i,color)\r\n\r\nlib = defaultdict(Counter)\r\nfor i in range(N):\r\n lib[seen[i]][A[i]]+=1\r\n lib[seen[i]][D[i]]+=1\r\n\r\nfor k,v in lib.items():\r\n for k2,v2 in v.items():\r\n if v2!=2:\r\n exit(print('NO'))\r\n \r\nprint('YES')\r\n", "n=int(input())\np=list(map(int, input().split()))\nd=list(map(int, input().split()))\nc = list(range(n))\ndef m(x):\n if c[x] != x: c[x] = m(c[x])\n return c[x]\nfor x, k in enumerate(d):\n if x >= k: c[m(x)] = m(x - k)\n if x < n - k: c[m(x)] = m(x + k)\nprint('YES' if all(m(x) == m(y - 1) for x, y in zip(c, p)) else 'NO')\n\n\t\t\t \t \t\t\t \t \t \t\t\t\t \t \t \t\t \t", "n = int(input())\r\nl = list(map(lambda x: int(x) - 1, input().split()))\r\nf = list(map(int, input().split()))\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n self.parent[self.find(b)] = self.find(a)\r\n\r\nUF = UnionFind(n)\r\nfor i in range(n):\r\n if 0 <= i - f[i]:\r\n UF.union(i, i - f[i])\r\n if i + f[i] < n:\r\n UF.union(i, i + f[i])\r\n\r\nworks = True\r\n\r\nfor i in range(n):\r\n if UF.find(i) == UF.find(l[i]):\r\n pass\r\n else:\r\n works = False\r\n break\r\n\r\nif works:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "# LUOGU_RID: 111130512\nfrom sys import stdin \ninput = stdin.readline \n\ndef get() : \n return map(int,input().split())\n\nn = int(input()) \nlst = [0] + list(get()) \nf = [[0] * 110 for i in range(110)] \n\nfor i in range(1, n + 1) : \n f[i][i] = 1 \n\nt = [0] + list(get()) \nfor i in range(1, n + 1) : \n j = t[i] \n if i - j >= 1 : f[i][i - j] = 1 \n if i + j <= n : f[i][i + j] = 1 \n\nfor k in range(1, n + 1) : \n for i in range(1, n + 1) : \n for j in range(1, n + 1) : \n f[i][j] |= (f[i][k] & f[j][k]) | (f[i][k] & f[k][j])\n\nfor i in range(1, n + 1) : \n if not f[i][lst[i]] : \n print('NO') \n exit() \n\nprint(\"YES\")\n", "\"\"\" Prositka\r\n6.11.2022\"\"\"\r\n\r\nn, p, d = int(input()), [x - 1 for x in list(map(int, input().split()))], list(map(int, input().split()))\r\ng = [[False] * n for _ in range(n)]\r\nfor i in range(n):\r\n g[i][i] = True\r\n if i - d[i] >= 0:\r\n g[i][i - d[i]] = g[i - d[i]][i] = True\r\n if i + d[i] < n:\r\n g[i][i + d[i]] = g[i + d[i]][i] = True\r\nfor k in range(n):\r\n for i in range(n):\r\n for j in range(n):\r\n g[i][j] |= g[i][k] & g[k][j]\r\nans = True\r\nfor i in range(n):\r\n ans &= g[i][p[i]]\r\nprint(\"YES\" if ans else \"NO\")", "n = int(input())\r\np = [int(i)-1 for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nparent = [i for i in range(n+3)]\r\nsize = [1 for i in range(n+3)]\r\ndef find(v):\r\n while(v!=parent[v]):\r\n parent[v]=parent[parent[v]]\r\n v = parent[v]\r\n return v\r\ndef union(v1,v2):\r\n v1= find(v1)\r\n v2 = find(v2)\r\n if v1==v2:\r\n return\r\n if size[v1]<size[v2]:\r\n parent[v1]=v2\r\n size[v2]+=size[v1]\r\n else:\r\n parent[v2]=v1\r\n size[v1]+=size[v2] \r\n\r\nfor i in range(n):\r\n if i-c[i]>=0:\r\n union(i,i-c[i])\r\n if i+c[i]<n:\r\n union(i,i+c[i])\r\nfor i in range(n):\r\n if find(p[i])!=find(i):\r\n print('NO')\r\n exit(0)\r\nprint('YES')\r\n \r\n", "#!/bin/python3\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.parent = [i for i in range(n)]\r\n self.rank = [1] * n\r\n \r\n def find(self, x):\r\n \r\n while(x != self.parent[x]):\r\n self.parent[x] = self.parent[self.parent[x]]\r\n x = self.parent[x]\r\n \r\n return x\r\n \r\n def union(self, x, y):\r\n if x < 0 or x >= len(self.parent) or y < 0 or y >= len(self.parent):\r\n return\r\n x_p, y_p = self.find(x), self.find(y)\r\n if x_p == y_p:\r\n return\r\n x_rk, y_rk = self.rank[x_p], self.rank[y_p]\r\n if x_rk > y_rk:\r\n self.parent[y_p] = x_p\r\n else:\r\n self.parent[x_p] = y_p\r\n if x_rk == y_rk:\r\n self.rank[y_p] += 1\r\n return\r\n \r\ndef sort(arr, fav):\r\n # Write your code here\r\n n = len(arr)\r\n uf = UnionFind(n+1)\r\n for i in range(n):\r\n uf.union(i+1, i+1+fav[i])\r\n uf.union(i+1, i+1-fav[i])\r\n for i in range(n):\r\n x_p = uf.find(arr[i])\r\n y_p = uf.find(i+1)\r\n if x_p != y_p:\r\n print(\"NO\")\r\n return False\r\n print(\"YES\")\r\n return True\r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n arr_str1 = input()\r\n arr_str2 = input()\r\n init = [int(x) for x in arr_str1.split(\" \")]\r\n fav = [int(x) for x in arr_str2.split(\" \")]\r\n sort(init, fav)\r\n\r\n \r\n\r\n\r\n ", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Oct 23 01:48:24 2020\n\n@author: divyarth\n\"\"\"\n\nimport sys\nimport heapq\nimport math\n\n#sys.setrecursionlimit(100000)\n#input=sys.stdin.readline\n#print=sys.stdout.write\n\nfrom collections import deque\nfrom collections import defaultdict\nfrom collections import Counter\n\nmodH=int(10**9)+7\nI=lambda : list(map(int,input().split(' ')))\ndef PRINT(lst,sep=' '): print(sep.join(map(str,lst)))\n\nn=int(input())\nlst=I()\nedge=I()\n\nclass DSU:\n def __init__(self,p,r):\n self.p=p\n self.r=r\n \ndef find(s,n):\n if s[n].p!=n:\n s[n].p=find(s,s[n].p)\n return s[n].p\n\ndef union(s,x,y):\n xx=find(s,x)\n yy=find(s,y)\n if xx==yy:\n return True\n else:\n x=s[xx]\n y=s[yy]\n if x.r<y.r:\n x.p=y.p\n elif x.r>y.r:\n y.p=x.p\n else:\n x.p=y.p\n y.r+=1\n return False\n\nsubsets=[DSU(i,0) for i in range(n)]\n\nfor i in range(n):\n d=edge[i]\n if i+d<n: \n union(subsets,i,i+d)\n if i-d>=0:\n union(subsets,i,i-d)\n\nfor i in range(n):\n find(subsets,i)\n \nif not all([find(subsets,i)==find(subsets,lst[i]-1) for i in range(n)]):\n print('NO')\nelse:\n print('YES')", "n=int(input())\r\nA=list(map(int,input().split()))\r\nP=list(map(int,input().split()))\r\n\r\n# UnionFind\r\n\r\nGroup = [i for i in range(n+1)] # グループ分け\r\nNodes = [1]*(n+1) # 各グループのノードの数\r\n\r\ndef find(x):\r\n while Group[x] != x:\r\n x=Group[x]\r\n return x\r\n\r\ndef Union(x,y):\r\n if find(x) != find(y):\r\n if Nodes[find(x)] < Nodes[find(y)]:\r\n \r\n Nodes[find(y)] += Nodes[find(x)]\r\n Nodes[find(x)] = 0\r\n Group[find(x)] = find(y)\r\n \r\n else:\r\n Nodes[find(x)] += Nodes[find(y)]\r\n Nodes[find(y)] = 0\r\n Group[find(y)] = find(x)\r\n\r\nfor i in range(n):\r\n A[i]-=1\r\n if i+P[i]<n-1:\r\n Union(i,i+P[i])\r\n if i-P[i]>=0:\r\n Union(i,i-P[i])\r\n\r\nflag=1\r\n\r\nfor i in range(n):\r\n if find(i)!=find(A[i]):\r\n flag=0\r\n\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def check(x):\r\n if l[x]!=x:\r\n l[x]=check(l[x])\r\n return l[x]\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr1=list(map(int,input().split()))\r\nl=[i for i in range(n)]\r\nfor i in range(n):\r\n if i>=arr1[i]:\r\n l[check(i)]=check(i-arr1[i])\r\n if i<(n-arr1[i]):\r\n l[check(i)]=check(i+arr1[i])\r\n\r\nprint('YES' if all(check(x) == check(y - 1) for x, y in zip(l, arr)) else 'NO')\r\n\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ntree = [[] for i in range(n)]\r\npar = [0] * n\r\n\r\ndef crs (v):\r\n global par\r\n global tree\r\n par[v] = v\r\n tree[v].append(v)\r\n\r\ndef gts (v):\r\n global par\r\n if par[v] == v:\r\n return v\r\n par[v] = gts(par[v])\r\n return par[v]\r\n\r\ndef uns (u, v):\r\n global par\r\n global tree\r\n u = gts(u)\r\n v = gts(v)\r\n if u == v:\r\n return\r\n if tree[u] > tree[v]:\r\n u, v = v, u\r\n for elem in tree[u]:\r\n tree[v].append(elem)\r\n par[u] = v\r\n\r\n\r\nfor i in range(n):\r\n crs(i)\r\n\r\nfor i in range(n):\r\n if i + b[i] < n:\r\n uns(i, i + b[i])\r\n if i - b[i] >= 0:\r\n uns(i, i - b[i])\r\n\r\ncompl = True\r\n\r\nfor i in range(n):\r\n u = gts(a[i] - 1)\r\n if not(i in tree[u]):\r\n compl = False\r\n\r\nif compl:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=[[] for i in range(n+1)]\r\nfor i in range(n):\r\n p=(i+1)-c[i]\r\n q=(i+1)+c[i]\r\n if p<=0 and q<=n:\r\n d[i+1].append(q)\r\n d[q].append(i+1)\r\n elif p > 0 and q > n:\r\n d[i + 1].append(p)\r\n d[p].append(i + 1)\r\n elif p>0 and q<=n:\r\n d[i + 1].append(p)\r\n d[p].append(i + 1)\r\n d[i + 1].append(q)\r\n d[q].append(i + 1)\r\nv=[0]*(n+1)\r\nj=1\r\nk=0\r\nwhile(j<=n):\r\n if v[j]!=1:\r\n f=[0]*(n+1)\r\n s=[j]\r\n r=[]\r\n while(s):\r\n m=s.pop()\r\n r.append(m)\r\n v[m]=1\r\n f[b[m-1]]=1\r\n\r\n for i in d[m]:\r\n if v[i]==0:\r\n s.append(i)\r\n for p in r:\r\n if f[p]==0:\r\n k=1\r\n break\r\n if k==1:\r\n break\r\n\r\n j+=1\r\nif k==0:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "n = int(input())\ndata = list(map(int, input().split()))\nspans = list(map(int, input().split()))\n\nconnect = [[False for c in range(n)] for r in range(n)]\nfor p, span in enumerate(spans):\n for r in [p-span, p+span]:\n if r >= 0 and r < n:\n connect[p][r] = connect[r][p] = True\n\ndef visit(data, connect, seen, group, i):\n if not seen[i]:\n seen[i] = True\n group.append((i, data[i]))\n for j in range(n):\n if connect[i][j]:\n visit(data, connect, seen, group, j)\n\nseen = [False for i in range(n)]\nfor i in range(n):\n group = []\n visit(data, connect, seen, group, i)\n group.sort()\n #print()\n #print(group)\n values = sorted([value for (index, value) in group])\n #print(values)\n for i, value in enumerate(values):\n data[group[i][0]] = value\n #print(data)\n\nif data == list(range(1, n+1)):\n print('YES')\nelse:\n print('NO')\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nqq = list(map(int, input().split()))\r\nd = [set() for i in range(n)]\r\nfor i, j in enumerate(qq):\r\n if i-j > -1:\r\n d[i-j].add(i)\r\n d[i].add(i-j)\r\n if i+j < n:\r\n d[i+j].add(i)\r\n d[i].add(i+j)\r\nx = [0]*n\r\nfor i in range(n):\r\n if x[i] == 0:\r\n k = {i}\r\n q = [i]\r\n while q:\r\n a = q.pop()\r\n for j in d[a]:\r\n if x[j] == 0:\r\n x[j] = 1\r\n k.add(j)\r\n q.append(j)\r\n a = [i+1 for i in k]\r\n if sorted(a) != sorted([w[i] for i in k]):\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "from collections import deque\n\n\ndef solve():\n\tn = int(input())\n\tarr1 = list(map(int,input().split()))\n\tarr2 = list(map(int,input().split()))\n\tparent = [i for i in range(n+1)]\n\trank = [0]*(n+1)\n\tdef find(x,parent):\n\t\tif x!=parent[x]:\n\t\t\tparent[x] = find(parent[x],parent)\n\t\treturn parent[x]\n\tdef union(x,y,parent,rank):\n\t\tif rank[x]>rank[y]:\n\t\t\tparent[y] = x\n\t\telif rank[y]>rank[x]:\n\t\t\tparent[x] = y\n\t\telse:\n\t\t\trank[x]+=1\n\t\t\tparent[y] = x\n\tfor i in range(n):\n\t\tif i+1+arr2[i]<=n:\n\t\t\tx = find(i+1,parent)\n\t\t\ty = find(arr2[i]+i+1,parent)\n\t\t\tif x!=y:\n\t\t\t\tunion(x,y,parent,rank)\n\t\tif i+1-arr2[i]>0:\n\t\t\tx = find(i+1,parent)\n\t\t\ty = find(i+1-arr2[i],parent)\n\t\t\tif x!=y:\n\t\t\t\tunion(x,y,parent,rank)\n\tfor i in range(n):\n\t\tx = find(i+1,parent)\n\t\ty = find(arr1[i],parent)\n\t\tif x!=y:\n\t\t\tprint(\"NO\")\n\t\t\treturn\n\tprint(\"YES\")\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nt = 1\n#t = int(input())\n\nfor i in range(t):\n\tsolve()", "#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\nclass dsu():\r\n\tdef __init__(self,n):\r\n\t\tself.parent=[0]*(n)\r\n\t\tself.sz=[0]*(n)\r\n\r\n\tdef make_set(self,v):\r\n\t\tself.parent[v]=v\r\n\t\tself.sz[v]=1\r\n\r\n\tdef find_set(self,v):\r\n\t\tif v==self.parent[v]:\r\n\t\t\treturn v\r\n\t\tself.parent[v]=self.find_set(self.parent[v])\r\n\t\treturn self.parent[v]\r\n\r\n\tdef union(self,a,b):\r\n\t\ta=self.find_set(a)\r\n\t\tb=self.find_set(b)\r\n\t\tif a==b:\r\n\t\t\treturn\r\n\t\tif self.sz[a]<self.sz[b]:\r\n\t\t\ta,b=b,a\r\n\t\tself.parent[b]=a\r\n\t\tself.sz[a]+=self.sz[b]\r\n\r\n\tdef getsize(self,v):\r\n\t\treturn self.sz[self.find_set(v)]\r\n\r\n\r\nn=ri()\r\na=list(rdG())\r\nd=list(rd())\r\nds=dsu(n)\r\nfor i in range(n):\r\n ds.make_set(i)\r\n# print(a)\r\nfor i in range(n):\r\n if i-d[i]>=0 :\r\n ds.union(i,i-d[i])\r\n if i+d[i]<n:\r\n ds.union(i,i+d[i])\r\ncomp=defaultdict(list)\r\nfor i in range(n):\r\n comp[ds.find_set(i)].append(i)\r\nfla=True\r\nfor i in comp:\r\n l=comp[i]\r\n ll=[a[j] for j in l]\r\n if l!=sorted(ll):\r\n fla=False\r\nif fla:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def bfs(node,target):\r\n\r\n visited[node]=1\r\n queue=[node]\r\n\r\n while queue:\r\n\r\n a=queue.pop(0)\r\n\r\n for j in adj[a]:\r\n if visited[j]==0:\r\n queue.append(j)\r\n visited[j]=1\r\n if j==target:\r\n return 1\r\n return 0\r\n\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\nn= int(input())\r\n\r\nt = list(map(int,input().split()))\r\n\r\ns= list(map(int,input().split()))\r\n\r\n\r\n\r\nadj=[set() for i in range(n+1)]\r\n\r\n\r\nfor j in range(1,n+1):\r\n\r\n u=s[j-1]\r\n\r\n a=(j-u)\r\n b=j+u\r\n\r\n if 1<=a<=n:\r\n adj[j].add(a)\r\n adj[a].add(j)\r\n\r\n if 1<=b<=n:\r\n adj[j].add(b)\r\n adj[b].add(j)\r\n\r\n\r\nh=0\r\nfor i in range(n):\r\n\r\n visited=[0]*(n+1)\r\n\r\n if i+1==t[i]:\r\n continue\r\n else:\r\n a=bfs(i+1,t[i])\r\n\r\n\r\n \r\n if a==0:\r\n print('NO')\r\n h+=1\r\n break\r\n\r\nif h==0:\r\n print('YES')\r\n\r\n\r\n", "n=int(input())\r\na=list(map(lambda x:int(x),input().split()))\r\nfav=list(map(lambda x:int(x),input().split()))\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 self.extra = []\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 # 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 # 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 self.extra.append((x, y))\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\nobj=DisjSet(n)\r\nfor i in range(0,n):\r\n d=fav[i]\r\n if i-d>=0:\r\n obj.Union(i,i-d)\r\n if i+d<=n-1:\r\n obj.Union(i, i + d)\r\nhashmap={}\r\nfor i in range(n):\r\n temp=obj.find(i)\r\n if temp not in hashmap:\r\n hashmap[temp]=set()\r\n hashmap[temp].add(i)\r\nflag=1\r\nfor i in range(n):\r\n temp=obj.find(i)\r\n\r\n if a[i]-1 not in hashmap[temp]:\r\n flag=0\r\n break\r\n# print(hashmap)\r\nif flag==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\nclass UnionFind():\r\n def __init__(self, n):\r\n self.n = n\r\n self.parents = [-1] * n\r\n\r\n def find(self, x):\r\n if self.parents[x] < 0:\r\n return x\r\n else:\r\n self.parents[x] = self.find(self.parents[x])\r\n return self.parents[x]\r\n\r\n def union(self, x, y):\r\n x = self.find(x)\r\n y = self.find(y)\r\n\r\n if x == y:\r\n return\r\n\r\n if self.parents[x] > self.parents[y]:\r\n x, y = y, x\r\n\r\n self.parents[x] += self.parents[y]\r\n self.parents[y] = x\r\n\r\n def size(self, x):\r\n return -self.parents[self.find(x)]\r\n\r\n def same(self, x, y):\r\n return self.find(x) == self.find(y)\r\n\r\n def members(self, x):\r\n root = self.find(x)\r\n return [i for i in range(self.n) if self.find(i) == root]\r\n\r\n def roots(self):\r\n return [i for i, x in enumerate(self.parents) if x < 0]\r\n\r\n def group_count(self):\r\n return len(self.roots())\r\n\r\n def all_group_members(self):\r\n group_members = defaultdict(list)\r\n for member in range(self.n):\r\n group_members[self.find(member)].append(member)\r\n return group_members\r\nn=int(input())\r\np=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nuf=UnionFind(n)\r\nfor i in range(n):\r\n if i-d[i]>=0:\r\n uf.union(i,i-d[i])\r\n if i+d[i]<n:\r\n uf.union(i,i+d[i])\r\nfor i in range(n):\r\n if not uf.same(i,p[i]-1):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "def main():\r\n n = int(input())\r\n perm = tuple(map(int, input().split()))\r\n fav = tuple(map(int, input().split()))\r\n\r\n connection = {i: {i} for i in range(1, n + 1)}\r\n for i in range(1, n + 1):\r\n i_fav = fav[i - 1]\r\n if i - i_fav > 0:\r\n new_connections = connection[i].union(connection[i - i_fav])\r\n for j in new_connections:\r\n connection[j] = new_connections\r\n if i + i_fav < n + 1:\r\n new_connections = connection[i].union(connection[i + i_fav])\r\n for j in new_connections:\r\n connection[j] = new_connections\r\n\r\n for i in range(n):\r\n if perm[i] not in connection[i + 1]:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "import sys\r\nreadline=sys.stdin.readline\r\n\r\ndef SCC(N,edges):\r\n start = [0] * (N + 1)\r\n elist = [0] * len(edges)\r\n for e in edges:\r\n start[e[0] + 1] += 1\r\n for i in range(1, N + 1):\r\n start[i] += start[i - 1]\r\n counter = start[:]\r\n for e in edges:\r\n elist[counter[e[0]]] = e[1]\r\n counter[e[0]] += 1\r\n N = N\r\n now_ord = group_num = 0\r\n visited = []\r\n low = [0] * N\r\n order = [-1] * N\r\n ids = [0] * N\r\n parent = [-1] * N\r\n stack = []\r\n for i in range(N):\r\n if order[i] == -1:\r\n stack.append(i)\r\n stack.append(i)\r\n while stack:\r\n v = stack.pop()\r\n if order[v] == -1:\r\n low[v] = order[v] = now_ord\r\n now_ord += 1\r\n visited.append(v)\r\n for i in range(start[v], start[v + 1]):\r\n to = elist[i]\r\n if order[to] == -1:\r\n stack.append(to)\r\n stack.append(to)\r\n parent[to] = v\r\n else:\r\n low[v] = min(low[v], order[to])\r\n else:\r\n if low[v] == order[v]:\r\n while True:\r\n u = visited.pop()\r\n order[u] = N\r\n ids[u] = group_num\r\n if u == v:\r\n break\r\n group_num += 1\r\n if parent[v] != -1:\r\n low[parent[v]] = min(low[parent[v]], low[v])\r\n for i, x in enumerate(ids):\r\n ids[i] = group_num - 1 - x\r\n groups = [[] for _ in range(group_num)]\r\n for i, x in enumerate(ids):\r\n groups[x].append(i)\r\n return groups\r\n\r\nclass TwoSAT:\r\n def __init__(self,N):\r\n self.N=N\r\n self.edges=[]\r\n\r\n def Add_Clause(self,i,f,j,g):\r\n assert 0<=i<self.N\r\n assert 0<=j<self.N\r\n self.edges.append((2*i+(0 if f else 1),2*j+(1 if g else 0)))\r\n self.edges.append((2*j+(0 if g else 1),2*i+(1 if f else 0)))\r\n\r\n def Satisfiable(self):\r\n scc=SCC(2*self.N,self.edges)\r\n idx=[None]*2*self.N\r\n for i,lst in enumerate(scc):\r\n for x in lst:\r\n idx[x]=i\r\n retu=[None]*self.N\r\n for i in range(self.N):\r\n if idx[2*i]==idx[2*i+1]:\r\n return None\r\n retu[i]=idx[2*i]<idx[2*i+1]\r\n return retu\r\n\r\nN,M=map(int,readline().split())\r\nTSAT=TwoSAT(N)\r\nfor m in range(M):\r\n a,b,c=map(int,readline().split())\r\n a-=1;b-=1\r\n TSAT.Add_Clause(a,0,b,c)\r\n TSAT.Add_Clause(a,1,b,c^1)\r\nlst=TSAT.Satisfiable()\r\nif lst==None:\r\n print(\"Impossible\")\r\nelse:\r\n ans_lst=[n+1 for n in range(N) if not lst[n]]\r\n print(len(ans_lst))\r\n print(*ans_lst)" ]

[ "m=list(map(int,input().split()))\r\nresult_a_win=result_draw=result_b_win=0\r\nfor i in range(1,7):\r\n if abs(m[0]-i)<abs(m[1]-i):\r\n result_a_win += 1 \r\n if abs(m[0]-i)==abs(m[1]-i):\r\n result_draw += 1 \r\n if abs(m[0]-i)>abs(m[1]-i):\r\n result_b_win += 1 \r\nprint(result_a_win,result_draw,result_b_win)", "s = input()\na,b = map(int,s.split())\nca = 0\ncb = 0\ncd = 0\nfor x in range(1,7):\n an = abs(a-x)\n bn = abs(b-x)\n if(an<bn):\n ca += 1\n elif(an>bn):\n cb += 1\n else:\n cd += 1\nprint(ca,\" \",cd,\" \",cb)\n \t\t \t\t \t \t\t\t\t\t \t\t\t\t \t\t \t\t", "throws = input().split()\r\nplayer_one = int(throws[0])\r\nplayer_two = int(throws[1])\r\n\r\ndef counter(player_one, player_two):\r\n test = []\r\n i = 1\r\n while i <= 6:\r\n if abs(i - player_one) < abs(i - player_two):\r\n test.append(1)\r\n elif abs(i - player_one) > abs(i - player_two):\r\n test.append(2)\r\n elif abs(i - player_one) == abs(i - player_two):\r\n test.append(3)\r\n i += 1\r\n print(' '.join([str(test.count(1)), str(test.count(3)), str(test.count(2))]))\r\n \r\ncounter(player_one, player_two)", "a,b = map(int,input().split())\nx,y,z = 0,0,0\nfor i in range(1,7):\n if(abs(a-i)<abs(b-i)):\n x+=1\n elif(abs(a-i)>abs(b-i)):\n y+=1\n else:\n z+=1\nprint(x,z,y)\n\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\n# Initialize counters for the three outcomes.\r\nfirst_player_wins = 0\r\ndraw = 0\r\nsecond_player_wins = 0\r\n\r\n# Iterate through all possible outcomes when rolling a die (1 to 6).\r\nfor x in range(1, 7):\r\n # Calculate the absolute differences between x and the two chosen numbers.\r\n diff_a = abs(a - x)\r\n diff_b = abs(b - x)\r\n \r\n # Determine the outcome and update the corresponding counter.\r\n if diff_a < diff_b:\r\n first_player_wins += 1\r\n elif diff_b < diff_a:\r\n second_player_wins += 1\r\n else:\r\n draw += 1\r\n\r\n# Print the results.\r\nprint(first_player_wins, draw, second_player_wins)\r\n", "# https://codeforces.com/contest/378/problem/A\r\na, b = map(int, input().split())\r\na_wins = draw = b_wins = 0\r\n\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n a_wins += 1\r\n elif abs(a - i) == abs(b - i):\r\n draw += 1\r\n else:\r\n b_wins += 1\r\n\r\nprint(a_wins, draw, b_wins)", "a, b = map(int, input().split())\r\n\r\ncount_a = 0\r\ncount_b = 0\r\ncount_c = 0\r\n\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n count_a += 1\r\n elif abs(b-i) < abs(a-i):\r\n count_b += 1\r\n else:\r\n count_c += 1\r\n\r\nprint(count_a, count_c, count_b)", "a,b=[int(x) for x in input().split()]\r\nA=0\r\nD=0\r\nB=0\r\nfor x in range(1,7):\r\n if(abs(a-x)<abs(b-x)):\r\n A+=1\r\n elif(abs(a-x)==abs(b-x)):\r\n D+=1\r\n elif((abs(a-x)>abs(b-x))):\r\n B+=1\r\nprint(A,D,B)\r\n", "a,b = map(int,input().split())\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n c1+=1\r\n elif abs(i-b)<abs(i-a):\r\n c2+=1\r\n else:\r\n c3+=1\r\nprint(str(c1)+' '+str(c3)+' '+str(c2))\r\n", "a,b = map(int,input().split())\r\nf,d,s = (0,0,0)\r\nfor x in range(1,7):\r\n if abs(a-x) < abs(b-x):\r\n f += 1\r\n elif abs(b-x) < abs(a-x):\r\n s += 1\r\n else: \r\n d += 1\r\nprint(f,d,s)", "a, b = map(int, input().split())\r\nplayer1 = 0\r\nplayer2 = 0\r\ndraw = 0\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n player1 = player1 + 1\r\n elif abs(a - i) > abs(b - i):\r\n player2 = player2 + 1\r\n else:\r\n draw += 1\r\n \r\nprint(str(player1) + \" \" + str(draw) + \" \" + str(player2))", "x,y=map(int,input().split())\r\na,b=0,0\r\nfor i in range(1,7):\r\n if abs(x-i)<abs(y-i):a+=1\r\n elif abs(x-i)==abs(y-i):b+=1\r\nprint(a,b,6-(a+b))", "n1, n2 = map(int, input().split())\r\nn1w = 0\r\nd = 0\r\nn2w = 0\r\nfor n in range(6):\r\n i = n+1\r\n if abs(i - n1) < abs(i - n2):\r\n n1w += 1\r\n elif abs(i - n2) < abs(i - n1):\r\n n2w += 1\r\n else:\r\n d += 1\r\nprint(n1w, d, n2w)", "\r\n\r\ndef solve(n, m):\r\n\r\n one = 0\r\n tie = 0\r\n two = 0\r\n for i in range(1, 7):\r\n if abs(i-n) < abs(i-m):\r\n one += 1\r\n elif abs(i-n) == abs(i-m):\r\n tie += 1\r\n else:\r\n two += 1\r\n\r\n return str(one) + ' ' + str(tie) + ' ' + str(two)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n print(solve(n, m))", "n,m=map(int,input().split())\r\na=b=c=0\r\nfor i in range(1,7):t=abs(n-i)-abs(m-i);a+=t<0;b+=t==0;c+=t>0\r\nprint(a,b,c)", "a,b=map(int,input().split())\nA=0\nB=0\nD=0\nfor i in range(1,7):\n if abs(a-i)>abs(b-i):\n A+=1\n elif abs(a-i)<abs(b-i):\n B+=1\n else:\n D+=1\nprint(B,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\nawin = 0\r\ndraw = 0\r\nbwin = 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n awin += 1\r\n elif abs(a-i) > abs(b-i):\r\n bwin += 1\r\n else:\r\n draw += 1\r\nprint(awin,draw,bwin)", "def main():\r\n entered = input().split()\r\n a = int(entered[0])\r\n b = int(entered[1])\r\n\r\n i = 1\r\n wa = 0\r\n wb = 0\r\n draw = 0\r\n\r\n while(i <= 6):\r\n a1 = max(a, i)\r\n a2 = min(a, i)\r\n b1 = max(b, i)\r\n b2 = min(b, i)\r\n\r\n if (a1 - a2 < b1 - b2):\r\n wa += 1\r\n elif (b1 - b2 < a1 - a2):\r\n wb += 1\r\n elif (a1 - a2 == b1 - b2):\r\n draw += 1\r\n\r\n i += 1\r\n\r\n print(wa, draw, wb)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\ns= s.split()\r\nf=0\r\ndr=0\r\nl=0\r\nif(int(s[0])<int(s[1])):\r\n d=int(s[1])-int(s[0])\r\n if(d%2!=0):\r\n print(int(s[0])+int(d/2),end=\" \")\r\n print(\"0\",end=\" \")\r\n print(7-int(s[1])+int(d/2))\r\n else:\r\n if(d==2):\r\n print(int(s[0]), end=\" \")\r\n print(\"1\", end=\" \")\r\n print(7 - int(s[1]))\r\n else:\r\n print(int(s[0]) + 1, end=\" \")\r\n print(\"1\", end=\" \")\r\n print(7 - int(s[1]) + 1)\r\nelif(int(s[0])>int(s[1])):\r\n d = int(s[0]) - int(s[1])\r\n if (d % 2 != 0):\r\n print(7 - int(s[0]) +int(d/2))\r\n print(\"0\", end=\" \")\r\n print(int(s[1]) + int(d/2), end=\" \")\r\n else:\r\n if (d == 2):\r\n print(7 - int(s[0]))\r\n print(\"1\", end=\" \")\r\n print(int(s[1]), end=\" \")\r\n else:\r\n print(7 - int(s[0]) + 1)\r\n print(\"1\", end=\" \")\r\n print(int(s[1]) + 1, end=\" \")\r\nelse:\r\n print(\"0 6 0\")\r\n\r\n", "n1, n2 = [int(i) for i in input().split()]\r\n\r\nn1w = 0\r\nd = 0\r\nn2w = 0\r\n\r\nfor i in range(1, 7):\r\n if abs(n1 - i) < abs(n2 - i):\r\n n1w += 1\r\n elif abs(n1 - i) == abs(n2 - i):\r\n d += 1\r\n else:\r\n n2w += 1\r\n\r\nprint(str(n1w) + ' ' + str(d) + ' ' + str(n2w))", "\r\nx=0\r\ny=0\r\nz=0\r\na,b=map(int,input().split())\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tx+=1\r\n\telif abs(a-i)>abs(b-i):\r\n\t\ty+=1\r\n\telse:\r\n\t\tz+=1\r\nprint(x,z,y)", "a,b = list( map(int, input().split()) )\n\nresults = [0,0,0]\nfor i in range(1,7):\n if abs(a-i) < abs(b-i) :\n results[0] += 1\n elif abs(b-i) < abs(a-i) :\n results[2] += 1\n else :\n results[1] += 1\n\nfor x in results :\n print(x, end = \" \")\n\t\t\t \t \t \t \t \t\t \t \t\t \t \t", "a,b = map(int, input().split())\nplayer1 = 0\nplayer2 = 0\ndraw = 0\nfor i in range(1,7):\n\tif abs(i-a)<abs(i-b):\n\t\tplayer1 +=1\n\telif abs(i-a)>abs(i-b):\n\t\tplayer2 +=1\n\telse:\n\t\tdraw +=1\nprint(player1,draw,player2,sep = \" \")", "a, b = list(map(int, input().split()))\r\n\r\nwins = 0\r\ndraws = 0\r\nlosses = 0\r\n\r\nfor i in range(1, 7):\r\n ascore = abs(a-i)\r\n bscore = abs(b-i)\r\n if ascore < bscore:\r\n wins +=1\r\n elif ascore > bscore:\r\n losses +=1\r\n else:\r\n draws +=1\r\n \r\nprint(f\"{wins} {draws} {losses}\")", "a,b = map(int,input().split())\r\ncount_a = 0\r\ncount_b = 0\r\ncount_e = 0\r\nfor i in range(1,7):\r\n if abs(a-i) > abs(b-i):\r\n count_b = count_b+1\r\n elif abs(a-i) < abs(b-i):\r\n count_a = count_a+1\r\n elif abs(a-i) == abs(b-i):\r\n count_e = count_e+1\r\nprint(count_a,count_e,count_b)", "a,b=map(int,input().split())\r\ndraw,x,y=0,0,0\r\nfor i in range(1,7):\r\n delta1=abs(a-i);delta2=abs(b-i)\r\n if(delta1==delta2):\r\n draw+=1\r\n if(delta1<delta2):\r\n x+=1\r\n if(delta2<delta1):\r\n y+=1\r\nprint(\"{} {} {}\".format(x,draw,y))\r\n\r\n\r\n", "f, d, s = 0, 0, 0\r\na, b = list(map(int, input().split()))\r\nfor i in range(1, 7):\r\n if abs(i - a) > abs(i - b):\r\n s += 1\r\n elif abs(i - a) == abs(i - b):\r\n d += 1\r\n else:\r\n f += 1\r\n\r\nprint(f, d, s)", "a, b = map (int, input ().split ())\r\nfirst=0\r\nnichia=0\r\nsecond=0\r\n\r\nfor i in range(6):\r\n if abs(i+1-a)>abs(i+1-b):\r\n first+=1\r\n elif abs(i+1-a)==abs(i+1-b):\r\n nichia+=1\r\n elif abs(i+1-a)<abs(i+1-b):\r\n second+=1\r\nprint(second,nichia,first)", "def main():\r\n a , b = map(int, input().split())\r\n \r\n aw = 0\r\n d = 0\r\n bw = 0\r\n\r\n for i in range(1, 7):\r\n if abs(a-i) > abs(b-i):\r\n bw += 1\r\n elif abs(b-i) > abs(a-i):\r\n aw += 1\r\n else:\r\n d += 1\r\n \r\n print(f\"{aw} {d} {bw}\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n ", "# Coded By Block_Cipher\r\n\r\nfrom collections import Counter\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n# import HCF\r\n\r\n# n = int(input())\r\na,b = list(map(int,input().split()))\r\n\r\nx = 0\r\ny = 0 \r\nz = 0\r\n\r\nfor i in range(1,6+1):\r\n\tif abs(i-a)< abs(i-b):\r\n\t\tx+=1\r\n\telif abs(i-a)> abs(i-b):\r\n\t\ty+=1\r\n\telse:\r\n\t\tz +=1\r\nprint(x,z,y)\r\n\r\n", "a,b = list(map(int, input().split()))\r\nfirst = 0\r\nsecond = 0\r\neq = 0\r\nfor i in range(1,7):\r\n\tif abs(a - i) < abs(b - i):\r\n\t\tfirst += 1\r\n\telif abs(b - i) < abs(a - i):\r\n\t\tsecond += 1\r\n\telse:\r\n\t\teq += 1\r\nprint(first,eq,second)", "a,b=map(int,input().split())\r\nx=0;y=0;z=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n x+=1\r\n elif abs(a-i)==abs(b-i):\r\n y+=1\r\n else:\r\n z+=1\r\nprint(x,y,z,sep=' ')\r\n \r\n", "a, b = map(int, input().split())\r\nf = d = s = 0\r\nfor x in range(1, 7):\r\n if abs(a - x) < abs(b - x):\r\n f += 1\r\n elif abs(a - x) == abs(b - x):\r\n d += 1\r\n elif abs(a - x) > abs(b - x):\r\n s += 1 \r\nprint(f, d, s)", "a,b = map(int, input().split())\r\n\r\nawin,bwin,tie=0,0,0\r\nfor i in range (1,7,1):\r\n if abs(a-i)<abs(i-b):\r\n awin=awin+1\r\n else: \r\n if abs(a-i)>abs(i-b):\r\n bwin=bwin+1\r\n else:\r\n tie=tie+1\r\nprint(awin,tie,bwin)\r\n", "a,b = map(int,input().split())\na_c = 0\nb_c = 0\nfor i in range(1,7):\n if abs(a-i)<abs(b-i):\n a_c += 1\n elif abs(a-i) == abs(b-i):\n b_c += 1\nprint(a_c,b_c, 6 - a_c - b_c)\n\t \t\t\t\t \t\t \t\t \t\t\t\t\t\t", "a,b=map(int,input().split())\r\na1=a\r\nif(a>b): a,b=b,a\r\nk=int((b-a)-1)/2\r\nif(a==b): print(\"0 6 0\")\r\nelif(a1==a): print(int(a+k),int((b-a)%2==0),int(7+k-b))\r\nelse: print(int(7+k-b),int((b-a)%2==0),int(a+k))\r\n", "def solve():\r\n a, b = map(int, input().split())\r\n w1, d, w2 = 0, 0, 0\r\n for i in range(1, 7):\r\n if abs(i-a) < abs(i-b):\r\n w1 += 1\r\n elif abs(i-a) > abs(i-b):\r\n w2 += 1\r\n else:\r\n d += 1\r\n print(w1, d, w2)\r\n\r\n\r\nif __name__== \"__main__\":\r\n solve()", "a, b = map(int, input().split())\r\nf, d, s = 0, 0, 0\r\n\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n f += 1\r\n elif abs(a-i) > abs(b-i):\r\n s += 1\r\n else:\r\n d += 1\r\nprint(f, d, s)\r\n", "x, y= input().split()\n\nwin =0;win2 =0;draw=0\nfor i in range(1,7):\n win += abs(int(x)-i) < abs(int(y)-i)\n win2 +=abs(int(x) -i) >abs(int(y) -i)\n draw += abs(int(x)-i) == abs(int(y)-i)\n\nprint(win,draw,win2,sep=\" \")\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\naw=0\r\ndraw=0\r\nbw=0\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n aw+=1\r\n elif(abs(a-i)>abs(b-i)):\r\n bw+=1\r\n else:\r\n draw+=1\r\nprint(aw,draw,bw)\r\n \r\n", "n,k=input().split()\nx=0\ny=0\nz=0\nn=int(n)\nk=int(k)\nfor i in range(1,7):\n if(abs(n-i)<abs(k-i)):\n x+=1\n elif(abs(k-i)<abs(n-i)):\n y+=1\n elif(abs(k-i)==abs(n-i)):\n z+=1\nx=str(x)\ny=str(y)\nz=str(z)\nprint(x+\"\\t\"+z+\"\\t\"+y)\n\n#Krunal\n\n\t \t \t\t \t\t \t \t \t \t\t \t \t \t\t\t\t", "L1= [int(x) for x in input().split(\" \")]\r\n\r\nuser1=L1[0]\r\nuser2=L1[1]\r\n\r\nctr1=0\r\ndraw=0\r\nctr2=0\r\n\r\n\r\nfor i in range(1,7):\r\n if abs(user1-i)<abs(user2-i):\r\n ctr1=ctr1+1\r\n elif abs(user1-i)==abs(user2-i):\r\n draw=draw+1\r\n else:\r\n ctr2=ctr2+1\r\n\r\nprint(ctr1,draw,ctr2)\r\n ", "a, b = list(map(int, input().split()))\r\nw, d, l = 0, 0, 0\r\nfor i in range(1,7):\r\n\tif abs(a-i) < abs(b-i):\r\n\t\tw += 1\r\n\telif abs(b-i) < abs(a-i):\r\n\t\tl += 1\r\n\telse:\r\n\t\td += 1\r\nprint(w,d,l)", "\r\nn,m=map(int,input().split())\r\nl=[1,2,3,4,5,6]\r\nq=0\r\nw=0\r\ne=0\r\nfor i in l:\r\n\tn1=abs(n-i)\r\n\tm1=abs(m-i)\r\n\tif n1>m1:\r\n\t\te+=1\r\n\telif m1>n1:\r\n\t\tq+=1\r\n\telse:\r\n\t\tw+=1\r\nprint(q,w,e) ", "x, y = [int(i) for i in input().split()]\r\na = 0\r\nb = 0\r\nc = 0\r\nfor i in range(1, 7):\r\n if abs(x-i) < abs(y-i):\r\n a += 1\r\n elif abs(x-i) == abs(y-i):\r\n b += 1\r\n else:\r\n c += 1\r\nprint(a, b, c)\r\n", "x,y=map(int,input().split())\r\na=b=d=0\r\nif x>y:\r\n for i in range(1,7):\r\n if abs(i-y)==abs(x-i):\r\n d+=1\r\n elif abs(i-y)<abs(x-i):\r\n b+=1\r\n else:\r\n a+=1\r\nelif x==y:\r\n a=b=0\r\n d=6\r\nelse:\r\n for i in range(1,7):\r\n if abs(i-x)==abs(y-i):\r\n d+=1\r\n elif abs(i-x)<abs(y-i):\r\n a+=1\r\n else:\r\n b+=1\r\nprint(a,d,b)", "from math import *\r\na,b=map(int,input().split())\r\naval=0\r\ndovom=0\r\nsevom=0\r\nadad1=0\r\nadad2=0\r\nfor i in range(1,7,1):\r\n if a>=i:\r\n adad1=a-i\r\n else:\r\n adad1=i-a\r\n if b>=i:\r\n adad2=b-i\r\n else:\r\n adad2=i-b\r\n if adad1>adad2:\r\n aval+=1\r\n elif adad2>adad1:\r\n sevom+=1\r\n else:\r\n dovom+=1\r\nprint(sevom,dovom,aval,end=\" \",sep=\" \") ", "a ,b = map(int,input().split())\r\ndraw = 0\r\nwin_1 = 0\r\nwin_2 = 0\r\n\r\nfor i in range(1,7):\r\n a_diff = abs(a-i)\r\n b_diff = abs(b-i)\r\n if a_diff >b_diff:\r\n win_1+=1\r\n elif b_diff>a_diff:\r\n win_2+=1\r\n else:\r\n draw+=1\r\nprint(win_2,draw,win_1)", "a,b=map(int,input().split())\nl=[0]*3\nfor i in range(1,7):\n l[0if abs(a-i)<abs(b-i)else 2if abs(a-i)>abs(b-i)else 1]+=1\nprint(*l)\n\t\t\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\n\r\nways = [0]*3\r\n\r\nfor i in range(1, 7):\r\n\tif abs(n-i) < abs(m-i):\r\n\t\tways[0] += 1\r\n\telif abs(n-i) > abs(m-i):\r\n\t\tways[2] += 1\r\n\telse:\r\n\t\tways[1] += 1\r\nprint(\" \".join(str(num) for num in ways))", "lis=list(map(int,input().rstrip().split()))\r\na=lis[0]\r\nb=lis[1]\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n c1=c1+1\r\n elif abs(a-i)>abs(b-i):\r\n c2=c2+1\r\n else:\r\n c3=c3+1\r\nprint(c1,c3,c2)\r\n", "a, b = map(int, input().split())\r\nd = 0\r\nif a!=b:\r\n if (a+b)%2 == 0:\r\n d = 1\r\n i = (a+b)//2 -1\r\n else:\r\n i = (a+b)//2 \r\n j = 6-d-i\r\n if b<a:\r\n i, j = j, i\r\nelse:\r\n d = 6\r\n i = 0\r\n j = 0\r\nprint(i, d, j)\r\n \r\n \r\n \r\n", "s = input().split(' ')\r\na = int(s[0])\r\nb = int(s[1])\r\nw = 0\r\nt = 0\r\nl = 0\r\n\r\nfor i in range(1,7):\r\n if abs(a - i) > abs(b - i):\r\n w += 1\r\n elif abs(b - i) > abs(a - i):\r\n l += 1\r\n else:\r\n t += 1\r\n\r\nprint(l, end= ' ')\r\nprint(t, end= ' ')\r\nprint(w)", "def solve(a, b):\r\n w = d = l = 0\r\n for x in range(1, 7):\r\n if abs(a - x) < abs(b - x):\r\n w += 1\r\n elif abs(a - x) == abs(b - x):\r\n d += 1\r\n else:\r\n l += 1\r\n\r\n print(*[w, d, l])\r\n\r\na, b = map(int, (input().split()))\r\n(solve(a, b))", "a, b = [int(i) for i in input().split()]\r\n\r\nres1, res2, res3 = 0, 0, 0\r\n\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n res1 += 1\r\n elif abs(b-i) < abs(a-i):\r\n res3 += 1\r\n else:\r\n res2 += 1\r\n\r\nprint(res1, res2, res3)", "# cf 378 A 800\na, b = map(int, input().split())\n# a, b = min(a, b), max(a, b)\n\n# 1 2 3 4 5 6\n# a b\n# 5 4 2 1 0 1\n# 1 0 1 2 3 4\na_, b_, ab = 0, 0, 0\nfor n in range(1, 6 + 1):\n if abs(n - a) < abs(n - b):\n a_ += 1\n elif abs(n - a) > abs(n - b):\n b_ += 1\n else:\n ab += 1\nprint(a_, ab, b_)\n", "l=list(map(int, input().split()))\r\ndef throw_dice(a, b):\r\n fwin = 0\r\n swin = 0\r\n draw = 0\r\n for i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n fwin += 1\r\n elif abs(a-i) == abs(b - i):\r\n draw += 1\r\n else:\r\n swin += 1\r\n\r\n return [fwin, draw, swin]\r\n\r\nprint(\" \".join(str(i) for i in throw_dice(l[0],l[1])))", "a,b = map(int,input().split())\nawin=bwin=tie=0\nfor i in range(1,7):\n if (abs(a-i) < abs(b-i)):\n awin+=1\n elif (abs(a-i) > abs(b-i)):\n bwin+=1\n else:\n tie+=1\nprint (str(awin) + \" \" +str(tie)+ \" \" +str(bwin))\n \t \t \t \t \t \t \t \t\t\t \t\t\t\t", "a,b=map(int,input().split())\r\nwa=0\r\nwd=0\r\nwb=0\r\nfor i in range(1,7):\r\n if abs(i-a)>abs(i-b):\r\n wb+=1\r\n elif abs(i-a)<abs(i-b):\r\n wa+=1\r\n else:\r\n wd+=1\r\nprint(wa,wd,wb)", "a,b = map(int,input().split())\r\nteamA = teamB = Fr = 0\r\nfor i in range(1,7):\r\n if(abs(i-a)>abs(i-b)):\r\n teamA+=1 \r\n if(abs(i-a)<abs(i-b)):\r\n teamB+=1 \r\n if(abs(i-a)==abs(i-b)):\r\n Fr+=1 \r\nprint(teamB,Fr,teamA)\r\n", "a ,b = [int(x) for x in input().split()]\r\nwinTable = [0 ,0 ,0]\r\nfor i in range(1 , 7):\r\n if abs(a - i) < abs(b - i):\r\n winTable[0] += 1\r\n elif abs(a - i) > abs(b - i):\r\n winTable[2] += 1\r\n else:\r\n winTable[1] += 1\r\nprint(\" \".join([str(x) for x in winTable]))", "inp = input()\na = int(inp[0])\nb = int(inp[2])\na_win, b_win, draw = 0,0,0\nfor i in range(1,7):\n a_score = abs(a-i)\n b_score = abs(b-i)\n\n if a_score == b_score:\n draw += 1\n continue\n if a_score < b_score:\n a_win += 1\n continue\n b_win += 1\n\nprint(a_win, draw, b_win)\n\t\t \t\t \t\t \t \t\t \t\t\t\t\t\t \t", "num_1, num_2 = map(int, input().split())\r\nnum_3, num_4, num_5 = 0, 0, 0\r\nfor i in range(1, 6 + 1):\r\n if abs(num_1 - i) < abs(num_2 - i):\r\n num_3 += 1\r\n elif abs(num_1 - i) == abs(num_2 - i):\r\n num_4 += 1\r\n elif abs(num_1 - i) > abs(num_2 - i):\r\n num_5 += 1\r\nprint(num_3, num_4, num_5)\n# Wed Mar 09 2022 07:02:36 GMT+0000 (Coordinated Universal Time)\n", "a, b = map(int, input().split())\nwa, wb, ww = 0, 0, 0\nfor vd in [1, 2, 3, 4, 5, 6]:\n if abs(a - vd) < abs(b - vd):\n wa += 1\n elif abs(a - vd) > abs(b - vd):\n wb += 1\n else:\n ww += 1\nprint(wa, ww, wb)", "a,b=map(int,input().split())\r\nx=y=d=0 \r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n x+=1 \r\n elif abs(a-i)>abs(b-i):\r\n y+=1 \r\n else:\r\n d+=1 \r\nprint(x,end=' ')\r\nprint(d,end=' ')\r\nprint(y)", "a, b = map(int, input().split())\nx, y, z = 0, 0, 0\nfor i in range(1, 7):\n if abs(a - i) > abs(b - i):\n z += 1\n elif abs(a - i) == abs(b - i):\n y += 1\n else:\n x += 1\nprint(x, y, z)\n", "def solve():\r\n a, b = [int(x) for x in input().split()]\r\n a_win = 0\r\n b_win = 0\r\n draw = 0\r\n for i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n a_win += 1\r\n elif abs(a - i) > abs(b - i):\r\n b_win += 1\r\n else:\r\n draw += 1\r\n print(f\"{a_win} {draw} {b_win}\")\r\n return\r\n\r\nsolve()", "\r\nl = list(map(int,input().split()))\r\nl1 = [0,0,0]\r\n\r\nfor i in range(1,7):\r\n\tif abs(l[1] - i) == abs(l[0]-i):\r\n\t\tl1[1] += 1\r\n\telif abs(l[1] - i) < abs(l[0]-i):\r\n\t\tl1[2] += 1\r\n\telse:\r\n\t\tl1[0] += 1\r\n\r\nprint(*l1,sep = ' ')", "a,b=map(int,input().split())\r\nw,d,l=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n w+=1\r\n elif abs(a-i)==abs(b-i):\r\n d+=1\r\n else:\r\n l+=1\r\nprint(w,d,l)", "a,b=map(int, input().split())\r\ncnt1=0\r\ncnt2=0\r\ncnt3=0\r\nfor i in range(1,6+1):\r\n if abs(a-i)<abs(b-i):\r\n cnt1 +=1\r\n elif abs(b-i)<abs(a-i):\r\n cnt2 +=1\r\n elif abs(a-i)==abs(b-i):\r\n cnt3 +=1\r\nprint(cnt1,cnt3,cnt2)", "a,b = map(int,input().split())\r\nwin = d =l =0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n win+=1\r\n elif abs(i-a)==abs(i-b):\r\n d+=1\r\n else:\r\n l+=1\r\nprint(win,d,l)\r\n\r\n", "a, b = (int(s) for s in input (). split())\nf,d,s = 0,0,0\nfor i in range (1,7):\n if abs(a-i) < abs(b-i) : f +=1\n elif abs(a-i) == abs (b-i) : d +=1\n else: s+=1\nprint (f,d,s)\n \t\t \t\t\t\t \t\t \t\t \t\t \t \t \t \t", "a, b = map(int, input().split())\r\na1= b1 =c1 = 0\r\nfor i in range(1, 7):\r\n if abs(i-a) == abs(i-b):\r\n c1 += 1\r\n elif abs(i-a) < abs(i-b):\r\n a1 += 1\r\n elif abs(i-a) > abs(i-b):\r\n b1 += 1\r\n\r\nprint(a1, c1, b1)", "a,b=input().split()\r\na,b=int(a),int(b)\r\nif a==b:\r\n print('0 6 0')\r\nelif a>b:\r\n if (a-b)%2!=0:\r\n a+=1\r\n m=(a+b)//2\r\n print(7-m,0,m-1)\r\n else:\r\n m=(a+b)//2\r\n print(6-m,1,m-1)\r\nelse:\r\n if (b-a)%2!=0:\r\n b+=1\r\n m=(a+b)//2\r\n print(m-1,0,7-m)\r\n else:\r\n m=(a+b)//2\r\n print(m-1,1,6-m) \r\n ", "def dist(a, b):\r\n return max(a, b) - min(a, b)\r\n\r\na, b = map(int, input().split())\r\n\r\nfirst = 0\r\nsecond = 0\r\nthird = 0\r\n\r\nfor i in range(1, 7):\r\n first += dist(a, i) < dist(b, i)\r\n second += dist(a, i) > dist(b, i)\r\n third += dist(a, i) == dist(b, i)\r\n\r\nprint(first, third, second)", "a,b = map(int, input().split())\r\narr = [0,0,0]\r\nfor i in range(1,7):\r\n\tif abs(i-a) < abs(i-b):\r\n\t\tarr[0] += 1\r\n\telif abs(i-a) > abs(i-b):\r\n\t\tarr[2] += 1\r\n\telse:\r\n\t\tarr[1] += 1\r\nprint(*arr)", "o, t = map(int, input().split())\no = [abs(i - o) for i in range(1, 7)]\nt = [abs(i - t) for i in range(1, 7)]\nf = 0\nm = 0\ns = 0\nfor x, y in zip(o, t):\n if x < y:\n f += 1\n elif x == y:\n m += 1\n else:\n s += 1\nprint(f, m, s)\n", "a,b=map(int, input().split())\r\np,q,r=0,0,0\r\nfor x in range(1,7):\r\n m=abs(a-x)\r\n n=abs(b-x)\r\n if m<n:\r\n p+=1\r\n elif m==n:\r\n q+=1\r\n else:\r\n r+=1\r\nprint(f\"{p} {q} {r}\")", "import sys,bisect\r\n\r\nfrom sys import stdin,stdout\r\n\r\nfrom bisect import bisect_left,bisect_right,bisect,insort,insort_left,insort_right\r\n\r\nfrom math import gcd,ceil,floor,sqrt\r\n\r\nfrom collections import Counter,defaultdict,deque,OrderedDict\r\n\r\nsys.setrecursionlimit(10**6)\r\nINF = float('inf')\r\nMOD = 998244353\r\nmod = 10**9+7\r\n\r\ndef st():\r\n return list(stdin.readline().strip())\r\n\r\ndef inp():\r\n return int(stdin.readline())\r\n\r\ndef li():\r\n return list(map(int,stdin.readline().split()))\r\n\r\ndef mp():\r\n return map(int,stdin.readline().split())\r\n\r\ndef pr(n):\r\n stdout.write(str(n)+\"\\n\")\r\n \r\ndef solve():\r\n a,b=mp()\r\n l=[0,0,0]\r\n for i in range(1,7):\r\n x=abs(a-i)\r\n y=abs(b-i)\r\n if x==y:\r\n l[1]+=1\r\n elif x<y:\r\n l[0]+=1\r\n else:\r\n l[2]+=1\r\n print(*l)\r\n \r\n \r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inps():\r\n return(input())\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\na, b = invr()\r\naWins = 0\r\nbWins = 0\r\ndraw = 0\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n aWins += 1\r\n elif abs(a-i) > abs(b-i):\r\n bWins += 1\r\n else:\r\n draw += 1\r\n\r\nprint(str(aWins) + \" \" + str(draw) + \" \" + str(bWins))", "a, b = map(int, input().split())\r\nwl = [0, 0, 0]\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b-i):\r\n wl[0] += 1\r\n elif abs(b - i) < abs(a - i):\r\n wl[2] += 1\r\n else:\r\n wl[1] += 1\r\n\r\nfor i in wl:\r\n print(i, end=' ')", "line=input()\r\nline=line.split()\r\na=int(line[0])\r\nb=int(line[1])\r\nl=[0,0,0]\r\nfor x in range(1,7):\r\n c=abs(x-a)\r\n d=abs(x-b)\r\n if c<d:\r\n l[0]+=1\r\n elif c==d:\r\n l[1]+=1\r\n else:\r\n l[2]+=1\r\nprint(l[0], l[1], l[2])", "a, b = map(int, input().split())\r\ncountera, counterb, counter1 = 0, 0, 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n countera += 1\r\n elif abs(a-i) > abs(b-i):\r\n counterb += 1\r\n else:\r\n counter1 += 1\r\nprint(countera, counter1, counterb, sep=\" \")", "import sys\r\nimport math\r\nfrom collections import defaultdict,Counter\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\n'''\r\n2 5\r\n3.5\r\n\r\nwin 1 2 3\r\ndraw 0\r\nlose 4 5 6\r\n\r\n2 4\r\n3\r\n\r\nwin 1 2\r\ndraw 3\r\nlose 4 5 6\r\n\r\n'''\r\nmod = 10**9+7\r\n\r\na,b=MII()\r\nans = [0,0,0]\r\n\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n ans[0] += 1\r\n elif abs(a-i) == abs(b-i):\r\n ans[1] += 1\r\n else:\r\n ans[2] += 1\r\nprint(' '.join(map(str,ans)))", "a,b=map(int,input().split())\r\na1,a2,a3=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)==abs(b-i):\r\n a2+=1\r\n elif abs(a-i)<abs(b-i):\r\n a1+=1\r\n else :\r\n a3+=1\r\nprint(a1,a2,a3)", "a,b=map(int,input().split())\r\naw=0\r\nbw=0\r\nd=0\r\nfor i in range(1,7):\r\n\tif abs(a-i)>abs(b-i):\r\n\t\tbw+=1\r\n\telif abs(b-i)>abs(a-i):\r\n\t\taw+=1\r\n\telse:\r\n\t\td+=1\r\nprint(aw,d,bw)", "a,b = map(int,input().split())\r\n\r\nc1=0\r\nc2=0\r\nc3=0\r\npossibilite=[1,2,3,4,5,6]\r\n\r\nfor i in possibilite:\r\n if abs(a-i)<abs(b-i):\r\n c1+=1\r\n elif abs(a-i)>abs(b-i):\r\n c2+=1\r\n else:\r\n c3+=1\r\nprint(c1,c3,c2)", "'''n=int(input())\r\nx=0\r\nd=0\r\nfor i in range(n):\r\n f=[int(i) for i in input().split()]\r\n if f[0]>f[1]:\r\n x+=1\r\n elif f[0]<f[1]:\r\n d+=1 \r\nif x>d:\r\n print('Mishka')\r\nelif x<d:\r\n print('Chris')\r\nelse:\r\n print('Friendship is magic!^^')\r\nx=[int(i) for i in input().split()]\r\nif x[0]>=x[1] and x[1]%2==0:\r\n print('Malvika')\r\nelif x[0]<x[1] and x[0]%2==0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')\r\nx=input()\r\nf=input().split()\r\nfor i in f:\r\n if i[0]==x[0] or i[1]==x[1]:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\nt=input().split()\r\nf=0\r\nif int(t[0])>=int(t[1]):\r\n f=int(t[0])\r\nelse:\r\n f=int(t[1])\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\nelse:\r\n print('1/6')\r\nx=input().split()\r\nif (int(x[0])//int(x[1]))%2==0:\r\n print('no')\r\nelse:\r\n print('yes')'''\r\nx=input().split()\r\na=0\r\nb=0\r\nc=0\r\nfor i in range(1,7):\r\n if abs(int(x[0])-i)<abs(int(x[1])-i):\r\n a+=1\r\n elif abs(int(x[0])-i)==abs(int(x[1])-i):\r\n b+=1\r\n else:\r\n c+=1\r\nprint(a,b,c)\r\n", "a,b=[int(x) for x in input().split(\" \")]\r\na_win=0\r\nb_win=0\r\ndraw=0\r\nfor i in range(1,7):\r\n if(abs(a-i)==abs(b-i)):\r\n draw+=1\r\n elif(abs(a-i)>abs(b-i)):\r\n b_win+=1\r\n else:\r\n a_win+=1\r\nprint(a_win,draw,b_win,sep=\" \") ", "a,b = map(int,input().split())\r\na1 = 0\r\nt = 0\r\nb1 = 0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n a1 = a1+1\r\n elif abs(a-i)>abs(b-i):\r\n b1 = b1+1\r\n else:\r\n t = t+1\r\nprint(a1,t,b1)\r\n", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\n\r\nf = 0\r\nd = 0\r\ns = 0\r\nfor x in range(1,7):\r\n if abs(a-x) < abs(b-x):\r\n f += 1\r\n elif abs(a-x) == abs(b-x):\r\n d += 1\r\n elif abs(a-x) > abs(b-x):\r\n s += 1\r\n\r\nprint(f,d,s)", "a, b = list(map(int, input().split(' ')))\r\nans = [0, 0, 0]\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n ans[0] += 1\r\n elif abs(a - i) > abs(b - i):\r\n ans[2] += 1\r\n else:\r\n ans[1] += 1\r\nprint(*ans)", "a, b = map(int, input().split(\" \"))\r\ns1 = 0\r\ns2 = 0\r\ns3 = 0\r\nfor i in range(1, 7):\r\n if abs(i - a) > abs(i-b):\r\n s3 += 1\r\n elif abs(i - a) < abs(i -b):\r\n s1 += 1\r\n else:\r\n s2 += 1\r\nprint(s1,s2,s3)", "from math import ceil,floor\r\n\r\na, b =input().split()\r\na = int(a)\r\nb = int(b)\r\na_won = 0\r\nb_won = 0\r\ntail = 0\r\nfor j in range(1,7):\r\n a_win = abs(a-j)\r\n b_win = abs(b-j)\r\n if a_win == b_win:\r\n tail += 1\r\n elif a_win < b_win:\r\n a_won += 1\r\n else:\r\n b_won += 1\r\nprint(a_won, tail, b_won)\r\n", "a, b = map(int, input().split())\ncount_a, count_b, draw = 0, 0, 0\nif (a >= 1 and b<= 6):\n for x in range(1, 7):\n if (abs(a-x) < abs(b-x)):\n count_a += 1\n elif (abs(a-x) > abs(b-x)):\n count_b += 1\n else:\n draw += 1\nprint(count_a, draw, count_b)\n \t \t\t \t \t\t \t\t\t \t\t \t\t \t", "a,b=map(int,input().split())\r\nawi=0\r\ndr=0\r\nbwi=0\r\nfor i in range(1,7):\r\n\tif abs(a-i)< abs(b-i):\r\n\t\tawi+=1\r\n\telif abs(a-i) == abs(b-i):\r\n\t\tdr+=1\r\n\telse :\r\n\t\tbwi+=1\r\nprint(awi,dr,bwi)", "main=[1,2,3,4,5,6]\r\nn,m=map(int,input().split())\r\nwinA=0\r\nwinB=0\r\ndraw=0\r\nfor i in main:\r\n disA=abs(i-n)\r\n disB=abs(i-m)\r\n if disA<disB:\r\n winB+=1\r\n elif disA>disB:\r\n winA+=1\r\n elif disA==disB:\r\n draw+=1\r\nprint(winB,draw,winA)", "[a,b] = [int(x) for x in input().split(\" \")]\r\n\r\nwaya = 0\r\nwayb = 0\r\nwayd = 0\r\n\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n waya += 1\r\n elif abs(a-i) > abs(b-i):\r\n wayb += 1\r\n elif abs(a-i) == abs(b-i):\r\n wayd += 1\r\n \r\nprint(waya,wayd,wayb)\r\n\r\n ", "s=input()\na=int(s[0])\nb=int(s[2])\np1=0\np2=0\ndraw=0\nfor i in range(1,7):\n if(abs(a-i)>abs(b-i)):\n p2=p2+1\n elif(abs(a-i)<abs(b-i)):\n p1=p1+1\n else:\n draw=draw+1\n \nprint(p1,draw,p2)\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\nmoo = 0\r\npor = 0\r\nblu = 0\r\nfor i in range(1, 7):\r\n if abs(i - a) < abs(i - b):\r\n moo += 1\r\n elif abs(i - b) < abs(i - a):\r\n por += 1\r\n else:\r\n blu += 1\r\nprint(moo, end=\" \")\r\nprint(blu, end=\" \")\r\nprint(por)", "params = input().split(\" \")\r\nfirst = int(params[0])\r\nsecond = int(params[1])\r\nif first==second:\r\n out = [str(0), str(6), str(0)]\r\nelse:\r\n firstWin = 0\r\n secondWin = 0\r\n draw = 0\r\n for i in range(1,7):\r\n firstGuy = abs(first-i)\r\n secondGuy = abs(second-i)\r\n if firstGuy<secondGuy:\r\n firstWin+=1 \r\n elif secondGuy<firstGuy:\r\n secondWin+=1\r\n else:\r\n draw+=1 \r\n out = [str(firstWin), str(draw), str(secondWin)]\r\nprint(\" \".join(out))", "def main():\r\n a, b = map(int, input().split())\r\n c, d = 0, 0\r\n ans = [0, 0, 0]\r\n\r\n for i in range(1, 7):\r\n c = abs(a - i)\r\n d = abs(b - i)\r\n\r\n if c < d:\r\n ans[0] += 1\r\n elif c == d:\r\n ans[1] += 1\r\n else:\r\n ans[2] += 1\r\n\r\n print(*ans)\r\n\r\nmain()", "a, b = map(int, input().split())\r\naa = 0\r\ndraw = 0\r\nbb = 0\r\nfor j in range(1, 7):\r\n if abs(a-j) == abs(b-j):\r\n draw += 1\r\n elif abs(a-j) > abs(b-j):\r\n bb += 1\r\n else:\r\n aa += 1\r\nprint(aa, draw, bb)\r\n", "a,b=map(int,input().split())\r\naw=0\r\nbw=0\r\nd=0\r\nfor x in range(1,7):\r\n if abs(a-x)==abs(b-x): d+=1\r\n elif abs(a-x)<abs(b-x): aw+=1\r\n else: bw+=1\r\nprint(aw,d,bw)", "a,b=map(int,input().split())\r\nl=[0]*3\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):l[0]+=1\r\n else:l[2if abs(a-i)>abs(b-i)else 1]+=1\r\nprint(*l)", "a,b=map(int,input().split())\r\ndraw,p1,p2=0,0,0\r\nfor x in range(1,7):\r\n if abs(a-x)<abs(b-x):\r\n p1+=1 \r\n elif abs(a-x)>abs(b-x):\r\n p2+=1 \r\n else:\r\n draw+=1\r\nprint(p1,draw,p2)", "x,y=map(int,input().strip().split())\r\nl=[1,2,3,4,5,6]\r\ncountx=0\r\ncounty=0\r\ndraw=0\r\nfor i in l:\r\n if(abs(i-x)>abs(i-y)):\r\n county+=1\r\n elif(abs(i-x)<abs(i-y)):\r\n countx+=1\r\n elif(abs(i-x)==abs(i-y)):\r\n draw+=1\r\nprint(str(countx)+\" \"+str(draw)+\" \"+str(county))", "a,b=map(int,input().split())\r\nl=[0]*3\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n l[0]+=1\r\n elif abs(a-i)==abs(b-i):\r\n l[1]+=1\r\n else:\r\n l[2]+=1\r\nprint(*l)\r\n", "a,b=[int(i) for i in input().split()]\r\nx=y=z=0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n z+=1\r\n elif abs(a-i)<abs(b-i):\r\n x+=1\r\n else:y+=1\r\nprint(x,y,z)\r\n", "numbers = input().split()\r\nx=int(numbers[0])\r\ny=int(numbers[1])\r\nxWins=0\r\nyWins=0\r\ndraw=0\r\nfor i in range(1,7):\r\n if abs(i-x)<abs(i-y):\r\n xWins+=1\r\n elif abs(i-y)<abs(i-x):\r\n yWins+=1\r\n else:\r\n draw+=1\r\nprint(xWins,draw,yWins)", "entry = input()\na,b = entry.split(' ')\na = int(a); b = int(b)\ni = 1;f = 0 ;s = 0;t = 0 \nfor i in range(1,7):\n x = abs(a-i)\n y = abs(b-i)\n if (x < y): f = f + 1\n elif (x > y): s = s +1 \n elif (x == y): t = t +1\n i = i+1 \n \nprint (str(f)+ \" \"+str(t)+ \" \"+str(s))\n\t \t \t\t\t \t\t \t \t \t\t \t\t \t\t \t", "a,b=[int(x) for x in input().split()]\r\ndef func(a,b):\r\n if b>a:\r\n return b-a\r\n else:return a-b\r\na1,a2,a3=0,0,0 \r\n \r\nfor i in range(1,7):\r\n if func(a,i)<func(b,i):\r\n a1+=1 \r\n elif func(a,i)>func(b,i):\r\n a3+=1 \r\n else:a2+=1 \r\nprint(a1,a2,a3) ", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\na, b = gets(int)\ni = a + b >> 1\nif a < b:\n if a + b & 1:\n print(i, 0, 6 - i)\n else:\n print(i - 1, 1, 6 - i)\nelif a > b:\n if a + b & 1:\n print(6 - i, 0, i)\n else:\n print(6 - i, 1, i - 1)\nelse:\n print(0, 6, 0)\n", "a,b=map(int,input().split())\r\naw=0\r\nbw=0\r\nt=0\r\nr=0\r\ns=0\r\nfor i in range(1,7):\r\n r=abs(a-i)\r\n s=abs(b-i)\r\n if(r>s):\r\n bw=bw+1 \r\n elif(s>r):\r\n aw=aw+1 \r\n else:\r\n t=t+1 \r\nprint(aw,t,bw)\r\n ", "a,b=map(int,input().split())\r\nx,y=0,0\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tx+=1\r\n\telif abs(a-i)>abs(b-i):\r\n\t\ty+=1\r\nprint(x,6-(x+y),y)", "n,m=map(int,input().split())\r\na=b=c=0\r\nfor i in range(1,7):\r\n if abs(n-i) >abs(m-i):\r\n c+=1\r\n elif abs(n-i)==abs(m-i):\r\n b+=1\r\n else:\r\n a+=1\r\nprint(a,b,c)", "n,m=map(int,input().split())\r\nplayer1=0\r\nplayer2=0\r\ndraw=0\r\nfor i in range (1,7):\r\n diff1=abs(n-i)\r\n diff2=abs(m-i)\r\n if diff1 < diff2 :\r\n player1+=1\r\n elif diff2 <diff1 :\r\n player2+=1\r\n else:\r\n draw+=1\r\nprint(player1,draw,player2)", "a, b = map(int, input().split())\r\nc = 0\r\ns = 0\r\nd = 0\r\n\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n c += 1\r\n elif(abs(a-i)==abs(b-i)):\r\n d += 1\r\n elif(abs(a-i)>abs(b-i)):\r\n s += 1\r\n\r\nprint(\"%d %d %d\"%(c,d,s))", "a,b= map(int,input().split(\" \"))\r\n\r\nwin=0\r\nlose=0\r\ndraw=0\r\n\r\nfor i in range(1,7):\r\n temp = abs(a-i)\r\n temp2 = abs(b-i)\r\n \r\n if temp==temp2:\r\n draw+=1\r\n elif temp<temp2:\r\n win+=1\r\n else:\r\n lose+=1\r\nprint(win,draw,lose)", "a, b = list(map(int, input().split(' ')))\r\nx1, x2 = list(map(lambda x: abs(x-a), range(1,7))), list(map(lambda y: abs(y-b), range(1,7)))\r\nw, n, l = 0, 0, 0\r\nfor i, j in zip(x1, x2):\r\n if i > j:\r\n w += 1\r\n elif i == j:\r\n n += 1\r\n elif i < j:\r\n l += 1\r\nprint(l, n, w)", "a , b =list(map(int,input().strip().split()))\r\np1=0\r\np2=0\r\nd=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n p1+=1\r\n elif abs(a-i)>abs(b-i):\r\n p2+=1\r\n else:\r\n d+=1\r\nprint(p1,d,p2)\r\n", "def main():\r\n [a, b] = list(map(int, input().split()))\r\n f = 0\r\n d = 0\r\n s = 0\r\n\r\n for i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n f += 1\r\n elif abs(a - i) == abs(b - i):\r\n d += 1\r\n else:\r\n s += 1\r\n\r\n print(f, d, s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math \r\na,b = [int(x) for x in input().split()]\r\nm = (a + b)/2\r\nif a<b:\r\n l1 = math.floor(m - 0.1)\r\n l2 = 1 if math.floor(m) == m else 0\r\n l3 = 6 -l1 -l2\r\nif a>b:\r\n l3 = math.floor(m-0.1)\r\n l2 = 1 if math.floor(m) == m else 0\r\n l1 = 6 -l3 -l2\r\nif a==b:\r\n l1 = l3 = 0\r\n l2 = 6\r\nprint(l1, l2, l3)", "a, b = map(int, input().split())\r\nf = 0\r\ns = 0\r\nd = 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n f += 1\r\n elif abs(a-i) > abs(b-i):\r\n s += 1\r\n else:\r\n d += 1\r\nprint(f, d, s, sep=' ')", "S=lambda:map(int,input().split())\r\na,b=S()\r\ncounta=0\r\ncountb=0\r\ncountc=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n counta+=1\r\n elif abs(a-i)>abs(b-i):\r\n countb+=1\r\n else:\r\n countc+=1\r\nprint(counta,countc,countb)", "a=list(map(int,input().split()))\r\np1_c=0\r\np2_c=0\r\ndraw=0\r\nfor i in range(1,7):\r\n k,q=abs(a[0]-i),abs(a[1]-i)\r\n if k<q:\r\n p1_c+=1\r\n elif k>q:\r\n p2_c+=1\r\n else:\r\n draw+=1\r\nprint(*[p1_c,draw,p2_c])", "a, b = map(int, input().split())\n\n# Initialize counters\nwins_a = 0\nwins_b = 0\ndraws = 0\n\n# Loop through all possible outcomes of rolling the dice\nfor i in range(1, 7):\n # Determine the absolute difference between a/b and the outcome of the dice\n diff_a = abs(a - i)\n diff_b = abs(b - i)\n\n # Compare the differences to determine the winner or if it's a draw\n if diff_a < diff_b:\n wins_a += 1\n elif diff_b < diff_a:\n wins_b += 1\n else:\n draws += 1\n\n# Output the results\nprint(wins_a, draws, wins_b)\n\n \t\t\t \t\t \t\t \t\t\t \t\t\t \t\t\t", "a,b=map(int,input().split())\r\nf=0\r\ng=0\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tf+=1\r\n\telif abs(a-i)>abs(b-i):\r\n\t\tg+=1\r\nprint(f,6-(f+g),g)", "inn=list(map(int,input().split()))\na=inn[0]\nb=inn[1]\na_win=0\nb_win=0\nfor i in range(1,7):\n if abs(a-i)<abs(b-i):\n a_win+=1\n elif abs(a-i)>abs(b-i):\n b_win+=1\noutput=[a_win,6-a_win-b_win,b_win]\nprint(*output)\n \t\t\t\t\t\t \t \t\t \t \t\t \t \t\t \t\t\t\t\t\t", "num_1,num_2=map(int,input().split())\r\none_wins = 0\r\ndraw = 0\r\ntwo_wins = 0\r\nfor dice_i in range(1,7):\r\n one_wins += (abs(num_1 - dice_i) < abs(num_2 - dice_i))\r\n two_wins += (abs(num_1 - dice_i) > abs(num_2 - dice_i))\r\n draw += (abs(num_1 - dice_i) == abs(num_2 - dice_i))\r\nprint( one_wins, draw, two_wins)", "a, b = map(int, input().split())\r\nm, n, p = 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n m += 1\r\n elif abs(a - i) > abs(b - i):\r\n p += 1\r\n else:\r\n n += 1\r\nprint(m, n, p)", "a,b = map(int,input().split())\r\nplayer1 = 0\r\nplayer2 = 0\r\ndraw = 0\r\nfor i in range(1,7):\r\n diff1 = abs(i-a)\r\n diff2 = abs(i-b)\r\n if diff1 == diff2:\r\n draw += 1\r\n elif diff2 < diff1:\r\n player2 += 1\r\n elif diff1 < diff2:\r\n player1 += 1\r\nprint(player1,draw,player2)\r\n\r\n\r\n\r\n", "import sys\r\nfrom math import sqrt, floor, factorial\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\n\r\ndef solve():\r\n\ta, b = read(); arr = [0]*3\r\n\tfor i in range(1, 7):\r\n\t\tif abs(a-i) < abs(b-i): arr[0] += 1\r\n\t\telif abs(a-i) > abs(b-i): arr[2] += 1\r\n\t\telse:arr[1] += 1\r\n\tprint(*arr)\r\n\r\n\t# ans = \"\"\r\n\t# for _ in range(int(inp())):\r\n\t# \tn = int(inp())\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()", "a, b = (int(s) for s in input().split())\nresults = [0, 0, 0]\n\nfor i in range(1, 7):\n if abs(a - i) < abs(b - i):\n results[0] += 1\n elif abs(a - i) > abs(b - i):\n results[2] += 1\n else:\n results[1] += 1\n\nprint(results[0], results[1], results[2])\n\t\t\t \t\t\t\t \t \t \t\t\t\t\t \t \t\t\t", "a, b = [int(x) for x in input().split()]\r\nl1=[]\r\nl2=[]\r\na1=d=b1=0\r\nfor i in range(1,6+1):\r\n l1.append(abs(i-a))\r\n l2.append(abs(i-b))\r\nfor j in range(6):\r\n if l1[j]<l2[j]:\r\n a1+=1\r\n elif l1[j]==l2[j]:\r\n d+=1\r\n else:\r\n b1+=1\r\nprint(a1,d,b1)\r\n \r\n\r\n", "a , b = input().strip().split()\na , b = int(a) , int(b)\nchance_a = 0\nchance_b = 0\ndraw = 0\nif a==b:\n print(\"0 6 0\")\nelif a<b:\n if ((b-a)&1)==1:\n chance_a = a+ (b-a)//2\n chance_b = (7-b)+ (b-a)//2\n else:\n chance_a = a+ (b-a-1)//2\n chance_b = (7-b)+ (b-a-1)//2\n draw = 1\n print(f'{chance_a} {draw} {chance_b}')\nelse:\n if ((a-b)&1)==1:\n chance_b = b+ (a-b)//2\n chance_a = (7-a)+ (a-b)//2\n else:\n chance_b = b+ (a-b-1)//2\n chance_a = (7-a)+ (a-b-1)//2\n draw = 1\n print(f'{chance_a} {draw} {chance_b}')\n\t\t\t \t \t\t\t\t \t\t \t \t \t\t \t", "a, b = [int(s) for s in input().split()]\r\n\r\nA = 0\r\nB = 0\r\nT = 0\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n A += 1\r\n elif abs(a-i) == abs(b-i):\r\n T += 1\r\n else:\r\n B += 1\r\nprint(A, T, B)\r\n", "a, b = map(int, input().split())\r\nwin_first = win_second = draw = 0\r\nfor i in range(1, 7):\r\n diff_a = abs(i - a)\r\n diff_b = abs(i - b)\r\n if diff_a < diff_b:\r\n win_first += 1\r\n elif diff_a > diff_b:\r\n win_second += 1\r\n else:\r\n draw += 1\r\nprint(win_first, draw, win_second)\r\n", "entry = input()\na,b = entry.split(' ')\na = int(a); b = int(b)\nhome = 0\ndraw = 0\naway = 0\nfor j in range(6):\n dif_a = abs(a - (j+1))\n dif_b = abs(b - (j+1))\n if dif_a > dif_b:\n home = home + 1\n if dif_a == dif_b:\n draw = draw + 1\n if dif_a < dif_b:\n away = away + 1\n \nprint(str(away)+' '+str(draw)+' '+str(home))\n \t\t \t \t\t \t \t \t\t \t \t", "a,b = map(int,input().split())\n\nif a==b:\n print(0,6,0)\nelse:\n one,d,two = 0,0,0\n for i in range(1,7):\n if abs(a-i)>abs(b-i):\n two+=1\n if abs(a-i)<abs(b-i):\n one+=1\n if abs(a-i)==abs(b-i):\n d+=1\n\n print(one,d,two)\n", "a, b = [int(p) for p in input().split()]\r\nsatu = 0\r\ndua = 0\r\ndraw = 0\r\nfor i in range (1, 7):\r\n if abs(a-i) < abs(b-i):\r\n satu += 1\r\n elif abs(a-i) == abs(b-i):\r\n draw += 1\r\n else:\r\n dua += 1\r\nprint(satu, draw, dua)", "a,b = map(int,input().split())\r\naw = 0\r\nbw = 0\r\nnw = 0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n aw += 1\r\n elif abs(a-i)>abs(b-i):\r\n bw+=1\r\n else:\r\n nw+=1\r\nprint(aw,nw,bw)", "a,b=map(int,input().split())\r\nx=0\r\ny=0\r\nd=0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n x+=1 \r\n elif abs(i-a)>abs(i-b):\r\n y+=1 \r\n else:\r\n d+=1 \r\nprint(x,d,y)", "[num1, num2] = map(int, input().split())\n\nwin1 = 0\ndraw = 0\nwin2 = 0\n\nfor dicenum in range(1, 7):\n if abs(num1 - dicenum) > abs(num2 - dicenum):\n win2 += 1\n elif abs(num2 - dicenum) > abs(num1 - dicenum):\n win1 += 1\n else:\n draw += 1\n\nprint(str(win1) + \" \" + str(draw) + \" \" + str(win2))\n ", "n, m = map(int, input().split())\r\na = d = b = 0\r\nfor x in range(1, 7):\r\n if abs(n - x) < abs(m - x):\r\n a += 1\r\n elif abs(n - x) == abs(m - x):\r\n d += 1\r\n elif abs(n - x) > abs(m - x):\r\n b += 1 \r\nprint(a, d, b)", "a, b = map(int, input().split())\r\nk = (a+b)//2\r\nrest = (a+b)%2==0\r\nif a==b:\r\n print(0,6,0)\r\nelif a<b:\r\n print(k-rest, rest+0, 6-k)\r\nelse:\r\n print( 6-k, rest+0,k-rest)\r\n", "a, b = map(int, input().split())\n\nresult = [0, 0, 0]\nfor i in range(1, 7):\n if abs(i - a) < abs(i - b):\n result[0] += 1\n elif abs(i - a) > abs(i - b):\n result[-1] += 1\n else:\n result[1] += 1\n\nprint(*result)\n", "import math;a,b=map(int,input().split());f=max(b,a)-min(a,b)-1;d=min(a,b)+f//2;e=7-max(a,b)+f//2;print(*([0,6,0] if a==b else [d,math.ceil(f/2)-f//2,e] if a<b else [e,math.ceil(f/2)-f//2,d] ))", "\"\"\"\r\nq = int(input())\r\nfor z in range(q):\r\n\tn = int(input())\r\n\"\"\"\r\na, b = map(int, input().split())\r\nv1, d, v2 = 0, 0, 0\r\nfor x in range(1, 6+1):\r\n\td1 = abs(a-x)\r\n\td2 = abs(b-x)\r\n\tif d1 < d2:\r\n\t\tv1 += 1\r\n\telif d1 > d2:\r\n\t\tv2 += 1\r\n\telse:\r\n\t\td += 1\r\nprint(v1, d, v2)", "[a,b]=map(int, input().split())\r\nawin =0\r\nbwin =0\r\ndraw =0\r\nfor x in range(1, 7):\r\n if abs(a-x)<abs(b-x):\r\n awin = awin +1 \r\n elif abs(a-x)==abs(b-x):\r\n draw = draw + 1 \r\n else:\r\n bwin = bwin +1 \r\nprint(awin, draw, bwin)", "inp = input();\r\nalist = inp.split();\r\na = int(alist[0]);\r\nb = int(alist[1]);\r\na_count = b_count = dr_count = 0;\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n a_count += 1;\r\n elif abs(a - i) > abs(b - i):\r\n b_count += 1;\r\n else:\r\n dr_count += 1;\r\nprint(a_count, \" \", dr_count, \" \", b_count); ", "import math\r\nc = list(map(int, input().split()))\r\n\r\nk = 0\r\nl = 0\r\nj = 0\r\n\r\nfor i in range(1, 7):\r\n\r\n\tif math.fabs(i - c[0]) < math.fabs(i - c[1]):\r\n\r\n\t\tk += 1\r\n\r\n\telif math.fabs(i - c[0]) == math.fabs(i - c[1]):\r\n\r\n\t\tl += 1\r\n\r\n\telse:\r\n\r\n\t\tj += 1\r\n\r\nprint(k, l, j)\r\n", "a,b = input().split(\" \")\r\n\r\na = int(a)\r\nb = int(b)\r\n\r\nx = 0\r\ndraw = 0\r\ny = 0\r\n\r\n\r\nfor i in range(1,7):\r\n if abs(a - i) == abs(b - i):\r\n draw += 1\r\n elif abs(a - i) > abs(b - i):\r\n x += 1\r\n else:\r\n y += 1\r\n\r\nprint(f\"{y} {draw} {x}\")\r\n \r\n", "a, b = list(map(int, input().split()))\n\nwa, d, wb = 0, 0, 0\nfor x in range(1, 7):\n v1 = abs(a - x)\n v2 = abs(b -x)\n if v1 == v2:\n d += 1\n elif v1 < v2:\n wa += 1\n else:\n wb += 1\n\nprint(wa, d, wb)\n", "a, b = [int(x) for x in input().split(\" \")]\n\na_wins = 0\ndraw = 0\nb_wins = 0\n\ndice = [1, 2, 3, 4, 5, 6]\n\nfor x in dice:\n if abs(a - x) < abs(b - x):\n a_wins+=1\n\n elif abs(a - x) > abs(b - x):\n b_wins+=1\n\n else:\n draw+=1\n\nprint(\"{} {} {}\".format(a_wins, draw, b_wins))", "def main():\r\n n,k = [int(v) for v in input().split()]\r\n a,b,c = 0,0,0\r\n for i in range(1,7):\r\n if abs(i-n)>abs(i-k):\r\n a+=1\r\n elif abs(i-n)<abs(i-k):\r\n b+=1\r\n else:\r\n c+=1\r\n print(b,c,a)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b=list(map(int,input().split()))\r\nc,d,e=0,0,0\r\nfor i in range(1,7):\r\n if(abs(a-i)<(abs(b-i))):\r\n c+=1\r\n if(abs(a-i)==abs(b-i)):\r\n d+=1\r\n if(abs(a-i)>abs(b-i)):\r\n e+=1\r\nprint(c,d,e) ", "a,b = map(int,input().split())\r\nfirst,second,third = 0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n first+=1\r\n elif abs(a-i) > abs(b-i):\r\n third+=1\r\n else:\r\n second+=1\r\nprint(first,second,third)", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nk1 = 0\r\nk2 = 0\r\nk3 = 0\r\nfor i in range(1, 7):\r\n if abs(i - a) < abs(i - b):\r\n k1 += 1\r\n elif abs(i - a) > abs(i - b):\r\n k3 += 1\r\n else:\r\n k2 += 1\r\nprint(k1, k2, k3)", "h,k = map(int,input().split())\nn=1\nx_count = 0\ny_count = 0\ndraw = 0\n\nwhile(n<=6):\n p=abs(h-n)\n q=abs(k-n)\n if p>q:\n y_count+=1\n elif q>p:\n x_count+=1\n else:\n draw+=1\n n+=1\nprint(x_count, '', draw, '',y_count)\n\t\t\t \t \t \t \t \t\t \t \t\t\t", "s=input()\na,b=s.split()\na = int(a)\nb = int(b)\nawins=0\ndraw=0\nbwins=0\nfor i in range(1,7):\n if abs(i-a)<abs(i-b):\n awins+=1\n elif abs(i-a)==abs(i-b):\n draw+=1\n else:\n bwins+=1\nprint(awins,draw,bwins)\n \t \t\t \t \t\t \t \t\t\t\t\t \t\t\t \t", "a,b = map(int,input().split(\" \"))\r\np,q,r=0,0,0\r\nfor j in range(1,7):\r\n aa=abs(j-a)\r\n bb=abs(j-b)\r\n if(aa<bb):\r\n p=p+1\r\n if(aa>bb):\r\n q=q+1\r\n if(aa==bb):\r\n r=r+1\r\nprint(p,r,q)\r\n \r\n \r\n ", "a, b = map(int, input().split())\r\n\r\na_win =0\r\nb_win =0\r\ndraw = 0\r\n\r\nfor i in range(1,7):\r\n\tif abs(a-i) == abs(b-i):\r\n\t\tdraw+=1\r\n\telif abs(a-i) > abs(b-i):\r\n\t\tb_win+=1\r\n\telse:\r\n\t\ta_win+=1\r\n\r\nprint(a_win, draw, b_win, sep=' ')", "def Outcomes(a,b) :\n\n a_win,tie,b_win = 0,0,0\n dice = 1\n while True :\n \n diff_a,diff_b = abs(a-dice),abs(b-dice)\n if diff_a < diff_b :\n a_win += 1\n elif diff_a == diff_b :\n tie += 1\n else :\n b_win += 1\n\n if dice == 6 :\n break\n dice += 1\n \n return a_win,tie,b_win\n\nif __name__ == \"__main__\":\n a,b = list(map(int,input().strip().split(' ')))\n \n print(*Outcomes(a,b))\n\t\t \t\t\t \t \t\t \t\t \t\t\t\t \t \t", "\"\"\"\r\n Playing with Dice\r\n\"\"\"\r\na, b = [int(x) for x in input().split()]\r\nfirst = second = draw = 0\r\nfor i in range(1,7):\r\n if(abs(i-a)<abs(i-b)):\r\n first += 1\r\n elif(abs(i-a)>abs(i-b)):\r\n second += 1\r\n else:\r\n draw += 1\r\nprint(first, ' ', draw, ' ', second)", "a, b = map(int,input().split())\nreverse = False\nif a>b:\n a,b = b,a\n reverse = True\nnums = b-a-1\nleft = a\nright = 6-b+1\nmid = 1\nif nums%2==0:\n mid = 0\nleft += (b-a-1)//2\nright += (b-a-1)//2\nif a==b:\n print(\"0 6 0\")\nelif reverse:\n print(right, mid, left)\nelse:\n print(left,mid,right)\n\n", "a, b = map(int, input().split())\nx = y = z = 0\nfor d in range(1, 7):\n da = abs(d - a)\n db = abs(d - b)\n x += da < db\n y += da == db\n z += da > db\nprint(x, y, z)\n", "a, b = map(int, input().split())\r\nf = 0\r\nd = 0\r\ns = 0\r\nfor i in range(1, 7):\r\n if abs(i - a) < abs(i - b):\r\n f += 1\r\n elif abs(i - a) > abs(i - b):\r\n s += 1\r\n else:\r\n d += 1\r\nprint(f, d, s, sep=\" \")\r\n", "[a,b] = map(int, input().split())\r\na_win = 0\r\nb_win = 0\r\ntie = 0\r\nfor x in range(1,7):\r\n if abs(x-a) < abs(x-b):\r\n a_win += 1\r\n elif abs(x-a) > abs(x-b):\r\n b_win += 1\r\n else:\r\n tie += 1\r\n \r\nprint(a_win, tie, b_win)", "a,b=map(int,input().split())\r\nif(a==b):\r\n print(\"0 6 0\")\r\nelse:\r\n k=(abs(b-a)-1)//2\r\n if((abs(a-b)-1)%2!=0):\r\n l=1\r\n else:\r\n l=0\r\n if(a>b):\r\n q=6-a+1\r\n else:\r\n q=a\r\n print(q+k,l,6-(q+k+l))\r\n\r\n", "a,b = [int(i) for i in input().split()]\r\nacount = 0\r\nbcount = 0\r\ndcount = 0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n acount+=1\r\n elif abs(a-i)>abs(b-i):\r\n bcount += 1\r\n else:\r\n dcount+=1\r\nprint(acount,dcount,bcount)", "a, b = list(map(int, input().split()))\ndiffa = [abs(i - a) for i in range(1,7)]\ndiffb = [abs(i- b ) for i in range(1,7)]\nawin = len([i for i in range(6) if diffa[i] < diffb[i]])\ndraw = len([i for i in range(6) if diffa[i] == diffb[i]])\nbwin = len([i for i in range(6) if diffa[i] > diffb[i]])\nprint(awin,draw,bwin)\n", "a, b = map(int, input().split())\r\nfirst = draw = second = 0\r\nfor x in range(1,7):\r\n if abs(a-x)<abs(b-x):\r\n first += 1\r\n elif abs(a-x)==abs(b-x):\r\n draw += 1\r\n else:\r\n second += 1\r\nprint(first, draw, second)\r\n", "a,b = map(int, input().split())\na1 = 0\ndraws = 0\nb1 = 0\n\nfor i in range(1, 7):\n diff_a = abs(a - i)\n diff_b = abs(b - i)\n if diff_a == diff_b:\n draws += 1\n elif diff_a < diff_b:\n a1 += 1\n else:\n b1 += 1\n\nprint(a1,end=' ')\nprint(draws,end=' ')\nprint(b1,end=' ')\n\t \t\t \t \t\t\t \t \t\t\t\t\t\t \t\t \t\t\t \t", "# https://codeforces.com/contest/378/problem/A\r\n\r\nuser_input = input().split(' ')\r\na = int(user_input[0])\r\nb = int(user_input[1])\r\na_win_count, b_win_count, draw = 0, 0, 0\r\n\r\nfor i in range(1, 7):\r\n a_diff = abs(i - a)\r\n b_diff = abs(i - b)\r\n if a_diff < b_diff:\r\n a_win_count = a_win_count + 1\r\n elif a_diff > b_diff:\r\n b_win_count = b_win_count + 1\r\n else:\r\n draw = draw + 1\r\n\r\nprint(a_win_count, draw, b_win_count)\r\n ", "a,b=map(int,input().split(' ',1))\r\nx=0\r\ny=0\r\nz=0\r\ndice=[1,2,3,4,5,6]\r\nif a==b:\r\n y=6\r\n x=0\r\n z=0\r\nelif(abs(a-b))==1:\r\n y=0\r\n if a>b:\r\n x=(6-a)+1\r\n z=6-x\r\n else:\r\n z=(6-b)+1\r\n x=6-z\r\n\r\nelif abs(a-b)==2:\r\n y=1\r\n if a>b:\r\n x=(6-a)+1\r\n z=6-x-y\r\n else:\r\n z=(6-b)+1\r\n x=6-y-z\r\nelif (abs(a-b)==3):\r\n y=0\r\n if a>b:\r\n x=(6-a)+2\r\n z=6-x\r\n else:\r\n z=(6-b)+2\r\n x=6-z\r\nelif (abs(a-b)==4):\r\n y=1\r\n if a>b:\r\n x=(6-a)+2\r\n z=6-x-y\r\n if b>a:\r\n z=(6-b)+2\r\n x=6-z-y\r\nelif(abs(a-b)==5):\r\n y=0\r\n x=3\r\n z=3\r\nprint(x,y,z)\r\n\r\n\r\n\r\n", "a,b=list(map(int,input().split()))\r\n\r\na_way=0\r\nb_way=0\r\ne_way=0\r\n\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n a_way+=1\r\n elif abs(a-i)>abs(b-i):\r\n b_way+=1\r\n else:\r\n e_way+=1\r\n\r\nprint(a_way,e_way,b_way)", "a,b = (int(s) for s in input().split())\nwin1 = 0\nwin2 = 0\ndraw = 0\nfor i in range(1,7):\n\ta_score = abs(a-i)\n\tb_score = abs(b-i)\n\tif a_score > b_score:\n\t\twin1 +=1\n\telif a_score == b_score:\n\t\tdraw += 1\n\telse:\n\t\twin2 += 1\nprint(win2, draw, win1)\n\t \t\t \t \t \t \t \t\t\t\t\t \t \t\t\t\t\t\t", "def function(inp):\n countA=0\n countB=0\n countD=0\n for i in range(1,7):\n \n if(abs(int(inp[1])-i)>abs(int(inp[0])-i)):\n countA+=1\n elif(abs(int(inp[0])-i)>abs(int(inp[1])-i)):\n countB+=1\n elif(abs(int(inp[0])-i)==abs(int(inp[1])-i)):\n countD+=1\n \n print(str(countA)+\" \"+str(countD)+\" \"+str(countB))\n\ninp = list(map(int, input().split()))\nfunction(inp) \n\t\t\t \t \t\t \t\t \t \t\t\t\t \t\t\t\t \t", "p1 , p2 = map(int,input().split())\r\n\r\np1_result = 0\r\np2_result = 0\r\n\r\nfor i in range(1,7) :\r\n if abs(i - p1) < abs(i - p2) :\r\n p1_result += 1\r\n elif abs(i - p1) > abs(i - p2):\r\n p2_result += 1\r\n\r\ndraw = 6 - (p1_result + p2_result)\r\nprint(p1_result, draw, p2_result)", "a, b = map(int, input().split())\r\n\r\nplayer1_wins = 0\r\ndraws = 0\r\nplayer2_wins = 0\r\n\r\nfor x in range(1, 7):\r\n diff1 = abs(a - x)\r\n diff2 = abs(b - x)\r\n \r\n if diff1 < diff2:\r\n player1_wins += 1\r\n elif diff1 == diff2:\r\n draws += 1\r\n else:\r\n player2_wins += 1\r\n\r\nprint(player1_wins, draws, player2_wins)", "a,b=map(int, input().split())\r\nt=0;u=0;v=0\r\nfor x in range(1,7):\r\n if abs(a-x)<abs(b-x):\r\n t+=1\r\n elif abs(a - x) > abs(b - x):\r\n u += 1\r\n else:\r\n v+=1\r\nprint(t,v,u)", "from bisect import bisect_right\r\nimport math\r\nfrom sys import stdin, stdout\r\nimport collections\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n a, b = multi_input()\r\n wa = 0\r\n wb = 0\r\n d = 0\r\n for i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n wa += 1\r\n elif abs(a-i) > abs(b-i):\r\n wb += 1\r\n else:\r\n d += 1\r\n print(f\"{wa} {d} {wb}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a, b = tuple(map(int, input().split()))\r\n\r\na_win = 0\r\nb_win = 0\r\ndraw = 0\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n a_win += 1\r\n elif abs(a - i) > abs(b - i):\r\n b_win += 1\r\n else:\r\n draw += 1\r\n\r\nprint(a_win, draw, b_win)\r\n", "#378A\r\nimport math\r\na,b=tuple([int(i) for i in input().split()])\r\nm=(a+b)/2\r\nif a<b:\r\n print(math.ceil(m-1), 1-math.ceil(m%1), math.ceil(6-m))\r\nelif a>b:\r\n print(math.ceil(6-m), 1-math.ceil(m%1), math.ceil(m-1))\r\nelse:\r\n print(0,6,0)\r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nlst = [int(x) for x in input().split()]\r\na = lst[0]\r\nb = lst[1]\r\ncount_a = 0\r\ncount_b = 0\r\ndraw = 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n count_a +=1\r\n elif abs(b-i) < abs(a-i):\r\n count_b +=1\r\n else:\r\n draw+=1\r\nprint(count_a,draw,count_b)\r\n ", "a, b = map(int, input().split())\r\nacount = 0\r\nbcount = 0\r\nequal = 0\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n acount += 1\r\n elif abs(a - i) > abs(b - i):\r\n bcount += 1\r\n \r\n else:\r\n equal += 1\r\n \r\nprint(acount, equal, bcount)", "a, b = map(int, input().split())\r\nx = y = z = 0\r\nfor i in range(1, 7):\r\n if abs(i-a) == abs(i-b):\r\n y += 1\r\n elif abs(i-a) < abs(i-b):\r\n x += 1\r\n else:\r\n z += 1\r\nprint(x, y, z)\r\n", "a,b = map(int,input().split())\r\n\r\na_win = 0\r\ndraw = 0\r\nb_win = 0\r\n\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n a_win += 1\r\n elif abs(a-i) > abs(b-i):\r\n b_win += 1\r\n else:\r\n draw += 1\r\n\r\nprint(a_win,draw,b_win)", "def get_results(a,b):\n if a == b:\n return (0,6,0)\n else:\n a_wins = 0\n b_wins = 0\n draw = 0\n for i in range(6):\n if abs(a-(i+1)) < abs(b-(i+1)):\n a_wins+=1\n elif abs(a-(i+1)) > abs(b-(i+1)):\n b_wins+=1\n else:\n draw+=1\n return (a_wins, draw, b_wins)\n\ninput_str = input()\n\na = int(input_str[0])\nb = int(input_str[2])\n\nres = get_results(a,b)\n\nprint(res[0],res[1],res[2])\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\ns,r,t=0,0,0\r\nfor x in range(1,7):\r\n\tif abs(a-x)<abs(b-x):s+=1\r\n\telif abs(a-x)==abs(b-x):r+=1\r\n\telse:t+=1\r\nprint(s,r,t)", "a = input().split()\r\nfirst = int(a[0])\r\nsecond = int(a[1])\r\nf_win = 0\r\ns_win = 0\r\nsame = 0\r\nfor i in range(1,7):\r\n if abs(i - first) == abs(i - second):\r\n same += 1\r\n elif abs(i - first) < abs(i - second):\r\n f_win += 1\r\n else:\r\n s_win += 1\r\nprint(f_win,same,s_win)\r\n", "a, b = list(map(int, input().split()))\r\n\r\nres = [0]*3\r\nfor i in range(1, 7):\r\n if abs(i-a) < abs(i-b):\r\n res[0] += 1\r\n if abs(i-a) == abs(i-b):\r\n res[1] += 1\r\n if abs(i-a) > abs(i-b):\r\n res[2] += 1\r\nprint(*res)\r\n", "a, b = map(int, input().split())\r\ncnt_for_a = 0\r\ncnt_for_b = 0\r\ncnt_for_draw = 0\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n cnt_for_a += 1\r\n elif abs(a - i) > abs(b - i):\r\n cnt_for_b += 1\r\n else:\r\n cnt_for_draw += 1\r\n\r\nprint(cnt_for_a, end=\" \")\r\nprint(cnt_for_draw, end=\" \")\r\nprint(cnt_for_b, end=\"\")", "a,b=list(map(int,input().split()))\r\ncounta=0\r\ncountn=0\r\ncountb=0\r\nlst=[1,2,3,4,5,6]\r\nfor i in lst:\r\n m=a-i\r\n if m<0:\r\n m=-m\r\n n=b-i\r\n if n<0:\r\n n=-n\r\n if m<n:\r\n counta+=1\r\n elif m>n:\r\n countb+=1\r\n else:\r\n countn+=1\r\nprint(counta,end=\" \")\r\nprint(countn,end=\" \")\r\nprint(countb)", "a,b = map(int,input().split())\r\n\r\nf,s,d=0,0,0\r\nfor i in range(1,7):\r\n if(abs(i-a)<abs(i-b)):\r\n f+=1\r\n elif(abs(i-a)>abs(i-b)):\r\n s+=1\r\n else:\r\n d+=1\r\nprint(f,d,s)", "p=0;q=0;r=0\r\na,b=map(int,input().split())\r\nfor x in range(1,7):\r\n\tif(abs(a-x)<abs(b-x)):\r\n\t\tp=p+1\r\n\telif(abs(a-x)==abs(b-x)):\r\n\t\tq=q+1\r\n\telse:\r\n\t\tr=r+1\r\nprint(p,q,r)", "a,b=map(int,input().split())\nn=1\n\naw,d,bw = 0,0,0\nwhile(n<=6):\n p=abs(a-n)\n q=abs(b-n)\n if p>q :\n bw+=1\n elif q>p:\n aw+=1\n else:\n d+=1 \n n+=1\nprint(aw,' ',d,' ',bw,)\n\t\t \t \t \t \t \t \t \t\t \t\t \t", "\r\na, b=map(int, input().split())\r\nwa, wd, wb= 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(i-a)<abs(i-b):\r\n wa += 1\r\n elif abs(i-a)>abs(i-b):\r\n wb += 1\r\n else:\r\n wd += 1\r\n\r\nprint(str(wa) +\" \"+ str(wd) +\" \"+ str(wb))", "n,k=input().split()\nx1=0\nx2=0\nx3=0\nn=int(n)\nk=int(k)\nfor i in range(1,7):\n if(abs(n-i)<abs(k-i)):\n x1+=1\n elif(abs(k-i)<abs(n-i)):\n x2+=1\n elif(abs(k-i)==abs(n-i)):\n x3+=1\nx1=str(x1)\nx2=str(x2)\nx3=str(x3)\nprint(x1+\"\\t\"+x3+\"\\t\"+x2)\n\n \t\t \t \t \t \t\t\t \t \t\t\t\t \t \t\t", "a,b = map(int, input().split())\r\nc=0\r\nd=0\r\ne=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n c+=1\r\n elif abs(a-i)>abs(b-i):\r\n e+=1\r\n else:\r\n d+=1\r\nprint(c, d, e)", "def conv(x):\r\n a=list()\r\n for i in x :\r\n a.append(int(i))\r\n return a\r\na=conv(input().split())\r\nlowl=0\r\ntheni=0\r\ndraw =0\r\nfor i in range(1,7):\r\n if abs(i-a[0])>abs(i-a[1]):\r\n theni+=1\r\n elif abs(i-a[0])<abs(i-a[1]):\r\n lowl+=1\r\n else:\r\n draw+=1\r\nprint(lowl,draw,theni)", "#l = list(map(int, input().strip().split()))[:n]\r\nn, k = input().split()\r\nn, k = int(n), int(k)\r\nc, c2, c3 = 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(n-i) < abs(k-i):\r\n c += 1\r\n elif abs(n-i) > abs(k-i):\r\n c2 += 1\r\n else:\r\n c3 += 1\r\n\r\nprint(str(c)+\" \"+str(c3)+\" \"+str(c2)+\"\\n\")\r\n", "a , b = list(map(int,input().split()))\r\nx , y , z = 0 , 0 , 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i) : x = x + 1\r\n elif abs(a-i) > abs(b-i) : z = z + 1\r\n else : y = y + 1\r\nprint(x , y , z)", "n = list(map(int, input().split()))\np1=0\np2=0\nd=0\ndie = [1,2,3,4,5,6]\nfor i in range(len(die)):\n if(abs(n[0] - die[i]) > abs(n[1] - die[i])):\n p2+=1\n elif(abs(n[0] - die[i]) < abs(n[1] - die[i])):\n p1+=1\n else:\n d+=1\nprint(p1,d,p2,end = ' ')\n\t\t \t\t \t\t\t \t\t\t\t\t \t \t\t \t", "a,b = input(\"\").split()\r\na = int(a)\r\nb = int(b)\r\nif a <= 6 and a >= 1:\r\n if b <= 6 and b >=1 :\r\n p1 = 0\r\n p2 = 0\r\n d = 0\r\n for i in range(1,7):\r\n if abs(a - i) < abs(b - i):\r\n p1 +=1 \r\n elif abs(a - i) > abs(b - i):\r\n p2 +=1\r\n else:\r\n d +=1\r\nprint(p1,d,p2)\r\n ", "#1 2 3 4 5 6 \na, b=map(int,input().split())\nwin1=0\ndraw=0 \nwin2=0\nfor i in range(1,7):\n if(abs(i-a)>abs(i-b)):\n win2=win2+1\n elif(abs(i-b)>abs(i-a)):\n win1=win1+1\n else:\n draw=draw+1\n\nprint(win1,\" \",draw,\" \",win2)\n\n\n\n \t \t \t \t\t\t\t\t\t \t \t \t", "a,b = map(int,input().split())\r\np1,p2,tie = 0,0,0\r\nfor i in range (1,7):\r\n if abs((a - i)) < abs((b - i)):\r\n p1 += 1\r\n elif abs((b - i)) < abs((a - i)):\r\n p2 += 1\r\n else:\r\n tie += 1\r\nprint(p1,tie,p2)\r\n\r\n", "inp = list(map(int,input().split()))\r\na=inp[0]\r\nb=inp[1]\r\ncount=[1,2,3,4,5,6]\r\ncounta=0\r\ndraw=0\r\ncountb=0\r\nfor item in count:\r\n if(abs(item-a)<abs(item-b)):\r\n counta+=1\r\n elif(abs(item-a)>abs(item-b)):\r\n countb+=1\r\n else:\r\n draw+=1\r\nprint (counta,end=\" \")\r\nprint (draw,end=\" \")\r\nprint (countb)", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n draw=0\r\n one=0\r\n sec=0\r\n for i in range(1,7):\r\n x=abs(a-i)\r\n y=abs(b-i)\r\n if(x==y):\r\n draw+=1\r\n elif(x>y):\r\n one+=1\r\n else:\r\n sec+=1\r\n return [sec,draw,one]\r\na,b=map(int,input().split())\r\nprint(*exe())", "a,b = map(int,input().strip().split())\r\nfirst = 0\r\nsecond = 0\r\ndraw = 0\r\nfor i in range(1,7):\r\n if abs(i-a) < abs(i-b):\r\n first+=1\r\n elif abs(i-a) > abs(i-b):\r\n second+=1\r\n else:\r\n draw+=1\r\nprint(first, draw, second)\r\n", "a,b=map(int,input().split())\r\nw1=d=w2=0\r\nfor k in range(1,7):\r\n if abs(k-a)<abs(k-b):\r\n w1+=1\r\n elif abs(k-b)<abs(k-a):\r\n w2+=1\r\n else:\r\n d+=1\r\nprint(w1,d,w2)\r\n", "a, b = map(int, input().split())\r\nz = x = c = 0\r\nfor i in range(1, 7):\r\n q = abs(a - i)\r\n w = abs(b - i)\r\n if q == w:\r\n x += 1\r\n elif q < w:\r\n z += 1\r\n else:\r\n c += 1\r\nprint(z, x, c)", "a, b = [int(x) for x in input().split()]\r\ni = 1\r\na_win = 0\r\ndraw = 0\r\nb_win = 0\r\nwhile i <= 6:\r\n if abs(a-i) > abs(i-b):\r\n b_win +=1\r\n i += 1\r\n elif abs(a-i) < abs(i-b):\r\n a_win +=1\r\n i += 1\r\n else:\r\n draw += 1\r\n i += 1\r\nprint(a_win, draw, b_win)", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\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\ndef main():\r\n # //Write Your Code Here\r\n a, b = get_ints_in_variables()\r\n first = 0\r\n mid = 0\r\n last = 0\r\n for i in range(1, 7):\r\n if abs(i-a) == abs(i-b):\r\n mid += 1\r\n elif abs(i-a) < abs(i-b):\r\n first += 1\r\n elif abs(i-a) > abs(i-b):\r\n last += 1\r\n print(first, mid, last)\r\n# for printing format\r\n# print(\"Case #{}: {}\".format(t+1, ans))\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "n,c=map(int,input().split())\r\nfir, sec, draw=0,0,0\r\nfor i in range(1,7):\r\n if abs(n-i)<abs(c-i):\r\n fir+=1 \r\n elif abs(c-i)<abs(n-i):\r\n sec+=1\r\n else:\r\n draw+=1 \r\nprint(fir,draw,sec) ", "a, b = map(int, input().split())\n# 1 2 3 4 5 6\nfirst = 0\ndraw = 0\nsecond = 0\n\nfor i in range(1, 7):\n if abs(a-i) == abs(b-i):\n draw += 1\n elif abs(a-i) < abs(b-i):\n first += 1\n else:\n second += 1\nprint(first, draw, second)\n", "ints = input()\na, b = [int(x) for x in ints.split(' ')]\n\ndraw = 0\na_wins = 0\nb_wins = 0\n\nfor i in range(1, 7):\n\tif abs(a - i) > abs(b - i):\n\t\tb_wins += 1\n\telif abs(b - i) > abs(a - i):\n\t\ta_wins += 1\n\telse:\n\t\tdraw += 1\n\nprint(a_wins, draw, b_wins)\n\t \t \t \t\t \t \t\t \t \t \t \t\t\t\t", "a,b=map(int,input().split())\r\nawin=0\r\nbwin=0\r\ndraw=0\r\nfor x in range(1,7):\r\n if abs(a-x)<abs(b-x):\r\n awin+=1\r\n if abs(a-x)>abs(b-x):\r\n bwin+=1\r\n if abs(a-x)==abs(b-x):\r\n draw+=1\r\nprint(awin,draw,bwin)", "arr = list(map(int , input().split()))\r\nfirst = 0\r\ndraw = 0\r\nsecound = 0\r\nfor i in range(1 , 7) :\r\n if abs(arr[0] - i) < abs(arr[1] - i) :\r\n first += 1\r\n elif abs(arr[1]-i) < abs(arr[0] - i) :\r\n secound += 1\r\n else :\r\n draw += 1\r\nprint(f\"{first} {draw} {secound}\")", "a,b=map(int,input().split())\r\ncountA=0\r\ncountB=0\r\ndraw=0\r\nfor i in range(1,7):\r\n diff_a=abs(a-i)\r\n diff_b=abs(b-i)\r\n if diff_a>diff_b:\r\n countB+=1\r\n elif diff_a<diff_b:\r\n countA+=1\r\n else:\r\n draw+=1\r\nprint(countA,draw,countB)", "a,b=map(int,input().split())\r\nx,y,d=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)==abs(b-i):\r\n d+=1\r\n if abs(a-i)<abs(b-i):\r\n x+=1\r\n if abs(a-i)>abs(b-i):\r\n y+=1\r\nprint(x,d,y)", "from sys import stdin\r\na, b = map(int, stdin.readline().split())\r\nd = {}\r\na_cnt, b_cnt, tie = 0, 0, 0\r\nfor i in range (1, 7):\r\n d[i] = [abs(a-i), abs(b-i)]\r\nfor i, j in d.items():\r\n if j[0] < j[1]:\r\n a_cnt += 1\r\n elif j[0] > j[1]:\r\n b_cnt += 1\r\n else:\r\n tie += 1\r\nprint(a_cnt, tie, b_cnt)", "a,b = map(int,input().split())\r\ncounte = countf = countd = 0\r\nfor i in range(1,7):\r\n\tfor j in range(1,7):\r\n\t\tif(abs(a-j)<abs(b-j)):\r\n\t\t\tcountd+=1\r\n\t\telif(abs(a-j)>abs(b-j)):\r\n\t\t\tcounte+=1\r\n\t\telse:\r\n\t\t\tcountf+=1\r\nprint(int(countd/6),int(countf/6),int(counte/6))", "a, b = [int(s) for s in input().split(' ')]\r\nx = [0, 0, 0]\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n x[0] += 1\r\n elif abs(a- i) == abs(b - i):\r\n x[1] += 1\r\n else:\r\n x[2] += 1\r\nprint(' '.join([str(c) for c in x]))\r\n", "a, b = map(int, input().split())\r\n\r\ndice = [1, 2, 3, 4, 5, 6]\r\n\r\na_count, b_count, equal = 0, 0, 0\r\n\r\nfor i in dice:\r\n if abs(a - i) < abs(b - i):\r\n a_count += 1\r\n if abs(b - i) < abs(a - i):\r\n b_count += 1\r\n if abs(a - i) == abs(b - i):\r\n equal += 1\r\n\r\nprint(a_count, equal, b_count)", "from sys import stdin, stdout\r\ndef read():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef read_int():\r\n\treturn int(read())\r\n \r\ndef read_ints():\r\n\treturn list(map(int, read().split()))\r\n \r\ndef solve():\r\n\ta,b=read_ints()\r\n\tt1,t2,t3=0,0,0\r\n\tfor i in range(1,7):\r\n\t\tif abs(a-i)<abs(b-i):\r\n\t\t\tt1+=1\r\n\t\telif abs(a-i)==abs(b-i):\r\n\t\t\tt2+=1\r\n\t\telse:\r\n\t\t\tt3+=1\r\n\tprint(t1,t2,t3)\r\n\r\nsolve()\r\n", "a,b=map(int,input().split())\r\nac=[0,0,0]\r\nj=0\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n ac[j]=ac[j]+1\r\n elif(abs(a-i)>abs(b-i)):\r\n ac[j+2]=ac[j+2]+1\r\n else:\r\n ac[j+1]=ac[j+1]+1\r\nfor i in range(0,3):\r\n print(ac[i],end=\" \")", "a,b = list(map(int,input().split()))\r\n\r\naa,d,bb = 0,0,0\r\n\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n aa += 1\r\n elif abs(a-i) > abs(b-i):\r\n bb += 1\r\n else:\r\n d += 1\r\n\r\nprint(aa,end = ' ')\r\nprint(d,end = ' ')\r\nprint(bb)", "a,b=map(int, input().split())\r\nx,y,z=0,0,0\r\nfor i in range(1,7):\r\n p=abs(a-i)\r\n q=abs(b-i)\r\n if p<q:\r\n x+=1\r\n elif p==q:\r\n y+=1\r\n else:\r\n z+=1\r\nprint(x,y,z)", "wina=0\nwinb=0\ndraw=0\na,b = map(int,input().split())\nfor i in range(1,7):\n diffa=i-a\n diffb=i-b\n if(diffa<0):\n diffa=diffa*-1\n if(diffb<0):\n diffb=diffb*-1\n if(diffa<diffb):\n wina=wina+1\n elif(diffa==diffb):\n draw=draw+1\n elif(diffa>diffb):\n winb=winb+1\nprint(wina,end=\" \")\nprint(draw,end=\" \")\nprint(winb)\n\t\t\t\t\t \t \t \t \t \t\t \t \t\t\t\t \t\t", "c1=c2=c3=0\r\na,b=map(int,input().split())\r\nfor i in range(1,7):\r\n if abs(a-i) > abs(b-i):\r\n c1+=1\r\n if abs(a-i) == abs(b-i):\r\n c2+=1\r\n if abs(a-i) < abs(b-i):\r\n c3+=1\r\nprint(c3,c2,c1) ", "a, b = input(\"\").split()\na = int(a)\nb = int(b)\n\nfirst = 0\ndraw = 0\nsecond = 0\n\nfor x in range(1, 7):\n if abs(x - a) > abs(x - b):\n second += 1\n elif abs(x - b) > abs(x - a):\n first += 1\n else:\n draw += 1\n\nprint(first, draw, second)\n\n \t\t\t \t\t \t\t \t \t\t\t\t\t\t\t", "a, b = map(int, input().split())\nm, d, n = 0, 0, 0\n\nfor i in range(1, 7):\n if abs(a - i) > abs(b - i):\n m += 1\n elif abs(b - i) > abs(a - i):\n n += 1\n else:\n d += 1\n\nprint(n, d, m)\n\n\t \t\t\t\t\t \t\t\t \t \t\t \t \t \t\t", "a,b = map(int,input().split())\r\nif a==b:\r\n print(0,6,0)\r\nelif a<b:\r\n awins = a + (b-a-1)//2\r\n bwins = 6-b+1 + (b-a-1)//2\r\n if (b-a)%2==0:\r\n print(awins,1,bwins)\r\n else:\r\n print(awins,0,bwins)\r\nelse:\r\n bwins = b + (a-b-1)//2\r\n awins = 6-a+1 + (a-b-1)//2\r\n if (a-b)%2==0:\r\n print(awins,1,bwins)\r\n else:\r\n print(awins,0,bwins)", "a,b=map(int,input().split())\r\nc=0\r\nd=0\r\ne=0\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n c=c+1\r\n elif(abs(a-i)>abs(b-i)):\r\n d=d+1\r\n elif(abs(a-i)==abs(b-i)):\r\n e=e+1\r\nprint(c,e,d,sep=\" \")", "(n,k)=map(int,input().split())\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\nfor i in range(1,7):\r\n s1=abs(n-i)\r\n s2=abs(k-i)\r\n if s1<s2:\r\n count1=count1+1\r\n if s1>s2:\r\n count2=count2+1\r\n if s1==s2:\r\n count3=count3+1\r\nprint(count1,end=\" \")\r\nprint(count3,end=\" \")\r\nprint(count2,end=\" \")\r\n \r\n \r\n", "a,b=map(int,input().split())\r\nac,dc,bc=0,0,0\r\nfor i in range(1,7):\r\n if max(a,i)-min(a,i)<max(b,i)-min(b,i):\r\n ac+=1\r\n elif max(a,i)-min(a,i)>max(b,i)-min(b,i):\r\n bc+=1\r\n else:\r\n dc+=1\r\nprint(ac,dc,bc)", "a, b = map(int, input().split())\r\n\r\narr = list(range(1, 7))\r\n\r\nbeg, mid, end = 0, 0, 0\r\nfor num in arr:\r\n if abs(num-a) == abs(num-b):\r\n mid += 1\r\n\r\n elif abs(num-a) < abs(num-b):\r\n beg += 1\r\n\r\n else:\r\n end += 1\r\n\r\n\r\nprint(beg, mid, end)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#python 3.5.2\n\nnumbers = str(input())\n\na = numbers.split(' ')\n\ndiff_player_1 = [0, 0, 0, 0, 0, 0]\ndiff_player_2 = [0, 0, 0, 0, 0, 0]\n\nfor x in range(6):\n\tdiff_player_1[x] = abs(int(a[0]) - (x+1))\n\nfor x in range(6):\n\tdiff_player_2[x] = abs(int(a[1]) - (x+1))\n\nplayer_1_wins = 0\nplayer_2_wins = 0\nsame_diff = 0\n\nfor x in range(6):\n\tif diff_player_2[x] - diff_player_1[x] > 0:\n\t\tplayer_2_wins = player_2_wins + 1\n\telif diff_player_1[x] - diff_player_2[x] > 0:\n\t\tplayer_1_wins = player_1_wins + 1\n\telse:\n\t\tsame_diff = same_diff + 1\n\nprint(str(player_2_wins) + \" \" + str(same_diff) + \" \" + str(player_1_wins))\n\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())\nwc=0\ndc=0\nlc=0\n\nfor i in range(1, 7):\n if abs(i-a) < abs(i-b):\n wc+=1\n elif abs(i-a) == abs(i-b):\n dc+=1\n else:\n lc+=1\n\nprint(wc, dc, lc)\n \t \t\t\t \t \t \t \t\t \t \t", "#-------------Program-------------\r\n#----KuzlyaevNikita-Codeforces----\r\n#\r\n\r\na,b=map(int,input().split())\r\np1=0;p2=0;d=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):p1+=1\r\n elif abs(b-i)<abs(a-i):p2+=1\r\n else:d+=1\r\nprint(p1,d,p2)\r\n", "a, b = map(int, input().split())\r\nif a==b:\r\n\tprint(\"0 6 0\")\r\nelif a<b:\r\n\tif (a+b)%2==0:\r\n\t\tprint((a+b)//2-1, 1, 6-(a+b)//2)\r\n\telse:\r\n\t\tprint((a+b)//2, 0, 6-(a+b)//2)\r\nelse:\r\n\tif (a+b)%2==0:\r\n\t\tprint(6-(a+b)//2, 1, (a+b)//2-1)\r\n\telse:\r\n\t\tprint(6-(a+b)//2, 0, (a+b)//2)", "x = input().split()\r\np = int(x[0])\r\nq = int(x[1])\r\nc = []\r\na=0\r\nb=0\r\nd=0\r\nfor i in range(1,7):\r\n if abs(p-i) < abs(q-i):\r\n a+=1\r\n elif abs(p-i) == abs(q-i):\r\n b+=1\r\n else:\r\n d+=1\r\nc.append(a)\r\nc.append(b)\r\nc.append(d)\r\nfor i in c:\r\n print(i, end=' ')", "inp = list(range(1,7))\na,b = (int(s) for s in input().split())\na_win = 0\nb_win = 0\ndraw = 0\nfor n in inp:\n a_diff = abs(a-n)\n b_diff = abs(b-n)\n if a_diff == b_diff:\n draw += 1\n elif a_diff < b_diff:\n a_win += 1\n elif b_diff < a_diff:\n b_win += 1\nprint(a_win,draw, b_win) \n \t\t\t\t\t\t\t\t \t \t\t\t \t \t\t \t \t", "import math\r\na,b=map(int,input().split())\r\nx=y=z=0\r\nfor n in range(1,7):\r\n if math.fabs(n-a)>math.fabs(n-b):\r\n x+=1\r\n elif math.fabs(n-a)<math.fabs(n-b):\r\n y+=1\r\n else:\r\n z+=1\r\n\r\nprint(y,z,x)", "a,b = map(int, input().split())\r\np=q=r=0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n p+=1\r\n elif abs(a-i) > abs(b-i):\r\n r+=1\r\n else:\r\n q+=1\r\nprint(p,q,r,sep = ' ') ", "a, b = (int(i) for i in input().split(\" \"))\ndiff_a = [abs(a - i) for i in range(1, 7)]\ndiff_b = [abs(b - i) for i in range(1, 7)]\n\nx = [1 if diff_b[i] > diff_a[i] else 0 for i in range(6)]\ny = [1 if diff_b[i] == diff_a[i] else 0 for i in range(6)]\nz = [1 if diff_a[i] > diff_b[i] else 0 for i in range(6)]\n\nprint(\" \".join([str(sum(x)), str(sum(y)), str(sum(z))]))\n\t \t\t\t \t\t \t \t \t\t\t\t\t\t \t", "[a,b] = map(int, input().split())\r\nw=0\r\nt=0\r\nl=0\r\nfor i in range(1,7):\r\n \r\n if abs(a-i)<abs(b-i) and a!=b:\r\n w+=1\r\n elif abs(b-i)<abs(a-i) and a!=b:\r\n l+=1\r\n elif abs(b-i) == abs(a-i) and a!=b:\r\n t=1\r\n else:\r\n t=6\r\n \r\nprint(w,t,l)", "x = input()\r\n\r\nlist_x = x.split()\r\n\r\nplayers_num = [int(num) for num in list_x]\r\nresult_list = [0, 0 , 0]\r\n\r\nfor num in range(1,7):\r\n if abs(players_num[0] - num) < abs(players_num[1] - num):\r\n result_list[0] += 1\r\n elif abs(players_num[0] - num) > abs(players_num[1] - num):\r\n result_list[2] += 1\r\n else:\r\n result_list[1] += 1\r\n\r\nprint(result_list[0], result_list[1], result_list[2])\r\n", "import sys\ninput = sys.stdin.readline\n\nA, B = map(int, input().split())\n\nrs = [0, 0, 0]\nfor dr in range(1, 6+1) :\n\tdA, dB = abs(A-dr), abs(B-dr)\n\tif dA < dB : rs[0] += 1\n\telif dA == dB : rs[1] += 1\n\telse : rs[2] += 1\nprint(\" \".join(map(str, rs)))", "import math\r\nimport operator\r\narr = list(map(int, input().split()))\r\na = arr[0]\r\nb = arr[1]\r\nif a == b:\r\n print(\"0 6 0\")\r\nelse:\r\n if (a+b)%2 == 0:\r\n m = int((a+b)/2)\r\n if a < b:\r\n print(m-1,1,6-m)\r\n else:\r\n print(6-m,1,m-1)\r\n else:\r\n m = int((a+b)/2)\r\n if a < b:\r\n print(m,0,6-m)\r\n else:\r\n print(6-m,0,m)\r\n\r\n ", "a,b=map(int,input().split(' '))\r\none=0\r\ntwo=0\r\nthree=0\r\nfor i in range(1,7):\r\n d1=abs(a-i)\r\n d2=abs(b-i)\r\n if d1>d2:\r\n three+=1\r\n elif d2>d1:\r\n one+=1\r\n else:\r\n two+=1\r\n\r\n\r\nprint(one,two,three)", "a,b=map(int,input().split())\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor j in range(1,7):\r\n chk1=a-j\r\n if(chk1<0):\r\n chk1=-chk1\r\n chk2=b-j\r\n if(chk2<0):\r\n chk2=-chk2\r\n if(chk1<chk2):\r\n c1+=1\r\n elif(chk1==chk2):\r\n c2+=1\r\n else:\r\n c3+=1\r\nprint(c1,c2,c3)", "a ,b = map(int , input().split())\r\n#diece=[1,2,3,4,5,6]\r\nf, s , d = 0 ,0 , 0\r\nfor x in range(1,7) :\r\n if abs(a-x) < abs(b-x) :\r\n f+=1\r\n elif abs(b-x) < abs(a-x) :\r\n s+=1\r\n else :\r\n d+=1 \r\n \r\n\r\nprint(f , d , s )", "a, b = map(int, input().split())\r\nlst = [0, 0, 0]\r\nfor x in range(1, 7):\r\n if abs(a - x) > abs(b - x): lst[2] += 1\r\n elif abs(a - x) < abs(b - x): lst[0] += 1\r\n else: lst[1] += 1\r\nprint(*lst)", "n,m=map(int,input().split())\r\na,d,b=0,0,0\r\nfor i in range(1,7):\r\n p=abs(n-i)-abs(m-i)\r\n a+=p<0\r\n d+=p==0\r\n b+=p>0\r\nprint(a,d,b)", "a,b=map(int,input().split())\r\nz,x,c=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n z+=1\r\n elif abs(a-i)>abs(b-i):\r\n c+=1\r\n else:\r\n x+=1\r\nprint(z,x,c)", "choice=input()\nchoice=choice.split()\nwina=0\ndraw=0\nwinb=0\nfor i in range(1,7):\n temp1=abs(int(choice[0])-i)\n temp2=abs(int(choice[1])-i)\n if temp1>temp2:\n winb+=1\n elif temp1==temp2:\n draw+=1\n else:\n wina+=1\nprint(wina,draw,winb)\n \t \t \t\t\t \t\t \t \t\t\t\t\t \t", "n,q=map(int,input().split())\r\nl=0\r\nr=0\r\nd=0\r\nfor i in range(1,7):\r\n if (abs(i-n)<abs(i-q)):\r\n l+=1\r\n elif (abs(i-n)>abs(i-q)):\r\n r+=1\r\n elif (abs(i-n)==abs(i-q)):\r\n d+=1\r\nprint(l,d,r)", "s = input().split()\r\na,b = (int(i) for i in s)\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in range(1,7):\r\n\tif(abs(i-a)>abs(i-b)):\r\n\t\tc3 += 1\r\n\telif(abs(i-a)==abs(i-b)):\r\n\t\tc2 += 1\r\n\telse:\r\n\t\tc1 += 1\r\nprint(c1,c2,c3)\r\n", "a,b = map(int,input().split())\r\naa=0\r\nbb=0\r\ndd=0\r\nfor i in range(1,7):\r\n awins = abs(i-a)\r\n bwins = abs(i-b)\r\n if awins<bwins:\r\n aa+=1\r\n if bwins<awins:\r\n bb+=1\r\n if awins==bwins:\r\n dd+=1\r\n \r\nprint(aa,dd,bb)", "a, b = map(int, input().split())\r\ncounter1 = 0\r\ncounter2 = 0\r\ncounter3 = 0\r\nfor i in range(1, 7):\r\n c = abs(i - a)\r\n d = abs(i - b)\r\n if c < d:\r\n counter1 += 1\r\n elif c == d:\r\n counter2 += 1\r\n else:\r\n counter3 += 1\r\nprint(counter1, counter2, counter3)", "a,b=map(int,input().split())\r\nwa,wd,wb=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n wa+=1\r\n elif abs(a-i) > abs(b-i):\r\n wb+=1\r\n else:\r\n wd+=1\r\nprint(wa,wd,wb)", "a,b=map(int, input().split())\r\nx,y,t=0,0,0\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n x += 1\r\n elif abs(b - i) < abs(a - i):\r\n y += 1\r\n elif abs(b-i)== abs(a-i):\r\n t+=1\r\nprint(x,t,y) ", "a,b=map(int,input().split())\r\nx=y=z=0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n x+=1\r\n elif abs(a-i)<abs(b-i):\r\n z+=1\r\n else:\r\n y+=1\r\nprint(z,end=' ')\r\nprint(y,end=' ')\r\nprint(x,end=' ')", "x,y =map(int,(input().split()))\nwin1st = 0\ndraw = 0\nwin2st = 0\nfor i in range(1,7):\n a1=abs(i-x)\n b1=abs(i-y)\n if a1<b1:\n win1st+=1\n elif a1>b1:\n win2st+=1\n else:\n draw+=1\nprint(win1st,draw,win2st)\n \t\t\t\t \t \t \t \t \t \t \t \t", "a,b = map(int,input().split())\r\nA,B,T = 0,0,0\r\nfor i in range(1,7):\r\n x = abs(a-i)\r\n y = abs(b-i)\r\n if x<y:\r\n A+=1\r\n elif y<x:\r\n B+=1\r\n else:\r\n T+=1\r\nprint(A,T,B)\r\n", "a, b = map(int, input().split())\r\nc, d, e = 0,0,0\r\nfor i in range(1, 7):\r\n if abs(i-a) > abs(i-b):\r\n c += 1\r\n elif abs(i-a) < abs(i-b):\r\n e += 1\r\n else:\r\n d += 1\r\nprint(e, d, c)", "from math import *\r\na,b=[int(x) for x in input().split()]\r\nres1,res2,res3=0,0,0\r\nif a==b:\r\n print(0,6,0)\r\nelse:\r\n if (a+b)%2==0:\r\n res2=1 \r\n else: \r\n res2=0\r\n for i in range(1,7):\r\n if int(fabs(a-i))<int(fabs(b-i)):\r\n res1+=1 \r\n print(res1,res2,6-res1-res2)", "playerOne,playerTwo=map(int,input().split())\r\noneWin=0\r\ntwoWin=0\r\ndraw=0\r\nfor i in range(1,7):\r\n if abs(playerOne-i)<abs(playerTwo-i):\r\n oneWin+=1\r\n elif abs(playerOne-i) > abs(playerTwo-i):\r\n twoWin +=1\r\n elif abs(playerTwo-i)==abs(playerOne-i):\r\n draw +=1\r\nprint(oneWin,draw,twoWin,end=' ') ", "a,b=map(int,input().split())\r\nA=0\r\nD=0\r\nB=0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n A+=1\r\n elif abs(i-a)>abs(i-b):\r\n B+=1\r\n else:\r\n D+=1\r\nprint(A,D,B)\r\n", "a, b = input().split()\na = int(a)\nb = int(b)\nwin_a = 0\nwin_b = 0\ndraw = 0\nfor value in range(1, 7):\n if abs(a-value) < abs(b-value):\n win_a += 1\n elif abs(a - value) > abs(b - value):\n win_b += 1\n elif abs(a - value) == abs(b - value):\n draw += 1\nprint(win_a, end = ' ')\nprint(draw, end = ' ')\nprint(win_b)\n\n \t \t\t \t\t \t\t\t \t\t\t \t \t", "a,b=map(int,input().split())\r\nq,w,e=0,0,0\r\nfor x in range(1,7):\r\n if abs(a-x)>abs(b-x):\r\n q+=1\r\n elif abs(a-x)<abs(b-x):\r\n w+=1\r\n elif abs(a-x)==abs(b-x):\r\n e+=1\r\nprint(w,e,q)", "a,b=map(int,input().split())\r\n\r\nfirst=0\r\ndraw=0\r\nsecond=0\r\ndef solve(a,b,num):\r\n if (abs(a-num)<abs(b-num)):\r\n return 1\r\n elif (abs(a-num)>abs(b-num)):\r\n return 2\r\n\r\n else:\r\n return 0.5\r\n\r\nif (solve(a,b,1)==1):\r\n first+=1\r\nelif (solve(a,b,1)==2):\r\n second+=1\r\nelse:\r\n draw+=1\r\n\r\nif (solve(a,b,2)==1):\r\n first+=1\r\nelif (solve(a,b,2)==2):\r\n second+=1\r\nelse:\r\n draw+=1\r\n\r\nif (solve(a,b,3)==1):\r\n first+=1\r\nelif (solve(a,b,3)==2):\r\n second+=1\r\nelse:\r\n draw+=1\r\n\r\nif (solve(a,b,4)==1):\r\n first+=1\r\nelif (solve(a,b,4)==2):\r\n second+=1\r\nelse:\r\n draw+=1\r\n\r\nif (solve(a,b,5)==1):\r\n first+=1\r\nelif (solve(a,b,5)==2):\r\n second+=1\r\nelse:\r\n draw+=1\r\n\r\nif (solve(a,b,6)==1):\r\n first+=1\r\nelif (solve(a,b,6)==2):\r\n second+=1\r\nelse:\r\n draw+=1\r\n\r\nprint(first,draw,second)\r\n\r\n\r\n", "a,b = map(int,input().split())\r\nresult = [0,0,0]\r\nfor i in range(1,7):\r\n diffA = abs(a-i)\r\n diffB = abs(b-i)\r\n if diffA < diffB:\r\n result[0] += 1 \r\n elif diffB < diffA:\r\n result[2] += 1 \r\n else:\r\n result[1] += 1\r\n\r\nprint(*result)", "a,b = tuple(map(int,input().split()))\n\na_counter = 0\ntie_counter = 0\nb_counter = 0\nfor x in range(1,7):\n if abs(a - x) < abs(b - x):\n a_counter += 1\n elif abs(a - x) > abs(b - x):\n b_counter += 1\n else:\n tie_counter += 1\n\nprint(a_counter, tie_counter, b_counter)", "p1, p2 = map(int, input().split(' '))\n\np1_wins = 0\ndraw = 0\np2_wins = 0\n\n\nfor throw in range(1, 7):\n if abs(throw - p1) == abs(throw - p2):\n draw = draw + 1\n elif abs(throw - p1) < abs(throw - p2):\n p1_wins = p1_wins + 1\n else:\n p2_wins = p2_wins + 1\nprint (p1_wins, draw, p2_wins)\n \t \t\t \t\t \t \t\t \t \t\t \t \t", "a,b = input(\" \").split()\na = int(a)\nb = int(b)\n\nfirst = 0\nsecond = 0 \ndraw = 0\nfor x in range(1,7):\n if(abs(x-a)>abs(x-b)):\n second+=1\n elif(abs(x-a)<abs(x-b)):\n first+=1\n else:\n draw+=1\nprint(first, draw, second)\n \t \t\t\t\t\t\t \t \t\t\t \t\t \t \t\t", "import math as m\r\n#from math import comb as nCr\r\nt=input\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=map(int,t().split())\r\n a=list(map(int,t().split()))\r\n'''\r\na,b= map(int,t().split())\r\ns1,s2,s3=0,0,0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b): s1+=1\r\n elif abs(i-a)==abs(i-b): s2+=1\r\n else: s3+=1\r\nprint(s1,s2,s3)\r\n ", "s = input()\r\na, b = s.split()\r\n\r\na = int(a)\r\nb = int(b)\r\nx = y = z = 0\r\n\r\nfor i in range(1, 7):\r\n\tdifA = abs(i - a)\r\n\tdifB = abs(i - b)\r\n\tif (difA < difB):\r\n\t\tx += 1\r\n\telif (difA > difB):\r\n\t\tz += 1\r\n\telse:\r\n\t\ty += 1\r\n\r\nprint(x, y, z)", "a,b = map(int,input().split())\r\nc,d,s=0,0,0\r\n\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tc+=1\r\n\telif abs(a-i)==abs(b-i):\r\n\t\ts+=1\r\n\telse:\r\n\t\td+=1\r\n\r\nprint(c,s,d)", "a, b = map(int, input().split())\r\nif(a == b):\r\n print(\"0 6 0\")\r\nelif(a < b):\r\n if(a % 2 == b % 2):\r\n print((a + b) // 2 - 1, 1, 6 - (a + b) // 2)\r\n else:\r\n print((a + b + 1) // 2 - 1, 0, 6 - (a + b - 1) // 2)\r\nelse:\r\n if (a % 2 == b % 2):\r\n print(6 - (a + b) // 2, 1, (a + b) // 2 - 1)\r\n else:\r\n print(6 - (a + b - 1) // 2, 0, (a + b + 1) // 2 - 1)", "a,b=list(map(int,input().strip().split()))\r\n\r\nc=0\r\nm=0\r\nn=0\r\nfor x in range(1,6+1):\r\n if (abs(a-x))<(abs(b-x)):\r\n c+=1\r\n\r\n elif (abs(a-x))>(abs(b-x)):\r\n m+=1\r\n \r\n elif (abs(a-x))==(abs(b-x)):\r\n n+=1\r\nprint(c , n, m)", "def dice(arr):\r\n a=arr[0]\r\n b=arr[1]\r\n team_a=0\r\n team_b=0\r\n draw=0\r\n for i in range(1,7):\r\n dif1=abs(a-i)\r\n dif2=abs(b-i)\r\n if dif1<dif2:\r\n team_a+=1\r\n if dif2<dif1:\r\n team_b+=1\r\n if dif1==dif2:\r\n draw+=1\r\n \r\n print(team_a,end=' ')\r\n print(draw,end=' ')\r\n print(team_b,end=' ')\r\n \r\n\r\n\r\n\r\n\r\n\r\narr=list(map(int,input('').split()))\r\ndice(arr)", "a,b=map(int,input().split())\r\na1=a2=a3=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i): a1+=1\r\n elif abs(a-i)>abs(b-i): a3+=1\r\n else: a2+=1\r\nprint(a1,a2,a3)", "a,b = map(int, input().split())\r\nga,e,gb = 0,0,0\r\nfor x in range(1,7):\r\n k1 = a-x\r\n k2 = b-x\r\n if k1 < 0:\r\n k1 = -1*k1\r\n if k2 < 0:\r\n k2 = -1*k2\r\n if(k1<k2):\r\n ga += 1\r\n elif k1 == k2:\r\n e += 1\r\n else:\r\n gb+= 1\r\nprint(ga,e,gb)", "import sys\r\ninp=sys.stdin.readline\r\nout=sys.stdout.write\r\ndef ii(): return int(inp())\r\ndef mi(): return map(int,inp().strip().split())\r\ndef li(): return list(map(int,inp().strip().split()))\r\na,b=mi()\r\nwa=0\r\nd=0\r\nwb=0\r\nfor i in range(1,7):\r\n if(abs(i-a)<abs(i-b)):\r\n wa+=1\r\n elif(abs(i-a)>abs(i-b)):\r\n wb+=1\r\n else:\r\n d+=1\r\nprint(wa,d,wb)", "a,b=[int(x) for x in input().split()]\r\nl=[0]*3\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):l[2]+=1\r\n elif abs(a-i)<abs(b-i):l[0]+=1\r\n else:l[1]+=1\r\nprint(*l,sep=' ')\r\n", "z=list(map(int,input().split()))\r\na=0\r\nb=0\r\nd=0\r\n\r\nfor i in range(1,7,1) :\r\n if abs(z[0]-i) < abs(z[1]-i) :\r\n a+=1\r\n elif abs(z[0]-i)== abs(z[1]-i) :\r\n d+=1\r\n else :\r\n b+=1\r\n\r\nprint(a,d,b)", "import sys\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\na,b = get_ints()\r\noup = [0,0,0]\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n oup[0] += 1\r\n elif abs(i-a)==abs(i-b):\r\n oup[1] += 1\r\n else:\r\n oup[2] += 1\r\nprint(*oup)", "a,b=map(int,input().split())\r\nsa=0\r\nsn=0\r\nsb=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n sa=sa+1\r\n if abs(a-i)>abs(b-i):\r\n sb=sb+1\r\n if abs(a-i)==abs(b-i):\r\n sn=sn+1\r\nprint(sa,sn,sb)\r\n \r\n", "a, b = map(int, input().split())\nfw = 0\nnw = 0\nsw = 0\nfor i in range(1,7):\n if abs(a - i) < abs(b - i):\n fw += 1\n elif abs(a - i) > abs(b - i):\n sw += 1\n else:\n nw += 1\nprint(fw, nw, sw)\n \t \t \t\t \t \t \t \t\t \t \t \t", "a,b = map(int, input().split())\r\nm = 0\r\nv = 0\r\nn = 0\r\nfor i in range(1, 7):\r\n if abs(a-i)<abs(b-i):\r\n m += 1\r\n elif abs(a-i) == abs(b-i):\r\n n += 1\r\n elif abs(a-i) > abs(b-i):\r\n v += 1\r\nprint(m,n,v)\r\n", "n,m=input().split(\" \")\r\nn=int(n)\r\nm=int(m)\r\nnw=0\r\nmw=0\r\ndr=0\r\nfor i in range(1,7):\r\n if abs(n-i)>abs(m-i):\r\n mw+=1\r\n elif abs(n-i)<abs(m-i):\r\n nw+=1\r\n else:\r\n dr+=1\r\nprint(nw,dr,mw)", "a,b=map(int,input().split())\r\nm=n=o=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n m+=1\r\n elif abs(a-i)==abs(b-i):\r\n o+=1\r\n else:\r\n n+=1\r\nprint(m,o,n)\r\n ", "a,b = map(int,input().split())\r\naWins = 0\r\nbWins = 0\r\ndraws = 0\r\nfor x in range(1,7):\r\n if(abs(x-a)<abs(x-b)):\r\n aWins = aWins + 1\r\n elif(abs(x-a)>abs(x-b)):\r\n bWins = bWins + 1\r\n else:\r\n draws = draws + 1\r\n\r\nprint(aWins,draws,bWins)\r\n", "a , b =map(int,input().split())\r\naw , d,bw =0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n aw+=1\r\n elif abs(a-i)==abs(b-i):\r\n d+=1\r\n else:\r\n bw+=1\r\nprint(aw,d,bw)\r\n", "a,b = map(int,input().split())\r\n\r\nfirst,second,draw =0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i) > abs (b-i):\r\n second = second + 1 \r\n elif abs(a-i) < abs (b-i):\r\n first = first+1 \r\n else:\r\n draw = draw +1 \r\n\r\nprint(first,draw,second)", "def solve():\r\n\t\r\n\tm, n = list(map(int, input().strip().split()))\r\n\t\r\n\tfirst = 0\r\n\tdraw = 0\r\n\tsecond = 0\r\n\t\r\n\tfor i in range(1, 7):\r\n\t\tif abs(m - i) == abs(n - i):\r\n\t\t\tdraw += 1\r\n\t\telif abs(m - i) < abs(n - i):\r\n\t\t\tfirst += 1\r\n\t\telse:\r\n\t\t\tsecond += 1\r\n\tprint('{} {} {}'.format(first, draw, second))\r\n# n, k = list(map(int, input().strip().split()))\r\n# n = int(input())\r\nresult = solve()", "inputs = input(\"\").split(\" \")\na = int(inputs[0])\nb = int(inputs[1])\n\np1 = 0\np2 = 0\ndraw = 0\nfor i in range(6):\n dice = 6 - i\n if abs(dice-a) < abs(dice-b):\n p1 += 1\n elif abs(dice-a) > abs(dice-b):\n p2 += 1\n else:\n draw += 1\n\nprint(p1, end = \" \")\nprint(draw, end = \" \")\nprint(p2, end = \" \")\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\na1=0;d=0;b1=0\r\nfor i in range(1,7):\r\n t=abs(i-a)\r\n n=abs(i-b)\r\n if t>n:b1+=1\r\n elif t<n:a1+=1\r\n else: d+=1\r\nprint(a1,d,b1)", "[a, b] = [int(x) for x in input().split()]\r\nw = l = d = 0\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i): w += 1\r\n elif abs(a-i) > abs(b-i): l += 1\r\n else: d += 1\r\nprint(w, d, l)\r\n", "def I(): return map(int, input().split())\r\n\r\n\r\na, b = I()\r\nz = x = c = 0\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n z += 1\r\n elif abs(a-i) > abs(b-i):\r\n c += 1\r\n else:\r\n x += 1\r\nprint(z, x, c)\r\n", "x ,y = list(map(int , input().split()))\r\nwin = lose = draw =0\r\nfor i in range(1 , 7):\r\n if abs(x-i)<abs(y-i):\r\n win +=1\r\n elif abs(x-i)==abs(y-i):\r\n draw +=1\r\n else:\r\n lose +=1\r\n\r\nprint(win , draw , lose)", "a,b=map(int,input().split())\r\nf=0\r\nd=0\r\ns=0\r\nfor i in range(1,7):\r\n if(abs(i-a)<abs(i-b)):\r\n f+=1\r\n elif(abs(i-a)==abs(i-b)):\r\n d+=1\r\n else:\r\n s+=1\r\nprint(f,d,s)", "from collections import defaultdict\r\nprefix_draw = defaultdict(int)\r\nprefix_a = defaultdict(int)\r\nprefix_b = defaultdict(int)\r\nfor i in range(1, 7):\r\n for j in range(1, 7):\r\n for k in range(1, 7):\r\n if abs(i - k) == abs(j - k):\r\n prefix_draw[str(i) + \" : \" + str(j)] += 1\r\n elif abs(i - k) < abs(j - k):\r\n prefix_a[str(i) + \" : \" + str(j)] += 1\r\n else:\r\n prefix_b[str(i) + \" : \" + str(j)] += 1\r\n\r\na, b = map(int, input().split())\r\nprint(prefix_a[str(a) + \" : \" + str(b)], prefix_draw[str(a) + \" : \" + str(b)], prefix_b[str(a) + \" : \" + str(b)])\r\n", "a,b=map(int,input().split())\r\nf=0\r\nd=0\r\ns=0\r\nfor i in range(1,7):\r\n a1=abs(a-i)\r\n b1=abs(b-i)\r\n if(a1<b1):\r\n f+=1\r\n elif(b1<a1):\r\n s+=1\r\n else:\r\n d+=1\r\nprint(str(f)+\" \"+str(d)+\" \"+str(s))", "#~~~~~~~~~~~~~~~ JAI SHREE RAM ~~~~~~~~~~~~~~~~~~#\r\n\r\nimport math; from collections import *\r\nimport sys; from functools import reduce\r\n\r\n# sys.setrecursionlimit(10**6)\r\n\r\ndef get_ints(): return map(int, input().strip().split())\r\ndef get_list(): return list(get_ints())\r\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\nDIRECTIONS = [[0, 1], [0, -1], [1, 0], [1, -1]] #up, down, right, left\r\nNEIGHBOURS = [(i, j) for i in range(-1, 2) for j in range(-1, 2) if (i!=0 or j!=0)]\r\n\r\nOrdUnicode_a = ord('a'); OrdUnicode_A = ord('A')\r\nCAPS_ALPHABETS = {chr(i+OrdUnicode_A) : i for i in range(26)}\r\nSMOL_ALPHABETS = {chr(i+OrdUnicode_a) : i for i in range(26)}\r\n\r\nUGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)+1; INFINITY = float('inf')\r\n\r\n# sys.stdin=open(\"input.txt\",\"r\");sys.stdout=open(\"output.txt\",\"w\")\r\n\r\n# for _testcases_ in range(int(input())):\r\na_win = b_win = draw = 0\r\na, b = get_ints()\r\nfor i in range(1, 7):\r\n if abs(i-a) < abs(i-b):\r\n a_win += 1\r\n elif abs(i-a) > abs(i-b):\r\n b_win += 1\r\n else:\r\n draw += 1\r\nprint(a_win, draw, b_win)\r\n\r\n\r\n'''\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\nTHE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )\r\nLink may be copy-pasted here if it's taken from other source.\r\nDO NOT PLAGIARISE.\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\n'''\r\n", "a,b=map(int,input().split())\r\nx,y,z=0,0,0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n x=x+1\r\n elif abs(i-a)>abs(i-b):\r\n y=y+1\r\n else:\r\n z=z+1\r\nprint(x,z,y)\r\n", "a,b=map(int,input().split())\r\naw=0\r\nbw=0\r\nd=0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n bw+=1\r\n elif abs(a-i)<abs(b-i):\r\n aw+=1\r\n else:d+=1\r\nprint(aw,d,bw,sep=\" \")", "def sol():\r\n a,b=map(int,input().split())\r\n f=d=s=0\r\n for i in range(1,7):\r\n if(abs(a-i)>abs(b-i)):\r\n f+=1\r\n elif(abs(a-i)<abs(b-i)):\r\n s+=1\r\n else:\r\n d+=1\r\n print(s,d,f)\r\nif(__name__=='__main__'):\r\n sol()\r\n", "n,k=input().split()\nn1=0\nn2=0\nn3=0\nn=int(n)\nk=int(k)\nfor i in range(1,7):\n if(abs(n-i)<abs(k-i)):\n n1+=1\n elif(abs(k-i)==abs(n-i)):\n n2+=1\n elif(abs(k-i)<abs(n-i)):\n n3+=1\nprint(str(n1)+\" \"+str(n2)+\" \"+str(n3))\n\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\nwin1 = 0\r\ndraw = 0\r\nwin2 = 0\r\nfor i in range(1,7):\r\n d1 = abs(i - a)\r\n d2 = abs(i - b)\r\n if(d1 == d2):\r\n draw += 1\r\n elif(d1 < d2):\r\n win1 += 1\r\n else:\r\n win2 += 1\r\nprint(win1,draw,win2)\r\n", "a, b = map(int, input().split())\r\nans1, ans2, ans3 = 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n ans1 += 1\r\n elif abs(a - i) == abs(b - i):\r\n ans2 += 1\r\n elif abs(a - i) > abs(b - i):\r\n ans3 += 1\r\nprint(ans1, ans2, ans3)", "a,b = map(int,input().split())\nanss =[0,0,0]\nfor i in range(1,7,1):\n if abs(a-i) > abs(b-i) :\n anss[2] +=1\n if abs(a-i) < abs(b-i) :\n anss[0] +=1\n if abs(a-i) == abs(b-i) :\n anss[1] +=1\n\n[print(ans,end=' ') for ans in anss]\nprint()", "a, b = map(int, input().split())\n\nwins_first = 0\ndraws = 0\nwins_second = 0\n\nfor i in range(1, 7):\n diff_a = abs(a - i)\n diff_b = abs(b - i)\n if diff_a < diff_b:\n wins_first += 1\n elif diff_a > diff_b:\n wins_second += 1\n else:\n draws += 1\n\nprint(wins_first, draws, wins_second)\n\n\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=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n x+=1\r\n elif abs(a-i)<abs(b-i):\r\n y+=1\r\n else:\r\n z+=1\r\nprint(y,z,x)", "x1,y1=map(int,input().split())\nw_x,w_y,d=0,0,0\nfor i in range(1,7):\n x=abs(x1-i)\n y=abs(y1-i)\n if(x>y):\n w_x+=1\n elif(x<y):\n w_y+=1\n elif(x==y):\n d+=1\nprint(w_y,d,w_x)\n\t\t \t \t \t\t \t\t\t \t \t\t\t \t", "import math\r\n[a,b] = map(int, input().split())\r\nz = 0\r\nx = 0\r\nc = 0\r\nfor i in range(6):\r\n if math.fabs(i-a+1)<math.fabs(i-b+1):\r\n z=z+1\r\n elif math.fabs(i-a+1)>math.fabs(i-b+1):\r\n c=c+1\r\n else:\r\n x=x+1\r\nprint(z,x,c)", "l1=[int(i) for i in input().split()]\r\nj=1\r\nc1=0\r\nc2=0\r\nc3=0\r\nwhile(j<=6):\r\n if(abs(j-l1[0])<abs(j-l1[1])):\r\n \r\n c1+=1\r\n elif(abs(j-l1[0])==abs(j-l1[1])):\r\n c2+=1\r\n else:\r\n c3+=1\r\n j+=1\r\nprint(c1,c2,c3)", "a, b = map(int, input().split())\r\nw = 0\r\nl = 0\r\n\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n w += 1\r\n elif abs(a - i) > abs(b - i):\r\n l += 1\r\nprint(\"%d %d %d\" % (w, 6 - w - l, l))", "a,b = (int(s) for s in input().split())\r\nf,d,s = 0,0,0\r\nfor i in range(1,7) :\r\n if abs(a-i) < abs(b-i) : f += 1\r\n elif abs(a-i) == abs(b-i) : d += 1\r\n else : s += 1\r\nprint(f,d,s)\r\n", "a, b = map(int, input().split())\r\nfirst, draw, second = 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(b-i) > abs(a-i):\r\n first += 1\r\n elif abs(b-i) < abs(a-i):\r\n second += 1\r\n else:\r\n draw += 1;\r\nprint(str(first) + \" \" + str(draw) + \" \" + str(second))\r\n", "a,b = map(int,input().split())\r\ncnt_a,cnt_draw,cnt_b = 0,0,0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n cnt_a += 1\r\n elif abs(i-a)==abs(i-b):\r\n cnt_draw += 1\r\n elif abs(i-a)>abs(i-b):\r\n cnt_b += 1\r\nprint(cnt_a,cnt_draw,cnt_b)", "a,b=map(int,input().split())\r\neql=0\r\na_=0;b_=0\r\nfor i in range(1,7):\r\n if abs(a-i)==abs(b-i):\r\n eql+=1\r\n if abs(a-i)<abs(b-i):\r\n a_+=1\r\n if abs(b-i)<abs(a-i):\r\n b_+=1\r\nprint(a_,eql,b_)", "n, m = map(int, input().split())\r\nx, y, z = 0, 0, 0\r\nfor i in range(1, 7):\r\n check = abs(n-i) - abs(m-i)\r\n x += check<0\r\n y += check==0\r\n z += check>0\r\nprint(x, y, z)", "n=list(map(int,input().split()))\r\na=int(n[0])\r\nb=int(n[1])\r\nf=0\r\ng=0\r\nc=0\r\nd=0\r\ne=0\r\nfor i in range(1,7):\r\n f=abs(a-i)\r\n g=abs(b-i)\r\n if f<g:\r\n c=c+1\r\n if f==g:\r\n d=d+1\r\n if f>g:\r\n e=e+1\r\nprint(c,d,e,end=\" \")\r\n \r\n", "f , s = map(int,input().split())\r\ncount_f_w = 0\r\ncount_s_w = 0\r\n\r\nfor i in range(1,7):\r\n if abs(f-i) < abs(s-i):\r\n count_f_w += 1\r\n elif abs(f-i) > abs(s-i):\r\n count_s_w += 1\r\n\r\nprint(count_f_w,6-(count_f_w+count_s_w),count_s_w)", "if __name__ == \"__main__\":\r\n a, b = map(int, input().split())\r\n l, m, r = 0, 0, 0\r\n for i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n l += 1\r\n elif abs(a - i) > abs(b - i):\r\n r += 1\r\n else:\r\n m += 1\r\n print(l, m, r)\r\n", "a,b=map(int,input().split())\r\ncnta=0\r\ncntb=0\r\ncnt=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n cnta+=1\r\n elif abs(a-i)==abs(b-i):\r\n cnt+=1\r\n else:\r\n cntb+=1\r\nprint(cnta,cnt,cntb)", "#\nimport sys\n\n###########\n\ndef solve():\n a, b = map(int, input().split())\n count = [0,0,0]\n for i in range(1,7):\n if abs(a-i) < abs(b-i):\n count[0] += 1\n elif abs(a-i) > abs(b-i):\n count[2] += 1\n else:\n count[1] += 1\n print(*count)\n\n\n########################################################################################################################\ndef main():\n t = 1#int(input())\n for _ in range(t):\n solve()\n\n\nif __name__ == \"__main__\":\n main()\n\n\t\t \t \t\t\t \t \t\t \t \t\t\t", "a,b=[int(x) for x in input().split(\" \")]\r\nif a==b:\r\n print(\"0 6 0\")\r\nelse:\r\n x,y,z=0,0,0\r\n for i in range(1,7):\r\n if abs(i-a) < abs(i-b): x+=1\r\n elif abs(i-a) > abs(i-b): z+=1\r\n else: y+=1\r\n print(x,y,z)", "x,y=map(int,input().split())\r\na,b,c=0,0,0\r\nfor i in range(1,7):\r\n if abs(i-x)<abs(i-y):\r\n a+=1\r\n elif abs(i-x)>abs(i-y):\r\n c+=1\r\n else:\r\n b+=1\r\nprint(a,b,c)", "p1,p2=map(int,input().split())\nw=d=l=0;\nfor i in range(1,7):\n if(abs(i-p1)<abs(i-p2)):\n w=w+1\n elif(abs(i-p1)==abs(i-p2)):\n d=d+1\n else:\n l=l+1\nprint(w,d,l)\n\t \t\t \t\t \t\t\t \t\t \t \t \t\t\t \t", "i = [int(i) for i in input().split()]\r\na = i[0]\r\nb = i[1]\r\ncounts = 0\r\ncountl = 0\r\ncountd = 0\r\nfor i in range(1,7):\r\n if abs(i-a) < abs(i-b):\r\n counts += 1\r\n elif(abs(i-a) > abs(i-b)):\r\n countl += 1\r\n else:\r\n countd += 1\r\nprint(counts,countd,countl)", "x,y = list(map(int,input().split()))\r\nans = [0,0,0]\r\nfor i in range(1,7):\r\n if abs(x-i) < abs(y-i):\r\n ans[0] += 1\r\n elif abs(x-i) == abs(y-i):\r\n ans[1] += 1\r\n else:\r\n ans[2] += 1\r\nprint(*ans)", "ch=input()\r\ntab=ch.split()\r\nm=int(tab[0])\r\nn=int(tab[1])\r\np=0\r\npp=0\r\nd=0\r\nfor i in range(6):\r\n if(abs(m-(i+1)))==(abs(n-(i+1))):\r\n d+=1\r\n elif (abs(m-(i+1)))<(abs(n-(i+1))):\r\n p+=1\r\n else:\r\n pp+=1\r\n\r\nprint(p,d,pp)", "a, b = map(int, input().split())\n\nwin1 = 0\ndraw = 0\nwin2 = 0\n\nfor i in range(1, 7):\n if abs(i-a) < abs(i-b):\n win1 += 1\n elif abs(i-a) == abs(i-b):\n draw += 1\n else:\n win2 += 1\n\nprint(win1, draw, win2)", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nab_diff=0\r\na_diff=0\r\nb_diff=0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n a_diff+=1\r\n elif abs(i-a)>abs(i-b):\r\n b_diff+=1\r\n else:\r\n ab_diff+=1\r\n \r\nprint(a_diff,end=\" \")\r\nprint(ab_diff,end=\" \")\r\nprint(b_diff)", "temp = [int(x) for x in input().split()]\r\na = temp[0]\r\nb = temp[1]\r\nc = 0\r\nd = 0\r\ne = 0\r\nfor x in range(1, 7):\r\n if abs(a-x) < abs(b-x):\r\n c += 1\r\n elif abs(a-x) == abs(b-x):\r\n d += 1\r\n else:\r\n e += 1\r\nprint(c, d, e)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nins = lambda: input().rstrip()\r\nini = lambda: int(input().rstrip())\r\ninm = lambda: map(int, input().rstrip().split())\r\ninl = lambda: list(map(int, input().split()))\r\nout = lambda x, s='\\n': print(s.join(map(str, x)))\r\n\r\na, b = inm()\r\nans = [0, 0, 0]\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n ans[0] += 1\r\n elif abs(a - i) > abs(b - i):\r\n ans[2] += 1\r\n else:\r\n ans[1] += 1\r\nprint(*ans)", "inpt = input()\na, b = inpt.split()\n\na = int(a)\nb = int(b)\nacnt, bcnt, dcnt = 0, 0, 0\nfor i in range(1,7):\n if abs(a-i) < abs(b-i):\n acnt += 1\n elif abs(a-i) == abs(b-i):\n dcnt += 1\n else:\n bcnt += 1\n\nprint(acnt, dcnt, bcnt)\n \t\t\t \t\t \t \t\t\t \t \t \t \t \t \t\t \t", "def solve(test):\r\n a, b = map(int, input().split())\r\n cnt = [0 for i in range(3)]\r\n for i in range(1, 7):\r\n if abs(a - i) > abs(b - i):\r\n cnt[2] += 1\r\n elif abs(a - i) < abs(b - i):\r\n cnt[0] += 1\r\n else:\r\n cnt[1] += 1\r\n print(*cnt)\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve(_ + 1)", "a,b=map(int,input().split())\r\nc=0\r\nd=0\r\ne=0\r\nfor x in range(1,7):\r\n if(abs(a-x)<abs(b-x)):\r\n c=c+1\r\n elif(abs(a-x)==abs(b-x)):\r\n d=d+1\r\n else:\r\n e=e+1\r\nprint(c,d,e)", "a,b=map(int,input().split())\r\nx,y,z=0,0,0\r\nfor i in range(1,7):\r\n j=abs(i-a)\r\n k=abs(i-b)\r\n if(j<k):\r\n x=x+1\r\n elif(j==k):\r\n y=y+1\r\n else:\r\n z=z+1\r\nprint(x,y,z)\r\n", "a, b=map(int, input().split())\r\nx=0\r\ny=0\r\nz=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n x+=1\r\n elif abs(b-i)<abs(a-i):\r\n z+=1\r\n else:\r\n y+=1\r\nprint(x, y, z)", "x,y= [int(x) for x in input(\"\").split()]\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in range(1,7):\r\n a=abs(i-x)\r\n b=abs(i-y)\r\n if(a<b):\r\n c1=c1+1\r\n elif(a==b):\r\n c2=c2+1\r\n else:\r\n c3=c3+1\r\n \r\nprint(c1,c2,c3)\r\n \r\n \r\n ", "a,b=map(int,input().split())\r\nf1=int(0)\r\nf2=int(0)\r\nd=int(0)\r\nfor i in range(1,7):\r\n if(abs(i-a)==abs(i-b)):\r\n d=d+1\r\n elif(abs(i-a)<abs(i-b)):\r\n f1=f1+1\r\n else:\r\n f2=f2+1\r\nprint(f1,d,f2)", "a,b=input().split(\" \")\np=int(a)\nq=int(b)\nc,d,e=0,0,0\nfor i in range(1,7):\n if abs(p-i)>abs(q-i):\n c+=1\n elif abs(p-i)==abs(q-i):\n d+=1\n else:\n e+=1\nprint(e,d,c)\n \t\t \t \t\t\t\t\t\t\t\t\t \t \t \t \t\t \t", "a,b = list(map(int,input().split()))\r\ns = [0]*3\r\nfor i in range(1,7):\r\n if abs(i-a) > abs(i-b):\r\n s[0] += 1\r\n elif abs(i-a) == abs(i-b):\r\n s[1] += 1\r\n elif abs(i-a) < abs(i-b):\r\n s[2] += 1\r\nprint(s[2],s[1],s[0])", "a,b=map(int,input().split())\r\nw=0\r\nd=0\r\nl=0\r\nfor i in range(1,7):\r\n p1=abs(i-a)\r\n p2=abs(i-b)\r\n if p1>p2:\r\n l+=1\r\n elif p1<p2:\r\n w+=1\r\n else:\r\n d+=1\r\nprint(w,d,l)", "n,m=map(int,input().split())\nx=0\ny=0\nz=0\nfor i in range(1,7):\n s1=abs(n-i)\n s2=abs(m-i)\n if s2>s1:\n x+=1\n elif s1>s2:\n z+=1\n else:\n y+=1\nprint(x,y,z)\n\n\t \t \t \t \t \t\t \t\t\t\t\t \t\t \t\t", "ab = input().split()\r\na = int(ab[0])\r\nb = int(ab[1])\r\nsa = 0\r\ndraw = 0\r\nsb = 0\r\n\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n sa = sa + 1\r\n elif(abs(a-i)>abs(b-i)):\r\n sb = sb + 1\r\n else:\r\n draw = draw + 1\r\nprint(sa, draw, sb)", "a,b = list(map(int, input().split()))\r\nx,y,z = 0,0,0\r\n\r\nfor i in range(1, 7):\r\n d1 = abs(a-i)\r\n d2 = abs(b-i)\r\n \r\n if d1==d2:\r\n z+=1\r\n elif d1>d2:\r\n y+=1\r\n else:\r\n x+=1\r\n \r\nprint(x,z,y)", "def solve(a, b):\n f = 0\n s = 0\n d = 0\n for x in range(1, 7):\n if abs(x - a) < abs(x - b):\n f += 1\n elif abs(x - a) == abs(x - b):\n d += 1\n else:\n s += 1\n return f, d, s\n\n\n\ndef main():\n a, b = list(map(int, input().split()))\n print(*solve(a, b))\n\n\nmain()\n", "n,m=map(int,input().split())\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in range(1,7,1):\r\n\ta=abs(n-i)\r\n\tb=abs(m-i)\r\n\tif(a==b):\r\n\t\tc2+=1\r\n\telif(a<b):\r\n\t\tc1+=1\r\n\telse:\r\n\t\tc3+=1\r\nprint(c1,\" \",c2,\" \",c3,end='')", "a,b=map(int,input().split())\r\nc=[1,2,3,4,5,6]\r\nw1=0;d=0;w2=0\r\nfor i in range(len(c)) :\r\n if abs(a-c[i])<abs(b-c[i]) :\r\n w1+=1\r\n elif abs(a-c[i])>abs(b-c[i]) :\r\n w2+=1\r\n elif abs(a-c[i])==abs(b-c[i]) :\r\n d+=1\r\nprint(w1,d,w2)\r\n", "n,m=map(int,input().split())\r\nn1=0\r\nm1=0\r\nd=0\r\nfor i in range(1,7):\r\n if abs(i-n)<abs(i-m):\r\n n1+=1\r\n elif abs(i-n)>abs(i-m):\r\n m1+=1\r\n else:\r\n d+=1\r\nprint(n1,d,m1) ", "a, b = (int(s) for s in input().split())\nf, d, s = 0, 0, 0\nfor i in range(1, 7):\n if abs(a - i) < abs (b - i):\n f += 1\n elif abs(a - i) == abs(b - i):\n d += 1\n else:\n s += 1\nprint(f, d, s)\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\ncount_a=0;count_b=0;count_d=0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n count_a+=1\r\n elif abs(i-a)>abs(i-b):\r\n count_b+=1\r\n else:\r\n count_d+=1\r\nprint(count_a,count_d,count_b)", "inputArr = input().split(\" \")\r\nplayer1 = int(inputArr[0])\r\nplayer2 = int(inputArr[1])\r\nwin = 0\r\nlose = 0\r\ndraw = 0\r\n\r\nfor i in range(1,7):\r\n if abs(player1-i) < abs(player2-i):\r\n win += 1\r\n elif abs(player2-i) < abs(player1-i):\r\n lose += 1\r\n else:\r\n draw += 1\r\n\r\nprint(str(win) + \" \" + str(draw) + \" \" + str(lose))", "a,b=map(int,input().split())\r\ns=[int(abs(i-a)-abs(i-b)) for i in range(1,7)]\r\ns=[(i//abs(i)) if not i==0 else 0 for i in s]\r\nprint(s.count(-1),s.count(0),s.count(1))", "a,b=map(int,input().split())\r\nd,p1,p2=0,0,0\r\nfor x in range(1,7):\r\n if abs(a-x)<abs(b-x):\r\n p1+=1 \r\n elif abs(a-x)>abs(b-x):\r\n p2+=1 \r\n else:\r\n d+=1\r\nprint(p1,d,p2)", "a,b=map(int,input().split())\r\nfirst=0;draw=0;second=0\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n first+=1\r\n elif(abs(a-i)>abs(b-i)):\r\n second+=1\r\n else:\r\n draw+=1\r\nprint(first,draw,second)\r\n\r\n", "a,b = map(int,input().split())\r\ncnta = 0\r\ncntb = 0\r\ncntd=0\r\nfor i in range(1,7):\r\n if abs(i-a)>abs(i-b):\r\n cntb+=1\r\n elif abs(i-a)<abs(i-b):\r\n cnta+=1\r\n else:\r\n cntd+=1\r\nprint(cnta,cntd,cntb)", "awins=0\r\ndraw=0\r\nbwins=0\r\na,b=map(int,input().split())\r\nfor i in range(1,7):\r\n if(abs(i-a)==abs(i-b)):\r\n draw+=1\r\n elif(abs(i-a)>abs(i-b)):\r\n bwins+=1\r\n else:\r\n awins+=1\r\nprint(awins,draw,bwins)\r\n", "a,b = (int(s) for s in input().split())\ndef playdice(a, b):\n count_1, count_2, count_3 = 0,0,0 \n for x in range(1,7):\n if(abs(x-a) < abs(x-b)):\n count_1 +=1\n elif(abs(x-a) == abs(x-b)):\n count_2 +=1\n else:\n count_3 +=1\n print(count_1, count_2, count_3)\nplaydice(a,b)\n \t \t \t \t\t \t \t \t \t\t\t\t \t", "count=0\r\ncount1=0\r\ndraw=0\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n count+=1\r\n elif abs(a-i)<abs(b-i):\r\n count1+=1\r\n else:\r\n draw+=1\r\nprint(count1,draw,count)", "a,b=map(int,input().split())\r\nw1=0;\r\nw2=0;\r\ndr=0;\r\nfor i in range(1,7):\r\n if abs(i-a)>abs(i-b):\r\n w2=w2+1\r\n else:\r\n if abs(i-a)<abs(i-b):\r\n w1=w1+1\r\n else:\r\n dr=dr+1;\r\nprint(w1,dr,w2)\r\n", "a, b = [int(i) for i in input().split()]\n\nfirst_win = 0\nsecond_win = 0\ndraw = 0\n\nfor i in range(1, 6 + 1):\n if abs(a - i) < abs(b - i):\n first_win += 1\n elif abs(a - i) > abs(b - i):\n second_win += 1\n else:\n draw += 1\n\nprint(first_win, draw, second_win) \n\t\t\t\t \t \t\t \t\t \t \t \t \t\t \t", "my_list=input().split()\r\na=int(my_list[0])\r\nb=int(my_list[1])\r\na_counter=0\r\nb_counter=0\r\nm_counter=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n a_counter+=1\r\n elif abs(b-i)<abs(a-i):\r\n b_counter+=1\r\n else:\r\n m_counter+=1\r\nprint(a_counter,end=' ')\r\nprint(m_counter,end=' ')\r\nprint(b_counter)\r\n", "a, b = input().split()\na = int(a)\nb = int(b)\nif a == b:\n print(0, 6, 0)\nelse:\n flag = (a > b)\n mid = (a + b) / 2\n if (a + b) % 2 == 0:\n r2 = 1\n else:\n r2 = 0\n r1 = int(mid - 1) + ((a + b) % 2 != 0)\n r3 = 6 - int(mid + 1) + 1\n if flag:\n r1, r3 = r3, r1\n print(r1, r2, r3)\n\t \t \t\t\t \t\t \t \t\t \t \t", "a,b=list(map(int,input().split()))\r\nflag=False\r\nif a>b:\r\n a,b=b,a\r\n flag=True\r\nif a==b:\r\n print(0,6,0)\r\nelse:\r\n \r\n a_count=a\r\n b_count=6-b+1\r\n c_count=0\r\n for i in range(a+1,b):\r\n if abs(a-i)<abs(b-i):\r\n a_count+=1\r\n elif abs(a-i)==abs(b-i):\r\n c_count=1 \r\n else:\r\n b_count+=1 \r\n if flag:\r\n print(b_count,c_count,a_count)\r\n else:\r\n print(a_count,c_count,b_count)\r\n\r\n ", "l1=[int(i) for i in input().split()]\r\na=l1[0]\r\nb=l1[-1]\r\nca=cd=cb=0\r\nfor j in range(1,7):\r\n if a>j:\r\n da=a-j\r\n else :\r\n da=j-a\r\n if b>j:\r\n db=b-j\r\n else :\r\n db=j-b\r\n if da>db:\r\n cb+=1\r\n elif db>da:\r\n ca+=1\r\n else :\r\n cd+=1\r\nprint(ca,cd,cb)", "n=list(map(int,input().split()))\r\na=int(n[0])\r\nb=int(n[1])\r\nc=0\r\nd=0\r\ne=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n c=c+1\r\n if abs(a-i)==abs(b-i):\r\n d=d+1\r\n if abs(a-i)>abs(b-i):\r\n e=e+1\r\nprint(c,d,e,end=\" \")\r\n \r\n", "ab = list(map(int, input().split()))\r\nadb = [0] * 3\r\nfor i in range(1, 7):\r\n\tif abs(ab[0] - i) < abs(ab[1] - i):\r\n\t\tadb[0] += 1\r\n\telif abs(ab[0] - i) > abs(ab[1] - i):\r\n\t\tadb[2] += 1\r\n\telse:\r\n\t\tadb[1] += 1\r\nprint(*adb)", "a, b = map(int, input().split())\r\nw, d , l = 0, 0 , 0\r\nfor x in range (1, 7, 1):\r\n if(abs(a-x) < abs(b-x)):\r\n w+=1\r\n\r\n elif(abs(a-x) > abs(b-x)):\r\n l+=1\r\n\r\n else:\r\n d+=1\r\n \r\nprint(w, d , l, sep = ' ')", "# PLaying with Dice\ndef dice(a, b):\n a_win = 0\n draw = 0\n b_win = 0\n for i in range(1, 7):\n a_val = abs(a - i)\n b_val = abs(b - i)\n if a_val == b_val:\n draw += 1\n elif a_val > b_val:\n b_win += 1\n else:\n a_win += 1\n print(a_win, draw, b_win)\n\n\na, b = list(map(int, input().rstrip().split()))\ndice(a, b)", "a, b = map(int, input().split())\r\ncntf, cntd, cnts = 0, 0, 0\r\nfor i in range(1, 7, 1):\r\n cntf += abs(a-i) < abs(b-i)\r\n cntd += abs(a-i) == abs(b-i)\r\n cnts += abs(a-i) > abs(b-i)\r\nprint(f'{cntf} {cntd} {cnts}')", "[a,b]=[int(x) for x in input().split()]\r\ncounta=0\r\ncountd=0\r\ncountb=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n counta+=1\r\n elif abs(a-i)>abs(b-i):\r\n countb+=1\r\n else:\r\n countd+=1\r\nprint(counta,countd,countb)", "a, b = map(int, input().split())\r\n\r\nl, d, w = 3 * [0]\r\n\r\nfor i in range(1, 7):\r\n diff = abs(a - i) - abs(b - i)\r\n\r\n w += diff > 0\r\n d += diff == 0\r\n l += diff < 0\r\n\r\nprint(l, d, w)\r\n", "x = input().split()\r\na = int(x[0])\r\nb = int(x[1])\r\n\r\ncount_a = 0\r\ncount_b = 0\r\ncount_draw = 0\r\nfor i in range(1,7):\r\n if abs(i-a) > abs(i-b):\r\n count_b += 1\r\n elif abs(i-b) > abs(i-a):\r\n count_a += 1\r\n else:\r\n count_draw += 1\r\n \r\nprint(count_a,count_draw,count_b)", "a, b = map(int, input().split())\ncounter_a = 0\ncounter_b = 0\ncounter_draw = 0\nfor i in range(1, 7):\n if abs(a - i) < abs(b - i):\n counter_a += 1\n elif abs(b - i) < abs(a - i):\n counter_b += 1\n else:\n counter_draw += 1\n\nprint(counter_a, counter_draw, counter_b)\n\n\n\n\n\t\t \t\t \t\t\t\t\t \t\t \t", "a, b = map(int, input().split())\r\nn_a = n_draw = n_b = 0\r\n\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n n_a += 1\r\n elif abs(b - i) < abs(a - i):\r\n n_b += 1\r\n else:\r\n n_draw += 1\r\n\r\nprint(n_a, n_draw, n_b)\r\n", "import sys\r\n\r\n_lines = sys.stdin.readlines()\r\ninput = iter(_lines).__next__\r\n\r\ndef main() :\r\n a, b = map(int,input().split())\r\n f,d,s = 0,0,0\r\n for i in range(1,7) :\r\n if abs(a-i) < abs(b-i) : f += 1\r\n elif abs(a-i) == abs(b-i) : d += 1\r\n else : s += 1\r\n print(f,d,s)\r\n \r\nif __name__ == \"__main__\" :\r\n main()\r\n", "a,b=map(int,input().split())\r\nd=[1,2,3,4,5,6]\r\nca=0\r\ncb=0\r\ncd=0\r\nfor i in d:\r\n if abs(a-i)<abs(b-i):\r\n ca=ca+1\r\n elif abs(a-i)>abs(b-i):\r\n cb=cb+1\r\n elif abs(a-i)==abs(b-i):\r\n cd=cd+1\r\n\r\nprint(ca,cd,cb)\r\n", "i = input()\nlst = i.split(' ')\nfirst = lst[0]\nsecond = lst[1]\n\nres1, res2, res3 = 0, 0, 0\n\nfor i in range(1,7):\n if abs(i-int(first)) < abs(i-int(second)):\n res1 +=1\n elif abs(i-int(first)) == abs(i-int(second)):\n res2 +=1\n else:\n res3 += 1\nprint(res1, res2, res3)\n\t \t\t \t\t \t \t \t\t\t \t\t\t \t \t\t\t", "a, b = map(int, input().split())\r\n\r\nplayer1Wins = 0\r\ndraw = 0\r\nplayer2Wins = 0\r\n\r\nfor i in range(1, 6 + 1):\r\n \r\n if (abs(i - a) < abs(i - b)):\r\n player1Wins += 1\r\n elif (abs(i - a) > abs(i - b)):\r\n player2Wins += 1\r\n else:\r\n draw += 1\r\n \r\nprint(player1Wins, draw, player2Wins)", "a,b=[int(w) for w in input().split()]\r\nx=0\r\ny=0\r\nz=0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n x+=1\r\n elif abs(a-i)<abs(b-i):\r\n y+=1\r\n else:\r\n z+=1\r\nprint(y,z,x)", "a,b=map(int,input().split())\r\nx=[]\r\nfwcnt=0\r\ndraw=0\r\nswcnt=0\r\nfor i in range(1,7):\r\n if (abs(a-i)<abs(b-i)):\r\n fwcnt+=1\r\nx.append(fwcnt)\r\nfor j in range(1,7):\r\n if (abs(a-j)>abs(b-j)):\r\n swcnt+=1\r\nx.append(swcnt)\r\nx.append(6-(fwcnt+swcnt))\r\nprint(x[0],x[2],x[1])\r\n", "a,b = [int(item) for item in input().split()]\r\ncounta= 0\r\ncountb = 0\r\ncountc=0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n counta+=1\r\n elif abs(i-a)>abs(i-b):\r\n countb+=1 \r\n elif abs(i-a)==abs(i-b):\r\n countc+=1 \r\nprint(counta,end = ' ')\r\nprint(countc,end = ' ')\r\nprint(countb,end = ' ')", "x,y=map(int,input().split())\n\na=0\nb=0\nc=0\n\nfor i in [1,2,3,4,5,6]:\n if abs(x-i)==abs(y-i):\n b+=1\n elif abs(x-i)<abs(y-i):\n a+=1\n elif abs(x-i)>abs(y-i):\n c+=1\n\nprint(a,b,c,sep=\" \")\n \t\t\t \t\t\t \t \t\t \t \t \t \t", "a,b=[int(x) for x in input().split()]\r\nsum1=0\r\nsum2=0\r\nsum3=0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n sum1=sum1+1\r\n elif abs(i-a)>abs(i-b):\r\n sum2=sum2+1 \r\n elif abs(i-a)==abs(i-b):\r\n sum3=sum3+1\r\nprint(sum1,sum3,sum2)\r\n", "a, b = map(int,input().split())\r\na_wins, draw, b_wins = 0, 0, 0\r\nfor index in range(1, 7):\r\n if abs(a - index) < abs(b - index):\r\n a_wins += 1\r\n elif abs(a - index) > abs(b - index):\r\n b_wins += 1\r\n else:\r\n draw += 1\r\nprint(a_wins, draw, b_wins)", "a,b=map(int, input().split())\r\nf=0\r\nd=0\r\ns=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n f+=1\r\n elif (abs(a-i)>abs(b-i)):\r\n s+=1\r\n else:\r\n d+=1\r\nprint(f,d,s)", "inp=input().split()\r\n\r\na=int(inp[0])\r\nb=int(inp[1])\r\n\r\naa=0\r\nbb=0\r\nd=0\r\nfor i in range(6):\r\n x=abs(a-(i+1))\r\n y=abs(b-(i+1))\r\n\r\n if x==y:\r\n d=d+1\r\n elif x<y:\r\n aa=aa+1\r\n else:\r\n bb=bb+1\r\n\r\n #print(aa,d,bb)\r\n\r\nprint(aa,d,bb)", "a,b=map(int,input().split())\r\naw=bw=dw=0\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n aw+=1\r\n elif(abs(a-i)>abs(b-i)):\r\n bw+=1\r\n else:\r\n dw+=1\r\nprint(\"{} {} {}\".format(aw,dw,bw))", "string_input = input()\na = int(string_input.split(' ')[0])\nb = int(string_input.split(' ')[1])\n\nl = [0,0,0]\nfor i in range(1,7):\n if abs(i-a)>abs(i-b):\n l[2]+=1\n elif abs(i-a)<abs(i-b): \n l[0]+=1\n else:\n l[1]+=1\nprint(\" \".join([ str(k) for k in l]))\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().strip().split())\r\nawin,draw,bwin=0,0,0\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n awin+=1\r\n elif(abs(a-i)==abs(b-i)):\r\n draw+=1\r\n else:\r\n bwin+=1\r\nprint(awin,draw,bwin)\r\n", "a,b = map(int,input().split())\r\ncount_a = 0\r\ncount_b = 0\r\ncount_draw = 0\r\nfor x in range(1,7):\r\n if abs(a-x)<abs(b-x):\r\n count_a+=1\r\n elif abs(b-x)<abs(a-x):\r\n count_b+=1\r\n else:\r\n count_draw+=1\r\nprint(count_a,count_draw,count_b)", "n,k=map(int,input().split())\r\n\r\na=0\r\nd=0\r\nb=0\r\nfor i in range(1,7):\r\n if abs(n-i) == abs(k-i):\r\n d=d+1\r\n elif abs(n-i)<abs(k-i):\r\n a=a+1\r\n else:\r\n b=b+1\r\n\r\nprint(a,d,b)", "x, y = map(int, input().split())\r\n\r\nans = [0, 0, 0]\r\n\r\nfor i in range(1, 7):\r\n dx = abs(x-i)\r\n dy = abs(y-i)\r\n\r\n if dx < dy:\r\n ans[0] += 1\r\n elif dx == dy:\r\n ans[1] += 1\r\n elif dx > dy:\r\n ans[2] += 1\r\n\r\nprint(*ans)\r\n", "#!python3\n\nfrom collections import deque, Counter\nimport array\nfrom itertools import combinations, permutations\nfrom math import sqrt\nimport unittest\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_int_array():\n return [int(i) for i in input().strip().split(' ')]\n\n######################################################\n\na, b = read_int_array()\naw = 0\nd = 0\nbw = 0\nfor i in range(1, 7):\n c = abs(i - a) - abs(i - b)\n if c < 0:\n aw += 1\n elif c > 0:\n bw += 1\n else:\n d += 1\n\nprint(aw, d, bw)\n\n", "import math\r\na,b = map(int,input().split())\r\na_win = 0\r\nb_win = 0\r\ndraw = 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n a_win +=1\r\n elif abs(b-i) < abs(a-i):\r\n b_win += 1\r\n else:\r\n draw += 1\r\nprint (a_win,draw,b_win)\r\n", "a, b = map(int, input().split())\r\nx1 = 0\r\nx2 = 0\r\nx0 =0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n x1 += 1\r\n elif abs(a-i)>abs(b-i):\r\n x2 += 1\r\n else:\r\n x0 += 1\r\nprint(x1,x0,x2)", "nums = [int(i) for i in input().split(\" \")]\np1w = 0\np2w = 0\ndraw = 0\nfor i in range(1, 7, 1):\n if abs(i-nums[0]) < abs(i-nums[1]):\n p1w += 1\n elif abs(i-nums[0]) > abs(i-nums[1]):\n p2w += 1\n else:\n draw += 1\nprint(str(p1w) + \" \" + str(draw) + \" \" + str(p2w))\n\t \t \t \t\t \t\t \t \t \t \t\t \t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\na, b = map(int, input().split())\r\n\r\nf = 0\r\ns = 0\r\nt = 0\r\nfor i in range(1, 7):\r\n x = abs(a - i)\r\n y = abs(b - i)\r\n if x < y:\r\n f += 1\r\n elif x == y:\r\n s += 1\r\n else:\r\n t += 1\r\n\r\nprint(f, s, t)", "a, b = map(int, input().split())\r\n\r\nfirst, tie, second = 0, 0, 0\r\n\r\nfor throw in range(1, 7):\r\n adiff = abs(a - throw)\r\n bdiff = abs(b - throw)\r\n if adiff < bdiff:\r\n first += 1\r\n elif adiff > bdiff:\r\n second += 1\r\n else:\r\n tie += 1\r\n \r\nprint(first, tie, second)", "a,b = map(int,input().split())\nc_a = 0\nc_b = 0\nd = 0\nfor x in range(1,7):\n if(abs(a-x)<abs(b-x)):\n c_a = c_a + 1\n elif(abs(a-x) == abs(b-x)):\n d = d + 1\n else:\n c_b = c_b + 1\nprint(c_a,d,c_b)\n\t \t \t\t\t \t\t \t \t\t \t \t\t\t \t \t\t", "input = input()\na = int(input.split()[0])\nb = int(input.split()[1])\n\ndraw=0\nwinA=0\nwinB=0\n\nfor num in range(1,7):\n diff_a = abs(a-num)\n diff_b = abs(b-num)\n if diff_a == diff_b:\n draw = draw+1\n elif diff_a > diff_b:\n winB=winB+1\n else:\n winA=winA+1\n\nprint(winA,draw,winB)\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\nscr_a,scr_b,scr_t=0,0,0\r\n\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n scr_a+=1\r\n elif abs(i-a)==abs(i-b):\r\n scr_t+=1\r\n else:\r\n scr_b+=1\r\n \r\nprint(scr_a,scr_t,scr_b)\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,m=map(int,input().split())\r\na,d,b=0,0,0\r\nfor i in range(1,7):\r\n p=abs(n-i)-abs(m-i)\r\n a+=p<0\r\n d+=p==0\r\n b+=p>0\r\nprint(a,d,b)", "a,b = [int(i) for i in input().split()]\r\na_p = 0\r\nb_p = 0 \r\nd = 0\r\nfor x in range(1,7): \r\n\tif abs(a-x) < abs(b-x) :\r\n\t\ta_p += 1\r\n\telif abs(a-x) > abs(b-x) :\r\n\t\tb_p += 1\r\n\telse : \r\n\t\td += 1\r\nprint(a_p,d,b_p)", "a, b = map(int, input().split())\nw1 = 0\nw2 = 0\nfor c in range(1, 7):\n if abs(c - a) < abs(c - b):\n w1 += 1\n elif abs(c - a) > abs(c - b):\n w2 += 1\nprint(w1, 6 - w1 - w2, w2)\n", "a,b=map(int,input().split())\naw=0\ndr=0\nbw=0\nfor x in range(1,7):\n if abs(a-x)<abs(b-x):\n aw+=1\n elif abs(a-x)>abs(b-x):\n bw+=1\n else:\n dr+=1\n\nprint(aw,dr,bw)\n", "# https://codeforces.com/problemset/problem/378/A\r\nimport math\r\ninp_ = input()\r\na, b = map(int, inp_.split(\" \"))\r\nList = [1, 2, 3, 4, 5, 6]\r\n#\r\na_wins = 0\r\nb_wins = 0\r\ndraw = 0\r\n\r\nfor i in List:\r\n a_chance = math.fabs(i - a)\r\n b_chance = math.fabs(i - b)\r\n if a_chance < b_chance:\r\n a_wins += 1\r\n elif a_chance > b_chance:\r\n b_wins += 1\r\n elif a_chance == b_chance :\r\n draw += 1\r\n\r\nprint(a_wins, draw, b_wins)\r\n\r\n", "a, b = map(int, input().split())\r\narr = [0, 0, 0]\r\nfor i in range(1,7):\r\n t = max(i-a, a-i)-max(i-b, b-i)\r\n if t>0:\r\n arr[2] += 1\r\n elif t == 0:\r\n arr[1] += 1\r\n else:\r\n arr[0] += 1\r\nfor j in arr:\r\n print(str(j), end = ' ')", "a,b=map(int,input().split())\r\nx=y=z=0\r\nfor i in range(1,7):\r\n p=abs(a-i)-abs(b-i)\r\n x+=p<0\r\n y+=p==0\r\n z+=p>0\r\nprint(x,y,z)", "a,b=map(int,input().split())\r\nf_win=0\r\ndraw=0\r\nl_win=0\r\nfor i in range(1,7):\r\n x=abs(a-i)\r\n y=abs(b-i)\r\n if x>y:\r\n l_win=l_win+1 \r\n elif y>x:\r\n f_win=f_win+1 \r\n else:\r\n draw=draw+1 \r\nprint(f_win,draw,l_win)\r\n ", "a,b=map(int,input().split())\r\nx,y,z=0,0,0\r\nif abs(1-a)<abs(1-b):\r\n x=x+1\r\nelif abs(1-a)>abs(1-b):\r\n y=y+1\r\nelse:\r\n z=z+1\r\nif abs(2-a)<abs(2-b):\r\n x=x+1\r\nelif abs(2-a)>abs(2-b):\r\n y=y+1\r\nelse:\r\n z=z+1\r\nif abs(3-a)<abs(3-b):\r\n x=x+1\r\nelif abs(3-a)>abs(3-b):\r\n y=y+1\r\nelse:\r\n z=z+1\r\nif abs(4-a)<abs(4-b):\r\n x=x+1\r\nelif abs(4-a)>abs(4-b):\r\n y=y+1\r\nelse:\r\n z=z+1\r\nif abs(5-a)<abs(5-b):\r\n x=x+1\r\nelif abs(5-a)>abs(5-b):\r\n y=y+1\r\nelse:\r\n z=z+1\r\nif abs(6-a)<abs(6-b):\r\n x=x+1\r\nelif abs(6-a)>abs(6-b):\r\n y=y+1\r\nelse:\r\n z=z+1\r\nprint(x,z,y)", "a, b = map(int, input().split(' '))\r\nonew = 0\r\ndraw = 0\r\ntwow = 0\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n onew += 1\r\n elif abs(a - i) == abs(b - i):\r\n draw += 1\r\n elif abs(a - i) > abs(b - i):\r\n twow += 1\r\nprint(onew, draw, twow)", "x = input()\na = int(x.split()[0])\nb = int(x.split()[1])\n\na_win, b_win, draw = 0, 0, 0\nfor i in range(1, 7):\n if abs(a-i) < abs(b-i):\n a_win += 1\n elif abs(a-i) == abs(b-i):\n draw += 1\n else:\n b_win += 1\n\n\nprint(a_win, draw, b_win)\n\n\t \t\t \t\t\t \t\t\t \t \t \t \t\t\t \t\t\t\t", "a,b = list(map(int,input().split()))\r\nw1 = 0\r\nw2 = 0\r\nd = 0\r\n\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n w1+=1\r\n elif abs(a-i) > abs(b-i):\r\n w2+=1\r\n else:\r\n d+=1\r\nprint(w1,d,w2)\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "x=input()\r\na=int(x.split()[0])\r\nb=int(x.split()[1])\r\nA=0\r\nB=0\r\nD=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i): A+=1\r\n elif abs(a-i)>abs(b-i): B+=1\r\n else: D+=1\r\nprint(A,D,B)\r\n", "import math\r\nnum=list(map(int,input().split()))\r\na,b=num[0],num[1]\r\nx=[1,2,3,4,5,6]\r\na_win=0\r\nb_win=0\r\ndraw=0\r\nfor i in x:\r\n if math.fabs(a-i)>math.fabs(b-i):\r\n b_win+=1\r\n elif math.fabs(a-i)<math.fabs(b-i):\r\n a_win+=1\r\n else:\r\n draw+=1\r\nprint(a_win,draw,b_win)", "a,b=map(int, input().split())\r\nif a==b:\r\n print(0,6,0)\r\nelse:\r\n if a<b:\r\n if (b-a)%2==0:\r\n m=(b+a)//2\r\n y=1\r\n x=m-1\r\n z=6-m\r\n print(x,y,z)\r\n else:\r\n x=(b-a)//2\r\n print(a+x,0,6-b+x+1)\r\n else:\r\n if (a-b)%2==0:\r\n m=(b+a)//2\r\n y=1\r\n x=m-1\r\n z=6-m\r\n print(z,y,x)\r\n else:\r\n x=(a-b)//2\r\n print(6-a+x+1,0,b+x)\r\n", "count1 = 0\ncount2 = 0\ncount3 = 0\nstr2 = \"\"\nstr1 = input()\nfor i in range(len(str1)):\n a = int(str1[0])\n b = int(str1[2])\n \nif(a>=1 and b<=6):\n for i in range(1,7):\n x = a-i\n y = b-i\n if(x<0):\n x = x *(-1)\n if(y<0):\n y = y *(-1)\n if (x<y):\n count1 = count1 + 1\n elif (y<x):\n count2 = count2 + 1\n elif (x==y):\n count3 = count3 + 1\nstr2 = str(count1) + \" \" + str(count3) + \" \" + str(count2)\nprint(str2)\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())\ns = [0, 0, 0]\nfor i in range(1, 7):\n if abs(a - i) == abs(b - i):\n s[1] += 1\n elif abs(a - i) < abs(b - i):\n s[0] += 1\n else:\n s[2] += 1\nprint(*s)\n", "a,b = map(int, input().split())\r\nx=0\r\ny=0\r\nz=0\r\nfor i in range(1,7):\r\n if(abs(i-a)<abs(i-b)):\r\n x+=1\r\n elif(abs(i-a)>abs(i-b)):\r\n z+=1\r\n else:\r\n y+=1\r\nprint(x,y,z)", "a, b = (int(s) for s in input().split())\nres0, res1, res2 = 0, 0, 0\nfor i in range(1,7):\n if abs(i-a)<abs(i-b):\n res0 += 1\n elif abs(i-a)==abs(i-b):\n res1 += 1\n else:\n res2 += 1\nprint(res0, res1, res2)\n\t\t \t \t \t \t \t\t\t \t\t \t\t", "a,b=map(int,input().split())\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n c1+=1 \r\n elif abs(b-i)<abs(a-i):\r\n c3+=1\r\n else:\r\n c2+=1\r\nprint(c1,c2,c3)", "n,m=map(int,input().split())\r\na=0\r\nb=0\r\nc=0\r\nif n==m:\r\n print(0,6,0)\r\nelse:\r\n \r\n for i in range(1,7):\r\n if abs(n-i)==abs(m-i):\r\n c=1\r\n else:\r\n \r\n if abs(n-i)>abs(m-i):\r\n a=a+1\r\n else:\r\n b+=1\r\n print(b,c,a)", "a, b = map(int, input().split())\r\none, two, three = 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n one += 1\r\n elif (abs(a-i) > abs(b-i)):\r\n three += 1\r\n else:\r\n two += 1\r\nprint(one, two, three)", "p1, p2 = map(int, input().split())\r\nwp1, wp2, d = 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(i-p1) > abs(i-p2):\r\n wp2 += 1\r\n elif abs(i-p1) < abs(i-p2):\r\n wp1 += 1\r\n else:\r\n d += 1\r\nprint(wp1, d, wp2)\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___ \r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\r\n'''\r\n", "dice = [1,2,3,4,5,6]\r\na,b = map(int,input().split())\r\ncnta,cntd,cntb = 0,0,0\r\nfor i in dice:\r\n if abs(a-i)<abs(b-i):\r\n cnta+=1\r\n elif abs(a-i)==abs(b-i):\r\n cntd+=1\r\n elif abs(a-i)>abs(b-i):\r\n cntb+=1\r\nprint(cnta,cntd,cntb)\r\n \r\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\na,b = li()\r\nx=y=z=0\r\nfor i in range(1,7):\r\n if abs(i-a) > abs(i-b):\r\n z += 1\r\n elif abs(i-a) < abs(i-b):\r\n x += 1\r\n else:\r\n y += 1\r\nprint(x,y,z)", "a,b=list(map(int,input().split()))\r\naw,d,bw=0,0,0\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n aw=aw+1\r\n elif(abs(a-i)==abs(b-i)):\r\n d=d+1\r\n else:\r\n bw=bw+1\r\nprint(aw,d,bw)\r\n ", "a,b=map(int,input().split(\" \"))\r\nfirst=0\r\nsecond=0\r\ndraw=0\r\nfor i in range (1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n first+=1\r\n elif(abs(b-i)<abs(a-i)):\r\n second+=1\r\n else:\r\n draw+=1\r\nprint(first,draw,second)", "m, n = (int(i) for i in input().split())\nc, d, e = 0, 0, 0\n\nfor i in range(1,7):\n if abs(m-i) < abs(n-i):\n c += 1\n elif abs(m-i) > abs(n-i):\n e += 1\n else:\n d += 1\n\nprint(c, d, e)\n", "def calculate_outcomes(a, b):\r\n first_player_wins = 0\r\n draws = 0\r\n second_player_wins = 0\r\n \r\n for dice_roll in range(1, 7):\r\n diff_a = abs(a - dice_roll)\r\n diff_b = abs(b - dice_roll)\r\n \r\n if diff_a < diff_b:\r\n first_player_wins += 1\r\n elif diff_a == diff_b:\r\n draws += 1\r\n else:\r\n second_player_wins += 1\r\n \r\n return first_player_wins, draws, second_player_wins\r\n\r\na, b = map(int, input().split())\r\n\r\nfirst_player_wins, draws, second_player_wins = calculate_outcomes(a, b)\r\n\r\nprint(first_player_wins, draws, second_player_wins)\r\n", "n,m = map(int , input().split())\n\n\nc1,c2,c3 = 0,0,0\nfor i in range(1,7):\n if abs(n - i) < abs(m - i):\n c1 += 1\n if abs(n - i) > abs(m - i):\n c3 += 1\n if abs(n - i) == abs(m - i):\n c2 += 1\n\nprint(c1,c2,c3)\n\n\n \n\n\t \t\t \t \t \t \t\t\t\t \t\t", "a, b = map(int, input().split())\r\nf=s=t=0\r\nfor i in range(1,7):\r\n if abs(i-a) == abs(i-b):\r\n s+=1\r\n elif abs(i-a)>abs(i-b):\r\n f+=1\r\n else:\r\n t+=1\r\nprint(str(t) +' ' + str(s) + ' '+ str(f)) ", "a,b = map(int,input().split())\r\nf,d,s = 0,0,0\r\nfor i in range(1,7):\r\n if abs(a - i) == abs(b - i):d+=1\r\n elif abs(a - i) < abs(b - i):f+=1\r\n else:s+=1\r\nprint(f,d,s)", "a,b = map(int,input().split())\r\np1 = 0\r\np2 = 0\r\nd = 0\r\nfor i in range(1,7):\r\n x = min(abs(i-a),abs(i-b))\r\n if abs(i-a) - abs(i-b) == 0:\r\n d+=1\r\n elif x == abs(i-a):\r\n p1+=1\r\n else:\r\n p2+=1\r\nprint(f\"{p1} {d} {p2}\")", "a, b = map(int, input().split())\r\n\r\nfirst_wins = second_wins = draws = 0\r\n\r\nfor x in range(1, 7):\r\n if abs(x - a) < abs(x - b):\r\n first_wins += 1\r\n elif abs(x - a) > abs(x - b):\r\n second_wins += 1\r\n else:\r\n draws += 1\r\n\r\nprint(first_wins, draws, second_wins)\r\n", "z=list(map(int,input().split()))\r\na=0\r\nb=0\r\ndr=0\r\nd=[1,2,3,4,5,6]\r\nfor i in d:\r\n if abs(z[0]-i)<abs(z[1]-i):\r\n a+=1\r\n elif abs(z[0]-i)==abs(z[1]-i):\r\n dr+=1\r\n else:\r\n b+=1\r\nprint(a,dr,b)", "a,b = map(int,input().split(' '))\r\nless_than , equal , greater_than = 0,0,0\r\nfor i in range(1,7):\r\n if(abs(a-i) < abs(b-i)): # abs function to get the #absolute value \"always positive\"\r\n less_than += 1 \r\n elif(abs(a-i) > abs(b-i)):\r\n greater_than += 1 \r\n else:\r\n equal+=1\r\nprint(less_than,equal,greater_than)", "#playingwithdice\na, b = [int(x) for x in input().split()]\nk = [0, 0, 0]\nfor i in range(1, 7):\n if abs(a-i) == abs(b-i):\n k[1] += 1\n elif abs(a-i) > abs(b-i):\n k[2] += 1\n else:\n k[0] += 1\nprint(*k)", "a,b = map(int, input().split())\r\nwin = 0\r\ndraw = 0\r\nlose = 0\r\nfor i in range(1,7):\r\n x = abs(a-i)\r\n y = abs(b-i)\r\n\r\n if x < y:\r\n win +=1\r\n elif x == y:\r\n draw+=1\r\n else:\r\n lose+=1\r\n\r\n\r\nprint(win, draw, lose)", "a,b = map(int,input().split())\r\nf,d,l = 0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n f+=1\r\n elif abs(b-i)<abs(a-i):\r\n l+=1\r\n else:\r\n d+=1\r\nprint(f,d,l)", "a, b = input().split()\na = int(a)\nb = int(b)\nA = 0\nB = 0\nD = 0\nfor i in range(1,7):\n if abs(a-i) == abs(b-i):\n D = D + 1\n continue\n elif abs(a-i) < abs(b-i):\n A = A + 1\n continue\n else:\n B = B + 1\n continue\nprint(A,\"\",D,\"\",B)\n \t \t \t \t \t\t\t\t\t \t\t\t \t\t \t\t\t\t", "a , b = list(map(int,input().split()))\r\ncounta = 0\r\ncountx = 0\r\ncountb = 0\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tcounta += 1\r\n\telif abs(a-i)>abs(b-i):\r\n\t\tcountb += 1\r\n\telif abs(a-i)==abs(b-i):\r\n\t\tcountx += 1\r\nprint(counta,countx,countb)\t\t\t\t\r\n", "import sys, collections, math, itertools, random\r\nINF = sys.maxsize\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nmod = 1000000007\r\n\r\na,b = get_ints()\r\ns,m,e = 0,0,0\r\nfor x in range(1, 7):\r\n if abs(a-x) < abs(b-x):\r\n s += 1\r\n elif abs(a-x) > abs(b-x):\r\n e += 1\r\nprint(s,6-(s+e),e)", "vals = [int(n) for n in input().split()]\r\na = vals[0]\r\nb = vals[1]\r\naCounter = 0\r\ndraws = 0\r\nbCounter = 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n aCounter += 1\r\n elif abs(a-i) > abs(b-i):\r\n bCounter +=1\r\n else:\r\n draws += 1\r\nprint(\"%d %d %d\" % (aCounter, draws, bCounter))", "a,b=map(int,input().split())\r\nf=0\r\nd=0\r\ns=0\r\nfor i in range(1,7):\r\n if(abs(i-a)<abs(i-b)):\r\n f=f+1\r\n elif(abs(i-a)==abs(i-b)):\r\n d=d+1\r\n else:\r\n s=s+1\r\nprint(f,end=\" \")\r\nprint(d,end=\" \")\r\nprint(s,end=\" \")\r\n", "a , b = map(int,input().split())\r\n\r\nx = y = z = 0\r\n\r\nfor i in range(1,7):\r\n if abs(a - i ) > abs(b - i ):\r\n z +=1\r\n elif abs(a - i ) == abs(b - i ):\r\n y +=1\r\n else:\r\n x +=1\r\n\r\nprint(x ,y , z)\r\n\r\n", "ins = input()\nuser1, user2 = (int(i) for i in ins.split())\nwins, draws, loss = 0, 0, 0\nfor i in range(1, 7):\n if abs(user1-i) < abs(user2-i):\n wins += 1\n elif abs(user1-i) > abs(user2-i):\n loss += 1\n else:\n draws += 1\nprint(wins, draws, loss)\n\t\t\t \t\t\t\t \t\t \t \t \t \t \t", "a,b=map(int, input().split())\r\nawin=0 \r\ndraw=0 \r\nbwin=0 \r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n bwin+=1 \r\n elif abs(a-i)<abs(b-i):\r\n awin+=1 \r\n else:\r\n draw+=1 \r\n\r\nprint(awin, draw,bwin)\r\n", "\r\n\r\ndef main():\r\n a, b = map(int, input().split())\r\n\r\n first = second = third = 0\r\n\r\n for i in range(1, 7):\r\n if abs(i - a) < abs(i - b):\r\n first += 1\r\n\r\n if abs(i - a) == abs(i - b):\r\n second += 1\r\n\r\n if abs(i - a) > abs(i - b):\r\n third += 1\r\n\r\n print(first, second, third)\r\n\r\nmain()", "a, b = map(int, input().split())\r\na1 = 0\r\nd = 0\r\na2 = 0\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n a1 += 1\r\n elif abs(a-i) == abs(b-i):\r\n d += 1\r\n elif abs(a-i) > abs(b-i):\r\n a2 += 1\r\nprint(a1, d, a2)", "s=input()\n\na=int(s.split(' ')[0])\nb=int(s.split(' ')[1])\n\naw=0\nd=0\nbw=0\n\nfor i in range(1,7):\n if(abs(a-i)<abs(b-i)):\n aw+=1\n elif(abs(a-i)>abs(b-i)):\n bw+=1\n elif(abs(a-i)==abs(b-i)):\n d+=1\n \nprint(aw,d,bw)\n \t\t \t\t\t\t\t \t \t \t \t \t", "a, b = map(int, input().split())\r\na_wins, b_wins, draws = 0, 0, 0\r\nfor throw in range(1, 7):\r\n a_diff, b_diff = abs(a - throw), abs(b - throw)\r\n if a_diff < b_diff:\r\n a_wins += 1\r\n elif b_diff < a_diff:\r\n b_wins += 1\r\n else:\r\n draws += 1\r\nprint(a_wins, draws, b_wins)\r\n", "a, b = [int(i) for i in str(input()).split()] \r\naWon, bWon, draw = 0, 0, 0\r\n\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n aWon += 1\r\n elif abs(a - i) > abs(b - i):\r\n bWon += 1\r\n else: \r\n draw += 1\r\n\r\nprint(aWon, draw, bWon)\r\n", "import sys\r\n\r\nn = list(map(int,sys.stdin.readline().split()))\r\n\r\na = 0\r\nb = 0\r\nc = 0\r\nfor i in range(1,7):\r\n if ( abs(n[0]-i) < abs(n[1]-i) ):\r\n a += 1\r\n elif ( abs(n[0]-i) > abs(n[1]-i)):\r\n c += 1\r\n else:\r\n b += 1\r\n\r\n\r\nprint(a,b,c,sep=\" \")\r\n", "a, b = list(map(int,input().split(' ')))\r\n\r\nplaa = 0\r\nplab = 0\r\ndraw = 0\r\n\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n plaa += 1\r\n\r\n elif abs(a-i)>abs(b-i):\r\n plab += 1\r\n\r\n else: draw += 1\r\n\r\nprint(plaa, draw, plab)", "a,b=map(int,input().split())\r\nl=[1,2,3,4,5,6]\r\naw,d,bw=0,0,0\r\nfor i in l:\r\n if abs(a-i)<abs(b-i):\r\n aw+=1\r\n elif(abs(a-i)>abs(b-i)):\r\n bw+=1\r\n else:\r\n d+=1\r\nprint(aw,d,bw)", "a = input(\"\").split(\" \")\r\nb=0\r\nc=0\r\nd=0\r\nfor i in range(1,7):\r\n if abs(int(a[0])-i) == abs(int(a[1])-i):\r\n c = c+1\r\n elif abs(int(a[0])-i) > abs(int(a[1])-i):\r\n d = d+1\r\n else:\r\n b = b+1\r\n\r\nprint(f\"{b} {c} {d}\")", "temp = input().split(' ')\r\na = int(temp[0])\r\nb = int(temp[1])\r\nw1 = 0\r\nd = 0\r\nw2 = 0\r\nfor i in range(1, 7):\r\n if abs(a-i) > abs(b-i):\r\n w1 += 1\r\n elif abs(a-i) < abs(b-i):\r\n w2 += 1\r\n else:\r\n d += 1\r\nprint(str(w2) + ' ' + str(d) + ' ' + str(w1))", "a, b = map(int, input().split())\n\nwin_a = win_b = draw = 0\n\nfor i in range(1, 7):\n diff_a = abs(i - a)\n diff_b = abs(i - b)\n if diff_a < diff_b:\n win_a += 1\n elif diff_b < diff_a:\n win_b += 1\n else:\n draw += 1\n\nprint(win_a, draw, win_b)\n\n\t \t\t\t\t \t \t\t\t \t \t\t \t\t \t", "a,b=map(int,input().split())\r\nc1=c2=c3=0\r\nfor i in range(1,7):\r\n\tp=abs(a-i)\r\n\tq=abs(b-i)\r\n\tif p<q:\r\n\t\tc1+=1\r\n\telif q<p:\r\n\t\tc2+=1\r\n\telse:\r\n\t\tc3+=1\r\nprint(c1,c3,c2)", "a, b = map(int, input().split())\r\na_win = 0\r\nb_win = 0\r\ndraw = 0\r\nfor x in range(1, 7):\r\n if abs(a - x) < abs(b - x):\r\n a_win += 1\r\n elif abs(a - x) > abs(b - x):\r\n b_win += 1\r\n else:\r\n draw += 1\r\nprint(f'{a_win} {draw} {b_win}')\r\n\r\n", "a,b = map(int,input().split())\r\na_win = b_win = draw = 0\r\nfor x in range(1,7):\r\n\tif abs(x-a) < abs(x-b):\r\n\t\ta_win+=1\r\n\telif abs(x-a) > abs(x-b):\r\n\t\tb_win+=1\r\n\telse:\r\n\t\tdraw+=1\r\nprint(a_win,draw,b_win)", "a,b=map(int,input().split())\r\nac=0\r\nbc=0\r\ndraw=0\r\nfor x in range(1,7):\r\n if abs(a-x)==abs(b-x):\r\n draw+=1\r\n elif abs((a-x))<abs((b-x)):\r\n ac+=1\r\n elif abs((a-x))>abs((b-x)):\r\n bc+=1\r\nprint(ac,draw,bc)", "from sys import stdin\r\na,b = map(int, stdin.readline().rstrip().split(' '))\r\naw = t = bw = 0\r\n\r\nfor i in range(1, 7):\r\n da = abs(a-i)\r\n db = abs(b-i)\r\n \r\n if da == db:\r\n t += 1\r\n elif da > db:\r\n bw += 1\r\n else:\r\n aw += 1\r\n\r\nprint(aw, t, bw)", "import math\r\nn1,n2 = map(int ,input().split())\r\na,b,d = 0,0,0\r\nfor i in range(1,7):\r\n\td1 = abs(i-n1)\r\n\td2 = abs(i-n2)\r\n\tif d1<d2:\r\n\t\ta+=1\r\n\telif d1>d2:\r\n\t\tb+=1\r\n\telse:\r\n\t\td+=1\r\nprint(a,d,b)\r\n", "def getVals(a, b):\n\tfirstWin = 0\n\tsecondWin = 0\n\tdraw = 0\n\tfor i in range(1, 7):\n\t\tif abs(i - a) < abs(i - b):\n\t\t\tfirstWin += 1\n\t\telif abs(i - a) > abs(i - b):\n\t\t\tsecondWin += 1\n\t\telse:\n\t\t\tdraw += 1\n\tprint('{0} {1} {2}'.format(firstWin, draw, secondWin))\n\n\nif __name__ == '__main__':\n\tvalues = input()\n\ta, b = values.split(' ')\n\tgetVals(int(a), int(b))\n \t\t\t\t\t \t\t\t \t \t \t \t\t", "a,b = map(int,input().split())\r\nk1 = 0\r\nk2=0\r\nk3=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n k1+=1\r\n if abs(a-i)>abs(b-i):\r\n k3+=1\r\n if abs(a-i) == abs(b-i):\r\n k2+=1\r\nprint(k1,k2,k3)\r\n", "a,b=[int(i) for i in input().split()]\r\nac,dw,bc=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n bc+=1\r\n elif abs(a-i)==abs(b-i):\r\n dw+=1\r\n else:\r\n ac+=1\r\nprint(str(ac)+\" \"+str(dw)+\" \"+str(bc))", "a,b=map(int,input().split())\r\nf=0\r\ns=0\r\nd=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n f+=1\r\n elif abs(a-i)>abs(b-i):\r\n s+=1\r\n else:\r\n d+=1\r\nprint(f,d,s)", "#https://codeforces.com/problemset/problem/378/A\r\n\r\na,b = input().split()\r\nwina = 0\r\ndraw = 0\r\nwinb = 0\r\nrolls = [1,2,3,4,5,6]\r\nfor n in rolls:\r\n #print(n)\r\n diffrencea = int(a) - n\r\n diffrenceb = int(b) - n\r\n #print(abs(diffrenceb),abs(diffrencea))\r\n if abs(diffrencea) < abs(diffrenceb):\r\n wina += 1\r\n elif abs(diffrencea) > abs(diffrenceb):\r\n winb += 1\r\n else:\r\n draw += 1\r\nprint(wina,draw,winb)\r\n\r\n\r\n", "a,b=map(int,input().split())\r\nc1=0\r\nc2=0\r\nce=0\r\nfor i in range(1,7,1):\r\n if (abs(a - i)<abs(b - i)):\r\n c1+=1\r\n elif (abs(b - i)<abs(a - i)):\r\n c2+=1\r\n else:\r\n ce+=1\r\nprint(c1,ce,c2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a,b = map(int,input().split())\r\nf = 0\r\nl = 0\r\ndraw = 0\r\nfor i in range(1,6+1):\r\n\tif ((max(i,a) - min(i,a)) > (max(i,b) - min(i,b))):\r\n\t\tl += 1\r\n\telif ((max(i,a) - min(i,a))== (max(i,b) - min(i,b))):\r\n\t\tdraw += 1\r\n\telse:\r\n\t\tf += 1\r\nprint(f,draw,l)", "a, b = [int(i) for i in input().split()]\r\nw = 0\r\nl = 0\r\nd = 0\r\nfor i in range(1, 7):\r\n if (abs(a-i) < abs(b-i)):\r\n w += 1\r\n elif (abs(a-i) == abs(b-i)):\r\n d += 1\r\n else:\r\n l += 1\r\nprint(w, d, l)\r\n# 1,2,3,4,5,6\r\n", "x,y=map(int,input().split())\r\nc1=0\r\nc2=0\r\nd=0\r\nfor i in range(1,7):\r\n if abs(x-i)<abs(y-i):\r\n c1=c1+1\r\n elif abs(y-i)<abs(x-i):\r\n c2=c2+1\r\n elif abs(x-i)==abs(y-i):\r\n d=d+1\r\nprint(c1,d,c2)\r\n \r\n", "a,b=list(map(int,input().split()))\r\ncount=[0,0,0]\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n count[0]+=1\r\n elif abs(a-i)>abs(b-i):\r\n count[2]+=1\r\n else:\r\n count[1]+=1\r\nprint(count[0],count[1],count[2])\r\n", "a,b=map(int,input().split())\r\nplayer1=0\r\nplayer2=0\r\nm=0\r\nfor i in range(1,7):\r\n if(abs(a-i)<abs(b-i)):\r\n player1+=1\r\n elif(abs(b-i)<abs(a-i)):\r\n player2+=1\r\n else:\r\n m+=1\r\nprint(player1,m,player2)\r\n", "# 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\nc=0\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tc+=1\r\nif abs(b-a)%2==1:\r\n\tprint(c,0,6-c,sep=\" \")\r\nelif b==a:\r\n\tprint(0,6,0,sep=\" \")\t\r\nelse:\r\n\tprint(c,1,5-c,sep=\" \")\t", "a,b=map(int,input().split())\r\nx,y,z=0,0,0\t\r\nl=[1,2,3,4,5,6]\r\nfor i in l:\r\n\tif abs(a-i)>abs(b-i):\r\n\t\tx+=1\r\n\telif abs(b-i)>abs(a-i):\r\n\t\ty+=1\r\n\telse:\r\n\t\tz+=1\t\r\nprint(y,z,x)\t\t", "a,b=map(int,input().split());a1,s,b1=0,0,0\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):a1+=1\r\n\telif abs(a-i)==abs(b-i):s+=1\r\n\telse :b1+=1\r\nprint(a1,s,b1)", "x=input()\r\np1,p2,d=0,0,0\r\nk=[int(i) for i in x.split()]\r\nfor i in range(1,7):\r\n if abs((i-k[0])) > abs((i-k[1])):\r\n p2=p2+1\r\n elif abs((i-k[0])) < abs((i-k[1])):\r\n p1=p1+1\r\n elif abs((i-k[0])) == abs((i-k[1])):\r\n d=d+1\r\nprint(p1,d,p2) ", "str=input()\nl=str.split()\na=int(l[0])\nb=int(l[1])\ncount_a=0\ncount_b=0\ncount_draw=0\n\nfor i in range(1,7,1):\n diff_a=abs(a-i)\n diff_b=abs(b-i)\n if diff_a==diff_b:\n count_draw+=1\n elif diff_a<diff_b:\n count_a+=1\n elif diff_a>diff_b:\n count_b+=1\n\nprint(f\"{count_a} {count_draw} {count_b}\")\n \n \n \t \t\t\t\t \t \t\t\t\t \t\t \t \t", "n,k = map(int,input().split())\r\na,b,lose=0,0,0\r\nfor i in range(1,7):\r\n if abs(n-i) < abs(k-i):\r\n a=a+1\r\n if abs(n-i) > abs(k-i):\r\n b=b+1 \r\n if abs(n-i) == abs(k-i): \r\n lose=lose+1\r\nprint(a,lose,b) \r\n\r\n", "a, b = map(int, input().split())\nwins1, draw, wins2 = 0, 0, 0\nfor x in range(1, 7):\n da = abs(a-x)\n db = abs(b-x)\n if da < db:\n wins1 += 1\n elif db < da:\n wins2 += 1\n else:\n draw += 1\nprint(wins1, draw, wins2)\n\n\t\t \t \t\t \t \t \t \t \t\t\t \t", "a,b=map(int,input().split())\r\nl=[int(x) for x in range(1,7)]\r\na1=b1=d1=0\r\nfor x in l:\r\n\tif abs(a-x) < abs(b-x):\r\n\t\ta1+=1\r\n\telif abs(a-x) == abs(b-x):\r\n\t\td1+=1\r\n\telse:\r\n\t\tb1+=1\r\nprint(a1,d1,b1)", "n,m=[int(x) for x in input().split()]\r\na=0\r\nb=0\r\nd=0\r\nfor i in range(1,7):\r\n if abs(i-n)==abs(i-m):\r\n d+=1\r\n elif abs(i-n)>abs(i-m):\r\n b+=1\r\n else:\r\n a+=1\r\nprint(a,d,b) ", "a,b=map(int,input().split())\r\ns1=0\r\nd=0\r\ns2=0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n s2+=1\r\n elif abs(a-i)==abs(b-i):\r\n d+=1\r\n else:\r\n s1+=1\r\nprint(s1,d,s2)\r\n\r\n", "l=[1,2,3,4,5,6]\r\nc1=0\r\nc2=0\r\nc3=0\r\na,b=map(int,input().split())\r\n\r\nfor i in l:\r\n if(abs(a-i)<abs(b-i)):\r\n c1=c1+1\r\n elif(abs(a-i)>abs(b-i)):\r\n c2=c2+1\r\n else:\r\n c3=c3+1\r\nprint(c1,c3,c2)\r\n ", "a,b=map(int,input().split())\r\ny1=0\r\nn=0\r\ny2=0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n y2+=1\r\n elif abs(a-i)<abs(b-i):\r\n y1+=1\r\n elif abs(a-i)==abs(b-i):\r\n n+=1\r\nprint(y1,n,y2)\r\n", "a, b = map(int, input().split())\r\n\r\nwin_a = 0\r\ndraw = 0\r\nwin_b = 0\r\n\r\nfor i in range(1, 7):\r\n if (abs(a - i) < abs(b - i)):\r\n win_a += 1\r\n \r\n elif (abs(a - i) > abs(b - i)):\r\n win_b += 1\r\n \r\n else:\r\n draw += 1\r\n\r\nprint(win_a, draw, win_b)", "a,b=map(int, input().split())\r\nc=0\r\nd=0\r\nk=0\r\nfor x in range(1,7):\r\n if abs(a-x)<abs(b-x):\r\n c+=1\r\n elif abs(a-x)>abs(b-x):\r\n d+=1\r\n else:\r\n k+=1\r\n\r\nprint(c, k, d)", "a,b=map(int,input().split())\r\nA,B=0,0\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tA+=1\r\n\telif abs(a-i)>abs(b-i):\r\n\t\tB+=1\r\nprint(A,6-(A+B),B)", "a,b=map(int,input().split())\r\nw,l,d=0,0,0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n w=w+1\r\n elif abs(i-a)>abs(i-b):\r\n l=l+1\r\n elif abs(i-a)==abs(i-b):\r\n d=d+1\r\nprint(w,d,l)\r\n \r\n", "A,B = map(int,input().split())\r\na,d,b=0,0,0\r\nfor i in range(1,7):\r\n if abs(A-i)<abs(B-i):\r\n a+=1\r\n elif abs(A-i)>abs(B-i):\r\n b+=1\r\n else:\r\n d+=1\r\nprint(a,d,b)", "a, b = map(int, input().split())\r\nx=y=z=0\r\nfor i in range(1, 7):\r\n if abs(a-i)<abs(b-i):\r\n x+=1\r\n elif abs(a-i)>abs(b-i):\r\n y+=1\r\n else:\r\n z+=1\r\nprint(x,z,y)", "a,b=map(int,input().split())\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in range(1,7):\r\n if abs(i-a)>abs(i-b):\r\n c3+=1\r\n elif abs(i-a)<abs(i-b):\r\n c1+=1\r\n else:\r\n c2+=1\r\nprint(c1,c2,c3)", "l1=list(map(int,input().split()))\na=l1[0]\nb=l1[1]\nwin=0\ndraw=0\nlose=0\nfor i in range(1,7):\n if abs(a-i)<abs(b-i):\n win+=1\n elif abs(a-i)==abs(b-i):\n draw+=1\n else:\n lose+=1\nprint(win,draw,lose)\n\n\n", "a,b=list(map(int,input().split()))\r\nt,u,o=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n t+=1\r\n elif abs(a-i)<abs(b-i):\r\n u+=1\r\n else:\r\n o+=1\r\n \r\nprint(u,o,t) \r\n", "n,m=map(int,input().split())\r\na,d,b=0,0,0\r\nfor i in range(1,7):\r\n p=abs(n-i)\r\n q=abs(m-i)\r\n if p<q:\r\n a+=1\r\n elif p==q:\r\n d+=1\r\n else:\r\n b+=1\r\nprint(a,d,b)", "a, b = (int(i) for i in input().split())\nf, d, s = 0, 0, 0\nfor i in range(1, 7):\n d1, d2 = abs(i - a), abs(i - b)\n if d1 == d2:\n d += 1\n elif d1 < d2:\n f += 1\n else:\n s += 1\nprint(f, d, s)\n", "a, b = list(map(int, input().split()))\n\nwin, draw, lose = 0,0,0\n\nfor i in range(1,7):\n\tif abs(i-a)==abs(i-b): draw+=1\n\telif abs(i-a)<abs(i-b): win+=1\n\telse: lose+=1\n\nprint(win, draw, lose)\n", "a , b = map(int , input().split()) \r\ncountera , counterb ,draw = 0, 0 , 0\r\nlistt= []\r\nfor i in range(1 , 7 ):\r\n if abs(a - i) < abs(b - i) :\r\n countera += 1 \r\n elif abs(a - i) > abs(b - i):\r\n counterb += 1\r\n else : \r\n draw += 1\r\n\r\nprint(countera ,draw , counterb)", "a, b = map(int, input().split())\r\n\r\nf = d = s = 0\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n f += 1\r\n elif abs(a - i) > abs(b - i):\r\n s += 1\r\n else:\r\n d += 1\r\nprint(f, d, s)", "a, q = map(int, input().split(' '))\r\ns, w, d = 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(a - i) > abs(q - i):\r\n d += 1\r\n elif abs(a - i) == abs(q - i):\r\n w += 1\r\n else:\r\n s += 1\r\nprint(s, w, d)\r\n", "n = [int(x) for x in input().split()]\nless = 0\nequal = 0\nmore = 0\nfor i in range(1, 7):\n if abs(n[0] - i) < abs(n[1] - i):\n less += 1\n elif abs(n[0] - i) > abs(n[1] - i):\n more += 1\n elif abs(n[0] - i) == abs(n[1] - i):\n equal += 1\nprint(less, equal, more)", "a, b = [int(x) for x in input().split()]\r\nawins = 0\r\nbwins = 0\r\ndraw = 0\r\nfor x in range(1, 7):\r\n if abs(a-x) < abs(b-x):\r\n awins += 1\r\n elif abs(a-x) > abs(b-x):\r\n bwins += 1\r\n else:\r\n draw += 1\r\nprint(awins, end=\" \")\r\nprint(draw, end=\" \")\r\nprint(bwins, end=\" \")\r\n", "a_b = input().split()\n\na = int(a_b[0])\nb = int(a_b[1])\n\na_win = 0\nb_win = 0\ndraw = 0\n\nfor x in range(1, 7):\n if abs(a - x) < abs(b - x):\n a_win += 1\n elif abs(a - x) == abs(b - x):\n draw += 1\n else:\n b_win += 1\n\nprint(a_win, draw, b_win)", "n = input()\nl = n.split(\" \")\na = int(l[0])\nb = int(l[1])\nawins = 0\nbwins = 0\ndraw = 0\ndice = [1,2,3,4,5,6]\n\nfor x in dice:\n if abs(a-x) > abs(b-x):\n bwins = bwins+1\n elif abs(a-x) < abs(b-x):\n awins = awins+1\n else:\n draw = draw + 1\n\nprint(awins,\" \",draw,\" \",bwins)\n \t \t \t \t \t\t\t\t \t\t \t \t\t \t", "a,b=list(map(int,input().split()))\r\none=two=three=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):one+=1\r\n elif abs(a-i)>abs(b-i):three+=1\r\n else:two+=1\r\nprint(one,two,three)", "l=list(map(int,input().split(\" \")))\r\na=l[0]\r\nb=l[1]\r\nawin=0\r\nbwin=0\r\ndraw=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n awin=awin+1\r\n elif abs(a-i)>abs(b-i):\r\n bwin=bwin+1\r\n else:\r\n draw+=1\r\nprint(awin,draw,bwin) \r\n \r\n \r\n ", "a,b=map(int,input().strip().split(' '))\narr=[]\nwin_1,draw,win_2=[],[],[]\nfor i in range(1,7):\n x,y=abs(a-i),abs(b-i)\n arr.append([x,y])\nfor i in range(len(arr)):\n if arr[i][0]<arr[i][1]:\n win_1.append(1)\n elif arr[i][0]>arr[i][1]:\n win_2.append(1)\n else:\n draw.append(1)\na=(len(win_1),len(draw),len(win_2))\nfor i in a:\n print(i,end=' ')", "p=[1,2,3,4,5,6]\r\nwin1=0\r\nwin2=0\r\ndraw=0\r\na,b=map(int,input().split())\r\nfor i in p:\r\n \r\n if abs(a-i)<abs(b-i):\r\n win1+=1\r\n elif abs(a-i)>abs(b-i):\r\n win2+=1\r\n else:\r\n draw+=1\r\n \r\nprint(win1,draw,win2)\r\n", "import sys\r\ndef get_list ():\r\n return (map (int, sys.stdin.readline ().strip ().split ()))\r\na, b = get_list ()\r\ntmp = [0, 0, 0]\r\nfor i in range (1, 7):\r\n if abs (a - i) > abs (b -i):\r\n tmp [2] += 1\r\n elif abs (a - i) < abs (b -i): \r\n tmp [0] += 1\r\n else:\r\n tmp [1] += 1\r\nfor i in tmp:\r\n print (i)\r\n\r\n\r\n\r\n\r\n", "a, b = map(int, input().split())\n\nwin_first = 0\ndraw = 0\nwin_second = 0\n\nfor d in range(1, 7):\n diff_first = abs(a - d)\n diff_second = abs(b - d)\n if diff_first < diff_second:\n win_first += 1\n elif diff_first == diff_second:\n draw += 1\n else:\n win_second += 1\n\nprint(win_first, draw, win_second)\n\n\t \t \t\t \t \t \t \t\t \t\t \t \t \t \t \t", "a,b = [int(x) for x in input().split()]\r\nf=0\r\ns=0\r\nfor x in range(1,7):\r\n if abs(x-a)>abs(x-b):\r\n s+=1\r\n elif abs(x-a)<abs(x-b):\r\n f+=1\r\nprint(f\"{f} {6-f-s} {s}\")", "arr=list(map(int , input().split()))\r\ncount1=0\r\ncount2=0\r\ncount_draw=0\r\nfor i in range(6):\r\n if abs(arr[0]-(i+1))>abs(arr[1]-(i+1)):\r\n count2=count2+1\r\n elif abs(arr[0]-(i+1))<abs(arr[1]-(i+1)):\r\n count1=count1+1\r\n else:\r\n count_draw=count_draw+1\r\nprint(count1, count_draw, count2, sep=\" \")\r\n", "def q(x,y):\r\n if x>=y:\r\n return x-y\r\n else:\r\n return y-x\r\n\r\na,b=map(int,input().split(' '))\r\naw=d=bw=0\r\nfor x in range(1,7):\r\n if q(a,x)<q(b,x):\r\n aw+=1\r\n elif q(a,x)>q(b,x):\r\n bw+=1\r\n else:\r\n d+=1\r\nprint(aw,d,bw)\r\n", "a,b=map(int,input().split())\r\nwin=0\r\ndraw=0\r\nlose=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n win+=1\r\n continue\r\n elif abs(a-i)==abs(b-i):\r\n draw+=1\r\n continue\r\n else:\r\n lose+=1\r\nprint(win, draw, lose)", "x,y = map(int, input().split())\nl,m,n = 0,0,0\nfor i in range(1,7):\n if(abs(x-i)<abs(y-i)):\n l+=1\n elif(abs(x-i)>abs(y-i)):\n m+=1\n else:\n n+=1\nprint(l,n,m)\n \t\t \t\t \t\t \t\t \t\t\t\t\t \t\t\t \t", "a , b = input().split()\r\na = int(a)\r\nb = int(b)\r\na_wins = 0\r\ndraw = 0\r\nb_wins = 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n a_wins = a_wins+1\r\n elif abs(a-i) == abs(b-i):\r\n draw = draw + 1\r\n else:\r\n b_wins = b_wins +1\r\n\r\nprint(a_wins , draw , b_wins)", "a, b = map(int, input().split())\r\nw, d, l = 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(i-a) < abs(i-b):\r\n w += 1\r\n elif abs(i-a) == abs(i-b):\r\n d += 1\r\n else:\r\n l += 1\r\nprint(w, d, l)", "def int_lst_input():\n return [int(val) for val in input().split(' ')]\n\ndef int_input():\n return int(input())\n\ndef print_lst(lst):\n print(' '.join([str(val) for val in lst]))\n\ndef solve():\n a, b = int_lst_input()\n\n result = [0, 0, 0]\n for i in range(1, 7):\n if abs(a - i) == abs(b - i):\n result[1] += 1\n elif abs(a - i) < abs(b - i):\n result[0] += 1\n else:\n result[2] += 1\n\n print_lst(result)\n\n\nif __name__ == '__main__':\n solve()\n", "def dice_game():\n\tplayer_numbs = input()\n\tnumbers = list(map(int, player_numbs.split(\" \")))\n\ta_num = numbers[0]\n\tb_num = numbers[1]\n\n\ta_wins = 0\n\tdraws = 0\n\tb_wins = 0\n\t\n\tfor i in range(1, 7):\n\t\tif(abs(i-a_num) < abs(i-b_num)):\n\t\t\ta_wins += 1\n\t\tif(abs(i-a_num) > abs(i-b_num)):\n\t\t\tb_wins += 1\n\t\tif(abs(i-a_num) == abs(i-b_num)):\n\t\t\tdraws += 1\n\n\treturn(print(a_wins, draws, b_wins))\n\ndice_game()\n\t \t\t\t \t \t\t \t\t\t \t\t\t\t\t\t \t", "a, b = map(int, input().split())\r\n\r\nfirst_wins = 0\r\ndraws = 0\r\nsecond_wins = 0\r\n\r\nfor i in range(1, 7):\r\n difference_a = abs(a - i)\r\n difference_b = abs(b - i)\r\n\r\n if difference_a < difference_b:\r\n first_wins += 1\r\n elif difference_a > difference_b:\r\n second_wins += 1\r\n else:\r\n draws += 1\r\n\r\nprint(first_wins, draws, second_wins)", "a,b = map(int,input().split())\ne=0\nf=0\ng=0\nfor i in range(1,7):\n c = abs(a-i)\n d = abs(b-i)\n if c < d:\n e += 1\n elif c == d:\n f += 1\n else:\n g += 1\nprint(e,f,g)\n\t\t\t \t \t \t\t\t \t\t\t \t\t\t \t \t\t\t", "line = input()\r\nline = line.split()\r\na = int(line[0])\r\nb = int(line[1])\r\nwin = 0\r\ndraw = 0\r\nlose = 0\r\nfor i in range(1,7):\r\n adif = a - i\r\n if(adif < 0):\r\n adif = adif * -1\r\n bdif = b - i\r\n if(bdif < 0):\r\n bdif = bdif * -1\r\n if(adif < bdif):\r\n win = win + 1\r\n elif(adif == bdif):\r\n draw = draw + 1\r\n else:\r\n lose = lose + 1\r\nprint(str(win) + \" \" + str(draw) + \" \" + str(lose))", "a, b = map(int, input().split())\n# num_ways_tie = 1 if (a + b) / 2 == 0 else 0\nnum_ways_tie = 0\na_wins_num_outcomes = 0\nb_wins_num_outcomes = 0\nfor roll in range(1, 6+1):\n diff_a = abs(a - roll)\n diff_b = abs(b - roll)\n if diff_a == diff_b:\n num_ways_tie += 1\n elif diff_a < diff_b:\n a_wins_num_outcomes += 1\n else:\n b_wins_num_outcomes += 1\n\nprint(f'{a_wins_num_outcomes} {num_ways_tie} {b_wins_num_outcomes}')\n", "a,b=map(int,input().split())\r\nawin=0\r\nbwin=0\r\ndraw=0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n awin+=1\r\n elif abs(a-i) > abs(b-i):\r\n bwin+=1\r\n else:\r\n draw+=1\r\nprint(f'{awin} {draw} {bwin}')", "a,b = map(int,input().split())\r\nx,y,z = 0,0,0\r\nfor i in range(1,6+1):\r\n diffa = abs(i-a)\r\n diffb = abs(i-b)\r\n if diffa == diffb:\r\n y+=1\r\n elif diffa < diffb:\r\n x+=1\r\n else:\r\n z+=1\r\nprint(x,y,z)", "a,b=(int(s) for s in input().split())\na_win=0\nb_win=0\nfor i in range(1,7):\n if abs(a-i)<abs(b-i):\n a_win+=1\n elif abs(a-i)>abs(b-i):\n b_win+=1\noutput=[a_win,6-a_win-b_win,b_win]\nprint(*output)\n\t \t \t\t \t \t\t\t \t\t \t\t\t \t\t \t\t \t", "a,b=[int(x) for x in input().split()]\r\ncw=0\r\ncd=0\r\ncl=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n cw+=1\r\n elif abs(a-i)==abs(b-i):\r\n cd+=1\r\n else:\r\n cl+=1\r\nprint(cw,cd,cl)", "a,b=map(int,input().split())\r\np1=0\r\np2=0\r\np3=0\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tp1+=1\r\n\telif abs(a-i)>abs(b-i):\r\n\t\tp2+=1\r\n\telse:\r\n\t\tp3+=1\r\nprint(p1,p3,p2)", "a,b = map(int, input().split())\r\nx = 0\r\ny = 0\r\nz = 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n x += 1\r\n elif abs(a-i) == abs(b-i):\r\n y += 1\r\n elif abs(a-i) > abs(b-i):\r\n z += 1\r\nprint(x,y,z)", "\r\na,b=map(int,input().split())\r\nc=0\r\nd=0\r\ne=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n c+=1\r\n elif abs(a - i) > abs(b - i):\r\n d += 1\r\n else:\r\n e+=1\r\nprint(c,end=\" \")\r\nprint(e,end=\" \")\r\nprint(d,end=\" \")", "a,b = map(int,input().split())\n\nx = [i for i in range(1,7)]\n\na_win =0\n\nb_win = 0\n\nd_win = 0\n\nfor i in x:\n \n if abs(i-a) < abs(i-b):\n a_win+=1\n elif abs(i-a) == abs(i-b):\n d_win+=1\n else:\n b_win+=1\nprint(a_win,d_win,b_win)", "a,b = map(int, input(). strip(). split())\r\na_win = 0\r\nb_win = 0\r\ndraw = 0\r\nfor i in range(1,7) :\r\n if abs(a-i) < abs(b-i) : a_win += 1\r\n if abs(a - i) > abs(b - i): b_win += 1\r\n if abs(a - i) == abs(b - i): draw += 1\r\nprint(a_win,draw,b_win)", "a,b=map(int,input().split())\r\na1,b1,draw=0,0,0\r\nfor x in range(1,7):\r\n\tif abs(a-x)<abs(b-x):\r\n\t\ta1+=1\r\n\telif abs(a-x)>abs(b-x):\r\n\t\tb1+=1\r\n\telse:draw+=1\r\nprint(a1,draw,b1)\r\n", "n,m = (input().split())\r\na = int(n)\r\nb = int(m)\r\nwa = d = wb = 0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n wa+=1\r\n elif abs(a-i) > abs(b-i):\r\n wb+=1\r\n else:\r\n d+=1\r\n\r\nprint(wa, d, wb)\r\n", "a,b = map(int,input().split())\r\nfirst = 0\r\nsecond = 0\r\ndraw = 0\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n second+=1\r\n elif abs(a-i)<abs(b-i):\r\n first+=1\r\n else:\r\n draw+=1\r\nprint(first,draw,second)\r\n", "a,b = list(map(int, input().split()))\r\np, q, r = 0, 0, 0\r\nfor i in range(1, 7):\r\n if (abs(a - i) == abs(b - i)):\r\n q += 1\r\n elif (abs(a - i) > abs(b - i)):\r\n r += 1\r\n else:\r\n p += 1\r\nprint(p, q, r)", "a, b = map(int, input().split())\n\nwa = 0\nwb = 0\nd = 0\n\nfor i in range(1, 7):\n aa = abs(a - i)\n bb = abs (b - i)\n\n if aa < bb:\n wa += 1\n elif bb < aa:\n wb += 1\n else:\n d += 1\nprint(wa, d, wb)\n \t \t\t \t \t \t \t\t\t \t\t\t \t", "a,b=list(map(int,input().split(' ')))\r\nap=[]\r\nbp=[]\r\ncp=[]\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n ap.append(i)\r\n elif abs(a-i)>abs(b-i):\r\n bp.append(i)\r\n else:\r\n cp.append(i)\r\nprint(len(ap),len(cp),len(bp))", "l=list(map(int,input().split()))\r\n\r\na=0\r\nb=0\r\nd=0\r\n\r\nfor i in range(1,7):\r\n diff1=abs(i-l[0])\r\n diff2=abs(i-l[1])\r\n if diff1==diff2:\r\n d+=1\r\n else:\r\n if diff1<diff2:\r\n a+=1\r\n else:\r\n b+=1\r\n \r\nprint(a,d,b)", "import sys\r\n\r\ndef main():\r\n a, b = map(int, sys.stdin.read().strip().split())\r\n n1, n2, d = 0, 0, 0\r\n for i in range(1, 7):\r\n dt1 = abs(i - a)\r\n dt2 = abs(i - b)\r\n n1 += dt1 < dt2\r\n n2 += dt1 > dt2\r\n d += dt1 == dt2\r\n return n1, d, n2\r\n \r\nprint(*main())", "a,b=map(int,input().split(' '))\r\nx,y,z=0,0,0\r\nfor i in range(1,7):\r\n if(abs(i-a)<abs(i-b)):x+=1\r\n elif(abs(i-a)==abs(i-b)):y+=1\r\n else:z+=1\r\nprint(x,y,z)", "a, b = list(map(int, input().rstrip().split()))\nwin = 0\ndraw = 0\nlose = 0\nfor i in range(1, 7):\n diff_a = abs(a - i)\n diff_b = abs(b - i)\n if diff_a > diff_b:\n lose += 1\n elif diff_b == diff_a:\n draw += 1\n else:\n win += 1\nprint(win, draw, lose)\n", "a,b=map(int,input().split())\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n count1+=1\r\n elif abs(a-i)==abs(b-i):\r\n count2 +=1\r\n else:\r\n count3+=1\r\nprint(count1,count2,count3,sep=\" \")\r\n ", "\r\na,b = map(str, input().split())\r\na = int(a)\r\nb = int(b)\r\nx=y=z=0\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(i-b):\r\n x+= 1\r\n elif abs(a-i) > abs(i-b):\r\n z += 1\r\n else: y += 1\r\n\r\nprint(f\"{x} {y} {z}\")\r\n\r\n\r\n", "[a, b] = map(int, input().split())\r\naw = 0\r\nbw = 0\r\nd = 0\r\nif abs(a - 1) > abs(b - 1):\r\n aw += 1\r\nelif abs(a - 1) < abs(b - 1):\r\n bw += 1 \r\nelse:\r\n d += 1\r\nif abs(a - 2) > abs(b - 2):\r\n aw += 1\r\nelif abs(a - 2) < abs(b - 2):\r\n bw += 1 \r\nelse:\r\n d += 1\r\nif abs(a - 3) > abs(b - 3):\r\n aw += 1\r\nelif abs(a - 3) < abs(b - 3):\r\n bw += 1 \r\nelse:\r\n d += 1\r\nif abs(a - 4) > abs(b - 4):\r\n aw += 1\r\nelif abs(a - 4) < abs(b - 4):\r\n bw += 1 \r\nelse:\r\n d += 1\r\nif abs(a - 5) > abs(b - 5):\r\n aw += 1\r\nelif abs(a - 5) < abs(b - 5):\r\n bw += 1 \r\nelse:\r\n d += 1\r\nif abs(a - 6) > abs(b - 6):\r\n aw += 1\r\nelif abs(a - 6) < abs(b - 6):\r\n bw += 1 \r\nelse:\r\n d += 1\r\nprint(bw, d, aw)", "a,b=map(int,input().split())\r\nfirstWin=secondWin=draw=0\r\nfor i in range (1,7):\r\n x=abs(a-i)\r\n y=abs(b-i)\r\n if x<y:\r\n firstWin+=1\r\n elif x==y:\r\n draw+=1\r\n elif x>y:\r\n secondWin+=1\r\nprint(firstWin,draw,secondWin)\r\n", "(a,b)=map(int,input().split())\r\n(p,q,r)=(0,0,0)\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n p=p+1\r\n elif abs(a-i)==abs(b-i):\r\n q=q+1\r\n else:\r\n r=r+1\r\nprint(r,q,p)", "a,b = (int(s) for s in input().split())\na_win = 0\nb_win = 0\nequal = 0\nfor i in range(1,7):\n\tif abs(i-a) > abs(i-b):\n\t\tb_win += 1\n\telif abs(i-a) == abs(i-b):\n\t\tequal += 1\n\telse:\n\t\ta_win += 1\nprint(a_win, equal, b_win)\n\t \t\t\t \t\t\t\t\t \t \t\t \t \t\t \t", "a,b = map(int,input().split())\r\nz,x,c = 0,0,0\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tz+=1\r\n\telif abs(a-i)>abs(b-i):\r\n\t\tx+=1\r\n\telse:\r\n\t\tc+=1\r\nprint(z,c,x)\r\n", "from math import fabs\r\nplayer1, player2 = (int(x) for x in input().split())\r\ni = 1\r\npl1_win = 0\r\npl2_win = 0\r\ndraw = 0 # ничья\r\nwhile i <= 6:\r\n\tcondition = fabs(i - player1) - fabs(i - player2)\r\n\tif condition > 0:\r\n\t\tpl2_win += 1\r\n\telif condition < 0:\r\n\t\tpl1_win += 1\r\n\telse:\r\n\t\tdraw += 1\r\n\ti += 1\r\nprint(pl1_win, draw, pl2_win)", "a, b = map(int, input().split())\r\nfirst = 0\r\ndraw = 0\r\nsecond = 0\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n first += 1\r\n elif abs(a-i) == abs(b-i):\r\n draw += 1\r\n else:\r\n second += 1\r\nprint(first, draw, second)", "a,b=map(int,input().split())\r\naw=bw=d=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n aw+=1\r\n elif abs(a-i)==abs(b-i):\r\n bw+=1\r\n else:\r\n d+=1\r\nprint(aw,bw,d) \r\n ", "a,b=map(int,input().split())\r\nc=0\r\nc1=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n c+=1\r\n elif abs(b-i)<abs(a-i):\r\n c1+=1\r\n\r\nif c1<c :\r\n print(c,6-(c+c1),c1)\r\nelif c<c1:\r\n print(c,6-(c+c1),c1)\r\nelse:\r\n print(c,6-(c+c1),c1)\r\n \r\n", "a,b = list(map(int,input().split()))\r\nfirst_wins = 0\r\nsecond_wins = 0\r\ndraw = 0 \r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n first_wins+=1\r\n elif abs(a-i)>abs(b-i):\r\n second_wins+=1\r\n elif abs(a-i)==abs(b-i):\r\n draw+=1\r\nprint(first_wins,draw,second_wins)\r\n", "import math\r\na,b=map(int,input().split())\r\naw=0\r\nbw=0\r\ndr=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n aw+=1\r\n elif abs(a-i)==abs(b-i):\r\n dr+=1\r\n else:\r\n bw+=1\r\nprint(aw,dr,bw)", "number = input('')\na = int(number[0])\nb = int(number[2])\ndef dice(a, b):\n a_win = 0\n b_win = 0\n draw = 0\n for x in range(1,7):\n if abs(a-x) < abs(b-x):\n a_win += 1\n elif abs(a-x) > abs(b-x):\n b_win += 1\n else:\n draw += 1\n return a_win, draw, b_win\nresult = dice(a, b)\nprint(result[0], result[1], result[2])\n\t\t \t\t \t \t\t\t \t \t \t \t \t\t", "a, b = map(int, input().split())\r\nf, s, d = 0, 0, 0\r\n# f = s = d = 0\r\n\r\nfor i in range(1, 7):\r\n if abs(a - i) < abs(b - i):\r\n f += 1\r\n elif abs(a - i) > abs(b - i):\r\n s += 1\r\n else:\r\n d += 1\r\n \r\nprint(f, d, s)", "import math\ndef solve(p1,p2):\n win1 = 0\n win2 = 0\n draw = 0\n for i in range(1,7):\n if abs(p1-i) < abs(p2-i):\n win1 += 1\n elif abs(p1-i) > abs(p2-i):\n win2 += 1\n else:\n draw += 1\n return win1,draw,win2\ndef main():\n i =list(map(int,input().split(' ')))\n #n = int(input())\n #arr = []\n #for j in range(n):\n #i = list(map(int,input().split(' ')))\n #arr.append(i)\n print(*solve(*i))\n\nmain()", "a,b=list(map(int,input().split()))\r\none=0\r\ntwo=0\r\ndraw=0\r\nfor i in range(1,7):\r\n if abs(a-i)==abs(b-i):\r\n draw+=1\r\n elif abs(a-i)<abs(b-i):\r\n one+=1\r\n else:\r\n two+=1\r\nprint(one,draw,two)", "a, b = map(int, input().split())\r\nx=y=z=0\r\nfor i in range(1, 7):\r\n if abs(a-i)<abs(b-i):x+=1\r\n elif abs(a-i)>abs(b-i):y+=1\r\n else:z+=1\r\nprint(x,z,y)", "[a,b] = map(int, input().split())\r\nif a==b:\r\n print(0, 6, 0)\r\nelif a<b:\r\n if (b-a)%2 == 0: \r\n print((a+b)//2-1, 1, 6-(a+b)//2)\r\n else: # difference is odd, no tie\r\n print((a+b)//2, 0, 6-(a+b)//2)\r\nelse: # a>b\r\n if (a-b)%2 == 0:\r\n print(6-(a+b)//2, 1, (a+b)//2-1)\r\n else:\r\n print(6-(a+b)//2, 0, (a+b)//2)\r\n ", "a,b = map(int,input().split())\r\nawin=0\r\nbwin=0\r\ndraw=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n awin+=1\r\n elif abs(a-i)>abs(b-i):\r\n bwin+=1\r\n else:\r\n draw+=1\r\nprint(awin,draw,bwin)\r\n", "a,b=map(int,input().split())\r\nc1=c2=c3=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(i-b):\r\n c1+=1\r\n elif abs(a-i)==abs(b-i):\r\n c2+=1\r\n else:\r\n c3+=1\r\nprint(c1,c2,c3)", "a, b = map(int, input().split())\r\n\r\ncount_a, count_eq, count_b = 0,0,0\r\n\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n count_a += 1\r\n elif abs(b-i) < abs(a-i):\r\n count_b += 1\r\n else:\r\n count_eq += 1\r\n\r\nprint(count_a, count_eq, count_b)", "m = input().split()\ncount1=0\ncount2=0\nk=0\na = int(m[0])\nb = int(m[1])\nfor x in range(1,7):\n if abs(a-x) < abs(b-x):\n count1+=1\n elif abs(a-x) > abs(b-x):\n count2+=1\n elif abs(a-x) == abs(b-x):\n k += 1\nprint(count1,k,count2)\n \t \t \t \t\t\t \t \t \t \t\t", "a,b=input().split(\" \")\r\na=int(a)\r\nb=int(b)\r\nwina=int(0)\r\nwinb=int(0)\r\ndraw=int(0)\r\nfor i in range(1,7):\r\n if abs(a-i)>abs(b-i):\r\n winb+=1\r\n elif abs(a-i)<abs(b-i):\r\n wina+=1\r\n else:\r\n draw+=1\r\nprint(wina,draw,winb)", "a,b=map(int,input().split());d=min(a,b);e=7-max(a,b);f=max(b,a)-min(a,b)-1;m=(([0,6,0] if a==b else [d+f//2,0,e+f//2] if f%2==0 else [d+f//2,1,e+f//2]));print(*(m if a<=b else m[::-1]))", "a,b = map(int, input() .split())\r\naw,bw,d=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n aw+=1\r\n elif abs(a-i) > abs(b-i):\r\n bw+=1\r\n elif abs(a-i) == abs(b-i):\r\n d+=1\r\nprint(aw,d,bw) ", "from sys import stdin\r\n\r\nraw_input = stdin.readline().split()\r\na = int(raw_input[0])\r\nb = int(raw_input[1])\r\n\r\nlistA = [abs(a - i) for i in range(1, 7)]\r\nlistB = [abs(b - i) for i in range(1, 7)]\r\n\r\nresult = [0] * 3\r\n\r\nfor i in range(0, 6):\r\n if listA[i] < listB[i]:\r\n result[0] += 1\r\n elif listA[i] == listB[i]:\r\n result[1] += 1\r\n else:\r\n result[2] += 1\r\n\r\nprint(result[0], result[1], result[2])", "a,b=map(int,input().split())\r\nl=[(i+1) for i in range(6)]\r\nu=[]\r\nv=[]\r\nfor i in range(len(l)):\r\n u.append(abs(l[i]-a))\r\n v.append(abs(l[i]-b))\r\nr1=0\r\nr2=0\r\nr3=0\r\nfor i in range(len(u)):\r\n if(u[i]>v[i]):\r\n r1=r1+1\r\n elif(u[i]<v[i]):\r\n r2=r2+1\r\n else:\r\n r3=r3+1\r\nprint(r2,r3,r1)", "list = [int(x) for x in input().split(\" \")]\r\nplayer_1 = 0\r\nplayer_2 = 0\r\ndraw = 0\r\nfor i in range(1,7):\r\n if abs(list[0]-i)<abs(list[1]-i):\r\n player_1+=1\r\n elif abs(list[0]-i)>abs(list[1]-i):\r\n player_2+=1\r\n else:\r\n draw+=1\r\nprint(player_1, draw, player_2)\r\n\r\n", "a,b = list(map(int,input().split()))\r\nx=0;y=0;z=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n x = x + 1\r\n elif abs(a-i)==abs(b-i):\r\n y = y + 1\r\n else:\r\n z = z + 1\r\nprint(x,y,z)\r\n", "a, b = map(int, input().split())\nc_a, c_b = 0, 0\nl = [0, 0, 0]\nfor i in range(1, 7):\n c_a, c_b = abs(a-i), abs(b-i)\n if (c_a < c_b):\n l[0] += 1\n elif (c_a == c_b):\n l[1] += 1\n else:\n l[2] += 1\nfor i in range(0,3):\n print(l[i],end=\" \")\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\nwin,draw,lose=0,0,0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n win+=1\r\n elif abs(a-i)==abs(b-i):\r\n draw+=1\r\n else:\r\n lose+=1\r\nprint(win,draw,lose)", "# 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\na,b = map(int, input().split())\r\nwa=0\r\nwb=0\r\nd=0\r\n\r\nfor i in range(1,7):\r\n if abs(i-a)>abs(i-b):\r\n wa+=1\r\n elif abs(i-a)<abs(i-b):\r\n wb+=1\r\n else:\r\n d+=1\r\nprint(wb,d,wa) ", "a, b = map(int, input().split())\r\n\r\nwin_first = 0\r\nwin_second = 0\r\ndraw = 0\r\n\r\nfor x in range(1, 7):\r\n if abs(a - x) < abs(b - x):\r\n win_first += 1\r\n elif abs(a - x) > abs(b - x):\r\n win_second += 1\r\n else:\r\n draw += 1\r\n\r\nprint(win_first, draw, win_second)\r\n", "a,b=map(int,input().split())\r\nc1,c2,c3=0,0,0\r\nl=[]\r\nfor i in range(1,7):\r\n l.append((abs(i-a),abs(i-b)))\r\nfor i in range(len(l)):\r\n if(l[i][0]>l[i][1]):\r\n c3+=1\r\n elif(l[i][0]<l[i][1]):\r\n c1+=1\r\n else:\r\n c2+=1\r\nprint(c1,c2,c3)", "a, b = list(map(int, input().split()))\r\n\r\nfirst_player_wins = 0\r\nsecond_player_wins = 0\r\ndraw = 0\r\n\r\nfor i in range(1, 7):\r\n p = abs(a-i)\r\n q = abs(b-i)\r\n if p < q:\r\n first_player_wins += 1\r\n elif p > q:\r\n second_player_wins += 1\r\n elif p == q:\r\n draw += 1\r\n\r\n\r\nprint(first_player_wins, end = \" \")\r\nprint(draw, end = \" \")\r\nprint(second_player_wins)\r\n\r\n\r\n", "a,b=input().split()\na1=0\na2=0\na3=0\na=int(a)\nb=int(b)\nfor i in range(1,7):\n if(abs(a-i)<abs(b-i)):\n a1+=1\n elif(abs(b-i)<abs(a-i)):\n a2+=1\n elif(abs(b-i)==abs(a-i)):\n a3+=1\n\nprint(str(a1)+\" \"+str(a3)+\" \"+str(a2))\n \t\t\t\t\t\t \t\t \t\t\t \t \t \t \t", "a,b = map(int,input().split())\r\nw=0\r\nd=0\r\nl=0\r\nfor i in range(1,7):\r\n if abs(i-a)>abs(i-b):\r\n l+=1\r\n elif abs(i-a)==abs(i-b):\r\n d+=1\r\n elif abs(i-a)<abs(i-b):\r\n w+=1\r\nprint(w,d,l)", "n,m = map(int,input().split())\r\ncount = 0\r\nsount = 0\r\nDount = 0 \r\nfor i in range(1,7):\r\n G = abs(n-i)\r\n H = abs(m-i)\r\n if G<H:\r\n count = count + 1\r\n elif H<G:\r\n sount = sount + 1\r\n else : \r\n Dount = Dount + 1\r\nif n>m or m>n:\r\n print(count,Dount,sount)\r\nelse:\r\n print(count,Dount,sount)\r\n \r\n", "a, b = list(map(int,input().split(\" \")))\r\nw, d, l = 0, 0, 0\r\nfor i in range(1,7):\r\n t1, t2 = abs(i - a), abs(i - b)\r\n if(t1 < t2):\r\n w += 1\r\n elif(t1 == t2):\r\n d += 1\r\n else:\r\n l += 1\r\nprint(w,d,l)\r\n \r\n \r\n\r\n \r\n \r\n \r\n", "input_ = [int(i) for i in input().split()]\nplayer_1 = input_[0]\nplayer_2 = input_[1]\nplayer_1_win = 0\nplayer_2_win = 0\ntie = 0\n\nfor i in range(1,7):\n\tif abs(i - player_1) < abs(i - player_2):\n\t\tplayer_1_win += 1\n\telif abs(i - player_1) > abs(i - player_2):\n\t\tplayer_2_win += 1\n\telse:\n\t\ttie += 1\nprint(player_1_win, tie, player_2_win)\n\n\n\t \t\t \t \t\t\t \t \t \t\t \t\t \t \t", "a, b = [int(i) for i in input().split()]\r\n\r\nc, d, e = 0, 0, 0\r\nfor i in range(1, 7):\r\n if abs(a-i) < abs(b-i):\r\n c += 1\r\n elif abs(a-i) == abs(b-i):\r\n d += 1\r\n else:\r\n e += 1\r\nprint(c, d, e)\r\n", "\r\na,b = [int(i) for i in input().split()]\r\n\r\npa =0\r\npb = 0\r\npd = 0\r\n\r\nif a > b:\r\n\tnumdis = a-b-1\r\n\tif numdis%2 !=0:\r\n\t\tpd+=1\r\n\tmax_ = b + int(numdis/2)\r\n\tpb = max_\r\n\tpa = 6- max_ -pd\r\nelif a == b:\r\n\tpd = 6\r\nelse:\r\n\tnumdis = b-a-1\r\n\t\r\n\tif numdis%2 !=0:\r\n\t\tpd+=1\r\n\tmax_ = a + int(numdis/2)\r\n\tpa = max_\r\n\tpb = 6- max_ - pd\r\n\r\nprint(pa,pd,pb)\t\r\n", "def solve(a,b):\n\tx,y,z=0,0,0\n\tfor i in range(1,7) :\n\t\tif abs(a-i) < abs(b-i) :\n\t\t\tx+=1\n\t\telif abs(a-i) > abs(b-i) :\n\t\t\ty+=1\n\t\telse :\n\t\t\tz+=1\n\treturn f'{x} {z} {y}'\n\n\n\n\n\n\n\n\n\t\t\nl=input()\nl=[int(x) for x in l.split(' ')]\n\n\nprint(solve(l[0] , l[1] ))\n", "a, b=[int(j) for j in input().split()]\r\np, v, n=0, 0, 0\r\nfor i in range(6):\r\n if abs(i+1-a)<abs(i+1-b):\r\n p+=1\r\n elif abs(i+1-b)<abs(i+1-a):\r\n v+=1\r\n else:\r\n n+=1\r\nprint(p, n, v)", "dice = list(range(1,7))\n\nab = input()\n\na,b = ab.split(\" \")\n\na_count = sum([abs(int(a) - dice_e) < abs(int(b) - dice_e) for dice_e in dice])\nb_count = sum([abs(int(a) - dice_e) > abs(int(b) - dice_e) for dice_e in dice])\ntie_count = sum([abs(int(a) - dice_e) == abs(int(b) - dice_e) for dice_e in dice])\nprint(a_count, tie_count, b_count)\n\t \t\t \t \t \t \t \t \t \t\t \t \t", "p,q = map(int,input().split())\r\nprint(sum(abs(i-p)<abs(i-q)for i in range(1,7)),\r\n sum(abs(i-p)==abs(i-q) for i in range(1,7)),\r\n sum(abs(i-p)>abs(i-q) for i in range(1,7)))\r\n", "a,b=map(int,input().split())\r\nda,db,cnt=[],[],[0,0,0]\r\nfor i in range(1,7):\r\n da.append(abs(i-a))\r\n db.append(abs(i-b))\r\n if(da[i-1]==db[i-1]):\r\n cnt[1]+=1\r\n elif(da[i-1]>db[i-1]):\r\n cnt[2]+=1\r\n elif(db[i-1]>da[i-1]):\r\n cnt[0]+=1\r\n#print(da,db,cnt)\r\n \r\nif(a==b):\r\n print(\"0 6 0\")\r\nelse:\r\n print(*cnt,sep=' ')", "pla1, pla2 = input(\"\").split(\" \")\n\np1 = 0\np2 = 0\n\ndraw = 0\n\nfor i in range(1, 7):\n p1 += abs((int(pla1) - i)) < abs((int(pla2) - i))\n p2 += abs((int(pla1) - i)) > abs((int(pla2) - i))\n draw += abs((int(pla1) - i)) == abs((int(pla2) - i))\n\nprint(f\"{p1} {draw} {p2}\")\n \t\t \t\t\t\t \t\t \t\t\t \t \t \t \t", "a, b = map(int, input().split())\r\n \r\naa = 0\r\nab = 0\r\nbb = 0\r\nfor i in range(1, 7):\r\n\tda = abs(a-i)\r\n\tdb = abs(b-i)\r\n\tif(da < db):\r\n\t\taa += 1\r\n\telif(da > db):\r\n\t\tbb += 1\r\n\telse:\r\n\t\tab += 1\r\nprint(aa, ab, bb)", "n, m = map(int, input().split())\r\nop = (n+m)//2\r\n\r\nif (n+m)%2 == 0:\r\n draw = 1\r\n if n == m:\r\n print(0, 6, 0)\r\n elif n < m:\r\n print(op-1, draw, 6-op)\r\n else:\r\n print(6-op, draw, op-1)\r\n\r\nelse:\r\n if n < m:\r\n print(op, 0, 6-op)\r\n else:\r\n print(6-op, 0, op)", "[a,b]= map(int, input().split())\r\n(f,d,s)=0,0,0\r\nfor x in range(1,7):\r\n if abs(x-a)<abs(x-b):\r\n f=f+1\r\n elif abs(x-b)<abs(x-a):\r\n s=s+1\r\n else:\r\n d=d+1\r\nprint(f,d,s)\r\n", "# https://codeforces.com/contest/378/problem/A\r\n\r\na, b = [int(i) for i in input().split()]\r\n\r\nl = [0, 0, 0]\r\n\r\nfor i in range(1, 7):\r\n da = a-i\r\n db = b-i\r\n\r\n if da < 0: da *= -1\r\n if db < 0: db *= -1\r\n\r\n if da > db:\r\n l[2] += 1\r\n elif da < db:\r\n l[0] += 1\r\n else:\r\n l[1] += 1\r\n\r\nfor lol in range(0, len(l)):\r\n l[lol] = str(l[lol])\r\n\r\nprint(\" \".join(l))", "if __name__ == \"__main__\":\r\n a, b = map(int, input().split())\r\n\r\n result = [0,0,0]\r\n for i in range(1, 7):\r\n a_closer = abs(a-i)\r\n b_closer = abs(b-i)\r\n\r\n if a_closer == b_closer:\r\n result[1] += 1\r\n elif a_closer < b_closer:\r\n result[0] += 1\r\n else:\r\n result[2] += 1\r\n\r\n print(*result)\r\n", "first=0\r\nsecond=0\r\ndraw=0\r\nz,x=list(map(int,input().split()))\r\nfor i in range(1,7):\r\n #print('(i-z)=%d (i-x)=%d'%(abs(i-z),abs(i-x)))\r\n if abs(i-z)<abs(i-x):\r\n first+=1\r\n # print('first',first)\r\n elif abs(i-z)>abs(i-x) :\r\n second+=1\r\n # print('second',second)\r\n else:\r\n draw+=1\r\n # print('draw',draw)\r\nprint(first,draw,second) ", "n,m=map(int,input().split())\na = b = c = 0\nfor i in range(1,7):\n t=abs(n-i)-abs(m-i)\n a += t < 0\n b += t == 0\n c += t > 0\nprint(a, b, c)\n\t\t \t\t\t \t\t \t\t\t \t\t \t\t\t \t\t", "aw,bw,d=0,0,0\r\na,b=map(int,input().split())\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\taw+=1\r\n\telif abs(a-i)>abs(b-i):\r\n\t\tbw+=1\r\n\telse:\r\n\t\td+=1\r\nprint(aw,d,bw)", "######### A. Playing with Dice\r\n\r\na, b = map(int, input().split())\r\n\r\nwin_a = 0\r\nwin_b = 0\r\ndraw = 0\r\n\r\nfor x in range(1, 7):\r\n diff_a = abs(a-x)\r\n diff_b = abs(b-x)\r\n\r\n if diff_a < diff_b:\r\n win_a += 1\r\n elif diff_b < diff_a:\r\n win_b += 1\r\n elif diff_a == diff_b:\r\n draw += 1\r\n\r\nprint(win_a, draw, win_b)", "a,b=map(int,input().split())\r\nf=0\r\ns=0\r\nt=0\r\nfor i in range(1,7):\r\n c=abs(i-a)\r\n d=abs(i-b)\r\n if c==d:\r\n t=t+1\r\n elif c<d:\r\n f=f+1\r\n else:\r\n s=s+1\r\nprint(f,t,s)\r\n \r\n \r\n ", "x = input()\nx, y = int(x[0]), int(x[2])\nr1 = 0\nr2 = 0\nr3 = 0\n\n\nfor i in range(1,7):\n if abs(x - i) < abs(y - i):\n r1 += 1\n elif abs(y - i) < abs(x - i):\n r3 +=1\n else:\n r2 +=1\nprint(r1, r2, r3)\n\t \t\t \t \t\t\t\t\t\t\t \t\t\t\t\t \t\t\t \t", "a,b=map(int,input().split())\r\ncount1=0\r\ncount2=0\r\ncount3=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n count1+=1\r\n elif abs(i-a)==abs(i-b):\r\n count2+=1\r\n else:\r\n count3+=1\r\nprint(count1,count2,count3)\r\n", "a, b = map(int, input().split())\r\nx = sum(abs(a-i) < abs(b-i) for i in range(1, 7))\r\ny=1-(a-b) % 2 + 5*(a == b)\r\nprint(x, y, 6-x-y)", "input_args = input() \na = int(input_args[0])\nb = int(input_args[2])\nwin_a = 0\nwin_b = 0\ndraw = 0\nfor i in range(6):\n if abs(i+1-a) < abs(i+1-b):\n win_a += 1\n elif abs(i+1-a) == abs(i+1-b):\n draw += 1\n else:\n win_b += 1\nprint(\"{} {} {}\".format(win_a, draw, win_b))\n\t \t\t\t\t \t\t\t\t\t\t\t \t\t \t\t \t \t \t\t", "def count_outcomes(a, b):\r\n first_player_wins = 0\r\n second_player_wins = 0\r\n draws = 0\r\n\r\n for x in range(1, 7):\r\n diff_from_a = abs(a - x)\r\n diff_from_b = abs(b - x)\r\n\r\n if diff_from_a < diff_from_b:\r\n first_player_wins += 1\r\n elif diff_from_a > diff_from_b:\r\n second_player_wins += 1\r\n else:\r\n draws += 1\r\n\r\n return first_player_wins, draws, second_player_wins\r\n\r\nif __name__ == \"__main__\":\r\n a, b = map(int, input().split())\r\n result = count_outcomes(a, b)\r\n print(*result)\r\n", "a,b=tuple(int(i) for i in input().split())\r\nwina=0\r\nwinb=0\r\ndraw=0\r\nfor i in range(1,7):\r\n if abs(i-a)<abs(i-b):\r\n wina+=1\r\n elif abs(i-a)>abs(i-b):\r\n winb+=1\r\n else:\r\n draw+=1\r\nprint(wina,draw,winb)", "def answer():\r\n a = [int(x) for x in input().split()]\r\n p1=a[0]\r\n p2=a[1]\r\n i=1\r\n c,d,e=0,0,0\r\n while i<=6:\r\n if abs(p1-i)<abs(p2-i):c+=1\r\n elif abs(p1-i)==abs(p2-i):d+=1\r\n else:\r\n e+=1\r\n i+=1\r\n print(str(c)+\" \"+str(d)+\" \"+str(e))\r\nanswer()", "# # RED CODER # #\r\nn, k = map(int, input().split())\r\nx = 0\r\ny = 0\r\nz = 0\r\nfor i in range(1, 7):\r\n if abs(n-i) < abs(k-i):\r\n x += 1\r\n elif abs(k-i) < abs(n-i):\r\n y += 1\r\n else:\r\n z += 1\r\nprint(x, z, y)\r\n", "import sys\n\ndice1, dice2 = map(int,sys.stdin.readline().strip().split())\n\nfirstWin = 0\nsecondWin = 0\nfor dice in range(1,6+1):\n first = abs(dice-dice1)\n second = abs(dice-dice2)\n if first<second:\n firstWin += 1\n elif second<first:\n secondWin += 1\nprint(firstWin,6-firstWin-secondWin,secondWin)", "a, b = map(int, input().split())\nawin, draw, bwin = 0,0,0\nfor i in range(1, 7):\n if abs(a-i) < abs(b-i): awin +=1\n elif abs(a-i) == abs(b-i): draw += 1\n else: bwin += 1\n\nprint(awin, draw, bwin)", "a,b=map(int,input().split())\r\ncnt=0\r\nfor i in range(1,7):\r\n\tif abs(a-i)<abs(b-i):\r\n\t\tcnt+=1\r\nprint(cnt,end=' ')\r\ncnt=0\r\nfor i in range(1,7):\r\n\tif abs(a-i)==abs(b-i):\r\n\t\tcnt+=1\r\nprint(cnt,end=' ')\r\ncnt=0\r\nfor i in range(1,7):\r\n\tif(abs(b-i)<abs(a-i)):\r\n\t\tcnt+=1\r\nprint(cnt)\r\n", "a,b = map(int,input().split())\nx=y=z=0\nfor i in range(1,7):\n\tif abs(a-i)< abs(b-i):x+=1\n\telif abs(a-i) == abs(b-i):y+=1\n\telse:z+=1\nprint(x,y,z)", "a, b = map(int, input().split())\r\n\r\nfirst_player_wins = 0\r\ndraw = 0\r\nsecond_player_wins = 0\r\n\r\nfor x in range(1, 7):\r\n dist_from_a = abs(a - x)\r\n dist_from_b = abs(b - x)\r\n \r\n if dist_from_a < dist_from_b:\r\n first_player_wins += 1\r\n elif dist_from_a > dist_from_b:\r\n second_player_wins += 1\r\n else:\r\n draw += 1\r\n\r\nprint(first_player_wins, draw, second_player_wins)", "a, b = map(int, input().split(' '))\nonew = 0\ndraw = 0\ntwow = 0\nfor i in range(1, 7):\n if abs(a - i) < abs(b - i):\n onew += 1\n elif abs(a - i) == abs(b - i):\n draw += 1\n elif abs(a - i) > abs(b - i):\n twow += 1\nprint(onew, draw, twow)\n\t \t \t\t \t \t\t\t \t\t\t \t \t \t \t\t", "# A. Playing with Dice\r\na,b=map(int,input().split())\r\nc1=0\r\nc2=0\r\nc3=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n c1+=1\r\n elif abs(a-i)>abs(b-i):\r\n c2+=1\r\n else:\r\n c3+=1\r\nprint(c1,c3,c2)\r\n\r\n ", "s=input()\r\ns=s.split()\r\na=int(s[0])\r\nb=int(s[1])\r\ni=1\r\nwon=0\r\nlost=0\r\ndraw=0\r\nwhile i<7:\r\n x=abs(a-i)\r\n y=abs(b-i)\r\n if x>y:\r\n won+=1\r\n elif x<y:\r\n lost+=1\r\n else:\r\n draw+=1\r\n i+=1\r\nprint(lost,draw,won)\r\n", "a, b = map(int, input().split())\r\n\r\nwin, lose, draw = 0, 0, 0\r\n\r\nfor i in range(1, 7):\r\n if (abs(a - i) < abs(b - i)):\r\n win += 1\r\n if (abs(a - i) > abs(b - i)):\r\n lose += 1\r\n if (abs(a - i) == abs(b - i)):\r\n draw += 1\r\n\r\nprint(win, draw, lose, end = ' ')\r\n ", "[a, b] = map(int, input().split())\r\ndice = [1, 2, 3, 4, 5, 6]\r\nfirstWins = 0\r\nsecondWins = 0\r\ndrawGame = 0\r\n\r\nfor x in dice:\r\n if abs(a-x) > abs(b-x): \r\n secondWins = secondWins + 1\r\n elif abs(a-x) < abs(b-x): \r\n firstWins = firstWins + 1\r\n else: \r\n drawGame = drawGame + 1\r\n \r\nprint(firstWins, drawGame, secondWins)", "a, b = [int(x) for x in input().split()]\na_win = 0\nb_win = 0\ntie = 0\nfor i in range(1, 7):\n if abs(i-a) < abs(i-b):\n a_win += 1\n elif abs(i-a) > abs(i-b):\n b_win +=1\n else:\n tie +=1\nprint(a_win, tie, b_win)\n\t \t\t \t\t\t \t\t\t \t \t \t \t \t \t", "a, b = map(int, input().split())\r\nawin = 0\r\ndraw = 0\r\nbwin = 0\r\n\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i):\r\n awin += 1\r\n elif abs(a-i) > abs(b-i):\r\n bwin += 1\r\n else:\r\n draw += 1\r\n \r\nprint(awin, draw, bwin)", "[a,b]=map(int,input().split())\r\nawin=0\r\nbwin=0\r\ndraw=0\r\nif abs(a-1)<abs(b-1):\r\n awin=awin+1\r\nelif abs(a-1)>abs(b-1):\r\n bwin=bwin+1\r\nelse:\r\n draw=draw+1\r\nif abs(a-2)<abs(b-2):\r\n awin=awin+1\r\nelif abs(a-2)>abs(b-2):\r\n bwin=bwin+1\r\nelse:\r\n draw=draw+1\r\nif abs(a-3)<abs(b-3):\r\n awin=awin+1\r\nelif abs(a-3)>abs(b-3):\r\n bwin=bwin+1\r\nelse:\r\n draw=draw+1\r\nif abs(a-4)<abs(b-4):\r\n awin=awin+1\r\nelif abs(a-4)>abs(b-4):\r\n bwin=bwin+1\r\nelse:\r\n draw=draw+1\r\nif abs(a-5)<abs(b-5):\r\n awin=awin+1\r\nelif abs(a-5)>abs(b-5):\r\n bwin=bwin+1\r\nelse:\r\n draw=draw+1\r\nif abs(a-6)<abs(b-6):\r\n awin=awin+1\r\nelif abs(a-6)>abs(b-6):\r\n bwin=bwin+1\r\nelse:\r\n draw=draw+1\r\nprint(awin,draw,bwin)", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\ta, b = map(int, input().split())\r\n\t\tfirst = 0; draw = 0; second = 0\r\n\r\n\t\tfor j in range(1, 7):\r\n\t\t\tif abs(a - j) < abs(b - j):\r\n\t\t\t\tfirst += 1\r\n\t\t\telif abs(a - j) > abs(b - j):\r\n\t\t\t\tsecond += 1 \r\n\t\t\telse:\r\n\t\t\t\tdraw += 1\r\n\r\n\t\tprint(\"{} {} {}\".format(first, draw, second))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "a,b=[int(i) for i in input().split()]\r\nnaw=0\r\nnd=0\r\nnbw=0\r\nfor i in range(1,7):\r\n c=abs(a-i)\r\n d=abs(b-i)\r\n if c<d:\r\n naw+=1\r\n elif d<c:\r\n nbw+=1\r\n elif c==d:\r\n nd+=1\r\nprint(naw,nd,nbw)\r\n", "if __name__ == '__main__':\r\n\ta, b = [int(i) for i in input().split()]\r\n\taWins, bWins, draws = 0, 0, 0\r\n\tfor x in range(1, 7):\r\n\t\tif abs(a - x) < abs(b - x): aWins += 1\r\n\t\telif abs(a - x) > abs(b - x): bWins += 1\r\n\t\telse: draws += 1\r\n\tprint(aWins, draws, bWins)", "o,t=(input().split())\r\na=int(o)\r\nb=int(t)\r\nc=d=e=0\r\nfor i in range(1,7):\r\n if abs(a-i)<abs(b-i):\r\n c=c+1\r\n elif abs(a-i)==abs(b-i):\r\n d=d+1\r\n elif abs(a-i)>abs(b-i):\r\n e=e+1\r\nprint(c,d,e)\r\n \r\n ", "a, b = map(int, input().split())\r\nwins_a = wins_b = draws = 0\r\nfor i in range(1, 7):\r\n diff_a = abs(i - a)\r\n diff_b = abs(i - b)\r\n if diff_a == diff_b:\r\n draws += 1\r\n elif diff_a < diff_b:\r\n wins_a += 1\r\n else:\r\n wins_b += 1\r\nprint(wins_a, draws, wins_b)", "n,m=map(int,input().split())\r\nw=0\r\nd=0\r\nl=0\r\nfor i in range(1,7):\r\n if abs(n-i)<abs(m-i):\r\n w+=1\r\n elif abs(n-i)==abs(m-i):\r\n d+=1\r\n else:\r\n l+=1\r\nprint(w,d,l)\r\n \r\n", "a, b = map(int, input().split())\r\none, dra, two = 0, 0, 0\r\nfor i in range(1, 7):\r\n s1, s2 = abs(i - a), abs(i - b)\r\n if s1 == s2: dra += 1\r\n elif s1 < s2: one += 1\r\n else: two += 1\r\nprint(f'{one} {dra} {two}')", "s = input()\r\n\r\na,b = s.split()\r\n\r\nsample = [x for x in range(1,7) if (x!= int(a)) and (x!= int(b))]\r\n\r\n\r\ntimea = 0\r\ntimeb = 0\r\ndraw = 0\r\n\r\nfor x in sample:\r\n if abs(x-int(a)) < abs(x-int(b)):\r\n timea += 1\r\n elif abs(x-int(a)) > abs(x-int(b)):\r\n timeb += 1\r\n\r\n else :\r\n draw += 1\r\n\r\n\r\nif int(a) == int(b) :\r\n draw += 1\r\nelse:\r\n timea += 1\r\n timeb += 1\r\n\r\nprint (timea , draw , timeb)\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "a, b = [int(x) for x in input().split(' ')]\nw, d, l = 0, 0, 0\nfor i in range(1, 7):\n if abs(a - i) < abs(b - i): w += 1\n elif abs(a - i) > abs(b - i): l += 1\n else: d += 1\nprint(w, d, l)\n", "itog = [0, 0, 0]\r\na, b = list(map(int,input().split()))\r\nfor i in range(1, 7):\r\n x = abs(a - i)\r\n y = abs(b - i)\r\n if x < y:\r\n itog[0] += 1\r\n elif x == y:\r\n itog[1] += 1\r\n else:\r\n itog[2] += 1\r\nprint(*itog)", "m,n=map(int,input().split())\r\na=0\r\nb=0\r\nd=0\r\nfor i in range(1,7):\r\n if(abs(i-m)<abs(i-n)):\r\n a+=1\r\n elif(abs(i-m)>abs(i-n)):\r\n b+=1\r\n else:\r\n d+=1\r\nprint(a,d,b)\r\n \r\n ", "a,b=map(int,input().split())\r\nx=y=z=0\r\nfor i in range(1,7):\r\n temp=abs(a-i)-abs(b-i);x+=temp<0;y+=temp==0;z+=temp>0\r\nprint(x,y,z)", "a,b = (int(s) for s in input().split())\n\nawins,bwins,ties = 0,0,0\n\nfor roll in range(1,7):\n if abs(a - roll) < abs(b - roll):\n awins +=1\n elif abs(a - roll) > abs(b - roll):\n bwins +=1\n else:\n ties +=1\n \nprint(awins,ties,bwins)\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\na_win=b_win=draw=0\r\ni=6\r\n\r\nwhile i:\r\n if abs(i-a)<abs(i-b):\r\n a_win=a_win+1\r\n elif abs(i-a)>abs(i-b):\r\n b_win=b_win+1\r\n else:\r\n draw=draw+1\r\n i=i-1\r\n \r\nprint(a_win,draw,b_win)", "n,m=map(int,input().split())\nnn=0;mm=0;d=0\nfor i in range(1,7):\n if abs(i-n)>abs(i-m):\n mm+=1\n elif abs(i-n)<abs(i-m):\n nn+=1\n else:\n d+=1\nprint(nn,d,mm)\n \t\t\t\t \t\t \t \t \t \t\t", "a_win = 0\nb_win = 0\nboth_win = 0\n\ndef whocloser(a,b,x):\n\n global a_win\n global b_win \n global both_win\n\n if abs(a-x) < abs(b-x):\n a_win = a_win + 1\n elif abs(a-x) > abs(b-x):\n b_win = b_win + 1\n elif abs(a-x) == abs(b-x):\n both_win = both_win + 1\n \ninput = input(\"\")\ninsert = input.split(\" \")\n\nwhocloser(int(insert[0]),int(insert[1]),1)\nwhocloser(int(insert[0]),int(insert[1]),2)\nwhocloser(int(insert[0]),int(insert[1]),3)\nwhocloser(int(insert[0]),int(insert[1]),4)\nwhocloser(int(insert[0]),int(insert[1]),5)\nwhocloser(int(insert[0]),int(insert[1]),6)\n\nprint(str(a_win) + \" \" + str(both_win) + \" \" + str(b_win))\n \t\t\t\t \t \t\t \t\t \t \t \t\t \t\t\t\t", "def solve():\n a, b = [int(i) for i in input().split()]\n first, draw, second = 0, 0, 0 \n \n for i in range(1, 7):\n if abs(i - a) == abs(i - b):\n draw += 1\n \n elif abs(i - a) > abs(i - b):\n second += 1\n \n else:\n first += 1 \n \n print(first, draw, second)\n \n \n\nsolve()", "result = [0]*3\r\na, b = map(int, input().split())\r\nfor dice in range(1,7):\r\n if (abs(dice-a) < abs(dice-b)):\r\n result[0] += 1\r\n elif (abs(dice-a) > abs(dice-b)):\r\n result[2] += 1\r\n else:\r\n result[1] += 1 \r\nprint(*result)", "a , b = [int(x) for x in input().split()]\r\nl = [0] * 3\r\nfor i in range(1,7):\r\n if abs(a-i) < abs(b-i): l[0] += 1\r\n if abs(a-i) == abs(b-i): l[1] += 1\r\n if abs(a-i) > abs(b-i): l[2] += 1\r\nprint(*l)\r\n\r\n ", "a,b = list(map(int,input().split()))\nfw = dr = sw = 0\nfor i in range(1,7):\n if abs(a-i)<abs(b-i):\n fw += 1\n elif abs(a-i) == abs(b-i):\n dr += 1\n else:\n sw += 1\nprint(fw,dr,sw) \n \n \t \t \t \t\t\t \t \t", "\na, b = [int(i) for i in input().split()]\n\nconta = 0\ncontb = 0\ncontd = 0\nfor i in range(1,7):\n if (abs(a-i)<abs(b-i)):\n conta += 1\n elif (abs(a-i)>abs(b-i)):\n contb += 1 \n elif (abs(a-i)==abs(b-i)):\n contd += 1\n\nprint(conta, contd, contb)", "#!/usr/bin/pyhton\n\nline = input()\na, b = line.split()\na = int(a)\nb = int(b)\n\nwin, draw, lose = 0, 0, 0\nfor i in range(1, 7):\n if abs(i - a) < abs(i - b):\n win += 1\n elif abs(i - a) == abs(i - b):\n draw += 1\n else:\n lose += 1\nprint(win, draw, lose)\n \t \t \t\t \t \t \t \t\t \t\t", "import math;a,b=map(int,input().split());f=max(b,a)-min(a,b)-1;d=min(a,b)+f//2;e=7-max(a,b)+f//2;m=([0,6,0] if a==b else [d,math.ceil(f/2)-f//2,e]);print(*(m if a<=b else m[::-1]))", "a,b=map(int,input().split())\r\na1=0\r\nb1=0\r\nd=0\r\nfor i in range(1,7):\r\n if(abs(i-a)<abs(i-b)):\r\n a1+=1\r\n elif(abs(i-a)>abs(i-b)):\r\n b1+=1\r\n else:\r\n d+=1\r\nprint(a1,d,b1)\r\n", "a, b = map(int, input().split())\r\nkol = [0,0,0]\r\nfor i in range(1, 7):\r\n if(abs(a-i) < abs(b-i)):\r\n kol[0] += 1\r\n elif(abs(a-i) == abs(b-i)):\r\n kol[1] += 1\r\n else:\r\n kol[2] += 1\r\nfor i in kol:\r\n print(i, end = ' ')", "a,b=map(int,input().split())\r\ncounta=0\r\ncountd=0\r\ncountb=0\r\nfor x in range(1,7):\r\n if(abs(a-x)<abs(b-x)):\r\n counta+=1\r\n elif(abs(a-x)==abs(b-x)):\r\n countd+=1\r\n else:\r\n countb+=1\r\nprint(counta,countd,countb)", "a,b=map(int,input().split(\" \"))\r\naw,dr,bw=0,0,0\r\nfor j in range(1,7):\r\n if abs(a-j)<abs(b-j):\r\n aw+=1\r\n elif abs(a-j)>abs(b-j):\r\n bw+=1\r\n else:\r\n dr+=1\r\nprint(aw,dr,bw)\r\n ", "x,y = map(int, input().split())\nwin0,draw,win1 = 0,0,0\n\nfor i in range(1,7):\n if(abs(x-i)<abs(y-i)):\n win0+=1\n elif(abs(x-i)>abs(y-i)):\n draw+=1\n else:\n win1+=1\nprint(win0,win1,draw)\n\t \t \t \t\t \t \t\t\t \t \t", "a,b = map(int,input().split())\r\n# 1 2 3 4 5 6\r\nm = 0\r\no = 0\r\nn = 0\r\nfor x in range(1,6+1) :\r\n if abs(a-x)<abs(b-x) :\r\n m += 1\r\n elif abs(a-x)>abs(b-x) :\r\n n += 1\r\n else :\r\n o += 1\r\nprint(m,o,n)", "a,b=map(int,input().split())\r\nx,y,z=0,0,0\r\nj=[1,2,3,4,5,6]\r\nfor i in range(0,6):\r\n\tda=abs(j[i]-a)\r\n\tdb=abs(j[i]-b)\r\n\tif da==db:\r\n\t\ty+=1\r\n\telif da<db:\r\n\t\tx+=1\r\n\telse:\r\n\t\tz+=1\r\nprint(x,y,z)", "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\na,b=get_line()\r\na1,a2,a3=0,0,0\r\nfor i in range(1,7):\r\n t1=abs(i-a)\r\n t2=abs(i-b)\r\n if t1<t2:\r\n a1+=1\r\n elif t1>t2:\r\n a3+=1\r\n else:\r\n a2+=1\r\nprint(a1,a2,a3)\r\n", "a, b = (int(el) for el in input().split())\r\nx = [abs(el + 1 - a) for el in range(6)]\r\ny = [abs(el + 1 - b) for el in range(6)]\r\n\r\nq, w, r = 0, 0, 0\r\nfor el in range(6):\r\n #print(x[el], y[el])\r\n if x[el] < y[el]:\r\n q += 1\r\n elif x[el] > y[el]:\r\n r += 1\r\n else:\r\n w += 1\r\n \r\nprint(q, w, r)", "a, b = map(int, input().split())\r\ndice = [1, 2, 3, 4, 5, 6]\r\nwin_first, win_last, draw = 0, 0, 0\r\nfor i in dice:\r\n if abs(a-i) < abs(b-i):\r\n win_first += 1\r\n elif abs(a-i) > abs(b-i):\r\n win_last += 1\r\n else:\r\n draw += 1\r\n\r\nprint(win_first, draw, win_last)", "a,b=map(int,input().split())\nx,y,z=0,0,0\nfor i in range (1,7):\n n=abs(a-i)\n m=abs(b-i)\n if n==m:\n y+=1\n elif n<m:\n x+=1\n else:\n z+=1\nprint(x,y,z)", "a,b=map(int,input().split())\r\nl=[0]*3\r\nfor i in range(1,7):\r\n l[0if abs(a-i)<abs(b-i)else 2if abs(a-i)>abs(b-i)else 1]+=1\r\nprint(*l)", "a, b = map(int, input().split())\naWinningProb, drawProb, bWinningProb = 0, 0, 0\nfor i in range(1, 7):\n if abs(a-i) == abs(b-i):\n drawProb += 1\n elif abs(a-i) < abs(b-i):\n aWinningProb += 1\n else:\n bWinningProb += 1\nprint(str(aWinningProb)+\" \"+str(drawProb)+\" \"+str(bWinningProb))\n" ]

[ "import io\nimport os\n\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\n\ndef solve():\n n = int(input())\n blacks = []\n whites = []\n for i in range(n):\n ci, si = map(int, input().split())\n if ci == 0:\n whites.append((i, si))\n else:\n blacks.append((i, si))\n\n edges = []\n blacks_first = blacks[0][0]\n whites_first = whites[0][0]\n while blacks and whites:\n black_i, black_w = blacks.pop()\n white_i, white_w = whites.pop()\n m = min(black_w, white_w)\n black_w -= m\n white_w -= m\n edges.append((black_i, white_i, m))\n if black_w:\n blacks.append((black_i, black_w))\n else:\n whites.append((white_i, white_w))\n if blacks:\n blacks.pop()\n while blacks:\n black_i, _ = blacks.pop()\n edges.append((black_i, whites_first, 0))\n if whites:\n whites.pop()\n while whites:\n white_i, _ = whites.pop()\n edges.append((white_i, blacks_first, 0))\n for u, v, w in edges:\n print(u+1, v+1, w)\n\n\nt = 1\n\nfor _ in range(t):\n solve()\n" ]

[ "s = input()\r\nt = input()\r\nd, u = set(), set()\r\nfor i in range(len(s)):\r\n mn, mx = min(s[i], t[i]), max(s[i], t[i])\r\n if (s[i] in u or t[i] in u) and (mn, mx) not in d:\r\n print(-1)\r\n exit()\r\n u.add(s[i])\r\n u.add(t[i])\r\n d.add((mn, mx))\r\n\r\nres = [x for x in d if x[0] != x[1]]\r\nprint(len(res))\r\nfor i in res:\r\n print(*i)\r\n", "s = input()\r\nt = input()\r\nw1, w2 = set(), set()\r\nfor i in range(len(s)):\r\n l1, l2 = min(s[i], t[i]), max(s[i], t[i])\r\n if (s[i] in w2 or t[i] in w2) and (l1, l2) not in w1:\r\n print(-1)\r\n exit()\r\n else:\r\n w2.add(s[i])\r\n w2.add(t[i])\r\n w1.add((l1, l2))\r\nresult = [elem for elem in w1 if elem[0] != elem[1]]\r\nprint(len(result))\r\nfor elem in result:\r\n print(*elem)\r\n\r\n", "dict = {}\r\nl = []\r\no = input()\r\ns = input()\r\nfor i in range(len(o)):\r\n if o[i]==s[i]:\r\n if o[i] not in l:\r\n if o[i] not in dict.keys() and o[i] not in dict.values():\r\n l.append(o[i])\r\n else:\r\n print(\"-1\")\r\n exit()\r\n else:\r\n if o[i] in l or s[i] in l:\r\n print(\"-1\")\r\n exit()\r\n elif o[i] in dict.keys():\r\n if dict[o[i]] != s[i]:\r\n print(\"-1\")\r\n exit()\r\n elif s[i] in dict.keys():\r\n if dict[s[i]] != o[i]:\r\n print(\"-1\")\r\n exit()\r\n elif s[i] in dict.values() or o[i] in dict.values():\r\n print(\"-1\")\r\n exit()\r\n else:\r\n dict[o[i]]=s[i]\r\nprint(len(dict))\r\nfor c in dict.keys():\r\n print(c,dict[c])", "s = input()\r\nt = input()\r\nw1 = set()\r\nw2=set()\r\nfifa=0\r\nfor i in range(len(s)):\r\n l1 = min(s[i],t[i])\r\n l2 = max(s[i], t[i])\r\n if (s[i] in w2 or t[i] in w2) and (l1, l2) not in w1:\r\n fifa=-1\r\n break\r\n else:\r\n w2.add(s[i])\r\n w2.add(t[i])\r\n w1.add((l1, l2))\r\nresult=[0]*len(s)\r\ncount=0\r\nif fifa==-1:\r\n print (-1)\r\nelse:\r\n for k in w1:\r\n if k[0] !=k[1]:\r\n count+=1\r\n print (count)\r\n for i in w1:\r\n if i[0] !=i[1]:\r\n print (i[0],i[1])", "from collections import defaultdict as dc\r\ncheck=dc(lambda:set())\r\nmp=dict()\r\ns1=input()\r\ns2=input()\r\nflag=0\r\nfor i in range(len(s1)):\r\n check[s1[i]].add(s2[i])\r\n check[s2[i]].add(s1[i])\r\n if s1[i]==s2[i]:continue\r\n if s2[i] in mp:continue\r\n else:mp[s1[i]]=s2[i]\r\nfor i in check:\r\n if len(check[i])>1:flag=-1\r\nif flag:print(-1)\r\nelse:\r\n print(len(mp))\r\n for i in mp:print(i,mp[i])", "str1 = input()\r\nstr2 = input()\r\n\r\nalphas = 'abcdefghijklmnopqrstuvwxyz'\r\n\r\npaird = {}\r\nfor i in range(0, 26):\r\n paird[alphas[i]] = 0\r\n\r\nflag = 0\r\ncount = 0\r\nfor i in range(0, len(str1)):\r\n con = str1[i]\r\n mat = str2[i]\r\n if paird[con] == 0:\r\n paird[con] = mat\r\n if(con!=mat): count+=1\r\n elif paird[con] == mat:\r\n pass\r\n else:\r\n flag = 1\r\n break\r\n if paird[mat] == 0:\r\n paird[mat] = con\r\n elif paird[mat] == con:\r\n pass\r\n else:\r\n flag = 1\r\n break\r\n\r\nif flag==0:\r\n print(count)\r\n considered = []\r\n for i in range(0, 26):\r\n if paird[alphas[i]]!=0 and paird[alphas[i]]!=alphas[i] and alphas[i] not in considered:\r\n print(alphas[i],paird[alphas[i]])\r\n considered.append(paird[alphas[i]])\r\nelse:\r\n print(-1)\r\n", "def main():\r\n abra, shacked = str(input()), str(input())\r\n dictionary = dict()\r\n for i in range(len(shacked)):\r\n if not (shacked[i] == abra[i]):\r\n if abra[i] in dictionary.values() and dictionary[abra[i]] != shacked[i]:\r\n print(-1)\r\n return\r\n dictionary[abra[i]] = shacked[i]\r\n dictionary[shacked[i]] = abra[i]\r\n \r\n making = ''\r\n for i in range(len(shacked)):\r\n if shacked[i] in dictionary.values():\r\n making += dictionary[shacked[i]]\r\n else:\r\n making += shacked[i]\r\n \r\n if making != abra:\r\n print(-1)\r\n return\r\n \r\n print(int(len(dictionary.keys()) / 2))\r\n for key in dictionary.values():\r\n if key < dictionary[key]:\r\n print(key, dictionary[key])\r\nmain()\r\n", "word1 = [str(i) for i in input()]\r\nword2 = [str(i) for i in input()]\r\nbackup = word1\r\nbackup2 = word2\r\nalready = []\r\nfinal_list = []\r\nbool = True\r\nfor x in range(len(word1)):\r\n if word1 == word2:\r\n print(0)\r\n bool = False\r\n break\r\n if word1[x] in already:\r\n continue\r\n else:\r\n if word1[x] == word2[x]:\r\n already.append(word1[x])\r\n else:\r\n baseline = word1[x]\r\n baseline2 = word2[x]\r\n increment = 0\r\n for letter in word1:\r\n if letter == baseline and word2[word1.index(letter)] == baseline2:\r\n increment += 1\r\n if increment == word1.count(baseline) and increment == word2.count(baseline2):\r\n final_list.append([baseline, baseline2])\r\n already.append(baseline)\r\n already.append(baseline2)\r\nfor y in range(len(final_list)):\r\n swapping_letters = final_list[y]\r\n for x in range(len(word1)):\r\n if backup2[x] == swapping_letters[0]:\r\n backup2.pop(x)\r\n backup2.insert(x, swapping_letters[1])\r\n elif backup2[x] == swapping_letters[1]:\r\n backup2.pop(x)\r\n backup2.insert(x, swapping_letters[0])\r\nif bool == True:\r\n if len(final_list) == 0 or backup2 != backup:\r\n print(-1)\r\n else:\r\n print(len(final_list))\r\n for item in final_list:\r\n print(\" \".join(item))\r\n", "pat = input()\r\ns = input()\r\nd = {}\r\nc = 0\r\nfor i in range(len(pat)):\r\n if pat[i] != s[i]:\r\n if pat[i] in d:\r\n if d[pat[i]] != s[i]:\r\n print(-1)\r\n break\r\n elif s[i] in d:\r\n if d[s[i]] != pat[i]:\r\n print(-1)\r\n break\r\n else:\r\n d[pat[i]] = s[i]\r\n d[s[i]] = pat[i]\r\n else:\r\n if pat[i] in d:\r\n if d[pat[i]] != s[i]:\r\n print(-1)\r\n break\r\n else:\r\n d[pat[i]] = s[i]\r\n c += 1\r\nelse:\r\n print((len(d) - c)//2)\r\n tmp = set()\r\n for key in d:\r\n if key != d[key] and key not in tmp and d[key] not in tmp:\r\n tmp.update([key,d[key]])\r\n print(key,d[key])", "\"\"\"\nhttps://codeforces.com/problemset/problem/748/B\n\"\"\"\na = input()\nb = input()\ndico = dict()\ndicoinv = dict()\ncorrect = True\nfor x, y in zip(a, b):\n if x not in dico:\n dico[x] = dico.get(x, [])\n if y not in dico[x]:\n dico[x].append(y)\n if len(dico[x])>1:\n correct=False\n break\n if y not in dicoinv:\n dicoinv[y] = dicoinv.get(y, [])\n if x not in dicoinv[y]:\n dicoinv[y].append(x)\n if len(dicoinv[y])>1:\n correct=False\n break\nif correct:\n for k, v in dico.items():\n z = v[0]\n if z in dico and list(dico[z])[0] != k:\n correct = False\n break\n \n \nif correct:\n for k, v in dicoinv.items():\n z = v[0]\n if z in dicoinv and list(dico[z])[0] != k:\n correct = False\n break\n\nif correct:\n res = []\n for k, v in dico.items():\n if k != v[0]:\n h = [k, v[0]]\n h.sort()\n if h not in res:\n res.append(h)\n print(len(res))\n for h in res:\n print(*h)\nelse:\n print(-1)\n", "s=input()\r\nt=input()\r\nif s==t:\r\n print(0)\r\nelse:\r\n p=[]\r\n w=[]\r\n n=len(s)\r\n k=0\r\n for i in range(n):\r\n if s[i]!=t[i]:\r\n if s[i] in w or t[i] in w:\r\n print(-1)\r\n k=-1\r\n break\r\n if s[i]<t[i]:\r\n q=s[i]+t[i]\r\n else:\r\n q=t[i]+s[i]\r\n if not (q in p):\r\n for j in range(k):\r\n if (s[i] in p[j]) != (t[i] in p[j]):\r\n print(-1)\r\n k=-1\r\n break\r\n if k>-1:\r\n k+=1\r\n p.append(q)\r\n else:\r\n break\r\n else:\r\n f=True\r\n for j in range(k):\r\n if s[i] in p[j]:\r\n f=False\r\n if f:\r\n w.append(s[i])\r\n else:\r\n k=-1\r\n print(-1)\r\n break\r\n if k==-1:\r\n break\r\n if k>0:\r\n print(k)\r\n for i in range(k):\r\n s=p[i]\r\n print(s[0],s[1])\r\n", "s = input()\r\ns1 = input()\r\nd = {}\r\nf = True\r\nfor i in range(len(s)):\r\n \r\n if s[i] in d:\r\n if d[s[i]] != s1[i]:\r\n print(-1)\r\n f = False\r\n break\r\n if s1[i] in d:\r\n if d[s1[i]] != s[i]:\r\n print(-1)\r\n f = False\r\n break\r\n d[s[i]] = s1[i]\r\n d[s1[i]] = s[i]\r\nif f:\r\n ans = 0\r\n d1 = {}\r\n marked = {}\r\n for i in 'abcdefghijklmnopqrstuvwxyz':\r\n marked[i] = False\r\n for i in d:\r\n if not marked[i] and i != d[i]:\r\n marked[i] = True\r\n marked[d[i]] = True\r\n ans += 1\r\n d1[i] = d[i]\r\n print(ans)\r\n for i in d1:\r\n print(i,d1[i])", "A = input()\r\nE = input()\r\nc = dict()\r\nN = len(A)\r\nk = 0\r\npairs = set()\r\nfor i in range(N):\r\n s = A[i], E[i]\r\n\r\n if A[i] in c or E[i] in c:\r\n if c.get(A[i], None) != E[i] or c.get(E[i], None) != A[i]:\r\n print(-1)\r\n exit()\r\n elif A[i] != E[i]:\r\n pairs.add((E[i],A[i]))\r\n k += 1\r\n c[A[i]] = E[i]\r\n c[E[i]] = A[i]\r\nprint(k)\r\nfor p in pairs:\r\n print(\" \".join(map(str,p)))\r\n", "import sys\r\n\r\nstring1 = input()\r\nstring2 = input()\r\nst1 = []\r\nst2 = []\r\nchecked = []\r\nright = []\r\nfor i in range(len(string1)):\r\n a = []\r\n if string1[i] in checked and string2[i] not in checked:\r\n print('-1')\r\n sys.exit()\r\n if string1[i] not in checked and string2[i] in checked:\r\n print('-1')\r\n sys.exit()\r\n\r\n if string1[i] in right and string2[i] not in right:\r\n print('-1')\r\n sys.exit()\r\n if string1[i] not in right and string2[i] in right:\r\n print('-1')\r\n sys.exit()\r\n\r\n if string1[i] not in st1 and string1[i] not in st2:\r\n if string2[i] not in st1 and string2[i] not in st2:\r\n if string1[i] != string2[i]:\r\n checked.append(string1[i])\r\n checked.append(string2[i])\r\n st1.append(string1[i])\r\n st2.append(string2[i])\r\n else:\r\n right.append(string1[i])\r\n right.append(string2[i])\r\n if string1[i] == string2[i]:\r\n if string1[i] in st1 or string1[i] in st2:\r\n print('-1')\r\n sys.exit()\r\n elif string2[i] in st1 or string2[i] in st2:\r\n print('-1')\r\n sys.exit()\r\n if string1[i] in st2:\r\n if st1[st2.index(string1[i])] != string2[i]:\r\n print('-1')\r\n sys.exit()\r\n if string1[i] in right or string2[i] in right:\r\n if string1[i] != string2[i]:\r\n print('-1')\r\n sys.exit()\r\nprint(len(st1))\r\nfor i in range(len(st1)):\r\n print(st1[i], end=\" \")\r\n print(st2[i])\r\n", "string1 = input().lower()\r\nstring2 = input().lower()\r\ncounter = 0\r\ncan_i_continue = True\r\nresult = None\r\ndata = {}\r\nwhile can_i_continue and counter < len(string1):\r\n letter1 = string1[counter]\r\n letter2 = string2[counter]\r\n current1 = data.get(letter1, 0)\r\n current2 = data.get(letter2, 0)\r\n if current1 != 0 and data[current1] != current2:\r\n result = -1\r\n break\r\n if current2 != 0 and data[current2] != current1:\r\n result = -1\r\n break\r\n data[letter1] = letter2\r\n data[letter2] = letter1\r\n counter += 1\r\nif result is None:\r\n new_data = []\r\n for key in data:\r\n if data[key] != key:\r\n if not ((min(key, data[key]),max(key, data[key])) in new_data):\r\n new_data.append((min(key, data[key]),max(key, data[key])))\r\n print(len(new_data))\r\n for item in new_data:\r\n print(item[0], item[1])\r\nelse:\r\n print(-1)\r\n \r\n", "#\r\n# Created by Daniil Kozhanov. All rights reserved.\r\n# January 2017\r\n\r\ns = input()\r\nt = input()\r\nn = len(s)\r\nsz = {}\r\nans = 0\r\ntans = []\r\n\r\nfor i in range(n):\r\n try:\r\n if sz[s[i]] != t[i]:\r\n ans = -1\r\n break\r\n except KeyError:\r\n sz[s[i]] = t[i]\r\n\r\n try:\r\n if sz[t[i]] != s[i]:\r\n ans = -1\r\n break\r\n except KeyError:\r\n sz[t[i]] = s[i]\r\n\r\nif ans == -1:\r\n print(ans)\r\nelse:\r\n for el in list(sz.items()):\r\n if el[0] != el[1]:\r\n if el[0] not in tans:\r\n tans.append(el[0])\r\n tans.append(el[1])\r\n ans = len(tans) // 2\r\n print(ans)\r\n for i in range(0, len(tans), 2):\r\n print(tans[i], tans[i+1])\r\n", "import operator\r\nimport itertools\r\n\r\n\r\ndef main():\r\n a, b = input(), input()\r\n ps = set(zip(a, b))\r\n ps = set(map(lambda p: (min(p), max(p)), ps))\r\n good = set(map(operator.itemgetter(0), filter(lambda p: p[0] == p[1], ps)))\r\n ps = set(filter(lambda p: p[0] != p[1], ps))\r\n bad = set(itertools.chain(*ps))\r\n if len(bad) != 2 * len(ps) or len(bad.intersection(good)):\r\n print('-1')\r\n return\r\n print(len(ps))\r\n for p in ps:\r\n print(p[0], p[1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def Main(s,t):\r\n n = len(s)\r\n M = {}\r\n\r\n for i in range(n):\r\n if M.get(s[i],t[i]) != t[i] or M.get(t[i], s[i]) != s[i]:\r\n return -1\r\n\r\n M [ s[i] ] = t[i]\r\n M [ t[i] ] = s[i]\r\n\r\n # print(M)\r\n\r\n # print(M)\r\n return M\r\n\r\n\r\n\r\n\r\n'''\r\nhelloworld\r\nehoolwlroz\r\n'''\r\n\r\nif __name__ == '__main__':\r\n M = Main(input() ,input())\r\n if M == -1 :\r\n print(-1)\r\n else:\r\n M = list((c, M[c]) for c in M if c<M[c])\r\n print(len(M))\r\n for x in M:\r\n print(*x)", "s = input()\nt = input()\nword_dict = dict()\nn = len(s)\ncounting = 0\nfor i in range(n):\n if s[i] not in word_dict:\n word_dict[s[i]] = t[i]\n else:\n if word_dict[s[i]] != t[i]:\n print(-1)\n break\n if t[i] not in word_dict:\n word_dict[t[i]] = s[i]\n else:\n if word_dict[t[i]] != s[i]:\n print(-1)\n break\nelse:\n used_letters = set()\n for key in word_dict:\n if key < word_dict[key]:\n used_letters.add(key)\n counting += 1\n print(counting)\n for i in used_letters:\n print(i, word_dict[i])", "s = input()\nt = input()\n\nimport sys\n\nsol = []\nfor i in range(len(s)):\n\tx = [s[i], t[i]]\n\tx.sort()\n\tif x not in sol:\n\t\tput = True\n\t\tfor k in range(len(sol)):\n\t\t\tif s[i] in sol[k] or t[i] in sol[k]:\n\t\t\t\tput = False\n\t\t\t\tprint(-1)\n\t\t\t\tsys.exit()\n\t\tif put:\n\t\t\tsol += [x]\n\nfor i in range(len(sol) - 1, -1, -1):\n\tif sol[i][0] == sol[i][1]:\n\t\tdel sol[i]\n\nprint(len(sol))\n\nif len(sol):\n\tprint('\\n'.join([' '.join(i) for i in sol]))\n", "s = input()\nt = input()\npes = set()\nyyy = set()\nll = 0\nfor i in range(len(s)):\n z = min(s[i], t[i])\n h = max(s[i], t[i])\n a = ord(z) * 1000 + ord(h)\n pes.add(a)\n if s[i] == t[i] and s[i] not in yyy:\n yyy.add(s[i])\n ll += 1\ndj = set()\nfor i in pes:\n dj.add(chr(i // 1000))\n dj.add(chr(i % 1000))\nif len(dj) == 2 * len(pes) - ll:\n ans=[]\n for i in pes:\n if chr(i // 1000) != chr(i % 1000):\n ans.append([chr(i // 1000), chr(i % 1000)])\n print(len(ans))\n for i in ans:\n print(i[0], i[1])\n exit(0)\nprint(-1)", "pairs, letters = set(), set()\r\n\r\nfor ch1, ch2 in zip(input(), input()):\r\n if {ch1, ch2} & letters:\r\n if not {(ch1, ch2), (ch2, ch1)} & pairs:\r\n print(-1)\r\n break\r\n else:\r\n pairs, letters = pairs | {(ch1, ch2)}, letters | {ch1, ch2}\r\nelse:\r\n pairs = {(ch1, ch2) for ch1, ch2 in pairs if ch1 != ch2}\r\n print(len(pairs))\r\n for ch1, ch2 in pairs:\r\n print(ch1, ch2)", "def solve(s, t):\r\n\tn=len(s)\r\n\tM={}\r\n\tfor i in range(n):\r\n\t\tif M.get(s[i], t[i])!=t[i] or M.get(t[i], s[i])!=s[i]:\r\n\t\t\treturn -1\r\n\t\tM[ s[i] ]=t[i]\r\n\t\tM[ t[i] ]=s[i]\r\n\treturn M\r\nM=solve(input(), input())\r\nif M==-1:\r\n\tprint(-1)\r\nelse:\r\n\tM=list((c, M[c]) for c in M if c<M[c])\r\n\tprint(len(M))\r\n\tfor x in M:\r\n\t\tprint(*x)", "s=input()\r\nt=input()\r\nvisited=set()\r\narray=[]\r\nans=[]\r\nk=0\r\nfor i in range(len(s)):\r\n a=s[i] in visited\r\n b=t[i] in visited\r\n if not a and not b:\r\n visited.add(s[i])\r\n visited.add(t[i])\r\n array.append(s[i]+t[i])\r\n k+=1\r\n if s[i]!=t[i]:\r\n ans.append(k-1)\r\n elif a and b:\r\n if s[i]+t[i] in array or t[i]+s[i] in array:\r\n continue\r\n else:\r\n print(-1)\r\n exit(0)\r\n else:\r\n print(-1)\r\n exit(0)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(array[i][0]+' '+array[i][1])", "s, t = input(), input()\r\ndict = {}\r\nfor i in range(len(s)):\r\n if s[i] in dict:\r\n if dict[s[i]] is not t[i]:\r\n print(-1)\r\n exit()\r\n else:\r\n dict[s[i]] = t[i]\r\n\r\n if t[i] in dict:\r\n if dict[t[i]] is not s[i]:\r\n print(-1)\r\n exit()\r\n else:\r\n dict[t[i]] = s[i]\r\n\r\ndic = {}\r\nres = {}\r\nfor key, val in dict.items():\r\n if key in dic or val in dic or key == val:\r\n continue\r\n dic[key] = \"exist\"\r\n dic[val] = \"exist\"\r\n res[key] = val\r\n# print(dic)\r\nprint(len(res))\r\nfor key, val in res.items():\r\n print(key, val)\r\n", "#!/usr/bin/env python3\n\n\ndef solve():\n real = input()\n bugged = input()\n\n charmap = {}\n\n for i, c in enumerate(real):\n other_c = bugged[i]\n\n if c not in charmap and other_c not in charmap:\n charmap[c] = other_c\n charmap[other_c] = c\n else:\n if charmap.get(c) != other_c:\n return None\n if charmap.get(other_c) != c:\n return None\n return charmap\n\n\nif __name__ == '__main__':\n charmap = solve()\n if charmap is None:\n print(-1)\n else:\n charmap = {a: b for a, b in charmap.items() if ord(a) < ord(b)}\n print(len(charmap))\n for c in charmap:\n print(c, charmap[c])\n", "s1 = input()\r\ns2 = input()\r\nn = len(s1)\r\nd = dict()\r\nfor i in range(n):\r\n a = s1[i]\r\n b = s2[i]\r\n if b < a:\r\n a, b = b, a\r\n if a not in d and b not in d:\r\n d[a] = b\r\n d[b] = a\r\n elif (a in d and b not in d) or (a not in d and b in d):\r\n print(-1)\r\n break\r\n elif d[a] != b or d[b] != a:\r\n print(-1)\r\n break\r\nelse:\r\n ans = []\r\n for i in d.items():\r\n if i[0] < i[1]:\r\n ans.append((i[0], i[1]))\r\n print(len(ans))\r\n for elem in ans:\r\n print(*elem)\r\n", "s, t = input(), input()\nfr = set()\nk = dict()\nl = 0\nfor i in range(len(s)):\n fr.add(tuple(sorted([s[i], t[i]])))\n if s[i] in k:\n if k[s[i]] != t[i]:\n print(-1)\n exit()\n if t[i] in k:\n if k[t[i]] != s[i]:\n print(-1)\n exit()\n k[t[i]] = s[i]\n k[s[i]] = t[i]\nfor i in fr:\n if i[0] != i[1]:\n l += 1\ns1 = [i[0] for i in fr]\ns2 = [i[1] for i in fr]\nprint(l)\nfor i in fr:\n if i[0] != i[1]:\n print(i[0], i[1])", "s1=input()\r\ns2=input()\r\nd={}\r\nfor i in range(len(s1)) :\r\n if d.get(s1[i],-1)==-1 :\r\n if d.get(s2[i],-1)==-1 :\r\n d[s1[i]]=s2[i]\r\n d[s2[i]]=s1[i]\r\n else :\r\n print(-1)\r\n exit()\r\n else :\r\n if d[s1[i]]!=s2[i] or d.get(s2[i],-1)!=s1[i] :\r\n print(-1)\r\n exit()\r\nss=set()\r\nans=[]\r\nfor x in d :\r\n if d[x]!=x and x not in ss :\r\n ans.append(x+\" \"+d[x])\r\n ss.add(x)\r\n ss.add(d[x])\r\nprint(len(ans))\r\nfor x in ans :\r\n print(x)\r\n", "s,t = input(), input()\r\n \r\nd = set()\r\nu = set()\r\nfor i in range(len(s)):\r\n l1, l2 = min(s[i], t[i]), max(s[i], t[i])\r\n if (s[i] in u or t[i] in u) and (l1, l2) not in d:\r\n print(-1)\r\n exit()\r\n else:\r\n u.add(s[i])\r\n u.add(t[i])\r\n d.add((l1, l2))\r\n \r\nans = [x for x in d if x[0] != x[1]]\r\n \r\nprint(len(ans))\r\nfor a in ans:\r\n print(*a) \r\n \r\n", "a = input()\nb = input()\nflag = 1\nMap = {}\nout = []\nans = 0\nfor x,y in zip(a,b):\n\tif (x in Map.keys() and y not in Map.keys() or\n\t\ty in Map.keys() and x not in Map.keys()):\n\t\t\tflag = 0\n\t\t\tbreak\n\telif x in Map.keys():\n\t\tif Map[x] != y :\n\t\t\tflag = 0\n\t\t\tbreak\n\telse:\n\t\tMap[x] = y\n\t\tMap[y] = x\n\t\tif x != y:\n\t\t\tans += 1\nif flag == 0:\n\tprint(\"-1\")\nelse:\n\tprint(str(ans))\n\tfor j in range(26):\n\t\ti = chr(j+ord('a'))\n\t\tif i in Map.keys() and Map[i] != i and i not in out:\n\t\t\tprint( i + ' ' + Map[i])\n\t\t\tout.append(Map[i])", "x = input()\r\nx = x.strip()\r\n\r\nw = input()\r\nw = list(w.strip().split()[0])\r\n\r\npari = []\r\ncorrect = set()\r\n\r\npos = True\r\n\r\nfor i in range(len(w)):\r\n if w[i] == x[i]:\r\n correct.add(w[i])\r\n else:\r\n if (w[i] in correct) or (x[i] in correct):\r\n pos = False\r\n break\r\n else:\r\n a = w[i]\r\n b = x[i]\r\n pari.append((a, b))\r\n correct.add(a)\r\n correct.add(b)\r\n for j in range(i, len(w)):\r\n if w[j] == a:\r\n w[j] = b\r\n elif w[j] == b:\r\n w[j] = a\r\n else:\r\n pass\r\n\r\nif pos:\r\n print(len(pari))\r\n for p in pari:\r\n print(' '.join(p))\r\nelse:\r\n print(-1)\r\n \r\n", "s = input()\r\nt = input()\r\nd1 = {}\r\nd2 = {}\r\nimp = False\r\nfor i in range(0, len(t)):\r\n if d1.get(s[i], '') != '' and d1[s[i]] != t[i]:\r\n imp = True\r\n break\r\n d1[s[i]] = t[i]\r\n if d2.get(t[i], '') != '' and d2[t[i]] != s[i]:\r\n imp = True\r\n break\r\n d2[t[i]] = s[i]\r\n\r\n\r\nfor e in d1:\r\n if d1.get(d1[e], '') != '' and d1.get(d1[e], '') != e:\r\n imp = True\r\n break\r\nif imp == True:\r\n print(-1)\r\nelse:\r\n swaps = []\r\n for e in d1:\r\n if d1[e] != d2[d1[e]]:\r\n if not (d1[e], d2[d1[e]]) in swaps and not (d2[d1[e]], d1[e]) in swaps:\r\n swaps.append( (d1[e], d2[d1[e]]))\r\n print(len(swaps))\r\n for e in swaps:\r\n print(e[0], e[1])\r\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ns = input()\r\nt = input()\r\nM = [set() for i in range(26)]\r\nfor i in range(len(s)):\r\n a = ord(s[i])-ord('a')\r\n b = ord(t[i])-ord('a')\r\n M[a].add(b)\r\n M[b].add(a)\r\n\r\nfor i in range(26):\r\n if len(M[i]) == 0:\r\n continue\r\n if len(M[i]) > 1:\r\n print('-1')\r\n exit(0)\r\n\r\nres = list()\r\nused = [0 for i in range(26)]\r\nfor i in range(26):\r\n if used[i] != 0:\r\n continue\r\n if len(M[i]) > 0:\r\n used[i] = 1\r\n d = list(M[i])[0]\r\n used[d] = 1\r\n if d != i:\r\n res.append([i, d])\r\nprint(len(res))\r\nfor x in res:\r\n a = chr(x[0]+ord('a'))\r\n b = chr(x[1]+ord('a'))\r\n print(' '.join(map(str, [a, b])))\r\n", "q=input()\r\nw=input()\r\nl=len(q)\r\na=[]\r\ns=[0 for i in range(0,130)]\r\nt=[]\r\nfor i in range(0,l):\r\n if q[i]==w[i]:\r\n t.append(q[i])\r\nfor i in range(0,l):\r\n if q[i]!=w[i]:\r\n a.append([q[i],w[i]])\r\n s[ord(q[i])]+=1\r\n s[ord(w[i])]+=1\r\n c=q[i]\r\n if (q[i] in t) | (w[i] in t):\r\n s[0]=10\r\n q=q.replace(q[i],w[i])\r\n w=w.replace(c,w[i])\r\nif max(s)>1:\r\n print(-1)\r\nelse:\r\n print(len(a))\r\n for i in a:\r\n print(i[0],i[1])\r\n", "s1 = input()\r\ns2 = input()\r\nused = ['$'] * 256\r\nfor i in range(len(s1)):\r\n c1 = s1[i]\r\n c2 = s2[i]\r\n if (c1 == c2):\r\n if (used[ord(c1)] == '$' or used[ord(c1)] == '%') and (used[ord(c2)] == '$' or used[ord(c2)] == '%'):\r\n used[ord(c1)] = '%'\r\n used[ord(c2)] = '%'\r\n else:\r\n print(-1)\r\n exit()\r\n else:\r\n if (used[ord(c1)] == '$' or used[ord(c1)] == c2) and (used[ord(c2)] == '$' or used[ord(c2)] == c1):\r\n used[ord(c1)] = c2\r\n used[ord(c2)] = c1\r\n else:\r\n print(-1)\r\n exit()\r\nans = []\r\nfor i in range(256):\r\n if (used[i] == '$' or used[i] == '%'):\r\n continue\r\n else:\r\n if ord(used[i]) < i:\r\n ans.append([used[i], chr(i)])\r\nprint(len(ans))\r\nfor elem in ans:\r\n print(elem[0], elem[1])\r\n", "def chk(l1, l2, known_keys):\n if l1 not in known_keys and l2 not in known_keys:\n known_keys[l1] = l2\n known_keys[l2] = l1\n elif (l1 in known_keys and known_keys[l1] != l2) or (l2 in known_keys and known_keys[l2] != l1):\n raise ValueError(\"bad kbd\")\n\ndef m():\n keys = {}\n s1 = input()\n s2 = input()\n try:\n for i in map(lambda x, y: chk(x, y, keys), s1, s2):\n pass\n except ValueError:\n print(-1)\n return\n k1 = list(filter(lambda x: ord(x) < ord(keys[x]), keys))\n print(len(k1))\n for k in k1:\n print(k, keys[k])\n\nif __name__ == \"__main__\":\n m()\n\n", "s1, s2 = input(), input()\r\nalph1, alph2 = [], set()\r\nans = 0\r\nfor i in range(len(s1)):\r\n fff = [max(s1[i], s2[i]), min(s1[i], s2[i])]\r\n ff = fff not in alph1\r\n if ff and (s1[i] in alph2 or s2[i] in alph2):\r\n ans = -1\r\n break\r\n elif ff:\r\n alph1.append(fff)\r\n if s1[i] != s2[i]:\r\n ans += 1\r\n alph2.add(s1[i])\r\n alph2.add(s2[i])\r\nprint(ans)\r\nif ans != -1:\r\n for i in range(len(alph1)):\r\n if alph1[i][0] != alph1[i][1]:\r\n print(alph1[i][0], alph1[i][1])", "s1, s2 = input(), input()\r\nn = len(s1)\r\nd = dict()\r\nfor i in range(n):\r\n a = s1[i]\r\n b = s2[i]\r\n if b < a:\r\n a, b = b, a\r\n if a not in d and b not in d:\r\n d[a] = b\r\n d[b] = a\r\n elif ((a in d and b not in d) or (a not in d and b in d)):\r\n print(-1)\r\n break\r\n elif d[a] != b or d[b] != a:\r\n print(-1)\r\n break\r\nelse:\r\n k = []\r\n for i in d.items():\r\n if i[0] < i[1]:\r\n k.append('{} {}'.format(i[0], i[1]))\r\n print(len(k))\r\n print(*k, sep='\\n')", "a = input()\r\nb = input()\r\nn = len(a)\r\nans = []\r\nmatch = {}\r\nflag = 0\r\nfor i in range(n):\r\n if a[i] in match:\r\n if match[a[i]] != b[i]:\r\n flag = 1\r\n break\r\n if b[i] in match:\r\n if match[b[i]] != a[i]:\r\n flag = 1\r\n break\r\n if a[i] != b[i] and a[i] not in match:\r\n ans.append(a[i] + ' ' + b[i])\r\n match[a[i]] = b[i]\r\n match[b[i]] = a[i]\r\nif flag == 1:\r\n print(-1)\r\nelse:\r\n print(len(ans))\r\n for x in ans:\r\n print(x)", "s = input()\r\nt = input()\r\n\r\npairs = set()\r\ngood = set()\r\nletters = set()\r\nfor i in range(len(s)):\r\n pair = tuple(sorted([s[i], t[i]]))\r\n if pair not in pairs:\r\n if s[i] not in letters and t[i] not in letters:\r\n pairs.add(pair)\r\n letters.add(s[i])\r\n letters.add(t[i])\r\n else:\r\n print(-1)\r\n exit()\r\n\r\npairs1 = set()\r\nfor pair in pairs:\r\n if pair[0] != pair[1]:\r\n pairs1.add(pair)\r\n\r\nprint(len(pairs1))\r\nfor pair in pairs1:\r\n print(pair[0], pair[1])\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\na=input()\r\nb=input()\r\nl=len(a)\r\n\r\nd=set()\r\nd2=set()\r\ndeg=dict()\r\n\r\n\r\nfor i in range(l):\r\n if a[i]==b[i]:\r\n d2.add(a[i])\r\n deg[a[i]]=0\r\n deg[b[i]]=0\r\n\r\n\r\nfor i in range(l):\r\n if a[i]!=b[i]:\r\n if a[i] in d2 or b[i] in d2:\r\n print(\"-1\")\r\n quit()\r\n \r\n if (not (a[i],b[i]) in d and not (b[i],a[i]) in d):\r\n d.add((a[i],b[i]))\r\n\r\n deg[a[i]]+=1\r\n deg[b[i]]+=1\r\n \r\nfor i in d:\r\n if deg[i[0]]>1 or deg[i[1]]>1:\r\n print(\"-1\")\r\n quit()\r\n\r\nprint(len(d))\r\n\r\nfor i in d:\r\n print(str(i[0]),'',str(i[1]))\r\n ", "p=input()\r\nq=input()\r\na={}\r\nfor i in range(0,len(p)):\r\n if p[i]!=q[i]:\r\n if q[i] not in a.keys() and p[i] not in a.keys():\r\n a[q[i]]=p[i]\r\n c=q[i]\r\n q=q.replace(c,':')\r\n q=q.replace(p[i],c)\r\n q=q.replace(':',p[i])\r\n elif p[i] in a.keys():\r\n if a[p[i]]!=q[i]:\r\n break\r\n elif a[q[i]]!=p[i]:\r\n break\r\nif p==q:\r\n print(len(a.keys()))\r\n for key in a.keys():\r\n print(str(key)+\" \"+str(a[key]))\r\nelse:\r\n print(-1)\r\n \r\n \r\n \r\n", "s=str(input())\nt=str(input())\nkeys=[-1 for i in range(26)]\nu=[]\nb=0\ncount=0\nfor i in range(len(s)):\n l=ord(s[i])-97\n m=ord(t[i])-97\n if keys[l]==-1 and keys[m]==-1:\n keys[l]=m\n keys[m]=l\n if l!=m:\n count+=1\n u.append(min(l,m))\n elif keys[l]==m and keys[m]==l:\n continue\n else:\n print(-1)\n b=1\n break\nif b==0:\n print(count)\n for i in u:\n print(chr(i+97),chr(keys[i]+97))\n", "import math\ndef main():\n s = str(input())\n t = str(input())\n st_dict = dict()\n for i in range(len(t)):\n if s[i] != t[i]:\n if s[i] in st_dict.keys() and st_dict[s[i]] != t[i]:\n print(-1)\n return\n st_dict[s[i]] = t[i]\n st_dict[t[i]] = s[i]\n\n result = ''\n for i in range(len(t)):\n if t[i] in st_dict.keys():\n result += st_dict[t[i]]\n else:\n result += t[i]\n\n if result == s:\n print(int(len(st_dict.keys())/2))\n for key in st_dict.keys():\n if key > st_dict[key]:\n print('{} {}'.format(key, st_dict[key]))\n else:\n print(-1)\nmain()\n", "a=input()\r\nb=input()\r\nd = {}\r\nfor i,x in enumerate(a):\r\n y=b[i]\r\n if d.get(x)==None:d[x]=[]\r\n if d.get(y)==None:d[y]=[]\r\n d[x].append(y)\r\n d[y].append(x)\r\nres=0\r\nk=0\r\nfor i,x in enumerate(d):\r\n if len(set(d[x]))>1:print(-1);res=1;break\r\n if x!=d[x][0]:k+=1\r\ndi = {}\r\nif res==0:\r\n print(k//2)\r\n for i,x in enumerate(d):\r\n if x!=d[x][0]:\r\n if di.get(d[x][0])==None:print(x,*set(d[x]));di[x]=0", "def main():\n d = {}\n for a, b in zip(input(), input()):\n if d.get(a, b) != b or d.get(b, a) != a:\n print(-1)\n return\n d[a], d[b] = b, a\n res = ['%s %s' % (a, b) for a, b in d.items() if a < b]\n print(len(res))\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "alpha = 'abcdefghijklmnopqrstuvwxyz'\n\nkeymap = {ch: None for ch in alpha}\n\ns = input()\nt = input()\n\nis_swapped = True\n\narr = []\n\nfor si, ti in zip(s, t):\n if keymap[si] is None or keymap[ti] is None:\n if keymap[si] is None and keymap[ti] is None:\n keymap[si] = ti\n keymap[ti] = si\n if si != ti:\n arr.append((min(si, ti), max(si, ti)))\n else:\n is_swapped = False\n break\n elif not(keymap[si] == ti and keymap[ti] == si):\n is_swapped = False\n break\n\nif is_swapped:\n print(len(arr))\n for k, v in arr:\n print(k, v)\nelse:\n print(\"-1\")\n", "correct = input()\nincorrect = input()\nletters = dict()\nanswer = list()\n\n\ndef count():\n for letter_id in range(len(correct)):\n if correct[letter_id] not in letters:\n letters[correct[letter_id]] = set()\n if incorrect[letter_id] not in letters:\n letters[incorrect[letter_id]] = set()\n letters[correct[letter_id]].add(incorrect[letter_id])\n letters[incorrect[letter_id]].add(correct[letter_id])\n\n for key, value in letters.items():\n if len(value) > 1:\n return(-1)\n else:\n for value_item in value:\n if len(letters[value_item]) == 1:\n for v in letters[value_item]:\n if v == key and key < value_item:\n answer.append(key + \" \" + value_item)\n return str(len(answer)) + \"\\n\" + \"\\n\".join(answer)\n\n\nprint(count())\n\n", "def solve(s, t):\n D = {}\n n = len(s)\n for i in range(n):\n if s[i] not in D:\n D[s[i]] = t[i]\n if t[i] not in D:\n D[t[i]] = s[i]\n if t[i] != D[s[i]] or s[i] != D[t[i]]:\n return None\n\n S = {(min(c, D[c]), max(c, D[c])) for c in D if D[c] != c}\n return S\n\ns = input().rstrip()\nt = input().rstrip()\nS = solve(s,t)\nif S is None:\n print(-1)\nelse:\n print(len(S))\n for c1, c2 in S:\n print(c1, c2)\n\n\n \n \n", "first = input().strip()\nsecond = input().strip()\nmapping = dict()\nprinted = False\nfor i,letter in enumerate(first):\n if letter == second[i]:\n mapping[letter] = second[i]\n else:\n if mapping.get(letter):\n if mapping.get(letter) != second[i]:\n printed = True\n print(-1)\n break\n else:\n if first.count(letter) == second.count(second[i]):\n mapping[letter] = second[i]\n else:\n printed = True\n print(-1)\n break\nanswers = dict()\nfor k,v in mapping.items():\n if answers.get(v):\n if mapping.get(v) == k:\n continue\n else:\n printed = True\n print(-1)\n break\n else:\n if k != v:\n answers[k] = v\n\nif not printed:\n print(len(answers))\n for k,v in answers.items():\n print(k, v)\n", "sa=input()\r\nsb=input()\r\n\r\nma={}\r\nflg=0\r\nfor x,y in zip(sa,sb):\r\n if( ma.get(x)!=None ):\r\n if(ma[x]!=y):\r\n flg=1\r\n break\r\n elif ma.get(y)!=None:\r\n if(ma[y]!=x):\r\n flg=1\r\n break\r\n else:\r\n ma[x]=y\r\n ma[y]=x\r\n\r\nif flg:\r\n print(-1)\r\nelse:\r\n\r\n cnt=0\r\n for x,y in ma.items():\r\n if(ord(x)<ord(y)):\r\n # print(x,y)\r\n cnt+=1\r\n print(cnt)\r\n for x,y in ma.items():\r\n if(ord(x)<ord(y)):\r\n print(x,y)\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(a1, b1, c1, d1, e1, f1, g):\r\n a, b, c, d, e, f = a1.copy(), b1.copy(), c1.copy(), d1.copy(), e1.copy(), f1.copy()\r\n if len(set(a)) == len(set(b)) == 1:\r\n if g == 1:\r\n for i in [c, d, e, f]:\r\n i[1], i[2] = i[2], i[1]\r\n elif g == 2:\r\n d[1], d[2] = d[2], d[1]\r\n e[0], e[1], e[2], e[3] = e[2], e[3], e[0], e[1]\r\n f[0], f[3] = f[3], f[0]\r\n if f[0] == f[1]:\r\n x = f[0]\r\n for i1, i2, i3, i4 in [c,d,e,f]:\r\n if x == i3 == i4:\r\n if i1 == i2:\r\n x = i1\r\n else:\r\n break\r\n else:\r\n break\r\n else:\r\n return 1\r\n\r\n x = f[0]\r\n for i1, i2, i3, i4 in [e,d,c,f]:\r\n if x == i3 == i4:\r\n if i1 == i2:\r\n x = i1\r\n else:\r\n break\r\n else:\r\n break\r\n else:\r\n return 1\r\n return 0\r\n\r\n\r\nw = list(map(int, input().split()))\r\na1 = w[:4]\r\na2 = w[4:8]\r\na3 = w[8:12]\r\na4 = w[12:16]\r\na5 = w[16:20]\r\na6 = [w[21], w[20], w[23], w[22]]\r\n\r\nif sum([f(a1, a3, a4, a2, a5, a6, 0), f(a2, a6, a1, a4, a3, a5, 2), f(a4, a5, a1, a2, a3, a6, 1)]) >= 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "import math\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom types import GeneratorType\r\nfrom collections import defaultdict\r\nBUFSIZE = 8192\r\nfrom bisect import bisect_left\r\nfrom bisect import bisect_right\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\nfrom collections import deque\r\n\r\ndef ceil(a,b):\r\n if(a<=0):\r\n return 0\r\n if(a%b==0):\r\n return(a//b)\r\n else:\r\n return ((a//b)+1)\r\n\r\n\r\n# Python3 program to do range minimum\r\n# query using sparse table\r\nimport math\r\n\r\nlookup = [[0 for i in range(21)]\r\n for j in range(300001)]\r\n\r\n\r\n# Fills lookup array lookup[][] in\r\n# bottom up manner.\r\ndef buildSparseTable(arr, n):\r\n # Initialize M for the intervals\r\n # with length 1\r\n for i in range(0, n):\r\n lookup[i][0] = arr[i]\r\n\r\n j = 1\r\n\r\n # Compute values from smaller to\r\n # bigger intervals\r\n while (1 << j) <= n:\r\n\r\n # Compute minimum value for all\r\n # intervals with size 2^j\r\n i = 0\r\n while (i + (1 << j) - 1) < n:\r\n\r\n # For arr[2][10], we compare arr[lookup[0][7]]\r\n # and arr[lookup[3][10]]\r\n if (lookup[i][j - 1] <\r\n lookup[i + (1 << (j - 1))][j - 1]):\r\n lookup[i][j] = lookup[i][j - 1]\r\n else:\r\n lookup[i][j] = \\\r\n lookup[i + (1 << (j - 1))][j - 1]\r\n\r\n i += 1\r\n j += 1\r\n\r\n\r\n# Returns minimum of arr[L..R]\r\ndef query(L, R):\r\n # Find highest power of 2 that is smaller\r\n # than or equal to count of elements in\r\n # given range. For [2, 10], j = 3\r\n j = int(math.log2(R - L + 1))\r\n\r\n # Compute minimum of last 2^j elements\r\n # with first 2^j elements in range.\r\n # For [2, 10], we compare arr[lookup[0][3]]\r\n # and arr[lookup[3][3]],\r\n if lookup[L][j] <= lookup[R - (1 << j) + 1][j]:\r\n return lookup[L][j]\r\n\r\n else:\r\n return lookup[R - (1 << j) + 1][j]\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(1):\r\n b=[0]+list(map(int,input().split()))\r\n poss1=[[1,2,3,4],[9,10,11,12],[7,8,13,14],[15,16,21,22],[17,18,23,24],[5,6,19,20]]\r\n poss2 = [[1, 2, 3, 4], [9, 10, 11, 12], [7, 8, 17, 18], [19, 20, 21, 22], [13, 14, 23,24], [5, 6, 15, 16]]\r\n\r\n\r\n\r\n poss3=[[13,14,15,16],[17,18,19,20],[6,8,9,11],[2,4,5,7],[10,12,22,24],[1,3,21,23]]\r\n poss4=[[13,14,15,16],[17,18,19,20],[1,3,6,8],[5,7,10,12],[9,11,21,23],[2,4,22,24]]\r\n\r\n poss5=[[5,6,7,8],[21,22,23,24],[9,10,13,15],[11,12,17,19],[3,4,18,20],[1,2,14,16]]\r\n poss6=[[5,6,7,8],[21,22,23,24],[9,10,18,20],[1,2,17,19],[3,4,13,15],[11,12,14,16]]\r\n\r\n poss1.sort()\r\n poss2.sort()\r\n poss3.sort()\r\n poss4.sort()\r\n poss5.sort()\r\n poss6.sort()\r\n ans=[poss1,poss2,poss3,poss4,poss5,poss6]\r\n adj=[[] for i in range(7)]\r\n for i in range(1,25):\r\n adj[b[i]].append(i)\r\n res=adj[1:]\r\n res.sort()\r\n poss=False\r\n for j in ans:\r\n if (res==j):\r\n poss=True\r\n break\r\n\r\n if(poss):\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", "take = list(map(int, input().split()))\r\nbig = []\r\nbig.append([2, 4, 6, 8, 10, 12, 23, 21])\r\nbig.append([1, 3, 5, 7, 9, 11, 24, 22])\r\nbig.append([15, 16, 7, 8, 19, 20, 23, 24])\r\nbig.append([13, 14, 5, 6, 17, 18, 21, 22])\r\nbig.append([3, 4, 17, 19, 10, 9, 16, 14])\r\nbig.append([1, 2, 18, 20, 12, 11, 15, 13])\r\n\r\nfor i in big:\r\n temp1, temp2 = take[:], take[:]\r\n for j in range(0, 8):\r\n temp1[i[j] - 1] = take[i[(j + 2) % 8] - 1]\r\n temp2[i[j] - 1] = take[i[(j + 2) % 8] - 1]\r\n \r\n k, l = 0, 0\r\n while k <= 21:\r\n if temp1[k] == temp1[k + 1] == temp1[k + 2] == temp1[k + 3]:\r\n l += 1;\r\n k += 4\r\n if l == 6:\r\n print(\"YES\")\r\n exit();\r\n \r\nprint(\"NO\")\r\n \r\n ", "cb = [int(item) for item in input().split()]\r\ncbb = [cb[i:i + 4] for i in range(0, 24, 4)]\r\n\r\ncons = [[i] * 4 for i in range(1, 7)]\r\nk = 0\r\ncompleteFaces = []\r\n\r\ndef v(x, y):\r\n return cb[x - 1] == cb[y - 1]\r\n\r\ndef rot(thing):\r\n for p, xx in enumerate(thing):\r\n x = [xx[:2], xx[2:]]\r\n for i in range(2):\r\n for j in range(i + 1, 2):\r\n x[i][j], x[j][i] = x[j][i], x[i][j]\r\n if p != 5:\r\n x[0][0], x[1][0] = x[1][0], x[0][0]\r\n x[0][1], x[1][1] = x[1][1], x[0][1]\r\n else:\r\n x[0] = x[0][::-1]\r\n x[1] = x[1][::-1]\r\n thing[p] = x[0] + x[1]\r\n return thing\r\n\r\nfor i in range(0, 24, 4):\r\n if cb[i:i + 4] in cons:\r\n k += 1\r\n completeFaces.append(i // 4 + 1)\r\n\r\nif k != 2 or completeFaces not in [[1, 3], [4, 5], [2, 6]]:\r\n print(\"NO\")\r\nelse:\r\n if completeFaces == [1, 3]:\r\n cbb[0], cbb[2], cbb[3], cbb[4] = cbb[4].copy(), cbb[3].copy(), cbb[0].copy(), cbb[2].copy()\r\n #print(cbb)\r\n cbb = rot(cbb)\r\n #print(cbb)\r\n elif completeFaces == [2, 6]:\r\n cbb[1], cbb[3], cbb[4], cbb[5] = cbb[4].copy(), cbb[1].copy(), cbb[5].copy(), cbb[3].copy()\r\n cbb[0] = [cbb[0][2], cbb[0][0], cbb[0][3], cbb[0][1]]\r\n cbb[2] = [cbb[2][1], cbb[2][3], cbb[2][0], cbb[2][2]]\r\n cb = cbb[0] + cbb[1] + cbb[2] + cbb[3] + cbb[4] + cbb[5]\r\n #print(cb)\r\n case1 = v(5, 10) and v(7, 12) and v(1, 6) and v(3, 8) and v(2, 22) and v(4, 24) and v(9, 21) and v(11, 23) and\\\r\n v(5, 7) and v(10, 12) and v(1, 3) and v(6, 8) and v(2, 4) and v(22, 24) and v(9, 11) and v(21, 23) \r\n \r\n case2 = v(5, 2) and v(7, 4) and v(9, 6) and v(11, 8) and v(1, 21) and v(3, 23) and v(10, 22) and v(12, 24) and\\\r\n v(5, 7) and v(2, 4) and v(9, 11) and v(6, 8) and v(1, 3) and v(21, 23) and v(10, 12) and v(22, 24) \r\n \r\n if case1 or case2:\r\n print(\"YES\")\r\n \r\n else:\r\n print(\"NO\")\r\n ", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nfrom functools import reduce\r\n\r\nkubik = list(map(int, input().split()))\r\n# for indices convenience\r\nkubik = [None]+kubik\r\n\r\nsides = [[4*i+j for j in range(1, 5)] for i in range(6)]\r\n\r\nloops = [\r\n [1, 3, 5, 7, 9, 11, 24, 22],\r\n [2, 4, 6, 8, 10, 12, 23, 21],\r\n [13, 14, 5, 6, 17, 18, 21, 22],\r\n [15, 16, 7, 8, 19, 20, 23, 24],\r\n [1, 2, 18, 20, 12, 11, 15, 13],\r\n [3, 4, 17, 19, 10, 9, 16, 14],\r\n]\r\n\r\ndef side_solved(kubik, indices) -> bool:\r\n return all(kubik[indices[i-1]] == kubik[indices[i]] for i in range(1, len(indices)))\r\n\r\ndef kubik_solved(kubik) -> bool:\r\n return all(side_solved(kubik, side) for side in sides)\r\n\r\ndef move_solved(kubik, side, side_shift, loop, loop_shift):\r\n kubik2 = kubik[:]\r\n s = sides[side]\r\n for i in range(len(s)):\r\n kubik2[s[(i+side_shift) % len(s)]] = kubik[s[i]]\r\n l = loops[loop]\r\n for i in range(len(l)):\r\n kubik2[l[(i+loop_shift) % len(l)]] = kubik[l[i]]\r\n return kubik_solved(kubik2)\r\n\r\nif any(move_solved(kubik, s, ss, l, ls) for s, ss, l, ls in [\r\n [3, +1, 0, +2],\r\n [3, -1, 0, -2],\r\n [4, -1, 1, +2],\r\n [4, +1, 1, -2],\r\n [0, -1, 2, +2],\r\n [0, +1, 2, -2],\r\n [2, +1, 3, +2],\r\n [2, -1, 3, -2],\r\n [5, -1, 4, +2],\r\n [5, +1, 4, -2],\r\n [1, +1, 5, +2],\r\n [1, -1, 5, -2],\r\n]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import copy\r\n\r\ndef check(n):\r\n for i in range(1,25,4):\r\n if n[i:i+4] != [n[i]]*4:\r\n return\r\n \r\n print(\"YES\")\r\n exit(0)\r\n\r\nc = ['']+input().split(' ')\r\n\r\n# r\r\nn = copy.deepcopy(c)\r\nn[2]=c[6]\r\nn[4]=c[8]\r\nn[6]=c[10]\r\nn[8]=c[12]\r\nn[10]=c[23]\r\nn[12]=c[21]\r\nn[23]=c[2]\r\nn[21]=c[4]\r\ncheck(n)\r\n\r\n# ir\r\nn = copy.deepcopy(c)\r\nn[2]=c[23]\r\nn[4]=c[21]\r\nn[6]=c[2]\r\nn[8]=c[4]\r\nn[10]=c[6]\r\nn[12]=c[8]\r\nn[23]=c[10]\r\nn[21]=c[12]\r\ncheck(n)\r\n\r\n# t\r\nn = copy.deepcopy(c)\r\nn[13]=c[5]\r\nn[14]=c[6]\r\nn[5]=c[17]\r\nn[6]=c[18]\r\nn[17]=c[21]\r\nn[18]=c[22]\r\nn[21]=c[13]\r\nn[22]=c[14]\r\ncheck(n)\r\n\r\n# it\r\nn = copy.deepcopy(c)\r\nn[13]=c[21]\r\nn[14]=c[22]\r\nn[5]=c[13]\r\nn[6]=c[14]\r\nn[17]=c[5]\r\nn[18]=c[6]\r\nn[21]=c[17]\r\nn[22]=c[18]\r\ncheck(n)\r\n\r\n# f\r\nn = copy.deepcopy(c)\r\nn[3]=c[17]\r\nn[4]=c[19]\r\nn[14]=c[4]\r\nn[16]=c[3]\r\nn[9]=c[14]\r\nn[10]=c[16]\r\nn[17]=c[10]\r\nn[19]=c[9]\r\ncheck(n)\r\n\r\n# if\r\nn = copy.deepcopy(c)\r\nn[3]=c[16]\r\nn[4]=c[14]\r\nn[14]=c[9]\r\nn[16]=c[10]\r\nn[9]=c[19]\r\nn[10]=c[17]\r\nn[17]=c[3]\r\nn[19]=c[4]\r\ncheck(n)\r\n\r\nprint(\"NO\")", "a = [\r\n [1,3,5,7,9,11,24,22],\r\n [2,4,6,8,10,12,23,21],\r\n [13,14,5,6,17,18,21,22],\r\n [15,16,7,8,19,20,23,24],\r\n [2,1,13,15,11,12,20,18],\r\n [4,3,14,16,9,10,19,17]\r\n ]\r\ncube = [0]+list(map(int, input().split()))\r\ndef rubik(cube):\r\n if cube[1]==cube[2]==cube[3]==cube[4] and cube[5]==cube[6]==cube[7]==cube[8] and cube[9]==cube[10]==cube[11]==cube[12] and cube[13]==cube[14]==cube[15]==cube[16] and cube[17]==cube[18]==cube[19]==cube[20] and cube[21]==cube[22]==cube[23]==cube[24]:\r\n return True\r\n else:\r\n return False\r\nfor row in a:\r\n b = cube[:]\r\n for i in range(8):\r\n b[row[i]]=cube[row[(i+2)%8]]\r\n if rubik(b):\r\n print('YES')\r\n break\r\n b = cube[:]\r\n for i in range(8):\r\n b[row[i]]=cube[row[(8+i-2)%8]]\r\n if rubik(b):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "s = list(map(int, input().split()))\r\nt = 0\r\ns = [0] + s\r\nif s[13] == s[14] == s[15] == s[16] and s[17] == s[18] == s[19] == s[20]:\r\n if s[1] == s[3] == s[6] == s[8] and s[2] == s[4] == s[22] == s[24] and s[5] == s[7] == s[10] == s[12]:\r\n t = 1\r\n print(\"YES\")\r\n elif s[1] == s[3] == s[21] == s[23] and s[5] == s[7] == s[2] == s[4] and s[9] == s[11] == s[6] == s[8]:\r\n print(\"YES\")\r\n t = 1\r\nelif s[1] == s[2] == s[3] == s[4] and s[9] == s[10] == s[11] == s[12]:\r\n if s[13] == s[14] == s[7] == s[8] and s[5] == s[6] == s[19] == s[20] and s[17] == s[18] == s[23] == s[24]:\r\n t = 1\r\n print(\"YES\")\r\n elif s[5] == s[6] == s[15] == s[16] and s[17] == s[18] == s[7] == s[8] and s[21] == s[22] == s[19] == s[20]:\r\n t = 1\r\n print(\"YES\")\r\nelif s[5] == s[6] == s[7] == s[8] and s[21] == s[22] == s[23] == s[24]:\r\n if s[17] == s[19] == s[1] == s[2] and s[3] == s[4] == s[13] == s[15] and s[14] == s[16] == s[11] == s[12]:\r\n t = 1\r\n print(\"YES\")\r\n elif s[3] == s[4] == s[18] == s[20] and s[17] == s[19] == s[11] == s[12] and s[9] == s[10] == s[13] == s[15]:\r\n t = 1\r\n print(\"YES\")\r\nif t == 0:\r\n print(\"NO\")", "import copy\r\n#suo you dou shun shi zhen \r\ndef r1(x): #qinamian\r\n x[7],x[8],x[19],x[20],x[23],x[24],x[15],x[16] =\\\r\n x[15],x[16],x[7],x[8],x[19],x[20],x[23],x[24]\r\n return x\r\ndef r2(x): #houmian\r\n x[5],x[6],x[17],x[18],x[21],x[22],x[13],x[14] =\\\r\n x[13],x[14],x[5],x[6],x[17],x[18],x[21],x[22]\r\n return x\r\ndef r3(x): #zuobian\r\n x[5],x[7],x[9],x[11],x[24],x[22],x[1],x[3] =\\\r\n x[9],x[11],x[24],x[22],x[1],x[3],x[5],x[7]\r\n return x\r\ndef r4(x): #youbian\r\n x[6],x[8],x[10],x[12],x[23],x[21],x[2],x[4] =\\\r\n x[10],x[12],x[23],x[21],x[2],x[4],x[6],x[8]\r\n return x\r\ndef r5(x): #shangbian\r\n x[3],x[4],x[17],x[19],x[9],x[10],x[14],x[16] =\\\r\n x[14],x[16],x[3],x[4],x[17],x[19],x[9],x[10]\r\n return x\r\ndef r6(x): #xiabian\r\n x[1],x[2],x[18],x[20],x[11],x[12],x[13],x[15] =\\\r\n x[13],x[15],x[1],x[2],x[18],x[20],x[11],x[12]\r\n return x\r\n\r\ndef judge(x):\r\n for i in range(6):\r\n if ((x[i*4+4] != x[i*4+1])or (x[i*4+2] != x[i*4+1]) )\\\r\n or((x[i*4+2] != x[i*4+3])):\r\n return False\r\n return True\r\n \r\na = [int(i) for i in input('').split()]\r\n\r\nans = False\r\n\r\nb = [\"fuck\"]\r\nfor i in a:\r\n b.append(i)\r\nif judge(r1(b)): ans = True\r\n\r\nb = [\"fuck\"]\r\nfor i in a:\r\n b.append(i)\r\nif judge(r2(b)): ans = True\r\n\r\nb = [\"fuck\"]\r\nfor i in a:\r\n b.append(i)\r\nif judge(r3(b)): ans = True\r\n\r\nb = [\"fuck\"]\r\nfor i in a:\r\n b.append(i)\r\nif judge(r4(b)): ans = True\r\n\r\nb = [\"fuck\"]\r\nfor i in a:\r\n b.append(i)\r\nif judge(r5(b)): ans = True\r\n\r\nb = [\"fuck\"]\r\nfor i in a:\r\n b.append(i)\r\nif judge(r6(b)): ans = True\r\n\r\nif ans : print(\"YES\")\r\nelse: print(\"NO\")\r\n\r\n\r\n\r\n", "# https://codeforces.com/contest/887\n\nimport sys\nfrom copy import deepcopy\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nSIDES = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12], [13, 14, 15, 16], [17, 18, 19, 20], [21, 22, 23, 24]]\nSLICES = [[13, 14, 5, 6, 17, 18, 21, 22],\n [15, 16, 7, 8, 19, 20, 23, 24],\n [1, 3, 5, 7, 9, 11, 24, 22],\n [2, 4, 6, 8, 10, 12, 23, 21],\n [3, 4, 17, 19, 10, 9, 16, 14],\n [1, 2, 18, 20, 12, 11, 15, 13]]\n\n\ndef is_solved(cube):\n for s in range(6):\n if len(set(cube[i - 1] for i in SIDES[s])) > 1:\n return False\n return True\n\n\ndef is_solvable(cube):\n for s in range(6):\n for d in [-2, 2]:\n cube2 = deepcopy(cube)\n for i in range(8):\n cube2[SLICES[s][i] - 1] = cube[SLICES[s][(i + d) % 8] - 1]\n if is_solved(cube2):\n return True\n return False\n\n\ndef solve_case():\n cube = list(map(int, input().split()))\n print(\"YES\" if is_solvable(cube) else \"NO\")\n\n\nsolve_case()\n", "d=list(map(int,input().split()))\r\nd=[0]+d\r\n#def f(a):\r\n# if (a[1]==a[2]==a[3]==a[4])&(a[5]==a[6]==a[7]==a[8])&(a[9]==a[10]==a[11]==a[12])&(a[13]==a[14]==a[15]==a[16])&(a[17]==a[18]==a[19]==a[20])&(a[21]==a[22]==a[23]==a[24]):\r\n# return True\r\n# return False\r\ndef ff(g):\r\n if g[1]==g[2]==g[3]==g[0]:\r\n return True\r\n return False\r\ndef df(g):\r\n #a[0],a[1],a[2],a[3]=a[1],a[3],a[0],a[2]\r\n return [g[1],g[3],g[0],g[2]]\r\nif (ff(d[13:17]))&(ff(d[17:21])): #1\r\n a=d[:]\r\n #if (a[5]==a[7])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])\r\n b=True\r\n for i in range(1,25,4):\r\n if a[i]!=a[i+2]:\r\n b=False\r\n for i in range(2,25,4):\r\n if a[i]!=a[i+2]:\r\n b=False\r\n if b==False:\r\n print('NO')\r\n else:\r\n if ((a[1]==a[6])&(a[5]==a[10])&(a[9]==a[21])&(a[2]==a[22]))|((a[5]==a[2])&(a[9]==a[6])&(a[24]==a[12])&(a[21]==a[1])):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif (ff(d[1:5]))&(ff(d[9:13])): #2\r\n a=d[:]\r\n a[1:5],a[13:17],a[9:13],a[17:21]=df(a[17:21]),df(a[1:5]),df(a[13:17]),df(a[9:13])\r\n a[5:9]=df(a[5:9])\r\n a[21:25]=df(df(df(a[21:25])))\r\n #if (a[5]==a[7])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])\r\n b=True\r\n for i in range(1,25,4):\r\n if a[i]!=a[i+2]:\r\n b=False\r\n for i in range(2,25,4):\r\n if a[i]!=a[i+2]:\r\n b=False\r\n if b==False:\r\n print('NO')\r\n else:\r\n if ((a[1]==a[6])&(a[5]==a[10])&(a[9]==a[21])&(a[2]==a[22]))|((a[5]==a[2])&(a[9]==a[6])&(a[24]==a[12])&(a[21]==a[1])):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif (ff(d[5:9]))&(ff(d[21:25])): #3\r\n a=d[:]\r\n a[1:5],a[9:13]=df(df(df(a[1:5]))),df(a[9:13])\r\n a[13:17],a[5:9],a[17:21],a[21:25]=a[5:9],a[17:21],a[21:25],a[13:17]\r\n #a[1:5],a[13:17],a[9:13],a[17:21]=df(a[17:21]),df(a[1:5]),df(a[13:17]),df(a[9:13])\r\n #a[5:9]=df(a[5:9])\r\n #a[21:25]=df(df(df(a[21:25])))\r\n #if (a[5]==a[7])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])&(a[]==a[])\r\n b=True\r\n for i in range(1,25,4):\r\n if a[i]!=a[i+2]:\r\n b=False\r\n for i in range(2,25,4):\r\n if a[i]!=a[i+2]:\r\n b=False\r\n if b==False:\r\n print('NO')\r\n else:\r\n if ((a[1]==a[6])&(a[5]==a[10])&(a[9]==a[21])&(a[2]==a[22]))|((a[5]==a[2])&(a[9]==a[6])&(a[24]==a[12])&(a[21]==a[1])):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "def check(cube) -> bool:\r\n qDistricts = len(cube) // 6\r\n for i in range(0, len(cube), qDistricts):\r\n color = cube[i]\r\n for j in range(i, i + qDistricts):\r\n if color != cube[j]:\r\n return False\r\n return True\r\n\r\ndef transparent(cube, t) -> list:\r\n last = [cube[t[-2] - 1], cube[t[-1] - 1]]\r\n for i in range(0, len(t), 2):\r\n tmp = [cube[t[i] - 1], cube[t[i + 1] - 1]]\r\n cube[t[i] - 1] = last[0]\r\n cube[t[i + 1] - 1] = last[1]\r\n last = tmp\r\n return cube\r\n\r\n\r\nright = [2, 4, 6, 8, 10, 12, 23, 21]\r\nleft = [1, 3, 5, 7, 9, 11, 24, 22]\r\nfront = [3, 4, 17, 19, 10, 9, 16, 14]\r\nback = [1, 2, 18, 20, 12, 11, 15, 13]\r\nup = [13, 14, 5, 6, 17, 18, 21, 22]\r\ndown = [15, 16, 7, 8, 19, 20, 23, 24]\r\n\r\ncube = list(map(int, input().split()))\r\nfor seq in [right, left, front, back, up, down]:\r\n tmp1 = cube.copy()\r\n tmp2 = cube.copy()\r\n if (check(transparent(tmp1, seq)) or check(transparent(tmp2, seq[::-1]))):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "a=list(map(int,input().split()))\nx,i=0,0\nw=[]\nwhile i<24:\n n=len(set(a[i:i+4]))\n if n==1:x+=1\n elif n==2:w.append(set(a[i:i+4]))\n i+=4\nw=set(frozenset(i) for i in w)\nprint(['NO','YES'][ x==2 and len(set(w))==4])\n \t \t \t\t \t \t\t \t\t \t \t \t \t\t", "moves = [\r\n [(1,24),(3,22),(5,1),(7,3),(9,5),(11,7),(24,9),(22,11),(14,13),(13,15),(15,16),(16,13)],\r\n [(14,4),(16,3),(9,14),(10,16),(19,9),(17,10),(3,17),(4,19),(5,6),(6,8),(8,7),(7,5)],\r\n [(5,13),(6,14),(17,5),(18,6),(21,17),(22,18),(14,22),(13,21),(1,2),(2,4),(4,3),(3,1)]\r\n]\r\n\r\nmoves_len = len(moves)\r\nfor i in range(moves_len):\r\n moves.append([])\r\n for t in range(len(moves[i])):\r\n moves[-1].append((moves[i][t][1], moves[i][t][0]))\r\n\r\n\r\ncolors = input().split()\r\n\r\ndef is_solved(col):\r\n for s in range(6):\r\n for i in range(s * 4 + 1, s * 4 + 4):\r\n if col[i] != col[s * 4]:\r\n return False\r\n\r\n return True\r\n\r\ndef check_move(col, move):\r\n col_temp = colors[:]\r\n for t in move:\r\n col_temp[t[1]-1] = colors[t[0]-1]\r\n return is_solved(col_temp)\r\n\r\nsolved = False\r\nfor m in moves:\r\n solved = check_move(colors, m)\r\n if solved:\r\n break\r\n\r\nprint(\"YES\" if solved else \"NO\")", "a = list(map(int, input().split()))\r\nif ((a[0] == a[5] == a[2] == a[7]) and \\\r\n\t(a[4] == a[9] == a[6] == a[11]) and \\\r\n\t(a[20] == a[8] == a[10] == a[22]) and \\\r\n\t(a[21] == a[1] == a[23] == a[3])) or \\\r\n\t((a[4] == a[1] == a[6] == a[3]) and \\\r\n\t(a[8] == a[5] == a[10] == a[7]) and \\\r\n\t(a[21] == a[23] == a[9] == a[11]) and \\\r\n\t(a[0] == a[20] == a[2] == a[22])) or \\\r\n\t((a[4] == a[5] == a[14] == a[15]) and \\\r\n\t(a[16] == a[6] == a[17] == a[7]) and \\\r\n\t(a[20] == a[18] == a[21] == a[19]) and \\\r\n\t(a[22] == a[12] == a[13] == a[23])) or\\\r\n\t((a[12] == a[13] == a[6] == a[7]) and \\\r\n\t(a[4] == a[5] == a[19] == a[18]) and \\\r\n\t(a[16] == a[17] == a[22] == a[23]) and \\\r\n\t(a[15] == a[14] == a[21] == a[20])) or \\\r\n\t((a[2] == a[3] == a[17] == a[19]) and \\\r\n\t(a[11] == a[18] == a[10] == a[16]) and \\\r\n\t(a[8] == a[12] == a[9] == a[14]) and \\\r\n\t(a[1] == a[15] == a[0] == a[13])) or \\\r\n\t((a[16] == a[0] == a[1] == a[18]) and \\\r\n\t(a[3] == a[2] == a[12] == a[14]) and \\\r\n\t(a[11] == a[15] == a[10] == a[13]) and \\\r\n\t(a[8] == a[17] == a[9] == a[19])):\r\n\t\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n\r\n\r\n", "def all_is(l):\r\n f = l[1]\r\n for i in range(2, len(l)):\r\n if l[i] == f or l[i] == None:\r\n pass\r\n else:\r\n return False\r\n return True\r\nlst = list(map(int, input().split(' ')))\r\nu, f, d, l, r, t = lst[:4], lst[4:8], lst[8:12], lst[12:16], lst[16:20], lst[20:]\r\nu.insert(0, None)\r\nf.insert(0, None)\r\nd.insert(0, None)\r\nl.insert(0, None)\r\nr.insert(0, None)\r\nt.insert(0, None)\r\nif all_is(u) and not all_is(f) and all_is(d) and not all_is(l) and not all_is(r) and not all_is(t):\r\n if (l[1] == l[2] == f[3] == f[4] and f[1] == f[2] == r[3] == r[4] and r[1] == r[2] == t[3] == t[4] and t[1] == t[2] == l[3] == l[4]) or (l[3] == l[4] == f[1] == f[2] and f[3] == f[4] == r[1] == r[2] and r[3] == r[4] == t[1] == t[2] and t[3] == t[4] == l[1] == l[2]):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif not all_is(u) and all_is(f) and not all_is(d) and not all_is(l) and not all_is(r) and all_is(t):\r\n if (l[1] == l[3] == u[3] == u[4] and u[1] == u[2] == r[1] == r[3] and r[2] == r[4] == d[1] == d[2] and d[3] == d[4] == l[2] == l[4]) or (l[2] == l[4] == u[1] == u[2] and u[3] == u[4] == r[2] == r[4] and r[1] == r[3] == d[3] == d[4] and d[1] == d[2] == l[1] == l[3]):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelif not all_is(u) and not all_is(f) and not all_is(d) and all_is(l) and all_is(r) and not all_is(t):\r\n if (f[1] == f[3] == u[2] == u[4] and u[1] == u[3] == t[1] == t[3] and t[2] == t[4] == d[2] == d[4] and d[1] == d[3] == f[2] == f[4]) or (f[2] == f[4] == u[1] == u[3] and u[2] == u[4] == t[2] == t[4] and t[1] == t[3] == d[1] == d[3] and d[2] == d[4] == f[1] == f[3]):\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "a = input().split()\r\n\r\nc1 = a[0] == a[1] == a[2] == a[3]\r\nc2 = a[8] == a[9] == a[10] == a[11]\r\nc3 = a[12] == a[13] == a[6] == a[7]\r\nc4 = a[4] == a[5] == a[18] == a[19]\r\nc5 = a[16] == a[17] == a[22] == a[23]\r\nc6 = a[20] == a[21] == a[14] == a[15]\r\n\r\nc1 = c1\r\nc2 = c2\r\nc7 = a[4] == a[5] == a[14] == a[15]\r\nc8 = a[12] == a[13] == a[22] == a[23]\r\nc9 = a[20] == a[21] == a[18] == a[19]\r\nc10 = a[16] == a[17] == a[6] == a[7]\r\n\r\nc11 = a[4] == a[5] == a[6] == a[7]\r\nc12 = a[20] == a[21] == a[22] == a[23]\r\nc13 = a[8] == a[9] == a[17] == a[19]\r\nc14 = a[16] == a[18] == a[0] == a[1]\r\nc15 = a[2] == a[3] == a[12] == a[14]\r\nc16 = a[13] == a[15] == a[10] == a[11]\r\n\r\nc11 = c11\r\nc12 = c12\r\nc17 = a[8] == a[9] == a[12] == a[14]\r\nc18 = a[13] == a[15] == a[0] == a[1]\r\nc19 = a[2] == a[3] == a[17] == a[19]\r\nc20 = a[16] == a[18] == a[10] == a[11]\r\n\r\nc21 = a[12] == a[13] == a[14] == a[15]\r\nc22 = a[16] == a[17] == a[18] == a[19]\r\nc23 = a[8] == a[10] == a[5] == a[7]\r\nc24 = a[4] == a[6] == a[1] == a[3]\r\nc25 = a[0] == a[2] == a[20] == a[22]\r\nc26 = a[21] == a[23] == a[9] == a[11]\r\n\r\nc21 = c21\r\nc22 = c22\r\nc27 = a[8] == a[10] == a[20] == a[22]\r\nc28 = a[21] == a[23] == a[1] == a[3]\r\nc29 = a[0] == a[2] == a[5] == a[7]\r\nc30 = a[4] == a[6] == a[9] == a[11]\r\n\r\ncase1 = c1 and c2 and c3 and c4 and c5 and c6\r\ncase2 = c1 and c2 and c7 and c8 and c9 and c10\r\ncase3 = c11 and c12 and c13 and c14 and c15 and c16\r\ncase4 = c11 and c12 and c17 and c18 and c19 and c20\r\ncase5 = c21 and c22 and c23 and c24 and c25 and c26\r\ncase6 = c21 and c22 and c27 and c28 and c29 and c30\r\n\r\nif case1 or case2 or case3 or case4 or case5 or case6:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "import sys\r\n\r\ntry:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nexcept:\r\n pass\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solved(a):\r\n side1 = set(a[:4])\r\n side2 = set(a[4:8])\r\n side3 = set(a[8:12])\r\n side4 = set(a[12:16])\r\n side5 = set(a[16:20])\r\n side6 = set(a[20:24])\r\n\r\n for side in [side1, side2, side3, side4, side5, side6]:\r\n if len(side) != 1:\r\n return False\r\n return True\r\n\r\na = list(map(int, input().split()))\r\n\r\nturn1 = {1:5, 3:7, 5:9, 7:11, 9:24, 11:22, 24:1, 22:3}\r\nturn2 = {2:6, 4:8, 6:10, 8:12, 10:21, 12:23, 23:2, 21:4}\r\n\r\nturn3 = {5:13, 6:14, 17:5, 18:6, 21:17, 22:18, 13:21, 14:22}\r\nturn4 = {7:15, 8:16, 19:7, 20:8, 23:19, 24:20, 16:24, 15:23}\r\n\r\nturn5 = {17:10, 19:9, 9:14, 10:16, 14:4, 16:3, 4:19, 3:17}\r\nturn6 = {18:12, 20:11, 11:13, 12:15, 13:2, 15:1, 2:20, 1:18}\r\n\r\n\r\nfor turn in [turn1, turn2, turn3, turn4, turn5, turn6]:\r\n new_a = [ai for ai in a]\r\n for old, new in turn.items():\r\n new_a[old-1] = a[new-1]\r\n # print(*a, \"\\n\", *new_a, turn)\r\n if solved(new_a):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "def final(b):\n for i in range(6):\n if len(set(b[4 * i: 4 * i + 4])) != 1:\n return False\n return True\n\n\na = list(map(int, input().split()))\n# hantokeimawari\nmoves = [[4, 5, 16, 17, 20, 21, 12, 13],\n [13, 15, 8, 9, 18, 16, 3, 2],\n [15, 14, 23, 22, 19, 18, 7, 6],\n [21, 23, 10, 8, 6, 4, 2, 0],\n [5, 7, 9, 11, 22, 20, 1, 3],\n [17, 19, 11, 10, 14, 12, 0, 1]]\nfor (index, m) in enumerate(moves):\n permutation = [i for i in range(24)]\n inverse = [i for i in range(24)]\n for j in range(8):\n first = m[j]\n second = m[(j + 2) % 8]\n permutation[first] = second\n inverse[second] = first\n b = [a[permutation[i]] for i in range(24)]\n c = [a[inverse[i]] for i in range(24)]\n if final(b) or final(c):\n print('YES')\n exit()\nprint('NO')\n\n\t\t\t \t \t\t \t \t\t\t\t", "#!/usr/bin/env python3\n\n# RECYCLAGE (cf. PE 599)\n# |20 21|\n# |23 22|\n# -------\n# |16 17|\n# |19 18|\n# -------------------\n# |12 13| 0 1| 4 5|\n# |15 14| 3 2| 7 6|\n# -------------------\n# | 8 9|\n# |11 10|\n\nS = 24\nclass Permutation:\n def __init__(self,C=None):\n if isinstance(C,list):\n assert(len(C)==S)\n self.P = C\n else:\n self.P = list(range(S))\n if isinstance(C,tuple):\n for i in range(len(C)):\n self.P[C[i]] = C[(i+1)%len(C)]\n self.P = tuple(self.P)\n\n def __getitem__(self,i):\n return self.P[i]\n \n def __mul__(self,A):\n res = [0]*S\n for i in range(S):\n res[i] = self[A[i]]\n return Permutation(res)\n\n def __hash__(self):\n return hash(self.P)\n\n def __eq__(self,A):\n return self.P==A.P\n\n def decomp(self):\n D = []\n seen = [False]*S\n for i0 in range(S):\n if not seen[i0]:\n seen[i0] = True\n C = [i0]\n i = self[i0]\n while i!=i0:\n seen[i] = True\n C.append(i)\n i = self[i]\n D.append(C)\n return D\n\nGen = []\n# rotation de la face centrale du patron\n# 0 -> 1 -> 2 -> 3 -> 0\n# 4 -> 9 -> 14 -> 19 -> 4\n# 7 -> 8 -> 13 -> 18 -> 7\nGen.append(Permutation((0,1,2,3))*Permutation((4,9,14,19))*Permutation((7,8,13,18)))\n\n# (4,5,6,7)(1,17,21,9)(2,18,22,10)\nGen.append(Permutation((4,5,6,7))*Permutation((1,17,21,9))*Permutation((2,18,22,10)))\n\n# (8,9,10,11)(15,3,7,21)(14,2,6,20)\nGen.append(Permutation((8,9,10,11))*Permutation((15,3,7,21))*Permutation((14,2,6,20)))\n\n# (12,13,14,15)(20,16,0,8)(23,19,3,11)\nGen.append(Permutation((12,13,14,15))*Permutation((20,16,0,8))*Permutation((23,19,3,11)))\n\n# (16,17,18,19)(13,23,5,1)(12,22,4,0)\nGen.append(Permutation((16,17,18,19))*Permutation((13,23,5,1))*Permutation((12,22,4,0)))\n\n# (20,21,22,23)(12,11,6,17)(15,10,5,16)\nGen.append(Permutation((20,21,22,23))*Permutation((12,11,6,17))*Permutation((15,10,5,16)))\n\ndef solved(C,P):\n for i in range(0,24,4):\n if any(C[P[i+k]]!=C[P[i]] for k in range(1,4)):\n return False\n return True\n\ndef main():\n C = list(map(int,input().split()))\n # re-numerotation\n R = Permutation([5,7,6,4,9,11,10,8,13,15,14,12,1,3,2,0,17,19,18,16,21,23,22,20])\n for i in range(len(Gen)): # rotations inverses\n Gen.append(Gen[i]*Gen[i]*Gen[i])\n print('YES' if any(solved(C,R*g) for g in Gen) else 'NO')\n\nmain()\n", "q = list(map(int,input().split()))\r\na=[0]\r\nfor i in q:\r\n a.append(i)\r\nif a[1]==a[3]==a[6]==a[8] and a[2]==a[4]==a[22]==a[24] and a[5]==a[7]==a[10]==a[12] and a[9]==a[11]==a[21]==a[23] and a[13]==a[14]==a[15]==a[16]:\r\n print('YES')\r\n exit(0)\r\nif a[1]==a[3]==a[21]==a[23] and a[22]==a[24]==a[10]==a[12] and a[5]==a[7]==a[2]==a[4] and a[9]==a[11]==a[6]==a[8] and a[13]==a[14]==a[15]==a[16]:\r\n print('YES')\r\n exit(0)\r\nif a[1]==a[2]==a[3]==a[4] and a[13]==a[14]==a[7]==a[8] and a[5]==a[6]==a[19]==a[20] and a[17]==a[18]==a[23]==a[24] and a[21]==a[22]==a[15]==a[16]:\r\n print('YES')\r\n exit(0)\r\nif a[1]==a[2]==a[3]==a[4] and a[13]==a[14]==a[23]==a[24] and a[5]==a[6]==a[15]==a[16] and a[17]==a[18]==a[7]==a[8] and a[21]==a[22]==a[19]==a[20]:\r\n print('YES')\r\n exit(0)\r\nif a[5]==a[6]==a[7]==a[8] and a[3]==a[4]==a[18]==a[20] and a[17]==a[19]==a[11]==a[12] and a[9]==a[10]==a[13]==a[15] and a[14]==a[16]==a[1]==a[2]:\r\n print('YES')\r\n exit(0)\r\nif a[5]==a[6]==a[7]==a[8] and a[3]==a[4]==a[13]==a[15] and a[17]==a[19]==a[1]==a[2] and a[9]==a[10]==a[18]==a[20] and a[14]==a[16]==a[11]==a[12]:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n", "arr = list(map(int, input().split()))\r\n\r\ndef cycle(p, q, r, s, b):\r\n if b:\r\n arr[p], arr[q], arr[r], arr[s] = \\\r\n arr[q], arr[r], arr[s], arr[p]\r\n else:\r\n arr[s], arr[r], arr[q], arr[p] = \\\r\n arr[r], arr[q], arr[p], arr[s]\r\n \r\ndef solved():\r\n for i in range(6):\r\n for j in range(1, 4):\r\n if arr[4*i + j] != arr[4*i]:\r\n return False\r\n return True\r\n \r\ndef rotate(k, b):\r\n cycle(4*k, 4*k+1, 4*k+3, 4*k+2, b)\r\n if k == 0:\r\n cycle(21, 17, 5, 13, b)\r\n cycle(12, 20, 16, 4, b)\r\n elif k == 1:\r\n cycle(2, 16, 9, 15, b)\r\n cycle(3, 18, 8, 13, b)\r\n elif k == 2:\r\n cycle(6, 18, 22, 14, b)\r\n cycle(7, 19, 23, 15, b)\r\n elif k == 3:\r\n cycle(0, 4, 8, 23, b)\r\n cycle(2, 6, 10, 21, b)\r\n elif k == 4:\r\n cycle(3, 20, 11, 7, b)\r\n cycle(1, 22, 9, 5, b)\r\n elif k == 5:\r\n cycle(1, 12, 10, 19, b)\r\n cycle(0, 14, 11, 17, b)\r\n \r\nfor i in range(6):\r\n for j in range(2):\r\n rotate(i, j)\r\n if solved():\r\n print(\"YES\")\r\n exit()\r\n rotate(i, 1-j)\r\nprint(\"NO\")\r\n", "l = list(map(int, input().split()))\r\nl.insert(0, 0)\r\n\r\n########################## CASE 1 #########################\r\n ## CLOCKWISE\r\nl1 = [13, 14, 15, 16]\r\nl2 = [17, 18, 19, 20]\r\nl3 = [1, 3, 6, 8]\r\nl4 = [2, 4, 22, 24]\r\nl5 = [5, 7, 10, 12]\r\nl6 = [9, 11, 21, 23]\r\n\r\ncheck = 0\r\nif l[l1[0]] == l[l1[1]] == l[l1[2]] == l[l1[3]]:\r\n if l[l2[0]] == l[l2[1]] == l[l2[2]] == l[l2[3]]:\r\n if l[l3[0]] == l[l3[1]] == l[l3[2]] == l[l3[3]]:\r\n if l[l4[0]] == l[l4[1]] == l[l4[2]] == l[l4[3]]:\r\n if l[l5[0]] == l[l5[1]] == l[l5[2]] == l[l5[3]]:\r\n if l[l6[0]] == l[l6[1]] == l[l6[2]] == l[l6[3]]:\r\n check = 1\r\n \r\nif check: print('YES'), exit(0)\r\n\r\n ## ANTICLOCKWISE ##\r\nl1 = [13, 14, 15, 16]\r\nl2 = [17, 18, 19, 20]\r\nl3 = [1, 3, 21, 23]\r\nl4 = [5, 7, 2, 4]\r\nl5 = [9, 11, 6, 8]\r\nl6 = [10, 12, 22, 24]\r\n\r\ncheck = 0\r\nif l[l1[0]] == l[l1[1]] == l[l1[2]] == l[l1[3]]:\r\n if l[l2[0]] == l[l2[1]] == l[l2[2]] == l[l2[3]]:\r\n if l[l3[0]] == l[l3[1]] == l[l3[2]] == l[l3[3]]:\r\n if l[l4[0]] == l[l4[1]] == l[l4[2]] == l[l4[3]]:\r\n if l[l5[0]] == l[l5[1]] == l[l5[2]] == l[l5[3]]:\r\n if l[l6[0]] == l[l6[1]] == l[l6[2]] == l[l6[3]]:\r\n check = 1\r\n \r\nif check: print('YES'), exit(0)\r\n\r\n\r\n\r\n########################## CASE 2 #########################\r\n ## CLOCKWISE ##\r\nl1 = [1, 2, 3, 4]\r\nl2 = [9, 10, 11, 12]\r\nl3 = [5, 6, 19, 20]\r\nl4 = [7, 8, 13, 14]\r\nl5 = [15, 16, 21, 22]\r\nl6 = [17, 18, 23, 24]\r\n\r\nif l[l1[0]] == l[l1[1]] == l[l1[2]] == l[l1[3]]:\r\n if l[l2[0]] == l[l2[1]] == l[l2[2]] == l[l2[3]]:\r\n if l[l3[0]] == l[l3[1]] == l[l3[2]] == l[l3[3]]:\r\n if l[l4[0]] == l[l4[1]] == l[l4[2]] == l[l4[3]]:\r\n if l[l5[0]] == l[l5[1]] == l[l5[2]] == l[l5[3]]:\r\n if l[l6[0]] == l[l6[1]] == l[l6[2]] == l[l6[3]]:\r\n check = 1\r\n \r\nif check: print('YES'), exit(0)\r\n \r\n ## ANTICLOCKWISE\r\nl1 = [1, 2, 3, 4]\r\nl2 = [9, 10, 11, 12]\r\nl3 = [5, 6, 15, 16]\r\nl4 = [23, 24, 13, 14]\r\nl5 = [19, 20, 21, 22]\r\nl6 = [7, 8, 17, 18]\r\n\r\nif l[l1[0]] == l[l1[1]] == l[l1[2]] == l[l1[3]]:\r\n if l[l2[0]] == l[l2[1]] == l[l2[2]] == l[l2[3]]:\r\n if l[l3[0]] == l[l3[1]] == l[l3[2]] == l[l3[3]]:\r\n if l[l4[0]] == l[l4[1]] == l[l4[2]] == l[l4[3]]:\r\n if l[l5[0]] == l[l5[1]] == l[l5[2]] == l[l5[3]]:\r\n if l[l6[0]] == l[l6[1]] == l[l6[2]] == l[l6[3]]:\r\n check = 1\r\n \r\nif check: print('YES'), exit(0)\r\n\r\n\r\n\r\n\r\n########################## CASE 3 #########################\r\n ## CLOCKWISE ##\r\nl1 = [5, 6, 7, 8]\r\nl2 = [21, 22, 23, 24]\r\nl3 = [1, 2, 17, 19]\r\nl4 = [3, 4, 13, 15]\r\nl5 = [9, 10, 18, 20]\r\nl6 = [11, 12, 14, 16]\r\n\r\nif l[l1[0]] == l[l1[1]] == l[l1[2]] == l[l1[3]]:\r\n if l[l2[0]] == l[l2[1]] == l[l2[2]] == l[l2[3]]:\r\n if l[l3[0]] == l[l3[1]] == l[l3[2]] == l[l3[3]]:\r\n if l[l4[0]] == l[l4[1]] == l[l4[2]] == l[l4[3]]:\r\n if l[l5[0]] == l[l5[1]] == l[l5[2]] == l[l5[3]]:\r\n if l[l6[0]] == l[l6[1]] == l[l6[2]] == l[l6[3]]:\r\n check = 1\r\n \r\nif check: print('YES'), exit(0)\r\n\r\n ## ANTICLOCKWISE ##\r\nl1 = [5, 6, 7, 8]\r\nl2 = [21, 22, 23, 24]\r\nl3 = [3, 4, 18, 20]\r\nl4 = [17, 19, 11, 12]\r\nl5 = [9, 10, 15, 13]\r\nl6 = [14, 16, 1, 2]\r\n\r\nif l[l1[0]] == l[l1[1]] == l[l1[2]] == l[l1[3]]:\r\n if l[l2[0]] == l[l2[1]] == l[l2[2]] == l[l2[3]]:\r\n if l[l3[0]] == l[l3[1]] == l[l3[2]] == l[l3[3]]:\r\n if l[l4[0]] == l[l4[1]] == l[l4[2]] == l[l4[3]]:\r\n if l[l5[0]] == l[l5[1]] == l[l5[2]] == l[l5[3]]:\r\n if l[l6[0]] == l[l6[1]] == l[l6[2]] == l[l6[3]]:\r\n check = 1\r\n \r\nif check: print('YES'), exit(0)\r\n###########################################################################\r\nprint('NO')", "def check(a):\r\n if all([a[i:i + 4].count(a[i]) == 4 for i in range(0, 24, 4)]):\r\n exit(print('YES'))\r\n\r\n\r\na = [int(x) for x in input().split()]\r\nrot = [[1, 3, 5, 7, 9, 11, 24, 22], [2, 4, 6, 8, 10, 12, 23, 21], [13, 14, 5, 6, 17, 18, 21, 22],\r\n [15, 16, 7, 8, 19, 20, 23, 24], [1, 2, 18, 20, 12, 11, 15, 13], [3, 4, 17, 19, 10, 9, 16, 14]]\r\nfor x in rot:\r\n tem = a.copy()\r\n for i in range(8):\r\n tem[x[i] - 1] = a[x[(i + 2) % 8] - 1]\r\n check(tem)\r\n\r\n tem = a.copy()\r\n for i in range(8):\r\n tem[x[i] - 1] = a[x[(i - 2) % 8] - 1]\r\n check(tem)\r\nprint('NO')\r\n", "l=list(map(int,input().split()))\r\nU=l[0:4]\r\nF=l[4:8]\r\nD=l[8:12]\r\nL=l[12:16]\r\nR=l[16:20]\r\nB=l[20:24]\r\n\r\nif (L.count(L[0])==4 and R.count(R[0])==4) :\r\n if D[1]==D[3]==F[0]==F[2] and F[1]==F[3]==U[0]==U[2] and U[1]==U[3]==B[1]==B[3] and B[0]==B[2]==D[0]==D[2]:\r\n print(\"YES\")\r\n elif D[1]==D[3]==B[1]==B[3] and B[0]==B[2]==U[0]==U[2] and U[1]==U[3]==F[0]==F[2] and F[1]==F[3]==D[0]==D[2]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\nelif (U.count(U[0])==4 and D.count(D[0])==4):\r\n if L[0]==L[1]==F[2]==F[3] and F[0]==F[1]==R[2]==R[3] and R[0]==R[1]==B[2]==B[3] and B[0]==B[1]==L[2]==L[3]:\r\n print(\"YES\")\r\n elif L[0]==L[1]==B[2]==B[3] and B[0]==B[1]==R[2]==R[3] and R[0]==R[1]==F[2]==F[3] and F[0]==F[1]==L[2]==L[3]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\nelif (F.count(F[0])==4 and B.count(B[0])==4):\r\n if L[0]==L[2]==U[2]==U[3] and U[0]==U[1]==R[0]==R[2] and R[1]==R[3]==D[0]==D[1] and D[2]==D[3]==L[1]==L[3]:\r\n print(\"YES\")\r\n elif L[0]==L[2]==D[0]==D[1] and D[2]==D[3]==R[0]==R[2] and R[1]==R[3]==U[3]==U[2] and U[0]==U[1]==L[1]==L[3]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\nelse:\r\n print(\"NO\")\r\n", "def main():\r\n\traw = list(int(x) - 1 for x in input().split())\r\n\r\n\td = [[1, 2, 3, 4], [5, 6, 7, 8], \\\r\n\t\t[9, 10, 11, 12], [13, 14, 15, 16], \\\r\n\t\t[17, 18, 19, 20], [21, 22, 23, 24]]\r\n\tl = []\r\n\tfor i in range(6):\r\n\t\tl.append(raw[4 * i:4 * i + 4])\r\n\t# print(l)\r\n\r\n\r\n\tdef rt(x, y):\r\n\t\tprint(x, y)\r\n\t\tif x == (y + 1) % 6 or x == (y + 2) % 6 or x == (y + 3) % 6:\r\n\t\t\treturn True\r\n\t\telse:\r\n\t\t\treturn False\r\n\tc = 0\r\n\tfor face in l:\r\n\t\t# print(face)\r\n\t\tif face[0] == face[1] == face[2] == face[3]:\r\n\t\t\tc += 1\r\n\t\telif face[0] == face[1] and face[2] == face[3]:\r\n\t\t\tpass\r\n\t\telif face[0] == face[2] and face[1] == face[3]:\r\n\t\t\tpass\r\n\t\telse:\r\n\t\t\treturn 'NO'\r\n\tif c != 2:\r\n\t\treturn 'NO'\r\n\t# print(tags)/\r\n\r\n\r\n\td = []\r\n\td += [[[[0, 0], [0, 2], [1, 1], [1, 3]], [[1, 0], [1, 2], [2, 1], [2, 3]], [[2, 0], [2, 2], [5, 0], [5, 2]], [[5, 1], [5, 3], [0, 1], [0, 3]]]]\r\n\td += [[[[0, 1], [0, 3], [1, 0], [1, 2]], [[1, 1], [1, 3], [2, 0], [2, 2]], [[2, 1], [2, 3], [5, 1], [5, 3]], [[5, 0], [5, 2], [0, 0], [0, 2]]]]\r\n\td += [[[[1, 0], [1, 1], [4, 2], [4, 3]], [[4, 0], [4, 1], [5, 2], [5, 3]], [[5, 0], [5, 1], [3, 2], [3, 3]], [[3, 0], [3, 1], [1, 2], [1, 3]]]]\r\n\td += [[[[1, 2], [1, 3], [4, 0], [4, 1]], [[4, 2], [4, 3], [5, 0], [5, 1]], [[5, 2], [5, 3], [3, 0], [3, 1]], [[3, 2], [3, 3], [1, 0], [1, 1]]]]\r\n\td += [[[[0, 0], [0, 1], [4, 0], [4, 2]], [[4, 1], [4, 3], [2, 0], [2, 1]], [[2, 2], [2, 3], [3, 1], [3, 3]], [[3, 0], [3, 2], [0, 2], [0, 3]]]]\r\n\td += [[[[0, 2], [0, 3], [4, 1], [4, 3]], [[4, 0], [4, 2], [2, 2], [2, 3]], [[2, 0], [2, 1], [3, 0], [3, 2]], [[3, 1], [3, 3], [0, 0], [0, 1]]]]\r\n\r\n\r\n\r\n\tfor dd in d:\r\n\t\tflag = True\r\n\t\tfor i in dd:\r\n\t\t\t# print(i)\r\n\t\t\tif not(l[i[0][0]][i[0][1]] == l[i[1][0]][i[1][1]] == l[i[2][0]][i[2][1]] == l[i[3][0]][i[3][1]]):\r\n\t\t\t\tflag = False\r\n\t\t\t\tbreak\r\n\t\tif flag:\r\n\t\t\treturn 'YES'\r\n\r\n\treturn 'NO'\r\nprint(main())", "def xd(a,b,c,d):\n global s\n if(s[a-1]==s[b-1] and s[b-1]==s[c-1] and s[c-1]==s[d-1]): return 1\n else: return 0\ns=list(map(int,input().split()))\npd=0\nif(xd(13,14,15,16) and xd(17,18,19,20) and xd(1,3,6,8) and xd(5,7,10,12) and xd(9,11,21,23) and xd(2,4,22,24)): pd=1\nif(xd(13,14,15,16) and xd(17,18,19,20) and xd(1,3,21,23) and xd(5,7,2,4) and xd(9,11,6,8) and xd(22,24,10,12)): pd=1\nif(xd(1,2,3,4) and xd(9,10,11,12) and xd(5,6,19,20) and xd(17,18,23,24) and xd(21,22,15,16) and xd(13,14,7,8)): pd=1\nif(xd(1,2,3,4) and xd(9,10,11,12) and xd(5,6,15,16) and xd(17,18,7,8) and xd(21,22,19,20) and xd(13,14,23,24)): pd=1\nif(xd(5,6,7,8) and xd(21,22,23,24) and xd(3,4,13,15) and xd(14,16,11,12) and xd(9,10,18,20) and xd(17,19,1,2)): pd=1\nif(xd(5,6,7,8) and xd(21,22,23,24) and xd(3,4,18,20) and xd(14,16,1,2) and xd(9,10,13,15) and xd(17,19,11,12)): pd=1\nif(pd==1): print(\"YES\")\nelse: print(\"NO\")\n\t \t\t \t\t \t\t \t \t\t \t \t", "a = list(map(int, input().split()))\r\n\r\ntrans = [\r\n {1: 5, 3: 7, 5: 9, 7: 11, 9: 22, 11: 24, 22: 1, 24: 3},\r\n {5: 17, 6: 18, 17: 21, 18: 22, 21: 13, 22: 14, 13: 5, 14: 6},\r\n {3: 17, 4: 19, 17: 10, 19: 9, 9: 14, 10: 16, 14: 4, 16: 3},\r\n]\r\n\r\ndef check(c):\r\n for i in range(6):\r\n if len(set((c[i * 4 + j] for j in range(4)))) != 1:\r\n return False\r\n return True\r\n\r\ndef rotate(b, s, t):\r\n c = b[:]\r\n for i, j in zip(s, t):\r\n c[i - 1] = b[j - 1]\r\n return c\r\n\r\nfor k in trans:\r\n if check(rotate(a, *zip(*k.items()))):\r\n print('YES')\r\n exit()\r\n if check(rotate(a, *(list(zip(*k.items())))[::-1])):\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "a = list(map(int, input().split()))\r\nx, i, w = 0, 0, set()\r\nfor i in range(0, 24, 4):\r\n n = set(a[i : i + 4])\r\n if len(n) == 1:\r\n x += 1\r\n elif len(n) == 2:\r\n w.add(\" \".join(map(str, n)))\r\nprint([\"NO\", \"YES\"][x == 2 and len(set(w)) == 4])\r\n" ]

[ "import sys\r\nfrom types import GeneratorType\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def _read():\r\n return sys.stdin.readline().strip()\r\n\r\n def read_int(self):\r\n return int(self._read())\r\n\r\n def read_float(self):\r\n return float(self._read())\r\n\r\n def read_ints(self):\r\n return map(int, self._read().split())\r\n\r\n def read_floats(self):\r\n return map(float, self._read().split())\r\n\r\n def read_ints_minus_one(self):\r\n return map(lambda x: int(x) - 1, self._read().split())\r\n\r\n def read_list_ints(self):\r\n return list(map(int, self._read().split()))\r\n\r\n def read_list_floats(self):\r\n return list(map(float, self._read().split()))\r\n\r\n def read_list_ints_minus_one(self):\r\n return list(map(lambda x: int(x) - 1, self._read().split()))\r\n\r\n def read_str(self):\r\n return self._read()\r\n\r\n def read_list_strs(self):\r\n return self._read().split()\r\n\r\n def read_list_str(self):\r\n return list(self._read())\r\n\r\n @staticmethod\r\n def st(x):\r\n return sys.stdout.write(str(x) + '\\n')\r\n\r\n @staticmethod\r\n def lst(x):\r\n return sys.stdout.write(\" \".join(str(w) for w in x) + '\\n')\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n @staticmethod\r\n def bootstrap(f, queue=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if queue:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if isinstance(to, GeneratorType):\r\n queue.append(to)\r\n to = next(to)\r\n else:\r\n queue.pop()\r\n if not queue:\r\n break\r\n to = queue[-1].send(to)\r\n return to\r\n return wrappedfunc\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 parent = ac.read_list_ints_minus_one()\r\n edge = [[] for _ in range(n)]\r\n for i in range(n - 1):\r\n edge[parent[i]].append(i + 1)\r\n s = ac.read_str()\r\n\r\n queries = [[] for _ in range(n)]\r\n for i in range(m):\r\n v, h = ac.read_ints()\r\n queries[v - 1].append([h - 1, i])\r\n\r\n ans = [0] * m\r\n depth = [0] * n\r\n\r\n stack = [[0, 0]]\r\n while stack:\r\n i, height = stack.pop()\r\n if i >= 0:\r\n for h, j in queries[i]:\r\n ans[j] ^= depth[h]\r\n depth[height] ^= 1 << (ord(s[i]) - ord(\"a\"))\r\n stack.append([~i, height])\r\n for j in edge[i]:\r\n stack.append([j, height + 1])\r\n else:\r\n i = ~i\r\n for h, j in queries[i]:\r\n ans[j] ^= depth[h]\r\n for a in ans:\r\n ac.st(\"Yes\" if a & (a - 1) == 0 else \"No\")\r\n return\r\n\r\n\r\nSolution().main()", "import sys\r\ninput = sys.stdin.readline\r\nn, q = map(int, input().split())\r\np = list(map(int, input().split()))\r\ng = [[] for _ in range(n)]\r\nfor i in range(n - 1):\r\n g[p[i] - 1].append(i + 1)\r\ns = input().strip()\r\nqueries = [[] for _ in range(n)]\r\nans = [0] * q\r\nfor i in range(q):\r\n x, d = map(int, input().split())\r\n queries[x - 1].append((d - 1) * q + i)\r\n\r\nmasks = [0] * n\r\nstack = [0]\r\nwhile stack:\r\n T = stack.pop()\r\n flag, depth, son = T // (n * n), T // n % n, T % n\r\n if not flag:\r\n masks[depth] ^= 1 << (ord(s[son]) - ord('a'))\r\n for x in queries[son]:\r\n d, i = divmod(x, q)\r\n ans[i] ^= masks[d]\r\n stack.append(n * n + T)\r\n for x in g[son]:\r\n stack.append((depth + 1) * n + x)\r\n else:\r\n for x in queries[son]:\r\n d, i = divmod(x, q)\r\n ans[i] ^= masks[d]\r\nfor i in ans:\r\n print(\"Yes\" if i & (i - 1) == 0 else \"No\")", "import bisect\r\nimport 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(m):\r\n u, v = p[i + 2], i + 2\r\n s[u + 2] += 1\r\n x[2 * i], x[2 * 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 euler_tour():\r\n s = []\r\n s.append(1)\r\n now = list(s0)\r\n t = 1\r\n t1, t2 = [-1] * (n + 1), [-1] * (n + 1)\r\n dist = [inf] * (n + 1)\r\n dist[1] = 1\r\n v = []\r\n while s:\r\n i = s[-1]\r\n if t1[i] == -1:\r\n v.append(i)\r\n t1[i] = t\r\n t += 1\r\n if now[i] == s0[i + 1]:\r\n t2[i] = t\r\n t += 1\r\n s.pop()\r\n else:\r\n s.append(G[now[i]])\r\n dist[s[-1]] = dist[i] + 1\r\n now[i] += 1\r\n return t1, t2, dist, v\r\n\r\nn, m = map(int, input().split())\r\np = [0, 0] + list(map(int, input().split()))\r\ns = list(input().rstrip())\r\ns = [0] + [i - 97 for i in s]\r\nG, s0 = make_graph(n, n - 1)\r\ninf = pow(10, 9) + 1\r\nt1, t2, dist, v = euler_tour()\r\nl0 = max(dist[1:]) + 5\r\nx = [[] for _ in range(l0)]\r\ny = [[0] for _ in range(l0)]\r\npow2 = [1]\r\nfor _ in range(26):\r\n pow2.append(2 * pow2[-1])\r\nfor i in v:\r\n j = dist[i]\r\n x[j].append(t1[i])\r\n y[j].append(y[j][-1] ^ pow2[s[i]])\r\nz = set(pow2 + [0])\r\nans = []\r\nfor _ in range(m):\r\n v, h = map(int, input().split())\r\n if dist[v] == h or h >= l0 or not x[h]:\r\n ans0 = \"Yes\"\r\n else:\r\n xh = x[h]\r\n l = bisect.bisect_left(xh, t1[v])\r\n r = bisect.bisect_right(xh, t2[v])\r\n ans0 = \"Yes\" if y[h][l] ^ y[h][r] in z else \"No\"\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(ans))", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 4096\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 = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef I():\r\n return input()\r\n\r\n\r\ndef II():\r\n return int(input())\r\n\r\n\r\ndef MII():\r\n return map(int, input().split())\r\n\r\n\r\ndef LI():\r\n return list(input().split())\r\n\r\n\r\ndef LII():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n\r\n\r\ninf = float('inf')\r\n\r\nn, m = MII()\r\nparent = [-1] + LGMI()\r\ntree = [[] for _ in range(n)]\r\nfor i, v in enumerate(parent):\r\n if i: tree[v].append(i)\r\n\r\ndepth = [0] * n\r\nstack = [0]\r\nwhile stack:\r\n u = stack.pop()\r\n for v in tree[u]:\r\n depth[v] = depth[u] + 1\r\n stack.append(v)\r\n\r\ns = I()\r\nqueries = [[] for _ in range(n)]\r\nfor idx in range(m):\r\n v, d = GMI()\r\n queries[v].append([d, idx])\r\n\r\nans = [0] * m\r\ndepth_xor_acc = [0] * n\r\nstack = [[0, 0]]\r\nwhile stack:\r\n u, flag = stack.pop()\r\n if not flag:\r\n for d, idx in queries[u]:\r\n ans[idx] ^= depth_xor_acc[d]\r\n depth_xor_acc[depth[u]] ^= 1 << (ord(s[u]) - ord('a'))\r\n stack.append([u, 1])\r\n for v in tree[u]:\r\n stack.append(([v, 0]))\r\n else:\r\n for d, idx in queries[u]:\r\n ans[idx] ^= depth_xor_acc[d]\r\n\r\nfor v in ans:\r\n print('Yes' if v & (v - 1) == 0 else 'No')\r\n" ]

[ "n = int(input())\narr = list(map(int, input().split(' ')))\nroot=-1\nfor i,a in enumerate(arr) :\n if i == a-1 :\n root = i\n break\nv = [False]*len(arr)\nif root>-1 :\n v[root]=True\nans = 0\nfor i,a in enumerate(arr) :\n if v[i] :\n continue\n v[i]= True\n l=[i]\n a-=1\n while not v[a] :\n l.append(a)\n v[a]=True\n a=arr[a]-1\n if a in l: #new cycle\n if root==-1:\n arr[a]=a+1\n root=a\n ans+=1\n else :\n arr[a]=root+1\n ans+=1\nprint(ans)\nprint(' '.join(map(str,arr)))\n\t \t\t", "# Why do we fall ? So we can learn to pick ourselves up.\r\n\r\n\r\nroot = -1\r\n\r\ndef find(i,time):\r\n parent[i] = time\r\n while not parent[aa[i]]:\r\n i = aa[i]\r\n parent[i] = time\r\n # print(parent,\"in\",i)\r\n if parent[aa[i]] == time:\r\n global root\r\n if root == -1:\r\n root = i\r\n if aa[i] != root:\r\n aa[i] = root\r\n global ans\r\n ans += 1\r\n\r\n\r\n\r\n\r\nn = int(input())\r\naa = [0]+[int(i) for i in input().split()]\r\n\r\nparent = [0]*(n+1)\r\n\r\nans = 0\r\ntime = 0\r\n\r\nfor i in range(1,n+1):\r\n if aa[i] == i:\r\n root = i\r\n break\r\n\r\nfor i in range(1,n+1):\r\n if not parent[i]:\r\n # print(i,\"pp\")\r\n time += 1\r\n find(i,time)\r\n# print(parent)\r\nprint(ans)\r\nprint(*aa[1:])\r\n\r\n", "# from debug import debug\r\nimport sys; input = sys.stdin.readline\r\nn = int(input())\r\nlis = [0, *map(int , input().split())]\r\nv = [0]*(n+1)\r\ncycles = set()\r\nroots = set()\r\nfor i in range(1, n+1):\r\n\tif v[i] == 0:\r\n\t\tnode = i\r\n\t\twhile v[node] == 0:\r\n\t\t\tv[node] = 1\r\n\t\t\tnode = lis[node]\r\n\t\tif v[node] == 2: continue\r\n\t\tstart = node\r\n\t\tignore = 0\r\n\t\tl = 1\r\n\t\twhile lis[node] != start:\r\n\t\t\tif v[node] == 2: ignore = 1; break\r\n\t\t\tv[node] = 2\r\n\t\t\tnode = lis[node]\r\n\t\t\tl+=1\r\n\t\tif ignore: continue\r\n\t\tv[node] = 2\r\n\t\tif l == 1: roots.add(node)\r\n\t\telse: cycles.add(node)\r\nans = 0\r\nif roots:\r\n\tbase = roots.pop()\r\n\tfor i in roots: lis[i] = base; ans+=1\r\n\tfor i in cycles: lis[i] = base; ans+=1\r\nelif cycles:\r\n\tbase = cycles.pop()\r\n\tcycles.add(base)\r\n\tfor i in roots: lis[i] = base; ans+=1\r\n\tfor i in cycles: lis[i] = base; ans+=1\r\nprint(ans)\r\nprint(*lis[1:])\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 = int(input())\r\nA = [i-1 for i in list(map(int, input().split()))]\r\nP = [[] for _ in range(N)]\r\nins = [0]*N\r\nfor i in range(N):\r\n if A[i]!=i:\r\n P[i].append(A[i])\r\n ins[A[i]]+=1\r\n\r\nv = []\r\nfor i in range(N):\r\n if ins[i]==0:\r\n v.append(i)\r\n \r\nB = []\r\nwhile v:\r\n i = v.pop()\r\n if len(P[i])==0:\r\n B.append(i)\r\n for j in P[i]:\r\n ins[j]-=1\r\n if ins[j]==0:\r\n v.append(j)\r\n\r\n#print(B)\r\ncolor = 0\r\nseen = [0]*N\r\n\r\ndef paint(idx, color):\r\n v = [idx]\r\n while v:\r\n i = v.pop()\r\n if seen[i]:continue\r\n seen[i] = color\r\n for j in P[i]:\r\n if seen[j]:continue\r\n v.append(j)\r\n\r\nfor i in range(N):\r\n if ins[i]>0 and seen[i]==0:\r\n color +=1\r\n paint(i, color)\r\n#print(seen)\r\ncnt = 0\r\nr = -1\r\nif B:\r\n r = B[0]\r\n A[r] = r\r\n for b in B[1:]:\r\n A[b] = r\r\n cnt = len(B)-1\r\n\r\nfind = set()\r\nfor i in range(N):\r\n if seen[i]>0:\r\n if not seen[i] in find:\r\n if r==-1:\r\n r = i\r\n A[r] = r\r\n else:\r\n A[i] = r\r\n cnt+=1\r\n find.add(seen[i])\r\n \r\nprint(cnt)\r\nprint(*[i+1 for i in A])\r\n\r\n\r\n", "from collections import deque\r\n\r\n# Para revisar la correctitud pueden probar el codigo en el codeforce que va a dar accepted\r\n\r\n# ver si hay un camino que llega a el a partir\r\n# de su padre entonces hay un ciclo\r\n\r\n\r\ndef Padre(x, padre):\r\n while x != padre[x]:\r\n x = padre[x]\r\n return x\r\n\r\n\r\ndef FixATree():\r\n n = int(input())\r\n A = list(map(lambda x: int(x)-1, input().split()))\r\n\r\n padre = [x for x in range(0, n)]\r\n ciclosC = 0\r\n ciclos = deque([])\r\n root = []\r\n\r\n # ir haciendo Merge a cada arista\r\n for i in range(0, n):\r\n\r\n p = Padre(A[i], padre)\r\n # Si dicha arista perticipa en un ciclo\r\n if p == i:\r\n # Si es un ciclo del tipo raiz y no hay raiz\r\n if not root and (i == A[i]):\r\n root = [i, A[i]]\r\n else:\r\n ciclos.append([i, A[i]])\r\n ciclosC += 1\r\n # Si no hay ciclo\r\n else:\r\n padre[i] = A[i]\r\n\r\n print(str(ciclosC))\r\n # si existe al menos un ciclo diferente d raiz\r\n if ciclosC:\r\n i = 0\r\n # si no hay raiz el primer ciclo lo hago raiz\r\n if not root:\r\n root = ciclos.popleft()\r\n i = 1\r\n\r\n # los restantes ciclos hago que su padre sea la raiz\r\n while ciclos:\r\n ciclo = ciclos.popleft()\r\n padre[ciclo[0]] = root[0]\r\n\r\n PC = [x + 1 for x in padre]\r\n print(*PC, sep=\" \")\r\n\r\n\r\nFixATree()\r\n\r\n\r\n# Casos de prueba:\r\n# 4\r\n# 2 3 3 4\r\n# respuesta\r\n# 1\r\n# 2 3 3 3\r\n\r\n# 5\r\n# 3 2 2 5 3\r\n# respuesta\r\n# 0\r\n# 3 2 2 5 3\r\n\r\n# 8\r\n# 2 3 5 4 1 6 6 7\r\n# respuesta\r\n# 2\r\n# 2 3 5 4 1 4 6 7\r\n\r\n# El codigo da accepted en el codeforce por lo que los casos de prueba que emplee son los que ahi estan\r\n", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\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\nfrom functools import lru_cache\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\n \r\nN= int(input())\r\nA = alele()\r\nroot = -1\r\nvis = [False]*N\r\nfor i in range(N):\r\n if i == A[i] - 1:\r\n root = i\r\n vis[i] = True\r\n break\r\ncount = 0\r\nfor i in range(N):\r\n if not vis[i]:\r\n vis[i] = True;x= A[i]-1\r\n temp =[i]\r\n while not vis[x]:\r\n temp.append(x)\r\n vis[x] = True\r\n x = A[x] - 1\r\n if x in temp:\r\n if root == -1: root = x\r\n A[x] = root + 1\r\n count += 1\r\nprint(count)\r\nprint(*A)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nget_value = lambda x: int(x) - 1\r\n\r\nn = int(input())\r\nli = list(map(get_value, input().split()))\r\n\r\ntotal = 0\r\n\r\nvt = [False] * n\r\nroot = -1\r\nfor i in range(n):\r\n if li[i] == i:\r\n vt[i] = True\r\n \r\n if root == -1:\r\n root = i\r\n else:\r\n total += 1\r\n li[i] = root\r\n \r\nfor i in range(n):\r\n if vt[i]:\r\n continue\r\n vt[i] = True\r\n \r\n ni = i\r\n part_st = {i}\r\n is_cycled = False\r\n while True:\r\n ni = li[ni]\r\n if vt[ni]:\r\n if ni in part_st:\r\n is_cycled = True\r\n break\r\n else:\r\n break\r\n else:\r\n vt[ni] = True\r\n part_st.add(ni)\r\n\r\n if is_cycled:\r\n total += 1\r\n to_root_index = part_st.pop()\r\n if root == -1:\r\n root = to_root_index\r\n li[to_root_index] = root\r\n \r\nprint(total)\r\n\r\nli = [v + 1 for v in li]\r\nprint(*li)", "import threading\r\nimport sys\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nsys.setrecursionlimit(10**8)\r\nfrom collections import defaultdict\r\ndef main():\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n arr=[el-1 for el in arr]\r\n root=-1\r\n c=0\r\n for i,el in enumerate(arr):\r\n if i==el:\r\n if root==-1:\r\n root=i\r\n else :\r\n c+=1\r\n arr[i]=root\r\n # if root==-1:\r\n # root=0\r\n # arr[0]=0\r\n # c+=1\r\n parent=[i for i in range(n)]\r\n def find(x):\r\n if parent[x]!=x:\r\n parent[x]=find(parent[x])\r\n return parent[x]\r\n def union(i,j):\r\n fi,fj=find(i),find(j)\r\n parent[fi]=fj\r\n for i,el in enumerate(arr):\r\n if i!=el:\r\n if find(i)!=find(el):\r\n union(i,el)\r\n else :\r\n if root==-1:\r\n root=i\r\n arr[i]=i\r\n else :\r\n arr[i]=root\r\n c+=1\r\n print(c)\r\n arr=[el+1 for el in arr]\r\n print(*arr)\r\n\r\n \r\nthreading.stack_size(10 ** 8)\r\nt = threading.Thread(target=main)\r\nt.start()\r\nt.join()\r\n", "from collections import defaultdict\r\nfrom sys import stdin,setrecursionlimit\r\nsetrecursionlimit(10**6)\r\nimport threading\r\ndef f(a):\r\n\tn=len(a)\r\n\ta=list(map(lambda s:s-1,a))\r\n\troot=None\r\n\tfor i in range(len(a)):\r\n\t\tif a[i]==i:\r\n\t\t\troot=i\r\n\tvis=[0]*(n)\r\n\ttraitors=[]\r\n\tfor i in range(0,n):\r\n\t\tcycle=-1\r\n\t\tcur=i\r\n\t\tmove=set()\r\n\r\n\t\twhile vis[cur]==0:\r\n\t\t\tvis[cur]=1\r\n\t\t\tmove.add(cur)\r\n\t\t\tif a[cur] in move:\r\n\t\t\t\tcycle=cur\r\n\t\t\tcur=a[cur]\r\n\t\tif cycle!=-1:\r\n\t\t\ttraitors.append(cycle)\r\n\tans=len(traitors)-1\r\n\tif root==None:\r\n\t\ta[traitors[0]]=traitors[0]\r\n\t\troot=traitors[0]\r\n\t\tans+=1\r\n\tfor i in traitors:\r\n\t\tif i!=root:\r\n\t\t\ta[i]=root\r\n\tprint(ans)\r\n\ta=list(map(lambda s:s+1,a))\r\n\treturn a\r\nn=input()\r\na=list(map(int,input().strip().split()))\r\nprint(*f(a))", "import sys\r\ninput=sys.stdin.readline\r\ndef ss(n,l):\r\n for i in range(n):\r\n l[i]=l[i]-1 \r\n d={i:[] for i in range(n)}\r\n \r\n for i in range(n):\r\n d[l[i]].append(i)\r\n \r\n parent=-1 \r\n t=l[:]\r\n \r\n for i in range(n):\r\n if l[i]==i:\r\n if parent==-1:\r\n parent=i \r\n \r\n v=[0 for _ in range(n)]\r\n r=[0 for _ in range(n)]\r\n \r\n \r\n # def isCyclle(node):\r\n # nonlocal t, parent\r\n \r\n # v[node]=1 \r\n # r[node]=1 \r\n \r\n # for child in d[node]:\r\n # if v[child]==0:\r\n # if isCyclle(child):\r\n \r\n # if parent==-1:\r\n # # print(node)\r\n # parent=child \r\n # # t[child]=parent\r\n \r\n # return True \r\n # else:\r\n # if r[child]==1:\r\n # if parent==-1:\r\n # # print(node)\r\n # parent=child \r\n # t[child]=parent\r\n # return True \r\n # r[node]=0 \r\n # return False\r\n\r\n \r\n # t[parent]=parent\r\n for curr in range(n):\r\n flag=0\r\n if v[curr]==0:\r\n # if isCyclle(curr):\r\n # continue\r\n q=[curr]\r\n while q:\r\n node=q.pop(-1)\r\n \r\n v[node]=1 \r\n r[node]=1 \r\n # print(node,q, v, r)\r\n f=0\r\n for child in d[node]:\r\n # print(\"here\",node, child, v,r)\r\n if v[child]==0:\r\n q.append(node)\r\n q.append(child)\r\n f=1\r\n break \r\n elif r[child]==1:\r\n # print(\"cycle found\",node, child)\r\n f=1 \r\n if parent==-1:\r\n parent=child\r\n if flag==0:\r\n t[child]=parent \r\n flag=1\r\n \r\n if f==0:\r\n r[node]=0 \r\n \r\n ans=0\r\n for i in range(n):\r\n if l[i]!=t[i]:\r\n ans+=1 \r\n \r\n for i in range(n):\r\n t[i]+=1\r\n \r\n return ans,t\r\n\r\n\r\n# n=int(input())\r\n# l=list(map(int, input().split()))\r\n\r\n# ans,t=ss(n,l)\r\n\r\n# print(ans)\r\n# print(*t) \r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\npar=[]\r\nfor i in range(n):\r\n\tif a[i]==i+1:\r\n\t\tpar.append(i)\r\nv=[False for i in range(n)]\r\nfor i in par:\r\n\tv[i]=True\r\nccl=[]\r\nfor i in range(n):\r\n\tif v[i]:continue\r\n\ts=[i]\r\n\tv[i]=True\r\n\tp=set(s)\r\n\tt=True\r\n\twhile s and t:\r\n\t\tx=s.pop()\r\n\t\tj=a[x]-1\r\n\t\tif j in p:\r\n\t\t\tccl.append(j)\r\n\t\t\tt=False\r\n\t\telse:\r\n\t\t\ts.append(j)\r\n\t\t\tp.add(j)\r\n\t\tif v[j]:t=False\r\n\t\telse:v[j]=True\r\nif len(par)==0:\r\n\tprint(len(ccl))\r\n\tc=ccl[0]\r\n\ta[c]=c+1\r\n\tfor i in range(1,len(ccl)):\r\n\t\ta[ccl[i]]=c+1\r\n\tprint(*a)\r\nelse:\r\n\tprint(len(ccl)+len(par)-1)\r\n\tc=par[0]\r\n\tfor i in range(1,len(par)):\r\n\t\ta[par[i]]=c+1\r\n\tfor i in range(len(ccl)):\r\n\t\ta[ccl[i]]=c+1\r\n\tprint(*a)", "# [https://codeforces.com/contest/698/submission/42129034]\r\n\r\ninput()\r\n\r\nA = list(map(int, input().split(' ')))\r\n\r\nroot = -1\r\n\r\nfor i,a in enumerate(A) :\r\n if i == a-1 :\r\n root = i\r\n break\r\n \r\nv = [False]*len(A)\r\nif root>-1 :\r\n v[root]=True\r\n \r\nchanged = 0\r\n\r\nfor i,a in enumerate(A) :\r\n if v[i] :\r\n continue\r\n v[i]= True\r\n l=[i]\r\n a-=1\r\n while not v[a] :\r\n l.append(a)\r\n v[a]=True\r\n a=A[a]-1\r\n if a in l: \r\n if root==-1:\r\n A[a]=a+1\r\n root=a\r\n changed+=1\r\n else :\r\n A[a]=root+1\r\n changed+=1\r\n \r\nprint(changed)\r\nprint(' '.join(map(str,A)))", "import sys\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\narr = [int(h) for h in input().split()]\r\nvisited = [0] * n\r\nchange = []\r\nroot = []\r\nfor i in range(1, n + 1):\r\n if arr[i - 1] == i:\r\n root.append(i)\r\n j = i\r\n if visited[i - 1] == 1:\r\n continue\r\n h = set()\r\n while j not in h and visited[j - 1] == 0:\r\n h.add(j)\r\n visited[j - 1] = 1\r\n j = arr[j - 1]\r\n visited[j - 1] = 1 \r\n if j in h:\r\n change.append(j) \r\nchange = list(set(change))\r\n# print(root, change)\r\nif len(root) == 0:\r\n print(len(change))\r\n for f in change:\r\n arr[f - 1] = change[0]\r\n print(*arr)\r\nelse:\r\n print(len(change) - 1)\r\n for f in change:\r\n arr[f - 1] = root[0]\r\n print(*arr)\r\n" ]

[ "a='ABSINTH BEER BRANDY CHAMPAGNE GIN RUM SAKE TEQUILA VODKA WHISKEY WINE'.split()\r\nn=int(input())\r\nans=0\r\nfor i in range(n):\r\n x=input()\r\n if x in a or x.isdigit() and int(x)<18:ans+=1\r\nprint(ans)", "\r\nn = int(input())\r\n\r\ncount = 0\r\na=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(n):\r\n s = input()\r\n \r\n if s[0]>='0' and s[0]<='9' and int(s)<18 or s in a: \r\n \r\n count += 1\r\n \r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n", "r=0\r\nl=[\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\r\nl1=[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\"]\r\nfor i in range(int(input())):\r\n s=input()\r\n if(s[0] in l1):\r\n k=int(s)\r\n else:\r\n k=20\r\n if(k<18):\r\n r=r+1\r\n elif(s in l):\r\n r=r+1\r\nprint(r)", "count = 0\r\nt=int(input())\r\nfor j in range(0,t):\r\n s=input()\r\n try:\r\n if int(s)<18:\r\n count+=1\r\n except:\r\n lis=[ \"ABSINTH\", 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n if s in lis:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nalchoholic = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nans = 0\r\nfor i in range(n):\r\n x = input()\r\n if x in alchoholic:\r\n ans += 1\r\n elif x.isnumeric():\r\n if int(x) < 18:\r\n ans += 1\r\nprint(ans)", "ALCOHOL = { \"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\",\r\n \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\" }\r\n\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n s = input()\r\n if (s[0].isdigit() and int(s) < 18) or s in ALCOHOL:\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\nans=0\r\nfor z in range(n):\r\n a=input()\r\n if a.isdigit():\r\n if int(a)<18:\r\n ans+=1\r\n else:\r\n if a in ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\na = 0\r\nq = '1234567890'\r\ne = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(n):\r\n s = input()\r\n if s[0] in q:\r\n s = int(s)\r\n if s < 18:\r\n a += 1\r\n else:\r\n if s in e:\r\n a += 1\r\nprint(a)\r\n \r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nans = 0\r\nfor q in (input().rstrip() for _ in range(n)):\r\n if q.isnumeric():\r\n if int(q) < 18:\r\n ans += 1\r\n else:\r\n if q in \"ABSINTH BEER BRANDY CHAMPAGNE GIN RUM SAKE TEQUILA VODKA WHISKEY WINE\".split():\r\n ans += 1\r\n\r\nprint(ans)\r\n", "t=int(input())\r\nres=0\r\na=['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\nfor i in range(t):\r\n s=input()\r\n if s[0].isalpha():\r\n if s in a:\r\n res+=1\r\n else:\r\n if int(s)<=17:\r\n res+=1\r\nprint(res)", "alc_drinks = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nresult = 0\r\nfor _ in range(int(input())):\r\n inp = input()\r\n if inp.isnumeric():\r\n if int(inp) < 18:\r\n result += 1\r\n else:\r\n if inp in alc_drinks:\r\n result += 1\r\nprint(result)\r\n\r\n", "n=int(input())\r\nc=0\r\nl=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(0, n):\r\n s=input()\r\n if s[0]>='0' and s[0]<='9':\r\n x=int(s)\r\n if x<18:\r\n c+=1\r\n elif s in l:\r\n c+=1\r\nprint(c)\r\n", "n, ans = int(input()), 0\r\nalcohols = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor i in range(n):\r\n temp = input()\r\n if temp in alcohols:\r\n ans += 1\r\n elif temp.isdigit() and int(temp) < 18:\r\n ans += 1\r\nprint(ans)", "def n_check_addtl(info: list):\n alcohol_drinks = [\n 'ABSINTH', 'BEER', 'BRANDY',\n 'CHAMPAGNE', 'GIN', 'RUM',\n 'SAKE', 'TEQUILA', 'VODKA',\n 'WHISKEY', 'WINE']\n\n alcoholic_people = sum(info.count(drink) for drink in alcohol_drinks)\n under_age_people = sum(info.count(str(age)) for age in range(18))\n\n return alcoholic_people + under_age_people\n\ninfo = [input() for item in range(int(input()))]\nmin_to_check = n_check_addtl(info)\nprint(min_to_check)\n", "drinks=['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\nn=int(input())\r\nl=[]\r\nfor i in range(0,n):\r\n l.append(input())\r\ncount=0\r\nfor i in range(0,n):\r\n if l[i].isnumeric():\r\n if int(l[i])<18:\r\n count+=1\r\n else:\r\n if l[i] in drinks:\r\n count+=1\r\nprint(count)\r\n", "withAlcohol = \"ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE\".split(\", \")\r\n\r\ndef toCheck(line):\r\n if 'A' <= line[0] <= 'Z':\r\n return line in withAlcohol\r\n else:\r\n return int(line) < 18 \r\n\r\nlst = [w.rstrip() for w in open(0).readlines()]\r\nres = sum(1 for line in lst[1:] if toCheck(line))\r\nprint(res)", "alcohols = set('''ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE'''.split(', '))\r\n\r\nans= 0\r\nfor i in range(int(input())):\r\n a = input()\r\n ans+= int(a)<18 if a.isdigit() else a in alcohols\r\n \r\n\r\nprint(ans)\r\n ", "a=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nr=0\r\nfor s in [*open(0)][1:]:\r\n if s[0].isdigit():r+=int(s)<18\r\n else:r+=s[:-1]in a\r\nprint(r)", "drink_list = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\ncount = 0\npatrons = []\nfor _ in range(int(input())):\n x = input()\n if x.isnumeric():\n patrons.append(int(x))\n else:\n patrons.append(x)\nfor i in range(len(patrons)):\n if isinstance(patrons[i], int) == True:\n if patrons[i] < 18:\n count += 1\n else:\n if patrons[i] in drink_list:\n count += 1\nprint(count)", "class CodeforcesTask56ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.clients = []\n\n def read_input(self):\n self.n = int(input())\n for x in range(self.n):\n self.clients.append(input())\n\n def process_task(self):\n cnt = 0\n for x in range(self.n):\n try:\n j = int(self.clients[x])\n if j < 18:\n cnt += 1\n except ValueError:\n if self.clients[x] in [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\",\n \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]:\n cnt += 1\n self.result = str(cnt)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask56ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "l=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nc=0\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\tif s in l:\r\n\t\tc+=1\r\n\telse:\r\n\t\ttry:\r\n\t\t\tif int(s)<18:\r\n\t\t\t\tc+=1\r\n\t\texcept:\r\n\t\t\tpass\r\nprint(c)", "n = int(input())\r\nk = 0\r\nc = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range (n):\r\n a = input()\r\n f = 0\r\n if ord(a[0])>57:\r\n for i in c:\r\n if i==a:\r\n f+=1\r\n if f>0:\r\n k+=1\r\n else:\r\n if int(a)<18:\r\n k+=1\r\nprint (k)", "n = int(input())\r\ndata = []\r\nfor i in range(n):\r\n inp = input()\r\n data.append(inp)\r\n\r\nages = [int(i) for i in data if i[0] in '1234567890']\r\ndrinks = [i for i in data if i not in ages]\r\nalcoholic_drinks = [\"ABSINTH\", \"BEER\", \"BRANDY\", \r\n \"CHAMPAGNE\", \"GIN\", \"RUM\", \r\n \"SAKE\", \"TEQUILA\", \"VODKA\", \r\n \"WHISKEY\", \"WINE\"]\r\n \r\nunderage = 0\r\nalcoholic = 0\r\n\r\nfor i in ages:\r\n if int(i) < 18:\r\n underage += 1\r\n\r\nfor i in drinks:\r\n if i in alcoholic_drinks:\r\n alcoholic += 1\r\n\r\nprint(underage + alcoholic)\r\n", "drink=['ABSINTH', 'BEER', 'BRANDY',\r\n 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY',\r\n 'WINE']\r\nres=0\r\nfor k in range(int(input())):\r\n a=input()\r\n if a.isdigit() and int(a)<18:\r\n res+=1\r\n elif a in drink:\r\n res+=1\r\nprint(res)\r\n\r\n \r\n \r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Apr 5 18:07:52 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\nstr=[\"ABSINTH\", \"BEER\", \"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\r\nn=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n h=input()\r\n l+=[h]\r\n if h.isalpha():\r\n if h in str:\r\n c+=1\r\n elif h.isdigit():\r\n h=int(h)\r\n if h<18:\r\n c+=1\r\nprint(c)\r\n ", "x = int(input())\r\nz = []\r\nw = []\r\np = []\r\n\r\ncounter = 0\r\nlst = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(x):\r\n z[0:] = map(str, input().split())\r\n if z[0].isdigit():\r\n p.append(int(z[0]))\r\n else:\r\n w.append(z[0])\r\n\r\nfor i in w:\r\n if i in lst:\r\n counter += 1\r\nfor i in p:\r\n if i < 18:\r\n counter += 1\r\nprint(counter)", "t = int(input())\nalco = \"ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE\".replace(\",\",\"\").split()\ncheck = 0\nfor _ in range(t):\n n = input()\n check += int(n.isdigit() and int(n) < 18 or n in alco)\nprint(check)\n", "drinks = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN',\r\n 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nc = 0\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s.isdigit():\r\n if int(s) < 18:\r\n c += 1\r\n else:\r\n if s in drinks:\r\n c += 1\r\nprint(c)\r\n", "lst1=[]\r\nlst2=[]\r\nn=int(input())\r\ncount1=int(0)\r\ncount2=int(0)\r\n\r\nfor i in range(0,n): \r\n ele = input()\r\n if ele.isdigit():\r\n ele=int(ele)\r\n count1+=1\r\n lst1.append(ele)\r\n else:\r\n count2+=1\r\n lst2.append(ele)\r\n\r\n\r\nans=int(0)\r\n\r\nfor i in range(0,count1):\r\n if(lst1[i]<18):\r\n ans+=1\r\n \r\nfor i in range(0,count2):\r\n if(lst2[i]=='ABSINTH'):\r\n ans+=1\r\n elif(lst2[i]=='BEER'):\r\n ans+=1\r\n elif(lst2[i]=='BRANDY'):\r\n ans+=1\r\n elif(lst2[i]=='CHAMPAGNE'):\r\n ans+=1\r\n elif(lst2[i]=='GIN'):\r\n ans+=1\r\n elif(lst2[i]=='RUM'):\r\n ans+=1\r\n elif(lst2[i]=='SAKE'):\r\n ans+=1\r\n elif(lst2[i]=='TEQUILA'):\r\n ans+=1\r\n elif(lst2[i]=='VODKA'):\r\n ans+=1\r\n elif(lst2[i]=='WHISKEY'):\r\n ans+=1\r\n elif(lst2[i]=='WINE'):\r\n ans+=1\r\n \r\n\r\n\r\n\r\nprint (ans)\r\n", "n=int(input())\r\nalco=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nl=len(alco)\r\ncount=0\r\nfor i in range(n):\r\n a=input()\r\n try:\r\n x=int(a)\r\n if x<18:\r\n count+=1\r\n except:\r\n for j in range(l):\r\n if a==alco[j]:\r\n count+=1\r\n break \r\nprint(count) ", "ALCOHOLIC_DRINKS = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\ntotal_clients = int(input())\r\n\r\nclients_to_check = 0\r\n\r\nfor _ in range(total_clients):\r\n data = input() \r\n\r\n try:\r\n data = int(data)\r\n if data < 18:\r\n clients_to_check += 1\r\n else:\r\n continue\r\n except ValueError:\r\n if data in ALCOHOLIC_DRINKS:\r\n clients_to_check += 1\r\n else:\r\n continue\r\n\r\nprint(clients_to_check)\r\n", "z=int(input())\r\nc=0\r\ns=[]\r\nfor i in range(z):\r\n x=input()\r\n s.append(x)\r\na=[ 'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in s:\r\n try:\r\n if int(i)<18:\r\n c+=1\r\n except:\r\n if i in a:\r\n c+=1\r\n else:\r\n continue\r\nprint(c)\r\n ", "a = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nc = [\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"0\"]\r\nn = int(input()); k=0\r\nfor i in range(n):\r\n b = str(input())\r\n if b in a:\r\n k += 1\r\n else:\r\n if b[0] in c:\r\n if int(b) < 18:\r\n k += 1\r\nprint(k)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = 0\r\nw = \"ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE\"\r\ns = set(list(map(str, w.split(\", \"))))\r\nfor _ in range(n):\r\n x = list(input().rstrip())\r\n if 48 <= ord(x[0]) <= 57:\r\n if int(\"\".join(x)) < 18:\r\n ans += 1\r\n else:\r\n if \"\".join(x) in s:\r\n ans += 1\r\nprint(ans)", "c = 0\r\nt = input()\r\nfor i in range(int(t)):\r\n a = input()\r\n if a.isnumeric() is True:\r\n if int(a) < 18:\r\n c += 1\r\n else:\r\n if a == \"ABSINTH\" or a == \"BEER\" or a == \"BRANDY\" or a == \"CHAMPAGNE\" or a == \"GIN\" or a == \"RUM\" or a == \"SAKE\" or a == \"TEQUILA\" or a == \"VODKA\" or a == \"WHISKEY\" or a == \"WINE\":\r\n c += 1\r\nprint(c)\r\n", "n = int(input())\r\ng = []\r\ns = 0\r\nfor i in range(n):\r\n a = input()\r\n g.append(a)\r\nfor j in g:\r\n if j.isalpha():\r\n if j == 'ABSINTH' or j == 'BEER' or j == 'BRANDY' or j == 'CHAMPAGNE' or j == 'GIN' or j == 'RUM' or j == 'SAKE' or j == 'TEQUILA' or j == 'VODKA' or j == 'WHISKEY' or j == 'WINE':\r\n s += 1\r\n else:\r\n continue\r\n else:\r\n if int(j) < 18:\r\n s += 1\r\n else:\r\n continue\r\nprint(s)\r\n", "kol=0\r\nr = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor _ in' '*int(input()):\r\n t = input()\r\n if t.isdigit():\r\n if int(t) <18:kol+=1\r\n else:\r\n if t in r:kol+=1\r\nprint(kol)", "a=\"ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE\"\r\ny=list(map(str,a.split(\", \")))\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n if a.isnumeric() and int(a)<18:\r\n c+=1\r\n else:\r\n if a in y:\r\n c+=1\r\nprint(c)", "def find_minimum_checks():\r\n\tcount = int(input())\r\n\r\n\talcohols = set([\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"])\r\n\tmin_checks_needed = 0\r\n\tfor _ in range(count):\r\n\t\tin_string = input()\r\n\t\ttry:\r\n\t\t\tnumber = int(in_string)\r\n\t\t\tif number < 18:\r\n\t\t\t\tmin_checks_needed += 1\r\n\t\texcept ValueError:\r\n\t\t\tif in_string in alcohols:\r\n\t\t\t\tmin_checks_needed += 1\r\n\r\n\tprint(min_checks_needed)\r\n\r\n\r\nfind_minimum_checks()\r\n", "ans=0\r\nbev=[ 'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nn=int(input())\r\n\r\nfor i in range(n):\r\n x=input()\r\n \r\n try:\r\n x=int(x)\r\n if x<18:\r\n ans+=1\r\n \r\n except ValueError:\r\n if x in bev:\r\n ans+=1\r\nprint(ans) \r\n ", "a=('ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE')\r\nn=int(input())\r\nx=0\r\nfor i in range(n):\r\n s=input()\r\n if s[0]>='0' and s[0]<='9' and int(s)<18 or s in a:\r\n x+=1\r\nprint(x)", "#alcohol=[ ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE]\r\np='0123456789'\r\nalcohol=[\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\", \"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\r\nn=int(input())\r\ncount=0\r\nfor i in range(n):\r\n\tg=input()\r\n\tif g[0] in p:\r\n\t\tt=int(g)\r\n\t\tif t<18:\r\n\t\t\tcount+=1\r\n\t\t\t\r\n\telse:\r\n\t\tif g in alcohol:\r\n\t\t\tcount+=1\r\n\t\t\t\r\n\t\t\t\r\nprint(count)\r\n", "n=int(input())\r\na=[]\r\ns=0\r\ndrink=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in a:\r\n if i in drink:\r\n s+=1\r\n if i.isdigit() and int(i)<18:\r\n s+=1\r\nprint(s)", "N = int(input())\r\nres = 0\r\nfor _ in range(N):\r\n s = input()\r\n if (s.isdigit() and int(s) < 18) or s in ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']:\r\n res += 1\r\n \r\nprint(res)", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom math import *\r\nfrom collections import *\r\nfrom fractions import *\r\nfrom bisect import *\r\nfrom heapq import*\r\nfrom io import BytesIO, IOBase\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value():return tuple(map(int,input().split()))\r\ndef arr():return [int(i) for i in input().split()]\r\ndef sarr():return [int(i) for i in input()]\r\ndef starr():return [str(x) for x in input().split()]\r\ndef inn():return int(input())\r\ndef svalue():return tuple(map(str,input().split()))\r\nmo=1000000007\r\n#----------------------------CODE------------------------------#\r\nd=['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\nn=inn()\r\nans=0\r\nfor i in range(n):\r\n s=input()\r\n if(ord(s[0])>=65):\r\n if s in d:\r\n ans+=1\r\n else:\r\n if(int(s)<18):\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "b= [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nc=0\r\nfor i in range(int(input())):\r\n a=input()\r\n try:\r\n a=int(a)\r\n if a<18:\r\n c+=1\r\n except ValueError:\r\n if a in b:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nans = 0\r\ndrink = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n\r\nfor _ in range (n):\r\n x = input()\r\n try: \r\n if int(x) < 18: ans += 1\r\n except ValueError: \r\n if x in drink: ans += 1\r\n\r\nprint(ans)", "a=int(input())\r\ncount=0\r\nfor i in range(a):\r\n b=input()\r\n if b.isdigit():\r\n if int(b)<18 :\r\n count=count+1\r\n else:\r\n if b==\"ABSINTH\" or b==\"BEER\" or b==\"BRANDY\" or b==\"GIN\" or b==\"CHAMPAGNE\" or b==\"RUM\" or b==\"SAKE\" or b==\"TEQUILA\" or b==\"VODKA\" or b==\"WHISKEY\" or b==\"WINE\":\r\n count=count+1\r\nprint(count)\r\n\r\n\r\n", "n=int(input())\r\ncount=0\r\nalph='0123456789'\r\nl=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(n):\r\n s=input()\r\n if s in l:\r\n count=count+1\r\n if s[0] in alph:\r\n s=int(s)\r\n if s<18:\r\n count=count+1\r\nprint(count)\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n ", "arr = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nn = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a = input()\r\n try:\r\n a = int(a)\r\n if(a<18):\r\n count+=1\r\n except:\r\n if(a in arr):\r\n count+=1\r\nprint(count)", "a=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nt=[]\r\nfor _ in range(int(input())):\r\n t.append(input())\r\nc=0\r\nfor i in t:\r\n if i in a or (i.isdigit() and int(i)<18):\r\n c+=1\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def main():\r\n\talcohol = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n\tletter = [chr(i) for i in range(65, 65 + 26)]\r\n\r\n\tn = int(input())\r\n\tcnt = 0\r\n\r\n\tfor _ in range(n):\r\n\t\ts = str(input())\r\n\r\n\t\tif s[0] in letter:\r\n\t\t\tif s in alcohol:\r\n\t\t\t\tcnt += 1\r\n\t\telse:\r\n\t\t\ts = int(s)\r\n\t\t\tif s < 18:\r\n\t\t\t\tcnt += 1\r\n\r\n\tprint(cnt)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n=int(input())\r\ncnt=0\r\nl=['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\nfor i in range(n):\r\n a=input()\r\n if(a in l):\r\n cnt+=1\r\n else:\r\n try:\r\n val = int(a)\r\n if(val<18):cnt+=1\r\n except ValueError:\r\n cnt=cnt\r\n \r\nprint(cnt)", "n = int(input())\ndrinks = {\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"}\nres = 0\nfor _ in range(n):\n s = input()\n if all(c.isdigit() for c in s):\n res += int(s) < 18\n else:\n res += s in drinks\nprint(res)\n", "drink = {'ABSINTH',\r\n 'BEER',\r\n 'BRANDY',\r\n 'CHAMPAGNE',\r\n 'GIN',\r\n 'RUM',\r\n 'SAKE',\r\n 'TEQUILA',\r\n 'VODKA',\r\n 'WHISKEY',\r\n 'WINE',}\r\nc = 0\r\nfor _ in range(int(input())):\r\n n = input()\r\n if n.isdigit():\r\n x = int(n)\r\n if x < 18:\r\n c += 1\r\n else:\r\n if n in drink:\r\n c += 1\r\n\r\nprint(c)\r\n", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\n\r\nnumOfClients = int(input())\r\nalcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\noutput = 0\r\n\r\nfor num in range(numOfClients):\r\n data = input()\r\n if(data in alcohol):\r\n output = output+1\r\n else:\r\n try:\r\n data = int(data)\r\n if (data < 18):\r\n output = output+1\r\n except:\r\n continue\r\n\r\nprint(output)\r\n\r\n\r\n ", "alcohol = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\ncount = 0\r\nt = int(input())\r\nfor _ in range(t):\r\n temp = input()\r\n if temp.isnumeric():\r\n if int(temp) < 18:\r\n count += 1\r\n else:\r\n if temp in alcohol:\r\n count += 1\r\nprint(count)", "\nlist = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\nn=input()\nc=0\nfor i in range(0,int(n)) :\n x=input()\n if x.isnumeric() and int(x)<18 :\n c+=1\n else :\n if x in list:\n c+=1\nprint(c)\n\t\t \t \t\t\t \t\t \t\t \t \t\t\t \t\t", "n = int(input())\r\nalcohol = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nans = 0\r\nfor _ in range(n):\r\n s = input()\r\n if s.isdigit():\r\n if int(s) < 18:\r\n ans += 1\r\n else:\r\n if s in alcohol:\r\n ans += 1\r\nprint(ans)", "c=0\r\nll=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\nfor _ in range(int(input())):\r\n x=input()\r\n if(48<=ord(x[0])<=57):\r\n x=int(x)\r\n if(x<18):\r\n c+=1\r\n else:\r\n if(x in ll):\r\n c+=1\r\nprint(c)", "n = int(input())\r\na=[]\r\nb= [ \"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor i in range(n):\r\n k = input()\r\n if (ord('0')<=ord(k[0])<=ord('9')):\r\n a.append(int(k))\r\n else:\r\n a.append(k)\r\nl=0\r\nfor i in a:\r\n if type(i)==type(2):\r\n if i<18:\r\n l+=1\r\n else:\r\n for j in b:\r\n if i==j:\r\n l+=1\r\nprint(l)\r\n", "n=int(input())\r\n\r\nalc=['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\n\r\ncount=0\r\n\r\nfor i in range(0,n):\r\n s=input()\r\n if s.isdigit() and int(s)<18:\r\n count+=1\r\n elif s in alc:\r\n count+=1\r\n\r\nprint(count) \r\n", "n = int(input())\r\nalcohol = ['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\nnum = ['0','1','2','3','4','5','6','7','8','9']\r\ncheck = 0\r\nfor i in range(n):\r\n x=input()\r\n if x[0] in num :\r\n age = int(x)\r\n if age < 18 :\r\n check += 1\r\n else:\r\n if x in alcohol :\r\n check += 1\r\nprint(check)\r\n", "n = int(input())\nkol = 0\nwhile n > 0:\n p = [\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\n s = input()\n if s[0] not in \"0123456789\":\n if s in p:\n kol += 1\n else:\n if int(s)<18:\n kol +=1\n n -= 1\nprint(kol)\n", "alcoholDrinks = [\n 'ABSINTH',\n 'BEER',\n 'BRANDY',\n 'CHAMPAGNE',\n 'GIN',\n 'RUM',\n 'SAKE',\n 'TEQUILA',\n 'VODKA',\n 'WHISKEY',\n 'WINE',\n]\n\nresult = 0\nn = int(input())\nfor i in range(n):\n inp = input()\n if inp in alcoholDrinks:\n result += 1\n elif inp.isnumeric():\n inp = int(inp)\n if 18 > inp:\n result += 1\n\nprint(result)\n", "import math\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n alcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n counter = 0\r\n n = int(input())\r\n a = [input() for i in range(n)]\r\n for i in a:\r\n if i.isalpha():\r\n if i in alcohol:\r\n counter += 1\r\n else:\r\n if int(i) < 18:\r\n counter += 1\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\n\r\nmain_function()\r\n", "n = int(input())\r\nans = 0\r\nalcohol = {\"ABSINTH\", \"BEER\",\r\n \"BRANDY\", \"CHAMPAGNE\",\r\n \"GIN\", \"RUM\", \"SAKE\", \r\n \"TEQUILA\", \"VODKA\", \r\n \"WHISKEY\", \"WINE\"}\r\n\r\nfor _ in range(n):\r\n line = input()\r\n if line.isdigit():\r\n if int(line) < 18:\r\n ans += 1\r\n else:\r\n if line in alcohol:\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\r\nct=0\r\nalcohol=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor _ in range(n):\r\n x=input()\r\n if x.isnumeric():\r\n if int(x)<18:\r\n ct+=1\r\n if x in alcohol:\r\n ct+=1\r\nprint(ct)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nl = \"ABSINTH,BEER,BRANDY,CHAMPAGNE,GIN,RUM,SAKE,TEQUILA,VODKA,WHISKEY,WINE\".split(\",\")\r\nprint(len(list(filter(lambda v: (v in l) or (v.isdigit() and int(v) < 18), [input() for i in range(int(input()))]))))", "wine=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", 'WHISKEY', \"WINE\"]\r\ncount=0\r\nfor i in range(int(input())):\r\n clint=input()\r\n try:\r\n if int(clint)<18:\r\n count+=1\r\n except ValueError:\r\n if clint in wine:\r\n count+=1\r\nprint(count)\r\n", "n = int(input())\r\ndrinks = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\ncount = 0\r\nfor i in range(n):\r\n str = input()\r\n if str[0]>='0' and str[0]<='9' and int(str)<18: count+=1\r\n elif drinks.count(str)>0: count+=1\r\nprint(count)", "v=(\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\")\r\nn=int(input())\r\ncount=0\r\nfor i in range(n):\r\n\ts=input()\r\n\tif(s[0]>='0' and s[0]<='9' and int(s)<18):\r\n\t\tcount+=1\r\n\telif(s in v):\r\n\t\tcount+=1\r\nprint(count)\r\n\t\t", "a=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n s=input()\r\n if(s[0]>='A' and s[0]<='Z'):\r\n if s in a:\r\n c=c+1\r\n else:\r\n if(int(s)<18):\r\n c=c+1\r\nprint(c)\r\n ", "if __name__ == '__main__':\r\n N = lambda: int(input())\r\n\r\n n = N()\r\n cnt, a = 0, [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\n while n > 0:\r\n t = input()\r\n cnt += ((t.isnumeric() and int(t) < 18) or (t in a))\r\n n -= 1\r\n print(cnt)", "ALCOHOL = set('''ABSINTH BEER BRANDY CHAMPAGNE GIN\r\n RUM SAKE TEQUILA VODKA WHISKEY WINE'''.split())\r\nx = 0\r\n\r\nfor _ in range(int(input())):\r\n s = input()\r\n x += int(s)<18 if s.isdigit() else s in ALCOHOL\r\n\r\nprint(x)", "c=0\r\nfor _ in range(int(input())):\r\n n=input()\r\n drinks=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n if n[0]>='0' and n[0]<='9':\r\n n=int(n)\r\n if n<18:\r\n c+=1\r\n else:\r\n if n in drinks:\r\n c+=1\r\nprint(c)", "alcohol_list = [\"ABSINTH\", \"BEER\", \"BRANDY\",\r\n \"CHAMPAGNE\", \"GIN\", \"RUM\",\r\n \"SAKE\", \"TEQUILA\", \"VODKA\",\r\n \"WHISKEY\", \"WINE\"]\r\nn = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n s = input()\r\n if s.isnumeric():\r\n cnt += (int(s) < 18)\r\n elif s in alcohol_list:\r\n cnt += 1\r\nprint(cnt)", "d=['ABSINTH', \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", 'VODKA', \"WHISKEY\", \"WINE\"]\r\nfor i in range(18):\r\n d.append(str(i))\r\n\r\n\r\nn=int(input())\r\nans=0\r\nfor _ in range(n):\r\n s=input()\r\n if(s in d):\r\n ans+=1\r\n\r\n\r\nprint(ans)", "n = int(input())\r\nalcohol = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nans = 0\r\n\r\nfor i in range(n):\r\n line = input()\r\n if line.isnumeric() and int(line) < 18 or line in alcohol:\r\n ans += 1\r\n\r\nprint(ans)", "l=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nn=int(input())\r\nc=0\r\nfor _ in range(n):\r\n s=input()\r\n if s in l:\r\n c=c+1\r\n if s.isdigit():\r\n if(int(s)<18):\r\n c=c+1\r\nprint(c)", "n = int(input())\n\nalcohols = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\n\nanswer = 0\n\nfor i in range(n):\n line = input()\n if line.isdigit():\n if int(line) < 18:\n answer += 1\n else:\n if line in alcohols:\n answer += 1\n\nprint(answer)\n", "ALCOHOL = {\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"}\r\n\r\nn = int(input())\r\n\r\ncount = 0\r\n\r\nfor i in range(0, n):\r\n visitor = input()\r\n if visitor in ALCOHOL:\r\n count += 1\r\n else:\r\n if visitor.isdigit():\r\n if int(visitor) < 18:\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\ndata = []\r\n\r\nfor _ in range(n):\r\n d = input()\r\n data.append(d)\r\n\r\nalchols = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\nans = 0\r\n\r\nfor d in data:\r\n try:\r\n if int(d) < 18:\r\n ans += 1\r\n except ValueError:\r\n if d in alchols:\r\n ans += 1\r\n\r\n\r\nprint(ans)\r\n", "arr=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\ncount=0\nfor _ in range(int(input())):\n a=input()\n \n if a.isnumeric():\n \n if int (a)<18:\n # print(a)\n count += 1\n else:\n \n if a in arr:\n # print(a)\n count +=1\nprint(count)", "a=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nb=[]\r\nfor i in range(10):b.append(str(i))\r\nn=int(input())\r\ns=0\r\nfor i in range(n):\r\n k=input()\r\n if k[0] in b:\r\n if int(k)<18:s=s+1\r\n elif k in a:s=s+1\r\nprint(s)\r\n", "drinks = [\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\", \"WHISKEY\", \"WINE\"]\r\nans=0\r\nfor _ in range(int(input())):\r\n s=input()\r\n if s.isdigit() and int(s)<18:\r\n ans+=1\r\n elif s.isalpha() and s in drinks:\r\n ans+=1\r\nprint(ans)\r\n", "import string\n\n\ndef quest():\n alcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\n n = int(input())\n count = 0\n dig = string.digits\n for _ in range(n):\n a = input()\n if a in alcohol:\n count += 1\n elif a[0] in dig:\n a = int(a)\n if a < 18:\n count += 1\n print(count)\n\nquest()\n", "beer = [\"ABSINTH\", \"BEER\", 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nage = [str(i) for i in range(18)]\r\nn = int(input())\r\narr=[]\r\nfor i in range(n):\r\n s = input()\r\n arr.append(s)\r\ncount = 0 \r\nfor ele in arr:\r\n if ele in beer:\r\n count+=1\r\n if ele in age:\r\n count+=1\r\nprint(count)\r\n \r\n \r\n\r\n ", "n = int(input())\r\ns = ''\r\nl1=[]\r\nfor i in range(n):\r\n s = input()\r\n l1.append(s)\r\nl = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nans = 0\r\nfor i in l1:\r\n if i.isnumeric():\r\n if int(i)<18:\r\n ans+=1\r\n elif i in l :\r\n ans+=1\r\nprint(ans)", "# LUOGU_RID: 113213350\na=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE', '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '10', '11', '12', '13', '14', '15', '16', '17']\r\ns=0\r\nn=int(input())\r\nfor i in range(n):\r\n s+=(input() in a)\r\nprint(s)", "l = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN',\r\n 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nc = 0\r\nfor i in range(int(input())):\r\n a = input()\r\n if a.isdigit() == True:\r\n if int(a) < 18:\r\n c += 1\r\n else:\r\n if a in l:\r\n c += 1\r\nprint(c)\r\n", "def isfloat(st):\r\n try:\r\n int(st)\r\n return True\r\n except ValueError:\r\n return False\r\n\r\n\r\nnct = 0\r\nct = 0\r\ntest = int(input())\r\ndrinks = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nwhile nct < test:\r\n n = input()\r\n if isfloat(n):\r\n if int(n) < 18:\r\n ct = ct + 1\r\n else:\r\n for i in drinks:\r\n if n == i:\r\n ct = ct + 1\r\n nct = nct + 1\r\nprint(ct)\r\n", "#!/usr/bin/env python3 \r\n \r\ndrinks = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\nn = int(input())\r\n\r\nanswer = 0\r\nfor i in range(n):\r\n line = input()\r\n try:\r\n age = int(line)\r\n if (age < 18):\r\n answer+=1\r\n except ValueError:\r\n if line in drinks:\r\n answer+=1\r\n\r\nprint(answer)", "import math, re, sys, string, operator, functools, fractions, collections\nsys.setrecursionlimit(10**7)\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nmod=int(1e9+7)\neps=1e-6\npi=math.acos(-1.0)\nMAX=100\n#################################################\nalcohol=\"ABSINTH,BEER,BRANDY,CHAMPAGNE,GIN,RUM,SAKE,TEQUILA,VODKA,WHISKEY,WINE\".split(',')\nn=RI()[0]\nans=0\nfor i in range(n):\n s=RS()[0]\n if s[0] in '0123456789':\n s=int(s)\n if s<18:\n ans+=1\n else:\n if s in alcohol:\n ans+=1\nprint(ans)\n\n\n", "alco = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE',\n 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\nans = 0\nfor _ in range(int(input())):\n n = input()\n if (n.isdigit() and int(n) < 18) or n in alco:\n ans += 1\nprint(ans)\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-23 23:14:03\nLastEditTime: 2021-11-23 23:20:43\nDescription: Bar\nFilePath: CF56A.py\n'''\n\n\ndef func():\n n = int(input())\n alcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\",\n \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\n count = 0\n for _ in range(n):\n visitor = input().strip()\n if visitor.isdigit():\n if int(visitor) < 18:\n count += 1\n else:\n if visitor in alcohol:\n count += 1\n print(count)\n\n\nif __name__ == '__main__':\n func()\n", "s = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\ncnt=0\r\nfor i in range(int(input())):\r\n c = input()\r\n if c[0].isdigit():\r\n c=int(c)\r\n cnt+=(c<18)\r\n else:\r\n if c in s:\r\n cnt+=1\r\nprint(cnt)\r\n\r\n", "def solve():\r\n n = int(input().strip()) # get number of visitors in the bar\r\n alcohol = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'] # list of alcoholic drinks\r\n \r\n count = 0 # to keep count of the number of people whose age or drink we need to determine\r\n for i in range(n): \r\n s = input().strip()\r\n \r\n # if the input value s is a digit and also less than 18, the person is not allowed to drink alcohol\r\n if s.isdigit() and int(s) < 18:\r\n count += 1\r\n \r\n # if the input value is in the list of alcoholic drinks, it means the person is drinking alcohol\r\n elif s in alcohol:\r\n count += 1\r\n \r\n print(count)\r\n\r\nsolve()", "if __name__ == \"__main__\":\n drinks = {'ABSINTH':0, 'BEER':0, 'BRANDY':0,'CHAMPAGNE':0,'GIN':0, 'RUM': 0, 'SAKE':0,'TEQUILA':0,'VODKA':0,'WHISKEY':0,'WINE':0}\n n = int(input())\n count = 0\n for i in range(n):\n query = input()\n if query.isdigit():\n if int(query) < 18:\n count += 1\n else:\n if query in drinks:\n count += 1\n \n print(count)\n\t\t\t\t\t\t \t\t \t\t \t\t\t \t\t \t\t \t\t", "a=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nans=0\r\nfor i in range(int(input())):\r\n x=input()\r\n if x in a:\r\n ans+=1\r\n else:\r\n try:\r\n y=int(x)\r\n if y<18:\r\n ans+=1\r\n except:\r\n continue\r\nprint(ans)\r\n", "Lst = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n\r\nNum = int(input())\r\nCount = 0\r\nfor i in range(Num):\r\n Str = input()\r\n\r\n if(Str.isdigit()):\r\n Val = int(Str)\r\n if(Val < 18):\r\n Count += 1\r\n else:\r\n if(Str in Lst):\r\n Count += 1\r\n\r\nprint(Count)", "n = int(input())\r\n\r\nalc = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nans = 0\r\nfor i in range(n):\r\n client = input()\r\n if client[0] in '0123456789':\r\n client = int(client)\r\n if client < 18:\r\n ans += 1\r\n else:\r\n if client in alc:\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\r\nal = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nip=[input() for i in range(n)]\r\ncount = 0\r\nfor i in range(n):\r\n if ip[i] in al:\r\n count+=1\r\n elif ip[i].isnumeric() and int(ip[i])<18:\r\n count +=1\r\nprint(count)", "n = int(input())\r\n\r\nt1 = ['0','1','2','3','4','5','6','7','8','9','10','11','12','13','14','15','16','17','ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA','WHISKEY', 'WINE']\r\n\r\nc = 0\r\nfor i in range(n):\r\n\ttemp = input()\r\n\tif temp in t1:\r\n\t\tc += 1\r\n\r\nprint(c)\r\n", "n=int(input())\r\nres=0\r\nl=['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\nfor i in range(n):\r\n a=input()\r\n if a.isdigit():\r\n if int(a)<18:\r\n res+=1\r\n else:\r\n if a in l:\r\n res+=1\r\nprint(res)", "ALCOHOLS = {\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"}\n\nn = int(input())\n\ncounter = 0\nfor _ in range(n):\n known = input()\n try:\n if int(known) < 18:\n counter += 1\n except ValueError:\n if known in ALCOHOLS:\n counter += 1\nprint(counter)\n", "drinks = (\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\")\r\nn = int(input())\r\na = [input() for x in range(n)]\r\nc = 0\r\nfor x in range(n):\r\n try:\r\n if int(a[x]) < 18:\r\n c += 1\r\n except ValueError:\r\n if a[x] in drinks:\r\n c += 1\r\nprint(c)\r\n", "def readln(): return tuple(map(int, input().split()))\n\nlst = 'ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE'.split(', ')\n\nn, = readln()\nans = 0\nfor _ in range(n):\n inp = input()\n try:\n if int(inp) < 18:\n ans += 1\n except:\n if inp in lst:\n ans += 1\nprint(ans)\n", "n = int(input())\nd = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\nc = 0\n\nfor i in range(n):\n\ta = input()\n\tif a.isnumeric() and int(a) < 18:\n\t\tc += 1\n\telse:\n\t\tif not a.isnumeric():\n\t\t\tif a in d:\n\t\t\t\tc += 1\n\nprint(c)", "drinks = {'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'}\nn, j = int(input()), 0\nfor _ in range(n):\n s = input()\n if (s.isnumeric() and int(s) < 18) or s in drinks:\n j += 1\nprint(j)", "p=[\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\r\nq=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nr=\"1234567890\"\r\nx=int(input())\r\nc=0\r\nfor n in range(x):\r\n y=input()\r\n if y[0] in q:\r\n if y in p:\r\n c=c+1\r\n else:\r\n c=c\r\n elif y[0] in r:\r\n if int(y)<18:\r\n c=c+1\r\n else:\r\n c=c\r\nprint(c) \r\n \r\n", "vasya_no = [s for s in \"ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE\".split(\", \")]\nn = int(input())\ncount = 0\nfor _ in range(n):\n\ti = input()\n\tif(i.isdigit()):\n\t\tif(int(i) < 18):\n\t\t\tcount += 1\n\telse:\n\t\tif(i in vasya_no):\n\t\t\tcount += 1\nprint(count)", "n=int(input())\r\nalcohol=[\"ABSINTH\", \"BEER\", \"BRANDY\", \r\n\"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \r\n\"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\ntemp=[]\r\nfor i in a:\r\n if i.isnumeric(): \r\n if int(i)<18:\r\n temp.append(1)\r\n else:\r\n if i in alcohol:\r\n temp.append(1)\r\n else:\r\n temp.append(0)\r\nprint(sum(temp))", "def isAlcohol(s):\r\n return s in [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n \r\nn = int (input())\r\ncount = 0\r\nfor i in range(n):\r\n s =input()\r\n if s.isdigit() and int(s) < 18:\r\n count += 1\r\n #print(s + \"is number lower than 18\")\r\n elif isAlcohol(s):\r\n count += 1\r\n #print(s + \"is alco drinks\")\r\n# else:\r\n# print(s + \"is ok\")\r\nprint(count)\r\n", "\r\n\r\n\r\nt=['ABSINTH', 'BEER','BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n\r\n\r\n\r\n\r\n\r\np=0\r\nfor j in range(int(input())):\r\n\r\n a=input()\r\n\r\n if 65<=ord(a[0])<=90:\r\n if a in t:\r\n p+=1\r\n else:\r\n if int(a)<18:\r\n p+=1\r\n\r\n\r\nprint(p)\r\n", "alcohol = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nunderage = []\r\nfor i in range(0, 18):\r\n\tunderage.append(str(i))\r\nN = int(input())\r\ncnt = 0\r\nfor i in range(0, N):\r\n\tS = input()\r\n\tif S in alcohol or S in underage: cnt += 1\r\nprint(cnt)", "\r\nn = int(input())\r\nalco = [\"ABSINTH\", \"BEER\", 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\ncount = 0\r\nwhile n>0:\r\n n-=1\r\n s = input()\r\n if s.isdecimal():\r\n if int(s)<18:\r\n count+=1\r\n else:\r\n if s in alco:\r\n count+=1\r\nprint(count)", "import math\nfrom collections import defaultdict\nml=lambda:map(float,input().split())\nll=lambda:list(map(int,input().split()))\nii=lambda:int(input())\nip=lambda:input()\n\n\"\"\"========main code===============\"\"\"\n\nt=1\nt=ii()\nd=defaultdict(int)\nlol=[\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\nfor i in lol:\n d[i]=1\nans=0 \nfor _ in range(t):\n s=ip()\n if(s[0] in {'1','2','3','4','5','6','7','8','9','0'}):\n s=int(s)\n if(s<18):\n ans+=1\n else:\n if(d[s]):\n ans+=1\nprint(ans) \n \t \t\t\t \t\t\t\t\t\t\t\t \t \t \t\t", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n s=input()\r\n if s.isdigit():\r\n if int(s)<18:\r\n c+=1\r\n else:\r\n c=c\r\n else:\r\n if s in (\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\",\"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\",\"VODKA\", \"WHISKEY\", \"WINE\"):\r\n c=c+1\r\n else:\r\n c=c\r\nprint(c)\r\n ", "alc = \"ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE\".split(', ')\r\nn = int(input())\r\nc = 0\r\nwhile(n):\r\n i = input()\r\n try:\r\n i = int(i)\r\n if i < 18:\r\n c += 1\r\n except:\r\n if i in alc:\r\n c += 1\r\n n -= 1\r\nprint(c)", "\r\nn = int(input())\r\n\r\nl = []\r\na = 0\r\nc = 0\r\ndrinks = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor i in range(n):\r\n\tx = input()\r\n\ttry:\r\n\t\ta = int(x)\r\n\t\tif(a<18):\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tpass\r\n\texcept ValueError:\r\n\t\tif(x in drinks):\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tpass\r\n\r\nprint(c)", "drinks = \"ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE\".split(', ')\r\n\r\nn = int(input())\r\n\r\ncheck = 0\r\nfor _ in range(n):\r\n p = input()\r\n if (p.isdigit() and int(p) < 18) or (p in drinks):\r\n check += 1\r\n\r\nprint(check)", "# LUOGU_RID: 101875169\nalcohol = [ 'ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE' ]\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n data = input()\r\n try:\r\n data = int(data)\r\n except ValueError:\r\n if data in alcohol:\r\n ans += 1\r\n else:\r\n if data < 18:\r\n ans += 1\r\nprint(ans)", "alcohol = [\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n\tchk = input()\r\n\tif chk.isnumeric():\r\n\t\tif int(chk) < 18:\r\n\t\t\tans += 1\r\n\tif chk in alcohol:\r\n\t\tans += 1\r\nprint(ans)\t\t\r\n", "n = int(input())\r\nm = 0\r\nbase = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor _ in range(n):\r\n a = input()\r\n if a in base:\r\n m += 1\r\n elif a.isdigit() and int(a) < 18:\r\n m += 1\r\nprint(m)", "a=int(input())\r\nd=0\r\nfor i in range(a):\r\n b=input()\r\n if b=='WINE' or b=='WHISKEY' or b=='VODKA' or b=='TEQUILA' or b=='SAKE' or b=='RUM' or b=='GIN' or b=='CHAMPAGNE' or b=='BRANDY' or b=='BEER' or b=='ABSINTH':\r\n d=d+1\r\n z=b.isdigit()\r\n if z==True:\r\n c=int(b)\r\n if c<18:\r\n d=d+1\r\nprint(d)\r\n \r\n", "l = []\r\nfor i in range(int(input())):\r\n l.append(input())\r\nalc = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n\r\nC = 0\r\nfor i in l:\r\n try:\r\n if int(i) < 18:\r\n C += 1\r\n except ValueError:\r\n if i in alc:\r\n C += 1\r\n\r\nprint(C)", "a=[ 'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nn=int(input())\r\nt=0\r\nh=['1','2','3','4','5','6','7','8','9','0']\r\nfor i in range(n):\r\n ft=0\r\n d=input()\r\n for i in range(10):\r\n for k in range(len(d)):\r\n if h[i]==d[k]:\r\n ft=1\r\n if ft==1:\r\n k=int(d)\r\n if k>=18:\r\n n-=1\r\n else:\r\n if d not in a:\r\n n-=1\r\nprint(n)\r\n", "n=int(input())\r\nc=0\r\ns=\"ABSINTH,BEER,BRANDY,CHAMPAGNE,GIN,RUM,SAKE,TEQUILA,VODKA,WHISKEY,WINE\"\r\nd=s.split(',')\r\nfor i in range(n):\r\n\ts=input()\r\n\ttry:\r\n\t\tx=int(s)\r\n\t\tif x<18:\r\n\t\t\tc+=1\r\n\texcept:\r\n\t\tif s in d:\r\n\t\t\tc+=1\r\nprint(c)\r\n", "l=\"ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE\".split(\", \")\r\nc=0\r\nfor i in range(int(input())):\r\n\ts=input()\r\n\tif s in l:\r\n\t\tc+=1\r\n\telse:\r\n\t\ttry:\r\n\t\t\tif int(s)<18:\r\n\t\t\t\tc+=1\r\n\t\texcept:\r\n\t\t\tpass\r\nprint(c)", "alcohol = 'ABSINTH,BEER,BRANDY,CHAMPAGNE,GIN,RUM,SAKE,TEQUILA,VODKA,WHISKEY,WINE'.split(',')\r\nans = 0\r\nfor i in range(int(input())):\r\n\tage_drink = input()\r\n\tif age_drink.isdigit():\r\n\t\tif int(age_drink)<18:\r\n\t\t\tans+=1\r\n\telif age_drink in alcohol:\r\n\t\tans+=1\r\nprint(ans)", "if __name__ == \"__main__\":\n n = int(input())\n res = 0\n lis = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\n for i in range(n):\n st = input()\n if st[0] >= '0' and st[0] <= '9':\n st = int(st)\n if st < 18:\n res += 1\n else:\n if st in lis:\n res += 1\n \n print(res)", "#!/usr/bin/python3\nprint(len([i for i in [input() for _ in range(int(input()))] if (i.isdigit() and int(i) < 18) or i in ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']]))\n", "n = int(input())\r\nalcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\r\ncount=0\r\nwhile(n>0):\r\n i = input()\r\n if i.isnumeric():\r\n i=int(i)\r\n if i<18:\r\n count+=1\r\n else:\r\n if i in alcohol:\r\n count+=1\r\n n-=1\r\n \r\nprint(count)\r\n ", "ar = [\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\r\n \"WHISKEY\",\"WINE\"]\r\nn = int(input())\r\nans = 0\r\nwhile(n):\r\n txt = input()\r\n if(txt[0]>='0' and txt[0]<='9'):\r\n tmp = int(txt)\r\n if(tmp<18):\r\n ans+=1\r\n elif(txt in ar):\r\n ans+=1\r\n\r\n n-=1\r\nprint(ans)\r\n", "a=('ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE')\r\nn = int(input())\r\nx = 0\r\nfor i in range(n):\r\n s = input()\r\n if (s[0] >= '0' and s[0] <= '9' and int(s)<18) or s in a:\r\n x += 1\r\nprint(x)", "n=int(input())\r\na=['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\nc=0\r\nz=[]\r\nfor i in range(1,n+1):\r\n x=input()\r\n if x in a:\r\n c+=1\r\n elif x.isdigit() and int(x)<18:\r\n c+=1\r\nprint(c)\r\n \r\n ", "alcohol_drinks = {\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"}\r\n\r\nn = int(input())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n line = input()\r\n if line.isdigit(): \r\n age = int(line)\r\n if age < 18:\r\n count += 1\r\n else: \r\n if line in alcohol_drinks:\r\n count += 1\r\n\r\nprint(count)\r\n", "l=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nn=int(input())\r\nans=0\r\nfor i in range(n):\r\n\ts=input()\r\n\tif s in l:\r\n\t\tans+=1\r\n\telse:\r\n\t\tif ord(s[0]) not in range(ord(\"A\"),ord(\"Z\")+1):\r\n\t\t\t# print(s[0])\r\n\t\t\tif int(s)<18:\r\n\t\t\t\tans+=1\r\nprint(ans)\r\n", "def solve() :\n alcohol={\n \"ABSINTH\":1, \"BEER\":1, \n \"BRANDY\":1, \"CHAMPAGNE\":1,\n \"GIN\":1, \"RUM\":1,\n \"SAKE\":1, \"TEQUILA\":1,\n \"VODKA\":1, \"WHISKEY\":1,\n \"WINE\":1\n }\n c=0\n for i in arr:\n if i in alcohol or (i[0]>='0' and i[0]<='9') and int(i) <18:\n c+=1\n \n return c\n \n \n\n \n\n\n\n \nfrom sys import stdin\ninput = stdin.readline \n \n \nn=int(input())\narr=[]\nfor i in range(n):\n arr.append(input().strip())\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'''", "a = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA','WHISKEY', 'WINE']\r\nans = 0\r\nfor i in range(int(input())):\r\n\ts = input()\r\n\tif s.isdigit():\r\n\t\tif int(s) < 18:\r\n\t\t\tans += 1\r\n\tif s in a:\r\n\t\tans += 1\r\nprint(ans)", "drinks = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']; c = 0\r\nfor i in range(int(input())):\r\n x = input()\r\n if x.isdigit(): c += (int(x)<18)\r\n elif x in drinks: c+=1\r\nprint(c)", "n = int(input())\r\nl = []\r\nx = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor i in range(n):\r\n l.append(input())\r\nc = 0\r\nfor i in l:\r\n try:\r\n i = int(i)\r\n if(i<18):\r\n c+=1\r\n except:\r\n if i in x :\r\n c+=1\r\nprint(c) \r\n", "arr = \"ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE\".split(', ')\r\n# print(arr)\r\nn = int(input())\r\n\r\nc = 0\r\nfor i in range(n):\r\n x = input()\r\n try:\r\n if(int(x) < 18): c+=1\r\n except:\r\n if x in arr: c+=1\r\n\r\nprint(c)\r\n\r\n", "peoplenum = int(input())\r\ninfolist = []\r\nalcohollist = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nchecknum = 0\r\n\r\nfor i in range(peoplenum):\r\n infolist.append(input())\r\n\r\ndef checkint(text):\r\n try:\r\n int(text)\r\n return \"Yes\"\r\n except ValueError:\r\n return None\r\n\r\nfor i in range(peoplenum):\r\n if (checkint(infolist[i]) == \"Yes\" and int(infolist[i]) < 18) or infolist[i] in alcohollist:\r\n checknum += 1\r\n else:\r\n continue\r\n\r\nprint(checknum)\r\n", "n = int(input())\r\nalcohol = ['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\nnum = ['0','1','2','3','4','5','6','7','8','9']\r\ncheck = 0\r\nfor i in range(n):\r\n\ts = input()\r\n\tif(s[0] in num):\r\n\t\tif(int(s) < 18):\r\n\t\t\tcheck += 1\r\n\telse:\r\n\t\tif(s in alcohol):\r\n\t\t\tcheck += 1\r\n\r\nprint(check)\r\n", "n=int(input())\r\na=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ns=\"0123456789\"\r\nw={\"ABSINTH\",\"BEER\", \"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"}\r\nc=0\r\nfor i in range(n):\r\n i=input()\r\n if i[0] in s and int(i)<18:\r\n c=c+1\r\n elif i[0] in a and i in w:\r\n c=c+1\r\nprint(c)\r\n", "x = eval(input())\r\narray = []\r\nnum = 0\r\nfor i in range (0, x):\r\n n = input()\r\n array.append(n)\r\n\r\nfor i in range(0, x):\r\n result = array[i].isdigit()\r\n if result == True:\r\n if (int)(array[i]) < 18:\r\n num = num + 1\r\n elif array[i] == \"ABSINTH\" or array[i] == \"BEER\" or array[i] == \"BRANDY\" or array[i] == \"CHAMPAGNE\" or array[i] == \"GIN\" or array[i] == \"RUM\" or array[i] == \"SAKE\" or array[i] == \"TEQUILA\" or array[i] == \"VODKA\" or array[i] == \"WHISKEY\" or array[i] == \"WINE\":\r\n num = num + 1\r\nprint(num) \r\n \r\n\r\n \r\n \r\n\r\n \r\n", "n=int(input())\nc=0\nb={ \"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"}\nfor i in range(n):\n\ta=input()\n\tif(ord(a[0])>=65 and ord(a[0])<91):\n\t\tif(a in b):\n\t\t\tc+=1\n\telif((int(a)<18)):\n\t\tc+=1\nprint(c)\n\n\n\n", "n = int(input())\ncounter = 0\nalcohols = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\nfor i in range(n):\n line = input()\n if line in alcohols:\n counter += 1\n else:\n try:\n if int(line) < 18:\n counter += 1\n except ValueError:\n pass\n\nprint(counter)\n\t \t\t\t \t \t\t\t\t\t \t \t \t \t\t\t\t\t\t\t \t", "print(sum([input() in [str(x) for x in range(18)]+[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"] for e in range(int(input()))])) \r\n", "alc=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\ncount=0\r\nfor i in range(int(input())): \r\n a=input()\r\n if a.isalpha():\r\n if a in alc:\r\n count+=1\r\n else:\r\n if int(a)<18:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nl=[]\r\n\r\ndrinks = [ \"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\" ]\r\n\r\ncount= 0\r\n\r\nfor i in range(n):\r\n temp = input()\r\n l.append(temp)\r\nfor i in range(n):\r\n if l[i].isnumeric():\r\n if not int(l[i]) >= 18:\r\n count+=1\r\n else:\r\n continue\r\n else: \r\n if l[i] in drinks:\r\n count+=1\r\nprint(count)", "n=int(input(''))\r\nl=[ 'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\ncount=0\r\nfor i in range(n):\r\n s=input('')\r\n if(ord(s[0])>=65 and ord(s[0])<=90):\r\n if s in l:\r\n# print('if1')\r\n count+=1\r\n else:\r\n temp=int(s)\r\n if(temp>=0 and temp<=17):\r\n count+=1\r\nprint(count)", "drinks = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\n\nn = int(input())\n\ntotal = 0\nfor i in range(n):\n\tperson = input()\n\ttry:\n\t\ttemp = int(person)\n\t\tif temp < 18:\n\t\t\ttotal += 1\n\texcept ValueError:\n\t\tdrink = person\n\t\tif drink in drinks:\n\t\t\ttotal += 1\n\nprint(total)\n \t\t\t\t\t \t\t\t \t\t \t\t\t\t \t\t \t \t\t", "drinks = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\nn = int(input(\"\"))\r\ncount = 0\r\nfor i in range(n):\r\n info = input(\"\")\r\n if info.isnumeric():\r\n if int(info) <= 17:\r\n count += 1\r\n else:\r\n if info in drinks:\r\n count += 1\r\nprint(count)", "tst = int(input())\r\n\r\ndri = []\r\nage = []\r\n\r\nfor i in range(0,tst):\r\n s = input()\r\n if s.isdigit():\r\n age.append(int(s))\r\n else:\r\n dri.append(s)\r\n\r\ndrinks = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\ncheck = [x for x in age if x < 18]\r\n\r\ntot = len(check)\r\n\r\nfor ch in dri:\r\n if ch in drinks:\r\n tot += 1\r\n\r\nprint(tot)", "a=0\nfor i in range(int(input())):\n b=input()\n try:\n if int(b)<18:\n a+=1\n except:\n if b in ['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']:\n a+=1\nprint(a)", "n, ans = int(input()), 0\r\nalcohol_drinks = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM',\r\n 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor item in range(n):\r\n item = input()\r\n if item.isnumeric() and int(item) < 18 or item in alcohol_drinks:\r\n ans += 1\r\n\r\nprint(ans)", "n=int(input())\r\nk=0\r\nal_drinks=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor _ in range(n):\r\n g=input()\r\n if (g.isdigit() and int(g)<18) or (g in al_drinks):\r\n k+=1\r\nprint(k)", "banned = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \n \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\n\nt = int(input())\ncount = 0\nfor i in range(t):\n a = input()\n if a.isdigit():\n a = int(a)\n if a < 18:\n count += 1\n else:\n if a in banned:\n count += 1\n\nprint(count)", "n = int(input())\nans = 0\nS = {'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'}\nfor _ in range(n):\n s = str(input())\n if s.isdecimal():\n if int(s) < 18:\n ans += 1\n else:\n if s in S:\n ans += 1\nprint(ans)\n", "drinks = set(['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'])\ndid = set([\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",'7','8','9','0'])\nanswer = 0\nfor _ in range(int(input())):\n s = input()\n if s[0] in did:\n s = int(s)\n if s < 18:\n answer += 1\n else:\n continue\n else:\n if s in drinks:\n answer += 1\n else:\n continue\nprint(answer)", "n = int(input())\r\nlst = ['absinth', 'beer', 'brandy', 'gin', 'rum', 'champagne', 'sake', 'tequila', 'vodka', 'whiskey', 'wine']\r\ncount = 0\r\nfor i in range(n):\r\n item = input()\r\n if item.lower() in lst:\r\n count += 1\r\n elif item.isdigit():\r\n if int(item) < 18:\r\n count += 1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p = input()\r\n if p in [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]:\r\n count += 1\r\n elif p.isnumeric():\r\n if int(p) < 18:\r\n count += 1\r\n else:\r\n continue\r\nprint(count)", "n = int(input())\r\nd = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nk = 0\r\ndef RepresentsInt(s):\r\n try: \r\n int(s)\r\n return True\r\n except ValueError:\r\n return False\r\nfor i in range(n):\r\n m = input()\r\n if RepresentsInt(m):\r\n if int(m) < 18:\r\n k += 1\r\n else:\r\n if m.strip() in d:\r\n k += 1\r\nprint(k)", "def main():\n n = int(input())\n ans = 0\n for i in range(n):\n s = input()\n if s in set(['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']):\n ans += 1\n continue\n try:\n x = int(s)\n if x < 18:\n ans += 1\n except Exception as e:\n pass\n return ans\n\nprint(main())\n\n", "alcohol = [\r\n\t'ABSINTH',\r\n\t'BEER',\r\n\t'BRANDY',\r\n\t'CHAMPAGNE',\r\n\t'GIN',\r\n\t'RUM',\r\n\t'SAKE',\r\n\t'TEQUILA',\r\n\t'VODKA',\r\n\t'WHISKEY',\r\n\t'WINE'\r\n]\r\nn = int(input())\r\nres = 0\r\nfor i in range(n):\r\n\tx = input()\r\n\tif x.isdigit():\r\n\t\txi = int(x)\r\n\t\tif xi < 18: res += 1\r\n\tif x in alcohol: res += 1\r\nprint(res)\r\n", "x = int(input())\ncheck = 0\n\nfor i in range(x):\n a = input()\n try:\n if int(a) < 18:\n check += 1\n \n except:\n if a == \"ABSINTH\" or a == \"BEER\" or a == \"BRANDY\" or a == \"CHAMPAGNE\" or a == \"GIN\" or a == \"RUM\" or a == \"SAKE\" or a == \"TEQUILA\" or a == \"VODKA\" or a == \"WHISKEY\" or a == \"WINE\":\n check += 1\n \nprint (check)\n\t \t\t\t\t\t \t \t \t \t \t\t \t", "# LUOGU_RID: 112275797\nwine = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\nans = 0\nfor case in range(int(input())):\n s = str(input())\n if '0' <= s[0] <= '9' and int(s) < 18:\n ans += 1\n elif s in wine:\n ans += 1\nprint(ans)", "a, v = {'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'}, 0\r\nfor i in range(int(input())):\r\n c = input()\r\n v += c in a or c.isdigit() and int(c) < 18\r\nprint(v)", "al=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\",\"WHISKEY\", \"WINE\"]\r\nnum=\"1234567890\"\r\ncntr=0\r\nn=int(input())\r\nfor i in range(n):\r\n inp=input()\r\n if inp.isdigit():\r\n if int(inp)<18:\r\n cntr+=1\r\n else:\r\n if inp in al:\r\n cntr+=1\r\nprint(cntr)", "n = int(input())\r\nbr = 0\r\nalk = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nbrojevi = ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']\r\n\r\nfor i in range(n):\r\n s = input()\r\n\r\n if s in alk:\r\n br += 1\r\n\r\n elif s[0] in brojevi:\r\n if int(s) < 18:\r\n br += 1\r\n\r\nprint(br)\r\n", "n=int(input())\r\n# import sys\r\n# for i in range(int(input())):\r\n # n=int(input())\r\n # arr=list(map(int,input().split()))\r\ncnt=0\r\nalc=['ABSINTH','BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(n):\r\n x=input()\r\n if not x.isdigit() and x in alc:\r\n cnt+=1\r\n if x.isdigit() and int(x)<18:\r\n cnt+=1\r\nprint(cnt)", "alcohols = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\ncnt = 0\r\nfor i in range(int(input())):\r\n a = input()\r\n try:\r\n a = int(a)\r\n if a < 18:\r\n cnt += 1\r\n except Exception:\r\n if a in alcohols:\r\n cnt += 1\r\nprint(cnt)", "l = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\nans = 0 # Initialize ans outside the loop\r\n\r\nfor i in range(int(input())):\r\n n = input()\r\n if n.isnumeric():\r\n if int(n) < 18:\r\n ans += 1\r\n else:\r\n if n not in l: # Fix the semicolon to a colon here\r\n continue\r\n else:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "def bar(n):\r\n check=0\r\n wines=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n for i in range(n):\r\n inp=input()\r\n if inp in wines:\r\n check=check+1\r\n if inp.isnumeric() and int(inp)<18:\r\n check=check+1\r\n return check\r\nn=int(input())\r\nprint(bar(n))", "alch = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\n\nn = int(input())\ncount = 0\nfor i in range(0, n):\n\tinp = input()\n\ttry:\n\t\tage = int(inp)\n\t\tif age < 18:\n\t\t\tcount += 1\n\texcept:\n\t\tif inp in alch:\n\t\t\tcount += 1\n\t\tcontinue\n\nprint(count)\n\t\t \t \t \t \t \t \t\t\t\t \t \t\t", "alcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\nn = int(input())\r\nverify = 0\r\nfor i in range(n):\r\n\tinputDrinkOrAge = str(input())\r\n\tif inputDrinkOrAge.isnumeric() == True:\r\n\t\tinputDrinkOrAge = int(inputDrinkOrAge)\r\n\t\tif inputDrinkOrAge < 18:\r\n\t\t\tverify += 1\r\n\telse:\r\n\t\tif inputDrinkOrAge in alcohol:\r\n\t\t\tverify += 1\r\n\r\nprint(\"%d\" % (verify))", "alcho = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\nt = int(input())\n\nc = 0\nfor _ in range(t):\n n = input()\n if n.isdigit():\n if int(n) < 18:\n c += 1\n else:\n if n in alcho:\n c += 1\n\nprint(c)\n", "w=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\no=[str(x) for x in range(18)]\r\nl=w+o\r\nk=0\r\nfor i in range(int(input())):\r\n if input() in l:\r\n k+=1\r\nprint(k)", "a=int(input())\r\nd=[]\r\ncount=0\r\nb=0\r\nfor i in range(a):\r\n c=input()\r\n d.append(c)\r\nfor i in range(a):\r\n \r\n try:\r\n if (int(d[i])<18):\r\n count=count+1\r\n except:\r\n if d[i] in ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']:\r\n b=b+1 \r\nprint(count+b)", "n = int(input())\ncntr = 0\nfor i in range(n):\n s = input()\n try:\n x = int(s)\n if x<18:\n cntr+=1\n except:\n if s==\"ABSINTH\" or s==\"BEER\" or s==\"BRANDY\" or s==\"CHAMPAGNE\" or s==\"GIN\" or s==\"RUM\" or s==\"SAKE\" or s==\"TEQUILA\" or s==\"VODKA\" or s==\"WHISKEY\" or s==\"WINE\":\n cntr+=1\nprint(cntr)\n\t\t\t\t\t \t\t\t \t\t \t \t \t \t\t\t \t\t\t", "#!/usr/bin/env python3\n\n\nnum = int(input())\nlis = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\ncnt = 0\nfor i in range(num):\n\ts = input()\n\tif s in lis:\n\t\tcnt += 1\n\t\t# \n\t\tcontinue\n\tif s.isdigit():\n\t\ts = int(s)\n\t\tif(s<18):\n\t\t\tcnt += 1\nprint(cnt)\n\n\t \t\t\t \t\t \t \t \t \t", "t=int(input())\r\nnado_prov=0\r\nmas=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nvozr=18\r\nfor i in range(t):\r\n try:\r\n n=input()\r\n n = int(n)\r\n per=1\r\n except:\r\n per=0\r\n pass\r\n\r\n if per==1:\r\n if n<vozr:\r\n nado_prov+=1\r\n \r\n else:\r\n if n in mas:\r\n nado_prov+=1\r\n \r\n \r\nprint(nado_prov)\r\n\r\n ", "count = 0\r\ndrinks = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n\r\n\r\nfor _ in range(int(input())):\r\n x = input()\r\n\r\n if x[0].isdigit():\r\n count += 1 if int(x) < 18 else 0\r\n elif x[0].isalpha():\r\n count += 1 if x in drinks else 0\r\n\r\nprint(count)\r\n", "n = int(input())\r\nlst = []\r\nc = 0\r\nalcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nwhile n:\r\n n -= 1\r\n lst.append(input())\r\n\r\nfor i in lst:\r\n if i.isdigit() and int(i) < 18:\r\n c += 1\r\n elif i in alcohol:\r\n c += 1\r\nprint(c)\r\n", "import math\nimport re\nfrom fractions import Fraction\nfrom collections import Counter\n\nclass Task:\n peoples = []\n answer = 0\n \n def __init__(self):\n self.peoples = ['' for _ in range(int(input()))]\n for i in range(len(self.peoples)):\n self.peoples[i] = input()\n\n def solve(self):\n peoples = self.peoples\n badDrink = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM',\n 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\n\n for current in peoples:\n if current.isdigit():\n self.answer += 1 if int(current) < 18 else 0\n else:\n self.answer += 1 if current in badDrink else 0\n\n def printAnswer(self):\n print(self.answer)\n #for line in self.answer:\n # print(re.sub('[\\[\\],]', '', str(line)))\n\ntask = Task()\ntask.solve()\ntask.printAnswer()\n", "from collections import Counter\r\n \r\nn = int(input())\r\n \r\nc = Counter()\r\n \r\nfor i in range(n):\r\n x = input()\r\n \r\n if x.isdigit():\r\n if int(x) < 18:\r\n c['small'] += 1\r\n else:\r\n c[x] += 1\r\n \r\nans = c[\"ABSINTH\"] + c['BEER'] + c['BRANDY'] + c['CHAMPAGNE'] + c['GIN'] + c['RUM'] + c['SAKE'] + c['TEQUILA'] + c['VODKA'] + c['WHISKEY'] + c['WINE']\r\nans += c['small']\r\nprint(ans)", "'''input\n5\n18\nVODKA\nCOKE\n19\n17\n'''\n\n\ndef main():\n\n n = int(input())\n\n alchols = {\"ABSINTH\", \"BEER\", \"BRANDY\",\n \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\",\n \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"}\n\n check = 0\n for i in range(n):\n s = input()\n\n try:\n s = int(s)\n\n if(s < 18):\n check += 1\n except:\n if s in alchols:\n check += 1\n\n print(check)\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nnum = 0\r\nfor i in range(n):\r\n x = input()\r\n try:\r\n if int(x)<18:\r\n num+=1\r\n except ValueError:\r\n if x in [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]:\r\n num += 1\r\nprint(num)", "n = int(input())\r\nlst = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nans=0\r\n\r\nfor i in range(n):\r\n st = input()\r\n \r\n if st.isalpha():\r\n if st in lst:\r\n ans+=1\r\n \r\n else:\r\n if int(st)<18:\r\n ans+=1\r\n\r\nprint(ans)", "# LUOGU_RID: 101451390\nn = int(input())\r\nans = 0\r\nfor s in [input() for _ in range(n)]:\r\n if s.isdigit():\r\n ans += (int(s) < 18)\r\n else:\r\n ans += (s in ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'])\r\nprint(ans)", "c = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n\r\nn = int(input())\r\ntot = 0\r\nfor i in range(n):\r\n s = input()\r\n try:\r\n s = int(s)\r\n if(s < 18):\r\n tot+=1\r\n except:\r\n if(s in c):\r\n tot+=1\r\nprint(tot)", "def hasNum(aa):\r\n return any(char.isdigit() for char in aa)\r\nc = 0\r\nlis = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nn = int(input())\r\nfor i in range(n):\r\n a = input()\r\n if(hasNum(a)):\r\n a = int(a)\r\n if(a<18):\r\n c = c+1\r\n else:\r\n if a in lis:\r\n c = c+1\r\nprint(c)", "n = int(input())\r\ns = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nans = 0\r\nfor _ in range(n):\r\n str = input()\r\n if str in s:\r\n ans+=1\r\n elif str.isnumeric():\r\n str = int(str)\r\n if str<18:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n s = input()\r\n a.append(s)\r\nfor j in a:\r\n if(j==\"ABSINTH\" or j==\"BEER\" or j==\"BRANDY\" or j==\"CHAMPAGNE\" or j==\"GIN\" or j==\"RUM\" or j==\"SAKE\" or j==\"TEQUILA\" or j==\"VODKA\" or j==\"WHISKEY\" or j==\"WINE\"):\r\n b.append(j)\r\n if(j==\"0\" or j==\"1\" or j==\"2\" or j==\"3\" or j==\"4\" or j==\"5\" or j==\"6\" or j==\"7\" or j==\"8\" or j==\"9\" or j==\"10\" or j==\"11\" or j==\"12\" or j==\"13\" or j==\"14\" or j==\"15\" or j==\"16\" or j==\"17\"):\r\n b.append(j)\r\nprint(len(b))\r\n", "alcohol=['ABSINTH','BEER','BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nd=0\r\nfor _ in range(int(input())):\r\n b=input()\r\n if b.isnumeric()==True:\r\n if int(b)<18:\r\n d+=1\r\n else:\r\n if b in alcohol:\r\n d+=1\r\nprint(d)", "n = int(input())\r\n\r\nalc = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nm = 0\r\n\r\n\r\nfor i in range(n):\r\n x = input()\r\n if '1' in x or '2' in x or '3' in x or '4' in x or '5' in x or '6' in x or '7' in x or '8' in x or '9' in x or '0' in x:\r\n if int(x) < 18:\r\n m += 1\r\n else:\r\n if x in alc:\r\n m += 1\r\n\r\nprint(m)", "n = int(input())\r\nc=0\r\nli = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range (n):\r\n\r\n s = input()\r\n try:\r\n s = int(s)\r\n if s<18:\r\n c+=1\r\n\r\n except: # stringgg\r\n if s in li:\r\n c+=1\r\n\r\n\r\nprint(c)\r\n\r\n", "\r\nto_check = 0\r\n\r\nalcohol_drinks = ['ABSINTH', 'BEER', 'BRANDY',\r\n 'CHAMPAGNE', 'GIN', 'RUM',\r\n 'SAKE', 'TEQUILA', 'VODKA',\r\n 'WHISKEY', 'WINE']\r\nn = int(input())\r\n\r\nfor i in range(n):\r\n dato = input()\r\n if dato.isdigit():\r\n if int(dato) < 18:\r\n to_check = to_check + 1\r\n else:\r\n if dato in alcohol_drinks:\r\n to_check = to_check + 1\r\n \r\nprint(to_check)\r\n ", "n = int(input())\r\nd = {\"ABSINTH\":1, \r\n\"BEER\":1, \r\n\"BRANDY\":1, \r\n\"CHAMPAGNE\":1, \r\n\"GIN\":1, \r\n\"RUM\":1, \r\n\"SAKE\":1, \r\n\"TEQUILA\":1, \r\n\"VODKA\":1, \r\n\"WHISKEY\":1, \r\n\"WINE\":1\r\n}\r\ncnt =0\r\nfor i in range(n):\r\n\ts = input()\r\n\tif s.isnumeric():\r\n\t\tif int(s) <18:\r\n\t\t\tcnt += 1\r\n\telse:\r\n\t\tif s in d:\r\n\t\t\tcnt += 1\r\nprint(cnt)\r\n", "n=int(input())\r\nline=[]\r\nalcohol=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nflag=False\r\nsum=0\r\n\r\nfor i in range(n):\r\n line.append(input())\r\n if line[i].isdigit():\r\n line[i]=int(line[i])\r\n if line[i]<18:\r\n flag=True\r\n else:\r\n for j in alcohol:\r\n if line[i]==j:\r\n flag=True\r\n if flag:\r\n sum+=1\r\n flag=False\r\nprint(sum)", "t=int(input())\r\ncnt=0\r\narr=['ABSINTH','BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor _ in range(t):\r\n n=input()\r\n if n[0]>='0' and n[0]<='9':\r\n n=int(n)\r\n if n<18:\r\n cnt+=1 \r\n elif n in arr:\r\n cnt+=1 \r\nprint(cnt)\r\n \r\n ", "def main():\n x = 0\n for _ in range(int(input())):\n s = input()\n try:\n x += int(s) < 18\n except ValueError:\n x += s in {\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\",\n \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"}\n print(x)\n\n\nif __name__ == '__main__':\n main()\n", "alcohol=set('ABSINTH BEER BRANDY CHAMPAGNE GIN RUM SAKE TEQUILA VODKA WHISKEY WINE'.split())\r\ncnt=0\r\nfor i in range(int(input())):\r\n s=input()\r\n cnt+= int(s)<18 if s.isdigit() else s in alcohol\r\nprint(cnt)", "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\nalcohols = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\ncases = int(input())\r\nans = 0\r\nfor _ in range(cases):\r\n s = input()\r\n\r\n if s.isdigit() and int(s) < 18:\r\n ans += 1\r\n\r\n else:\r\n if s in alcohols:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "n=int(input())\r\npeople=[]\r\nalcohol=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(n):\r\n ans=input()\r\n if ans.isnumeric():\r\n people.append(int(ans))\r\n else:\r\n people.append(ans)\r\n\r\ncount=0\r\nfor i in people:\r\n if i in alcohol:\r\n count+=1\r\n elif isinstance(i, int) and i<18:\r\n count+=1\r\nprint(count)", "n=0\r\nb=[\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"10\",\"11\",\"12\",\"13\",\"14\",\"15\",\"16\",\"17\"]\r\na=[\"ABSINTH\",\"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\",\"WHISKEY\", \"WINE\"]\r\nfor i in range(0,int(input())):\r\n s=input()\r\n if(s in a or s in b):\r\n n=n+1\r\nprint(n)", "'''input\n5\n18\nVODKA\nCOKE\n19\n17\n'''\nn = int(input())\nt = 0\nfor _ in range(n):\n\ti = input()\n\tif i.isnumeric() and int(i) < 18:\n\t\tt += 1\n\telif i in [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]:\n\t\tt += 1\nprint(t)", "t = int(input())\r\na = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\ncnt = 0\r\nfor _ in range(t):\r\n s = input()\r\n if s.isdigit() and int(s) < 18: cnt += 1\r\n elif s in a: cnt += 1\r\n\r\nprint(cnt)", "n = int(input())\r\n\r\nlis = ['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n desc = input()\r\n \r\n if desc in lis:\r\n ans+=1\r\n else:\r\n if desc.isdigit():\r\n if int(desc)<18:\r\n ans+=1\r\n \r\nprint(ans)", "#sohrab namazi nia\r\n#codeforces\r\n#bar\r\nk = 0\r\nalcohol = [ \"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nnumbers =\"0123456789\"\r\nnumber = int(input())\r\nlist1 = []\r\nfor i in range(number):\r\n a = input()\r\n list1.append(a)\r\nfor i in list1:\r\n try:\r\n list1[list1.index(i)] = int(i)\r\n except:\r\n pass \r\nfor i in list1:\r\n try:\r\n if i < 18:\r\n k +=1\r\n except:\r\n if i in alcohol:\r\n k +=1\r\nprint(k)", "import sys,math\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef hash(s):\r\n oup,c = 0,1\r\n for x in s:\r\n oup += c*(ord(x)-65)\r\n c *= 10\r\n return oup\r\nl = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor i in range(len(l)):\r\n l[i] = hash(l[i])\r\nn = int(input())\r\noup = 0\r\nfor i in range(n):\r\n x = input()\r\n if x.isnumeric():\r\n if int(x)>=18:\r\n pass\r\n else:\r\n oup += 1\r\n else:\r\n nu = hash(x)\r\n if nu in l:\r\n oup += 1\r\nprint(oup)", "ref = [str(j) for j in 'ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE'.split(', ')]\r\nn = int(input())\r\ncount = 0\r\nfor j in range(n):\r\n s = str(input())\r\n c = 0\r\n for k in range(len(s)):\r\n if s[k] >= '0' and s[k] <= '9':\r\n c += 1\r\n if c == len(s):\r\n if int(s) < 18:\r\n count += 1\r\n else:\r\n if s in ref:\r\n count += 1\r\nprint(count)\r\n", "l = {'ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE','0','1','2','3','4','5','6','7','8','9','10','11','12','13','14','15','16','17'}\r\ncount = 0\r\n\r\nfor _ in range(int(input())):\r\n n = input()\r\n if n in l:\r\n count+=1\r\nprint(count)\r\n", "alcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nans = 0\r\nfor _ in range(int(input())):\r\n inp = input()\r\n if inp.isnumeric():\r\n if int(inp) < 18:\r\n ans += 1\r\n elif inp in alcohol:\r\n ans += 1\r\nprint(ans)\r\n", "pala = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\nn = int(input())\np = \"\"\nans = 0\ncan = 0\nfor j in range(n):\n p = input()\n\n if p in pala:\n ans+=1\n\n if p.isdecimal():\n if int(p) < 18:\n ans+=1\n\n\nprint(ans)\n \n\n\t\t\t \t\t \t\t\t \t \t\t\t\t \t \t\t", "def solve():\r\n n = int(input())\r\n c=0\r\n d = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"WINE\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\"]\r\n for i in range(n):\r\n s = input()\r\n try:\r\n z = int(s)\r\n if z<18:\r\n c+=1\r\n except:\r\n for j in d:\r\n if j == s:\r\n c+=1\r\n break\r\n print(c)\r\n return\r\nsolve()", "def main():\r\n drinks = 'ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE'.split(', ')\r\n n = int(input())\r\n\r\n ans = n\r\n for _ in range(n):\r\n cur = input()\r\n if cur.isalpha():\r\n if cur not in drinks:\r\n ans -= 1\r\n else:\r\n if int(cur) >= 18:\r\n ans -= 1\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "data=['ABSINTH',\r\n 'BEER',\r\n 'BRANDY',\r\n 'CHAMPAGNE',\r\n 'GIN',\r\n 'RUM',\r\n 'SAKE',\r\n 'TEQUILA',\r\n 'VODKA',\r\n 'WHISKEY',\r\n 'WINE',\r\n '0',\r\n '1',\r\n '2',\r\n '3',\r\n '4',\r\n '5',\r\n '6',\r\n '7',\r\n '8',\r\n '9',\r\n '10',\r\n '11',\r\n '12',\r\n '13',\r\n '14',\r\n '15',\r\n '16',\r\n '17',]\r\nq = 0\r\np=int(input())\r\nfor _ in range(p):\r\n n=input()\r\n if n in data:\r\n q+=1\r\nprint(q)\r\n", "n = int(input())\r\nd = [\r\n \"ABSINTH\",\r\n \"BEER\",\r\n \"BRANDY\",\r\n \"CHAMPAGNE\",\r\n \"GIN\",\r\n \"RUM\",\r\n \"SAKE\",\r\n \"TEQUILA\",\r\n \"VODKA\",\r\n \"WHISKEY\",\r\n \"WINE\",\r\n]\r\nc = 0\r\nfor i in range(n):\r\n s = input()\r\n if s.isnumeric():\r\n s = int(s)\r\n if s < 18:\r\n c += 1\r\n else:\r\n if s in d:\r\n c += 1\r\nprint(c)\r\n", "n=int(input())\r\ndrinks={'VODKA', 'BEER', 'CHAMPAGNE', 'TEQUILA', 'BRANDY', 'ABSINTH', 'WHISKEY', 'WINE', 'GIN', 'RUM', 'SAKE'}\r\nresult=0\r\nfor _ in range(n):\r\n x=input()\r\n \r\n if x in drinks or (x.isnumeric() and int(x)<18):\r\n result+=1\r\n \r\nprint(result)", "def isAlcohol(answer):\r\n if answer in [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nchecked = 0\r\n\r\nfor i in range(n):\r\n answer = input()\r\n if isAlcohol(answer):\r\n checked += 1\r\n elif answer.isnumeric() and int(answer) < 18:\r\n checked += 1\r\n\r\nprint(checked)", "n = int(input())\r\nclients_to_check = 0\r\n\r\nfor _ in range(n):\r\n client_info = input()\r\n \r\n if client_info.isnumeric() and int(client_info) < 18:\r\n # If the client is underage\r\n clients_to_check += 1\r\n elif client_info in [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]:\r\n # If the client ordered an alcoholic drink\r\n clients_to_check += 1\r\n\r\nprint(clients_to_check)\r\n", "a=['ABSINTH','BEER','BRANDY','CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nl=0\r\nfor i in range(int(input())):\r\n x=input()\r\n try:\r\n if(int(x)<18):\r\n l+=1\r\n except:\r\n if(x in a):\r\n l+=1\r\nprint(l)", "## int(input())\r\n## map(int ,input().split())\r\n## int(i) for i in input().split()\r\nn = int(input())\r\np = [input() for i in range(n)]\r\na = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nrs = 0\r\nfor i in p:\r\n if i.isalpha() and i in a: rs+=1\r\n elif i.isdigit() and int(i) < 18: rs+=1\r\nprint(rs)", "alc = [\r\n \"ABSINTH\",\r\n \"BEER\",\r\n \"BRANDY\",\r\n \"CHAMPAGNE\",\r\n \"GIN\",\r\n \"RUM\",\r\n \"SAKE\",\r\n \"TEQUILA\",\r\n \"VODKA\",\r\n \"WHISKEY\",\r\n \"WINE\",\r\n]\r\nans = 0\r\nfor n in range(int(input())):\r\n s = input()\r\n if s in alc:\r\n ans += 1\r\n else:\r\n try:\r\n if int(s) < 18:\r\n ans += 1\r\n except:\r\n pass\r\n\r\nprint(ans)\r\n", "t=int(input())\r\nl=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nc=0\r\nwhile t>0:\r\n s=input()\r\n if s[0].islower()or s[0].isupper():\r\n for i in l:\r\n if i==s:\r\n c+=1\r\n else:\r\n s=int(s)\r\n if s<18:\r\n c+=1\r\n t-=1\r\nprint(c) ", "def f():\r\n\tn = int(input())\r\n\ta = 'ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE'.replace(',','').split()\r\n\tres = 0\r\n\tfor _ in range(n):\r\n\t\ti = input()\r\n\t\tres += int(i.isdigit() and int(i)<18 or i in a)\r\n\tprint(res)\r\nf()", "x = int(input()); sum = 0\r\ntest = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor a in range(x):\r\n str = input(\"\")\r\n if test.__contains__(str):\r\n sum += 1\r\n elif '0' <= str[0] <= '9' and int(str) < 18:\r\n sum += 1\r\nprint(sum)", "n=int(input())\r\nlst=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\ncnt=0\r\ntemp=\"\"\r\nfor i in range(n):\r\n\ttemp=input()\r\n\tif temp.isnumeric()==True:\r\n\t\tif int(temp)< 18:\r\n\t\t\tcnt+=1\r\n\telse:\r\n\t\tif temp in lst:\r\n\t\t\tcnt+=1\r\nprint(cnt)", "x = 0\r\nfor i in range(int(input())):\r\n s = input()\r\n if s in {'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY',\r\n 'WINE'} or s.isdigit() and int(s) < 18:\r\n x += 1\r\nprint(x)\r\n", "t = 0\r\na = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor _ in range(int(input())):\r\n s = input()\r\n if s.isnumeric():\r\n if int(s) <= 17:\r\n t += 1\r\n else:\r\n if s in a:\r\n t += 1\r\nprint(t)\r\n", "n = int(input())\nalcohol_drinks = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\nneeded_check = 0\n\nfor i in range(n):\n n = input()\n if n.isdigit():\n if int(n) < 18:\n needed_check += 1\n else:\n if n in alcohol_drinks:\n needed_check += 1\n\nprint(needed_check)", "name_list = 'ABSINTH, BEER, BRANDY, CHAMPAGNE, GIN, RUM, SAKE, TEQUILA, VODKA, WHISKEY, WINE'.split(', ')\r\n\r\nout = 0\r\nfor _ in range(int(input())):\r\n word = input()\r\n\r\n if word.isdecimal():\r\n out += int(word) < 18\r\n else:\r\n out += word in name_list\r\n\r\nprint(out)\r\n", "n = int(input())\nchecks = 0\nalcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\nfor i in range(n):\n client = input()\n try:\n if int(client) < 18:\n checks += 1\n except:\n if client in alcohol:\n checks +=1\nprint(checks)\n \n", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n s=str(input())\r\n if(s[0] in '0123456789' ):\r\n s=int(s)\r\n if(s>=18):\r\n pass\r\n else:\r\n c=c+1\r\n else:\r\n if(s in ['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM',\"SAKE\",'TEQUILA','VODKA','WHISKEY','WINE']):\r\n c=c+1\r\n else:\r\n pass\r\n \r\nprint(c)", "\r\n\r\nn = int(input())\r\n\r\nalc = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n\r\ncnt = 0\r\n\r\nfor i in range(n) :\r\n \r\n s = input() \r\n \r\n if ord(s[0])>=65 and ord(s[0])<=90 :\r\n \r\n if s in alc :\r\n \r\n cnt = cnt + 1 \r\n \r\n else :\r\n \r\n age = int(s) \r\n if age<18 :\r\n cnt = cnt + 1\r\n \r\nprint(cnt)", "def func(arr):\r\n alc = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n c = 0\r\n for _ in arr:\r\n if _.isdigit():\r\n if int(_) < 18:\r\n c += 1\r\n else:\r\n if _.upper() in alc:\r\n c += 1\r\n return c\r\n\r\n\r\nn = int(input())\r\nl = [input() for _ in range(n)]\r\nprint(func(l))", "n = int(input())\nd = {'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM',\n 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'}\ncnt = n\nfor i in range(n):\n x = input()\n if x.isnumeric() is True and int(x) >= 18 or x.isnumeric() is False and x not in d:\n cnt -= 1\nprint(cnt)\n", "def alcohol_check(lst):\r\n alcohols = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n count = 0\r\n for elem in lst:\r\n if elem.isdigit() and int(elem) < 18:\r\n count += 1\r\n elif elem.isalpha() and elem in alcohols:\r\n count += 1\r\n return count\r\n\r\n\r\nn = int(input())\r\na = list()\r\nfor i in range(n):\r\n s = input()\r\n a.append(s)\r\nprint(alcohol_check(a))\r\n", "n=int(input())\r\nb = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA','VODKA', 'WHISKEY', 'WINE']\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n if a.isdigit():\r\n if int(a)<18:\r\n c+=1\r\n else:\r\n if a in b:\r\n c+=1\r\nprint(c)", "alc = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\n\n\nnumb = []\n\nfor i in range(1001):\n numb.append(str(i))\n\nn = int(input())\nans = []\ncount = 0\nfor i in range(n):\n\n z = input()\n if z in alc:\n count+=1\n if z in numb:\n if int(z)<18:\n count+=1\n\nprint(count)\n\n\n", "n=int(input())\r\nres=0\r\nalcohol =['ABSINTH', 'BEER','BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA','VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(n):\r\n a=input()\r\n try:\r\n a=int(a)\r\n if(a<18):\r\n res+=1;\r\n except:\r\n for j in alcohol:\r\n if(a==j):\r\n res+=1\r\nprint(res)\r\n ", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\nd = {\"ABSINTH\": 1, \"BEER\": 1, \"BRANDY\": 1, \"CHAMPAGNE\": 1, \"GIN\": 1,\r\n \"RUM\": 1, \"SAKE\": 1, \"TEQUILA\": 1, \"VODKA\": 1, \"WHISKEY\": 1, \"WINE\": 1}\r\n\r\nres = 0\r\nfor i in range(n):\r\n st = (sys.stdin.readline()).split()[0]\r\n if(st.isdigit()):\r\n if(int(st) < 18):\r\n res += 1\r\n else:\r\n if st in d:\r\n res += 1\r\n \r\nprint(res)", "n = int(input())\r\ns = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nans = 0\r\nfor _ in range(n):\r\n sa = input()\r\n if sa in s:\r\n ans+=1\r\n elif sa.isnumeric():\r\n sa = int(sa)\r\n if sa<18:\r\n ans+=1\r\nprint(ans)", "lis = [\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\r\nn = int(input())\r\nk = 0\r\nfor i in range(n):\r\n s = input()\r\n if s.isnumeric():\r\n s = int(s)\r\n if s < 18:\r\n k = k + 1\r\n else:\r\n if s in lis:\r\n k = k + 1\r\nprint(k)", "\r\nn = int(input())\r\nres = 0\r\nstr = [ 'ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE' ]\r\nfor it in range(n):\r\n s = input()\r\n if ( s[0]<='9' and s[0]>='0' ):\r\n s = int(s)\r\n if s < 18:\r\n res += 1\r\n else:\r\n if s in str:\r\n res += 1\r\nprint(res)", "def solve():\r\n n = int(input().strip())\r\n alcohol = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n under_18 = []\r\n remaining_people = []\r\n\r\n for _ in range(n):\r\n person = input().strip()\r\n if person.isdigit():\r\n if int(person) < 18:\r\n under_18.append(person)\r\n else:\r\n remaining_people.append(person)\r\n elif person in alcohol:\r\n remaining_people.append(person)\r\n \r\n final_people = len(under_18)\r\n for person in remaining_people:\r\n if person in alcohol:\r\n final_people += 1\r\n\r\n print(final_people)\r\n\r\nsolve()", "n=int(input())\ncount=0\ns=\"ABSINTH,BEER,BRANDY,CHAMPAGNE,GIN,RUM,SAKE,TEQUILA,VODKA,WHISKEY,WINE\"\nd=s.split(',')\nfor i in range(n):\n\ts=input()\n\ttry:\n\t\tx=int(s)\n\t\tif x<18:\n\t\t\tcount+=1\n\texcept:\n\t\tif s in d:\n\t\t\tcount+=1\nprint(count)\n", "n = int(input())\r\ncnt = 0\r\nl=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(0,n):\r\n a = input()\r\n if a[0] in \"1234567890\":\r\n\r\n if int(a) < 18: cnt+=1\r\n else:\r\n if a in l: cnt+=1\r\nprint(cnt)\r\n ", "inp = int(input())\r\nlista = list()\r\nalcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\ncount = 0\r\n\r\nfor i in range(inp):\r\n lista.append(input())\r\n\r\nfor item in lista:\r\n if item in alcohol:\r\n count += 1\r\n elif item.isdigit() is True:\r\n if int(item) < 18:\r\n count +=1\r\n\r\nprint(count)", "l, s, n = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE'], 0, int(input())\r\nfor i in range(n): \r\n gadha = input()\r\n if gadha.isdigit():\r\n if int(gadha) < 18: s += 1\r\n else:\r\n if gadha in l: s += 1\r\nprint(s)\r\n\r\n", "n, s = int(input()), 0\r\np = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nfor i in range(n):\r\n t = input()\r\n if t in p: s += 1\r\n elif t.isdigit() and int(t) < 18: s += 1\r\nprint(s)", "l=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n item=input()\r\n if item in l:\r\n c+=1\r\n elif item.isnumeric() and int(item)<18:\r\n c+=1\r\nprint(c)\r\n \r\n", "n = int(input())\r\ncount = 0\r\nlst = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor i in range(n):\r\n s = input()\r\n if(not s[0].isalpha() and int(s)<18):\r\n count+=1\r\n elif(s in lst):\r\n count+=1\r\n\r\nprint(count)", "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 = int(input())\r\ncount = 0\r\nalcohols = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\nfor _ in range(n) :\r\n s = input()\r\n if s.isnumeric() :\r\n if int(s) < 18 :\r\n count += 1\r\n elif s in alcohols :\r\n count += 1\r\nprint(count)\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "haram = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nn= int(input())\r\nans = 0\r\nfor t in range(n):\r\n\tx = input()\r\n\tif (x.isnumeric() and int(x) < 18) or x in haram:\r\n\t\tans += 1\r\n\r\nprint(ans)", "n = int(input())\r\nli = []\r\nfor i in range(n):\r\n li.append(input())\r\nc,c1 = 0,0\r\nfor i in li:\r\n if i.isdigit():\r\n i = int(i)\r\n if(i < 18):\r\n c += 1\r\n else:\r\n l = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n if i in l:\r\n c1 += 1\r\nprint(c + c1)", "alcohol=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nn=int(input())\r\nsum1=0\r\nwhile(n>0):\r\n m=input()\r\n if (m.isnumeric()):\r\n if int(m)<18:\r\n sum1=sum1+1\r\n else:\r\n if m in alcohol:\r\n sum1=sum1+1\r\n n=n-1\r\nprint(sum1)\r\n ", "import math\r\nt=int(input())\r\nsum=0\r\nfor i in range(1,t+1,1):\r\n \r\n a=str(input())\r\n s=a\r\n if(s.isnumeric()):\r\n d=int(s)\r\n if(d<=17):\r\n sum+=1\r\n elif(s==\"ABSINTH\" or s==\"BEER\" or s==\"BRANDY\" or s==\"CHAMPAGNE\"\r\n or s==\"GIN\" or s==\"RUM\" or s==\"SAKE\" or s==\"TEQUILA\" or s==\"VODKA\" or s==\"WHISKEY\" or s==\"WINE\"):\r\n sum+=1\r\n\r\nprint(sum)\r\n \r\n", "n = int(input())\r\nvalid_drinks = {\"VODKA\", \"WHISKEY\", \"WINE\", \"TEQUILA\", \"SAKE\", \"RUM\", \"GIN\", \"CHAMPAGNE\", \"BEER\", \"BRANDY\", \"ABSINTH\"}\r\ncount = 0\r\n\r\nfor i in range(n):\r\n drink = input().strip()\r\n\r\n if drink.isnumeric() and int(drink) < 18:\r\n count += 1\r\n elif drink in valid_drinks:\r\n count += 1\r\n\r\nprint(count)\r\n", "e = [\"ABSINTH\",\"BEER\",\"BRANDY\",\"CHAMPAGNE\",\"GIN\",\"RUM\",\"SAKE\",\"TEQUILA\",\"VODKA\",\"WHISKEY\",\"WINE\"]\r\nd = [str(i) for i in range(18)]\r\nn = int(input())\r\ns = [input() for i in range(n)]\r\ncnt=0\r\n\r\nfor i in range(n):\r\n\tif s[i] in e or s[i] in d:\r\n\t\tcnt+=1\r\nprint(cnt)", "n=int(input())\r\nans=0\r\nwhile n:\r\n n=n-1\r\n s=input()\r\n try:\r\n s=int(s)\r\n if s < 18:\r\n ans=ans+1\r\n except:\r\n ans1=0\r\n if s==\"ABSINTH\":\r\n ans1=ans1+1\r\n if s==\"BEER\":\r\n ans1=ans1+1\r\n if s==\"BRANDY\":\r\n ans1=ans1+1\r\n if s==\"CHAMPAGNE\":\r\n ans1=ans1+1\r\n if s==\"GIN\":\r\n ans1=ans1+1\r\n if s==\"RUM\":\r\n ans1=ans1+1\r\n if s==\"SAKE\":\r\n ans1=ans1+1\r\n if s==\"TEQUILA\":\r\n ans1=ans1+1\r\n if s==\"VODKA\":\r\n ans1=ans1+1\r\n if s==\"WHISKEY\":\r\n ans1=ans1+1\r\n if s==\"WINE\":\r\n ans1=ans1+1\r\n \r\n if ans1 > 0:\r\n ans=ans+1\r\n \r\nprint(ans) ", "n=int(input())\nalc=['ABSINTH', 'BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE', 'TEQUILA', 'VODKA','WHISKEY', 'WINE']\ns=0\nfor i in range(n):\n\ta=input()\n\tif a[0] in 'QWERTYUIOPASDFGHJKLZXCVBNM':\n\t\tif a in alc:\n\t\t\ts+=1\n\telif isinstance(int(a),int):\n\t\tif int(a)<18:\n\t\t\ts+=1\n\t\nprint(s)\n\t\t\n\t\t", "l=['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n a=input()\r\n if(a[0]>='A' and a[0]<='Z'):\r\n if(a in l):\r\n c=c+1\r\n else:\r\n if(int(a)<18):\r\n c=c+1\r\nprint(c) \r\n", "n = int(input())\r\ndata = []\r\nfor i in range(n):\r\n I = input()\r\n data.append(I)\r\n\r\nalcohols = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\ncount = 0\r\nfor i in data:\r\n try:\r\n i = int(i)\r\n if i < 18:\r\n count += 1\r\n except ValueError:\r\n if i in alcohols:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nres = 0\r\nlst_of_alcohol = [\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\"]\r\n\r\nfor _ in range(n):\r\n inputAgeOrDrink = input()\r\n if inputAgeOrDrink.isdigit():\r\n if int(inputAgeOrDrink) < 18:\r\n res += 1\r\n elif inputAgeOrDrink.isalpha():\r\n if inputAgeOrDrink in lst_of_alcohol:\r\n res += 1\r\n\r\nprint(res)", "drinks = ['ABSINTH', 'BEER', 'BRANDY', 'CHAMPAGNE', 'GIN', 'RUM', 'SAKE', 'TEQUILA', 'VODKA', 'WHISKEY', 'WINE']\r\n\r\na = [ input() for i in range(int(input()))]\r\n\r\nc = 0\r\nfor i in a :\r\n if i in drinks :\r\n c += 1\r\n else :\r\n try :\r\n j = int(i)\r\n except ValueError :\r\n continue\r\n \r\n if j < 18 :\r\n c += 1 \r\n\r\nprint(c)", "ListA=[\"ABSINTH\", \"BEER\", \"BRANDY\", \"CHAMPAGNE\", \"GIN\", \"RUM\", \"SAKE\", \"TEQUILA\", \"VODKA\", \"WHISKEY\", \"WINE\",\"0\",\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"10\",\"11\",\"12\",\"13\",\"14\",\"15\",\"16\",\"17\"]\r\nn=int(input())\r\ncount=0\r\nfor i in range(n):\r\n ss=input()\r\n if(ss in ListA):\r\n count+=1\r\n\r\nprint(count) ", "n = int(input())\r\nc = 0\r\nl = ['ABSINTH','BEER','BRANDY','CHAMPAGNE','GIN','RUM','SAKE','TEQUILA','VODKA','WHISKEY','WINE']\r\nfor i in range(n):\r\n s = input()\r\n if (s.isalpha())==True:\r\n if s in l:\r\n c = c+1\r\n else:\r\n if int(s)<18:\r\n c = c+1\r\nprint(c)\r\n" ]

[ "l,r = map(int,input().split())\nrange = r - l + 1\nif (range < 3) or (l % 2 == 1 and range < 4):\n print(-1)\nelse:\n if (l % 2 == 0):\n print(l,l+1,l+2)\n else:\n print(l+1,l+2,l+3)", "import sys\n\nl, r = map(int, sys.stdin.readline().split())\nif l % 2 is not 0:\n l += 1\n\nif r - l < 2:\n print(-1)\nelse:\n print(l, l+1, l+2)\n", "def main():\r\n n, m = map(int, input().split())\r\n if n % 2 == 1:\r\n n += 1\r\n\r\n if m - n < 2:\r\n print(-1)\r\n else:\r\n print(n, n + 1, n + 2)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l,r = [int(i) for i in input().split()]\r\nif r-l<2:\r\n print(-1)\r\nelif l%2==0:\r\n print(l,l+1,l+2)\r\nelif r-l<3:\r\n print(-1)\r\nelse:\r\n print(l+1,l+2,l+3)\r\n\r\n ", "l,r=map(int, input().split())\r\nif (l % 2 == 0 and r - l >= 2):\r\n print(l,l+1,l+2)\r\nelif (l % 2 != 0 and r-l >= 3):\r\n print(l+1,l+2,l+3)\r\nelse:\r\n print('-1')", "import math\nl, r = map(int, input().split())\n\ndef is_coprime(a, b):\n return math.gcd(a,b) == 1\n\nfor i in range(l, r - 1):\n for j in range(i + 1, r):\n for k in range(j + 1, r + 1):\n if is_coprime(i, j) and is_coprime(j, k) and not is_coprime(i, k):\n print(i, j, k)\n exit()\n\nprint(-1)\n \n\n", "# A. Counterexample\r\nn,k=map(int,input().split())\r\nif (n%2!=0):\r\n n+=1\r\nif k-n<2:\r\n print(-1)\r\nelse:\r\n print(n,n+1,n+2)", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\nl,r=map(int,input().split())\r\nif r-l==0 or r-l==1:\r\n print(-1)\r\nelse:\r\n if r-l==2:\r\n if l%2==0:\r\n print(l,l+1,r)\r\n else:\r\n print(-1)\r\n elif r-l > 2:\r\n if l%2==0:\r\n print(l,l+1,l+2)\r\n else:\r\n l+=1\r\n print(l,l+1,l+2)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nl, r = map(int, input().split())\r\nwhile l:\r\n if l % 2 == 0 and l+2 <= r:\r\n print(l, l+1, l+2)\r\n break\r\n l += 1\r\n if l + 2 > r:\r\n print(-1)\r\n break", "l,r = map(int,input().split())\r\nres=''\r\nif abs(l-r) < 2 : \r\n res='-1'\r\nelif l%2 : \r\n l+=1\r\n if abs(l-r) < 2 : \r\n res='-1'\r\n else : \r\n res=str(l)+' '+str(l+1)+' '+str(l+2)\r\nelse : \r\n res=str(l)+' '+str(l+1)+' '+str(l+2)\r\n \r\nprint(res)", "def gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a%b)\r\n\r\nl, r = map(int, input().split())\r\na = b = c = -1\r\nresult = False\r\nfor i in range(l, r-1):\r\n for j in range(i+1, r):\r\n for k in range(j+1, r+1):\r\n if gcd(i, j) == gcd(j, k) == 1:\r\n if gcd(i, k) > 1:\r\n result = True\r\n a, b, c = i, j, k\r\n break\r\n if result:\r\n break\r\n if result:\r\n break\r\nif a+b+c > 0:\r\n print(a, b, c)\r\nelse:\r\n print(-1)", "def gcd(a, b):\r\n # Everything divides 0\r\n if (b == 0):\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\nl, r = list(map(int, input().split(\" \")))\r\nif r - l <= 1:\r\n print(-1)\r\nelse:\r\n a, b, c = 0, 0, 0\r\n stop = False\r\n\r\n\r\n for i in range(l, r+1 - 2):\r\n if gcd(i, i + 1) == 1 and gcd(i + 1, i + 2) == 1 and gcd(i, i + 2) != 1:\r\n print(i, i+1, i+2)\r\n stop = True\r\n break\r\n\r\n if not stop:\r\n print(-1)\r\n", "import math as m\r\nimport sys\r\nl,r=list(map(int,input().split()))\r\nfor i in range(l,r+1):\r\n for j in range(i+1,r+1):\r\n for k in range(j+1,r+1):\r\n if m.gcd(i,j)==1 and m.gcd(j,k)==1 and m.gcd(i,k)!=1:\r\n print(i,j,k)\r\n sys.exit()\r\nelse:\r\n print(-1)", "from fractions import gcd\r\nraw=input()\r\n\r\nraw=raw.split(\" \")\r\nraw=[int(x) for x in raw]\r\nflag=0\r\nfor x in range(raw[0],(raw[1]-1)):\r\n if flag==1:\r\n break\r\n \r\n \r\n for y in range((x+1),(raw[1])):\r\n if flag==1:\r\n break\r\n if gcd(x,y)==1:\r\n \r\n for z in range((y+1),(raw[1]+1)):\r\n \r\n if gcd(y,z)==1:\r\n if gcd(x,z)!=1:\r\n print(x,y,z)\r\n flag=1\r\n break\r\nif flag==0:\r\n print(-1)\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "l, r = map(int, input().split())\nif l % 2: l += 1\nif r - l < 2:\n print(-1)\nelse:\n print(l,l+1,l+2)\n", "# your code goes here\nl, r = list(map(int, input().split()))\npossible = False\n\nif l%2==0:\n if r-l >= 2:\n print(l, l+1, l+2)\n possible=True\nelse:\n if r-l>=3:\n print(l+1, l+2, l+3)\n possible=True\n\nif not possible:\n print(-1)", "from sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef gcd(x, y):\r\n if y == 0:\r\n return x\r\n return gcd(y, x % y)\r\n\r\n\r\nl, r = list(map(int, stdin.readline().strip().split()))\r\nfor a in range(l, r - 1):\r\n for b in range(a + 1, r):\r\n if gcd(a, b) == 1:\r\n for c in range(b + 1, r + 1):\r\n if gcd(b, c) == 1 and gcd(a, c) > 1:\r\n print(' '.join(map(str, [a, b, c])))\r\n exit()\r\n\r\nprint(-1)", "def main():\r\n l,r = map(int,input().split())\r\n if r-l+1<3 :\r\n print(-1)\r\n exit()\r\n if l%2==0 :\r\n print(l,l+1,l+2)\r\n exit()\r\n if r-l+1>3 :\r\n print(l+1,l+2,l+3)\r\n exit() \r\n print(-1) \r\n\r\nmain()", "l, r = map(int, input().split())\r\nif l % 2 != 0:\r\n l+=1\r\nif l+2 > r:\r\n print(-1)\r\nelse:\r\n print(str(l)+' '+ str(l+1)+' '+str(l+2)) ", "n, m = map(int, input().split())\r\nif n % 2 != 0:\r\n n += 1\r\nif m - n < 2:\r\n print(-1)\r\nelse:\r\n print(n, \" \", n + 1, \" \", n + 2)", "def NOD(x, y):\r\n while (y != 0):\r\n x = x % y\r\n x, y = y, x\r\n return x\r\ndef main():\r\n l, r = map(int, input().split())\r\n for a in range(l, r - 1):\r\n for b in range(a, r):\r\n for c in range(b, r + 1):\r\n if NOD(a, b) == 1 and NOD(b, c) == 1 and NOD(a, c) != 1:\r\n print(a, b, c)\r\n return\r\n print(-1)\r\nmain()", "a,m = map (int,input().split())\r\nif m < a+2 :\r\n print(-1)\r\nelif a%2 == 0:\r\n print(a,a+1,a+2)\r\nelse :\r\n if m < a+3:\r\n print(-1)\r\n else:\r\n print(a+1,a+2,a+3)\r\n", "l, r = (int(x) for x in input().split())\r\nl += l % 2\r\nif r - l < 2:\r\n print(-1)\r\nelse:\r\n print(l, l + 1, l + 2)", "import math\n\nn, m = input().split()\nn = int(n)\nm = int(m)\n\nfounded = False\nfN = 0\nsN = 0\ntN = 0\n\nfor x in range(n, m+1):\n for y in range (x+1, m+1):\n for z in range(x+2, m+1):\n if math.gcd(x,y) == 1 and math.gcd(y,z) == 1 and math.gcd(x,z) != 1:\n fN = x\n sN = y\n tN = z\n founded = True\n break\n if founded:\n break\n if founded:\n break\n\nif founded:\n print(fN, sN, tN)\nelse:\n print(-1)", "### Hello! World ... ###\nl,r=map(int,input().split())\nif l%2:\n l+=1\nif l+2>r:\n print(-1)\nelse: \n print(l,l+1,l+2)", "def gcd(a,b):\r\n if a==0:\r\n return b\r\n return gcd(b%a,a)\r\na,b=map(int,input().split())\r\nones=[]\r\nresult=[]\r\nfor i in range(a,b):\r\n if gcd(i,i+1)==1:\r\n ones.append((i,i+1))\r\nfor j in range(len(ones)-1):\r\n if ones[j][1] == ones[j+1][0]:\r\n if gcd(ones[j][0],ones[j+1][1]) != 1:\r\n result.append(ones[j][0])\r\n result.append(ones[j][1])\r\n result.append(ones[j+1][1])\r\n break\r\nif len(result) < 3:\r\n print(-1)\r\nelse:\r\n print(*result)\r\n \r\n\r\n", "import math\r\noutput = -1\r\nL, R = map(int,input().split())\r\nfor a in range(L,R-1):\r\n for b in range(a+1,R):\r\n for c in range(b+1,R+1):\r\n if math.gcd(a,b)==1 and math.gcd(b,c)==1 and math.gcd(a,c)!=1:\r\n print(a,b,c)\r\n exit()\r\nprint(output)", "def gcd(a,b):\r\n if(a==0):\r\n return b\r\n else:\r\n return gcd(b%a,a)\r\n\r\na,b=map(int,input().split())\r\nc=True\r\nfor i in range(a,b+1):\r\n for j in range(i+1,b+1):\r\n for k in range(j+1,b+1):\r\n l=gcd(i,j)\r\n m=gcd(j,k)\r\n n=gcd(i,k)\r\n if(l==1 and m==1 and n!=1):\r\n print(i,j,k)\r\n c=False\r\n if(not c):\r\n break\r\n if(not c):\r\n break\r\n if(not c):\r\n break\r\nif(c):\r\n print(-1)", "import math\r\ndef check(l,r):\r\n lt=[]\r\n for i in range(l,r):\r\n for j in range(i+1,r):\r\n if math.gcd(i,j)==1:\r\n for k in range(j+1,r):\r\n if math.gcd(j,k)==1:\r\n if math.gcd(i,k)!=1:\r\n return [i,j,k]\r\n return lt\r\n\r\nlt=list(input().split())\r\nlt=check(int(lt[0]),int(lt[1])+1)\r\nif len(lt)==0:\r\n print(-1)\r\nelse:\r\n for i in lt:\r\n print(i,end=\" \")\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 isCoprime(a,b):\r\n\tif gcd(a,b) == 1:\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\n\r\ndef main():\r\n\t(l,r) = map(int, input().split())\r\n\tfor a in range(l,r-1):\r\n\t\tfor b in range(a+1,r):\r\n\t\t\tif isCoprime(a,b)==True:\r\n\t\t\t\tfor c in range(b+1,r+1):\r\n\t\t\t\t\tif isCoprime(b,c)==True:\r\n\t\t\t\t\t\tif isCoprime(a,c) == False:\r\n\t\t\t\t\t\t\tprint(a,b,c)\r\n\t\t\t\t\t\t\treturn\r\n\tprint(-1)\r\n\treturn\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "x,y=map(int,input().split())\r\nif y - x <2:\r\n print(-1)\r\nelif y - x <3 and x%2 !=0: \r\n print(-1)\r\nelif x %2==0:\r\n print(x,x+1,x+2)\r\nelse: \r\n print(x+1,x+2,x+3)\r\n", "l,r=map(int,input().split())\r\nif r - l >= 2:\r\n if r - l == 2:\r\n if l % 2 == 0:\r\n print(l, l + 1, l + 2)\r\n else:\r\n print(-1)\r\n else:\r\n for i in range(l, r + 1):\r\n if i % 2 == 0:\r\n print(i, i + 1, i + 2)\r\n break\r\nelse:\r\n print(-1)\r\n", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n n=r-l\r\n if(n<2):\r\n return [-1]\r\n elif(n==2):\r\n if(l%2==0):\r\n return l,l+1,r\r\n else:\r\n return [-1]\r\n else:\r\n if(l%2==0):\r\n return l,l+1,l+2\r\n else:\r\n return l+1,l+2,l+3\r\n\r\nl,r=map(int,input().split())\r\nprint(*exe())", "import os\r\nstart, end = map(int, input().split())\r\nfound = False\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a%b)\r\nfor i in range(start, end+1):\r\n for j in range(i+1, end+1):\r\n for k in range(j+1, end+1):\r\n if gcd(i, j) == 1 and gcd(j, k) == 1 and gcd(i, k) != 1:\r\n print((\"%d %d %d\") % (i, j, k))\r\n found = True\r\n break\r\n if found:\r\n break\r\n if found:\r\n break\r\nif not found:\r\n print(-1)", "\r\ndef gcd(a,b):\r\n if a<b:a,b=b,a\r\n while a%b!=0:\r\n a,b=b,a%b\r\n return b\r\n\r\nl,r=map(int,input().split())\r\n\r\nfor a in range(l,r+1):\r\n for b in range(a+1,r+1):\r\n for c in range(b+1,r+1):\r\n if gcd(a,b)==1 and gcd(b,c)==1 and gcd(a,c)!=1:\r\n print(a,b,c)\r\n quit()\r\n\r\nprint(-1)", "# from fractions import gcd\n# l,r=map(int,input().split())\n# \n# def ce(l, r):\n# for a in range(l, r+1):\n# for b in range(a+1, r+1):\n# for c in range(b+1, r+1):\n# if gcd(a,b)==1 and gcd(b,c)==1 and gcd(a,c)!=1:\n# return [a,b,c]\n# \n# return [-1]\n# \n# print(' '.join(str(x) for x in ce(l,r)))\n\n\nl,r=map(int,input().split())\n\nif l&1:\n l+=1\nif l+2>r:\n print(-1)\nelse:\n print(\"{} {} {}\".format(l, l+1, l+2))\n", "l, r = map(int, input().split())\r\nif l % 2 != 0:l += 1\r\nif r - l < 2:print(-1)\r\nelse:print(l, l + 1, l + 2)\r\n", "def gcd(x,y):\r\n if y>x:\r\n x,y=y,x\r\n if y==0:\r\n return x\r\n else:\r\n return gcd(y,x%y)\r\nl,r=map(int,input().split())\r\np=True\r\nfor i in range(l,r-1):\r\n for j in range(i+1,r):\r\n for k in range(j+1,r+1):\r\n if gcd(i,j)==1 and gcd(j,k)==1 and gcd(i,k)!=1 and p:\r\n print(i,j,k)\r\n p=False \r\nif p:\r\n print(-1)\r\n \r\n", "l, r = list( map(int, input().split()) )\r\ndiff = r-l\r\n\r\nif l%2 == 0 and diff >=2:\r\n print(l, l+1, l+2)\r\nelif l%2 == 1 and diff >=3:\r\n print(l+1, l+2, l+3)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "inp=input().split()\r\nn=int(inp[0])\r\nk=int(inp[1])\r\nl=[]\r\ndef gcd(a,b):\r\n if(b==0):\r\n return a\r\n return gcd(b,a%b)\r\nflag=False\r\nfor i in range(n,k+1):\r\n for j in range(i+1,k+1):\r\n for k in range(j+1,k+1):\r\n \r\n if(gcd(i,j)==1 and gcd(j,k)==1 and gcd(i,k)!=1 and i!=j and j!=k and i!=k):\r\n l.append(i)\r\n l.append(j)\r\n l.append(k)\r\n flag=True\r\n break\r\n if(flag):\r\n break\r\n if(flag):\r\n break\r\n \r\nif(len(l)==0):\r\n l.append(-1)\r\nfor i in range(len(l)):\r\n print(l[i],end=' ')\r\n ", "l, r = (int(i) for i in input().split())\nres = range(l, l + 3) if l & 1 == 0 and r - l > 1 else range(l + 1, l + 4) if r - l > 2 else [-1]\nprint(*res)\n", "def gccd(a,b):\r\n while b!=0:\r\n a,b=b,a%b\r\n return a==1\r\n \r\ndef main():\r\n l,r=map(int,input().split())\r\n if(r-l<2):\r\n print(\"-1\")\r\n return()\r\n else:\r\n m=False\r\n a=b=c=0\r\n\r\n for i in range(l,r-1):\r\n for j in range(i+1,r):\r\n for k in range(j+1,r+1):\r\n if gccd(i,j)and gccd(j,k):\r\n if gccd(i,k):\r\n continue\r\n else:\r\n a,b,c=i,j,k\r\n m=True\r\n break\r\n if m:\r\n break\r\n if m:\r\n break\r\n \r\n if m:\r\n print(a,b,c)\r\n else:\r\n print(-1)\r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "l, r = [int(x) for x in input().split()]\r\n\r\nl = l + l % 2\r\n\r\nif l + 2 > r:\r\n print(-1)\r\n\r\nelse:\r\n print(l, l+1, l+2)\r\n", "#!/usr/bin/python3\r\n\r\nimport itertools\r\nfrom fractions import gcd\r\n\r\nleft, right = tuple(map(int, input().split()))\r\nfor a, b, c in itertools.combinations(range(left, right+1), 3):\r\n if gcd(a, b) == 1 and gcd(b, c) == 1 and gcd(a, c) != 1:\r\n print(a, b, c)\r\n exit()\r\nprint(-1)\r\n", "from math import *\r\n\r\nl, r = map(int, input().split())\r\n\r\nif r - l < 2:\r\n print(-1)\r\n\r\nelif r - l == 2:\r\n if gcd(r, l) != 1:\r\n print(str(l) + ' ' + str(l + 1) + ' ' + str(r))\r\n else:\r\n print(-1)\r\nelse:\r\n if r % 2 == 0:\r\n print(str(r - 2) + ' ' + str(r - 1) + ' ' + str(r))\r\n else:\r\n print(str(r - 3) + ' ' + str(r - 2) + ' ' + str(r - 1))\r\n \r\n \r\n \r\n \r\n ", "__author__ = '-'\r\ninData = input().strip().split(\" \")\r\na,b = int(inData[0]), int(inData[1])\r\n\r\ndividers = []\r\nif (abs(a-b)<2):\r\n print(-1)\r\nelif (abs(a-b)==2):\r\n if (a%2==0):\r\n print(a,a+1,b)\r\n else:\r\n print(-1)\r\nelse:\r\n for i in range(a,b+1):\r\n if (i%2==0):\r\n print(i,i+1,i+2)\r\n break", "a,b=map(int,input().split())\r\nif a%2: a+=1\r\nif a+2>b: print(-1)\r\nelse: print(a,a+1,a+2)", "from math import gcd\r\n\r\n\r\nl , r = [int(i) for i in input().split()]\r\n\r\nfor i in range(l , r + 1):\r\n a = i\r\n for j in range(i + 1 , r + 1):\r\n b = j\r\n for k in range(j + 1 , r + 1):\r\n c = k\r\n if gcd(a , b) == 1 and gcd(b , c) == 1 and gcd(a , c ) != 1:\r\n print(a , b , c)\r\n exit()\r\n\r\nprint(-1)", "s, e = [int(num) for num in input().split()]\r\n\r\ndef GCD(a, b):\r\n return GCD(b, a % b) if b else a\r\n\r\nresult = -1\r\n\r\nfor i in range(s, e + 1):\r\n for j in range(i + 1, e + 1):\r\n if GCD(i, j) == 1:\r\n for k in range(j + 1, e + 1):\r\n if GCD(j, k) == 1 and GCD(i, k) != 1:\r\n print(i, j, k)\r\n result = 0\r\n break\r\n \r\n if not result:\r\n break\r\n \r\n if not result:\r\n break\r\n\r\nif result:\r\n print(result)", "l, r = map(int, input().split())\r\nif r-l < 2:\r\n\tprint(-1)\r\nelse:\r\n\twhile l%2 != 0:\r\n\t\tl += 1\r\n\tif r-l < 2:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(l, l+1, l+2)", "inp = list(map(int,input().split()))\r\nl=inp[0]\r\nr=inp[1]\r\nif(r-l+1==3 and l%2==1):\r\n print ('-1')\r\nelif(r-l+1<=2):\r\n print ('-1')\r\nelse:\r\n if(l%2==0):\r\n print (l,end=\" \")\r\n print (l+1,end=\" \")\r\n print (l+2)\r\n else:\r\n k=l+1\r\n print (k,end=\" \")\r\n print (k+1,end=\" \")\r\n print (k+2)", "left, r = input().split(' ')\r\nleft = int(left)\r\nr = int(r)\r\nif left % 2 != 0:\r\n left += 1\r\n\r\nif left + 2 > r:\r\n print(-1)\r\nelse:\r\n print(left, (left+1), left+2)", "\ntmp = list(map(int, input().split()))\nstart = tmp[0]\nend = tmp[1]\nif start % 2 != 0:\n start += 1\nif end - start < 2:\n print(-1)\nelse:\n print(str(start)+ ' ' + str(start+1) + ' ' + str(start+2))\n \n", "from math import gcd\r\n\r\n\r\nl,x = list(map(int,input().split()))\r\nz = True\r\nif l%2!=0 and l+3<=x:\r\n l += 1\r\nelif l%2!=0 and not l+3<=x:\r\n print(-1)\r\n z = False\r\n\r\nif z:\r\n if l+2 <= x:\r\n print(l,l+1,l+2)\r\n else:\r\n print(-1)", "l, r = list(map(int, (input().split(' '))))\r\nif l % 2 == 1:\r\n\ta = l + 1\r\nelse:\r\n\ta = l\r\nc = a + 2\r\n\r\nif c > r:\r\n\tprint(\"-1\")\r\nelse:\r\n\tb = a + 1\r\n\tprint(\"{} {} {}\".format(a, b, c))\r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\n#A. Counterexample\r\nlst = [int(x) for x in input().split()]\r\nl = lst[0]\r\nr = lst[1]\r\n\r\nif l%2 != 0:\r\n l +=1\r\nif abs(l - r) < 2:\r\n print(-1)\r\nelse:\r\n print(l,l+1,l+2)\r\n \r\n", "from itertools import product\r\nfrom math import ceil, gcd\r\nimport string\r\n\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [int(string[i: j]) for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\nnum_1, num_2 = map(int, input().split())\r\nnum_2 += 1\r\nbr = False\r\nfor a in range(num_1, num_2):\r\n for b in range(a, num_2):\r\n for c in range(b, num_2):\r\n if gcd(a, b) == 1 and gcd(b, c) == 1:\r\n if gcd(a, c) != 1:\r\n print(a, b, c)\r\n br = True\r\n break\r\n if br:\r\n break\r\n if br:\r\n break\r\n if br:\r\n break\r\nif not br:\r\n print(-1)", "from fractions import gcd\nl, r = map(int, input().strip().split())\nfound = False\nfor i in range(l, r-1):\n\tif i % 2 == 0:\n\t\tif gcd(i, i+1) == 1:\n\t\t\tprint(i, i+1, i+2)\n\t\t\tfound = True\n\t\t\tbreak\nif not found:\tprint(-1)", "lr = input().strip().split(' ')\r\nl = int(lr[0])\r\nr = int(lr[1])\r\n\r\nif l%2==0:\r\n if r>=l+2:\r\n print(\"{0} {1} {2}\".format(l,l+1,l+2))\r\n else:\r\n print(-1)\r\nelse:\r\n if r<=l+2:\r\n print(-1)\r\n else:\r\n print(\"{0} {1} {2}\".format(l+1,l+2,l+3))\r\n ", "from sys import stdin,stdout,exit\r\nimport math\r\nfrom fractions import gcd\r\ndef sin(): \r\n\treturn stdin.readline().rstrip()\r\ndef listInput():\r\n\treturn list(map(int,sin().split()))\r\ndef printBS(li):\r\n\tif not li: return\r\n\tfor i in range(len(li)-1):\r\n\t\tstdout.write(\"%d \"%(li[i]))\r\n\tstdout.write(\"%d\\n\"%(li[-1]))\r\nl,r=listInput()\r\nfor i in range(l,r+1):\r\n\tfor j in range(i+1,r+1):\r\n\t\tfor k in range(j+1,r+1):\r\n\t\t\tif(gcd(i,j)==1 and gcd(j,k)==1 and gcd(i,k)!=1):\r\n\t\t\t\tprint(i,j,k)\r\n\t\t\t\texit(0)\r\nprint(-1)", "n,m = [int(x) for x in input().split()]\r\nif m<n+2:\r\n print(-1)\r\nelif n%2!=0 and m<n+3:\r\n print(-1)\r\nelif n%2!=0:\r\n print(n+1,n+2,n+3)\r\nelse:\r\n print(n,n+1,n+2)\r\n\r\n", "def GCD(x, y): \r\n \r\n while(y): \r\n x, y = y, x % y \r\n \r\n return x\r\nif __name__ == \"__main__\":\r\n flag=0\r\n l,r = map(int,input().split())\r\n if((r-l)==0):\r\n print(-1)\r\n else:\r\n for i in range(l,r+1):\r\n for j in range(i+1,r+1):\r\n if(GCD(i,j)==1):\r\n for k in range(j+1,r+1):\r\n if(GCD(k,i)>1 and GCD(k,j)==1):\r\n flag=1\r\n print(i,j,k)\r\n break\r\n if(flag):\r\n break\r\n if(flag):\r\n break\r\n else:\r\n print(-1)\r\n\r\n ", "l,r = map(int,input().split())\r\n\r\nin_bet = r-l\r\ndef co_prime(l,r,in_bet):\r\n if in_bet<2 or (in_bet ==2 and l%2==1):\r\n print(-1)\r\n else:\r\n first = l+l%2\r\n print(first,end=' ')\r\n print(first+1,end =' ')\r\n print(first +2,end=' ')\r\n \r\n \r\nco_prime(l,r,in_bet)", "def is_coprime(x, y):\r\n # Function to check if two numbers x and y are coprime\r\n while y != 0:\r\n x, y = y, x % y\r\n return x == 1\r\n\r\ndef find_triple(r, c):\r\n for a in range(r, c - 1):\r\n for b in range(a + 1, c):\r\n for x in range(b + 1, c + 1):\r\n if is_coprime(a, b) and is_coprime(b, x) and not is_coprime(a, x):\r\n return a, b, x\r\n return None\r\n\r\n\r\nr, c = map(int, input().split())\r\nresult = find_triple(r, c)\r\n\r\nif result:\r\n print(*result) # Print the values from the result tuple\r\nelse:\r\n print(-1)", "l,r=map(int,input().split())\r\nif l%2==0 and (r-l)>=2:\r\n\tprint(l,l+1,l+2)\r\nelif l%2!=0 and (r-l)>=3:\r\n\tprint(l+1,l+2,l+3)\r\nelse:\r\n\tprint(-1)", "from math import gcd\r\n\r\ndef counter_example(l,r):\r\n for a in range(l,r+1):\r\n for b in range(a+1,r+1):\r\n for c in range(b+1,r+1):\r\n if gcd(a,b) == 1 and gcd(b,c) == 1 and gcd(a,c) != 1:\r\n return a,b,c\r\n return -1,-1,-1\r\n\r\n\r\nl,r = map(int,input().split())\r\na,b,c = counter_example(l,r)\r\nif a == -1:\r\n print(-1)\r\nelse:\r\n print(a,b,c)", "'''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\nl,r = map(int,input().split())\r\n\r\nif r-l<=2:\r\n if r-l<=1:\r\n print(-1)\r\n else:\r\n if l%2==0:\r\n print(l,l+1,l+2)\r\n else:\r\n print(-1)\r\n\r\nelse:\r\n if l%2==0:\r\n print(l,l+1,l+2)\r\n else:\r\n print(l+1,l+2,l+3)\r\n", "from math import gcd\nfrom collections import defaultdict\nl, r = list(map(int, input().rstrip().split()))\nd = defaultdict(list)\nfor i in range(l, r):\n for j in range(i, r + 1):\n if gcd(i, j) == 1:\n d[i].append(j)\nfor i, j in d.items():\n for k in j:\n if k in d.keys():\n for l in d[k]:\n if gcd(i, l) != 1:\n print(i, k, l)\n exit()\nprint(-1)\n", "import math\r\n#s = input()\r\n#n= (map(int, input().split()))\r\n\r\n#(map(int, input().split()))\r\n\r\nl, r =(map(int, input().split()))\r\n\r\nif (l%2!=0):\r\n l += 1\r\nif(l+2>r):\r\n print(-1)\r\nelse:\r\n print(l,\" \", l + 1,\" \", l + 2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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,r=map(int,input().split())\r\nif l%2 != 0:\r\n l += 1\r\nif r - l < 2:\r\n print('-1')\r\nelse:\r\n a = l; b = l+1; c = l+2\r\n print(a,b,c)\r\n", "a,b = map(int,input().split())\r\nif a % 2!=0:\r\n\ta += 1\r\nif a + 2 > b:\r\n\tprint(-1)\r\n\texit()\r\nprint(a , a+ 1, a+ 2)", "# Aditya Morankar\r\n# lsta = list(map(int,input().split()))\r\ndef main():\r\n l,r = list(map(int,input().split()))\r\n \r\n if r-l+1 <3:\r\n print(-1)\r\n \r\n elif l%2!=0 and r-l+1<=3:\r\n print(-1)\r\n \r\n elif l%2!=0:\r\n print(l+1,l+2,l+3)\r\n \r\n else:\r\n print(l,l+1,l+2)\r\n \r\n \r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n t = 1\r\n while t!=0:\r\n main()\r\n t-=1", "import math\r\nn,k=map(int,input().split())\r\nif(k-n<2 or (k-n==2 and n%2==1)):\r\n print(-1)\r\nelse:\r\n if(n%2==0):\r\n print(n,n+1,n+2)\r\n if(n%2==1):\r\n print(n+1,n+2,n+3)", "l,r=map(int,input().split())\r\nif l%2==0 and l+2<=r:\r\n print(l,l+1,l+2)\r\nelif l%2==1 and l+3<=r:\r\n print(l+1,l+2,l+3)\r\nelse:\r\n print(-1)\r\n", "def GCF(a,b):\r\n mi = min(a,b)\r\n ma = max(a,b)\r\n re = ma%mi\r\n if(re==0):\r\n return mi\r\n else:\r\n return GCF(mi,re)\r\ndef isCoPrime(a,b):\r\n #القاسم المشترك الأكبر\r\n #Euclidean algorithm\r\n # recursion\r\n if(GCF(a,b)==1):return True\r\n return False\r\nl,r = map(int,input().split(' '))\r\nend =False\r\nfor i in range(l,r+1):\r\n f,s,t = None,None,None\r\n for j in range(i,r+1):\r\n if(isCoPrime(i,j)):\r\n for k in range(l,r+1):\r\n if(k!=i and k!=j):\r\n if(isCoPrime(j,k)):\r\n if(not isCoPrime(i,k)):\r\n end=True\r\n f=i\r\n s=j\r\n t=k\r\n if k<i:\r\n f=k\r\n s=i\r\n t=j\r\n elif k<j:\r\n s=k\r\n t=j\r\n if end: break\r\n if end: break\r\n if end: break\r\nif end:\r\n print('{} {} {}'.format(f,s,t))\r\nelse:\r\n print(-1)\r\n ", "l, r = list(map(int, input().split()))\r\nif r-l+1 > 3:\r\n if l % 2 != 0:\r\n l += 1\r\n answer = l, l+1, l+2\r\nelif r-l+1 == 3:\r\n if l % 2 == 0:\r\n answer = l, l+1, l+2\r\n else:\r\n answer = False\r\nelse:\r\n answer = False\r\nif answer:\r\n print(answer[0], answer[1], answer[2])\r\nelse:\r\n print(-1)\r\n", "from math import gcd\r\nfrom itertools import combinations\r\na, b = map(int, input().split())\r\ndef isCoPrime(x, y):\r\n if gcd(x, y) == 1:\r\n return True\r\ndef isGood(x, y, z):\r\n if isCoPrime(x, y) and isCoPrime(y, z) and not isCoPrime(x, z):\r\n return True\r\nperm = list(combinations(list(range(a, b+1)), 2))\r\n#print(perm)\r\nif abs(a - b) <= 1:\r\n print(-1)\r\n quit()\r\nfor j in perm:\r\n f = j[0]\r\n l = j[1]\r\n if abs(j[1] - j[0]) == 1:\r\n continue\r\n for i in range(f+1, l):\r\n #print(f, i , l)\r\n if isGood(f, i, l):\r\n print(f, i, l)\r\n quit()\r\nprint(-1)\r\n", "from itertools import combinations\r\nfrom math import gcd\r\nl, r = map(int, input().split())\r\nfor a, b, c in combinations(range(l, r + 1), 3):\r\n if gcd(a, b) == 1 and gcd(b, c) == 1 and gcd(a, c) != 1:\r\n print(a, b, c)\r\n exit()\r\nprint(-1)", "l, r = map(int, input().split())\r\nif abs(l - r) < 2:\r\n print(-1)\r\nelif abs(l - r) >= 2 and l % 2 == 0:\r\n print(l, l+1, l+2)\r\nelif abs(l - r) >= 3 and l % 2 == 1:\r\n print(l+1,l+2,l+3 )\r\nelse:\r\n print(-1)", "l,r = [int(x) for x in input().split()]\r\nl = l+ l%2\r\nif r-l<2:\r\n print(-1)\r\nelse:\r\n print(l,l+1,l+2)", "from math import gcd as gcd\r\n\r\n\r\n\r\nl, r = (int(x) for x in input().split())\r\nsol = []\r\nfor a in range(l, r - 1):\r\n if len(sol) != 0: break\r\n for b in range(a+1,r):\r\n if len(sol) != 0: break\r\n for c in range(b+1,r+1):\r\n if len(sol) != 0: break\r\n if gcd(a,b) == 1 and gcd(b,c) == 1 and gcd(a,c) != 1:\r\n sol += [a,b,c]\r\n \r\n \r\nif len(sol) == 0:\r\n print(-1)\r\nelse:\r\n print(*sol)\r\n ", "# You lost the game.\nl,r = map(int, input().split())\nfrom math import gcd\nok = 0\nfor a in range(l,r-1):\n for b in range(a+1,r):\n for c in range(b+1,r+1):\n if gcd(a,b) == 1 and gcd(b,c) == 1 and gcd(a,c) > 1:\n print(a,b,c)\n ok = 1\n break\n if ok:\n break\n if ok:\n break\nif ok == 0:\n print(-1)\n", "import sys,math\n#sys.setrecursionlimit(100000000)\ninput = sys.stdin.readline\n \n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\ndef inp():\n return(int(input()))\ndef inara():\n return(list(map(int,input().split())))\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\ndef invr():\n return(map(int,input().split()))\n################################################################\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\n\nl,r=invr()\n\na=l\nif l%2:\n\ta+=1\nb=a+1\nc=b+1\n\nif a>=l and c<=r:\n\tprint(str(a)+\" \"+str(b)+\" \"+str(c))\nelse:\n\tprint(-1)\n\n \t\t\t\t \t\t\t \t \t \t\t \t\t \t", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nfrom math import gcd\r\n\r\nl,r = li()\r\nfound = 0\r\nfor i in range(l,r+1):\r\n f = 0\r\n for j in range(i+1,r+1):\r\n flag = 0\r\n for k in range(j+1,r+1):\r\n if gcd(i,j) == 1 and gcd(j,k) == 1 and gcd(i,k) != 1:\r\n print(i,j,k)\r\n flag = 1\r\n found = 1\r\n break\r\n if flag:\r\n f = 1\r\n break\r\n if f:\r\n break\r\nif not found:\r\n print(-1)", "r, l = map(int, input().split())\nif l-r < 2:\n print(-1)\nelif r % 2 == 0:\n print(r, r+1, r+2)\nelse:\n if l-r > 2:\n print(r+1, r+2, r+3)\n else:\n print(-1)\n", "l, r = map(int, input().split())\n\nif (r - l + 1 < 3):\n\tprint(-1)\n\nelif (l % 2 == 0):\n\tprint(l, (l + 1), (l + 2))\n\nelif (r - l + 1 > 3):\n\tprint((l + 1), (l + 2), (l + 3))\n\nelse:\n\tprint(-1)\n", "l,r=map(int,input().split())\r\nif(r-l<2):\r\n print(-1)\r\nelse:\r\n if(l%2==0):\r\n print(\"%d %d %d\"%(l,l+1,l+2))\r\n else:\r\n l=l+1\r\n if(r-l<2):\r\n print(-1)\r\n else:\r\n print(\"%d %d %d\"%(l,l+1,l+2))", "import sys\r\nfrom os import path\r\nif (path.exists('input.txt')):\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt','w')\r\n\r\nl,r = map(int, input().split())\r\nif l%2==0: a,b,c = l,l+1,l+2\r\nelse: a,b,c = l+1,l+2,l+3\r\n\r\nif c>r: print(-1)\r\nelse: print(a,b,c)", "import math\r\nl, r = [int(i) for i in input().split()]\r\n\r\ncomplit = False\r\n\r\nfor a in range(l, r-1):\r\n for b in range(a+1, r):\r\n for c in range(b+1, r+1):\r\n if math.gcd(a, b) == 1 and math.gcd(b,c) == 1 and math.gcd(a,c) != 1:\r\n print(a, b, c)\r\n complit = True\r\n break\r\n if complit:\r\n break\r\n if complit:\r\n break\r\nelse:\r\n print(-1)\r\n", "l,r = map(int,input().split())\r\ndef ans(l,r):\r\n if l%2 !=0:\r\n l = l+1\r\n return ans(l,r)\r\n elif l+2>r:\r\n return \"-1\"\r\n else:\r\n a = str(l)+\" \"+str(l+1)+\" \"+str(l+2)\r\n return a\r\nprint(ans(l,r))", "from math import gcd\r\ndef main():\r\n L,R=map(int,input().split())\r\n flag=False\r\n nonCoPrimeList=[]\r\n for i in range(L,R):\r\n for j in range(i+1,R+1):\r\n if gcd(i,j)!=1:\r\n nonCoPrimeList.append((i,j))\r\n for pair in nonCoPrimeList:\r\n for j in range(pair[0]+1,pair[1]):\r\n if gcd(pair[0],j)==1 and gcd(j,pair[1])==1:\r\n ans=sorted([pair[0],j,pair[1]])\r\n flag=True\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n print(*ans)\r\n else:\r\n print(-1)\r\nif __name__=='__main__':\r\n main()", "l,r = map(int, input().split())\r\n\r\ndef gcd(p,q):\r\n while q != 0:\r\n p, q = q, p%q\r\n return p\r\n\r\n\r\ndef isprime(i,j,k):\r\n if(gcd(i, j)==1 and gcd(j,k)==1 and gcd(i,k)!=1):\r\n return True\r\n else:\r\n return False\r\n\r\nfor i in range(l,r-1):\r\n for j in range(i+1,r):\r\n for k in range(j+1,r+1):\r\n if(isprime(i,j,k)):\r\n print(i,j,k)\r\n exit()\r\nprint(-1)\r\n ", "def HCF(a, b):\r\n if a == 0 :\r\n return b\r\n \r\n return HCF(b%a, a)\r\n\r\nl, r = [int(x) for x in input().split()]\r\n\r\ncheck = True\r\n\r\nfor i in range(l, r-1):\r\n for j in range(i+1, r):\r\n for k in range(j+1, r+1):\r\n #print(i, j, k)\r\n if HCF(i, j) == 1 and HCF(j, k) == 1 and HCF(i, k) != 1:\r\n print(i, j, k)\r\n check = False\r\n break\r\n if not check:\r\n break\r\n if not check:\r\n break\r\n \r\n\r\n#print(HCF(2,3)) \r\nif check :\r\n print(-1)\r\n \r\n\r\n", "import math\r\na,b = map(int, input().split())\r\nfound = 0\r\nfor i in range(a, b-1):\r\n for j in range(i+1, b):\r\n for k in range(j+1, b+1):\r\n if math.gcd(i, j)==1 and math.gcd(j,k)==1 and math.gcd(i,k)!=1:\r\n print(i,j,k)\r\n found = 1\r\n break\r\n if found:\r\n break\r\n if found: break\r\nif not found:\r\n print(-1)", "#code\r\nl, r = input().split()\r\nl, r = [int(l), int(r)]\r\nif l==r:\r\n print(-1)\r\nelif l-r==-1:\r\n print(-1)\r\nelif (l-r==-2) and (l%2==1):\r\n print(-1)\r\nelse:\r\n if l%2==0:\r\n print(l,l+1,l+2)\r\n else:\r\n print(l+1,l+2,l+3)\r\n \r\n ", "l, r = list(map(int, input().split()))\r\nif l % 2 != 0:\r\n\tl += 1\r\nif l + 2 > r:\r\n\tprint(\"-1\")\r\n\texit()\r\nprint(l, l+1, l+2)\r\n", "import math\r\nl, r=map(int, input().rstrip().split())\r\ncon1=True\r\nfor i1 in range(l, r+1):\r\n if not con1:\r\n break\r\n for j1 in range(l+1, r+1):\r\n if math.gcd(i1, j1)>1 and i1!=j1:\r\n l1=i1\r\n r1=j1\r\n con1=False\r\n break\r\nif con1:\r\n print(-1)\r\nif not con1:\r\n result=[l1, r1]\r\n for i in range(l1+1, r1):\r\n if math.gcd(i, l1)==1 and math.gcd(i, r1)==1:\r\n result.insert(1, i)\r\n break\r\n print(*result)", "import math\r\n\r\ndef main():\r\n\tl, r = map(int, input().split())\r\n\tfor c in range(l, r+1):\r\n\t\tfor b in range(l, c):\r\n\t\t\tfor a in range(l, b):\r\n\t\t\t\tif math.gcd(a, b) == 1 and math.gcd(b, c) == 1 and math.gcd(a, c) > 1:\r\n\t\t\t\t\tprint(a, b, c)\r\n\t\t\t\t\treturn\r\n\tprint(-1)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "l, r = [int(x) for x in input().split()]\n\nif r-l < 2:\n print(-1)\nelif l % 2 == 0:\n print(l, l+1, l+2)\nelif r-l == 2:\n print(-1)\nelse:\n print(l+1, l+2, l+3)", "def gcd(a,b):\r\n return a if b == 0 else gcd(b,a%b)\r\n\r\nL,R = map(int,input().split())\r\nR+=1\r\n\r\ndef solve():\r\n for a in range(L,R):\r\n for b in range(a+1,R):\r\n for c in range(b+1,R):\r\n if gcd(a,b) == 1 and gcd(b,c) == 1 and gcd(a,c) != 1:\r\n return str(a)+\" \"+str(b)+\" \"+str(c)\r\n return -1\r\n\r\nprint(solve())", "l,r = [int(i) for i in input().split()]\r\nl = l+l%2\r\nif l + 2 > r:\r\n\tprint(-1)\r\nelse:\r\n\tprint(l,l+1,l+2)\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\ndef is_coprime(a,b):\r\n return gcd(a,b) == 1\r\n\r\ndef find_counter(l,r):\r\n for i in range(l,r+1):\r\n for j in range(i+1, r+1):\r\n for k in range(j+1, r+1):\r\n if is_coprime(i,j) and is_coprime(j,k) and not is_coprime(i,k):\r\n return '{} {} {}'.format(i,j,k)\r\n return -1\r\n \r\n\r\n\r\nl,r = map(int, input().split())\r\n\r\nprint(find_counter(l,r))\r\n\r\n", "a ,b = map (int,input().split())\r\nif (b-a==1):\r\n print(-1)\r\nelif (a%2==0 and a+2 <=b):\r\n print(a,a+1,a+2)\r\nelif (a+3<=b):\r\n print(a+1,a+2,a+3)\r\nelse :\r\n print(-1)", "import sys\r\n\r\nl, r = map(lambda a: int(a), sys.stdin.readline().split(\" \"))\r\n\r\nif r - l < 2:\r\n print(-1)\r\n exit()\r\n\r\nif l % 2 == 0:\r\n print(l, ' ', l+1, ' ', l+2)\r\n exit()\r\n\r\nif r - l > 2:\r\n print(l+1, ' ', l+2, ' ', l+3)\r\n exit()\r\n\r\nprint(-1)", "l, r = map(int, input().split())\r\na, b, c = 0, 0, 0\r\nfor i in range(l, r - 1):\r\n for j in range(2, r - i + 1):\r\n if i % j == 0:\r\n a = i\r\n b = i + j // 2\r\n c = i + j\r\n if c % 2 == 0 and b % 2 == 0:\r\n b += 1\r\n print(a, b, c)\r\n exit()\r\nprint(-1)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nl,r=map(int,input().split())\r\nif l%2==0:\r\n\tans=[l,l+1,l+2]\r\n\tif (l+2)<=r:\r\n\t\tprint(*ans)\r\n\telse:\r\n\t\tprint(-1)\r\nelse:\r\n\tans=[l+1,l+2,l+3]\r\n\tif (l+3)<=r:\r\n\t\tprint(*ans)\r\n\telse:\r\n\t\tprint(-1)", "l, r = map(int, input().split())\r\n\r\nif r - l < 2:\r\n print(-1)\r\nelse:\r\n if r % 2 == 0:\r\n print(r - 2, r - 1, r)\r\n else:\r\n if r - l >= 3:\r\n print(r - 3, r - 2, r - 1)\r\n else:\r\n print(-1)\r\n", "from math import gcd\r\nl, r = map(int, input().split())\r\nif l%2 == 0 and r > l+1:\r\n print(l, l+1, l+2)\r\nelif l%2 == 1 and r > l+2:\r\n print(l+1, l+2, l+3)\r\nelif l%2 == 1:\r\n if gcd(l, l+2) > 1:\r\n print(l, l+1, l+2)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "l, r = map(int, input().split())\n\nif r - l < 2:\n\tprint(-1)\nelse:\n\tif l % 2 == 0:\n\t\tprint(l, l + 1, l + 2)\n\telif r - l == 2:\n\t\tprint(-1)\n\telse:\n\t\tprint(l + 1, l + 2, l + 3)\n\n", "l, r = [int(x) for x in input().split()]\r\n\r\nif l % 2 == 1:\r\n l += 1\r\n\r\nif r - l + 1 < 3:\r\n print(-1)\r\nelse:\r\n for i in range(l, l + 3):\r\n print(i, end=\" \")\r\n\r\n", "def rs(): return input().strip()\r\ndef ri(): return int(input())\r\ndef ria(): return list(map(int, input().split()))\r\ndef ia_to_s(a): return ' '.join([str(s) for s in a])\r\n\r\n\r\ndef solve(l, r):\r\n if r - l < 2:\r\n return [-1]\r\n if r - l == 2:\r\n if l % 2 == 0:\r\n return [l, l+1, l+2]\r\n else:\r\n return [-1]\r\n \r\n if l % 2 == 1:\r\n l += 1\r\n return [l, l + 1, l + 2]\r\n\r\n\r\ndef main():\r\n l, r = ria()\r\n print(ia_to_s(solve(l, r)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from math import gcd,sqrt\r\ndef ii():return int(input())\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\ndef si():return input()\r\nl,r=mi()\r\ndef isprime(n):\r\n if(n<=1):\r\n return 0\r\n for i in range(2,int(sqrt(n))+1):\r\n if(n%i==0):\r\n return 0\r\n return 1\r\ni=1\r\nb=[]\r\nwhile(1):\r\n if(isprime(i)):\r\n b.append(i)\r\n \r\n i+=1\r\n if(len(b)==50):\r\n break\r\n\r\nfor i in range(l,r+1):\r\n for j in range(i+1,r+1):\r\n for k in range(j+1,r+1):\r\n f,f1,f2=0,1,1\r\n for k2 in b:\r\n if(i%k2==0 and k%k2==0):\r\n f=1\r\n if(i%k2==0 and j%k2==0):\r\n f1=0\r\n if(k%k2==0 and j%k2==0):\r\n f2=0\r\n if(f1*f2):\r\n if(f):\r\n print(i,j,k)\r\n exit()\r\nprint(\"-1\")", "l, r = map(int, input().split())\r\n\r\nif l % 2 == 1:\r\n l += 1\r\n\r\nif r < l + 2:\r\n print(-1)\r\nelse:\r\n print(l,l+1,l+2, end= ' ')", "l, r = map(int, input().split())\r\n\r\nif l&1:\r\n l += 1\r\nif l+2 > r:\r\n print(\"-1\")\r\nelse:\r\n print(l, l+1, l+2)\r\n", "# Wadea #\r\n \r\na,b = map(int,input().split())\r\nif a % 2 != 0:\r\n a += 1\r\nif a+2 > b:\r\n print(-1)\r\nelse:\r\n print(a,a+1,a+2)\r\n", "l, r = map(int, input().split())\r\nif 3>r-l+1:\r\n print(-1)\r\nelif r-l+1==3 and l%2==1:\r\n print(-1)\r\nelse:\r\n l=2*(l//2+l%2)\r\n print(l, l+1, l+2)\r\n", "num1, num2 = map(int, input().split())\r\nn = num2 - num1 + 1\r\nif num1 % 2 == 0:\r\n if n >= 3:\r\n print(num1, num1 + 1, num1 + 2)\r\n exit(0)\r\nelse:\r\n if n >= 4:\r\n print(num1 + 1, num1 + 2, num1 + 3)\r\n exit(0)\r\nprint(-1)", "l,r=list(map(int,input().split()))\r\nif r-l+1<3: print(-1)\r\nelif l%2==0: print(l,l+1,l+2)\r\nelif r-l+1>3: print(l+1,l+2,l+3)\r\nelse: print(-1)", "l, r = [int(x) for x in input().split()]\r\nif l % 2 != 0:\r\n l += 1\r\nif r - l < 2:\r\n print(-1)\r\nelse:\r\n print(l, l + 1, l + 2)", "import math;import sys\r\ndef counter_example():\r\n a,b=list(map(int,input().split()))\r\n for i in range(a,b+1):\r\n for j in range(i+1,b+1):\r\n for k in range(j+1,b+1):\r\n if math.gcd(i,j)==math.gcd(j,k) and math.gcd(i,k)!=1:print(i,j,k);sys.exit()\r\n else:print(-1)\r\ncounter_example()", "from fractions import gcd\nl,r=map(int,input().split())\n\ndef ce(l, r):\n for a in range(l, r+1):\n for b in range(a+1, r+1):\n for c in range(b+1, r+1):\n if gcd(a,b)==1 and gcd(b,c)==1 and gcd(a,c)!=1:\n return [a,b,c]\n\n return [-1]\n\nprint(' '.join('{}'.format(x) for x in ce(l,r)))\n", "import math\nl, r = [int(p) for p in input().split()]\n\nfor i in range(l, r+1):\n a = i\n b = i+1\n for j in range(i+2, r+1):\n if math.gcd(a, j) > 1 and math.gcd(b, j) == 1:\n print(a, b, j)\n exit()\n\nprint(-1)", "l,r = map(int,input().split())\r\na = l\r\nwhile not(a%2 == 0):\r\n a += 1\r\nb = a + 1\r\nc = a + 2\r\nif a >= l and c <= r:\r\n print(a,b,c)\r\nelse:\r\n print(-1)", "def f(ll):\r\n l,r =ll\r\n if r-l<2 or (r-l==2 and l%2>0):\r\n return [-1]\r\n return [l,l+1,l+2] if l%2==0 else [l+1,l+2,l+3]\r\n\r\nl = list(map(int,input().split()))\r\nprint(*f(l))\r\n", "# from dust i have come, dust i will be\r\n\r\nl,r=map(int,input().split())\r\n\r\n'''\r\na,b,c- gcd(a,b)=1, gcd(b,c)=1\r\ntake a,c-even number, b as odd\r\n'''\r\n\r\nif l%2==1:\r\n l+=1\r\n\r\nif l+2>r:\r\n print(-1)\r\nelse:\r\n print(l,l+1,l+2)", "n = list(map(int,input().split()))\r\nl = n[0]\r\nr = n[1]\r\ndef run():\r\n\tif r - l + 1 < 3 :\r\n\t\tprint(-1)\r\n\t\treturn 0\r\n\r\n\tif l % 2 == 0:\r\n\t\tprint(l,l+1,l+2)\r\n\t\treturn 0\r\n\tif r - l + 1 > 3:\r\n\t\tprint(l + 1, l + 2,l + 3)\r\n\t\treturn 0\r\n\tprint(-1)\r\n\r\nrun()", "# n, m = map(int, input().split())\r\n# z = m - n\r\n# a = n\r\n# c = a*2\r\n# b = c - 1\r\n# if z <= 1:\r\n# print('-1')\r\n# else:\r\n# print(a, b, c)\r\nn, m = map(int, input().split())\r\nif n % 2 == 0:\r\n a = n\r\nelse:\r\n a = n + 1\r\nb = a + 1\r\nc = b + 1\r\nif (c > m) | (m - n <= 1):\r\n print('-1')\r\nelse:print(a, b, c)", "data = input().split()\r\n\r\nL, R = int(data[0]), int(data[1])\r\nif R == L + 1 or R == L:\r\n print('-1')\r\nelif L%2 == 0:\r\n print(L, L + 1, L + 2)\r\nelif R - L + 1 > 3:\r\n print(L + 1, L + 2, L + 3)\r\nelse:\r\n print('-1')", "import math\r\nL, R = map(int,input().split())\r\n\r\nif L%2!=0:\r\n\tL+=1\r\n\r\nif R-L<=1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(L,L+1,L+2)\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\t\r\n", "l,r = map(int,input().split())\r\nif l%2 == 0 and r - l > 1 :\r\n print( l,l+1,l+2)\r\nelif l%2 != 0 and r - l > 2:\r\n print(l+1,l+2,l+3)\r\nelse :\r\n print(-1)\r\n", "from sys import stdin\r\nimport math\r\n\r\ndef verify(a, b, c):\r\n if(a >= c or b >= c):\r\n return 0\r\n if(math.gcd(a, b) == 1 and math.gcd(b, c) == 1 and math.gcd(a, c) != 1):\r\n return (a, b, c)\r\n return verify(a, b+1, c) or verify(a, b, c-1) or verify(a+1, b+1, c)\r\n\r\ndef main():\r\n l, r = list(map(int, stdin.readline().strip().split()))\r\n result = verify(l, l+1, r)\r\n if(result):\r\n print(f\"{result[0]} {result[1]} {result[2]}\", end = \"\")\r\n else:\r\n print(-1, end = \"\")\r\n\r\nmain()", "l , r = [int(x) for x in input().split()]\r\nif r - l >= 2 and l % 2 == 0:\r\n print(l , l+1 , l+2)\r\nelif r - l > 2 and l % 2 != 0:\r\n print( l+1 , l+2 , l + 3 )\r\nelse:\r\n print(-1)\r\n#shanbat", "l,r=input().split(\" \")\r\nl,r=int(l),int(r)\r\nif (l % 2 != 0):\r\n l+=1\r\nif (l + 2 > r):\r\n print(-1);\r\nelse:\r\n print(l,l+1,l+2)\r\n \r\n \r\n \r\n", "#!/usr/bin/python3\n\nimport sys\nimport argparse\nimport json\nfrom pprint import pprint\nimport math\n\ndef main():\n l, r = map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n vals = dict()\n for i in range(l, r+1):\n for j in range(i+1, r+1):\n vals[(i, j)] = math.gcd(i, j)\n\n for a in range(l, r+1):\n for b in range(a+1, r+1):\n if vals[(a,b)] != 1:\n continue\n for c in range(b+1, r+1):\n if vals[(b,c)] == 1 and vals[(a,c)] != 1:\n print(\"%s %s %s\" % (a, b, c))\n return\n print(-1)\n\ndef get_tests():\n #tests = [(\"512 4\", \"50\")]\n\n for test in tests:\n print(json.dumps({\"input\": test[0], \"output\": test[1]}))\n\nif __name__ == \"__main__\":\n parser = argparse.ArgumentParser()\n parser.add_argument(\"--get-tests\", action=\"store_true\")\n args = parser.parse_args()\n\n if args.get_tests:\n get_tests()\n else:\n main()\n", "l , r = list(map(int,input().split()))\r\nif r - l > 2 : \r\n a = (l+1)//2 * 2\r\n print(a,a+1,a+2)\r\nelif r - l == 2 :\r\n if l % 2 == 0 :\r\n print(l,l+1,r)\r\n else :\r\n print('-1')\r\nelse :\r\n print('-1')", "a,b = map(int,input().split())\nif a % 2:\n\ta += 1\nif a + 2 > b:\n\tprint(-1)\n\texit()\nprint(a , a+ 1, a+ 2)\n", "l, r = list(map(int, input().split()))\n\nif l % 2 == 1:\n l = l+1\n\nif l+2 > r:\n print(-1)\nelse:\n print(l, l+1, l+2)\n \t \t\t\t \t\t \t\t \t\t \t\t\t\t \t \t", "a, b = map(int, input().split())\r\nif b - a < 2:\r\n print(-1)\r\nelif b - a == 2 and b % 2 == 1:\r\n print(-1)\r\nelse:\r\n if a % 2 == 0:\r\n print(a, a + 1, a + 2)\r\n else:\r\n print(a + 1, a + 2, a + 3)\r\n", "#!/usr/bin/python3\n\ndef main():\n landr = input()\n\n l, r = [int(x) for x in landr.split(\" \")]\n found = False\n\n for i in range(l, r - 1):\n for j in range(i + 1, r):\n for k in range (j + 1, r + 1):\n if (gcd(i, j) == 1 and gcd(j, k) == 1) and gcd(i, k) != 1:\n print(i, j , k)\n found = True\n return\n\n if not found:\n print(-1)\n\ndef gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a % b)\n\nmain()\n", "from math import gcd\r\n\r\nl,r=map(int,input().split())\r\nres=False\r\n\r\nfor a in range(l,r+1):\r\n for b in range(a+1,r+1):\r\n for c in range(b+1,r+1):\r\n if gcd(a,b)==1 and gcd(b,c)==1 and gcd(a,c)!=1:\r\n print(str(a)+' '+str(b)+' '+str(c))\r\n res=True\r\n break\r\n if res:\r\n break\r\n if res:\r\n break\r\n\r\nif not res:\r\n print(-1)", "a,b = map(int,input().split())\r\nif abs(a-b)<2:print(-1)\r\nelse:\r\n\tif a%2==0:print(a,a+1,a+2)\r\n\telse:\r\n\t\tif (b-a)>=3:print(a+1,a+2,a+3)\r\n\t\telse:print(-1)", "a,b=map(int,input().split())\r\nif max(a,b)-min(a,b) +1<=2:\r\n print(-1)\r\nelif max(a,b)-min(a,b) +1==3:\r\n if a % 2==1 and b %2==1:\r\n print(-1)\r\n else:\r\n print(min(a,b),min(a,b)+1,min(a,b)+2)\r\nelse:\r\n ans=0\r\n for i in range(a,b+1):\r\n if i%2==0:\r\n ans=i\r\n break\r\n print(ans,ans+1,ans+2)", "l,r=map(int,input().split())\r\nimport math\r\nimport sys\r\nfor i in range(l,r+1):\r\n for j in range(i+1,r+1):\r\n for k in range(j+1,r+1):\r\n if math.gcd(i,j)==1 and math.gcd(j,k)==1 and math.gcd(i,k)!=1:\r\n print(i,j,k)\r\n sys.exit()\r\nprint(-1)", "from math import gcd\r\nfrom itertools import combinations\r\nl,r = map(int,input().strip().split())\r\nnumbers = list(range(l,r+1))\r\nz = []\r\narr = list(combinations(numbers,3))\r\nfor combination in arr:\r\n if (gcd(combination[0],combination[1]) == 1) and (gcd(combination[1],combination[2]) == 1) and (gcd(combination[0],combination[2]) != 1):\r\n z = [combination[0],combination[1],combination[2]]\r\n break\r\nif len(z)>0:\r\n print(*z,sep = ' ')\r\nelse:\r\n print(-1)", "n,m=map(int,input().split())\r\nif (m-n)<=1:\r\n print(\"-1\")\r\nelif n%2!=0 and (m-n)<=2:\r\n print(\"-1\")\r\nelif n%2==0:\r\n print(n,n+1,n+2)\r\nelse:\r\n print(n+1,n+2,n+3)", "[l,r] = list(map(int,input().split()))\r\n\r\nif (r-l+1)<3 or (l%2==1 and (r-l+1)<4):\r\n print(-1)\r\nelse:\r\n if l%2 == 0:\r\n a = l\r\n b = l+1\r\n c = l+2\r\n print(*[a,b,c], sep=' ')\r\n \r\n else:\r\n a = l+1\r\n b = l+2\r\n c = l+3\r\n print(*[a,b,c], sep=' ')\r\n \r\n", "# python 3\n\n\ndef gcd(a, b):\n \"\"\"\n Compute greatest common divider using Euclidean algorithm, assuming\n a > b.\n gcd(a, 0) = a\n gcd(a, b) = gcd(b, a % b)\n \"\"\"\n if b == 0:\n return a\n else:\n return gcd(b, a % b)\n\n\nl_val, r_val = list(map(int, input().split()))\nfor a_val in range(l_val, r_val+1):\n for b_val in range(a_val+1, r_val+1):\n for c_val in range(b_val+1, r_val+1):\n if gcd(a_val, b_val) == 1:\n if gcd(b_val, c_val) == 1:\n if gcd(a_val, c_val) != 1:\n print(a_val, b_val, c_val)\n exit(0)\n else:\n continue\n else:\n continue\n else:\n continue\nprint('-1')\n", "l, r = map(int, input().split())\r\nl += l % 2\r\nif (r - l < 2):\r\n print(-1)\r\nelse:\r\n print(l, l + 1, l + 2)\r\n", "line=input().split()\r\nl=int(line[0])\r\nr=int(line[1])\r\n\r\nif r-l >=2 and l%2==0:\r\n print(l, l+1, l+2)\r\nelif r-l>=3 and l%2!=0:\r\n print(l+1, l+2,l+3)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "#l = list(map(int, input().strip().split()))[:n]\r\nn1, n2 = input().split()\r\nn1, n2 = int(n1), int(n2)\r\nif n1 % 2 != 0:\r\n n1 += 1\r\nif abs(n1-n2) < 2:\r\n print(-1)\r\n exit()\r\nelse:\r\n print(str(n1)+\" \"+str(n1+1)+\" \"+str(n1+2)+\"\\n\")\r\n", "def gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\n\r\n\r\nl, r = map(int, input().split())\r\n\r\nrip = True\r\n\r\nif r-l < 2:\r\n print(-1)\r\nelse:\r\n for j in range(l, r-1):\r\n for i in range(j+2, r+1):\r\n if gcd(i, j+1) == 1 and gcd(j, i) != 1:\r\n print(j, j+1, i)\r\n rip = False\r\n break\r\n\r\n if not rip:\r\n break\r\n\r\n if rip:\r\n print(-1)\r\n", "import math\r\nl, r = map(int, input().split())\r\nisdone = False\r\nfor a in range(l, r):\r\n if isdone: break\r\n for b in range(a+1, r):\r\n if isdone: break\r\n for c in range(b+1, r+1):\r\n if math.gcd(a, b) == 1 and math.gcd(b, c) == 1 and math.gcd(a, c) != 1:\r\n print(a, b, c)\r\n isdone = True\r\n break\r\nif not isdone:\r\n print(-1) ", "from fractions import gcd\r\nl , r = map(int, input().split())\r\nif r-l < 2 or (l%2 != 0 and r-l == 2):\r\n print(-1)\r\nelse:\r\n print(l + (l%2 != 0) , l+1+(l%2 != 0), l+2+(l%2 != 0))\r\n", "\"\"\"\r\nAuthor : Aman Thakur\r\nmantra: chor kya hi kar sakte hai!!\r\n\"\"\"\r\nimport math\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n self.l, self.r = map(int, input().strip().split())\r\n\r\n def solution(self):\r\n if self.l % 2:\r\n self.l += 1\r\n if self.l + 2 > self.r:\r\n print(-1)\r\n else:\r\n print(self.l, self.l + 1, self.l + 2)\r\n\r\nif __name__ == '__main__':\r\n ob = Solution()\r\n ob.solution()\r\n", "l,r = list(map(int, input().split()))\n\nif r-l+1<3:\n\tprint(-1)\nelif l%2==0:\n\tprint(l,l+1,l+2)\nelif r-l+1>3:\n\tprint(l+1,l+2,l+3)\nelse: print(-1)\n", "list = list(map(int,input().split()))\r\nl = list[0]\r\nr = list[1]\r\nif l % 2 != 0:\r\n l = l + 1\r\nif(r-l < 2):\r\n print(-1)\r\nelse:\r\n print(str(l) + \" \" + str(l + 1) + \" \" + str(l+2))", "l, r = [int(i) for i in input().split()]\r\nwhile l <= r - 2:\r\n if l % 2:\r\n l += 1\r\n else:\r\n print(*[l, l + 1, l + 2])\r\n break\r\nelse:\r\n print(-1)\r\n", "from math import gcd\r\na,b=list(map(int,input().split()))\r\nif a%2==1:a+=1\r\nif a+2>b:print(-1)\r\nelse:print(a,a+1,a+2)", "a , c = list(map(int , input().split()))\r\nn1 = 0 \r\nn2 = 0 \r\nn3 = 0 \r\nif(c - a+1 < 3):\r\n print(-1)\r\nelif(a % 2 == 0):\r\n print(str(a) + ' ' + str(a + 1) + ' ' + str(a + 2))\r\nelif(c - a + 1 > 3):\r\n print(str(a+1) + ' ' + str(a+2) + ' ' + str(a+3))\r\nelse:\r\n print(-1) ", "a=[int(x) for x in input().split()]\r\nl=a[0]\r\nr=a[1]\r\nif not(l%2):\r\n if l+2<=r:\r\n print(l,l+1,l+2)\r\n else:\r\n print(-1)\r\nelse:\r\n if(l+3<=r):\r\n print(l+1,l+2,l+3)\r\n else:\r\n print(-1)\r\n \r\n ", "l,r = [int(x) for x in input().split()]\r\n\r\nif(l%2==1):\r\n l+=1\r\nif(l+2>r):\r\n print(-1)\r\nelse:\r\n print(str(l)+\" \"+str(l+1)+\" \"+str(l+2))\r\n", "l,r=map(int,input().split())\r\nif(r-l<2):\r\n print(\"-1\")\r\nelif r-l==2 and r%2!=0:\r\n print(\"-1\")\r\nelse:\r\n if(l%2==0):\r\n a=l\r\n b=l+1\r\n c=l+2\r\n print(a,b,c)\r\n else:\r\n a=l\r\n b=l+1\r\n c=l+2\r\n print(a+1,b+1,c+1)\r\n", "x=[]\r\nx.extend(input().split())\r\nl = int(x[0])\r\nr = int(x[1])\r\nif l + 2 > r :\r\n print(-1)\r\nelif l + 2 == r and l % 2 == 1 :\r\n print ( -1 )\r\nelse :\r\n if l % 2 == 1 :\r\n l = l + 1\r\n print(l , l + 1 , l + 2)\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\n\r\nl, r = map(int, input().split())\r\n\r\nif r - l < 2 or (r-l == 2 and r%2 == 1):\r\n print(-1)\r\nelse:\r\n if l%2:\r\n l += 1\r\n\r\n print(l, l+1, l+2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def cgcd(a,b):\r\n while(a):\r\n b,a=a,b%a\r\n return b\r\n\r\nn=list(map(int,input().split()))\r\na=int(n[0])\r\nb=int(n[1])\r\nc=0\r\nk=0\r\nfor i in range(a,b-1):\r\n for j in range(i+1,b):\r\n for k in range(j+1,b+1):\r\n m=cgcd(i,j)\r\n o=cgcd(j,k)\r\n p=cgcd(i,k)\r\n if m==1 and o==1 and p!=1:\r\n c=c+1\r\n print(i,j,k)\r\n break\r\n else:\r\n continue\r\n if c>=1:\r\n break\r\n if c>=1:\r\n break\r\nif c<1:\r\n print(\"-1\")\r\n", "def gcd(a, b):\n\twhile a:\n\t\ta, b = b % a, a\n\treturn b\n\na, b = [int(x) for x in input().split()]\nfor i in range(a, b + 1):\n\tfor j in range(i + 1, b + 1):\n\t\tfor k in range(j + 1, b + 1):\n\t\t\tif gcd(i, j) == 1 and gcd(j, k) == 1 and gcd(i, k) != 1:\n\t\t\t\tprint(i, j, k)\n\t\t\t\texit(0)\nprint(-1)\n", "import math\r\nl, r = list(map(int, input().split()))\r\nco_primes = [set() for _ in range(50)]\r\n\r\n\r\n# def f(a, c):\r\n# if math.gcd(a, c) == 1:\r\n# co_primes[a - l].add(c)\r\n# co_primes[c - l].add(a)\r\n#\r\n#\r\n# def g():\r\n# for i, co_prime_with in enumerate(co_primes):\r\n# if len(co_prime_with) > 1:\r\n# for a in co_prime_with:\r\n# for b in co_prime_with:\r\n# if a != b and math.gcd(a, b) != 1:\r\n# print(\" \".join(map(str, sorted([a, b, i + l]))))\r\n# return True\r\n# print(-1)\r\n# return False\r\n#\r\n#\r\n# for i in range(l, r + 1):\r\n# for j in range(l, r + 1):\r\n# f(i, j)\r\n# g()\r\n\r\n# They rejected my correct answer using this method. L\r\n# 900000000000000009 900000000000000010 900000000000000021 is a legit answer to test 3.\r\n\r\n\r\ndef abc(a, b, c):\r\n if math.gcd(a, c) != 1:\r\n print(a, b, c)\r\n return True\r\n return False\r\n\r\n\r\ndef ab(a, b):\r\n for h in range(b, r + 1):\r\n if math.gcd(b, h) == 1:\r\n if abc(a, b, h):\r\n return True\r\n return False\r\n\r\n\r\ndef a(a):\r\n for j in range(a, r + 1):\r\n if math.gcd(a, j) == 1:\r\n if ab(a, j):\r\n return True\r\n return False\r\n\r\n\r\ndef start():\r\n for i in range(l, r + 1):\r\n if a(i):\r\n return True\r\n print(-1)\r\n return False\r\n\r\n\r\nstart()\r\n\r\n", "import math\r\ndef find_counterexample(l, r):\r\n for a in range(l, r - 1):\r\n for b in range(a + 1, r):\r\n if math.gcd(a, b) == 1: # Check if (a, b) is coprime\r\n for c in range(b + 1, r + 1):\r\n if math.gcd(b, c) == 1: # Check if (b, c) is coprime\r\n if math.gcd(a, c) != 1: # Check if (a, c) is not coprime\r\n return a, b, c\r\n return -1, -1, -1\r\n\r\nl, r = map(int, input().split())\r\na, b, c = find_counterexample(l, r)\r\n\r\nif a == -1:\r\n print(-1)\r\nelse:\r\n print(a, b, c)\r\n", "a,b=map(int,input().split())\r\nif(b-a<=1):\r\n print(-1)\r\n exit()\r\nif(a%2==1):\r\n if(b-a>2):\r\n print(a+1,a+2,a+3)\r\n else:\r\n print(-1)\r\nelse:\r\n print(a,a+1,a+2) ", "l,r=map(int,input().split())\r\nif ((r-l+1 <3) or ((r-l+1)==3 and l%2)):\r\n print(-1)\r\nelse:\r\n if l%2:\r\n l+=1\r\n print(l,l+1,l+2)", "l, r = map(int, input().split())\r\nif (r - l) < 2 or (r - l == 2 and r % 2 != 0):\r\n print(-1)\r\nelse:\r\n for i in range(l, r + 1):\r\n if i % 2 == 0:\r\n print(\"{} {} {}\".format(i, i + 1, i + 2))\r\n break\r\n", "l, r = map(int, input().split())\r\n\r\n# divider = 0\r\n#\r\n# if r - l > 1:\r\n# a = l\r\n# a_dividers = {x for x in range(1, int(a ** 0.5)+1) if a % x == 0} | {a}\r\n# b = l+1\r\n# b_dividers = {x for x in range(1, int(b ** 0.5)+1) if b % x == 0} | {b}\r\n#\r\n#\r\n#\r\n# # for i in range(1, (a+1) // 2):\r\n# # if a % i == 0:\r\n# # a_dividers.add(i)\r\n# #\r\n# # for i in range(1, (b+1) // 2):\r\n# # if b % i == 0:\r\n# # b_dividers.add(i)\r\n#\r\n# differ = a_dividers - b_dividers\r\n#\r\n# for i in differ:\r\n# if a + i > b and a + i <= r:\r\n# print(a, b, a+i)\r\n# break\r\n#\r\n# else:\r\n# print(-1)\r\n\r\nif l % 2 != 0:\r\n l += 1\r\n\r\nif l + 2 > r:\r\n print(-1);\r\nelse:\r\n print(f'{l} {l+1} {l+2}')", "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\n\r\n\r\nl,r = map(int,input().split())\r\nb = []\r\nc1 = 0\r\nfor i in range(l,r+1):\r\n for j in range(i + 1,r+1):\r\n for r in range(j+1,r+1):\r\n if ((gcd(i,j) == 1) and (gcd(j,r) == 1) and (gcd(i,r) != 1)):\r\n c1 = -1\r\n b.append([i,j,r])\r\n break\r\n if (c1 == -1):\r\n break\r\n if (c1 == -1):\r\n break\r\nif (c1 == -1):\r\n print(*(b[0]))\r\nelse:\r\n print('-1')", "# t=int(input())\r\nt=1\r\n# see u codeforces on 11-07-2020..bye bye\r\nfor _ in range(t):\r\n\t# n=int(input())\r\n\tn,m=map(int,input().split())\r\n\t# l=list(map(int,input().split()))\r\n\tif(n&1):\r\n\t\tn+=1\r\n\tif(n+2>m):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(n,n+1,n+2)", "import math\n\n\ndef gcd(a, b):\n r = b % a\n if r == 0:\n return a\n return gcd(r, a)\n\nl, r = list(map(int, input().split()))\n\nfor i in range(l, r+1):\n if i+2 <= r:\n if gcd(i, i+2) != 1:\n print(i, i+1, i+2)\n exit()\nprint(-1)\n \t \t \t\t \t\t\t\t \t\t\t \t\t\t \t", "l,r=[int(x) for x in input().split()]\r\nif l%2!=0:\r\n\tl+=1\r\nif l+2>r:\r\n\tprint(-1)\r\nelse:\r\n\tprint(l,l+1,l+2)", "from math import gcd\r\nl, r = map(int, input().split())\r\nfor i in range(l,r+1):\r\n for j in range(i, r + 1):\r\n for k in range(j, r + 1):\r\n if gcd(i,j) == 1 and gcd(j,k) == 1 and gcd(i,k) != 1:\r\n print(i,j,k)\r\n exit()\r\n if i == r and j == r and k == r:\r\n print(-1)", "x,r=map(int, input().split())\r\nl=[]\r\nfor i in range(x,r+1):\r\n l.append(i)\r\nif len(l)<3:\r\n print(-1)\r\n exit()\r\nelif len(l)==3:\r\n if l[0]%2==0:\r\n print(l[0],l[1],l[2])\r\n exit()\r\n else:\r\n print(-1)\r\n exit()\r\nelse:\r\n if l[0]%2==0:\r\n print(l[0],l[1],l[2])\r\n exit()\r\n else:\r\n print(l[1],l[2],l[3])\r\n exit()", "from math import gcd\n\nL, R = [int(x) for x in input().split()]\nans = []\nfor i in range(L, R + 1):\n if len(ans) is not 0:\n break\n for j in range(i + 1, R + 1):\n if len(ans) is not 0:\n break\n for k in range(j + 1, R + 1):\n if gcd(i, j) == 1 and gcd(j, k) == 1 and gcd(i, k) is not 1:\n ans.append(str(i))\n ans.append(str(j))\n ans.append(str(k))\n break\nif len(ans) == 0:\n print(-1)\nelse:\n print(' '.join(ans))\n", "from warnings import catch_warnings\ndef gcd(a,b):\n return a if b==0 else gcd(b,a%b)\nl,r = map(int,list(input().split()))\nans = -1\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n for k in range(j+1,r+1):\n if gcd(i,j)==1 and gcd(j,k)==1 and gcd(i,k)>1:\n ans = [i,j,k]\ntry:\n print(\" \".join(map(str,ans)))\nexcept:\n print(ans) ", "def gcd(a,b):\r\n return a if b == 0 else gcd(b, a%b)\r\n\r\nl,r = map(int, input().split())\r\n\r\nfor i in range(l,r-1):\r\n for j in range(i+1,r):\r\n if gcd(i,j) == 1:\r\n for k in range(j+1, r+1):\r\n if gcd(j,k) == 1 and gcd(i, k) != 1:\r\n print(i, j, k)\r\n exit(0)\r\n\r\nprint(-1)", "l, r = map(int, input().split())\n\ndef gcd(a, b):\n def _gcd(a, b):\n if b == 0:\n return a\n return _gcd(b, a % b)\n return _gcd(min(a, b), max(a, b))\n\n\nfound = False\nfor a in range(l, r + 1):\n for b in range(a + 1, r + 1):\n for c in range(b + 1, r + 1):\n if not found and gcd(a, b) == 1 and gcd(b, c) == 1 and gcd(a, c) != 1:\n print(a, b, c)\n found = True\n break\nif not found:\n print(-1)", "s = input().split()\r\nl,r = (int(i) for i in s)\r\nif(l%2 != 0):\r\n\tl += 1\r\nif(l+2 > r):\r\n\tprint(-1)\r\nelse:\r\n\tprint(l,l+1,l+2)", "n,k = map(int,input().split())\r\n\r\nif n%2 !=0:\r\n n+=1\r\nif n+2>k:\r\n print(\"-1\")\r\nelse:\r\n print(str(n)+ ' '+str((n+1))+\" \"+str((n+2)))", "# cook your dish here\r\nn, m = map(int, input().split())\r\nif(n%2==1 and m-n==2):\r\n print(-1)\r\nelif(m-n<=1):\r\n print(-1)\r\nelif(n%2==0):\r\n print(n, n+1, n+2)\r\nelif(n%2==1):\r\n print(n+1, n+2, n+3)\r\n \r\n ", "l,r=map(int,input().split())\r\nif r - l < 2:print(-1)\r\nelif r - l == 2:\r\n if l%2==0:print(l,l+1,l+2)\r\n else:print(-1)\r\nelse:\r\n if l%2==0:print(l,l+1,l+2)\r\n else:print(l+1,l+2,l+3)", "##n = int(input())\n##s = input()\n##A = list(map(int, input().split()))\nn, m = map(int, input().split())\nif m - n < 2:\n print(-1)\nelse:\n if n % 2 == 0:\n print(n, n+1, n+2)\n else:\n if m -n < 3:\n print(-1)\n else:\n print(n+1, n+2, n+3)\n", "def hcf(a, b):\r\n remainder = b%a\r\n if remainder == 0:\r\n return a\r\n return hcf(remainder, a)\r\n\r\nl, r = list(map(int, input().split()))\r\ncoprime = {}\r\nfor n1 in range(l, r, 1):\r\n for n2 in range(n1+1, r+1, 1):\r\n if hcf(n1, n2) == 1:\r\n existing = coprime.get(n1, [])\r\n existing.append(n2)\r\n coprime[n1] = existing\r\n\r\nresults = None\r\nfor a in coprime.keys():\r\n coprime_with_a = coprime[a]\r\n for b in coprime_with_a:\r\n for c in coprime.get(b, []):\r\n if c not in coprime_with_a:\r\n results = [a, b, c]\r\n results.sort()\r\n break\r\nif results is not None:\r\n print(results[0], results[1], results[2])\r\nelse:\r\n print(-1)\r\n", "l, r=[int(k) for k in input().split()]\r\nif r-l<2 or (r-l==2 and l%2):\r\n print(-1)\r\nelse:\r\n print(l+l%2, l+l%2+1, l+l%2+2)", "# In this template you are not required to write code in main\r\n\r\nimport sys\r\ninf = float(\"inf\")\r\n\r\n\r\n#from collections import deque, Counter, OrderedDict,defaultdict\r\n#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace\r\nfrom math import ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#from bisect import bisect_left,bisect_right\r\n\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod,MOD=1000000007,998244353\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nl,r=get_ints()\r\nflag=0\r\nfor i in range(l,r-1):\r\n for j in range(i+1,r):\r\n for k in range(j+1,r+1):\r\n if gcd(i,j)==1 and gcd(j,k)==1 and gcd(i,k)!=1:\r\n flag=1\r\n store1,store2,store3=i,j,k\r\n break\r\n if flag==1:\r\n break\r\n if flag==1:\r\n break\r\nif flag==1:\r\n print(store1,store2,store3)\r\nelse:\r\n print(-1)", "def solve():\r\n global l\r\n if l%2:\r\n l+=1\r\n if r-l>=2:\r\n print(l,l+1,l+2);return\r\n print(-1)\r\n\r\nif __name__ == '__main__':\r\n l, r = map(int, input().split())\r\n solve()", "from math import gcd\nl, r = (int(i) for i in input().split())\na, b, c = 0, 0, 0\nfor a in range(l, r-1):\n for c in range(a, r+1):\n if gcd(a, c) == 1:\n continue\n else:\n for b in range(a+1, c):\n if gcd(a, b) == 1 and gcd(b, c) == 1:\n print(a, b, c)\n quit()\nprint(-1)\n", "l,r=map(int,input().split())\r\nif l%2==0:\r\n if r-l<2:\r\n print(-1)\r\n else:\r\n print(*[l,l+1,l+2])\r\nelse:\r\n if r-l<3:\r\n print(-1)\r\n else:\r\n print(*[l+1,l+2,l+3])", "readints = lambda: map(int, input().split(' '))\r\n\r\nl,r = readints()\r\nif r-l+1<3:\r\n print(-1)\r\nelif r-l+1==3:\r\n if l%2==0:\r\n print(l,l+1,r)\r\n else:\r\n print(-1)\r\nelse:\r\n for i in range(l,r+1):\r\n if i%2==0:\r\n print(i,i+1,i+2)\r\n break", "li , ri = list(map(int,input().split()))\r\nif li % 2 != 0 :\r\n li+=1\r\nif li + 2 > ri :\r\n print(-1)\r\nelse:\r\n print(li,li+1,li+2)", "# coding: utf-8\ndef judge(a,b):\n while a>1:\n b, a = a, b%a\n return a\ndef search(l,r):\n for i in range(l,r+1):\n for j in range(i+1,r+1):\n for k in range(j+1,r+1):\n if judge(i,j) and judge(j,k) and not judge(i,k):\n print(i, j, k)\n return\n print(-1)\n return\nl, r = [int(i) for i in input().split()]\nsearch(l,r)\n", "l, r = map(int, input().split())\r\nif l % 2 == 0 and (r - l + 1) >= 3:\r\n print(l, l + 1, l + 2)\r\nelif l % 2 == 1 and (r - l + 1) >= 4:\r\n print(l + 1, l + 2, l + 3)\r\nelse:\r\n print(-1)", "import sys\r\n\r\ndef answer(l, r):\r\n if (r-l) < 2:\r\n print('-1')\r\n return\r\n #at least a width of 3\r\n if (r-l) == 2 and (r%2 == 0): #works for evens\r\n print(l, l+1, r)\r\n return\r\n if (r-l) == 2 and (r%2 == 1): #not for odds.\r\n print('-1')\r\n return\r\n #range with options\r\n if (l % 2) == 0:\r\n print(l, l+1, l+2)\r\n return\r\n else:\r\n print(l+1, l+2, l+3)\r\n return\r\n \r\n return #null\r\n\r\ndef main():\r\n l, r = [int(i) for i in sys.stdin.readline().split()]\r\n answer(l, r)\r\n\r\n return\r\nmain()", "import fractions\r\nf=fractions.gcd\r\nl,r=map(int,input().split())\r\nfor a in range(l,r+1):\r\n for b in range(a,r+1):\r\n for c in range(b,r+1):\r\n if f(a,b)==1 and f(b,c)==1 and f(a,c)!=1:\r\n print(a,b,c)\r\n exit()\r\nprint(-1)", "a,b=map(int,input().split())\r\nif b-a<2:\r\n print(-1)\r\nelse:\r\n if b-a==2 and b%2==1 and a%2==1:\r\n print(-1)\r\n else:\r\n if b%2==1:\r\n print(b-3,b-2,b-1)\r\n else:\r\n print(b-2,b-1,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\n\r\ndef inp(a,b):\r\n ans=[]\r\n for i in range(a,b+1):\r\n for j in range(i+1,b+1):\r\n x = gcd(i,j)\r\n if x==1:\r\n for k in range(j+1,b+1):\r\n y = gcd(j,k)\r\n if y==1:\r\n z = gcd(i,k)\r\n if z != 1:\r\n ans.append(i)\r\n ans.append(j)\r\n ans.append(k)\r\n return ans\r\n return -1\r\n\r\na,b =map(int,input().split())\r\nx =inp(a,b)\r\nif x== -1:\r\n print(x)\r\nelse:\r\n print(*x)", "import sys\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n l, r = (int(i) for i in read().split())\r\n if r - l + 1 < 3:\r\n print(-1)\r\n return\r\n if r - l + 1 == 3 and l % 2 != 0 and r % 2 != 0:\r\n print(-1)\r\n return\r\n # At this point you are guaranteed to have at least 4 elts\r\n num_1, num_2, num_3 = None, None, None\r\n for i in range(l, r + 1):\r\n if i % 2 == 0:\r\n num_1 = i\r\n break\r\n num_2 = num_1 + 1\r\n num_3 = num_2 + 1\r\n\r\n print(num_1, num_2, num_3)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l,r=[int(c) for c in input().split()]\r\nif l&1:\r\n l+=1\r\n\r\nif l+2 > r:\r\n print(-1)\r\nelse:\r\n print(l,l+1,l+2)", "import math\r\nx, y = list(map(int, input().split()))\r\n\r\nif x%2==0:\r\n if(y-x >= 2):\r\n print(x,x+1,x+2)\r\n else:\r\n print(-1)\r\nelse:\r\n if y-x >= 3:\r\n print(x+1,x+2,x+3)\r\n elif y-x == 2 and math.gcd(x,x+2) != 1:\r\n print(x,x+1,x+2)\r\n else:\r\n print(-1)", "import math\r\nl,r=map(int,input().split(\" \"))\r\nc=0\r\nif r-l+1 <3:\r\n print(-1)\r\nelse:\r\n for i in range(l,r-1):\r\n if c==1:\r\n break\r\n for j in range(l+1,r):\r\n if c==1:\r\n break\r\n for k in range(j+1,r+1):\r\n if math.gcd(i,j)==1 and math.gcd(j,k)==1 and math.gcd(i,k)!=1:\r\n print(i,j,k)\r\n c+=1\r\n break\r\n if c==0:\r\n print(-1)", "\r\nl, r = map(int,input().split())\r\n\r\nif(l%2!=0):\r\n\r\n\tl = l+1\r\n\r\nif(l+2>r):\r\n\r\n\tprint (\"-1\")\r\n\r\nelse:\r\n\r\n\tprint (l,l+1,l+2)\r\n", "l,r = input().split()\r\nl,r=int(l),int(r)\r\n\r\nif(r-l<2):\r\n print(-1)\r\nelif(r-l==2 and l%2==0):\r\n print(l,l+1,r)\r\nelif(r-l==2 and l%2==1):\r\n print(-1)\r\nelse:\r\n while(l%2==1):\r\n l+=1\r\n print(l,l+1,l+2)\r\n", "from math import gcd\n\n\ndef solve(l, r):\n for i in range(l, r - 1):\n for j in range(i + 1, r):\n if gcd(i, j) != 1:\n break\n for k in range(j + 1, r + 1):\n if gcd(j, k) == 1 and gcd(i, k) != 1:\n return (i, j, k)\n return (-1,)\n\n\nprint(*solve(*map(int, input().split())))\n", "import math\r\nflag = False\r\nl,r = map(int,input().split()) # 2 5\r\nfor i in range(l,r-1): # 2 - 3\r\n for j in range(i+1,r):\r\n for k in range(j+1,r+1):\r\n if math.gcd(i,j) == 1 and math.gcd(j,k) == 1 and math.gcd(i,k) != 1:\r\n #print((i,j),(j,k))\r\n print(i,j,k)\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\n \r\nif flag == False:\r\n print(-1)\r\n \r\n ", "l,r = map(int,input().split())\r\nif l % 2 != 0:\r\n l += 1\r\nif abs(l-r) < 2:\r\n print(-1)\r\nelse:\r\n print(l,l+1,l+2)", "from math import gcd\nl, r = map(int, input().split())\nr += 1\nfor c in range(l, r):\n for b in range(l, c):\n for a in range(l, b):\n if gcd(a, b) == gcd(b, c) == 1 and gcd(a, c) != 1:\n print(a, b, c)\n exit(0)\nprint(-1)\n", "l,r=input().split(\" \")\r\nl,r=int(l),int(r)\r\n\r\na,b,c=l,l+1,l+2\r\n\r\nif (l % 2 != 0):\r\n a,b,c=a+1,b+1,c+1\r\n \r\nif (c > r):\r\n print(-1)\r\n \r\nelse:\r\n print(a,b,c)", "a,b=list(map(int,input().split()))\r\nc=b-a\r\nif c<2: print(-1)\r\nelif c==2:\r\n if a%2:\r\n print(-1)\r\n else:\r\n print(a,a+1,a+2)\r\nelse:\r\n if a%2:\r\n print(a+1,a+2,a+3)\r\n else:\r\n print(a,a+1,a+2)", "# 483 A Counterexample\n\n\nL,R = map(int,input().split())\n\nif R == L + 1 or R == L:\n print('-1')\nelif L%2 == 0:\n print(L, L + 1, L + 2)\nelif R - L + 1 > 3:\n print(L + 1, L + 2, L + 3)\nelse:\n print('-1')", "l , r = map(int , input().split())\r\nif (l%2 != 0):\r\n l+=1\r\nif (l+2>r):\r\n \r\n print(-1)\r\nelse :\r\n print(f\"{l} {l+1} {l+2}\")", "l,r=map(int,input().split())\r\nif r-l>=1:\r\n for i in range(l, r + 1):\r\n if i % 2 != 0:\r\n i += 1\r\n elif i + 2 > r:\r\n print(-1)\r\n exit()\r\n else:\r\n print(i, i + 1, i + 2)\r\n exit()\r\nelse:\r\n print(-1)\r\n\r\n\r\n\r\n", "'''\r\n We have 4 cases for solve the problem(Note: if there's many solution print one)\r\n 1- Case #1: if l,r difference equal to 1 or both of them equal\r\n so the solution will be -1\r\n ex:\r\n l = 1 r = 2 solution : -1\r\n 2- Case #2: if l is even number, solutions will be l(cuz its not prime), l+1 and r (the last one)\r\n for example:\r\n l = 2 r = 4 solution: l = 2, l+1 = 3, r = 4\r\n 2, 3, 4\r\n 3- Case #3: if r - l >= 3\r\n solutions will be l+1 (our first number\r\n cuz it will be even number and no-prime)\r\n , l+2 and l+3 (just 3 adjacent numbers start by even one)\r\n For example:\r\n l = 900000000000000009 r = 900000000000000029\r\n solution will be: l+1, l+2, l+3\r\n 900000000000000010, 900000000000000011, 900000000000000012\r\n \r\n 4- Case #4: otherwise all of the above the solution will be -1\r\n for example:\r\n l = 1 r = 3 solution wil be: -1\r\n'''\r\nl, r = map(int, input().split())\r\nif r-l < 2:\r\n print(-1)\r\nelif l%2 == 0:\r\n print(l, l+1, l+2)\r\nelif r-l >= 3:\r\n print(l+1, l+2, l+3)\r\nelse:\r\n print(-1)\r\n", "from sys import stdin\r\nfrom math import gcd\r\ninput = stdin.buffer.readline\r\nl, r = map(int, input().split())\r\nfor i in range(l, r + 1):\r\n\tfor j in range(l, i):\r\n\t\tfor k in range(l, j):\r\n\t\t\tif gcd(k, j) == gcd(j, i) != gcd(k, i):\r\n\t\t\t\texit(print(k, j, i))\r\nprint(-1)", "import math\r\n\r\na, b = [int(i) for i in input().split()]\r\nz = -1\r\notv=str()\r\n\r\nfor i in range(a, b-1):\r\n for n in range(i, b):\r\n for g in range(n, b+1):\r\n if math.gcd(i, n) == 1 and math.gcd(n, g) == 1 and math.gcd(g,i) != 1:\r\n z=1\r\n otv=(str(i) + ' ' + str(n) + ' ' + str(g))\r\n break\r\n if z==1:\r\n break\r\n if z==1:\r\n break\r\n\r\nif z == -1:\r\n print(z)\r\nelse:\r\n print(otv)", "l, r = map(int, input().split())\r\nif l%2 == 0:\r\n if l+2 > r:\r\n print(-1)\r\n else:\r\n print(l,l+1,l+2)\r\nelse:\r\n if l+3 > r:\r\n print(-1)\r\n else:\r\n print(l+1,l+2,l+3)", "def gcd(a,b):\r\n if a%b==0:\r\n return b\r\n return gcd(b,a%b)\r\nl,r=map(int,input().split())\r\nfor a in range(l,r+1):\r\n for b in range(a+1,r+1):\r\n if gcd(a,b)>1:\r\n continue\r\n for c in range(b+1,r+1):\r\n if gcd(b,c)>1:\r\n continue\r\n if gcd(a,c)>1:\r\n print(' '.join(map(str,[a,b,c])))\r\n exit()\r\nprint('-1')", "R = lambda: map(int, input().split())\r\nl,r = R()\r\nif l % 2:\r\n l += 1\r\nif r-l >= 2:\r\n print(l,l+1,l+2)\r\nelse:\r\n print(-1)", "import math\nl, r = map(int, input().split())\nflag = 0\nfor i in range(l, r):\n a = i\n for j in range(i + 1, r + 1):\n if math.gcd(a, j) == 1:\n b = j\n for k in range(j + 1, r + 1):\n if math.gcd(b, k) == 1 and math.gcd(a, k) > 1:\n c = k\n flag = 1\n break\n if flag:\n break\n if flag:\n break\nif flag:\n print(a, b, c)\nelse:\n print(-1)", "import math as m\r\n\r\nd = list(map(int, input().split()))\r\n\r\na = d[0]\r\nc = d[1]\r\nb = d[0] + 1\r\nans = 1\r\n\r\nif c - a > 1:\r\n while True:\r\n if m.gcd(a, b) == 1 and m.gcd(b, c) == 1 and m.gcd(a, c) != 1:\r\n break\r\n elif m.gcd(a, b) == 1 and m.gcd(b, c) == 1 and m.gcd(a, c) == 1:\r\n if c - 1 > b:\r\n c -= 1\r\n elif a < b:\r\n a += 1\r\n else:\r\n if b < c-1:\r\n b += 1\r\n else:\r\n if b == c:\r\n ans = -1\r\n break\r\nelse:\r\n ans = -1\r\n\r\nif m.gcd(a, b) == 1 and m.gcd(b, c) == 1 and m.gcd(a, c) != 1 and d[1] - d[0] > 1:\r\n print(a, b, c)\r\nelse:\r\n print(-1)\r\n", "import math\r\ndef checkcoprime(a,b):\r\n for i in range(2,min(a,b)+1):\r\n if a%i==0 and b%i==0:\r\n return False\r\n\r\n\r\n return True\r\n\r\ndef coprime(s,r):\r\n \r\n\r\n\r\n\r\n for j in range(s,r+1):\r\n for k in range(j+1,r+1):\r\n for l in range(k+1,r+1):\r\n if math.gcd(j,k)==1 and math.gcd(k,l)==1 and math.gcd(j,l)!=1:\r\n print(j, k, l)\r\n return \r\n\r\n print(-1)\r\n return\r\n\r\n\r\ns,r=map(int,input().split())\r\ncoprime(s,r)", "def gcd(a,b):\n\n if a == 0:\n return b\n\n else:\n return gcd(b%a,a)\n\n\n\nl,r = map(int,input().split())\n\ntemp = 0\nfor i in range(l,r+1):\n for j in range(i+1,r+1):\n z = gcd(i,j)\n if z == 1:\n for k in range(j+1,r+1):\n m = gcd(j,k)\n if m == 1:\n n = gcd(i,k)\n if n == 1:\n temp = 0\n else:\n temp = 1\n break\n if temp ==1:\n break\n\n if temp == 1:\n break\n\n\nif temp == 1:\n print(i,j,k)\nelse:\n print(-1)\n\n\n\n\n\n\n\n\n", "import math\r\n\r\nl, r = (map(int, input().split()))\r\na = l\r\nif a % 2:\r\n a += 1\r\n\r\nif a + 2 > r:\r\n print(-1)\r\nelse:\r\n print(a, a + 1, a + 2)", "l, r = [int(x) for x in input().split()]\r\n\r\n\r\nif (l % 2 != 0):\r\n l += 1\r\nif (abs(l - r)) < 2:\r\n print('-1')\r\nelse:\r\n print(str(l) + \" \" + str(l + 1) + \" \" + str(l + 2))", "a,b=list(map(int,input().split(\" \")))\r\nif b-a<2:\r\n print(-1)\r\nelse:\r\n if a%2!=0:\r\n if b-a==2:\r\n print(-1)\r\n else:\r\n a+=1\r\n print(f\"{a} {a+1} {a+2}\")\r\n else:\r\n print(f\"{a} {a + 1} {a + 2}\")\r\n", "import math\n\n\nclass CodeforcesTask483ASolution:\n def __init__(self):\n self.result = ''\n self.l_r = []\n\n def read_input(self):\n self.l_r = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n sol = False\n for a in range(self.l_r[0], self.l_r[1] + 1):\n for b in range(a + 1, self.l_r[1] + 1):\n for c in range(b + 1, self.l_r[1] + 1):\n if int(math.gcd(a, b)) == 1 and int(math.gcd(b, c)) == 1 and int(math.gcd(a, c)) != 1:\n self.result = \"{0} {1} {2}\".format(a, b, c)\n sol = True\n if not sol:\n self.result = \"-1\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask483ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "l,r=map(int,input().split())\r\nif l%2==0:\r\n if r-l>=2:print(l,l+1,l+2)\r\n else:print(-1)\r\nelse:\r\n if r-l>=3:print(l+1,l+2,l+3)\r\n else:print(-1)", "l, r = map(int, input().split())\r\nif r - l <= 1:\r\n print(-1)\r\nelif r - l == 2:\r\n if l%2 == 0:\r\n print(l, l+1, l+2)\r\n else:\r\n print(-1)\r\nelse:\r\n if l%2 == 0:\r\n print(l, l+1, l+2)\r\n else:\r\n print(l+1, l+2, l+3)", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2019-01-25 15:08:49\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nfrom sys import stdin\r\n\r\nmax_val=int(10e12)\r\nmin_val=int(-10e12)\r\n\r\ndef read_int() : return int(stdin.readline())\r\ndef read_ints() : return [int(x) for x in stdin.readline().split()]\r\ndef read_str() : return input()\r\ndef read_strs() : return [x for x in stdin.readline().split()]\r\n\r\n\r\na, b = read_ints()\r\na += a % 2\r\nans = [-1]\r\nif a + 2 <= b:\r\n ans = [a, a + 1, a + 2]\r\nprint(*ans)\r\n", "'''\nYour friend has recently learned about coprime numbers.\nA pair of numbers {a, b} is called coprime if\nthe maximum number that divides both a and b is equal to one.\n\nYour friend often comes up with different statements.\nHe has recently supposed that if the pair (a, b) is coprime\nand the pair (b, c) is coprime, then the pair (a, c) is coprime.\n\nYou want to find a counterexample for your friend's statement.\nTherefore, your task is to find three distinct numbers (a, b, c),\nfor which the statement is false, and the numbers meet the\ncondition l ≤ a < b < c ≤ r.\n\nMore specifically, you need to find three numbers (a, b, c),\nsuch that l ≤ a < b < c ≤ r, pairs (a, b) and (b, c) are coprime,\nand pair (a, c) is not coprime.\n=========================\nInput\nThe single line contains two positive space-separated integers\nl, r (1 ≤ l ≤ r ≤ 1018; r - l ≤ 50).\n=========================\nOutput\nPrint three positive space-separated integers a, b, c —\nthree distinct numbers (a, b, c) that form the counterexample.\nIf there are several solutions, you are allowed to print any of them.\nThe numbers must be printed in ascending order.\n\nIf the counterexample does not exist, print the single number -1.\n=========================\nSample test(s)\n\nInput\n2 4\nOutput\n2 3 4\n\nInput\n10 11\nOutput\n-1\n\nInput\n900000000000000009 900000000000000029\nOutput\n900000000000000009 900000000000000010 900000000000000021\n'''\n## Running Time ===>>> 62 ms\n\ndata = input().split()\n\nL, R = int(data[0]), int(data[1])\n\n'''\n We have 4 cases for solve the problem(Note: if there's many solution print one)\n 1- Case #1: if l,r difference equal to 1 or both of them equal\n so the solution will be -1\n ex:\n l = 1 r = 2 solution : -1\n 2- Case #2: if l is even number so one of solutions for this problem\n will be l cuz its not prime and l+1 and r the last one\n for example:\n l = 2 r = 3 solution: l = 2, l+1 = 3, r = 4\n 2, 3, 4\n 3- Case #3: if difference between l and r greater than 3\n so solution here will be the l+1 our first number\n cuz it will be even number and no-prime\n and l+2 and l+3 just 3 adjacent numbers start by even one\n For example:\n l = 900000000000000009 r = 900000000000000029\n solution will be: l+1, l+2, l+3\n 900000000000000010, 900000000000000011, 900000000000000012\n For you this is hust one of many solution in l and r range\n 4- Case #4: otherwise all of the above the solution will be -1\n for example:\n l = 1 r = 3 solution wil be: -1\n'''\nif R == L + 1 or R == L:\n print('-1')\nelif L%2 == 0:\n print(L, L + 1, L + 2)\nelif R - L + 1 > 3:\n print(L + 1, L + 2, L + 3)\nelse:\n print('-1')\n \t \t\t\t \t \t\t \t\t \t \t\t \t \t", "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\nl,r = input().split(\" \")\r\nl = int(l); r = int(r)\r\n\r\nif r <= l+1:\r\n print(-1)\r\nelif l % 2 == 0:\r\n print(l,l+1,l+2)\r\nelif (l % 2 != 0) and (r > l+2):\r\n print(l+1, l+2, l+3)\r\nelse:\r\n if gcd(l+2,l) != 1:\r\n print(l,l+1,l+2)\r\n else:\r\n print(-1)", "a, b = input().rstrip().split()\r\n#print(a, b)\r\na = int(a)\r\nb = int(b)\r\nif b - a < 2:\r\n print(-1)\r\nelif b - a == 2 and a % 2 == 1:\r\n print(-1)\r\nelif a % 2 == 1:\r\n print(a + 1, a + 2, a + 3)\r\nelse:\r\n print(a, a + 1, a + 2)\r\n", "l,r=input().split()\r\nl,r=int(l),int(r)\r\nif (r-l<=1) or (r-l==2 and r%2==1):\r\n print(-1)\r\nelse:\r\n if l%2==0:\r\n print(l,end=' ')\r\n print(l+1,end=' ')\r\n print(l+2,end=' ')\r\n else:\r\n print(l+1,end=' ')\r\n print(l+2,end=' ')\r\n print(l+3,end=' ')\r\n", "a,b=input().split()\r\nk=int(a)\r\ni=int(b)\r\nif k%2!=0:\r\n k+=1\r\nif k+2>i:\r\n print(-1)\r\nelse: \r\n print(k,k+1,k+2)", "left, right = map(int,input().split())\r\ndistance = right - left + 1\r\nif distance > 3:\r\n if left % 2 == 0:\r\n print(left,left+1,left+2)\r\n else:\r\n print(left+1,left+2,left+3)\r\nelif distance == 3:\r\n if left % 2 == 0:\r\n print(left,left+1,left+2)\r\n else:\r\n print(-1)\r\nelse:\r\n print(-1)", "import math\nl,r = map(int,input().split())\n\ndef isCoprime(a,b):\n return math.gcd(a,b) == 1\n\nfor i in range(l,r+1):\n for j in range(i,r+1):\n for k in range(j,r+1):\n if isCoprime(i,j) and isCoprime(j,k) and (not isCoprime(i,k)):\n print(i,j,k)\n exit()\nprint(-1)\n", "n,l=list(map(int,input().split()))\r\nif n%2!=0:n+=1\r\nif l-n<2:\r\n print(-1)\r\nelse:print(n,n+1,n+2)", "def solve(l,r):\n\tfrom math import gcd\n\n\tfor i in range(l,r+1) :\n\t\tfor j in range(i,r+1):\n\t\t\tfor k in range(j,r+1):\n\t\t\t\tif gcd(i,j)==1 and gcd(j,k)==1 and gcd(k,i)!=1 :\n\t\t\t\t\treturn f'{i} {j} {k}'\n\treturn -1\n\n\t\n\t\n\n\t\t\n\n\t\n\n\nl3 = input()\nl3=[int(x) for x in l3.split()]\n\t\n\n\n\n\nprint(solve(l3[0],l3[1]))\n", "n,m=input().split(' ')\r\nn=int(n)\r\nm=int(m)\r\nt=-1\r\nk=False\r\nfor i in range(n,m-1,1):\r\n if((i%2==0) and ((i+2)%2==0)):\r\n k=True\r\n t=i\r\n break;\r\nif k:\r\n print(\"{0} {1} {2}\".format(t,t+1,t+2))\r\nelse:\r\n print(-1)\r\n ", "from math import gcd\r\n\r\nl, r = map(int, input().split())\r\nflg = 0\r\nfor a in range(l, r):\r\n for b in range(a+1, r+1):\r\n for c in range(a+1, b):\r\n if gcd(a,c)==1 and gcd(b,c)==1:\r\n if gcd(a,b)>1:\r\n flg = 1\r\n print(a,c,b)\r\n exit()\r\nprint(-1)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue May 23 13:48:53 2023\r\n\r\n@author: asad\r\n\"\"\"\r\ninput_str = input()\r\nnum1, num2 = input_str.split()\r\n\r\nnum1 = int(num1)\r\nnum2 = int(num2)\r\nif num2 - num1 < 2 :\r\n print(-1)\r\nelif num1 % 2 != 0 and num2 % 2 != 0 and num2 - num1 == 2:\r\n print(-1)\r\nelse:\r\n if num1 % 2 == 0:\r\n print(num1 ,num1+1 ,num1+2)\r\n else:\r\n print(num1+1 ,num1+2 ,num1+3)\r\n", "import math,sys\nfrom collections import Counter, defaultdict, deque\nfrom sys import stdin, stdout\ninput = stdin.readline\nli = lambda:list(map(int,input().split()))\n\ndef case():\n l,r=li()\n if(r-l<=1 and l%2==0):\n print(-1)\n elif(r-l<=2 and l%2!=0):\n print(-1)\n else:\n if(l%2==0):\n print(l,l+1,l+2)\n else:\n l+=1\n print(l,l+1,l+2)\n\nfor _ in range(1):\n case()", "from math import gcd\r\nl,r=map(int,input().split())\r\nf=0\r\nif(r-l>1):\r\n for i in range(l,r-1):\r\n for j in range(l+1,r):\r\n for k in range(l+2,r+1):\r\n if(gcd(i,j)==1 and gcd(j,k)==1 and gcd(i,k)!=1):\r\n print(i,j,k)\r\n f=1\r\n break\r\n if(f==1):\r\n break\r\n if(f==1):\r\n break\r\n if(f==0):\r\n print(-1)\r\nelse:\r\n print(-1)", "x,z=list(map(int,input().split()))\r\nl=[]\r\n\r\nif x%2==0:\r\n\r\n for i in range(x,z+1):\r\n l.append(i)\r\nelse:\r\n for i in range(x+1,z+1):\r\n\r\n l.append(i)\r\nif len(l) <= 2:\r\n print(-1)\r\nelse:\r\n print(*l[0:3])\r\n\r\n\r\n\r\n\r\n\r\n", "'''input\n900000000000000009 900000000000000029\n'''\nl, r = map(int, input().split())\nif l % 2 == 0:\n\tif r - l >= 2:\n\t\tprint(l, l+1, l+2)\n\telse:\n\t\tprint(-1)\nelse:\n\tif r - l >= 3:\n\t\tprint(l+1, l+2, l+3)\n\telse:\n\t\tprint(-1)", "from math import gcd\r\nl,r = list(map(int,input().split()))\r\nif r-l==1:\r\n print(-1)\r\nelse:\r\n x = l\r\n while True:\r\n if x+2>r:\r\n break\r\n a = x\r\n b = x+1\r\n c = x+2\r\n if gcd(a,b)==1 and gcd(b,c)==1 and gcd(a,c)!=1:\r\n print(a,b,c)\r\n exit()\r\n x+=1\r\n print(-1)", "import math\n\nl, r = map(int, input().split())\nif r - l <= 1:\n print(-1)\n exit()\n\nfor a in range(l, r - 1):\n for b in range(a, r):\n for c in range(b, r + 1):\n gcd_ab = math.gcd(a, b)\n gcd_bc = math.gcd(b, c)\n gcd_ac = math.gcd(a, c)\n if gcd_ab == 1 and gcd_bc == 1 and gcd_ac != 1:\n print(\"{} {} {}\".format(a, b, c))\n exit()\nprint(-1)\n", "import math\r\nl,r=[int(i) for i in input().split()]\r\nfor a in range(l,r+1):\r\n for b in range(a,r+1):\r\n for c in range(b,r+1):\r\n if math.gcd(a,b)==1 and math.gcd(b,c)==1 and math.gcd(a,c)!=1:\r\n print(a,b,c)\r\n exit()\r\nprint(-1)", "def solve():\r\n l, r = [int(i) for i in input().split()]\r\n if r - l + 1 <= 2:\r\n return -1\r\n elif l % 2 == 0:\r\n return \" \".join((str(l), str(l+1), str(l+2)))\r\n elif r - l + 1 == 3:\r\n return -1\r\n else:\r\n return \" \".join((str(l+1), str(l+2), str(l+3)))\r\nprint(solve())", "l,r=map(int,input().split());q=int(l&1)\r\nif r-l<2or(r-l==2and l&1):print(-1)\r\nelse:print(*[l+q,l+q+1,l+q+2])", "import math\r\n\r\n\r\ninp=input().split()\r\nl=int(inp[0])\r\nr=int(inp[1])\r\n\r\n\r\ni=l\r\nwhile i<r-1:\r\n j=i+1\r\n while j<r:\r\n if math.gcd(i,j) == 1:\r\n k=j+1\r\n while k<=r:\r\n if math.gcd(j,k) == 1 and math.gcd(i,k)!=1:\r\n print(i,\" \",j,\" \",k)\r\n exit(0)\r\n k+=1\r\n j+=1\r\n i+=1\r\n\r\nprint(-1)\r\n", "import sys\r\n\r\nI=sys.stdin.readline\r\n\r\n\r\nl,r=map(int,I().split())\r\n\r\nif l%2!=0:\r\n\tl+=1\r\n\r\nif l+2>r:\r\n\tprint(-1)\r\nelse:\r\n\tprint(l,l+1,l+2)", "def gcd(p,q):\r\n\r\n while q != 0:\r\n p, q = q, p%q\r\n return p\r\n\r\n\r\nli = list(map(int,input().split()))\r\n\r\nl = li[0]\r\nr = li[1]\r\nc = False\r\nfor i in range(l,r+1):\r\n for j in range(i+1,r+1):\r\n for k in range(max(i,j)+1,r+1):\r\n\r\n #print(f\"{i}\",end=\" \")\r\n #print(f\"{j}\",end=\" \")\r\n #print(f\"{k}\")\r\n \r\n\r\n\r\n if gcd(i,j)==1 and gcd(j,k)==1 and gcd(i,k)!=1:\r\n \r\n print(f\"{i}\",end=\" \")\r\n print(f\"{j}\",end=\" \")\r\n print(f\"{k}\")\r\n c = True\r\n break\r\n\r\n\r\n if c:\r\n break\r\n\r\n\r\n if c:\r\n break\r\n\r\n\r\nif c:\r\n pass\r\nelse:\r\n print(-1)\r\n \r\n\r\n \r\n", "from math import gcd\r\nl , r = map(int , input().split())\r\nx , y , z , ok = -1 , -1 , -1 , 0\r\nfor i in range(l , r - 1):\r\n for j in range(i + 1 , r):\r\n for k in range(j + 1 , r + 1):\r\n if gcd(i , j) == 1 and gcd(j , k) == 1 and gcd(i , k) != 1:\r\n ok += 1\r\n x = i\r\n y = j\r\n z = k\r\n break\r\nif ok > 0:\r\n print(x , y , z)\r\nelse:\r\n print(-1)\r\n", "from sys import exit\nl, r = map(int, input().split())\nif (r-l <= 1):\n print(\"-1\")\n exit(0)\nelse: \n if (l % 2 != 0):\n l += 1\n if (r-l <=1):\n print(-1)\n exit(0)\n print(l, l+1, l+2)\n", "x = list(map(int, input().split()))\r\nif x[1] - x[0] < 2:\r\n print(-1)\r\nelif x[0] % 2 == 0:\r\n print(x[0], x[0]+1, x[0]+2)\r\nelif x[0] % 2 != 0 and x[0]+3 <= x[1]:\r\n print(x[0]+1,x[0]+2,x[0]+3)\r\nelse:\r\n print(-1)", "l,r=[int(x) for x in input().split()]\r\ndef hcf(x,y):\r\n while y!=0:\r\n x,y=y,x%y\r\n return x \r\nfor i in range(l,r-1):\r\n if hcf(i,i+1)==1 and hcf(i+1,i+2)==1:\r\n if hcf(i,i+2)!=1:\r\n print(i,i+1,i+2)\r\n exit()\r\nprint(-1)\r\n\r\n", "l,r=map(int,input().split())\r\nif(l%2==0):\r\n a=l\r\n b=l+1\r\n c=l+2\r\nelse:\r\n a=l+1\r\n b=l+2\r\n c=l+3\r\nif(c>r):\r\n print(-1)\r\nelse:\r\n print(str(a)+\" \"+str(b)+\" \"+str(c))", "import math\r\n\r\n\r\nd = [3, 5, 7, 11, 13, 17, 19, 23]\r\n\r\nn, m = input().split()\r\n\r\nn = int(n)\r\nm = int(m)\r\n\r\nif (m-n<2):\r\n print(-1)\r\n\r\nelse:\r\n if(n%2==0):\r\n print(n, \" \", n+1, \" \", n+2)\r\n elif(m-n>2):\r\n print(n+1, \" \", n+2, \" \", n+3)\r\n else:\r\n f = 0\r\n for i in d:\r\n if (n%i==0 and n+2*i<=m):\r\n f = 1\r\n print(n, \" \", n+1, \" \", n+2*i)\r\n if(~f):\r\n print(-1)\r\n \r\n\r\n\r\n\r\n", "import sys\r\n# from math import ceil,log,gcd,sqrt\r\n# sys.setrecursionlimit(10**9)\r\n\r\nRI = lambda : [int(x) for x in sys.stdin.readline().split()]\r\nri = lambda : sys.stdin.readline().strip()\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\ndef list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]\r\ndef ceil(x, y=1): return int(-(-x // y))\r\ndef INT(): return int(input())\r\ndef MAP(): return map(int, input().split())\r\ndef LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]\r\ndef Yes(): print('Yes')\r\ndef No(): print('No')\r\ndef YES(): print('Yes')\r\ndef NO(): print('No')\r\nINF = 10 ** 18\r\nMOD = 10 ** 9 + 7\r\n\r\n\r\n# ans = []\r\n\r\nl,r = RI()\r\nif r - l +1 < 3:\r\n print(-1)\r\nelif (r-l+1) == 3:\r\n if l %2 ==1:\r\n print(-1)\r\n else:\r\n print(l,l+1,l+2)\r\nelse:\r\n if l %2 == 0:\r\n print(l,l+1,l+2)\r\n else:\r\n print(l+1,l+2,l+3)", "from math import gcd\r\na, b = map(int, input().split())\r\n\r\nfound = False\r\nfor i in range(a, b+1):\r\n if found: break\r\n for j in range(a+1, b+1):\r\n if found: break\r\n for k in range(a+2, b+1):\r\n if gcd(i, j) == 1 and gcd(j, k) == 1 and gcd(i, k) != 1:\r\n found = True\r\n a, b, c = i, j, k\r\n break\r\n\r\n\r\n\r\n\r\nif found and a < b < c:\r\n print(a, b, c)\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "\r\nfrom fractions import gcd\r\n# r - l ≤ 50 so brute force\r\ns = input().split()\r\nl = int(s[0])\r\nr = int(s[1])\r\na = 0\r\nb = 0\r\nc = 0\r\nfound = False\r\nfor i in range(l,r):\r\n for j in range(i+1,r):\r\n for k in range(j+1,r+1):\r\n if gcd(i,j) == 1 and gcd(j,k) == 1 and gcd(i,k) != 1:\r\n a = i\r\n b = j\r\n c = k\r\n found = True\r\n break\r\n if found:\r\n break\r\n if found :\r\n break\r\nif found:\r\n print(str(a)+\" \"+str(b)+\" \"+str(c))\r\nelse:\r\n print(-1)", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\na,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nif abs(a-b)<2:\r\n print(-1)\r\nelse:\r\n if (abs(a-b)>=3):\r\n if a&1 :\r\n print(a+1,a+2,a+3)\r\n else:\r\n print(a,a+1,a+2)\r\n else:\r\n if gcd(a,b)>1:\r\n print(a,a+1,b)\r\n else:\r\n print(-1)\r\n \r\n", "l, r = list(map(int,input().split()))\r\n\r\nif l % 2 is not 0:\r\n\tl+=1\r\nif l + 2 > r :\r\n\tprint(-1)\r\nelse:\r\n\tprint(l,l+1,l+2)\r\n", "\nif __name__ == '__main__':\n a, b = [int(x) for x in input().split()]\n if b - a < 2:\n print(-1)\n elif b-a == 2 and a % 2 == 1:\n print(-1)\n else:\n if a % 2 == 1:\n a += 1\n print(f\"{a} {a + 1} {a + 2}\")\n", "\"\"\"609C\"\"\"\r\n# import math\r\ndef gcd(a,b):\r\n\tif a==0:\r\n\t\treturn b\r\n\telse:\r\n\t\treturn gcd(b%a,a)\r\ndef main():\r\n\tl,r = map(int,input().split())\r\n\tfor i in range(l,r-1):\r\n\t\tif gcd(i,i+1)==1 and gcd(i+1,i+2)==1 and gcd(i,i+2)!=1:\r\n\t\t\tprint(i,i+1,i+2)\r\n\t\t\treturn\r\n\tprint(-1)\r\n\t# print(\"NO\")\r\n\treturn\r\nmain()\r\n# t= int(input())\r\n# while t:\r\n# \tmain()\r\n# \tt-=1\r\n\r\n\r\n\r\n\r\n# Octahedron. Octahedron has 8 triangular faces.\r\n# Dodecahedron. Dodecahedron has 12 pentagonal faces.\r\n# Icosahedron", "from math import gcd\r\nll,r=map(int,input().split())\r\nf=0\r\nwhile ll<r:\r\n for i in range(ll+2,r+1):\r\n if gcd(ll,i)>1 and gcd(ll+1,i)==1:\r\n f=i; break\r\n if f: break\r\n ll+=1\r\nif f: print(ll,ll+1,f)\r\nelse: print(-1)", "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\nlr = input().split(' ')\r\nl = int(lr[0])\r\nr = int(lr[1])\r\n\r\nfor j in range(l,r):\r\n a = j\r\n c = -1\r\n for i in range(r,l,-1):\r\n if gcd(a,i) != 1:\r\n c = i\r\n for k in range(a+1,c):\r\n if gcd(a,k) == 1 and gcd(k,c) == 1:\r\n b = k\r\n print(a,b,c)\r\n exit()\r\n\r\nprint(-1)", "from math import gcd\r\n\r\nl, r = map(int, input().split())\r\nflag = 0\r\nfor a in range(l, r-1):\r\n for b in range(a+1, r):\r\n for c in range(b+1, r+1):\r\n if(gcd(a, b)*gcd(b, c)==1 and gcd(a, c)>1):\r\n print(a, b, c)\r\n flag = 1\r\n if(flag):\r\n break\r\n if(flag):\r\n break\r\n if(flag):\r\n break\r\nif(not flag):\r\n print(-1)", "from math import gcd\r\nl, r = map(int, input().split())\r\nf = 0\r\nfor a in range(l, r-1):\r\n for b in range(a+1, r):\r\n for c in range(b+1, r+1):\r\n if gcd(a, b) == 1 and gcd(b, c) == 1 and gcd(a, c) != 1:\r\n f = 1\r\n break\r\n if f == 1:\r\n break\r\n if f == 1:\r\n break\r\nif f == 1:\r\n print(a, b, c)\r\nelse:\r\n print(-1)\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___ \r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\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\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n'''\r\n'''\r\ndef gcd(a, b):\r\n if a > b:\r\n a,b = b,a\r\n if a == 0:\r\n return b\r\n return gcd(b%a, a)\r\n\r\ndef solve():\r\n l, r = MII()\r\n for a in range(l, r-1):\r\n for b in range(a+1, r):\r\n for c in range(b+1, r+1):\r\n if gcd(a,b)==1 and gcd(b,c)==1 and gcd(a,c)!=1:\r\n print(a,b,c)\r\n return\r\n print(-1)\r\n\r\n\r\nsolve()\r\n", "def solve():\r\n l,r=list(map(int,input().split(\" \")))\r\n if r-l+1<3:\r\n print(-1)\r\n return \r\n if l%2==1 and r-l+1<4:\r\n print(-1)\r\n return \r\n\r\n if l%2==0:\r\n print(l,l+1,l+2)\r\n else:\r\n print(l+1,l+2,l+3)\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \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 _ in range(int(input())):\r\nsolve();", "l,r=map(int,input().split())\r\nif l&1==1: l+=1\r\nif l+2>r: print(-1)\r\nelse: print(l, l+1, l+2)\r\n\r\n", "def gcd(p,q):\r\n# Create the gcd of two positive integers.\r\n while q != 0:\r\n p, q = q, p%q\r\n return p\r\ndef is_coprime(x, y):\r\n return gcd(x, y) == 1\r\n\r\nl, r = [int(i) for i in input().split()]\r\n\r\nif r-l < 2:\r\n print(-1)\r\nelse:\r\n if l%2 ==0:\r\n print(l,l+1,l+2)\r\n else:\r\n if l+3 <= r:\r\n print(l+1,l+2,l+3)\r\n else:\r\n if(is_coprime(l,l+2)):\r\n print(-1)\r\n else:\r\n print(l,l+1,l+2)", "x = input().split(' ')\r\nx = [int(i) for i in x]\r\nn = x[0]\r\nm = x[1]\r\nif m-n <= 1:\r\n print(-1)\r\nelse:\r\n if n % 2 == 0:\r\n print(f'{n} {n+1} {n+2}')\r\n else:\r\n n += 1\r\n if m-n <= 1:\r\n print(-1)\r\n else:\r\n print(f'{n} {n+1} {n+2}')\r\n", "left, right = map(int, input().split())\r\nif left % 2:\r\n left += 1\r\nif left + 2 > right:\r\n print(-1)\r\nelse:\r\n print(left, left + 1, left + 2)\r\n", "from sys import stdin, stdout\r\n#from bisect import bisect_left, bisect_right\r\n#from collections import Counter, deque\r\n#from queue import Queue\r\n#import heapq\r\nimport math\r\n#from itertools import permutations, combinations, islice\r\n\r\ndef solve():\r\n l,r = map(int, input().split())\r\n if l%2:\r\n l += 1\r\n if l+2 > r:\r\n return f\"-1\"\r\n else:\r\n return f\"{l} {l+1} {l+2}\"\r\n\r\nstdout.write(solve())", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\nfrom math import ceil, floor, gcd\r\n\r\n# input = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\nl, r = read()\r\nif r - l <= 1:\r\n exit(print(-1))\r\nfor i in range(l, r - 1):\r\n for j in range(l + 1, r):\r\n if gcd(i, j) == 1:\r\n for k in range(j + 1, r + 1):\r\n if gcd(j, k) == 1 and gcd(i, k) > 1:\r\n exit(print(i, j, k))\r\nprint(-1)\r\n", "'''\r\nCreated on Oct 24, 2014\r\n\r\n@author: Ismael\r\n'''\r\nl,r = map(int,input().split())\r\nif(r-l<2 or (r-l==2 and l%2==1)):\r\n print(-1)\r\nelse:\r\n if(l%2==0):\r\n print(l,l+1,l+2)\r\n else:\r\n print(l+1,l+2,l+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\nl, r = map(int, input().split())\r\nfor k in range(l, r-1):\r\n for i in range(k+2, r+1):\r\n if gcd(k+1, i) == 1 and gcd(k, i) != 1:\r\n print(k, k+1, i)\r\n exit()\r\nprint(-1)", "r, l = map(int, input().split())\r\n# test = False\r\nnum_range = l-r+1\r\n# print(num_range)\r\nif num_range <3:\r\n print(-1)\r\nelif num_range >3:\r\n print(r+(r%2), r+1+(r%2), r+2+(r%2))\r\nelif r%2:\r\n print(-1)\r\nelse:\r\n print(r, r+1, r+2)\r\n \r\n \r\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\nx,y = map(int,stdin.readline().split())\r\n\r\np=0\r\nfor i in range(x,y):\r\n\tif i%2==0 and i+2<=y:\r\n\t\tprint(str(i)+\" \"+str(i+1)+\" \"+str(i+2))\r\n\t\tp=1\r\n\t\tbreak\r\nif p==0:\r\n\tprint(-1)", "l, r = map(int, input().split())\nif(l%2!=0):\n l+=1\nif(abs(l-r)<2):\n print(-1)\nelse:\n print(l, l+1, l+2)", "from sys import stdin,stdout\r\n#input = stdin.readline\r\n\r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n for z in range(t):\r\n #n = int(input())\r\n #a,b,c = map(int,input().split())\r\n #ai = list(map(int,input().split()))\r\n l,r = map(int,input().split())\r\n if l % 2 == 1 and r-l == 2:\r\n print(-1)\r\n break\r\n if r - l < 2:\r\n print(-1)\r\n break\r\n print(l+l%2,l+l%2+1,l+l%2+2)\r\nmain()\r\n", "from fractions import gcd\r\n\r\nl,r=[int(x) for x in input().split()]\r\nbye=False\r\nfor a in range(l,r-1):\r\n for c in range(a+2,r+1):\r\n for b in range(a+1,c):\r\n if (gcd(a,b)==1 and gcd(b,c)==1 and gcd(a,c)!=1):\r\n for x in [a,b,c]:print(x,end=' ')\r\n bye=True\r\n break\r\n if bye:\r\n break\r\n if bye:\r\n break\r\n if bye:\r\n break\r\nif not bye:\r\n print(-1)\r\n\r\n", "import sys\na,b=map(int, input().split())\nif b-a<=1:\n print(-1)\n sys.exit()\nif b-a==2 and a%2==1:\n print(-1)\n sys.exit()\nif a%2==0:\n print(a,end=' ')\n print(a+1,end=' ')\n print(a+2)\nelse:\n print(a+1,end=' ')\n print(a+2,end=' ')\n print(a+3)", "import math\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n for i in range(n, m + 1):\r\n for j in range(i + 1, m + 1):\r\n for k in range(j + 1, m + 1):\r\n if math.gcd(i, j) == 1 and math.gcd(j, k) == 1 and math.gcd(i, k) != 1:\r\n print(i, j, k)\r\n return\r\n\r\n print(-1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l, r = map(int, input().split())\r\nif l+2 <= r and l % 2 == 0:\r\n print(l, l + 1, l + 2)\r\nelif l+3 <= r:\r\n print(l+1, l+2, l+3)\r\nelse:\r\n print(-1)\r\n", "from fractions import gcd\r\nl , r = map(int, input().split())\r\nres = []\r\nfor i in range(l, r+1):\r\n res.clear()\r\n res.append(i)\r\n a = i\r\n for j in range(i+1, r+1):\r\n \r\n if gcd(a,j) == 1:\r\n res.append(j)\r\n a = j\r\n if len(res) == 3 and gcd(res[0], res[2]) > 1:\r\n print(\" \".join(map(str, res)))\r\n exit(0)\r\nprint(-1)\r\n ", "l,m=map(int,input().split())\r\nif(l%2):\r\n l=l+1\r\nif(l+2>m):\r\n print(\"-1\")\r\nelse:\r\n print(l,l+1,l+2)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nx,y = map(int, input().split())\r\nif y-x<2:\r\n\tprint(-1)\r\nelif x%2 != 0 and y-x==2:\r\n\tprint(-1)\r\nelif x%2==0:\r\n\tprint(x, x+1, x+2)\r\nelse:\r\n\tprint(x+1, x+2, x+3)", "l,r=map(int,input().split())\r\nif((r+1-l)<3):\r\n print(-1)\r\nelse:\r\n if(l%2==0):\r\n print(l,end=\" \")\r\n print(l+1,end=\" \")\r\n print(l+2)\r\n else:\r\n if((r-l+1)>3):\r\n print(l+1,end=\" \")\r\n print(l+2,end=\" \")\r\n print(l+3)\r\n else:\r\n print(-1)\r\n", "def Gcd(x,y):\n\twhile y:\n\t\tz = y\n\t\ty = x % y\n\t\tx = z\n\treturn z\n\ndef solve(ll,rr):\n\tfor i in range(ll,rr-1):\n\t\tfor j in range(i+1,rr):\n\t\t\tfor k in range(j+1,rr+1):\n\t\t\t\tif(Gcd(i,j) == 1 and Gcd(j,k) == 1 and Gcd(i,k) > 1):\n\t\t\t\t\tprint (i,j,k)\n\t\t\t\t\treturn 1\n\treturn -1\n\ns = input()\na = s.split()\n\nl = int(a[0])\nr = int(a[1])\n\nok = solve(l,r)\nif ok == -1:\n\tprint (-1)\n", "l, r = [int(y) for y in input().split()]\r\nif r%2!=0:r-=1\r\nif r-2<=1 or r-2<l:print(-1)\r\nelse:print(r-2,r-1,r)", "a, b = map(int, input().split());\r\nif a & 1 == 1 :\r\n a += 1;\r\nif a + 2 > b :\r\n print(-1);\r\nelse : \r\n print(a, a+1, a+2);\r\nexit(0);\r\n", "import math\r\n\r\n\r\n# aa = list(map(int, input().split()))\r\n\r\ndef input1(string):\r\n while 1:\r\n try:\r\n return int(input(\"\\t\" + string))\r\n except Exception:\r\n continue\r\n\r\n\r\nx, y = list(map(int, input().split()))\r\nif x % 2 != 0:\r\n x = x + 1\r\nif x + 2 > y:\r\n print(-1)\r\n exit()\r\nprint(x.__str__()+\" \"+ (x + 1).__str__()+\" \"+ (x + 2).__str__())\r\n", "import math\r\ndef solve():\r\n for i in range(l,r+1):\r\n for j in range(i+1,r+1):\r\n if math.gcd(i,j)==1:\r\n for k in range(j+1,r+1):\r\n if math.gcd(j,k)==1 and math.gcd(i,k)!=1:\r\n print(i,j,k)\r\n return\r\n else:\r\n print(-1)\r\nl,r=map(int,input().split())\r\na,b,c=l,l,l\r\nsolve()", "a=list(map(int, input().split()))\r\nl,r=a[0],a[1]\r\nif r-l<2:\r\n print(-1)\r\nelif r-l==2 and l%2!=0:\r\n print(-1)\r\nelse:\r\n if l%2==0:\r\n print(str(l),str(l+1),str(l+2))\r\n else:\r\n print(str(l+1),str(l+2),str(l+3))\r\n", "def gcd(a, b):\r\n while b > 0:\r\n a, b = b, a % b\r\n return a\r\nl, r = map(int, input().split())\r\nfor i in range(l, r + 1):\r\n for j in range(i + 1, r + 1):\r\n for k in range(j + 1, r + 1):\r\n if gcd(i, j) == 1 and gcd(j, k) == 1 and gcd(i, k) != 1:\r\n print (i, j, k)\r\n exit()\r\nprint (-1)", "(l,r) = [ int(i) for i in input(\"\").split(' ') ];\n\nif l+1 == r:\n print('-1');\nelse:\n from fractions import gcd;\n gcd_ = int();\n for i in range(l,r-1):\n gcd_ = (gcd(i,i+1)==1)*4 + (gcd(i+1,i+2)==1)*2 + (gcd(i+2,i)==1)*1;\n\n if gcd_ in [3,5,6]:\n print(i, i+1, i+2);\n exit(0);\n\n print('-1');\n", "l,r=map(int,input().strip().split(' '))\nran=r-l+1\nif ran<3 or (l%2==1 and ran<4):\n print(\"-1\")\nelse:\n if l%2==0:\n print( l, l + 1, l + 2)\n else:\n print( l + 1, l + 2, l + 3)", "import math\r\n\r\nl, r = [int(x)for x in input().split(' ')]\r\n\r\nif r - l < 2:\r\n print (-1)\r\n quit()\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\nfor a in range(l, r + 1):\r\n for b in range(a + 1, r + 1):\r\n for c in range(b + 1, r + 1):\r\n if gcd(a, c) != 1 and gcd(b, c) == 1:\r\n print (a, b, c)\r\n quit()\r\n\r\nprint (-1)\r\n", "a,b=map(int, input().split())\r\nif a%2: a+=1\r\nif a+2>b:print(-1)\r\nelse: print(a, a+1, a+2)", "n = input().split()\r\nl, r = int(n[0]), int(n[1])\r\n\r\nif l % 2 == 1:\r\n l += 1\r\n\r\nif l + 2 > r:\r\n print(str(-1))\r\nelse:\r\n print(str(l)+\" \"+str(l+1)+\" \"+str(l+2))\r\n\r\n", "l,r=list(map(int,input().split()))\r\ndef coprime(x, y):\r\n while(y!=0): \r\n x, y = y, x % y\r\n return x==1\r\ndef sol(l,r):\r\n a,b,res,c=0,0,0,0\r\n for k in range(l,r):\r\n for j in range(k+1,r+1):\r\n for i in range(k,j+1):\r\n if coprime(k,i) and coprime(i,j) and coprime(k,j)!=True:\r\n res=1\r\n a=i\r\n b=j\r\n c=k\r\n break\r\n if res:\r\n break\r\n if res:\r\n break\r\n if res:\r\n print(c,a,b)\r\n else:\r\n print(\"-1\")\r\nif r-l<=1:\r\n sol(r,l)\r\nelse:\r\n sol(l,r)", "l, r = map(int, input().split())\nfound = False\n\nif l % 2 and r - l > 2:\n found = True\n a, b, c = l+1, l+2, l+3\nelif not l % 2 and r - l > 1:\n found = True\n a, b, c = l, l+1, l+2\n\nif found:\n print(a, b, c)\nelse:\n print(-1)", "x, y = [int(i) for i in input().split()]\r\nif y - (x + (x%2)) > 1:\r\n print(x+x%2, x+x%2+1, x+x%2+2)\r\nelse:\r\n print(-1)\r\n", "l , r = map(int,input().split())\r\n\r\nif l % 2 != 0 :\r\n l += 1\r\n\r\nif (abs(l-r) < 2) :\r\n print(-1)\r\n\r\nelse:\r\n print (l , l +1 , l+2)\r\n\r\n\r\n\r\n", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nfrom math import gcd \r\nl,r=map(int,input().split())\r\nx=l\r\nwhile x+2<=r and gcd(x,x+2)==1:\r\n\tx+=1\r\nif x+2<=r:\r\n\tprint(x,x+1,x+2)\r\nelse:\r\n\tprint(-1)", "from math import ceil\nimport sys\ninput = sys.stdin.readline\n\nline = input().rstrip().split(' ')\n\nl = int(line[0])\n\nr = int(line[1])\n\ndef gcd(a, b):\n if b == 0:\n return a\n else:\n return gcd(b, a % b)\n\nfoundCounterExample = False\n\ncounterExamples = [None] * 3\n\nfor a in range(l, r + 1):\n for b in range(a + 1, r + 1):\n if gcd(a, b) != 1:\n continue\n else:\n for c in range(l, r + 1):\n if gcd(b, c) == 1 and c != a:\n if gcd(a, c) != 1:\n foundCounterExample = True\n counterExamples[0] = a\n counterExamples[1] = b\n counterExamples[2] = c\n break\n if foundCounterExample:\n break\n if foundCounterExample:\n break\n\nif foundCounterExample:\n print(counterExamples[0], counterExamples[1], counterExamples[2], end='')\nelse:\n print(-1, end='')\n ", "a, b = map(int, input().split())\r\nif a%2 == 1:\r\n a+=1\r\nif b-a<2:\r\n print(-1) \r\nelse:\r\n print (a , a+1, a+2) ", "n,m=map(int, input().split())\r\nif n%2 != 0:\r\n n+=1\r\nif abs(n-m)>=2:\r\n print(n,n+1,n+2)\r\nelse:\r\n print(-1)", "l,r = map(int,input().split())\r\ndef gcd(x,y):\r\n while y!= 0:\r\n (x,y) = (y,x%y)\r\n return x\r\n\r\nfor a in range(l,r+1):\r\n for b in range(a+1,r+1):\r\n for c in range(b+1,r+1):\r\n if (gcd(a,b) ==1 and gcd(b,c) ==1 and gcd(a,c) !=1 ):\r\n print(a,b,c)\r\n exit()\r\n \r\nprint(-1)", "a, b = map(int, input().split())\r\nif a%2==1:\r\n a+=1\r\nif b-a<2:\r\n print(-1)\r\nelse:\r\n print(a, a+1, a+2)", "x, z= map(int, input().split())\r\na=0\r\nb=0\r\nc=0\r\nif z-x<=1:\r\n print (-1)\r\n exit()\r\nfor i in range(x, z+1):\r\n if a==0:\r\n for j in range(x,z+1):\r\n if j%2==0:\r\n a=j\r\n break\r\n else:\r\n b=a+1\r\n \r\n c=b+1\r\n break\r\nif a==0 or b==0 or c==0 :\r\n print(-1)\r\nelif b>=z or c>z:\r\n print(-1)\r\nelse : print(a, b, c)", "l, r = [int(i) for i in input().split()]\r\n\r\nif r-l < 2:\r\n print(-1)\r\nelse:\r\n if l%2 ==0:\r\n print(l,l+1,l+2)\r\n else:\r\n if l+3 <= r:\r\n print(l+1,l+2,l+3)\r\n else:\r\n print(-1)", "l,r = [int(x) for x in input().split()]\r\nfrom math import gcd\r\nfor i in range(l,r+1):\r\n\tfor j in range(i+1,r+1):\r\n\t\tfor k in range(j+1,r+1):\r\n\t\t\tif gcd(i,j) == 1 and gcd(j,k)==1 and gcd(i,k)!=1:\r\n\t\t\t\tprint(i,j,k)\r\n\t\t\t\texit()\r\nprint(-1)", "def gcd(a, b):\r\n rem = 0\r\n while b != 0:\r\n rem = a%b\r\n a = b\r\n b = rem\r\n return a\r\n\r\n\r\na, b = map(int, input().split())\r\nif b-a == 1:\r\n print (-1)\r\nelse: \r\n found = False\r\n for i in range(a, b+1):\r\n for j in range(i+1, b+1):\r\n for k in range(j+1, b+1):\r\n if gcd(i, j) == 1 and gcd(j, k) == 1 and gcd(i, k) != 1:\r\n found = True\r\n print (i, j, k)\r\n break\r\n if found:\r\n break\r\n if found:\r\n break\r\n if not found:\r\n print (-1)", " \r\ns=input().split()\r\nl=int(s[0])\r\nr=int(s[1])\r\n\r\nwhile(l%2!=0):\r\n l+=1; \r\n\r\nif(r-l>=2):\r\n print(str(l)+\" \"+str(l+1)+\" \"+str(l+2))\r\nelse:\r\n print(-1)", "a, c = map(int, input().split(\" \"))\n\nif a & 1 == 0:\n if a+1 >= c:\n print(-1)\n else:\n print(a, a+1, a+2)\nelse:\n if a+2 >= c:\n print(-1)\n else:\n print(a+1, a+2, a+3)\n", "l,r = [int(x) for x in input().split()]\r\nif l==r or l+1==r:\r\n print(-1)\r\nelif l%2==0:\r\n print(l,l+1,l+2)\r\nelif l%2!=0 and r-l+1>3:\r\n print(l+1,l+2,l+3)\r\nelse:\r\n print(-1)", "\nfrom fractions import gcd\n\n#class DataBubble(Exception):\n\t#def __init__(self, arg):\n\t\t#self.arg = arg\n\t#def __str__(self):\n\t\t#a = self.arg\n\t\t#return str(self.arg)\n\t\n\n#def out(*args):\n\t#raise DataBubble(args)\n\n#def catch(func):\n\t#def f(*args):\n\t\t#try:\n\t\t\t#func(*args)\n\t\t#except DataBubble as e:\n\t\t\t#print(e)\n\t\t#else:\n\t\t\t#print(\"ERROR!!!\", l, r)\n\t\t\t\n\t#return f\n\n\ngiven = (int(x) for x in input().split(' '))\n#given = (2,4)\n\nl, r = given\n\ndef simple(a, b):\n\tif gcd(a,b) == 1:\n\t\treturn True\n\telse:\n\t\treturn False\n\t\ndef search(down, up):\n\td1 = down + 1\n\tfor x in range(down+2, up+1):\n\t\t#print(down, d1, x)\n\t\tif simple(d1, x) and not simple(down, x):\n\t\t\treturn (down, d1, x)\n\t\t\t\n\telse:\n\t\treturn False\n\n#@catch\n\n\nout = print\ndef main():\n\tif r - l < 2:\n\t\tout(-1)\n\t\treturn\n\t\t\n\t\n\t\n\t#l1 = l+1\n\t#for x in range(l+2, r+1):\n\t\t#if simple(l1, x) and not simple(l, x):\n\t\t\t#out(l, l1, x)\n\t\t\t#break\n\t#else:\n\t\t#print(\"ERROR\")\n\t\t\n\tl1, r1 = l,r\n\tf = None\n\twhile r1 - l1 >= 2:\n\t\tresult = search(l1,r1)\n\t\tif result == False:\n\t\t\tl1+=1\n\t\telse:\n\t\t\tf = True\n\t\t\tbreak\n\tif f == True:\n\t\tout(result[0], result[1], result[2])\n\telse:\n\t\tout(-1)\n\treturn\n\t\n\t\n\t\nmain()", "X = list(map(int, input().split()))\r\nif (X[0] % 2 == 0 and X[1] - X[0] < 2) or (X[0] % 2 != 0 and X[1] - X[0] < 3):\r\n print(-1)\r\n exit()\r\nif X[0] % 2 == 0:\r\n print(X[0], X[0] + 1, X[0] + 2)\r\nelse:\r\n print(X[0] + 1, X[0] + 2, X[0] + 3)\r\n\r\n# UB_CodeForces\r\n# Advice: Everyone deserves the second chance, but not for the same mistake\r\n# Location: Behind my desk\r\n# Caption: Contest Problem\r\n# CodeNumber: 529\r\n", "temp=input()\r\ntemp=temp.split(\" \")\r\ntemp=list(map(int,temp))\r\nl=temp[0]\r\nr=temp[1]\r\nif l%2!=0:\r\n l+=1\r\nif r-l<=1:\r\n print(-1)\r\nelse:\r\n print(l,l+1,l+2)", "l,r=map(int,input().split());\n\nif l&1==1: l+=1;\n\nif l+2>r: print(-1);\n\nelse: print(l,l+1,l+2);\n\n\n\n# Made By Mostafa_Khaled", "\r\ndef HCF(l, r):\r\n while r:\r\n l, r = r, l%r\r\n return l \r\n\r\nfound = False\r\n\r\nl, r = map(int, input().split())\r\n\r\n\r\nfor i in range(l, r+1):\r\n for j in range(i, r+1):\r\n for k in range(j, r+1):\r\n if HCF(i, j) == 1 and HCF(j, k) == 1 and HCF(i, k) != 1:\r\n print(i, j, k)\r\n found = True\r\n break\r\n if found:\r\n break\r\n if found:\r\n break\r\n\r\nif not found:\r\n print(-1)\r\n", "a, b = map(int, input().split())\r\nsuperbreak = 0\r\nfor i in range(a, b+1):\r\n for j in range(i+1, b+1):\r\n for k in range(j+1, b+1):\r\n j2, i2, k2 = j, i, k\r\n lst = sorted([j, i, k])\r\n while j > 0:\r\n i, j = j, i%j\r\n if i == 1:\r\n while k > 0:\r\n j2, k = k, j2%k\r\n if j2 == 1:\r\n while k2 > 0:\r\n i2, k2 = k2, i2%k2\r\n if i2 != 1:\r\n print(*lst)\r\n superbreak = 1\r\n if superbreak:\r\n break\r\n if superbreak:\r\n break\r\nelse:\r\n print(-1)", "def gcd(a, b):\r\n if b == 0:\r\n return a;\r\n return gcd(b, a % b)\r\n\r\nl, r = map(int, input().split())\r\nfound = False\r\nfor a in range(l, r-1):\r\n for b in range(a+1, r):\r\n if gcd(a, b) == 1:\r\n for c in range(b+1, r+1):\r\n if gcd(b, c) == 1 and gcd(a, c) != 1:\r\n found = True\r\n break\r\n if found:\r\n break\r\n if found:\r\n break\r\nif found:\r\n print(a, b, c)\r\nelse:\r\n print(-1)\r\n ", "minimum_number, maximum_number = map(int, input().split())\n\ninsuficient_number_in_interval = maximum_number - minimum_number + 1 < 3\n\nis_minimum_number_odd = minimum_number % 2 == 1\n\nif insuficient_number_in_interval or (is_minimum_number_odd and maximum_number - minimum_number + 1 < 4):\n print('-1')\nelif is_minimum_number_odd:\n print(minimum_number + 1, minimum_number + 2, minimum_number + 3)\nelse:\n print(minimum_number, minimum_number + 1, minimum_number + 2)\n", "from math import gcd\nl,r = map(int,input().split())\n\nfor a in range(l,r-1) :\n for b in range(a+1,r):\n for c in range(b+1,r+1):\n if gcd(a,b) ==1 :\n if gcd(b,c) ==1 :\n if gcd(a,c)!=1:\n print(a,b,c)\n exit(0)\nprint(-1)", "import math\r\nx,y = map(int,input().split())\r\nfor m in range(x,y):\r\n if y-m ==1:\r\n break\r\n for i in range(m+2,y+1):\r\n if math.gcd(m,i)!=1 and math.gcd(m+1,i)==1:\r\n print(m,m+1,i)\r\n exit()\r\nprint(-1)", "num1,num2 = map(int, input().split())\r\n\r\nif (num1 % 2 != 0):\r\n num1 += 1 \r\n \r\nif (num2 - num1 < 2):\r\n print(-1)\r\nelse:\r\n print(num1, num1+1, num1+2)", "def computeGCD(x, y): \r\n \r\n while(y): \r\n x, y = y, x % y \r\n \r\n return x\r\nc=0 \r\nl,r = list(map(int,input().split()))\r\nif r-l==1:\r\n print(-1)\r\nelse:\r\n \r\n for i in range(l,r+1):\r\n for j in range(i+1,r+1):\r\n if computeGCD(i,j)==1:\r\n for k in range(j+1,r+1):\r\n if computeGCD(j,k)==1 and computeGCD(i,k)!=1:\r\n x=i\r\n y=j\r\n z=k\r\n c=1\r\n break\r\n if c==1:\r\n break\r\n if c==1:\r\n break\r\n if c==1:\r\n print(x,end=' ')\r\n print(y,end=' ')\r\n print(z)\r\n else:\r\n print(-1)", "import sys\nimport math\n\ndef gcd(a, b):\n while a != 0 and b != 0:\n if a > b:\n a = a % b\n else:\n b = b % a\n return max(a, b)\n\ndef main(n, m):\n for i in range(n, m - 1):\n for j in range(i + 1, m):\n for k in range(j + 1, m + 1):\n if gcd(i, j) == 1 and gcd(j, k) == 1 and gcd(i, k) != 1:\n print(i, j, k)\n return\n print(-1)\n\n\nif __name__ == \"__main__\":\n for e, line in enumerate(sys.stdin.readlines()):\n n, m = map(int, line.strip().split())\n\n # Proof by induction that sorting is that\n # same as solving this problem.\n main(n, m)\n", "numbers=[int(x) for x in input().split()]\n\nif numbers[0]%2!=0:\n numbers[0]+=1\n \nif abs(numbers[0]-numbers[1]) < 2:\n print(\"-1\")\nelse:\n print(numbers[0],numbers[0]+1, numbers[0]+2)\n", "import math\r\nbuff = input().split(\" \")\r\nl = int(buff[0])\r\nr = int(buff[1])\r\nres = []\r\n\r\nfor a in range(l, r - 1):\r\n for b in range(a + 1, r):\r\n for c in range(b, r + 1):\r\n if math.gcd(a, b) == 1 and math.gcd(b, c) == 1and math.gcd(a, c) != 1:\r\n res = [a, b, c]\r\n break\r\n\r\nif res == []:\r\n print(-1)\r\nelse:\r\n print(res[0], res[1], res[2])", "from math import gcd\nl,r = map(int,input().split())\n\nfor a in range(l,r-1):\n for b in range(a,r):\n for c in range(b,r+1):\n if gcd(a,c) != 1 :\n if gcd(a,b) == 1 and gcd(b,c) == 1 :\n print(a,b,c)\n exit()\n\nprint(-1)", "l,r =map(int, input(). strip(). split())\r\nif r-l <= 1 or (r-l == 2 and l % 2 == 1) :\r\n print(-1)\r\nelse:\r\n for i in range(l,r+1):\r\n if i % 2 == 0:\r\n break\r\n print(i,i+1,i+2)\r\n", "l,r = map(int,input().split())\r\n\r\nif r-l < 2:\r\n\tprint(\"-1\")\r\n\tquit()\r\n\r\nif l%2 == 0:\r\n\tprint(str(l)+\" \"+str(l+1)+\" \"+str(l+2))\r\n\tquit()\r\n\r\nif r-l == 2:\r\n\tprint(\"-1\")\r\n\tquit()\r\n\r\nprint(str(l+1)+\" \"+str(l+2)+\" \"+str(l+3))", "import math\r\nn,m = map(int,input().split())\r\nl1 = [(a,b,c) for a in range(n,m+1) for b in range(a+1,m+1) for c in range(b+1,m+1) if math.gcd(a,b)==1 and math.gcd(b,c)==1 and math.gcd(c,a)!=1]\r\nif len(l1)==0:\r\n print('-1')\r\nelse:\r\n for j in l1[0]:\r\n print(j,end = ' ')", "import math\r\nl,r=map(int,input().split())\r\na=l\r\nb=l+1\r\nc=-1\r\narr=[]\r\nfor i in range(l+2,r+1):\r\n if(math.gcd(b,i)==1 and math.gcd(a,i)!=1):\r\n arr.append(i)\r\nif(len(arr)==0):\r\n a=l+1\r\n b=l+2\r\n for i in range(l+2,r+1):\r\n if(math.gcd(b,i)==1 and math.gcd(a,i)!=1):\r\n c=i\r\n break\r\n if(a==-1 or b==-1 or c==-1):\r\n print(\"-1\")\r\n else:\r\n print(a,\" \",b,\" \",c)\r\nelse:\r\n print(a,\" \",b,\" \",arr[0])", "def nod(x, y):\r\n while min(x, y) > 0 and x != y:\r\n if x > y:\r\n x = x % y\r\n else:\r\n y = y % x\r\n return max(x, y)\r\ndef is_me_right(left, right):\r\n for a in range(l, r - 1):\r\n for b in range(a + 1, r):\r\n for c in range(b + 1, r + 1):\r\n if (nod(a, b) == 1) and (nod(b, c) == 1) and (nod(a, c) != 1):\r\n return True, a, b, c\r\n return False, 1, 1, 1\r\nl, r = list(map(int, input().split()))\r\nimr, a, b, c = is_me_right(l, r)\r\nif imr:\r\n print(a, b, c)\r\nelse:\r\n print(-1)", "def main():\r\n l, r = map(int, input().split())\r\n \r\n if r-l < 2:\r\n print(-1)\r\n return \r\n \r\n if r-l == 2:\r\n if r%2:\r\n print(-1)\r\n return \r\n \r\n print(l, l+1, r)\r\n return \r\n \r\n for i in range(l, r):\r\n if not i%2:\r\n print(i, i+1, i+2)\r\n return \r\n \r\nmain()\r\n ", "import time\nimport math\ns=[]\ndef sieve(limit):\n a = [True] * limit # Initialize the primality list\n a[0] = a[1] = False\n ans=[]\n for (i, isprime) in enumerate(a):\n if isprime:\n ans.append(i)\n for n in range(i*i, limit, i): # Mark factors non-prime\n a[n] = False\n return ans\ndef coprime(a,b):\n global s\n k=int(math.sqrt(a))\n if (b-a)==1:\n return True\n s=sieve(50)\n for i in s:\n if a%i==0 and b%i==0:\n return False\n return True\ndef test(a,z):\n global s\n b=a+1\n c=b+1\n if (z-a)<2:\n return [-1]\n if (z-a)==2 and a%2==1:\n return [-1]\n if a%2==0:\n return [a,b,c]\n else:\n while c<=z:\n if coprime(b,c)and not coprime(a,c):\n return [a,b,c]\n c+=2 \n return [a+1,a+2,a+3] \ninfo=list(map(int,input().split()))\nans=test(info[0],info[1])\nif ans==[-1]:\n print(-1)\nelse:\n for i in ans:\n print(i,end=' ')\n\n \n \n\n \t\t \t \t \t\t \t\t\t \t \t \t \t\t", "from math import *\r\nz,x = map(int,input().split())\r\na = 0\r\nc = 0\r\n\r\nfor num1 in range(z,x+1):\r\n num2 = num1+1\r\n for num3 in range(num1+1,x+1):\r\n if gcd(num3,num2)==1 and gcd(num1,num3)>1:\r\n c=num3\r\n a = num1\r\n b = num2\r\n break\r\n if c > 0:\r\n break\r\n\r\nif c == 0:\r\n print(-1) \r\nelse: \r\n print(a,b,c)", "import math\r\nl,r = map(int,input().split())\r\nfor i in range(l,r+1):\r\n for j in range(i+1,r+1):\r\n for k in range(j+1,r+1):\r\n a = i\r\n b = j\r\n c = k\r\n if math.gcd(a,b) == 1 and math.gcd(b,c) == 1:\r\n if math.gcd(a,c)!=1:\r\n print(a,b,c)\r\n exit()\r\n\r\nprint(-1)\r\n", "def solve(a,b):\r\n if a%2!=0:\r\n a+=1\r\n if a+2>b:\r\n return -1\r\n return str(a) + \" \" + str(a+1) + \" \" + str(a+2)\r\n\r\na,b=map(int,input().split())\r\nprint(solve(a,b))\r\n", "from math import *\r\n[l,r] = [int(x) for x in input().split(\" \")]\r\n\r\nl = list(range(l,r+1));\r\nflag = False\r\na=0\r\nb=0\r\nc=0\r\nfor a in l[:]:\r\n if flag:\r\n break\r\n t = l.index(a)\r\n for b in l[t+1:]:\r\n if flag:\r\n break\r\n s = l.index(b)\r\n for c in l[s+1:]:\r\n if gcd(a,b) == 1 and gcd(b,c)==1 and gcd(a,c) != 1:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(a-1,b-1,c)\r\n \r\nelse:\r\n print(-1)\r\n ", "# This is a sample Python script.\r\n\r\n# Press Shift+F10 to execute it or replace it with your code.\r\n# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.\r\n\r\nx, y = map(int, input().split())\r\nif x%2!=0:\r\n x+=1\r\nif abs(x-y)<2:\r\n print(-1)\r\nelse:\r\n print(x , end='')\r\n print(\" \", end='')\r\n print(x+1, end='')\r\n print(\" \", end='')\r\n print(x+2, end='')\r\n", "from math import gcd\n\nl, r = map(int, input().split())\nrng = r - l + 1\nif rng < 3:\n print(\"-1\")\nelif rng > 3:\n start = l + (l & 1)\n print(start, start + 1, start + 2)\nelse:\n if l & 1:\n print(\"-1\")\n else:\n print(l, l + 1, r)\n\t \t\t\t \t \t\t \t\t \t\t \t\t \t\t \t", "l,r = map(int,input().split())\r\nif l%2:\r\n l+=1\r\nif r-l<2:\r\n print(-1)\r\nelse:\r\n print(l,l+1,l+2)\r\n", "import sys \r\n\r\nl, r = map(int,sys.stdin.readline().split())\r\n\r\n\r\nif (l % 2 == 0) & (l + 2 <= r):\r\n print(str(l) + ' ' + str(l + 1) + ' ' + str(l + 2))\r\nelif ((l + 1) % 2 == 0) & (l + 3 <= r):\r\n print(str(l + 1) + ' ' + str(l + 2) + ' ' + str(l + 3))\r\nelse:\r\n print(-1)", "l,r=map(int,input().split())\r\nif(l%2==0 and r-l>1):\r\n print(l,l+1,l+2,end=\" \")\r\nelif(l%2!=0 and r-l>2):\r\n print(l+1,l+2,l+3,end=\" \")\r\nelse:\r\n print(\"-1\")", "n,k=map(int, input().split())\r\nif k-n>=3:\r\n if n%2==0:\r\n print(n,n+1,n+2)\r\n else:\r\n print(n+1,n+2,n+3)\r\nelif k-n<=1:\r\n print(-1)\r\nelse:\r\n if n%2==0:\r\n print(n,n+1,n+2)\r\n else:\r\n print(-1)", "l, r = map(int, input().split())\r\n\r\nnum_list = [i for i in range(l, r + 1)]\r\nnumb_list = [2, 3, 4, 5, 6, 7, 8, 9, 10]\r\n\r\nfor i in range(2, 11):\r\n k = 0\r\n ans = []\r\n for j in range(len(num_list)):\r\n if num_list[j] % i == 0:\r\n k += 1\r\n ans.append(j)\r\n\r\n if k >= 2:\r\n print(num_list[ans[0]], num_list[ans[0] + 1], num_list[ans[1]])\r\n break\r\n\r\nelse:\r\n print(-1)\r\n", "l,r=map(int,input().split())\r\narr=[]\r\nfor i in range(l,r+1):\r\n if len(arr)>=3:break\r\n if i%2==0 and len(arr)==0:arr.append(i)\r\n elif i%2==1 and len(arr)==1:arr.append(i)\r\n elif i%2==0 and len(arr)==2:arr.append(i)\r\nif len(arr)>=3:print(*arr)\r\nelse:print(-1)\r\n", "from sys import exit\n\ndef gcd(a, b):\n\treturn gcd(b, a % b) if b else a\n\nl, r = map(int, input().split())\n\nfor i in range(l, r + 1):\n\tfor j in range(i + 1, r + 1):\n\t\tfor k in range(j + 1, r + 1):\n\t\t\tij = gcd(i, j)\n\t\t\tjk = gcd(j, k)\n\t\t\tik = gcd(i, k)\n\t\t\tif (ij == jk and jk == 1 and ik != 1):\n\t\t\t\tprint(i, j, k)\n\t\t\t\texit(0);\nprint(-1)\n", "l,r = list(map(int, input().split()))\r\n\r\nif l%2 != 0:\r\n l+=1\r\n \r\nif l+2 > r:\r\n print(-1)\r\nelse:\r\n print(l, (l+1), (l+2))", "# import sys \r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n# sys.setrecursionlimit(100000000)\r\n\r\n\r\n\r\n####################################\r\n# # # # # # # # # # # # # # # #\r\n# █ █▀▄▀█ █▀█ █▀█ █▀█ ▀█▀ █▀ #\r\n# █ █░▀░█ █▀▀ █▄█ █▀▄ ░█░ ▄█ #\r\n# # # # # # # # # # # # # # # #\r\nimport math\r\nimport heapq\r\nfrom math import gcd,floor,sqrt,log\r\n\r\n# # # # # # # # # # # # # # # # # # # # # #\r\n# █▀▄ █▀▀ █▀▀ █ █▄░█ █ ▀█▀ █ █▀█ █▄░█ █▀ #\r\n# █▄▀ ██▄ █▀░ █ █░▀█ █ ░█░ █ █▄█ █░▀█ ▄█ #\r\n# # # # # # # # # # # # # # # # # # # # # #\r\n\r\ndef iin(): return int(input())\r\ndef sin(): return input().strip()\r\ndef listin(): return list(map(int,input().strip().split()))\r\ndef liststr(): return list(map(str,input().strip().split()))\r\ndef ceill(x): return int(x) if(x==int(x)) else int(x)+1\r\ndef ceilldiv(x,d): x//d if(x%d==0) else x//d+1\r\ndef LCM(a,b): return (a*b)//gcd(a,b)\r\ndef nlargest(num,array): return heapq.nlargest(num,array)\r\ndef nsmallest(num,array): return heapq.nsmallest(num,array)\r\n\r\n# # # # # # # # # # # # \r\n# █▀ █▀█ █░░ █░█ █▀▀ #\r\n# ▄█ █▄█ █▄▄ ▀▄▀ ██▄ #\r\n# # # # # # # # # # # #\r\ndef solve():\r\n\ta,b = listin()\r\n\tif a%2!=0: a+=1\r\n\tif a + 2 > b: print(-1)\r\n\telse: print(a,a+1,a+2)\r\n\r\n\r\n\r\n\r\n# # # # # # # # # # #\r\n# █▀▄▀█ ▄▀█ █ █▄░█ #\r\n# █░▀░█ █▀█ █ █░▀█ #\r\n# # # # # # # # # # #\r\n\r\nt = 1 \r\n# t = int(input()) \r\nfor hula in range(t):\r\n\tsolve()\r\n", "import sys\n\nle, rg = map(int, input().split())\nrg += 1\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\nfor a in range(le, rg):\n for b in range(a + 1, rg):\n gab = gcd(a, b)\n if gab != 1:\n continue\n for c in range(b + 1, rg):\n if gcd(b, c) == 1 and gcd(a, c) > 1:\n print(a, b, c)\n sys.exit(0)\n\nprint(-1)\n", "from collections import deque\r\nimport math\r\n\r\ndef main():\r\n l, r = [int(i) for i in input().split()]\r\n ans = (-1, )\r\n for a in range(l, r+1):\r\n for b in range(a+1, r+1):\r\n if math.gcd(a, b) != 1:\r\n continue\r\n for c in range(b+1, r+1):\r\n if math.gcd(b, c) == 1 and math.gcd(a, c) != 1:\r\n ans = (a, b, c)\r\n break\r\n print(\" \".join([str(i) for i in ans]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# RawCoder : https://bit.ly/RCyouTube\r\n# Author : MehulYK\r\n \r\nimport math as m\r\n\r\ndef lmap():\r\n return list(map(int, input().split()))\r\n \r\ndef mmap(): \r\n return map(int, input().split())\r\n\r\n\r\n \r\nl, r = mmap()\r\n\r\nif(l % 2 != 0):\r\n l += 1\r\nif(r - l + 1 >= 3):\r\n print(l, l + 1, l + 2)\r\nelse:\r\n print(-1) ", "a,b = map(int,input().split())\r\nif b - a >= 2:\r\n\tif a%2 == 1 and b - a == 2:\r\n\t\tprint(-1)\r\n\telif a%2 == 1:\r\n\t\tprint(a+1,a+2,a+3)\r\n\telse:\r\n\t\tprint(a,a+1,a+2)\r\nelse:\r\n\tprint(-1)\r\n" ]

[ "# LUOGU_RID: 111555286\nfrom sys import stdin \ninput = stdin.readline \n\ndef get() : \n return map(int,input().split())\n\ndef dfs(u, fa) : \n\n f[u] = 0 \n for v in Map[u].keys() : \n if v == fa : continue \n dfs(v, u) \n f[u] += f[v] + Map[u][v] \n\ndef find(u, fa, tot) : \n global res\n res = max(res, tot) \n \n for v in Map[u].keys() : \n if v == fa : continue \n find(v, u, tot + Map[u][v]) \n\nn = int(input()) \nMap = [dict() for i in range(n + 1)] \nf = [0] * (n + 1) \ndin = [0] * (n + 1) \n\nfor i in range(n - 1) : \n a, b, c = get() \n Map[a][b] = Map[b][a] = c \n\ndfs(1, -1) \n\nres = 0 \nfind(1, -1, 0) \n\nprint(f[1] * 2 - res)", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import deque\r\nn=int(input())\r\ng=[[] for i in range(n)]\r\nedge={}\r\nfor _ in range(n-1):\r\n u,v,w=map(int,input().split())\r\n g[u-1].append([v-1,w])\r\n g[v-1].append([u-1,w])\r\n edge[(u-1,v-1)]=edge[(v-1,u-1)]=w\r\norder=[]\r\ndq=deque([[-1,0]])\r\npar=[-1]*n\r\ndist=[0]*n\r\nwhile dq:\r\n p,v=dq.popleft()\r\n order.append(v)\r\n for to,w in g[v]:\r\n if p!=to:\r\n par[to]=v\r\n dq.append([v,to])\r\n dist[to]=dist[v]+w\r\norder.reverse()\r\nc=[0]*n\r\nfor x in order[:-1]:\r\n c[par[x]]+=c[x]+edge[(x,par[x])]\r\nprint(c[0]*2-max(dist))", "n = int(input())\n\nadj = [[] for i in range(200000)]\nwgt = [[] for i in range(200000)]\nans = 0\n\npp = [0 for i in range(200000)]\nmark = [0 for i in range(200000)]\n\ndef DFS(x, p):\n pp[x] = p\n mark[x] = 1\n for i in range(len(adj[x])):\n v = adj[x][i]\n if mark[v] == 0:\n DFS(v, p + wgt[x][i])\n\n\nfor i in range(n-1):\n u, v, w = map(int, input().split())\n ans += 2 * w\n adj[u].append(v)\n adj[v].append(u)\n wgt[u].append(w)\n wgt[v].append(w)\n\nmark[1] = 1\nDFS(1, 0)\nt = 0\nfor i in range(1, n+1):\n t = max(t, pp[i])\n\nans -= t\nprint(ans)\n\t\t \t \t \t \t\t\t \t \t \t \t \t\t", "n = int(input())\r\ng = [[] for _ in range(n)]\r\ns = 0\r\n\r\nfor i in range(1,n):\r\n u,v,w = map(int,input().split())\r\n u -= 1\r\n v -= 1\r\n g[u].append([v,w])\r\n g[v].append([u,w])\r\n s += w\r\ndef dfs (u,f,x):\r\n ret = x\r\n for v,w in g[u]:\r\n if f != v:\r\n ret = max(ret,dfs(v,u,w+x))\r\n return ret\r\nprint(2*s-dfs(0,-1,0))", "import sys\r\nimport threading\r\nthreading.stack_size(10**8)\r\nsys.setrecursionlimit(10**6)\r\n\r\ndef rl():\r\n return list(map(int,input().split()))\r\ndef ri():\r\n return int(input())\r\ndef rs():\r\n return input()\r\ndef rm():\r\n return map(int,input().split())\r\nfrom collections import defaultdict\r\ndef main():\r\n n=ri()\r\n g=defaultdict(list)\r\n al=[0]*(n+1)\r\n mi=[pow(10,10)]*(n+1)\r\n for i in range(n-1):\r\n x,y,w=rm()\r\n g[x].append([y,w]); g[y].append([x,w])\r\n def dfs1(u,p):\r\n for v,w in g[u]:\r\n if v!=p: al[u]+=w*2+dfs1(v,u)\r\n return al[u]\r\n dfs1(1,-1)\r\n def dfs2(u,p):\r\n for v,w in g[u]:\r\n if v!=p: mi[u]=min(mi[u],al[u]-w-(al[v]-dfs2(v,u)))\r\n if mi[u]==pow(10,10): mi[u]=0\r\n return mi[u]\r\n print(dfs2(1,-1))\r\n\r\n\r\nthreading.Thread(target=main).start()\r\n\r\n", "import collections\nfrom email.policy import default\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------func-----------------------------------------#\n######################################################################################\ndef valid(i,j,n,m):\n if i<n and i>=0 and j>=0 and j< m :return True #and l[i][j]==1 and visit[i][j]\n return False\ndef sumn(i,n):\n return (n-i)*(i+n)/2\ndef sqfun(a,b,c):\n return (-b+math.sqrt(b*b-4*a*c))/2*a\n######################################################################################\n#--------------------------------------vars-----------------------------------------#\n######################################################################################\n# index=[[1,0],[0,1],[-1,0],[0,-1]]\n\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 d={}\n d[1]=0\n ans=0\n l=[]\n for i in range(n-1):\n u,v,w=values()\n if u>v:u,v=v,u\n l.append((u,v,w))\n ans+=w*2\n for u,v,w in sorted(l,key=lambda x: x[0]):\n d[v]=d[u]+w\n return ans-max(d.values())\n \n \n \n\n\n\nif __name__ == \"__main__\":\n # for i in range(inp()):\n print(solve())\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([])\r\nww=0\r\nfor i in range(n-1):\r\n x,y,w=map(int,input().split())\r\n x-=1\r\n y-=1\r\n a[x].append([y,w])\r\n a[y].append([x,w])\r\n ww+=w\r\notv=[0]\r\ndef dfs(cur,p,plw):\r\n f=1\r\n for y,w in a[cur]:\r\n if y!=p:\r\n f=0\r\n dfs(y,cur,plw+w)\r\n if otv[0]<plw and f:\r\n otv[0]=plw\r\ndfs(0,-1,0)\r\nprint(2*ww-otv[0])\r\n\n# Tue Jul 12 2022 07:16:17 GMT+0000 (Coordinated Universal Time)\n", "def dfs(g, x, p):\r\n cost = 0\r\n for y, w in g[x]:\r\n if not y == p:\r\n cost = max(dfs(g, y, x)+w, cost)\r\n return cost\r\n \r\n \r\nn = int(input())\r\ng = [[] for i in range(n+1)]\r\nans = 0\r\nfor _ in range(n-1):\r\n x, y, w = map(int, input().split())\r\n g[x].append((y, w))\r\n g[y].append((x, w))\r\n ans+= 2*w\r\nans -= dfs(g, 1, 0)\r\nprint(ans)", "def dfs(now, fa, s):\r\n global lgst\r\n lgst = max(lgst, s)\r\n for each in h[now]:\r\n if each[0] != fa:\r\n dfs(each[0], now, s + each[1])\r\n\r\n\r\nlgst, res = 0, 0\r\nn = int(input())\r\nh = [[] for i in range(n + 1)]\r\nfor i in range(n - 1):\r\n x, y, z = map(int, input().split())\r\n h[x].append([y, z])\r\n h[y].append([x, z])\r\n res += z\r\ndfs(1, -1, 0)\r\nprint(res * 2 - lgst)\r\n", "q={1:0}\r\nl=[]\r\na=0\r\nfor i in range(int(input())-1):\r\n x,y,w=map(int,input().split())\r\n a+=2*w\r\n if x>y:\r\n x,y=y,x\r\n l+=[[x,y,w]]\r\nl.sort()\r\nfor i in l:\r\n q[i[1]]=q[i[0]]+i[2]\r\nprint(a-max(q.values()))", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nadj = [[] for _ in range(n)]\r\ndeg = [100] + [0] * n\r\nfor u, v, w in (map(int, input().split()) for _ in range(n - 1)):\r\n adj[u - 1].append((v - 1, w))\r\n adj[v - 1].append((u - 1, w))\r\n deg[u - 1] += 1\r\n deg[v - 1] += 1\r\n\r\n\r\ntotal_w = [0] * n\r\nmax_w = [0] * n\r\nstack = [i for i in range(1, n) if deg[i] == 1]\r\n\r\nwhile stack:\r\n v = stack.pop()\r\n deg[v] = 0\r\n\r\n for dest, w in adj[v]:\r\n if deg[dest] == 0:\r\n continue\r\n total_w[dest] += total_w[v] + w\r\n max_w[dest] = max(max_w[dest], max_w[v] + w)\r\n deg[dest] -= 1\r\n if deg[dest] == 1:\r\n stack.append(dest)\r\n\r\nprint(total_w[0] * 2 - max_w[0])\r\n", "import sys\r\ndef mainFunction():\r\n n, = rv()\r\n edges = [list() for _ in range(n+1)]\r\n for i in range(n - 1):\r\n x, y, w, = rv()\r\n edges[x].append((y, w))\r\n edges[y].append((x, w))\r\n res = dfs(1, -1, edges)\r\n print(res[0] * 2 - res[1])\r\n\r\ndef dfs(cur, prev, edges):\r\n total, single = 0, 0\r\n for nxt, weight in edges[cur]:\r\n if nxt != prev:\r\n temp = dfs(nxt, cur, edges)\r\n total += temp[0] + weight\r\n single = max(single, temp[1] + weight)\r\n return (total, single)\r\n\r\n\r\ndef prt(l): return print(' '.join(l))\r\ndef rv(): return map(int, input().split())\r\ndef rl(n): return [list(map(int, input().split())) for _ in range(n)]\r\n#-----------------main method------------------------------------------\r\nmainFunction()", "n=int(input())\r\nq={1:0}\r\nl=[]\r\na=0\r\nfor i in range(n-1):\r\n x,y,w=map(int,input().split())\r\n a+=2*w\r\n if x>y:x,y=y,x\r\n l+=[[x,y,w]]\r\nl.sort(key=lambda x:x[0])\r\nfor i in l:q[i[1]]=q[i[0]]+i[2]\r\nprint(a-max(q.values()))", "n = int(input())\r\n\r\nmatrix = [[] * n for i in range(n)]\r\nconn = dict()\r\n\r\ndef dfs(el, el2):\r\n suma = 0\r\n for element in matrix[el]:\r\n if element[0] != el2:\r\n suma = max(suma, element[1]+dfs(element[0],el))\r\n return suma\r\n\r\nsuma=0\r\nfor i in range(n-1):\r\n line = input()\r\n line = line.split(' ')\r\n matrix[int(line[0])-1].append((int(line[1])-1,int(line[2])))\r\n matrix[int(line[1])-1].append((int(line[0])-1,int(line[2])))\r\n suma += 2*int(line[2])\r\n\r\nprint(suma-dfs(0,-1))", "# Legends Always Come Up with Solution\r\n# Author: Manvir Singh\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom heapq import *\r\nfrom math import inf\r\n\r\ndef main():\r\n n=int(input())\r\n tree,su=[[] for _ in range(n+1)],0\r\n for i in range(n-1):\r\n x,y,w=map(int,input().split())\r\n tree[x].append((y,w))\r\n tree[y].append((x,w))\r\n su+=w\r\n d,b=[inf]*(n+1),[]\r\n d[1]=0\r\n heappush(b,(0,1))\r\n while b:\r\n c,ch=heappop(b)\r\n if d[ch]<c:\r\n continue\r\n for i in tree[ch]:\r\n if d[i[0]]>c+i[1]:\r\n d[i[0]]=c+i[1]\r\n heappush(b,(c+i[1],i[0]))\r\n print(2*su-max(d[1:]))\r\n \r\n# region fastio\r\n\r\nBUFSIZE = 8192\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "g = [[] for _ in range(100005)]\r\n\r\nsumx = 0\r\nn = int(input())\r\nfor i in range(n-1):\r\n x, y, w = map(int, input().split(' '))\r\n g[x].append([y, w])\r\n g[y].append([x, w])\r\n sumx += 2*w\r\n\r\nvisited = [0] * 100005\r\ndist = [10**18] * 100005\r\ndist[1] = 0\r\ndef dfs(s):\r\n visited[s] = 1\r\n for i in g[s]:\r\n if visited[i[0]] == 0:\r\n dist[i[0]] = dist[s] + i[1]\r\n dfs(i[0])\r\n\r\nm = -1\r\ndfs(1)\r\nfor i in dist:\r\n if i != 10**18:\r\n m = max(m, i)\r\n\r\nprint(sumx - m)\r\n", "import sys\n\nsys.setrecursionlimit(1000*1000)\n\nn = int(input())\n\n\n\ng = [[] for i in range(n+1)]\n\ndist = [0] * (10**5+1)\n\nr = 10**32\n\n#print(dist)\n\ndef init(i,p):\n\n for j in g[i]:\n\n #print(j)\n\n if j[0] == p:\n\n continue\n\n else :\n\n s = 2*j[1]+init(j[0],i)\n\n dist[i] += s\n\n #print(i)\n\n return dist[i]\n\n\n\ndef dfs(i,p,c):\n\n global r\n\n for j in g[i]:\n\n if j[0] == p:\n\n continue\n\n dfs(j[0],i,c+dist[i]-dist[j[0]]-j[1])\n\n if len(g[i]) == 1 and i != 1:\n\n r = min(r,c)\n\n\n\nfor i in range(n-1):\n\n x,y,w = map(int,input().split(' '))\n\n g[x].append((y,w))\n\n g[y].append((x,w))\n\n\n\ninit(1,0)\n\ndfs(1,0,0)\n\n\n\nif n == 1 :\n\n print(0)\n\nelse :\n\n print(r)\n\n\n\n# Made By Mostafa_Khaled", "n = (int)(input())\r\nl = [[] for _ in range(n + 1)]\r\nanswer = 0\r\nfor _ in range(n - 1) :\r\n u , v , w = (list)(map(int , input().split()))\r\n l[u].append([v , w])\r\n l[v].append([u , w])\r\n answer += 2 * w\r\n\r\ndistance = [0 for _ in range(n + 1)]\r\n\r\ndef dfs(node , parent , dis) :\r\n distance[node] = dis\r\n for [child , weight] in l[node] :\r\n if child == parent : continue\r\n dfs(child , node , dis + weight)\r\n\r\ndfs(1 , -1 , 0)\r\n\r\nanswer -= max(distance)\r\n\r\nprint(answer)" ]

[ "from itertools import permutations as p \r\nl = [list(map(int, input().split())) + [_] for _ in range(1, 9)]\r\n\r\ndef dist(a, b):\r\n return (a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2\r\n\r\ndef rect(a, b, c, d):\r\n return dist(a, b) == dist(c, d) and dist(a, c) == dist(b, d) and dist(a, d) == dist(b, c) and dist(a, b) * dist(b, c) != 0\r\n\r\ndef sq(a, b, c, d):\r\n # print(rect(a, b, c, d))\r\n return rect(a, b, c, d) and dist(a, b) == dist(b, c)\r\n\r\nfor t in p(l):\r\n if sq(*t[:4]) and rect(*t[4:]):\r\n print(\"YES\")\r\n print(' '.join([str(_[2]) for _ in t[:4]]))\r\n print(' '.join([str(_[2]) for _ in t[4:]]))\r\n exit()\r\nprint(\"NO\")", "import math\r\n\r\n\r\n# points: [(), (), (), ()]\r\ndef isRectangle(points: list, isSquare: bool) -> bool:\r\n points.sort()\r\n center1 = ((points[0][0] + points[3][0]) / 2, (points[0][1] + points[3][1]) / 2)\r\n center2 = ((points[1][0] + points[2][0]) / 2, (points[1][1] + points[2][1]) / 2)\r\n if center1 != center2:\r\n return False\r\n vector1 = (points[0][0] - points[1][0], points[0][1] - points[1][1])\r\n vector2 = (points[0][0] - points[2][0], points[0][1] - points[2][1])\r\n if vector1[0] * vector2[0] + vector1[1] * vector2[1] != 0:\r\n return False\r\n if isSquare:\r\n return vector1[0] * vector1[0] + vector1[1] * vector1[1] == vector2[0] * vector2[0] + vector2[1] * vector2[1]\r\n return True\r\n\r\n\r\npointsList = []\r\nfor _ in range(8):\r\n pointsList.append(tuple(map(int, input().split(' '))))\r\n\r\nyes = False\r\nresult = []\r\nleftPoints = []\r\nfor i in range(8):\r\n for j in range(i + 1, 8):\r\n for k in range(j + 1, 8):\r\n for m in range(k + 1, 8):\r\n if isRectangle([pointsList[t] for t in (i, j, k, m)], True):\r\n leftPoints = []\r\n for temp in range(8):\r\n if temp in (i, j, k, m):\r\n continue\r\n leftPoints.append(temp)\r\n if isRectangle([pointsList[t] for t in leftPoints], False):\r\n yes = True\r\n result = [i, j, k, m]\r\n break\r\n if yes:\r\n break\r\n if yes:\r\n break\r\n if yes:\r\n break\r\n\r\nif yes:\r\n print('YES')\r\n for each in result:\r\n print(each + 1, end=' ')\r\n print()\r\n for each in leftPoints:\r\n print(each + 1, end=' ')\r\n print()\r\nelse:\r\n print('NO')\r\n", "def L(a, b): return (a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2\r\ndef fs(a, b, c, d): return L(a, b) == L(b, c) == L(c, d) == L(d, a) == L(a, c) / 2\r\ndef fr(a, b, c, d): return L(a, b) == L(c, d) and L(b, c) == L(d, a) and L(a, c) == L(b, d)\r\ndef gs(a, b, c, d): return fs(a, b, c, d) or fs(a, b, d, c) or fs(a, c, b, d)\r\ndef gr(a, b, c, d): return fr(a, b, c, d) or fr(a, b, d, c) or fr(a, c, b, d)\r\ndef hr(q): return gr(t[q[0]], t[q[1]], t[q[2]], t[q[3]])\r\n\r\nt = [(0, 0)] + [list(map(int, input().split())) for i in range(8)]\r\np = {1, 2, 3, 4, 5, 6, 7, 8}\r\nfor i in range(1, 6):\r\n for j in range(i + 1, 7):\r\n for k in range(j + 1, 8):\r\n for l in range(k + 1, 9):\r\n if gs(t[i], t[j], t[k], t[l]):\r\n q = list(p - {i, j, k, l})\r\n if hr(q):\r\n print('YES')\r\n print(i, j, k, l)\r\n print(' '.join(map(str, q)))\r\n exit(0)\r\nprint('NO')", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport itertools\r\n\r\nA = []\r\nfor _ in range(8):\r\n x,y = map(int, input().split())\r\n A.append((x,y))\r\n \r\ndef square(x1,y1,x2,y2,x3,y3,x4,y4):\r\n d1 = ((x1-x2)**2)+((y1-y2)**2)\r\n d2 = ((x3-x2)**2)+((y3-y2)**2)\r\n d3 = ((x4-x3)**2)+((y4-y3)**2)\r\n d4 = ((x1-x4)**2)+((y1-y4)**2)\r\n \r\n c1 = ((x1-x3)**2)+((y1-y3)**2)\r\n c2 = ((x2-x4)**2)+((y2-y4)**2)\r\n \r\n if d1==d2==d3==d4 and c1==c2 and d1+d2==c1 and d1+d4==c2:\r\n return True\r\n return False\r\n\r\ndef rect(x1,y1,x2,y2,x3,y3,x4,y4):\r\n d1 = ((x1-x2)**2)+((y1-y2)**2)\r\n d2 = ((x3-x2)**2)+((y3-y2)**2)\r\n d3 = ((x4-x3)**2)+((y4-y3)**2)\r\n d4 = ((x1-x4)**2)+((y1-y4)**2)\r\n \r\n c1 = ((x1-x3)**2)+((y1-y3)**2)\r\n c2 = ((x2-x4)**2)+((y2-y4)**2)\r\n \r\n if d1==d3 and d2==d4 and c1==c2 and d1+d2==c1 and d1+d4==c2:\r\n return True\r\n return False\r\n\r\n \r\ndef check(ps):\r\n ans = []\r\n if not square(*A[ps[0]],*A[ps[1]],*A[ps[2]],*A[ps[3]]):\r\n return None\r\n if not rect(*A[ps[4]],*A[ps[5]],*A[ps[6]],*A[ps[7]]):\r\n return None\r\n \r\n ans.append(ps[:4])\r\n ans.append(ps[4:])\r\n return ans\r\n\r\nB = [i for i in range(8)]\r\nfor i in itertools.permutations(B,8):\r\n ans = check(i)\r\n if ans:\r\n print('YES')\r\n for a in ans:\r\n print(*[j+1 for j in a])\r\n exit(0)\r\nprint(\"NO\")\r\n ", "import sys\r\ninput = sys.stdin.readline\r\nfrom itertools import permutations\r\n\r\n\r\ndef f(a, b):\r\n return (a[0]-b[0])**2 + (a[1]-b[1])**2\r\n\r\n\r\ndef f1(a, b, c):\r\n return f(a, b) == f(b, c)\r\n\r\n\r\ndef f2(a, b, c):\r\n return f(a, b) + f(b, c) == f(a, c)\r\n\r\n\r\nw = []\r\nfor i in range(1, 9):\r\n d = list(map(int, input().split())) + [i]\r\n w.append(tuple(d))\r\nfor d in permutations(w, 8):\r\n a1, a2, a3, a4, b1, b2, b3, b4 = d\r\n if f1(a1, a2, a3) and f1(a1, a4, a3) and f2(a1, a2, a3) and f2(a1, a4, a3) and f(b1, b2) == f(b3, b4) and f(b1, b4) == f(b3, b2) and f2(b1, b2, b3) and f2(b1, b4, b3):\r\n print('YES')\r\n print(a1[2], a2[2], a3[2], a4[2])\r\n print(b1[2], b2[2], b3[2], b4[2])\r\n break\r\nelse:\r\n print('NO')", "from sys import stdin, stdout\n\nfrom itertools import permutations as p\n\nfrom itertools import combinations as com\n\n\n\ndef sqr_or_rec(a, b, c, d):\n\n x = ((a[1] - b[1])**2 + (a[0] - b[0]) **2)\n\n y = ((c[1] - b[1])**2 + (c[0] - b[0]) **2)\n\n w = ((c[1] - d[1])**2 + (c[0] - d[0]) **2)\n\n z = ((a[1] - d[1])**2 + (a[0] - d[0]) **2)\n\n hypo1 = ((a[1] - c[1])**2 + (a[0] - c[0]) **2)\n\n hypo2 = ((b[1] - d[1])**2 + (b[0] - d[0]) **2)\n\n if len(set([x,y,w,z])) == 1 and hypo1 == x + y and hypo2 == hypo1 and hypo2 == w + z:\n\n return 0\n\n elif len(set([x,y,w,z])) == 2 and hypo1 == x + y and hypo2 == hypo1 and hypo2 == w + z:\n\n return 1\n\n else:\n\n return -1\n\n\n\nx = []\n\nfor i in range(8):\n\n l, m = map(int, input().split())\n\n x.append([l, m])\n\n\n\nsqr, rec = [], []\n\n\n\nfor g in p(list(range(8)), 4):\n\n a, b, c, d = x[g[0]], x[g[1]], x[g[2]], x[g[3]]\n\n if sqr_or_rec(a,b,c,d) == 0:\n\n y = sorted(g)\n\n if y not in sqr:\n\n sqr.append(y)\n\n elif sqr_or_rec(a,b,c,d) == 1:\n\n y = sorted(g)\n\n if y not in rec:\n\n rec.append(y)\n\n \n\nif len(sqr) == 0 or (len(sqr) == 1 and len(rec) == 0):\n\n print(\"NO\")\n\nelse:\n\n if len(sqr) >= 2:\n\n for q in com(sqr, 2):\n\n if len(set(q[0] + q[1])) == 8:\n\n print(\"YES\")\n\n for k in sqr[0]:\n\n stdout.write(str(k+1)+\" \")\n\n print()\n\n for k in sqr[1]:\n\n stdout.write(str(k+1)+\" \")\n\n print() \n\n exit()\n\n for q in rec:\n\n if len(set(q + sqr[0])) == 8:\n\n print(\"YES\")\n\n for k in sqr[0]:\n\n stdout.write(str(k+1)+\" \")\n\n print()\n\n for k in q:\n\n stdout.write(str(k+1)+\" \")\n\n print() \n\n exit() \n\n print(\"NO\") \n\n\n\n# Made By Mostafa_Khaled", "from math import *\r\ndef a(x1,y1,x2,y2,x3,y3,x4,y4):\r\n b=sorted([[x1,y1],[x2,y2],[x3,y3],[x4,y4]])\r\n x1,y1=b[0]\r\n x2,y2=b[1]\r\n x3,y3=b[2]\r\n x4,y4=b[3]\r\n a1=sqrt((x1-x2)**2+(y1-y2)**2)\r\n a2=sqrt((x4-x2)**2+(y4-y2)**2)\r\n a3=sqrt((x4-x3)**2+(y4-y3)**2)\r\n a4=sqrt((x1-x3)**2+(y1-y3)**2)\r\n return a1==a2==a3==a4 and a1!=0 and a4!=0 and abs(abs(degrees(asin((y2-y1)/a1)-asin((y3-y1)/a4)))-90)<=10**(-8)\r\ndef b(x1,y1,x2,y2,x3,y3,x4,y4):\r\n b=sorted([[x1,y1],[x2,y2],[x3,y3],[x4,y4]])\r\n x1,y1=b[0]\r\n x2,y2=b[1]\r\n x3,y3=b[2]\r\n x4,y4=b[3]\r\n a1=sqrt((x1-x2)**2+(y1-y2)**2)\r\n a2=sqrt((x4-x2)**2+(y4-y2)**2)\r\n a3=sqrt((x4-x3)**2+(y4-y3)**2)\r\n a4=sqrt((x1-x3)**2+(y1-y3)**2)\r\n return a1==a3 and a2==a4 and a1!=0 and a4!=0 and abs(abs(degrees(asin((y2-y1)/a1)-asin((y3-y1)/a4)))-90)<=10**(-8)\r\nc=[list(map(int,input().split())) for i in range(8)]\r\nz=False\r\nfor i in range(5):\r\n for j in range(i+1,6):\r\n for k in range(j+1,7):\r\n for l in range(k+1,8):\r\n if a(*c[i]+c[j]+c[k]+c[l]):\r\n d=[]\r\n e=[]\r\n for m in range(8):\r\n if m not in [i,j,k,l]:\r\n d+=c[m]\r\n e.append(m+1)\r\n if b(*d):\r\n print('YES')\r\n print(i+1,j+1,k+1,l+1)\r\n print(*e)\r\n z=True\r\n break\r\n if z:\r\n break\r\n if z:\r\n break\r\n if z:\r\n break\r\nif not(z):\r\n print('NO')", "class vector(tuple):\r\n def __add__(s,o): return vector((s[0]+o[0],s[1]+o[1]))\r\n def __sub__(s,o): return vector((s[0]-o[0],s[1]-o[1]))\r\n def __mul__(s,o): return s[0]*o[0] + s[1]*o[1]\r\n def __truediv__(s,k): return vector((s[0]/k , s[1]/k) )\r\n def __abs__(s): return s[0]*s[0] + s[1]*s[1]\r\n\r\npoints = []\r\n\r\nfor i in range(8): points.append(vector(map(int,input().strip().split())))\r\n\r\nfrom itertools import permutations\r\n\r\npartn = permutations(range(8))\r\n\r\ndef isrect(rec):\r\n a,b,c,d = [points[i] for i in rec]\r\n # if rec == (0,2,1,3):\r\n # print(a,b,c,d,(a-b)*(c-b), a+c,b+d)\r\n return ((a-b)*(c-b) == 0) and (a+c == b+d)\r\n\r\ndef issqr(sqr):\r\n a,b,c,d = [points[i] for i in sqr]\r\n return isrect(sqr) and abs(a-b) == abs(b-c)\r\n \r\n\r\ndef check(p):\r\n sqr = p[:4]\r\n rec = p[4:]\r\n return issqr(sqr) and isrect(rec)\r\n \r\n\r\nfor i in partn:\r\n if check(i):\r\n print(\"YES\")\r\n for j in i[:4]: print(j+1,end=' ')\r\n print()\r\n for j in i[4:]: print(j+1,end=' ')\r\n print()\r\n exit(0)\r\nprint(\"NO\")" ]

[ "from collections import deque\r\n\r\n\r\nn,m=map(int,input().split())\r\ngraph=[[] for _ 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 graph[a].append(b)\r\n graph[b].append(a)\r\nd=[[-1]*n for _ in range(n)]\r\nfor i in range(n):\r\n q=deque()\r\n q.append(i)\r\n d[i][i]=0\r\n while q:\r\n node=q.popleft()\r\n for j in range(len(graph[node])):\r\n to=graph[node][j]\r\n if d[i][to]==-1:\r\n d[i][to]=d[i][node]+1\r\n q.append(to)\r\na,b,c=map(int,input().split())\r\no,e,f=map(int,input().split())\r\na-=1\r\nb-=1\r\ne-=1\r\no-=1\r\nans=m+1\r\nfor _ in range(2):\r\n a,b=b,a\r\n for i in range(n):\r\n for j in range(n):\r\n v=[d[a][i]+d[i][j]+d[j][b],d[o][i]+d[i][j]+d[j][e]]\r\n if v[0]<=c and v[1]<=f:\r\n ans=min(ans,v[0]+v[1]-d[i][j])\r\nif d[a][b]<=c and d[o][e]<=f:\r\n ans=min(ans,d[a][b]+d[o][e])\r\nif ans>m:\r\n print(-1)\r\nelse :\r\n ans=m-ans\r\n print(ans)" ]

[ "from sys import stdout, stdin, setrecursionlimit\nfrom io import BytesIO, IOBase\nfrom collections import *\nfrom itertools import *\nfrom random import * \nfrom bisect import *\nfrom string import *\nfrom queue import *\nfrom heapq import *\nfrom math import *\nfrom re import *\nfrom os import *\n\n####################################---fast-input-output----#########################################\n\n\nclass FastIO(IOBase):\n newlines = 0\n\n def __init__(self, file):\n self._fd = file.fileno()\n self.buffer = BytesIO()\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\n self.write = self.buffer.write if self.writable else None\n\n def read(self):\n while True:\n b = read(self._fd, max(fstat(self._fd).st_size, 8192))\n if not b:\n break\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines = 0\n return self.buffer.read()\n\n def readline(self):\n while self.newlines == 0:\n b = read(self._fd, max(fstat(self._fd).st_size, 8192))\n self.newlines = b.count(b\"\\n\") + (not b)\n ptr = self.buffer.tell()\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n self.newlines -= 1\n return self.buffer.readline()\n\n def flush(self):\n if self.writable:\n write(self._fd, self.buffer.getvalue())\n self.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n def __init__(self, file):\n self.buffer = FastIO(file)\n self.flush = self.buffer.flush\n self.writable = self.buffer.writable\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n self.read = lambda: self.buffer.read().decode(\"ascii\")\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\nstdin, stdout = IOWrapper(stdin), IOWrapper(stdout)\ngraph, mod, szzz = {}, 10**9 + 7, lambda: sorted(zzz())\ndef getStr(): return input()\ndef getInt(): return int(input())\ndef listStr(): return list(input())\ndef getStrs(): return input().split()\ndef isInt(s): return '0' <= s[0] <= '9'\ndef input(): return stdin.readline().strip()\ndef zzz(): return [int(i) for i in input().split()]\ndef output(answer, end='\\n'): stdout.write(str(answer) + end)\ndef lcd(xnum1, xnum2): return (xnum1 * xnum2 // gcd(xnum1, xnum2))\n\n\ndx = [-1, 1, 0, 0, 1, -1, 1, -1]\ndy = [0, 0, 1, -1, 1, -1, -1, 1]\ndaysInMounth = [31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31]\n\n\n#################################################---Some Rule For Me To Follow---#################################\n\"\"\"\n --instants of Reading problem continuously try to understand them.\n\n --If you Know some-one , Then you probably don't know him !\n\n --Try & again try, maybe you're just one statement away!\n\n\n\"\"\"\n##################################################---START-CODING---###############################################\n\n\n\n\n# s = input().strip()\n\n# n = len(s)\n\n# class segTree:\n# def __init__(self):\n# self.a = [0]*(2*n)\n# self.b = [0]*(2*n)\n# self.c = [0]*(2*n)\n \n# def build(self, arr):\n# for i in range(n):\n# self.a[i+n] = 0\n# self.b[i+n] = 1 if arr[i] == '(' else 0\n# self.c[i+n] = 1 if arr[i] == ')' else 0\n# for i in range(n-1,0,-1):\n# to_match = min(self.b[i << 1],self.c[i << 1 | 1])\n# self.a[i] = self.a[i << 1] + self.a[i << 1 | 1] + 2*to_match\n# self.b[i] = self.b[i << 1] + self.b[i << 1 | 1] - to_match\n# self.c[i] = self.c[i << 1] + self.c[i << 1 | 1] - to_match\n# def query(self, l, r): \n# left = []\n# right = []\n# l += n \n# r += n \n# while l <= r: \n# if (l & 1): \n# left.append((self.a[l],self.b[l],self.c[l]))\n# l += 1\n# if not (r & 1): \n# right.append((self.a[r],self.b[r],self.c[r]))\n# r -= 1 \n# l >>= 1 \n# r >>= 1\n# a1 = b1 = c1 = 0\n# for a2, b2, c2 in left + right[::-1]:\n# to_match = min(b1,c2)\n# a1 += a2 + 2*to_match\n# b1 += b2 - to_match\n# c1 += c2 - to_match\n# return a1\n# tree = segTree()\n# tree.build(s)\n# for m in range(getInt()):\n# l, r = zzz()\n# l -= 1\n# r -= 1\n# print(tree.query(l,r))\n \nfrom bisect import bisect_left\nm = getInt()\nt, s = [getStrs() for i in range(m)], [0] * m\nl, n = 0, int(input())\nfor j, i in enumerate(t):\n l += 1 if i[0] == '1' else int(i[1]) * int(i[2])\n t[j], s[j] = l, i[1] if i[0] == '1' else int(i[1])\nF = {}\ndef f(i):\n if not i in F:\n k = bisect_left(t, i)\n F[i] = s[k] if type(s[k]) == str else f((i - t[k] - 1) % s[k] + 1)\n return F[i]\nprint(' '.join(f(i) for i in zzz()))", "from bisect import bisect_left\nm = int(input())\nt, s = [input().split() for i in range(m)], [0] * m\nl, n = 0, int(input())\nfor j, i in enumerate(t):\n l += 1 if i[0] == '1' else int(i[1]) * int(i[2])\n t[j], s[j] = l, i[1] if i[0] == '1' else int(i[1])\nF = {}\ndef f(i):\n if not i in F:\n k = bisect_left(t, i)\n F[i] = s[k] if type(s[k]) == str else f((i - t[k] - 1) % s[k] + 1)\n return F[i]\nprint(' '.join(f(i) for i in map(int, input().split())))", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\nn = int(input())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\nq = []\r\nc = 0\r\nfor i in range(n):\r\n if g[i][0] == 1:\r\n c += 1\r\n q.append(c)\r\n else:\r\n c += g[i][1]*g[i][2]\r\n q.append(c)\r\ninput()\r\nfor i in map(int, input().split()):\r\n while 1:\r\n a = bisect(q, i)\r\n if q[a-1] == i:\r\n a -= 1\r\n if g[a][0] == 1:\r\n print(g[a][1], end=' ')\r\n break\r\n else:\r\n i %= q[a-1]\r\n if i == 0:\r\n i = q[a-1]\r\n i %= g[a][1]\r\n if i == 0:\r\n i = g[a][1]\r\n" ]

[ "n=int(input())\r\narr=list(map(int,input().split()))\r\ngap=n//2\r\ncount =0\r\nwhile gap >=1:\r\n for j in range(gap ,n):\r\n i= j-gap\r\n while i >=0:\r\n if arr[i +gap] >arr[i]:\r\n break\r\n else:\r\n arr[i +gap],arr[i] =arr[i] ,arr[i +gap]\r\n count +=1\r\n i-=gap\r\n gap//=2\r\nif count % 2== 3*n %2:\r\n print(\"Petr\")\r\nelse:\r\n print(\"Um_nik\")", "n=int(input())\r\na=[0]+list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,len(a)):\r\n if a[i]==-1:\r\n continue\r\n j=i\r\n while a[j]!=-1:\r\n prev=j\r\n j=a[j]\r\n a[prev]=-1\r\n ans+=1\r\nif n%2==0:\r\n #n even ans also even even number of swaps required\r\n #3*n \r\n if ans%2==0:\r\n print(\"Petr\")\r\n else:\r\n print(\"Um_nik\")\r\nelse:\r\n #n us odd ans is even odd number of swaps required\r\n if ans%2==0:\r\n print(\"Petr\")\r\n else:\r\n print(\"Um_nik\")", "n = int(input())\r\na = [int(x) - 1 for x in input().split()]\r\n\r\nans = 0\r\nfor i in range(n):\r\n if a[i] == -1:\r\n continue\r\n ans ^= 1\r\n x = i\r\n while x != -1:\r\n y = a[x]\r\n a[x] = -1\r\n x = y\r\n\r\nif ans:\r\n print(\"Um_nik\")\r\nelse:\r\n print(\"Petr\")", "# Binary Indexed Tree (Fenwick Tree)\nclass BIT():\n def __init__(self, n):\n self.n = n\n self.bit = [0] * (n + 1)\n\n def add(self, i, val):\n i = i + 1\n while i <= self.n:\n self.bit[i] += val\n i += i & -i\n\n def _sum(self, i):\n s = 0\n while i > 0:\n s += self.bit[i]\n i -= i & -i\n return s\n\n def sum(self, i, j):\n return self._sum(j) - self._sum(i)\n\n\nn = int(input())\na = list(map(int, input().split()))\nbit = BIT(n)\n\nans = 0\nfor i in range(len(a)):\n bit.add(a[i] - 1, 1)\n ans += bit.sum(a[i], n)\n\nif ans % 2 == n % 2:\n print(\"Petr\")\nelse:\n print(\"Um_nik\")\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=[el-1 for el in arr]\r\nans=0\r\nfor i in range(n):\r\n if arr[i]==-1:\r\n continue\r\n ans^=1\r\n x=i\r\n while x!=-1:\r\n y=arr[x]\r\n arr[x]=-1\r\n x=y\r\nif ans:\r\n print(\"Um_nik\")\r\nelse:\r\n print(\"Petr\")\r\n ", "import random\r\nastr=input()\r\nN=int(astr)\r\ns=input()\r\nsk=s.split(' ')\r\nml=[int(i) for i in sk]\r\nkl=[0 for i in ml]\r\n#for i in range(0, 7*N+2):\r\n# A=random.randint(0,N-1)\r\n# B=A\r\n# while(A==B):\r\n# B=random.randint(0,N-1)\r\n# swap=ml[A]\r\n# ml[A]=ml[B]\r\n# ml[B]=swap\r\n#print(ml)\r\nk=0\r\nfor i in range(0,N):\r\n if kl[i]==0:\r\n kl[i]=1\r\n j=ml[i]\r\n k=k+1\r\n while(kl[j-1]==0):\r\n kl[j-1]=1\r\n j=ml[j-1]\r\n\r\nif k%2==0: print(\"Petr\")\r\nelse: print(\"Um_nik\")\r\n \r\n", "n=int(input())\na=list(map(int,input().split()))\nif sum(a[i]==i+1 for i in range(n))>=n//1000:print(\"Petr\")\nelse:print(\"Um_nik\")\n\n\n\n# Made By Mostafa_Khaled\n \t\t\t \t \t \t\t \t \t\t \t \t", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\n\r\np = [int(x)-1 for x in stdin.readline().split()]\r\n\r\nvisited = [False for x in range(n)]\r\n\r\nloops = []\r\n\r\nfor x in range(n):\r\n if not visited[x]:\r\n visited[x] = True\r\n start = x\r\n l = [x]\r\n cur = p[x]\r\n while cur != start:\r\n visited[cur] = True\r\n l.append(cur)\r\n cur = p[cur]\r\n loops.append(len(l)-1)\r\n\r\n\r\ntot = sum(loops)\r\n\r\nif n % 2 == 1:\r\n if tot % 2 == 1:\r\n print('Petr')\r\n else:\r\n print('Um_nik')\r\nelse:\r\n if tot % 2 == 0:\r\n print('Petr')\r\n else:\r\n print('Um_nik')\r\n", "print(('Um_nik', 'Petr')[int(input()) // 1000 <= sum(i == x for i, x in enumerate(map(int, input().split()), 1))])", "import sys\r\nf = lambda s: int(s)-1\r\n\r\nn = int(input())\r\nb = [0]*(n+1)\r\ndef update(bit,idx,val):\r\n idx += 1\r\n while idx < n+1:\r\n bit[idx] += val\r\n idx += idx&(-idx)\r\ndef getSum(bit,idx):\r\n idx += 1\r\n ans = 0\r\n while idx > 0:\r\n ans += bit[idx]\r\n idx -= idx&(-idx)\r\n return ans\r\n\r\na = list(map(f,input().split()))\r\np = 0\r\nfor i in range(n):\r\n s = getSum(b,a[i]-1)\r\n p += (i+1)-s\r\n update(b,a[i],1)\r\nif p%2 == 0:\r\n print(\"Petr\")\r\nelse:\r\n print(\"Um_nik\")\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nc = 1\r\nans = 0\r\nvis = [0] * 1000005\r\nfor i in range(n):\r\n p = i\r\n vis[i + 1] = 1\r\n while vis[l[p]] != 1:\r\n ans -= -1\r\n vis[l[p]] = 1\r\n p = l[p] - 1\r\nif 3 * n % 2 == ans % 2: print(\"Petr\")\r\nelse: print(\"Um_nik\")", "import random\r\nn = int(input())\r\na = list(map(int,input().split(' ')))\r\nc = 0 \r\nfor i in range(1,n+1):\r\n if a[i-1]==i:\r\n c += 1\r\n\r\nif c >= n//1000:\r\n print(\"Petr\")\r\nelse:\r\n print(\"Um_nik\")\r\n", "input()\r\na=list(map(int,input().split()))\r\nn=len(a)\r\nu=n\r\nfor i in range(n):\r\n\tj=i\r\n\tk=0\r\n\twhile a[j]>0:\r\n\t\tk+=1\r\n\t\tt=j\r\n\t\tj=a[j]-1\r\n\t\ta[t]=0\r\n\tif k>0:\r\n\t\tu+=1-k%2\r\ns='Petr'\r\nif u%2>0:\r\n\ts='Um_nik'\r\nprint(s)\r\n" ]

[ "from math import inf\nimport sys\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\nfast_print = lambda p: sys.stdout.write(str(p) + \"\\n\") \n\nn, m = [int(component) for component in input().split(\" \")]\nd = [int(component) for component in input().split(\" \")]\nh = [int(component) for component in input().split(\" \")]\n\n### prefix work\n\ndef get_prefix_sums(arr):\n prefix = [0] * (len(arr)+1)\n for index in range(1,len(arr)+1):\n prefix[index] = prefix[index-1] + arr[index-1]\n return prefix\n\nprefix = get_prefix_sums(d)\ndef get_dist(l, r):\n # print(f\" called with {(l, r)}\")\n return prefix[r] - prefix[l]\n\ndef merge(s1, s2):\n # print(f\" merge called with {s1} and {s2}\")\n \n if s1 == None:\n return s2\n if s2 == None:\n return s1\n\n # if s1[3] > s2[3]:\n # s1, s2 = s2, s1\n\n # print(f\" reordered: {s1} and {s2}\")\n\n\n llbm, lrbm, lism, ll, lr = s1\n rlbm, rrbm, rism, rl, rr = s2\n\n nlbm = max(llbm, get_dist(ll, rl) + rlbm)\n nrbm = max(lrbm + get_dist(lr, rr), rrbm)\n nism = max(lism, lrbm + get_dist(lr, rl) + rlbm, rism)\n return nlbm, nrbm, nism, ll, rr\n\ndef make_segment_tree(d, h):\n N = len(d)\n size = 1 << (N-1).bit_length()\n tree = [None] * (2*size)\n for k in range(N):\n tree[size+k] = (2*h[k], 2*h[k], -inf, k, k)\n for k in range(size-1,0,-1):\n tree[k] = merge(tree[2*k], tree[2*k+1])\n return tree\n\ndef range_query(tree, l, r):\n # print(f\"\\nrange_query received {(l, r)}\")\n lres = None\n rres = None\n\n l += len(tree) >> 1\n r += (len(tree) >> 1) + 1\n while l < r:\n if l & 1:\n # print(f\" l & 1\")\n \n lres = merge(lres, tree[l])\n # print(f\" now lres = {lres}\")\n l += 1\n if r & 1:\n # print(f\" r & 1\")\n\n r -= 1\n rres = merge(tree[r], rres)\n # print(f\" now rres = {rres}\")\n\n l >>= 1\n r >>= 1\n res = merge(lres, rres)\n # print(f\" final res = {res}\")\n return res\n\ntree = make_segment_tree(d, h)\n\n# print()\n# print(tree)\n\ndef complex_query(l, r):\n # print(f\"received {(l, r)}\")\n if l <= r:\n # print(\"l <= r\")\n if l > 0 and r < n-1:\n # print(\"l > 0, r < n-1\")\n llbm, _, lism, _, _ = range_query(tree, 0, l-1)\n # print(f\"llbm = {llbm}, lism = {lism}\")\n _, rrbm, rism, _, _ = range_query(tree, r+1, n-1)\n # print(f\"rrbm = {rrbm}, rism = {rism}\") \n return max(lism, rism, llbm + d[-1] + rrbm)\n elif l == 0:\n # print(\"l == 0\")\n _, _, ism, _, _ = range_query(tree, r+1, n-1)\n return ism\n else:\n # print(f\"r == {n-1}\")\n _, _, ism, _, _ = range_query(tree, 0, l-1)\n return ism\n else:\n _, _, ism, _, _ = range_query(tree, r+1, l-1)\n return ism\n\n# print(m, m, d, h)\nfor _ in range(m):\n a, b = [int(component) for component in input().split(\" \")]\n fast_print(complex_query(a-1, b-1))" ]

[ "def main():\r\n l1, s1, r1, p1 = map(int, input().split())\r\n l2, s2, r2, p2 = map(int, input().split())\r\n l3, s3, r3, p3 = map(int, input().split())\r\n l4, s4, r4, p4 = map(int, input().split())\r\n if p1 == 1:\r\n if s1 == 1 or l1 == 1 or r1 == 1 or s3 == 1 or l2 == 1 or r4 == 1:\r\n return \"YES\"\r\n if p2 == 1:\r\n if s2 == 1 or l2 == 1 or r2 == 1 or s4 == 1 or l3 == 1 or r1 == 1:\r\n return \"YES\"\r\n if p3 == 1:\r\n if s3 == 1 or l3 == 1 or r3 == 1 or s1 == 1 or l4 == 1 or r2 == 1:\r\n return \"YES\"\r\n if p4 == 1:\r\n if s4 == 1 or l4 == 1 or r4 == 1 or s2 == 1 or l1 == 1 or r3 == 1:\r\n return \"YES\"\r\n return \"NO\"\r\nprint(main())", "l, x = [[int(c) for c in input()[::2]] for _ in range(4)], 0\r\nfor i, r in enumerate(l, -3):\r\n x |= r[3] and (any([*r[:3], *[l[i + j][j] for j in range(3)]]))\r\nprint((\"NO\", \"YES\")[x])", "drgs = []\r\nfor i in range(4):\r\n\tdrgs.append([int(i) for i in input().split()])\r\n\r\nok = 1\r\nfor i in range(4):\r\n\tcur = drgs[i]\r\n\tfor j in range(3):\r\n\t\tif cur[j]:\r\n\t\t\tif cur[3] or drgs[(3+i-j)%4][3]:\r\n\t\t\t\tok = 0\r\n\t\t\t\tbreak\r\n\tif not ok: break\r\nif ok:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "r1 = list(map(int,input().split()))\r\nr2 = list(map(int,input().split()))\r\nr3 = list(map(int,input().split()))\r\nr4 = list(map(int,input().split()))\r\n\r\nif sum(r1[:3]) > 0 and r1[3] ==1 :\r\n print('YES')\r\nelif sum(r2[:3]) > 0 and r2[3] ==1:\r\n print('YES')\r\nelif sum(r3[:3]) > 0 and r3[3] ==1:\r\n print('YES')\r\nelif sum(r4[:3]) > 0 and r4[3] ==1:\r\n print('YES')\r\nelse:\r\n if (r1[0] == 1 and r4[3] == 1) or (r1[1] == 1 and r3[3] == 1) or (r1[2] == 1 and r2[3] == 1):\r\n print('YES')\r\n elif (r2[0] == 1 and r1[3] == 1) or (r2[1] == 1 and r4[3] == 1) or (r2[2] == 1 and r3[3] == 1):\r\n print('YES')\r\n elif (r3[0] == 1 and r2[3] == 1) or (r3[1] == 1 and r1[3] == 1) or (r3[2] == 1 and r4[3] == 1):\r\n print('YES')\r\n elif (r4[0] == 1 and r3[3] == 1) or (r4[1] == 1 and r2[3] == 1) or (r4[2] == 1 and r1[3] == 1):\r\n print('YES')\r\n else:\r\n print('NO')", "list2=[]\r\nfor i in range(4):\r\n list1=list(map(int,input().strip().split(' ')))\r\n list2.append(list1)\r\nif list2[0][3]==1:\r\n if list2[1][0]==1 or list2[2][1]==1 or list2[3][2]==1 or list2[0][1]==1 or list2[0][2]==1 or list2[0][0]==1:\r\n print(\"YES\")\r\n exit()\r\nif list2[1][3]==1:\r\n if list2[0][2]==1 or list2[2][0]==1 or list2[3][1]==1 or list2[1][1]==1 or list2[1][2]==1 or list2[1][0]==1:\r\n print(\"YES\")\r\n exit()\r\nif list2[2][3]==1:\r\n if list2[0][1]==1 or list2[1][2]==1 or list2[3][0]==1 or list2[2][1]==1 or list2[2][2]==1 or list2[2][0]==1:\r\n print(\"YES\")\r\n exit()\r\nif list2[3][3]==1:\r\n if list2[0][0]==1 or list2[1][1]==1 or list2[2][2]==1 or list2[3][1]==1 or list2[3][2]==1 or list2[3][0]==1:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "m = [list(map(int, input().split())) for _ in range(4)]\n\ndef acc(i):\n l = m[i][0] and (m[i][3] or m[i - 1][3])\n s = m[i][1] and (m[i][3] or m[i - 2][3])\n r = m[i][2] and (m[i][3] or m[i - 3][3])\n return any([l, s, r])\n\nprint('YES' if any(acc(i) for i in range(4)) else 'NO')\n", "l1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=list(map(int,input().split()))\r\nl4=list(map(int,input().split()))\r\nflag=False\r\nif(l1[3]==1):\r\n if(l1.count(1)>1 or l2[0]==1 or l3[1]==1 or l4[2]==1):\r\n flag=True\r\nif(l2[3]==1):\r\n if(l1[2]==1 or l2.count(1)>1 or l4[1]==1 or l3[0]==1):\r\n flag=True\r\nif(l3[3]==1):\r\n if(l1[1]==1 or l2[2]==1 or l3.count(1)>1 or l4[0]==1):\r\n flag=True\r\nif(l4[3]==1):\r\n if(l1[0]==1 or l2[1]==1 or l3[2]==1 or l4.count(1)>1):\r\n flag=True\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "\r\nans = False\r\nparts = [[bool(int(x)) for x in input().split()] for j in range(4)]\r\n\r\nfor index, part in enumerate(parts):\r\n l, s, r, p = part\r\n\r\n if (l or s or r) and p:\r\n ans = True\r\n\r\n if p:\r\n for i in range(3):\r\n next_part = parts[(index + i + 1) % 4]\r\n if next_part[i]:\r\n ans = True\r\n\r\nprint('YES' if ans else 'NO')\r\n\r\n", "def editor():\r\n\timport sys\r\n\tsys.stdin=open(\"input.txt\",'r')\r\n\tsys.stdout=open(\"output.txt\",'w')\r\n\r\ndef solve():\r\n\tm=[[int(i) for i in input().split()] for j in range(4)]\r\n\t# print(m)\r\n\tacc=False\r\n\tfor i in range(4):\r\n\t\tif m[i][3]==1:\r\n\t\t\tfor j in range(3):\r\n\t\t\t\tif m[i][j]==1:\r\n\t\t\t\t\tacc=True\r\n\t\t\t\t\t# print(1)\r\n\t\t\t\t\tbreak\r\n\t\t\tif acc is True:break\r\n\t\t\t# for j in range(4):\r\n\t\t\tif m[(i+2)%4][1]==1: # opposite lane should not have straight go\r\n\t\t\t\t# print(2)\r\n\t\t\t\tacc=True\r\n\t\t\t\tbreak\r\n\t\t\telif m[(i+3)%4][2]==1:\r\n\t\t\t\t# print(i,j,3)\r\n\t\t\t\tacc=True\r\n\t\t\t\tbreak\r\n\t\t\telif m[(i+1)%4][0]==1:\r\n\t\t\t\t# print(4)\r\n\t\t\t\tacc=True\r\n\t\t\t\tbreak\r\n\r\n\tif acc is True: print(\"YES\")\r\n\telse: print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n\t# editor()\r\n\tsolve()", "l = []\r\nfor i in range(4):\r\n l.append(list(map(int, input().split())))\r\n\r\ndef go():\r\n for i in range(4):\r\n if l[i][3] and (l[(i + 1) % 4][0] or l[(i + 3) % 4][2] or l[(i + 2) % 4][1] or l[i][0] or l[i][1] or l[i][2]):\r\n return False\r\n return True\r\n\r\nif go():\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "rows = [list(map(int, input().split())) for x in range(4)]\r\nturns = [[0, 1, 2], [0], [1], [2]]\r\nresults = \"NO\"\r\nfor x in range(4):\r\n if rows[x][3]:\r\n for y in range(4):\r\n for z in turns[y]:\r\n if rows[y][z]:\r\n results = \"YES\"\r\n break\r\n if results == \"YES\":\r\n break\r\n turns.insert(0, turns[-1])\r\n del turns[-1]\r\nprint(results)", "l1, s1, r1, p1 = list(map(int, input().split()))\r\nl2, s2, r2, p2 = list(map(int, input().split()))\r\nl3, s3, r3, p3 = list(map(int, input().split()))\r\nl4, s4, r4, p4 = list(map(int, input().split()))\r\nif p1 and any([l2, s3, r4, l1, s1, r1]):\r\n print('Yes')\r\n exit()\r\nif p2 and any([l3, s4, r1, l2, s2, r2]):\r\n print('Yes')\r\n exit()\r\nif p3 and any([l4, s1, r2, l3, s3, r3]):\r\n print('Yes')\r\n exit()\r\nif p4 and any([l1, s2, r3, l4, s4, r4]):\r\n print('Yes')\r\n exit()\r\nprint('No')\r\n", "L = [list(map(int, input().split())) for _ in range(4)]\nfor i in range(4):\n p = L[i][3]\n if p == 1:\n if i == 0:\n if L[0][0] == 1 or L[0][1] == 1 or L[0][2] == 1 or L[1][0] == 1 or L[2][1] == 1 or L[3][2] == 1:\n print(\"YES\")\n exit()\n elif i == 1:\n if L[0][2] == 1 or L[1][0] == 1 or L[1][1] == 1 or L[1][2] == 1 or L[2][0] == 1 or L[3][1] == 1:\n print(\"YES\")\n exit()\n elif i == 2:\n if L[0][1] == 1 or L[1][2] == 1 or L[2][0] == 1 or L[2][1] == 1 or L[2][2] == 1 or L[3][0] == 1:\n print(\"YES\")\n exit()\n else:\n if L[0][0] == 1 or L[1][1] == 1 or L[2][2] == 1 or L[3][0] == 1 or L[3][1] == 1 or L[3][2] == 1:\n print(\"YES\")\n exit()\nprint(\"NO\")\n", "def main():\r\n a = []\r\n for i in range(4):\r\n a.append(tuple(map(int, input().split())))\r\n\r\n car = [0] * 4\r\n\r\n for i, (l, s, r, p) in enumerate(a):\r\n\r\n car[i] += l\r\n car[(i - 1) % 4] += l\r\n\r\n car[i] += r\r\n car[(i + 1) % 4] += r\r\n\r\n car[i] += s\r\n car[(i + 2) % 4] += s\r\n\r\n for i in range(4):\r\n if car[i] > 0 and a[i][3] == 1:\r\n print(\"YES\")\r\n return\r\n\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "lights = []\n\nfor i in range(4):\t\n\ttemp = input().split()\n\tlights.append(temp)\n\nans = 0\nfor i in range(4):\n\tif lights[i][3] == '1':\n\t\tif '1' in lights[i][:3]:\n\t\t\tans = 1\n\t\t\tbreak\n\t\telif lights[(i+1)%4][0] != '0' or lights[(i+2)%4][1] != '0' or lights[(i+3)%4][2] != '0':\n\t\t\tans = 1\n\t\t\tbreak\n\nif ans:\n\tprint (\"YES\")\nelse:\n\tprint (\"NO\")", "import sys\r\n\r\nl1,s1,r1,p1 = map(int,input().split())\r\nl2,s2,r2,p2 = map(int,input().split())\r\nl3,s3,r3,p3 = map(int,input().split())\r\nl4,s4,r4,p4 = map(int,input().split())\r\n\r\nyes = 0\r\nif(p1 == 1):\r\n if(l1 == 1 or s1 == 1 or r1 == 1 or l2 == 1 or s3 == 1 or r4 == 1 ):\r\n yes = 1\r\nif(p2 == 1):\r\n if(r1 == 1 or l2 == 1 or s2 == 1 or r2 == 1 or l3 == 1 or s4 == 1 ):\r\n yes = 1\r\nif(p3 == 1):\r\n if( s1 == 1 or r2 == 1 or l3 == 1 or s3 == 1 or r3 == 1 or l4 == 1 ):\r\n yes = 1\r\nif(p4 == 1):\r\n if( l1 == 1 or s2 == 1 or r3 == 1 or l4 == 1 or s4 == 1 or r4 == 1 ):\r\n yes = 1\r\nif( yes == 1 ):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "read = lambda: map(int, input().split())\r\na = [list(read()) for i in range(4)]\r\nfor i in range(4):\r\n if a[i][3] and (sum(a[i][:3]) or sum(a[(i + j + 1) % 4][j] for j in range(3))):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "l1,s1,r1,p1 = map(int, input().split())\r\nl2,s2,r2,p2 = map(int, input().split())\r\nl3,s3,r3,p3 = map(int, input().split())\r\nl4,s4,r4,p4 = map(int, input().split())\r\ne = 0\r\nif(p1 == 1):\r\n if(l1 == 1 or s1 == 1 or r1 == 1 or l2 == 1 or s3 == 1 or r4 == 1):\r\n e = 1\r\n \r\nif(p2 == 1):\r\n if(l2 == 1 or s2 == 1 or r2 == 1 or l3 == 1 or s4 == 1 or r1 == 1):\r\n e = 1\r\n\r\n \r\nif(p3 == 1):\r\n if(l3 == 1 or s3 == 1 or r3 == 1 or s1 == 1 or r2 == 1 or l4 == 1):\r\n e = 1\r\n \r\nif(p4 == 1):\r\n if(l4 == 1 or s4 == 1 or r4 == 1 or l1 == 1 or s2 == 1 or r3 == 1):\r\n e = 1\r\n \r\nif(e == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "def booly(s):\n return bool(int(s))\n\na = [None]*4;\na[0] = list(map(booly, input().split()))\na[1] = list(map(booly, input().split()))\na[2] = list(map(booly, input().split()))\na[3] =list( map(booly, input().split()))\n\nacc = False\n\nfor i in range(4):\n if (a[i][3] and (a[i][0] or a[i][1] or a[i][2])):\n acc = True\n\n if (a[i][3] and a[(i+1)%4][0]):\n acc = True\n \n if (a[i][3] and a[(i-1)%4][2]):\n acc = True\n\n if (a[i][3] and a[(i+2)%4][1]):\n acc = True\n\nif acc:\n print(\"YES\");\nelse:\n print(\"NO\");\n", "import sys\n\na = [[int(x) for x in input().split()] for _ in range(4)]\n\nif a[0][3] and (a[1][0] or a[2][1] or a[3][2]):\n print(\"YES\")\nelif a[1][3] and (a[2][0] or a[3][1] or a[0][2]):\n print(\"YES\")\nelif a[2][3] and (a[3][0] or a[0][1] or a[1][2]):\n print(\"YES\")\nelif a[3][3] and (a[0][0] or a[1][1] or a[2][2]):\n print(\"YES\")\nelse:\n for i in range(4):\n if a[i][3] and (a[i][0] or a[i][1] or a[i][2]):\n print(\"YES\")\n sys.exit(0)\n print(\"NO\")\n", "# Author : Anjone\r\n# Time ：2017-6-2 13:44\r\n# URL : http://codeforces.com/contest/812/problem/A\r\n\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nd = list(map(int,input().split()))\r\nans = \"NO\";\r\nif a[3]:\r\n\tif a[0]+a[1]+a[2]+b[0]+c[1]+d[2] > 0 :\r\n\t\tans = \"YES\"\r\nif b[3]:\r\n\tif b[0]+b[1]+b[2]+c[0]+d[1]+a[2] > 0 :\r\n\t\tans = \"YES\"\r\nif c[3]:\r\n\tif c[0]+c[1]+c[2]+d[0]+a[1]+b[2] > 0 :\r\n\t\tans = \"YES\"\r\nif d[3]:\r\n\tif d[0]+d[1]+d[2]+a[0]+b[1]+c[2] > 0 :\r\n\t\tans = \"YES\"\r\nprint( ans )", "l, s, r, p = [None] * 5, [None] * 5, [None] * 5, [None] * 5\nl[1], s[1], r[1], p[1] = map(int, input().split())\nl[2], s[2], r[2], p[2] = map(int, input().split())\nl[3], s[3], r[3], p[3] = map(int, input().split())\nl[4], s[4], r[4], p[4] = map(int, input().split())\n\nif l[1] and p[4] or s[1] and p[3] or r[1] and p[2] or (l[1] or s[1] or r[1]) and p[1]:\n print('YES')\n exit(0)\nif l[2] and p[1] or s[2] and p[4] or r[2] and p[3] or (l[2] or s[2] or r[2]) and p[2]:\n print('YES')\n exit(0)\nif l[3] and p[2] or s[3] and p[1] or r[3] and p[4] or (l[3] or s[3] or r[3]) and p[3]:\n print('YES')\n exit(0)\nif l[4] and p[3] or s[4] and p[2] or r[4] and p[1] or (l[4] or s[4] or r[4]) and p[4]:\n print('YES')\n exit(0)\n\nprint('NO')\n\n", "l1,s1,r1,p1=map(int,input().split())\r\nl2,s2,r2,p2=map(int,input().split())\r\nl3,s3,r3,p3=map(int,input().split())\r\nl4,s4,r4,p4=map(int,input().split())\r\n\r\nif(r1==1and p2==1) or (r2==1 and p3==1) or (r3==1 and p4==1)or (r4==1 and p1==1):\r\n print (\"YES\")\r\nelif (s1==1 and p3==1) or (s2==1 and p4==1) or(s4==1 and p2==1)or(s3==1 and p1==1):\r\n print (\"YES\")\r\nelif (l1==1and p4==1)or(l4==1 and p3==1)or(l3==1and p2==1)or(l2==1 and p1==1):\r\n print (\"YES\")\r\nelif (l1==1 or s1==1 or r1==1) and (p1==1):\r\n print (\"YES\")\r\nelif (l2==1 or s2==1 or r2==1) and (p2==1):\r\n print (\"YES\")\r\nelif (l3==1 or s3==1 or r3==1) and (p3==1):\r\n print (\"YES\")\r\nelif (l4==1 or s4==1 or r4==1) and (p4==1):\r\n print (\"YES\")\r\nelse:\r\n print (\"NO\")\r\n ", "'''\r\nimport sys\r\ndata = sys.stdin.readlines()\r\n'''\r\n\r\naccident = False\r\nimport fileinput\r\narray=[]\r\nfor line in fileinput.input():\r\n array.append([int(x) for x in line.split()])\r\nfor i in range(4,7):\r\n array.append(array[i-4])\r\nfor i in range(0,4):\r\n if array[i][3]==1 and (array[i][0]==1 or array[i][1] ==1 or array[i][2] ==1):\r\n accident=True\r\n if array[i][3]==1 and (array[i+3][2] ==1 or array [i+2][1] == 1 or array[i+1][0] == 1):\r\n accident = True\r\n'''\r\nwhile accident == False:\r\n for i in range(0,3):\r\n for j in range(2):\r\n if array[i][3] == 1 and array[i][j] == 1:\r\n accident = True \r\n if array[i][3] == 1 and array[i+3][2] == 1:\r\n accident = True \r\n if array[i][3] == 1 and array[i+2][1] == 1:\r\n accident = True \r\n if array[i][3] == 1 and array[i+1][0] == 1:\r\n accident = True\r\n \r\n break\r\n '''\r\nif accident:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n \r\n", "a=[]\r\nfor i in range(4):\r\n a.append(input().replace(\" \",\"\"))\r\nfor i in range(4):\r\n if a[i][3]=='1' and a[i][:3].count('1')>0:\r\n print(\"YES\")\r\n exit()\r\nfor i in range(4):\r\n if a[i][3] == '1':\r\n for j in range(1,4):\r\n # print((i+j)%4,j-1)\r\n if a[(i+j)%4][j-1]=='1':\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "flag = False\r\n\r\na1 = a2 = a3 = a4 = 0\r\np1 = p2 = p3 = p4 = 0\r\n\r\nl, s, r, p1 = map(int, input().split(' '))\r\na1 = max(a1, l, s, r)\r\na2 = max(a2, r)\r\na3 = max(a3, s)\r\na4 = max(a4, l)\r\n\r\nl, s, r, p2 = map(int, input().split(' '))\r\na2 = max(a2, l, s, r)\r\na3 = max(a3, r)\r\na4 = max(a4, s)\r\na1 = max(a1, l)\r\n\r\nl, s, r, p3 = map(int, input().split(' '))\r\na3 = max(a3, l, s, r)\r\na4 = max(a4, r)\r\na1 = max(a1, s)\r\na2 = max(a2, l)\r\n\r\nl, s, r, p4 = map(int, input().split(' '))\r\na4 = max(a4, l, s, r)\r\na1 = max(a1, r)\r\na2 = max(a2, s)\r\na3 = max(a3, l)\r\n\r\nflag = (a1 and p1) or (a2 and p2) or (a3 and p3) or (a4 and p4)\r\nprint(\"YES\" if flag else \"NO\")", "a = [list(map(int,input().split())) for _ in range(4)]\r\nf = False\r\nfor i in a:\r\n if i[3]:\r\n f = True\r\nif not f:\r\n print(\"NO\")\r\nelse:\r\n p = []\r\n if a[0][3]:\r\n if a[1][0] or a[2][1] or a[3][2] or (not (a[0].count(1) == 1)):\r\n f = False\r\n if a[1][3]:\r\n if a[0][2] or a[2][0] or a[3][1] or (not (a[1].count(1) == 1)):\r\n f = False\r\n if a[2][3]:\r\n if a[0][1] or a[1][2] or a[3][0] or (not (a[2].count(1) == 1)):\r\n f = False\r\n if a[3][3]:\r\n if a[0][0] or a[1][1] or a[2][2] or (not (a[3].count(1) == 1)):\r\n f = False \r\n if f:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n ", "a=[int(x) for x in input().split(\" \")]\r\nb=[int(x) for x in input().split(\" \")]\r\nc=[int(x) for x in input().split(\" \")]\r\nd=[int(x) for x in input().split(\" \")]\r\nif (a[0]==1 or b[1]==1 or c[2]==1 or d[:3].count(1)>0) and d[3]==1:\r\n print(\"YES\")\r\n exit(0)\r\nif (a[1]==1 or b[2]==1 or d[0]==1 or c[:3].count(1)>0) and c[3]==1:\r\n print(\"YES\")\r\n exit(0)\r\nif (a[2]==1 or d[1]==1 or c[0]==1 or b[:3].count(1)>0) and b[3]==1:\r\n print(\"YES\")\r\n exit(0)\r\nif (d[2]==1 or b[0]==1 or c[1]==1 or a[:3].count(1)>0) and a[3]==1:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "road = [list(map(int, input().split())) for i in range(4)]\r\n\r\nfor i in range(4):\r\n if road[i][3] == 1:\r\n if any([road[i][0], road[i][1], road[i][2], road[(i + 1) % 4][0], road[(i + 2) % 4][1], road[(i + 3) % 4][2]]):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "m = []\r\nfor i in range(4):\r\n m.append([int(s) for s in input().split()])\r\nf = False\r\nfor i in m:\r\n if (i[0] == 1 or i[1] == 1 or i[2] == 1) and i[3] == 1:\r\n f = True\r\nif m[0][3] == 1 and (m[1][0] == 1 or m[2][1] == 1 or m[3][2] == 1):\r\n f = True\r\nif m[1][3] == 1 and (m[2][0] == 1 or m[3][1] == 1 or m[0][2] == 1):\r\n f = True\r\nif m[2][3] == 1 and (m[3][0] == 1 or m[0][1] == 1 or m[1][2] == 1):\r\n f = True\r\nif m[3][3] == 1 and (m[0][0] == 1 or m[1][1] == 1 or m[2][2] == 1):\r\n f = True\r\nprint('YES' if f else 'NO')", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 26.01.2018 21:32 |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n# inp = open(\"input.txt\", \"r\"); input = inp.readline; out = open(\"output.txt\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef solution():\r\n l1, s1, r1, p1 = map(int, input().split())\r\n l2, s2, r2, p2 = map(int, input().split())\r\n l3, s3, r3, p3 = map(int, input().split())\r\n l4, s4, r4, p4 = map(int, input().split())\r\n ans = \"NO\"\r\n if p1 == 1 and (p1 == l1 or p1 == s1 or p1 == r1 or p1 == l2 or p1 == s3 or p1 == r4): ans = \"YES\"\r\n elif p2 == 1 and (p2 == l2 or p2 == s2 or p2 == r2 or p2 == l3 or p2 == s4 or p2 == r1): ans = \"YES\"\r\n elif p3 == 1 and (p3 == l3 or p3 == s3 or p3 == r3 or p3 == l4 or p3 == s1 or p3 == r2): ans = \"YES\"\r\n elif p4 == 1 and (p4 == l4 or p4 == s4 or p4 == r4 or p4 == l1 or p4 == s2 or p4 == r3): ans = \"YES\"\r\n print(ans)\r\n\r\n\r\n# ===========================================\r\nwhile TN != 0:\r\n solution()\r\n TN -= 1\r\n# ===========================================\r\n# inp.close()\r\n# out.close()\r\n", "#!/usr/bin/env python3\nimport sys\n\nls = []\nss = []\nrs = []\nps = []\n\nfor __ in range(4):\n l, s, r, p = map(lambda elem: int(elem) == 1, sys.stdin.readline().split())\n ls.append(l)\n ss.append(s)\n rs.append(r)\n ps.append(p)\n\ndef get(ary, indx):\n return ary[indx % 4]\n\naccident = False\n\nfor indx in range(4):\n accident |= (ls[indx] or rs[indx] or ss[indx]) and ps[indx]\n accident |= ls[indx] and get(ps, indx - 1)\n accident |= ss[indx] and get(ps, indx + 2)\n accident |= rs[indx] and get(ps, indx + 1)\n\nif accident:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def solve():\n lights = []\n for i in range(4):\n lights.append(list(map(int, input().split())))\n \n for i in range(len(lights)):\n if lights[i][-1]:\n problematicCandidates = lights[i][:-1] + [lights[(i + x) % 4][x - 1] for x in range(1,4)]\n if any(problematicCandidates):\n return \"YES\"\n \n return \"NO\"\nprint(solve())", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nb=[]\r\nfor i in range(4):\r\n t=input()\r\n a=list(map(int,t.strip().split()))\r\n b.append(a)\r\nflag=0\r\nfor i in range(4):\r\n if b[i][0]==1:\r\n temp=(i+3)%4\r\n if b[temp][3]==1 or b[i][3]==1:\r\n flag=1\r\n break\r\nif b[0][3]==1 or b[2][3]==1:\r\n if b[0][1]==1 or b[2][1]==1:\r\n flag=1\r\nif b[1][3]==1 or b[3][3]==1:\r\n if b[1][1]==1 or b[3][1]==1:\r\n flag=1\r\nfor i in range(4):\r\n if b[i][2]==1:\r\n temp=(i+5)%4\r\n if b[temp][3]==1 or b[i][3]==1:\r\n flag=1\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "liste1 =[int(x) for x in input().split()]\r\nliste2 =[int(x) for x in input().split()]\r\nliste3 =[int(x) for x in input().split()]\r\nliste4 =[int(x) for x in input().split()]\r\nif ((liste1[0]==1 or liste4[2]==1) and (liste1[3]==1 or liste4[3]==1)) or ((liste1[1]==1 or liste3[1]==1) and (liste1[3] == 1 or liste3[3]==1)) or ((liste1[2]==1 or liste2[0]==1) and (liste1[3] == 1 or liste2[3] ==1)) or ((liste2[1]==1 or liste4[1]==1) and (liste2[3] == 1 or liste4[3] == 1)) or ((liste2[2]==1 or liste3[0] ==1) and (liste2[3] ==1 or liste3[3]==1)) or ((liste3[2] == 1 or liste4[0] == 1) and (liste3[3] == 1 or liste4[3] == 1)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "M = [0]*4\nM[0] = list(map(int, input().split()))\nM[1] = list(map(int, input().split()))\nM[2] = list(map(int, input().split()))\nM[3] = list(map(int, input().split()))\n\ndef solve(M):\n ans = 'YES'\n for i in range(4):\n if (M[i][0]+M[i][1]+M[i][2])*M[i][3] != 0:\n return ans\n if M[0][3] == 1:\n if M[1][0] + M[2][1] + M[3][2] > 0:\n return ans\n if M[1][3] == 1:\n if M[0][2] + M[2][0] + M[3][1] > 0:\n\n return ans\n if M[2][3] == 1:\n if M[0][1] + M[1][2] + M[3][0] > 0:\n\n return ans\n if M[3][3] == 1:\n if M[1][1] + M[2][2] + M[0][0] > 0:\n return ans\n \n return 'NO'\n\nans = solve(M)\nprint(ans)", "l1,s1,r1,p1 = map(int, input().split())\r\nl2,s2,r2,p2 = map(int, input().split())\r\nl3,s3,r3,p3 = map(int, input().split())\r\nl4,s4,r4,p4 = map(int, input().split())\r\ndef die():\r\n print(\"YES\")\r\n exit(0)\r\ndef ch1():\r\n if p1 and (r1 or s1 or l1 or l2 or s3 or r4):\r\n die()\r\ndef ch2():\r\n if p2 and (r2 or s2 or l2 or l3 or s4 or r1):\r\n die()\r\ndef ch3():\r\n if p3 and (r3 or s3 or l3 or l4 or s1 or r2):\r\n die()\r\ndef ch4():\r\n if p4 and (r4 or s4 or l4 or l1 or s2 or r3):\r\n die()\r\nch1()\r\nch2()\r\nch3()\r\nch4()\r\nprint(\"NO\")", "l = []\r\nfor i in range(4):\r\n l.append(list(map(int, input().split())))\r\nflag = False\r\nfor i in range(4):\r\n if l[i][3] == 1:\r\n if l[i][0] == 1 or l[i][1] == 1 or l[i][2] == 1 or l[(i+1)%4][0] == 1 or l[(i+2)%4][1] == 1 or l[(i+3)%4][2] == 1:\r\n print(\"YES\")\r\n flag = True\r\n break\r\nif not flag:\r\n print(\"NO\")\r\n", "ar = []\r\nresult = 0\r\nfor i in range(4):\r\n ar += [list(map(int, input().split()))]\r\nfor i in range(4):\r\n if ar[i][3] == 1 and (ar[i][0] == 1 or ar[i][1] == 1 or ar[i][2] == 1):\r\n result = \"YES\"\r\n else:\r\n if ar[i][0] == 1 and ar[(i - 1) % 4][3] == 1:\r\n result = \"YES\"\r\n if ar[i][1] == 1 and ar[(i + 2) % 4][3] == 1:\r\n result = \"YES\"\r\n if ar[i][2] == 1 and ar[(i + 1) % 4][3] == 1:\r\n result = \"YES\"\r\nif result == 0:\r\n result = \"NO\"\r\nprint(result)", "# left, strait, right, pedastrian\r\n# 3\r\n#4 2\r\n# 1\r\ndef check_if_safe(curr_part, left_part, right_part, opposite_part):\r\n curr_left, curr_straight, curr_right, curr_pedastrian = curr_part\r\n if curr_pedastrian == 0:\r\n return True\r\n elif (curr_left + curr_right + curr_straight) > 0:\r\n return False\r\n left_left, left_straight, left_right, left_pedastrian = left_part\r\n if left_right == 1:\r\n return False\r\n right_left, right_straight, right_right, right_pedastrian = right_part\r\n if right_left == 1:\r\n return False\r\n opposite_left, opposite_straight, opposite_right, opposite_pedastrian = opposite_part\r\n if opposite_straight == 1:\r\n return False\r\n return True\r\n\r\n\r\npart_one = [int(x) for x in input().split()]\r\npart_two = [int(x) for x in input().split()]\r\npart_three = [int(x) for x in input().split()]\r\npart_four = [int(x) for x in input().split()]\r\n\r\nans = ( check_if_safe(part_one, part_four, part_two, part_three)\r\n + check_if_safe(part_two, part_one, part_three, part_four)\r\n + check_if_safe(part_three, part_two, part_four, part_one)\r\n + check_if_safe(part_four, part_three, part_one, part_two)\r\n )\r\nif ans != 4:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "# cook your dish here\r\nimport array\r\nar={}\r\nfor i in range(0,4):\r\n ar[i]=input().split()\r\nfor i in range(0,4):\r\n for j in range(0,4):\r\n ar[i][j]=int(ar[i][j])\r\nflag=0\r\nif(ar[0][3]==1):\r\n if(ar[0][0]==1 or ar[0][1]==1 or ar[0][2]==1 or ar[3][2]==1 or ar[2][1]==1 or ar[1][0]==1):\r\n flag=1\r\nif(ar[1][3]==1):\r\n if(ar[1][0]==1 or ar[1][1]==1 or ar[1][2]==1 or ar[0][2]==1 or ar[3][1]==1 or ar[2][0]==1):\r\n flag=1\r\nif(ar[2][3]==1):\r\n if(ar[2][0]==1 or ar[2][1]==1 or ar[2][2]==1 or ar[1][2]==1 or ar[0][1]==1 or ar[3][0]==1):\r\n flag=1\r\nif(ar[3][3]==1):\r\n if(ar[3][0]==1 or ar[3][1]==1 or ar[3][2]==1 or ar[2][2]==1 or ar[1][1]==1 or ar[0][0]==1):\r\n flag=1\r\nif(flag==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n ", "import sys\r\n\r\ndef solve():\r\n traffic = [[int(j) for j in input().split()] for i in range(4)]\r\n\r\n ans = 'NO'\r\n\r\n for i in range(4):\r\n for j in range(3):\r\n if traffic[i][j]:\r\n if traffic[i][3]:\r\n ans = 'YES'\r\n\r\n if j == 0 and traffic[(i - 1) % 4][3]:\r\n ans = 'YES'\r\n elif j == 1 and traffic[(i + 2) % 4][3]:\r\n ans = 'YES'\r\n elif j == 2 and traffic[(i + 1) % 4][3]:\r\n ans = 'YES'\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "arr = []\r\nfor i in range(4):\r\n arr.append(input().split())\r\narr *= 3\r\nflag = True\r\nfor i in range(4,8):\r\n if arr[i][0]=='1':\r\n if arr[i-1][3]=='1' or arr[i][3]=='1':\r\n print('YES')\r\n flag = False\r\n break\r\n if arr[i][1]=='1':\r\n if arr[i][3]=='1' or arr[i+2][3]=='1':\r\n print('YES')\r\n flag = False\r\n break\r\n if arr[i][2]=='1':\r\n if arr[i][3]=='1' or arr[i+1][3]=='1':\r\n print('YES')\r\n flag = False\r\n break\r\nif flag:\r\n print('NO')", "a=[]\nfor i in range(4):\n a.append(list(map(int,input().split())))\n\nda=True\n\nfor i in range(4):\n if a[i][-1]==1:\n ind1=(i+2)%4\n ind2=(i+1)%4\n ind3=(i-1)%4\n if a[i][0]==1 or a[i][1]==1 or a[i][2]==1 or a[ind1][1]==1 or a[ind2][0]==1 or a[ind3][2]==1:\n da=False\nif da:\n print('NO')\n\nelse:\n print('YES')\n\n \t \t \t\t \t\t \t\t \t", "matrix = [list(map(int, input().split())) for _ in range(4)]\n\np1 = any([matrix[0][1], matrix[0][2], matrix[0][0], matrix[1][0], matrix[2][1], matrix[3][2]])\np2 = any([matrix[0][2], matrix[1][0], matrix[1][2], matrix[1][1], matrix[2][0], matrix[3][1]])\np3 = any([matrix[0][1], matrix[1][2], matrix[2][0], matrix[2][1], matrix[2][2], matrix[3][0]])\np4 = any([matrix[0][0], matrix[1][1], matrix[2][2], matrix[3][0], matrix[3][1], matrix[3][2]])\n\nif (matrix[0][3] and p1) or (matrix[1][3] and p2) or (matrix[2][3] and p3) or (matrix[3][3] and p4):\n\tprint('Yes')\nelse:\n print('NO')", "M=[list(map(int,input().split())) for i in range(4)]\r\nc=0\r\nif M[0][3]==1 :\r\n if M[0][2]==1 or M[0][1]==1 or M[0][0]==1 or M[2][1]==1 or M[1][0]==1 or M[3][2]==1 :\r\n c=1\r\nif M[1][3]==1 :\r\n if M[1][2]==1 or M[1][1]==1 or M[1][0]==1 or M[2][0]==1 or M[3][1]==1 or M[0][2]==1 :\r\n c=1\r\nif M[2][3]==1 :\r\n if M[2][2]==1 or M[2][1]==1 or M[2][0]==1 or M[0][1]==1 or M[3][0]==1 or M[1][2]==1 :\r\n c=1\r\nif M[3][3]==1 :\r\n if M[3][2]==1 or M[3][1]==1 or M[3][0]==1 or M[1][1]==1 or M[0][0]==1 or M[2][2]==1 :\r\n c=1\r\nif c==1 :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n \r\n \r\n \r\n", "# IAWT\r\ndef f():\r\n l = [list(map(int, input().split())) for i in range(4)]\r\n for i in range(4):\r\n if l[i][0]:\r\n if l[(i+3)%4][3] or l[i][3]:\r\n print('YES')\r\n return\r\n if l[i][1]:\r\n if l[(i+2)%4][3] or l[i][3]:\r\n print('YES')\r\n return\r\n if l[i][2]:\r\n if l[(i+1)%4][3] or l[i][3]:\r\n print('YES')\r\n return\r\n print('NO')\r\nf()\r\n", "arr = []\r\nfor i in range(4):\r\n s = list(input().split())\r\n arr.append(s)\r\nflag = False\r\nfor i in range(4):\r\n if arr[i][-1] == '1':\r\n if arr[i][0] == '1' or arr[i][1] == '1' or arr[i][2] == '1' or arr[(i+2)%4][1] == '1' or arr[(i+1)%4][0] == '1' or arr[(i-1)%4][2] == '1':\r\n flag = True\r\n break\r\nprint(\"YES\" if flag else \"NO\")\r\n \r\n\r\n", "roads = []\r\nfor i in range(4):\r\n roads.append(list(map(int, input().split())))\r\nfor i in range(4):\r\n if roads[i][3] == 1:\r\n if (roads[i][0] == 1) or (roads[i][1] == 1) or (roads[i][2]==1):\r\n print(\"YES\")\r\n break\r\n elif (roads[(i+1)%4][0] == 1) or (roads[(i+2)%4][1] == 1) or (roads[(i+3)%4][2] == 1):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "n = 4\r\nrec = [0, 0, 0, 0]\r\nP = [0, 0, 0, 0]\r\nfor i in range(n):\r\n l, s, r, p = map(int, input().split())\r\n rec[i] += l + s + r\r\n P[i] += p\r\n il = i - 1 if i - 1 >= 0 else 3\r\n ir = (i + 1) % 4\r\n ss = (i + 2) % 4\r\n rec[il] += l\r\n rec[ir] += r\r\n rec[ss] += s\r\n\r\nfor i in range(n):\r\n if rec[i] >= 1 and P[i] >= 1:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nroads = []\r\n\r\nfor i in range(4):\r\n roads.append([int(x) for x in input().split()])\r\n\r\nclock = {}\r\ncclock = {}\r\nopp = {}\r\n\r\nclock[0] = 1\r\nclock[1] = 2\r\nclock[2] = 3\r\nclock[3] = 0\r\n\r\ncclock[1] = 0\r\ncclock[2] = 1\r\ncclock[3] = 2\r\ncclock[0] = 3\r\n\r\nopp[0] = 2\r\nopp[1] = 3\r\nopp[2] = 0\r\nopp[3] = 1\r\n\r\nfor i in range(4):\r\n road = roads[i]\r\n if road[3] == 1:\r\n if road[0] == 1 or road[1] == 1 or road[2] == 1:\r\n print(\"YES\")\r\n break\r\n left = roads[cclock[i]]\r\n right = roads[clock[i]]\r\n straight = roads[opp[i]]\r\n if left[2] == 1 or right[0] == 1 or straight[1] == 1:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")", "l = [0] * 4\r\ns = [0] * 4\r\nr = [0] * 4\r\np = [0] * 4\r\nfor i in range(4):\r\n l[i], s[i], r[i], p[i] = map(int ,input().split())\r\nerror = 0\r\nfor i in range(4):\r\n if (l[i] + s[i] + r[i] > 0) and (p[i] == 1):\r\n error += 1\r\nfor i in range(4):\r\n j = 0\r\n if p[j] == 1:\r\n if (r[j + 3] == 0) and (s[j + 2] == 0) and (l[j + 1] == 0):\r\n error += 0\r\n else:\r\n error += 1\r\n l.append(l[j])\r\n l.pop(0)\r\n s.append(s[j])\r\n s.pop(0)\r\n r.append(r[j])\r\n r.pop(0)\r\n p.append(p[j])\r\n p.pop(0)\r\nif error > 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "a = [list(map(int, input().split())) for i in range(4)]\nprint((\"NO\", \"YES\")[any((i[0] or i[1] or i[2]) and i[3] for i in a) or any(any(a[i][j] and a[(i - j + 3) % 4][3] for i in range(4)) for j in range(3))])", "S = []\r\nres = \"NO\"\r\nfor i in range(4):\r\n S.append(list(map(int, input().split())))\r\nfor i in range(4):\r\n p = sum(S[i]) - S[i][3] + S[(i + 1) % 4][0] + S[(i + 2) % 4][1] + S[(i + 3) % 4][2]\r\n if p > 0 and S[i][3] == 1:\r\n res = \"YES\"\r\n break\r\nprint(res)", "t = []\r\nfor i in range(4):\r\n t.append(list(map(int, input().split())))\r\ntype = False\r\nif t[0][3] == 1:\r\n for i in range(3):\r\n if t[0][i] == 1:\r\n type = True\r\n if t[1][0] == 1:\r\n type = True\r\n if t[2][1] == 1:\r\n type = True\r\n if t[3][2] == 1:\r\n type = True\r\n\r\nif t[1][3] == 1:\r\n for i in range(3):\r\n if t[1][i] == 1:\r\n type = True\r\n if t[2][0] == 1:\r\n type = True\r\n if t[3][1] == 1:\r\n type = True\r\n if t[0][2] == 1:\r\n type = True\r\nif t[2][3] == 1:\r\n for i in range(3):\r\n if t[2][i] == 1:\r\n type = True\r\n if t[3][0] == 1:\r\n type = True\r\n if t[0][1] == 1:\r\n type = True\r\n if t[1][2] == 1:\r\n type = True\r\nif t[3][3] == 1:\r\n for i in range(3):\r\n if t[3][i] == 1:\r\n type = True\r\n if t[0][0] == 1:\r\n type = True\r\n if t[1][1] == 1:\r\n type = True\r\n if t[2][2] == 1:\r\n type = True\r\nif type:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n# 1 0 0 0\r\n# 0 0 0 1\r\n# 0 0 0 0\r\n# 1 0 1 0\r\n", "a, b, c, d = [], [], [], []\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\nst = False\r\nif a[3] == 1:\r\n if 1 in a[:3] or b[0] or c[1] or d[2]:\r\n st = True\r\nif b[3] == 1:\r\n if 1 in b[:3] or a[2] or c[0] or d[1]:\r\n st = True\r\nif c[3] == 1:\r\n if 1 in c[:3] or a[1] or b[2] or d[0]:\r\n st = True\r\nif d[3] == 1:\r\n if 1 in d[:3] or a[0] or b[1] or c[2]:\r\n st = True\r\nprint('YES' if st else 'NO')\r\n", "\r\n# Problem: A. Sagheer and Crossroads\r\n# Contest: Codeforces - Codeforces Round #417 (Div. 2)\r\n# URL: https://codeforces.com/contest/812/problem/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef gis(): return list(map(int, stdin.readline().strip().split()))\r\ndef gi(): return int(input())\r\n\r\nl = [gis() for i in range(4)]\r\nfor i in range(4):\r\n\tif l[i][3] and (l[(i + 1) % 4][0] or l[(i + 3) % 4][2] or l[(i + 2) % 4][1] or l[i][0] or l[i][1] or l[i][2]):\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nprint(\"NO\")", "def plu(n):\r\n if n < 3:\r\n return n + 1\r\n else:\r\n return 0\r\n\r\nf = 0\r\nm = [[0 for i in range(4)] for j in range(4)]\r\nfor i in range(4):\r\n m2 = [int(i) for i in input().split()]\r\n for j in range(4):\r\n m[i][j] = m2[j]\r\nfor i in range(4):\r\n k = i\r\n if m[i][3] == 1:\r\n for j in range(3):\r\n if m[i][j] == 1:\r\n f = 1\r\n for j in range(3):\r\n k = plu(k)\r\n if m[k][j] == 1:\r\n f = 1\r\n \r\nif f == 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "def poss_acc(lista, front, left, right, road):\r\n flag = False\r\n if lista[road - 1][3]:\r\n if lista[road - 1].count(1) > 1:\r\n flag = True\r\n elif lista[front - 1][1]:\r\n flag = True\r\n elif lista[left - 1][2]:\r\n flag = True\r\n elif lista[right - 1][0]:\r\n flag = True\r\n return flag\r\n\r\ninfo = []\r\nvalues = [[3, 4, 2, 1], [2, 3, 1, 4], [1, 2, 4, 3], [4, 1, 3, 2]]\r\naccident = False\r\n\r\nfor i in range(4):\r\n street = [int(x) for x in input().split()]\r\n info.append(street)\r\n\r\nfor val in values:\r\n if poss_acc(info, val[0], val[1], val[2], val[3]):\r\n accident = True\r\n break\r\n \r\nif accident:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "mat = [list(map(int, input().split())) for i in range(4)]\r\n\r\np1 = any([mat[0][1], mat[0][2], mat[0][0], mat[1][0], mat[2][1], mat[3][2]])\r\np2 = any([mat[0][2], mat[1][0], mat[1][2], mat[1][1], mat[2][0], mat[3][1]])\r\np3 = any([mat[0][1], mat[1][2], mat[2][0], mat[2][1], mat[2][2], mat[3][0]])\r\np4 = any([mat[0][0], mat[1][1], mat[2][2], mat[3][0], mat[3][1], mat[3][2]])\r\n\r\nif mat[0][3] and p1:\r\n print('YES')\r\nelif mat[1][3] and p2:\r\n print('YES')\r\nelif mat[2][3] and p3:\r\n print('YES')\r\nelif mat[3][3] and p4:\r\n print('YES')\r\nelse:\r\n print('NO')", "L=[]\r\nfor i in range(4):\r\n a=input().split()\r\n L.append(a)\r\n\r\ndef main():\r\n for i in range(4):\r\n if L[i][3]=='1':\r\n if L[i][0]=='1' or L[i][1]=='1' or L[i][2]=='1':\r\n print(\"YES\")\r\n return\r\n\r\n elif L[(i+1)%4][0]=='1' or L[(i+2)%4][1]=='1' or L[(i+3)%4][2]=='1':\r\n print(\"YES\")\r\n return\r\n\r\n\r\n print(\"NO\")\r\n return\r\n\r\nmain()", "L = [0, 4, 1, 2, 3]\r\nR = [0, 2, 3, 4, 1]\r\nS = [0, 3, 4, 1, 2]\r\n\r\nH = [0, 0, 0, 0, 0]\r\nP = H[:]\r\nfor i in range(1, 5):\r\n l, s, r, p = map(int, input().split())\r\n P[i] = p\r\n if 1 in [l, s, r]:\r\n H[i] = 1\r\n if l:\r\n H[L[i]] = 1\r\n if s:\r\n H[S[i]] = 1\r\n if r:\r\n H[R[i]] = 1\r\nans = \"NO\"\r\nfor i in range(1, 5):\r\n if P[i] and H[i]:\r\n ans = \"YES\"\r\nprint(ans)\r\n\r\n", "a = [[int(i) for i in input().split()] for j in range(4)]\r\n\r\npesh = [0] * 4\r\navt = [0] * 4\r\n\r\nfor i in range(len(a)):\r\n if a[i][3]:\r\n pesh[i] = True\r\n if a[i][0]:\r\n avt[(i - 1) % 4] = True\r\n avt[i] = True\r\n if a[i][1]:\r\n avt[(i + 2) % 4] = True\r\n avt[i] = True\r\n if a[i][2]:\r\n avt[(i + 1) % 4] = True\r\n avt[i] = True\r\n\r\nfor i in range(4):\r\n if avt[i] and pesh[i]:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "sz = 4\r\nr = []\r\nfor i in range(sz):\r\n\tr.append(input().split(' '))\r\nfor i in range(sz):\r\n\tfor j in range(sz):\r\n\t\tr[i][j] = int(r[i][j])\r\n\r\nans = True\r\n\r\nfor i in range(sz):\r\n\tif (r[i][0] == 1 or r[i][1] == 1 or r[i][2] == 1) and r[i][3] == 1 : ans = False\r\n\tif r[i][0] == 1 and r[(i+3)%4][3] == 1 : ans = False\r\n\tif r[i][1] == 1 and r[(i+2)%4][3] == 1 : ans = False\r\n\tif r[i][2] == 1 and r[(i+1)%4][3] == 1 : ans = False\r\n\t\r\nif ans : print(\"NO\")\r\nelse : print(\"YES\")", "lights = {}\r\nped = {}\r\n\r\nl_map = {\r\n 1: 2,\r\n 2: 3,\r\n 3: 4,\r\n 4: 1,\r\n}\r\ns_map = {\r\n 1: 3,\r\n 2: 4,\r\n 3: 1,\r\n 4: 2,\r\n}\r\nr_map = {\r\n 1: 4,\r\n 2: 1,\r\n 3: 2,\r\n 4: 3,\r\n}\r\n\r\ndef L(t): return t[0]\r\ndef S(t): return t[1]\r\ndef R(t): return t[2]\r\n\r\n\r\nfor i in range(1, 5):\r\n l, s, r, p = map(int, input().split())\r\n lights[i] = (l, s, r)\r\n ped[i] = p\r\n\r\nfor i in range(1, 5):\r\n if not ped[i]:\r\n continue\r\n if any(lights[i]) or L(lights[l_map[i]]) or S(lights[s_map[i]]) or R(lights[r_map[i]]):\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "def main():\n laneOne = input().split()\n laneTwo = input().split()\n laneThree = input().split()\n laneFour = input().split()\n outputcase = \"NO\"\n if laneOne[3] == \"1\":\n if laneOne[0] == \"0\" and laneOne[1] == \"0\" and laneOne[2] == \"0\" :\n if laneTwo[0] == \"1\" or laneThree[1] == \"1\" or laneFour[2] == \"1\":\n outputcase = \"YES\"\n\n else:\n outputcase = \"YES\"\n if laneTwo[3] == \"1\":\n if laneTwo[0] == \"0\" and laneTwo[1] == \"0\" and laneTwo[2] == \"0\" :\n if laneThree[0] == \"1\" or laneFour[1] == \"1\" or laneOne[2] == \"1\":\n outputcase = \"YES\"\n\n else:\n outputcase = \"YES\"\n if laneThree[3] == \"1\":\n if laneThree[0] == \"0\" and laneThree[1] == \"0\" and laneThree[2] == \"0\" :\n if laneTwo[2] == \"1\" or laneFour[0] == \"1\" or laneOne[1] == \"1\":\n outputcase = \"YES\"\n\n else:\n outputcase = \"YES\"\n if laneFour[3] == \"1\":\n if laneFour[0] == \"0\" and laneFour[1] == \"0\" and laneFour[2] == \"0\" :\n if laneTwo[1] == \"1\" or laneThree[2] == \"1\"or laneOne[0] == \"1\":\n outputcase = \"YES\"\n\n else:\n outputcase = \"YES\"\n\n print(outputcase)\n\nif __name__ == '__main__': main()", "def test(li, err):\r\n if li.count('1') != 0:\r\n err = err + 1\r\n return err\r\n\r\np1s = input()\r\np2s = input()\r\np3s = input()\r\np4s = input()\r\n\r\np1 = {}\r\np2 = {}\r\np3 = {}\r\np4 = {}\r\n\r\nfor q in range(4):\r\n p1[q + 1] = p1s.split()[-(q + 1)] \r\nfor q in range(4):\r\n p2[q + 1] = p2s.split()[-(q + 1)] \r\nfor q in range(4):\r\n p3[q + 1] = p3s.split()[-(q + 1)] \r\nfor q in range(4):\r\n p4[q + 1] = p4s.split()[-(q + 1)] \r\nallp = {1 : p1, 2 : p2, 3 : p3, 4 : p4}\r\n\r\nerr = 0\r\nfor i in range(4):\r\n if int(allp[i + 1][1]) == 1:\r\n if (i + 1) == 1:\r\n li = [allp[1][4], allp[2][4], allp[1][3], allp[3][3], allp[1][2], allp[4][2]]\r\n err = test(li, err)\r\n if (i + 1) == 2:\r\n li = [allp[2][4], allp[3][4], allp[2][3], allp[4][3], allp[1][2], allp[2][2]]\r\n err = test(li, err)\r\n if (i + 1) == 3:\r\n li = [allp[3][4], allp[4][4], allp[1][3], allp[3][3], allp[2][2], allp[3][2]]\r\n err = test(li, err)\r\n if (i + 1) == 4:\r\n li = [allp[1][4], allp[4][4], allp[2][3], allp[4][3], allp[3][2], allp[4][2]]\r\n err = test(li, err)\r\n else:\r\n continue\r\nif err != 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n", "a = [[int(num) for num in input().split()] for i in range(4)]\r\nb = False\r\nfor j in range(4):\r\n b |= a[j][3] and (1 in a[j][:3] or a[(j + 1) % 4][0] or a[(j + 2) % 4][1] or a[(j + 3) % 4][2])\r\nprint('YES' if b else 'NO')\r\n", "l1, s1, r1, p1=[int(a)for a in input().split()]\r\nl2, s2, r2, p2=[int(a)for a in input().split()]\r\nl3, s3, r3, p3=[int(a)for a in input().split()]\r\nl4, s4, r4, p4=[int(a)for a in input().split()]\r\nif (l1+s1+r1>0 and p1==1) or (l2+s2+r2>0 and p2==1) or (l3+s3+r3>0 and p3==1) or (l4+s4+r4>0 and p4==1) :\r\n print(\"YES\")\r\n exit()\r\nelif p1 == p2 == 1 and s4 == 1:\r\n print(\"YES\")\r\n exit()\r\nelif p1 == p2 == 1 and l3 == 1:\r\n print(\"YES\")\r\n exit()\r\nelif p1 == p2 == 1 and r4 == 1:\r\n print(\"YES\")\r\n exit()\r\nelif p1 == p2 == 1 and s3 == 1:\r\n print(\"YES\")\r\n exit()\r\nelif p1==1 and l1+s1+r1==0 and (l2==0 or l2+s2+r2==0) and (s3==0 or l3+s3+r3==0) and (r4==0 or l4+s4+r4==0):\r\n print(\"NO\")\r\n exit()\r\nelif p2==1 and l2+s2+r2==0 and (l3==0 or l3+s3+r3==0) and (s4==0 or l4+s4+r4==0) and (r1==0 or l1+s1+r1==0):\r\n print(\"NO\")\r\n exit()\r\nelif p3==1 and l3+s3+r3==0 and (l4==0 or l4+s4+r4==0) and (s1==0 or l1+s1+r1==0) and (r2==0 or l2+s2+r2==0):\r\n print(\"NO\")\r\n exit()\r\nelif p4==1 and l4+s4+r4==0 and (l1==0 or l1+s1+r1==0) and (s2==0 or l2+s2+r2==0) and (r3==0 or l3+s3+r3==0) :\r\n print(\"NO\")\r\n exit()\r\nelif p1==p2==p3==p4==0:\r\n print(\"NO\")\r\n exit()\r\nelif p1==p2==p3==p4==1 and l1==s1==r1==l2==s2==r2==l3==s3==r3==l4==s4==r4==0:\r\n print(\"NO\")\r\n exit()\r\nelif p1==p2==1 and l1+s1+r1==0 and l2+s2+r2==0 and (r3==1 or l3+s3+r3==0) and (l4==1 or l4+s4+r4==0):\r\n print(\"NO\")\r\n exit()\r\nelif p1==p3==1 and l1+s1+r1==0 and l3+s3+r3==0 and (s2==1 or l2+s2+r2==0) and (s4==1 or l4+s4+r4==0):\r\n print(\"NO\")\r\n exit()\r\nelif p1==p4==1 and l1+s1+r1==0 and l4+s4+r4==0 and (r2==1 or l2+s2+r2==0) and (l3==1 or l3+s3+r3==0):\r\n print(\"NO\")\r\n exit()\r\nelif p2==p3==1 and l3+s3+r3==0 and l2+s2+r2==0 and (r4==1 or l4+s4+r4==0) and (l1==1 or l1+s1+r1==0):\r\n print(\"NO\")\r\n exit()\r\nelif p2==p4==1 and l4+s4+r4==0 and l2+s2+r2==0 and (s3==1 or l3+s3+r3==0) and (s4==1 or l4+s4+r4==0):\r\n print(\"NO\")\r\n exit()\r\nelif p3==p4==1 and l3+s3+r3==0 and l4+s4+r4==0 and (r1==1 or l1+s1+r1==0) and (l2==1 or l2+s2+r2==0):\r\n print(\"NO\")\r\n exit()\r\nelif p1==p2==p3==1 and l1+s1+r1==0 and l2+s2+r2==0 and l3+s3+r3==0 and l4+s4+r4==0:\r\n print(\"NO\")\r\n exit()\r\nelif p1==p2==p4==1 and l1+s1+r1==0 and l2+s2+r2==0 and l3+s3+r3==0 and l4+s4+r4==0:\r\n print(\"NO\")\r\n exit()\r\nelif p2==p3==p4==1 and l1+s1+r1==0 and l2+s2+r2==0 and l3+s3+r3==0 and l4+s4+r4==0:\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n print(\"YES\")\r\n exit()\r\n", "l1, s1, r1, p1 = map(int, input().split())\r\nl2, s2, r2, p2 = map(int, input().split())\r\nl3, s3, r3, p3 = map(int, input().split())\r\nl4, s4, r4, p4 = map(int, input().split())\r\n\r\nif (p1 and (r1 or s1 or l1 or r4 or l2 or s3)) or (p2 and (r2 or s2 or l2 or l3 or r1 or s4)) or \\\r\n (p3 and (r3 or s3 or l3 or l4 or r2 or s1)) or\\\r\n (p4 and (r4 or s4 or l4 or l1 or r3 or s2)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "p1 = list(map(int, input().split()))\r\np2 = list(map(int, input().split()))\r\np3 = list(map(int, input().split()))\r\np4 = list(map(int, input().split()))\r\nflag = False\r\nlists = list([p1,p2,p3,p4]);\r\nfor k, items in enumerate(lists):\r\n for i, val in enumerate(items[0:3]):\r\n if val == 1 and items[3] == 1:\r\n flag = True\r\n if i == 0 and val == 1 and lists[(k-1)%4][3] == 1:\r\n flag = True\r\n if i == 1 and val == 1 and lists[(k+2)%4][3] == 1:\r\n flag = True\r\n if i == 2 and val == 1 and lists[(k+1)%4][3] == 1:\r\n flag = True\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#if road 1 has a p then\n# yes if any 1, 2l, 3s, 4r\n#if toad 2 has a p then\n# yes if any 2, 3l, 4s, 1r\n#...\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\nd = list(map(int, input().split()))\nl, s, r, p = 0, 1, 2, 3\nw = False\nif a[p]:\n if a.count(1) > 1 or b[l] or c[s] or d[r]:\n w = True\nif b[p]:\n if b.count(1) > 1 or c[l] or d[s] or a[r]:\n w = True\nif c[p]:\n if c.count(1) > 1 or d[l] or a[s] or b[r]:\n w = True\nif d[p]:\n if d.count(1) > 1 or a[l] or b[s] or c[r]:\n w = True\nif w == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "import sys\r\narr = list(map(int,input().split()))\r\nl1,s1,r1,p1 = arr[0],arr[1],arr[2],arr[3]\r\n\r\narr1 = list(map(int,input().split()))\r\nl2,s2,r2,p2 = arr1[0],arr1[1],arr1[2],arr1[3]\r\n\r\narr2 = list(map(int,input().split()))\r\nl3,s3,r3,p3 = arr2[0],arr2[1],arr2[2],arr2[3]\r\n\r\narr3 = list(map(int,input().split()))\r\nl4,s4,r4,p4 = arr3[0],arr3[1],arr3[2],arr3[3]\r\n\r\nif p1 == 1 and (l1 == 1 or s1 == 1 or r1 == 1 or l2 == 1 or s3 == 1 or r4 == 1):\r\n print('YES')\r\nelif p2 == 1 and (l2 == 1 or s2== 1 or r2 == 1 or r1== 1 or l3 == 1 or s4 == 1):\r\n print('YES')\r\nelif p3 == 1 and (l3 == 1 or s3 == 1 or r3 == 1 or s1 == 1 or r2 == 1 or l4 == 1):\r\n print('YES')\r\nelif p4 == 1 and (l4 == 1 or s4 == 1 or r4 == 1 or l1 == 1 or s2 == 1 or r3 == 1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "accident = False\r\n\r\nl = []\r\ns = []\r\nr = []\r\np = []\r\n\r\nfor i in range(4):\r\n a, b, c, d = map(int, input().split())\r\n l.append(a)\r\n s.append(b)\r\n r.append(c)\r\n p.append(d)\r\n\r\nfor i in range(4):\r\n if (p[i] == 1) and (l[i] + s[i] + r[i] + l[(i+1)%4] + s[(i+2)%4] + r[(i-1)%4] != 0):\r\n accident = True\r\n break\r\n\r\nif accident:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n" ]

[ "n,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nif k==1:\r\n print (min(a))\r\nelif k>2:\r\n print(max(a))\r\nelse:\r\n l1=[0 for i in range(n)]\r\n l2=[0 for j in range(n)]\r\n l1[0]=a[0]\r\n for i in range(1,n):\r\n l1[i]=min(l1[i-1],a[i])\r\n l2[n-2]=a[n-1]\r\n ans=max(l2[n-2],l1[n-2])\r\n for i in range(n-3,-1,-1):\r\n l2[i]=min(l2[i+1],a[i+1])\r\n ans=max(l2[i],l1[i],ans)\r\n print(ans)\r\n \r\n", "l = list(map(int, input().split()))\r\nm = list(map(int, input().split()))\r\nif l[1] == 1:\r\n print(min(m))\r\nelif l[1] == 2:\r\n print(max(m[0], m[-1]))\r\nelse:\r\n print(max(m))", "import sys\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif k==1:\r\n print(min(a))\r\n sys.exit()\r\nif k>=3:\r\n print(max(a))\r\n sys.exit()\r\nans=min(a)\r\nminfromleft=[0]*n\r\nminfromright=[0]*n\r\ncurr=10**10\r\nfor i in range(n):\r\n curr=min(curr,a[i])\r\n minfromleft[i]=curr\r\ncurr=10**10\r\nfor i in range(n-1,-1,-1):\r\n curr=min(curr,a[i])\r\n minfromright[i]=curr\r\nfor i in range(n-1):\r\n ans=max(ans,max(minfromleft[i],minfromright[i+1]))\r\nprint(ans)", "n, k = [int(i) for i in input().split(\" \")]\narr = [int(i) for i in input().split(\" \")]\n\nif k == 1:\t#only one\n\tprint(min(arr))\nelif k == 2:\n\tprint(max(arr[0], arr[len(arr)-1]))\nelse:\n\tprint(max(arr))", "r=lambda:map(int,input().split())\r\nn,k=r()\r\na=list(r())\r\nif k==1:print(min(a))\r\nelif k==2:print(max(a[0],a[-1]))\r\nelse:print(max(a))", "import sys\n\ndef maxofmin(a,n,m):\n if m==1:\n return min(a)\n elif m==2:\n return max(a[0], a[-1])\n else:\n return max(a)\n\ndef main():\n n,m = list(map(int, sys.stdin.readline().rstrip('\\n').split(' ')))\n a = list(map(int, sys.stdin.readline().rstrip('\\n').split(' ')))\n print(maxofmin(a,n,m))\n\nif __name__ == '__main__':\n main()\n", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\nif k == 1:\r\n print(min(a))\r\nelif k == 2:\r\n pref = []\r\n minP = int(1e9 + 7)\r\n suf = []\r\n minS = int(1e9 + 7)\r\n\r\n for i in range(n):\r\n if minP > a[i]:\r\n minP = a[i]\r\n pref.append(minP)\r\n if minS > a[n - i - 1]:\r\n minS = a[n - i - 1]\r\n suf.append(minS)\r\n\r\n print(max(max(suf), max(pref)))\r\nelse:\r\n print(max(a))\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nif k==1:\r\n print(min(a[0:n]))\r\n\r\nelif k==2:\r\n print(max(a[0],a[n-1]))\r\n\r\nelse:\r\n print(max(a[0:n]))", "# https://codeforces.com/problemset/problem/870/B\n\nimport fileinput\nimport sys\nfrom typing import List, Dict\n\n\ndef prefix_min(arr: List[int]) -> List[int]:\n curr_min = arr[0]\n prefix_table = []\n for v in arr:\n if v < curr_min:\n curr_min = v\n prefix_table.append(curr_min)\n return prefix_table\n\n\narr, segments = None, None\npowers: List[int]\nfor i, line in enumerate(fileinput.input()):\n if i == 0:\n _, segments = [int(v) for v in line[:-1].split()]\n if i == 1:\n arr = [int(v) for v in line[:-1].split()]\n break\nif segments == 1:\n print(min(arr))\n sys.exit(0)\nelif segments > 2:\n print(max(arr))\n sys.exit(0)\n\npref_mins = prefix_min(arr)\npost_mins = prefix_min(list(reversed(arr)))\n\npost_mins.reverse()\n\nrez: int = float('-inf')\nfor i in range(0, len(pref_mins) - 1):\n rez = max(rez, max(pref_mins[i], post_mins[i + 1]))\n\nprint(rez)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif k == 1:\r\n ans = min(a)\r\nelif k == 2:\r\n l, r = list(a), list(a)\r\n for i in range(1, n):\r\n l[i] = min(l[i], l[i - 1])\r\n for i in range(n - 2, -1, -1):\r\n r[i] = min(r[i], r[i + 1])\r\n ans = max(max(l[:-1]), max(r[1:]))\r\nelse:\r\n ans = max(a)\r\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif k == 1:\r\n print(min(a))\r\n exit(0)\r\nif k == 2:\r\n t = min(a)\r\n min1 = [0]*n\r\n min2 = [0]*n\r\n min1[0] = a[0]\r\n min2[-1] = a[-1]\r\n for i in range(1,n):\r\n min1[i] = min(min1[i-1], a[i])\r\n for i in range(n-2, -1, -1):\r\n min2[i] = min(min2[i+1], a[i])\r\n for i in range(1,n):\r\n q = max(min1[i-1], min2[i])\r\n if q > t:\r\n t = q\r\n print(t)\r\n exit(0)\r\nansw = max(a)\r\nprint(answ)", "def determine_max(k, a):\r\n if k == 1:\r\n return min(a)\r\n if k == 2:\r\n return max(a[0], a[-1])\r\n return max(a)\r\n\r\n_, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nprint(determine_max(k, a))\r\n\r\n", "# x = int(input())\n# a = [int(x) for x in input().split()]\n\nn, k = [int(x) for x in input().split()]\nl = [int(x) for x in input().split()]\n\nif k == 1:\n print(min(l))\nelif k == 2:\n # mx = None\n # for div in range(1, n):\n # current_min_1 = min(l[:div])\n # current_min_2 = min(l[n-div:])\n # if not mx:\n # mx = current_min_1\n # if current_min_1 > mx:\n # mx = current_min_1\n # if current_min_2 > mx:\n # mx = current_min_2\n # print(mx)\n print(max(l[0], l[-1]))\n\nelse:\n print(max(l))\n", "m=100000\r\nmx=1000000000\r\nn,k=map(int,input().split())\r\nif n>m or k>m or n<1 or k<1:\r\n exit()\r\n\r\nar= list(map(int, input().split()))\r\nif len(ar)!=n:\r\n exit()\r\n\r\nfor i in range(n):\r\n if ar[i]<-mx or ar[i]>mx:\r\n exit()\r\nif k>2:\r\n ar.sort()\r\n print(ar[-1])\r\nelif k==2:\r\n if ar[-1]>ar[0]:\r\n print(ar[-1])\r\n else:\r\n print(ar[0])\r\nelse:\r\n ar.sort()\r\n print(ar[0])\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif k==1:print(min(a))\r\nelif k>2:print(max(a))\r\nelse:\r\n print(max(a[0],a[-1]))", "def main():\r\n n, k = map(int, input().split())\r\n inp = list(map(int, input().split()))\r\n\r\n if k == 1:\r\n print(min(inp))\r\n\r\n elif k >= 3:\r\n print(max(inp))\r\n\r\n else:\r\n print(max(inp[0], inp[n - 1]))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nif k==1:\r\n print(min(l))\r\n exit()\r\nif k==2:\r\n mini=100000000000000 \r\n mini1=47548694576859\r\n maxi=-10000000000000 \r\n for i in range(n):\r\n mini=min(mini,l[i])\r\n mini1=min(mini1,l[n-1-i])\r\n #print(mini)\r\n maxi=max(maxi,mini,mini1)\r\n print(maxi)\r\n exit() \r\nprint(max(l))", "n,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\nif k==1:\r\n print(min(lst))\r\nelif k>=3: \r\n print(max(lst))\r\nelif k==2:\r\n print(max(lst[0],lst[n-1]))\r\n\r\n", "#from sys import stdin, stdout\r\n#t = int(stdin.readline())\r\nt=1\r\nwhile t!=0:\r\n t-=1 \r\n n,k = map(int, input().split())\r\n p = [int(x) for x in input().split()]\r\n if k==1:\r\n print(min(p))\r\n elif k >=3:\r\n print(max(p))\r\n else:\r\n maxi = max(p[0], p[-1])\r\n p.sort()\r\n print(max(maxi, p[1]))\r\n \r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nif k==1:\r\n print(min(a)) #vibora net - minimum\r\nelif k==2:\r\n print(max(a[0],a[n-1]))\r\nelif k%2==1:\r\n print(max(a)) # mojno videlit max v 1[]\r\nelse:\r\n print(max(a)) #4 and more k\r\n\r\n\r\n", "n, k = [int(i) for i in input().split()] \r\na = [int(i) for i in input().split()] \r\nif k == 1 : print(min(a)) \r\nelif k >= 3 or a[0] == max(a) or a[-1] == max(a) : print(max(a))\r\nelse : print(max(a[0], a[-1]))\r\n", "n,m=(map(int,input().strip().split(' ')))\r\na=list(map(int,input().strip().split(' ')))\r\n\r\nif(m==1):\r\n print(min(a))\r\nelif(m==2):\r\n print(max(a[0],a[n-1]))\r\n\r\n\r\nelse:\r\n print(max(a))", "def max_of_minimums(n, k, arr):\r\n if k == 1:\r\n return min(arr)\r\n elif k == 2:\r\n return max(arr[0], arr[-1])\r\n else:\r\n return max(arr)\r\n\r\n# Read input\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nresult = max_of_minimums(n, k, arr)\r\nprint(result)", "tmp = input().split()\r\nn = int(tmp[0])\r\nk = int(tmp[1])\r\n\r\na = input().split()\r\nfor i in range(n):\r\n\ta[i] = int(a[i])\r\n\r\nres = 0\r\nif (k == 1):\r\n\tres = min(a)\r\nelif (k == 2):\r\n\tres = max(a[0],a[-1])\r\nelse:\r\n\tres = max(a)\r\n\r\nprint(res)", "t=1\r\n#t=int(input())\r\nfor _ in range (t):\r\n #n=int(input())\r\n n,k=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n #b=list(map(int,input().split()))\r\n #s=input()\r\n #n=len(s)\r\n mx=max(a)\r\n if k==1:\r\n print(min(a))\r\n elif k==2:\r\n print(max(a[0],a[-1]))\r\n else:\r\n print(mx)", "def main():\r\n n, k = map(int, input().split())\r\n a = [int(c) for c in input().split()]\r\n\r\n if k == 2:\r\n print(max(a[0], a[-1]))\r\n else:\r\n print(max(a) if k >= 3 else min(a))\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k = map(int,input().split())\r\na = [int(i) for i in input().split()]\r\nif k==1:\r\n print(min(a))\r\nelif k>2:\r\n print(max(a))\r\nelse:\r\n print(max(a[0],a[-1]))\r\n \r\n", "n, k = [int(x) for x in input().split()]\r\nnums = [int(x) for x in input().split()]\r\n\r\nif k == 1:\r\n print(min(nums))\r\nelif k == 2:\r\n print(max(nums[0], nums[-1]))\r\nelse:\r\n print(max(nums))", "read = lambda : list(map(int,input().split()))\ninputs = read()\nn, k = inputs[0], inputs[1]\n\narray = read()\n\nif (k == 1):\n\tprint(min(array))\nelif (k == 2):\n\tprint(max(array[0], array[-1]))\nelse:\n\tprint(max(array))\n", "while True:\n try:\n x = input()\n n, k = list(map(int, x.split()))\n x = input()\n arr = list(map(int, x.split()))\n if k == 1:\n print(min(arr))\n elif k > 2:\n print(max(arr))\n else:\n prefix_min_l = [0] * n\n prefix_min_l[0] = arr[0]\n prefix_min_r = [0] * n\n prefix_min_r[n-1] = arr[n-1]\n for i in range(1, n):\n prefix_min_l[i] = min(arr[i], prefix_min_l[i-1])\n prefix_min_r[n-1-i] = min(arr[n-i], prefix_min_r[n-i])\n print(max(max(prefix_min_l), max(prefix_min_r)))\n\n\n except EOFError:\n break\n \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\nif k == 1: print(min(a))\r\nelif k >= 3: print(max(a))\r\nelse: print(max(a[0], a[n - 1]))", "def main():\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n if k > 2:\n sol = max(a)\n elif k == 1:\n sol = min(a)\n elif k == 2:\n sol = max(a[0], a[-1])\n print(sol)\n # RMQ = [[] for _ in range(n)]\n\n\nif __name__ == \"__main__\":\n main()\n\n\t\t\t\t \t \t \t\t \t\t \t\t\t \t \t\t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nif k == 1:\n\tprint(min(a))\nelif k > 2:\n\tprint(max(a))\nelse:\n\tpref = [ a[-1] ]\n\tfor i in range(1, n):\n\t\tpref.append(min(a[ - i - 1], pref[-1]))\n\tpref = pref[::-1]\n\tpr, ans = 2e9, min(a)\n\tfor i in range(n - 1):\n\t\tpr = min(pr, a[i])\n\t\tans = max([ ans, pref[i + 1], pr ])\n\tprint(ans)", "import copy\n\nif __name__ == '__main__':\n n, k = [int(x) for x in input().split()]\n arr = [int(x) for x in input().split()]\n arr_copy = copy.deepcopy(arr)\n\n arr.sort()\n\n if k == 1:\n print(arr[0])\n elif k >= 3:\n print(arr[-1])\n else:\n print(max(arr_copy[0], arr_copy[-1]))\n \n", "n,k = map(int,input().split())\r\nif(k == 1):print(min(list(map(int,input().split()))))\r\nelif(k > 2) : print(max(list(map(int,input().split()))))\r\nelse:\r\n ans = -1e18\r\n a = list(map(int,input().split()))\r\n L = [0 for i in range(n)]\r\n R = [0 for i in range(n)]\r\n L[0] = a[0]\r\n R[n - 1] = a[n - 1]\r\n for i in range(1,n):\r\n L[i] = min(L[i - 1],a[i])\r\n R[n - i - 1] = min(R[n - i],a[n - i]) \r\n for i in range(n):\r\n ans = max(ans,max(R[i],L[i]))\r\n print(ans)\r\n", "n, k = map(int, input().split())\nA = list(map(int, input().split()))\nif k > 2:\n print(max(A))\nelif k == 2:\n print(max(A[0], A[len(A)-1]))\nelse:\n\n print(min(A))\n", "I = lambda: map(int, input().split())\n \n_, k = I()\nA = list(I())\n \nprint(min(A) if k<2 else max(A) if k>2 else max(A[0], A[-1]))\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\na = list(map(int, input().split()))\r\nif k>=3: print(max(a))\r\nelif k==2:\r\n print(max(a[0], a[-1]))\r\nelse:\r\n print(min(a))\r\n", "n,k = map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif k==1:print(min(l))\r\nelif k>=3:print(max(l))\r\nelse :print(max(l[0],l[n-1]))", "def main() -> None:\r\n n, k = map(int, input().split())\r\n s = [int(x) for x in input().split()]\r\n if k == 1:\r\n print(min(s))\r\n elif k == 2:\r\n print(max(s[0], s[-1]))\r\n else:\r\n print(max(s))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nif k==1:\r\n print(min(arr))\r\nelif k==2:\r\n print(max(arr[0],arr[-1]))\r\nelse:\r\n print(max(arr))", "modulus = 10 ** 9 + 7\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n\r\n if k == 1:\r\n print(min(arr))\r\n elif k == 2:\r\n\r\n minValue = 99999999999999\r\n maxValue = -99999999999999\r\n\r\n for i in range(len(arr) - 1):\r\n minValue = min(minValue, arr[i])\r\n maxValue = max(maxValue, minValue)\r\n\r\n minValue = 99999999999999\r\n\r\n for i in range(len(arr) - 1, 0, -1):\r\n minValue = min(minValue, arr[i])\r\n maxValue = max(maxValue, minValue)\r\n\r\n print(maxValue)\r\n\r\n else:\r\n print(max(arr))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from itertools import accumulate\n\nn, k = (int(x) for x in input().split())\narr = [int(x) for x in input().split()]\n\nif k == 1:\n print(min(arr))\nelif k >= 3:\n print(max(arr))\nelse:\n lefts = list(accumulate(arr[:-1], func=min))\n rights = reversed(list(accumulate(reversed(arr[1:]), func=min)))\n splits = (max(l, r) for l, r in zip(lefts, rights))\n print(max(splits))\n", "def maxOfSegmentMins(array,len,k): \r\n if k ==1: \r\n return min(array) \r\n if k==2: \r\n return max(array[0],array[n-1]) \r\n return max(array)\r\n\r\n\r\nif __name__=='__main__':\r\n n, k = map(int, input().split())\r\n array = [int(x) for x in input().split()]\r\n\r\n print(maxOfSegmentMins(array, len(array), k))", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/10/20 08:25\r\n\r\n\"\"\"\r\n\r\nN, K = map(int, input().split())\r\nA = [int(x) for x in input().split()]\r\n\r\nif K == 1:\r\n print(min(A))\r\nelif K >= 3:\r\n print(max(A))\r\nelse:\r\n left = [float('inf')] * (N+1)\r\n for i in range(1, N+1):\r\n left[i] = min(left[i-1], A[i-1])\r\n\r\n right = [float('inf')] * (N+1)\r\n for i in range(N-1, -1, -1):\r\n right[i] = min(right[i+1], A[i])\r\n\r\n ans = float('-inf')\r\n for i in range(1, N):\r\n ans = max(ans, max(left[i], right[i]))\r\n\r\n print(ans)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nif k == 1:\r\n print(min(a))\r\nelif k >= 3:\r\n print(max(a))\r\nelse:\r\n \r\n prefix_min = [a[0]]\r\n suffix_min = [a[-1]]\r\n for i in range(1, n):\r\n prefix_min.append(min(prefix_min[-1], a[i]))\r\n suffix_min.append(min(suffix_min[-1], a[n-i-1]))\r\n suffix_min.reverse()\r\n\r\n ans = max(a[0], a[-1])\r\n for i in range(n-1):\r\n ans = max(ans, max(prefix_min[i], suffix_min[i+1]))\r\n print(ans)", "#!/usr/bin/env python3\nimport sys\n\n\n#hi\nnk = sys.stdin.readline()\nfline = nk.split()\nfline[0].strip()\nfline[1].strip()\nfline = list(map(int, fline))\nk = fline[1]\n\na = sys.stdin.readline()\narr = a.split()\nfor item in arr:\n item.strip()\narr = list(map(int, arr))\n\nfirst = arr[0]\nlast = arr[-1]\narr.sort()\n\nif k == 1:\n print(\"{}\".format(int(arr[0])))\nelif k > 2:\n print(\"{}\".format(int(arr[-1])))\nelse:\n print(\"{}\".format(int(max(first, last))))\n", "maxN = 100000\r\nlog = [0 for i in range(maxN+1)]\r\n\r\nfor i in range(2, maxN+1):\r\n log[i] = log[i//2]+1\r\n\r\n\r\ndef log2(n):\r\n return log[n]\r\n\r\n\r\ndef func(a, b):\r\n return min(a, b)\r\n\r\n\r\ndef preCompute(a):\r\n n = len(a)\r\n k = log2(maxN)\r\n sp = [[0 for i in range(k+1)] for j in range(n)]\r\n\r\n for i in range(n):\r\n sp[i][0] = a[i]\r\n\r\n for j in range(1, k+1):\r\n for i in range(n+1 - (1 << j)):\r\n sp[i][j] = func(sp[i][j-1], sp[i+(1 << (j-1))][j-1])\r\n return sp\r\n\r\n\r\ndef minRangeQueries(l, r):\r\n length = r-l+1\r\n k = log2(length)\r\n return func(sp[l][k], sp[r-(1 << k)+1][k])\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nif k == 1:\r\n print(min(a))\r\nelif k >= 3:\r\n print(max(a))\r\nelse:\r\n mx = max(a)\r\n if a[0] == mx or a[-1] == mx:\r\n print(mx)\r\n else:\r\n sp = preCompute(a)\r\n mx = -1*float('inf')\r\n for i in range(n-1):\r\n mx = max(mx, max(minRangeQueries(0, i), minRangeQueries(i+1, n-1)))\r\n print(mx)\r\n", "#! /usr/bin/env pypy3\n\nn, k = map(int, input().split())\na = [int(x) for x in input().split()]\n\nif k == 1:\n print(min(a))\nelif k >= 3:\n print(max(a))\nelse:\n b = [0 for x in range(n)]\n c = [0 for x in range(n)]\n b[0] = a[0]\n c[-1] = a[-1]\n for i in range(1, n):\n b[i] = min(b[i - 1], a[i])\n c[-1-i] = min(c[-i], a[-1-i])\n print(max(max(b[i], c[i + 1]) for i in range(n - 1)))\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif k >= 3:print(max(a))\r\nelif k==2:print(max(a[0], a[-1]))\r\nelse:print(min(a))", "n,m=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nar1=[]\r\nfor i in ar:\r\n ar1.append(i)\r\nar.sort()\r\nif(m==1):\r\n print(ar[0])\r\nelif(m==2):\r\n print(max(ar1[0],ar1[-1]))\r\nelse:\r\n print(ar[-1])\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nif k > 2:\n print(max(a))\nelif k == 2:\n print(max(a[0], a[-1]))\nelif k == 1:\n print(min(a))\n\n\"\"\"\n11 2\n2 2 6 3 4 5 1 3 4 6 2\n\"\"\"\n", "from collections import defaultdict, deque\r\nfrom heapq import heappush, heappop\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n prefix = [A[0]]\r\n suffix = [0] * n\r\n suffix[-1] = A[-1]\r\n for i in range(1, n):\r\n prefix.append(min(prefix[-1], A[i]))\r\n for i in range(n-2, -1, -1):\r\n suffix[i] = min(suffix[i+1], A[i])\r\n\r\n if k == 1:\r\n ans = min(A)\r\n elif k == 2:\r\n ans = float('-inf') \r\n for i in range(n-1):\r\n ans = max(ans, max(prefix[i], suffix[i+1]))\r\n else:\r\n ans = max(A)\r\n print(ans)\r\n\r\n\r\nt = 1\r\nwhile t:\r\n t -= 1\r\n solve()\r\n\r\n", "#Maximum of Maximums of Minimums\n\nimport math\n\n\nui = [int(x) for x in input().split()]\nn, m = ui[0], ui[1]\n\nmaxx = -float(\"INF\")\nminn = float(\"INF\")\n\nv = [int(x) for x in input().split()]\n\nfor i in range(n):\n maxx = max(maxx, v[i]);\n minn = min(minn, v[i]);\n\n\nif (m == 1):\n print(minn)\nelif (m > 2 or m > n):\n print(maxx)\nelse:\n print(max(v[0], v[n - 1]))\n\n\t\t \t\t \t \t \t \t \t \t\t\t\t \t\t", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nM=max(l)\r\nm=min(l)\r\n#code\r\nif k==1:\r\n print(m)\r\nelif k>=3:\r\n print(M)\r\nelse:\r\n if l.index(M)==0 or l.index(M)==len(l)-1:\r\n print(M)\r\n else :\r\n if l.index(m)==0:\r\n print(l[len(l)-1])\r\n elif l.index(m)==len(l)-1:\r\n print(l[0])\r\n else :\r\n print(max(l[0],l[len(l)-1]))", "from collections import deque\n\nn, k = map(int, input().split())\nnums = list(map(int, input().split()))\n\nif k == 1:\n\tprint(min(nums))\nelif k == 2:\n\tprefix = []\n\tpostfix = deque()\n\tcurrent = float('inf')\n\tfor i in nums:\n\t\tcurrent = min(i, current)\n\t\tprefix.append(current)\n\tcurrent = float('inf')\n\tfor i in range(len(nums) - 1, -1, -1):\n\t\tcurrent = min(current, nums[i])\n\t\tpostfix.appendleft(current)\n\tbest = float('-inf')\n\tfor i in range(len(nums)):\n\t\tbest = max(best, max(prefix[i], postfix[i]))\n\tprint(best)\nelse:\n\tprint(max(nums))", "n,m = map(int,input().split()) \r\na = list(map(int,input().split()))\r\nif m>=3 :\r\n print(max(a))\r\nif m==2:\r\n print(max(a[0],a[n-1]))\r\nif m==1:\r\n print(min(a))", "def readln(): return map(int, input().rstrip().split())\r\n\r\n\r\nn, k = readln()\r\ndata = list(readln())\r\n\r\nif k >= 3:\r\n print(max(data))\r\nelif k == 1:\r\n print(min(data))\r\nelse:\r\n print(max(data[0], data[-1]))\r\n", "n,k=map(int,input().strip().split())\r\nl=list(map(int,input().strip().split()))\r\nlp=sorted(l)\r\nif k==1:\r\n print(lp[0])\r\nelif k==2:\r\n print(max(l[0],l[-1]))\r\nelse:\r\n print(lp[-1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\n\r\nif k == 1:\r\n print(min(w))\r\nelif k > 2:\r\n print(max(w))\r\nelse:\r\n print(max(w[0], w[-1]))", "import sys\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif k == 1:\r\n print(min(a))\r\n sys.exit(0)\r\nif k >= 3:\r\n print(max(a))\r\n sys.exit(0)\r\nprint(max(a[0], a[len(a) - 1]))\r\n", "n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nif m == 1:\r\n print(min(l))\r\nelif m == 2:\r\n print(max(l[0],l[-1]))\r\nelse:\r\n print(max(l))", "from sys import stdin\r\n\r\n\r\ndef max_max_min(arr, k):\r\n if k == 1:\r\n return min(arr)\r\n elif k >= 3:\r\n return max(arr)\r\n else:\r\n min_arr = min(arr)\r\n for i in range(len(arr)):\r\n if min_arr == arr[i]:\r\n min_left = i\r\n break\r\n for j in range(len(arr)-1, -1, -1):\r\n if min_arr == arr[j]:\r\n min_right = j\r\n break\r\n if min_left == min_right:\r\n return max(arr[0], arr[-1])\r\n x, y = min_arr, min_arr\r\n if min_left != 0:\r\n x = min(arr[:min_left])\r\n if min_right != len(arr)-1:\r\n y = min(arr[min_right:])\r\n return max(x, y)\r\n\r\n\r\ndef main():\r\n arr_len, k = [int(x) for x in stdin.readline().split()]\r\n arr = [int(x) for x in stdin.readline().split()]\r\n print(max_max_min(arr, k))\r\n\r\n\r\nmain()\r\n", "_, k = map(int, input().strip().split())\nnums = tuple(map(int, input().strip().split()))\n\nif k == 1:\n print(min(nums))\nelif k == 2:\n print(max(nums[0], nums[-1]))\nelse:\n print(max(nums))\n\n \t\t\t\t \t\t \t\t \t \t \t \t \t\t\t \t", "n,k=map(int,input().split())\nip=list(map(int,input().split()))\na=max(ip)\nb=min(ip)\nif k==1:\n print(b)\nelif k>2:\n print(a)\nelse:\n if ip[0]==a or ip[-1]==a:\n print(a)\n else:\n if ip[0]>ip[-1]:\n print(max(ip[0], min(ip[1:])))\n else:\n print(max(ip[-1], min(ip[:-1])))\n", "if __name__ == \"__main__\":\r\n s1, s2 = map(int, input().split())\r\n result = list(map(int, input().split()))\r\n \r\n if s2 == 1:\r\n print(min(result))\r\n \r\n elif s2 == 2:\r\n print(max(result[0], result[-1]))\r\n \r\n else:\r\n print(max(result))", "(n,k) = (int(i) for i in input().split())\r\na = [int(i) for i in input().split()]\r\nif k==1:\r\n\tprint(min(a))\r\nelif k==2:\r\n\tprint(max(a[0], a[-1]))\r\nelse:\r\n\tprint(max(a))", "n, k = input().split()\nk = int(k)\na = list(map(int, input().split()))\n\nif k == 1:\n print(sorted(a)[0])\nelif k > 2:\n print(sorted(a)[-1])\nelse:\n print(max(a[0], a[-1]))", "[length,k]=[int(c) for c in input().split()]\r\narray=[int(c) for c in input().split()]\r\nif k==1:\r\n print(min(array))\r\nelif k==2:\r\n best=-(10**9)\r\n array1=[array[0]]\r\n array2=[array[-1]]\r\n \r\n for c in range(1,len(array)):\r\n array1.append(min(array1[c-1],array[c]))\r\n array2.append(min(array1[c-1],array[-c-1]))\r\n for c in range(len(array1)):\r\n best=max(best,max(array1[c],array2[-c-1]))\r\n print(best)\r\nelse:\r\n print(max(array))\r\n", "n, k = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\n\nif k >= 3:\n print(max(a))\nelif k >= 2:\n print(max(a[0], a[n-1]))\nelse:\n print(min(a))\n", "l = list(map(int, input().split()))\r\nif l[1] >= 3:\r\n print(max(map(int, input().split())))\r\nelif l[1] == 2:\r\n w = list(map(int, input().split()))\r\n print(max(w[0], w[-1]))\r\nelse:\r\n print(min(map(int, input().split())))\r\n", "import sys;sc = sys.stdin.readline;out=sys.stdout.write\r\nn,x=map(int,input().rstrip().split())\r\narr=list(map(int,input().rstrip().split()))\r\nif x==1:out(str(min(arr)))\r\nelif x==2:out(str(max(arr[0],arr[-1])))\r\nelse:out(str(max(arr)))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif k==1:\r\n print(min(l))\r\n exit()\r\nif k==2:\r\n x=max(l)\r\n x1=min(l)\r\n if l[0]==x or l[n-1]==x:\r\n print(x)\r\n exit()\r\n else:\r\n l1=[0 for i in range(n)]\r\n l2=[0 for i in range(n)]\r\n l1[0]=l[0]\r\n for i in range(1,n):\r\n l1[i]=min(l[i],l1[i-1])\r\n l2[n-1]=l[n-1]\r\n i=n-2\r\n while i>=0:\r\n l2[i]=min(l2[i+1],l[i])\r\n i-=1\r\n ans=-1000000000\r\n for i in range(0,n-1):\r\n ans=max(ans,max(l1[i],l2[i+1]))\r\n print(ans)\r\n exit()\r\nif k>2:\r\n print(max(l))\r\n exit()\r\n\r\n", "# LUOGU_RID: 93645875\nn, k = map(int, input().split())\na = list(map(int, input().split()))\nmn = min(a)\nmx = max(a)\nif k == 1:\n print(mn)\nelif k == 2:\n print(max(a[0], a[-1]))\nelse:\n print(mx)", "nAndK = [int(x) for x in input().split()]\r\nn = nAndK[0]\r\nk = nAndK[1]\r\narray = [int(y) for y in input().split()]\r\n\r\nif k == 1:\r\n print(min(array))\r\n\r\nelif k == 2:\r\n print(max(array[0], array[n-1]))\r\n\r\nelse:\r\n print(max(array))\r\n", "s = input().split()\r\nn, k = int(s[0]), int(s[1])\r\ns = input().split()\r\na = []\r\nmn, mx = 1e10, -1e10\r\nfor x in s:\r\n e = int(x)\r\n a.append(e)\r\n mn = min(mn, e)\r\n mx = max(mx, e)\r\nans = mx\r\nif k == 1:\r\n ans = mn\r\nelif k == 2:\r\n ans = max(a[0], a[n - 1])\r\nprint(ans)", "n,m = map(int, input().split(\" \"))\r\na = list(map(int, input().split(\" \")))\r\nif m == 1:\r\n print(min(a))\r\nelif m == 2:\r\n print(max(a[0],a[-1]))\r\nelse:\r\n print(max(a))\r\n", "n,k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nq = list(map(int,input().split()))\r\nif (k>2):\r\n print(max(q))\r\nif (k==2):\r\n print(max(max(q[0],min(q[1:])),max(q[-1],min(q[0:len(q)-1]))))\r\nif (k==1):\r\n print(min(q))\r\n", "#!/usr/bin/python\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nif k == 1:\n print(min(a))\nelif k >= 3:\n print(max(a))\nelse: # k == 2\n m = [0]*len(a)\n m[-1] = a[-1]\n for i in reversed(range(len(a)-1)):\n m[i] = min(a[i], m[i+1])\n #print(m)\n\n l = a[0]\n r = m[1]\n best = max(l, r)\n #print(l, r, best)\n for i in range(1,len(a)):\n l = min(l, a[i])\n r = m[i]\n best = max(best, l, r)\n #print(l, r, best)\n print(best)\n", "n , m = map(int , input().split())\r\nli = list(map(int , input().split()))\r\nif m == 1 : \r\n print(min(li))\r\nelif m == 2 : \r\n print(max(li[0], li[-1]))\r\nelse: \r\n print(max(li))", "n, k = [int(x) for x in input().strip().split()]\na: list = [int(x) for x in input().strip().split()]\n\nleft, right = a[0], a[-1]\n\nif k > 2:\n print(max(a))\nelif k == 1:\n print(min(a))\nelif k == 2:\n print(max(left, right))\n\n\t \t \t \t \t\t \t\t \t\t", "n, k = list(map(int, input().split()))\r\nl = list(map(int, input().split()))\r\n\r\nif k == 1:\r\n print(min(l))\r\n\r\nelif k == 2:\r\n if l[0] >= l[-1]:\r\n print(l[0])\r\n else:\r\n print(l[-1])\r\n\r\nelse:\r\n print(max(l))", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nminv = 10000000000000000\r\nmaxv = -1*minv\r\nif k == 2:\r\n if a[0] > a[n-1]:\r\n print(a[0])\r\n else:\r\n print(a[n-1])\r\nelif k == 1:\r\n for i in a:\r\n if i < minv:\r\n minv = i\r\n\r\n print(minv)\r\nelse:\r\n for i in a:\r\n if i > maxv:\r\n maxv = i\r\n \r\n print(maxv)\r\n", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n#lines = stdin.readlines()\n\n\nn, k = rint()\na = list(rint())\n\nif k != 2:\n mm = min(a)\n MM = max(a)\n if k == 1:\n print(mm)\n else:\n print(MM)\nelse:\n aa = [10**10 for i in range(n)]\n bb = [10**10 for i in range(n)]\n minprv = 10**10\n for i in range(n-1):\n aa[i] = min(minprv, a[i])\n minprv = aa[i]\n minprv = 10**10\n for i in range(n-2, -1, -1):\n bb[i] = min(minprv, a[i+1])\n minprv = bb[i]\n\n mm = -10**10\n for i in range(0,n-1):\n mm = max(mm, max(aa[i], bb[i]))\n print(mm)\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nif k==1:\r\n\tprint(min(arr))\r\nelse:\r\n\tif k==2:\r\n\t\tprint(max(arr[0],arr[n-1]))\r\n\telse:\r\n\t\tprint(max(arr))", "n,k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nif k == 2:\r\n\tif lst[0] > lst[len(lst)-1]:\r\n\t\tprint(lst[0])\r\n\telse:\r\n\t\tprint(lst[len(lst)-1])\r\nelif k == 1:\r\n\tlst.sort()\r\n\tprint(lst[0])\r\nelse:\r\n\tlst.sort()\r\n\tprint(lst[len(lst)-1])", "stuff = input().split(\" \")\nn = int(stuff[0])\nk = int(stuff[1])\n\nnums = [int(x) for x in input().split(\" \")]\n\nif k == 1:\n print(str(min(nums)))\nelif k == 2:\n print(max(nums[0], nums[n - 1]))\nelse:\n print(str(max(nums)))", "k=int(input().split()[1])\r\na=list(map(int,input().split()))\r\nif k==1:\r\n print(min(a))\r\nelif k==2:\r\n print(max(a[0],a[-1]))\r\nelse:\r\n print(max(a))", "n,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nif k==1:print(min(s))\r\nelif k==2:print(max(s[0],s[-1]))\r\nelse:print(max(s))", "from sys import stdin\ninp = list(map(lambda s: s.strip(), stdin.readlines()))\n_n, k = map(int, inp[0].split())\nl = list(map(int, inp[1].split()))\nif k is 1:\n print(min(l))\nelif k is 2:\n print(max(l[0], l[-1]))\nelse:\n print(max(l))\n", "def soln():\n n_arr_len, k_subarr = (int(_) for _ in input().split())\n arr = [int(_a) for _a in input().split()]\n if k_subarr == 1: # deadling with whole array --> ret min\n return min(arr)\n if k_subarr == 2:\n # if min in 1st section, then 2nd section will have a min > true min\n # if max in 1st section, then 2nd section will have a min < max\n return max(arr[0], arr[n_arr_len - 1])\n else: # max can be isolated\n return max(arr)\n\nprint(soln())\n", "from math import inf\r\n# from queue import Queue\r\n# from math import inf\r\n# from collections import deque\r\n# from collections import Counter\r\n# n,k,m=map(int,input().split())\r\n# for _ in range(int(input())):\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif n!=1:\r\n if k>2:\r\n print(max(l))\r\n elif k==2:\r\n # min1=inf\r\n # min2=inf\r\n # l1=[]\r\n # l2=[]\r\n # for i in range(n-1):\r\n # min1=min(min1,l[i])\r\n # l1.append(min1)\r\n # min2=min(min2,l[n-1-i])\r\n # l2.append(min2)\r\n # ans=0\r\n # for j in range(len(l1)):\r\n # ans=max(ans,max(l1[j],l2[j]))\r\n print(max(l[0],l[-1]))\r\n else:\r\n print(min(l))\r\nelse:\r\n print(l[0])\r\n\r\n ", "from sys import stdout, stdin\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\n\r\ndef main():\r\n mp = lambda: map(int, input().strip().split())\r\n it = int\r\n n, k = mp()\r\n a = list(mp())\r\n if k == 1:\r\n print(str(min(a)))\r\n elif k == 2:\r\n print(str(max(a[0], a[-1])))\r\n else:\r\n print(str(max(a)))\r\n\r\n\r\nmain()\r\n", "n, k = list(map(int ,input().split()))\r\nA = list(map(int ,input().split()))\r\nif k == 1:\r\n print(min(A))\r\nelif k > 2:\r\n print(max(A))\r\nelse:\r\n print(max(A[0],A[-1]))\r\n ", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nif(k==1):\r\n print(min(l))\r\nelif(k>2):\r\n print(max(l))\r\nelif(k==2):\r\n print(max(l[0],l[n-1]))\r\n\"\"\"\r\nind = l.index(max(l))\r\nl1 = l[:ind]\r\nl1.append(0)\r\nl2 = l[ind:]\r\nm1 = min(l1)\r\nm2 = max(l2)\r\nprint(max(m1,m2))\r\n\"\"\"", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\nmin_el = 10**9 + 7\nmax_el = -min_el\nfor el in arr:\n if el < min_el:\n min_el = el\n if el > max_el:\n max_el = el\nif k == 1:\n print(min_el)\nelif k == 2:\n print(max(arr[0], arr[-1]))\nelse:\n print(max_el)\n", "# LUOGU_RID: 133174852\nk=int(input().split()[1])\na=list(map(int,input().split()))\nif k==1:\n print(min(a))\nelif k==2:\n print(max(a[0],a[-1]))\nelse:\n print(max(a))", "import sys\r\n# import heapq, collections\r\n\r\nsys.setrecursionlimit(10**7)\r\ninf = 10**20\r\neps = 1.0 / 10**15\r\nmod = 10**9+7\r\n\r\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\r\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\r\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\r\ndef LS(): return sys.stdin.readline().split()\r\ndef I(): return int(sys.stdin.readline())\r\ndef F(): return float(sys.stdin.readline())\r\ndef S(): return input()\r\n\r\ndef solve(n, k, a):\r\n if k == 1:\r\n return min(a)\r\n elif k == 2:\r\n return max([a[0], a[-1]])\r\n else:\r\n return max(a)\r\n\r\ndef main():\r\n n, k = LI()\r\n a = LI()\r\n print(solve(n, k, a))\r\n\r\nmain()\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif k == 1:\r\n ans = a[0]\r\n for i in a:\r\n ans = min(ans, i)\r\n print(ans)\r\nelif k == 2:\r\n print(max(a[0], a[-1]))\r\nelse:\r\n ans = a[0]\r\n for i in a:\r\n ans = max(ans, i)\r\n print(ans)\r\n", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nif k==1:print(min(lst))\r\nelif k==2:print(max(lst[0],lst[n-1]))\r\nelse:print(max(lst))", "s = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nn = s[0]\r\nk = s[1]\r\nif k == 1:\r\n print(min(a))\r\nelif k == 2:\r\n print(max(a[-1], a[0]))\r\nelse:\r\n print(max(a))", "#!/usr/bin/env python3\r\n# from typing import *\r\n\r\nimport sys\r\nimport io\r\nimport math\r\nimport collections\r\nimport decimal\r\nimport itertools\r\nimport bisect\r\nimport heapq\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline()[:-1]\r\n\r\n\r\n# sys.setrecursionlimit(1000000)\r\n\r\n# _INPUT = \"\"\"# paste here...\r\n# \"\"\"\r\n# sys.stdin = io.StringIO(_INPUT)\r\n\r\nINF = 10**10\r\n\r\n\r\ndef solve(N, K, A):\r\n if K == 1:\r\n return min(A)\r\n\r\n elif K == 2:\r\n a1 = [A[0]]\r\n for i in range(1, N):\r\n a1.append(min(a1[-1], A[i]))\r\n a2 = [A[N-1]]\r\n for i in reversed(range(N-1)):\r\n a2.append(min(a1[-1], A[i]))\r\n a2.reverse()\r\n\r\n ans = -INF\r\n for i in range(N-1):\r\n ans = max(ans, a1[i], a2[i+1])\r\n return ans\r\n\r\n else:\r\n return max(A)\r\n\r\n\r\nN, K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nprint(solve(N, K, A))\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n\r\nif k == 1:\r\n print(min(a))\r\nelif k == 2:\r\n d = []\r\n for i in range(n):\r\n if i == 0:\r\n d.append(a[i])\r\n else:\r\n d.append(min(d[i-1], a[i]))\r\n\r\n e = []\r\n for i in range(n):\r\n if i == 0:\r\n e.append(a[-1])\r\n else:\r\n e.append(min(d[i-1], a[n-1-i]))\r\n\r\n print(max(max(d), max(e)))\r\nelse:\r\n print(max(a))", "a,b=map(int,input().split())\r\nif b==1:print(min(list(map(int,input().split()))))\r\nelif b>2:print(max(list(map(int,input().split()))))\r\nelse:\r\n z=list(map(int,input().split()))\r\n print(max(z[0],z[-1]))\r\n", "\r\nn , k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nm = max(l)\r\nif k == 1 :\r\n print(min(l))\r\n\r\nelif k >= 3 :\r\n print(max(l))\r\n\r\nelse:\r\n print(max(l[0] , l[-1]))\r\n\r\n", "n, k = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nM = max(ls)\r\nm = min(ls)\r\nif k==1:\r\n print(m)\r\nelif k>=3:\r\n print(M)\r\nelse:\r\n if ls.index(M)==0 or ls.index(M)==(n-1):\r\n print(M)\r\n else:\r\n start = ls[0]\r\n end = ls[n-1]\r\n del ls[ls.index(m)]\r\n m = min(ls)\r\n print(max(start, end, m))\r\n", "def readInts(): return map(int, input().split())\r\n\r\nn, k = readInts()\r\n\r\narr = list(readInts())\r\nif k == 1: print( min(arr) )\r\nelif k == 2:\r\n A = [ arr[i] for i in range(n) ]\r\n for i in range(1,n):\r\n A[i] = min ( A[i-1], A[i] )\r\n ans = min ( arr )\r\n B = arr[n-1]\r\n for i in range(n-1,0,-1):\r\n B = min ( B, arr[i] )\r\n ans = max ( ans, max(A[i-1],B) ) \r\n print( ans )\r\nelse:\r\n print ( max(arr) )\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nif k==1:\r\n print(min(a)) #vibora net - minimum\r\nelif k==2:\r\n if a[0]>=a[n-1]:\r\n print(a[0])\r\n else: # mojno videlit krainiy\r\n print(a[n-1])\r\nelif k%2==1:\r\n print(max(a)) # mojno videlit max v 1[]\r\nelse:\r\n print(max(a)) #4 and more k\r\n\r\n\r\n", "def main():\n n, k = map(int, input().split())\n array = list(map(int, input().split()))\n if (k >= 3):\n print(max(array))\n return\n if (k == 1):\n print(min(array))\n return\n print(max(array[0], array[-1]))\n\nif __name__ == '__main__':\n main()\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif k==1:print(min(a))\r\nelif k==2:print(max(a[0],a[-1]))\r\nelse:print(max(a))", "a,b = map(int, input().split())\r\nif b == 1:\r\n print(min(map(int, input().split())))\r\nelif b == 2:\r\n l = list(map(int, input().split()))\r\n print(max(l[0], l[-1]))\r\nelse:\r\n print(max(map(int, input().split())))", "n, k = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\n\r\n_max = max(lst)\r\n_min = min(lst)\r\n\r\nif(k==1):\r\n print(_min)\r\n\r\nelif(k==n):\r\n print(_max)\r\n\r\nelif(k>=3):\r\n print(_max)\r\n\r\n\r\nelif(_max==lst[0] or _max==lst[-1]):\r\n print(_max)\r\n\r\n\r\nelse:\r\n print(max(lst[0],lst[-1]))\r\n", "def main():\n n,k = list(map(int,input().split(' ')))\n arr = list(map(int,input().split(' ')))\n\n if k == 1:\n print(min(arr))\n return\n if k == 2:\n print(max(arr[-1],arr[0]))\n return\n print(max(arr))\n\nmain()\n\t\t\t \t \t\t\t\t\t\t\t\t\t\t\t \t \t \t\t\t\t \t", "n, k = map(int, input().split())\nx = list(map(int, input().split()))\nif k == 1:\n print(min(x))\nelif k == 2:\n if x[0] == max(x) or x[-1] == max(x):\n print(max(x))\n else:\n print(max(x[0], x[-1]))\nelif k > 2:\n print(max(x))\n", "def solve():\r\n n, k = [int(_) for _ in input().split()]\r\n nums = [int(_) for _ in input().split()]\r\n if k == 1:\r\n return min(nums)\r\n if k == 2:\r\n return max(nums[0], nums[-1])\r\n return max(nums)\r\n\r\n\r\nprint(solve())", "n, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\nif k >= 3:\r\n print(max(array))\r\nelif k == 1:\r\n print(min(array))\r\nelse:\r\n print(max(array[0], array[n-1]))\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif(k==1):\r\n print(min(a))\r\nelif(k==2):\r\n b=[0]*n\r\n b[n-1]=a[n-1];\r\n for i in range(n-2,-1,-1):\r\n b[i]=min(a[i],b[i+1])\r\n x=a[0]\r\n t=max(x,b[1])\r\n for i in range(1,n-1):\r\n x=min(x,a[i]);\r\n t=max(t,max(b[i+1],x))\r\n print(t)\r\nelse:\r\n print(max(a))", "# ----------- FastIO ----------- #\r\nimport atexit, os\r\nfrom sys import stdin\r\nfrom io import BytesIO\r\n\r\noutput_pipe = BytesIO()\r\nreadline = stdin.readline\r\n_write = output_pipe.write\r\noutput_pipe.write = lambda *args: (_write(b' '.join(map(lambda s: str(s).encode(), args))), _write(b'\\n'))\r\nprint = output_pipe.write\r\ninput = lambda: readline().rstrip('\\r\\n')\r\natexit.register(lambda: os.write(1, output_pipe.getvalue()))\r\n# ------------------------------ #\r\nfrom math import log2\r\n# from bisect import bisect_left\r\n# from collections import deque\r\n# from string import ascii_lowercase\r\n# from heapq import heappush, heappop, heapify\r\n\r\n\r\nread = lambda: input()\r\nread_int = lambda: int(input())\r\nread_ints = lambda: [int(_) for _ in input().split()]\r\n\r\n\r\ndef build_sparse(nums, func=min):\r\n n = len(nums)\r\n k = int(log2(n))\r\n sparse = [[] for _ in range(k + 1)]\r\n\r\n prev_size = 1\r\n sparse[0] = nums\r\n for idx in range(1, k+1):\r\n for jdx in range(n-idx):\r\n first = sparse[idx-1][jdx]\r\n second = sparse[idx-1][min(jdx+prev_size, n-idx)]\r\n sparse[idx].append(\r\n func(first, second),\r\n )\r\n prev_size <<= 1\r\n return sparse\r\n\r\n\r\ndef ask_sparse(sparse, l, r):\r\n k = int(log2(r-l+1))\r\n size = 2 ** k\r\n return min(sparse[k][l], sparse[k][r-size+1])\r\n\r\n\r\ndef solve():\r\n n, k = read_ints()\r\n nums = read_ints()\r\n if k == 1:\r\n return min(nums)\r\n if k == 2:\r\n mx = float('-inf')\r\n sparse = build_sparse(nums)\r\n for idx in range(n - 1):\r\n left = (0, idx)\r\n right = (n - 1 - idx, n - 1)\r\n mx = max(mx, ask_sparse(sparse, *left))\r\n mx = max(mx, ask_sparse(sparse, *right))\r\n return mx\r\n return max(nums)\r\n\r\n\r\nprint(solve())", "n,k=map(int,input().split())\r\nll=list(map(int,input().split()))\r\nif k==1:\r\n print(min(ll))\r\nelif k==2:\r\n print(max(ll[0],ll[-1]))\r\nelse:\r\n print(max(ll))", "nH,k=map(int,input().split())\naG=list(map(int,input().split()))\nif k==1:\n print(min(aG[0:nH])) \nelif k==2:\n print(max(aG[0],aG[nH-1])) \nelse:\n print(max(aG[0:nH]))\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\ntemp = [int(x) for x in input().split()]\r\nif k > 2:\r\n print(max(temp))\r\nelif k == 1:\r\n print(min(temp))\r\nelse:\r\n print(max(temp[0], temp[-1]))\r\n", "l1 = [int(i) for i in input().split()]\nl2 = [int(i) for i in input().split()]\n\nn = l1[1]\nif n==1:\n\tprint(min(l2))\nelif n==2:\n\tprint(max([l2[0],l2[-1]]))\nelse:\n\tprint(max(l2))", "temparr = input().split()\n\nn = int(temparr[0])\nk = int(temparr[1])\n\ntemparr = input().split()\n\narr = []\n\nfor i in temparr:\n arr.append(int(i))\n\nif k == 1:\n print(min(arr[0:n]))\n\nelif k == 2:\n print(max(arr[0], arr[n-1]))\n\nelse:\n print(max(arr[0:n]))\n \t \t\t\t \t\t \t\t \t\t\t\t\t \t \t\t\t", "import sys\r\ndef get_ints(): return list(map(int, sys.stdin.readline().strip().split()))\r\n \r\n\r\n \r\ndef solve(nums, k):\r\n if k == 1:\r\n return min(nums)\r\n if k == 2:\r\n return max(nums[0], nums[-1])\r\n else:\r\n return max(nums)\r\nn, k = get_ints()\r\nnums = get_ints() \r\nprint(solve(nums, k))", "while True:\n try:\n \t\n \tdef read():\n \t\tn, k = map(int, input().split())\n \t\ta = list(map(int, input().split()))\n \t\tsolve(n, k, a)\n \t\n \tdef solve(n, k, a):\n \t\tif k == 1:print(min(a))\n \t\telif k == 2:print(max(a[0],a[n-1]))\n \t\telse:print(max(a))\n \t\t\t\n \t\t\n \t\t\t\t\t\n \tif __name__ == \"__main__\":\n \t\tread()\n \t\t\n except EOFError:\n break\n\t", "n,k=map(int,input().split())\t\r\nz=list(map(int,input().split()))\r\nif(k>=3):\r\n\tprint(max(z))\r\nelif(k==2):\r\n\tprint(max(z[0],z[-1]))\r\nelse:\r\n\tprint(min(z))\r\n", "a,b = map(int,input().split())\r\nz = list(map(int,input().split()))\r\nif b ==1:print(min(z))\r\nelif b==2:\r\n\tq,v,w,r,t=z[0],[z[0]],[z[-1]],z[-1],-float(\"inf\")\r\n\tfor i in range(1,a):\r\n\t\tif z[i]<q:q =z[i]\r\n\t\tv.append(q)\r\n\tfor j in range(a-2,-1,-1):\r\n\t\tif z[j]<r:r=z[j]\r\n\t\tw.append(r)\r\n\tfor i in range(a):\r\n\t\tt = max(t,v[i],w[i])\r\n\tprint(t)\r\nelse:print(max(z))", "from sys import stdin, stdout\r\n\r\nn, k = map(int, stdin.readline().split())\r\nvalues = list(map(int, stdin.readline().split()))\r\n\r\nif k == 1:\r\n stdout.write(str(min(values)))\r\nelif k == 2:\r\n ans = float('-inf')\r\n \r\n mn = float('inf')\r\n for i in range(n):\r\n mn = min(mn, values[i])\r\n ans = max(ans, mn)\r\n \r\n mn = float('inf')\r\n for i in range(n - 1, -1, -1):\r\n mn = min(mn, values[i])\r\n ans = max(ans, mn)\r\n \r\n stdout.write(str(ans))\r\nelse:\r\n stdout.write(str(max(values)))", "n, k = input().split()\r\nn, k = int(n), int(k)\r\narray = list(map(int, input().split()))\r\n\r\nif (k >= 3):\r\n print(max(array))\r\n\r\nelif k == 1:\r\n print(min(array))\r\n\r\nelif k == 2:\r\n print(max(array[0], array[-1])) \r\n", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\nif k == 1:\n print(min(l))\n exit(0)\nelif k == 2:\n print(max(l[0], l[-1]))\nelse:\n print(max(l))\n", "from sys import stdin, stdout\nn, k = [int(x) for x in stdin.readline().split()]\na = [int(x) for x in stdin.readline().split()]\nif k == 1:\n stdout.write('{}\\n'.format(min(a)))\nelif k == 2:\n m = 10**9 + 1\n mm = -m\n for i in range(len(a)):\n if a[i] < m:\n m = a[i]\n if m > mm:\n mm = m\n m = 10**9 + 1 \n for i in range(len(a) -1, -1, -1):\n if a[i] < m:\n m = a[i]\n if m > mm:\n mm = m\n stdout.write('{}\\n'.format(mm))\n \nelse:\n stdout.write('{}\\n'.format(max(a)))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nif k == 1:\r\n print(min(a))\r\nelif k == 2:\r\n l, r = [a[0]] + [0] * (n - 1), [0] * (n - 1) + [a[-1]]\r\n for i in range(1, n):\r\n l[i] = min(l[i - 1], a[i])\r\n r[n - i - 1] = min(r[n - i], a[n - i - 1])\r\n print(max(max(l[i], r[i + 1]) for i in range(n - 1)))\r\nelse:\r\n print(max(a))", "n, k = input().split()\nn = int(n)\nk = int(k)\n\na = input().split()\na = list(map(int, a))\n\nif k == 1:\n print(min(a))\n\nelif k == 2:\n print(max(a[0], a[-1]))\n\nelse:\n print(max(a))\n\n\t \t \t \t \t \t \t\t \t\t\t \t \t", "a,b=map(int,input().split())\nlist1=list(map(int,input().split()))\nif b==1:\n print(min(list1))\nelif b==2:\n if list1[0]>list1[a-1]:print(list1[0])\n else:print(list1[a-1])\nelse:\n print(max(list1))", "# Main maut ko takiya, aur kafan ko chaadar banakar audhta hoon!\r\n\r\nfrom math import *\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nif(k==1):\r\n\tprint(min(a))\r\nelif k>2:\r\n\tprint(max(a))\r\nelse:\r\n\tprint(max(a[0],a[n-1]))", "from copy import copy\nimport heapq\n\nn, k = (int(x) for x in input().split())\narr = [int(x) for x in input().split()]\n\nif k == 1:\n print(min(arr))\nelif k >= 3:\n print(max(arr))\nelse:\n lefts = [arr[0]]\n for x in arr[1:-1]:\n lefts.append(min(lefts[-1], x))\n rights = [arr[-1]]\n for x in reversed(arr[1:-1]):\n rights.append(min(rights[-1], x))\n rights.reverse()\n\n print(max(max(l, r) for l, r in zip(lefts, rights)))\n", "R = lambda: list(map(int,input().split()))\r\nn,k = R()\r\narr = R()\r\nif k==1: print(min(arr))\r\nelif k>=3: print(max(arr))\r\nelse:\r\n pre = [0]*n; pre[0]=arr[0]\r\n suf = [0]*n; suf[-1]=arr[-1]\r\n for i in range(1,n):\r\n pre[i] = min(pre[i-1],arr[i])\r\n for i in range(n-2,-1,-1):\r\n suf[i] = min(suf[i+1],arr[i])\r\n ans = max(pre[0],suf[1])\r\n for i in range(1,n-1):\r\n ans = max(ans,pre[i],suf[i+1])\r\n print(ans)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif k>2:\r\n print(max(l))\r\nelif k==2:\r\n if l[0]>l[n-1]:\r\n print(l[0])\r\n else:\r\n print(l[n-1])\r\nelse:\r\n print(min(l))\r\n", "def main():\n n, k = map(int, input().split())\n l = list(map(int, input().split()))\n if k == 1:\n res = min(l)\n elif k == 2:\n res = max(l[0], l[-1])\n else:\n res = max(l)\n print(res)\n\n\nif __name__ == '__main__':\n main()", "_, k = [int(x) for x in input().split()]\r\nvals = [int(x) for x in input().split()]\r\n\r\nif k > 2:\r\n # Can make a set that just has the max\r\n print(max(vals))\r\n exit()\r\nelif k == 1:\r\n print(min(vals))\r\n exit()\r\nelse:\r\n # 1 split\r\n print(max(vals[0], vals[-1]))\r\n exit()" ]

[ "from decimal import *\r\ngetcontext().prec=10**5+500\r\na,b,c=map(int,input().split())\r\nr = Decimal(a)/Decimal(b)\r\nr=(str(r)+'0'*100).split('.')[1][:10**5]\r\nif str(c) not in r:print(-1)\r\nelse:print(r.index(str(c))+1)", "def first( a , b , c ): \n a %= b \n for i in range(1, b + 1): \n a = a * 10 \n if int(a / b) == c: \n return i \n a %= b \n \n return -1\n\na,b,c=map(int,input().split())\nprint(first(a,b,c))\n\n \t \t \t \t\t \t\t\t\t\t\t\t\t \t\t\t\t\t", "def long_div(a, b):\n remain = {}\n a *= 10\n # print(a, \"div\", b)\n while a not in remain:\n remain[a] = True\n d = a // b\n r = a % b\n a = r * 10\n # print(\"digit:\", d, \"remain:\", r)\n yield d\n # print(remain)\n\ndef solution(a, b, c):\n for i, d in enumerate(long_div(a, b)):\n if d == c:\n return i + 1\n return -1\nif __name__ == \"__main__\":\n a, b, c = map(int, input().split())\n print(solution(a, b, c))\n", "a, b, c = map(int, input().split())\r\ni = 0\r\n\r\nwhile i < 100000:\r\n i += 1\r\n a *= 10\r\n if a // b == c:\r\n print(i)\r\n exit(0)\r\n a = a % b\r\nprint(-1)", "from math import *\nimport fileinput\n\nfor line in fileinput.input():\n\ta, b, c = [int (x) for x in line.split()]\n\n\tflag=False\n\tfor i in range(1, 500):\n\t\tif (((a*10**i)//b)%10 == c):\n\t\t\tprint(i)\n\t\t\tflag=True\n\t\t\tbreak\n\n\tif (not flag):\n\t\tprint(-1)\n", "a,b,c=map(int,input().split())\r\nfor i in range(2*b):\r\n a*=10\r\n if a//b==c:exit(print(i+1))\r\n a%=b\r\nprint(-1)", "a,b,c=map(int,input().split())\r\nr=a%b\r\nt=b\r\ncnt=1\r\nf=0\r\nwhile(t!=0):\r\n r*=10\r\n k=r//b\r\n r=r%b\r\n if(k==c):\r\n f=1\r\n break\r\n cnt+=1\r\n t-=1\r\nif(f):\r\n print(cnt)\r\nelse:\r\n print(-1)", "a,b,c=[int(i) for i in input().split()]\r\nx_list=[]\r\nfor i in range(10**5):\r\n x=a*10//b\r\n y=a*10%b\r\n x_list.append(x)\r\n a=y\r\nif c in x_list:\r\n c_position=x_list.index(c)+1\r\nelse:\r\n c_position=-1\r\nprint(c_position)\r\n", "a,b,c=map(int,input().split())\r\ncnt=0\r\nl=[]\r\nfor i in range(b+3):\r\n l.append(0)\r\nk=a%b\r\nf=0\r\nwhile l[k]==0:\r\n if k==0 and c==0:\r\n cnt+=1\r\n f=1\r\n break\r\n elif k==0:\r\n break\r\n i=0\r\n l[k]=1\r\n while k*(10**i)<b:\r\n i+=1\r\n k=k*(10**i)\r\n if i>1 and c==0:\r\n f=1\r\n cnt+=1\r\n break\r\n cnt+=i\r\n if k//b==c:\r\n f=1\r\n break\r\n k=k%b\r\nif f==1:\r\n print(cnt)\r\nelse:\r\n print(\"-1\")\r\n", "# import sys\n\n# sys.stdin = open('input.txt', 'r')\n\n# sys.stdout = open('output.txt', 'w')\n\na, b, c = map(int, input().split(' '))\n\nfor i in range(1, b + 1):\n a *= 10\n\n if a // b == c:\n print(i)\n exit()\n\n a %= b\n\nprint(-1)\n", "a, b, c = map(int, input().split())\r\na = a%b\r\ncnt = 1\r\nwhile(cnt < 10**5):\r\n a *= 10\r\n if a//b == c: \r\n print(cnt)\r\n exit()\r\n a %= b\r\n cnt += 1\r\nprint(-1)\r\n", "a, b, c = map(int, input().split())\r\na *= 10\r\nfor i in range(b):\r\n d, a = a // b, a % b * 10\r\n if d == c:\r\n print(i + 1)\r\n exit()\r\nprint(-1)", "a,b,c=map(int,input().split())\r\na=a%b\r\nfor i in range(b):\r\n a=10*a\r\n if (a//b)==c:\r\n print(i+1)\r\n break\r\n else:\r\n if i==b-1:\r\n print(-1)\r\n a=a%b\r\n", "a,b,c=map(int,input().split())\r\na%=b\r\nfor i in range(10**6):\r\n a*=10\r\n if a//b==c:\r\n print(i+1)\r\n break\r\n a%=b\r\nelse:\r\n print(-1)", "a, b, c = map(int,input().split())\r\n\r\n'''tmp = (str(a/b))[2:]\r\nif len(tmp) < 15:\r\n tmp += '0'\r\na = ((tmp).find(str(c)) + 1)\r\nif a == 0:\r\n print(-1)\r\nelse:\r\n print(a)'''\r\n\r\n#period = ''\r\n#a *= 10**5\r\ncopy = str(a) + '0' * 100000\r\ndiv = []\r\n#dig = []\r\ni = 0\r\nwhile True:\r\n if a == 0:\r\n if a == c:\r\n print(i)\r\n exit()\r\n break\r\n #a *= 10**(len(str(b)))\r\n #dig.append(int(str(a)[0:len(str(b))]) // b)\r\n if a // b == c and i != 0:\r\n print(i)\r\n exit()\r\n #print(a)\r\n a = int(str(a % b) + copy[i + len(str(b))])\r\n if a in div:\r\n if a == c:\r\n print(i)\r\n exit()\r\n break\r\n else:\r\n div.append(a)\r\n i += 1\r\n \r\nprint(-1)\r\n \r\n \r\n\r\n \r\n ", "a, b, c = map(int, input().split())\r\nind = 0\r\na *= 10\r\ns = []\r\nwhile True:\r\n num = a // b\r\n ind += 1\r\n if num == c:\r\n print(ind)\r\n break\r\n a -= num * b\r\n if a in s:\r\n print(-1)\r\n break\r\n s.append(a)\r\n a *= 10", "def pos(a,b,c):\n\ta%=b\n\tfor i in range(1,b+1):\n\t\ta*=10\n\t\tif(int(a/b)==c):\n\t\t\treturn i\n\t\ta%=b\n\treturn -1\nprint(pos(*[int(i) for i in input().split()]))\n \t\t\t \t \t\t \t\t \t \t \t \t", "a, b, c = map(int, input().split())\r\nd = set()\r\nans = -1\r\ncnt = 1\r\nwhile True:\r\n a *= 10\r\n g = a//b\r\n if g == c:\r\n ans = cnt\r\n break\r\n cnt += 1\r\n a %= b\r\n if a in d:\r\n break\r\n d.add(a)\r\nprint(ans)", "from sys import *\nfrom collections import *\nfrom math import *\nfrom random import *\nfrom datetime import date\n\ndef lStr(d = \" \"): return input().split(\" \")\ndef lInt(d = \" \"): return [int(i) for i in input().split(d)]\ndef lDec(d = \" \"): return [float(i) for i in input().split(d)]\n\na, b, c = lInt()\ni, f = 1, 1\ncheck = set()\n\nwhile a:\n d = 0\n\n if a >= b:\n if a in check:\n print(-1), exit(0)\n check.add(a)\n f = 1\n d, a = divmod(a, b)\n else:\n a *= 10\n \n if f:\n f = 0\n continue\n if d == c:\n print(i), exit(0)\n i += 1\nprint(i if c == 0 else -1)\n", "a,b,c=map(int,input().split())\ncur=a\nfor i in range(1,b+2):\n cur=cur*10\n if cur//b==c:\n print(i)\n exit(0)\n cur%=b\nprint(-1)\n", "a,b,c=map(int,input().split())\r\nfor i in range(1,b+1):\r\n if a*10//b==c:\r\n print(i)\r\n import sys\r\n sys.exit()\r\n a=(a*10)%b\r\n \r\nprint(-1)\r\n\r\n\r\n\r\n\r\n", "a, b, c = map(int, input().split())\r\n\r\na*=10\r\n\r\nfor i in range(1, int(1e6)):\r\n l = a//b\r\n if l == c:\r\n print(i)\r\n exit(0)\r\n a %= b\r\n a *= 10\r\nprint(-1)", "a,b,c = map(int,input().split())\r\ncnt= 1\r\nwhile cnt <= 1000000 :\r\n a = a*10\r\n temp = a//b\r\n if temp == c :\r\n print(cnt)\r\n exit()\r\n a = a%b\r\n cnt += 1\r\nprint(\"-1\")\r\n", "from fractions import Fraction\r\n# for _ in range((int)(input())):\r\na,b,c=map(int, input().split())\r\na=a%b\r\nv=-1\r\nfor i in range(1,1000000):\r\n a=a*10\r\n if a//b==c:\r\n v=(i)\r\n break\r\n a=a%b\r\nprint(v)", "a,b,c = map(int,input().split(' '))\nf = False\nfor i in range(1,1000000):\n a *= 10\n if a//b == c:\n print(i)\n f = True\n break\n a %= b\nif f != True:\n print(-1)\n \n\n \t \t\t\t \t \t \t\t \t \t \t\t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, c = map(int, input().split())\r\nans = -1\r\nfor i in range(1, pow(10, 5)):\r\n a *= 10\r\n if a // b == c:\r\n ans = i\r\n break\r\n a -= a // b * b\r\nprint(ans)", "a, b, c = map(int, input().split())\r\nfor i in range(10 ** 5):\r\n a *= 10\r\n if a // b == c:\r\n exit(print(i + 1))\r\n a %= b\r\nprint(-1)", "\nA = list(map(int, input().split()))\na = A[0]\nb = A[1]\nc = A[2]\n# get the mod of the number\na = a % b\n\nindex = 0\n# traverse for every decimal places\nfor i in range(1, b + 1):\n\n # convert to the decimal places\n\n a = a * 10\n\n # condition we are checking is (a*10/b)/c\n if int(a / b) == c:\n index = i\n break\n\n # mod the number again\n a = a % b\n\n# if we actually found an index\nif index != 0:\n print(index)\nelse:\n print(-1)\n\t\t \t \t \t\t\t \t \t\t\t \t\t\t \t\t", "from decimal import Decimal, getcontext \r\nif __name__ == '__main__':\r\n # Set global precsion\r\n MAX_PRECISION = 1000\r\n getcontext().prec = MAX_PRECISION\r\n\r\n a, b, c = input().split()\r\n a, b, c = Decimal(a), Decimal(b), int(c)\r\n checkPart = (\"{:.{}f}\".format(a / b, MAX_PRECISION))[2:-1]\r\n index = checkPart.find(str(c))\r\n print(-1 if index == -1 else index + 1)", "\"\"\"\nTask:\nGiven fraction a/b find the first occurence of\ndigit c in the decimal notation of the fraction\nafter the decminal point\n\"\"\"\n\na, b, c = map(int, input().split())\nq, r = divmod(a, b)\nunder = a - (b * q)\n\nafter_decimal_point = ''\nfor _ in range(b):\n under *= 10\n q, r = divmod(under, b)\n under -= b * q\n after_decimal_point += str(q)\n\nlocation = after_decimal_point.find(str(c))\nif location == -1:\n print(-1)\nelse:\n print(location + 1)", "from decimal import *\r\n\r\ndef main():\r\n getcontext().prec = 500\r\n a, b, c = map(int, input().split())\r\n d = str(Decimal(a) / Decimal(b))\r\n d += \"0\" * (502 - (len(d)))\r\n cnt = [-2] * 10\r\n for idx, item in enumerate(d[2:-1]):\r\n if cnt[int(item)] == -2:\r\n cnt[int(item)] = idx\r\n print(cnt[c] + 1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b,c=map(int, input().split())\r\nfor i in range(2*b):\r\n a *= 10\r\n if (a//b==c):\r\n print(i+1)\r\n break\r\n a %= b\r\nelse: \r\n print(-1)", "if __name__ == '__main__':\r\n\ta,b,c = map(int, input().split())\r\n\tfor i in range (b):\r\n\t\ta *=10\r\n\t\tif a//b == c:\r\n\t\t\tprint(i+1)\r\n\t\t\tbreak\r\n\t\ta %=b\r\n\telse:\r\n\t\tprint(-1)", "a, b, c = map(int, input().split())\r\nfor i in range(b):\r\n\td, a = divmod(10 * a, b)\r\n\tif d == c:\r\n\t\tprint(i+1)\r\n\t\texit()\r\nprint(-1)\r\n", "a,b,c=map(int,input().split())\r\ni=1\r\na=a%b\r\nans=-1\r\nwhile(i<=b):\r\n\ta=a*10\r\n\tif a//b==c:\r\n\t\tans=i\r\n\t\tbreak\r\n\ta=a%b\r\n\ti+=1\r\nprint(ans)\r\n", "a,b,c = map(int,input().split())\r\n\r\nfor i in range(1,b+1):\r\n\r\n\ta = a*10\r\n\r\n\ttemp = a//b\r\n\r\n\ta = a%b\r\n\r\n\tif temp == c:\r\n\t\tprint(i)\r\n\t\texit()\r\nprint(-1)", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\na,b,pos=minput()\r\nfor i in range(b):\r\n\ta*=10\r\n\tc=a//b\r\n\ta=a%b\r\n\tif c==pos:\r\n\t\tprint(i+1)\r\n\t\texit()\r\nprint(\"-1\")", "a,b,c=map(int,input().split())\r\nfor i in range(1,1000000):\r\n d,a=divmod(a*10,b)\r\n if d==c:\r\n print(i)\r\n exit()\r\nprint(-1)\r\n", "# This code is contributed\n# Shubham Singh(SHUBHAMSINGH10)\n\ndef calculateFraction(num, den, target):\n if (num == 0):\n return \"0\"\n sign = -1 if (num < 0) ^ (den < 0) else 1\n num = abs(num)\n den = abs(den)\n initial = num // den\n res = \"\"\n if (sign == -1):\n res += \"-\"\n res += str(initial)\n if (num % den == 0):\n return res\n res += \".\"\n rem = num % den\n mp = {}\n index = 0\n repeating = False\n counter = 0\n while (rem > 0 and not repeating):\n if (rem in mp):\n index = mp[rem]\n repeating = True\n break\n else:\n mp[rem] = len(res)\n rem = rem * 10\n temp = rem // den\n counter += 1\n if temp == target:\n print(counter)\n return\n res += str(temp)\n rem = rem % den\n if rem == target:\n print(counter + 1)\n return\n \n if (repeating):\n res += \")\"\n x = res[:index]\n x += \"(\"\n x += res[index:]\n res = x\n \n print(-1)\n return\n\n\n# Driver code\ndef main():\n str_numbers = input().split(' ')\n num = int(str_numbers[0])\n dem = int(str_numbers[1])\n res = int(str_numbers[2])\n calculateFraction(num, dem, res)\n\nmain()\n \t\t \t\t \t \t \t\t\t\t \t \t\t", "\r\na,b,c = map(int, input().split())\r\nt = a\r\nq, r = divmod(t, b)\r\nfor i in range(1, 10**5+1):\r\n q, r = divmod(r*10, b)\r\n if q == c:\r\n print(i)\r\n exit()\r\nelse:\r\n print(-1)", "a,b,c=[int(i) for i in input().split(\" \")]\r\n\r\na=a%b\r\n\r\nf=1\r\nfor i in range(10000):\r\n if a<b:\r\n a=10*a\r\n res=a//b\r\n a=a%b\r\n if res==c:\r\n print(i+1)\r\n f=0\r\n break\r\n a%=b\r\nif f:\r\n print(-1)", "q,w,e=map(int,input().split())\r\ni=1\r\nq*=10\r\nwhile q//w!=e:\r\n q%=w\r\n q*=10\r\n i+=1\r\n \r\n if i>1000:\r\n i=-1\r\n break\r\nprint(i)\r\n", "\r\na,b,c = map(int,input().split())\r\n\r\n\r\nfor i in range(b):\r\n d,a = divmod(10 * a, b)\r\n if d == c:\r\n print(i + 1)\r\n exit()\r\nprint(-1)\r\n\r\n", "from sys import stdin, stdout\r\n\r\na, b, c = map(int, stdin.readline().split())\r\nsze = 10 ** 5\r\n\r\nfor i in range(1, sze + 1):\r\n cur = (a * 10) // b\r\n a = (a * 10) % b\r\n \r\n if cur == c:\r\n stdout.write(str(i))\r\n break\r\nelse:\r\n stdout.write('-1')", "#dt = {} for i in x: dt[i] = dt.get(i,0)+1\r\nimport sys;input = sys.stdin.readline\r\n#import io,os; input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline #for pypy\r\ninp,ip = lambda :int(input()),lambda :[int(w) for w in input().split()]\r\n\r\n\r\na,b,c = ip()\r\nans = -1\r\nfor i in range(10**6):\r\n a *= 10\r\n if a//b == c:\r\n ans = i+1\r\n break\r\n a %= b\r\nprint(ans)", "a, b, c = list(map(int, input().split()))\n\npos = 1\nfor i in range(1000000):\n\td = (10 * a) // b\n\ta = (10 * a) % b\n\tif c == d:\n\t\tprint(pos)\n\t\texit(0)\n\telse:\n\t\tpos += 1\nprint(-1)", "\ndef calculateFraction(num, den):\n\n\tif (num == 0):\n\t\treturn \"0\"\n\n\tsign = -1 if (num < 0) ^ (den < 0) else 1\n\n\tnum = abs(num)\n\tden = abs(den)\n\n\tinitial = num // den\n\n\tres = \"\"\n\n\tif (sign == -1):\n\t\tres += \"-\"\n\n\tres += str(initial)\n\n\tif (num % den == 0):\n\t\treturn res\n\n\tres += \".\"\n\n\trem = num % den\n\tmp = {}\n\n\tindex = 0\n\trepeating = False\n\twhile (rem > 0 and not repeating):\n\n\t\tif (rem in mp):\n\n\t\t\tindex = mp[rem]\n\t\t\trepeating = True\n\t\t\tbreak\n\n\t\telse:\n\t\t\tmp[rem] = len(res)\n\n\t\trem = rem * 10\n\n\t\ttemp = rem // den\n\t\tres += str(temp)\n\t\trem = rem % den\n\t\n\tif (repeating) :\n\t\tx = res[:index]\n\t\tx += res[index:]\n\t\tres = x\n\telse:\n\t\tres += \"0\"\n\n\treturn res\n\n\ndef find_decimal(decimal, c):\n for i in range(2, len(decimal)):\n if decimal[i] == str(c):\n print(i - 1)\n return\n \n print(-1)\n\nn = input()\nnumbers = n.split()\nnum = int(numbers[0])\nden = int(numbers[1])\ndigit = int(numbers[2])\n\nfraction = calculateFraction(num, den)\nfind_decimal(fraction, digit)\n \t\t\t\t \t\t \t \t\t \t \t \t\t\t\t", "ar = []\r\nar = input().split()\r\na = int(ar[0])\r\nb = int(ar[1])\r\nc = int(ar[2])\r\nd = 1\r\nfor i in range(1000) :\r\n d *= 10\r\nd = d * a\r\nd = d // b\r\nstring = str(d)\r\nwhile len(string) < 1000 :\r\n string = \"0\" + string\r\ni = 0\r\nfor dig in map(int, string):\r\n i += 1\r\n if dig == c :\r\n break\r\nif i == 1000 :\r\n print(-1)\r\nelse :\r\n print(i)", "a,b,c=map(int,input().split())\r\na=a%b \r\nans=[] \r\nfor _ in range(10**5):\r\n a=a*10\r\n ans.append(a//b)\r\n #print(a//b)\r\n a=a%b\r\nif c in ans:\r\n print(ans.index(c)+1)\r\nelse:\r\n print(-1)\r\n", "a,b,pos=map(int,input().split())\r\n\r\nfor i in range(b):\r\n\ta*=10\r\n\tc=a//b\r\n\ta=a%b\r\n\tif c==pos:\r\n\t\tprint(i+1)\r\n\t\texit()\r\nprint(\"-1\")", "a, b, c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nnum = []\ncnt = 0\nwhile True:\n\tcnt += 1\n\tnum.append( a )\n\tn = a*10//b\n\tif n == c:\n\t\tbreak\n\ta = a*10 - n*b\n\tif a in num:\n\t\tcnt = -1\n\t\tbreak\nprint( cnt )", "a,b,c=map(int,input().split())\r\nf=0\r\nd=a\r\nfor i in range(b):\r\n if a<b:\r\n a*=10\r\n if c==a//b:\r\n f=1\r\n if d>=b:\r\n print(i)\r\n else:\r\n print(i+1)\r\n break\r\n else:\r\n a=a%b\r\nif f==0:\r\n print(-1)", "a,b,c=map(int,input().split())\ni=1\na=a%b\nans=-1\nwhile(i<=b):\n\ta=a*10\n\tif a//b==c:\n\t\tans=i\n\t\tbreak\n\ta=a%b\n\ti+=1\nprint(ans)\n\n \t \t\t \t \t \t\t\t\t\t \t \t \t\t\t", "#540_B\n\nimport decimal\n\nln = [int(i) for i in input().split(\" \")]\na = ln[0]\nb = ln[1]\nc = ln[2]\n\noc = -1\n\nfor i in range(0, b + 5):\n q = (a * 10) // b\n a = (a * 10) % b\n if q == c:\n oc = i + 1\n break\n\nprint(oc)\n", "import bisect\r\n\r\ndef list_output(s): \r\n print(' '.join(map(str, s)))\r\n \r\ndef list_input(s='int'):\r\n if s == 'int':\r\n return list(map(int, input().split())) \r\n elif s == 'float':\r\n return list(map(float, input().split()))\r\n return list(map(str, input().split()))\r\n\r\n[a, b, c] = list(map(int, input().split()))\r\ncnt = 1\r\nfor _ in range(1000000):\r\n a *= 10\r\n d = a//b\r\n r = a%b\r\n if d == c:\r\n print(cnt)\r\n exit(0)\r\n a = r\r\n cnt += 1\r\nprint(-1)\r\n\r\n", "\r\nA = list(map(int, input().split()))\r\na = A[0]\r\nb = A[1]\r\nc = A[2]\r\n# get the mod of the number\r\na = a % b\r\nindex = 0\r\n# traverse for every decimal places\r\nfor i in range(1, b + 1):\r\n\r\n # convert to the decimal places\r\n a = a * 10\r\n\r\n # condition we are checking is (a*10/b)/c\r\n if int(a / b) == c:\r\n index = i\r\n break\r\n\r\n # mod the number again\r\n a = a % b\r\n\r\n# if we actually found an index\r\nif index != 0:\r\n print(index)\r\nelse:\r\n print(-1)", "a, b, c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nfor i in range(1001):\n if a*10//b == c:\n print(i + 1)\n exit(0)\n a = int(a*10%b)\nprint(-1)\n", "a, b, c = map(int, input().split())\r\nflag = -1\r\na = a % b\r\nfor i in range(1, 100000):\r\n temp = a*10//b\r\n if temp == c:\r\n flag = i\r\n break\r\n a = a * 10 % b\r\nprint(flag)", "a, b, c = map(int, input().split())\r\na %= b\r\n\r\nk = 0\r\nfor i in range(1000):\r\n cf = 0\r\n while (cf < 9 and (k * 10 + cf + 1) * b <= a * 10):\r\n cf += 1\r\n \r\n if cf == c:\r\n print(i + 1)\r\n exit(0)\r\n \r\n k = k * 10 + cf\r\n a *= 10\r\n \r\n \r\nprint(-1)", "import math as m\nMAX=10e5\ndef pos(a,b,c):\n\ta%=b\n\tfor i in range(1,b+1):\n\t\ta*=10\n\t\tif(int(a/b)==c):\n\t\t\treturn i\n\t\ta%=b\n\treturn -1\na,b,c=[int(i) for i in input().split()]\nprint(pos(a,b,c))\n\t \t \t\t \t\t\t\t \t\t\t \t \t\t\t\t\t \t\t \t\t", "a, b, c = map(int, input().split())\r\nfor i in range(b):\r\n a *= 10\r\n if a // b == c:\r\n print(i+1)\r\n break\r\n a %= b\r\nelse:\r\n print(-1)", "def solve():\r\n a, b, c = map(int, input().strip().split())\r\n ans = 1\r\n visited = set()\r\n while a not in visited:\r\n visited.add(a)\r\n dm = divmod(a * 10, b)\r\n if dm[0] == c:\r\n return ans\r\n a = dm[1]\r\n ans += 1\r\n return -1\r\n\r\n\r\nprint(solve())\r\n\r\n", "# Hello World program in Python\r\n \r\na,b,c=map(int, input().split())\r\npos=0 \r\nflag=False\r\nwhile(pos<10000):\r\n pos+=1\r\n a=a*10\r\n q=int(a/b)\r\n #print(q)\r\n if(q==c):\r\n #print(q)\r\n flag=True\r\n break;\r\n a=a%b\r\n\r\nif(flag):\r\n print(pos)\r\nelse:\r\n print(-1)", "a, b, c = map(int, input().split())\r\nprint(([i for i in range(1, int(1e3)) if (a * pow(10, i) // b) % 10 == c] + [-1])[0])", "a,b,c=[int(i) for i in input().split()]\r\nfrom decimal import Decimal,getcontext\r\ngetcontext().prec = 10000\r\ndef main():\r\n result=round(Decimal(a)/Decimal(b),10000)\r\n string=str(result)\r\n string=string[2:]\r\n comp=str(c)\r\n for i in range(10000):\r\n if string[i]==comp:\r\n print(i+1)\r\n return 0\r\n if i == 9998:\r\n print(-1)\r\n return 0\r\nmain()", "a,b,c=map(int,input().split())\r\n\r\nfor i in range(b):\r\n\tdiv=a*10//b\r\n\tif div==c:\r\n\t\tprint(i+1)\r\n\t\texit()\r\n\telse:\r\n\t\ta=a*10-div*b\r\nprint(-1)", "def position(a, b, c):\r\n for i in range(1, 200000):\r\n if (a * 10) // b == c:\r\n return i\r\n a = (a * 10) % b\r\n return -1\r\n\r\n\r\nA, B, C = [int(j) for j in input().split()]\r\nprint(position(A, B, C))\r\n", "a, b, c = (int(x) for x in input().split(' '))\r\n\r\nres = '.'\r\nfor i in range(b):\r\n s = a // b\r\n d = a % b\r\n if s == 0:\r\n a = a*10\r\n if i != 0:\r\n res += str(s)\r\n a = d*10\r\n if s == 1 and d == 0:\r\n res += '0'\r\n break\r\n\r\nif b == 2:\r\n res += '0'\r\n\r\nprint(res.find(str(c)))", "a,b,c = map(int,input().split())\r\na %= b\r\nfor i in range(10**6):\r\n\ta *= 10\r\n\tif(a//b == c):\r\n\t\tprint(i+1)\r\n\t\tbreak\r\n\ta %= b\r\nelse:\r\n\tprint(-1)\r\n\r\n", "a,b,c=map(int,input().split())\r\nfor i in range(1,b+1):\r\n a*=10\r\n if a//b==c:print(i);break\r\n a%=b\r\nelse:print(-1)", "n, m, r = [int(x) for x in input().split()]\nc = 0\nk = 0\nfor i in range(500):\n c += 1\n n *= 10\n d = n//m\n d = d % 10\n if d == r:\n k = 1\n print(c)\n break\nif k == 0:\n print('-1')\n\n \t \t \t\t\t \t \t\t\t \t \t\t\t \t\t\t", "#author : Piyush Rajendra Chaudhari\r\nimport math\r\n\r\na, b, c = list(map(int, input().split()))\r\nz = 0\r\nr = a\r\nfor i in range(1, 1000011):\r\n x = (10 * r) // b\r\n r = (10 * r) % b\r\n if c == x:\r\n print(i)\r\n z += 1\r\n break\r\n\r\nif z == 0:\r\n print(-1)\r\n", "a,b,c=[int(i) for i in input().split(\" \")]\r\nfor i in range(b):\r\n d,a=divmod(10*a,b)\r\n if d==c:\r\n print(i+1)\r\n exit()\r\nprint(\"-1\")", "a,b,c=map(int,input().split())\na%=b\nk=0\nfor i in range(1,b+1):\n a*=10\n\n if int(a/b)==c:\n print(i)\n k+=1\n break\n a%=b\nif k==0:\n print(-1)\n\n", "a,b,c=map(int,input().split())\r\na=(a%b)*10\r\nt=0\r\nr=0\r\nflag=0\r\nwhile r<b:\r\n r+=1\r\n t=a//b\r\n if t==c:\r\n flag=r\r\n \r\n break\r\n \r\n a%=b\r\n a*=10\r\n \r\nif flag:\r\n print(flag)\r\nelse:\r\n print(-1)\r\n \r\n", "# /**\r\n# * author: brownfox2k6\r\n# * created: 27/06/2023 22:48:46 Hanoi, Vietnam\r\n# **/\r\n\r\nimport decimal\r\n\r\ndecimal.getcontext().prec = 5000\r\na, b, c = map(int, input().split())\r\n\r\na = decimal.Decimal(a)\r\nb = decimal.Decimal(b)\r\n\r\nx = decimal.Decimal(a / b)\r\n\r\nx = str(x)[2:]\r\nc = str(c)\r\n\r\nif len(x) == 5000:\r\n x = x[:-1]\r\n\r\nif len(x) != 4999:\r\n x += '0'\r\n\r\nfor i in range(len(x)):\r\n if x[i] == c:\r\n exit(print(i+1))\r\nprint(-1)", "a,b,c=map(int,input().split())\r\nfor i in range(b):\r\n x,a=divmod(10*a,b)\r\n if(x==c):\r\n print(i+1)\r\n exit()\r\nprint(-1)", "from decimal import *\ngetcontext().prec = 2048\ngetcontext().rounding = ROUND_DOWN\nnum, denom, target = [int(x) for x in input().split()]\na = Decimal(num)/Decimal(denom)\na = str(a)\na = a[a.find('.') : ]\nif len(a) < 2047:\n a = a + '0'\nprint(a.find(str(target)))\n", "a,b,c = map(int,input().split())\r\nans = -1\r\nfor i in range(10**6):\r\n a *= 10\r\n if a//b == c:\r\n ans = i+1\r\n break\r\n a %= b\r\nprint(ans)", "a, b, c = list( map( int, input().split() ) )\r\n\r\nfor i in range( 2*b ):\r\n\r\n a *= 10\r\n\r\n if a // b == c:\r\n print( i + 1 )\r\n exit(0)\r\n\r\n a %= b\r\n\r\nprint( \"-1\" )\r\n", "a, b, c = map(int, input().split())\r\n\r\ni, all_a = 1, set()\r\nwhile True:\r\n n, a = divmod(10 * a, b)\r\n if n == c:\r\n print(i)\r\n break\r\n if a in all_a:\r\n print(-1)\r\n break\r\n i += 1\r\n all_a.add(a)\r\n", "a,b,c = map(int,(input().split()))\r\ncc=1\r\n\r\n\r\nfor i in range(100000):\r\n cc+=1\r\n a*=10\r\n if(a//b==c):\r\n print(cc-1)\r\n exit()\r\n a%=b\r\n\r\nprint(-1)", "a, b, c = map(int, input().split())\r\nn = 1\r\ndig = (10 * a) // b\r\nwhile dig % 10 != c and n < b + 1:\r\n\tn += 1\r\n\tdig = (10 * ((pow(10, n - 1, b) * a) % b)) // b\r\nif n > b:\r\n\tprint(-1)\r\nelse:\r\n\tprint(n)\r\n", "a, b, k = input().split(' ')\na = int(a)\nb = int(b)\n# b = int(input())\n\ncnt0 = 0\nv = a / b\nwhile (int(10 * v) == 0):\n v *= 10\n cnt0 += 1\n# if int(10 * (a / b)) == 0:\n# print(1)\n# exit(0)\n\nif k == '0' and cnt0 > 0:\n print(1)\n exit(0)\n\na *= int(10**100000)\n\na //= b\n\na = str(a)\n\n# print(a)\n\nl = len(a)\nfor i in range(l - 100):\n if a[i] == k:\n print(i + 1 + cnt0)\n exit(0)\n\nprint(-1)", "a,b,c = list(map(int,input().split()))\nrem = a%b\nlf = {}\nlf[rem]=True\ndiv = rem*10//b\nrem = (rem*10)%b\npdiv = div\nif div != c:\n pos = 2\n output = -1\n while True:\n divn = rem * 10 // b\n if c == divn:\n output = pos\n break\n if lf.get(rem,False):\n break\n lf[rem] = True\n rem = (rem*10)%b\n pos+=1\n print(output)\nelse:\n print(1)", "a,b,c=[int(i) for i in input().split()]\nf=False\nfor i in range(1,100000):\n k=a*10//b\n a=a*10%b\n if(k==c):\n f=True\n break\nif(f):\n print(i)\nelse:\n print(-1)\n \t\t\t \t \t\t\t\t\t \t \t \t" ]

[ "import operator as op\r\nimport re\r\nimport sys\r\nfrom bisect import bisect, bisect_left, insort, insort_left\r\nfrom collections import Counter, defaultdict, deque\r\nfrom copy import deepcopy\r\nfrom decimal import Decimal\r\nfrom functools import reduce\r\nfrom itertools import (\r\n accumulate, combinations, combinations_with_replacement, groupby,\r\n permutations, product)\r\nfrom math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,\r\n log2, pi, radians, sin, sqrt, tan)\r\nfrom operator import itemgetter, mul\r\nfrom string import ascii_lowercase, ascii_uppercase, digits\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlist():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef instr():\r\n s = input()\r\n return(list(s[:len(s)]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef def_value():\r\n return 0\r\n\r\n\r\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\n\r\nl1, r1, l2, r2, k = invr()\r\n\r\nif r2 < l1 or l2 > r1:\r\n print(0)\r\n sys.exit()\r\n\r\n\r\nL = max(l1, l2)\r\nR = min(r1, r2)\r\n\r\nres = R - L + 1\r\nif k >= L and k <= R:\r\n res -= 1\r\nif res < 0:\r\n print(0)\r\nelse:\r\n print(res)\r\n", "input_num = input().split()\r\ninput_num = list(map(lambda x: int(x), input_num))\r\nl1, r1, l2, r2, k = input_num\r\nt = r1 - l2 + 1\r\nif t < 0:\r\n t = 0\r\nt = min(r1, r2) - max(l1, l2) + 1\r\nif t < 0:\r\n t = 0\r\nelif max(l1, l2) <= k <= min(r1, r2):\r\n t -= 1\r\nprint(t)\r\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nl1, r1, l2, r2, k = [int(x) for x in input().split()]\r\nend = min(r1, r2)\r\nstart = max(l1, l2)\r\nans = end-start+1\r\nans -= 1 if start <= k <= end else 0\r\nprint(max(0, ans))", "import sys\r\n\r\ninput = sys.stdin.readline\r\nip = lambda: input().rstrip('\\n')\r\nIP = lambda: list(map(int, ip().split()))\r\nIPF = lambda: list(map(float, ip().split()))\r\n# import collections\r\n# import bisect\r\n\r\n# from p import logging\r\n#\r\n# log = logging.getLogger(\"cf.py\")\r\n# log.info(\"Log from cf.py\")\r\n\r\nl1, r1, l2, r2, k = IP()\r\n\r\nret = (max(l1, l2), min(r1, r2))\r\nif ret[0] > ret[1]:\r\n print(0)\r\nelif ret[0] <= k <= ret[1]:\r\n print(ret[1]-ret[0])\r\nelse:\r\n print(ret[1]-ret[0]+1)\r\n", "l1, r1, l2, r2, k = map(int, input().split())\r\n\r\nif r1 < l2 or r2 < l1:\r\n print(0)\r\nelif l1 <= l2 and r2 <= r1:\r\n if l2 <= k and k <= r2:\r\n print(r2 - l2)\r\n else:\r\n print(r2 - l2 + 1)\r\nelif l2 <= l1 and r1 <= r2:\r\n if l1 <= k and k <= r1:\r\n print(r1 - l1)\r\n else:\r\n print(r1 - l1 + 1)\r\nelif l1 <= l2 and r1 <= r2:\r\n if l2 <= k and k <= r1:\r\n print(r1 - l2)\r\n else:\r\n print(r1 - l2 + 1)\r\nelif l2 <= l1 and r2 <= r1:\r\n if l1 <= k and k <= r2:\r\n print(r2 - l1)\r\n else:\r\n print(r2 - l1 + 1)", "a, b, c, d, k = map(int, input().split())\r\nx = max(a, c)\r\ny = min(b, d)\r\nif x > y:\r\n print(0)\r\nelse:\r\n res = 1 + y - x\r\n if x <= k and k <= y: res -= 1\r\n print(res) ", "l1, r1, l2, r2, k = map(int, input().split())\r\n\r\nif l1 > r2 or r1 < l2:\r\n print(0)\r\n quit()\r\n\r\nt = max(min(r1, r2) - max(l1, l2), 0) + 1\r\n\r\nif (k >= l2 and k <= r2) and (k >= l1 and k <= r1):\r\n t -= 1\r\n\r\nprint(t)", "l1, r1, l2, r2, k= map(int,input().split())\r\nl = max(l1,l2)\r\nr = min(r1,r2)\r\nif l<=k<=r:\r\n print(max(0,r-l))\r\nelse:\r\n print(max(0,r-l+1))", "#n = int(input())\nn, m, l, r, k = map(int, input().split())\n#s = input()\n#c = list(map(int, input().split()))\nx = max(n, l)\ny = min(m, r)\nl = y - x + 1\nif x <= k and k <= y:\n l -= 1\nprint(max(0, l))", "X = list(map(int, input().split()))\r\nFirst = max(X[0], X[2])\r\nLast = min(X[1], X[3])\r\nAnswer = Last - First + 1\r\nprint(max(Answer, 0) if X[4] not in range(First, Last + 1) or Answer < 0 else Answer - 1)\r\n\r\n# UB_CodeForces\r\n# Advice: When you wanna success as bad as your breath, you'll be 100% successful\r\n# Location: Behind my desk at my own room\r\n# Caption: Doing my preparation\r\n# CodeNumber: 512\r\n", "l1,r1,l2,r2,k = map(int,input().split())\r\nl,r = max(l1,l2), min(r1,r2)\r\nif l>r:\r\n print(0)\r\nelse:\r\n if k>=l and k<=r:\r\n print(r-l)\r\n else:\r\n print(r-l+1)", "a, b, c, d, k = map(int, input().split())\r\nif a < c:\r\n a = c\r\nif b > d:\r\n b = d\r\nif a > b:\r\n print(0)\r\nelse:\r\n if a <= k and k <= b:\r\n print(b-a)\r\n else:\r\n print(b-a+1)", "l1, r1, l2, r2, k = map(int, input().split())\nl = max(l1, l2)\nr = min(r1, r2)\nif l <= k <= r:\n r -= 1\nprint(max(0, r-l+1))\n", "import sys\r\n\r\ns1,e1,s2,e2,k = map(int,sys.stdin.read().split())\r\n\r\ns = max(s1, s2)\r\ne = min(e1, e2)\r\n\r\nif e < s:\r\n print(0)\r\n exit(0)\r\n\r\nd = e-s+1\r\nif k >= s and k <= e:\r\n d -= 1\r\n\r\nprint(d)\r\n", "l1, r1, l2, r2, k = map(int, input().split())\n\nl = max(l1, l2)\nr = min(r1, r2)\n\ns = r - l + 1\nif l <= k and k <= r:\n s -= 1\n\nprint(max(0, s))\n", "l1,r1,l2,r2,k = map(int,input().split())\r\n\r\nif r1<l2 or r2<l1:\r\n print(0)\r\nelse:\r\n st,end = (max(l1,l2),min(r1,r2))\r\n if st<=k<=end:\r\n print(end-st)\r\n else:\r\n print(end-st+1)\r\n\r\n\r\n\r\n\r\n", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\nl1, r1, l2, r2, k = inp()\r\nout,start,end = 0,max(l1,l2),min(r1,r2)\r\nif (start<=end):\r\n out+=end-start\r\n if(k<start or k>end):\r\n out+=1\r\n\r\nprint(out)\r\n\r\n", "l1, r1, l2, r2, k = map(int, input().split())\nbeg = max(l1, l2)\nend = min(r1, r2)\n#print(beg, end)\nans = 0\nif beg <= end:\n ans += (end - beg + 1)\nif k >= beg and k <= end:\n ans -= 1\nprint(max(ans, 0))", "# print (\"Enter all the values\")\nl1, r1, l2, r2, k = (int(x) for x in input().split())\nanswer = -1\n\n# No overlaps\nif l1 > r2:\n answer = 0\nelif l2 > r1:\n answer = 0\n\n# One entirely inside the other\nelif l1 <= l2 and r2 <= r1:\n themin = l2\n themax = r2\nelif l2 <= l1 and r1 <= r2:\n themin = l1\n themax = r1\n\n# Overlapping\nelif l2 >= l1 and l2 <= r1:\n themin = l2\n themax = r1\nelif l1 >= l2 and l1 <= r2:\n themin = l1\n themax = r2\n\nif answer == -1:\n if themin <= k and k <= themax:\n answer = themax-themin\n else:\n answer = themax - themin + 1\n\nprint(answer)\n \n \n\n \n", "text=input()\r\nnum=text.split(\" \")\r\nnum=[int(x)for x in num]\r\nl1=num[0]\r\nr1=num[1]\r\nl2=num[2]\r\nr2=num[3]\r\nk=num[4]\r\nif(l2>r1 or r2<l1):\r\n print(0)\r\nelse :\r\n if(k>=max(l1,l2) and k<=min(r1,r2)):\r\n print(min(r1,r2)-max(l1,l2))\r\n else:\r\n print(min(r1,r2)-max(l1,l2)+1)", "l1,r1,l2,r2,k=map(int,input().split())\ns=0\nif(l2>=l1 and l2<=r1):\n\ts=min(r1,r2)-l2+1\n\tif(k>=l2 and k<=min(r1,r2)):\n\t\ts-=1\nelif(l2<l1):\n\tif(r2>=l1):\n\t\ts=min(r1,r2)-l1+1\n\t\tif(k>=l1 and k<=min(r1,r2)):\n\t\t\ts-=1\nprint(s)\n", "r1,l1,r2,l2,k = map(int,input().split())\r\np1 = max(r1,r2)\r\np2 = min(l1,l2)\r\np = p2-p1+1\r\nif(k>=p1 and k<=p2):p-=1\r\nif(p<0):p=0\r\nprint(p)\r\n", "l1,r1,l2,r2,k=map(int,input().split())\nl=max(l1,l2)\nr=min(r1,r2)\ns=max(0,r-l+1)\nif l<=k<=r:\n\ts-=1\nprint(s)\n", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[l1, r1, l2, r2, k] = list(map(int, input().split()))\r\nres = 0\r\nl3 = l1\r\nr3 = min(r1, k-1)\r\nif l3 <= r3:\r\n res += max(0, min(r2, r3)-max(l2, l3)+1)\r\nl4 = max(l1, k+1)\r\nr4 = r1\r\nif l4 <= r4:\r\n res += max(0, min(r2, r4)-max(l2, l4)+1) \r\nprint(res)\r\n \r\n", "l1,r1,l2,r2,k=(int(z) for z in input().split())\r\nL=max(l1,l2)\r\nR=min(r1,r2)\r\nans=0\r\nif L<=k<=R:\r\n ans-=1\r\nprint(max(ans+R-L+1,0))", "l1, r1, l2, r2, k = map(int,input().split())\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\n\r\nif l>r:\r\n print(0)\r\nelse:\r\n if k>=l and k<=r:\r\n print(r-l)\r\n else:\r\n print(r-l+1)\r\n", "a=input().split()\r\nl1=int(a[0])\r\nr1=int(a[1])\r\nl2=int(a[2])\r\nr2=int(a[3])\r\nk=int(a[4])\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\nif l>r:\r\n print('0')\r\nelse:\r\n ans=r-l+1\r\n if k<=r and k>=l:\r\n ans-=1\r\n print(ans)", "a,b,c,d,k=map(int,input().split())\r\na=max(a,c)\r\nb=min(b,d)\r\nif a<=b:\r\n if k>=a and k<=b:\r\n print(b-a)\r\n else:\r\n print(b-a+1)\r\nelse:\r\n print(\"0\")", "l1 , r1 , l2 , r2 , k = map(int,input().split())\r\n\r\nx = max(l1 , l2)\r\n\r\ny = min(r1 , r2)\r\n\r\nres = y - x + 1\r\n\r\nif y < x :\r\n print(0)\r\n exit()\r\n\r\nelse:\r\n if k == x or k == y or k > x and k < y :\r\n print(res - 1)\r\n else:\r\n print(res)\r\n\r\n\r\n", "l,r,p,q,k = map(int,input().split())\r\nf = 0\r\nt = 0\r\n\r\nif r<p or l>q:\r\n print(0)\r\nelse:\r\n if p>=l:\r\n f = p\r\n else:\r\n f = l\r\n\r\n if q<=r:\r\n t = q\r\n else:\r\n t = r\r\n\r\n ans = t-f+1\r\n if f<=k<=t:\r\n print(ans-1)\r\n else:\r\n print(ans)", "def solve(l1, r1, l2, r2, k):\r\n left = max(l1, l2)\r\n right = min(r1, r2)\r\n\r\n return max(0, right - left + 1 - (1 if k >= left and k <= right else 0))\r\n\r\nif __name__ == \"__main__\":\r\n l1, r1, l2, r2, k = map(int, input().split())\r\n print(solve(l1, r1, l2, r2, k))", "l, r, L, R, k=map(int, input().split())\r\nl=max(l, L)\r\nr=min(r, R)\r\nans=r-l+1\r\nif l<=k and k<=r:\r\n ans-=1\r\nprint(max(ans, 0))", "a,b,c,d,k=map(int,input().split())\r\nr=min(b,d)\r\nl=max(a,c)\r\nif l>r:\r\n\tprint(0)\r\nelse:\r\n\tif k>=l and k<=r:\r\n\t\tprint(r-l)\r\n\telse:\r\n\t\tprint(r-l+1)", "l1,r1,l2,r2,k=map(int,input().split())\r\nR=min(r1,r2)\r\nL=max(l1,l2)\r\nX=R-L+1\r\nif X<0:\r\n X=0\r\nif k>=L and k<=R and X>0:\r\n X-=1\r\nprint(X)", "a,b,c,d,k=map(int,input().split())\r\na=max(a,c)\r\nb=min(b,d)\r\nprint(max(0,b-a+1-(a<=k<=b)))", "l1,r1,l2,r2,k = map(int,input().split())\r\nmi,ma = max(l1,l2), min(r1,r2)\r\nif mi <= k <= ma:\r\n print(0 if ma-mi < 0 else ma-mi)\r\nelse:\r\n print(0 if ma-mi < 0 else ma-mi+1)", "l1, r1, l2, r2, k = map(int, input().split())\r\nif l2 > l1:\r\n l1 = l2\r\nif r2 < r1:\r\n r1 = r2\r\nprint(max(r1 - l1 + 1 - (l1 <= k <= r1), 0))", "l, r, ll, rr, k = map(int, input().split())\r\nl = max(l, ll)\r\nr = min(r, rr)\r\nans = r-l+1\r\nif k in range(l, r+1):\r\n ans -= 1\r\nprint(ans if ans > 0 else 0)", "# Wadea #\r\n\r\nl1,r1,l2,r2,k = map(int,input().split())\r\nll = max(l1,l2)\r\nrr = min(r1,r2)\r\nlr = rr - ll + 1\r\nif lr <= 0:\r\n print(0)\r\nelif ll <= k <= rr:\r\n print(lr-1)\r\n\r\nelse:\r\n print(lr)", "l = list(map(int, input().split()))\r\nedge = max(l[0], l[2]), min(l[1], l[3])\r\nans = edge[1] - edge[0] + 1\r\nif l[4] >= edge[0] and l[4] <= edge[1]:\r\n ans -= 1\r\nif ans < 0:\r\n ans = 0\r\nprint(ans)", "def gosti(l_1, r_1, l_2, r_2, k):\r\n if r_1 < l_2 or l_1 > r_2:\r\n return 0\r\n m = max(l_1, l_2)\r\n n = min(r_1, r_2)\r\n if max(l_1, l_2) <= k <= min(r_1, r_2):\r\n return min(r_1, r_2) - max(l_1, l_2)\r\n return min(r_1, r_2) - max(l_1, l_2) + 1\r\n\r\n\r\na1, b1, a2, b2, K = [int(i) for i in input().split()]\r\nprint(gosti(a1, b1, a2, b2, K))\r\n", "l1, r1, l2, r2, k = [int(num) for num in input().split()]\r\n\r\nrange = [max([l1, l2]), min(r1, r2)]\r\nnumMinutes = range[1] - range[0] + 1\r\nif k >= range[0] and k <= range[1]:\r\n numMinutes -= 1\r\n\r\nif numMinutes > 0:\r\n print(numMinutes)\r\nelse:\r\n print(0)", "from xmlrpc.client import MININT\r\n\r\n\r\ndef main():\r\n l1, r1, l2, r2, k = list(map(int, input().split()))\r\n\r\n left, right = max(l1, l2), min(r1, r2)\r\n minutes = right - left + 1\r\n if left <= k <= right:\r\n minutes -= 1\r\n\r\n if minutes <= 0:\r\n print(0)\r\n else:\r\n print(minutes)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\na,b,x,y,m=map(int,input().split())\nx=max(a,x)\ny=1+min(b,y)\nprint(max(0,y-x-(x<=m<y)))\n", "a,b,c,d,k = map(int,input().split())\r\nmx = max(a,c)\r\nmn = min(b,d)\r\nans = mn - mx + 1\r\nif mx<=k<=mn:\r\n ans-=1\r\nprint(max(ans,0))", "l1,r1,l2,r2,k=map(int,input().split())\r\nnach=max(l1,l2)\r\nkon=min(r1,r2)\r\nif nach>kon:\r\n print(0)\r\nelif nach<=k<=kon:\r\n print(kon-nach)\r\nelse:\r\n print(kon-nach+1)", "\r\na1, a2, b1, b2, k = list(map(int, input().split()))\r\nif a2<b1:\r\n print(0)\r\nelif a1==a2 or b1 == b2:\r\n if a1==k or b1==k:\r\n print(0)\r\n else:\r\n print(1)\r\nelif (a1>b1 and a1>b2) or (b1>a1 and b1>a2):\r\n print(0)\r\n\r\nelif b2>=a1>=b1:\r\n if a2>=b2:\r\n if a1<=k<=b2:\r\n print(b2-a1)\r\n else:\r\n print(b2-a1+1)\r\n else:\r\n if a1<=k<=a2:\r\n print(a2-a1)\r\n else:\r\n print(a2-a1+1)\r\nelif b2 >= a2 >= b1:\r\n if a1 >= b1:\r\n if a1 <= k <= a2:\r\n print(a2 - a1)\r\n else:\r\n print(a2 - a1 + 1)\r\n else:\r\n if b1 <= k <= a2:\r\n print(a2 - b1)\r\n else:\r\n print(a2 - b1 + 1)\r\n\r\nelif a1<=b1<=a2:\r\n if b2>=a2:\r\n if a2>=k>=b1:\r\n print(a2-b1)\r\n else:\r\n print(a2-b1+1)\r\n else:\r\n if b2>=k>=b1:\r\n print(b2-b1)\r\n else:\r\n print(b2-b1+1)\r\nelif a1<=b2<=a2:\r\n if b1>=a1:\r\n if b2>=k>=b1:\r\n print(b2-b1)\r\n else:\r\n print(b2-b1+1)\r\n else:\r\n if b2>=k>=a1:\r\n print(b2-a1)\r\n else:\r\n print(b2-a1+1)\r\n\r\n\r\nelse:\r\n if b1<=k<=a2:\r\n print(b1-a2)\r\n else:\r\n print(b1-a2+1)", "import sys\r\n\r\nl1,r1,l2,r2,k = map(int,sys.stdin.readline().split())\r\n\r\nans = 0\r\nl = max(l1,l2)\r\nr = min(r1,r2)\r\n\r\nif l<=r:\r\n ans = r-l+1\r\n if l<=k and k<=r:\r\n ans-=1\r\nprint(ans)\r\n", "l1, r1, l2, r2, k = [int(i) for i in input().split()]\r\n\r\nif (l1 > r2 or l2 > r1):\r\n print(0)\r\nelse:\r\n start = max(l1, l2)\r\n end = min(r1, r2)\r\n\r\n if (start <= k <= end):\r\n print(end - start)\r\n else:\r\n print(end - start + 1)", "l1,r1,l2,r2,k=list(map(int,input().split()))\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\nif l>r:print(0)\r\nelif l<=r:\r\n if l<=k<=r:print(r-l)\r\n else:print(r-l+1)", "l1, r1, l2, r2, k = map(int, input().split())\r\nansw = r2 - l2 + 1\r\nif(r1 < r2):\r\n answ -= r2 - r1\r\nif(l2 < l1):\r\n answ -= l1 - l2\r\nif(k <= r1 and k <= r2 and k >= l1 and k >= l2):\r\n answ -= 1\r\nif (answ < 0):\r\n answ = 0\r\nprint(answ)", "l1, r1, l2, r2, k = [int(x) for x in input().split()]\r\n\r\nl = max(l1, l2)\r\nr = min(r1, r2)\r\n\r\nif l>r:\r\n print(0)\r\nelif l<=r:\r\n if k>=l and k<=r:\r\n print(r-l)\r\n else:\r\n print(r-l+1)", "l1,r1,l2,r2,k=list(map(int,input().split()))\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\nif r<l:\r\n print(\"0\")\r\nelse:\r\n if k >=l and k<=r:\r\n print(r-l)\r\n else:\r\n print(r-l+1)", "l1,r1,l2,r2,k=map(int,input().split())\r\nma=max(l1,l2)\r\nmi=min(r1,r2)\r\nif k<=mi and k>=ma:\r\n\tprint(max(0,mi-ma))\r\nelse:\r\n\tprint(max(0,mi-ma+1))", "l1, r1, l2, r2, k = list(map(int, input().split()))\r\nl = max(l1, l2)\r\nr = min(r1, r2)\r\nif (l > r):\r\n print(0)\r\nelse:\r\n print(r - l + 1 - (l <= k <= r))", "s=input()\r\nc=0\r\nr = s.split(\" \")\r\nmx= max(int(r[0]),int(r[2]))\r\nmn= min(int(r[1]),int(r[3]))\r\n\r\nif mx>mn:\r\n print(0)\r\nelse:\r\n if int(r[4])>=mx and int(r[4])<=mn:\r\n c=mn-mx\r\n print(c)\r\n else:\r\n c=(mn-mx)+1\r\n print(c)\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n ", "x,y,a,b,k=map(int,input().split())\r\nxx=min(y,b)\r\nyy=max(a,x)\r\nif(k>=yy and k<=xx):\r\n print(max(0,xx-yy))\r\nelse:\r\n print(max(0,xx-yy+1))\r\n", "l1,r1,l2,r2,k=map(int,input().split())\r\nif (l1<l2):\r\n a=l2\r\nelse :\r\n a=l1 \r\nif (r1<r2):\r\n b=r1 \r\nelse :\r\n b=r2\r\ns=b-a+1 \r\nif (k>=a and k<=b):\r\n s-=1 \r\nif (l2<l1 and r2<l1) or (l2>r1 and r2>r1):\r\n s=0\r\nprint (s)", "l1,r1,l2,r2,k = map(int,input().split())\nM1 = max(l1,l2); M2 = min(r1,r2)\nres = max(M2 - M1+1, 0)\nif M1<=k<=M2:res-=1\nprint(max(0,res))", "l1 , r1 , l2 , r2 , k = map(int,input().split())\r\na = max(l1,l2)\r\nb = min(r1,r2)\r\nif a > b:\r\n print('0')\r\nelse:\r\n if k >= a and k <= b:\r\n print(b-a)\r\n else:\r\n print(b-a+1)", "a, b, c, d, k = map(int, input().split())\r\nr1, r2 = max(a, c), min(b, d)\r\nif (r1 <= k and k <= r2):\r\n res = max(0, r2 - r1)\r\nelse:\r\n res = max(0, r2 - r1 + 1)\r\nprint(res)\r\n", "l1,r1,l2,r2,k=map(int,input().split())\r\nans=0\r\nif(l1>=l2 and r2<=r1 and r2>=l1):\r\n ans=r2-l1+1\r\n if(k<=r2 and k>=l1):\r\n ans-=1\r\nelif (l2>=l1 and r2<=r1):\r\n ans=r2-l2+1\r\n if(k<=r2 and k>=l2):\r\n ans-=1\r\nelif (l2>=l1 and l2<=r1 and r2>=r1):\r\n ans=r1-l2+1\r\n if(k<=r1 and k>=l2):\r\n ans-=1\r\nelif (l2<=l1 and r2>=r1):\r\n ans=r1-l1+1\r\n if(k<=r1 and k>=l1):\r\n ans-=1\r\nprint(ans)\r\n\r\n\r\n\r\n", "import sys\nl1, r1, l2, r2, k = map(int, sys.stdin.readline().split())\nl = max(l1, l2)\nr = min(r1, r2)\nif r < l:\n print(0)\nelif l <= k and k <= r:\n print(r-l)\nelse:\n print(r-l+1)\n", "l1,r1,l2,r2,k=map(int,input().split())\r\nif l1<=l2<=r1<=r2:\r\n ans=r1-l2+1\r\n if l2<=k<=r1:ans-=1\r\nelif l1<=r1<l2<=r2 or l2<=r2<l1<=r1:\r\n ans=0\r\nelif l2<=l1<=r2<=r1:\r\n ans=r2-l1+1\r\n if l1<=k<=r2:ans-=1\r\nelif l1<=l2<=r2<=r1:\r\n ans=r2-l2+1\r\n if l2<=k<=r2:ans-=1\r\nelif l2<=l1<=r1<=r2:\r\n ans=r1-l1+1\r\n if l1<=k<=r1:ans-=1\r\nprint(ans) \r\n\r\n\r\n", "l1, r1, l2, r2,k=input().strip().split(' ')\r\nl1, r1, l2, r2,k=(int(l1),int(r1),int(l2),int(r2),int(k))\r\nif max(l1,l2)>min(r1,r2):\r\n print(0)\r\nelse:\r\n if max(l1,l2)<=k and k<=min(r1,r2):\r\n print(min(r1,r2)-max(l1,l2))\r\n else:\r\n print(min(r1,r2)-max(l1,l2)+1)", "a,b,c,d,k=map(int,input().split())\r\nx=min(b,d)\r\ny=max(a,c)\r\nif y<=k and k<=x:\r\n print(max(0,(x-y)))\r\nelse:\r\n print(max(0,(x-y+1)))", "l1,r1,l2,r2,k=map(int,input().split())\r\nif l2<l1:\r\n if r2<l1:\r\n print(0)\r\n else:\r\n if r2<r1:\r\n start=l1 \r\n end=r2\r\n else:\r\n start=l1 \r\n end=r1\r\n if k>=start and k<=end:\r\n print(end-start)\r\n else:\r\n print(end-start+1)\r\nelif l2>r1:\r\n print(0)\r\nelse:\r\n if r2<r1:\r\n start=l2\r\n end=r2\r\n else:\r\n start=l2 \r\n end=r1\r\n if k>=start and k<=end:\r\n print(end-start)\r\n else:\r\n print(end-start+1)\r\n \r\n ", "l, r, a, b, k = map(int, input().split())\r\nl = max(l, a)\r\nr = min(b, r)\r\nprint(max(r - l + 1 - (l <= k <= r), 0))\r\n", "inp=input().split()\r\ninp=list(map(int,inp))\r\nl1,r1,l2,r2,k=inp\r\nif(r1<l2 or r2<l1):\r\n\tprint ('0')\r\nelse:\r\n\ta=max(l1,l2)\r\n\tb=min(r1,r2)\r\n\tans=b-a+1\r\n\tif(a<=k and k<=b):\r\n\t\tans=ans-1\r\n\tprint (ans)", "l1,r1,l2,r2,k = map(int,input().split(' '))\nc = 0\nl = max(l1,l2)\nr = min(r1,r2)\nif l<=r:\n if k in range(l,r+1):\n print(r-l)\n else:\n print(r-l+1)\nelse:\n print('0')\n", "l1,r1,l2,r2,k=map(int,input().split())\r\na=max(l1,l2)\r\nb=min(r1,r2)\r\nif(b<a):\r\n print(0)\r\nelse:\r\n m=b-a+1\r\n if(k>=a and k<=b):\r\n m-=1\r\n print(m)", "l1,r1,l2,r2,k=map(int,input().split())\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\nx=r-l+1\r\nif(x<0):\r\n x=0\r\nif(k>=l and k<=r):\r\n x=x-1\r\nprint(x)", "l1, r1, l2, r2, k = [int(i) for i in input().split()]\r\nl = max (l1, l2)\r\nr = min (r1, r2)\r\nif r<l:\r\n print (0)\r\nelse:\r\n ans = r-l+1\r\n if l<=k<=r:\r\n ans -= 1\r\n print (ans)", "s=input()\r\nA=s.split(' ')\r\nl1=int(A[0])\r\nr1=int(A[1])\r\nl2=int(A[2])\r\nr2=int(A[3])\r\nk=int(A[4])\r\n\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\nif l>r:\r\n print(0)\r\nelse:\r\n if k>=l and k<=r:\r\n print(r-l)\r\n else:\r\n print(r-l+1)\r\n", "def main():\n l1, r1, l2, r2, k = map(int, input().split())\n l1, r1 = max(l1, l2), min(r1, r2)\n print(r1 - l1 + (not (l1 <= k <= r1)) if l1 <= r1 else 0)\n\n\nif __name__ == '__main__':\n main()\n", "if __name__ == '__main__':\r\n l1, r1, l2, r2, k = str(input()).split()\r\n l1 = int(l1)\r\n r1 = int(r1)\r\n l2 = int(l2)\r\n r2 = int(r2)\r\n k = int(k)\r\n if r1 < l2 or r2 < l1:\r\n print(0)\r\n else:\r\n min_r = min(r1, r2)\r\n max_l = max(l1, l2)\r\n if max_l <= k <= min_r:\r\n print(min_r - max_l)\r\n else:\r\n print(1 + min_r - max_l)\r\n", "l1,r1,l2,r2,k = map(int,input().split())\r\n\r\nif l2>r1 or l1>r2:\r\n print(0)\r\n exit()\r\nl,r = max(l1,l2),min(r1,r2)\r\nans = r-l+1\r\nif l<=k<=r:\r\n ans-=1\r\nprint(ans)\r\n", "inp = list(map(int, input().split()))\r\nl = max(inp[0], inp[2])\r\nr = min(inp[1], inp[3])\r\nres = max(r - l + 1, 0)\r\nprint(res - 1 if inp[4] >= l and inp[4] <= r else res)", "import math\r\n\r\nl1,r1,l2,r2,k=map(int,input().split())\r\n\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\n\r\nif l>r:\r\n print(0)\r\nelse:\r\n print(r-l+1-(k<=r and k>=l))", "l,r,a,b,k=map(int,input().split())\r\nif a>l:l=a\r\nif b<r:r=b\r\nprint(max(r-l+1-(l<=k<=r),0))", "l,r,a,b,k=map(int,input().split())\nif a>l:l=a\nif b<r:r=b\nprint(max(r-l+1-(l<=k<=r),0))\n\t \t \t\t\t \t\t \t\t\t \t \t", "a , b , x , y , k = map(int , input().split())\r\nr , l = max(a,x) , min(b , y)\r\nif k>=r and l>= k:\r\n print(max(0 , l-r))\r\nelse :\r\n print(max(0 , l-r+1))", "# A. Meeting of Old Friends\r\nl1,r1,l2,r2,k=map(int,input().split())\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\nif l>r:\r\n print(0)\r\nelse:\r\n ans=r-l+1\r\n if k>=l and k<=r:\r\n ans-=1\r\n print(ans)", "l1,r1,l2,r2,k = map(int,input().split())\r\n\r\ncommon=min(r1,r2)-max(l1,l2)+1\r\n\r\nif min(r1,r2)>=k and max(l1,l2)<=k:\r\n common=common-1\r\nprint(max(common,0))\r\n", "l1,r1,l2,r2,k=map(int, input().split())\r\n\r\na=max(l1,l2)\r\nb=min(r1,r2)\r\n\r\ntime= b-a+1\r\n\r\n\r\nif k<=b and k>=a:\r\n time-=1\r\n\r\nif time<0:\r\n print(0)\r\n exit(0)\r\n\r\n\r\nprint(time)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n l1, r1, l2, r2, k = map(int, input().split())\r\n l = max(l1, l2)\r\n r = min(r1, r2)\r\n if l <= r:\r\n ans = r - l + 1\r\n if k >= l and k <= r:\r\n ans -= 1\r\n else:\r\n ans = 0\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def f(a,b,c,d):\r\n ans=min(b,d)-max(a,c)\r\n ans+=1\r\n if ans<0:\r\n ans=0\r\n return ans\r\n\r\ndef solve(a,b,c,d,e):\r\n if a>b:\r\n a,b=b,a\r\n if c>d:\r\n c,d=d,c\r\n ans=f(a,b,c,d)\r\n if e>=a and e<=b and e>=c and e<=d:\r\n ans-=1\r\n return ans\r\n\r\na,b,c,d,e=map(int,input().split())\r\nprint(solve(a,b,c,d,e))\r\n", "l1, r1, l2, r2, k = map(int, input().split())\r\nans = 0\r\nif(l2>r1):\r\n ans = 0\r\nelif(l1>r2):\r\n ans = 0\r\nelse:\r\n ans = (1+abs(max(l1, l2)-min(r1, r2)))\r\n if(k <= min(r1, r2) and k >= max(l1, l2)):\r\n ans-=1\r\nprint(ans)", "a, b, c, d, e = map(int, input().split())\r\nf = max(a, c)\r\ng = min(b, d)\r\nif f > g: print(0)\r\nelif f <= e <= g: print(g -f)\r\nelse: print(g - f + 1)", "import sys\nl1, r1, l2, r2, k = map(int, sys.stdin.readline().strip().split())\nl, r = max(l1, l2), min(r1, r2)\nprint(0 if l > r else (r-l+1)-(l <= k <= r))", "a=list(map(int,input().split()))\r\nk=a[-1]\r\ndel a[-1]\r\n\r\nif a[0]>a[3] or a[2]>a[1]:\r\n print(0)\r\nelse:\r\n a.sort()\r\n print(a[2]-a[1]+1-int(a[1]<=k and k<=a[2]))", "l1,r1,l2,r2,k=map(int,input().split())\r\nmaximum=max(l1,l2)\r\nminimum=min(r1,r2)\r\ncount=0\r\nif(maximum<=k<=minimum):\r\n count-=1\r\nprint(max(count+minimum-maximum+1,0))", "if __name__ == '__main__':\r\n\tl1,r1,l2,r2,k = map(int, input().split())\r\n\tif l2 > l1:\r\n\t\tl1 = l2\r\n\tif r2 < r1:\r\n\t\tr1 = r2\r\n\tprint(max(r1-l1+1-(l1<=k<=r1),0))", "l1 ,r1 ,l2 ,r2, k = map(int,input().split())\r\n\r\nif( k >= max(l1,l2) and k <=min(r1,r2)):\r\n print(max(min(r1,r2)-max(l1,l2),0))\r\nelse:\r\n print(max((min(r2,r1)-max(l1,l2))+1,0))", "l1,r1,l2,r2,k = map(int, input().split())\r\na=max(l1,l2)\r\nb=min(r1,r2)\r\nif b-a>=0:\r\n if a<=k<=b:\r\n print(b-a)\r\n else:\r\n print(b-a+1)\r\nelse:\r\n print(0)", "a,b,c,d,e=map(int,input().split())\nf=max(a,c)\ng=min(b,d)\nif f>g:\n\tprint(0)\nelse:\n\tprint(g-f+int(not(f<=e<=g)))\n", "import math\r\n\r\n\r\ndef main_function():\r\n l_1, r_1, l_2, r_2, k = [int(i) for i in input().split(\" \")]\r\n if r_1 < l_2:\r\n print(0)\r\n elif r_2 < l_1:\r\n print(0)\r\n elif l_1 <= l_2 and r_1 >= r_2:\r\n if k >= l_2 and k <= r_2:\r\n print(r_2 - l_2)\r\n else:\r\n print(r_2 - l_2 + 1)\r\n elif l_1 >= l_2 and r_1 <= r_2:\r\n if k >= l_1 and k <= r_1:\r\n print(r_1 - l_1)\r\n else:\r\n print(r_1 - l_1 + 1)\r\n else:\r\n if k >= max(l_1, l_2) and k <= min(r_1, r_2):\r\n print(min(r_1, r_2) - max(l_1, l_2))\r\n else:\r\n print(min(r_1, r_2) - max(l_1, l_2) + 1)\r\n\r\n\r\n\r\nmain_function()", "\r\nif __name__=='__main__':\r\n\tl1, r1, l2, r2, k = map(int, input().split())\r\n\tres = min(r1, r2) - max(l1, l2) + 1\r\n\tif res < 0:\r\n\t\tres = 0\r\n\tif max(l1, l2) <= k <= min(r1, r2):\r\n\t\tres -= 1\r\n\tprint(res)", "l1,r1,l2,r2,k=map(int,input().split())\r\nif r1<l2:\r\n print(0)\r\nelse:\r\n if max(l1,l2)<=k<=min(r1,r2):\r\n print(max(min(r1,r2)-max(l1,l2),0))\r\n else:\r\n print(max(min(r1,r2)-max(l1,l2)+1,0))", "l1, r1, l2, r2, k = list(map(int , input().split()))\r\nres = 0 \r\nl = max(l1 , l2)\r\nr = min(r2, r1)\r\nif(l > r):\r\n print(0)\r\nelse:\r\n \r\n res = r - l\r\n\r\n if(k >= max(l1 , l2) and k <= min(r1, r2)):\r\n res -= 1 \r\n\r\n print(res+1)", "l1, r1, l2, r2, k = map(int, input().split())\r\nl3, r3 = max(l1, l2), min(r1, r2)\r\nprint(max(0, r3 - l3 + 1 - (k in range(l3, r3 + 1))))", "L1,R1,L2,R2,K = map(int, input().split())\r\nans=0\r\nL = max(L1,L2)\r\nR = min(R1,R2)\r\nif L<=R:\r\n ans=R-L+1\r\n if L<=K<=R:\r\n ans-=1\r\nprint(ans)\r\n", "'''// हर हर महादेव\r\n/*\r\nAditya Raj\r\n*/\r\n#include <bits/stdc++.h>\r\n// #include <string>\r\n// #include <conio.h>\r\n// #include <stdio.h>\r\nusing namespace std;\r\n\r\n#define B begin()\r\n#define E end()\r\n#define I iterator\r\nusing pii = pair<int, int>;\r\nusing vi = vector<int>;\r\n#define int unsigned long long\r\n#define noTLE ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);\r\n#define testcase_chalao_bhai \\\r\n int virus_arzk; \\\r\n cin >> virus_arzk; \\\r\n while (virus_arzk--)\r\n#define array_input_lelo_bhai \\\r\n int arr[n]; \\\r\n for (int i = 0; i < n; i++) \\\r\n cin >> arr[i]\r\n#define array_print_kardo_bhai \\\r\n for (int i = 0; i < n; i++) \\\r\n cout << arr[i] << ' '\r\n\r\nvoid code_iske_andar_hai()\r\n{\r\n int k, l1, r1, l2, r2;\r\n cin >> l1 >> r1 >> l2 >> r2 >> k;\r\n int l = max(l1, l2);\r\n int r = min(r1, r2);\r\n if (k >= l and k <= r)\r\n l++;\r\n cout << r - l + 1;\r\n}\r\n\r\nsigned main()\r\n{\r\n noTLE;\r\n // testcase_chalao_bhai\r\n code_iske_andar_hai();\r\n return 0;\r\n}'''\r\n\r\nl1, r1, l2, r2, k = map(int,input().split())\r\nl = max(l1, l2)\r\nr = min(r1, r2)\r\nif (k >= l and k <= r):\r\n l+=1\r\nif((r-l+1)>0):\r\n print(r-l+1)\r\nelse:\r\n print(0)", "l1, r1, l2, r2, k= map(int, input().split())\r\nl = max(l1, l2)\r\nr = min(r1, r2)\r\ns = (r-l)+1\r\nif k>=l and k<=r:\r\n s-=1\r\nprint(max(s, 0))", "import sys\r\nl1,r1,l2,r2,k=[int(x) for x in input().split()]\r\n\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\n\r\nif l>r:\r\n print(0)\r\nelse:\r\n if k<=r and l<=k:\r\n print(r-l)\r\n else:\r\n print(r-l+1)", "s_begin, s_end, f_begin, f_end, k = map(int, input().split())\n\nbegin = max(s_begin, f_begin)\nend = min(s_end, f_end)\nminutes = 0\nif begin > end:\n minutes = 0\nelif begin <= k <= end:\n minutes = end - begin\nelse:\n minutes = end - begin + 1\n\nprint(minutes)\n\n", "l1,r1,l2,r2,k=map(int,input().split());l1=max(l1,l2);r1=min(r1,r2);print(max(r1-l1+1-(l1<=k<=r1),0))", "l1,r1,l2,r2,k = [int(x) for x in input().split()]\n#print(l1,r1,l2,r2)\nleft = max(l1,l2)\n#print(left)\nright = min(r1,r2)\n#print(right)\nif left>right:\n\tprint(\"0\")\nelse:\n\tif k<=right and k>=left:\n\t\tprint(right-left)\n\telse:\n\t\tprint(right-left+1)\n", "l1,r1,l2,r2,k=map(int,input().split())\r\nm=max(l1,l2)\r\nn=min(r1,r2)\r\nif n>=m:\r\n if k in range(m,n+1):\r\n print(n+1-m-1)\r\n else:\r\n print(n+1-m)\r\nelse:\r\n print('0')", "l, r, a, b, k = list(map(int,input().split()))\r\nif a > l:\r\n l = a\r\nif b < r:\r\n r = b\r\nprint(max(r-l+1-(l <= k <= r), 0))\r\n", "l1,r1,l2,r2,k=map(int,input().split())\r\nc=0\r\nif(l2>=l1 and r2<=r1):\r\n\tc=c+r2-l2+1\r\n\tif l2<=k<=r2:\r\n\t\tc=c-1 \r\nelif(l2<l1 and r2<l1):\r\n\tc=c+0\r\nelif(l2>r1):\r\n\tc=c+0\r\nelif(l2>=l1 and r2>r1):\r\n\tc=c+r1-l2+1\r\n\tif l2<=k<=r1:\r\n\t\tc=c-1\r\nelif(l2<=l1 and r2>=r1):\r\n\tc=c+r1-l1+1\r\n\tif l1<=k<=r1:\r\n\t\tc=c-1\r\nelif(l2<=l1 and r2<=r1):\r\n\tc=c+r2-l1+1\r\n\tif l1<=k<=r2:\r\n\t\tc=c-1\r\nelif(l2==r2):\r\n\tc=c+1\r\n\tif k==l2 or k==r2:\r\n\t\tc=c-1\r\nelif(l2>r2):\r\n\tc=c+0\r\nprint(c)", "[l1,r1,l2,r2,k]=[int(x) for x in input().split()]\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\nc=r-l+1\r\nif k<=r and k>=l:\r\n c-=1\r\nif c<0:\r\n c=0\r\nprint(c)\r\n", "l1, r1, l2, r2, k = map(int, input().split())\na = max(l1, l2)\nb = min(r1, r2)\nprint(max(0, b - a + 1 - (a <= k <= b)))\n", "l1,r1,l2,r2,k = map(int,input().split())\r\nx,y = max(l1,l2), min(r1,r2)\r\nif x>y:\r\n print(0)\r\nelse:\r\n if k>=x and k<=y:\r\n print(y-x)\r\n else:\r\n print(y-x+1)", "def solve(l1, r1, l2, r2, k):\n if r2 < l1 or r1 < l2: return 0\n\n if l1 >= l2 and r2 >= l1:\n if r2 <= r1:\n res = r2-l1+1\n\n if l1 <= k <=r2:\n res-=1\n \n return res\n \n res = r1-l1+1\n\n if l1<= k <= r1:\n res-=1\n \n return res\n \n if l2>= l1:\n if r2>= r1:\n res = r1 -l2+1\n\n if l2 <= k<= r1:\n res-=1\n \n return res\n \n res = r2 - l2+1\n\n if l2 <= k<= r2:\n res -=1\n \n return res\n\n\nl1, r1, l2, r2, k = map(int, input().split())\n\n\nprint(solve(l1, r1, l2, r2, k))\n", "l1, r1, l2, r2, k = map(int, input().split(' '))\nl = max([l1, l2])\nr = min([r1, r2])\nif l > r:\n print(0)\nelif l <= k <= r:\n print(r - l)\nelse:\n print(r - l + 1)\n", "l1,r1,l2,r2,k=map(int,input().split())\r\nd=-max(l1,l2)+min(r1,r2)+1\r\nif d<=0:\r\n print(0)\r\nelse:\r\n if (k>=max(l1,l2))and(k<=min(r1,r2)):\r\n print(d-1)\r\n else:\r\n print(d)\r\n", "l1, r1, l2, r2, k = map(int, input().split())\r\nl1 = max(l1, l2)\r\nr1 = min(r1, r2)\r\nprint(max(r1-l1+1, 0) - (l1<=k<=r1))", "l1,r1,l2,r2,k = map(int,input().split())\n\nans = 0\nif l2<=r1 and l1<=r2:\n L = max(l1,l2)\n R = min(r1,r2)\n ans = R-L+1\n if L <= k <= R:\n ans -= 1\n\nprint(ans)\n", "a,b,c,d,k=map(int,input().split())\r\nx=min(b,d)-max(a,c)+1\r\nif x<0:\r\n x=0\r\nprint([x,x-1][k>=max(a,c) and k<=min(b,d)])\r\n", "l1,r1,l2,r2,k=list(map(int,input().split()))\r\nm=max(l1,l2)\r\nn=min(r1,r2)\r\nif l1<=l2<=r1 or l1<=r2<=r1:\r\n if m<=k<=n:\r\n print(n-m)\r\n else:\r\n print(n-m+1)\r\nelif l1>l2 and r1<r2:\r\n if l1<=k<=r1:\r\n print(r1-l1)\r\n else:\r\n print(r1-l1+1)\r\nelse:\r\n print(0)", "\r\n\r\n\r\nl1,r1,l2,r2,k = map(int,input().split())\r\n\r\n\r\nstart = max(l2,l1)\r\nend = min(r1,r2)\r\n\r\n\r\n\r\n\r\nif end>=start:\r\n total = end-start+1\r\n if start<=k<=end:\r\n print(max(total-1,0))\r\n else:\r\n print(total)\r\nelse:\r\n print(0)\r\n", "\r\nl1,r1,l2,r2,k=map(int,input().split())\r\nans=0\r\n# if l2>=l1 and r1>=r2:\r\n# \tans=r2-l2+1\r\n# \tif l2<=k<=r2:\r\n# \t\tans-=1\r\n# \telse:\r\n# \t\tpass\r\n# elif l1>=l2 and r2<=r1 and r2>=l1:\r\n# \tans=r2-l1+1\r\n# \tif l1<=k<=r2:\r\n# \t\tans-=1\r\n# \telse:\r\n# \t\tpass\r\n# elif l2>=l1 and r2>=r1 and r1>=l2:\r\n# \tans=r1-l2+1\r\n# \tif l2<=k<=r2:\r\n# \t\tans-=1\r\n# \telse:\r\n# \t\tpass\r\n# elif l2<=l1 and r2>=r1:\r\n# \tans=r1-l1+1\r\n# \tif l1<=k<=r1:\r\n# \t\tans-=1\r\n# \telse:\r\n# \t\tpass\r\n# else:\r\n# \tans=0\r\n# print(ans)\r\n\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\nif l>r:\r\n\tans=0\r\nelse:\r\n\tif l<=k<=r:\r\n\t\tans=r-l\r\n\telse:\r\n\t\tans=r-l+1\r\nprint(ans)", "\n\nline = input()\nl = line.split()\nl1 = int(l[0])\nr1 = int(l[1])\nl2 = int(l[2])\nr2 = int(l[3])\nk = int(l[4])\nspent = 0\nif l2 > r1 or r2 < l1:\n\tspent = 0 \nelse:\n\tif l1 > l2:\n\t\tstart = l1 \n\telse:\n\t\tstart = l2 \n\tif r1 < r2:\n\t\tfinish = r1 \n\telse: \n\t\tfinish = r2 \n\tspent = finish - start + 1\n\tif k >= start and k <= finish:\n\t\tspent -= 1\n\nprint(spent)\n", "l1,r1,l2,r2,k=map(int,input().split())\r\nx,y=max(l1,l2),min(r1,r2)\r\nm=y-x+1\r\nif x<=k<=y:\r\n\tm-=1\r\nprint(max(m,0))", "# 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\nl1,r1,l2,r2,k=ints()\r\nl=max(l1,l2)\r\nr=min(r1,r2)\r\nif l>r:\r\n print(0)\r\nelse:\r\n ans=r-l+1\r\n if l<=k<=r:\r\n ans-=1\r\n print(ans)", "l = input().split()\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\n\r\nans = min(l[1], l[3]) - max(l[0], l[2]) + 1\r\n\r\nif max(l[0], l[2]) <= l[4] <= min(l[1], l[3]):\r\n ans -= 1\r\n\r\nif ans > 0:\r\n print(ans)\r\nelse:\r\n print('0')", "'''\r\nCodeforces div 371\r\n@autor Yergali B\r\n'''\r\n#n=int(input())\r\na,b,c,d,k=map(int,input().split())\r\nf=max(a,c)\r\ng=min(b,d)\r\nif f>g:\r\n print(0)\r\nelse:\r\n print(g-f+int(not(f<=k<=g)))\r\n\r\n", "\r\nl1,r1,l2,r2,k=map(int,input().split())\r\nif (l1>= l2):\r\n l=l1\r\nelse:\r\n l=l2\r\nif r1>=r2:\r\n r=r2\r\nelse:\r\n r=r1\r\n\r\nif l>r:\r\n print(0)\r\nelse:\r\n ans=r-l\r\n if k>=l and k<=r:\r\n print(ans)\r\n else:\r\n print(ans+1)", "l1, r1, l2, r2, k = [int(i) for i in input().split()]\r\nl = max(l1, l2)\r\nr = min(r1, r2)\r\n\r\nif l > r:\r\n print(0)\r\nelse :\r\n if l <= k <= r:\r\n print(r - l)\r\n else:\r\n print(r - l + 1)\r\n", "l1, r1, l2, r2, k = map(int, input().split())\r\nans = 0\r\nL = max(l2, l1)\r\nR = min(r2, r1)\r\nif (L<=R):\r\n ans = R - (L-1)\r\n if L<=k and R>=k:ans = ans - 1\r\nprint(ans)", "l1, r1, l2, r2, k = map(int, input().split())\n\nif l1 > l2:\n l1, l2 = l2, l1\n r1, r2 = r2, r1\n \nif r1 < l2:\n print(0)\n\nelse:\n if r1 < r2:\n if k < l2 or k > r1:\n print(r1 - l2 + 1)\n \n else:\n print(r1 - l2)\n else:\n if k < l2 or k > r2:\n print(r2 - l2 + 1)\n \n else:\n print(r2 - l2) \n \n'''s = set()\ns1 = set()\n\nfor i in range(l1, r1 + 1):\n if i != k:\n s.add(i)\n \nfor i in range(l2, r2 + 1):\n s1.add(i)\n \ns.intersection_update(s1)\nprint(len(s))\n '''", "a,b,c,d,k=map(int,input().split())\nx=max(a,c)\ny=min(b,d)\nif a>d or c>b:\n print(\"0\\n\")\nelse:\n if k>=x and k<=y:\n print(y-x)\n else:\n print(y-x+1)\n \n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nl1, r1, l2, r2, k = map(int, input().split())\r\nl, r = max(l1, l2), min(r1, r2)\r\nans = max(r - l + 1, 0)\r\nif l <= k <= r:\r\n ans -= 1\r\nprint(ans)", "a, b, c, d, e = map(int, input().split())\r\n\r\nl = max(a, c)\r\n\r\ns = min(b, d)\r\n\r\nif s < l:\r\n print(0)\r\n\r\nelif l <= e <= s:\r\n\r\n print(s - l)\r\n\r\nelse:\r\n\r\n print(s - l+1)", "a , b , x , y , k = map(int , input().split())\r\nr , l = max(a,x) , min(b , y)\r\nif r>l:\r\n print(0)\r\nelif k>=r and k<=l:\r\n print(l-r)\r\nelse:\r\n print(l-r+1)", "a,b,c,d,e=input(\"\").split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\ne=int(e)\r\nz=0\r\n\r\nif a>d or c>b:\r\n\tprint(0)\r\n\texit()\r\nif c>a:\r\n\tz=z+min(b,d)-c+1\r\n\tif e>=c and e<=min(b,d):\r\n\t\tz=z-1\r\n\r\nelse:\r\n\tz=z+min(b,d)-a+1\r\n\tif e>=a and e<=min(b,d):\r\n\t\tz=z-1\r\nprint(z)\t\t", "inp = list(map(int, input().split()))\r\nl = max(inp[0], inp[2])\r\nr = min(inp[1], inp[3])\r\nprint(max(r - l + 1, 0) - (l <= inp[4] <= r))\r\n", "import math\r\ndef _input(): return map(int ,input().split())\r\n\r\nl1, r1, l2, r2, k = _input()\r\nm = max(l1, l2); M = min(r1, r2)\r\nif m > M: print(0)\r\nelse:\r\n res = -m + M+1\r\n if k >= m and k<=M: res-=1\r\n print(res)\r\n", "a,b,c,d,k=map(int,input().split())\r\nl=max(a,c)\r\nr=min(b,d)\r\nif r<l:\r\n print(0)\r\nelif l<=k<=r and a<=k<=b:\r\n print (r-l)\r\nelse :\r\n print (r-l+1)", "l1, r1, l2, r2, k = input().split()\r\nleft = max(int(l1), int(l2))\r\nright = min(int(r1), int(r2))\r\nif (right - left >= 0):\r\n if (left <= int(k) <= right):\r\n print(right - left)\r\n else:\r\n print(right - left + 1)\r\nelse:\r\n print(0)", "from __future__ import division, print_function\r\nimport sys\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\nimport os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\n#from functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\n\r\nl1,r1,l2, r2,k = mapi()\r\nres = max(0,min(r1,r2)-max(l1,l2)+1)\r\n#print(min(r1,r2),max(l1,l2))\r\nif min(r1,r2)>=k>=max(l1,l2):\r\n res-=1\r\nprint(res)\r\n " ]

[ "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\n\r\ndef word_correction(s):\r\n result = []\r\n result.append(s[0])\r\n left = 0\r\n right = 1\r\n while right < len(s):\r\n if not s[left] in vowels or not s[right] in vowels:\r\n result.append(s[right])\r\n left = right\r\n right += 1\r\n return ''.join(result)\r\n \r\nn = int(input())\r\ns = input()\r\nprint(word_correction(s))", "n=int(input())\r\nch=str(input())\r\nl=list(ch)\r\n#print(l)\r\n\r\nfor i in range(n-1):\r\n if((l[i] in {'a','e','i','o','u','y'}) or (l[i] in {\".\"})):\r\n if(l[i+1] in {'a','e','i','o','u','y'}):\r\n l[i+1]=\".\"\r\nch=\"\"\r\nfor i in l:\r\n if (i!=\".\"):\r\n ch=ch+i\r\nprint(ch)\r\n \r\n", "# from dust i have come dust i will be\n\nn=int(input())\ns=input()\n\na=['a','e','i','o','u','y']\n\nch='#'\nfor i in range(n):\n\n if s[i] not in a:\n if ch!='#':\n print(ch,end='')\n ch='#'\n\n print(s[i],end='')\n\n else:\n if ch=='#':\n ch=s[i]\n\nif ch!='#':\n print(ch)\n", "v=int(input())\r\ns=list(input())\r\ni=0\r\nwhile(i+1<len(s)):\r\n if(s[i] in 'aeiouy' and s[i+1] in 'aeiouy'):\r\n del s[i+1]\r\n else:\r\n i+=1\r\nprint(''.join(s))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nstring=input()\r\nlist1=[]\r\ntemp=\"\"\r\nfor i in range(0,len(string)):\r\n if string[i] in 'aeiouy':\r\n temp+=string[i]\r\n else:\r\n if(len(temp)>0):\r\n list1.append(temp)\r\n list1.append(string[i])\r\n temp=\"\"\r\n\r\nif(len(temp)>0):\r\n list1.append(temp)\r\nfor i in list1:\r\n print(i[0],end=\"\")", "nn = int(input())\r\ntxt = input()\r\ntxt = list(txt)\r\narr = ['a','e','i','o','u','y']\r\nbol = [True]*len(txt)\r\n#print(bol)\r\n#print(txt)\r\nfor i in range(1,len(txt)):\r\n if(txt[i] in arr and txt[i-1] in arr):\r\n bol[i] = False\r\nfor i in range(len(bol)):\r\n if(bol[i]==True):\r\n print(txt[i],sep='',end='')", "import sys\n\nn = int(input())\n\ns = input()\n\ns = s + '$'\nsets = set()\n\nsets.update('a', 'e', 'i','o', 'u', 'y')\n\nfor i in range(n):\n\n\tif s[i] not in sets:\n\t\tprint(s[i], end='')\n\n\telse:\n\n\t\tif s[i-1] in sets:\n\t\t\tcontinue\n\t\telse:\n\n\t\t\tprint(s[i], end='')\n", "n = int(input())\r\ns = list(input())\r\nv = \"aeiouy\"\r\n\r\n\r\ndef vowel(c):\r\n return not v.find(c) != -1\r\n\r\n\r\nans = s[0]\r\nfor i in range(1, n):\r\n if vowel(s[i-1]) or vowel(s[i]):\r\n ans += s[i]\r\nprint(ans)\r\n", "n,s,c=int(input()),input(),0\r\ncs,bol=set('aeiouy'),False\r\nfor i in range(n):\r\n if s[i-c] in cs:\r\n if bol:\r\n s=s[:i-c]+s[i-c+1:]\r\n c+=1\r\n bol=True\r\n else:\r\n bol=False\r\nprint(s)\r\n", "n = int(input())\r\na = input()\r\nres = a[0]\r\ns = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\nfor i in a[1:]:\r\n if i in s and res[-1] not in s:\r\n res += i\r\n elif i not in s:\r\n res += i\r\nprint(res)", "vowel=\"aeiouy\"\r\nn=int(input().strip())\r\ns=input().strip()\r\ns=\"3\"+s\r\ncount=0\r\nout=\"\"\r\nturn=True\r\nfor c in s:\r\n if c not in vowel:\r\n out+=c\r\n turn=True\r\n else:\r\n if turn:\r\n out+=c\r\n turn=False\r\nprint(out[1:])\r\n \r\n \r\n \r\n\r\n \r\n \r\n", "n = int(input())\r\ns = input()\r\n\r\nvowels = set('aeiouy')\r\nresult = []\r\nfor c in s:\r\n if result and result[-1] in vowels and c in vowels:\r\n continue\r\n result.append(c)\r\n\r\nresult = ''.join(result)\r\n\r\nif not result:\r\n print()\r\nelse:\r\n print(result)\r\n", "n = int(input())\r\ns = input()\r\n\r\ndic = {'a', 'e', 'i', 'o', 'u', 'y'}\r\ng = []\r\nprev = ''\r\n\r\nfor k in range(n):\r\n ch = s[k]\r\n if ch in dic and prev in dic:\r\n prev = ch\r\n continue\r\n else:\r\n g.append(ch)\r\n prev = ch\r\nprint(''.join(g))", "n = int(input())\r\nword = [i for i in input()]\r\nx = 0\r\nwhile(x < n):\r\n if(word[x] in {\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"}):\r\n if(x+1 < n and word[x+1] in {\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"}):\r\n del(word[x+1])\r\n n-=1\r\n x-=1\r\n x+=1\r\nprint(\"\".join(word))\r\n", "n = input()\nword = input()\n\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\nres = []\n\nlast_is_vowel = False\n\nfor letter in word:\n if(letter in vowels):\n if(last_is_vowel == False):\n res.append(letter)\n last_is_vowel = True\n else:\n res.append(letter)\n last_is_vowel = False\n\nfor i in res:\n print(i, end='')\nprint()\n\n\n \t \t \t \t\t \t\t \t \t \t", "n = int(input())\r\ns = input()\r\nwhile True:\r\n f = True\r\n for i in range(1, len(s)):\r\n if s[i - 1] in ('a', 'e', 'i', 'o', 'u', 'y') and s[i] in ('a', 'e', 'i', 'o', 'u', 'y'):\r\n s = s[:i] + s[i + 1:]\r\n f = False\r\n break\r\n if f:\r\n break\r\n \r\nprint(s)", "a=int(input())\r\nb=input()\r\nlista=['a','e','i','o','u','y']\r\ncontador=1\r\nfor i in range(a):\r\n if(contador>=a):\r\n break;\r\n\r\n\r\n while ((b[contador-1] in lista and b[contador] in lista) and (len(b)>contador)):\r\n \r\n b=b[:contador]+b[contador+1:]\r\n a=len(b)\r\n \r\n if(contador>=a):\r\n break;\r\n\r\n contador+=1\r\nprint(b)\r\n\r\n\r\n \r\n\r\n", "vowels = list('aeiouy')\n\ninput()\ns = input()\n\ntrack = False\nremove = set()\nfor i in range(len(s)):\n if s[i] in vowels:\n if not track:\n track = True\n else:\n remove.add(i)\n else:\n track = False\n\nprint(''.join([l for i, l in enumerate(s) if i not in remove]))\n\t \t \t \t\t\t\t\t \t \t \t \t\t", "input()\ns = input()\nf = 0\ni = 0\nwhile i < len(s):\n if s[i] in 'aeiouy':\n if f:\n s = s[:i] + s[i + 1:]\n continue\n else:\n f = 1\n else:\n f = 0\n i += 1\nprint(s)\n", "n=int(input())\r\ns=str(input())\r\nl=list(s)\r\np=[\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\nnl=[]\r\nfor i in range(0,n-1):\r\n if l[i] in p and l[i+1] in p:\r\n nl.append(i+1)\r\nc=0\r\nfor i in nl:\r\n l.pop(i-c)\r\n c=c+1\r\ns=\"\"\r\ns=s.join(l)\r\nprint(s)", "n = int(input())\r\ns = input()\r\nk = \"\"\r\nvow = \"aeiouy\"\r\n\r\ni = 0\r\nwhile True:\r\n if i>len(s)-1 or len(s)==1:\r\n break\r\n \r\n if i+1<len(s) and s[i] in vow and s[i+1] in vow:\r\n s = s[:i+1] + s[i+2:]\r\n \r\n else:\r\n i += 1\r\n \r\nprint(s)", "n=int(input())\r\ns=input()\r\nl=[]\r\nl.append(s[0])\r\nfor i in range(1,len(s)):\r\n if((l[len(l)-1]==\"a\" or l[len(l)-1]==\"e\" or l[len(l)-1]==\"i\" or l[len(l)-1]==\"o\" or l[len(l)-1]==\"u\" or l[len(l)-1]==\"y\" )and ( 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 pass\r\n else:\r\n l.append(s[i])\r\nfor i in range(len(l)):\r\n print(l[i],end=\"\")\r\n", "VOWELS = 'aeiouy'\n\nn = int(input())\ns = input()\n\nprint(*(y for x, y in zip('x' + s, s) if x not in VOWELS or y not in VOWELS), sep='')\n", "class Word_Correction:\r\n\r\n def main(self):\r\n\r\n self.num = int(input())\r\n self.word = input()\r\n self.lword = list(self.word)\r\n self.length = len(self.lword)\r\n i = 0\r\n while( i < self.length-1):\r\n if((self.lword[i] == 'a' or self.lword[i] == 'e' or self.lword[i] == 'i' or self.lword[i] == 'o' or self.lword[i] == 'u' or self.lword[i] == 'y') and\r\n (self.lword[i+1] == 'a' or self.lword[i+1] == 'e' or self.lword[i+1] == 'i' or self.lword[i+1] == 'o' or self.lword[i+1] == 'u' or\r\n self.lword[i+1] == 'y')):\r\n del(self.lword[i+1])\r\n self.length = len(self.lword)\r\n i = 0\r\n else :\r\n i = i + 1\r\n self.result = ''.join(self.lword)\r\n print(self.result)\r\n \r\n\r\nwc = Word_Correction()\r\nwc.main()", "from collections import deque\r\nn = int(input())\r\ns = list(input())\r\na = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\nd = [s[0]]\r\n\r\nfor i in range(1, n):\r\n d.append(s[i])\r\n if d[-2] in a and d[-1] in a:\r\n d.pop()\r\nprint(\"\".join(d))\r\n", "n = int(input())\r\ns = [x for x in input()]\r\n\r\nv = ['a', 'e', 'i', 'o', 'u','y']\r\nans = ''\r\ni = 0\r\nwhile i<(len(s)):\r\n if(s[i] not in v):\r\n ans+=s[i]\r\n else:\r\n ans+=s[i]\r\n while(i<len(s) and s[i] in v):\r\n i+=1\r\n i-=1\r\n i+=1\r\n \r\nprint(ans)\r\n\r\n", "n = int(input())\ns = input()\nans = ''\nvow = ['a', 'e', 'i', 'o', 'u', 'y']\nprint(s[0], end = '')\nfor i in range(1, n):\n if s[i] not in vow:\n print(s[i], end = '')\n elif s[i] in vow and s[i - 1] not in vow:\n print(s[i], end = '')\n\n#print(ans)", "w, n, s = int(input()), list(reversed(input())), 'aeouiy'\r\nfor i in range(w):\r\n if i != w - 1 and n[i] in s and n[i + 1] in s:\r\n n[i] = '.'\r\nn.reverse()\r\nprint(*[i for i in n if i != '.'], sep='')\r\n", "n = int(input())\r\nl = list(input())\r\ne = ['a','e','y','i','o','u']\r\nj = []\r\ns = True\r\nfor i in l:\r\n if i not in e:\r\n j.append(i)\r\n if s == False:\r\n s = True\r\n else:\r\n if s:\r\n j.append(i)\r\n s = False\r\nprint(''.join(j))", "n=input()\ns=list(input())\nv=set(['a','e','i','o','u','y'])\nfor i in range(len(s)-1,0,-1):\n if s[i] in v and s[i-1] in v:\n del(s[i])\nprint(''.join(s))\n", "n = int(input())\r\nword = input()\r\n\r\ndef change_word(word):\r\n\tvowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\n\tprew = \" \"\r\n\tfor i in range(len(word)):\r\n\t\tletter = word[i]\r\n\t\tif prew in vowels and letter in vowels:\r\n\t\t\tword = word[:i] + word[i+1:]\r\n\t\t\treturn word\r\n\t\tprew = letter\r\n\r\n\treturn word\r\n\r\nprew = word\r\ncurr = change_word(word)\r\n\r\nwhile prew != curr:\r\n\tprew = curr \r\n\tcurr = change_word(curr)\r\n\r\nprint(curr)", "n = int(input())\ns = input()\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\ncont = 0\ni = 0\n# for i in range(n):\nwhile(i < n):\n if(i < n):\n if(s[i] in vowels):\n if(cont !=0):\n #splice\n s = s[0:i] + s[i+1:n]\n n-=1\n i = 0\n cont = 0\n else:\n cont+=1\n i+=1\n else:\n cont = 0\n i+=1\nprint(s)\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\nvowel = \"aeiouy\"\r\nfirst = 0\r\nfor x in s:\r\n\tif x in vowel and not first:\r\n\t\tfirst = 1\r\n\t\tprint(x, end=\"\")\r\n\telif x not in vowel:\r\n\t\tfirst = 0\r\n\t\tprint(x, end=\"\")\r\nprint()\r\n", "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\n\nn = int(input())\n\nw = list(input())\n\nto_remove = []\nfor i, l in enumerate(w):\n if i < len(w) - 1 and l in vowels and w[i + 1] in vowels:\n to_remove.append(i + 1)\n\nfor i in reversed(to_remove):\n del w[i]\n\nprint(''.join(w))", "n=int(input())\r\ns=input();c='z'\r\nfor x in s:\r\n if x not in 'aeiouy': print(x,end='')\r\n elif c not in 'aeiouy': print(x,end='')\r\n c=x\r\n", "import itertools\r\n\r\n\r\ndef main():\r\n l = int(input())\r\n n = input()\r\n vowels = \"aeiouy\"\r\n i = 1\r\n res = [n[0]]\r\n while i<len(n):\r\n if not (res[-1] in vowels and n[i] in vowels):\r\n res.append(n[i])\r\n i += 1\r\n\r\n print(\"\".join(res))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ns = str(input())\r\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\nto_add = set(vowels)\r\nres = []\r\nflag = None\r\n\r\nfor i in range(len(s)):\r\n if s[i] not in to_add and flag:\r\n res.append(flag)\r\n res.append(s[i])\r\n flag = None\r\n elif s[i] not in to_add:\r\n res.append(s[i])\r\n elif s[i] in to_add and flag == None:\r\n flag = s[i]\r\n\r\nif flag != None:\r\n res.append(flag)\r\n\r\nprint(\"\".join(res))", "length = int(input())\nword = list(input())\nvowels = \"aeiouy\"\nposition = 1\n\nfor _ in range(1, length):\n if word[position] in vowels and word[position - 1] in vowels:\n word.pop(position)\n else:\n position += 1\n\nprint(\"\".join(word))\n", "glas = ['a', 'e', 'i', 'o', 'u', 'y']\r\nn = int(input())\r\ns = input()\r\nres = s[0]\r\nfor i in range(1, len(s)):\r\n if s[i] in glas and s[i - 1] in glas:\r\n pass\r\n else:\r\n res += s[i]\r\nprint(res)", "l = int(input())\r\ns = list(input())\r\nv = \"aeiouy\"\r\nfor i in range(l-1):\r\n if s[i] in v and s[i+1] in v:\r\n s[i+1] = \"\"\r\nnew = \"\"\r\nfor k in s:\r\n if k != \"\":\r\n new+=k\r\nprint(new)", "n = int(input())\r\ns = input()\r\nx = 'aeiouy'\r\n\r\nd = s[0]\r\nfor i in range(1, n):\r\n if s[i] in x and s[i-1] in x:\r\n continue\r\n else:\r\n d += s[i]\r\nprint(d)\r\n", "n=int(input())\r\ns=list(input())\r\ni=0\r\ncount=0\r\nwhile i<(n-1-count):\r\n if s[i] in 'aeiouy' and s[i+1] in 'aeiouy' :\r\n del s[i+1]\r\n count+=1\r\n else:\r\n i+=1\r\nprint(''.join(s))\r\n", "input()\r\nS = input()\r\nan=[\"\"]\r\nv={'a','o','e','i','u','y'}\r\n\r\nfor s in S:\r\n if an[-1] not in v or s not in v:\r\n an +=[s]\r\nprint(\"\".join(an)) ", "t = int(input())\r\na = input()\r\ni = 0\r\nans = '1'\r\nwhile i < t - 1:\r\n if ans[-1] in 'AaEeIiOoUuYy' and a[i] in 'AaEeIiOoUuYy':\r\n ans += a[i]\r\n ans = ans[0:len(ans) - 1]\r\n else:\r\n ans += a[i]\r\n if a[i] in 'AaEeIiOoUuYy' and a[i + 1] in 'AaEeIiOoUuYy':\r\n i += 1\r\n i += 1\r\nif a[-1] not in 'AaEeIiOoUuYy' or ans[-1] not in 'AaEeIiOoUuYy':\r\n ans += a[-1]\r\nprint(ans[1:])\r\n", "n = int(input())\r\ns = input()\r\nl = \"aeiouy\"\r\nans = ''\r\nk = 0\r\nfor i in range(n):\r\n if s[i] not in l:\r\n ans += s[i]\r\n k = 0\r\n elif k == 0:\r\n ans += s[i]\r\n k = 1\r\nprint(ans)\r\n", "import math\r\n\r\ndef _input(): return map(int, input().split())\r\n\r\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\nn = int(input())\r\ns = input()\r\ni=0\r\nwhile i<n:\r\n if s[i] not in vowels: print(s[i], end ='')\r\n else:\r\n print(s[i], end = '')\r\n while i<n and s[i] in vowels: i+=1\r\n i-=1\r\n i+=1\r\n ", "f = ('a', 'e', 'i', 'o', 'u', 'y')\nn = int(input())\na = input()\ni = 0\nwhile i < n:\n print(a[i],end='')\n if a[i] in f:\n j = i + 1\n while j < n and a[j] in f: j += 1\n i = j\n else:\n i += 1\n", "input()\r\ns=input()\r\ns2=s[0]\r\nfor i in range(1,len(s)):\r\n if s[i] in 'aeiouy' and s[i-1] in 'aeiouy':\r\n pass\r\n else:\r\n s2+=s[i]\r\nprint(s2)\r\n", "input()\r\nw,s='aeiouy',input()\r\nprint(''.join(c for c,t in zip(s,'b'+s) if not(c in w and t in w)))", "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\n\nn = int(input()) - 1\nword = list(input())\n\ni = 0\nwhile n > 0:\n if word[i] in vowels and word[i + 1] in vowels:\n word.pop(i + 1)\n else:\n i += 1\n n -= 1\nprint(\"\".join(word))\n\n\t\t\t \t\t \t\t \t \t \t\t\t\t \t \t\t \t \t", "n = int(input())\r\ns = list(input())\r\n\r\nans = [s[0]]\r\nvowels = ['a','e','i','o','u','y']\r\n\r\nfor i in range(1,n):\r\n if s[i] in vowels and s[i-1] in vowels:\r\n continue\r\n ans.append(s[i])\r\n\r\nprint(''.join(ans))", "n = int(input())\ns = input()\nv = {'a', 'e', 'o', 'i', 'u', 'y'}\nres = \"\"\ni = 0\nwhile i < n:\n res += s[i]\n if s[i] in v:\n while i < len(s) and s[i] in v: i+= 1\n else:\n i += 1\nprint(res)\n ", "n = int(input())\r\ns = input()\r\ns=list(s)\r\nd = []\r\nc = 2\r\nfor i in range(n):\r\n if(s[i]==\"a\" or s[i]==\"e\" or s[i]==\"i\" or s[i]==\"o\" or s[i]==\"y\" or s[i]==\"u\"):\r\n c = c - 1\r\n if(c<=0):\r\n continue\r\n d.append(s[i])\r\n else:\r\n c = 2\r\n d.append(s[i])\r\nprint(\"\".join(d))\r\n \r\n", "n=int(input())\r\nword=input()\r\narr1=['a','e','y','o','i','u']\r\n#arr2=[]\r\nw=word[0]\r\n\r\ni=1\r\nwhile i<n:\r\n\tif (word[i] in arr1 and word[i-1] in arr1)==False:\r\n\t\t\t#arr2.append(word[i])\r\n\t\tw+=word[i]\r\n\ti+=1\r\n#w+=word.replace(\"\".join(arr2),'')\r\nprint(w)", "n=int(input())\r\nx=0\r\nli=input()\r\n \r\nm=[li[0]]\r\nf=1 if(li[0] in 'aeiouy') else 0\r\nfor i in range(1,n):\r\n if(li[i] in 'aeiouy'):\r\n if(f != 1):\r\n f=1\r\n m.append(li[i])\r\n x+=1\r\n else:\r\n m.append(li[i])\r\n x+=1\r\n f=0\r\nprint(*m,sep=\"\")", "n=int(input())\r\ns=input()\r\nw=\"aeiouy\"\r\na=[]\r\nfor x in s:\r\n if x in w:\r\n a.append(False)\r\n else:\r\n a.append(True)\r\nans=s[0]\r\nfor i in range(1,n):\r\n if a[i-1]or a[i]:\r\n ans+=s[i]\r\nprint(ans)\r\n \r\n", "vowel = ('a', 'e', 'i', 'o', 'u', 'y')\r\nx = int(input())\r\nls = input()\r\nprint(ls[0], end = '')\r\nfor i in range(1, len(ls)):\r\n if ls[i] not in vowel or ls[i - 1] not in vowel:\r\n print(ls[i], end = '')", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\ndef vowel(s) :\r\n if (s == \"a\") : return True\r\n if (s == \"e\") : return True\r\n if (s == \"i\") : return True\r\n if (s == \"o\") : return True\r\n if (s == \"u\") : return True\r\n if (s == \"y\") : return True\r\n return False\r\n\r\nn, s = int(input()), input()\r\nlast = False\r\nss = \"\"\r\nfor x in s :\r\n if vowel(x) : \r\n if (not last) : ss = ss + x\r\n last = True\r\n else : \r\n last = False\r\n ss = ss + x\r\nprint(ss)\r\n", "a=int(input())\r\nb=str(input())\r\nx=k=int(0)\r\nc=str('')\r\nwhile x<a:\r\n\tif b[x]=='a' or b[x]=='e' or b[x]=='i' or b[x]=='o' or b[x]=='u' or b[x]=='y':\r\n\t\tif k==0:\r\n\t\t\tc=c+b[x]\r\n\t\tk=1\r\n\telse:\r\n\t\tc=c+b[x]\r\n\t\tk=0\r\n\tx=x+1\r\nprint(c)", "n = int(input())\r\ns = list(input())\r\nv = 'aeiouy'\r\nnew_s = ''\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] in v and s[i-1] in v and i > 0:\r\n pass\r\n else:\r\n new_s+=s[i]\r\n i+=1\r\nprint(new_s)", "n=int(input())\r\nv='aeiouy'\r\ns=input()\r\nr=s[0]\r\nfor i in range(1,n):\r\n if(s[i] in v and s[i-1] in v):\r\n continue\r\n else:\r\n r=r+s[i]\r\nprint(r)\r\n", "#s = input ().split () —> string input;\n#x = list (map (int, input ().split()));\n# python3 asd.py\n#s = list (input ());\n\ndef F (q):\n\tif q == 'a': return 1;\n\tif q == 'e': return 1;\n\tif q == 'i': return 1;\n\tif q == 'o': return 1;\n\tif q == 'u': return 1;\n\tif q == 'y': return 1;\n\t\n\treturn 0;\n\nn = int (input ());\ns = list (input ());\n\nfor i in range (n):\n\tif F (s[i]) == 1:\n\t\tfor j in range (i + 1, n):\n\t\t\tif F (s[j]) == 1: s[j] = '-';\n\t\t\telse: break;\n\nfor i in range (n):\n\tif s[i] != '-': print (s[i], end = '');\n\nprint ();\n", "# Word Correction\nn = int(input())\ns = input()\nvowels = \"aeiouyAEIOUY\"\nnew_string = \"\"\nlast_is_vowel = False\nfor c in s:\n if not (c in vowels):\n new_string += c\n last_is_vowel = False\n elif not last_is_vowel:\n new_string += c\n last_is_vowel = True\nprint(new_string)\n", "n=(int)(input())\r\ns=input()\r\n\r\npos=1\r\nwhile pos<len(s):\r\n x= s[pos-1]\r\n y= s[pos]\r\n if (x in \"auyioe\") and (y in \"auyioe\") :\r\n s=s[:(pos)]+s[(pos+1):]\r\n pos-=1\r\n pos+=1\r\n \r\n \r\nprint(s)\r\n", "n=int(input())\r\ns=input()\r\na=\"aeiouy\"\r\np=s[0]\r\ni=1\r\nwhile i<n:\r\n\tk=False\r\n\tfor j in a:\r\n\t\tif j==s[i]:\r\n\t\t\tk=True\r\n\t\t\tbreak\r\n\tif not k:\r\n\t\tp+=s[i]\r\n\telse:\r\n\t\tl=True\t#Checks whether the previous letter of the vowel is a consonant\r\n\t\tfor j in a:\r\n\t\t\tif j==p[-1]: #As the last letter of the 'p' is the last letter of 's'\r\n\t\t\t\tl=False\r\n\t\t\t\tbreak\r\n\t\tif l:\r\n\t\t\tp+=s[i]\r\n\ti+=1\r\nprint(p)\t", "vowel='aeiouy'\r\ni=0\r\nn=int(input())\r\ns=list(input())\r\nwhile i<len(s)-1:\r\n if s[i] in vowel and s[i+1] in vowel:\r\n s.pop(i+1)\r\n else: i+=1\r\nprint(''.join(s))", "def main_function():\r\n vowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\n n = int(input())\r\n s = input()\r\n output_list = []\r\n previous_is_vowel = False\r\n for i in s:\r\n if not i in vowels:\r\n output_list.append(i)\r\n previous_is_vowel = False\r\n elif not previous_is_vowel and i in vowels:\r\n previous_is_vowel = True\r\n output_list.append(i)\r\n elif previous_is_vowel and i in vowels:\r\n pass\r\n return \"\".join(output_list)\r\n\r\n\r\n\r\nprint(main_function())", "#// list(map(int, input().rstrip().split()))\r\n#//' '.join(map(str, res)) \r\n\r\n#include<bits/stdc++.h>\r\n#include<stdio.h> //per fare input output con scanf and printf\r\n#include<stdlib.h> //per fare qsort e bsearch\r\n#include<string.h> // per fare strcpy(sarrivo, spartenza) strcat(str, aggiungo) strcmp(a,b) che da 0 se sono uguali\r\n#include<math.h>\r\n#include<algorithm>\r\n#include<iostream>\r\n#include<queue>\r\n#include<stack>\r\n#include<vector>\r\n#include<map>\r\n \r\n#using namespace std;\r\n \r\n#define ld long double\r\n#define ll long long int\r\n#define vi vector <ll> \r\n#define pi pair <int, int>\r\n#define binary(v, el) binary_search((v).begin(), (v).end(), (el))\r\n#define PB push_back\r\n#define MP make_pair\r\n#define F first\r\n#define S second\r\n \r\nn = int(input())\r\ns = input()\r\nres = \"\"\r\nv = [0 for i in range(n)]\r\nvow = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\nfor i in range(1,n):\r\n if s[i] in vow and s[i-1] in vow:\r\n v[i]+=1\r\nfor i in range(n):\r\n if v[i] == 0:\r\n res += s[i]\r\nprint(res) ", "'''\nclass Car:\n def __init__(self, brand, model):\n self.brand = brand\n self.model = model\n\n def info(self,fuel,reducpersec,time,dist,remainingfuel):\n self.fuel=fuel\n self.reducpersec=reducpersec\n self.time=time\n self.dist=dist\n self.remainingfuel=remainingfuel\n\n\n\n\n# Create some real monsters\nfogthing = Car(\"Black\", \"1980\")\n\n# Check whether those monsters got different existence in memory or not\nprint('I am ' + str(fogthing.brand) + ' body and I\\'m ' + fogthing.model+'\\'s')\n\nprint('I also have ' + str(mournsnake.heads) + ' heads and I\\'m ' + mournsnake.color)\nprint('I got ' + str(tangleface.heads) + ' heads and I\\'m ' + tangleface.color)\n'''\n\n'''\nimport math\nimport cmath\n\nprint(math.pi)\nprint(cmath.sqrt(25))\n\n\nf=open(\"/media/rayhan/CSE/My Codes/Rough/in.txt\",\"r\")\nfor i in f:\n a=i\n print(i.rstrip(),sep=' ',end=\" \")\nprint()\nf.close()\n\n\ntry:\n a=10\n b=4\n print(int(a)/int(b))\nexcept ZeroDivisionError:\n print(\"You have to enter a non-zero divisor!!\\n\")\n\ndef add(x,y):\n #print(int().__doc__)\n return x+y\n\nprint(add(5,6))\n\n\n\na=[2,1,3,4,5,6]\n# n=int(input())\n# a.append(n)\na[2]=10\n# i=int(1)\nn=len(a)\nfor i in range(1,n,1):\n print(a[int(i)-1])\n # print(\"{0} {1}\".format(i,p))\n\n'''\n\nn=int(input())\ns=input()\nv=['a','e','i','o','u','y']\n\np=1\nfor i in range(0,n,1):\n if s[i] not in v:\n print(s[i],end='')\n p=1\n elif s[i] in v and p==1:\n print(s[i],end='')\n p = 0\n else:\n continue\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n = int(input())\r\ns = str(input())\r\n\r\nV = {'a', 'e', 'i', 'o', 'u', 'y'}\r\nstack = []\r\nfor c in s:\r\n if c in V:\r\n if stack:\r\n if stack[-1] in V:\r\n continue\r\n else:\r\n stack.append(c)\r\n else:\r\n stack.append(c)\r\n else:\r\n stack.append(c)\r\nprint(''.join(stack))\r\n", "n = int(input())\r\ns = input()\r\nlst = ['a', 'e', 'o', 'u', 'i', 'y']\r\nf = False\r\nfor i in range(n):\r\n if i == n - 1:\r\n if s[i] not in lst or not f:\r\n print(s[i], end = '')\r\n continue\r\n elif s[i] in lst and s[i + 1] in lst:\r\n if not f:\r\n print(s[i], end = '')\r\n f = True\r\n else:\r\n continue\r\n else:\r\n if(s[i] in lst and f):\r\n continue\r\n f = False\r\n print(s[i], end = '')", "n = int(input())\ns = input()\nmn = {'a', 'e', 'i', 'o', 'u', 'y'}\ngood = ''\nlast = ''\nfor i in s:\n if not(i in mn):\n good += i\n else:\n if not(last in mn):\n good += i\n last = i\nprint(good)\n", "n=int(input())\r\nl=list(input())\r\nl.reverse()\r\no=['a','e','i','o','u','y']\r\nj=0\r\nwhile(j<len(l)-1):\r\n if(l[j] in o and l[j+1] in o):\r\n l.pop(j)\r\n j=0\r\n else:\r\n j+=1\r\nl.reverse()\r\nfor i in range(len(l)):\r\n print(l[i],end=\"\")", "s = int(input())\nword=input();vowel='aeiouy'\ni , j = 0,1\nwhile True:\n\tif j>=s:\n\t\tbreak\n\tif word[i] in vowel and word[j] in vowel:\n\t\tword=word[:j]+word[j+1:]\n\t\ts-=1\n\telse:i,j=j,j+1\nprint(word)", "n=int(input())\nstroka=input()\nstrnew=str(stroka[0])\nfor i in range(1,n):\n if ((stroka[i-1]=='a') or (stroka[i-1]=='o') or (stroka[i-1]=='e') or (stroka[i-1]=='y') or (stroka[i-1]=='i') or (stroka[i-1]=='u')) and ((stroka[i]=='a') or (stroka[i]=='o') or (stroka[i]=='e') or (stroka[i]=='y') or (stroka[i]=='i') or (stroka[i]=='u')): k=0 \n else:\n strnew+=stroka[i] \nprint(strnew)\n", "n=int(input())\r\nl=list(input())\r\np=['a','e','i','o','u','y']\r\ni=0\r\nl.append(\" \")\r\nwhile l[i]!=\" \":\r\n if l[i].lower() in p and l[i+1].lower() in p:\r\n del l[i+1]\r\n else:\r\n i+=1\r\nprint(\"\".join(l))", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = deque(list(input().rstrip()))\r\nans = []\r\nx = set(list(\"aeiouy\"))\r\nfor _ in range(n - 1):\r\n u, v = s.popleft(), s.popleft()\r\n if u in x and v in x:\r\n s.appendleft(u)\r\n else:\r\n ans.append(u)\r\n s.appendleft(v)\r\nwhile s:\r\n ans.append(s.popleft())\r\nprint(\"\".join(ans))", "x=int(input())\r\na=input(\"\")\r\ndef vowel(s):\r\n if s=='a' or s=='e' or s=='i'or s=='o' or s=='u' or s=='y':\r\n return True\r\n return False\r\n\r\nfor i in range (x-1,0,-1):\r\n if vowel(a[i])==True and vowel(a[i-1])==True :\r\n a=a[0:i]+a[i+1:x]\r\n x=len(a)\r\n\r\nprint(a) ", "v = 'aiouey'\r\nn = int(input())\r\ns= input()\r\no =s[0]\r\nfor i in range(1,n):\r\n if (s[i] in v):\r\n if s[i-1] not in v:o+=s[i]\r\n else:o+=s[i]\r\nprint(o)", "input()\r\ndata = list(input())\r\nt = s = 0\r\nvowels = set('aeiouy')\r\nwhile s < len(data):\r\n if data[s] not in vowels or (t == 0 or data[t - 1] not in vowels):\r\n data[t] = data[s]\r\n t += 1\r\n s+= 1\r\n\r\nprint(''.join(data[:t]))\r\n", "input()\r\nw,s=set('aeiouy'),input()\r\nprint(''.join(c[0] for c in zip(s,'b'+s) if not set(c)<w))", "import sys\r\n\r\ndef main():\r\n _, s = sys.stdin.read().strip().split()\r\n out = [s[0]]\r\n for i in s[1:]:\r\n if i in 'aeiouy' and out[-1] in 'aeiouy':\r\n continue\r\n out.append(i)\r\n return out\r\n \r\nprint(*main(), sep='')\r\n", "a=int(input());b=input()[::-1]+\" \";c=\"\";d=\"aeiouy\"\r\nfor i in range(a):c+= b[i] if (b[i] in d and b[i+1] not in d) or (b[i] not in d and b[i+1] in d) or (b[i] not in d and b[i+1] not in d) else \"\"\r\nprint(c[::-1])", "length, string, i, vowel = int(input()), str(input()), 1, [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\nwhile i < len(string):\n while i < len(string) and string[i-1] in vowel and string[i] in vowel:\n string = string[:i] + string[i+1:]\n i+=1\nprint(string)", "import re\r\n\r\ninput()\r\ns = input()\r\n\r\nresult = re.sub('([aoiuye])[aoiuye]+', lambda x: x.group(0)[0], s)\r\nprint(result)", "x = int(input())\ns = list(input())\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\nfor i in range(-1,-x-1,-1):\n\tif(i > (-x)):\n\t\tif(s[i] in vowels and s[i-1] in vowels):\n\t\t\ts[i] = ''\n\nprint(''.join(s).strip())\n \t\t \t\t\t \t \t \t\t \t\t\t\t\t \t \t", "n = int(input())\r\nword = list(input())\r\n\r\nvowels = set('aeiouy')\r\npos2remove = []\r\nfor i in range(n-1):\r\n if word[i] in vowels and word[i+1] in vowels:\r\n pos2remove.append(i+1)\r\n\r\nprint(''.join([e for i, e in enumerate(word) if i not in pos2remove]))\r\n", "n = int(input())\r\nline = input()\r\nlst = []\r\nlst += line\r\nvowels = \"aeiouy\"\r\nfor i in range(1, n):\r\n if lst[i - 1] in vowels and lst[i] in vowels:\r\n lst[i] = \"\"\r\nprint(\"\".join(lst))\r\n", "n = int(input())\nw = input().strip()\nout = []\nv = set(['a', 'e', 'i', 'o', 'u', 'y'])\nfor i, c in enumerate(w):\n if i > 0 and c in v and w[i - 1] in v:\n pass\n else:\n out.append(c)\nprint(\"\".join(out))\n", "import re\r\n\r\nre_vowels = r\"(?<=[aeiouy])[aeiouy]\"\r\nn = int(input())\r\ns = input()\r\nwhile re.search(re_vowels, s):\r\n s = re.sub(re_vowels, \"\", s, count=1)\r\nprint(s)\r\n", "import sys\r\nvowel = 'aeiouy'\r\nn = int(input())\r\ns = list(input())\r\ni = 0\r\n\r\nwhile i < len(s)-1:\r\n if s[i] in vowel and s[i+1] in vowel:\r\n s.pop(i+1)\r\n else:\r\n i += 1\r\n\r\nprint(''.join(s))\r\n", "input()\ns = input()\nvowel = \"aeiouyAEIOUY\"\nt = \"\"\nlast_is_vowel = False\nfor c in s:\n if vowel.count(c) == 0:\n t += c\n last_is_vowel = False\n elif not last_is_vowel:\n t += c\n last_is_vowel = True\nprint(t)", "num = input()\r\ninp = input()\r\nvow = {'a', 'e', 'u', 'i', 'o', 'y'}\r\n\r\ndef mark_letter(index):\r\n\ttemp = list(inp)\r\n\ttemp[index] = '~'\r\n\treturn \"\".join(temp)\r\n\r\nfor i in range(1, int(num)):\r\n\tif (inp[i-1] in vow and inp[i] in vow) or (inp[i-1] == '~' and inp[i] in vow):\r\n\t\tinp = mark_letter(i)\r\n\r\ninp = inp.replace('~', '')\r\nprint(inp)", "n = int(input())\r\ns = list(input())\r\nv = ['a','e','i','o','u','y']\r\nns =[]\r\nns.append(s[0])\r\n\r\nfor i in range(1,n):\r\n if not(s[i-1] in v and s[i] in v):\r\n ns.append(s[i])\r\n\r\n\r\nprint(*ns,sep=\"\")\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nb = ['a', 'e', 'i', 'o', 'u', 'y']\r\na = s[0]\r\nfor i in range(1, n):\r\n\tif s[i] in b:\r\n\t\tif s[i-1] not in b:\r\n\t\t\ta+=s[i]\r\n\telse:\r\n\t\ta+=s[i]\r\nprint(a)", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn=int(input())\r\ns=list(str(input()))\r\ni=0;g=\"aeiouy\"\r\ns=s[::-1]\r\nwhile i!=n-1:\r\n if g.count(s[i])+g.count(s[i+1])==2:\r\n del(s[i])\r\n n-=1\r\n else:i+=1\r\ns=s[::-1]\r\nprint(\"\".join(s))", "def main():\r\n n=int(input())\r\n ch=input()\r\n i=0\r\n ch1=ch[0]\r\n for i in range(1,n):\r\n if not (ch[i-1] in {'a','e','y','u','i','o'} and ch[i] in {'a','e','y','u','i','o'}):\r\n ch1+=ch[i]\r\n print(ch1)\r\n \r\n\r\nmain()\r\n", "vowels=['a','e','i','o','u','y']\r\n\r\ndef getString(s,i,l):\r\n\tif i>l-1:\r\n\t\treturn ''\r\n\telif i==l-1:\r\n\t\treturn s[i]\r\n\telse:\r\n\t\tif s[i] in vowels and s[i+1] in vowels:\r\n\t\t\treturn s[i]+getString(s,i+2,l)\r\n\t\treturn s[i]+getString(s,i+1,l)\r\n\r\ndef isCorrect(s):\r\n\tfor i in range(len(s)-1):\r\n\t\tif s[i] in vowels and s[i+1] in vowels:\r\n\t\t\treturn True\r\n\treturn False\r\n\r\nn=int(input())\r\ns=input()\r\n\r\ntemp=getString(s,0,n)\r\nwhile True:\r\n\tif isCorrect(temp):\r\n\t\ttemp=getString(temp,0,len(temp))\r\n\telse:\r\n\t\tbreak\r\nprint(temp)", "from sys import stdin\r\n\r\ninp = stdin.readline\r\nt = int(inp().strip())\r\n\r\n\r\nword = inp().strip()\r\n\r\nvowels = ['a', 'e', 'i', 'o','u','y']\r\n\r\n\r\nprev = word[0]\r\n\r\nanswer = [word[0]]\r\nfor i in word[1:]:\r\n if not(i in vowels and prev in vowels):\r\n answer.append(i)\r\n prev = i\r\n\r\nprint(''.join(answer))", "n = int(input())\r\ns = input()\r\nr = ['a','e','i','o','u','y']\r\nres = ''\r\nres += s[0]\r\nk = 1\r\nfor i in range(1, n):\r\n if res[k - 1] in r and s[i] in r:\r\n continue\r\n else:\r\n res += s[i]\r\n k += 1\r\nprint(res)", "n = int(input())\r\na = input()\r\nres = ''\r\nres += a[0]\r\nfor i in range(1,len(a)):\r\n if a[i]==\"a\" or a[i]==\"e\" or a[i]==\"i\" or a[i]==\"o\" or a[i]==\"u\" or a[i]==\"y\":\r\n if a[i-1]!=\"a\" and a[i-1]!=\"e\" and a[i-1]!=\"i\" and a[i-1]!=\"o\" and a[i-1]!=\"u\" and a[i-1]!=\"y\":\r\n res += a[i]\r\n else:\r\n res += a[i]\r\nprint(res)", "input()\r\nv,s=set('aeiouy'),input()\r\nprint(''.join(c[0]for c in zip(s,'b'+s)if v<v|set(c)))", "\r\nn = int(input())\r\nl = list(input())\r\ntest = list('aeiouy')\r\ni = 0\r\nst = ''\r\nwhile i < n:\r\n\tif l[i] not in test:\r\n\t\tst += l[i]\r\n\t\ti += 1\r\n\r\n\telse:\r\n\t\tst += l[i]\r\n\t\ti += 1\r\n\t\twhile i < n and l[i] in test:\r\n\t\t\ti += 1\r\n\r\n\t\t\t\r\n\r\nprint(st)", "input()\r\nWord = input()\r\ni = 0\r\nwhile i < len(Word) - 1:\r\n if Word[i] in \"aeiouy\" and Word[i + 1] in \"aeiouy\":\r\n Word = Word[:i + 1] + Word[i + 2:]\r\n continue\r\n i += 1\r\nprint(Word)\r\n", "import re\ninput()\nprint(re.sub(r'(?<=[aeiouy])[aeiouy]+', '', input()))", "n=input()\nx=input()\ny=''+x[0]\nfor i in range(1,len(x)):\n\tif y[-1] in 'aeiouy':\n\t\tif x[i] in 'aeiouy':\n\t\t\tcontinue\n\ty=y+x[i]\nprint(y)", "n=int(input())\r\ns=input();r='z'\r\nfor i in s:\r\n if i not in 'aeiouy': print(i,end='')\r\n elif r not in 'aeiouy': print(i,end='')\r\n r=i\r\n", "n = int(input())\r\ns = input()\r\nans = ''\r\nvowel_found = False\r\nfor x in s:\r\n if x not in 'aeiouy':\r\n ans += x\r\n vowel_found = False\r\n else:\r\n if not vowel_found:\r\n vowel_found = True\r\n ans += x\r\nprint(ans)", "n = int(input())\nvid = \"aeiouy\"\ns = input()\nsnew = \"\"\nfor i in range(n - 1, 0, -1):\n if not(s[i] in vid and s[i - 1] in vid):\n snew = s[i] + snew\nsnew = s[0] + snew\nprint(snew)\n \n", "n = int(input())\r\ns = list(input())\r\nl = [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\nfor i in range(n-1,0,-1):\r\n\tif s[i-1] in l and s[i] in l:\r\n\t\tdel s[i]\r\nprint(\"\".join(s))\t\t\t\r\n\r\n\r\n", "n=int(input())\r\ns=str(input())\r\ns=s.replace(\"aa\",\"a\")\r\ns=s.replace(\"ae\",\"a\")\r\ns=s.replace(\"ai\",\"a\")\r\ns=s.replace(\"ao\",\"a\")\r\ns=s.replace(\"au\",\"a\")\r\ns=s.replace(\"ay\",\"a\")\r\n\r\ns=s.replace(\"ee\",\"e\")\r\ns=s.replace(\"ei\",\"e\")\r\ns=s.replace(\"eo\",\"e\")\r\ns=s.replace(\"eu\",\"e\")\r\ns=s.replace(\"ey\",\"e\")\r\ns=s.replace(\"ea\",\"e\")\r\n\r\ns=s.replace(\"ii\",\"i\")\r\ns=s.replace(\"ia\",\"i\")\r\ns=s.replace(\"ie\",\"i\")\r\ns=s.replace(\"iy\",\"i\")\r\ns=s.replace(\"io\",\"i\")\r\ns=s.replace(\"iu\",\"i\")\r\n\r\ns=s.replace(\"oa\",\"o\")\r\ns=s.replace(\"oe\",\"o\")\r\ns=s.replace(\"oi\",\"o\")\r\ns=s.replace(\"ou\",\"o\")\r\ns=s.replace(\"oy\",\"o\")\r\ns=s.replace(\"oo\",\"o\")\r\n\r\ns=s.replace(\"ua\",\"u\")\r\ns=s.replace(\"ue\",\"u\")\r\ns=s.replace(\"ui\",\"u\")\r\ns=s.replace(\"uo\",\"u\")\r\ns=s.replace(\"uu\",\"u\")\r\ns=s.replace(\"uy\",\"u\")\r\n\r\ns=s.replace(\"ya\",\"y\")\r\ns=s.replace(\"ye\",\"y\")\r\ns=s.replace(\"yi\",\"y\")\r\ns=s.replace(\"yo\",\"y\")\r\ns=s.replace(\"yu\",\"y\")\r\ns=s.replace(\"yy\",\"y\")\r\n\r\ns=s.replace(\"aa\",\"a\")\r\ns=s.replace(\"ae\",\"a\")\r\ns=s.replace(\"ai\",\"a\")\r\ns=s.replace(\"ao\",\"a\")\r\ns=s.replace(\"au\",\"a\")\r\ns=s.replace(\"ay\",\"a\")\r\n\r\ns=s.replace(\"ee\",\"e\")\r\ns=s.replace(\"ei\",\"e\")\r\ns=s.replace(\"eo\",\"e\")\r\ns=s.replace(\"eu\",\"e\")\r\ns=s.replace(\"ey\",\"e\")\r\ns=s.replace(\"ea\",\"e\")\r\n\r\ns=s.replace(\"ii\",\"i\")\r\ns=s.replace(\"ia\",\"i\")\r\ns=s.replace(\"ie\",\"i\")\r\ns=s.replace(\"iy\",\"i\")\r\ns=s.replace(\"io\",\"i\")\r\ns=s.replace(\"iu\",\"i\")\r\n\r\ns=s.replace(\"oa\",\"o\")\r\ns=s.replace(\"oe\",\"o\")\r\ns=s.replace(\"oi\",\"o\")\r\ns=s.replace(\"ou\",\"o\")\r\ns=s.replace(\"oy\",\"o\")\r\ns=s.replace(\"oo\",\"o\")\r\n\r\ns=s.replace(\"ua\",\"u\")\r\ns=s.replace(\"ue\",\"u\")\r\ns=s.replace(\"ui\",\"u\")\r\ns=s.replace(\"uo\",\"u\")\r\ns=s.replace(\"uu\",\"u\")\r\ns=s.replace(\"uy\",\"u\")\r\n\r\ns=s.replace(\"ya\",\"y\")\r\ns=s.replace(\"ye\",\"y\")\r\ns=s.replace(\"yi\",\"y\")\r\ns=s.replace(\"yo\",\"y\")\r\ns=s.replace(\"yu\",\"y\")\r\ns=s.replace(\"yy\",\"y\")\r\n\r\ns=s.replace(\"aa\",\"a\")\r\ns=s.replace(\"ae\",\"a\")\r\ns=s.replace(\"ai\",\"a\")\r\ns=s.replace(\"ao\",\"a\")\r\ns=s.replace(\"au\",\"a\")\r\ns=s.replace(\"ay\",\"a\")\r\n\r\ns=s.replace(\"ee\",\"e\")\r\ns=s.replace(\"ei\",\"e\")\r\ns=s.replace(\"eo\",\"e\")\r\ns=s.replace(\"eu\",\"e\")\r\ns=s.replace(\"ey\",\"e\")\r\ns=s.replace(\"ea\",\"e\")\r\n\r\ns=s.replace(\"ii\",\"i\")\r\ns=s.replace(\"ia\",\"i\")\r\ns=s.replace(\"ie\",\"i\")\r\ns=s.replace(\"iy\",\"i\")\r\ns=s.replace(\"io\",\"i\")\r\ns=s.replace(\"iu\",\"i\")\r\n\r\ns=s.replace(\"oa\",\"o\")\r\ns=s.replace(\"oe\",\"o\")\r\ns=s.replace(\"oi\",\"o\")\r\ns=s.replace(\"ou\",\"o\")\r\ns=s.replace(\"oy\",\"o\")\r\ns=s.replace(\"oo\",\"o\")\r\n\r\ns=s.replace(\"ua\",\"u\")\r\ns=s.replace(\"ue\",\"u\")\r\ns=s.replace(\"ui\",\"u\")\r\ns=s.replace(\"uo\",\"u\")\r\ns=s.replace(\"uu\",\"u\")\r\ns=s.replace(\"uy\",\"u\")\r\n\r\ns=s.replace(\"ya\",\"y\")\r\ns=s.replace(\"ye\",\"y\")\r\ns=s.replace(\"yi\",\"y\")\r\ns=s.replace(\"yo\",\"y\")\r\ns=s.replace(\"yu\",\"y\")\r\ns=s.replace(\"yy\",\"y\")\r\n\r\n\r\ns=s.replace(\"aa\",\"a\")\r\ns=s.replace(\"ae\",\"a\")\r\ns=s.replace(\"ai\",\"a\")\r\ns=s.replace(\"ao\",\"a\")\r\ns=s.replace(\"au\",\"a\")\r\ns=s.replace(\"ay\",\"a\")\r\n\r\ns=s.replace(\"ee\",\"e\")\r\ns=s.replace(\"ei\",\"e\")\r\ns=s.replace(\"eo\",\"e\")\r\ns=s.replace(\"eu\",\"e\")\r\ns=s.replace(\"ey\",\"e\")\r\ns=s.replace(\"ea\",\"e\")\r\n\r\ns=s.replace(\"ii\",\"i\")\r\ns=s.replace(\"ia\",\"i\")\r\ns=s.replace(\"ie\",\"i\")\r\ns=s.replace(\"iy\",\"i\")\r\ns=s.replace(\"io\",\"i\")\r\ns=s.replace(\"iu\",\"i\")\r\n\r\ns=s.replace(\"oa\",\"o\")\r\ns=s.replace(\"oe\",\"o\")\r\ns=s.replace(\"oi\",\"o\")\r\ns=s.replace(\"ou\",\"o\")\r\ns=s.replace(\"oy\",\"o\")\r\ns=s.replace(\"oo\",\"o\")\r\n\r\ns=s.replace(\"ua\",\"u\")\r\ns=s.replace(\"ue\",\"u\")\r\ns=s.replace(\"ui\",\"u\")\r\ns=s.replace(\"uo\",\"u\")\r\ns=s.replace(\"uu\",\"u\")\r\ns=s.replace(\"uy\",\"u\")\r\n\r\ns=s.replace(\"ya\",\"y\")\r\ns=s.replace(\"ye\",\"y\")\r\ns=s.replace(\"yi\",\"y\")\r\ns=s.replace(\"yo\",\"y\")\r\ns=s.replace(\"yu\",\"y\")\r\ns=s.replace(\"yy\",\"y\")\r\n\r\n\r\ns=s.replace(\"aa\",\"a\")\r\ns=s.replace(\"ae\",\"a\")\r\ns=s.replace(\"ai\",\"a\")\r\ns=s.replace(\"ao\",\"a\")\r\ns=s.replace(\"au\",\"a\")\r\ns=s.replace(\"ay\",\"a\")\r\n\r\ns=s.replace(\"ee\",\"e\")\r\ns=s.replace(\"ei\",\"e\")\r\ns=s.replace(\"eo\",\"e\")\r\ns=s.replace(\"eu\",\"e\")\r\ns=s.replace(\"ey\",\"e\")\r\ns=s.replace(\"ea\",\"e\")\r\n\r\ns=s.replace(\"ii\",\"i\")\r\ns=s.replace(\"ia\",\"i\")\r\ns=s.replace(\"ie\",\"i\")\r\ns=s.replace(\"iy\",\"i\")\r\ns=s.replace(\"io\",\"i\")\r\ns=s.replace(\"iu\",\"i\")\r\n\r\ns=s.replace(\"oa\",\"o\")\r\ns=s.replace(\"oe\",\"o\")\r\ns=s.replace(\"oi\",\"o\")\r\ns=s.replace(\"ou\",\"o\")\r\ns=s.replace(\"oy\",\"o\")\r\ns=s.replace(\"oo\",\"o\")\r\n\r\ns=s.replace(\"ua\",\"u\")\r\ns=s.replace(\"ue\",\"u\")\r\ns=s.replace(\"ui\",\"u\")\r\ns=s.replace(\"uo\",\"u\")\r\ns=s.replace(\"uu\",\"u\")\r\ns=s.replace(\"uy\",\"u\")\r\n\r\ns=s.replace(\"ya\",\"y\")\r\ns=s.replace(\"ye\",\"y\")\r\ns=s.replace(\"yi\",\"y\")\r\ns=s.replace(\"yo\",\"y\")\r\ns=s.replace(\"yu\",\"y\")\r\ns=s.replace(\"yy\",\"y\")\r\n\r\n\r\ns=s.replace(\"aa\",\"a\")\r\ns=s.replace(\"ae\",\"a\")\r\ns=s.replace(\"ai\",\"a\")\r\ns=s.replace(\"ao\",\"a\")\r\ns=s.replace(\"au\",\"a\")\r\ns=s.replace(\"ay\",\"a\")\r\n\r\ns=s.replace(\"ee\",\"e\")\r\ns=s.replace(\"ei\",\"e\")\r\ns=s.replace(\"eo\",\"e\")\r\ns=s.replace(\"eu\",\"e\")\r\ns=s.replace(\"ey\",\"e\")\r\ns=s.replace(\"ea\",\"e\")\r\n\r\ns=s.replace(\"ii\",\"i\")\r\ns=s.replace(\"ia\",\"i\")\r\ns=s.replace(\"ie\",\"i\")\r\ns=s.replace(\"iy\",\"i\")\r\ns=s.replace(\"io\",\"i\")\r\ns=s.replace(\"iu\",\"i\")\r\n\r\ns=s.replace(\"oa\",\"o\")\r\ns=s.replace(\"oe\",\"o\")\r\ns=s.replace(\"oi\",\"o\")\r\ns=s.replace(\"ou\",\"o\")\r\ns=s.replace(\"oy\",\"o\")\r\ns=s.replace(\"oo\",\"o\")\r\n\r\ns=s.replace(\"ua\",\"u\")\r\ns=s.replace(\"ue\",\"u\")\r\ns=s.replace(\"ui\",\"u\")\r\ns=s.replace(\"uo\",\"u\")\r\ns=s.replace(\"uu\",\"u\")\r\ns=s.replace(\"uy\",\"u\")\r\n\r\ns=s.replace(\"ya\",\"y\")\r\ns=s.replace(\"ye\",\"y\")\r\ns=s.replace(\"yi\",\"y\")\r\ns=s.replace(\"yo\",\"y\")\r\ns=s.replace(\"yu\",\"y\")\r\ns=s.replace(\"yy\",\"y\")\r\n\r\n\r\ns=s.replace(\"aa\",\"a\")\r\ns=s.replace(\"ae\",\"a\")\r\ns=s.replace(\"ai\",\"a\")\r\ns=s.replace(\"ao\",\"a\")\r\ns=s.replace(\"au\",\"a\")\r\ns=s.replace(\"ay\",\"a\")\r\n\r\ns=s.replace(\"ee\",\"e\")\r\ns=s.replace(\"ei\",\"e\")\r\ns=s.replace(\"eo\",\"e\")\r\ns=s.replace(\"eu\",\"e\")\r\ns=s.replace(\"ey\",\"e\")\r\ns=s.replace(\"ea\",\"e\")\r\n\r\ns=s.replace(\"ii\",\"i\")\r\ns=s.replace(\"ia\",\"i\")\r\ns=s.replace(\"ie\",\"i\")\r\ns=s.replace(\"iy\",\"i\")\r\ns=s.replace(\"io\",\"i\")\r\ns=s.replace(\"iu\",\"i\")\r\n\r\ns=s.replace(\"oa\",\"o\")\r\ns=s.replace(\"oe\",\"o\")\r\ns=s.replace(\"oi\",\"o\")\r\ns=s.replace(\"ou\",\"o\")\r\ns=s.replace(\"oy\",\"o\")\r\ns=s.replace(\"oo\",\"o\")\r\n\r\ns=s.replace(\"ua\",\"u\")\r\ns=s.replace(\"ue\",\"u\")\r\ns=s.replace(\"ui\",\"u\")\r\ns=s.replace(\"uo\",\"u\")\r\ns=s.replace(\"uu\",\"u\")\r\ns=s.replace(\"uy\",\"u\")\r\n\r\ns=s.replace(\"ya\",\"y\")\r\ns=s.replace(\"ye\",\"y\")\r\ns=s.replace(\"yi\",\"y\")\r\ns=s.replace(\"yo\",\"y\")\r\ns=s.replace(\"yu\",\"y\")\r\ns=s.replace(\"yy\",\"y\")\r\n\r\n\r\ns=s.replace(\"aa\",\"a\")\r\ns=s.replace(\"ae\",\"a\")\r\ns=s.replace(\"ai\",\"a\")\r\ns=s.replace(\"ao\",\"a\")\r\ns=s.replace(\"au\",\"a\")\r\ns=s.replace(\"ay\",\"a\")\r\n\r\ns=s.replace(\"ee\",\"e\")\r\ns=s.replace(\"ei\",\"e\")\r\ns=s.replace(\"eo\",\"e\")\r\ns=s.replace(\"eu\",\"e\")\r\ns=s.replace(\"ey\",\"e\")\r\ns=s.replace(\"ea\",\"e\")\r\n\r\ns=s.replace(\"ii\",\"i\")\r\ns=s.replace(\"ia\",\"i\")\r\ns=s.replace(\"ie\",\"i\")\r\ns=s.replace(\"iy\",\"i\")\r\ns=s.replace(\"io\",\"i\")\r\ns=s.replace(\"iu\",\"i\")\r\n\r\ns=s.replace(\"oa\",\"o\")\r\ns=s.replace(\"oe\",\"o\")\r\ns=s.replace(\"oi\",\"o\")\r\ns=s.replace(\"ou\",\"o\")\r\ns=s.replace(\"oy\",\"o\")\r\ns=s.replace(\"oo\",\"o\")\r\n\r\ns=s.replace(\"ua\",\"u\")\r\ns=s.replace(\"ue\",\"u\")\r\ns=s.replace(\"ui\",\"u\")\r\ns=s.replace(\"uo\",\"u\")\r\ns=s.replace(\"uu\",\"u\")\r\ns=s.replace(\"uy\",\"u\")\r\n\r\ns=s.replace(\"ya\",\"y\")\r\ns=s.replace(\"ye\",\"y\")\r\ns=s.replace(\"yi\",\"y\")\r\ns=s.replace(\"yo\",\"y\")\r\ns=s.replace(\"yu\",\"y\")\r\ns=s.replace(\"yy\",\"y\")\r\nprint(s)\r\n", "n1 = int(input())\r\nstr1 = list(input())\r\nlist1 = [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\n\r\nb1 = False\r\nwhile b1==False:\r\n flag = 0\r\n for i in range(len(str1)-1):\r\n if str1[i+1] in list1 and str1[i] in list1:\r\n str1.pop(i+1)\r\n flag+=1\r\n break\r\n if flag == 0:\r\n print(''.join(str1))\r\n break\r\n ", "# Hello World !\n# Va Hamana Bazgashte Hame Be Sooye Oost\n# My First py3 Submission on CF\nn = int(input())\nstr = input()\nkey = \"aeiouy\"\nans = str[0]\nfor i in range (1 , n) :\n\tactive1 = active2 = 0\n\tfor j in range (0 , 6) :\n\t\tif str[i - 1] == key[j] :\n\t\t\tactive1 = 1\n\t\tif str[i] == key[j] :\n\t\t\tactive2 = 1\n\tif active1 == 0 and active2 == 1 or active1 == 1 and active2 == 0 or active1 == 0 and active2 == 0 :\n\t\tans += str[i]\nprint(ans)\n", "n=int(input())\r\nl=list(input())\r\nfor i in range(n-1):\r\n\tif l[i] in \"aeiouy\" and l[i+1] in \"aeiouy\":\r\n\t\tl[i+1]=\"\"\r\nprint(\"\".join(l))", "n = int(input())\r\nch = input()\r\nk = 0\r\ni = 0\r\nwhile(i<len(ch)-1):\r\n if (ch[i] in [\"a\",\"u\",\"o\",\"i\",\"y\",\"e\"]) and (ch[i+1] in [\"a\",\"u\",\"o\",\"i\",\"y\",\"e\"]):\r\n ch = ch[:i+1] + ch[i+2:]\r\n \r\n else: i = i+1\r\n\r\nprint(ch)\r\n", "n = int(input())\r\ns = list(input())\r\nl = ['a' , 'e' , 'i' , 'o' , 'u' , 'y']\r\n\r\ni = 0\r\nwhile i < len(s) - 1 :\r\n if s[i] in l :\r\n if s[i+1] in l :\r\n s.pop(i + 1 )\r\n else:\r\n i += 1\r\n else:\r\n i += 1\r\n\r\nprint(*s , sep='')\r\n\r\n", "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\ninputLetterSize = int(input())\r\nletter = list(input())\r\n\r\ni = 0\r\nwhile i < len(letter) - 1:\r\n if vowels.__contains__(letter[i]):\r\n if vowels.__contains__(letter[i + 1]):\r\n del letter[i + 1]\r\n i = i - 1\r\n i = i + 1\r\nstring = \"\".join(letter)\r\nprint(string)\r\n", "n = int(input())\r\ns = input()\r\nans = \"\"\r\nvow = \"aeiouy\"\r\ni = 0\r\nwhile i < n:\r\n ans += s[i]\r\n if s[i] in vow:\r\n while i + 1 < n and s[i + 1] in vow:\r\n i += 1\r\n i += 1\r\nprint(ans)# 1698227456.2488637", "n = input()\nword = input()\n\nnew_word = list()\nvowel_list = ['a', 'e', 'i', 'o', 'u', 'y']\nprevious_is_vowel = False\nfor i, current_char in enumerate(word):\n if previous_is_vowel and current_char in vowel_list:\n continue\n if current_char in vowel_list:\n previous_is_vowel = True\n else:\n previous_is_vowel = False\n new_word.append(current_char)\nprint(''.join(new_word))\n\n\t \t \t \t\t \t \t\t\t \t\t\t\t \t \t\t", "n, s, v = int(input()), input(), 'aeiouy'\r\nprint(''.join(ch for i, ch in enumerate(s) if ch not in v or i == 0 or s[i - 1] not in v))", "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\nn = int(input())\nword = input()\n\nprev = ''\nfor character in word:\n if character in vowels:\n if not prev in vowels:\n print(character, end= '')\n else:\n print(character, end= '')\n prev = character\nprint()\n \t \t\t\t\t \t \t \t\t\t\t \t\t\t \t", "n=int(input())\r\nw={\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"}\r\na=list(input())\r\ni=0\r\nc=0\r\nwhile(i<n-c):\r\n\tif i<n-1-c and (a[i] in w) and (a[i+1] in w):\r\n\t\tdel a[i+1]\r\n\t\tc+=1\r\n\t\tcontinue\r\n\ti+=1\r\nprint(*a,sep=\"\")", "n = input()\r\ns = input()\r\nres = \"\"\r\nalpha = {'a', 'o', 'u', 'i', 'e', 'y'}\r\nfor i in range(len(s)):\r\n if i > 0 and s[i] in alpha and s[i-1] in alpha:\r\n continue\r\n else:\r\n res += s[i]\r\nprint(res)\r\n", "n=int(input())\r\nl=list(input())\r\nl1,x=['a','e','i','o','u','y'],0\r\nfor i in range(n):\r\n\tif x==1:\r\n\t\tif l[i] in l1:\r\n\t\t\tl[i]=''\r\n\t\t\tcontinue\r\n\r\n\tif l[i] in l1:\r\n\t\tx=1\r\n\telse:\r\n\t\tx=0\r\nprint(''.join(l))\r\n", "sort_letters = [i for i in (\"a\", \"e\", \"i\", \"o\", \"u\", \"y\")]\r\nletters = int(input())\r\nword = tuple(input())\r\nif len(word) is not letters: raise ValueError\r\noutput = word[0]\r\n\r\nfor i in range(1, letters):\r\n if word[i] in sort_letters and word[i-1] in sort_letters:\r\n pass\r\n else:\r\n output += word[i]\r\nprint(output)", "n=int(input())\r\nvo = ['a', 'e', 'i', 'o', 'u','y']\r\nt=list(input())\r\nw = t[::-1]\r\nc=0\r\nfor k in range(len(w)-1):\r\n if w[k] in vo :\r\n if w[k+1] in vo:\r\n w[k]='8'\r\n c+=1\r\n\r\nx=''\r\nif c>0:\r\n for i in range(len(w)-1,-1,-1):\r\n if w[i]!='8':\r\n x+=w[i]\r\n print(x)\r\nelse:\r\n print(''.join(t))\r\n", "a=int(input());b=input()[::-1]+\" \";c=\"\";d=\"aeiouy\"\r\nfor i in range(a):c+= b[i] if sum(i not in d for i in b[i]+b[i+1])!=0 else\"\"\r\nprint(c[::-1])\r\n", "_ = input()\ns = input()\n\nv = ['a','e','i','o','u','y']\nc = []\nv_ = False\nfor i, a in enumerate(s):\n if a in v and not v_:\n c.append(a)\n v_ = True\n elif a not in v:\n c.append(a)\n v_ = False\nprint(\"\".join(c))\n\n\t \t\t \t\t \t \t\t\t\t \t\t\t \t \t \t\t\t \t", "n=int(input())\r\ns=input()\r\nstate=0\r\n\r\nfor x in s:\r\n if state==0:\r\n if x=='a' or x=='e' or x=='i' or x=='o' or x=='u' or x=='y':\r\n state=1\r\n print(x,end=\"\")\r\n\r\n elif state==1:\r\n if x != 'a' and x != 'e' and x != 'i' and x != 'o' and x != 'u' and x != 'y':\r\n state=0\r\n print(x,end=\"\")\r\n\r\n #print(state)\r\nprint()", "n = int(input())\ns = input()\ni = 0\nletters = ['a', 'e', 'i', 'o', 'u', 'y']\nans = ''\nwhile i < n:\n if s[i] not in letters:\n ans += s[i]\n i += 1\n elif s[i] in letters:\n if n > 1:\n if i != 0 and i != n - 1:\n if s[i + 1] in letters and s[i - 1] not in letters:\n ans += s[i]\n i += 1\n elif s[i + 1] in letters and s[i - 1] in letters:\n i += 1\n elif s[i + 1] not in letters and s[i - 1] in letters:\n i += 1\n elif s[i - 1] not in letters \\\n and s[i + 1] not in letters:\n ans += s[i]\n i += 1\n elif i == 0:\n if s[i + 1] not in letters:\n ans += s[i]\n i += 1\n elif s[i + 1] in letters:\n ans += s[i]\n i += 2\n elif i == n - 1:\n if s[i - 1] in letters:\n i += 1\n elif s[i - 1] not in letters:\n ans += s[i]\n i += 1\n else:\n i += 1\n ans = s\nprint(ans)\n", "n = int(input())\r\ns = input()\r\nans = \"\"\r\ni = c = 0\r\nwhile i < n:\r\n if s[i] in \"aeiouy\":\r\n c += 1\r\n else:\r\n if c:\r\n ans += s[i-c]\r\n c = 0\r\n ans += s[i]\r\n i += 1\r\nif c:print(ans+s[i-c])\r\nelse:print(ans)", "n=int(input())\r\nl=list(input())\r\ns=\"\"\r\na=['a','e','i','o','u','y']\r\nfor i in range(n-1,0,-1):\r\n\tif l[i-1] in a and l[i] in a:\r\n\t\tl.pop(i)\t\t\r\nfor i in l:\r\n\ts+=i\t\t\r\nprint(s)\t", "n = input()\ns = input()\nn = int (n)\ndef vowel(x):\n if x==\"a\" or x ==\"e\" or x == \"i\" or x == \"o\" or x == \"y\" or x == \"u\":\n return 1\n else:\n return 0\n\nret = s[0]\n\nfor chars in range(1, n):\n a = s[chars]\n if vowel(s[chars-1]) == 0:\n ret = ret+a\n else:\n if vowel(a) == 0:\n ret = ret + a\n\nprint(ret)\n\n\n\n\n\n", "p = int(input())\r\nd = list(input())\r\nm = 0\r\nvowels = 'aeiouy'\r\nwhile m+1<len(d):\r\n if d[m] in vowels and d[m+1] in vowels:\r\n del d[m+1]\r\n else:\r\n m+=1\r\nprint(''.join(d))\r\n\r\n", "import re\r\ninput()\r\nprint(re.sub('(?<=[aeiouy])[aeiouy]+', '', input()))", "def check_vowels(string):\r\n vowels = {\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"}\r\n for i in range(len(string) - 1):\r\n if string[i] in vowels and string[i + 1] in vowels:\r\n return i + 1\r\n return -1\r\n\r\n\r\ndef main():\r\n _ = int(input())\r\n string = input()\r\n\r\n while check_vowels(string) != -1:\r\n index = check_vowels(string)\r\n string = string[:index] + string[index + 1 :]\r\n print(string)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import re\r\ninput()\r\nv='[aeiouy]'\r\nprint(re.sub(f'({v}){v}+','\\\\1',input()))", "n = int(input())\r\ns = 'r' + input()\r\nv = 'aeiouy'\r\nprint(''.join(s[i] for i in range(1, n+1) if s[i] not in v or s[i-1] not in v))\r\n", "voy=['a','e','i','o','u','y'] \r\nn=int(input())\r\nch=input()\r\nch1=ch[0]\r\nfor i in range(1,len(ch)) : \r\n if(ch[i] in voy):\r\n if ((ch1[len(ch1)-1] not in voy) and len(ch1)!=0 ) : \r\n ch1=ch1+ch[i]\r\n else : \r\n ch1=ch1+ch[i] \r\nprint(ch1)\r\n", "def isVow(ch):\r\n return ch=='a' or ch=='e'or ch=='i'or ch=='o'or ch=='u'or ch=='y'\r\ninput()\r\nword=input()\r\ni=0;\r\nwhile i<(len(word)-1):\r\n if(isVow(word[i]) and isVow(word[i+1])):\r\n word=word[:i+1]+word[i+2:]\r\n i=-1\r\n i+=1\r\nprint(word)\r\n", "n = int(input())\r\ns = input()\r\ni = 0\r\nwhile i < n:\r\n print(s[i], end = '')\r\n if s[i] in \"aiueoy\":\r\n while i < n and s[i] in \"aiueoy\":\r\n i += 1\r\n else:\r\n i += 1", "n = int(input())\r\ns = input()\r\nans = ''\r\ni = 0\r\nwhile i < n:\r\n if s[i] not in 'aeiouy':\r\n ans += s[i]\r\n i += 1\r\n else:\r\n ans += s[i]\r\n i += 1\r\n while i < n and s[i] in 'aeiouy':\r\n i += 1\r\nprint(ans)", "input()\r\ns = list(input())\r\ni = 0\r\ntry:\r\n while i < len(s):\r\n if s[i] in \"aeiouy\" and s[i+1] in \"aeiouy\":\r\n del s[i+1]\r\n continue\r\n i+=1\r\nexcept: pass\r\nprint(''.join(s))", "#A - Word correction\nvowels = ['a','e','i','o','u','y']\n\ndef unvowel(s, i, n):\n if (i + 1 >= n):\n return s\n if(s[i] in vowels and s[i+1] in vowels):\n return unvowel(s[:i+1] + s[i+2:], i, n-1)\n\n return unvowel(s, i+1, n)\n\nn = int(input())\n\ns = input()\n\nprint(unvowel(s, 0, len(s)))\n\t \t\t\t \t\t \t\t \t\t \t\t \t\t\t \t\t\t", "a=int(input())\r\nb=input()\r\ncnt=0\r\n \r\nd=\"z\"\r\nfor i in b:\r\n if i not in 'aeiouy':print(i,end=\"\")\r\n elif d not in 'aeiouy':print(i,end=\"\")\r\n d=i\r\n", "n = int(input())\nis_vowel = lambda c: 'aeiouy'.count(c)\nans = []\nfor c in input():\n if ans == [] or not is_vowel(c):\n ans += [c]\n elif is_vowel(c) and is_vowel(ans[-1]):\n continue\n else:\n ans += [c]\nprint(''.join(ans))\n", "n=int(input())\r\nx=list(input())\r\nstack=[]\r\nyuan=['a','e','i','o','u','y']\r\nfor i in x:\r\n if len(stack)==0:\r\n stack.append(i)\r\n else:\r\n if stack[-1] in yuan:\r\n if i in yuan:\r\n stack.append(i)\r\n stack.pop()\r\n else:\r\n stack.append(i)\r\n else:\r\n stack.append(i)\r\nprint(\"\".join(stack))", "n = int(input())\r\ns = input()\r\ni = 0\r\nl = len(s)\r\nr = \"\"\r\nwhile(i < l):\r\n if(s[i] in \"aeiouy\"):\r\n j = i + 1\r\n while(j < l and s[j] in \"aeiouy\"):\r\n j += 1\r\n r += s[i]\r\n i = j\r\n else:\r\n r += s[i]\r\n i += 1\r\nprint(r)\r\n", "n=int(input())\r\nch=input()\r\nch1=\"\"\r\nb=False\r\nl=list(\"aeyuio\")\r\nfor i in range(n) :\r\n if ch[i] in l :\r\n if b==False :\r\n ch1=ch1+ch[i]\r\n b=True\r\n else :\r\n ch1=ch1+ch[i]\r\n b=False\r\nprint(ch1)\r\n ", "n, = map(int,input().split())\r\ns = input()\r\n\r\nsp = []\r\nfor c in s:\r\n if c in \"aeiouy\":\r\n if sp and sp[-1] in \"aeiouy\":\r\n continue\r\n else:\r\n sp.append(c)\r\n else:\r\n sp.append(c)\r\n\r\nprint(\"\".join(sp))", "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\nconsonants = ['b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'm', 'n', 'p', 'q', 'r', 's', 't', 'v', 'w', 'x', 'z']\n\nif __name__ == '__main__':\n n_letters = int(input())\n word = input()\n new_word = []\n is_vowel = False\n for letter in word:\n if letter in consonants:\n is_vowel = False\n new_word.append(letter)\n continue\n elif letter in vowels and is_vowel:\n continue\n else:\n is_vowel = True\n new_word.append(letter)\n print(''.join(new_word))\n\n\t\t \t \t \t \t \t \t \t \t \t \t", "n=int(input())\r\nch=input()\r\nl=[\"a\",\"e\",\"u\",\"i\",\"o\",\"y\"]\r\ni=0\r\nwhile(i<len(ch)-1):\r\n if((ch[i] in l)and (ch[i+1] in l)):\r\n ch=ch[:i+1]+ch[i+2:]\r\n else:\r\n i=i+1\r\nprint(ch)", "v = {'a','e','i','o','u','y'}\nn = int(input())\ns= input()\nwrd =s[0]\nfor i in range(1,n):\n if (s[i] in v):\n if s[i-1] not in v:wrd+=s[i]\n else:wrd+=s[i]\nprint(wrd)\n\t \t \t \t \t\t \t \t\t\t\t \t\t \t", "def main():\r\n n = int(input())\r\n s = input()\r\n t = []\r\n vowels = 'aeiouy'\r\n\r\n i = 0\r\n while i < n:\r\n c = s[i]\r\n t += [c]\r\n\r\n if c in vowels:\r\n try:\r\n i = next(index for index in range(i + 1, n) if s[index] not in vowels)\r\n except StopIteration:\r\n i = n\r\n else:\r\n i += 1\r\n\r\n print(''.join(t))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nstr = input()\r\nstr = list(str)\r\nli = ['a','e','i','o','u','y']\r\nl = len(str)\r\ni=1\r\nwhile i<len(str):\r\n if str[i-1] in li and str[i] in li:\r\n str.pop(i)\r\n else:\r\n i+=1\r\n#\r\n# for i in range(len(str)):\r\n# for j in range(i,len(str)):\r\n# if str[i] in li and str[j] in li:\r\n# str = str.replace(str[j],'',1)\r\n# else:\r\n# break\r\n\r\nprint(*str,sep=\"\")\r\n", "n=int(input())\r\ns=input()\r\nk=\"\"\r\nm=False\r\nfor i in range(n):\r\n if s[i] not in [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]:\r\n k+=s[i]\r\n elif s[i] in [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"] and not m:\r\n k+=s[i]\r\n m=True\r\n try:\r\n if s[i] in [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"] and s[i+1] not in [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]:\r\n m=False\r\n except:\r\n pass\r\nprint(k)\r\n \r\n \r\n", "import sys\nlines = sys.stdin.read().splitlines()\nlincnt = -1 \n\ndef input():\n global lincnt\n lincnt += 1\n return lines[lincnt]\n\ninput()\nvowel = ['a', 'e', 'i', 'o', 'u', 'y']\n\ns = input()\no = [s[0]]\nfor c in s[1:]:\n if c not in vowel or o[-1] not in vowel:\n o.append(c)\n\nprint(\"\".join(o))\n\n", "n = int(input())\r\ns = input()\r\nans, i = s[0], 1\r\nwhile i < n:\r\n if s[i] not in \"aeiouy\" or s[i-1] not in \"aeiouy\":ans += s[i]\r\n i += 1 \r\nprint(ans)", "n=int(input())\r\ns=list(input())\r\nl=['a','e','i','o','u','y']\r\nfor i in range(n-1,0,-1):\r\n\t# print(s[i])\r\n\tif s[i-1] in l and s[i] in l:\r\n\t\ts.pop(i)\r\nk=''.join(s)\r\nprint(k)\r\n\t", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read non spaced string and elements are integers to list of int\r\nget_intList_from_str = lambda: list(map(int,list(sys.stdin.readline().strip())))\r\n#to read non spaced string and elements are character to list of character\r\nget_charList_from_str = lambda: list(sys.stdin.readline().strip())\r\n#get word sepetared list of character\r\nget_char_list = lambda: sys.stdin.readline().strip().split() \r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print faster\r\npt = lambda x: sys.stdout.write(str(x))\r\n\r\n#--------------------------------WhiteHat010--------------------------------#\r\nn = get_int()\r\ns = get_string()\r\nvowel = {'a','e','i','o','u','y'}\r\nres = s[0] #getting first letter of string\r\nfor i in range(1,n):\r\n if res[-1] not in vowel or s[i] not in vowel:\r\n res += s[i]\r\nprint(res)\r\n\r\n", "\r\nn=int(input())\r\ns=input()\r\ns2=s[0]\r\nc=0\r\nfor i in range(1,n):\r\n\tif s[i] in \"aeiouy\" and s[i-1] in \"aeiouy\":\r\n\t\tcontinue\r\n\telse:\r\n\t\ts2+=s[i]\r\nprint(s2)", "n=int(input())\r\ns=input()\r\nlst=['a','e','u','o','i','y']\r\nres=s[0]\r\nfor i in range(1,n):\r\n if s[i] not in lst:\r\n res+=s[i]\r\n else:\r\n if s[i-1] not in lst:\r\n res+=s[i]\r\nprint(res)", "def is_v(c):\n if(c=='a' or c=='e' or c=='i' or c=='o' or c=='u' or c=='y'):\n return True\n return False\n\ninput()\ns=list(input())\nfor i in range(len(s)):\n if(is_v(s[i])):\n for j in range(i+1,len(s)):\n if(is_v(s[j])):\n s[j]=' '\n else:\n break;\nfor sc in s:\n if(sc!=' '):\n print(sc,end='')\n", "\ndef is_vowel(c):\n return c in 'aeiouy'\n\ndef correct_word(s):\n corrected = [s[0]]\n for i in range(1, len(s)):\n if is_vowel(s[i]) and is_vowel(s[i - 1]):\n continue\n corrected.append(s[i])\n return ''.join(corrected)\n\n\nn = int(input())\nword = input()\n\n\ncorrected_word = correct_word(word)\nprint(corrected_word)\n\n\t \t\t \t\t \t\t \t \t\t \t\t\t\t", "n = int(input())\n\ns = input()\n\nvowel = False\nt = []\nfor c in s:\n if c in \"aeiouy\":\n if vowel:\n pass\n else:\n vowel = True\n t += [c]\n else:\n vowel = False\n t += [c]\nprint(\"\".join(t))\n", "n = int(input())\r\ns = input()\r\ns = list(s)\r\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\ns.append('!')\r\ni = 0\r\nwhile i < len(s) - 1:\r\n if (s[i] in vowels) and (s[i + 1] in vowels):\r\n while s[i + 1] in vowels:\r\n del s[i + 1]\r\n else:\r\n i += 1\r\ndel s[-1]\r\ns = ''.join(s)\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\ngl = \"aeiouy\"\r\nt=True\r\nfor i in range(n):\r\n if s[i] not in gl:\r\n print(s[i],end=\"\")\r\n t = True\r\n elif t:\r\n print(s[i],end=\"\")\r\n t = False", "n = int(input())\ns = input()\n\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\n\nres = \"\"\n\ndele = []\n\nlastVowel = False\n\nfor i in range(len(s)):\n\tif lastVowel and (s[i] in vowels):\n\t\tdele.append(i)\n\telse:\n\t\tlastVowel = (s[i] in vowels)\n\nfor i in range(len(s)):\n\tif i not in dele:\n\t\tres += s[i]\n\nprint(res)\n\t\t\t\t\t\t\t\t\t\t \t\t \t \t \t\t\t \t\t \t\t\t", "input()\r\nflag = False\r\nfor i in input():\r\n\tif (i in \"aeiouy\"):\r\n\t\tif (flag):\r\n\t\t\tpass\r\n\t\telse:\r\n\t\t\tflag = True\r\n\t\t\tprint(i, end = \"\")\r\n\telse:\r\n\t\tprint(i, end = \"\")\r\n\t\tflag = False", "n=int(input())\r\ns=input()\r\nl1=[\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\ns1=s[0]\r\ni=1\r\nwhile i<n:\r\n if l1.count(s[i])==0:\r\n s1=s1+s[i]\r\n i+=1\r\n else :\r\n if l1.count(s[i-1])==0:\r\n s1=s1+s[i]\r\n i+=1\r\n else :\r\n i+=1\r\nprint(s1)", "n=int(input())\r\ns=input()\r\na=set()\r\na.add(\"a\")\r\na.add(\"e\")\r\na.add(\"i\")\r\na.add(\"o\")\r\na.add(\"u\")\r\na.add(\"y\")\r\n\r\ns=s+\" \"\r\nh=s\r\nwhile(True):\r\n v=0\r\n for i in range(len(h)):\r\n if (((h[i] in a )and(h[i+1]in a))):\r\n h=(h.replace(h[i]+h[i+1],h[i]))+\" \"\r\n v=1\r\n if(v==0):\r\n break\r\n \r\nprint(h.replace(\" \",\"\"))", "n = int(input())\r\nstring = list(input())\r\nseq = 0\r\n\r\n\r\nfor i,s in enumerate(string):\r\n if s in ['i', 'o', 'u', 'e', 'a', 'y']:\r\n seq += 1\r\n else: \r\n seq = 0\r\n \r\n if seq > 1:\r\n string[i] = '1'\r\n\r\ns = [s for s in string if s != '1'] \r\n\r\nprint(''.join(s)) ", "def process(S):\r\n n = len(S)\r\n answer = []\r\n for i in range(n):\r\n if S[i] not in 'aeiouy':\r\n answer.append(S[i])\r\n elif i==0 or S[i-1] not in 'aeiouy':\r\n answer.append(S[i])\r\n return ''.join(answer)\r\n \r\nn = int(input())\r\nS = input()\r\nprint(process(S))\r\n ", "n = int(input())\r\ns = list(input())\r\n\r\nfor i in range(n-1, 0, -1):\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 for j in range(i-1, i-2, -1):\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 s[i] = ''\r\n\r\nprint(''.join(s))\r\n", "def fn(l):\r\n for i in range(1,len(l)):\r\n if l[i] in vow and l[i-1] in vow:\r\n #print(l[i],l[i-1])\r\n return i\r\n return 0\r\nn = int(input())\r\ns = list(input())\r\nvow = [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\nwhile True:\r\n if len(s) > 1:\r\n i = fn(s)\r\n if i != 0:\r\n #print(len(s),i)\r\n del s[i]\r\n #print(s)\r\n else:\r\n break\r\n else:\r\n break\r\nprint(\"\".join(s))", "import re\ninput()\nprint(re.sub('([aeiouy])[aeiouy]+','\\\\1',input()))\n\t", "n=int(input())\r\ns=input()\r\nw='aeiouy'\r\nq=s[0]\r\nfor i in range(1,n):\r\n\tif s[i] in w:\r\n\t\tif s[i-1] not in w: \r\n\t\t\tq+=s[i]\r\n\telse:\r\n\t\tq+=s[i]\r\nprint(q)", "n = int(input())\ns = input()\n\n\ndef is_vowel(c):\n if c == 'a' or c == 'e' or c == 'i' or c =='o' or c=='u' or c=='y':\n return True\n return False\n\n\noutput = [s[0]]\nrepv = False\nif is_vowel(s[0]):\n repv = True\n\nfor i in range(1, len(s)):\n if is_vowel(s[i]):\n if not repv:\n output.append(s[i])\n repv = True\n else:\n output.append(s[i])\n repv = False\n \nprint(''.join(output))\n\t \t\t \t \t\t \t\t \t\t \t \t \t \t \t", "a = input()\r\nn = input()\r\n\r\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\n\r\ni = 0\r\nwhile i < len(n):\r\n if n[i] in vowels:\r\n u = 0\r\n while i + u < len(n) and n[i + u] in vowels:\r\n u += 1\r\n n = n[:i+1] + n[i + u:]\r\n i += 1\r\n \r\nprint (n)", "#!/usr/bin/python3\r\nimport re\r\nn=int(input())\r\ns=input()\r\n\r\npat=re.compile(r'([aeiouy])[aeiouy]*')\r\nprint(pat.sub(r'\\1',s))\r\n\r\n", "n = int(input())\na = list(input())\nx = 'aeiouy'\ni, j = 0, 1\nwhile j != len(a):\n if a[i] in x and a[j] in x:\n del a[j]\n else:\n i += 1\n j += 1\nprint(*a, sep='')", "n = int(input())\r\na = list(input())\r\nl = \"aeiouy\"\r\nif n == 1: print(\"\".join(a))\r\nelse:\r\n b = []; i = 0\r\n while i < n-1:\r\n if a[i] not in l: b.append(a[i])\r\n elif a[i] in l and a[i+1] in l:\r\n b.append(a[i])\r\n while a[i] in l and i<n-1: i += 1\r\n i-=1\r\n else: b.append(a[i])\r\n i += 1\r\n if a[-1] in l and a[-2] not in l or a[-1] not in l: b.append(a[i])\r\n print(\"\".join(b))", "n=int(input())\r\ns=input()\r\nl=[\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\nc=s[0]\r\nfor i in range(1,len(s)):\r\n if s[i] in l and s[i-1] in l:\r\n continue\r\n else:\r\n c+=s[i] \r\nprint(c)", "n=int(input())\r\ns=input()\r\ni,v=1,\"aeiouy\"\r\nwhile i < len(s):\r\n if s[i-1] in v and s[i] in v:\r\n s=s[:i]+s[i+1:]\r\n else:\r\n i+=1\r\nprint(s)", "n=int(input())\r\ns=input()\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='a' or s[i]=='i' or s[i]=='u' or s[i]=='e' or s[i]=='o' or s[i]=='y':\r\n j=i\r\n while j<len(s) and (s[j]=='a' or s[j]=='i' or s[j]=='u' or s[j]=='e' or s[j]=='o' or s[j]=='y'):\r\n j+=1\r\n s=s[:i+1]+s[j:]\r\n i+=1\r\nprint(s)", "import sys\n\nimport re\nimport collections\nimport math\nimport itertools\n\n\nclass Point(object):\n\tdef __init__(self, x=0, y=0):\n\t\tself.x = x\n\t\tself.y = y\n\n\n\ndef function(*args):\n n = int(input())\n st = [e for e in input()]\n stack = []\n vowels =['a', 'e', 'i', 'o', 'u','y']\n while st:\n e = st.pop(0)\n if not stack or e not in vowels:\n stack.append(e)\n continue\n if stack[-1] in vowels and e in vowels:\n continue\n else:\n stack.append(e)\n\n print(''.join(e for e in stack))\n\nif __name__ == '__main__':\n\tfunction()\t\n", "n = int(input()) #store the input n\r\ns = input() #store the input s\r\nresult = \"\" #create an empty string to store the final result\r\n\r\nfor i in range(n): #loop through the length of the word\r\n if s[i] in \"aeiouy\": #if the ith letter is a vowel\r\n if (i > 0) and (s[i-1] in \"aeiouy\"): #check if the letter before is a vowel\r\n pass #if so, do nothing\r\n else: #otherwise,\r\n result += s[i] #append the letter to the result \r\n else: #if the letter is not a vowel\r\n result += s[i] #append the letter to the result\r\n \r\nprint(result) ", "n = int(input())\r\ns = input()\r\nv = 'aeiouyAEIOUY'\r\ni = 1 \r\nans = ''\r\nwhile i < len(s):\r\n if s[i] in v and s[i-1] in v:\r\n s = s[:i] + s[i+1:]\r\n i -= 1\r\n i += 1\r\nprint(s)\r\n", "n=int(input())\r\nch=input()\r\nv=\"aeoiuy\"\r\nl = list(ch)\r\nfor x in range(0,n-1):\r\n if(l[x] in v and l[x+1] in v ):\r\n l[x+1]=''\r\n \r\na=''.join(l)\r\nprint(a)", "n = int(input())\r\nx = input()\r\nalph = {'a','e','i','u','o','y'}\r\nans=[]\r\nans.append(x[0])\r\nfor i in range(0,len(x)-1):\r\n if((x[i] in alph) and (x[i+1] in alph)):\r\n continue\r\n else:\r\n ans.append(x[i+1])\r\nprint(''.join(ans))\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n S = wtf[1]\r\n Cs = []\r\n V = 'aeoiyu'\r\n ans = S[0]\r\n tmp = ''\r\n for i in range(1,n):\r\n if ans[-1] in V and S[i] in V:\r\n continue\r\n ans += S[i]\r\n print(ans)\r\n", "n = int(input())\ns = input()\n\nstring = list(s)\nnovaString = []\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\n\nfor i in range(n):\n # se i for vogal\n if string[i] in vowels:\n if len(novaString) == 0:\n novaString.append(string[i])\n elif novaString[-1] not in vowels:\n novaString.append(string[i])\n # se i for consoante\n else:\n novaString.append(string[i])\n\n\nprint(''.join(novaString))\n \t \t \t \t \t\t\t\t \t\t \t \t\t \t\t", "def isVowel(c):\r\n return c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u' or c == 'y'\r\nn=int(input())\r\ns=input()\r\nl=list(s)\r\np=0\r\nfor i in range(0,n):\r\n if isVowel(l[p]):\r\n if p < len(l)-1 and isVowel(l[p+1]):\r\n del(l[p+1])\r\n else:\r\n p+=1\r\n else:\r\n p+=1\r\nprint(''.join(l))", "n=int(input())\r\nss=input()\r\ns=[]\r\nfor i in ss:\r\n s.append(i)\r\ni=0\r\nwhile i<n:\r\n j=0\r\n r=0\r\n while j<len(s)-1:\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')and(s[j+1]=='a' or s[j+1]=='e' or s[j+1]=='i' or s[j+1]=='o' or s[j+1]=='u' or s[j+1]=='y')):\r\n s.pop(j+1)\r\n r=1\r\n break\r\n j=j+1\r\n if r==0:\r\n break\r\n i=i+1\r\nfor i in s:\r\n print(i,end=\"\")", "\r\n\r\nn = int(input())\r\ns = input()\r\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\ni = 0\r\ncounter = 0\r\nwhile i < n:\r\n print(s[i], end=\"\")\r\n Check = True\r\n while i < n and s[i] in vowels:\r\n i += 1\r\n Check = False\r\n i += (1 if Check else 0)\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# به کمک مهرداد", "def isVowel(c):\n return c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u' or c == 'y' \n\nn = int(input())\ns = input()\nnew_s = \"\"\n\ni = 0\n\nwhile i < n:\n c = s[i]\n new_s += c\n \n if (isVowel(c)):\n while (i+1 < n and isVowel(s[i+1])):\n i += 1\n\n i += 1\n\nprint(new_s)\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\ni=0\r\nl=['a','e','i','o','u','y']\r\nwhile(i<len(s)-1):\r\n if s[i] in l and s[i+1] in l:\r\n s=s[:i+1]+s[i+2:]\r\n else:\r\n i=i+1\r\nprint(s) ", "n=int(input())\r\nch=input()\r\nl=[\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\nb=0\r\nch1=\"\"\r\nfor c in ch:\r\n if (c in l) and (b==0):\r\n b=1\r\n ch1=ch1+c\r\n elif not((c in l)):\r\n b=0\r\n ch1=ch1+c\r\n\r\nprint(ch1)\r\n \r\n", "n=int(input())\r\ns=input()\r\nflag=0\r\nanswer=\"\"\r\nvowel=['a', 'e', 'i', 'o', 'u', 'y']\r\nfor i in s:\r\n if i in vowel:\r\n if flag==1:\r\n continue\r\n else:\r\n answer+=i\r\n flag=1\r\n \r\n else:\r\n answer+=i\r\n flag=0\r\n \r\nprint(answer)", "n=int(input())\r\na=input()\r\na=list(a)\r\ni=0\r\nwhile i+1<n:\r\n if a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y':\r\n if a[i+1]=='a' or a[i+1]=='e' or a[i+1]=='i' or a[i+1]=='o' or a[i+1]=='u' or a[i+1]=='y':\r\n a.pop(i+1)\r\n i=0\r\n n-=1\r\n continue\r\n i+=1\r\nprint(*a,sep='')", "l=['a','e','i','o','u','y']\r\nn=int(input())\r\ns=[*input()]\r\ni=0\r\nwhile i<len(s)-1:\r\n if s[i]in l and s[i+1]in l:del s[i+1];i-=1\r\n i+=1\r\nprint(''.join(s))\r\n", "w='aeiouy'\r\nn=int(input())\r\ns='b'+input()\r\nprint(''.join(s[i]for i in range(1,n+1)if s[i]not in w or s[i-1]not in w))", "\r\nn = int(input())\r\ns = input().strip()\r\nbool = False\r\nvowels = set('aeiouy')\r\nans = []\r\nfor c in s:\r\n if not (c in vowels and bool):\r\n ans.append(c)\r\n if c in vowels:\r\n bool = True\r\n else:\r\n bool = False\r\n \r\n \r\n \r\n \r\n \r\nprint(''.join(ans))\r\n", "def solve():\n t = s[0]\n vowels = 'aeiouy'\n for i in range(1, len(s)):\n if t[-1] in vowels:\n if s[i] not in vowels: t += s[i]\n else:\n t += s[i]\n return t\n\n\ndef main():\n global n, s\n\n n = int(input())\n s = input()\n print(solve())\n\n\nmain()\n", "n = int(input())\r\ns = input()\r\nv = ['a', 'e', 'i', 'o', 'u', 'y']\r\nfoo = ''\r\ntest = True\r\nfor i in range(n):\r\n if s[i] in v and test:\r\n foo += s[i]\r\n test = False\r\n elif s[i] not in v:\r\n foo += s[i]\r\n test = True\r\nprint(foo)\r\n \r\n \r\n", "n=int (input())\r\nch=input()\r\nl=[\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\nlh=ch[0]\r\nfor i in range(1,n):\r\n if not (ch[i-1] in l and ch[i] in l):\r\n lh=lh+ch[i]\r\nprint(lh)", "n=int(input())\r\ns=input()\r\nl=list(s)\r\nq=['a','e','i','o','u','y']\r\nr=len(l)\r\nk=[l[0]]\r\nj=1\r\nfor i in range(1,n):\r\n if l[i] not in q:\r\n k.append(l[i])\r\n j+=1\r\n elif l[i] in q:\r\n if k[j-1] not in q:\r\n k.append(l[i])\r\n j+=1\r\nprint(''.join([str(i) for i in k]))\r\n", "n = int(input())\r\ns = list(input())\r\nlst = [\"a\", \"e\",\"i\",\"o\",\"u\" ,\"y\"]\r\nj = 0\r\nfor i in range(len(s)-1):\r\n if (s[j] in lst and s[j+1] in lst):\r\n del s[j+1]\r\n if (len(s) == 1):\r\n break\r\n else:\r\n j += 1\r\nprint(\"\".join(s))", "import re\nn=int(input())\nword=input()\nres=re.sub('([aeiouy])[aeiouy]+','\\\\1',word)\nprint(res)", "# for testCase in range(int(input())):\nn = int(input())\ns = input()\nans = s[0]\nvowel = [\"a\" ,\"e\" ,\"i\" ,\"o\" ,\"u\" ,\"y\"]\nfor i in range(1 ,n):\n if (s[i] in vowel) and (ans[len(ans)-1] in vowel):\n continue\n else:\n ans += s[i]\nprint(ans)\n", "n = int(input())\nS = list(input())\n\ndef get_del_index(S):\n A = ['a', 'e', 'i', 'o', 'u', 'y']\n previous = None \n for i, s in enumerate(S):\n if previous in A and s in A:\n return i \n previous = s\n\ndel_index = get_del_index(S)\nwhile del_index != None:\n del S[del_index]\n del_index = get_del_index(S)\n\nprint(''.join(e for e in S)) \n", "n = int(input())\r\ns = input()\r\ngl = \"euioay\"\r\ntr = True\r\nfor i in range(n):\r\n if s[i] not in gl:\r\n print(s[i], end = \"\")\r\n tr = True\r\n elif tr:\r\n print(s[i], end = \"\")\r\n tr = False\r\n", "n=int(input())\r\ns=list(input())\r\nl=['a','e','i','o','u','y']\r\ns2=s[0]\r\nfor x in range(1,n):\r\n if s[x] in l and s[x-1] in l:\r\n pass\r\n else:\r\n s2+=s[x]\r\nprint(s2)", "vowels=['a','e','i','o','u','y']\nn=int(input())\nword=input()\nword=list(word)\nfor i in range(n-1,0,-1):\n if (word[i] in vowels) and (word[i-1] in vowels):\n word.pop(i)\n\nstring1=\"\"\nprint(string1.join(word))\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())\ns = input()\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\nans = s[0]\nfor i in range(1, n):\n if s[i] in vowels and s[i - 1] in vowels: continue\n else: ans += s[i]\nprint(ans)", "n = int(input())\nstring = [x for x in input()]\nant_vogal = 0\ni = 0\nvogais = ['a', 'e', 'i', 'o' , 'u', 'y']\n\nwhile i < len(string):\n\n if string[i] in vogais:\n if ant_vogal:\n string.pop(i)\n\n if ant_vogal == 0:\n i += 1\n ant_vogal = 1\n\n else:\n i += 1\n ant_vogal = 0\n \nprint(''.join(string))\n \t \t \t\t \t\t \t\t\t\t \t\t\t\t \t\t\t\t\t\t\t", "def main():\n number_letters = int(input())\n word_input = list(input().strip())\n vowels = ['a', 'i', 'u', 'o', 'e', 'y']\n count_v = 0\n word = ''\n for i in range(number_letters):\n if word_input[i] in vowels:\n count_v += 1\n else:\n count_v = 0\n if count_v > 1:\n word_input[i] = ''\n print(word_input[i], end='')\nmain()\n", "n = int(input())\r\nstring = input()\r\nout = ''\r\ni=0\r\nwhile (i<n):\r\n if (string[i]=='a' or string[i]=='e' or string[i]=='i' or string[i]=='o' or\r\n string[i]=='u' or string[i]=='y') and (i<(n-1)):\r\n k=0\r\n while (i<(n-1)) and (string[i+1]=='a' or string[i+1]=='e' or string[i+1]=='i' or string[i+1]=='o' or\r\n string[i+1]=='u' or string[i+1]=='y'):\r\n i+=1\r\n k+=1\r\n out+=string[i-k]\r\n i+=1\r\n else:\r\n out += string[i]\r\n i+=1\r\nprint(out)\r\n", "n = int(input())\r\ns = input()\r\nans = s[0]\r\nw = {\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"}\r\nfor i in range(1, len(s), 1):\r\n if s[i - 1] in w and s[i] in w:\r\n continue\r\n else:\r\n ans += s[i]\r\nprint(ans)", "n = int(input())\npalavra = input()\n\nvogals = [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\n\nisVogal = False\n\nfor i in range(len(palavra)):\n if palavra[i] in vogals:\n if not isVogal:\n print(palavra[i], end=\"\")\n isVogal = True\n isVogal = True\n else:\n print(palavra[i], end=\"\")\n isVogal = False\n \nprint()\n\t\t \t\t\t \t\t\t\t \t\t\t \t \t \t \t \t", "_ = int(input())\r\nstring = input()\r\nvowels = 'aeiouy'\r\nflag = False\r\ncorrection = ''\r\nfor letter in string:\r\n if not flag and letter in vowels:\r\n correction += letter\r\n flag = True\r\n elif letter not in vowels:\r\n correction += letter\r\n flag = False\r\nprint(correction)\r\n", "n, w = int(input()), input()\r\nvwls, res = \"aeiouy\", w[0]\r\nfor c in w[1:]:\r\n if res[-1] not in vwls or c not in vwls:\r\n res += c\r\nprint(res)\r\n", "n=int(input())\r\na=input()\r\nl=[\"aa\",\"ee\",\"ii\",\"oo\",\"uu\",\"yy\",\"ae\",\"ai\",\"ao\",\"au\",\"ay\",\"ea\",\"ei\",\"eo\",\"eu\",\"ey\",\r\n \"ia\",\"ie\",\"io\",\"iu\",\"iy\",\"oa\",\"oe\",\"oi\",\"ou\",\"oy\",\"ua\",\"ue\",\"ui\",\"uo\",\"uy\",\"ya\",\"ye\",\"yi\",\"yo\",\"yu\"]\r\nfor i in range(n):\r\n for j in l:\r\n if j in a:\r\n a=a.replace(j,j[0])\r\nprint(a)\r\n", "n=int(input())\r\na=input()\r\nb=['a','e','i','o','u','y']\r\nc=a[0]\r\nfor i in range(1,n):\r\n\tif a[i] in b and a[i-1] in b:\r\n\t continue\r\n\telse:\r\n\t\tc+=a[i]\r\nprint(c)", "n = int(input())\r\ns = list(input())\r\nv = 'aeiouy'\r\ni = 0\r\nwhile i < len(s)-1:\r\n if s[i] in v and s[i+1] in v:\r\n s.pop(i+1)\r\n else:\r\n i+=1\r\nfor x in s:\r\n print(x, end='')", "n = int(input())\r\ns = input()\r\nv = ['a', 'e', 'i', 'o', 'u', 'y']\r\nprint(s[0], end=\"\")\r\nfor i in range(1, n):\r\n if(s[i] not in v):print(s[i], end=\"\")\r\n elif(s[i-1] not in v): print(s[i], end=\"\")\r\nprint()", "z = ['a', 'e', 'i', 'o', 'u', 'y']\r\nn = int(input())\r\nx = input()\r\ny = ''\r\nfor i in range(n):\r\n if i > 0 and (y[-1] in z) and (x[i] in z):\r\n continue\r\n y = y + x[i]\r\nprint(y)", "n = int(input())\r\ns = [i for i in input()]\r\ne = \"aeiouy0\"\r\nd = []\r\nfor i in range(n-1):\r\n\tif s[i] in e and s[i+1] in e:\r\n\t\ts[i+1]=\"0\"\r\nfor i in s:\r\n\tif i!=\"0\":\r\n\t\td.append(i)\r\n\r\nprint(\"\".join(d))", "n = int(input())\ns = input()\n\nv = {'a','e','i','o','u','y'}\n\nans = ''\nans+=s[0]\nfor i in range(1,n):\n if s[i] in v and s[i-1] in v:\n continue\n else:\n ans+=s[i]\n# if s[-1] in v and s[-2] in v :\n# print(ans)\n# else:\n# ans+=s[-1]\n# print(ans)\nprint(ans)", "n = int(input())\ns = input()\n\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\n\nvalues = [0]\ns2 = []\n\n\nfor i in range(len(s)):\n if s[i] not in vowels:\n s2.append(s[i])\n values.append(0)\n else:\n if values[-1] == 0: #before letter was not a vowel\n s2.append(s[i])\n #if before letter is a vowel do nothing specific\n values.append(1)\n \nprint(''.join(s2))\n\n\t \t \t\t \t \t\t\t\t \t\t\t \t \t", "a=int(input())\r\ns=input()\r\nss=''\r\ni=0\r\nwhile i<a:\r\n if s[i]in list('aeiouy'):\r\n ss+=s[i]\r\n while i<a and s[i]in list('aeiouy'):\r\n i+=1\r\n\r\n if i<a:\r\n ss+=s[i]\r\n i+=1\r\n\r\nprint(ss)\r\n \r\n", "s=int(input())\r\nch=input()\r\nl=[\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\nch1=\"\"\r\n\r\ni=0\r\nwhile(i<s):\r\n \r\n if ch[i]in l :\r\n ch1=ch1+ch[i]\r\n j=i+1\r\n while((j<s)and(ch[j] in l)):\r\n \r\n j=j+1\r\n i=j \r\n else:\r\n ch1=ch1+ch[i]\r\n i=i+1\r\n \r\n \r\n\r\nprint(ch1)", "def main():\n\n n = (int)(input())\n\n string = input()\n i = 1\n\n while(i < n):\n\n if ((string[i] == \"a\" or string[i] == \"e\" or string[i] == \"i\"\n or string[i] == \"o\" or string[i] == \"u\" or string[i] == \"y\") and\n (string[i - 1] == \"a\" or string[i - 1] == \"e\" or string[i - 1] == \"i\"\n or string[i - 1] == \"o\" or string[i - 1] == \"u\" or string[i - 1] == \"y\")):\n\n if(i + 1 < n):\n\n string = string[:i] + string[i + 1:]\n\n else:\n\n string = string[:i]\n\n n -= 1\n i -= 1\n\n if(i <= 0):\n\n i = 1\n\n else:\n\n i += 1\n\n print(string)\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\ns=list(input())\r\nd=['a','e','i','o','u','y']\r\ni=0\r\nwhile i<len(s)-1:\r\n\tif s[i] in d:\r\n\t\tif s[i+1] in d:\r\n\t\t\ts.pop(i+1)\r\n\t\telse:\r\n\t\t\ti+=1\r\n\telse:\r\n\t\ti+=1\r\nprint(*s,sep='')", "\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\nlist=['a', 'e', 'i', 'o', 'u','y']\r\n\r\nl=int(input())\r\ns=input()\r\na=''\r\n\r\nfor i in range(l):\r\n if (not s[i] in list) or (not s[i-1] in list) or (i==0):\r\n a+=s[i]\r\n\r\nprint(a)\r\n\r\n\r\n", "import sys\r\nsys.stdin.reconfigure(line_buffering=True)\r\nn=int(input())\r\ns=input().lower()[:n]\r\nli=list(s)\r\nx=[\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\nfor i in range(n-1,0,-1):\r\n\tif li[i-1] in x and li[i] in x:\r\n\t\tli.pop(i)\r\nprint(\"\".join(li))", "q = 'aeiouy'\r\nn = int(input())\r\ns = list(input())\r\ni = 0\r\nw = 0\r\nwhile True:\r\n while True:\r\n if (i + 1) <= (len(s) - 1) and s[i] in q and s[i + 1] in q:\r\n s. pop(i + 1)\r\n elif (i + 1) <= (len(s) - 1):\r\n i += 1\r\n else:\r\n w = 1\r\n break\r\n if w:\r\n break\r\nprint(*s, sep = '')\r\n", "n = input()\r\nv = input()\r\nd = list()\r\nfor g in v:\r\n d.append(g)\r\nh = ['a', 'e', 'i', 'o', 'u' ,'y']\r\no = 1\r\nwhile o == 1:\r\n o = 0\r\n for e in range(len(d) - 1):\r\n if d[e] in h and d[e + 1] in h:\r\n d[e + 1] = 'mffwef'\r\n d.remove(d[e + 1])\r\n o = 1\r\n break\r\nprint(*d , sep = '')", "n=input()\r\nvowels=['a','e','i','o','u','y']\r\nword = input()\r\nit=iter(word)\r\nans=\"\"\r\nfor c in it:\r\n if c in vowels:\r\n ans=ans+c\r\n while c in vowels:\r\n c=next(it,None)\r\n if c is None:\r\n break\r\n ans=ans+c\r\nprint(ans)", "n = input()\r\nword = input()\r\n\r\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\ncorrected = []\r\n\r\nfor i in range(len(word)):\r\n if i == 0:\r\n corrected.append(word[i])\r\n continue\r\n if word[i-1] in vowels and word[i] in vowels:\r\n continue;\r\n else: corrected.append(word[i])\r\n\r\nprint(''.join(corrected))\r\n", "#print('Hare Krishna')\r\ndef I():\r\n return int(input())\r\ndef IL():\r\n return [int(i) for i in input().split()]\r\ndef IM():\r\n return map(int,input().split())\r\ndef IS():\r\n return input()\r\nvow=\"aeiouy\"\r\nst=[]\r\nI()\r\ns=IS()\r\n#print(s)\r\nfor i in s:\r\n if not st:\r\n st.append(i)\r\n else:\r\n if st[-1] in vow and i in vow:\r\n pass \r\n else:\r\n st.append(i)\r\nprint(*st,sep='')", "def isVowel(s):\r\n\r\n if((s=='a')|(s=='e')|(s=='o')|(s=='i')|(s=='u')|(s=='y')):\r\n return 1\r\n return 0\r\n\r\nn=int(input())\r\ns=input()\r\nchaine=s[0]\r\nfor i in range (1,n) :\r\n if(isVowel(s[i])==0):\r\n chaine+=s[i]\r\n \r\n else:\r\n if(isVowel(s[i-1])==0):\r\n chaine+=s[i]\r\n \r\n \r\nprint(chaine)", "length = int(input())\nword =list( input())\noutput_word = []\noutput_word.append(word[0])\nword.pop(0)\nvowels = ['a','e','i','o','u','y']\ni=1\nwhile len(word)>0:\n if output_word[i-1] in vowels and word[0] in vowels:\n word.pop(0)\n else:\n output_word.append(word[0])\n word.pop(0)\n i+=1 \n\nprint(\"\".join(output_word))\n \t \t\t\t\t\t\t \t\t \t\t\t \t\t \t\t\t", "b=[0]*110\r\nif __name__==\"__main__\":\r\n n=int(input())\r\n a=input()\r\n now=1\r\n b[1]=a[0]\r\n for i in range(1,n):\r\n if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):\r\n pass\r\n else:\r\n now=now+1\r\n b[now]=a[i]\r\n for i in range(1,now+1):\r\n print(b[i],end='')\r\n", "def main():\n N = int(input())\n S = input()\n\n flag = 0\n for s in S:\n if s in 'aiueoy':\n if not flag:\n print(s, end='')\n flag = 1\n else:\n print(s, end='')\n flag = 0\n print()\n\nmain()\n", "n = int(input())\r\nword = input()\r\nnewWord = [word[0]]\r\ndef is_vowel(char):\r\n return char == 'a' or char == 'e' or char == 'i' or char == 'o' or char == 'u' or char == 'y'\r\nfor i in range(0, n-1):\r\n if is_vowel(word[i]) and is_vowel(word[i+1]):\r\n continue\r\n newWord.append(word[i+1])\r\nprint(''.join(newWord))", "ch = 'oiyeau'\r\nn = int(input())\r\ns= input()\r\nv =s[0]\r\nfor i in range(1,n):\r\n if (s[i] in ch):\r\n if s[i-1] not in ch:\r\n v=v+s[i]\r\n else:v=v+s[i]\r\nprint(v)\r\n", "n = int(input())\r\ns = input()\r\ni = 0\r\nvowel = set(['a','e','i','o','u','y'])\r\ni = 1\r\nflag = 0\r\nif s[0] in vowel:\r\n flag = 1\r\nans = s[0]\r\nwhile i<n:\r\n if s[i] in vowel:\r\n if flag == 1:\r\n i+=1\r\n else:\r\n flag = 1\r\n ans += s[i]\r\n i+=1\r\n else:\r\n ans += s[i]\r\n flag = 0\r\n i+=1\r\nprint(ans)\r\n", "n=int(input());x=input()[::-1]+'1';v='aeiouy'\r\np=['1' if x[i] in v and x[i+1] in v else x[i] for i in range(n)]\r\nprint(''.join(p).replace('1','')[::-1])", "n = input()\r\ns = input()\r\nres = s[0]\r\na = {'a', 'e', 'u', 'y', 'i', 'o'}\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] in a and s[i - 1] in a:\r\n continue\r\n else:\r\n res += s[i]\r\nprint(res)\r\n", "n = int(input())\r\nb = input()\r\nx = [\"a\",\"e\",\"i\",\"o\",\"u\",\"y\"]\r\nz =1\r\nwhile z==1:\r\n\tz =0\r\n\tc = len(b)\r\n\tfor i in range(c-1):\r\n\t\tif b[i] in x:\r\n\t\t\tif b[i+1] in x:\r\n\t\t\t\tb= b.replace(b[i:i+2],b[i]+\"0\")\r\n\t\t\t\tz=1\r\n\r\n\ts = b.split(\"0\")\r\n\tb = \"\".join(s)\r\nprint(b)", "# https://codeforces.com/problemset/problem/938/A\r\n\r\nn = input()\r\ns = list()\r\nvowels = {'a', 'e', 'i', 'o', 'u', 'y'}\r\n\r\nfor i in input():\r\n if not s:\r\n s.append(i)\r\n else:\r\n if s[-1] in vowels and i in vowels:\r\n pass\r\n else:\r\n s.append(i)\r\n\r\nprint(''.join(s))", "n = input()\r\ns = input()\r\nvowel = \"aeiouyAEIOUY\"\r\nt = \"\"\r\nlast_is_vowel = False\r\nfor c in s:\r\n if vowel.count(c) == 0:\r\n t += c\r\n last_is_vowel = False\r\n elif not last_is_vowel:\r\n t += c\r\n last_is_vowel = True\r\nprint(t)", "if __name__ == \"__main__\":\r\n n = int(input())\r\n word = input()\r\n corrected_word = word[0]\r\n vowels = ['a', 'e' ,'i', 'o', 'u', 'y']\r\n for i in range(1, n):\r\n if word[i] not in vowels or word[i - 1] not in vowels:\r\n corrected_word += word[i]\r\n print(corrected_word)", "def prog():\r\n n = int(input())\r\n s = input()\r\n k = 0\r\n mas = ['a','e','i','o','u','y']\r\n rezalt = ''\r\n for i,x in enumerate(s):\r\n if x not in mas:\r\n rezalt = '%s%s'%(rezalt,x)\r\n k = 0\r\n else:\r\n if k == 0:\r\n k = 1\r\n rezalt = '%s%s'%(rezalt,x)\r\n print(rezalt)\r\nprog()\r\n", "n=int(input())\r\nch=input()\r\nc=ch[0]\r\nL={'a','e','i','y','u','o'}\r\nfor i in range (1,n):\r\n if ch[i] in L and ch[i-1] in L:\r\n c+='' \r\n else:\r\n c+=ch[i]\r\n\r\nprint(c)\r\n", "vowel = ['a','e','i','o','u','y']\r\nn = int(input())\r\ns = input()\r\nw = []\r\nfor i in s:\r\n if i in vowel and len(w)> 0:\r\n t = w[-1]\r\n if t in vowel:\r\n continue\r\n w.append(i)\r\nprint(''.join(w))", "s=\"aeiouy\"\nn=int(input())\nss=input()\nt=0\nwhile t<n-1:\n if ss[t] in s and ss[t+1] in s:\n n-=1\n ss=ss[:t+1]+ss[t+2:]\n #ans+=ss[t]\n else:\n t+=1\nprint(ss)", "import re\r\n\r\nn = int(input())\r\ns = str(input())\r\nprint(re.sub('([aeiouy])[aeiouy]+', '\\\\1', s))", "n = int(input())\r\ns = list(input())\r\ns.reverse()\r\ns.append('')\r\nres = ''\r\nabc = ['a','e','i','o','u','y']\r\nfor i in range(n):\r\n if s[i] in abc and s[i+1] in abc:\r\n continue\r\n elif s[i] in abc and s[i+1] not in abc:\r\n res= s[i] + res\r\n elif s[i] not in abc:\r\n res= s[i] + res\r\nprint(res)\r\n\r\n", "input()\r\nw,s='aeiouy',input()\r\nprint(''.join(c for c,t in zip(s,'b'+s) if c not in w or t not in w))", "n = int(input())\r\ns = list(input())\r\n\r\nvowels = ['a', 'e', 'i', 'o', 'u','y']\r\ni = 0\r\n\r\nwhile i+1 < len(s):\r\n if (s[i] in vowels) and (s[i+1] in vowels):\r\n del s[i+1]\r\n\r\n else:\r\n i +=1\r\n\r\nprint(\"\".join(s))", "n=int(input())\r\nch=input()\r\np=ch[0]\r\nl=['a','e','i','y','u','o']\r\nfor i in range (1,n):\r\n if ch[i] in l and ch[i-1] in l:\r\n\r\n p+='' \r\n else:\r\n p+=ch[i]\r\n\r\nprint(p)\r\n", "import re\r\nx=int(input())\r\ns=input()\r\ns=re.sub('([aeiouy])[aeiouy]+', '\\\\1', s)\r\nprint(s)", "#938A\r\nn=int(input())\r\na=list(input())\r\nb=['a','e','i','o','u','y']\r\nfor i in range(1,n):\r\n if a[-i] in b and a[-i-1] in b:\r\n a[-i]='0'\r\nfor i in a:\r\n if i!='0':\r\n print(i,end='')\r\n", "n=int(input())\r\ns=input();c='z'\r\nfor i in s:\r\n if i not in 'aeiouy': print(i,end='')\r\n elif c not in 'aeiouy': print(i,end='')\r\n c=i\r\n", "n = input()\r\ns = input()\r\n\r\ni = 0\r\ns1 = \"aeiouy\"\r\nwhile i + 1 < len(s):\r\n if s1.find(s[i]) != -1 and s1.find(s[i + 1]) != -1:\r\n s = s[:i + 1] + s[i + 2:]\r\n else:\r\n i += 1\r\n\r\nprint(s)", "n = int(input())\r\ns = input()\r\nans = s[0]\r\nfor i in range(1, len(s)):\r\n if not (ans[-1] in ['a', 'i', 'e', 'u', 'y', 'o'] and s[i] in ['a', 'i', 'e', 'u', 'y', 'o']):\r\n ans += s[i]\r\nprint(ans)", "n=int(input());s=input()\nm=['a','e','i','o','u','y']\nprint(s[0],end='')\nfor i in range(1,n):\n if s[i] not in m:\n print(s[i],end='')\n elif s[i-1] not in m:\n print(s[i],end='')\n", "vowels = 'aeiouy'\r\nn = int(input())\r\ns = list(input())\r\nfor i in range(n-1):\r\n if s[n-i-1] in vowels and s[n-i-2] in vowels:\r\n s[n-i-1] = '.'\r\nprint(''.join([char for char in s if char != '.']))", "total = int(input())\r\nword = input()\r\nout = word[0]\r\nlast = word[0]\r\nvowels = ['a','e','i','o','u','y']\r\ndef contain(a, u):\r\n for i in range(len(a)):\r\n if(a[i]==u):\r\n return True\r\n return False\r\n\r\nfor char in word[1:]:\r\n if (contain(vowels, last) and contain(vowels, char)):\r\n last = char\r\n else:\r\n last= char\r\n out = out+char\r\n \r\nprint (out)", "n=int(input())\r\ns=input()\r\nsm=''\r\nvl=list('aeiouy')\r\ncl=list('bcdfghjklmnpqrstvwxz')\r\ncheck=0\r\nfor i in s:\r\n if i in vl:\r\n if check==1:\r\n continue\r\n else:\r\n sm+=i\r\n check=1\r\n else:\r\n sm+=i\r\n check=0\r\n \r\nprint(sm)", "g = ['a', 'e', 'i', 'o', 'u', 'y']\r\nn = int(input())\r\ns = input()\r\nans = ''\r\ni, j = 0, 0\r\nwhile i < n:\r\n ans += s[i]\r\n if s[i] in g:\r\n j = i + 1\r\n while j < n:\r\n if s[j] in g:\r\n j += 1\r\n else:\r\n break\r\n i = j - 1\r\n i += 1 \r\nprint(ans) \r\n", "trash = input()\nword = input()\n\nvowels = set(['a', 'e', 'i', 'o', 'u', 'y' ])\n\nnew_word = ''\n\nfor i in range(0, len(word)):\n current = word[i]\n prev = word[i - 1] if i - 1 >= 0 else None\n if not(current in vowels and prev in vowels):\n new_word = new_word + current\n\n\nprint(new_word)\n\n\t\t\t\t\t \t \t\t \t\t \t \t \t\t \t", "n = input()\r\n\r\ns = input()\r\n\r\nvows = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\ns_new = ''\r\nif s[0] in vows:\r\n s_new = s[0]\r\n\r\nfor char in s:\r\n if char not in vows:\r\n s_new += char\r\n\r\n else:\r\n if s_new[-1] not in vows:\r\n s_new += char\r\n\r\nprint(s_new)\r\n\r\n\r\n", "n = int(input())\r\ns = input()\r\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\nfirstOvl = False\r\nresult = \"\"\r\nfor each in s:\r\n\tif firstOvl is False and each in vowels:\r\n\t\tresult+= each\r\n\t\tfirstOvl = True\r\n\telif firstOvl is True and each not in vowels:\r\n\t\tresult+= each\r\n\t\tfirstOvl = False\r\n\telif firstOvl is True:\r\n\t\tpass\r\n\telse:\r\n\t\tresult+= each\r\n\t\tfirstOvl = False\r\nprint(result)", "size = int(input())\r\n \r\nstring = list(input())\r\n \r\ndef to_str(x):\r\n res = \"\"\r\n for i in x:\r\n if i:\r\n res += i\r\n return res\r\n \r\ng = \"aeiouy\"\r\nwhile size:\r\n string = list(string)\r\n for i in range(1, len(string)):\r\n if string[i] != None and string[i - 1] != None and string[i] in g and string[i - 1] in g:\r\n string[i] = None\r\n \r\n string = to_str(string)\r\n \r\n size -= 1\r\n \r\nprint(to_str(string))", "def vowel(c):\r\n return c in ['a', 'i', 'o', 'u', 'e', 'y']\r\n\r\nn = int(input())\r\nword = str(input())\r\npointer = 0\r\nwhile pointer < n:\r\n print(end = word[pointer])\r\n if vowel(word[pointer]) == True:\r\n sub_pointer = pointer + 1\r\n while sub_pointer < n:\r\n if vowel(word[sub_pointer]) == True:\r\n sub_pointer += 1\r\n else:\r\n break\r\n pointer = sub_pointer\r\n else:\r\n pointer += 1\r\n", "n = int(input())\r\ns = list(input())\r\ni = 0\r\nsol = []\r\nvowel = \"aeiouy\"\r\nsol.append(s[0])\r\n\r\nfor i in range(1, n):\r\n if (s[i - 1] not in vowel) or (s[i] not in vowel):\r\n sol.append(s[i])\r\n\r\n \r\nword = \"\".join(sol)\r\nprint(word)", "n = int(input())\r\ns = list(input())\r\nban_l = 'aeiouy'\r\nanswer = s[0]\r\nfor i in range(1, n):\r\n if s[i] in ban_l:\r\n if s[i - 1] not in ban_l:\r\n answer += s[i]\r\n else:\r\n answer += s[i]\r\nprint(answer)\r\n", "\"\"\"\r\niuiufgiuiuaahjabbbklboyoyoyoyoyaaaaabbbbbiuiuiuiuiuaaaaabbbbbeyiyuyzyw\r\n\"\"\"\r\nif __name__ == '__main__':\r\n n = int(input().strip())\r\n w = input().strip()\r\n n = len(w)\r\n dic = {\r\n 'a': 0,\r\n 'e': 0,\r\n 'i': 0,\r\n 'o': 0,\r\n 'u': 0,\r\n 'y': 0\r\n }\r\n i = 0\r\n ans = w[:]\r\n while i < n:\r\n cont = \"\"\r\n if w[i] in dic:\r\n while i < n and w[i] in dic:\r\n cont += w[i]\r\n i += 1\r\n if len(cont) > 1:\r\n ans = ans.replace(cont,cont[0],1)\r\n else:\r\n i += 1\r\n print(ans)\r\n", "n = int(input())\r\ns = input()\r\nglasnie = 'aeiouy'\r\nres = []\r\nfor i in s:\r\n if not res or not(res[-1] in glasnie and i in glasnie):\r\n res.append(i)\r\nprint(''.join(res))", "n = int(input())\r\ns = list(input())\r\nvows = [\"a\", \"e\", \"i\", \"o\", \"u\", \"y\"]\r\ni = 0\r\nans = \"\"\r\nwhile i < len(s)-1:\r\n if s[i] in vows and s[i+1] in vows:\r\n del s[i+1]\r\n else:\r\n i += 1\r\nprint(\"\".join(s))", "input()\r\na=' '\r\nfor x in input():a+=[x,''][all(c in'aeiouy'for c in[x,a[-1]])]\r\nprint(a)\r\n", "n=int(input())\r\nl=input().strip()[:n]\r\nl=list(l)\r\nv=['a','i','e','o','u','y']\r\nz,count=[],0\r\nfor x in range(n):\r\n\tif l[x] in v and count==0:\r\n\t\tz.append(l[x])\r\n\t\tcount+=1\r\n\telif l[x] not in v:\r\n\t\tz.append(l[x])\r\n\t\tcount=0\r\nprint(''.join(z))\r\n", "n = int(input())\r\ns = input(\"\")\r\np = []\r\nc = \"\"\r\ncount = 0\r\nfor i in range(n-1):\r\n if s[i] in \"aeiouy\" and s[i+1] in \"aeoiuy\":\r\n p.append(i+1)\r\nfor x in s:\r\n if (count not in p):\r\n c = c + x\r\n count +=1\r\nprint(c)", "n = int(input())\ntext = input()\nvow = 'aeiouy'\ntext1 = text[0]\nfor i in range(1, n):\n if text[i] not in vow:\n text1 += text[i]\n else:\n if text1[-1] not in vow:\n text1 += text[i]\nprint(text1)", "import sys\n\nn = int(input())\nword = input()\n\ndef is_vowel(letter):\n if letter == 'a' or letter == 'e' or letter == 'i' or letter == 'o' or letter == 'u' or letter == 'y':\n return True\n else:\n return False\n\nlastLetter = ''\nresult = \"\"\n\nfor c in word:\n if is_vowel(lastLetter) and is_vowel(c):\n lastLetter = c\n else:\n result += c\n lastLetter = c\n\nprint(result)\n \t\t \t \t\t \t\t \t\t \t \t\t\t\t", "input()\r\ns = input()\r\n\r\ndef vowel(c):\r\n ret = True\r\n try:\r\n 'aeiouy'.index(c)\r\n except:\r\n ret = False\r\n return ret\r\n\r\nwhile True:\r\n t = s[0]\r\n for i in range(1, len(s)):\r\n if not vowel(s[i - 1]) or not vowel(s[i]):\r\n t += s[i]\r\n if s == t: break\r\n else: s = t\r\n\r\nprint(s)\r\n", "lenOfWord = int(input())\nword = list(input())\n#lenOfWord = int('4')\n#word = list('wrae')\nnewWord = word[0]\nvowels = ['a', 'e', 'i', 'o', 'u', 'y']\n\nfor i in range(1,lenOfWord):\n if (word[i] == 'a') or (word[i] == 'e') or (word[i] == 'i') or (word[i] == 'o') or (word[i] == 'u') or (word[i] == 'y'):\n if (word[i-1] == 'a') or (word[i-1] == 'e') or (word[i-1] == 'i') or (word[i-1] == 'o') or (word[i-1] == 'u') or (word[i-1] == 'y'):\n continue\n newWord = newWord + word[i]\n\nprint(newWord)\n \t\t\t\t \t\t\t \t\t \t \t \t\t \t\t\t \t\t", "n = int(input())\r\n*s, = input()\r\nind = 0\r\n*ar, = 'aeiouy'\r\nwhile ind != len(s) - 1:\r\n if s[ind] in ar and s[ind + 1] in ar:\r\n del s[ind + 1]\r\n else:\r\n ind += 1\r\nprint(''.join(s))\r\n", "n=int(input())\r\nch=input()\r\nch2=ch[0]\r\nfor i in range(1,len(ch)):\r\n if ch[i] not in {'a','e','i','u','y','o'}:\r\n ch2+=ch[i]\r\n else :\r\n if ch[i-1] not in {'a','e','i','u','y','o'} :\r\n ch2+=ch[i]\r\n \r\n \r\nprint(ch2)\r\n \r\n \r\n", "input()\r\ns = input()\r\nv = 'aeiouy'\r\n\r\ninv = 0\r\nfor x in s:\r\n if x not in v:\r\n print(x, end='')\r\n inv = 0\r\n elif inv == 0:\r\n print(x, end='')\r\n inv = 1", "vow=\"aeiouy\"\r\ninput()\r\nword=input()\r\ni=0;\r\nwhile i<(len(word)-1):\r\n if(word[i] in vow and word[i+1] in vow):\r\n word=word[:i+1]+word[i+2:]\r\n i=0\r\n else:\r\n i+=1\r\nprint(word)\r\n", "VOWELS = tuple('aeiouy')\r\n\r\ninput()\r\ns = list(input())\r\n\r\ni = 1\r\nwhile i < len(s):\r\n if s[i - 1] in VOWELS and s[i] in VOWELS:\r\n del(s[i])\r\n else:\r\n i += 1 \r\n\r\nprint (''.join(s))\r\n", "def corec(s):\r\n s = list(s)\r\n a = ['a','e','i','o','u','y']\r\n for j in range(len(s)-1):\r\n if(s[j] in a and s[j+1] in a):\r\n del s[j+1]\r\n break\r\n return str(''.join(s))\r\nn = int(input())\r\ns = input()\r\nfor i in range(100):\r\n s = corec(s)\r\nprint(s)\r\n", "vowels = ['a', 'e', 'i', 'o', 'u', 'y']\r\n\r\nn = int(input())\r\ns = input()\r\ns1 = \"\"\r\nlast = \"\"\r\n\r\nfor i in range(0, n):\r\n if s[i] in vowels:\r\n if last in vowels:\r\n continue\r\n else:\r\n s1 += s[i]\r\n last = s[i]\r\n else:\r\n s1 += s[i]\r\n last = s[i]\r\n \r\nprint(s1)", "import sys\r\ngl = ['a', 'e', 'o', 'i', 'u', 'y']\r\ndef dele (s, gl):\r\n s1 = s[0]\r\n b = False\r\n for i in range (1, len(s)):\r\n if (gl.count(s[i]) != 0) and (gl.count(s[i - 1]) != 0):\r\n b = True\r\n else:\r\n s1 += s[i]\r\n if (b == False):\r\n print(s1)\r\n sys.exit()\r\n else:\r\n dele(s1, gl)\r\nn = int(input())\r\ns = input()\r\ndele(s, gl)", "n = int(input())\r\ns = input()\r\nd = {'a', 'e', 'i', 'o', 'u', 'y'}\r\na = [s[0]]\r\nfor i in range(1, n):\r\n if s[i] in d and a[-1] in d:\r\n continue\r\n else:\r\n a.append(s[i])\r\nprint(''.join(a))", "n = int(input())\r\ns = input()\r\nc = 'z'\r\n\r\nfor x in s:\r\n if x not in 'aeiouy': \r\n print(x, end='')\r\n elif c not in 'aeiouy': \r\n print(x, end='')\r\n c = x\r\n", "def f(a):\r\n if a == 'a' or a == 'e' or a == 'i' or a == 'u' or a == 'y' or a == 'o':\r\n return True\r\n return False\r\n\r\nn = int(input())\r\ns = input()\r\np = list()\r\nfor i in range(n - 1, 0, -1):\r\n if f(s[i]) == True and f(s[i - 1]) == True:\r\n p += \"-\"\r\n else:\r\n p += s[i]\r\n\r\np += s[0]\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if p[i] != '-':\r\n print(p[i], end = '')\r\n", "n=(int)(input())\r\ns=input()\r\nns=''\r\nv='aeiouy'\r\nprint(s[0],end='')\r\nfor i in range(1,n):\r\n if s[i] not in v:\r\n print(s[i], end='')\r\n elif s[i] in v and s[i-1] not in v:\r\n print(s[i],end='')\r\n\r\n# print(s)", "# https://vjudge.net/contest/364837#problem/A\nl = int(input())\nword = input()\n\nis_vowel = False\ncorrect = ''\nfor w in word:\n if w == 'a' or w == 'e' or w == 'i' or w == 'o' or w == 'u' or w == 'y':\n if not is_vowel:\n correct += w\n is_vowel = True\n else:\n correct += w\n is_vowel = False\n\nprint(correct)\n\t \t\t \t\t \t\t\t \t\t \t \t\t\t \t\t", "def isvowel(c):\r\n return c == 'a' or c == 'e' or c == 'i' or c == 'u' or c == 'o' or c == 'y'\r\n\r\nn = int(input())\r\ns = input()\r\na = []\r\nfor i in s:\r\n if isvowel(i):\r\n if len(a) > 0:\r\n if not isvowel(a[len(a) - 1]):\r\n a.append(i)\r\n else:\r\n a.append(i)\r\n else:\r\n a.append(i)\r\nprint(*a, sep='')", "import sys\r\nsys.stdin.readline()\r\nL = sys.stdin.readline().rstrip()\r\nv = {'a','e','i','o','u','y'}\r\ns = L[0]\r\nf = s in v\r\nfor l in L[1:]:\r\n\tif l not in v:\r\n\t\tf = False\r\n\t\ts += l\r\n\telif not f:\r\n\t\tf = True\r\n\t\ts += l\r\nprint(s)\r\n\t\t\r\n", "n = int(input())\ns = list(input())\n\nvowels = ['a', 'e', 'i', 'o', 'u','y']\ni = 0\n\nwhile i+1 < len(s):\n if (s[i] in vowels) and (s[i+1] in vowels):\n del s[i+1]\n\n else:\n i +=1\n\nprint(\"\".join(s))\n \t \t \t \t \t\t\t \t \t \t \t \t \t", "n = int (input())\r\nstring = input ()\r\n\r\nword_tuple = ('a','e','i','o','u','y')\r\n\r\nstring_list = list (string)\r\n\r\nwhile True :\r\n n = len (string_list)\r\n flag = 0\r\n for i in range (n - 1, 0, -1) :\r\n if string_list[i] in word_tuple and string_list[i - 1] in word_tuple :\r\n del string_list[i]\r\n flag = 1\r\n if flag == 0 :\r\n break\r\n\r\nstring = \"\".join (string_list)\r\nprint (string)\r\n\r\n\r\n\r\n\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, n, l, t, m = -1, -1, -1, -1, -1, -1\r\n\r\ndef is_valid(mid):\r\n biggest = a + (mid - 1) * b;\r\n if t < biggest: \r\n return False\r\n sum = ((mid - l + 1) * (a + (l - 1) * b + biggest)) // 2\r\n return t >= biggest and m * t >= sum\r\n\r\ndef binary_search(b, e):\r\n while b <= e:\r\n mid = b + e >> 1\r\n if is_valid(mid):\r\n b = mid + 1\r\n else:\r\n e = mid - 1\r\n return b - 1\r\n\r\na, b, n = map(int, input().split())\r\nfor _ in range(n):\r\n l, t, m = map(int, input().split())\r\n res = binary_search(l, l + int(1e6))\r\n print(-1 if res == l - 1 else res)\r\n", "'''\n Python3(PyPy3) Template for Programming-Contest.\n'''\n\nimport sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # LDRU\nmod = 998244353\ninf = 1 << 64\n\ndef main():\n B,A,q = map(int,input().split())\n def slv():\n l,t,m = map(int,input().split())\n if A * (l - 1) + B > t:\n print(-1)\n return \n # A * (pos - 1) + B <= t\n # pos <= (t - B) // A + 1\n r = (t - B) // A + 1\n #[l...r]で合計がm * t 以下になる間だけ貪欲に足しあわせる\n def rangesum(lpos : int,rpos : int) -> int:\n rpos -= 1\n lpos -= 2\n return A * rpos * (rpos + 1) // 2 + B * (rpos + 1) - A * lpos * (lpos + 1) // 2 - B * (lpos + 1)\n lo ,hi = l,int(1e12 + 1)\n while hi - lo > 1:\n med = (hi + lo) // 2\n if rangesum(l,med) <= m * t:lo = med \n else:hi = med \n lo = min(lo,r)\n print(lo)\n return \n for i in range(q):\n slv()\n return 0\n\nif __name__ == \"__main__\":\n main()\n", "import math\r\na,b,n =[int(x) for x in input().split()]\r\nfor i in range(n):\r\n l,t,m=[int(x) for x in input().split()]\r\n x=a+(l-1)*b\r\n if x>t:\r\n print(\"-1\")\r\n continue\r\n r=(t-a)//b+1\r\n D=(2*x-b)**2+8*m*t*b\r\n d=int(math.floor((-2*x+b+math.sqrt(D))/(2*b)))\r\n print(min(r,l+d-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", "def f(A, B, r, l):\r\n return A*(r-l+1)+B*((r-1)*(r)//2 - (l-2)*(l-1)//2)\r\n\r\ndef process(A, B, l, t, m):\r\n if A > t:\r\n return -1\r\n r1 = (t-A)//B+1\r\n if r1 < l:\r\n return -1\r\n start = l\r\n end = r1\r\n if f(A, B, r1, l) <= t*m:\r\n return r1\r\n while start+1 < end:\r\n m1 = (start+end)//2\r\n c = f(A, B, m1, l)\r\n if c <= t*m:\r\n start, end = m1, end\r\n else:\r\n start, end = start, m1\r\n return start\r\n\r\nA, B, n = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n l, t, m = [int(x) for x in input().split()]\r\n print(process(A, B, l, t, m))", "from math import *\r\ninp=input()\r\na,b,c=inp.split()\r\na=float(a)\r\nb=float(b)\r\nc=float(c)\r\nfor i in range(0,int(c)):\r\n\tl,t,m=input().split()\r\n\tl=float(l)\r\n\tt=float(t)\r\n\tm=float(m)\r\n\thl=a+(l-1.0)*b\r\n\tif hl>t:\r\n\t\tprint (-1)\r\n\t\tcontinue\r\n\tnum=(t-hl)/b+1.0\r\n\tterms=floor(num)\r\n\tnum=(b-2.0*hl+sqrt((2.0*hl-b)*(2.0*hl-b)-4.0*(b)*(-2.0*t*m)))/(2.0*b)\r\n\tterms2=floor(num)\r\n\tprint (int((l+min(terms,terms2)-1)))", "f = lambda: map(int, input().split())\r\n\r\nA, B, n = f()\r\n\r\nk = 0.5\r\n\r\nfor i in range(n):\r\n\r\n l, t, m = f()\r\n\r\n b = A / B + l - k\r\n\r\n c = b - k - (m * t) / B\r\n\r\n r = min(l + int((b * b - 2 * c) ** k - b), (t - A) // B + 1)\r\n\r\n print(-1 if r < l else r)", "import math\r\n\r\nA, B, n = map(int, input().split())\r\nlCurKarafs = 0; lSum = 0; aa = 0; bb = 0; c = 0; D = 0; sol = 0; tth = 0;\r\nwhile(n > 0):\r\n l, t, m = map(int, input().split())\r\n lCurKarafs = A + (l - 1) * B;\r\n #print(str(lCurKarafs) + \" \" + str(t) + \" \" + str(m))\r\n lSum = m * t;\r\n if(lCurKarafs > t):\r\n print(-1)\r\n elif(lCurKarafs == t):\r\n print(l)\r\n else:\r\n tth = (t - lCurKarafs + B) // B;\r\n aa = B; bb = 2 * lCurKarafs - B; c = (-2) * lSum;\r\n D = bb * bb - 4 * aa * c;\r\n #D = math.sqrt(D);\r\n sol = int((math.sqrt(D) - bb) / (2 * aa));\r\n sol = min(tth, sol);\r\n sol = l + sol - 1;\r\n print(sol)\r\n n -= 1", "import math\r\ns=input()\r\na,b,n=s.split()\r\na,b,n=int(a),int(b),int(n)\r\nfor cas in range(0,n):\r\n s=input()\r\n l,t,m=s.split()\r\n l,t,m=int(l),int(t),int(m)\r\n L,R=l,(t-a)//b+1\r\n if R<L:\r\n print(-1)\r\n continue\r\n else:\r\n A=b\r\n B=2*a-b\r\n C=(2*a+b*l-2*b)*(1-l)-2*t*m\r\n ans=(-B+math.sqrt(B*B-4*A*C))/2/A\r\n if ans>R:\r\n ans=R\r\n print(int(ans))\r\n \r\n", "a,b,n=map(int,input().split())\r\nfor _ in range (n):\r\n l1,t,d=map(int,input().split())\r\n l=l1\r\n r=100000000\r\n if a+b*(l1-1)>t:\r\n print (-1)\r\n continue\r\n while r-l>1:\r\n m=(r+l)//2\r\n if (2*a+b*(l1+m-2))*(m-l1+1)//2>min(d,m-l1+1)*t or a+(m-1)*b>t:\r\n r=m\r\n else:\r\n l=m\r\n print (l)", "from sys import stdin\r\n\r\nA,B,n = [int(x) for x in stdin.readline().split()]\r\n\r\nfor q in range(n):\r\n l,t,m = [int(x) for x in stdin.readline().split()]\r\n l -= 1\r\n if B*l+A > t:\r\n print(-1)\r\n else:\r\n const = A*(l)+(B*(l-1)*(l))//2\r\n #print(l,const)\r\n high = (t-A)//B+1\r\n low = l+1\r\n while high >= low:\r\n mid = (low+high)//2\r\n total = A*mid+(B*mid*(mid-1))//2-const\r\n if total <= t*m:\r\n #print(mid, total,'valid')\r\n low = mid+1\r\n else:\r\n #print(mid,total,'invalid')\r\n high = mid-1\r\n print(high)\r\n" ]

[ "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef process(a1, a2, a3, a4):\r\n \"\"\"\r\n a1 = count of 00\r\n a2 = count of 01\r\n a3 = count of 10\r\n a4 = count of 11\r\n \r\n a1 = zero_count*(zero_count-1)//2\r\n 2a1 = z2-z\r\n z2-z-2a = 0\r\n (1+root(1+8a))//2\r\n \"\"\"\r\n if a1==0:\r\n zero_counts = [0, 1]\r\n else:\r\n z0 = (1+(1+8*a1)**0.5)/2\r\n z0 = int(z0)\r\n z = None\r\n for z1 in range(z0-1, z0+2):\r\n if z1*(z1-1)//2==a1:\r\n z = z1\r\n break\r\n if z is None:\r\n return 'Impossible'\r\n zero_counts = [z]\r\n if a4==0:\r\n one_counts = [0, 1]\r\n else:\r\n z0 = (1+(1+8*a4)**0.5)/2\r\n z0 = int(z0)\r\n z = None\r\n for z1 in range(z0-1, z0+2):\r\n if z1*(z1-1)//2==a4:\r\n z = z1\r\n break\r\n if z is None:\r\n return 'Impossible'\r\n one_counts = [z]\r\n counts = None\r\n for count0 in zero_counts:\r\n for count1 in one_counts:\r\n if count0*count1==(a2+a3):\r\n counts = [count0, count1]\r\n if counts is None:\r\n return 'Impossible'\r\n count0, count1 = counts\r\n if count0==0:\r\n answer = ['1' for i in range(count1)]\r\n elif count1==0:\r\n answer = ['0' for i in range(count0)]\r\n else:\r\n x, y = a3//count0, a3 % count0\r\n answer = []\r\n for i in range(x):\r\n answer.append('1')\r\n count1-=1\r\n for i in range(count0-y):\r\n answer.append('0')\r\n count0-=1\r\n if y > 0:\r\n answer.append('1')\r\n count1-=1\r\n for i in range(y):\r\n answer.append('0')\r\n count0-=1\r\n for i in range(count1):\r\n answer.append('1')\r\n count1-=1 \r\n return ''.join(answer)\r\n\r\na1, a2, a3, a4 = [int(x) for x in input().split()]\r\nsys.stdout.write(process(a1, a2, a3, a4)+'\\n')", "# LUOGU_RID: 102908845\nimport math\r\na , b , c , d = map(int,input().split(' '))\r\nn = int(math.sqrt(a << 1)) + 1\r\nm = int(math.sqrt(d << 1)) + 1\r\n\r\nif n < m:\r\n n -= not b and not c\r\nelse :\r\n m -= not b and not c\r\nif n * (n - 1) != a + a or m * (m - 1) != d + d or m * n != b + c:\r\n print(\"Impossible\")\r\nelse : \r\n for i in range(m + n , 0 , -1):\r\n if b >= m:\r\n print(\"0\",end=\"\")\r\n b -= m\r\n else :\r\n print(\"1\",end=\"\")\r\n m -=1\r\n", "import time\r\n\r\n\r\na, b, c, d = map(int, input().split())\r\nl = 0\r\nr = 10**10\r\nwhile l < r:\r\n m = (l + r) // 2\r\n if m * (m - 1) // 2 > a:\r\n r = m\r\n else:\r\n l = m + 1\r\nkol_0 = l - 1\r\nl = 0\r\nr = 10**10\r\nwhile l < r:\r\n m = (l + r) // 2\r\n if m * (m - 1) // 2 > d:\r\n r = m\r\n else:\r\n l = m + 1\r\nkol_1 = l - 1\r\nx = kol_1 * kol_0\r\nif (a == 0 or d == 0) and (kol_1 - 1) * kol_1 // 2 == d and (kol_0 - 1) * kol_0 // 2 == a:\r\n if b == 0 and c == 0:\r\n if a == 0:\r\n print(kol_1 * '1')\r\n else:\r\n print(kol_0 * '0')\r\n else:\r\n if not (b + c == max(kol_0, kol_1)):\r\n print('Impossible')\r\n else:\r\n if kol_0 > kol_1:\r\n ans = '0' * b + '1' + '0' * (kol_0 - b)\r\n else:\r\n ans = '1' * c + '0' + '1' * (kol_1 - c)\r\n print(ans)\r\nelif b + c != x or (kol_1 - 1) * kol_1 // 2 != d or (kol_0 - 1) * kol_0 // 2 != a:\r\n print('Impossible')\r\nelse:\r\n if c % kol_0 == 0:\r\n ans = '1' * (c // kol_0) + '0' * kol_0 + (kol_1 - c // kol_0) * '1'\r\n else:\r\n ans = '1' * (c // kol_0) + '0' * (kol_0 - c % kol_0) + '1' + '0' * (c % kol_0) + '1' * (kol_1 - 1 - c // kol_0)\r\n print(ans)\r\n", "# submitting someone else's modified solution to understand how the various #python functions make this problem's source code come out to be so small #:O\r\n\r\n#!/usr/bin/env\tpython\r\n#-*-coding:utf-8 -*-\r\nimport sys,math\r\na00,a01,a10,a11=map(int,input().split())\r\ns=a00+a01+a10+a11\r\nif not s:\r\n\tprint('1')\r\n\tsys.exit()\r\ns=a01+a10\r\nif a00:\r\n\tz=a00<<1\r\n\tx=math.ceil(math.sqrt(z))\r\n\tif (x-1)*x!=z:\r\n\t\tprint('Impossible')\r\n\t\tsys.exit()\r\nelse:x=s and 1\r\nif a11:\r\n\tz=a11<<1\r\n\ty=math.ceil(math.sqrt(z))\r\n\tif (y-1)*y!=z:\r\n\t\tprint('Impossible')\r\n\t\tsys.exit()\r\nelse:y=s and 1\r\nif x*y!=s:\r\n\tprint('Impossible')\r\n\tsys.exit()\r\nif s:\r\n\ti,j=divmod(a10,x)\r\n\tprint(i*'1',(x-j)*'0',sep='',end='')\r\n\tif y>i:print('1',j*'0',(y-i-1)*'1',sep='')\r\n\telse:print(j*'0')\r\nelse:print(x*'0',y*'1',sep='')", "a00, a01, a10, a11 = list(map(int, input().split()))\r\n \r\nif sum([a00, a01, a10, a11]) == 0:\r\n print(0)\r\n exit(0)\r\n \r\nz, j = 0, 0\r\nif a01 != 0 or a10 != 0:\r\n z = j = 1\r\n \r\nwhile z * (z - 1) // 2 < a00:\r\n z += 1\r\nwhile j * (j - 1) // 2 < a11:\r\n j += 1\r\n \r\nif any([z * (z - 1) // 2 != a00, \r\n j * (j - 1) // 2 != a11,\r\n z * j != a10 + a01]):\r\n print('Impossible')\r\n exit(0)\r\n \r\nn = z + j\r\nfor i in range(n):\r\n if z > 0 and a01 >= j:\r\n print('0', end='')\r\n a01 -= j\r\n z -= 1\r\n else:\r\n print('1', end='')\r\n j -= 1", "IMP = \"Impossible\"\r\ndef f(x: int) -> int:\r\n y = int(((8 * x + 1) ** 0.5 + 1) // 2)\r\n if y * (y - 1) // 2 != x: return -1\r\n return y\r\ndef function(a00, a01, a10, a11):\r\n c0, c1 = f(a00), f(a11)\r\n if c0 < 0 or c1 < 0:\r\n return IMP\r\n if a01 == 0 and a10 == 0:\r\n if a00 > 0 and a11 > 0: return IMP\r\n elif a11 == 0:\r\n return \"0\" * c0\r\n else:\r\n return \"1\" * c1\r\n if a01 + a10 != c0 * c1: return IMP\r\n left1, right0 = a10 // c0, a10 % c0\r\n ans = (\"1\" * left1) + (\"0\" * (c0 - right0))\r\n if right0:\r\n ans += \"1\" + (\"0\" * right0)\r\n c1 -= 1\r\n return ans + (\"1\" * (c1 - left1))\r\na00, a01, a10, a11 = list(map(int, input().split()))\r\nprint(function(a00, a01, a10, a11))" ]

[ "from bisect import bisect_left\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\np = []\r\nresult = []\r\nfor x in a:\r\n r = bisect_left(p, -x)\r\n if r == len(result):\r\n result.append([])\r\n p.append(0)\r\n\r\n result[r].append(x)\r\n p[r] = -x\r\n\r\nfor arr in result:\r\n for i in range(len(arr)-1):\r\n print(arr[i], end=\" \")\r\n print(arr[-1])", "from sys import stdin\r\nfrom collections import deque\r\nfrom bisect import bisect_right as br\r\nn=int(stdin.readline().strip())\r\ns=list(map(int,stdin.readline().strip().split()))\r\narr=deque([s[0]])\r\nans=deque([[s[0]]])\r\nfor i in range(1,n):\r\n x=br(arr,s[i])\r\n if x==0:\r\n arr.appendleft(s[i])\r\n ans.appendleft([s[i]])\r\n else:\r\n arr[x-1]=s[i]\r\n ans[x-1].append(s[i])\r\nans.reverse()\r\nfor i in ans:\r\n print(*i)\r\n \r\n", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef test_case():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n ans = []\r\n\r\n def func(mi, x):\r\n return ans[mi][-1] <= x\r\n\r\n def discrete_binary_search(func, lo, hi, x):\r\n \"\"\" Locate the first value x s.t. func(x) = True within [lo, hi] \"\"\"\r\n while lo < hi:\r\n mi = lo + (hi - lo) // 2\r\n if func(mi, x):\r\n hi = mi\r\n else:\r\n lo = mi + 1\r\n\r\n return lo\r\n \r\n for x in a:\r\n idx = discrete_binary_search(func, 0, len(ans), x)\r\n if idx == len(ans):\r\n ans.append([x])\r\n else:\r\n ans[idx].append(x)\r\n for i in range(len(ans)):\r\n print(*ans[i])\r\n\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\"\"\"\r\nhttp://codeforces.com/contest/847/problem/B\r\n5\r\n1 3 2 5 4 should output\r\n1 3 5\r\n2 4\r\n\"\"\"\r\ninput()\r\nnumbers = [int(i) for i in input().split()]\r\n\r\nruns = [[numbers[0]]]\r\nfor n in numbers[1:]:\r\n if n < runs[-1][-1]:\r\n runs.append([n])\r\n continue\r\n\r\n lo = 0\r\n hi = len(runs) - 1\r\n valid = -1\r\n while lo <= hi:\r\n to_search = (lo + hi) // 2\r\n if n > runs[to_search][-1]:\r\n valid = to_search\r\n hi = to_search - 1\r\n else:\r\n lo = to_search + 1\r\n runs[valid].append(n)\r\n\r\nfor r in runs:\r\n print(' '.join(str(n) for n in r))\r\n", "n = int(input().strip())\r\nnumbers = [int(x) for x in input().strip().split()]\r\nsequences = []\r\nfor num in numbers:\r\n\tl = 0\r\n\tr = len(sequences)\r\n\twhile l != r:\r\n\t\tmid = (l + r) // 2\r\n\t\tif sequences[mid][-1] < num:\r\n\t\t\tr = mid\r\n\t\telse:\r\n\t\t\tl = mid + 1\r\n\tif l == len(sequences):\r\n\t\tsequences.append([num])\r\n\telse:\r\n\t\tsequences[l].append(num)\r\nfor sub in sequences:\r\n\tprint(*sub)", "n = int(input().strip())\r\nnumbers = [int(x) for x in input().strip().split()]\r\nans = []\r\nfor num in numbers:\r\n l = 0\r\n r = len(ans)\r\n while l != r:\r\n mid = (l + r) // 2\r\n if ans[mid][-1] < num:\r\n r = mid\r\n else:\r\n l = mid + 1\r\n if l == len(ans):\r\n ans.append([num])\r\n else:\r\n ans[l].append(num)\r\nfor sub in ans:\r\n print(*sub)", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nl = []\r\n\r\nfor i in arr:\r\n left,right = 0,len(l)\r\n while(left < right):\r\n mid = (left+right)//2\r\n if(l[mid][-1] < i):\r\n right = mid\r\n else:\r\n left = mid+1\r\n if(left == len(l)):\r\n l.append([i])\r\n else:\r\n l[left].append(i)\r\n\r\nfor i in l:\r\n print(' '.join([str(j) for j in i]))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\nn = int(input())\r\nd = []\r\nq = []\r\nfor i in list(map(int, input().split())):\r\n x = bisect(q, -i)\r\n if x == len(q):\r\n q.append(-i)\r\n d.append([i])\r\n else:\r\n d[x].append(i)\r\n q[x] = -i\r\nfor i in d:\r\n print(*i)", "import sys\r\n\r\nread = sys.stdin.readline\r\nwrite = sys.stdout.write\r\n\r\nn = int(read().strip())\r\narr = list(map(int, read().split(\" \")))\r\n\r\nbuckets = [[] for _ in range(n)]\r\n\r\nfor num in arr:\r\n i = 0\r\n\r\n l, r = 0, n - 1\r\n while l <= r:\r\n m = l + (r - l) // 2\r\n\r\n if len(buckets[m]) == 0 or buckets[m][-1] < num:\r\n r = m - 1\r\n i = m\r\n else:\r\n l = m + 1\r\n \r\n buckets[i].append(num)\r\n\r\nfor i in range(n):\r\n if len(buckets[i]) == 0: break\r\n\r\n write(f\"{' '.join(map(str, buckets[i]))}\\n\")", "n = int(input())\r\na = list(map(int,input().split()))\r\ngroups = []\r\ngroupTail = []\r\n\r\nfor elem in a:\r\n if not groups:\r\n groups.append([elem])\r\n groupTail.append(elem)\r\n else:\r\n l = 0\r\n r = len(groups)\r\n while l <= r:\r\n m = (l + r) // 2\r\n if m == len(groups):\r\n break\r\n if l == r:\r\n break\r\n if groupTail[m] < elem:\r\n r = m\r\n else:\r\n l = m + 1\r\n if m == len(groups):\r\n groups.append([elem])\r\n groupTail.append(elem)\r\n else:\r\n groups[m].append(elem)\r\n groupTail[m] = elem\r\n\r\nfor line in groups:\r\n print(\" \".join(map(str,line)))", "sweet=int(input())\nshannu=[int(i) for i in input().split()]\nres=[]\nfor x in shannu:\n\tlo=0\n\thi=len(res)\n\twhile lo<hi:\n\t\tmid=(lo+hi)//2\n\t\tif res[mid][-1]<x:\n\t\t\thi=mid\n\t\telse:\n\t\t\tlo=mid+1\n\tif lo==len(res):res.append([x])\n\telse:res[lo].append(x)\nfor sub in res:\n\tprint(*sub)\n\t\t\t\t\t \t\t \t\t\t\t \t\t \t\t", "n = int(input())\narr = list(map(int, input().strip().split()))\nres = [[arr[0]],]\nstart = [arr[0]]\ndone = False\nfor i in range(1, n):\n t = arr[i]\n if (start[len(start)-1]) > t:\n res.append([t])\n start.append(t)\n else:\n l, r = 0, len(start)-1\n while r-l > 1:\n mm = l + int((r-l)/2)\n if start[mm] < t:\n r = mm\n else:\n l = mm\n if start[l] < t:\n res[l].append(t)\n start[l] = t\n else:\n res[r].append(t)\n start[r] = t\nfor ls in res:\n for i in ls:\n print (i, end=' ')\n print ()", "from bisect import bisect_left\r\n\r\nn = int(input())\r\nA = list(map(int,input().split()))\r\n\r\nmax_vals = []\r\nresult_lists = []\r\n\r\nfor i in range(n):\r\n val = -A[i]\r\n idx = bisect_left(max_vals,val)\r\n if idx == len(max_vals):\r\n max_vals.append(0)\r\n result_lists.append([])\r\n max_vals[idx] = val\r\n result_lists[idx].append(-val)\r\n\r\nfor res in result_lists:\r\n print(\" \".join([str(i) for i in res]))\r\n", "class SegmentTree:\r\n def __init__(self, data, default=0, func=max):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n\r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n\r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n\r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n\r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n\r\n def __len__(self):\r\n return self._len\r\n\r\n def query(self, start, stop):\r\n \"\"\"func of data[start, stop)\"\"\"\r\n start += self._size\r\n stop += self._size\r\n\r\n res_left = res_right = self._default\r\n while start < stop:\r\n if start & 1:\r\n res_left = self._func(res_left, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res_right = self._func(self.data[stop], res_right)\r\n start >>= 1\r\n stop >>= 1\r\n\r\n return self._func(res_left, res_right)\r\n\r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\nfrom collections import defaultdict\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nimport heapq \r\n\r\ndef f(a):\r\n res=[[]]\r\n res=[]\r\n d=defaultdict(int)\r\n base=1\r\n rd=defaultdict(int)\r\n for i in sorted(a):\r\n d[i]=base\r\n rd[base]=i\r\n base+=1\r\n bad=[float(\"inf\")]*(base+1)\r\n st=SegmentTree(data=bad,func=min,default=float(\"inf\"))\r\n id=-1\r\n ans=[]\r\n for i in a:\r\n i=d[i]\r\n q=st.query(0,i)\r\n if q==float(\"inf\"):\r\n ans.append([i])\r\n id+=1\r\n st[i]=id\r\n else:\r\n st[ans[q][-1]]=float(\"inf\")\r\n ans[q].append(i)\r\n st[i]=q\r\n for i in ans:\r\n i=list(map(lambda s:rd[s],i))\r\n print(*i)\r\n\r\na=input()\r\nl=list(map(int,input().strip().split()))\r\nf(l)\r\n", "n=int(input())\narr=list(map(int,input().split()))\nans=[0]*1\nans[0]=[]\nans[0].append(arr[0])\nfor i in range(1,n,1):\n\tlo,hi=0,len(ans)\n\tidx=-1\n\twhile(lo<=hi):\n\t\tmid=(lo+hi)//2\n\t\t#print(lo,hi,i)\n\t\tif lo!=len(ans) and ans[mid][len(ans[mid])-1]<arr[i]:\n\t\t\tidx=mid\n\t\t\thi=mid-1\n\t\telse:\n\t\t\tlo=mid+1\n\tif len(ans)==hi:\n\t\tans.append([])\n\t\tans[hi].append(arr[i])\n\telse:\n\t\tans[idx].append(arr[i])\nfor i in range(len(ans)):\n\tfor j in range(len(ans[i])):\n\t\tprint(ans[i][j],end=\" \")\n\tprint()\n", "import bisect\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd=[]\r\nms=[]\r\nfor i in range(n):\r\n idx=bisect.bisect_left(ms,-a[i])\r\n if idx==len(ms):\r\n d.append([a[i]])\r\n ms.append(-a[i])\r\n else:\r\n ms[idx]=-a[i]\r\n d[idx].append(a[i])\r\nfor x in d:\r\n print(*x)", "input()\r\nnums = map(int, input().split())\r\ngroups = []\r\n\r\nfor n in nums:\r\n if not groups:\r\n groups.append([n])\r\n continue\r\n l, r = 0, len(groups)\r\n while l < r:\r\n mid = (l + r) // 2\r\n if groups[mid][-1] >= n:\r\n l = mid + 1\r\n else:\r\n r = mid\r\n if l == len(groups):\r\n groups.append([n])\r\n else:\r\n groups[l].append(n)\r\n\r\nfor g in groups:\r\n print(*g)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nans = []\r\nfor i in l:\r\n l = 0\r\n r = len(ans)\r\n while l != r:\r\n m = (l + r) // 2\r\n if ans[m][-1] < i:\r\n r = m\r\n else:\r\n l = m + 1\r\n\r\n if l == len(ans):\r\n ans.append([i])\r\n else:\r\n ans[l].append(i)\r\n\r\nfor i in ans:\r\n print(\" \".join(list(map(str, i))))\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nres=[]\r\nfor x in a:\r\n\tlo=0\r\n\thi=len(res)\r\n\twhile lo<hi:\r\n\t\tmid=(lo+hi)//2\r\n\t\tif res[mid][-1]<x:\r\n\t\t\thi=mid\r\n\t\telse:\r\n\t\t\tlo=mid+1\r\n\tif lo==len(res):res.append([x])\r\n\telse:res[lo].append(x)\r\nfor sub in res:\r\n\tprint(*sub)", "n = int(input())\r\n\r\nsequences = []\r\nlast_elements = []\r\nnums = list(map(int, input().split()))\r\n\r\nsequences.append([nums[0]])\r\nlast_elements.append(nums[0])\r\n\r\nfor i in range(1, n):\r\n num = nums[i]\r\n\r\n l = 0\r\n r = len(last_elements) - 1\r\n\r\n while l != r:\r\n m = (l+r)//2\r\n if last_elements[m] >= num:\r\n l = m + 1\r\n else:\r\n r = m\r\n\r\n if num > last_elements[r]:\r\n sequences[r].append(num)\r\n last_elements[r] = num\r\n else:\r\n last_elements.append(num)\r\n sequences.append([num])\r\n\r\nfor s in sequences:\r\n print(*s)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom bisect import*\r\nfrom collections import deque,defaultdict\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nseen = [-1]*N\r\nseen[0] = N\r\ncur = deque([A[0]])\r\nfor i in range(1,N):\r\n a = A[i]\r\n idx = bisect_left(cur, a)\r\n if idx>0:\r\n cur[idx-1] = a\r\n seen[i] = N-(len(cur)-idx)\r\n else:\r\n cur.appendleft(a)\r\n seen[i] = N-(len(cur)-idx-1)\r\n \r\nlib = defaultdict(list)\r\nfor i in range(N):\r\n lib[seen[i]].append(A[i])\r\n \r\nfor k,v in lib.items():\r\n print(*v)\r\n ", "from sys import stdin\r\nfrom math import sqrt\r\n\r\n\r\ndef main():\r\n n = int(stdin.readline())\r\n a = list(map(int, stdin.readline().split()))\r\n ans = [[a[0], ], ]\r\n for i in range(1, n):\r\n l = 0\r\n r = len(ans)-1\r\n while r > l:\r\n m = (r+l)//2\r\n if a[i] > ans[m][len(ans[m])-1]:\r\n r = m\r\n else:\r\n l = m+1\r\n if a[i] > ans[l][len(ans[l])-1]:\r\n ans[l].append(a[i])\r\n else:\r\n ans.append([a[i], ])\r\n for arr in ans:\r\n print(*arr)\r\n\r\n\r\nmain()\r\n", "N = int(input())\r\nnums = [int(x) for x in input().split()]\r\n\r\nseq = []\r\nfor i in nums:\r\n l,r = 0, len(seq)\r\n while l < r:\r\n mid = (l + r) // 2\r\n if seq[mid][-1] < i:\r\n r = mid\r\n else:\r\n l = mid + 1\r\n if l == len(seq):\r\n seq.append([i])\r\n else:\r\n seq[l].append(i)\r\nfor i in seq:\r\n print(*i)", "# 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\nn = inp()\r\nl = li()\r\nans = [[l[0]]]\r\ncur = [l[0]]\r\nfor i in range(1, n):\r\n if l[i] < cur[-1]:\r\n cur.append(l[i])\r\n ans.append([l[i]])\r\n else:\r\n low = len(cur) - 1\r\n high = 0\r\n ind = -1\r\n while low >= high:\r\n mid = (low+high)//2\r\n if cur[mid] > l[i]:\r\n high = mid + 1\r\n else:\r\n ind = mid\r\n low = mid - 1\r\n cur[ind] = l[i]\r\n ans[ind].append(l[i])\r\nfor i in ans:\r\n print(*i)\r\n", "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\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\ndef binsearch2(arr,v):\r\n pos=0\r\n last=len(arr)-1\r\n i=last\r\n while(i>0):\r\n while(last>=pos+i and v>=arr[pos+i][0]):\r\n pos=pos+i\r\n i=i//2\r\n if(pos==0):\r\n if(v<arr[0][0]):\r\n return pos\r\n return pos+1\r\ndef main():\r\n n=int(input())\r\n arr=list(map(int, input().split()))\r\n if(n==1):\r\n print(*arr)\r\n exit()\r\n for i in range(n):\r\n arr[i]=[arr[i],i]\r\n arr.sort()\r\n ans=[[arr[-1][1],arr[-1][0]]]\r\n for i in range(n-2,-1,-1):\r\n v=binsearch2(ans,arr[i][1])\r\n if(v==len(ans)):\r\n ans.append([arr[i][1],arr[i][0]])\r\n else:\r\n ans[v][0]=arr[i][1]\r\n ans[v].append(arr[i][0])\r\n for i in ans:\r\n i.reverse()\r\n print(*i[:len(i)-1])\r\nmain()", "n = int(input())\r\nlst = list(map(int, input().strip().split()))\r\n\r\nans = [[lst[0]],]\r\nhead = [lst[0]]\r\n\r\nadded = False\r\nfor i in range(1, n):\r\n t = lst[i]\r\n if (head[len(head)-1]) > t:\r\n ans.append([t])\r\n head.append(t)\r\n else:\r\n l, r = 0, len(head)-1\r\n while r-l > 1:\r\n mm = l + int((r-l)/2)\r\n if head[mm] < t:\r\n r = mm\r\n else:\r\n l = mm\r\n if head[l] < t:\r\n ans[l].append(t)\r\n head[l] = t\r\n else:\r\n ans[r].append(t)\r\n head[r] = t\r\n\r\nfor ls in ans:\r\n print(' ' .join(str(x) for x in ls))", "class CodeforcesTask847BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.sequence = []\n\n def read_input(self):\n self.n = int(input())\n self.sequence = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n mx = 2000001\n ans = [[] for x in range(mx)]\n crf = [0] * mx\n cnt = 0\n id = 0\n for x in range(self.n):\n if not x:\n ans[cnt].append(self.sequence[x])\n crf[cnt] = self.sequence[x]\n else:\n if self.sequence[x] <= crf[cnt]:\n cnt += 1\n id = cnt\n else:\n l = 0\n r = cnt\n while l < r:\n mid = (l + r) // 2\n if crf[mid] >= self.sequence[x]:\n l = mid + 1\n else:\n r = mid\n id = r\n ans[id].append(self.sequence[x])\n crf[id] = self.sequence[x]\n self.result = \"\\n\".join([\" \".join([str(x) for x in row]) for row in ans[:cnt + 1]])\n\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask847BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\n\r\na = []\r\narr = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if len(a) == 0:\r\n a.append([arr[i]])\r\n continue\r\n el = arr[i]\r\n l, r = 0, len(a) - 1\r\n while r - l >= 1:\r\n m = (l + r) // 2\r\n if el > a[m][-1]:\r\n r = m\r\n else:\r\n l = m + 1\r\n if el < a[l][-1]:\r\n a.append([el])\r\n else:\r\n a[l].append(el)\r\n\r\nfor x in a:\r\n for el in x:\r\n print(el, end=' ')\r\n print()", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(n):\r\n l=0\r\n r=len(ans)\r\n while l<r:\r\n mid=l+(r-l)//2\r\n if ans[mid][-1]<a[i]:\r\n r=mid\r\n else:\r\n l=mid+1\r\n if l==len(ans):\r\n ans.append([a[i]])\r\n else:\r\n ans[l].append(a[i])\r\nfor x in ans:\r\n print(*x)\r\n\r\n\r\n", "# select nodes that have no in degree and incrementally\r\n# remove indegrees of their child nodes, if it has\r\n# undirected edge, direct it, at last check if all nodes\r\n# does not have in degree\r\n# 数据范围太大注意可不可以离散化！！！！\r\nfrom collections import defaultdict, deque\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n# region fastio\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nimport random\r\n\r\n\r\nclass TreapMultiSet(object):\r\n root = 0\r\n size = 0\r\n\r\n def __init__(self, data=None):\r\n if data:\r\n data = sorted(data)\r\n self.root = treap_builder(data)\r\n self.size = len(data)\r\n\r\n def add(self, key):\r\n self.root = treap_insert(self.root, key)\r\n self.size += 1\r\n\r\n def remove(self, key):\r\n self.root = treap_erase(self.root, key)\r\n self.size -= 1\r\n\r\n def discard(self, key):\r\n try:\r\n self.remove(key)\r\n except KeyError:\r\n pass\r\n\r\n def ceiling(self, key):\r\n x = treap_ceiling(self.root, key)\r\n return treap_keys[x] if x else None\r\n\r\n def higher(self, key):\r\n x = treap_higher(self.root, key)\r\n return treap_keys[x] if x else None\r\n\r\n def floor(self, key):\r\n x = treap_floor(self.root, key)\r\n return treap_keys[x] if x else None\r\n\r\n def lower(self, key):\r\n x = treap_lower(self.root, key)\r\n return treap_keys[x] if x else None\r\n\r\n def max(self):\r\n return treap_keys[treap_max(self.root)]\r\n\r\n def min(self):\r\n return treap_keys[treap_min(self.root)]\r\n\r\n def __len__(self):\r\n return self.size\r\n\r\n def __nonzero__(self):\r\n return bool(self.root)\r\n\r\n __bool__ = __nonzero__\r\n\r\n def __contains__(self, key):\r\n return self.floor(key) == key\r\n\r\n def __repr__(self):\r\n return \"TreapMultiSet({})\".format(list(self))\r\n\r\n def __iter__(self):\r\n if not self.root:\r\n return iter([])\r\n out = []\r\n stack = [self.root]\r\n while stack:\r\n node = stack.pop()\r\n if node > 0:\r\n if right_child[node]:\r\n stack.append(right_child[node])\r\n stack.append(~node)\r\n if left_child[node]:\r\n stack.append(left_child[node])\r\n else:\r\n out.append(treap_keys[~node])\r\n return iter(out)\r\n\r\n\r\nclass TreapSet(TreapMultiSet):\r\n def add(self, key):\r\n self.root, duplicate = treap_insert_unique(self.root, key)\r\n if not duplicate:\r\n self.size += 1\r\n\r\n def __repr__(self):\r\n return \"TreapSet({})\".format(list(self))\r\n\r\n\r\nclass TreapHashSet(TreapMultiSet):\r\n def __init__(self, data=None):\r\n if data:\r\n self.keys = set(data)\r\n super(TreapHashSet, self).__init__(self.keys)\r\n else:\r\n self.keys = set()\r\n\r\n def add(self, key):\r\n if key not in self.keys:\r\n self.keys.add(key)\r\n super(TreapHashSet, self).add(key)\r\n\r\n def remove(self, key):\r\n self.keys.remove(key)\r\n super(TreapHashSet, self).remove(key)\r\n\r\n def discard(self, key):\r\n if key in self.keys:\r\n self.remove(key)\r\n\r\n def __contains__(self, key):\r\n return key in self.keys\r\n\r\n def __repr__(self):\r\n return \"TreapHashSet({})\".format(list(self))\r\n\r\n\r\nclass TreapHashMap(TreapMultiSet):\r\n def __init__(self, data=None):\r\n if data:\r\n self.map = dict(data)\r\n super(TreapHashMap, self).__init__(self.map.keys())\r\n else:\r\n self.map = dict()\r\n\r\n def __setitem__(self, key, value):\r\n if key not in self.map:\r\n super(TreapHashMap, self).add(key)\r\n self.map[key] = value\r\n\r\n def __getitem__(self, key):\r\n return self.map[key]\r\n\r\n def add(self, key):\r\n raise TypeError(\"add on TreapHashMap\")\r\n\r\n def get(self, key, default=None):\r\n return self.map.get(key, default=default)\r\n\r\n def remove(self, key):\r\n self.map.pop(key)\r\n super(TreapHashMap, self).remove(key)\r\n\r\n def discard(self, key):\r\n if key in self.map:\r\n self.remove(key)\r\n\r\n def __contains__(self, key):\r\n return key in self.map\r\n\r\n def __repr__(self):\r\n return \"TreapHashMap({})\".format(list(self))\r\n\r\n\r\nleft_child = [0]\r\nright_child = [0]\r\ntreap_keys = [0]\r\ntreap_prior = [0.0]\r\n\r\n\r\ndef treap_builder(sorted_data):\r\n \"\"\"Build a treap in O(n) time using sorted data\"\"\"\r\n\r\n def build(begin, end):\r\n if begin == end:\r\n return 0\r\n mid = (begin + end) // 2\r\n root = treap_create_node(sorted_data[mid])\r\n left_child[root] = build(begin, mid)\r\n right_child[root] = build(mid + 1, end)\r\n\r\n # sift down the priorities\r\n ind = root\r\n while True:\r\n lc = left_child[ind]\r\n rc = right_child[ind]\r\n\r\n if lc and treap_prior[lc] > treap_prior[ind]:\r\n if rc and treap_prior[rc] > treap_prior[rc]:\r\n treap_prior[ind], treap_prior[rc] = treap_prior[rc], treap_prior[ind]\r\n ind = rc\r\n else:\r\n treap_prior[ind], treap_prior[lc] = treap_prior[lc], treap_prior[ind]\r\n ind = lc\r\n elif rc and treap_prior[rc] > treap_prior[ind]:\r\n treap_prior[ind], treap_prior[rc] = treap_prior[rc], treap_prior[ind]\r\n ind = rc\r\n else:\r\n break\r\n return root\r\n\r\n return build(0, len(sorted_data))\r\n\r\n\r\ndef treap_create_node(key):\r\n treap_keys.append(key)\r\n treap_prior.append(random.random())\r\n left_child.append(0)\r\n right_child.append(0)\r\n return len(treap_keys) - 1\r\n\r\n\r\ndef treap_split(root, key):\r\n left_pos = right_pos = 0\r\n while root:\r\n if key < treap_keys[root]:\r\n left_child[right_pos] = right_pos = root\r\n root = left_child[root]\r\n else:\r\n right_child[left_pos] = left_pos = root\r\n root = right_child[root]\r\n left, right = right_child[0], left_child[0]\r\n right_child[left_pos] = left_child[right_pos] = right_child[0] = left_child[0] = 0\r\n return left, right\r\n\r\n\r\ndef treap_merge(left, right):\r\n where, pos = left_child, 0\r\n while left and right:\r\n if treap_prior[left] > treap_prior[right]:\r\n where[pos] = pos = left\r\n where = right_child\r\n left = right_child[left]\r\n else:\r\n where[pos] = pos = right\r\n where = left_child\r\n right = left_child[right]\r\n where[pos] = left or right\r\n node = left_child[0]\r\n left_child[0] = 0\r\n return node\r\n\r\n\r\ndef treap_insert(root, key):\r\n if not root:\r\n return treap_create_node(key)\r\n left, right = treap_split(root, key)\r\n return treap_merge(treap_merge(left, treap_create_node(key)), right)\r\n\r\n\r\ndef treap_insert_unique(root, key):\r\n if not root:\r\n return treap_create_node(key), False\r\n left, right = treap_split(root, key)\r\n if left and treap_keys[left] == key:\r\n return treap_merge(left, right), True\r\n return treap_merge(treap_merge(left, treap_create_node(key)), right), False\r\n\r\n\r\ndef treap_erase(root, key):\r\n if not root:\r\n raise KeyError(key)\r\n if treap_keys[root] == key:\r\n return treap_merge(left_child[root], right_child[root])\r\n node = root\r\n while root and treap_keys[root] != key:\r\n parent = root\r\n root = left_child[root] if key < treap_keys[root] else right_child[root]\r\n if not root:\r\n raise KeyError(key)\r\n if root == left_child[parent]:\r\n left_child[parent] = treap_merge(left_child[root], right_child[root])\r\n else:\r\n right_child[parent] = treap_merge(left_child[root], right_child[root])\r\n\r\n return node\r\n\r\n\r\ndef treap_ceiling(root, key):\r\n while root and treap_keys[root] < key:\r\n root = right_child[root]\r\n if not root:\r\n return 0\r\n min_node = root\r\n min_key = treap_keys[root]\r\n while root:\r\n if treap_keys[root] < key:\r\n root = right_child[root]\r\n else:\r\n if treap_keys[root] < min_key:\r\n min_key = treap_keys[root]\r\n min_node = root\r\n root = left_child[root]\r\n return min_node\r\n\r\n\r\ndef treap_higher(root, key):\r\n while root and treap_keys[root] <= key:\r\n root = right_child[root]\r\n if not root:\r\n return 0\r\n min_node = root\r\n min_key = treap_keys[root]\r\n while root:\r\n if treap_keys[root] <= key:\r\n root = right_child[root]\r\n else:\r\n if treap_keys[root] < min_key:\r\n min_key = treap_keys[root]\r\n min_node = root\r\n root = left_child[root]\r\n return min_node\r\n\r\n\r\ndef treap_floor(root, key):\r\n while root and treap_keys[root] > key:\r\n root = left_child[root]\r\n if not root:\r\n return 0\r\n max_node = root\r\n max_key = treap_keys[root]\r\n while root:\r\n if treap_keys[root] > key:\r\n root = left_child[root]\r\n else:\r\n if treap_keys[root] > max_key:\r\n max_key = treap_keys[root]\r\n max_node = root\r\n root = right_child[root]\r\n return max_node\r\n\r\n\r\ndef treap_lower(root, key):\r\n while root and treap_keys[root] >= key:\r\n root = left_child[root]\r\n if not root:\r\n return 0\r\n max_node = root\r\n max_key = treap_keys[root]\r\n while root:\r\n if treap_keys[root] >= key:\r\n root = left_child[root]\r\n else:\r\n if treap_keys[root] > max_key:\r\n max_key = treap_keys[root]\r\n max_node = root\r\n root = right_child[root]\r\n return max_node\r\n\r\n\r\ndef treap_min(root):\r\n if not root:\r\n raise ValueError(\"min on empty treap\")\r\n while left_child[root]:\r\n root = left_child[root]\r\n return root\r\n\r\n\r\ndef treap_max(root):\r\n if not root:\r\n raise ValueError(\"max on empty treap\")\r\n while right_child[root]:\r\n root = right_child[root]\r\n return root\r\n\r\n\r\ndef floyd_warshall(n, edges):\r\n dist = [[0 if i == j else float(\"inf\") for i in range(n)] for j in range(n)]\r\n pred = [[None] * n for _ in range(n)]\r\n\r\n for u, v, d in edges:\r\n dist[u][v] = d\r\n pred[u][v] = u\r\n\r\n for k in range(n):\r\n for i in range(n):\r\n for j in range(n):\r\n if dist[i][k] + dist[k][j] < dist[i][j]:\r\n dist[i][j] = dist[i][k] + dist[k][j]\r\n pred[i][j] = pred[k][j]\r\n \"\"\"Sanity Check\r\n for u, v, d in edges:\r\n if dist[u] + d < dist[v]:\r\n return None\r\n \"\"\"\r\n\r\n return dist, pred\r\n\r\n\r\n# sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nfrom types import GeneratorType\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\nimport bisect\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nfind_set = TreapMultiSet(arr)\r\nans = defaultdict(list)\r\nadded = set()\r\ncnt = 0\r\nq = deque()\r\nq.append(arr[0])\r\nans[0].append(arr[0])\r\ncnt += 1\r\nfor i in range(1,n):\r\n res = bisect.bisect_left(q, arr[i])\r\n #print(arr[i],res,q)\r\n if res == 0:\r\n q.appendleft(arr[i])\r\n ans[cnt].append(arr[i])\r\n cnt += 1\r\n elif res < len(q) and arr[i] == q[res - 1]:\r\n q.appendleft(arr[i])\r\n ans[cnt].append(arr[i])\r\n cnt += 1\r\n else:\r\n ans[len(q) - res].append(arr[i])\r\n q[res - 1] = arr[i]\r\n #print(q, ans)\r\n\r\nfor index in range(len(ans)):\r\n print(' '.join(str(i) for i in ans[index]))\r\n\r\n''' \r\nsys.setrecursionlimit(200000)\r\nimport threading\r\nthreading.stack_size(10**8)\r\nt=threading.Thread(target=main)\r\nt.start()\r\nt.join()\r\n'''\r\n\r\n''' \r\nsys.setrecursionlimit(200000)\r\nimport threading\r\nthreading.stack_size(10**8)\r\nt=threading.Thread(target=main)\r\nt.start()\r\nt.join()\r\n'''\r\n\r\n\r\n", "n = int(input())\nfrom bisect import bisect_left\na = list(map(int, input().split()))\nss = []\nms = []\nfor i in range(n):\n k = a[i]\n ind = bisect_left(ms, -k)\n if ind == len(ms):\n ss.append([])\n ms.append(0)\n ss[ind].append(k)\n ms[ind] = -k\nfor s in ss:\n print(' '.join([str(i) for i in s]))\n\n \t \t\t\t \t \t \t \t\t\t \t\t \t\t", "import bisect\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nlol = [[a[0]]]\r\ngreatest = [a[0]] #list of greatest element in lists\r\n\r\n\r\ndef first_greatest(k):\r\n #returns index of first element of greatest which is less than k\r\n lo = 0\r\n hi = len(greatest)\r\n while lo < hi:\r\n mid = lo + (hi - lo) // 2\r\n if greatest[mid] < k:\r\n hi = mid\r\n else:\r\n lo = mid + 1\r\n\r\n return lo\r\n\r\nfor i in range(1,n):\r\n if a[i] < greatest[-1]:\r\n lol.append([a[i]])\r\n greatest.append(a[i])\r\n else:\r\n ind = first_greatest(a[i])\r\n greatest[ind] = a[i]\r\n lol[ind].append(a[i])\r\n\r\nfor l in lol:\r\n for i in l:\r\n print(i, end=' ')\r\n print()\r\n" ]

[ "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nq,w,l,m=0,0,[],0\r\nfor i in range(n-1):\r\n if a[i]&1:q+=1\r\n else:w+=1\r\n if q==w:l.append(abs(a[i]-a[i+1]))\r\nl.sort()\r\nfor i in l:\r\n if i<=b:m+=1;b-=i\r\n else:break\r\nprint(m)", "import math\r\nfrom decimal import *\r\nimport random\r\nmod = int(1e9)+7\r\n\r\nn,k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nodd, even = 0,0\r\npos = []\r\nfor i in range(n-1):\r\n if(arr[i]%2==0):\r\n even+=1\r\n elif(arr[i]%2==1):\r\n odd+=1\r\n if(odd==even):\r\n pos.append(abs(arr[i+1]-arr[i]))\r\npos = sorted(pos)\r\nans= 0\r\nif(pos):\r\n while(k-pos[ans] >=0):\r\n k-=pos[ans]\r\n ans+=1\r\n if(ans==len(pos)):\r\n break\r\nprint(ans)\r\n", "e,c=map(int,input().split())\r\narr = list(map(int,input().split()))\r\nlst = []\r\nn = 0\r\nnodds = 0\r\nnevens = 0\r\nfor b in arr:\r\n if b%2==0:\r\n nevens+=1\r\n else:\r\n nodds+=1\r\nfor i in range(e):\r\n if arr[i]%2==0:\r\n n+=1\r\n else:\r\n n-=1\r\n if n==0 and i!=0:\r\n nodds-=1\r\n nevens-=1\r\n if i==e-1:\r\n break\r\n else:\r\n if nodds==nevens and nodds>0 and nevens>0:\r\n lst.append(abs(arr[i]-arr[i+1]))\r\nif lst:\r\n lst.sort()\r\n sm = 0\r\n cuts = 0\r\n for q in lst:\r\n sm+=q\r\n if sm<=c:\r\n cuts+=1\r\n else:\r\n break\r\n print(cuts)\r\nelse:\r\n print(0)", "n, b = map(int,input().split())\nv = list(map(int,input().split()))\n\ncosts = []\n\nodds = 0\nevens = 0\nfor i in range(n-1):\n if v[i] % 2 == 0:\n evens += 1\n else:\n odds += 1\n if odds == evens and odds != 0 and i != (n-1):\n costs.append(abs(v[i+1]-v[i]))\n odds = 0\n evens = 0\n\ncount = 0\nacc = 0\nfor cost in sorted(costs):\n if acc + cost <= b:\n count += 1\n acc = acc + cost\n else:\n break\nprint(count)\n", "def main():\r\n n, b = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n\r\n even_counter, odd_counter = 0, 0\r\n temp_list = []\r\n for i in range(n - 1):\r\n if arr[i] % 2 == 0:\r\n even_counter += 1\r\n else:\r\n odd_counter += 1\r\n\r\n if even_counter == odd_counter and even_counter != 0:\r\n temp_list.append((i, abs(arr[i] - arr[i + 1])))\r\n\r\n temp_list.sort(key=lambda x: x[1])\r\n counter = 0\r\n s = 0\r\n for element in temp_list:\r\n s += element[1]\r\n if s > b:\r\n break\r\n else:\r\n counter += 1\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def cutting(n, b, array):\r\n# print(n, b, array)\r\n odd, even = 0, 0\r\n for val in array:\r\n if val % 2 == 0: even += 1\r\n else: odd += 1\r\n \r\n new_odd, new_even = 0, 0\r\n if array[0] % 2 == 0: new_even += 1; even -= 1\r\n else: new_odd += 1; odd -= 1\r\n \r\n# print(\"odd, even\", odd, even)\r\n# print(\"new_odd, new_even\", new_odd, new_even)\r\n cost = []\r\n for i in range(1, len(array) - 1):\r\n if array[i] % 2 == 0: new_even += 1; even -= 1\r\n else: new_odd += 1; odd -= 1\r\n# print(\"now\", array[i], new_odd, new_even, odd, even)\r\n if odd == even and new_odd == new_even:\r\n cost.append(abs(array[i+1]-array[i]))\r\n cost.sort()\r\n cuts = 0\r\n for c in cost:\r\n if c>b: break\r\n b-=c\r\n cuts+=1\r\n# print(\"cost\", cost, cuts)\r\n print(cuts)\r\n# return cuts\r\n\r\n\r\nn, b = input().split(' ')\r\nn, b = int(n), int(b)\r\narray = input().split(' ')\r\narray = [int(val) for val in array]\r\ncutting(n, b, array)", "I = lambda: map(int, input().split())\r\n\r\nn, B = I()\r\nA, D, count, k = list(I()), [], 0, 0\r\n\r\nfor a1, a2 in zip(A, A[1:]):\r\n count = (count - 1) if a1 % 2 else (count + 1)\r\n if count == 0:\r\n D.append(abs(a1 - a2))\r\n\r\nfor d in sorted(D):\r\n if d > B:\r\n break\r\n B, k = B - d, k + 1\r\n\r\nprint(k)", "n,b= map(int, input().split())\r\nl= list(map(int, input().split()))\r\nodd=0\r\neve=0\r\ntemp=[]\r\nfor i in range(n-1):\r\n if(l[i]%2==0):\r\n eve+=1\r\n else:\r\n odd+=1\r\n \r\n if(eve==odd):\r\n temp.append(abs(l[i+1]-l[i]))\r\n eve=0\r\n odd=0\r\n\r\ntemp.sort()\r\nans=0\r\nc=0\r\nfor i in range(len(temp)):\r\n c+=temp[i]\r\n if(c>b):\r\n break\r\n else:\r\n ans+=1\r\n\r\nprint(ans)\r\n", "n, B = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nb = [0] * n\r\ndst = 0\r\nlast0 = 0\r\nlast1 = 0\r\n\r\nfor i in range(n - 1):\r\n if a[i] % 2 == 0:\r\n last0 += 1\r\n else:\r\n last1 += 1\r\n if last0 == last1:\r\n last0 = 0\r\n last1 = 0\r\n b[dst] = abs(a[i] - a[i + 1])\r\n dst += 1\r\n\r\nb = b[:dst]\r\nb.sort()\r\n\r\nans = 0\r\nb_sum = 0\r\n\r\nfor bi in b:\r\n b_sum += bi\r\n if b_sum > B:\r\n break\r\n ans += 1\r\n\r\nprint(ans)\r\n", "N, B = map(int, input().split())\nnumbers = list(map(int, input().split()))\ncosts = []\ndiv_possible = list(map(lambda x: x % 2 == 0, numbers))\ncosts = []\n\ncurrent_even = 0\ncurrent_odd = 0\nfor i in range(len(div_possible) - 1):\n divisible = numbers[i] % 2\n current_even += divisible\n current_odd += not divisible\n #print(current_odd, current_even)\n if current_even == current_odd:\n costs.append(abs(numbers[i + 1] - numbers[i]))\n\ndivisible = numbers[len(numbers) - 1] % 2\ncurrent_even += divisible\ncurrent_odd += not divisible\n\nif current_even != current_odd:\n print(0)\nelse:\n costs.sort()\n div_count = 0\n for cost in costs:\n B -= cost\n if B >= 0:\n div_count += 1\n else:\n break\n\n print(div_count)", "n, B = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nsum = 0\r\ncnt = [] # 记录每个区间的代价\r\nfor i in range(n):\r\n if a[i] & 1:\r\n sum += 1\r\n else:\r\n sum -= 1\r\n if sum == 0 and i + 1 < n:\r\n cnt.append(abs(a[i + 1] - a[i]))\r\n\r\ncnt.sort()\r\nans = 0\r\nfor c in cnt:\r\n if B >= c:\r\n B -= c\r\n ans += 1\r\n else:\r\n break\r\n\r\nprint(ans)", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n-1):\r\n c,d=0,0\r\n for j in range(i+1):\r\n if a[j]%2==0:\r\n c+=1\r\n else:\r\n d+=1\r\n if c==d:\r\n l.append(abs(a[i+1]-a[i]))\r\nl.sort()\r\ns=0\r\ne=0\r\nfor i in range(0,len(l)):\r\n s+=l[i]\r\n if s<=b:\r\n \r\n e+=1\r\nprint(e)\r\n\r\n \r\n ", "import math\nn, B = map(int, input().split())\na = list(map(int, input().split()))\nc2 = [0] * n\nif a[0] % 2 == 0:\n\tc2[0] = 1\nfor i in range(1, n):\n\tif a[i] % 2 == 0:\n\t\tc2[i] = c2[i - 1] + 1\n\telse:\n\t\tc2[i] = c2[i - 1]\nans = 0\nnu = list(range(n - 1))\n#print(nu)\n#print(c2)\nwhile ans < n and B > 0:\n\trm = 9000000\n\tmn = 9000000\n\tfor i in range(0, len(nu)):\n\t\t#print(nu[i])\n\t\tif c2[nu[i]] == nu[i] + 1 - c2[nu[i]]:\n\t\t\tif mn > abs(a[nu[i]] - a[nu[i] + 1]):\n\t\t\t\tmn = abs(a[nu[i]] - a[nu[i] + 1])\n\t\t\t\trm = i\n\t\t#else:\n\t\t\t#del nu[i]\n\tif rm == 9000000 or B < mn:\n\t\tbreak\n\telse:\n\t\tB -= mn\n\t\tans += 1\n\t\tdel nu[rm]\nprint(ans)\t\n", "#!/usr/bin/env python3\n# encoding: utf-8\n\n\n\n#----------\n# Constants\n#----------\n\n\n\n#----------\n# Functions\n#----------\ndef calc(a, b):\n odd_count, even_count = 0, 0\n splits = list()\n for i in range(len(a)):\n if a[i] % 2 == 0:\n even_count += 1\n else:\n odd_count += 1\n if i+1 < len(a) and odd_count == even_count:\n splits.append(abs(a[i] - a[i+1]))\n odd_count, even_count = 0, 0\n\n cost = 0\n for i, item in enumerate(sorted(splits)):\n cost += item\n if cost > b:\n break\n else:\n i = len(splits)\n\n return i\n\n\n# Reads a string from stdin, splits it by space chars, converts each\n# substring to int, adds it to a list and returns the list as a result.\ndef get_ints():\n return [ int(n) for n in input().split() ]\n\n\n# Reads a string from stdin, splits it by space chars, converts each substring\n# to floating point number, adds it to a list and returns the list as a result.\ndef get_floats():\n return [ float(n) for n in input().split() ]\n\n\n#----------\n# Execution start point\n#----------\n\nif __name__ == \"__main__\":\n a = get_ints()\n assert len(a) == 2\n n, b = a[0], a[1]\n assert 2 <= n <= 100\n assert 1 <= b <= 100\n a = get_ints()\n assert len(a) == n\n\n res = calc(a, b)\n print(res)\n", "n, B = tuple(map(int, input().split()))\na = list(map(int, input().split()))\n\nnodd = 0\nneven = 0\ncosts = []\nfor i, ai in enumerate(a):\n if ai % 2 == 0:\n neven += 1\n else:\n nodd += 1\n if i < n - 1 and neven == nodd:\n costs.append(abs(a[i+1] - ai))\n\ncosts = sorted(costs)\n\nret = 0\nsum_ = 0\nfor c in costs:\n if sum_ + c <= B:\n sum_ += c\n ret += 1\n else:\n break\nprint(ret)\n", "n, B = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\n\r\nec = [0] * (n + 1)\r\nfor i in range(n):\r\n ec[i + 1] = ec[i] + (1 if a[i] % 2 == 0 else 0)\r\n\r\ndp = [[-10**9] * 107 for _ in range(107)]\r\ndp[0][0] = 0\r\nfor i in range(1, n + 1):\r\n for j in range(B + 1):\r\n for k in range(i):\r\n e = ec[i] - ec[k]\r\n l = i - k\r\n if 2 * e == l:\r\n w = abs(a[i - 1] - a[i]) if i < n else 0\r\n if j + w <= B:\r\n dp[i][j + w] = max(dp[i][j + w], dp[k][j] + 1) # cut here \r\nans = 0\r\nfor i in range(B + 1):\r\n ans = max(ans, dp[n][i])\r\nprint(ans - 1)\r\n", "def func(no_of_items,max_weight,profit,weight):\r\n matrix=[[0 for i in range(max_weight+1)] for j in range(no_of_items+1)]\r\n for i in range(1,no_of_items+1):\r\n for j in range(1,max_weight+1):\r\n if j<int(weight[i-1]):\r\n matrix[i][j]=matrix[i-1][j]\r\n elif j>=int(weight[i-1]):\r\n matrix[i][j]=max(matrix[i-1][j],int(profit[i-1])+matrix[i-1][j-int(weight[i-1])])\r\n print(matrix[no_of_items][max_weight])\r\n\r\n\r\nn,b=map(int,input().split())\r\narr=input().split()\r\n\r\neven=0\r\nodd=0\r\n\r\nfor a in arr:\r\n if int(a)%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\nif even!=odd:\r\n print(0)\r\nelse:\r\n even=0\r\n odd=0\r\n lis=[]\r\n\r\n for i in range(n):\r\n if int(arr[i])%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if even==odd and i!=n-1:\r\n lis.append(max(int(arr[i]),int(arr[i+1]))-min(int(arr[i]),int(arr[i+1])))\r\n\r\n n=len(lis)\r\n profit=[1 for i in range(n)]\r\n func(n,b,profit,lis)", "n,b=list(map(int,input().split()))\r\nlist1=list(map(int,input().split()))\r\nbitcoin=[]\r\neven=0\r\nodd=0\r\ncounter=0\r\nfor x in range(len(list1)-1):\r\n if list1[x]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\n if even==odd:\r\n bitcoin.append(abs(list1[x]-list1[x+1]))\r\n\r\nbitcoin.sort()\r\nfor x in bitcoin:\r\n if x<=b:\r\n b-=x\r\n counter+=1\r\nprint(counter)\r\n \r\n", "\nn,cost=map(int,input().split())\nlis=[int(x) for x in input().split()]\neven=0\nodd=0\ndp=[]\nfor i in range(n-1):\n if(lis[i]%2==0):\n even+=1\n else:\n odd+=1\n if(even==odd):\n dp.append(abs(lis[i]-lis[i+1]))\ndp.sort()\ncount=0\nwhile dp:\n if(dp[0]<=cost):\n cost-=dp[0]\n dp.remove(dp[0])\n count+=1\n else:\n break\nprint(count)\n", "n, b = tuple(map(int, input().split()))\r\nsp = list(map(int, input().split()))\r\ncuts = []\r\nbal = 0\r\nfor i in range(n):\r\n if sp[i] % 2 == 0:\r\n bal += 1\r\n else:\r\n bal -= 1\r\n if bal == 0 and i != n - 1:\r\n cuts.append(abs(sp[i + 1] - sp[i]))\r\n\r\nans = len(cuts)\r\nsumm = sum(cuts)\r\nif summ > b:\r\n cuts.sort(reverse=True)\r\n for i in cuts:\r\n ans -= 1\r\n summ -= i\r\n if summ <= b:\r\n break\r\nprint(ans)\r\n", "n,k=[int(i) for i in input().split()]\r\narr=[int(i) for i in input().split()]\r\ni=0\r\ne=0\r\no=0\r\nc=0\r\nd=[]\r\nwhile i<n-1:\r\n if arr[i]&1:\r\n o+=1\r\n else:\r\n e+=1\r\n if e==o:\r\n d.append(abs(arr[i]-arr[i+1]))\r\n e=0\r\n o=0\r\n \r\n i+=1\r\nd.sort()\r\nfor i in range(len(d)):\r\n if d[i]<=k:\r\n k-=d[i]\r\n c+=1\r\n else:\r\n break\r\nprint(c)\r\n \r\n ", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\neven=0\r\nodd=0\r\nu=[]\r\nfor i in range(len(a)-1):\r\n if a[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if even==odd:\r\n even,odd=0,0\r\n u.append(abs(a[i]-a[i+1]))\r\nif sum(u)>b:\r\n u.sort()\r\n while(sum(u)>b):\r\n u.pop()\r\n print(len(u))\r\nelse:\r\n print(len(u))", "a,b=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nodd=even=0\r\nlist=[]\r\nv=0\r\nfor i in range(a-1):\r\n if x[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if odd==even:\r\n list+=[abs(x[i]-x[i+1])]\r\n odd=even=0\r\nlist.sort()\r\nfor i in list:\r\n if b>=i:\r\n v+=1\r\n b-=i\r\n else:\r\n break\r\nprint(v)", "n,b=map(int,input().split())\r\na=[int(k) for k in input().split()]\r\nnew=[];even=0;odd=0;sum=0;div=0\r\nfor i in range(n-1):\r\n if(a[i]%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\n if(odd==even):\r\n new.append(abs(a[i]-a[i+1]))\r\n\r\nnew.sort()\r\nfor i in new:\r\n sum+=i\r\n if(sum>b):\r\n break\r\n div += 1\r\n\r\nprint(div)", "n,B=list(map(int,input().split()))\r\nA=list(map(int,input().split()))\r\nn1,n2=0,0\r\npre=0\r\nL=[]\r\nfor val in range(n-1):\r\n if A[val] % 2 == 0:\r\n n1 += 1\r\n else:\r\n n2 += 1\r\n if n1==n2:\r\n L.append(abs(A[val]-A[val+1] ))\r\n #print(pre,val,abs(pre-A[val]))\r\n pre=A[val]\r\nL.sort()\r\n#print(L)\r\nif len(L) == 0:\r\n print(0)\r\nelse:\r\n count = 0\r\n for val in L:\r\n B -= val\r\n if B >= 0:\r\n count += 1\r\n print(count)\r\n ", "def mapit():\r\n\ttemp=list(map(int,input().split()))\r\n \r\n\treturn temp\r\n\r\nimport math\r\ndef solution():\r\n\tn,cost=mapit()\r\n\tarr=mapit()\r\n\r\n\tcount=[0]*n\r\n\tfor i in range(n):\r\n\t\tif i!=0:\r\n\t\t\tcount[i]+=count[i-1]\r\n\t\tif arr[i]%2:\r\n\t\t\tcount[i]+=-1\r\n\t\telse:\r\n\t\t\tcount[i]+=1\r\n\r\n\tdp=[[0 for i in range(cost+1)] for j in range(n)]\r\n\r\n\tfor i in range(1,n):\r\n\t\ttp=abs(arr[i]-arr[i-1])\r\n\t\tfor j in range(1,cost+1):\r\n\t\t\tif count[i-1]==0 and tp<=j:\r\n\t\t\t\tdp[i][j]=max(1+dp[i-1][j-tp], dp[i-1][j])\r\n\t\t\telse:\r\n\t\t\t\tdp[i][j]=dp[i-1][j]\r\n\r\n\tprint(dp[n-1][cost])\r\n\r\n\r\n\t# def rec(cost,idx):\r\n\t# \tif cost==0 or idx==n-1:\r\n\t# \t\treturn 0\r\n\t# \ttp=abs(arr[idx+1]-arr[idx])\r\n\r\n\t# \tif count[idx]==0 and tp<=cost:\r\n\t# \t\treturn max(1+rec(cost-tp, idx+1),rec(cost, idx+1))\r\n\t# \telse:\r\n\t# \t\treturn rec(cost, idx+1)\r\n\r\n\t\r\n\r\n\treturn\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n# t=int(input())\r\n \r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n", "import sys\ninput = sys.stdin.readline\n\n\ndef solve(n, B, arr):\n dp = [[0 for _ in range(B+1)] for _ in range(2)]\n prefixSum = {}\n curr = 0\n for i in range(n):\n if arr[i] % 2 == 1:\n curr += 1\n else:\n curr -= 1\n prefixSum[i] = curr\n\n prev, curr = dp[0], dp[1]\n ans = 0\n for i in range(2, n):\n for b in range(1, B+1):\n if prefixSum[i-1] == 0 and b - abs(arr[i-1]-arr[i]) >= 0:\n curr[b] = max(1 + prev[b - abs(arr[i-1]-arr[i])], prev[b])\n else:\n curr[b] = prev[b]\n ans = max(ans, curr[b])\n prev, curr = curr, prev\n print(ans)\n\n\nn, B = map(int, input().split())\narr = list(map(int, input().split()))\nsolve(n, B, arr)", "words = [];\r\nfor word in input().split():\r\n words.append(word);\r\n\r\nn = int(words[0]);\r\nb = int(words[1]);\r\n\r\nv = [];\r\nfor word in input().split():\r\n v.append(int(word));\r\n\r\nsum = 0;\r\n\r\ncuts = [];\r\n\r\nfor i in range(n):\r\n nr = v[i];\r\n if (nr % 2):\r\n sum += 1;\r\n else:\r\n sum -= 1;\r\n\r\n if (sum == 0 and i != n-1):\r\n cuts.append(abs(v[i]-v[i+1]));\r\n\r\ncuts.sort();\r\n\r\nnrCuts = 0;\r\ntotal = 0;\r\nfor cut in cuts:\r\n total += cut;\r\n if (total > b):\r\n break;\r\n nrCuts += 1;\r\n\r\nprint(nrCuts);", "def max_cut(n,b,l):\r\n a,d,k,s=[],0,0,0\r\n for i in range(n-1):\r\n if l[i]%2:\r\n k+=1\r\n else:\r\n d+=1\r\n if k==d:\r\n a.append(abs(l[i+1]-l[i]))\r\n a.sort()\r\n i=0\r\n while i<len(a) and s<b:\r\n s+=a[i]\r\n i+=1\r\n return i-1 if s>b else i\r\n\r\n\r\nR=lambda:list(map(int,input().split()))\r\nn,b=R()\r\nl=R()\r\nprint(max_cut(n,b,l))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nen=on=cut=0\r\nfor i in range(n-1):\r\n if a[i]%2==0:\r\n en+=1\r\n if a[i]%2 != 0:\r\n on+=1\r\n if en==on:\r\n b.append(abs(a[i]-a[i+1]))\r\n en=0\r\n on=0\r\nb.sort()\r\nfor e in b:\r\n if e<=k:\r\n k-=e\r\n cut+=1\r\n if k==0:\r\n break\r\nprint(cut)", "# cook your dish here\r\nn, b = map(int, input().split())\r\nls = list(map(int, input().split()))\r\nop = []\r\ne = o = 0\r\nfor i in range(n-1):\r\n if ls[i]%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\n if e==o:\r\n e = o = 0\r\n op.append(abs(ls[i]-ls[i+1]))\r\nop.sort()\r\nans = 0\r\nc = 0\r\nfor item in op:\r\n if ans+item <= b:\r\n c += 1\r\n ans += item\r\n# print(op)\r\nprint(c)", "n, b = map(int, input().split())\r\na = *map(int, input().split()),\r\ndp, s = [], [0, 0]\r\nfor i, j in zip(a, a[1:]):\r\n\ts[i % 2] += 1\r\n\tif s[0] == s[1]:\r\n\t\tdp.append(abs(j - i))\r\ndp.sort()\r\nprint(sum(sum(dp[:i + 1]) <= b for i in range(len(dp))))\r\n\t\r\n\t", "n, bitcoin = map(int, input().strip().split(\" \"))\r\nl = list(map(int, input().strip().split(\" \")))\r\n\r\neven = [0]\r\nodd = [0]\r\nfor i in range(len(l)):\r\n if l[i] % 2 == 0:\r\n even.append(even[-1] + 1)\r\n odd.append(odd[-1])\r\n else:\r\n odd.append(odd[-1] + 1)\r\n even.append(even[-1])\r\n\r\nresult = []\r\nfor i in range(1, len(odd) - 1):\r\n if odd[i] == even[i]:\r\n result.append(abs(l[i] - l[i-1]))\r\n\r\nresult = sorted(result)\r\ntillBitcoin = 0\r\ncuts = 0\r\nif len(result) != 0:\r\n for i in result:\r\n tillBitcoin += i\r\n if tillBitcoin <= bitcoin:\r\n cuts += 1\r\n\r\n print(cuts)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n\r\n", "import sys\nn, b, *a = [int(s) for s in sys.stdin.read().split()]\nemo = 0\nl = []\nfor i, (x, y) in enumerate(zip(a[:-1], a[1:])):\n emo += [1, -1][x%2]\n if emo==0:\n l.append(max(y-x, x-y))\n\nl.sort()\ns = anz = 0\nfor i in l:\n s += i\n if s > b:\n break\n else:\n anz+=1\n \nprint(anz)\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 0\r\nx = []\r\nfor i in range(n - 1):\r\n c += 1 if a[i] % 2 else -1\r\n if not c:\r\n x.append(abs(a[i] - a[i + 1]))\r\nx.sort(reverse = True)\r\nans = 0\r\nwhile x and b - x[-1] >= 0:\r\n b -= x.pop()\r\n ans += 1\r\nprint(ans)", "[n, bitcoins] = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\n\nevens_ptr = 0\nodds_ptr = 0\ncuts_costs = []\nfor i in range(1, len(b), 2):\n if b[i] % 2 == 0:\n evens_ptr += 1\n else:\n odds_ptr += 1\n \n if b[i-1] % 2 == 0:\n evens_ptr += 1\n else:\n odds_ptr += 1\n \n # if have equal value mean same even and odds integers before ptrs\n if evens_ptr == odds_ptr and i != n-1:\n cuts_costs.append( abs(b[i] - b[i+1]) )\n evens_ptr = 0\n odds_ptr = 0\n\nif len(cuts_costs) == 0:\n print(0)\nelse:\n cuts_costs.sort()\n acceptable_cuts = 0\n for i in range(len(cuts_costs)):\n if bitcoins - cuts_costs[i] >= 0:\n bitcoins -= cuts_costs[i]\n acceptable_cuts += 1\n \n print(acceptable_cuts)\n\t \t \t \t\t \t \t\t \t\t\t \t\t\t\t", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=[] \r\nx=0\r\ny=0\r\nfor i in range(len(a)-1):\r\n if a[i]%2==1:\r\n x+=1\r\n elif a[i] % 2==0:\r\n y+=1 \r\n if x == y:\r\n c.append(abs(a[i+1]-a[i]))\r\n x*=0\r\n y*=0\r\n \r\nc.sort()\r\n\r\nm=0\r\nfor i in range(len(c)):\r\n if c[i] <= b:\r\n m+=1\r\n b-=c[i] \r\n \r\nprint(m) \r\n ", "n = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nl = []\neven = 0\nodd = 0\nfor i in range(n[0]):\n\tif(a[i]%2==0):\n\t\teven += 1\n\telse:\n\t\todd+=1\n\tif(even == odd and i!=(n[0]-1)):\n\t\tl.append(abs(a[i+1]-a[i]))\nl.sort()\nc = 0\ns = 0\nfor i in l:\n\ts += i\n\tc += 1\n\tif(s>n[1]):\n\t\tc-=1\n\t\tbreak\nprint(c)\n\n", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nocount,ecount=0,0\r\nans=[]\r\nfor i in range(n):\r\n if a[i]&1:ocount+=1\r\n else:ecount+=1\r\n if ocount==ecount and i!=n-1:\r\n ans.append(abs(a[i]-a[i+1]))\r\nans.sort()\r\ncnt=0\r\nfor i in ans:\r\n if b>=i:\r\n cnt+=1\r\n b-=i\r\n else: break\r\nprint(cnt)\r\n ", "import sys\r\nimport math\r\n\r\nn,b=map(int,input().split())\r\nlista=[int(x) for x in input().strip().split()]\r\npro=[False for i in range(n)]\r\nfor i in range(n):\r\n if(lista[i]%2==0):\r\n pro[i]=True\r\no,e,k=0,0,0\r\nsuma=0\r\nsend=[]\r\nfor i in range(0,n-1):\r\n if(pro[i]==True):\r\n o+=1\r\n else:\r\n e+=1\r\n if(o==e and o!=0 and e!=0):\r\n #print(lista[i],lista[i+1])\r\n if(abs(lista[i+1]-lista[i])<=b):\r\n send.append(abs(lista[i+1]-lista[i]))\r\n k=i\r\n o,e=0,0\r\nsend=sorted(send)\r\n#print(send)\r\ncom=0\r\nfor i in range(len(send)):\r\n if (suma + send[i] > b): break\r\n suma+=send[i]\r\n com+=1\r\nkaani=pro[k:]\r\nif(pro.count(True)!=pro.count(False)): com=0\r\nprint(com)\r\n", "n, b = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncost = []\r\nce, co = 0, 0\r\nfor i in range(n-1):\r\n if arr[i] % 2 == 0:\r\n ce += 1\r\n else:\r\n co += 1\r\n if ce == co:\r\n cost.append(abs(arr[i]-arr[i+1]))\r\ncost.sort()\r\nwhile sum(cost) > b:\r\n cost.remove(cost[-1])\r\nprint(len(cost))\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ndp = list()\r\nod,ev=0,0\r\nfor i in range(n):\r\n if(a[i]%2):\r\n od+=1\r\n else:\r\n ev+=1\r\n if(od==ev and i!=0 and i!=n-1):\r\n dp.append(abs(a[i+1]-a[i]))\r\ndp.sort()\r\nsum,ans=0,0\r\nfor i in dp:\r\n sum+=i\r\n if(sum<=k):\r\n ans+=1\r\nprint(ans)\r\n", "# https://codeforces.com/problemset/problem/998/B\r\n\r\nimport sys\r\n\r\nn, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n\r\nc = 0\r\nv = []\r\nfor i in range(n - 1):\r\n c += 1 if a[i] % 2 == 0 else -1\r\n if c == 0:\r\n v.append(abs(a[i] - a[i + 1]))\r\n\r\nv.sort()\r\nfor i, x in enumerate(v):\r\n b -= x\r\n if b < 0:\r\n print(i)\r\n sys.exit()\r\n\r\n# at this point, we can make all the cuts\r\nprint(len(v))\r\n", "n, m = map(int,input().split()); i=2; j=0; l3=[]\r\nl1 =list(map(int, input().split()))\r\nl2=list([bool(i%2==0) for i in l1])\r\nwhile i<n:\r\n if (l2[:i]).count(True)==(l2[:i]).count(False):\r\n l3.append(i)\r\n i+=2\r\nl=list([abs(l1[i]-l1[i-1]) for i in l3])\r\nl.sort()\r\nk=0; i=0; a=len(l)\r\nwhile i<a:\r\n k+=l[i]\r\n if k>m:\r\n break\r\n i+=1\r\nj=i\r\nprint(j)", "n,b=input().split()\r\na=input().split()\r\nn=int(n); b=int(b)\r\na=[int(x) for x in a]\r\nc=0; d=[]\r\nfor i in range(n-1):\r\n if a[i]%2==0: c+=1\r\n else: c-=1\r\n if c==0: d.append(abs(a[i]-a[i+1]))\r\nd.sort(); c=0\r\nfor i in range(len(d)):\r\n if b-d[i]>=0: b-=d[i]; c+=1\r\n else: break\r\nprint(c)", "n,b= map(int,input().split())\r\na=list(map(int,input().split()))\r\ne=0\r\no=0\r\nc=[]\r\nfor i in range(len(a)):\r\n\tif(a[i]%2==0):\r\n\t\te+=1\r\n\t\tif e==o:\r\n\t\t\ttry:\r\n\t\t\t\tc.append(abs(a[i+1]-a[i]))\r\n\t\t\texcept:\r\n\t\t\t\tpass\r\n\telse:\r\n\t\to+=1\r\n\t\tif e==o:\r\n\t\t\ttry:\r\n\t\t\t\tc.append(abs(a[i+1]-a[i]))\r\n\t\t\texcept:\r\n\t\t\t\tpass\r\nc=sorted(c)\r\nif len(c)==0:\r\n\tprint(0)\r\n\texit()\r\nl=[c[0]]\r\nfor i in range(1,len(c)):\r\n\tl.append(l[-1]+c[i])\r\nelse:\r\n\tfor i in range(len(l)):\r\n\t\tif l[i]>b:\r\n\t\t\tprint(i)\r\n\t\t\texit()\r\n\tprint(len(c))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn,b = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n\r\npossible = []\r\ns = 0\r\n\r\nif l[0] % 2 == 0:\r\n s += 1\r\nelse:\r\n s -= 1\r\n\r\nfor i in range(1,n):\r\n if i % 2 == 0 and s == 0:\r\n possible.append(abs(l[i]-l[i-1]))\r\n \r\n if l[i] % 2 == 0:\r\n s += 1\r\n else:\r\n s -= 1\r\n \r\npossible.sort()\r\n\r\nadd = 0\r\nc = 0\r\n\r\nfor i in possible:\r\n if add + i > b:\r\n break\r\n add += i\r\n c += 1\r\nprint(c)\r\n", "n,B=map(int,input().split())\r\na=list(map(int,input().split()))\r\ne,o=0,0\r\nl=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\n if e==o and i!=n-1:\r\n l.append(abs(a[i+1]-a[i]))\r\n if i==n-1 and e!=o:\r\n l=[]\r\nl.sort()\r\nans=0\r\nfor i in l:\r\n if i<=B:\r\n ans+=1\r\n B-=i\r\nprint(ans)", "t = list(map(int, input().split()))\r\nn = t[0]\r\nB = t[1]\r\nA = list(map(int, input().split()))\r\nbalance = 0\r\nbits = []\r\nfor i, v in enumerate(A):\r\n if v % 2 == 0:\r\n balance += 1\r\n else:\r\n balance -= 1\r\n if balance == 0 and i != len(A) - 1:\r\n bits.append(abs(A[i+1] - v))\r\nans = 0\r\nfor coast in sorted(bits):\r\n if coast <= B:\r\n B -= coast\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)", "n,k=map(int,input().split())\r\nl=[int(j) for j in input().split()]\r\nt=0\r\nd=[]\r\nfor i in range(n-1):\r\n if l[i]%2==0:\r\n t+=1\r\n else:\r\n t-=1\r\n if t==0:\r\n d.append(abs(l[i]-l[i+1]))\r\nd.sort()\r\ni=0\r\n\r\nwhile i<len(d) and k>=d[i] :\r\n k-=d[i]\r\n i+=1\r\nprint(i)\r\n", "n,b = map(int, input().split()) ;x = list(map(int, input().split()));a = [];even = 0;odd = 0\r\nfor i in range(len(x)-1) :\r\n if x[i]%2 == 0 :even+=1\r\n else: odd+=1\r\n if even == odd :r = abs(x[i+1] - x[i]);a.append(r);even*=0;odd*=0\r\na.sort();omari=0\r\nfor ds in range(len(a)) :\r\n if a[ds] <= b :omari+=1;b = b - a[ds]\r\n else:break \r\nprint(omari) \r\n", "def main():\r\n n, b = map(int, input().split())\r\n a = [int(i) for i in input().split()]\r\n even, odd = 0, 0\r\n l, r = [], [int(i) for i in a]\r\n cnt_even_left, cnt_odd_left = 0, 0\r\n cnt_even_right, cnt_odd_right = n//2, n//2\r\n res = []\r\n for i in range(n-1):\r\n l.append(a[i])\r\n r.remove(a[i])\r\n if (a[i] % 2 == 0):\r\n cnt_even_left += 1\r\n cnt_even_right -= 1\r\n else:\r\n cnt_odd_left += 1\r\n cnt_odd_right -= 1\r\n cost = ((a[i]-a[i+1])**2)**.5\r\n if (cost <= b):\r\n if (cnt_even_left == cnt_odd_left and cnt_even_right == cnt_odd_right):\r\n res += [int(cost)]\r\n res.sort()\r\n cnt = 0\r\n for i in res:\r\n if (b >= i):\r\n cnt += 1\r\n b -= i\r\n print(cnt)\r\n\r\nmain()\r\n", "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nr = []\r\neo = [0, 0]\r\n\r\nfor i in range(len(a)):\r\n if eo[0] == eo[1] and eo[0] != 0:\r\n r.append(abs(a[i - 1] - a[i]))\r\n eo = [0, 0]\r\n \r\n eo[a[i] % 2] += 1\r\n \r\nr.sort()\r\nr.append(b + 1)\r\n\r\ni = 0\r\nwhile b >= 0:\r\n b -= r[i]\r\n i += 1\r\n \r\nprint(i - 1)", "n,b=map(int, input().split())\r\nA=list(map(int,input().split()))\r\nB=[]\r\nc=0\r\nfor i in range(0,n-1):\r\n\tif A[i]%2!=0:\r\n\t\tc+=1\r\n\telse:\r\n\t\tc-=1\r\n\tif c==0:\r\n\t\tB.append(abs(A[i+1]-A[i]))\r\nB.sort()\r\ni=0\r\nwhile i<len(B) and B[i]<=b:\r\n\tb-=B[i]\r\n\ti+=1\r\nprint(i)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=[]\r\neven=0\r\nodd=0\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if even==odd and i<(n-1):\r\n ans.append(abs(a[i+1]-a[i]))\r\nans.sort()\r\nval=0\r\nfor i in range(len(ans)):\r\n if ans[i]<=k:\r\n val+=1\r\n k-=ans[i]\r\nprint(val)", "from bisect import bisect_right\r\nfrom itertools import accumulate\r\n\r\nn, B = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nneed = [2 * (el % 2) - 1 for el in a]\r\nacc = list(accumulate(need))\r\nzeros = [i for i in range(n) if acc[i] == 0]\r\ncosts = [abs(a[i] - a[i + 1]) for i in zeros if i + 1 < n]\r\nfor_ans = list(accumulate(sorted(costs)))\r\n\r\nprint(bisect_right(for_ans, B))\r\n", "n,bt = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\ns = 0\r\nb = []\r\nfor i in range(n-1):\r\n s+= (1-2*(arr[i]&1))\r\n if s==0:\r\n b.append(abs(arr[i]-arr[i+1]))\r\n\r\nb.sort()\r\nans = 0\r\ni = 0\r\nwhile i<len(b):\r\n if b[i]<=bt:\r\n bt-=b[i]\r\n ans+=1\r\n else:\r\n break\r\n i+=1\r\nprint(ans)\r\n", "_, B = map(int, input().split())\r\n\r\narr = list(map(int, input().split()))\r\n\r\neven = 0\r\nodd = 0\r\n\r\ncosts = []\r\n\r\nfor i, n in enumerate(arr[:-1]):\r\n if n%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\n if even == odd:\r\n costs.append(abs(arr[i]-arr[i+1]))\r\n\r\ncosts.sort()\r\n\r\n\r\nprice = 0\r\nans = 0\r\nfor c in costs:\r\n if price+c<=B:\r\n price+=c\r\n ans+=1\r\n else:\r\n break\r\n\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n(n,B) = map(int,input().split())\r\na = list(map(int, input().split()))\r\nx = 0\r\nans = []\r\nfor i in range(n-1):\r\n if a[i] % 2 == 0:\r\n x += 1\r\n else:\r\n x -= 1\r\n if x == 0:\r\n ans.append(abs(a[i]-a[i+1]))\r\n\r\nans.sort()\r\nj = 0\r\nfor i in ans:\r\n if i <= B:\r\n j += 1\r\n B -= i\r\nprint(j)", "n,b=input().split()\r\nn,b=[int(n),int(b)]\r\na=[int(i) for i in input().split()]\r\nc=[]\r\no=0\r\ne=0\r\nfor i in range(0,n):\r\n if a[i]%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\n if e==o:\r\n if i+1<n:\r\n c.append(abs(a[i]-a[i+1]))\r\nans=0\r\ni=0\r\nc.sort()\r\nwhile i<len(c):\r\n if c[i]<=b:\r\n ans+=1\r\n b=b-c[i]\r\n i+=1\r\nprint(ans)", "n, b = map(int, input().split())\na = list(map(int, input().split()))\n\ne, o, bi = 0, 0, []\nfor i, ai in enumerate(a):\n if ai % 2 == 0:\n e += 1\n else:\n o += 1\n\n if e == o:\n if i < n-1:\n bi.append(abs(ai-a[i+1]))\n e, o = 0, 0\n\nbi.sort()\nfrom itertools import accumulate\nacc = list(accumulate(bi))\nfrom bisect import bisect_right\nbr = bisect_right(acc, b)\nprint(br)", "n,b=map(int,input().split())\r\narr=input().split()\r\n\r\neven=0\r\nodd=0\r\n\r\nfor a in arr:\r\n if int(a)%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n\r\nif even!=odd:\r\n print(0)\r\nelse:\r\n even=0\r\n odd=0\r\n lis=[]\r\n\r\n for i in range(n):\r\n if int(arr[i])%2==0:\r\n even+=1\r\n else:\r\n odd+=1\r\n if even==odd and i!=n-1:\r\n lis.append(max(int(arr[i]),int(arr[i+1]))-min(int(arr[i]),int(arr[i+1])))\r\n\r\n l=len(lis)\r\n lis.sort(key=int)\r\n temp=0\r\n count=0\r\n for i in range(l):\r\n temp+=lis[i]\r\n if temp<=b:\r\n count+=1\r\n print(count)", "# http://codeforces.com/problemset/problem/998/B \r\n\r\nn, bitcoins = map(int, input().split())\r\nnums = list(map(int, input().split()))\r\n\r\n\"\"\"\r\nWe are given that the number of even and odd numbers are equal in the array, so we can just\r\ncount the total number of times that they are equal on one side, as the other side will be\r\nequal as well... almost like matching parenthesis.\r\n\r\nThen, we just have to make sure we pick the maximum number of cuts by sorting through the cuts\r\nby bitcoin amount.\r\n\"\"\"\r\n\r\npossible_cuts = []\r\neven_minus_odd = 0\r\nfor i in range(n-1):\r\n even_minus_odd += 1 if nums[i] % 2 else -1\r\n if even_minus_odd == 0:\r\n next = nums[i+1]\r\n possible_cuts.append(abs(nums[i] - next))\r\n\r\npossible_cuts.sort()\r\n\r\nnum_cuts = 0\r\nwhile len(possible_cuts) > 0 and bitcoins >= possible_cuts[0]:\r\n bitcoins -= possible_cuts.pop(0)\r\n num_cuts += 1\r\n\r\nprint(num_cuts)", "s = list(map(int, input().split()))\r\ncl = list(map(int, input().split()))\r\nn, b = s[0], s[1]\r\ndic = {}\r\nnw = []\r\nfor x in cl:\r\n nw.append(x%2)\r\n\r\ncount0 = 0\r\ncount1 = 0\r\ncount0 = nw.count(0)\r\ncount1 = nw.count(1)\r\nif count0!=count1 or n%2!=0:\r\n print(0)\r\nelse:\r\n res = []\r\n for i in range(2, n):\r\n x = nw[:i]\r\n k0 = x.count(0)\r\n k1 = x.count(1)\r\n if count0 - k0 == count1 - k1:\r\n res.append(abs(cl[i]-cl[i-1]))\r\n\r\n counter = 0\r\n sm = 0\r\n res = sorted(res)\r\n i = 0\r\n while(sm<=b and i<len(res)):\r\n sm+=res[i]\r\n counter+=1\r\n i+=1\r\n\r\n if sm>b:\r\n counter-=1\r\n print(counter)", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\nd=input().split()\r\neven=0\r\nodd=0\r\nc=[]\r\ncounter=0\r\nfor i in range(x-1):\r\n if int(d[i])%2==0:even+=1\r\n if int(d[i])%2==1:odd+=1\r\n\r\n if even==odd:\r\n cost=abs(int(d[i])-int(d[i+1]))\r\n if cost<=y:\r\n c.append(cost)\r\n\r\nc.sort()\r\nfor i in c:\r\n if y>=0 and i<=y:\r\n y-=i\r\n counter+=1\r\n else:\r\n break\r\nprint(counter)", "# from math import ceil, floor\r\n# import sys, os\r\n# sys.stdin = open(os.path.join(sys.path[0], \"input.txt\"), \"r\")\r\n# sys.stdout = open(os.path.join(sys.path[0], \"output.txt\"), \"w\")\r\n\r\nn, money = map(int, input().split())\r\nelements = list(map(int , input().split()))\r\ncount_even = 0\r\nmem = {}\r\ndef makeSplits(index, even_count, money):\r\n if(index == n - 1):\r\n return 0\r\n if(elements[index] % 2 == 0):\r\n even_count += 1\r\n if((index, money) in mem):\r\n return mem[(index, money)]\r\n max_cuts = makeSplits(index + 1, even_count, money)\r\n if(even_count == (index + 1) - even_count and money >= abs(elements[index] - elements[index + 1])):\r\n max_cuts = max(max_cuts, 1 + makeSplits(index + 1, even_count, money - abs(elements[index] - elements[index + 1])))\r\n mem[(index, money)] = max_cuts\r\n return max_cuts\r\n\r\nprint(makeSplits(0, 0, money))\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "n,b=map(int,input().split())\r\nll=list(map(int,input().split()))\r\no,e=0,0\r\nkk=[]\r\nfor i in range(n):\r\n if ll[i]&1:\r\n o+=1\r\n else:\r\n e+=1\r\n if e==o:\r\n kk.append(i)\r\nk=len(kk)\r\nif k==1:\r\n print(0)\r\nelse:\r\n tt=[]\r\n for i in range(k-1):\r\n tt.append(abs(ll[kk[i]]-ll[kk[i]+1]))\r\n tt.sort()\r\n m=len(tt)\r\n c=0\r\n i=0\r\n while i<m and b>0:\r\n b-=tt[i]\r\n i+=1\r\n c+=1\r\n if c>0 and b<0:\r\n print(c-1)\r\n else:\r\n print(c)\r\n", "n,b=map(int,input().split())\r\nli=list(map(int,input().split()))\r\n\r\no=0\r\ne=0\r\nli1=[]\r\nfor i in range(n):\r\n if(li[i]%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\n if(o==e and o!=0):\r\n if(i!=n-1):\r\n li1.append(abs(li[i]-li[i+1]))\r\nli1.sort()\r\ns=0\r\nans=0\r\nfor x in li1:\r\n if(s+x<=b):\r\n s+=x\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)\r\n \r\n \r\n \r\n", "n,b=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=[]\r\nif arr[0]%2==0:\r\n count=-1\r\nelse:\r\n count=1\r\nfor i in range(1,n-1):\r\n if count==0:\r\n ans.append(abs(arr[i]-arr[i-1]))\r\n if arr[i]%2==0:\r\n count+=-1\r\n else:\r\n count+=1\r\nans.sort() \r\nc=0\r\nk=0\r\nwhile k<len(ans) and c+ans[k]<=b:\r\n c+=ans[k]\r\n k+=1\r\nprint(k)\r\n", "import math\ndef main():\n\tn,b=map(int,input().split())\n\tarr=[int(x) for x in input().split()]\n\tcosts=[]\n\tcount=0\n\to=e=0\n\tfor i in range(len(arr)):\n\t\tif o==e and (o!=0 and e!=0):\n\t\t\tcost=abs(arr[i]-arr[i-1])\n\t\t\tcosts.append(cost)\n\t\tif arr[i]%2==1:\n\t\t\to+=1\n\t\telse:\n\t\t\te+=1\n\tcosts.sort()\n\tfor i in costs:\n\t\tif b-i>=0:\n\t\t\tb-=i\n\t\t\tcount+=1\n\t\telse:\n\t\t\tbreak\n\tprint(count)\nmain()\n", "def int_list(arr):\r\n for i in range(len(arr)):\r\n arr[i] = int(arr[i])\r\n return arr\r\n\r\n\r\ndef same_parity(arr):\r\n net = 0\r\n for el in arr:\r\n if el % 2 == 0:\r\n net += 1\r\n else:\r\n net -= 1\r\n return net == 0\r\n\r\n\r\ndef cost(ind):\r\n global a\r\n return abs(a[ind - 1] - a[ind])\r\n\r\n\r\ndef cuts_are_valid(cut_arr):\r\n global a\r\n if not same_parity(a[:cut_arr[0]]):\r\n return False\r\n for i in range(len(cut_arr) - 1):\r\n if not same_parity(a[cut_arr[i]:cut_arr[i + 1]]):\r\n return False\r\n if not same_parity(a[cut_arr[-1]:]):\r\n return False\r\n return True\r\n\r\n\r\nn, b = int_list(input().split(\" \"))\r\nused = [False for i in range(n)]\r\na = int_list(input().split(\" \"))\r\nbitcoin_counter = 0\r\nmin_additional_index = 0\r\nbest_cuts = []\r\nfor i in range(50):\r\n min_additional_score = 9999\r\n for ind in range(2, n, 2):\r\n if ind not in best_cuts:\r\n tmp = best_cuts.copy()\r\n tmp.append(ind)\r\n if cuts_are_valid(tmp):\r\n score = cost(ind)\r\n if score < min_additional_score:\r\n min_additional_score = score\r\n min_additional_index = ind\r\n if bitcoin_counter + min_additional_score <= b:\r\n bitcoin_counter += min_additional_score\r\n best_cuts.append(min_additional_index)\r\nprint(len(best_cuts))\r\n", "from math import *\r\nimport sys\r\n\r\n\r\n\r\ndef main():\r\n\r\n\tn, money = [int(x) for x in input().split(' ')]\r\n\ta = [int(x) for x in input().split(' ')]\r\n\r\n\tp = 0\r\n\tparity = [0 for i in range(n+1)]\r\n\r\n\tfor i in range(n-1, -1, -1):\r\n\t\tp += (-1 if a[i]%2==0 else 1)\r\n\r\n\t\tparity[i] = p\r\n\r\n\r\n\tp = 0\r\n\tsticks = []\r\n\r\n\tfor i in range(n-1):\r\n\t\tp += (-1 if a[i]%2==0 else 1)\r\n\r\n\t\tif p == 0 and parity[i+1]==0:\r\n\t\t\tsticks.append(abs(a[i+1] - a[i]))\r\n\r\n\r\n\tsticks = sorted(sticks)\r\n\r\n\tcnt = 0\r\n\r\n\tfor s in sticks:\r\n\t\tif s > money:\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tcnt += 1\r\n\t\t\tmoney -= s\r\n\r\n\tprint(cnt)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n,c = list(map(int,input().strip().split()))\r\na = list(map(int,input().strip().split()))\r\nodd = even = 0\r\ncuts = []\r\nfor i in range(0,n):\r\n if (i!=0 and odd == even):\r\n cuts.append(abs(a[i]-a[i-1]))\r\n if (a[i]%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\nans = 0\r\ncuts.sort()\r\nfor i in cuts:\r\n if i <= c:\r\n ans += 1\r\n c-=i\r\nprint(ans)", "# https://codeforces.com/problemset/problem/998/B\r\n\r\nfrom collections import defaultdict\r\n\r\ndef get_max_cuts(n, B, array):\r\n\r\n count_array = [None for __ in range(n)]\r\n coins_set = set()\r\n coins_dict = defaultdict(list)\r\n\r\n for j in range(0, n):\r\n\r\n if j == 0:\r\n if array[0] % 2 == 0:\r\n count_array[j] = (n // 2, (n // 2) - 1)\r\n\r\n else:\r\n count_array[j] = ((n // 2) - 1, n // 2)\r\n\r\n else:\r\n\r\n prev_odd, prev_even = count_array[j - 1]\r\n\r\n if array[j] % 2 == 0:\r\n count_array[j] = prev_odd, prev_even - 1\r\n\r\n else:\r\n count_array[j] = prev_odd - 1, prev_even\r\n\r\n if j != n - 1:\r\n\r\n coins = abs(array[j] - array[j + 1])\r\n coins_set.add(coins)\r\n coins_dict[coins].append(j)\r\n\r\n\r\n max_cuts = 0\r\n coins_spent = 0\r\n coins_list = sorted(list(coins_set))\r\n\r\n for coins in coins_list:\r\n for idx in coins_dict[coins]:\r\n\r\n if coins_spent + coins > B:\r\n return max_cuts\r\n\r\n count_odd, count_even = count_array[idx]\r\n if count_even == count_odd:\r\n\r\n max_cuts += 1\r\n coins_spent += coins\r\n\r\n return max_cuts\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n n, B = list(map(int, input().split()))\r\n array = list(map(int, input().split()))\r\n print(get_max_cuts(n, B, array))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=[]\r\nl3=[]\r\nl4=[]\r\nc=0\r\nco=0\r\nfor i in l:\r\n \r\n if i%2==0:\r\n l2.append(i)\r\n else:\r\n l3.append(i)\r\n if co<len(l)-1:\r\n if len(l3)==len(l2) and (len(l2)+len(l3))%2==0 and abs(i-l[co+1])<=k:\r\n \r\n l4.append(abs(i-l[co+1]))\r\n l3=[]\r\n l2=[]\r\n else:\r\n break\r\n \r\n \r\n co+=1\r\nfor i in sorted(l4):\r\n if i<=k:\r\n c+=1\r\n k-=i\r\nprint(c)\r\n \r\n ", "def cut(arr,n,cost):\r\n odd=[0]*n\r\n even=[0]*n\r\n\r\n if(arr[0]%2==0):\r\n even[0]=1\r\n else:\r\n odd[0]=1\r\n\r\n for i in range(1,n):\r\n if(arr[i]%2==0):\r\n even[i]=1+even[i-1]\r\n else:\r\n even[i]=even[i-1]\r\n if(arr[i]%2!=0):\r\n odd[i]=1+odd[i-1]\r\n else:\r\n odd[i]=odd[i-1]\r\n \r\n ans=[]\r\n # print(*even)\r\n # print(*odd)\r\n for i in range(n-1):\r\n if(even[i]==odd[i]):\r\n ans.append(abs(arr[i]-arr[i+1]))\r\n ans.sort()\r\n\r\n f_cost=0\r\n j=0\r\n c=0\r\n while(j<len(ans)):\r\n f_cost+=ans[j]\r\n if(f_cost<=cost):\r\n c+=1\r\n else:\r\n break\r\n j+=1\r\n return c\r\n\r\n\r\nn,cost=map(int,input().split())\r\n\r\narr=list(map(int,input().split()))\r\n\r\nprint(cut(arr,n,cost))", "n, B = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nres = []\r\nif a[0] % 2 == 0:\r\n bal = 1\r\nelse:\r\n bal = -1\r\nfor i in range(1, n):\r\n if bal == 0:\r\n res.append(abs(a[i] - a[i - 1]))\r\n if a[i] % 2 == 0:\r\n bal += 1\r\n else:\r\n bal -= 1\r\n\r\nres.sort()\r\ncnt = 0\r\nans = 0\r\n\r\nwhile(cnt <= B):\r\n if ans == len(res):\r\n ans += 1\r\n break\r\n cnt += res[ans]\r\n ans += 1\r\n\r\nprint(ans - 1)\r\n", "n,b=map(int,input().split())\r\nx,a,e,o,r=[*map(int,input().split())],[],0,0,0\r\nfor i in range(n-1):\r\n if x[i]%2==0: e+=1\r\n else: o+=1\r\n if e==o: a.append(abs(x[i+1]-x[i]))\r\na.sort()\r\nwhile a:\r\n if a[0]<=b:\r\n b-=a.pop(0)\r\n r+=1\r\n else: break\r\nprint(r)", "n,b=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nseg=[]\r\nodd,ev,i=0,0,0\r\nwhile(i<n):\r\n if(a[i]%2==0):\r\n ev+=1\r\n else:\r\n odd+=1\r\n if ev==odd and i!=n-1:\r\n seg.append(abs(a[i]-a[i+1]))\r\n i+=1\r\nseg.sort()\r\nans=0\r\nfor i in seg:\r\n if i<=b:\r\n b-=i\r\n ans+=1\r\nprint(ans)\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n", "from __future__ import print_function\r\nimport pprint\r\nimport sys\r\nimport math\r\nimport os.path\r\nimport random\r\nfrom copy import deepcopy\r\nfrom functools import reduce\r\n\r\n\r\nfrom collections import Counter, ChainMap, defaultdict\r\nfrom itertools import cycle, chain\r\nfrom queue import Queue, PriorityQueue\r\nfrom heapq import heappush, heappop, heappushpop, heapify, heapreplace, nlargest, nsmallest\r\nimport bisect\r\n\r\nfrom statistics import mean, mode, median, median_low, median_high\r\n\r\n\r\n# CONFIG\r\nsys.setrecursionlimit(10**9)\r\n\r\n# LOG \r\ndef log(*args, **kwargs):\r\n print(*args, file=sys.stderr, **kwargs)\r\n\r\n\r\n# INPUT\r\ndef ni():\r\n return map(int, input().split())\r\n\r\n\r\ndef nio(offset):\r\n return map(lambda x: int(x) + offset, input().split())\r\n\r\n\r\ndef nia():\r\n return list(map(int, input().split()))\r\n\r\n\r\n# CONVERT\r\ndef toString(aList, sep=\" \"):\r\n return sep.join(str(x) for x in aList)\r\n\r\n\r\ndef toMapInvertIndex(aList):\r\n return {k: v for v, k in enumerate(aList)}\r\n\r\n\r\n# SORT\r\ndef sortId(arr):\r\n return sorted(range(arr), key=lambda k: arr[k])\r\n\r\n\r\n# MAIN\r\n\r\nn, B = ni()\r\na = nia()\r\na.insert(0,0)\r\n\r\nMAX = 111\r\n\r\n\r\ncountC = [0]*MAX\r\ncountL = [0]*MAX\r\n\r\nfor i in range(1,n+1):\r\n if (a[i] % 2 == 0):\r\n countC[i] = 1\r\n else:\r\n countL[i] = 1\r\n if (i > 0):\r\n countC[i] += countC[i-1]\r\n countL[i] += countL[i-1]\r\n\r\n# log(a)\r\n# log(countC)\r\n# log(countL)\r\n\r\n\r\n\r\nl = [[0]*MAX for _ in range(MAX)]\r\n\r\nfor i in range(2,n+1,2):\r\n for j in range(B+1):\r\n for ii in range(2,i,2):\r\n c1,l1 = countC[ii], countL[ii]\r\n c2 = countC[i] - countC[ii]\r\n l2 = countL[i] - countL[ii]\r\n cost = abs(a[ii+1] - a[ii])\r\n # log(i,ii,j,c1,l1,c2,l2,cost)\r\n if c1 == l1 and c2 == l2 and j >= cost:\r\n # can cut at ii\r\n l[i][j] = max (l[i][j], l[ii][j-cost]+1)\r\n # log(\"cut\",i,j,\":\",ii,\"->\", a[ii],a[ii+1],\"->\", l[i][j], l[ii][j-cost]+1)\r\n\r\n\r\n# log(l)\r\nprint(l[n][B])\r\n# pprint.pprint(l)", "import sys\r\ninput=sys.stdin.readline\r\ndef main():\r\n n,b=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n score=[]\r\n cnt=0\r\n for i in range(n-1):\r\n if l[i]&1 :\r\n cnt+=1\r\n else :\r\n cnt-=1\r\n if cnt==0 :\r\n score.append(abs(l[i]-l[i+1]))\r\n m=len(score)\r\n DP=[[-1]*(b+1) for _ in range(m)]\r\n def solve(i,s):\r\n if i>=m : return 0\r\n if DP[i][s]>=0 : return DP[i][s]\r\n k=solve(i+1,s)\r\n if s-score[i]>=0:\r\n k=max(k,1+solve(i+1,s-score[i]))\r\n DP[i][s]=k\r\n return k\r\n print(solve(0,b))\r\nmain()", "n, B = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = []\r\n\r\ntry:\r\n i = 0\r\n while True:\r\n even = 0\r\n odd = 0\r\n while even != odd or even == 0:\r\n if a[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n i += 1\r\n ans.append(abs(a[i-1]-a[i]))\r\n\r\n\r\nexcept IndexError:\r\n ans.sort()\r\n ct = 0\r\n while len(ans) > 0:\r\n if B-ans[0] >= 0:\r\n ct += 1\r\n B -= ans.pop(0)\r\n else:\r\n break\r\n\r\n print(ct)", "list_n = []\r\nn, bitcoin = map(int, input().split())\r\na = list(map(int, input().split()))\r\nanswer = 0\r\nodd = 0\r\neven = 0\r\nfor i in range(n):\r\n if i != 0 and even == odd:\r\n list_n.append(abs(a[i] - a[i - 1]))\r\n if a[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n\r\nlist_n.sort()\r\n\r\nfor i in range(len(list_n)):\r\n if list_n[i] <= bitcoin:\r\n answer += 1\r\n bitcoin -= list_n[i]\r\n else:\r\n break\r\nprint(answer)\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 even=odd=ans=0\r\n cost=[]\r\n for i in range(n):\r\n if a[i]&1:odd+=1\r\n else:even+=1\r\n if even==odd:\r\n if i+1<n:cost+=[abs(a[i]-a[i+1])]\r\n cost.sort()\r\n for v in cost:\r\n if k-v<0:break\r\n k-=v\r\n ans+=1\r\n print(ans)", "n, B = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\nposs_Splits = []\r\nps = 0\r\nptlan = 0\r\nfor i in range(n - 1):\r\n if arr[i] % 2 == 0:\r\n ps += 1\r\n else:\r\n ptlan += 1\r\n if ps == ptlan:\r\n poss_Splits.append((abs(arr[i] - arr[i + 1]), i))\r\n\r\nposs_Splits = sorted(poss_Splits)\r\ni = 0\r\nwhile i < len(poss_Splits) and B >= poss_Splits[i][0]:\r\n B -= poss_Splits[i][0]\r\n i += 1\r\n\r\nprint(i)", "s,k=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\no,e=0,0\r\nsum=0\r\ncount=0\r\nans=[]\r\nfor i in range(len(x)-1):\r\n if x[i]%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\n yo=abs(x[i]-x[i+1])\r\n if e==o and yo<=k:\r\n ans.append(yo)\r\nans.sort()\r\nfor j in range(len(ans)):\r\n ans[j]+=sum\r\n sum=ans[j]\r\n if ans[j]<=k:\r\n count+=1\r\n else:\r\n break\r\nprint(count)", "n, c = map(int, input().split())\nseq = [int(x) for x in input().split()]\n\ncnt = 0\ncuts = []\nfor a, b in zip(seq[:-1], seq[1:]):\n if a % 2:\n cnt -= 1\n else:\n cnt += 1\n if cnt == 0:\n cuts.append(abs(a-b))\n\ncuts.sort(reverse=True)\n\nans = 0\nwhile cuts and c-cuts[-1] >= 0:\n c -= cuts.pop()\n ans += 1\n\nprint(ans)\n", "from itertools import*\nR=lambda:map(int,input().split())\nn,b=R()\na=[*R()]\nc=[0,0]\nr=[]\nfor x,y in zip(a,a[1:]):\n c[x%2]+=1\n if c[0]==c[1]:r+=[abs(x-y)]\nr.sort()\nprint(next((i for i,x in enumerate(accumulate(r))if x>b),len(r)))\n\n\t\t\t\t \t\t\t\t \t\t\t \t \t \t\t \t\t\t\t", "import math\r\nimport string\r\n\r\n\r\ndef main_function():\r\n n, B = [int(i) for i in input().split(\" \")]\r\n a = [int(i) for i in input().split(\" \")]\r\n interfaces = []\r\n counter_odd = 0\r\n counter_even = 0\r\n for i in range(n):\r\n\r\n if a[i] % 2 == 0:\r\n counter_even += 1\r\n else:\r\n counter_odd += 1\r\n if counter_even == counter_odd and counter_odd != 0 and i != n - 1:\r\n interfaces.append(abs(a[i + 1] - a[i]))\r\n counter_odd = 0\r\n counter_even = 0\r\n interfaces.sort()\r\n counter = 0\r\n for i in interfaces:\r\n if B >= i:\r\n counter += 1\r\n B -= i\r\n print(counter)\r\n\r\n\r\n\r\nmain_function()", "n, b = map(int, input().split())\na_list = list(map(int, input().split()))\ncost = []\ncounter = [0,0]\nfor i in range(n-1):\n counter[a_list[i] % 2] += 1\n if (counter[0] == counter[1]):\n cost.append(abs(a_list[i] - a_list[i+1]))\ncost.sort()\ni = 0\nresult = 0\nwhile((i < len(cost)) and (b >= cost[i])):\n result += 1\n b -= cost[i]\n i += 1\nprint(result)", "n,b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nodd1 = 0\r\neven1 = 0\r\na = []\r\nfor i in range(n-2):\r\n if l[i] %2 != 0:\r\n odd1 += 1\r\n else:\r\n even1+=1\r\n if odd1 == even1:\r\n j = i+1\r\n odd2 = 0\r\n even2 = 0\r\n while j<n:\r\n if l[j] %2 != 0:\r\n odd2 += 1\r\n else:\r\n even2 += 1\r\n j+=1\r\n if odd2 == even2:\r\n a.append(abs(l[i] - l[i+1]))\r\nif a == []:\r\n print(0)\r\nelse:\r\n a.sort()\r\n s = 0\r\n c = 0\r\n for i in a:\r\n s+=i\r\n if s<=b:\r\n c+=1\r\n print(c)", "n, B = map(int, input().split())\r\na = list(map(int, input().split()))\r\neven = [0] * n\r\nodd = [0] * n\r\nif a[0] % 2 == 0:\r\n even[0] = 1\r\nelse:\r\n odd[0] = 1\r\nfor i in range(1, n):\r\n if a[i] % 2 == 0:\r\n even[i] = even[i - 1] + 1\r\n odd[i] = odd[i - 1]\r\n else:\r\n even[i] = even[i - 1]\r\n odd[i] = odd[i - 1] + 1\r\n\r\nrec = [0] * n\r\nfor i in range(n):\r\n rec[i] = even[i] - odd[i]\r\n\r\ncost =[]\r\nfor i in range(n):\r\n if rec[i] == 0 and i != n - 1:\r\n cost.append(abs(a[i + 1] - a[i]))\r\ncost = sorted(cost)\r\nnum = 0\r\nj = 0\r\nwhile B > 0 and j < len(cost):\r\n B -= cost[j]\r\n if B >= 0:\r\n num += 1\r\n j += 1\r\nprint(num)\r\n\r\n\r\n", "\"\"\"\r\n Bismillahir Rahmanir Rahim\r\n A |-| |\\| A F\r\n\"\"\"\r\n\r\nn, B = map(int, input().split())\r\nar = list(map(int, input().split()))\r\npair = {f\"{i-1}-{i}\" : abs(ar[i-1]-ar[i]) for i in range(1,n)}\r\nans = []\r\nfor i in range(1,n):\r\n odd = [ar[x] for x in range(0,i+1) if ar[x]%2==1]\r\n odd_number, even_number = len(odd), i+1-len(odd)\r\n if odd_number == even_number:\r\n if f\"{i}-{i+1}\" in pair:\r\n ans.append(pair[f\"{i}-{i+1}\"])\r\n\r\nans.sort(); cnt = 0\r\nfor i in ans:\r\n if B - i >= 0:\r\n cnt += 1; B -= i\r\n else: break\r\nprint(cnt)\r\n", "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = list()\r\ncuts = 0; even = 0; odd = 0\r\n\r\nfor i in range(n-1):\r\n if a[i] % 2 == 0: even += 1\r\n else: odd += 1\r\n if even == odd: l.append(abs(a[i] - a[i+1]))\r\nl.sort()\r\nfor j in range(len(l)):\r\n if l[j] <= b: b -= l[j]; cuts += 1\r\n else: break\r\nprint(cuts)", "import itertools\r\nimport bisect\r\n\r\n\r\nn, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nr = []\r\nn_odds = n_evens = 0\r\n\r\nfor i in range(n - 1):\r\n if a[i] % 2 == 0:\r\n n_evens += 1\r\n else:\r\n n_odds += 1\r\n if n_odds == n_evens:\r\n r.append(abs(a[i + 1] - a[i]))\r\n\r\nr = list(itertools.accumulate(sorted(r)))\r\np = bisect.bisect_left(r, b)\r\nprint(p + (p < len(r) and r[p] == b))\r\n\r\n\r\n", "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())\nn,b=M()\nl=L()\nl.append(1000)\nev=0\nod=0\nc=0\ng=[]\nfor i in range(n):\n if(l[i]%2==0):\n ev+=1\n if(l[i]%2==1):\n od+=1\n if(ev==od):\n g.append(abs(l[i]-l[i+1]))\n c+=1\n ev=0\n od=0\ng.sort()\nans=0\nkey=0\nfor i in range(len(g)):\n if(ans+g[i]<=b):\n ans+=g[i]\n key=i+1\n else:\n break\nprint(key)\n", "n,b = map(int,input().split())\r\na = list(map(int,input().split()))\r\nif(a[0]%2==0):\r\n odd1=0\r\n even1=1\r\nelse:\r\n odd1=1\r\n even1 = 0\r\nodd2=0\r\neven2=0\r\nfor val in range(1,len(a)):\r\n if(a[val]%2==0):\r\n even2+=1\r\n else:\r\n odd2+=1\r\nl1=[]\r\nif(even2==odd2 and even1==odd1):\r\n if(abs(a[1]-a[0])<=b):\r\n l1.append(abs(a[1]-a[0]))\r\nfor val in range(1,len(a)-1):\r\n if(a[val]%2==0):\r\n even1+=1\r\n even2-=1\r\n else:\r\n odd1+=1\r\n odd2-=1\r\n if(even1==odd1 and even2==odd2):\r\n if(abs(a[val+1]-a[val])<=b):\r\n l1.append(abs(a[val+1]-a[val]))\r\nl1.sort()\r\nsp=0\r\nmoney=0\r\nif(len(l1)>0):\r\n \r\n for val in range(0,len(l1)):\r\n money+=l1[val]\r\n if(money>b):\r\n break\r\n else:\r\n sp+=1\r\nprint(sp)", "import math\r\nn,b=input().split()\r\narr=[int(j) for j in input().split()]\r\n\r\nodd=len(arr)/2\r\neven=len(arr)/2\r\nrOdd=0\r\nrEven=0\r\nmoney=[]\r\ncount=0\r\nfor i in range(len(arr)):\r\n # if money<=0:\r\n # break\r\n if i!=0 and rOdd==rEven:\r\n money.append(math.fabs((arr[i]-arr[i-1])))\r\n# if money>0:\r\n# money.append(math.fabs((arr[i] - arr[i - 1])))\r\n# money.pop()\r\n\r\n if arr[i]%2==0:\r\n rEven=rEven+1\r\n else:\r\n rOdd=rOdd+1\r\n\r\nmoney.sort()\r\na=int(b)\r\nfor i in range(len(money)):\r\n if a<=0:\r\n break\r\n a=a-money[i]\r\n if a>=0:\r\n count=count+1\r\n\r\n\r\nprint(count)\r\n", "n, b = map(int, input().split())\nx = list(map(int, input().split()))\no = [x[0]%2]*n\ne = [1-x[0]%2]*n\n\nfor i in range(1, n):\n\to[i] = o[i-1] + x[i]%2\n\te[i] = e[i-1] + 1 - (x[i]%2)\n\nposs = []\nfor i in range(1, n-1):\n\tif o[i] == e[i]:\n\t\t# print(x[i], '|', x[i+1])\n\t\tposs += [abs(x[i+1]-x[i])]\n\n# print(poss)\nans = 0\nposs.sort()\ncurcost = 0\nfor i in range(len(poss)):\n\tcurcost += poss[i]\n\tif curcost > b:\n\t\tbreak\n\tans += 1\n\nprint(ans)", "n,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nl1=[]\r\nif(n==2):\r\n print(0)\r\nelse:\r\n for i in range(n-1):\r\n if(l[i]%2==0):\r\n c+=1\r\n else:\r\n c-=1\r\n if(c==0):\r\n l1.append(abs(l[i]-l[i+1]))\r\n l1.sort()\r\n n1=len(l1)\r\n if(n1==0):\r\n print(0)\r\n else:\r\n i=0\r\n while(b>=0 and i<n1):\r\n if(b-l1[i]>=0):\r\n b-=l1[i]\r\n i+=1\r\n else:\r\n break\r\n print(i)", "# HEY STALKER\r\nn, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nans = []\r\nodd = 0\r\neven = 0\r\nfor t in range(n):\r\n if l[t] % 2:\r\n odd += 1\r\n else:\r\n even += 1\r\n if odd == even and t + 1 < n:\r\n ans.append(abs(l[t+1] - l[t]))\r\nans.sort()\r\ni = 0\r\nv = 0\r\nfor t in ans:\r\n v += t\r\n if v <= k:\r\n i += 1\r\n else:\r\n break\r\nprint(i)", "n, b = map(int, input().split())\na = [int(i) for i in input().split()]\ndp = [[0 for _ in range(b + 1)] for _ in range(n)]\n\nfor j in range(1, b + 1):\n for i in range(n - 2, -1, -1):\n val = 0\n count = 0\n for k in range(i, n - 1):\n if a[k] % 2 == 0:\n count += 1\n else:\n count -= 1\n if k > i and count == 0:\n x = abs(a[k + 1] - a[k])\n if j - x >= 0:\n val = max(val, 1 + dp[k + 1][j - x])\n dp[i][j] = val\n\nprint(dp[0][b])\n", "n,b=[int(i) for i in input().split()]\r\ns=[int(i) for i in input().split()]\r\neven=[]\r\nodd=[]\r\nc=[]\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n even.append(s[i])\r\n else:\r\n odd.append(s[i])\r\n if len(even)==len(odd):\r\n #print(even,odd)\r\n if i < n-1:\r\n c.append(abs(s[i]-s[i+1]))\r\n\r\nc.sort()\r\np=0\r\nfor i in c:\r\n b=b-i\r\n if b < 0:\r\n break\r\n else:\r\n p+=1\r\nprint(p)\r\n \r\n", "#nums = list(map(int, input().split()))\r\n\r\nn_t,bitcoin = map(int,input().split())\r\nnums = list(map(int, input().split()))\r\n\r\n\r\nbalance = []\r\npossible = []\r\n\r\nfor i in range(len(nums)):\r\n if nums[i] % 2 == 0:\r\n if i == 0:\r\n balance.append([1,0])\r\n else:\r\n even,odd = balance[i-1]\r\n balance.append([even+1,odd])\r\n if even+1 == odd:\r\n if i+1 < len(nums):\r\n possible.append(abs(nums[i]-nums[i+1]))\r\n \r\n else:\r\n if i == 0:\r\n balance.append([0,1])\r\n else:\r\n even,odd = balance[i-1]\r\n balance.append([even,odd+1])\r\n if even == odd+1:\r\n if i+1 < len(nums):\r\n possible.append(abs(nums[i]-nums[i+1]))\r\n \r\n\r\nif possible:\r\n count = 0\r\n possible.sort()\r\n for i in range(len(possible)):\r\n if possible[i] <= bitcoin:\r\n count += 1\r\n bitcoin -= possible[i]\r\n else:\r\n break\r\n print(count)\r\nelse:\r\n print(0)\r\n \r\n \r\n\r\n", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nj=0\r\nans=[]\r\nflag=0\r\nwhile(j<n):\r\n ev=0\r\n odd=0 \r\n if a[j]%2==0:\r\n ev+=1\r\n else:\r\n odd+=1\r\n j+=1 \r\n while(odd != ev and j<n):\r\n if a[j]%2==0:\r\n ev+=1 \r\n else:\r\n odd+=1\r\n j+=1\r\n if j!=n: \r\n ans.append(abs(a[j]-a[j-1]))\r\nans.sort()\r\ns=0\r\nk=0\r\nfor i in range(len(ans)):\r\n s+=ans[i]\r\n if s<=b:\r\n k+=1 \r\nprint(k)\r\n", "buf=input()\r\nm=buf.split()\r\nn=int(m[0])\r\nB=int(m[1])\r\na=[]\r\nN=[]\r\nC=[]\r\narr=input()\r\na=arr.split(' ')\r\n\r\nfor i in range(0,n):\r\n a[i]=int(a[i])\r\nif a[0]%2==0:\r\n N.append(0)\r\n C.append(1)\r\nelse:\r\n N.append(1)\r\n C.append(0)\r\nfor i in range(1,n):\r\n if a[i]%2==0:\r\n N.append(N[i-1])\r\n C.append(C[i-1]+1)\r\n else:\r\n N.append(N[i-1]+1)\r\n C.append(C[i-1])\r\nk=0\r\ns=0\r\nc=[]\r\nfor i in range(1,n-1,2):\r\n if C[i]==N[i]:\r\n c.append(abs(a[i+1]-a[i]))\r\nc.sort()\r\nfor i in c:\r\n if(s+i<=B):\r\n k=k+1\r\n s+=i\r\nprint(k)\r\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Cutting\"\r\n# Class: B\r\n\r\nimport sys, threading\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, b = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n arr = []\r\n o, e = 0, 0\r\n for i in range(n-1):\r\n if a[i]%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\n if e==o:\r\n arr.append(abs(a[i]-a[i+1]))\r\n \r\n c=0\r\n for i in sorted(arr):\r\n if b-i >= 0:\r\n b-=i\r\n c+=1\r\n else:\r\n break\r\n print(c)\r\n\r\nif __name__ == \"__main__\":\r\n threading.stack_size(10**5)\r\n threading.Thread(target=Solve).start()", "n,b = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nlis = []\r\nodd = 0\r\neven = 0\r\nfor i in range(n):\r\n if odd == even and odd!= 0:\r\n lis.append(abs(arr[i]- arr[i-1]))\r\n odd = 0\r\n even = 0\r\n if arr[i]%2 == 0:\r\n even += 1\r\n else:\r\n odd += 1 \r\nlis.sort()\r\nlimit = 0\r\n# i = 0\r\ncount = 0\r\nif lis:\r\n for i in range(len(lis)):\r\n limit += lis[i]\r\n if limit <= b:\r\n count += 1\r\n else:\r\n break \r\n\r\n # while(limit <= b and i <len(lis)):\r\n # limit += lis[i]\r\n # i+= 1\r\n# print(*lis)\r\nprint(count) \r\n\r\n\r\n\r\n", "n, B = map(int, input().split())\r\n\r\ns = list(map(int, input().split()))\r\n\r\ndp1 = [0 for _ in range(n)]\r\ndp2 = [0 for _ in range(n)]\r\n\r\nfor i in range(n):\r\n if s[i]%2==0:\r\n dp1[i] = dp1[i-1] + 1\r\n dp2[i] = dp2[i-1]\r\n else:\r\n dp2[i] = dp2[i-1] + 1\r\n dp1[i] = dp1[i-1]\r\n\r\nr = []\r\nfor i in range(n-1):\r\n if dp1[i] == dp2[i]: # тут можно произвести распил\r\n r.append(abs(s[i+1]-s[i]))\r\n\r\nr.sort()\r\n\r\ni = 0\r\nS = 0\r\nwhile len(r) > 0 and i < len(r):\r\n if r[i] + S <= B:\r\n S += r[i]\r\n i += 1\r\n else:\r\n break\r\n\r\n\r\nprint(i)", "def scanf(t=int):\r\n return list(map(t, input().split()))\r\nn, b = scanf()\r\nm = scanf()\r\nct, nct = 0, 0\r\ntemp = []\r\nfor i in range(n - 1):\r\n if m[i] % 2: nct += 1\r\n else: ct += 1\r\n if ct == nct: temp.append(abs(m[i] - m[i + 1]))\r\nans, k = 0, 0\r\nfor x in sorted(temp):\r\n ans += x\r\n if ans > b: break\r\n k += 1\r\nprint(k)\r\n", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nt = 0\r\nb = []\r\nfor i in range(n - 1):\r\n if (a[i] % 2): t += 1\r\n else: t -= 1\r\n if t == 0: b.append(abs(a[i + 1] - a[i]))\r\nb.sort()\r\n\r\nans, pre = 0, 0\r\nfor i in range(len(b)):\r\n pre += b[i]\r\n if pre > m: break\r\n else: ans += 1\r\nprint(ans)", "from sys import stdin,stdout\r\nfrom collections import Counter\r\nfrom itertools import permutations\r\nimport bisect\r\nimport math\r\n\r\nI=lambda: map(int,stdin.readline().split())\r\nI1=lambda: stdin.readline()\r\n#(a/b)%m =((a%m)*pow(b,m-2)%m)%m\r\n\r\nn,b=I()\r\na=list(I())\r\ncut=0 \r\ncost=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n cut+=1 \r\n else:\r\n cut-=1 \r\n if cut==0 and i<n-1:\r\n cost.append(abs(a[i+1]-a[i]))\r\ncost.sort()\r\nc=0\r\nans=0\r\nfor x in cost:\r\n if c+x<=b:\r\n c+=x \r\n ans+=1 \r\n else:\r\n break\r\nprint(ans)\r\n\r\n\r\n", "n,b = map(int, input().split())\nl = list(map(int, input().split()))\ncheck = [0,0]\ncheck[l[0]%2] += 1\nrt = []\nfor x in range(1, len(l)-1):\n\tcheck[l[x]%2] += 1\n\n\tif check[0] == check[1]:\n\t\trt.append(abs(l[x] - l[x+1]))\n\nrtnum = 0\nrtcheck = 0\nfor x in sorted(rt):\n\tif rtcheck+x <= b:\n\t\trtcheck += x\n\t\trtnum+=1\n\nprint(rtnum)", "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\nbit = []\r\no, e = 0, 0\r\nif a[0] % 2 == 0:\r\n o += 1\r\nelse:\r\n e += 1\r\nfor result in range(1, n - 1):\r\n if a[result] % 2 == 0:\r\n o += 1\r\n else:\r\n e += 1\r\n if o == e:\r\n bit.append(abs(a[result + 1] - a[result]))\r\nbit.sort()\r\nresult = 0\r\nwhile result < len(bit) and bit[result] <= b:\r\n b -= bit[result]\r\n result += 1\r\nprint(result)\r\n", "n,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nod,ev,a=0,0,[]\r\nfor i in range(n-1):\r\n if l[i]%2==0:\r\n ev+=1 \r\n if l[i]%2!=0:\r\n od+=1 \r\n if ev==od:\r\n a.append(abs(l[i]-l[i+1])) \r\na.sort()\r\nans=0\r\nfor i in range(len(a)):\r\n ans+=a[i]\r\n if ans>s:\r\n print(i)\r\n break \r\nelse:\r\n print(len(a))", "n,k=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nodd=[0]*(n)\r\neven=[0]*(n)\r\nans=[]\r\ncount=0\r\nif a[0]%2==0:\r\n even[0]+=1\r\nelse:\r\n odd[0]+=1\r\nfor i in range(1,n-1):\r\n if a[i]%2==0:\r\n even[i]=even[i-1]+1\r\n odd[i]=odd[i-1]\r\n else:\r\n even[i]=even[i-1]\r\n odd[i]=odd[i-1]+1\r\n if odd[i]==even[i]:\r\n ans.append(abs(a[i+1]-a[i]))\r\nans=sorted(ans)\r\nfor i in range(len(ans)):\r\n if ans[i]<=k:\r\n k-=ans[i]\r\n count+=1\r\nprint(count)", "# Problem: B. Cutting\r\n# Contest: Codeforces - Codeforces Round #493 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/998/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\n\r\nfrom itertools import accumulate\r\nfrom bisect import bisect_left,bisect_right\r\nn,k=[int(_) for _ in input().split()]\r\nA=[int(_) for _ in input().split()]\r\nX=[]\r\nc=0\r\nfor _ in range(n):\r\n\tif A[_]%2==0:\r\n\t\tc+=1\r\n\telse:\r\n\t\tc-=1\r\n\tX.append(c)\r\nZ=[]\r\nfor _ in range(1,n-1):\r\n\tif X[_]==0:\r\n\t\tZ.append(abs(A[_]-A[_+1]))\r\nZ.sort()\r\nZ=list(accumulate(Z))\r\nprint(bisect_right(Z,k))", "num_input = input()\r\nnum_input = num_input.split(\" \")\r\nn = int(num_input[0])\r\nB = int(num_input[1])\r\n\r\narr = input()\r\narr = arr.split(\" \")\r\nfor i in range(0, len(arr)):\r\n arr[i] = int(arr[i])\r\n\r\neven = 0\r\nodd = 0\r\nres = []\r\n\r\nfor i in range(0, len(arr)):\r\n if arr[i] % 2 == 0:\r\n even+=1\r\n else:\r\n odd+=1\r\n \r\n if i < n - 1 and even == odd:\r\n res.append(abs(arr[i + 1] - arr[i]))\r\n\r\ncount = 0\r\nres.sort()\r\n\r\nindex = 0\r\n\r\nwhile index < len(res):\r\n \r\n if(B - res[index] >= 0):\r\n B = B - res[index]\r\n count+=1\r\n index+=1\r\n else:\r\n break\r\n\r\n\r\nprint(count) ", "n , b = [int(x) for x in input().split()]\nA = [int(x) for x in input().split()]\nD = [0,0]\nM =[]\nfor i in range(n-1):\n D[A[i]%2] += 1\n if D[0]==D[1]:\n M+=[abs(A[i+1]-A[i])]\nM.sort()\nj=0\nfor x in M:\n if b>=x:\n b-=x\n j+=1\n \nprint(j)\n\n \t \t\t \t\t \t\t\t \t \t \t \t\t", "# Meet\n\nn, b = input().split()\nn = int(n)\nb = int(b)\n\na = [int(x) for x in input().split()]\ncosts = []\n\nodd_count = 0\neven_count = 0\nsum_cost = 0\nfor i in range(n-1):\n\tif a[i]%2==0:\n\t\teven_count+=1\n\telse:\n\t\todd_count+=1\n\n\tif odd_count==even_count:\n\t\tcost = abs(a[i+1]-a[i])\n\t\tcosts+=[cost]\n\t\todd_count = 0\n\t\teven_count = 0\n\nnum_cuts = 0\ncosts.sort()\nfor i in costs:\n\tif sum_cost+i<=b:\n\t\tsum_cost+=i\n\t\tnum_cuts+=1\n\telse:\n\t\tbreak\n\nprint(num_cuts)", "import math\r\n\r\nn,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\ne=0\r\n \r\nr=[]\r\nfor i in range(n-1):\r\n if a[i]%2==1:\r\n e+=1\r\n else:\r\n e-=1\r\n \r\n if e==0:\r\n r.append(abs(a[i+1]-a[i]))\r\n\r\nr.sort()\r\ncount=0\r\nfor i in range(len(r)):\r\n if r[i]<=b:\r\n count+=1\r\n b-=r[i]\r\n else:\r\n break\r\n\r\nprint(count)", "n, B = map(int, input().split())\nitems = [int(k) for k in input().split() if k]\ndp = [-1000000000 for _ in range(B + 1)]\ndp[0] = 0\neven = 0\nodd = 0\ntotalEven = 0\ntotalOdd = 0\nfor i in range(n):\n if items[i] % 2 == 0:\n totalEven += 1\n else:\n totalOdd += 1\nfor i in range(n):\n if items[i] % 2 == 0:\n even += 1\n else:\n odd += 1\n if i + 1 < n and even == odd and totalEven - even == totalOdd - odd:\n cost = abs(items[i] - items[i + 1])\n dpCopy = dp[:]\n for j in range(cost, B + 1):\n dpCopy[j] = max(dp[j], dp[j - cost] + 1)\n dp = dpCopy\nprint(max(dp))\n", "\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nt=0\r\ncost=[]\r\nfor i in range(n-1):\r\n\tif l[i]%2==0:\r\n\t\tt=t+1\r\n\telse:\r\n\t\tt=t-1\r\n\tif t==0:\r\n\t\tcost.append(abs(l[i+1]-l[i]))\r\ni=0\r\ncost.sort()\r\n\r\nwhile i<len(cost) and k>=0:\r\n\tk=k-cost[i]\r\n\tif k>=0:\r\n\t\ti+=1\r\nprint(i)", "import heapq\r\n\r\nheader = input()\r\nheader = [int(i) for i in header.split()]\r\n\r\nbitcoins = header[1]\r\nn = header[0]\r\n\r\nnums = input()\r\nnums = [int(i) for i in nums.split()]\r\n\r\nnumOdds = 0\r\nnumEvens = 0\r\n\r\n'''\r\nif (nums[0] % 2 == 0):\r\n numEvens += 1\r\nelse:\r\n numOdds += 1\r\n'''\r\n\r\nheap = []\r\n\r\nfor i in range(len(nums)-1):\r\n if (nums[i] % 2 == 0):\r\n numEvens += 1\r\n else:\r\n numOdds += 1\r\n\r\n # lk\r\n if (numEvens == numOdds):\r\n cost = nums[i+1] - nums[i]\r\n if cost < 0:\r\n cost = cost * -1\r\n\r\n heapq.heappush(heap, (cost, i))\r\n\r\n#print(heap)\r\nremaining = bitcoins\r\ncuts = 0\r\n\r\nwhile remaining > 0:\r\n\r\n if len(heap) <= 0:\r\n break\r\n\r\n newCut = heapq.heappop(heap)\r\n\r\n if newCut[0] <= remaining:\r\n remaining -= newCut[0]\r\n cuts += 1\r\n else:\r\n remaining = 0\r\n\r\nprint(cuts)\r\n", "n,B = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\n\r\ncuts = []\r\neven = 0\r\nodd = 0\r\nfor i,x in enumerate(a):\r\n if x%2:\r\n odd+=1\r\n else:\r\n even +=1\r\n if odd == even and i != n-1:\r\n odd = 0\r\n even = 0\r\n cuts.append(abs(x-a[i+1]))\r\n\r\ncuts = sorted(cuts)\r\ntotal = 0\r\nwhile cuts and B-cuts[0]>=0:\r\n re = cuts.pop(0)\r\n B-=re\r\n total+=1\r\nprint (total)", "n,B=map(int ,input().split())\r\na=list(map(int ,input().split()))\r\nb=[]\r\np=0\r\nfor i in range(n-1):\r\n if(a[i]%2==0):\r\n p+=1\r\n else:\r\n p-=1\r\n if p==0 :\r\n b.append(abs(a[i]-a[i+1]))\r\nb.sort()\r\nans=0\r\nsum=0\r\nfor i in range(len(b)):\r\n if sum+b[i]<= B :\r\n ans+=1\r\n sum+=b[i]\r\nprint(ans)", "input=__import__('sys').stdin.readline\r\nn,b = map(int,input().split())\r\nlis = list(map(int,input().split()))\r\npre=[[0,0] for i in range(n)]\r\ncut=[]\r\n\r\nfor i in range(n-1):\r\n if lis[i]%2==0:\r\n pre[i][0]=pre[i-1][0]+1\r\n pre[i][1]=pre[i-1][1]\r\n else:\r\n pre[i][1]=pre[i-1][1]+1\r\n pre[i][0]=pre[i-1][0]\r\n if pre[i][0]==pre[i][1]:\r\n cut.append(abs(lis[i]-lis[i+1]))\r\nans=0\r\ncut.sort()\r\nfor i in range(len(cut)):\r\n if b>=cut[i]:\r\n b-=cut[i]\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "def cutting(n,b,a):\r\n i=0\r\n final = []\r\n odd = 0\r\n even = 0\r\n ans = 1\r\n lastind = 0\r\n\r\n if n%2 == 0:\r\n while i<n-1:\r\n if a[i]%2==0:\r\n even += 1\r\n else:\r\n odd += 1\r\n \r\n if odd == even: \r\n final.append(abs(a[i] - a[i+1])) \r\n lastind = i\r\n odd = 0\r\n even = 0\r\n i = i + 1 \r\n \r\n if abs(odd-even)!=1 or (odd<even and a[i]%2==0)or(odd>even and a[i]%2!=0):\r\n print(\"odd-even\")\r\n return 0 \r\n\r\n final.sort()\r\n c = 0\r\n i = 0\r\n while i < len(final) and b>0:\r\n if final[i] <= b:\r\n c = c + 1\r\n b = b - final[i] \r\n i = i + 1\r\n return c \r\n else:\r\n print(\"n odd\")\r\n return 0\r\n\r\nnb = list(map(int, input().rstrip().split()))\r\nn = nb[0]\r\nb = nb[1]\r\n\r\na = list(map(int, input().rstrip().split()))\r\n\r\nprint(cutting(n,b,a))\r\n\r\n\r\n", "n,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nls=[]\r\neven=0\r\nfor i in range(n):\r\n if i%2==0 and i>1:\r\n if even==i//2:\r\n ls+=[abs(arr[i]-arr[i-1])]\r\n if arr[i] % 2 == 0:\r\n even += 1\r\nls.sort()\r\ni=0\r\ncount=0\r\nwhile i<len(ls) and m>=ls[i]:\r\n m-=ls[i]\r\n count+=1\r\n i+=1\r\nprint(count)\r\n\r\n", "n, B = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nif l[0] % 2 == 0:\r\n c = -1\r\nelse:\r\n c = 1\r\nx = []\r\ny=0\r\nfor i in l[1:-1]:\r\n if i%2==0:\r\n c-=1\r\n else:\r\n c+=1\r\n if c==0:\r\n #(y)\r\n x.append(abs(l[y+2]-l[y+1]))\r\n y+=1\r\n#print(x)\r\nx.sort()\r\nans = 0\r\nfor i in x:\r\n if B>=i:\r\n B-=i\r\n #print(i, B)\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)", "\nn, bitcoins = map(int, input().split())\nelements = list(map(int, input().split()))\n\nans = 0\ncount = 0\nres = []\nfor i in range(n):\n if elements[i] % 2 == 1:\n ans += 1\n else:\n ans -= 1\n\n if ans == 0 and i != n-1:\n value = abs(elements[i] - elements[i+1])\n res.append(abs(value))\n\nres.sort()\nfor i in range(len(res)):\n if bitcoins - res[i] >= 0:\n bitcoins -= res[i]\n count += 1\nprint(count)\n\n \t \t\t\t \t\t \t \t \t \t\t", "l=[int(x) for x in input().split()]\r\nn=[int(x) for x in input().split()]\r\nod=0\r\nev=0\r\ncut=0\r\ns=0\r\nm=[]\r\nfor i in range(l[0]-1):\r\n if(n[i]%2==0):\r\n ev+=1 \r\n else:\r\n od+=1 \r\n if(ev==od):\r\n m.append(abs(n[i]-n[i+1]))\r\n cut+=1 \r\n s=s+abs(n[i]-n[i+1])\r\n \r\nif(l[1]>=s):\r\n print(cut)\r\nelse:\r\n m.sort()\r\n for h in range(len(n)):\r\n s=s-m[len(m)-1-h]\r\n cut-=1 \r\n if(l[1]>=s):\r\n break\r\n print(cut) \r\n \r\n \r\n", "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = []\r\n\r\nf = 0\r\nfor i in range(0, n - 1):\r\n f += ((a[i] % 2) * (-2) + 1)\r\n if f == 0:\r\n c.append(abs(a[i] - a[i + 1]))\r\n\r\nif c == []:\r\n print(0)\r\nelse:\r\n c.sort()\r\n x = 0\r\n i = 0\r\n k = 0\r\n while i < len(c):\r\n if x + c[i] > b:\r\n break\r\n else:\r\n x += c[i]\r\n i += 1\r\n k += 1\r\n print(k)\r\n", "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\nn,b=R()\r\n\r\na=L()\r\n\r\ndp=[0]*n\r\n\r\nodd=[0]*(n+1)\r\neven=[0]*(n+1)\r\n\r\nfor i in range(n):\r\n dp[i]=[0]*(b+1)\r\n\r\n if a[i]%2==0:\r\n even[i+1]=even[i]+1\r\n odd[i+1]=odd[i]\r\n else:\r\n even[i+1]=even[i]\r\n odd[i+1]=odd[i]+1\r\n\r\n\r\nfor i in range(n):\r\n for j in range(b+1):\r\n if odd[i+1]!=even[i+1]: \r\n continue\r\n\r\n for k in range(i):\r\n if odd[k+1]==even[k+1] and j-abs(a[k+1]-a[k])>=0:\r\n dp[i][j]=max(dp[i][j],dp[k][j-abs(a[k+1]-a[k])]+ 1)\r\n\r\n\r\n \r\n \r\nprint(dp[n-1][b])\r\n ", "list_bi=[]\r\n\r\ncounter_even=0\r\ncounter_odd=0\r\nx, y = map(int, input().split())\r\nlist=list(map(int, input().split()))\r\ni=0\r\nwhile i<x:\r\n if(i!=0 and counter_even==counter_odd):\r\n list_bi.append(abs(list[i]-list[i-1]))\r\n if list[i]%2==0:\r\n counter_even+=1\r\n else:\r\n counter_odd+=1\r\n\r\n i+=1\r\nlist_bi.sort()\r\nans =0\r\ni=0\r\nwhile i<len(list_bi):\r\n if y >=list_bi[i]:\r\n ans+=1\r\n y -= list_bi[i] \r\n else:\r\n break\r\n i+=1\r\n \r\n \r\nprint(ans)\r\n\r\n\r\n\r\n \r\n\r\n", "n, b = [int(s) for s in input().split(\" \")]\r\n\r\na = [int(s) for s in input().split(\" \")]\r\n\r\nbitcoins = []\r\n\r\ne = 0\r\no = 0\r\n\r\nfor i in range(n - 1):\r\n\r\n if a[i] % 2 == 0:\r\n e += 1\r\n else:\r\n o += 1\r\n\r\n if e == o:\r\n bitcoin = abs(a[i] - a[i + 1])\r\n if bitcoin <= b:\r\n bitcoins.append(bitcoin)\r\n\r\nbitcoins.sort()\r\n\r\nwhile True:\r\n s = sum(bitcoins)\r\n\r\n if s <= b:\r\n print(len(bitcoins))\r\n break\r\n else:\r\n del bitcoins[len(bitcoins) - 1]\r\n\r\n\r\n\r\n\r\n", "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncnt = [0, 0]\r\ncost = []\r\nfor i in range(n):\r\n cnt[a[i] % 2] += 1\r\n if i != n - 1 and cnt[0] == cnt[1]:\r\n cost.append(abs(a[i] - a[i + 1]))\r\n\r\ncost.sort()\r\nans = 0\r\nfor i in cost:\r\n if b - i < 0: break\r\n b -= i\r\n ans += 1\r\n\r\nprint(ans)", "n,b = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = [(abs(a[i]-a[i+1]),i)for i in range(n-1)]\r\nd = list(sorted(d))\r\nf = []\r\ns = 0\r\nfor i in a:\r\n if i%2:s+=1\r\n f.append(s)\r\n\r\ns = 0\r\nkk = 0\r\nfor i in d:\r\n if i[1]%2 and f[i[1]]==(i[1]+1)//2and s+i[0]<=b:\r\n kk+=1\r\n s+=i[0]\r\nprint(kk)\r\n", "n, b = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\n \r\ncan = []\r\n \r\ncount = [0, 0]\r\nfor i, x in enumerate(a[:-1]):\r\n\tcount[x & 1] += 1\r\n\tif count[0] == count[1]:\r\n\t\tcan.append(abs(x - a[i+1]))\r\n \r\nans = 0\r\nfor x in sorted(can):\r\n\tif x > b: break\r\n\tans += 1\r\n\tb -= x\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=0\r\nd=[]\r\neve=0\r\nodd=0\r\nfor i in range(n-1):\r\n if l[i]%2==0:\r\n eve+=1\r\n else:\r\n odd+=1\r\n if eve==odd:\r\n d.append(abs(l[i]-l[i+1]))\r\nd.sort()\r\nn=len(d)\r\nans=0\r\nfor i in range(n):\r\n if k>=d[i]:\r\n k-=d[i]\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)\r\n \r\n", "n, B = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\n\r\neven = 0\r\nodd = 0\r\ncount = 0\r\ncost = []\r\n\r\nfor i in range(n):\r\n if num[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n \r\n if even == odd and i != n-1:\r\n cost.append(abs(num[i] - num[i+1]))\r\n\r\ncost.sort()\r\ntotal_cost = 0\r\n\r\nfor i in range(len(cost)):\r\n total_cost += cost[i]\r\n if total_cost > B:\r\n break\r\n count += 1\r\n\r\nprint(count)", "n, B = map(int,input().split())\r\n\r\na = list(map(int, input().split()))\r\neven = 0\r\nodd = 0\r\nl = []\r\nfor i in range(n-1):\r\n if a[i]&1:\r\n odd += 1\r\n else:\r\n even += 1\r\n if odd == even:\r\n if a[i]-a[i+1] < 0:\r\n l.append(a[i+1]-a[i])\r\n else:\r\n l.append(a[i]-a[i+1])\r\nl.sort()\r\nc = 0\r\ns = 0\r\nfor i in l:\r\n s += i\r\n if s <= B:\r\n c += 1\r\n else:\r\n break\r\nprint(c)\r\n", "#input n,B\r\nn ,B = [int(ele) for ele in str(input()).split()]\r\n#input a\r\na = [0] + [int(ele) for ele in str(input()).split()] \r\n\r\n#solve\r\n\r\n#mark\r\ncanSplit = [0 for ele in range(n+2)]\r\n\r\noddAll = 0\r\neveAll = 0\r\nfor idx in range(1,n+1):\r\n if(a[idx]%2 ==0):\r\n eveAll = eveAll + 1\r\n else:\r\n oddAll = oddAll + 1\r\n\r\noddNow = 0\r\neveNow = 0\r\nfor idx in range(1,n+1):\r\n if(a[idx]%2 == 0):\r\n eveNow = eveNow + 1\r\n eveAll = eveAll - 1\r\n else:\r\n oddNow = oddNow + 1\r\n oddAll = oddAll - 1\r\n if(oddNow == eveNow and oddAll == eveAll):\r\n canSplit[idx] = 1\r\ncanSplit[0] = 1\r\ncanSplit[n+1] = 0\r\n\r\n#dp\r\ndepth = [[-1 for c in range(B+2)] for r in range(n+2)]\r\n\r\ndepth[0][0] = 0\r\nres=0\r\nfor p2 in range(1,n):\r\n if (canSplit[p2] == 0):\r\n continue\r\n p2cost = abs(a[p2]-a[p2+1])\r\n for cost in range(p2cost,B+1):\r\n \r\n maxVal = -1\r\n if(depth[p2][cost]!=-1):\r\n maxVal=depth[p2][cost]\r\n\r\n for p1 in range(0,p2):\r\n if(canSplit[p1] == 0):\r\n continue\r\n if(depth[p1][cost-p2cost]==-1):\r\n continue\r\n if(maxVal<depth[p1][cost-p2cost]+1):\r\n maxVal = depth[p1][cost-p2cost]+1\r\n\r\n depth[p2][cost]=maxVal\r\n if(depth[p2][cost]>res):\r\n res = depth[p2][cost]\r\n\r\n#\r\nprint(res)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n", "def main():\r\n n, coins = get_list_int()\r\n nums = get_list_int()\r\n\r\n num_odd, num_even = 0, 0\r\n cut_costs = []\r\n\r\n for i in range(n - 1):\r\n if nums[i] % 2 == 0:\r\n num_even += 1\r\n else:\r\n num_odd += 1\r\n\r\n if num_even == num_odd:\r\n cut_costs.append(abs(nums[i] - nums[i + 1]))\r\n\r\n cut_costs.sort()\r\n count = 0\r\n idx = 0\r\n\r\n while idx < len(cut_costs):\r\n if cut_costs[idx] > coins:\r\n break\r\n\r\n coins -= cut_costs[idx]\r\n idx += 1\r\n count += 1\r\n\r\n print(count)\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from 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,b=lst()\r\n a=lst()\r\n ans=[];o=e=0\r\n for i in range(n):\r\n if a[i]&1:o+=1\r\n else:e+=1\r\n if o==e:\r\n if i+1<n:ans+=[abs(a[i]-a[i+1])];o=e=0\r\n ans.sort()\r\n sm=cnt=0\r\n for v in ans:\r\n sm+=v\r\n if sm>b:break\r\n cnt+=1\r\n print(cnt)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\n\\r\")\r\n\r\ndef solve():\r\n n, b = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n \r\n e = 0\r\n o = 0\r\n \r\n cts = []\r\n \r\n for i in range(n - 1):\r\n if a[i] % 2 == 0:\r\n e += 1\r\n else:\r\n o += 1\r\n \r\n if e == o:\r\n cts.append(abs(a[i] - a[i + 1]))\r\n \r\n cts.sort(reverse = True)\r\n ans = 0\r\n while cts:\r\n x = cts.pop()\r\n if x <= b:\r\n ans += 1\r\n b -= x\r\n else:\r\n break\r\n \r\n print(ans)\r\n\r\nfor _ in range(1):\r\n solve()", "n, B = list(map(int, input().split()))\na = list(map(int ,input().split()))\nnoe=0\nnoo=0\ncuts=[]\nans=0\nfor i in range(n):\n if(a[i]&1==0):\n noe+=1\n else:\n noo+=1\n if(noo==noe and i<n-1):\n cuts.append(abs(a[i]-a[i+1]))\ncuts.sort()\ncurSum = 0\nfor cut in cuts:\n curSum+=cut\n if(curSum<=B):\n ans+=1\nprint(ans)", "from math import *\r\n\r\nn,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx=0 #���������� ������\r\ny=0 #���������� ��������\r\nc=[]\r\nfor i in range(len(a)-1):\r\n if a[i]%2==0:\r\n x+=1\r\n else:\r\n y+=1\r\n if x==y:\r\n c.append(abs(a[i+1]-a[i]))\r\nfor i in range(len(c)):\r\n for j in range(len(c)-i-1):\r\n if c[j]>c[j+1]:\r\n c[j],c[j+1]=c[j+1],c[j]\r\nans=0\r\nb1=0\r\nfor i in range(len(c)):\r\n if b1+c[i]<=b:\r\n b1+=c[i]\r\n ans+=1\r\nprint(ans)", "n, b = map(int, input().split())\narr = list(map(int, input().split()))\ncuts = []\ncount = 0\nfor i in range(n - 1):\n if arr[i] % 2 == 0:\n count += 1\n else:\n count -= 1\n if count == 0:\n cuts.append(abs(arr[i] - arr[i + 1]))\ncuts.sort()\ni = 0\nsm = 0\nwhile i < len(cuts) and sm + cuts[i] <= b:\n sm += cuts[i]\n i += 1\nprint(i)\n", "n, B = map(int, input().split())\r\nA = list(map(int, input().split())) + [10000000000]\r\nR = []\r\nCH = [0] * n\r\nNCH = [0] * n\r\nfor i in range(n):\r\n if A[i] % 2 == 0:\r\n CH[i] = CH[i - 1] + 1\r\n NCH[i] = NCH[i - 1]\r\n else:\r\n NCH[i] = NCH[i - 1] + 1\r\n CH[i] = CH[i - 1]\r\n \r\n if CH[i] == NCH[i]:\r\n R.append(abs(A[i] - A[i + 1]))\r\nR.pop(len(R) - 1)\r\nR.sort()\r\ns = 0\r\nans = 0\r\nfor i in range(len(R)):\r\n if s + R[i] <= B:\r\n ans += 1\r\n s += R[i]\r\n else:\r\n break\r\nprint(ans)", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nn,b=M()\r\nx=L()\r\nl=[]\r\neven=0\r\nodd=0\r\nif(x[0]%2==0):\r\n even+=1\r\nelse:\r\n odd+=1\r\nfor i in range(1,n-1):\r\n if(x[i]%2==0):\r\n even+=1\r\n else:\r\n odd+=1\r\n if(even==odd):\r\n l.append(abs(x[i]-x[i+1]))\r\nif(x[-1]%2==0):\r\n even+=1\r\nelse:\r\n odd+=1\r\nif(even==odd):\r\n if(len(l)==0):\r\n print(0)\r\n else:\r\n l.sort()\r\n ans=0\r\n for i in range(len(l)):\r\n if(b-l[i]>=0):\r\n ans+=1\r\n b-=l[i]\r\n else:\r\n break\r\n print(ans)\r\nelse:\r\n print(0)\r\n \r\n", "n,b = map(int,input().split())\r\na = list(map(int,input().split()))\r\ne,o=0,0\r\ncuts = []\r\nfor i in range(n-1):\r\n if a[i]%2==0:\r\n e+=1\r\n else:\r\n o+=1\r\n \r\n if e==o:\r\n cuts.append(abs(a[i]-a[i+1]))\r\ncuts.sort()\r\ncount=0\r\nfor x in cuts:\r\n b-=x\r\n if b<0:\r\n break\r\n count+=1\r\nprint(count)", "\r\ndef single():return int(input())\r\ndef multiple():return list(map(int, input().split()))\r\n\r\n\r\nn, cost=multiple()\r\narr=multiple()\r\ndef fun(arr):\r\n n=len(arr)\r\n cuts=[]\r\n i=0\r\n f=0\r\n while i<n:\r\n d={0:0, 1:0}\r\n while i<n:\r\n d[arr[i]%2]+=1 \r\n if d[0]==d[1]:\r\n if i!=n-1:\r\n cuts.append(abs(arr[i+1]-arr[i]))\r\n else:\r\n f=1\r\n break \r\n i+=1 \r\n i+=1\r\n return [cuts, f]\r\na, possible=fun(arr)\r\nif possible:\r\n a.sort()\r\n l=len(a)\r\n i=0\r\n curr=0\r\n while i<l and curr<cost:\r\n curr+=a[i]\r\n if curr>cost:\r\n break \r\n i+=1 \r\n print(i)\r\nelse:\r\n print(0)\r\n", "n, b = tuple(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\ncuts = []\r\nnp = 0\r\ni = 0\r\nwhile i < n - 2:\r\n if A[i] % 2 == 0:\r\n np += 1\r\n else:\r\n np -= 1\r\n if np == 0:\r\n cuts.append(abs(A[i + 1] - A[i]))\r\n i += 1\r\nif len(cuts)==0:\r\n print(0)\r\nelse:\r\n cuts.sort()\r\n n = 0\r\n for i in range(len(cuts)):\r\n b -= cuts[i]\r\n if b >= 0:\r\n n+=1\r\n else:\r\n break\r\n print(n)\r\n\r\n", "R = lambda : map(int, input().split())\nn,m = R()\nr = list(R())\ns = []\na,b = 0,0\nfor i in range(n):\n c = r[i]%2\n if c==0:\n a+=1\n else:\n b+=1\n if (a==b>0) and i<n-1:\n if (abs(r[i]-r[i+1])<=m):\n s.append(abs(r[i]-r[i+1]))\n a,b=0,0\ns = sorted(s)\nrr = 0\nfor i in range(len(s)):\n if rr+s[i]>m:\n print(i)\n exit(0)\n else:\n rr+=s[i]\nprint(len(s))\n", "# -*- coding: utf-8 -*-\r\n\r\ndef odd(n):\r\n return n % 2 == 1\r\n\r\ndef problem():\r\n in1 = input()\r\n in2 = input()\r\n# in1 = '6 4'\r\n# in2 = '1 2 5 10 15 20 '\r\n# in1 = '4 4'\r\n# in2 = '1 2 5 5'\r\n# in1 = '6 100'\r\n# in2 = '11 22 33 44 55 66'\r\n \r\n inp1 = list(map(int, in1.split()))\r\n n = inp1[0]\r\n btc = inp1[1]\r\n\r\n numbers = list(map(int, in2.split()))\r\n \r\n if (odd(len(numbers))):\r\n return 0\r\n\r\n odd_count = 0;\r\n cut_costs = [];\r\n \r\n for idx, number in enumerate(numbers):\r\n if (odd(number)):\r\n odd_count += 1\r\n \r\n if ((idx + 1 - odd_count) == odd_count) and (idx + 1 < n):\r\n cut_costs.append(abs(numbers[idx + 1] - number))\r\n \r\n if (n - odd_count != odd_count):\r\n return 0\r\n \r\n cut_costs.sort();\r\n \r\n cuts = 0\r\n\r\n for cost in cut_costs:\r\n if (btc >= cost):\r\n cuts += 1\r\n btc -= cost\r\n \r\n return cuts\r\n\r\nresult = problem()\r\n\r\nprint(result)\r\n ", "import math\r\nn,b = map(int, input().split() )\r\na= list(map(int, input().split() ) )\r\nd=[]\r\ntec=0\r\nlenght=0\r\nfor i in range(n-1):\r\n if a[i]%2==0:\r\n tec+=1\r\n else:\r\n tec-=1\r\n lenght+=1\r\n if tec==0 and lenght>0:\r\n d.append(math.fabs(a[i]-a[i+1]))\r\n lenght=0\r\nd.sort()\r\nd.reverse()\r\ntec=0\r\nk=0\r\nwhile tec<=b and len(d)!=0:\r\n tec+=d.pop()\r\n k+=1\r\nif tec>b:\r\n k-=1\r\nprint(k)", "n,b=map(int,input().split())\r\nc=0\r\nio=-1\r\na=[]\r\nfor i in input().split():\r\n i=int(i)\r\n c+=(i%2)*2-1\r\n if c==0:\r\n io=i\r\n elif io!=-1:\r\n a+=[abs(io-i)]\r\n io=-1\r\na.sort()\r\nc=0\r\nwhile c<len(a) and a[c]<=b:\r\n b-=a[c]\r\n c+=1\r\nprint(c)\r\n", "n,b=input().split()\r\na=input().split()\r\nn=int(n); b=int(b)\r\na=[int(x) for x in a]\r\nif n%2==0:\r\n c=0; d=[]\r\n for i in range(n-1):\r\n if a[i]%2==0: c+=1\r\n else: c-=1\r\n if c==0: d.append(abs(a[i]-a[i+1]))\r\n d.sort(); c=0\r\n for i in range(len(d)):\r\n if b-d[i]>=0: b-=d[i]; c+=1\r\n else: break\r\n print(c)\r\nelse: print(0)", "a,b=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nz1=[]\r\ns=0\r\nfor i in range(a-1):\r\n if 1&z[i]:s+=1\r\n else:s-=1\r\n if s==0:z1+=[abs(z[i]-z[i+1])]\r\nsum=0;i=0;cuts=0\r\nz1=sorted(z1)\r\nwhile(i<len(z1)):\r\n if z1[i]+sum<=b:sum+=z1[i];cuts+=1\r\n else:break\r\n i+=1\r\nprint(cuts)", "n, b = map(int, input().split())\na = list(map(int, input().split()))\npts = []\nodd = 0\neven = 0\nfor i in range(n - 1):\n if a[i] % 2 == 0:\n even += 1\n else:\n odd += 1\n if odd == even:\n pts.append(abs(a[i] - a[i + 1]))\npts.sort()\nx = 0\ncuts = 0\nfor y in pts:\n if x + y <= b:\n x += y\n cuts += 1\n else:\n break\nprint(cuts)", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nans=[]\r\nfor i in range(n):\r\n if a[i]%2==1:\r\n c+=1\r\n else:\r\n c-=1\r\n if c==0:\r\n if i+1<n:\r\n ans.append(abs(a[i]-a[i+1]))\r\nans.sort()\r\nc=0\r\nfor i in range(len(ans)):\r\n if ans[i]<=b: \r\n b-=ans[i]\r\n c+=1\r\nprint(c)", "n,B = map(int,input().split())\r\na = input()\r\nA = list(map(int,list(a.split())))\r\ni = 0\r\ne = 0\r\no = 0\r\nc = 0\r\nls = []\r\nwhile(i<n):\r\n if A[i]%2 == 0:\r\n e = e+1\r\n else:\r\n o = o+1\r\n if o == e:\r\n if i == n-1:\r\n break\r\n else:\r\n ls.append(abs(A[i]-A[i+1]))\r\n o = 0\r\n e = 0\r\n i = i+1\r\nif ls == []:\r\n print(0)\r\nelse:\r\n ls.sort()\r\n for i in ls:\r\n if i<=B:\r\n c = c+1\r\n B = B-i\r\n else:\r\n break\r\n print(c)\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n,b=map(int, input().split())\r\nA=list(map(int,input().split()))\r\nB=[]\r\n\r\no,e=0,0\r\n\r\nif A[0]%2==0:\r\n\to+=1\r\nelse:\r\n\te+=1\r\n\r\nfor i in range(1,n-1):\r\n\tif A[i]%2==0:\r\n\t\to+=1\r\n\telse:\r\n\t\te+=1\r\n\tif o==e:\r\n\t\tB.append(abs(A[i+1]-A[i]))\r\n\r\nB.sort()\r\n\r\ni=0\r\nwhile i<len(B) and B[i]<=b:\r\n\tb-=B[i]\r\n\ti+=1\r\n\r\nprint(i)\r\n", "n, B = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\neven = 0\r\nodd = 0\r\nstart = 0\r\npos = []\r\nfor i in range(0, n):\r\n if a[i]%2 ==0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if even == odd:\r\n pos.append((start, i))\r\n start = i+1\r\n even = 0\r\n odd = 0\r\nif len(pos) == 1:\r\n print(\"0\")\r\nelse:\r\n cost = []\r\n for i in range(len(pos)-1):\r\n cost.append(abs(a[pos[i][1]] - a[pos[i+1][0]]))\r\n cost.sort()\r\n m = 0\r\n count = 0\r\n for x in cost:\r\n m += x\r\n if m<=B:\r\n count += 1\r\n else:\r\n break\r\n print(count)\r\n", "n, b = map(int, input().split())\nlst = [int(x) for x in input().split()]\n\nnumberOfCuts = 0\ncosts = []\n\ntemp = 0\nfor i in range(n - 1):\n if lst[i] % 2 == 1:\n temp += 1\n else:\n temp -= 1\n \n if temp == 0 and i != n - 1:\n costs.append(abs(lst[i] - lst[i + 1]))\n \ncosts.sort()\nfor i in range(len(costs)):\n if b - costs[i] >= 0:\n b -= costs[i]\n numberOfCuts += 1\n\nprint(numberOfCuts)\n\t\t\t \t \t\t \t \t \t \t\t \t\t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 2 08:40:35 2018\r\n\r\n@author: Arsanuos\r\n\"\"\"\r\n\r\n\r\n\r\ndef main():\r\n rd = lambda: list(map(int, input().split()))\r\n n, b = rd()\r\n arr = rd()\r\n even = 0\r\n tmp = []\r\n for i in range(n - 1):\r\n if arr[i] % 2 == 0:\r\n even += 1\r\n else:\r\n even -= 1\r\n if even == 0:\r\n tmp.append(abs(arr[i] - arr[i + 1]))\r\n tmp.sort()\r\n cnt = 0\r\n for val in tmp:\r\n if b < val:\r\n break\r\n cnt += 1\r\n b -= val\r\n print(cnt)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nimport math\r\nfrom functools import reduce\r\nimport bisect\r\n\r\n\r\ndef getN():\r\n return int(input())\r\n\r\n\r\ndef getNM():\r\n return map(int, input().split())\r\n\r\n\r\ndef getList():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef index(a, x):\r\n i = bisect.bisect_left(a, x)\r\n if i != len(a) and a[i] == x:\r\n return i\r\n return False\r\n\r\n\r\n#############\r\n# MAIN CODE #\r\n#############\r\n\r\nn, b = getNM()\r\narr = getList()\r\nodd = 0\r\neven = 0\r\nsegments = []\r\nfor i in range(n - 1):\r\n if arr[i] % 2:\r\n odd += 1\r\n else:\r\n even += 1\r\n\r\n if odd == even:\r\n segments.append(abs(arr[i] - arr[i + 1]))\r\nsegments.sort()\r\n\r\nans = price = 0\r\nfor x in segments:\r\n price += x\r\n if price > b:\r\n break\r\n ans += 1\r\nprint(ans)\r\n", "import math\r\n\r\nline = input()\r\n\r\nline = [int(i) for i in line.split(' ')]\r\nn, budget = line[0], line[1]\r\n\r\nline = input().split(' ')\r\n\r\nints = [int(i) for i in line]\r\n\r\nodd, even = 0, 0\r\n\r\nsections = []\r\ntemp = []\r\n\r\nfor i in ints:\r\n temp.append(i)\r\n odd += i % 2\r\n even += (i+1) % 2\r\n if odd != 0 and odd == even:\r\n sections.append(temp)\r\n temp = []\r\n odd = even = 0\r\n\r\nif len(sections) == 1:\r\n print(0)\r\nelse:\r\n costs = []\r\n\r\n for i in range(0, len(sections)):\r\n if i == 0:\r\n costs.append(0)\r\n else:\r\n costs.append(abs(sections[i][0]- sections[i-1][-1]))\r\n\r\n costs = sorted(costs)\r\n\r\n while(sum(costs) > budget):\r\n costs = costs[:-1]\r\n\r\n print(len(costs) - 1)\r\n", "n,b=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nodd=0\r\neven=0\r\nans=[]\r\nfor i in range(len(a)):\r\n if(a[i]%2):\r\n odd+=1\r\n else:\r\n even+=1\r\n if(odd==even):\r\n if(i!=len(a)-1):\r\n ans.append(abs(a[i]-a[i+1]))\r\nans.sort()\r\ncount=0\r\nsu=0\r\nfor i in ans:\r\n su+=i\r\n if(su<=b):\r\n count+=1\r\n else:\r\n break\r\nprint(count)\r\n", "n, B = map(int, input().split())\r\n\r\nx = list(map(int, input().split()))\r\ncuts = []\r\n\r\neven_odd_balance = 1 if x[0] % 2 == 1 else -1\r\nfor k in range(1, len(x) - 1):\r\n if x[k] % 2 == 1:\r\n even_odd_balance += 1\r\n else:\r\n even_odd_balance -= 1\r\n if even_odd_balance == 0:\r\n cuts.append(abs(x[k] - x[k + 1]))\r\ncuts.sort()\r\nans = 0\r\nfor elem in cuts:\r\n if elem > B:\r\n break\r\n ans += 1\r\n B -= elem\r\n\r\nprint(ans)", "import sys\n\nnum_elements, bitcoins = map(int, sys.stdin.readline().split())\nelements = list(map(int, sys.stdin.readline().split()))\ncuts_costs = []\nodd_balance = -1 if elements[0] % 2 == 0 else 1\nfor pos, element in enumerate(elements[1:-2], start=1):\n odd_balance += -1 if element % 2 == 0 else 1\n if odd_balance == 0:\n cuts_costs.append(abs(element - elements[pos + 1]))\ncuts_costs.sort()\n\nnum_cuts = 0\nfor cut in cuts_costs:\n bitcoins -= cut\n if bitcoins >= 0:\n num_cuts += 1\n else:\n break\nprint(num_cuts)\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nodd = 0\r\neven = 0\r\nn,b = map(int,input().split())\r\na = list(map(int,input().split()))\r\nL = []\r\nfor i in range(n-1):\r\n if a[i]%2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if odd == even:\r\n L.append(i)\r\ncoin = [] \r\nfor i1 in L:\r\n coin.append(abs(a[i1+1]-a[i1]))\r\ncoin.sort()\r\nans = 0\r\nans1 = 0\r\nfor i9 in range(len(coin)):\r\n i = coin[i9]\r\n ans += i\r\n ans1 +=1\r\n if ans==b:\r\n print(ans1) \r\n break\r\n if ans >b:\r\n print(ans1-1)\r\n break\r\n if i9 == len(coin)-1:\r\n print(ans1)\r\n\r\n \r\nif L == []:\r\n print(0) \r\n\r\n", "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ne = 0\r\no = 0\r\ncuts = []\r\n\r\nfor i in range(n-1):\r\n if a[i]%2:\r\n o += 1\r\n else:\r\n e += 1\r\n \r\n if o == e:\r\n cuts.append(abs(a[i]-a[i+1]))\r\n o = 0\r\n e = 0\r\n \r\ncuts.sort()\r\nct = 0\r\n\r\nfor i in cuts:\r\n if b-i >= 0:\r\n ct += 1\r\n b -= i\r\n \r\nprint(ct)", "n, limit = map(int, input().split())\narr = [int(x) for x in input().split()]\nodds = evens = 0\ncutArr = []\nfor i in range(len(arr)-1):\n if arr[i] % 2 == 0:\n evens += 1\n else:\n odds += 1\n if evens == odds:\n cutArr.append(abs(arr[i+1]-arr[i]))\n\ncutArr.sort()\nsuma = 0\ncuts = 0\n##print(cutArr)\nwhile suma <= limit and cuts < len(cutArr):\n suma += cutArr[cuts]\n cuts += 1\nif suma > limit:\n cuts -= 1\nprint(cuts)\n\n\t\t\t\t \t \t \t \t \t \t\t\t\t\t", "import bisect\ndef find_le(a, x):\n 'Find rightmost value less than or equal to x'\n i = bisect.bisect_right(a, x)\n if i:\n return a[i-1]\n raise ValueError\n\nnB = list(map(int, input().rstrip().split(\" \")))\nn,B = nB[0],nB[1]\nar = list(map(int, input().rstrip().split(\" \")))\ncuts = []\nnums = 0\n# +1 for odd, -1 for even\nfor i in range(n):\n if ar[i] % 2 == 0:\n nums -= 1\n else:\n nums += 1\n if nums==0 and i<n-1:\n cuts.append(abs(ar[i+1]-ar[i]))\ncuts.sort()\nif len(cuts)==0:\n print(0)\nelse:\n cuts_sum = [cuts[0]]\n for i in range(1, len(cuts)):\n cuts_sum.append(cuts_sum[i - 1] + cuts[i])\n index = bisect.bisect_right(cuts_sum, B)\n print(index)", "I = lambda:int(input())\r\nID = lambda:map(int, input().split())\r\nIL = lambda:list(ID())\r\nn,b = ID()\r\na = IL()\r\nd = []\r\nodd = even = ans = 0\r\nf = False\r\nfor i in range(n-1):\r\n if a[i] % 2 == 0:\r\n even += 1\r\n else:\r\n odd += 1\r\n if odd == even and i!=n-1:\td.append(abs(a[i]-a[i+1]))\r\nd.sort()\r\nfor i in d:\r\n\tb-=i\r\n\tans+=1\r\n\tif b<0:\r\n\t\tf = True\r\n\t\tbreak\r\n\tif b == 0:\r\n\t\tbreak\r\nif f:\r\n\tprint(ans-1)\r\nelse:\r\n\tprint(ans)", "n, b = map(int, input().split())\r\nlst = tuple(map(int, input().split()))\r\nk = 0\r\npr = []\r\nfor i in range(n-1):\r\n if lst[i] % 2: k += 1\r\n else: k -= 1\r\n if not k: pr.append(abs(lst[i]-lst[i+1]))\r\nk = 0\r\nfor i in sorted(pr):\r\n if b - i < 0: break\r\n b -= i\r\n k += 1\r\nprint(k)\r\n\r\n\r\n\r\n", "n,B=(int(s) for s in input().split())\r\narr=[int(s) for s in input().split()]\r\narr_odd=[0]*n\r\narr_even=[0]*n\r\nif arr[0]%2==0:\r\n arr_even[0]=1\r\nelse:\r\n arr_odd[0]=1\r\nfor i in range(1,n):\r\n if arr[i]%2==0:\r\n arr_even[i]=arr_even[i-1]+1\r\n arr_odd[i]=arr_odd[i-1]\r\n else:\r\n arr_odd[i]=arr_odd[i-1]+1\r\n arr_even[i]=arr_even[i-1]\r\narr_cost=[123445]*n\r\nfor i in range(0,n-1):\r\n if i%2==0 or arr_odd[i]!=arr_even[i]:\r\n arr_cost[i]=123456\r\n else:\r\n arr_cost[i]=abs(arr[i+1]-arr[i])\r\nans=0\r\narr_cost.sort()\r\ni=0\r\n#print(arr_cost)\r\n#print(arr_odd)\r\n#print(arr_even)\r\nwhile(B-arr_cost[i]>=0):\r\n ans+=1\r\n B-=arr_cost[i]\r\n i+=1\r\nprint(ans)\r\n", "n,b=map(int,input().split())\r\nar=list(map(int,input().split()))\r\no=0;e=0;arr=[]\r\nfor i in range(n):\r\n if ar[i]%2==0:o+=1\r\n else:e+=1\r\n arr.append([ar[i],o,e])\r\n#print(arr)\r\nans=[]\r\nfor i in range(1,n):\r\n if arr[i-1][1]==arr[i-1][2]:\r\n ans.append(abs(arr[i][0]-arr[i-1][0]))\r\nans=sorted(ans);cnt=0;ans1=0\r\n#print(ans)\r\nfor i in range(len(ans)):\r\n cnt+=ans[i]\r\n if cnt<=b:ans1=i+1\r\nprint(ans1)\r\n", "n, b = list(map(int, input().split()))\na = list(map(int, input().split()))\nbalance = [0] * n\nfor i in range(1, n):\n if a[i - 1] % 2 == 0:\n balance[i] = balance[i - 1] + 1\n else:\n balance[i] = balance[i - 1] - 1\ns = [10000]\nfor i in range(1, n):\n if balance[i] == 0:\n s.append(abs(a[i] - a[i - 1]))\ns.sort()\nc = 0\nans = 0\nfor i in s:\n c += i\n if c > b:\n print(ans)\n break\n else:\n ans += 1", "import math\r\n\r\nn, B = (int(x) for x in input().split())\r\na = [int(x) for x in input().split()]\r\nrazr = []\r\n\r\nif n == 2:\r\n print(0)\r\nelse:\r\n\r\n count_chet = 0\r\n count_nechet = 0\r\n if a[0] % 2 == 0:\r\n count_chet += 1\r\n else:\r\n count_nechet += 1\r\n for i in range(1, n-2):\r\n if a[i] % 2 == 0:\r\n count_chet += 1\r\n else:\r\n count_nechet += 1\r\n if count_chet == count_nechet:\r\n razr.append(math.fabs(a[i+1]-a[i]))\r\n ans = 0\r\n razr = sorted(razr)\r\n sum = 0\r\n for i in range(len(razr)):\r\n sum += razr[i]\r\n if sum <= B:\r\n ans += 1\r\n\r\n print(ans)\r\n", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nans=0\r\nli=[]\r\nfor i in range(n-1):\r\n if a[i]&1:\r\n x+=1\r\n if not a[i]&1:\r\n y+=1\r\n if x==y:\r\n li.append((abs(a[i+1]-a[i]),i))\r\nli.sort()\r\ni=0\r\nwhile b>0 and i<len(li):\r\n if b-li[i][0]>=0:\r\n b-=li[i][0]\r\n ans+=1\r\n else:\r\n break\r\n i+=1\r\nprint(ans)", "n,b = map(int,input().split())\r\na = list(map(int,input().split()))\r\nx = y=0\r\nc = []\r\nans = 0\r\nk = 0\r\nfor i in range(n-1):\r\n if a[i]%2 == 0: x += 1\r\n else: y+=1\r\n if x == y: c.append(abs(a[i]-a[i+1]))\r\nc.sort()\r\nfor i in c:\r\n if k+i<=b: k+=i; ans += 1\r\n else: break\r\nprint(ans)", "# cook your dish here\r\nn ,b = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncuts = []\r\nc = 0\r\nfor i in range(len(a)-1):\r\n e = a[i]\r\n if e % 2 == 0:\r\n c += 1\r\n else:\r\n c -= 1\r\n if c == 0:\r\n cuts.append(abs(a[i] - a[i+1]))\r\ncuts.sort()\r\ncount = 0\r\nfor e in cuts:\r\n if b - e >= 0:\r\n b -= e\r\n count += 1\r\nprint(count)", "n,b=[int(i) for i in input().split()]\r\nlst=[int(i) for i in input().split()]\r\nco=0\r\nce=0\r\ncost=[]\r\nfor i in range(n):\r\n if lst[i]%2==0:\r\n co+=1\r\n else:ce+=1\r\n if co==ce and i<n-1:\r\n cost.append(abs(lst[i+1] - lst[i]))\r\ncost.sort()\r\n#print(cost)\r\nsum=0\r\ni=0\r\nwhile(sum<=b and i<len(cost)):\r\n sum+=cost[i]\r\n i+=1\r\nif co==ce:\r\n if sum>b :print(i-1)\r\n else :print(i)\r\nelse :print(0)\r\n ", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nlst,chet,nechet=[],0,0\r\nfor i in range(n-1):\r\n x=a[i]\r\n if x%2==0:chet+=1\r\n else:nechet+=1\r\n if chet==nechet:lst.append(abs(x-a[i+1]))\r\nlst.sort()\r\nsumma,res=0,0\r\nfor i,x in enumerate(lst):\r\n summa+=x\r\n if summa>b:break\r\n res+=1\r\nprint(res)", "n, b = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nsplits = []\r\n\r\ncount_even = 0\r\ncount_odd = 0\r\nfor i in range(n):\r\n count_even += a[i] % 2 == 0\r\n count_odd += a[i] % 2 != 0\r\n if count_even == count_odd and 0 < i < n - 1:\r\n splits.append(abs(a[i + 1] - a[i]))\r\n\r\nif count_even != count_odd:\r\n splits.clear()\r\n\r\nsplits.sort()\r\ncount = 0\r\nfor i in range(len(splits)):\r\n b -= splits[i]\r\n if b < 0:\r\n break\r\n count += 1\r\nprint(count)\r\n", "n, bcn = map(int , input().split())\r\nar = list(map(int, input().split()))\r\nc = 0\r\nseg = []\r\nfor i in range(n-1):\r\n\tif ar[i]&1:\r\n\t\tc += 1\r\n\telse:c -= 1\r\n\tif not c:seg.append(abs(ar[i]-ar[i+1]))\r\nseg.sort()\r\nc = 0\r\nans = 0\r\nfor i in range(len(seg)):\r\n\tc += seg[i]\r\n\tif c <= bcn:\r\n\t\tans += 1\r\n\telse:\r\n\t\tpass\r\nprint(ans)", "arr=list(map(int, input().strip().split()))\r\nar=list(map(int, input().strip().split()))\r\nn=arr[0]\r\nb=arr[1]\r\nec=0\r\noc=0\r\ndf=[]\r\nflag=0\r\nfor i in range(n):\r\n if(ar[i]%2==0):\r\n ec+=1\r\n else:\r\n oc+=1\r\n\r\nif(ec!=oc):\r\n flag=1\r\n \r\nif(flag==1):\r\n print(0)\r\nelse:\r\n ec=0\r\n oc=0\r\n for i in range(n-2):\r\n if(ar[i]%2==0):\r\n ec+=1\r\n else:\r\n oc+=1\r\n if(oc==ec):\r\n oc=0\r\n ec=0\r\n df.append(abs(ar[i]-ar[i+1]))\r\n #print(df)\r\n if(df==[]):\r\n print(0)\r\n else:\r\n df.sort()\r\n sm=df[0]\r\n ans=0\r\n if(sm>b):\r\n ans=0\r\n else:\r\n ans+=1\r\n for i in range(1,len(df)):\r\n sm+=df[i]\r\n if(sm>b):\r\n break\r\n else:\r\n ans+=1\r\n print(ans)\r\n", "n,b = map(int,input().split())\narr = list(map(int,input().split()))\noe = 0\ncost = []\nfor i in range(n):\n if arr[i]%2:\n oe+=1\n else:\n oe-=1\n if not oe and i!=(n-1):\n cost.append(abs(arr[i+1]-arr[i]))\ncost.sort()\ntot ,c = 0,0\nfor i in cost:\n if tot+i <= b:\n tot+=i\n c += 1\n else:\n break\nprint(c)\n", "import sys\r\ndef mp():\r\n return list(map(int, input().split()))\r\n\r\ndef dead():\r\n print(\"-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\n\r\ndef _main():\r\n n, k = mp()\r\n a = mp()\r\n x,y = 0, 0\r\n p = True\r\n visited = [0] * (n + 5)\r\n while(p):\r\n p = False\r\n m = -1\r\n for i in range(n):\r\n if(a[i] & 1):\r\n x+= 1\r\n else:\r\n y += 1\r\n if visited[i] == 0 and x == y and i != n - 1:\r\n if m == -1 or abs(a[m] - a[m + 1]) > abs(a[i] - a[i + 1]):\r\n m = i\r\n \r\n if m != -1 and k >= abs(a[m] - a[m + 1]):\r\n k -= abs(a[m] - a[m + 1])\r\n visited[m] = 1\r\n p = True\r\n # print(m)\r\n print(visited.count(1))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n_main()", "n,B = map(int,input().split())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nodd = 0\r\neven = 0\r\n\r\nwinneres = []\r\nfor i in range(len(l)):\r\n if l[i] & 1:\r\n odd += 1\r\n else:\r\n even += 1\r\n\r\n if even == odd:\r\n if (i != len(l)-1):\r\n winneres.append(abs(l[i]-l[i+1]))\r\n\r\nwinneres.sort()\r\n\r\nans = 0\r\nfor el in winneres:\r\n if B >= el:\r\n ans += 1\r\n B -= el\r\n\r\nprint(ans)\r\n", "n,m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ndp = {}\r\nodd = 0\r\neven = 0\r\ndp = []\r\ncnt = 0\r\nfor i in range(n):\r\n if arr[i]%2 != 0:\r\n odd += 1\r\n else:\r\n even += 1\r\n if odd == even and odd+even != n:\r\n dp.append(abs(arr[i+1]-arr[i]))\r\ndp = sorted(dp)\r\ns = 0\r\nfor i in range(len(dp)):\r\n if s+dp[i]<=m:\r\n s += dp[i]\r\n cnt += 1\r\n else:\r\n break\r\nprint(cnt)", "n, B = map(int, input().split())\r\na = list(map(int, input().split()))\r\nodds, evens = 0, 0\r\ncosts = []\r\nfor i in range(n - 1):\r\n if a[i] % 2 == 0:\r\n evens += 1\r\n else:\r\n odds += 1\r\n if odds == evens:\r\n costs.append(abs(a[i] - a[i + 1]))\r\ncnt = 0\r\nif len(costs) > 0:\r\n costs.sort()\r\n while B > 0 and cnt < len(costs):\r\n if costs[cnt] <= B:\r\n B -= costs[cnt]\r\n cnt += 1\r\n else:\r\n B = 0\r\nprint(cnt)\r\n", "import bisect\r\nn,b=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ne,o=0,0\r\nct=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n e=e+1\r\n ct.append([e,o])\r\n else:\r\n o=o+1\r\n ct.append([e,o])\r\nx=[]\r\nfor i in range(n):\r\n if ct[i][0]==ct[i][1]:\r\n if i+1<n:\r\n x.append(abs(a[i]-a[i+1]))\r\nif x==[]:\r\n print(0)\r\nelse:\r\n x.sort()\r\n for i in range(1,len(x)):\r\n x[i]=x[i-1]+x[i]\r\n ans=bisect.bisect_right(x,b)\r\n print(ans)", "#\n# Joseph Matsushita\n# Problem F\n#\n\nn, B = map(int, input().split())\na = list(map(int, input().split()))\n\no = 0\ne = 0\ni = 0\ncuts = list()\nwhile i < n - 1: #no point in checking the last element\n if a[i] % 2 == 0:\n e += 1\n else:\n o += 1\n if e == o:\n cuts.append(abs(a[i] - a[i+1]))\n i += 1\n \ncuts.sort()\ncost = 0\ncount = 0\nwhile len(cuts) > 0 and cost + cuts[0] <= B:\n cost += cuts.pop(0)\n count += 1\n\nprint(count)\n \t \t \t \t\t \t \t\t \t\t\t \t", "n,x=map(int,input().rstrip().split())\r\narr=list(map(int,input().rstrip().split()));even,odd=0,0\r\nfor e in range(n):\r\n if arr[e]%2==0:even+=1\r\n else :odd+=1\r\nevenn,oddd,=0,0\r\narr1=[]\r\nfor e in range(n-1):\r\n if arr[e]%2==0:evenn+=1;even-=1\r\n elif arr[e]%2!=0 :odd-=1;oddd+=1\r\n if even==odd and oddd==evenn:\r\n arr1.append(abs(arr[e]-arr[e+1]))\r\narr1.sort();count=0;o=0\r\nfor e in range(len(arr1)):\r\n if count+arr1[e]<=x:count+=arr1[e];o+=1\r\n else:break\r\nprint(o)", "import sys\r\ninput = sys.stdin.readline\r\nn, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = []\r\no, e = 0, 0 \r\nfor i in range(n):\r\n if(a[i] % 2):\r\n o += 1 \r\n else:\r\n e += 1 \r\n if(i + 1 < n and o == e):\r\n l.append(abs(a[i + 1] - a[i]))\r\n\r\nif(l == []):\r\n print(0)\r\n exit()\r\nl.sort()\r\nfor i in range(len(l)):\r\n if(b - l[i] >= 0):\r\n b -= l[i]\r\n else:\r\n print(i)\r\n break \r\nelse:\r\n print(len(l))\r\n ", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\nx=list()\r\ni=0\r\ne=0\r\no=0\r\nwhile(i<n):\r\n if(e==o and o!=0):\r\n e=0\r\n o=0\r\n x.append(abs(a[i]-a[i-1]))\r\n if(a[i]%2==0):\r\n e+=1\r\n elif(a[i]%2!=0):\r\n o+=1\r\n i+=1\r\nc=0\r\nx.sort()\r\nfor i in x:\r\n b-=i\r\n if(b<0):\r\n break\r\n else:\r\n c+=1\r\nprint(c) \r\n ", "import sys\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\ns = cnt = 0\r\nli = []\r\n\r\nfor i in range(0,n-1):\r\n if a[i]%2 == 0:\r\n s += 1\r\n else:\r\n s -= 1\r\n \r\n if s == 0:\r\n li.append(abs(a[i] - a[i+1]))\r\n\r\nli.sort()\r\n\r\nfor i in range(len(li)):\r\n if m <= 0:\r\n break\r\n else:\r\n if m >= li[i]:\r\n cnt += 1\r\n \r\n m -= li[i]\r\n\r\nprint(cnt)", "def max_cut(n,b,l):\r\n a,s,c=[],0,[0,0]\r\n for i in range(n-1):\r\n c[l[i]%2]+=1\r\n if c[0]==c[1]:\r\n a.append(abs(l[i+1]-l[i]))\r\n a.sort()\r\n i=0\r\n while i<len(a) and s<b:\r\n s+=a[i]\r\n i+=1\r\n return i-1 if s>b else i\r\n\r\n\r\nR=lambda:list(map(int,input().split()))\r\nn,b=R()\r\nl=R()\r\nprint(max_cut(n,b,l))", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = 0\r\nr = 0\r\nans = 0\r\nb = []\r\nfor i in range(n - 2):\r\n if a[i] % 2:\r\n r += 1\r\n else:\r\n l += 1\r\n if l == r:\r\n b.append(abs(a[i] - a[i + 1]))\r\n\r\nb = sorted(b)\r\nfor i in b:\r\n if i <= m:\r\n ans += 1\r\n m -= i\r\nprint(ans)\r\n", "n,b=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\ne=[a[i]%2 for i in range(n)]\r\nc=[]\r\nfor i in range(1,n):\r\n if sum(e[i:])==(n-i)/2 and sum(e[:i])==i/2:\r\n c.append(abs(a[i]-a[i-1]))\r\nc.sort()\r\ni=0\r\nd=0\r\nwhile i<len(c) and d+c[i]<=b:\r\n d+=c[i]\r\n i+=1\r\nprint(i)", "n,coins=[int(i) for i in input().split(' ')]\r\ntr=[int(i) for i in input().split(' ')]\r\nod,ev=0,0\r\ncost=[]\r\nfor i in range(len(tr)-1):\r\n if tr[i]%2==0:ev+=1\r\n else:od+=1\r\n if od==ev:cost.append(abs(tr[i]-tr[i+1]))\r\ncost.sort(reverse=True)\r\nwhile(sum(cost)>coins):cost.pop(0)\r\nprint(len(cost))\r\n", "import math\r\nimport sys\r\nfrom bisect import bisect_right, bisect_left, insort_right\r\nfrom collections import Counter, defaultdict\r\nfrom heapq import heappop, heappush\r\nfrom itertools import accumulate\r\nfrom sys import stdout\r\n\r\nR = lambda: map(int, input().split())\r\nn, B = R()\r\narr = list(R())\r\no = 0\r\nres = []\r\nfor i, x in enumerate(arr):\r\n o += 1 if x & 1 else -1\r\n if not o:\r\n res.append(abs(x - (arr[i + 1] if i < n - 1 else math.inf)))\r\nres = list(accumulate(sorted(res)))\r\nprint(bisect_right(res, B))", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx,y,ans,z,p=0,0,[],0,0\r\nfor i in range(n-1):\r\n if l[i]%2==1:\r\n x+=1\r\n else:\r\n y+=1\r\n if x==y:\r\n ans.append(abs(l[i]-l[i+1]))\r\nans.sort()\r\nfor i in range(len(ans)):\r\n if p + ans[i]<=m: \r\n z += 1 \r\n p += ans[i]\r\n else: \r\n break\r\nprint(z)", "# Lets goto the next level \r\n# AIM Specialist at CF *__* asap \r\n# template taken from chaudhary_19 \r\n# Remember you were also a novice when you started, \r\n# hence never be rude to anyone who wants to learn something\r\n# Never open a ranklist untill and unless you are done with solving problems, wastes 3/4 minuts \r\n# Donot treat CP as a placement thing, love it and enjoy it, you will succeed for sure. \r\n# Any doubts or want to have a talk, contact https://www.facebook.com/chaudhary.mayank\r\n\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\nimport sys\r\nfrom bisect import bisect_left,bisect_right,insort\r\nfrom collections import deque,Counter\r\nfrom math import gcd,sqrt,factorial,ceil,log10,log2,floor\r\nfrom itertools import permutations\r\nfrom heapq import heappush,heappop,heapify\r\ninf = float(\"inf\")\r\nmod = 10**9+7\r\n#sys.setrecursionlimit(10**9)\r\n\r\n\r\ndef factorial_p(n, p):\r\n ans = 1\r\n if n <= p // 2:\r\n for i in range(1, n + 1):\r\n ans = (ans * i) % p\r\n else:\r\n for i in range(1, p - n):\r\n ans = (ans * i) % p\r\n ans = pow(ans, p - 2, p)\r\n if n % 2 == 0:\r\n ans = p - ans\r\n return ans\r\n\r\n\r\ndef nCr_p(n, r, p):\r\n ans = 1\r\n while (n != 0) or (r != 0):\r\n a, b = n % p, r % p\r\n if a < b:\r\n return 0\r\n ans = (ans * factorial_p(a, p) * pow(factorial_p(b, p), p - 2, p) * pow(factorial_p(a - b, p), p - 2, p)) % p\r\n n //= p\r\n r //= p\r\n return ans\r\n\r\ndef prime_sieve(n):\r\n \"\"\"returns a sieve of primes >= 5 and < n\"\"\"\r\n flag = n % 6 == 2\r\n sieve = bytearray((n // 3 + flag >> 3) + 1)\r\n for i in range(1, int(n**0.5) // 3 + 1):\r\n if not (sieve[i >> 3] >> (i & 7)) & 1:\r\n k = (3 * i + 1) | 1\r\n for j in range(k * k // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] |= 1 << (j & 7)\r\n for j in range(k * (k - 2 * (i & 1) + 4) // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] |= 1 << (j & 7)\r\n return sieve\r\ndef prime_list(n): #<----- You have to call me if you wanna get list of primes upto range n\r\n \"\"\"returns a list of primes <= n\"\"\"\r\n res = []\r\n if n > 1:\r\n res.append(2)\r\n if n > 2:\r\n res.append(3)\r\n if n > 4:\r\n sieve = prime_sieve(n + 1)\r\n res.extend(3 * i + 1 | 1 for i in range(1, (n + 1) // 3 + (n % 6 == 1)) if not (sieve[i >> 3] >> (i & 7)) & 1)\r\n return res\r\n \r\ndef is_prime(n):\r\n \"\"\"returns True if n is prime else False\"\"\"\r\n if n < 5 or n & 1 == 0 or n % 3 == 0:\r\n return 2 <= n <= 3\r\n s = ((n - 1) & (1 - n)).bit_length() - 1\r\n d = n >> s\r\n for a in [2, 325, 9375, 28178, 450775, 9780504, 1795265022]:\r\n p = pow(a, d, n)\r\n if p == 1 or p == n - 1 or a % n == 0:\r\n continue\r\n for _ in range(s):\r\n p = (p * p) % n\r\n if p == n - 1:\r\n break\r\n else:\r\n return False\r\n return True\r\n\r\ndef all_factors(n):\r\n \"\"\"returns a sorted list of all distinct factors of n\"\"\"\r\n small, large = [],[]\r\n for i in range(1, int(n**0.5) + 1, 2 if n & 1 else 1):\r\n if not n % i:\r\n small.append(i)\r\n large.append(n//i)\r\n large.reverse()\r\n small.extend(large)\r\n return small\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n# ///===========MAIN=============///\r\nn,b=get_ints()\r\nArr=get_array()\r\neven_suf=[0]*n\r\nodd_suf=[0]*n\r\nif Arr[0]&1:\r\n odd_suf[0]=1\r\nelse:\r\n even_suf[0]=1\r\nfor i in range(1,n):\r\n if Arr[i]&1:\r\n odd_suf[i]=odd_suf[i-1]+1\r\n even_suf[i]=even_suf[i-1]\r\n else:\r\n even_suf[i]=even_suf[i-1]+1\r\n odd_suf[i]=odd_suf[i-1]\r\nresult=[];flag=0\r\nfor i in range(1,n-1):\r\n if odd_suf[i]==even_suf[i]:\r\n result.append(abs(Arr[i]-Arr[i+1]))\r\n flag=1\r\nif flag==0:\r\n print(0)\r\n exit()\r\nresult.sort()\r\nindex=0\r\ntotal=0\r\nwhile(index<len(result) and total+result[index]<=b):\r\n total+=result[index]\r\n index+=1\r\nprint(index)\r\n", "n,b = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\neven = 0\nodd = 0\ncuts = []\nfor i in range(0,n):\n if a[i]%2 == 0:\n even+=1\n else:\n odd += 1\n if even == odd:\n cuts.append(i)\n even = 0\n odd = 0\ncuts.pop()\n#print (cuts)\nl = len(cuts)\nB= 0\ncost = []\nfor i in range(0,l):\n B+= abs(a[cuts[i]]-a[cuts[i]+1])\n cost.append(abs(a[cuts[i]]-a[cuts[i]+1]))\n\nL = len(cost)\n#print(l,L)\nr = len(cost)-1\nl = 0\n\n#print(cost)\nwhile B > b:\n max = cost[0]\n for i in cost:\n if i > max:\n max = i\n B -= max\n cost.remove(max)\n#print(B)\nprint(len(cost))\n", "n,k=map(int,input().split());\r\na=list(map(int,input().split()));\r\ncnt=[]\r\ncnt1=0\r\ncnt2=0\r\nfor i in range(n-1):\r\n if a[i]%2==0:\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\n if cnt1==cnt2:\r\n cnt.append(abs(a[i+1]-a[i]))\r\n cnt1=0\r\n cnt2=0\r\ncnt.sort()\r\nr=0\r\n#print(cnt)\r\nsum=0\r\nfor i in range(len(cnt)):\r\n sum+=cnt[i]\r\n if sum>k:\r\n sum-=cnt[i]\r\n break\r\n r+=1\r\n\r\nprint(r)\r\n \r\n", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\ncnt1=0;cnt2=0\r\nfor i in range(len(a)):\r\n if a[i]%2==0:cnt1+=1\r\n else:cnt2+=1\r\n if cnt1==cnt2 and i+1<len(a):\r\n b.append(abs(a[i]-a[i+1]))\r\nb.sort()\r\nsum=0;ans=0\r\nfor i in b:\r\n sum+=i\r\n if sum<=m:\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)", "n,b=map(int,input().split())\r\na=list(map(int,input().split()))\r\neven=[0]*n\r\nodd=[0]*n\r\nfor i in range(n):\r\n if a[i]%2:\r\n odd[i]+=1\r\n else:\r\n even[i]+=1\r\nfor i in range(n-1):\r\n odd[i+1]+=odd[i]\r\n even[i+1]+=even[i]\r\ncut=[]\r\nfor i in range(n-1):\r\n if odd[i]==even[i]:\r\n cut.append((abs(a[i]-a[i+1]),i))\r\ncut.sort()\r\ncnt=0\r\ns=0\r\nwhile s<=b and cut:\r\n c,idx=cut.pop(0)\r\n s+=c\r\n cnt+=1\r\nif s>b:\r\n cnt-=1\r\nprint(cnt)", "n, bitcoins = map(int, input().split())\nvals = list(map(int, input().split()))\nn_even = 0\nn_odds = 0\ncut_costs = []\nfor i in range(n - 1):\n if vals[i] % 2 == 0:\n n_even += 1\n else:\n n_odds += 1\n if n_even == n_odds and n_even != 0:\n cut_costs.append(abs(vals[i] - vals[i + 1]))\n# print(cut_costs)\ncut_costs.sort()\ncosts = 0\nres = 0\nfor i in cut_costs:\n costs += i\n if costs <= bitcoins:\n res += 1\n else:\n break\nprint(res)\n\n \t \t\t \t \t \t \t\t \t\t\t", "n, b = map(int, input().split())\r\na = list(map(int, input().split()))\r\nno = ne = 0\r\ncuts = []\r\nfor i, x in enumerate(a):\r\n\tif x % 2 == 0:\r\n\t\tne += 1\r\n\telse:\r\n\t\tno += 1\r\n\tif ne == no and i < n - 1:\r\n\t\t# print(i, x)\r\n\t\tcuts.append(abs(a[i + 1] - a[i]))\r\n\r\ncuts.sort(reverse=True)\r\ni = 0\r\ns = 0\r\nwhile cuts and s + cuts[-1] <= b:\r\n\ts += cuts.pop()\r\n\ti += 1\r\nprint(i)", "import math\r\nn,B = map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nodd=0\r\neven=0\r\nrazr=[]\r\nfor i in range(n-2):\r\n if a[i]%2==1: odd+=1\r\n else: even+=1\r\n if odd==even:\r\n razr.append(math.fabs(a[i]-a[i+1]))\r\nrazr.sort()\r\n#print(razr)\r\nsum=0\r\nc=0\r\ni=0\r\nwhile i<len(razr):\r\n sum+=razr[i]\r\n if sum<=B:\r\n c+=1\r\n else: break\r\n i+=1\r\nprint(c)", "N,B=map(int,input().split())\nS=list(map(int,input().split()))\n\nodd=0\neven=0\n\nsep={}\nsep2=[]\nfor i in range(N-1):\n if S[i]%2==0:\n odd+=1\n else:\n even+=1\n if odd==even:\n sep[i+1]=S[i+1]-S[i]\n sep2.append(abs(S[i+1]-S[i]))\n\nsep2.sort()\n\ncount=0\nfor i in range(len(sep2)):\n B-=sep2[i]\n if B>=0:\n count+=1\nprint(count)\n ", "MyDp, Odd, Even, Input, Count = [], 0, 0, lambda: list(map(int, input().split())), 0\r\nX, Numbers = Input(), Input()\r\nfor i in range(X[0]):\r\n Odd += 1 if Numbers[i] % 2 == 1 else 0\r\n Even += 1 if Numbers[i] % 2 == 0 else 0\r\n if Odd == Even and i < X[0] - 2:\r\n MyDp.append(abs(Numbers[i] - Numbers[i + 1]))\r\nMyDp.sort()\r\ni = 0\r\nfor i in MyDp:\r\n X[1] -= i\r\n if X[1]>=0:Count+=1\r\n else:break\r\nprint(Count)\r\n# Show you deserve being the best to whom doesn't believe in you.\r\n# Location: WTF is this JAVA project. Data Mining with JAVA? \r\n# Like participating with Pride in car races", "n, B = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\npossible_splits = []\neven = 0\nodd = 0\nfor i in range(n - 1):\n if a[i] % 2 == 0:\n even += 1\n else:\n odd += 1\n if even == odd:\n possible_splits.append((abs(a[i] - a[i + 1]), i))\n\npossible_splits = sorted(possible_splits)\ni = 0\nwhile i < len(possible_splits) and B >= possible_splits[i][0]:\n B -= possible_splits[i][0]\n i += 1\n\nprint(i)\n\n\n", "n,b = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ncosts = []\r\nbalance = [False]*n\r\nodds, evens = 0,0\r\nfor x in range(n):\r\n if a[x] %2 == 0:\r\n evens+=1\r\n else:\r\n odds+=1\r\ni,j =0,0\r\nfor x in range(n-1):\r\n if a[x] %2 == 0:\r\n i+=1\r\n else:\r\n j+=1\r\n if i==j and (evens-i)==(odds-j):\r\n balance[x] = True\r\nfor x in range(n-1):\r\n if balance[x]:\r\n costs.append(abs(a[x]-a[x+1]))\r\ncostSum = 0\r\ncosts = sorted(costs)\r\nans = 0\r\nfor x in costs:\r\n if costSum + x <= b:\r\n costSum+=x\r\n ans+=1\r\nprint(ans)\r\n", "n,k=list(map(int,input().split()))\r\np=list(map(int,input().split()))\r\nl=0\r\nif p[0]%2==0:\r\n l+=1\r\nelse:\r\n l-=1\r\nt=[]\r\npo=[]\r\nx=1\r\nfor item in p[1:len(p)-1]:\r\n if l!=0:\r\n if p[x]%2==0:\r\n l+=1\r\n x+=1\r\n else:\r\n l-=1\r\n x+=1\r\n elif l==0:\r\n t.append(abs(p[x]-p[x-1]))\r\n if p[x]%2==0:\r\n l+=1\r\n x+=1\r\n else:\r\n l-=1\r\n x+=1\r\nif t!=list():\r\n for x in range(len(t)+9999):\r\n if sum(po)<k:\r\n jk=t.index(min(t))\r\n po.append(t[jk])\r\n t[jk]=55555\r\n elif sum(po)==k:\r\n break\r\n else:\r\n po.pop()\r\n break\r\nelse:\r\n pass\r\nif po==list():\r\n print(\"0\")\r\nelse:\r\n print(len(po))\r\n \r\n\r\n ", "from itertools import*\r\nR=lambda:map(int,input().split())\r\nn,b=R()\r\na=[*R()]\r\nc=[0,0]\r\nr=[]\r\nfor x,y in zip(a,a[1:]):\r\n c[x%2]+=1\r\n if c[0]==c[1]:r+=[abs(x-y)]\r\nr.sort()\r\nprint(next((i for i,x in enumerate(accumulate(r))if x>b),len(r)))", "from sys import *\r\nfrom math import *\r\nfrom bisect import *\r\n\r\nn, k = map(int, stdin.readline().split())\r\na = list(map(int, stdin.readline().split()))\r\nod=ev=0\r\nc=[]\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n ev+=1\r\n else:\r\n od+=1\r\n if ev==od and i!=n-1:\r\n c.append(abs(a[i]-a[i+1]))\r\nc.sort()\r\nans=0\r\nfor i in range(len(c)):\r\n if k==0:\r\n break\r\n if k>=c[i]:\r\n k-=c[i]\r\n ans+=1\r\nprint(ans)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ne=o=t=0\r\nl1=[]\r\nfor i in range(n-1):\r\n if(l[i]%2==0):\r\n e+=1\r\n else:\r\n o+=1\r\n if(e==o):\r\n l1.append(abs(l[i]-l[i+1]))\r\n e=o=0\r\nl1=sorted(l1)\r\ns=mc=0\r\nfor i in l1:\r\n s+=i\r\n if(s<=k):\r\n mc+=1\r\nprint(mc)\r\n\r\n\r\n", "n,b = map(int,input().split())\r\na = list(map(int,input().split()))\r\nlis = list()\r\neven = 0\r\nodd = 0\r\nfor i in range(0,n-1):\r\n if a[i]&1: odd+=1\r\n else: even+=1\r\n \r\n if odd == even: \r\n val = abs(a[i+1]-a[i])\r\n lis.append(val)\r\n \r\n\r\nlis.sort()\r\n\r\nans = 0\r\ncnt = 0\r\nfor item in lis:\r\n ans+=item\r\n if ans>b: break\r\n cnt+=1\r\nprint(cnt)", "n,b = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nif n <= 2:\r\n\tprint(0)\r\nelse:\r\n\tl = []\r\n\tv = 0\r\n\tl1= [0,0]\r\n\r\n\tfor i in range(1,n-2,2):\r\n\t\tl1[arr[i]%2] += 1\r\n\t\tl1[arr[i-1]%2] += 1\r\n\t\tif l1[0] == l1[1]:\r\n\t\t\t\r\n\t\t\tl1 = [0,0]\r\n\t\t\tl.append(abs(arr[i+1]- arr[i]))\r\n\t\t\r\n\r\n\tl.sort()\r\n\tcut = 0\r\n\t# print(l)\r\n\twhile(cut < len(l) and b - l[cut] >= 0 ):\r\n\t\tb = b - l[cut]\r\n\t\tcut += 1\r\n\tprint(cut) ", "def cut(lst,l,r,t):\r\n jishu = 0\r\n oushu = 0\r\n if l == r:\r\n return t\r\n for i in range(l,r+1):\r\n if lst[i]%2 == 0:\r\n oushu +=1\r\n else:\r\n jishu +=1\r\n if oushu == jishu and i!=r:\r\n t.append(abs(lst[i]-lst[i+1]))\r\n return cut(lst,i+1,r,t)\r\n return\r\nn,b = map(int,input().split())\r\nlst = list(map(int,input().split()))\r\nt =[]\r\ncut(lst,0,n-1,t)\r\nt.sort()\r\nsumnum = 0\r\nnum = 0\r\nfor i in range(len(t)):\r\n sumnum+=t[i]\r\n if sumnum > b:\r\n break\r\n num+=1\r\nprint(num)\r\n\r\n\r\n ", "mod = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn,b=f()\r\nl=il()\r\nes=[0]\r\nos=[0]\r\ncl=[]\r\nfor i in l:\r\n if i&1:\r\n os.append(os[-1]+1)\r\n es.append(es[-1])\r\n else:\r\n os.append(os[-1])\r\n es.append(es[-1]+1)\r\nfor i in range(1,n):\r\n if es[i]==os[i]:\r\n cl.append(abs(l[i]-l[i-1]))\r\ncl.sort()\r\nc=0\r\nfor i in cl:\r\n if i<=b:\r\n b-=i\r\n c+=1\r\nprint(c)", "n,k=list(map(int,input().split()))\r\nm=list(map(int,input().split()))\r\na=[]\r\np=0\r\nfor i in range(n):\r\n if(m[i]%2):\r\n p+=1\r\n elif(m[i]%2==0):\r\n p-=1\r\n if(p==0 and i!=n-1):\r\n a.append(abs(m[i+1]-m[i]))\r\nif p==0:\r\n a.sort()\r\n l=0\r\n for i in range(len(a)):\r\n if(k>=a[i]):\r\n k-=a[i]\r\n l+=1\r\n else:\r\n break\r\n print(l)\r\nelse:\r\n print(0)", "def evenOdd(x):\r\n global even, odd\r\n if x % 2 == 0: even += 1\r\n else: odd += 1\r\n\r\nn, bitcoin = list(map(int, input().split()))\r\n\r\narr = list(map(int, input().split()))\r\n\r\neven = 0; odd = 0; summ = 0\r\nevenOdd(arr[0])\r\ncuts = []\r\nfor i in range(1, len(arr)-1):\r\n evenOdd(arr[i])\r\n if even == odd and abs(arr[i+1] - arr[i]) <= bitcoin:\r\n \r\n cuts.append(abs(arr[i+1] - arr[i]))\r\ncuts.sort()\r\nc = 0\r\nfor i in cuts:\r\n if summ + i <= bitcoin:\r\n summ+=i\r\n c += 1\r\n else: break\r\nprint(c)\r\n", "n,b = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\ndef isequal(c):\r\n\tk = len(c)\r\n\tcount = 0\r\n\tfor i in c:\r\n\t\tif i%2==0:\r\n\t\t\tcount+=1\r\n\treturn count == k/2\r\n\r\n\r\n\r\nif n <=3 or n%2 ==1:\r\n\tprint(0)\r\n\r\nelse:\r\n\ttemp = []\r\n\tfor i in range(1,n-1,2):\r\n\t\tif isequal(a[:i+1]) and isequal(a[i+1:]):\r\n\t\t\ttemp.append(abs(a[i]-a[i+1]))\r\n\tif sum(temp)<=b:\r\n\t\tprint(len(temp))\r\n\telse:\r\n\t\tcount = 0\r\n\t\ttemp.sort()\r\n\t\tsum1 = 0\r\n\t\tfor i in temp:\r\n\t\t\tsum1+=i\r\n\t\t\tif sum1<=b:\r\n\t\t\t\tcount+=1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\tprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,b=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nc_even,c_odd=0,0\r\narr1=[]\r\nfor i in range(n-1):\r\n if arr[i]%2==0:\r\n c_even+=1\r\n if arr[i]%2!=0:\r\n c_odd+=1\r\n if c_even==c_odd and abs(arr[i]-arr[i+1])<=b:\r\n arr1.append(abs(arr[i]-arr[i+1]))\r\ncount=0\r\narr1.sort()\r\nfor i in range(len(arr1)):\r\n if b-arr1[i]>=0:\r\n b-=arr1[i]\r\n count+=1\r\n else:\r\n break\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "l, b = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nchet = 0\r\nnechet = 0\r\nrz = []\r\nfor i in range(l-2):\r\n if c[i]%2 == 0:\r\n chet+=1\r\n else:\r\n nechet+=1\r\n if chet == nechet:\r\n chet = 0\r\n nechet = 0\r\n rz.append(abs(c[i]-c[i+1]))\r\nans = 0\r\nrz.sort()\r\nfor i in rz:\r\n if b-i>=0:\r\n ans+=1\r\n b-=i\r\n else:\r\n break\r\nprint(ans)", "inp = list(map(int,input().split()))\r\nn=inp[0]\r\nb=inp[1]\r\ninp = list(map(int,input().split()))\r\nx=[]\r\neven=0\r\nodd=0\r\nfor i in range(n):\r\n if(inp[i]%2==1):\r\n odd+=1\r\n else:\r\n even+=1\r\n if(odd==even):\r\n if(i!=n-1):\r\n x.append(abs(inp[i+1]-inp[i]))\r\nx.sort()\r\nsumi=0\r\nk=0\r\nwhile(sumi<=b and k<len(x)):\r\n sumi+=x[k]\r\n k+=1\r\nif(sumi>b):\r\n k=k-1\r\nprint (k)", "n, b = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ns = 0\r\nprices = []\r\nfor i in range(n):\r\n if a[i] % 2 == 0:\r\n s += 1\r\n else:\r\n s -= 1\r\n if s == 0 and i != n - 1:\r\n prices.append(abs(a[i] - a[i + 1]))\r\nprices.sort()\r\nk = 0\r\nsm = 0\r\nfor i in range(len(prices)):\r\n sm += prices[i]\r\n k += 1\r\n \r\n if sm > b:\r\n k -= 1\r\n break\r\nprint(k)\r\n" ]

[ "from heapq import *\r\nfrom collections import defaultdict\r\ndef D(v,g):\r\n\th,p,o=[],defaultdict(lambda:1e99),[]\r\n\theappush(h,(0,v))\r\n\twhile h:\r\n\t\tl,w=heappop(h)\r\n\t\tif w in p:continue\r\n\t\tp[w]=l\r\n\t\to.append(w)\r\n\t\tfor u,L in g[w]:\r\n\t\t\theappush(h,(L+l,u))\r\n\treturn p,o\r\nn,m,s,t=map(int,input().split())\r\nr=[]\r\ng={i+1:[] for i in range(n)}\r\nG={i+1:[] for i in range(n)}\r\nfor _ in range(m):\r\n\ta,b,l=map(int,input().split())\r\n\tr.append((a,b,l))\r\n\tg[a].append((b,l))\r\n\tG[b].append((a,l))\r\nS,o=D(s,g)\r\nT,_=D(t,G)\r\nL=S[t]\r\nH={v:[w for w,l in e if S[v]+T[w]+l==L] for v,e in g.items()}\r\nB,A=set(),{s}\r\nfor v in o:\r\n\tif not H[v]:continue\r\n\tif 1==len(A)==len(H[v]):B.add(v)\r\n\tA.update(H[v])\r\n\tA.remove(v)\r\nprint('\\n'.join(\"YES\" if a in B and S[a]+T[b]+l==L else \"CAN \"+str(S[a]+T[b]+l-L+1) if S[a]+T[b]+1<L else \"NO\" for a,b,l in r))", "#!/usr/bin/env python3\nimport heapq\nINF = int(1e18)\nMOD = (1 << 64) - 1\n\n\nclass MinHeap:\n def __init__(self): self.h = []\n def push(self, x): heapq.heappush(self.h, x)\n def pop(self): return heapq.heappop(self.h)\n def isEmpty(self): return len(self.h) == 0\n\n\ndef add(x, y): return x + y - MOD if x + y >= MOD else x + y\ndef mul(x, y): return x * y % MOD\n\n\ndef go(adj, src):\n n = len(adj)\n frontier = MinHeap()\n ways = [0] * n\n cost = [INF] * n\n\n frontier.push((0, src))\n ways[src] = 1\n cost[src] = 0\n while not frontier.isEmpty():\n c, u = frontier.pop()\n if c > cost[u]:\n continue\n for v, w in adj[u]:\n if c + w < cost[v]:\n ways[v] = ways[u]\n cost[v] = c + w\n frontier.push((c + w, v))\n elif c + w == cost[v]:\n ways[v] = add(ways[v], ways[u])\n\n return cost, ways\n\n\nn, m, s, t = map(int, input().split())\ns -= 1\nt -= 1\nadj = [[] for i in range(n)]\nadj_transpose = [[] for i in range(n)]\nedges = []\nfor i in range(m):\n u, v, w = map(int, input().split())\n u -= 1\n v -= 1\n edges.append((u, v, w))\n adj[u].append((v, w))\n adj_transpose[v].append((u, w))\n\ncost_s, ways_s = go(adj, s)\ncost_t, ways_t = go(adj_transpose, t)\n\nshortest_path = cost_s[t]\n\nfor i in range(m):\n u, v, w = edges[i]\n cost = cost_s[u] + cost_t[v] + w\n if cost > shortest_path:\n fix_cost = cost - shortest_path + 1\n w -= cost - shortest_path + 1\n print(f\"CAN {fix_cost}\" if w >= 1 else \"NO\")\n else:\n if ways_s[t] == mul(ways_s[u], ways_t[v]):\n print(\"YES\")\n else:\n print(\"CAN 1\" if w > 1 else \"NO\")" ]

[ "import sys\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRILST = lambda: list(RI())\r\n\r\ndef find(x):\r\n # 不会被卡爆栈的并查集find函数 省空间\r\n t = x\r\n while fa[x] != x:\r\n x = fa[x]\r\n while t != x:\r\n fa[t], t = x, fa[t]\r\n return x\r\n\r\nn, = RI()\r\na = RILST()\r\n\r\nmns = [[] for _ in range(10**6 + 1)]\r\nmis = [[] for _ in range(10**6 + 1)]\r\nfor _ in range(n - 1):\r\n u,v = RILST()\r\n u -= 1\r\n v -= 1\r\n if a[u] > a[v]:\r\n u,v = v,u\r\n mns[a[v]].append((u,v))\r\n mis[a[u]].append((v,u))\r\n\r\nfa = [i for i in range(n)]\r\nval = [1]*n\r\n\r\n\r\nans = 0\r\nfor i in range(10**6 + 1):\r\n for u,v in mns[i]:\r\n fu = find(u)\r\n fv = find(v)\r\n if fu == fv:\r\n continue\r\n fa[fu] = fv\r\n ans += val[fu]*val[fv]*i\r\n val[fv] += val[fu]\r\n\r\n # print(ans)\r\nfa = [i for i in range(n)]\r\nval = [1]*n\r\nfor i in range(10**6,-1,-1):\r\n for u,v in mis[i]:\r\n fu = find(u)\r\n fv = find(v)\r\n if fu == fv:\r\n continue\r\n fa[fu] = fv\r\n ans -= val[fu]*val[fv]*i\r\n val[fv] += val[fu]\r\nprint(ans)", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef solve():\r\n n = int(input())\r\n MAX = 10 ** 6\r\n mx = [[] for _ in range(MAX+1)]\r\n mn = [[] for _ in range(MAX+1)]\r\n a = list(map(int, input().split()))\r\n for _ in range(n-1):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n if a[u] > a[v]:\r\n u, v = v, u\r\n mn[a[u]].append((u, v))\r\n mx[a[v]].append((u, v))\r\n\r\n res = 0\r\n def find(x):\r\n t = x\r\n while fa[x] != x:\r\n x = fa[x]\r\n while t != x:\r\n fa[t], t = x, fa[t]\r\n return x\r\n fa = list(range(n))\r\n size = [1] * n\r\n for w, e in enumerate(mx):\r\n for u, v in e:\r\n u, v = find(u), find(v)\r\n res += w * size[u] * size[v]\r\n size[v] += size[u]\r\n fa[u] = v\r\n fa = list(range(n))\r\n size = [1] * n\r\n for w in range(MAX, -1, -1):\r\n for u, v in mn[w]:\r\n u, v = find(u), find(v)\r\n res -= w * size[u] * size[v]\r\n size[v] += size[u]\r\n fa[u] = v\r\n print(res)\r\n\r\nsolve()\r\n\r\n\r\n\r\n" ]

[ "# LUOGU_RID: 112089745\na, b, c, d, e, f = map(int, input().split());\r\nif a * c * e < b * d * f or a == 0 and b * d > 0 or c == 0 and d > 0:\r\n print(\"Ron\");\r\nelse:\r\n print(\"Hermione\");", "a, b, c, d, e, f = [int(x) for x in input().split()]\n\ndef main(a, b, c, d, e, f):\n if d == 0:\n return 'Hermione'\n if c == 0:\n return 'Ron'\n if b == 0:\n return 'Hermione'\n if a == 0:\n return 'Ron'\n if f == 0:\n return 'Hermione'\n if e == 0:\n return 'Ron'\n if b * (d / c) * (f / e) > a:\n return 'Ron'\n return 'Hermione'\n\nprint(main(a, b, c, d, e, f))\n", "a,b,c,d,e,f = map(int,input().split())\r\nif (a * c * e < b * d * f)or(a == 0 and b * d > 0)or(c == 0)and d > 0:\r\n print('Ron')\r\nelse:\r\n print('Hermione')", "a, b, c, d, e, f = [int(i) for i in input().split()]\r\n\r\nif a*c*e < b*d*f or (c == 0 and d > 0) or (a == 0 and b > 0 and d > 0):\r\n print('Ron')\r\nelse:\r\n print('Hermione')\r\n", "# LUOGU_RID: 103538147\na,b,c,d,e,f=map(int,input().split())\r\nif a==0 and b*d!=0: print(\"Ron\")\r\nelif c==0 and d>0: print(\"Ron\")\r\nelif a*c*e<b*d*f: print(\"Ron\")\r\nelse: print(\"Hermione\")", "def main():\n a, b, c, d, e, f = map(int, input().split())\n if c:\n c *= a\n d *= b\n if c:\n c *= e\n d *= f\n print((\"Hermione\", \"Ron\")[c < d])\n\n\nif __name__ == '__main__':\n main()\n", "a, b, c, d, e, f = map(int, input().split());\r\nif ((a * c * e < b * d * f) or ((a == 0) and (b * d > 0)) or ((c == 0) and (d > 0))) : print(\"Ron\");\r\nelse : print(\"Hermione\");", "\r\noro_infinito = False\r\n\r\ndatos = input().split()\r\na = int(datos[0])\r\nb = int(datos[1])\r\nc = int(datos[2])\r\nd = int(datos[3])\r\ne = int(datos[4])\r\nf = int(datos[5])\r\n\r\nif a != 0 and b != 0 and c != 0 and d != 0 and e != 0 and f != 0:\r\n if (b/a) * (d/c) * (f/e) > 1:\r\n oro_infinito = True\r\nelse:\r\n if c == 0 and d > 0:\r\n oro_infinito = True\r\n elif a == 0 and b > 0 and c > 0 and d > 0:\r\n oro_infinito = True\r\n elif e == 0 and f > 0 and a > 0 and b > 0 and c > 0 and d > 0:\r\n oro_infinito = True\r\n\r\nif oro_infinito:\r\n print('Ron')\r\nelse:\r\n print('Hermione')\r\n ", "a,b,c,d,e,f = map(int, input().split())\r\nif a*e*c< f*d*b or (c == 0 and d) or (a == 0 and b and d):\r\n print(\"Ron\")\r\nelse:\r\n print(\"Hermione\")", "a, b, c, d, e, f = map(int, input().split())\r\nif (b * d * f > a * c * e) or (c == 0 and d > 0) or (a == 0 and b != 0 and d != 0) or (e == 0 and f > 0 and d > 0 and b > a):\r\n\tprint('Ron')\r\nelse:\r\n\tprint('Hermione')", "a,b,c,d,e,f = map(int, input().split())\r\nif d == 0:\r\n print('Hermione')\r\nelif d != 0 and c==0:\r\n print('Ron')\r\nelif d != 0 and c!=0 and b==0:\r\n print('Hermione')\r\nelif d != 0 and c!=0 and b!=0 and a==0:\r\n print('Ron')\r\nelif d != 0 and c!=0 and b!=0 and a!=0 and f==0:\r\n print('Hermione')\r\nelif d != 0 and c!=0 and b!=0 and a!=0 and f!=0 and e==0 :\r\n print('Ron')\r\nelse:\r\n b_a = b/a\r\n d_c = d/c\r\n f_e = f/e\r\n if b_a * d_c * f_e > 1:\r\n print('Ron')\r\n else:\r\n print('Hermione')", "sand_in, lead_out, lead_in, gold_out, gold_in, sand_out = map(int,\n input().split())\ndef ron():\n print('Ron')\n import sys; sys.exit()\n\nif lead_out * gold_out * sand_out > sand_in * lead_in * gold_in:\n ron()\n\nif gold_out > 0:\n if lead_in == 0:\n ron()\n if lead_out > 0:\n if sand_in == 0:\n ron()\n if sand_out > 0:\n if gold_in == 0:\n ron()\n\nprint('Hermione')\n\n", "t = list(map(int, input().split()))\r\nf0 = 3\r\nwhile t[f0] != 0:\r\n f0 = (f0 + 5) % 6\r\n if f0 == 3:\r\n break\r\nif f0 % 2 == 0:\r\n print('Ron')\r\n exit()\r\nnum = t[1] * t[3] * t[5]\r\nden = t[0] * t[2] * t[4]\r\nif num > den:\r\n print('Ron')\r\nelse:\r\n print('Hermione')", "from functools import reduce\r\nfrom operator import mul\r\n\r\nc = list(map(int, input().split()))\r\nr, h = reduce(mul, c[1::2], 1), reduce(mul, c[0::2], 1)\r\nrw = r > h or (c[2] == 0 and c[3] != 0) or (c[0] == 0 and c[1] * c[3] != 0)\r\nprint(\"Ron\" if rw else \"Hermione\")", "a, b, c, d, e, f = map(int, input().split())\r\nprint('Ron' if a * e * c < f * d * b or (c == 0 and d) or (a == 0 and b and d) else 'Hermione')", "a,b,c,d,e,f=map(int,input().split())\r\nif (c==0 and d!=0):\r\n print(\"Ron\")\r\nelif (d==0 or b==0):\r\n print(\"Hermione\")\r\nelif (f==0 and a==0):\r\n print(\"Ron\")\r\nelif (f==0 and a!=0):\r\n print(\"Hermione\")\r\nelif (b*d*f>a*c*e):\r\n print(\"Ron\")\r\nelse:\r\n print(\"Hermione\")", "# LUOGU_RID: 104745220\na, b, c, d, e, f = map(int, input().split())\r\nprint((a * e * c < f * d * b or not c and d\r\n or not a and b and d) and 'Ron' or 'Hermione')\r\n", "a, b, c, d, e, f = map(int, input().split())\r\n\r\nif a*e*c < f*d*b or (c == 0 and d) or (a == 0 and b and d):\r\n print(\"Ron\")\r\n\r\nelse:\r\n print(\"Hermione\")\r\n", "# вводим количество песка, свинца, золота\r\na, b, c, d, e, f = map(int, input().split())\r\n\r\n# проверяем условие неограниченного увеличения песка и золота\r\nif a*c*e<b*d*f :\r\n print('Ron')\r\n# проверки нулевых числителей / знаменателей\r\nelif c==0 and d!=0 :\r\n print('Ron')\r\nelif a==0 and b!=0 and d!=0:\r\n print('Ron')\r\nelse :\r\n print('Hermione')\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\nA,B,C,D,E,F = map(int,input().split())\n\nif (C==0 and D!=0):\n print(\"Ron\")\nelif (D==0 or B==0):\n print(\"Hermione\")\nelif (F==0 and A==0):\n print(\"Ron\")\nelif (F==0 and A!=0):\n print(\"Hermione\")\nelif (B*D*F>A*C*E):\n print(\"Ron\")\nelse:\n print(\"Hermione\")", "a, b, c, d, e, f = map(int, input().split())\r\nif ((b * d * f > a * c * e) or (c == 0 and d != 0) or (a == 0 and b != 0 and d != 0) ) and d != 0 :\r\n\tprint(\"Ron\")\r\nelse :\r\n\tprint(\"Hermione\")" ]

[ "import sys\ninput = sys.stdin.readline\n\ndef put():\n return map(int, input().split())\n\n\n\n\ndef dfs0(x):\n s = [x]\n vis = [0] * n\n ans = ['+'] * m\n vis[x] = 1\n while s:\n i = s.pop()\n for j, k in graph[i]:\n if (vis[j] == 0):\n if (k < 0):\n ans[-k - 1] = '-'\n elif (k > 0):\n ans[k - 1] = '+'\n \n \n s.append(j)\n vis[j] = 1\n\n return ''.join(ans), sum(vis)\n\ndef dfs1(x):\n s = [x]\n vis = [0] * n\n ans = ['+'] * m\n vis[x] = 1\n while s:\n i = s.pop()\n for j, k in graph[i]:\n if (vis[j] == 0):\n if (k < 0):\n ans[-k - 1] = '+'\n elif (k > 0):\n ans[k - 1] = '-'\n if (k == 0):\n s.append(j)\n vis[j] = 1\n\n return ''.join(ans), sum(vis)\n\n \n\n \n\n\n\n\nn,m,s = put()\ngraph = [[] for i in range(n)]\n\nk = 1\n\nfor _ in range(m):\n z,x,y = put()\n x,y = x - 1, y - 1\n if (z == 1):\n graph[x].append((y, 0))\n else:\n graph[x].append((y, k))\n graph[y].append((x, -k))\n k += 1\n\nm = k - 1\nx, y = dfs0(s - 1)\nprint(y)\nprint(x)\nx, y = dfs1(s - 1)\nprint(y)\nprint(x)\n\n", "def put():\n return map(int, input().split())\n\ndef dfs(x,flag=1):\n s,vis,ans = [x],[0]*n,['+']*m\n vis[x]= 1\n while s:\n i = s.pop()\n for j,k in graph[i]:\n if vis[j]==0:\n if k*flag<0:\n ans[abs(k)-1]='-'\n elif k*flag>0:\n ans[abs(k)-1]='+'\n if flag==1 or k==0:\n s.append(j)\n vis[j]=1\n return ''.join(ans), sum(vis)\n\nn,m,s = put()\ngraph = [[] for i in range(n)]\nk=1\nfor _ in range(m):\n z,x,y = put()\n x,y = x-1,y-1\n if z==1:\n graph[x].append((y, 0))\n else:\n graph[x].append((y, k))\n graph[y].append((x,-k))\n k+=1\nm = k-1\nx,y = dfs(s-1, 1)\nprint(y)\nprint(x)\nx,y = dfs(s-1,-1)\nprint(y)\nprint(x)\n" ]

[ "print(*{'1','2','3'}.difference(set(input().split())))\n", "a = [int(i) for i in input().split()]\r\nprint(6-a[0]-a[1])\r\n", "print(list({1, 2, 3}.difference({int(i) for i in input().split()}))[0])", "print(*set(\"123\")-set(input()))", "a, b = map(int,input().split())\r\nprint(6-a-b)", "a,b=map(int,input().split())\r\nc=6-a-b\r\nprint(c)\r\n", "a, b = map(int, input().split())\r\nnumbers = 3+2+1\r\nc = numbers - a - b\r\nprint(c)\r\n", "print(*{1, 2, 3} - set(map(int, input().split())))", "a, b = map(int, input().split())\r\nif a != 1 and b!= 1:\r\n print(1)\r\nelif a != 2 and b != 2:\r\n print(2)\r\nelse:\r\n print(3)", "def read_ints():\r\n return [int(x) for x in input(' ').split()]\r\n\r\n\r\ndef main():\r\n a, b = read_ints()\r\n print(({1, 2, 3}.difference({a, b})).pop())\r\n\r\nif __name__ == '__main__':\r\n main()", "a, b = map(int, input().split())\r\nfor i in range(1, 4):\r\n if(i != a and i != b):\r\n print (i)", "inp=input()\r\nprint(6-int(inp[0])-int(inp[2]))\r\n", "a, b = map(int, input().split())\r\nA = [a, b]\r\nif not(1 in A):\r\n print(1)\r\nelif not(2 in A):\r\n print(2)\r\nelse:\r\n print(3) ", "bros = set(map(lambda x: x+1, range(3)))\n\na, b = map(lambda x: int(x), input().split())\nbros.remove(a)\nbros.remove(b)\nprint(bros.pop())", "a = [0,0,0]\r\ninp = input()\r\ninp = inp.split()\r\na[int(inp[0]) - 1] += 1\r\na[int(inp[1]) - 1] += 1\r\nfor i in range(len(a)):\r\n if a[i] == 0:\r\n print(i + 1)\r\n", "print(6-sum(map(int,input().split())))", "a, b = [int(x) for x in input().split()]\r\nfor i in range(1, 4):\r\n if i != a and i != b:\r\n print(i)", "a=set(map(int,input().split()))\r\nb=()\r\nfor i in range(1,4):\r\n if i not in a:\r\n print(i)\r\n", "a = {1,2,3}\r\nx = set(map(int,input().split()))\r\nb = list(a-x)\r\nprint(b[0])", "print(6 - sum(list(map(int, input().split()))))\r\n", "inStr = input()\r\na,b=inStr.split()\r\nprint(6-int(a)-int(b))\r\n", "a,b=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=None\r\nif a==1 and b==2:\r\n c=3\r\n print(c)\r\nif a==2 and b==1:\r\n c=3\r\n print(c)\r\nif a==3 and b==2:\r\n c=1\r\n print(c)\r\nif a==2 and b==3:\r\n c=1\r\n print(c)\r\nif a==1 and b==3:\r\n c=2\r\n print(c)\r\nif a==3 and b==1:\r\n c=2\r\n print(c)", "a,b = map(int, input().split())\r\nc = a + b\r\nif c == 3:\r\n print(3)\r\nelif c == 4:\r\n print(2)\r\nelif c == 5:\r\n print(1)", "l = list(map(int, input().split()))\r\nif 1 not in l:\r\n print(1)\r\nif 2 not in l:\r\n print(2)\r\nif 3 not in l:\r\n print(3)", "a, b = map(int, input().split())\r\np = [1, 2, 3]\r\np.remove(a)\r\np.remove(b)\r\nprint(p[0])\r\n", "a, b = map(int, input().split())\r\n\r\nif a == 1:\r\n if b == 2:\r\n print(3)\r\n else:\r\n print(2)\r\nelif a == 2:\r\n if b == 1:\r\n print(3)\r\n else:\r\n print(1)\r\nelse:\r\n if b == 1:\r\n print(2)\r\n else:\r\n print(1)\r\n", "a = input('')\r\nif (a == '2 1') or (a == '1 2'):\r\n print('3')\r\nif (a == '2 3') or (a == '3 2'):\r\n print('1')\r\nif (a == '1 3') or (a == '3 1'):\r\n print('2')", "a,b = map(int,input().split())\r\nc = []\r\nc.append(a)\r\nc.append(b)\r\nc.sort()\r\nif c[0] == 1 and c[1]==2:\r\n print('3')\r\nelif c[0] ==1 and c[1] == 3:\r\n print('2')\r\nelif c[0] ==2 and c[1] == 3:\r\n print('1')\r\n", "v=input()\r\na=int(v[0])\r\nb=int(v[2])\r\nprint(6-a-b)\r\n", "brat = [1, 2, 3]\r\na, b = (int(i) for i in input().split())\r\nbrat.remove(a)\r\nbrat.remove(b)\r\nprint(brat[0])", "pr = [str(i) for i in input().split()];\r\nbro = [\"1\",\"2\",\"3\"];\r\nbro.remove(pr[0]);\r\nbro.remove(pr[1]);\r\nprint(bro[0]);", "n,k=(int(z) for z in input().split())\r\nprint(6-n-k)", "a , b = input().split()\r\nprint( 6 - (int(a) + int(b)) )\r\n", "a,b = input().split()\r\nprint(6-int(a)-int(b))\r\n", "a = ['1', '2', '3']\r\nx, y = input().split()\r\nfor i in range(3):\r\n if (a[i] != x) and (a[i] != y):\r\n z = a[i]\r\nprint(z)", "s=[1,2,3]\r\na,b=map(int,input().split())\r\ns.remove(a)\r\ns.remove(b)\r\nprint(*s)\r\n", "a,b=map(int,input().split())\r\nprint(6-a-b)\r\n", "a,b = input().split(' ')\r\nprint(str(int(a) ^ int(b)))", "cH = input()\r\na, b = map(int, cH.split())\r\nc = 6 - a - b\r\nprint(c)", "a, b = map(int, input().split())\r\n\r\nprint(sum(i for i in range(1, 4) if i not in (a, b)))", "s = input()\r\nids = s.split(' ')\r\nnormal_ids = ['1','2','3']\r\nnormal_ids.remove(ids[0])\r\nnormal_ids.remove(ids[1])\r\nprint(normal_ids[0])", "a, b = input().split()\r\nif int(a)+int(b)==3:\r\n print('3')\r\nif int(a)+int(b)==4:\r\n print('2')\r\nif int(a)+int(b)==5:\r\n print('1')", "A = {1, 2, 3}\r\nB = set (map (int, input().split()))\r\nprint(*A.difference(B))", "a, b = map(int, input().split())\r\nfor i in range(1, 4):\r\n if (i != a and i != b):\r\n print(i)\r\n break", "a, b=list(map(int, input().split()))\r\nq=list({1, 2, 3}-{a, b})[0]\r\nprint(q)", "k = {1, 2, 3}\nr = set([int(s) for s in input().split()])\nprint(*(k-r))\n", "n,m = map(int,input().split(' '));print(6-(m+n));", "print(6-sum(list(map(int,input().split()))))", "x = input()\r\nif x.find('1') == -1:\r\n print(1)\r\nif x.find('2') == -1:\r\n print(2)\r\nif x.find('3') == -1:\r\n print(3)\r\n", "a, b = list(map(int,input().split()))\n\ns = a + b\nc = 6\nprint(c-s)\n\n", "a, b = list (map(int,input().split()))\r\nif (a==1 or b==1) and (a==2 or b==2):\r\n print (3)\r\nelif (a==1 or b==1) and (a==3 or b==3):\r\n print (2)\r\nelse:\r\n print(1)\r\n", "a, b = set(map(int, input().split()))\r\nprint(*({1, 2, 3} ^ {a, b}))\r\n", "m,n = map(int,input().split())\r\nif (m + n) != 3:\r\n print(abs(m-n))\r\nelse:\r\n print(m+n)\r\n", "a, b = map(int, input().split())\r\nif a == 1 and b == 2 or a == 2 and b == 1:\r\n print(3)\r\nelif a == 3 and b == 1 or a == 1 and b == 3 :\r\n print(2)\r\nelif a == 2 and b == 3 or a == 3 and b == 2 :\r\n print(1)\r\nelse :\r\n print(0)", "s = 6\r\nx1, x2 = input().split()\r\nx1, x2 = int(x1), int(x2)\r\nprint(s-x1-x2)", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = 6- (a+b)\r\nprint(c)\r\n ", "a,b=[int(i) for i in input().split()]\r\nprint(6-a-b)\r\n" ]

[ "import string\r\n\r\na , b = map(int , input().split())\r\ns = input()\r\n\r\nf = True\r\nfor i in string.ascii_lowercase:\r\n if s.count(i) > b:\r\n f = False\r\n break\r\n\r\n\r\nif f: print(\"YES\")\r\nelse: print(\"NO\")", "n,k=map(int,input().split())\r\ns=input()\r\nd=dict()\r\nfor i in s:\r\n d[i]=d.get(i,0)+1\r\nm=0\r\nfor _,i in d.items():\r\n m=max(m,i)\r\nif(m>k):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n ", "n, k = map(int, input().split())\r\ns, a = input(), []\r\nb = [x for x in s]\r\nfor i in set(b):\r\n a.append(s.count(i))\r\nprint(\"YES\" if k >= max(a) else \"NO\")", "baloons, friends = map(int,input().split())\r\ncolors = input()\r\na = {}\r\n\r\nfor i in colors:\r\n a[i] = a.get(i, 0) + 1\r\n\r\nif max(a.values()) > friends:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n", "# Generous Kefa\ndef balloons(s, k):\n for i in s:\n x = s.count(i)\n if x > k:\n return \"NO\"\n return \"YES\"\n\n\nn, k = list(map(int, input().split()))\ns = input()\nprint(balloons(s, k))\n", "n, k = map(int, input().split())\r\ns = input()\r\ncount = [0] * 26\r\nfor i in s:\r\n nomer = ord(i) - 97\r\n count[nomer] += 1\r\n\r\nif max(count) > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "ballons, friends = map(int, input().split())\r\ncolor = input()\r\nlencolor = len(color)\r\nx = 0\r\ncount = [0] * 26 # букв всего 26б значит и индекс не мсжет быть болше 26\r\n# tkcb кол-во одного цвета больше чем друзейб кто-то получит два одного цвета\r\nfor i in color:\r\n nomer = ord(i) - 97\r\n count[nomer] += 1 # индексы плюсуются\r\nfor i in range(26):\r\n if count[i] > friends:\r\n # print(chr(i + 97), count[i])\r\n # elif count[i] > friends:\r\n x += 1\r\nif x > 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n,k = input().split()\nn,k = map(int,[n,k])\ns = input()\nA = []\nfor i in s:\n A.append(i)\nn1 = A.count(max(set(A),key = A.count))\n#print(n1)\nif n1 >k:\n print('NO')\nelse:\n print('YES')", "n,k=map(int,input().split())\r\nS=input()\r\na=list(map(str,str(S)))\r\nc={}\r\nfor i in a:\r\n c.setdefault(i,0)\r\n if i in c:\r\n c[i]+=1\r\ncount=0\r\nfor i in c:\r\n if c[i]<=k:\r\n pass\r\n else:\r\n count+=1\r\nif count==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\ns = input()\n\nd = {}\nfor s_i in s:\n if s_i in d:\n d[s_i] += 1\n else:\n d[s_i] = 1\n\ncan = True\nfor _, value in d.items():\n if value > k:\n can = False\n break\n\nif can:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "\r\nn, k = map(int, input().split())\r\nl = list(input())\r\nlp = []\r\nse = list(set(l))\r\nfor i in se:\r\n\tlp.append(l.count(i))\r\n\r\nif max(lp) > k:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "n,k=map(int,input().split())\r\nlst=[]\r\ns=input()\r\nflag=True\r\nfor i in s:\r\n if(s.count(i)>k):\r\n flag=False\r\n break\r\nprint(\"YES\" if flag else \"NO\")\r\n ", "line = input().split(\" \")\nn, k = (int(line[0]), int(line[1]))\n\ncharacters = input()\n\ncounter = {}\n\nfor c in characters:\n if c in counter:\n counter[c] += 1\n if counter[c] > k:\n print(\"NO\")\n exit()\n else:\n counter[c] = 1\n\nprint(\"YES\")", "def check():\r\n\tfor i in range(26):\r\n\t\tif s.count( chr(97+i) ) > k:\r\n\t\t\treturn False\r\n\treturn True\r\n\r\nn , k = map(int,input().split())\r\ns = input()\r\nif check():\r\n\tprint(\"YES\")\r\nelse:print(\"NO\")", "n, k = map(int, input().split())\r\ns = input()\r\nd = dict()\r\nm = len(s) // k\r\nfor i in range(n):\r\n if s[i] in d:\r\n d[s[i]] += 1\r\n else:\r\n d[s[i]] = 1\r\ns = 0\r\nfor key in d:\r\n d[key] -= min(d[key], k)\r\n s += d[key]\r\nif s > 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "bl,fr=map(int,input().split())\r\ncolr=[c for c in input().replace('',' ').strip().split()]\r\nchd,numbr,toP=[],[],0\r\nfor i in colr:\r\n if i not in chd:\r\n chd+=[i]\r\n if colr.count(i)<=fr:\r\n numbr+=[colr.count(i)]\r\n else:\r\n toP=1\r\n break\r\nprint('NO' if toP==1 else 'YES')", "l1 = [int(x) for x in input().split()]\r\nn = l1[1]\r\nl2 = list(input())\r\ndone=0\r\nfor x in list(set(l2)):\r\n if l2.count(x)>n:\r\n done=1\r\n break\r\nif done:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k=map(int,input().split())\r\na=input()\r\nm=[0]*26\r\np=0\r\nfor i in a:\r\n h=ord(i)-ord('a')\r\n m[h]+=1\r\nfor i in m:\r\n if i>k:\r\n p=1\r\n break\r\nif p==1:\r\n print('No')\r\nelse:\r\n print('Yes')", "from collections import Counter\r\nn,k=map(int,input().split())\r\ns=input()\r\nl=list(Counter(s).values())\r\nif max(l)<=k:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n, k = [int(_) for _ in input().split()]\r\ns = input()\r\n\r\ncount = [s.count(x) for x in 'qwertyuiopasdfghjklzxcvbnm']\r\nif max(count) > k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\ns = list(input())\r\nt = list(set(s))\r\nans = \"YES\"\r\nfor i in t:\r\n if s.count(i) > k:\r\n ans = \"NO\"\r\n break\r\nprint(ans)", "balls_quantity, friends_quantity = (int(x) for x in input().split())\r\nballs = [x for x in input()]\r\nballs_set = set(balls)\r\nfor ball in balls_set:\r\n\tif balls.count(ball) > friends_quantity:\r\n\t\tprint('NO')\r\n\t\tbreak\r\nelse:\r\n\tprint('YES')", "n, k = map(int, input().split())\r\ns = input()\r\na = {}\r\nr = 'YES'\r\nfor i in s:\r\n if i in a:\r\n a[i] += 1\r\n else:\r\n a[i] = 1\r\nfor i in a:\r\n if a[i] > k:\r\n r = 'NO'\r\n break\r\nprint(r)", "n, k = map(int,input().split())\r\ns = input()\r\ns1 = set(s)\r\nflag = 0\r\nfor i in s1:\r\n\tc = s.count(i)\r\n\tif c > k:\r\n\t\tflag = 1\r\n\t\tprint(\"no\")\r\n\t\tbreak\r\nif flag == 0:\r\n\tprint(\"yes\")", "n,k = map(int,input().split())\r\ns = input()\r\na = [0]*k\r\ng = 0\r\n\r\nfor i in s:\r\n c = s.count(i)\r\n if g < c:\r\n g = c\r\nif g > k:\r\n print('No')\r\nelse:\r\n print('YES')", "from string import ascii_lowercase\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n s = input()\r\n for c in ascii_lowercase:\r\n if s.count(c) > k:\r\n return 'NO'\r\n return 'YES'\r\n\r\n\r\nprint(solve())", "from collections import defaultdict\r\nn, k = map(int, input().split())\r\ns = input()\r\nrec = defaultdict(int)\r\nfor i in range(n):\r\n rec[s[i]] += 1\r\n\r\nif max(rec.values()) <= k:\r\n print(\"YES\")\r\nelse:\r\n 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 solution(n, k, string):\r\n arr = [0 for _ in range(26)]\r\n for e in string:\r\n diff = ord(e) - ord('a')\r\n arr[diff] += 1\r\n if arr[diff] > k:\r\n return \"NO\"\r\n return \"YES\"\r\n \r\n\r\nn, k = get_ints()\r\nstring = get_string()\r\nprint(solution(n, k, string)) ", "# - CodeForces\r\n# Status: Unsolved\r\n\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef invr():\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\nn, k = invr()\r\ns = insr()\r\n# print(s)\r\n\r\nd = {}\r\n\r\nfor i in s:\r\n # print(i)\r\n if(d.get(i) == None):\r\n d[i] = 1\r\n else:\r\n d[i] += 1\r\n\r\n if(d[i] > k):\r\n print(\"NO\")\r\n sys.exit(0)\r\nprint(\"YES\")\r\n", "n, k = map(int, input().split())\r\nbase = ord('a')\r\ncounts = [0] * 26\r\nmc = 0\r\nfor c in input():\r\n ind = ord(c) - base\r\n counts[ind] += 1\r\n if counts[ind] > mc:\r\n mc = counts[ind]\r\nprint(('NO', 'YES')[mc <= k])\r\n", "n,m=map(int,input().split())\r\nl=input()\r\nl1=[0]*27\r\nS='abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(len(S)) :\r\n l1[i]=l.count(S[i])\r\nl1=sorted(l1)\r\nif m<l1[26] :\r\n print('NO')\r\nelse :\r\n print('YES')\r\n \r\n", "b=int(input().split()[1]);c=input()\r\nfor i in set(c):\r\n if c.count(i)>b:print(\"NO\");exit()\r\nprint(\"YES\")", "from collections import Counter\nn, k = map(int, input().split(' '))\nm = Counter(input())\nresult = True\nfor key in m:\n if m[key] > k:\n result = False\nif result:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, k = tuple(map(int, input().split(' ')))\r\nif n <= k:\r\n print('YES')\r\nelse:\r\n string = input()\r\n assert len(string) == n\r\n count = [0 for i in range(26)]\r\n result = True\r\n a = ord('a')\r\n for c in string:\r\n index = ord(c) - a\r\n count[index] += 1\r\n if count[index] > k:\r\n result = False\r\n break\r\n print('YES' if result else 'NO')\r\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\na = 0\r\n\r\nfor i in s :\r\n a=max(a , s.count(i))\r\n\r\nif a <= k :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "def solve():\r\n size, k = map(int, input().split())\r\n s = input()\r\n \r\n for letter in set(s):\r\n if s.count(letter) > k:\r\n print(\"NO\")\r\n \r\n return\r\n \r\n print(\"YES\")\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "b=int(input().split()[1]);c=input();print([\"YES\",\"NO\"][max(c.count(i) for i in set(c))>b])", "n,k =map(int,input().split())\r\ns=list(input())\r\nl=[s.count(str(i)) for i in s]\r\nif(max(l)>k):\r\n\tprint(\"NO\")\t\r\nelse:\r\n\tprint(\"YES\")", "n, m = map(int, input().split())\r\ns = input()\r\nres = True\r\nfor i in s:\r\n if s.count(i) > m:\r\n res = False\r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input().split()[1])\r\na=input()\r\nprint(['YES','NO'][a.count(max(set(a), key=a.count))>n])", "from sys import stdin\nfrom collections import Counter\n\nN, K = map(int, stdin.readline().split())\n\nif max(Counter(stdin.readline().strip()).values()) <= K:\n print(\"YES\")\nelse:\n print(\"NO\")", "n, k = list(map(int, input().split()))\r\ns = str(input())\r\no = [] * k\r\nfor i in s:\r\n if (i not in o) or o.count(i) < k :\r\n o.append(i)\r\n else:\r\n o\r\n break\r\nif len(o) == len(s):\r\n print('YES')\r\nelse:\r\n print('NO')", "line = input()\r\ns = input()\r\nline = line.split(' ')\r\nn = int(line[0]) # chislo sharikov\r\nk = int(line[1]) # chislo druzey\r\nfor i in range(0,len(s)):\r\n if s.count(s[i]) > k:\r\n f = False\r\n break\r\n else:\r\n f = True\r\nif f == False:\r\n print ('No')\r\nelse:\r\n print('Yes')\r\n", "n, k = map(int, input().split())\r\ns = input()\r\na = []\r\nfor i in range(len(s)):\r\n a.append(s[i])\r\nletters = [0] * 26\r\nfor i in range(len(s)):\r\n nomer = ord(a[i]) - 97\r\n letters[nomer] += 1\r\nif max(letters) > k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "\r\n\r\nfrom collections import Counter\r\n\r\nn , k = map(int , input().split())\r\n\r\ns = input()\r\ns = list(s)\r\n\r\ncnt = Counter(s)\r\nr = 0\r\nfor i in cnt:\r\n if cnt[i] > k:\r\n r = 1\r\n break\r\n \r\nprint('YES' if r == 0 else 'NO')\r\n ", "n,k=map(int,input().split())\r\ns=list(input())\r\np=set(s)\r\nc=0\r\nfor i in p:\r\n if(s.count(i)>k):\r\n c=c+1\r\n print(\"NO\")\r\n break\r\nif c==0 :\r\n print(\"YES\")\r\n \r\n\r\n ", "a, b = map(int, input().split())\r\nx = str(input())\r\nfor i in x:\r\n if x.count(i) > b:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n,m=map(int,input().split())\r\ns=input()\r\nk=True\r\nd={}\r\nfor i in s:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nfor i in d:\r\n if d[i]>m:\r\n print(\"NO\")\r\n k=False\r\n break\r\nif k:\r\n print(\"YES\")\r\n\r\n \r\n", "[balloons, friends] = input().split(' ')\r\ncolors = input()\r\ndct_colors = {}\r\nmax_color = 0\r\nfor i in range(len(colors)):\r\n if colors[i] not in dct_colors:\r\n dct_colors[colors[i]] = 0\r\n dct_colors[colors[i]] += 1\r\n if dct_colors[colors[i]] > max_color:\r\n max_color = dct_colors[colors[i]]\r\nif max_color > int(friends):\r\n print('NO')\r\nelse:\r\n print('YES')", "from collections import Counter\r\nn,k = list(map(int,input().split()))\r\ns = list(input())\r\ns_count = Counter(s).most_common()\r\nif len([i[1] for i in s_count if i[1] > k]) == 0:\r\n print('YES')\r\nelse:\r\n print('NO')", "inp=input().split()\r\nn=int(inp[0])\r\nk=int(inp[1])\r\ns=input()\r\ndic=dict()\r\nfor i in range(n):\r\n dic[s[i]]=dic.get(s[i],0)+1\r\nflag=1\r\nfor key in dic:\r\n if dic[key] > k:\r\n flag=0\r\n break\r\nif(flag==1):\r\n print(\"YES\\n\")\r\nelse:\r\n print(\"NO\\n\")\r\n\r\n\r\n ", "n, k = map(int, input().split())\r\ns = input()\r\nlistA = [0] * 26\r\n\r\nfor i in range(len(s)):\r\n # print(i, s[i], ord(s[i]) - 97)\r\n listA[(ord(s[i]) - 97)] += 1\r\n\r\n# print(listA)\r\nlistA.sort(reverse=True)\r\ngoodFl = 'YES'\r\n\r\nfor i in range(26):\r\n if listA[i] > k:\r\n goodFl = 'NO'\r\n break\r\n elif listA[i] == 0:\r\n break\r\n\r\nprint(goodFl)", "balls, friends = map(int, input().split())\r\nstatus = [0] * 26\r\nstring = str(input())\r\n\r\nfor i in range(len(string)):\r\n number = ord(string[i]) - 97\r\n status[number] += 1\r\n if status[number] > friends:\r\n print('NO')\r\n break\r\n if i == len(string) - 1:\r\n print('YES')\r\n\r\n\r\n#\r\n# print(number)\r\n# print(status)\r\n", "from collections import Counter\r\nflag=0\r\nm,k=map(int, input().split())\r\n # c,d=map(int, input().split())\r\n # name1=list(map(int, (input().split())))\r\nname2=input()\r\nname2_3=Counter(name2)\r\nfor i in set(name2):\r\n if (name2_3[i])>k:\r\n flag=1\r\nprint(\"YES\" if flag==0 else \"NO\")", "n,k=input().strip().split()\r\nn=int(n)\r\nk=int(k)\r\n#print(n,' ',k)\r\ns=input()\r\nl=len(s)\r\nx=[0]*26\r\nif not s.isupper():\r\n for i in range(l):\r\n x[ord(s[i])-97]+=1\r\nelse:\r\n for i in range(l):\r\n x[ord(s[i])-65]+=1\r\n#print(x)\r\np=0\r\nfor i in range(26):\r\n if x[i]/k>1:\r\n print('NO')\r\n break\r\n else:\r\n p+=1\r\nelse:\r\n print('YES')\r\n\r\n", "# n, k = map(int, input().split())\r\n# s = input().lower()\r\n# c = [0] * 26\r\n# for i in s:\r\n# nmb = ord(i) - 97\r\n# c[nmb] += 1\r\n# x = max(c)\r\n# if x > k:\r\n# print('NO')\r\n# else:\r\n# print('YES')\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\ns = input().lower()\r\nd = {}\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nfor i in d.values():\r\n if i > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n''' Как-то у себя в чулане Кефа нашёл n шариков.\r\nДля удобства обозначим цвет i-го шарика как si — строчная буква английского алфавита.\r\nУ Кефы есть k друзей. Кефин друг обидится, если получит два шарика одного цвета.\r\nКефа хочет раздать все шарики своим друзьям. Помогите Кефе узнать,\r\nсможет ли он раздать все шарики и при этом не обидеть своих друзей — выведите «YES», в случае положительного ответа,\r\nи «NO», иначе. Обратите внимание, что Кефин друг не обидится, если не получит ни одного шарика.\r\n\r\nВходные данные\r\nВ первой строке входных данных содержатся два числа, разделенные одним пробелом,\r\nn и k (1 ≤ n, k ≤ 100) — количество шариков и количество друзей соответственно.\r\n\r\nВ следующей строке входных данных содержится строка s — цвета шариков.\r\n\r\nВыходные данные\r\nОтвет на задачу — «YES» или «NO» в единственной строке без кавычек.\r\n\r\nВы можете выводить каждую из букв в любом регистре.\r\n\r\nПримеры\r\nвходные данныеСкопировать\r\n4 2\r\naabb\r\nвыходные данныеСкопировать\r\nYES\r\nвходные данныеСкопировать\r\n6 3\r\naacaab\r\nвыходные данныеСкопировать\r\nNO'''", "n,k=input().split()\r\n\r\ns=input()\r\nfrom collections import Counter\r\nc=Counter(s)\r\nif c.most_common(1)[0][1]>int(k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n# http://codeforces.com/problemset/problem/841/A\r\n", "n, k = map(int, input().split())\ns = input()\nc = [0] * 26\ncount_yes = 0\ncount_no = 0\nfor i in s:\n nomer = ord(i) - 97\n c[nomer] += 1\nfor j in range(len(c)):\n if c[j] <= k:\n count_yes += 1\n else:\n count_no += 1\nif count_no > 0:\n print('NO')\nelse:\n print('YES')\n", "from collections import Counter\r\n_,k = map(int,input().split())\r\nprint(\"NO\" if max(Counter(input()).values()) > k else \"YES\")", "import sys\n\nnumbers = ''\ncolors = ''\n\ni = 0\nfor line in sys.stdin:\n\ti += 1\n\tif i == 1:\n\t\tnumbers = line\n\tif i == 2:\n\t\tcolors = line[:-1]\n\t\tbreak\n\nnumbers = numbers.split(' ')\nballs_n = int(numbers[0])\nfriends_n = int(numbers[1])\n\ncolor_types = {}\nfor c in colors:\n\tif c in color_types:\n\t\tcolor_types[c] += 1\n\telse:\n\t\tcolor_types[c] = 1\n\tif color_types[c] > friends_n:\n\t\tprint(\"NO\")\n\t\tsys.exit(0)\n\nprint(\"YES\")\n", "n,k = map(int,input().split())\r\ns = sorted(input())\r\ncount =1;\r\nflag = 0;\r\nfor i in range(len(s)-1):\r\n if(s[i] == s[i+1]):\r\n count +=1\r\n if count > k:\r\n flag =1\r\n break\r\n else:\r\n count =1\r\n\r\nif flag == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import sys\r\nn, k = map(int, input().split())\r\ns, cnt = input(), [0] * 256\r\nfor x in s: cnt[ord(x)] += 1\r\nfor x in cnt:\r\n if x > k:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")", "from collections import Counter\nn, k = map(int, input().split())\nprint([\"NO\", \"YES\"][max(Counter(input()).values()) <= k])\n", "[n,k] = list(map(int, input().split(\" \")))\r\ns = input()\r\nfor i in s:\r\n if s.count(i) > k:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "string = input().split(' ')\r\n\r\nn = int(string[0])\r\nk = int(string[1])\r\n\r\nstring = list(input())\r\n\r\nuniqueString = set(string)\r\n\r\ntoPrint = 'YES'\r\n\r\nfor char in uniqueString:\r\n if string.count(char) > k:\r\n toPrint = 'NO'\r\n\r\nprint(toPrint)\r\n\r\n\r\n", "def solve(c, k):\n for x in c.keys():\n if c[x] > k:\n return False\n return True\n\n\ndef main():\n n, k = map(int, input().split())\n\n s = list(input())\n c = {}\n for x in s:\n c[x] = c.get(x, 0) + 1\n\n if solve(c, k):\n print('YES')\n else:\n print('NO')\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nimport math\r\n\"\"\"files=False\r\nif files:\r\n fn='symposium'\r\n sys.stdin=open(fn+'.in')\r\n sys.stdout=open(fn+'.out',mode='w')\r\n\"\"\"\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\nar=[]\r\nn,k=ria()\r\nmp={}\r\nmx=0\r\nfor i in input():\r\n if i not in mp:\r\n mp[i]=0\r\n mp[i]+=1\r\n mx=max(mp[i],mx)\r\nif mx>k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "shar,drug=map(int, input().split())\r\ncvet=input()\r\ncvet_n= {}\r\nfor i in cvet:\r\n nomer=ord(i)-97\r\n if i in cvet_n:\r\n cvet_n[i]+=1\r\n else:\r\n cvet_n[i]=1\r\nif cvet_n[max(cvet_n,key=cvet_n.get)]<=drug:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = map(int,input().split())\r\ns = input()\r\na = [0]*26\r\notvet = 0\r\nfor i in range(0,len(s)):\r\n nomer = ord(s[i])-97\r\n a[nomer] += 1\r\nfor i in range(26):\r\n if a[i] > k:\r\n otvet += 1\r\nif otvet > 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, k = map(int, input().split())\r\ns = input()\r\nc = {}\r\n\r\nfor i in s:\r\n c[i] = c.get(i, 0) + 1\r\n\r\nm = max(c.values())\r\n\r\nif m > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "from math import ceil, sqrt, floor\r\nimport sys \r\n\r\nn,k = map(int ,input().split())\r\nballons = {}\r\nfor i in input():\r\n if i in ballons:\r\n ballons[i] += 1\r\n else:\r\n ballons[i] = 1\r\n\r\nprint([\"NO\", \"YES\"][all([j <= k for i,j in ballons.items()])])", "a,b=map(int,input().split())\r\nn=input()\r\nk=0\r\nfor i in n:\r\n if(n.count(i)>b):\r\n k=k+1\r\n break\r\nif(k==0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nx=\"\".join(set(s))\r\nfor i in range(len(x)):\r\n if(s.count(x[i])>k):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "n, k = map(int, input().split())\na = list(input())\n\nflag = True\nfor i in set(a):\n if a.count(i) > k:\n flag = False\n break\n\nprint('YES' if flag else 'NO')\n", "from collections import Counter \r\nb,f=map(int,input().split())\r\ns=Counter(input())\r\nfor i in s:\r\n if(s[i]>f):\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "n, k = map(int, input().split())\ns = input()\ns = sorted(s)\ncur_max, cur_min = 1, 1\nfor i in range(1, n):\n if s[i] == s[i - 1]:\n cur_min += 1\n if i == n - 1 and cur_min > cur_max:\n cur_max = cur_min\n else:\n if cur_min > cur_max:\n cur_max = cur_min\n cur_min = 1\nif k >= cur_max:\n print('YES')\nelse:\n print('NO')\n", "from collections import Counter\r\nn, m = map(int, input().split())\r\nc = Counter(list(input()))\r\nma = max(c.values())\r\nprint([\"NO\",\"YES\"][ma <= m])", "I = lambda:int(input())\r\nID = lambda:map(int, input().split())\r\nIL = lambda:list(ID())\r\nn,k = ID()\r\ns =list(input())\r\nc = list(set(s))\r\n#g = 0\r\n#a = []\r\n#print(c)\r\nfor i in c:\r\n\tif s.count(i)>k:\r\n\t\tprint('NO')\r\n\t\tbreak\r\nelse:\r\n\tprint('YES')\t", "n, k = map(int, input().split())\r\ns = input()\r\nhash_map = dict()\r\nfor x in s:\r\n if x not in hash_map:\r\n hash_map[x] = 1\r\n else:\r\n hash_map[x] += 1\r\n\r\nfor x in hash_map:\r\n if hash_map[x] <= k:\r\n continue\r\n else:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n", "a = [0] * 28\r\nn,k = map (int, input ().split ())\r\ns = input ()\r\n\r\nfor i in s:\r\n a[ord (i) - ord ('a')] += 1\r\n\r\nif max (a) <= k:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "#http://codeforces.com/problemset/problem/841/A\nn,k = map(int, input().split())\nballoons= input()\nballoons = list(balloons)\ndic = {}\nfor x in balloons:\n\tif x in dic:\n\t\tdic[x] += 1\n\telse:\n\t\tdic[x] = 1\nif(int(max(dic.values()))>k):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")", "n,k = [int(i) for i in input().split()]\r\ns = list(str(input()))\r\n\r\nc = 0\r\nfor i in \"qwertyuiopasdffghjklzxcvbnm\":\r\n c = max(s.count(i), c)\r\nif k < c:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k=map(int,input().split())\r\na=input()\r\ncount=[0]*26\r\ns=[]\r\nw=0\r\nfor i in a:\r\n nomer=ord(i)-97\r\n count[nomer]+=1\r\nfor i in range(26):\r\n if count[i]>0:\r\n s.append(count[i])\r\nfor i in range(len(s)):\r\n if s[i]>k:\r\n w+=1\r\nif w>0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n, k = map(int, input().split())\r\nstring = input()\r\n\r\nnums = [0] * 26\r\nfor i in string:\r\n nums[ord(i) - 97] += 1\r\n\r\nprint(\"NO\" if max(nums) > k else \"YES\")\r\n", "a=[int(i) for i in input().split()]\r\nb=input()\r\nc={}\r\nd=0\r\nfor i in b:\r\n if(c.get(i)):\r\n c[i]=c[i]+1\r\n if(c[i]>a[1]):\r\n d=1\r\n print(\"NO\")\r\n break\r\n else:\r\n c[i]=1\r\nif(d==0):\r\n print(\"YES\")\r\n", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\nn, k = inp()\r\ns, hash = input(), dict()\r\nfor i in s:\r\n if i not in hash:\r\n hash[i] = 0\r\n hash[i] += 1\r\n\r\nprint('YNEOS'[(max(hash.values()) > k)::2])\r\n", "from collections import Counter\nprint((\"YES\", \"NO\")[int(input().split()[1]) < Counter(input()).most_common(1)[0][1]])", "a,b = map(int,input().split())\r\nsstr = input()\r\ncheck = True\r\nfor i in sstr:\r\n if sstr.count(i) > b:\r\n check = False\r\n break\r\nprint(\"Yes\" if check == True else \"No\")\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nprint(\"YES\" if max([s.count(x) for x in set(s)])<=k else \"NO\")\r\n", "#\r\n# a,b=map(int,input().split())\r\n# c={}\r\n# d=input()\r\n# [c.setdefault(i,[]) for i in range(b)]\r\n# k=0\r\n# for i in range(b):\r\n# for j in d:\r\n# if j not in c[i] and :\r\n# c[i].append(j)\r\n# k+=1\r\n# l=0\r\n# ll=1\r\n# for i in c.values():\r\n# if i==c[0]:\r\n# ll+=0\r\n# else:\r\n# ll+=1\r\n#\r\n# for i in range(b):\r\n# l+=len(c[i])\r\n# if l==a and ll==1:\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n# нельзя изменять список который обходишь\r\n# a,b=map(int,input().split())\r\n# c={}\r\n# d=input()\r\n# dd=list(d)\r\n# [c.setdefault(i,[]) for i in range(b)]\r\n# #while len(dd)>0:\r\n# for i in range(b):\r\n# for j in dd:\r\n# if len(c[i])<(a/b) and j not in c[i]:\r\n# c[i].append(j)\r\n# dd.remove(j)\r\n#\r\n# print(c)\r\n#while len(c[i])!=c[0]\r\n\r\n\r\n# a,b=map(int,input().split())\r\n# c={}\r\n# d=input()\r\n# dd=list(d)\r\n# [c.setdefault(k,[]) for k in range(b)]\r\n# x=0\r\n# while x!=b:\r\n#\r\n# for i in range(a):\r\n# if dd[i] not in c[x]: #and dd[i] not in c[0]\r\n# c[x].append(d[i])\r\n# x+=1\r\n# print(c)\r\n\r\na,b=map(int,input().split())\r\nd=input()\r\ndd=list(d)\r\nx=1\r\nfor i in dd:\r\n if dd.count(i)>b:\r\n x*=0\r\nprint('YES'*x+'NO'*(1-x))\r\n\r\n", "a = {}\r\nflag = 'YES'\r\nn, d = input().split()\r\nk = input()\r\nfor i in k:\r\n if i not in a:\r\n a[i] = 1\r\n else:\r\n a[i] += 1\r\nfor j in a:\r\n if a[j] > int(d):\r\n flag = 'NO'\r\nprint(flag) ", "q = list(map(int, input().split()))\r\ns = str(input())\r\nn = q[0] #кол-во шариков\r\nk = q[1] #кол-во друзей\r\n\r\ncount = [0] * 26\r\n\r\nfor i in s:\r\n count[ord(i) - 97] += 1\r\n \r\nif max(count) > k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n, k = map(int, input().split())\r\nl = list(input())\r\nfreq = [0]*26\r\nfor i in range(len(l)):\r\n freq[ord(l[i])-97]+=1\r\nif max(freq)<=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x,y = map(int,input().split())\r\npup = input()\r\nz = list(pup)\r\nw = dict.fromkeys(z,0)\r\nfor i in z:\r\n w[i] += 1\r\nflag = 0\r\nfor i in w:\r\n if w[i] > y:\r\n print(\"NO\")\r\n flag=1\r\n break\r\nif flag == 0:\r\n print(\"YES\")", "n,k= input('').split(' ')\r\nn=int(n)\r\nk=int(k)\r\ns=input('')\r\nl=list(s)\r\nq=[]\r\ne=[]\r\nfor i in range(len(l)):\r\n if l[i] not in e:\r\n e.append(l[i])\r\n p=l.count(l[i])\r\n q.append(p)\r\ni=0\r\nfor j in range(len(q)):\r\n if q[j]>k:\r\n i=1\r\nif i==1:\r\n print('NO')\r\nelif i==0:\r\n print('YES')\r\nelse:\r\n print(\"Don't Know\")\r\n", "[n,k]=list(map(int,input().split()))\nballoons=input()\n\nfrom collections import Counter\nc=dict(Counter(balloons))\nb=True\nfor i in c:\n\tif c[i]>k:\n\t\tb=False\n\t\tbreak\nif(b):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "n,k = (int(x) for x in input().split());\nst = input();\narr = [0 for x in range(200)];\nans = \"YES\";\n\nfor i in range(len(st)):\n a = ord(st[i]);\n arr[a] += 1;\n if arr[a] > k:\n ans = \"NO\";\n break;\n\nprint(ans);\n", "a,b=map(int,input().split())\r\nl=list(input())\r\ns=list(set(l))\r\nm=0\r\nfor i in s:\r\n\tif l.count(i)>b:\r\n\t\tm=1\r\n\t\tbreak\r\nif m==1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\t\r\n", "n, k = map(int, input().split())\r\ns = input()\r\ncol = [0] * 26\r\nfor i in s:\r\n col[ord(i.lower())-97] += 1\r\ncol.sort(reverse=True)\r\nif col[0] > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "try:\r\n a,b=map(int,input().split())\r\n s=input()\r\n alph=[]\r\n count=[]\r\n for i in range(a):\r\n if s[i] in alph:\r\n continue\r\n else:\r\n alph.append(s[i])\r\n count.append(s.count(s[i]))\r\n \r\n \r\n if(max(count)>b):\r\n print('No')\r\n else:\r\n print('Yes')\r\n \r\nexcept:\r\n pass", "balls, friends = map(int, input().split())\ncolors = input()\ns = {}\ncount_yes = 0\ncount_no = 0\nfor i in colors:\n if i not in s:\n s[i] = 1\n else:\n s[i] += 1\nfor j in s:\n if s[j] <= friends:\n count_yes += 1\n else:\n count_no += 1\nif count_no >= 1:\n print('NO')\nelse:\n print('YES')\n", "a=input().split()\r\na[0]=int(a[0])\r\na[1]=int(a[1])\r\ns=input()\r\nc=set(s)\r\nqanak=0\r\nfor i in c:\r\n if s.count(i)<=a[1]:\r\n qanak+=1\r\n continue\r\nif qanak==len(c):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "n, k = [int(i) for i in input().split()]\r\nstr = input()\r\n#print(str.count('a'))\r\nans = 'YES'\r\nfor lit in str:\r\n if str.count(lit) > k:\r\n ans = 'NO'\r\n break;\r\nprint(ans)", "n, k = map(int, input().split())\r\ns = input()\r\nletters = [0] * 26\r\nfor i in s:\r\n number = ord(i) - 97\r\n letters[number] += 1\r\n\r\nfor i in range(26):\r\n if letters[i] > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\nn,m=map(int,input().split())\r\na=list(input())\r\nk=set(a)\r\nf=0\r\nfor i in k:\r\n\tb=a.count(i)\r\n\tif b>m:\r\n\t\tprint('NO')\r\n\t\tf=0\r\n\t\tbreak\r\n\telse:\r\n\t\tf=1\t\r\nif f==1:\r\n\tprint('YES')\t\t", "n, k = map(int, input().split())\r\nstring = input()\r\n\r\ndata = dict()\r\nfor i in string:\r\n data[i] = data.get(i, 0) + 1\r\n\r\nans = 1\r\nfor i in data.keys():\r\n if data[i] > k:\r\n ans = 0\r\n\r\nprint(\"YES\" if ans else \"NO\")\r\n", "n,k=map(int,input().split())\r\ns=list(input())\r\ns1=list(set(s))\r\nf=1\r\nfor i in s1:\r\n if( s.count(i)>k):\r\n f=0\r\n print(\"NO\")\r\n break\r\nif(f==1):\r\n print(\"YES\")", "a,b=map(int,input().split())\r\nans=[\"\"]*b\r\ns=list(input())\r\nc=0\r\nfor i in range(b):\r\n for j in range(a):\r\n if s[j] not in ans[i] and s[j]!='A':\r\n ans[i]+=s[j]\r\n s[j]='A'\r\n c+=1\r\nif c==a:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=[int(i) for i in input().split()]\r\na=[]\r\nfor i in range(26):\r\n a.append(0)\r\ns=input()\r\nfor i in s:\r\n a[ord(i)-97]+=1\r\nm=a[0]\r\nfor i in a:\r\n if i>m:\r\n m=i\r\nif m<=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = map(int, input().split())\r\na = list(map(str, input()))\r\nf = set(a)\r\nm = 0\r\nfor i in f:\r\n if a.count(i) > m:\r\n m = a.count(i)\r\nprint(\"NO\" if m > k else \"YES\")\r\n", "n, k = map(int, input().split())\r\ns = input()\r\nd = {}\r\nfor x in s:\r\n d[x] = d.get(x, 0) + 1\r\nif max(d.values()) > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "def happy_friends(string):\r\n balls = []\r\n colors = [0] * (ord('z') + 1)\r\n for value in string:\r\n colors[ord(value)] += 1\r\n\r\n for value in range(ord('a'), len(colors)):\r\n if colors[value] > 0 and colors[value] > friends:\r\n balls.append('NO')\r\n elif colors[value] > 0 and colors[value] <= friends:\r\n balls.append('YES')\r\n if 'NO' in balls:\r\n return 'NO'\r\n else:\r\n return 'YES'\r\n \r\nnumber_of_balls, friends = map(int, input().split())\r\nstring = input().lower()\r\nprint(happy_friends(string))\r\n \r\n \r\n", "a,b = map(int,input().split())\r\nl = list(input())\r\nx = set(l)\r\nc =0\r\nfor i in x:\r\n\tc = max(c,l.count(i))\r\nif c>b:print(\"NO\")\r\nelse:print(\"YES\")", "n,k=map(int,input().split())\r\ns=input().strip()\r\nd={}\r\nfor i in range(26):\r\n d[chr(ord('a')+i)]=0\r\nfor i in s:\r\n d[i]+=1\r\narr=[]\r\nfor i in d.keys():\r\n arr.append(d[i])\r\narr.sort(reverse=True)\r\narr.append(0)\r\nsumm=0\r\nfor i in range(len(arr)-1):\r\n summ+=arr[i]-arr[i+1]\r\nif summ<=k:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n", "import collections\r\nn,k=list(map(int,input().split()))\r\ns=list(input())\r\nballs=collections.defaultdict(int)\r\nfor x in s:\r\n balls[x]+=1\r\n\r\nif max(balls.values())<=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "#!/usr/env/python3\nfrom collections import Counter\nn,k = map(int, input().split(\" \"))\nss = list(input())\n\ncount = list(Counter(ss).values())\nok = True\nfor i in count:\n if not i <= k: ok = False\n\nprint(\"YES\") if ok else print(\"NO\")\n", "a = [0] * 28\nn, k = map(int, input().split())\ns = str(input())\nfor i in s:\n a[ord(i) - ord('a')] += 1\nif max(a) <= k:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n,k=map(int,input().split())\r\ns=input()\r\ndic={}\r\nfor i in s:\r\n if i in dic:\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\nflag=0\r\nfor i in dic:\r\n if dic[i]>k:\r\n flag=1\r\nif flag:\r\n print('NO')\r\nelse:\r\n print('YES')", "x,y = map(int,input().split())\r\np = input()\r\nm = 0\r\nfor i in p:\r\n if p.count(i) > y:\r\n m = 1\r\nprint('NO' if m == 1 else 'YES')", "import collections\r\nn, k = list(map(int, input().split()))\r\nwords = input()\r\ncolors = collections.Counter(list(words))\r\nfriends = {}\r\nfor i in colors.values():\r\n if i > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "from collections import Counter\n\n\ndef solve(n, k, a):\n c = Counter(a)\n maxi = max(c.items(), key=lambda x: x[1])[1]\n return \"YES\" if maxi <= k else \"NO\"\n\n\ndef main():\n n, k = list(map(int, input().split()))\n a = input()\n print(solve(n, k, a))\n\n\nmain()\n", "colorCountFriends, friends = map(int, input().split())\r\nColor = input()\r\nd = {}\r\ns = []\r\nfor i in Color:\r\n if Color.isalpha():\r\n d[i] = d.get(i, 0) + 1\r\nfor i2 in d.values():\r\n s.append(i2)\r\nif max(s) <= friends:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = map(int, input().split())\r\ns, q = sorted(' '.join(input()).split()), 0\r\nw = sorted(list(set(s)))\r\nfor i in w:\r\n q = max(s.count(i), q)\r\nprint('NO' if q > k else 'YES')\r\n", "import collections\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = input().rstrip()\r\n\r\nprint(\"NO\" if max(collections.Counter(data).values()) > k else \"YES\")", "n, k = map(int, input().split())\r\ns = list(input())\r\ns_set = set(s)\r\ncolor = []\r\nfor i in s_set:\r\n if s.count(i) > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "n, k = map(int, input().split())\r\ns=list(input())\r\n#print(s)\r\n\r\nt=list(map(s.count,s))\r\n#print(t)\r\n\r\nif max(t)>k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "#n, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\n#L = [int(x) for x in input().split()] # read multiple integers into a list\r\n#print(' '.join(map(str, L))) # print multiple integers in one line\r\n\r\nn, k = map(int, input().split(\" \")) # read multiple integers into different variables\r\nd = { x : 0 for x in range(0, 26)}\r\nsolved = True\r\nfor x in list(input()) : \r\n d[ord(x) - ord('a')] += 1\r\n if (d[ord(x) - ord('a')] > k) : solved = False\r\n\r\nif (solved) : print(\"YES\")\r\nelse : print(\"NO\")\r\n\r\n", "\r\nt,q=(map(int,input().split()))\r\nf=input()\r\nf=list(f)\r\ng=[]\r\nfor i in f:\r\n\te=f.count(i)\r\n\tg.append(e)\r\ngh=max(g)\r\nif gh<=q:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "colors, friends = map(int, input().split())\r\ns = list(input())\r\nc = 0\r\nm = 0\r\nfor i in s:\r\n m = max(s.count(i), m)\r\nprint('YES' if m <= friends else 'NO')", "n, k = map(int, input().split())\r\ns = input()\r\nss = set(s)\r\nmaxc = 0\r\nfor c in ss:\r\n maxc = max(maxc, s.count(c))\r\nif maxc > k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Feb 15 12:19:40 2018\r\n\r\n@author: karthikps\r\n\"\"\"\r\n\r\nline_1 = input().split()\r\nn = int(line_1[0])\r\nk = int(line_1[1])\r\n\r\ns = input()\r\n\r\ncolour_dict = {}\r\n\r\nfor balloon in s:\r\n if balloon in colour_dict.keys():\r\n colour_dict[balloon] += 1\r\n else:\r\n colour_dict[balloon] = 1\r\n\r\nif k >= max(colour_dict.values()):\r\n print('YES')\r\nelse:\r\n print('NO')", "n,m=map(int,input().split())\r\na=list(input())\r\nfor i in set(a):\r\n if a.count(i)>m:\r\n print('NO')\r\n exit()\r\nprint('YES')", "n,k = map(int,input().split())\r\nstring = input()\r\nif k>=n:\r\n print('YES')\r\nelse:\r\n dic = {}\r\n for i in string:\r\n if i not in dic:\r\n dic[i] = 1\r\n else:\r\n dic[i] += 1\r\n count = 0\r\n length = len(dic)\r\n for i in dic:\r\n if dic[i] > k:\r\n break\r\n count += 1\r\n if count == length:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nx=0\r\nfor i in s:\r\n if(s.count(i)>k):\r\n x=1\r\n break\r\nif(x):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k=map(int,input().split())\r\ns=input()\r\ns1=list(set(s))\r\nfor i in s1:\r\n\tif s.count(i)>k:\r\n\t\tprint('NO')\r\n\t\texit()\r\nprint('YES')", "n, k = map(int, input().split())\r\nb = list(input())\r\na = {}\r\ns = 0\r\nfor i in b:\r\n a[i] = a.get(i, 0) + 1\r\nfor i in a:\r\n if a[i] > s:\r\n s = a[i]\r\nif s > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "a, b = map(int, input().split())\r\nstr = input()\r\ncolors = {}\r\nfor s in str:\r\n colors[s]=colors.get(s,0)+1\r\n if colors[s]>b:\r\n print('NO')\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "a,b=eval(','.join(input().split()))\nd={}\ns=input()\nfor i in s:\n d[i]=d.get(i,0)+1\nmax_=0\nfor key in d:\n if d[key]>max_:\n max_=d[key];\nif max_>b:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n\n\n\n\n\n \n", "n, k = map(int, input().split())\r\ns = input()\r\na = {}\r\no = 0\r\nfor i in s:\r\n if i in a:\r\n a[i] += 1\r\n else:\r\n a[i] = 1\r\nfor i in a.values():\r\n if i - k >= 0:\r\n o += i - k\r\nif o == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k = list(map(int,input().split()))\r\ns = input()\r\nd={}\r\nfor i in s:\r\n\tif i in d:\r\n\t\td[i]+=1\r\n\telse:\r\n\t\td[i]=1\r\nb=[]\r\nfor i in d:\r\n\tb.append(d[i])\r\n\r\nif max(b)>k:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n s = input()\r\n hash_table = {}\r\n for i in s:\r\n if i in hash_table:\r\n hash_table[i] += 1\r\n else:\r\n hash_table[i] = 1\r\n for i in hash_table:\r\n if hash_table[i] > k:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nprint(main_function())", "count,friends=map(int,input().split())\r\ncolour=input()\r\nball={}\r\nflag=True\r\n\r\nfor i in colour:\r\n ball[i]=ball.get(i,0)+1\r\n\r\nfor i in ball:\r\n if ball[i]>friends:\r\n print(\"NO\")\r\n flag=False\r\n break\r\nif flag:\r\n print(\"YES\")\r\n", "from collections import deque\r\nfrom collections import OrderedDict\r\nimport queue\r\nimport heapq\r\nimport math\r\nfrom re import I\r\nimport sys\r\nsys.setrecursionlimit(10**6)\r\n \r\ndef sf(): return [int(x) for x in input().split(\" \")]\r\ndef sfi(): return int(input())\r\ndef sfs(): return input()\r\ndef printf(x):\r\n print(x)\r\n sys.stdout.flush()\r\n\r\nsz = int(1e6+1)\r\ndp = [0]*(sz)\r\n\r\ndef find(n):\r\n if (n >= sz): return\r\n if (dp[n]): return\r\n dp[n] = 1\r\n find(n+2020)\r\n find(n+2021)\r\n\r\n\r\ndef main():\r\n n,k = sf()\r\n s = sfs()\r\n ct = {}\r\n solvable = 1\r\n for b in s:\r\n if b in ct: ct[b] += 1\r\n else: ct[b] = 1\r\n if ct[b] > k: \r\n solvable = 0\r\n break\r\n \r\n if solvable: print(\"YES\")\r\n else: print(\"NO\")\r\n \r\nif __name__ == \"__main__\":\r\n main()", "n, k = list(map(int, input().split()))\ns = list(input())\nif max([s.count(k) for k in set(s)]) > k:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "x,y=map(int,input().split());dic={}\r\na=list(input())\r\nfor i in range(x):\r\n\tif a[i] not in dic.keys():\r\n\t\tdic[a[i]]=1\r\n\telse:\r\n\t\tdic[a[i]]+=1\r\nprint('NO' if max(dic.values())>y else 'YES')", "n = [int(c) for c in input().split(' ')]\r\ns = input()\r\nkraj=0\r\ntmp=1\r\nfor i in range(0,len(s)):\r\n tmp=1\r\n for j in range(i+1,len(s)):\r\n if s[j]==s[i]:\r\n tmp=tmp+1\r\n \r\n if tmp>n[1]:\r\n kraj=kraj+1\r\n\r\nif kraj>0:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")", "n, k = map(int, input().split())\r\ns = input()\r\ncount, max, q = 0, 0, s[0]\r\n\r\nwhile q in s:\r\n count = s.count(q)\r\n if count > max:\r\n max = count\r\n s = s.replace(q, '')\r\n if s.isalpha() == True:\r\n q = s[0]\r\n count = 0\r\n else:\r\n break\r\n\r\nif max > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "'''input\n4 2\naabb\n'''\nn, k = map(int, input().split())\ns = input()\nprint(\"NO\" if any(s.count(l) > k for l in set(s)) else \"YES\")\n", "numbers=input()\r\nballoons,friends=numbers.split(\" \")\r\nfriends=int(friends)\r\nstring=input()\r\nz=0\r\nfor _ in string:\r\n\tr=string.count(_)\r\n\tif(r>friends):\r\n\t\tz+=1\r\n\t\tbreak\r\nif(z==0):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "\n\nn, k = map(int, input().split())\ns = input()\n\nd = {}\nfor ch in s:\n if ch not in d:\n d[ch] = 1\n else:\n d[ch] += 1\n\nans = 'YES'\nfor key in d.keys():\n if d[key] > k:\n ans = 'NO'\n break\n\nprint(ans)\n", "b,n = map(int,input().split())\r\ns = input()\r\nprint (('YES','NO')[max(s.count(c) for c in set(s)) > n])", "a=list(map(int, input().split()))\r\nn=a[0]\r\nk=a[1]\r\ns=input()\r\nif k>=n:\r\n print(\"YES\")\r\nelse:\r\n freq = {}\r\n for item in s:\r\n if (item in freq):\r\n freq[item] += 1\r\n else:\r\n freq[item] = 1\r\n v=list(freq.values())\r\n t=0\r\n for i in range(len(v)):\r\n if v[i]>k:\r\n t=1\r\n break\r\n if t==1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "import sys\r\nfrom string import ascii_lowercase\r\n\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\nfor c in ascii_lowercase:\r\n if s.count(c) > k:\r\n print('NO')\r\n sys.exit(0)\r\nprint('YES')", "n, k = map(int, input().split())\r\nastring = input()\r\nadict = {}\r\nans = \"Yes\"\r\nfor i in range(n):\r\n if astring[i] in adict:\r\n adict[astring[i]] += 1\r\n else:\r\n adict[astring[i]] = 1\r\n \r\n if adict[astring[i]] > k:\r\n ans = \"No\"\r\n break\r\nprint(ans)", "#!/usr/bin/python\r\n# -*- coding: UTF-8 -*-\r\n\r\na=input().split(\" \")\r\nb=input()\r\ns={}\r\nfor i in b:\r\n if i in s:\r\n s[i]+=1\r\n else:\r\n s[i]=1\r\nss=0\r\nfor i in s:\r\n if s[i]>int(a[1]):\r\n ss=1\r\n print(\"NO\")\r\n break\r\nif ss == 0:\r\n print(\"YES\")", "a, b = map(int, input().split())\ntext = input()\nfl = 1\nfor i in set(text):\n if text.count(i) > b:\n fl = 0\n break\nprint('YES' if fl else 'NO')", "n, k=map(int , input().split(' '))\r\nballs=input()\r\nletter={'q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l','z','x','c','v','b','n','m'}\r\nfor i in letter:\r\n if (balls.count(i)>k):\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"output4.out\",'w')\r\nn,k=map(int,input().split())\r\na=list(input())\r\nb={}\r\nfor i in a:\r\n\tif i not in b:\r\n\t\tb[i]=1\t\r\n\telse:\r\n\t\tb[i]+=1\r\nprint(\"YES\" if max(b.values())<=k else \"NO\")", "from collections import Counter\r\n\r\ndef main():\r\n\r\n def solve(n, k, s):\r\n c = Counter()\r\n for x in s:\r\n c[x] += 1\r\n if c[x] > k:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n n, k = [int(x) for x in input().split()]\r\n s = input()\r\n print(solve(n, k, s))\r\n\r\nif __name__ == \"__main__\":\r\n import sys, threading\r\n input = sys.stdin.readline\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n thread.join()", "(n, k) = map(int, input().split())\r\n\r\ns = list(input())\r\nprint(\"NO\" if any([s.count(i) > k for i in s]) else \"YES\")\r\n", "n, k = map(int, input().split())\r\ns = list(input())\r\nfriends = {}\r\nfor i in range(1, k + 1):\r\n friends[i] = []\r\nlength = len(s)\r\nfor letter in range(len(s)):\r\n var = s.pop()\r\n for friend in friends.keys():\r\n if var not in friends[friend]:\r\n friends[friend].append(var)\r\n break\r\n else:\r\n continue\r\nsum = 0\r\nfor item in friends.values():\r\n sum += len(item)\r\nif sum == length:\r\n print('YES')\r\nelse:\r\n print('NO')", "# LUOGU_RID: 101672638\nfrom collections import Counter\r\nn, k, s = open(0).read().split()\r\nprint(Counter(s).most_common()[0][1] <= int(k) and 'YES' or 'NO')", "from collections import Counter\r\nn,m = map(int,input().split())\r\ns = input()\r\nd = Counter(s)\r\na = max(d.values())\r\nif a<=m:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "from collections import Counter\r\n\r\ndef solve(k, s):\r\n if Counter(s).most_common(1)[0][1] > k: return \"no\"\r\n return \"yes\"\r\n \r\n\r\nn, k = [int(i) for i in input().split()]\r\ns = input()\r\nprint(solve(k, s))", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nfrom collections import defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nn,k=M()\ns=input().strip()\ns=list(s)\nd=defaultdict(int)\nfor i in range(len(s)):\n d[s[i]]+=1\n#print(d)\ns=list(set(s))\nfor i in range(len(s)):\n if(d[s[i]]>k):\n print(\"NO\")\n exit()\nprint(\"YES\")\n \n", "\r\n\r\n\r\nn, k =[int(x) for x in input().split()]\r\ncolors = str(input())\r\n\r\n\r\nmCount = 0\r\nfor i in colors:\r\n x = i\r\n count = 0\r\n for j in colors:\r\n if(x == j):\r\n count+=1\r\n if(count>mCount):\r\n mCount=count\r\n\r\nif(mCount > k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "A = input().split()\r\nA = [int(i) for i in A]\r\nN = A[0]\r\nK = A[1]\r\ns = input()\r\ns = list(s)\r\ndone = False\r\nfor i in s:\r\n copies_of_i = 0\r\n for j in s:\r\n if j == i:\r\n copies_of_i += 1\r\n if copies_of_i > K:\r\n if done == False:\r\n print(\"NO\")\r\n done = True\r\nif done == False:\r\n print(\"YES\")\r\n", "from collections import Counter\r\ninp1=input().split()\r\nn=int(inp1[0])\r\nk=int(inp1[1])\r\ns=input()\r\n\r\nmyList=sorted(s)\r\nnewList=[]\r\n\r\nfor i in myList:\r\n if i not in newList:\r\n newList.append(i)\r\n\r\nd=0\r\nfor j in range(len(newList)):\r\n num=myList.count(newList[j])\r\n if num>k:\r\n print(\"NO\")\r\n d=1\r\n break\r\nif d==0:\r\n print(\"YES\")\r\n", "\nn,k=map(int,input().split())\ns=list(input(\"\"))\nt=list(map(s.count,s))\nif max(t)>k:\n print(\"no\")\nelse:\n print(\"yes\")\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/10/21 12:11\r\n\r\n\"\"\"\r\n\r\nN, K = map(int, input().split())\r\n\r\nS = input()\r\n\r\nC = collections.Counter(S)\r\n\r\nif max(C.values()) > K:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n, k = [int(x) for x in input().split(' ')]\r\ns = input()\r\nans = 'YES'\r\nfor char in s:\r\n if s.count(char) > k:\r\n ans = 'NO'\r\n break\r\nprint(ans)", "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,k = map(int,input().split())\r\ns = list(input())\r\ns.sort()\r\nnum = 1\r\nnum2 = 0\r\nans = 0\r\nfor i in range(1,n):\r\n if s[i] == s[i-1]:\r\n num += 1\r\n else:\r\n num2 = max(num2,num)\r\n num = 1\r\nnum2 = max(num2,num)\r\nans = int(num2 <= k)\r\nprint(\"YES\" * ans + \"NO\" * (1-ans))\r\n", "n,k=map(int,input().split())\r\nmaps={}\r\nan=0\r\nS=input()\r\nfor s in S:\r\n if s not in maps:\r\n maps[s] = 1\r\n else:\r\n maps[s] += 1\r\n an=max(an,maps[s])\r\nif an > k:\r\n print(\"NO\")\r\nelse:print(\"YES\") ", "a = int(input().split()[1])\r\nc= input()\r\nprint([\"YES\",\"NO\"][max(c.count(i) for i in set(c))>a])\r\n \r\n", "n, k = map(int, input().split())\r\ns = input()\r\n# n = 6\r\n# k = 3\r\n# s = 'aacaab'\r\nbukvi = []\r\nguys = [''] * k\r\nc = 0\r\n\r\n# Какие буквы в строке?\r\nfor i in s:\r\n if not i in bukvi:\r\n bukvi += i\r\n\r\nfor i in bukvi:\r\n if s.count(i) > k:\r\n answer = 'NO'\r\n break\r\n else:\r\n answer = 'YES'\r\n\r\nprint(answer)\r\n", "inp = [int(x) for x in input().split(' ')]\r\ncolors=input()\r\nk=inp.pop()\r\nn=inp.pop()\r\ncolor={}\r\ncopyDict={}\r\n\r\nfor c in colors:\r\n if c in color:\r\n color[c]+=1\r\n else:\r\n color[c]=1\r\n\r\n#kopiramo dictionary\r\ncopyDict = dict(color)\r\nfor key, value in color.items():\r\n color[key]-=k\r\n\r\nfor key, value in color.items():\r\n if(value<=0):\r\n del copyDict[key]\r\n\r\n\r\nif(len(copyDict)==0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = map(int, input().split())\r\ns = input()\r\nfor i in set(s):\r\n if s.count(i) > k:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n\r\n# UBCF\r\n# CodeForcesian\r\n# ♥\r\n# میخوام فریاد بزنم\r\n", "n,k=map(int,input().split())\r\ncount=[0]*(26)\r\nfor el in input():\r\n count[ord(el)-ord(\"a\")]+=1\r\nif max(count)<=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn,k=map(int,input().split())\r\na=list(input())\r\ny=0\r\nfor i in range(0,len(a)):\r\n\tif a.count(a[i])>k:\r\n\t\ty=1\r\nif y==0:\r\n\t\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "import sys\nn, k = map(int, input().split())\narr = input()\ndic = {}\n\nfor i in arr:\n if i in dic:\n dic[i] = dic[i] + 1\n else:\n dic[i] = 1\n\nfor d in dic:\n if dic[d] > k:\n print(\"NO\")\n sys.exit()\nprint(\"YES\")\n", "n,k=map(int,input().split())\r\ns=input()\r\nl=set(s)\r\nm=0\r\nfor i in l:\r\n c=s.count(i)\r\n if(c>m):\r\n m=c\r\nif(m>k):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n,k = map(int,input().split())\r\ns = input()\r\nhas=[0]*(27)\r\nfor i in s:\r\n has[ord(i)-ord('a')]+=1\r\nif max(has)<=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = list(map(int, input().split()))\r\nsl = list(input())\r\nb = {}\r\nfor s in sl:\r\n if s in b.keys():\r\n b[s] += 1\r\n else:\r\n b[s] = 1\r\nbl = b.values()\r\noutput = 'YES'\r\nfor bc in bl:\r\n if bc > k:\r\n output = 'NO'\r\nprint(output)", "n, k = map(int, input().split())\r\na = input()\r\nd = {}\r\nb = 0\r\nfor i in a:\r\n if i in d:\r\n d[i] += 1\r\n if d[i] > k:\r\n b = 1\r\n break\r\n else:\r\n d[i] = 1\r\nif b == 1:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,k = map(int,input().split())\r\n\r\ns = input()\r\n\r\narr = [x for x in s if s.count(x) > k]\r\n\r\nif len(arr) > 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k=list(map(int,input().split()))\r\ns=input()\r\na=list(set(s))\r\nc=0\r\nfor i in range(len(a)):\r\n b=0\r\n for j in range(len(s)):\r\n if a[i]==s[j]:\r\n b=b+1\r\n c=max(c,b)\r\n if c>k:\r\n break\r\nif c>k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\nc = Counter(input())\r\nmaxv = 0\r\nfor x in c:\r\n maxv = max(c[x], maxv)\r\n\r\nif maxv <= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int,input().split())\ns = str(input())\nm=[]\nfor i in s:\n for j in range(n):\n m.append(s.count(i))\nif max(m)>k:\n print('NO')\nelse:\n print('YES')", "n, m = map(int, input().split())\r\ns = input()\r\nb = []\r\ncount = []\r\nfor i in s:\r\n if i in b:\r\n count[b.index(i)] += 1\r\n else:\r\n b.append(i)\r\n count.append(1)\r\nif m == 0:\r\n print(\"YES\")\r\n exit(0)\r\nfor i in count:\r\n if i > m:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\na = [0] * 26\r\ns = input()\r\nfor i in s:\r\n a[ord(i) - ord('a')] += 1\r\na.sort(reverse=True)\r\nif a[0] <= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\ns = input().rstrip()\namount = [0] * 26\nfor i in range(n):\n amount[ord(s[i]) - ord('a')] += 1\nmax_a = 0\nfor i in range(26):\n max_a = max(max_a, amount[i])\nif max_a > k:\n print(\"NO\")\nelse:\n print(\"YES\")", "n,k = map(int,input().split())\r\ns = input()\r\nnew = \"\"\r\nfor i in s:\r\n if i not in new:\r\n new += i \r\nfor i in new:\r\n if s.count(i) > k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n, k = map(int, input().split())\r\ns = input()\r\ns = ' '.join(s)\r\ns = s.split()\r\nost = 0\r\nkol = 0\r\nh = []\r\nfor i in s:\r\n if s.count(i) >= k and i not in h:\r\n ost += 1\r\n elif s.count(i) < k and i not in h:\r\n kol = kol + s.count(i)\r\n h = h + [i]\r\nend = (n - ((ost * k) + kol))\r\nif end == 0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k=[int(x) for x in input().split()]\na=input()\nb=list(a)\nc=set(b)\nd=[]\nfor i in c:\n d.append(b.count(i))\nif(max(d)<=k):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "count = {}\r\nn, k = map(int, input().split())\r\nstring = input()\r\nfor i in range(n):\r\n try:\r\n count[string[i]] += 1\r\n except:\r\n count[string[i]] = 1\r\nMax = 0\r\nfor key in count:\r\n Max = max(Max, count[key])\r\nif Max > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "import operator\r\n\r\nn,f = map(int, input().split())\r\nd = {}\r\n\r\nfor i in input():\r\n if i in d: d[i]+=1\r\n else: d[i]=1\r\n\r\nprint(\"NO\" if d[max(d, key=d.get)] > f else \"YES\")\r\n\r\n", "a,c=map(int,input().split())\r\nb=input()\r\nfor i in b:\r\n\tif b.count(i)>c:\r\n\t\tprint('NO')\r\n\t\texit()\r\nprint('YES')", "n, b=map(int, input().split())\r\na=input()\r\ns=0\r\nfor i in a:\r\n if a.count(i)>s:\r\n s=a.count(i)\r\nif s<=b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "n,k=map(int,input().split())\r\ns=input()\r\nstr1=\"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in str1:\r\n c=0\r\n for j in s:\r\n if i==j:\r\n c=c+1\r\n if c>k:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "a, b =[int(s) for s in input().split()]\r\nc = list(input())\r\nmax = 0\r\nd = list(set(c))\r\nfor i in d:\r\n s = c.count(i)\r\n if max < s:\r\n max = s\r\nif b >= max:\r\n print('Yes')\r\nelse:\r\n print('No')", "n,k = map(int,input().split())\r\na=list(input())\r\na=a[:n]\r\nb=set(a)\r\nc=0\r\nwhile len(b)>0 and c==0:\r\n for i in range(len(b)):\r\n d=b.pop()\r\n if a.count(d)>k or c==1:\r\n c=1\r\n else:\r\n c=0\r\nif c==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "import sys\r\nfrom collections import Counter\r\nn, k = map(int, input().split())\r\nif max(Counter(list(input())).values())>k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n,k=map(int,input().split())\na=input()\nm=0\nwhile a!='':\n m=max(a.count(a[0]),m)\n a=a.replace(a[0],'',-1)\nprint(\"YES\" if m<=k else \"NO\")", "n, k = map(int, input().split())\r\ns = input()\r\ncollors = set()\r\nfor i in s:\r\n collors.add(i)\r\nfor i in collors:\r\n if s.count(i) > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k = map(int, input().split())\r\na = list(input())\r\nout = True\r\nfor i in set(a):\r\n if a.count(i) > k:\r\n out = False\r\n break\r\n \r\nif out:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k = map(int,input().split())\ns = str(input())\nname = {}\nI = 0\nfor key in s:\n # print(key)\n name[key] = name.get(key,0) + 1\n if name[key] > k:\n I+=1\nif I > 0:\n print('NO')\nelse:\n print('YES')\n# print(name)", "n, k = map(int, input().split())\n\ns=str(input())\nm=[]\n\nfor a in s:\n for b in range(n):\n m.append(s.count(a))\nif max(m) > k:\n print(\"NO\")\nelse:\n print(\"YES\")", "import sys \r\nn, k = map(int, input().split())\r\ns = input()\r\nif 0:\r\n\tcontinue\r\nelse:\r\n\tfor i in s:\r\n\t\tif s.count(i) > k:\r\n\t\t\tprint('NO')\r\n\t\t\tsys.exit()\r\n\tprint('YES')", "n, k = map(int, input().split())\r\ns = input()\r\nd={}\r\ncount = 0\r\nfor i in s:\r\n d[i] = d.get(i, 0) + 1\r\nfor value in d.values():\r\n if value > k:\r\n count += 1\r\nif count >= 1:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,k=[int(y) for y in input().split(' ')]\r\ns=[u for u in input()]\r\n\r\nr=k\r\nw=0\r\nk=list(set(s))\r\nd=[]\r\n\r\nfor i in range(len(k)):\r\n e=s.count(k[i])\r\n d.append(e)\r\n\r\nfor y in range(len(d)):\r\n if d[y]>r:\r\n w=1\r\n print(\"NO\")\r\n break\r\n\r\nif w==0:\r\n print(\"YES\")", "n, m = map(int, input().split())\r\nl = input()\r\nprint(\"YES\" if max([l.count(x) for x in l]) <= m else \"NO\")", "b, n = map(int, input().split())\r\nm = list(input().replace('',' ').split())\r\nd = []\r\ng = []\r\nt = 0\r\n\r\nfor i in range(len(m)):\r\n c = m.count(m[i])\r\n d.append(c)\r\n\r\nfor i in range(len(d)):\r\n if d[i] > n:\r\n t += 1\r\n\r\nif t > 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "from collections import defaultdict\r\nn, k = map(int, input().split())\r\n\r\ncounter = defaultdict(int)\r\n\r\nfor c in input():\r\n counter[c] += 1\r\n\r\nprint(['YES', 'NO'][len([1 for c, v in counter.items() if v > k]) > 0])\r\n# print(len([1 for c, v in counter.items() if v > k]))\r\n", "n,k=map(int,input().split())\r\ns=list(input())\r\nl=[]\r\nd=[]\r\nfor i in s:\r\n if i not in d:\r\n d.append(i)\r\n l.append(s.count(i))\r\nc=0\r\nfor j in l:\r\n if j>k:\r\n c=1\r\nif c==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a,b=map(int,input().split())\r\nl=list(input())\r\ns=list(set(l))\r\nf=0\r\nfor x in range(len(s)):\r\n\tif l.count(s[x])>b:\r\n\t\tprint(\"NO\")\r\n\t\tf=1\r\n\t\tbreak\r\nif f==0:print(\"YES\")", "N, K = map(int, input().split())\r\nd_chars = {}\r\n\r\nfor i in input():\r\n if i not in d_chars:\r\n d_chars[i] = 0\r\n d_chars[i] += 1\r\n if d_chars[i] / K > 1:\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")", "inp = [int(x) for x in input().split()]\nn, k = inp[0], inp[1]\ns = input()\nli = [0 for x in range(26)]\nfor c in s:\n li[ord(c) - ord('a')] += 1\nma = max(li)\nif ma > k:\n print('NO')\nelse:\n print('YES')\n", "n,m=list(map(int,input().split()))\r\ns=input()\r\nmp={}\r\nfor i in s:\r\n\tif i not in mp:\r\n\t\tmp.update({i:1})\r\n\telse:\r\n\t\tmp[i]+=1\r\nmaxl=0\r\nfor i in mp:\r\n\tmaxl=max(maxl,mp[i])\r\nif maxl>m:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "n,k=map(int,input().split())\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter\r\ns=stdin.readline().rstrip('\\n')\r\nc=Counter(s)\r\nans=True\r\nfor i in c:\r\n if c[i]>k:\r\n print(\"NO\")\r\n ans=False\r\n break\r\nif ans==True:\r\n print(\"YES\")\r\n \r\n \r\n \r\n", "n,k = list(map(int,input().split()))\ns = input()\nd = {}\nkill = 0\nfor y in s :\n if y in d.keys():\n d[y] += 1\n else:\n d[y] = 1\n\nfor y in d.values():\n if y > k :\n kill = 1\n break\n\nif kill == 0:\n print (\"YES\")\nelse:\n print (\"NO\")\n", "from string import ascii_lowercase\r\n\r\nn, k = (int(x) for x in input().split())\r\ns = input()\r\n\r\nprint('YES' if all(s.count(c) <= k for c in ascii_lowercase) else 'NO')\r\n", "a,c=map(int,input().split())\r\nb=input()\r\ns={}\r\nm=0\r\nfor i in b:\r\n s[i]=s.get(i,0)+1\r\n if int(s[i])>m:\r\n m=int(s[i])\r\nif m<=c:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n \r\n", "n,k=map(int,input().split())\r\na=input()\r\na=list(a)\r\ncount=[]\r\nfor i in a:\r\n count.append(a.count(i))\r\nif max(count)<=k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k = map(int,input().split())\r\nd={}\r\nmaxim=0\r\ns = input()\r\nfor i in s:\r\n d[i] = d.get(i, 0) + 1\r\n if d[i]>maxim:\r\n maxim=d[i]\r\nif maxim>k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "b, c = map(int, input().split())\r\na = input()\r\nd = {}\r\ng=[]\r\nfor i in a:\r\n d[i] = d.get(i, 0) + 1\r\nfor j in d:\r\n if d[j]>c:\r\n g.append('n')\r\n else:\r\n g.append('y')\r\nif 'n' in g:\r\n print('NO')\r\nelse:\r\n print('YES')", "[n,k] = list(map(int, input().split(\" \")))\na = input()\nfor c in a:\n if a.count(c) > k:\n print(\"NO\")\n exit(0)\nprint(\"YES\")\n", "n,k=map(int,input().split(\" \"))\r\ns=input()\r\nl=list(set(s))\r\ncount=[]\r\nfor i in range(len(l)):\r\n count.append(s.count(l[i]))\r\n if(count[i]>k):\r\n print(\"NO\")\r\n c=0\r\n break\r\n else:\r\n c=1 \r\n\r\nif(c>0):\r\n print(\"YES\")\r\n", "n, k = map(int,input().split())\r\ns = input()\r\nx = []\r\ny = []\r\nalf = 'abcdefghijklmnopqrstuvwxyz'\r\nm = 0\r\nfor i in alf:\r\n x.append(i)\r\n q = 0\r\n for f in s:\r\n if i == f:\r\n q = q+1\r\n y.append(q)\r\n if q > m:\r\n m = q\r\nif m > k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n\r\n\r\n", "n,k=map(int,input().split())\r\na=str(input())\r\nb=[]\r\nfor i in a:\r\n b+=[ord(i)]\r\nkol=max(b)+1\r\nc=[0]*kol\r\nfor i in b:\r\n c[i]+=1\r\nfor i in c:\r\n if i>k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n,k = map(int,input().split())\r\ns = input()\r\nletters = [0]*26\r\nfinal = []\r\nfor i in s:\r\n nomer = ord(i)-97\r\n letters[nomer]+=1\r\nfor i in range(26):\r\n if letters[i]>0:\r\n final.append(letters[i])\r\nfinal.sort(reverse=True)\r\nif final[0]>k:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,k=map(int,input().split())\r\na=input()\r\nd={}\r\nfor i in a:\r\n d[i]=d.get(i,0)+1\r\nfor i in d:\r\n if d[i]>k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n\r\n# n,k=map(int,input().split())\r\n# a=input()\r\n# d={}\r\n# kol=0\r\n# kolkol=0\r\n# for i in a:\r\n# d[i]=d.get(i,0)+1\r\n# print(d)\r\n# for i in d:\r\n# if d[i]%k==0:\r\n# kol+=1\r\n# for i in d:\r\n# if d[i]==1:\r\n# kolkol+=1\r\n# if kol==k or kolkol==len(d):\r\n# print('YES')\r\n# else:\r\n# print('NO')\r\n", "n, k = map(int,input().split())\ns = list(input())\nprint(\"YES\" if s.count(max(s,key=s.count))<=k else \"NO\")\n\n", "n,k = list(map(int,input().split()))\r\na = input()\r\nif len(a) == len(set(a)):\r\n print(\"YES\")\r\nelif all(a.count(item) <= k for item in set(a)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nfor i in set(s):\r\n if s.count(i) > k:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")", "n=list(map(int,input().split()))\r\nb=input()\r\nd={}\r\nl=[]\r\nfor i in b:\r\n\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nfor i in d.values():\r\n l.append(i)\r\n\r\nif max(l)>n[1]:\r\n print('NO')\r\n exit()\r\nprint('YES')", "n,k=map(int,input().split())\r\nl=list(input())\r\nd={}\r\nfor x in l:\r\n d[x]=d.get(x,0)+1\r\n if d[x]>k: print('NO'); break\r\nelse: print('YES')", "n,k=map(int,input().split())\r\ns=input()\r\nx=set(s)\r\nfor i in x:\r\n if(s.count(i)>k):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "n,k=map(int,input().split())\r\nfrom collections import Counter\r\ns=list(input())\r\nc=Counter(s)\r\nprint('YES' if max(c[i] for i in c)<=k else 'NO')\r\n", "#!/usr/bin/env python3\r\n\r\nn, k = input().split(' ')\r\nn = int(n)\r\nk = int(k)\r\ns = str(input())\r\nl = list()\r\nfor c in s:\r\n if c in l:\r\n continue\r\n if s.count(c) > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "# lesson 29 lesson 35\r\n# A. Щедрый Кефа\r\n# https://codeforces.com/problemset/problem/841/A\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\nd = {}\r\nfor i in s:\r\n d[i] = d.get(i, 0) + 1\r\n\r\nfor i in d:\r\n if d[i] > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n\r\n# n, k = map(int, input().split())\r\n# s = input()\r\n# letters = [0] * 26\r\n# for i in s:\r\n# number = ord(i) - 97\r\n# letters[number] += 1\r\n#\r\n# for i in range(26):\r\n# if letters[i] > k:\r\n# print('NO')\r\n# break\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", "l = input().split(\" \")\r\nf = int(l[1])\r\nbaloni = input()\r\nboje = list(set(baloni))\r\nodg = \"YES\"\r\n\r\nfor boja in boje:\r\n if baloni.count(boja) > f:\r\n odg = \"NO\"\r\n break\r\n\r\nprint(odg)", "n,m=[int(i) for i in input().split()]\r\ns=str(input())\r\nd=set(s)\r\nans='YES'\r\nfor i in d:\r\n if(s.count(i)>m):\r\n ans='NO'\r\n break\r\nprint(ans)", "n, k = tuple(map(int, input().split()))\r\ns = input()\r\nd = {x : s.count(x) for x in s}\r\nfor i in d.values():\r\n if i > k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "import collections\r\na, b = map(int, input().split())\r\ns = input()\r\ncount = collections.Counter(s).most_common(1)[0][1]\r\n\r\nif count > b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k = map(int,input().split())\r\ns = input()\r\nl = list(s)\r\nd = {}\r\nfor i in l:\r\n if i in d:\r\n d[i] = d[i]+1\r\n\r\n else:\r\n d[i] = 1\r\n\r\nf = 0\r\nfor i in d:\r\n if d[i] > k:\r\n print(\"NO\")\r\n f =1\r\n break\r\n\r\nif f == 0:\r\n print(\"YES\")", "n,k =map(int,input().split())\r\ns = list(input())\r\n# print(s)\r\nc =0\r\nfor i in set(s):\r\n if s.count(i)>k:\r\n c+=1\r\nif c!=0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "a = [0] * 28\r\nn, k = map(int, input().split())\r\ns = str(input())\r\nfor i in s:\r\n a[ord(i) - ord('a')] += 1\r\nif max(a) <= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\ns = list(input())\r\ng = list(set(s))\r\n\r\nfor i in g:\r\n if s.count(i) > k:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\") ", "a,b=map(int,input().split())\r\ns=input()\r\nflag=1\r\nop=0\r\nx=set(s)\r\nq=[[] for x in range(b)]\r\nfor i in range(a):\r\n flag=1\r\n for j in range(b):\r\n if s[i] not in q[j]:\r\n q[j].append(s[i])\r\n flag=0\r\n break\r\n if flag==1:\r\n op=1\r\n print(\"NO\")\r\n break\r\nif op==0:\r\n print(\"YES\")\r\n", "n, k = map(int, input().split())\r\ns = list(input())\r\ncount = 0\r\n\r\nfor i in set(s):\r\n if s.count(i) > k:\r\n count += 1\r\n\r\nprint(\"NO\" if count > 0 else \"YES\")\r\n", "a,b = map(int,input().split())\nc = input()\nfor i in c:\n\tif c.count(i)>b:\n\t\tprint(\"NO\")\n\t\texit()\nprint(\"YES\")\n", "n,k=list(map(int,input().split()))\r\nlist1=[]\r\ns1=input()\r\nfor x in s1:\r\n list1.append(s1.count(x))\r\na=max(list1)\r\nif a>k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n, k = map(int, input().split())\r\ngood = 1\r\na = sorted(input())\r\nfor i in range(k, n):\r\n if a[i] == a[i-k]:\r\n good = 0\r\nprint(['No', 'Yes'][good])", "mn= input().split()\r\nn= int(mn[1])\r\ns= str(input())\r\nk=0\r\nfor i in s:\r\n if s.count(i)>n:\r\n k=2\r\n break\r\nif k==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n,k=list(map(int,input().split()))\r\nlist1=[]\r\ns1=input()\r\nfor x in s1:\r\n list1.append(s1.count(x))\r\n\r\nfor i in list1:\r\n if i>k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n1,n2=map(int,input().split())\r\nstring=input()\r\nflag=False\r\nfor x in range(len(string)):\r\n a=string.count(string[x])\r\n if(a>n2):\r\n flag=True\r\nif(flag):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import Counter\r\n\r\na, b = map(int, input().split())\r\ns = input()\r\nif max(Counter(s).values())/b > 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\ns = list(input().rstrip())\r\ncnt = [0] * 26\r\nfor i in s:\r\n cnt[i - 97] += 1\r\nans = \"YES\" if max(cnt) <= k else \"NO\"\r\nprint(ans)", "from collections import Counter\r\nn, k = map(int, input().split())\r\nd = dict(Counter(list(input())))\r\nfor v in list(d.values()):\r\n if v>k: print('NO'); break\r\nelse: print('YES')\r\n", "allshar, friend_shar = map(int, input().split())\r\nl = {}\r\ncolors = str(input())\r\ny = 0\r\nn = 0\r\nfor i in range(allshar):\r\n if colors[i] in l:\r\n l[colors[i]] += 1\r\n else:\r\n l[colors[i]] = 1\r\nfor i in l:\r\n if l[i] > friend_shar:\r\n n += 1\r\n else:\r\n y += 1\r\nif n > 0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,k=map(int,input().split())\r\na=input()\r\nx,i=0,0\r\nif n>0:\r\n while i<n:\r\n if a.count(a[i])<=k:\r\n i+=1\r\n else:\r\n x+=1\r\n break\r\nif x>0:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,k=map(int,input().split())\r\nstroka=str(input())\r\nkolva={}\r\nfor i in stroka:\r\n kolva[i]=kolva.get(i,0)+1\r\nif max(kolva.values())>k:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,k=map(int,input().split())\r\ns=input()\r\nx=list(set(list(s)))\r\nc=[s.count(x[i]) for i in range(len(x))]\r\nif max(c)>k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n, k = [int(x) for x in input().split()]\r\nl = list(input())\r\ns = list(set(l))\r\nf = -1\r\nfor i in s:\r\n count = 0\r\n for j in l:\r\n if i == j:\r\n count -= -1\r\n f = max(f, count)\r\nif f > k: print(\"NO\")\r\nelse: print(\"YES\")", "n, k = map(int, input().split())\r\ns = input()\r\nlist1 = list(set(s))\r\nfor i in range(len(list1)):\r\n if s.count(list1[i]) > k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n, r = map(int, input().split(' '))\ns = str(input())\nli = set(s)\nli = list(li)\nflag = 0\nfor i in range(0, len(li)):\n a = s.count(li[i])\n if a > r:\n flag = 1\n break\n\nif flag == 1:\n print(\"NO\")\nelse:\n print(\"YES\")\n", "n,k = map(int,input().split())\r\ns = input()\r\nnew = set(s)\r\nif k > n:\r\n print('YES')\r\nelse:\r\n for i in new:\r\n p=s.count(i)\r\n if p > k:\r\n print('NO')\r\n exit()\r\n print('YES')", "from collections import Counter\n(n, k) = map(int, input().split(' '))\ns = input()\nlst = list(s)\ncounts = Counter(lst)\n\nif max(counts.values()) <= k:\n print('YES')\nelse:\n print('NO')", "from collections import Counter\r\nn,k=map(int,input().split())\r\ns=input()\r\n\r\nc=list(Counter(s).values())\r\nif max(c)>k:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "import itertools\r\nimport collections\r\nn, k = list(map(int, input().split()))\r\nwords = input()\r\ncolors = collections.Counter(list(words))\r\nfriends = {}\r\nsuperbreak = 0\r\nfor i in itertools.cycle(list(range(k))):\r\n if sum(colors.values()) == 0:\r\n print('YES')\r\n break\r\n for i2, j in colors.items():\r\n if j > k:\r\n superbreak = 1\r\n break\r\n if j > 0:\r\n colors[i2] -= 1\r\n Get = friends.setdefault(i, [])\r\n friends[i].append(i2)\r\n break\r\n else:\r\n continue\r\n if superbreak == 1:\r\n print('NO')\r\n break", "# Problem URL: https://codeforces.com/problemset/problem/841/A\r\nn,k = list(map(int,input().split()))\r\n\r\ncolors = list(input())\r\n\r\ncolmap = {}\r\nare_friends_happy = True\r\n\r\nfor i in colors:\r\n if i in colmap:\r\n colmap[i]+=1\r\n else:\r\n colmap[i] = 1\r\n \r\n if colmap[i] > k:\r\n are_friends_happy = False\r\n break\r\n\r\nif are_friends_happy:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a,b=input().strip().split(\" \")\r\na,b=[int(a),int(b)]\r\ns=input()\r\nff=1\r\nx=[0 for _ in range(26)]\r\nfor i in s:\r\n x[ord(i)-ord('a')]+=1\r\nfor i in x:\r\n if i>b:\r\n ff=0\r\n break\r\nif ff:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n,k = map(int, input().split())\r\ns = input()\r\n\r\ncnt = [0] * 26\r\n\r\n\r\nfor ch in s:\r\n cnt[ord(ch)-97] += 1 \r\n \r\nif (max(cnt) > k): \r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k=map(int,input().split())\r\ns=input()\r\nj=list(set(s))\r\nflag=0\r\nfor i in j:\r\n\tif s.count(i)>k:\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag == 0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")", "n, k = map(int, input().split())\r\na = {}\r\nfor c in input():\r\n if c not in a:\r\n a[c] = 0\r\n a[c] += 1\r\n if a[c] / k > 1:\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")", "n, k = map(int, input().split())\r\ns = input()\r\nshar = {}\r\np = 0\r\nfor cvet in s:\r\n if cvet in shar:\r\n shar[cvet] += 1\r\n else:\r\n shar[cvet] = 1\r\nfor i in shar:\r\n if shar[i] > p:\r\n p = shar[i]\r\nif p > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, k = map(int, input().split())\r\ns = input()\r\nflag = True\r\nfor c in s:\r\n if s.count(c) > k:\r\n flag = False\r\nprint('Yes' if flag else 'No')\r\n", "nk=input()\r\ns=input()\r\nd={}\r\nn,k = nk.split(' ')\r\nn=int(n)\r\nk=int(k)\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nval=d.values()\r\nfor i in val:\r\n if i > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n, k = map(int, input().split())\r\nballs = {}\r\nfor i in input():\r\n if i not in balls:\r\n balls[i] = 1\r\n else:\r\n balls[i] += 1\r\n\r\nprint('YES' if max(balls.values()) <= k else 'NO')\r\n", "l=[int(e) for e in input().split()]\r\nch=input()\r\ni=0\r\nverif=True\r\nwhile(verif==True and i<len(ch)):\r\n if(ch.count(ch[i])>l[1]):\r\n verif=False\r\n else:\r\n i+=1\r\nif(verif):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") ", "a,b=map(int,input().split())\r\nc=input()\r\nd={}\r\nfor i in c:\r\n d[i]=d.get(i,0)+1\r\nm=max(d.values())\r\nif m>b:\r\n print('NO')\r\nelse:\r\n print('YES')", "n, k = [int(i) for i in input().split()]\r\nS = input()\r\nK = list(set([i for i in S]))\r\nkk = 0\r\nfor i in K:\r\n if S.count(i) // k == 0 or (S.count(i) // k == 1 and S.count(i) % k== 0):\r\n kk = 0\r\n else:\r\n kk = 1\r\n break\r\nif kk == 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = map(int, input().split())\r\ns = input()\r\nd = {}\r\nfor i in s:\r\n d[i] = d.get(i,0) + 1\r\nif max(d.values()) <= k:\r\n print('YES')\r\nelse:\r\n print('NO')", "n, k = map(int, input().split())\r\ns = [i for i in input()]\r\ns.sort()\r\nok = True\r\nfor i in range(26):\r\n cnt = s.count(chr(97 + i))\r\n if (cnt > k):\r\n ok = False\r\n break\r\nif (ok): print(\"YES\")\r\nelse: print(\"NO\")\r\n", "n, k = map(int, input().split())\r\ns = input()\r\narr = ['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\nresult = False\r\nfor i in arr:\r\n if s.count(i)<=k:\r\n result = True\r\n else:\r\n result = False\r\n break\r\nprint(\"YES\" if result is True else \"NO\")\r\n", "n,k=map(int,input().split())\r\na=str(input())\r\nl=len(a)\r\nf=1\r\nfor i in range (l):\r\n\ts=a.count(a[i])\r\n\tif s>k:\r\n\t\tf=0\r\n\t\tbreak\r\nif f==0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "a = input().split()\r\ns = list(input())\r\nd = {}\r\ng = []\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nfor j in d:\r\n g.append(d[j])\r\nif max(g) <= int(a[1]):\r\n print('YES')\r\nelse:\r\n print('NO')", "nk = list(map(int, input().split()))\r\ns = str(input())\r\nb = []\r\naccept = 0\r\nfor i in range(nk[0]):\r\n\tif s[i] not in b:\r\n\t\tb.append(s[i])\r\n\t\ttemp = 1\r\n\t\tfor j in range(i + 1, nk[0]):\r\n\t\t\tif s[j] == s[i]:\r\n\t\t\t\ttemp += 1\r\n\t\t\t\tif temp > nk[1]:\r\n\t\t\t\t\taccept = 1\r\nif accept == 0:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n, k = map(int, input().split())\r\nname = input()[:n]\r\nname = list(name.lower())\r\nfor i in set(name):\r\n if name.count(i) > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "n,k = map(int,input().split())\r\ns = input()\r\na=[0]*123\r\nfor i in s :\r\n a[ord(i)]+=1\r\nif max(a)>k :\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,k=[int(x) for x in input().split()]\r\ns=input()\r\nlst=[0]*123\r\nfor i in s:\r\n lst[ord(i)]+=1\r\ncheck=0\r\nfor i in lst:\r\n if i>k:\r\n check=1\r\n break\r\nif check==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "# cook your dish here\r\na = input().split()\r\nn = int(a[0])\r\nkp = int(a[1])\r\ns = input()\r\ndic = {}\r\n\r\nfor i in s:\r\n dic[i] = dic.get(i, 0)+1\r\n\r\nlst = []\r\n\r\nfor k, v in dic.items():\r\n lst.append(v)\r\n \r\nlst.sort()\r\n\r\nif lst[len(lst)-1] > kp:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\ndef solve():\r\n n,k=map(int,input().split());a=list(input());s=Counter(a)\r\n if max(s.values())>k:print(\"NO\");return\r\n print(\"YES\")\r\nsolve()\r\n \r\n ", "n, k = [int(x) for x in input().split()]\r\ndict = {}\r\ncolor = list(input())\r\nfor i in range (n):\r\n if dict.get(color[i]) == None:\r\n dict[color[i]] = 1\r\n else:\r\n dict[color[i]] += 1\r\nif max(dict.values()) > k:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n, k = map(int, input().split())\r\ns = input().lower()\r\n\r\nm = [0]*26\r\nMax = 0\r\n\r\nfor i in range(n):\r\n b = ord(s[i]) - 97\r\n m[b] += 1\r\n if m[b] > Max:\r\n Max = m[b]\r\n\r\nif Max > k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n, k = [int(j) for j in input().split()]\r\ns = str(input())\r\nfreq = 26 * [0]\r\noutput = \"YES\"\r\nfor j in range(len(s)):\r\n index = ord(s[j]) - 97\r\n freq[index] += 1\r\n if freq[index] > k:\r\n output = \"NO\"\r\n break\r\nprint(output)\r\n", "n,m = [int(i) for i in input().split()]\r\ns = input()\r\nk = list(set(s))\r\nans = 'YES'\r\nfor i in range(len(k)):\r\n\tk[i] = s.count(k[i])\r\n\tif k[i]>m:\r\n\t\tans = 'NO'\r\n\t\tbreak\r\nprint(ans)\r\n", "n,k=list(map(int,input().split()))\r\nt=list(input())\r\nb=list(set(t))\r\nr=0\r\nfor i in b:\r\n if t.count(i)>k:\r\n print('NO')\r\n break\r\n else:\r\n r+=1\r\nif r==len(b):\r\n print('YES')\r\n", "from collections import defaultdict\r\nn, k = map(int, input().split())\r\nbaloons = defaultdict(int)\r\nfor color in input():\r\n\tbaloons[color] += 1;\r\nfor key in baloons:\r\n\tif (baloons[key] > k):\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "n,k = list(map(int,input().split()))\r\nbaloons = input()\r\ncnt = dict()\r\nfor c in baloons:\r\n if c not in cnt:\r\n cnt[c] = 1\r\n else:\r\n cnt[c] += 1\r\nif max(cnt.values()) > k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\nsys.setrecursionlimit(99999)\r\n\r\n\r\nn,k = map(int,input().split())\r\ns = input()\r\nfor c in string.ascii_lowercase:\r\n if s.count(c)>k:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n \r\n\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nletters=[0]*26\r\nfor i in s.lower():\r\n nomer=ord(i)-97\r\n letters[nomer]+=1\r\nif max(letters)<=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n,k = [int(i) for i in input().split()]\na = list(input())\n\ndef ballon():\n d = {}\n for i in a:\n if i in d:\n d[i] += 1\n else:\n d[i] = 1\n #print(d)\n for i in d.values():\n if i>k:\n return 'NO'\n return 'YES'\nprint(ballon())\n", "import sys\r\nimport collections\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef printnl(val):\r\n sys.stdout.write(str(val) + '\\n')\r\n\r\n\r\nn, k = map(int, input().split())\r\ns = input().split()\r\ns = s[0]\r\ncounts = collections.defaultdict(int)\r\n\r\nfor i in s:\r\n counts[i] += 1\r\n\r\nfor i in range(k):\r\n for key in counts.keys():\r\n if counts[key] > 0:\r\n counts[key] -= 1\r\n\r\n# print(counts)\r\nfor key in counts.keys():\r\n if counts[key] > 0:\r\n print('NO')\r\n sys.exit(0)\r\n\r\nprint('YES')\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nd=dict.fromkeys(list('qwertyuiopasdfghjklzxcvbnm'),0)\r\nfor i in s:\r\n d[i]+=1\r\nfor i in d.values():\r\n if i>k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')", "n,k=list(map(int,input().strip().split()))\r\na=input()\r\ns=set(a)\r\nfor i in s:\r\n if a.count(i)==1:\r\n pass\r\n elif a.count(i)>1 and a.count(i)<=k:\r\n pass\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "ai,bi=map(int,input().split())\r\nstri=str(input())\r\n\r\na=stri.count(\"n\")\r\nb=stri.count(\"b\")\r\nc=stri.count(\"v\")\r\nd=stri.count(\"c\")\r\ne=stri.count(\"x\")\r\nf=stri.count(\"z\")\r\ng=stri.count(\"l\")\r\nh=stri.count(\"k\")\r\ni=stri.count(\"j\")\r\nj=stri.count(\"m\")\r\nk=stri.count(\"h\")\r\nl=stri.count(\"g\")\r\nm=stri.count(\"f\")\r\nn=stri.count(\"d\")\r\no=stri.count(\"s\")\r\np=stri.count(\"a\")\r\nq=stri.count(\"p\")\r\nr=stri.count(\"o\")\r\ns=stri.count(\"i\")\r\nt=stri.count(\"u\")\r\nu=stri.count(\"y\")\r\nv=stri.count(\"t\")\r\nw=stri.count(\"r\")\r\nx=stri.count(\"e\")\r\ny=stri.count(\"w\")\r\nz=stri.count(\"q\")\r\nif (a>bi or b>bi or c>bi or d>bi or e>bi or f>bi or g>bi or h>bi or i>bi or j>bi or k>bi or l>bi or m>bi or n>bi or o>bi or p>bi or q>bi or r>bi or s>bi or t>bi or u>bi or v>bi or w>bi or x>bi or y>bi or z>bi):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n\r\n", "n,k=map(int,input().split())\r\ns=input()\r\na=[0]*26\r\nfor c in s:\r\n a[ord(c)-ord('a')]+=1;\r\n if a[ord(c)-ord('a')]>k:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "n,k = map(int,input().split())\r\nl = sorted(input())\r\n\r\nif k >= n:\r\n print(\"YES\")\r\nelse:\r\n s = set(l)\r\n t = 0\r\n for x in s:\r\n t = l.count(x)\r\n if t > k:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "b_a = input()\ns = input()\nbalao, amigos = b_a.strip().split(' ')\nn = int(balao)\nk = int(amigos)\nbaloes_unicos = []\ncond = True\nif n >= 1 and n <= 100 and k >= 1 and k <= 100 and n == len(s):\n for i in s:\n if i not in baloes_unicos:\n baloes_unicos += [i]\n for i in baloes_unicos:\n if k < s.count(i):\n print('NO')\n cond = False\n break\n if cond:\n print('YES')\n\n# 1506199114646\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\ncount = [0] * 26\r\nfor i in s:\r\n count[ord(i) - 97] += 1\r\n\r\n# for i in range(26):\r\n# if count[i] > 0:\r\n# print(chr(i + 97), count[i])\r\n\r\nprint('NO' if max(count) > k else 'YES')\r\n", "from collections import Counter\r\nn, m = map(int, input().split())\r\ns = input()\r\ncount = Counter(s)\r\nfor i in count.values():\r\n if i > m:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "\r\nfrom collections import Counter\r\nn, k = map(int, input().split())\r\n# print('YES' if k >= max(Counter(input()).values()) else 'NO')\r\ns=input()\r\nd={}\r\nfor i in s:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nif k>=max(d.values()):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nn,k=map(int,input().split())\r\ns=input()\r\nh=set(s)\r\nfor i in h:\r\n if s.count(i)>k:\r\n print('NO')\r\n sys.exit()\r\nprint('YES')", "n,m=map(int,input().split())\r\na=list((input()))\r\nb=list(set(a))\r\nx=[a.count(b[i]) for i in range(len(b))]\r\nif max(x)>m:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")", "a=[0]*28\r\nn,k=map(int,input().split())\r\ns=str(input())\r\nfor i in s:\r\n a[ord(i)-ord('a')]+=1\r\nif max(a)<=k:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n ", "a,b=map(int,input().split())\r\ns=str(input())\r\nprint('YES' if max([s.count(i) for i in s]) <=b else 'NO')", "n,m = map(int,input().split())\r\nlist = input()\r\nk = int(1)\r\nfor i in list:\r\n if list.count(i) > m:\r\n k = 0\r\nprint('NO' if k == 0 else 'YES' )\r\n\r\n\r\n", "d = {}\r\nn, k = map(int, input().split())\r\ns = input()\r\nfor i in s:\r\n d[i] = d.get(i, 0) + 1\r\notvet = 0\r\nfor i in d:\r\n if d[i] > k:\r\n otvet+=1\r\nif otvet>0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n, k = map(int, input().split())\r\ns = input().lower()\r\nc = [0] * 26\r\nfor i in s:\r\n nmb = ord(i) - 97\r\n c[nmb] += 1\r\nx = max(c)\r\nif x > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "num = input().split()\r\nballoons_original = input()\r\nballoons = []\r\nresult = \"\"\r\nfor j in balloons_original:\r\n balloons.append(j)\r\nfor i in range(int(num[0])):\r\n if balloons.count(balloons[i]) > int(num[1]):\r\n result = \"NO\"\r\n break\r\nif result == \"\":\r\n result = \"YES\"\r\nprint(result)", "n,k = map(int,input().split())\r\nl = input()\r\n\r\nif k >= n:\r\n print(\"YES\")\r\nelse:\r\n for x in l:\r\n t = l.count(x)\r\n if t > k:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "n, k = map(int, input().split())\na = list(input())\ny = 0\nfor i in range(0, len(a)):\n if a.count(a[i]) > k:\n y = 1\nif y == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\n\n\n \n\n\n\n", "n, k = map(int, input().split())\r\n\r\nhas = dict()\r\n\r\ndaf = list(input())\r\n\r\nfor i in range(n):\r\n if daf[i] in has.keys():\r\n has[daf[i]] += 1\r\n else:\r\n has[daf[i]] = 1\r\n\r\nfor x in has.values():\r\n if x > k:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n", "n, k = map(int, input().split())\nfrom collections import Counter\ns = Counter(list(input()))\nfor i in s:\n\tif s[i]/k > 1:\n\t\tprint('NO')\n\t\texit()\nprint ('YES')", "n, k = map(int, input().split())\r\ns = input()\r\ns = list(s)\r\nnumbers = []\r\ncount = []\r\nfor i in range(len(s)):\r\n numbers.append(ord(s[i]))\r\nfor i in numbers:\r\n count.append(numbers.count(i))\r\nif max(count) > k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "n, k = map(int, input().split())\r\nballoons_color = sorted(input())\r\ndic = {}\r\nfor x in balloons_color:\r\n\tif x in dic:\r\n\t\tdic[x] += 1\r\n\telse:\r\n\t\tdic[x] = 1\r\nif int(max(dic.values())) > k:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n", "n,m=map(int,input().split())\r\ns=input()\r\nans=\"YES\"\r\nfor i in [s.count(k) for k in set(s)]:\r\n if(i>m):\r\n ans=\"NO\"\r\n break\r\nprint(ans)", "n, k = map(int,input().split())\r\ns = input()\r\na = 'YES'\r\nfor i in s:\r\n if s.count(i) > k:\r\n a = 'NO'\r\n break\r\nprint(a)\r\n", "n, k = [ int(i) for i in input().strip().split(' ')]\r\nf = [ 0 for i in range(26)]\r\ns = input().strip()\r\nfor i in s:\r\n\tf[ord(i)-ord('a')] = f[ord(i)-ord('a')] + 1\r\nif max(f)>k:\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')", "n, k = map(int, input().split())\r\ns = input()\r\nd = {}\r\ncount = 0\r\nfor i in s:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\nfor j in d:\r\n if d[j]>k:\r\n count+=1\r\n\r\nif count>0:\r\n print('NO')\r\nelse:\r\n print('YES')", "string = input().split(\" \")\nqtd = int(string[0])\namigos = int(string[1])\ncores = input()\na = b = c = d = e = f = g = i2 = j = k =l =m =n =o =p =q = r= s= t =u= v =w =x =y =z = 0\nh = 0\n\nfor i in range(qtd):\n if cores[i] == 'a':\n a = a+1\n if cores[i] == 'b':\n b = b+1\n if cores[i] == 'c':\n c = c+1\n if cores[i] == 'd':\n d = d+1\n if cores[i] == 'e':\n e = e+1\n if cores[i] == 'f':\n f = f+1\n if cores[i] == 'g':\n g = g+1\n if cores[i] == 'h':\n h = h+1\n if cores[i] == 'i':\n i2 = i2+1\n if cores[i] == 'j':\n j = j+1\n if cores[i] == 'k':\n k = k+1\n if cores[i] == 'l':\n l = l+1\n if cores[i] == 'm':\n m = m+1\n if cores[i] == 'n':\n n = n+1\n if cores[i] == 'o':\n o = o+1\n if cores[i] == 'p':\n p = p+1\n if cores[i] == 'q':\n q = q+1\n if cores[i] == 'r':\n r = r+1\n if cores[i] == 's':\n s = s+1\n if cores[i] == 't':\n t = t+1\n if cores[i] == 'u':\n u = u+1\n if cores[i] == 'v':\n v = v+1\n if cores[i] == 'w':\n w = w+1\n if cores[i] == 'x':\n x = x+1\n if cores[i] == 'y':\n y = y+1\n if cores[i] == 'z':\n z = z+1\nif a > amigos or b > amigos or c > amigos or d > amigos or e > amigos or f > amigos or g > amigos or h > amigos or i2 > amigos or j > amigos or k > amigos or l > amigos or m > amigos or n > amigos or o > amigos or p > amigos or q > amigos or r > amigos or s > amigos or t > amigos or u > amigos or w > amigos or x > amigos or y > amigos or z > amigos:\n print(\"NO\")\nelse:\n print(\"YES\")\n\n# 1507382296106\n", "a,b=map(int,input().split())\r\nl=input()\r\nfor i in 'qwertyuiopasdfghjklzxcvbnm':\r\n if l.count(i)>b:\r\n print('NO')\r\n break\r\n else:\r\n if i=='m':\r\n print('YES')", "bl,fr=map(int,input().split())\r\ncolr=[c for c in list(input())]\r\nchd=[]\r\nfor i in colr:\r\n if i not in chd:\r\n chd+=[i] #Чтобы не повторять подсчет с уже известными буквами.\r\n if colr.count(i)>fr: # Если кол-во каких-то букв больше чем друзей... \r\n break # то логично, что мы не сможем распределить...\r\nprint('NO' if colr.count(i)>fr else 'YES') # все буквы не повторяя их.\r\n#https://codeforces.com/problemset/problem/841/A?locale=ru", "from collections import defaultdict\r\n\r\ndef failed():\r\n print('NO')\r\n exit()\r\n\r\ndef passed():\r\n print('YES')\r\n exit()\r\n\r\n\r\nbaloons, friends = map(int, input().split())\r\n\r\ntypes = defaultdict(int)\r\n\r\nfor x in list(input()):\r\n types[x] += 1\r\n\r\n# no friend should get 2 same colors\r\n# means there should not be any baloon's count > k\r\n\r\nif(max(types.values()) > friends):\r\n failed()\r\nelse:\r\n passed()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# # print(len(types))\r\n# if(len(types) == 0 or ballons<(2*friends)):\r\n# failed()\r\n\r\n# if(min(types.values()) > 1 ):\r\n# passed()\r\n# else:\r\n# failed()\r\n\r\n# print(types.values())", "shar,drug=map(int, input().split())\r\ncvet=input()\r\ncvet_n=[0]*26\r\nfor i in cvet:\r\n nomer=ord(i)-97\r\n cvet_n[nomer]+=1\r\ncvet_n.sort(reverse=True)\r\nmxc=max(cvet_n)\r\nif mxc<=drug:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=map(int,input().split())\r\ns=input()\r\na=[0]*26\r\nfor p in s:\r\n\ta[ord(p)-ord(\"a\")]+=1\r\nfor i in range(26):\r\n\tif a[i]>k:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "n,k=map(int,input().split())\r\ns=input()\r\na=[]\r\nfor i in range(n):\r\n\tx=s.count(s[i])\r\n\ta.append(x)\r\n# print(a)\t\r\nif max(a)<=k:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "from collections import Counter\r\nn, k = map(int, input().split())\r\nprint(\"YES\" if all(i <= k for i in Counter(input()).values()) else \"NO\")", "n , k = map(int,input().split())\r\ns = input()\r\nd = dict()\r\n\r\nfor i in s :\r\n if i not in d :\r\n d[i] = 1\r\n\r\n else:\r\n d[i] +=1\r\n\r\nx = list(d.values())\r\nfor i in x :\r\n if i > k :\r\n print('NO')\r\n exit()\r\nelse:\r\n print('YES')\r\n", "from math import sqrt\r\n\r\n\r\ndef main():\r\n a, b = [int(v) for v in input().split()]\r\n d = input()\r\n for c in set(d):\r\n if len([v for v in d if v==c])>b:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\na = input()\r\na = a.lower()\r\nf = [0] * 26\r\nfor i in a:\r\n f[ord(i) - 97] += 1\r\nif max(f) > k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "a,b = map(int,input().split())\r\nn = input()\r\nletters=[0]*26\r\nfor i in n:\r\n if i >= 'a' and i<='z':\r\n nomer = ord(i) - 97\r\n letters[nomer]+=1\r\ns=0\r\nfor i in range(26):\r\n if letters[i] > b:\r\n s+=1\r\nif s==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n,k=map(int,input().split())\r\nshariki=input()\r\nslov={}\r\nfor i in shariki:\r\n slov[i]=slov.get(i,0)+1\r\n if k<slov[i]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\n\r\nc = Counter(s)\r\n\r\nprint(('NO', 'YES')[max(c.values()) <= k])\r\n", "n, k = map(int, input().split())\nl = input()\nres = [0]*26\ncount = []\nfor i in l:\n index = ord(i)-97\n res[index] += 1\nif max(res)<=k:\n print('YES')\nelse:\n print('NO')", "def main():\n [__, n_friends] = [int(_) for _ in input().split()]\n colors = input()\n count = {}\n no = False\n\n for c in colors:\n count_c = count.get(c, 0) + 1\n\n if count_c > n_friends:\n no = True\n break\n else:\n count[c] = count_c\n\n print('NO' if no else 'YES')\n\n\nif __name__ == '__main__':\n main()\n", "bal, friends = map(int, input().split())\r\n\r\nballs = input()\r\n\r\nl = set(balls)\r\n\r\nfor x in l:\r\n if balls.count(x) > friends:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "(n, k) = list(map(int, input().split()))\r\ns = input()\r\n\r\ncounts = [s.count(ch) for ch in set(s)]\r\n\r\nif len(list(filter(lambda x: x > k, counts))) > 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n ", "n,k=map(int,input().split())\r\na=input()\r\nb=[0]*123\r\nfor i in a:\r\n b[ord(i)]+=1\r\n#print(max((b)))\r\nif max(b)>k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "y = input().split(\" \")\na = int(y[0])\nb = int(y[1])\nstr = input()\nfor i in range(0, a):\n soma = 0\n x = str[i]\n #print(x)\n for j in range(0, a):\n if x==str[j]:\n soma = soma + 1\n if soma>b:\n break\nif soma>b:\n print(\"NO\")\nelse:\n print(\"YES\")\n# 1507497601561\n", "a={}\r\nn,k = map(int,input().split())\r\nfor i in input():\r\n if i in a:\r\n a[i] +=1\r\n else:\r\n a[i] = 1\r\n#print(a,(sum(a.values())))\r\nif max(a.values()) > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "from collections import Counter\n\nn, k = (int(i) for i in input().split())\ncnt = Counter(input())\nres = \"YES\" if all(v <= k for v in cnt.values()) else \"NO\"\nprint(res)\n\n", "n,f=map(int,input().split())\r\nl=list(input())\r\np=[]\r\nfor i in range(n):\r\n\tif l[i] not in p:\r\n\t\tp.append(l[i])\r\nm=[]\r\nfor i in range(len(p)):\r\n\ts=l.count(p[i])\r\n\tm.append(s)\r\nc=0\r\nfor i in range(len(m)):\r\n\tif m[i]>f:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\telse:\r\n\t\tc+=1\r\n\t\tif c==len(m):\r\n\t\t\tprint(\"YES\")", "arr=input().split()\r\nn=int(arr[0])\r\nk=int(arr[1])\r\nline=input()\r\nmass=[]\r\nfor i in range(len(line)):\r\n mass+=line[i]\r\nfor i in range(len(mass)):\r\n mass[i]=ord(mass[i])\r\nmass.sort()\r\nsame=1\r\nc=1\r\nif len(mass) == 1:\r\n print('yes')\r\nelse:\r\n for i in range(len(mass)-1):\r\n if mass[i]==mass[i+1]:\r\n c+=1\r\n if c>same:\r\n same=c\r\n if mass[i]!=mass[i+1]:\r\n c=1\r\n if same>k:\r\n print('no')\r\n else:\r\n print('yes')\r\n\r\n", "n, k = map(int, input().split())\r\ns = input()\r\nprint('YES' if max([s.count(i) for i in s]) <= k else 'NO')", "n, k = map(int, input().split())\r\ns = input()\r\nletters = {}.fromkeys(s, 0)\r\n\r\nfor i in s:\r\n letters[i] += 1\r\n\r\nif max(letters.values()) > k:\r\n print('NO')\r\nelse:\r\n print('YES')", "n,k=[int(w) for w in input().split()]\r\ns=input()\r\ns1=set([w for w in s])\r\nd={a:s.count(a) for a in s1}\r\nm=max(d.values())\r\nif m<=k:\r\n print('YES')\r\nelse:\r\n print('NO')", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-08 23:57:03\nLastEditTime: 2021-11-09 00:00:03\nDescription: Generous Kefa\nFilePath: CF841A.py\n'''\n\n\ndef func():\n _, k = map(int, input().strip().split())\n s = list(input().strip())\n for item in set(s):\n if s.count(item) > k:\n print(\"NO\")\n break\n else:\n print(\"YES\")\n\n\nif __name__ == '__main__':\n func()\n", "n,k=map(int,input().split(' '))\r\ns=input()\r\nl=[]\r\nalpha='abcdefghijklmnopqrstuvwxyz'\r\nfor i in range(0,26):\r\n l.append(s.count(alpha[i]))\r\nif max(l)>k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "from collections import Counter\r\n\r\nn, k = map(int, input().split())\r\nc = Counter(input()).most_common(1)\r\nif c[0][1] <= k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "from collections import defaultdict\r\nn, k = map(int,input().split())\r\ns=input()\r\nvisited=set()\r\ngen=defaultdict()\r\nfor i in s:\r\n if i in visited:\r\n gen[i]+=1\r\n if gen[i]>k:\r\n print(\"NO\")\r\n break\r\n else:\r\n gen[i]=1\r\n\r\n visited.add(i)\r\nelse:\r\n print(\"YES\")", "n, k = map(int, input().split())\r\ns, d = input(), {}\r\nfor i in s:\r\n if i not in d: d[i] = 1\r\n else: d[i] += 1\r\nfor key, value in d.items():\r\n if value <= k: d[key] = \"YES\"\r\n else: d[key] = \"NO\"\r\nif \"NO\" not in d.values():print(\"YES\")\r\nelse: print(\"NO\")\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nl=[0]*26\r\nf=0\r\nif(n==0):\r\n print(\"YES\")\r\nelse:\r\n for i in s:\r\n l[ord(i)-97]+=1\r\n for i in l:\r\n if(i<=k):\r\n continue\r\n else:\r\n f+=1\r\n break\r\n if(f==1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n ", "N , K = map(int,input().split())\r\nS = list(input())\r\nprint(['YES','NO'][any(K<S.count(x) for x in set(S))])", "\r\n# n, friends = map(int, input().split())\r\n# balloons_color = sorted(input().lower())\r\n# dic = {}\r\n# for x in balloons_color:\r\n# \tif x in dic:\r\n# \t\tdic[x] += 1\r\n# \telse:\r\n# \t\tdic[x] = 1\r\n# if int(max(dic.values())) > friends:\r\n# \tprint(\"NO\")\r\n# else:\r\n# \tprint(\"YES\")\r\n\r\n\r\n# --- Щедрый Кефа (мое решение)---\r\nn, friends = map(int, input().split())\r\nballoons_color = sorted(input().lower())\r\nif any(balloons_color.count(i) > friends for i in balloons_color):\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n", "n,k=map(int,input().split())\r\ns=input()\r\noutput=0\r\nfor ch in \"abcdefghijklmnopqrstuvwxyz\":\r\n if(s.count(ch)>k):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗ \r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝ \r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\" \r\n__author__ = \"Dilshod\"\r\nn, m = list(map(int, input().split()))\r\ns = input()\r\na = list(set(s))\r\nfor i in range(len(a)):\r\n\tb = s.count(a[i])\r\n\tif b > m:\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")\r\n", "n,k = map(int,input().split())\r\nh = list(input())\r\ng = [(h.count(i),i) for i in set(h) ]\r\nprint(['YES','NO'][max(g)[0]>k])", "n,k = map(int,input().split())\r\ns = map(str,input())\r\ns =[*s]\r\nfound = False\r\nfor i in s:\r\n if s.count(i) > k:\r\n print('NO')\r\n found = True\r\n break\r\nif not found:\r\n print('YES')\r\n\r\n\r\n", "a,b = list(map(int,input().split()))\r\ns = input()\r\n\r\nsl = {}\r\nfl = True\r\nfor i in range(len(s)):\r\n if not s[i] in sl:\r\n sl[s[i]] = 1\r\n else:\r\n sl[s[i]] = sl[s[i]] + 1\r\n\r\n if sl[s[i]] > b:\r\n fl = False\r\n break\r\n\r\nif fl == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "k=int(input().split()[1])\r\nprint('YNEOS'[max(map(input().count,map(chr,range(97,123))))>k::2])", "def solve(s,n,k):\n d= {}\n for c in s:\n if d.get(c):\n d[c]+=1\n else:\n d[c] = 1\n for i in d:\n if d[i] > k:\n return 'NO'\n return 'YES'\n \n \n\n\n\n\n \n\n \ndef main() :\n # s = input()\n # n = int(input())\n arr = list(map(int, input().split(' ')))\n s = input()\n # res=''\n # for _ in range(n):\n # i = input()\n # arr.append(i)\n print(solve(s,*arr))\nmain()\n", "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nn,k=map(int,input().split())\r\ns=list(str(input()))\r\np=list(set(s))\r\nm=0\r\nfor i in range(len(p)):\r\n if s.count(p[i])>k:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")" ]

[ "n = int(input())\r\nstones = list(map(lambda t : int(t), input().split()))\r\nq = int(input())\r\nqueries = list(map(lambda t : int(t), input().split()))\r\n\r\nstones.sort()\r\n\r\nadded_stones = []\r\nadded_stones.append(stones[0])\r\nfor i in range(1, n, 1):\r\n added_stones.append(stones[i] + added_stones[i - 1])\r\n\r\ncomputed_queries = {}\r\n\r\nfor qidx, qq in enumerate(queries):\r\n if qq in computed_queries:\r\n queries[qidx] = computed_queries[qq]\r\n continue\r\n\r\n i = n - 2\r\n multiplier = 1\r\n cost = 0\r\n while i >= 0:\r\n pp = pow(qq, multiplier)\r\n nexti = i - pp\r\n if nexti < 0:\r\n cost += added_stones[i] * multiplier\r\n break\r\n cost += (added_stones[i] - added_stones[nexti]) * multiplier\r\n multiplier += 1\r\n i = nexti\r\n queries[qidx] = cost\r\n computed_queries[qq] = cost\r\n\r\nprint(*queries, sep=' ')" ]

[ "a = input()\r\nb = input()\r\nd = 0\r\nf = []\r\n\r\nif not len(a) == len(b):\r\n print('NO')\r\nelse:\r\n for i in range(len(a)):\r\n if not a[i] == b[i]:\r\n d += 1\r\n if d == 3:\r\n break\r\n f.append([a[i], b[i]])\r\n\r\n if d == 2:\r\n print('YES' if f[0][0] == f[1][1] and f[0][1] == f[1][0] else 'NO')\r\n else:\r\n print('NO')\r\n", "S1, S2, Dif = input(), input() , []\r\nif len(S1) != len(S2): print(\"NO\"); exit()\r\nfor i in zip(S1 , S2):\r\n if i[0] != i[1]:\r\n Dif.append(sorted(i))\r\nprint(\"YES\" if len(Dif)==2 and Dif[0]==Dif[1] else \"NO\")\r\n\r\n# Show you deserve being the best to whom doesn't believe in you.\r\n", "str1 = input()\r\nstr2 = input()\r\n\r\nif(len(str1)!=len(str2)):\r\n print(\"NO\")\r\nelse:\r\n freq_1 = [0]*26\r\n freq_2 = [0]*26\r\n \r\n ct = 0\r\n flag = 0\r\n str1_list = []\r\n str2_list = []\r\n for i in range(len(str1)):\r\n freq_1[ord(str1[i])-97]+=1\r\n freq_2[ord(str2[i])-97]+=1\r\n \r\n if(str1[i]!=str2[i]):\r\n ct+=1\r\n if(ct>2):\r\n flag = 1\r\n break\r\n else:\r\n str1_list.append(str1[i])\r\n str2_list.append(str2[i])\r\n \r\n if(flag==1):\r\n print(\"NO\")\r\n else:\r\n freq_flag = 0\r\n for i in range(len(freq_1)):\r\n if(freq_1[i]!=freq_2[i]):\r\n freq_flag = 1\r\n break\r\n \r\n if(freq_flag==1):\r\n print(\"NO\")\r\n else:\r\n if(str1_list[0]==str2_list[1] and str1_list[1]==str2_list[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", "# author: violist\r\n# created: 26.06.2022 12:53:28\r\n\r\nimport sys\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\n\r\na = input()[:-1]\r\nb = input()[:-1]\r\nif (len(a) != len(b)):\r\n print(\"NO\")\r\n sys.exit()\r\nn = len(a)\r\ncnt = 0\r\nfor i in range(n):\r\n if (a[i] != b[i]):\r\n cnt += 1\r\nx, y = defaultdict(lambda : 0), defaultdict(lambda : 0)\r\nfor i in range(n):\r\n x[a[i]] += 1\r\n y[b[i]] += 1\r\nx = sorted(x.items(), key = lambda x : x[0])\r\ny = sorted(y.items(), key = lambda x : x[0])\r\nif (cnt > 2 or x != y):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "genome1=list(input())\r\ngenome2=list(input())\r\nindexs=[]\r\nflag=0\r\nfor i in range(min(len(genome2),len(genome1))):\r\n if genome1[i]!=genome2[i] :\r\n indexs.append(i)\r\nif len(indexs)<=1 or len(indexs)>2:\r\n print('NO')\r\n exit()\r\ngenome1[indexs[0]],genome1[indexs[1]]=genome1[indexs[1]],genome1[indexs[0]]\r\nif genome1==genome2:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "a=input()\r\nb=input()\r\ncount=0\r\ndiff=0\r\nc=[]\r\nif len(a)==len(b):\r\n count+=1\r\nfor i,j in zip(a,b):\r\n if i!=j:\r\n c.append(i)\r\n c.append(j)\r\n diff+=1\r\nif diff==2:\r\n count+=1\r\nif len(set(c))==2:\r\n count+=1\r\nif count==3:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "a = list(input())\r\nb = list(input())\r\nt = 0\r\nif(sorted(a) != sorted(b)):\r\n\tprint(\"NO\")\r\n\texit()\r\nfor x in range(len(a)):\r\n if a[x] != b[x]:\r\n t += 1\r\nif t == 2:\r\n print('YES')\r\nelse:\r\n print('NO')", "s=input()\r\nl1=[]\r\nd=input()\r\nl2=[]\r\nsam=0\r\n\r\nif(len(s)!=len(d)):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(s)):\r\n if(s[i]==d[i]):\r\n sam+=1\r\n else:\r\n l1.append(s[i])\r\n l2.append(d[i])\r\n if(len(s)-sam>2 or len(s)-sam<2):\r\n print(\"NO\")\r\n else:\r\n l1.sort()\r\n l2.sort()\r\n if(l1==l2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from sys import stdin as sin\r\ndef gint():return int(sin.readline())\r\ndef gmap():return map(int,sin.readline().split())\r\ndef glist():return list(map(int,sin.readline().split()))\r\ndef gstr():return sin.readline()\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nd1={}\r\nd2={}\r\nfor i in range(97,123):\r\n d1[chr(i)]=0\r\n d2[chr(i)]=0\r\n\r\nif len(s1)!=len(s2):\r\n print(\"NO\")\r\nelse:\r\n n=len(s1)\r\n for i in range(n):\r\n d1[s1[i]]+=1\r\n d2[s2[i]]+=1\r\n f=True\r\n for i in range(97,123):\r\n if d1[chr(i)]!=d2[chr(i)]:\r\n f=False\r\n break\r\n if f:\r\n r=0\r\n for i in range(n):\r\n if s1[i]!=s2[i]:\r\n r+=1\r\n if r==0 or r==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "a = input()\r\nb = input()\r\nk = 0\r\na1, b1 = sorted(a), sorted(b)\r\nif a1 == b1:\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n k += 1\r\n if k == 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\nflag=True\r\nif(len(a)!=len(b)):\r\n print(\"NO\")\r\nelse:\r\n c=0\r\n l1=[]\r\n l2=[]\r\n for i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n c+=1\r\n l1.append(a[i])\r\n l2.append(b[i])\r\n if(c==2 and l1[0]==l2[1] and l1[1]==l2[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "g1 = input()\r\ng2 = input()\r\nn = len(g1)\r\n\r\nif (n != len(g2)):\r\n print ('NO')\r\nelse:\r\n first = -1\r\n second = -1\r\n for i in range(n):\r\n c1 = g1[i]\r\n c2 = g2[i]\r\n if (c1 != c2):\r\n if first == -1:\r\n first = i\r\n else:\r\n second = i\r\n break\r\n new_g1 = [i for i in g1]\r\n new_g1.pop(first)\r\n new_g1.insert(first, g1[second])\r\n new_g1.pop(second)\r\n new_g1.insert(second, g1[first])\r\n if (''.join(new_g1) == g2):\r\n print ('YES')\r\n else:\r\n print ('NO')", "s1 = input()\ns2 = input()\n\ndef check(s1, s2):\n p = []\n for c1, c2 in zip(s1, s2):\n if c1 != c2:\n p.append((c1, c2))\n\n if len(p) == 0:\n print(\"YES\")\n elif len(p) == 2:\n if p[0][0] == p[1][1] and p[0][1] == p[1][0]:\n print(\"YES\")\n else:\n print(\"NO\")\n else:\n print(\"NO\")\n\n\nif len(s1) != len(s2):\n print(\"NO\")\nelse:\n check(s1, s2)\n \t \t \t\t\t\t \t \t\t\t\t\t\t\t\t\t \t", "s,t=input(),input()\r\nprint(\"YES\" if sum(x!=y for x,y in zip(s,t))==2 and all(y in s for y in t) else \"NO\")", "g1 = input()\r\ng2 = input()\r\n\r\nif len(g1) != len(g2):\r\n print(\"NO\")\r\nelse:\r\n count = 0\r\n differ_index = []\r\n for i in range(len(g1)):\r\n if g1[i] != g2[i]:\r\n count += 1\r\n differ_index.append(i)\r\n if count != 2:\r\n print(\"NO\")\r\n else:\r\n p1, p2 = differ_index\r\n if g1[p1] == g2[p2] and g1[p2] == g2[p1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def testcase():\n a = input().strip()\n b = input().strip()\n\n c, d = -1, -1\n\n if not len(a) == len(b):\n print(\"NO\")\n return\n\n for i in range(len(a)):\n if not a[i] == b[i]:\n if c == -1:\n c, d = b[i], a[i]\n elif c == a[i] and d == b[i]:\n c = -2\n else:\n print(\"NO\")\n return\n\n if c == -2:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nif __name__ == '__main__':\n t = 1\n \n for _ in range(t):\n testcase()", "s1 = input()\ns2 = input()\n\ncount = 0\nif len(s1) == len(s2):\n for i in range(len(s1)):\n if s1[i] != s2[i]:\n count += 1\n\n if (count == 2 or count == 0) and (sorted(s1) == sorted(s2)):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\nelse:\n print(\"NO\")\n", "def check_genome(genome1, genome2):\r\n i = 0\r\n firat = -1\r\n second = -1\r\n match = -1\r\n while (i < len(genome1)):\r\n if genome1[i] != genome2[i]:\r\n if match == -1:\r\n first = i\r\n match += 1\r\n else:\r\n second = i\r\n break\r\n i += 1\r\n if second != -1:\r\n genome1[first], genome1[second] = genome1[second], genome1[first]\r\n if genome1 == genome2:\r\n return True\r\n else:\r\n return False\r\n \r\nif __name__ == '__main__':\r\n MAX_LENGTH = 10**5\r\n genome1 = list(input())\r\n genome2 = list(input())\r\n input_array_len = len(genome1)\r\n if (len(genome1)<= MAX_LENGTH) & (len(genome2) <= MAX_LENGTH):\r\n if len(genome1) == len(genome2):\r\n same = 1\r\n for i in range(len(genome1)):\r\n if ((genome1[i].islower()) & (genome2[i].islower()) & (genome1[i].isalpha()) & genome2[i].isalpha()):\r\n if genome1[i] != genome2[i]:\r\n same = 0\r\n break\r\n else:\r\n continue\r\n else:\r\n print('NO')\r\n break\r\n if same == 0:\r\n result = check_genome(genome1, genome2)\r\n if result:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')", "a = input()\r\nb = input()\r\n\r\nchar_a = {}\r\nchar_b = {}\r\n\r\nif len(a) == len(b):\r\n for i in range(len(a)):\r\n if a[i] in char_a:\r\n char_a[a[i]] += 1\r\n else:\r\n char_a[a[i]] = 1\r\n if b[i] in char_b:\r\n char_b[b[i]] += 1\r\n else:\r\n char_b[b[i]] = 1\r\n for k in char_a.keys():\r\n if k in char_b:\r\n if char_a[k] == char_b[k]:\r\n char_b.pop(k)\r\n else:\r\n print('NO')\r\n exit()\r\n else:\r\n print('NO')\r\n exit()\r\n if char_b:\r\n print('NO')\r\n exit()\r\n else:\r\n mismatch = 0\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n mismatch += 1\r\n if mismatch > 2:\r\n print('NO')\r\n exit()\r\n if mismatch > 2:\r\n print('NO')\r\n else:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=list(input())\r\nm=list(input())\r\nif sorted(n)!=sorted(m):print('NO')\r\nelse:\r\n s=0\r\n for i in range(len(n)):\r\n if n[i]!=m[i]:s=s+1\r\n if s==2:print('YES')\r\n else:print('NO')", "def calculate_ord(n):\r\n ord_count = 0\r\n for itm in n:\r\n ord_count += ord(itm)\r\n return ord_count\r\n\r\nn1 = input()\r\nn2 = input()\r\n\r\nnot_similars = 0\r\nif calculate_ord(n1) == calculate_ord(n2) and len(n1) == len(n2):\r\n for i in range(len(n1)):\r\n if n1[i] != n2[i]:\r\n not_similars += 1\r\n if not_similars == 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\nelse:\r\n print(\"NO\")", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\na=input()\r\nb=input()\r\nla=len(a)\r\nlb=len(b)\r\nif la!=lb:\r\n\tprint(\"NO\")\r\n\texit()\r\nc=0\r\nfor i in range(la):\r\n\tif a[i]!=b[i]:\r\n\t\tc+=1\r\nif c==2 and sorted(a)==sorted(b):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "a=list(input())\r\nb=list(input())\r\n\r\nlst=[]\r\nif sorted(a)==sorted(b):\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n lst.append(i)\r\n if len(lst)==2:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s1=input()\r\ns2=input()\r\nn=len(s1)\r\nif len(s1)!=len(s2):\r\n print(\"NO\")\r\nelse:\r\n i=0\r\n IndexList=[]\r\n while i<n:\r\n if s1[i]!=s2[i]:\r\n IndexList.append(i)\r\n i+=1\r\n if len(IndexList)==2:\r\n if s1[IndexList[0]]==s2[IndexList[1]] and s1[IndexList[1]]==s2[IndexList[0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "def same_race(genome1, genome2):\r\n if len(genome1) != len(genome2):\r\n return \"NO\"\r\n\r\n diff_count = 0\r\n diff_indexes = []\r\n\r\n for i in range(len(genome1)):\r\n if genome1[i] != genome2[i]:\r\n diff_count += 1\r\n diff_indexes.append(i)\r\n\r\n if diff_count != 2:\r\n return \"NO\"\r\n\r\n if genome1[diff_indexes[0]] == genome2[diff_indexes[1]] and genome1[diff_indexes[1]] == genome2[diff_indexes[0]]:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\ngenome1 = input().strip()\r\ngenome2 = input().strip()\r\n\r\nresult = same_race(genome1, genome2)\r\n\r\nprint(result)\r\n", "from collections import Counter\ndef solve(a, b):\n if len(a) != len(b):\n return \"NO\"\n c1 = Counter(a)\n c2 = Counter(b)\n if c1 != c2:\n return \"NO\"\n\n misses = 0\n for i in range(len(a)):\n if a[i] != b[i]:\n misses += 1\n if misses > 2:\n return \"NO\"\n\n if misses == 2:\n return \"YES\"\n return \"NO\"\n\nprint(solve(input(), input()))\n", "f = input()\r\ns = input()\r\n\r\nif len(f)!=len(s):\r\n print(\"NO\")\r\nelse:\r\n l = len(f)\r\n lis = []\r\n \r\n for i in range(l):\r\n if f[i]!=s[i]:\r\n lis.append(i)\r\n \r\n if len(lis)!=2:\r\n print(\"NO\")\r\n else:\r\n modF = ''\r\n \r\n for i in range(l):\r\n if i == lis[0]:\r\n modF+=f[lis[1]]\r\n elif i == lis[1]:\r\n modF+=f[lis[0]]\r\n else:\r\n modF+=f[i]\r\n if modF == s:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import Counter\r\na=list(input())\r\nb=list(input())\r\ni=0\r\np=[]\r\nif Counter(a)!=Counter(b):\r\n print(\"NO\")\r\nelse:\r\n c=0\r\n p=[]\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n c+=1\r\n p.append(i)\r\n if c>2:\r\n print(\"NO\")\r\n exit()\r\n a[p[0]],a[p[1]]=a[p[1]],a[p[0]]\r\n if a==b:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n ", "a=input()\r\nb=input()\r\nx=len(a)\r\ny=len(b)\r\nif x!=y:\r\n\tprint(\"NO\")\r\nelse:\r\n\tl=[]\r\n\tc=0\r\n\tfor i in range(x):\r\n\t\tif a[i]!=b[i]:\r\n\t\t\tl.append(i)\r\n\t\t\tc+=1\r\n\t\tif c==3:\r\n\t\t\tbreak\r\n\tif (len(l)!=2):\r\n\t\tprint(\"NO\")\r\n\telse:\r\n\t\ti=l[0]\r\n\t\tj=l[1]\r\n\t\tif a[i]==b[j] and a[j]==b[i]:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")", "x=input()\r\ny=input()\r\nif(len(x)!=len(y)):\r\n print(\"NO\")\r\nelse:\r\n a=list(x)\r\n b=list(y)\r\n l=[]\r\n for i in range(len(x)):\r\n if(a[i]!=b[i]):\r\n l.append((i,a[i]))\r\n if(len(l)!=2):\r\n print(\"NO\")\r\n else:\r\n a[l[0][0]]=l[1][1]\r\n a[l[1][0]]=l[0][1]\r\n if(a==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "\r\n\r\ndef main_function():\r\n f = input()\r\n s = input()\r\n if len(f) != len(s):\r\n print(\"NO\")\r\n else:\r\n hash_s = [0 for i in range(150)]\r\n hash_f = [0 for i in range(150)]\r\n for i in range(len(s)):\r\n hash_s[ord(s[i])] += 1\r\n hash_f[ord(f[i])] += 1\r\n if hash_f != hash_s:\r\n print(\"NO\")\r\n else:\r\n if f == s:\r\n is_duplicate_found = False\r\n for j in range(len(hash_s)):\r\n if hash_f[j] > 1:\r\n is_duplicate_found = True\r\n break\r\n if is_duplicate_found:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n collector = []\r\n for k in range(len(s)):\r\n if s[k] != f[k]:\r\n collector.append(s[k])\r\n collector.append(f[k])\r\n if len(collector) != 4:\r\n print(\"NO\")\r\n else:\r\n if collector[0] == collector[3] and collector[2] == collector[1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\nmain_function()", "# It's all about what U BELIEVE\ndef gint(): return int(input())\ndef gint_arr(): return list(map(int, input().split()))\ndef gfloat(): return float(input())\ndef gfloat_arr(): return list(map(float, input().split()))\ndef pair_int(): return map(int, input().split())\n###############################################################################\nINF = (1 << 31)\ndx = [-1, 0, 1, 0]\ndy = [ 0, 1, 0, -1]\n###############################################################################\n############################ SOLUTION IS COMING ###############################\n###############################################################################\na = input()\nb = input()\n\nla = len(a)\nlb = len(b)\n\nind1, ind2 = -1, -1\ni = 0\nrep = False\ns = set()\n\nwhile i < la and i < lb:\n rep |= (a[i] in s)\n s.add(a[i])\n\n if a[i] != b[i]:\n if ~ind1:\n ind2 = i\n else:\n ind1 = i\n\n i += 1\n\nif (~ind1) and (~ind2):\n a = a[:ind1] + a[ind2] + a[ind1 + 1: ind2] + a[ind1] + a[ind2 + 1:]\n print(\"YES\" if a == b else \"NO\")\nelif (~ind1) or (~ind2):\n print(\"NO\")\nelse:\n print(\"YES\" if rep and len(a) == len(b) else \"NO\")\n", "s,t=input(),input();print(\"NYOE S\"[sum(x != y for x, y in zip(s, t))==2 and all(y in s for y in t)::2])", "s=input().lower()\ns1=input().lower()\na=''.join(sorted(s))\nb=''.join(sorted(s1))\n# print(a)\n# print(b)\nc=0\nfor i,j in zip(s,s1):\n# print(i,j)\n if i!=j:\n c+=1\n# print(c,' c') \nif c==2 and (a in b and b in a):\n print('YES')\nelse:\n print('NO')", "def solve():\r\n f = input()\r\n s = input()\r\n diff = []\r\n if len(f) != len(s):\r\n return 'NO'\r\n for index, char in enumerate(f):\r\n if char != s[index]:\r\n diff.append(index)\r\n if len(diff) > 2:\r\n return 'NO'\r\n if len(diff) == 1:\r\n return 'NO'\r\n l_idx = diff[0]\r\n r_idx = diff[1]\r\n if f[l_idx] == s[r_idx] and f[r_idx] == s[l_idx]:\r\n return 'YES'\r\n return 'NO'\r\n\r\n\r\nprint(solve())\r\n", "s1=input()\r\ns2=input()\r\ncount=0\r\nif len(s1)!=len(s2):\r\n print('NO')\r\n exit()\r\nelse:\r\n for x in range(len(s1)):\r\n if s1[x]!=s2[x]:\r\n count+=1\r\n if count==2:\r\n s1=''.join(sorted(s1))\r\n s2=''.join(sorted(s2))\r\n if s1==s2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n ", "def same_race(genome1, genome2):\r\n if len(genome1) != len(genome2):\r\n return False\r\n\r\n diff_count = 0\r\n diff_chars = []\r\n\r\n for i in range(len(genome1)):\r\n if genome1[i] != genome2[i]:\r\n diff_count += 1\r\n diff_chars.append((genome1[i], genome2[i]))\r\n\r\n if diff_count == 2 and diff_chars[0] == diff_chars[1][::-1]:\r\n return True\r\n else:\r\n return False\r\n\r\ndef main():\r\n genome1 = input().strip() # Input first dwarf's genome\r\n genome2 = input().strip() # Input second dwarf's genome\r\n\r\n if same_race(genome1, genome2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = input()\r\nb = input()\r\na = list(a)\r\nb = list(b)\r\nif len(a) != len(b):\r\n print(\"NO\")\r\n exit()\r\n\r\n\r\ntotal = 0\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n total += 1\r\n\r\nflag = False\r\nif total == 2:\r\n a.sort()\r\n b.sort()\r\n if a == b:\r\n flag = True\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=input()\r\nm=input()\r\ncount=0\r\nif (sorted(l)==sorted(m)):\r\n for i in range(len(l)):\r\n if l[i]!=m[i]:\r\n count+=1\r\n if count>2:\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\nn1=len(s1)\r\nn2=len(s2)\r\nif(n1!=n2):\r\n print(\"NO\")\r\nelse:\r\n co=True\r\n count=0\r\n A=[]\r\n B=[]\r\n for i in range(n1):\r\n if(s1[i]!=s2[i]):\r\n count+=1\r\n if(count<=2):\r\n A.append(s1[i])\r\n B.append(s2[i])\r\n else:\r\n co=False\r\n break\r\n if(co and A[-1]==B[0] and B[-1]==A[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n", "s1=input()\ns2=input()\nx1=sorted(s1)\ny1=\"\".join(x1)\nx2=sorted(s2)\ny2=\"\".join(x2)\nc=0\nif y1==y2:\n for i in range(len(s1)):\n if s1[i]!=s2[i]:\n c+=1 \n if c==2:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n ", "# recursion\r\n# video 80\r\n# maths\r\n# question 70\r\nfrom collections import Counter\r\n# d={\"E\":1}\r\ndef solve():\r\n s1=input()\r\n s2=input()\r\n if len(s1)!=len(s2):\r\n print(\"NO\")\r\n return\r\n d1=Counter(s1)\r\n d2=Counter(s2)\r\n for i in d1:\r\n if i not in d2:\r\n print('NO')\r\n return\r\n if d1[i]!=d2[i]:\r\n print(\"NO\")\r\n return\r\n n=len(s1)\r\n count=0\r\n for i in range(n):\r\n if s1[i]!=s2[i]:\r\n count+=1\r\n if count>2:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\nsolve()\r\n", "gnome1 = list(input())\r\ngnome2 = list(input())\r\nif len(gnome1) != len(gnome2):\r\n print('NO')\r\nelse:\r\n differences = 0\r\n set = set([])\r\n for i in range(len(gnome1)):\r\n if gnome1[i] != gnome2[i]:\r\n differences += 1\r\n set.add(gnome1[i])\r\n set.add(gnome2[i])\r\n if differences == 2 and len(set) == 2:\r\n print('YES')\r\n else:\r\n print('NO')", "s1 = input().strip()\r\ns2 = input().strip()\r\nif len(s1)!=len(s2):\r\n print(\"NO\")\r\nelse:\r\n prev = False\r\n count = 0\r\n for i in range(len(s1)):\r\n if s1[i]==s2[i]:\r\n continue\r\n count+=1\r\n if not prev:\r\n prev = True\r\n first = s1[i]\r\n second = s2[i]\r\n else:\r\n if s2[i]==first and s1[i]==second:\r\n continue\r\n else:\r\n print(\"NO\")\r\n break\r\n else:\r\n if count==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s1=input()\r\ns2=input()\r\nsum=0\r\nif(sorted(s1) != sorted(s2)):\r\n\tprint(\"NO\")\r\n\texit()\r\nfor i in range(len(s1)):\r\n\tif s1[i]!=s2[i]:\r\n\t\tsum+=1\r\nif(sum==2):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s1 = input()\ns2 = input()\nf = 0\nl1 = len(s1)\nl2 = len(s2)\nif l1 == l2:\n idx = []\n s = 0\n for i in range(l1):\n if s1[i] != s2[i]:\n idx.append(i)\n s+=1\n if s == 0:\n print('YES')\n elif s > 2 or s == 1:\n print('NO')\n else:\n si,ei = idx\n s3 = s1[:si]+s1[ei]+s1[si+1:ei]+s1[si]+s1[ei+1:]\n if s3 == s2:\n print('YES')\n else:\n print('NO')\n\n\n\nelse:\n print('NO')", "'''\n R E X\n\n Date - 10th June 2021\n\n\n @author:\n CodeForces -> kunalverma19\n CodeChef -> kunalverma_19\n AtCoder -> TLKunalVermaRX\n'''\nimport math\nimport re\nimport sys\nfrom itertools import permutations\nfrom collections import Counter\nimport itertools\nMOD = 1000000007\ndef inp(): return map(int, input().split(' '))\ndef ninp(): return int(input())\n\n\n# sys.stdin = open(\"input.txt\", \"r\")\na = input()\nb = input()\nif sorted(a) != sorted(b):\n print(\"NO\")\nelse:\n cnt = 0\n for i in range(len(a)):\n if a[i] != b[i]:\n cnt += 1\n if cnt == 2:\n print(\"YES\")\n else:\n print(\"NO\")\n", "a=input()\r\nb=input()\r\nl=0\r\nif(len(a)!=len(b)):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n l+=1\r\n if(l==2 and sorted(a)==sorted(b)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import Counter\r\n\r\na = input()\r\nb = input()\r\nif Counter(a) == Counter(b):\r\n a = list(a)\r\n b = list(b)\r\n ind = []\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n ind.append(i)\r\n a[ind[0]], a[ind[1]] = a[ind[1]], a[ind[0]]\r\n if a == b:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "s1 = input()\r\ns2 = input()\r\n\r\nfirst_change = None\r\nchanges = 0\r\n\r\nif len(s1) == len(s2):\r\n for idx in range(len(s1)):\r\n if s1[idx] != s2[idx]:\r\n changes += 1\r\n \r\n if changes > 2:\r\n print(\"NO\")\r\n break\r\n \r\n if first_change:\r\n if (s2[idx], s1[idx]) != first_change:\r\n print(\"NO\")\r\n break\r\n else:\r\n first_change = (s1[idx], s2[idx])\r\n else:\r\n if changes == 1:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if __name__=='__main__':\r\n x=input()\r\n y=input()\r\n p=list(x)\r\n q=list(y)\r\n p.sort()\r\n q.sort()\r\n if p==q:\r\n c=0\r\n for i in range(0,len(x)):\r\n if x[i]!=y[i]:\r\n c+=1\r\n if c==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "# cook your dish here\r\n#import sys\r\n#sys.setrecursionlimit(10**9) \r\nll=lambda:map(int,input().split())\r\nt=lambda:int(input())\r\nss=lambda:input()\r\nlx=lambda x:map(int,input().split(x))\r\nyy=lambda:print(\"YES\")\r\nnn=lambda:print(\"NO\")\r\n\r\nfrom math import log10 ,log2,ceil,factorial as fac,gcd,inf,sqrt,log\r\n#from itertools import combinations_with_replacement as cs \r\n#from functools import reduce\r\nfrom bisect import bisect_right as br,bisect_left as bl\r\nfrom collections import Counter\r\n#from math import inf\r\n\r\n\r\nmod=10**9+7\r\n\r\n\r\n \r\n#for _ in range(t()):\r\ndef f():\r\n \r\n \r\n a=list(ss())\r\n b=list(ss())\r\n\r\n if len(a)!=len(b):\r\n nn()\r\n return\r\n \r\n fl=0\r\n indx1,indx2=-1,-1\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n \r\n if fl==0:\r\n indx1=i\r\n \r\n elif fl==1:\r\n indx2=i\r\n fl+=1\r\n a[indx1],a[indx2]=a[indx2],a[indx1]\r\n if a==b and fl==2:\r\n yy()\r\n else:\r\n nn()\r\n\r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\nf()\r\n \r\n\r\n'''\r\n\r\nbaca\r\n\r\nbac\r\n1 2 3\r\nbaaccca\r\n\r\nabbaccccaba\r\n \r\n'''\r\n", "dwarf1 = input().strip()\r\ndwarf2 = input().strip()\r\n\r\nif len(dwarf1) != len(dwarf2):\r\n print(\"NO\")\r\nelse:\r\n count = 0\r\n index = []\r\n\r\n for i in range(len(dwarf1)):\r\n if dwarf1[i] != dwarf2[i]:\r\n count += 1\r\n index.append(i)\r\n\r\n if count == 2 and dwarf1[index[0]] == dwarf2[index[1]] and dwarf1[index[1]] == dwarf2[index[0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def main():\r\n d = input()\r\n e = input()\r\n\r\n if len(e) != len(d):\r\n print(\"NO\")\r\n return\r\n\r\n count = 0\r\n diff = []\r\n for i in range(0, len(d)):\r\n if d[i] != e[i]:\r\n diff.append(i)\r\n count += 1\r\n\r\n if count == 0:\r\n print(\"YES\")\r\n return\r\n\r\n if count == 2:\r\n if d[diff[0]] == e[diff[1]] and d[diff[1]] == e[diff[0]]:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s1 = input()\ns2 = input()\n\nif len(s1) != len(s2):\n print('NO')\nelse:\n arr = []\n count = 0\n for i in range(len(s1)):\n if s1[i] != s2[i]:\n arr.append(s1[i]+s2[i])\n count += 1\n if count > 2:\n print('NO')\n break\n else:\n n = len(arr)\n if n == 0:\n print('YES')\n elif n == 1:\n print('NO')\n else:\n if arr[0] == arr[1][::-1]:\n print('YES')\n else:\n print('NO')\n", "g1 = input()\r\ng2 = input()\r\nif len(g1) != len(g2):\r\n print('NO')\r\n exit()\r\nif set(g1) == set(g2):\r\n count = 0\r\n for i,x in enumerate(g1):\r\n if x != g2[i]:\r\n count += 1\r\n if count > 2 or count < 2:\r\n print('NO')\r\n else:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\na=list(a)\r\nb=list(b)\r\nif (len(a)!=len(b)):\r\n print ('NO')\r\nelse:\r\n c=[]\r\n count=0\r\n for i in range(len(a)):\r\n if (a[i]!=b[i]):\r\n c.append(i)\r\n count+=1 \r\n if (count==2):\r\n a[c[0]],a[c[1]]=a[c[1]],a[c[0]]\r\n if a==b:\r\n print ('YES')\r\n else:\r\n print ('NO') \r\n else:\r\n print ('NO')", "s1=[x for x in input()]\r\ns2=[x for x in input()]\r\n#print(\"s1={} s2={}\".format(s1,s2))\r\nl1=len(s1)\r\nl2=len(s2)\r\nif l1!=l2:\r\n print(\"NO\")\r\nelse:\r\n if(l1<l2):\r\n l=l1\r\n s,s1=s1,s2\r\n else:\r\n l=l2\r\n s,s1=s2,s1\r\n cnt=[0,0]\r\n j=0\r\n flag=0\r\n for i in range(l):\r\n if s[i]!=s1[i]:\r\n cnt[j]=i\r\n j+=1\r\n if j==2:\r\n s[cnt[0]],s[cnt[1]]=s[cnt[1]],s[cnt[0]]\r\n # print(\"s={} s1={}\".format(s,s1))\r\n if s==s1:\r\n flag+=1\r\n print(\"YES\")\r\n break\r\n if flag==0:\r\n print(\"NO\")", "gen1 = input()\r\ngen2 = input()\r\n\r\nif len(gen1) != len(gen2):\r\n print(\"NO\")\r\nelse:\r\n diff_count = 0\r\n diff_positions = []\r\n\r\n for i in range(len(gen1)):\r\n if gen1[i] != gen2[i]:\r\n diff_count += 1\r\n diff_positions.append(i)\r\n\r\n if diff_count != 2 or gen1[diff_positions[0]] != gen2[diff_positions[1]] or gen1[diff_positions[1]] != gen2[diff_positions[0]]:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")", "r1 = input()\r\nr2 = input()\r\nif len(r1)!=len(r2):\r\n print(\"NO\")\r\n exit()\r\ni = 0\r\nchanges = 0\r\nr,s = \"\", \"\"\r\nwhile i<len(r1):\r\n if r1[i]!=r2[i]:\r\n r += r1[i]\r\n s += r2[i]\r\n changes+=1\r\n i+=1\r\nif changes==2 and r==s[-1::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\ns1=input()\r\nif len(s)==len(s1) and sorted(s)==sorted(s1):\r\n var=0\r\n for i in range(len(s)):\r\n if s[i]!=s1[i]:\r\n var+=1\r\n if var==2:\r\n print(\"YES\")\r\n elif var==0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "x = input()\r\ny = input()\r\nz=0\r\nfrom collections import Counter\r\nif len(x)==len(y):\r\n for i,j in zip(x,y):\r\n # print(i,j)\r\n if i!=j:\r\n z+=1\r\n x = Counter(x)\r\n y = Counter(y)\r\n print([\"NO\",\"YES\"][x==y and z<=2])\r\nelse:\r\n print(\"NO\")", "# Imports\n\nfrom typing import Dict, List\n\n# Two dwarfs belong to the same race if we can swap 2 chars in the 1st dwarfs gnomes and get the 2nd dwarfs gnomes.\n\ndef lowercase() -> str:\n\t\"\"\"\n\tGives lowercase values of a, z\n\t\"\"\"\n\treturn 'abcdefghijklmnopqrstuvwxyz'\n\ndef matchDicts(d1: Dict[str, int], d2: Dict[str, int]) -> bool:\n\tfor alphabet in lowercase():\n\t\tif d1[alphabet] != d2[alphabet]:\n\t\t\treturn False\n\treturn True\n\ndatabase_gn: Dict[str, int] = dict.fromkeys(lowercase(), 0)\ndatabase_gm: Dict[str, int] = dict.fromkeys(lowercase(), 0)\n\ngn: str = input()\ngm: str = input()\n\n_gn: int = len(gn)\n_gm: int = len(gm)\n\nc: int = 0 # How many different characters are observed in both the strings\n\nif _gn != _gm:\n\tprint(\"NO\")\nelse:\n\tfor i in range(_gn):\n\t\tdatabase_gn[gn[i]] = database_gn[gn[i]] + 1\n\t\tdatabase_gm[gm[i]] = database_gm[gm[i]] + 1\n\t\t\n\t\tif gn[i] != gm[i]:\n\t\t\tc = c + 1\n\t\n\tif c == 2:\n\t\t# Now check for the count of each alphabet\n\t\tif matchDicts(database_gn, database_gm):\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telse:\n\t\t\tprint(\"NO\")\n\t\t\n", "import sys\r\ns1, s2 = sys.stdin.read().split()\r\n\r\ndef no():\r\n print(\"NO\")\r\n exit(0)\r\n\r\nif len(s1) != len(s2):\r\n no()\r\n\r\nmismatch = -1\r\nfor i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n if mismatch == -1:\r\n mismatch = i\r\n elif mismatch != -2:\r\n if s1[mismatch] == s2[i] and s1[i] == s2[mismatch]:\r\n mismatch = -2\r\n else:\r\n no()\r\n else:\r\n no()\r\nif mismatch != -2:\r\n no()\r\n\r\nprint(\"YES\")\r\n", "s1 = input()\r\ns2 = input()\r\nunique = []\r\ncnt = 0\r\nif len(s1) != len(s2):\r\n print('NO')\r\nelse:\r\n for x in s1:\r\n if x not in unique:\r\n unique.append(x)\r\n for x in unique:\r\n if s1.count(x) != s2.count(x):\r\n print('NO')\r\n break\r\n else:\r\n for x in range(len(s1)):\r\n if s1[x] != s2[x]:\r\n cnt += 1\r\n if cnt == 0 or cnt > 2:\r\n print('NO')\r\n else:\r\n print('YES')", "def find(s1,s2):\r\n if(len(s1)!=len(s2)):\r\n return False\r\n f=-1\r\n s=-1\r\n for i in range(len(s1)):\r\n if(s1[i]!=s2[i]):\r\n if(f==-1):\r\n f=i\r\n elif(s==-1):\r\n s=i\r\n else:\r\n return False\r\n return s1[f]==s2[s] and s2[f]==s1[s]\r\ns1=input()\r\ns2=input()\r\nif(find(s1,s2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "def Comparing_Strings():\r\n def convert(string):\r\n list1 = []\r\n list1[:0] = string\r\n return list1\r\n\r\n genome1 = convert(input())\r\n genome2 = convert(input())\r\n\r\n if len(genome1) != len(genome2) :\r\n print(\"NO\")\r\n return\r\n else:\r\n not_matched_G1 = []\r\n not_matched_G2 = []\r\n\r\n for i in range(len(genome1)):\r\n if genome1[i] != genome2[i]:\r\n not_matched_G1.append(genome1[i])\r\n not_matched_G2.append(genome2[i])\r\n\r\n if len(not_matched_G1) != 2 :\r\n print(\"NO\")\r\n return\r\n else:\r\n if not_matched_G1[0] == not_matched_G2[1] and not_matched_G1[1] == not_matched_G2[0]:\r\n print(\"YES\")\r\n return\r\n else:\r\n print(\"NO\")\r\n return\r\n\r\nComparing_Strings()", "n = input()\nm = input()\nl1 = []\nl2 = []\nfor ele in n:\n l1.append(ele)\nfor ele in m:\n l2.append(ele)\n\nif len(l1) != len(l2):\n print(\"NO\")\n exit()\n\ndiff = []\nfor i in range(len(l1)):\n if l1[i] != l2[i]:\n diff.append(i)\n\nif len(diff) != 2:\n print(\"NO\")\n exit()\n\nif l1[diff[0]] == l2[diff[1]] and l1[diff[1]] == l2[diff[0]]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "\r\n\r\na=list(input())\r\nb=list(input())\r\n\r\nif len(a)!=len(b):\r\n print(\"NO\")\r\n exit(0)\r\n\r\nj=0;k=0\r\n\r\nch1=[]\r\nch2=[]\r\n\r\nfor i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n ch1.insert(j,b[i])\r\n j+=1\r\n ch2.insert(k,a[i])\r\n k+=1\r\n\r\nif len(ch1)!=2:\r\n print(\"NO\")\r\nelse:\r\n if(ch1[1] == ch2[0] and ch1[0]==ch2[1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n", "a, b = input(), input()\r\nd = 0\r\nghapla = False\r\n\r\nif len(a)!=len(b) or set(a)!=set(b): print('NO')\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]!=b[i]: d+=1\r\n if d>2:\r\n ghapla = True\r\n break\r\n print('NO' if ghapla else 'YES')", "s1=input()\r\ns2=input()\r\n\r\nif(len(s1)!=len(s2)):\r\n print(\"NO\")\r\nelse:\r\n c1=\"\"\r\n c2=\"\"\r\n count=0\r\n l=[]\r\n for i in range(len(s1)):\r\n if(count>2):\r\n break\r\n if(s1[i]==s2[i]):\r\n continue\r\n else:\r\n count+=1\r\n l.append(i)\r\n\r\n if(count!=2):\r\n print(\"NO\")\r\n else:\r\n if(s1[l[0]]==s2[l[1]] and s1[l[1]]==s2[l[0]]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "a =input()\r\nb =input()\r\ncnt=0\r\nif len(a)!=len(b):\r\n print(\"NO\")\r\nelse:\r\n if set(a)==set(b):\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n cnt+=1\r\n if cnt<=2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\nx = sorted(s1)\r\ny = sorted(s2)\r\nc = 0\r\nif x == y :\r\n for i in range(len(x)):\r\n if s1[i]!= s2[i]:\r\n c+=1\r\n if c == 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "def solve():\n a = input()\n b = input()\n cnt = 0\n m = len(a)\n n = len(b)\n x, y = 0, 0\n if(m != n):\n print('NO')\n return\n\n for i in range(m):\n if(a[i] != b[i]): \n cnt += 1\n if(cnt == 1): x = i\n elif(cnt == 2): y = i\n\n print('YES' if(cnt == 2 and a[y] == b[x] and a[x] == b[y]) else 'NO')\n\nsolve()\n", "a = input()\r\nb = input()\r\n\r\ncount = 0\r\ni1 = []\r\nif len(a)!=len(b):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n count += 1\r\n i1.append(i)\r\n if count!=2:\r\n print(\"NO\")\r\n else:\r\n a = list(a)\r\n a[i1[0]], a[i1[1]] = a[i1[1]], a[i1[0]]\r\n if a==list(b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\ns=[]\r\nif(len(s1)!=len(s2)):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(s1)):\r\n if(s1[i]!=s2[i]):\r\n s.append(s1[i])\r\n s.append(s2[i])\r\n if(len(s)!=4):\r\n print(\"NO\")\r\n else:\r\n if(s[0]==s[3] and s[1]==s[2]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\nif sorted(s1) != sorted(s2):\r\n print('NO')\r\nelse:\r\n s = sum(x != y for x, y in zip(s1, s2))\r\n if s <= 2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "s1=input()\r\ns2=input()\r\nif len(s1)==len(s2):\r\n if set(s1)==set(s2):\r\n ti,con=1,True\r\n for i in range(len(s1)):\r\n if s1[i]!=s2[i] and ti==1:\r\n pos1=i\r\n ti+=1\r\n elif s1[i]!=s2[i] and ti==2:\r\n pos2=i\r\n ti+=1\r\n elif s1[i]!=s2[i] and ti==3:\r\n con=False\r\n break\r\n else:\r\n if s1==s2[:pos1]+s2[pos2]+s2[pos1+1:pos2]+s2[pos1]+s2[pos2+1:]:print('YES')\r\n else:print('NO')\r\n if con==False:print('NO')\r\n else:print('NO')\r\nelse:print('NO')\r\n", "# Read the two genomes as input\r\ngenome1 = input()\r\ngenome2 = input()\r\n\r\n# Check if the lengths of the genomes are different\r\nif len(genome1) != len(genome2):\r\n print(\"NO\") # Different lengths, so not the same race\r\nelse:\r\n # Initialize variables to keep track of the positions where the genomes differ\r\n diff_count = 0\r\n positions = []\r\n\r\n # Compare the genomes character by character\r\n for i in range(len(genome1)):\r\n if genome1[i] != genome2[i]:\r\n diff_count += 1\r\n positions.append(i)\r\n\r\n # Check if there are exactly two positions where the genomes differ\r\n if diff_count == 2 and genome1[positions[0]] == genome2[positions[1]] and genome1[positions[1]] == genome2[positions[0]]:\r\n print(\"YES\") # The dwarves belong to the same race\r\n else:\r\n print(\"NO\") # The dwarves do not belong to the same race\r\n", "#from collections import Counter\r\n#n = int(input())\r\n#n,m = map(int,input().split())\r\n#l = list(map(int,input().split()))\r\n\r\n\r\nl = []\r\ns = input()\r\nt = input()\r\nc = 0\r\nif len(t) == len(s):\r\n for i in range(len(t)):\r\n if t[i] != s[i]:\r\n l.append((t[i],s[i]))\r\n c+=1\r\n if c>2:\r\n break\r\n if c > 2 or c==1:\r\n print(\"NO\")\r\n else:\r\n #print(l[0][0], l[1][1], l[1][0],l[0][1])\r\n if l[0][0] == l[1][1] and l[1][0] == l[0][1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "def solve(s1, s2):\r\n if len(s1) != len(s2):\r\n return \"NO\"\r\n elif s1 == s2:\r\n return \"NO\"\r\n else:\r\n k, p = 0, 0\r\n ix, jx, n = None, None, len(s1)\r\n for i in range(n):\r\n if s1[i] != s2[i]:\r\n p += 1\r\n if p == 1:\r\n ix = s1[i]\r\n jx = s2[i]\r\n elif p == 2:\r\n if (s2[i] == ix and s1[i] == jx):\r\n k = 1\r\n\r\n return \"YES\" if k == 1 and p==2 else \"NO\"\r\n \r\nif __name__ == \"__main__\":\r\n s1 = input()\r\n s2 = input()\r\n print(solve(s1, s2))\r\n", "s1 = str(input())\r\ns2 = str(input())\r\nc = 0\r\nl =[]\r\nif(len(s1) != len(s2)):\r\n print(\"NO\")\r\n exit()\r\n \r\nfor i in range(len(s1)):\r\n if(s1[i] != s2[i]):\r\n c+=1\r\n l+= s1[i]\r\n l+= s2[i] \r\nif (c == 2 and len(set(l)) == 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n\r\n\r\n\r\n\r\n\r\n ", "a = input()\r\nb = input()\r\n\r\ndef h():\r\n if len(a) != len(b):\r\n return False\r\n \r\n tot = 0\r\n prev_a = None\r\n prev_b = None\r\n dp = [0] * 26\r\n for i in range(len(a)):\r\n dp[ord(a[i]) - 97] += 1\r\n if a[i] != b[i]:\r\n if tot == 0:\r\n tot += 1\r\n prev_a, prev_b = a[i], b[i]\r\n elif tot == 1:\r\n cur_a, cur_b = a[i], b[i]\r\n if prev_a != cur_b or prev_b != cur_a:\r\n return False\r\n tot += 1\r\n elif tot > 1:\r\n return False\r\n \r\n if tot == 2:\r\n return True\r\n elif tot == 0:\r\n return any(el > 0 and el % 2 == 0 for el in dp)\r\n else:\r\n return False\r\n\r\nres = h()\r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import Counter\r\na=input()\r\nb=input()\r\nprint('YNEOS'[Counter(a)!=Counter(b) or sum(i!=j for i,j in zip(a,b))>2::2])", "if __name__ == \"__main__\":\r\n S1 = input()\r\n S2 = input()\r\n if len(S1) != len(S2):\r\n print(\"NO\")\r\n else:\r\n c = 0\r\n chars = set()\r\n for i in range(len(S1)):\r\n if S1[i] != S2[i]:\r\n c += 1\r\n chars.add(S1[i])\r\n chars.add(S2[i])\r\n if c > 2:\r\n break\r\n if c == 2 and len(chars) == 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a=str(input())\r\nb=str(input())\r\nc=len(a)\r\nd=len(b)\r\ne=0\r\nif c!=d:\r\n print(\"NO\")\r\n exit()\r\nif a==b:\r\n if c>26:\r\n print(\"YES\")\r\n exit()\r\n for i in range (c):\r\n for j in range(c):\r\n if a[i]==b[j] and i!=j :\r\n print(\"YES\")\r\n exit()\r\n print(\"NO\")\r\n exit()\r\nfor i in range(c):\r\n if a[i]!=b[i]:\r\n e=e+1\r\nif e!=2:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(c):\r\n if a[i]!=b[i]:\r\n f=a[i]\r\n g=b[i]\r\nfor i in range (c-1,-1,-1):\r\n if a[i]!=b[i]:\r\n h=a[i]\r\n m=b[i]\r\nif f==m and g==h:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nt=input()\r\nif len(s) == len(t):\r\n a,b=\"\",\"\"\r\n for i,j in zip(s,t):\r\n if i != j: a += i;b += j\r\n if len(a)==2:\r\n if a[0]==b[1] and a[1]==b[0]:print(\"YES\")\r\n else: print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse: print(\"NO\")\r\n \r\n", "s1=input()\r\ns2=input()\r\na=''.join(sorted(s1))\r\nb=''.join(sorted(s2))\r\n\r\nif a!=b:\r\n print('NO')\r\nelse:\r\n flag=0\r\n for i in range(0,len(s1)):\r\n if s1[i]!=s2[i]:\r\n flag+=1\r\n\r\n if flag==2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n \r\n", "first=input()\r\nsecond=input()\r\nif len(first)!= len(second):\r\n print(\"NO\")\r\nelse:\r\n sw=[]\r\n count=0\r\n i=0\r\n while i<len(first) and count<2:\r\n if first[i]!=second[i]:\r\n sw.append(i)\r\n count+=1\r\n i+=1\r\n if count==2:\r\n l1=list(first)\r\n l1[sw[0]],l1[sw[1]]=l1[sw[1]],l1[sw[0]]\r\n if second==\"\".join(l1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "s = input()\nt = input()\nif len(s) != len(t):\n print('NO')\n exit()\ndif = 0\nfor i in range(len(s)):\n if s[i] != t[i]:\n dif += 1\nif dif > 2 or set(s) != set(t):\n print('NO')\n exit()\nprint('YES')\n", "from sys import stdin\r\ninput=stdin.readline\r\nstring1=input()\r\nstring2=input()\r\nif len(string1)!=len(string2):\r\n print(\"NO\")\r\nelse:\r\n wrong=0\r\n for i in range(len(string1)):\r\n if string1[i]!=string2[i]:\r\n wrong+=1\r\n string1=list(string1)\r\n string2=list(string2)\r\n \r\n string1.sort()\r\n string2.sort()\r\n if string1==string2 and (wrong==0 or wrong==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s1 = input()\ns2 = input()\nn,m = len(s1),len(s2)\nif n!= m:print(\"NO\")\nelse:\n ls1,ls2 = [],[]\n for i in range(n):\n if s1[i]!=s2[i]:\n ls1.append(s1[i])\n ls2.append(s2[i])\n if len(ls1)!=2:\n print(\"NO\")\n else:\n if ls1[0] == ls2[1] and ls1[1] == ls2[0]:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\n", "a = input()\r\nb = input()\r\n\r\nif len(a) != len(b):\r\n\tprint(\"NO\")\r\nelse :\r\n\tcnt = 0\r\n\tl = list()\r\n\tfor i in range(len(a)):\r\n\t\tif a[i] != b[i] :\r\n\t\t\tl.append(i)\r\n\t\t\tcnt += 1\r\n\t\tif cnt > 2 : \r\n\t\t\tbreak\r\n\tif cnt == 2:\r\n\t\tif a[l[0]] != b[l[1]] or a[l[1]] != b[l[0]]:\r\n\t\t\tprint(\"NO\")\r\n\t\telse :\r\n\t\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")", "st1=list(input())\r\nst2=list(input())\r\nif sorted(st1)==sorted(st2):\r\n\r\n ans=0\r\n for i in range(len(st1)):\r\n ans+=1 if st1[i]!=st2[i] else 0\r\n print(\"NO\" if ans>2 else \"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "import sys\n\ninput = sys.stdin.readline\n\nfirst = input().rstrip()\nsecond = input().rstrip()\n\nif len(first) != len(second):\n print(\"NO\")\nelse:\n result = []\n for i in range(len(first)):\n if first[i]!=second[i]:\n result.append(i)\n \n if len(result)==2:\n if first[result[0]]==second[result[1]] and first[result[1]]==second[result[0]]:\n print(\"YES\")\n else:\n print(\"NO\")\n elif len(result)==0:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t\t\t \t \t \t\t \t \t", "s1=input()\r\ns2=input()\r\ns=set()\r\ncount=0\r\nif len(s1)!=len(s2):\r\n print(\"NO\")\r\nelse:\r\n for i in range(0,len(s1)):\r\n if s1[i]!=s2[i]:\r\n count+=1\r\n s.add(s1[i])\r\n s.add(s2[i])\r\n \r\n if count==2 and len(s)==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "a=input()\r\nb=input()\r\na=list(a)\r\nb=list(b)\r\n\r\nf=0\r\nv=[]\r\nif(len(a)!=len(b)):\r\n\tprint(\"NO\")\r\nelse:\r\n for i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n v.append(i)\r\n if(len(v)!=2):\r\n print(\"NO\")\r\n else:\r\n a[v[0]],a[v[1]]=a[v[1]],a[v[0]]\r\n if(a==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\nans = \"\"\r\ncnt = 0\r\nif(len(s1) != len(s2)):\r\n ans = \"NO\"\r\nelse:\r\n pos = []\r\n for i in range(len(s1)):\r\n if(s1[i] != s2[i]):\r\n cnt += 1\r\n pos.append(i)\r\n if(cnt > 2):\r\n ans = \"NO\"\r\n break\r\n if(len(pos) != 2):\r\n ans = \"NO\"\r\n else:\r\n arr_s1 = []\r\n arr_s2 = []\r\n for char1, char2 in zip(s1, s2):\r\n arr_s1.append(char1)\r\n arr_s2.append(char2)\r\n arr_s1[pos[0]], arr_s1[pos[1]] = arr_s1[pos[1]], arr_s1[pos[0]]\r\n s1 = ''.join(arr_s1)\r\n s2 = ''.join(arr_s2)\r\n #print(s1, s2, end = '\\n')\r\n if(s1 == s2):\r\n ans = \"YES\"\r\n else:\r\n ans = \"NO\"\r\n\r\nprint(ans)", "def solve(s1, s2):\r\n if len(s1) != len(s2):\r\n return False\r\n total = 0\r\n s1_ = ''\r\n s2_ = ''\r\n for i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n total += 1\r\n s1_ += s1[i]\r\n s2_ += s2[i]\r\n if total > 2:\r\n return False\r\n if total == 2 and s1_[1] == s2_[0] and s1_[0] == s2_[1]:\r\n return True\r\n return False\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\nif solve(s1, s2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = list(input())\r\ns = list(input())\r\nd = a[:]\r\nz = s[:]\r\nd.sort()\r\nz.sort()\r\nif d != z:\r\n print(\"NO\")\r\nelse:\r\n d = 0\r\n for i in range(len(a)):\r\n if a[i] != s[i]:\r\n d += 1\r\n if d > 2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "a=input()\r\nb=input()\r\n\r\nif(len(a)!=len(b)):\r\n print(\"NO\")\r\n exit(0)\r\ns=0 \r\nfor i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n s+=1\r\na=\"\".join(sorted(a))\r\nb=\"\".join(sorted(b))\r\nif s==2 and a==b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "a=input()\r\nb=input()\r\nx1=sorted(a)\r\ny1=\"\".join(x1)\r\nx2=sorted(b)\r\ny2=\"\".join(x2)\r\nc=0\r\nif y1==y2:\r\n for i in range(len(a)):\r\n if a[i]!=b[i]: \r\n c+=1\r\n if c==2:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "a=list(input())\r\nb=list(input())\r\ncount=0\r\nm=sorted(a)\r\nn=sorted(b)\r\nif(m==n):\r\n for i in range(len(m)):\r\n if a[i]!=b[i]:\r\n count+=1\r\n if count==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s1 = input()\r\ns2 = input()\r\n\r\nif len(s1) != len(s2):\r\n print(\"NO\")\r\n exit(0)\r\n\r\narr1 = []\r\narr2 = []\r\nfor i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n arr1.append(s1[i])\r\n arr2.append(s2[i])\r\n\r\nif len(arr2) != 2:\r\n print(\"NO\")\r\n exit(0)\r\n\r\narr1[0], arr1[1] = arr1[1], arr1[0]\r\n\r\nif arr1[0] == arr2[0] and arr1[1] == arr2[1]:\r\n print(\"YES\")\r\n exit(0)\r\n\r\nprint(\"NO\")\r\nexit(0)", "def main():\r\n gene_a, gene_b = input(), input()\r\n\r\n if len(gene_a) != len(gene_b) or len(gene_a) < 2:\r\n print(\"NO\")\r\n return\r\n\r\n diffs = []\r\n for i in range(len(gene_a)):\r\n if gene_a[i] != gene_b[i]:\r\n diffs.append((gene_a[i], gene_b[i]))\r\n\r\n if len(diffs) != 2:\r\n print(\"NO\")\r\n return\r\n\r\n if diffs[0][0] == diffs[1][1] and diffs[1][0] == diffs[0][1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "fst = [_ for _ in input().strip()]\r\nsnd = [_ for _ in input().strip()]\r\n\r\ndiff_count = sum(a != b for a, b in zip(fst, snd))\r\n\r\nfst.sort()\r\nsnd.sort()\r\n\r\nprint(\"YES\" if fst == snd and diff_count == 2 else \"NO\")\r\n\r\n\r\n", "a = list(input())\r\nb = list(input())\r\nif len(a)!=len(b):\r\n print(\"NO\")\r\n exit()\r\nif len(a)==2:\r\n if a!=b[::-1]:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n print(\"YES\")\r\n exit()\r\nc = 0\r\ntemp = -1\r\nfor i in range(len(a)):\r\n if a[i]!=b[i]:\r\n c+=1\r\n if (temp == -1 and c==1) :\r\n temp = i\r\n else:\r\n b[i],b[temp] = b[temp],b[i]\r\na = \"\".join(a)\r\nb = \"\".join(b)\r\n# print(a)\r\n# print(b)\r\n# print(c)\r\nif c!=2:\r\n print(\"NO\")\r\n\r\nelse:\r\n if (a==b):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "#from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\"\"\"\r\n#from heapq import *\r\n#from itertools import *\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\nt=1\r\nwhile(t):\r\n t-=1\r\n a=st()\r\n b=st()\r\n if(len(a)!=len(b)):\r\n print(\"NO\")\r\n continue\r\n fl=0\r\n p1=0\r\n p2=0\r\n for i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n fl+=1\r\n if(fl==1):\r\n p1=i\r\n else:\r\n p2=i\r\n if(fl>2 or fl==1):\r\n print(\"NO\")\r\n else:\r\n a=list(a)\r\n a[p1],a[p2]=a[p2],a[p1]\r\n a=''.join(a)\r\n if(a==b):\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", "#\"from dust i have come, dust i will be\"\n\na=list(input())\nb=list(input())\n\n#if two string ,matches\nif a==b:\n s=set(a)\n if(len(s)==len(a)):\n print(\"NO\")\n else:\n print(\"YES\")\n\n exit(0)\n\n#if length aren't the same\nif len(a)!=len(b):\n print(\"NO\")\n exit(0)\n\nj=0;k=0\n\nch1=[]\nch2=[]\n\nfor i in range(len(a)):\n if(a[i]!=b[i]):\n ch1.insert(j,b[i])\n j+=1\n ch2.insert(k,a[i])\n k+=1\n\nif len(ch1)!=2:\n print(\"NO\")\nelse:\n if(ch1[1] == ch2[0] and ch1[0]==ch2[1]):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\n\n\n\n", "l1=list(input())\r\nl2=list(input())\r\nc=0\r\nif (len(l1)==len(l2)):\r\n for i in range (len(l1)):\r\n if (l1[i]!=l2[i]):\r\n c=c+1\r\nl1.sort()\r\nl2.sort()\r\nif (c==2 and l1==l2):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s1=input()\r\ns2=input()\r\ns1=list(s1)\r\ns2=list(s2)\r\nif(len(s2)!=len(s1)):\r\n print(\"NO\")\r\nelse:\r\n flag=0\r\n dic={}\r\n for i in range(len(s1)):\r\n if(s1[i] in dic.keys()):\r\n dic[s1[i]]+=1\r\n else:\r\n dic[s1[i]]=1\r\n\r\n dic1={}\r\n for i in range(len(s1)):\r\n if(s2[i] in dic1.keys()):\r\n dic1[s2[i]]+=1\r\n else:\r\n dic1[s2[i]]=1\r\n\r\n if(dic==dic1):\r\n diff=0\r\n for i in range(len(s1)):\r\n if(s1[i]!=s2[i]):\r\n diff+=1\r\n \r\n if(diff>2):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n\r\n else:\r\n print(\"NO\")\r\n", "s = input()\r\nt = input()\r\nif len(s) != len(t):\r\n print(\"NO\")\r\nelse:\r\n dif1 = []\r\n dif2 = []\r\n for i in range(len(s)):\r\n if s[i] != t[i]:\r\n dif1.append(s[i])\r\n dif2.append(t[i])\r\n if len(dif1) > 2:\r\n print(\"NO\")\r\n quit(0)\r\n if dif1[::-1] == dif2 and len(dif1) == 2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "string1 = list(input())\r\nstring2 = list(input())\r\none = len(string1)\r\ntwo = len(string2)\r\nif one != two:\r\n print(\"NO\")\r\nelse:\r\n c = 0\r\n l = []\r\n for i in range(one):\r\n if string1[i] != string2[i]:\r\n c += 1\r\n l.append(i)\r\n\r\n if c != 2:\r\n print(\"NO\")\r\n else:\r\n # print(string1)\r\n string1[l[0]], string1[l[1]] = string1[l[1]], string1[l[0]]\r\n # print(string1)\r\n # string1[l[1]] = string1[l[0]]\r\n # print(l)\r\n # string1 = string1.replace(l[0], l[1],1)\r\n # print(string1)\r\n # string1 = string1.replace(l[1], l[0],1)\r\n # print(string1)\r\n if \"\".join(string1) == \"\".join(string2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import Counter\r\n\r\ns1 = input()\r\ns2 = input()\r\nr = 0\r\n\r\nfor i, j in zip(s1, s2):\r\n if i != j:\r\n r += 1\r\n\r\nif r == 2 and Counter(s1) == Counter(s2):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\nif len(a)!=len(b):\r\n print(\"NO\")\r\nelse:\r\n found=False\r\n cnt=0\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n if found:\r\n if a[i]==pair[1] and b[i]==pair[0]:\r\n ok=True\r\n else:\r\n ok=False\r\n cnt+=1\r\n else:\r\n found=True\r\n pair=(a[i],b[i])\r\n if cnt==1 and ok:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "\"\"\"\r\ns1=input()\r\ns2=input()\r\ns1s=[]\r\ns2s=[]\r\nct1=[]\r\nct2=[]\r\nfor i in s1:\r\n s1s.append(i)\r\nfor i in s2:\r\n s2s.append(i)\r\ntemp=0\r\nfor i in s1:\r\n if(s1s.count(i)==s2s.count(i)):\r\n continue\r\n else:\r\n temp=1\r\n break\r\nif(temp==0 and len(s1)==len(s2)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\"\"\"\r\ns1=input()\r\ns2=input()\r\nif(len(s1)!=len(s2)):\r\n print(\"NO\")\r\nelse:\r\n count=0\r\n idx=[]\r\n for i in range(len(s1)):\r\n if(s1[i]!=s2[i]):\r\n count+=1\r\n idx.append(i)\r\n #print(\"Count\",count)\r\n #print(\"idx\",idx)\r\n if(count>2):\r\n print(\"NO\")\r\n elif(count==1):\r\n print(\"NO\")\r\n else:\r\n l1=list(s1)\r\n temp=s1[idx[0]]\r\n l1[idx[0]]=l1[idx[1]]\r\n l1[idx[1]]=temp\r\n s1=\"\"\r\n for i in l1:\r\n s1=s1+i\r\n #print(s1)\r\n if(s1==s2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n ", "a = [_ for _ in input()]\r\nb = [_ for _ in input()]\r\nif len(a) != len(b):\r\n print(\"NO\")\r\n exit()\r\nk = []\r\nfor i in range(len(a)):\r\n if a[i] != b[i]:\r\n k.append(i)\r\nif len(k) != 2:\r\n print(\"NO\")\r\n exit()\r\nj = k[0]\r\nm = k[1]\r\nja = a[j]\r\nma = a[m]\r\na[j] = ma\r\na[m] = ja\r\nif a == b:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n", "s1 = input()\r\ns2 = input()\r\nif len(s1) == len(s2):\r\n l1 = []\r\n l2 = []\r\n diff = 0\r\n # isYes = True\r\n for i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n diff += 1\r\n l1.append(s1[i])\r\n l2.append(s2[i])\r\n if diff > 2:\r\n break\r\n # isYes = False\r\n if diff > 2 or diff == 1:\r\n print(\"NO\")\r\n else:\r\n if diff == 0 or (l1[0] == l2[1] and l1[1] == l2[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "st1 = input()\r\nst2 = input()\r\nif(len(st1) != len(st2)):\r\n print(\"NO\")\r\nelse:\r\n diff = []\r\n for i in range(len(st1)):\r\n if(st1[i] != st2[i]):\r\n diff.append(i)\r\n if(len(diff) == 1 or len(diff) > 2):\r\n print(\"NO\")\r\n elif(len(diff) == 0):\r\n if(len(st1) == len(set(st1))):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n else:\r\n p1 = st1[diff[0]]\r\n neededP1 = st2[diff[0]]\r\n\r\n a = st1[diff[1]]\r\n neededP2 = st2[diff[1]]\r\n\r\n if(neededP1 == a and neededP2 == p1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\ns=ns()\r\ns1=ns()\r\nk=[]\r\n\r\nif len(s)!=len(s1):\r\n print(\"NO\")\r\nelse:\r\n for x in range(len(s)):\r\n if s[x]!=s1[x]:\r\n k.append([s[x],s1[x]])\r\n if len(k)>2 or len(k)==1:\r\n print(\"NO\")\r\n elif len(k)==0:\r\n print(\"YES\")\r\n else:\r\n if k[0][0]==k[1][1 ] and k[1][0]==k[0][1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n", "class CodeforcesTask186ASolution:\n def __init__(self):\n self.result = ''\n self.g1 = ''\n self.g2 = ''\n\n def read_input(self):\n self.g1 = list(input())\n self.g2 = list(input())\n\n def process_task(self):\n if len(self.g1) != len(self.g2):\n self.result = \"NO\"\n else:\n can_ = True\n d1 = None\n d2 = None\n for x in range(len(self.g1)):\n if self.g1[x] != self.g2[x]:\n if d1:\n d2 = x + 1\n else:\n d1 = x + 1\n if d1 and d2:\n #print(self.g1, self.g2)\n #print(d1, d2)\n self.g1[d1 - 1], self.g1[d2 - 1] = self.g1[d2 - 1], self.g1[d1 - 1]\n self.g1 = \"\".join(self.g1)\n self.g2 = \"\".join(self.g2)\n #print(self.g1, self.g2)\n can_ = self.g1 == self.g2\n elif not d1 and not d2:\n can_ = True\n else:\n can_ = False\n\n self.result = \"YES\" if can_ else \"NO\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask186ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "gen1 = input()\ngen2 = input()\n\nif len(gen1) != len(gen2):\n print(\"NO\")\n quit()\n\nindex=[]\n\nfor i in range(len(gen1)):\n if gen1[i] != gen2[i]:\n index.append(i)\n\nif len(index) != 2:\n print(\"NO\")\nelse:\n if (gen1[index[0]]==gen2[index[1]] and gen1[index[1]]==gen2[index[0]]):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\t \t\t \t\t \t \t\t \t\t \t \t\t", "first = input()\r\nsecond = input()\r\n\r\nif len(first) != len(second):\r\n print(\"NO\")\r\nelse:\r\n differences = []\r\n for i in range(len(first)):\r\n if first[i] != second[i]:\r\n differences.append(i)\r\n\r\n if len(differences) == 0:\r\n print('YES')\r\n elif len(differences) == 2:\r\n if first[differences[0]] == second[differences[1]] and first[differences[1]] == second[differences[0]]:\r\n print(\"YES\")\r\n else:\r\n print('NO')\r\n else:\r\n print(\"NO\")\r\n", "s = input()\np = input()\n#print(list(dict.fromkeys(list(p))),list(dict.fromkeys(list(s))))\nif sorted(list(dict.fromkeys(list(s))))!=sorted(list(dict.fromkeys(list(p)))) or len(s)!=len(p):\n\tprint(\"NO\")\nelse:\n\tc=0\n\tk=[]\n\tfor i in range(len(s)):\n\t\tif s[i]!=p[i]:\n\t\t\tc+=1\n\t\t\tk.append([s[i],p[i]])\n\tif c==2:\n\t\tif k[0][0]==k[1][1] and k[1][0]==k[0][1]:\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"NO\")\n", "def solve(s1, s2):\r\n if len(s1) != len(s2): \r\n return False\r\n anomaly = -1\r\n for i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n if anomaly == -2: \r\n return False\r\n elif anomaly != -1:\r\n if s1[anomaly] != s2[i] or s1[i] != s2[anomaly]:\r\n return False\r\n anomaly = -2\r\n else: \r\n anomaly = i\r\n return anomaly == -1 or anomaly == -2\r\n\r\ns1, s2 = input(), input()\r\nprint(\"YES\" if solve(s1, s2) else \"NO\")", "string1=input()\nstring2=input()\nif len(string1)!=len(string2):\n\tprint(\"NO\")\nelse:\n\tcount=0\n\tvaried=[]\n\tfor i in range(len(string1)):\n\t\tif string1[i]!=string2[i]:\n\t\t\tcount+=1\n\t\t\tvaried.append((string1[i],string2[i]))\n\n\tif count==0 or (count==2 and varied[0][0]==varied[1][1] and varied[1][0]==varied[0][1]):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\n\n", "def solve(n,m):\n\t\n\tif len(n)!= len(m) :\n\t\treturn 'NO'\n\n\tr1=''\n\tr2=''\n\n\tfor i in range(len(n)):\n\t\tif n[i]!=m[i] :\n\t\t\tr1=r1+n[i]\n\t\t\tr2=r2+m[i]\n\tif len(r1)!=2 :\n\t\treturn 'NO'\n\n\tif r1[::-1]!=r2 :\n\t\treturn 'NO'\n\n\treturn 'YES'\n\n\n\n\n\n\n\nl3 = input()\nl4=input()\n\n\nprint(solve(l3,l4))\n", "a=input().strip()\r\nb=input().strip()\r\n\r\nif(len(a)!=len(b)):\r\n print(\"NO\")\r\nelse:\r\n ct=0\r\n arr=sorted(a)\r\n brr=sorted(b)\r\n if(arr!=brr):\r\n print(\"NO\")\r\n else:\r\n for k in range(len(a)):\r\n if(a[k]!=b[k]):\r\n ct+=1\r\n if ct<=2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def is_same_race(genome1, genome2):\r\n if len(genome1) != len(genome2):\r\n return \"NO\"\r\n\r\n diff_count = 0\r\n diff_positions = []\r\n\r\n for i in range(len(genome1)):\r\n if genome1[i] != genome2[i]:\r\n diff_count += 1\r\n diff_positions.append(i)\r\n\r\n if diff_count == 2 and genome1[diff_positions[0]] == genome2[diff_positions[1]] and genome1[diff_positions[1]] == genome2[diff_positions[0]]:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\ngenome1 = input()\r\ngenome2 = input()\r\n\r\nprint(is_same_race(genome1, genome2))\r\n", "def snr(f,s):\r\n\tlf=len(f)\r\n\tif lf!=len(s):\r\n\t\treturn 0\r\n\tfv,sv=[],[]\r\n\tfor c in range(lf):\r\n\t\tif f[c]==s[c]:\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tif len(fv)>2:\r\n\t\t\t\treturn 0\r\n\t\t\tfv.append(f[c])\r\n\t\t\tsv.append(s[c])\r\n\tif len(fv)==2 and (fv==sv or fv==sv[::-1]):\r\n\t\treturn 1\r\n\treturn 0\r\n\r\nf,s=input(),input()\r\nt='NO'\r\nif snr(f,s):\r\n\tt='YES'\r\nprint(t)", "s=input()\r\nt=input()\r\nss=set()\r\nc=0\r\nif len(s)!=len(t):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(s)):\r\n if s[i]!=t[i]:\r\n c+=1\r\n ss.add(s[i])\r\n ss.add(t[i])\r\n if c!=2:\r\n print(\"NO\")\r\n else:\r\n if len(ss)==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s1=input();s2=input();l=[];m=min(len(s2),len(s1))\r\nfor i in range(m):\r\n\tif s1[i]!=s2[i]:l.append(i)\r\nif len(l)>1:\r\n\tb=s1[:l[0]]+s1[l[1]:l[1]+1]+s1[l[0]+1:l[1]]+s1[l[0]:l[0]+1]+s1[l[1]+1:]\r\nelse:b=''\r\nif b==s2:print('YES')\r\nelse:print('NO')", "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=list(input())\r\nn1=sorted(n)\r\nm=list(input())\r\nm1=sorted(m)\r\na=[]\r\nb=[]\r\ncount=0\r\nif(n1!=m1 or len(n)!=len(m)):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(n)):\r\n if(n[i]!=m[i]):\r\n count+=1\r\n a.append(n[i])\r\n b.append(m[i])\r\n if(count==2 and a[0]==b[1] and a[1]==b[0]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "first_input = input()\r\nsecond_input = input()\r\ncount = 0\r\nn = min(len(first_input), len(second_input))\r\nfor i in range(n):\r\n if first_input[i] != second_input[i]:\r\n count += 1\r\n\r\nif count == 2 and set(first_input) == set(second_input):\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nif len(a) != len(b):\r\n print('NO')\r\nelse:\r\n k = []\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n k.append(i)\r\n if len(k) != 2:\r\n print('NO')\r\n else:\r\n if a[k[0]] == b[k[1]] and a[k[1]] == b[k[0]]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "s1 = input()\r\ns2 = input()\r\nd=list(s1);d2=list(s2)\r\nd.sort();d2.sort()\r\nif(len(s1)!=len(s2)):\r\n print(\"NO\")\r\nelif(d==d2):\r\n c=0\r\n for i in range(len(s1)):\r\n if(s1[i]!=s2[i]):\r\n c+=1\r\n if(c>2 or c==1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n#Priyanshu Kumar", "s,t = input(), input()\r\nr = all(y in s for y in t)\r\nc = sum(x!= y for x,y in zip(s,t)) == 2\r\nans = r and c\r\nif ans == 1 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\") \r\n", "s1 = str(input())\r\ns2 = str(input())\r\nif len(s1) != len(s2):\r\n print(\"NO\")\r\nelse:\r\n good = []\r\n s1 = list(s1)\r\n s2 = list(s2)\r\n for i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n good.append(i)\r\n if len(good) == 1 or len(good) > 2:\r\n print(\"NO\")\r\n elif len(good) == 0:\r\n print(\"YES\")\r\n else:\r\n f= False\r\n for i in range(len(good)-1):\r\n s1[good[i]],s1[good[i+1]] = s1[good[i+1]],s1[good[i]]\r\n if s1 == s2:\r\n f = True\r\n break\r\n print(\"YES\" if f else \"NO\")", "a=input()\r\nb=input()\r\nif (sorted(a)!=sorted(b)):\r\n print(\"NO\")\r\nelse:\r\n s=0\r\n for i in range(len(a)):\r\n if (a[i]!=b[i]):\r\n s+=1\r\n if (s==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "a=input()\r\nb=input()\r\ncount=0\r\nif(sorted(a)!=sorted(b)):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n count+=1\r\n if(count==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import collections,math,itertools,bisect,heapq,copy\nclass Solution:\n def solve(self):\n # n = int(input())\n # A = list(map(int, input().rstrip().split()))\n str1 = input()\n str2 = input()\n if len(str1) != len(str2):\n print('NO')\n return\n d=[]\n for i in range(len(str1)):\n if str1[i] != str2[i]:\n d.append(i)\n if len(d) != 2:\n print('NO')\n else:\n if str1[d[1]] == str2[d[0]] and str1[d[0]] == str2[d[1]]:\n print('YES')\n else:\n print('NO')\n \n \nif __name__ == \"__main__\":\n solution = Solution()\n solution.solve()", "g1 = input()\r\ng2 = input()\r\na = False\r\ncnt = []\r\nif len(g1) == len(g2):\r\n\r\n for i in range(0,len(g1)):\r\n if g1[i] != g2[i]:\r\n cnt += [g1[i],g2[i]]\r\n \r\n if len(cnt) == 4: a = True\r\nif a:\r\n if cnt[0] == cnt[3] and cnt[2] == cnt[1]:\r\n a = True\r\n else: a = False\r\nif a: print(\"YES\")\r\nelse: print(\"NO\")\r\n ", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# # 2022\r\n# import sys\r\n# input=sys.stdin.readline\r\ndef exe():\r\n x=len(a)\r\n y=len(b)\r\n #print('dhjd')\r\n if(x!=y):\r\n #print('dhjd2')\r\n return 'NO'\r\n else:\r\n l=[]\r\n #print('dhjd3')\r\n for i in range(x):\r\n if(a[i]!=b[i]):\r\n l.append(i)\r\n if(len(l)!=2):\r\n #print('dhjd4')\r\n return 'NO'\r\n else:\r\n #print(a,b,l)\r\n #print('dhjd5')\r\n al=list(a)\r\n temp=al[l[0]]\r\n al[l[0]]=al[l[1]]\r\n al[l[1]]=temp\r\n #print(al)\r\n c=''\r\n c=c.join(al)\r\n #print(c)\r\n if(c==b):\r\n return 'YES'\r\n else:\r\n return 'NO'\r\n return\r\na=input()\r\nb=input()\r\nprint(exe())", "n=input()\r\nm=input()\r\ncount=0\r\nif len(n)==len(m):\r\n for i in range(len(n)):\r\n if m[i] not in n:\r\n print(\"NO\")\r\n break\r\n else:\r\n for i in range(len(n)):\r\n if n[i]!=m[i]:\r\n count+=1\r\n if count==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\nn1=len(s1)\r\nn2=len(s2)\r\n\r\na=[0]*26\r\nb=[0]*26\r\nk=0\r\nfor i in range(n1):\r\n a[ord(s1[i])-97]+=1\r\n\r\nfor i in range(n2):\r\n b[ord(s2[i])-97]+=1\r\n\r\n# for i in range(26):\r\n# print(b[i])\r\nfor i in range(26):\r\n if(a[i]!=b[i]):\r\n print(\"NO\")\r\n k=1\r\n break; \r\nif(k!=1):\r\n \r\n if(n1!=n2):\r\n print(\"NO\")\r\n \r\n else:\r\n c=0\r\n for i in range(n1):\r\n if(s1[i]!=s2[i]):\r\n c+=1\r\n\r\n if(c==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\n", "a=input()\r\nb=input()\r\np=0\r\nl=[]\r\nif len(a)==len(b):\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n p+=1\r\n l.append(i)\r\n else:\r\n continue \r\n if p==2:\r\n if a[l[1]]==b[l[0]] and a[l[0]]==b[l[1]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n elif p==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", "s1=str(input());s2=str(input())\r\nif len(s1)!=len(s2): print(\"NO\")\r\nelse:\r\n try:\r\n l1=list(s1)\r\n l1.sort(reverse=False)\r\n l2=list(s2)\r\n l2.sort(reverse=False)\r\n if l1!=l2:\r\n raise Exception\r\n except Exception as e:\r\n print(\"NO\")\r\n else:\r\n a=0\r\n for j in range(len(s1)):\r\n if s1[j]!=s2[j]: a+=1\r\n print(\"YES\" if a==0 or a==2 else \"NO\")", "s1 = input()\r\ns2 = input()\r\ns= 0 \r\nif(len(s1) != len(s2)):\r\n print(\"NO\")\r\nelif(sorted(s1) != sorted(s2)):\r\n print(\"NO\")\r\nelse:\r\n for a,b in zip(s1,s2):\r\n if(a!=b):\r\n s+=1\r\n if(s==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "# LUOGU_RID: 101471155\ns, t = input(), input()\r\nprint('YES' if sum(x != y for x, y in zip(s, t))\r\n == 2 and all(y in s for y in t) else 'NO')\r\n", "dwarf1 = input()\r\ndwarf2 = input()\r\n\r\ndef isSameRace(dwarf1, dwarf2):\r\n allowed = True\r\n if len(dwarf1) != len(dwarf2):\r\n return 'NO'\r\n else:\r\n lst = [i for i in zip(dwarf1, dwarf2)]\r\n for i in lst:\r\n if i[1] != i[0]:\r\n #checks if switch has already happened\r\n if allowed:\r\n allowed = False\r\n if i[::-1] not in lst:\r\n return 'NO'\r\n else:\r\n lst[lst.index(i[::-1])] = (i[0],i[0])\r\n continue\r\n #switch already happened\r\n else:\r\n return 'NO'\r\n return 'YES'\r\n\r\nprint(isSameRace(dwarf1, dwarf2))", "a=list(input())\r\nb=list(input())\r\n\r\n#if two string ,matches\r\nif a==b:\r\n s=set(a)\r\n if(len(s)==len(a)):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n\r\n exit(0)\r\n\r\n#if length aren't the same\r\nif len(a)!=len(b):\r\n print(\"NO\")\r\n exit(0)\r\n\r\nj=0;k=0\r\n\r\nch1=[]\r\nch2=[]\r\n\r\nfor i in range(len(a)):\r\n if(a[i]!=b[i]):\r\n ch1.insert(j,b[i])\r\n j+=1\r\n ch2.insert(k,a[i])\r\n k+=1\r\n\r\nif len(ch1)!=2:\r\n print(\"NO\")\r\nelse:\r\n if(ch1[1] == ch2[0] and ch1[0]==ch2[1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "t=input()\r\nn=input()\r\na=[]\r\nb=[]\r\nf=0\r\nif len(t)==len(n):\r\n for x in range(0,len(t)):\r\n if t[x]==n[x]:\r\n pass\r\n else:\r\n a.append(t[x])\r\n b.append(n[x])\r\n if len(a)>2 or len(b)>2:\r\n print(\"NO\")\r\n f=1\r\n break\r\n a.sort()\r\n b.sort()\r\n if f==0:\r\n if (a[0]==b[0] and a[1]==b[1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n\r\n ", "s1=input()\ns2=input()\nif len(s1)!=len(s2):\n\tprint(\"NO\")\nelse:\n\tn=len(s1)\n\tdiffs=[]\n\tfor x in range(n):\n\t\tif s1[x]!=s2[x]:\n\t\t\tdiffs.append(x)\n\tif not len(diffs):\n\t\tprint(\"YES\")\n\telse:\n\t\tif len(diffs)!=2:\n\t\t\tprint(\"NO\")\n\t\telse:\n\t\t\tif s1[diffs[0]]==s2[diffs[1]] and s2[diffs[0]]==s1[diffs[1]]:\n\t\t\t\tprint(\"YES\")\n\t\t\telse:\n\t\t\t\tprint(\"NO\")", "s=str(input())\r\ns1=str(input())\r\n\r\nif(len(s)==len(s1)):\r\n sum=0\r\n count=0\r\n for i in range(0,len(s),1):\r\n if(s[i]!=s1[i]):\r\n sum+=1\r\n count+=(ord(s[i])-ord(s1[i]))\r\n if(sum>2):\r\n break\r\n if(count==0 and sum==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "import sys\n\nx = input()\ny = input()\n\nif len(x) != len(y):\n print(\"NO\")\n sys.exit(0)\n\ndiff = []\nfor i in range(len(x)):\n if x[i] != y[i]:\n diff.append(i)\n\nif len(diff) != 2:\n print(\"NO\")\n sys.exit(0)\n\nif x[diff[0]] == y[diff[1]] and x[diff[1]] == y[diff[0]]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n", "a1= list(input())\r\na2= list(input())\r\n\r\nif sorted(a1)== sorted(a2):\r\n checker= 0\r\n for i in range(len(a1)):\r\n if a1[i]!= a2[i]:\r\n checker+= 1\r\n if checker!= 2:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "gnom1 = input()\r\ngnom2 = input()\r\nif len(gnom2) != len(gnom1):\r\n print('NO')\r\nelse:\r\n s1 = ''\r\n s2 = ''\r\n for i in range(len(gnom1)):\r\n if gnom1[i] != gnom2[i]:\r\n s1 = s1 + gnom1[i]\r\n s2 = s2 + gnom2[i]\r\n if all([len(s1) == len(s2), len(s1) == 2]):\r\n if s1[1] + s1[0] == s2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')", "from collections import Counter\r\ns1=input()\r\ns2=input()\r\nc1=Counter(s1)\r\nc2=Counter(s2)\r\ncnt=0\r\nfor i,j in zip(s1,s2):\r\n if i!=j:\r\n cnt+=1\r\nif c1==c2 and cnt==2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import Counter\r\ns1=input().rstrip()\r\ns2 =input().rstrip()\r\nc1,c2=Counter(s1),Counter(s2)\r\nc1_dict,c2_dict={},{}\r\nif c1==c2:\r\n ans='YES'\r\n for i in range(len(s1)):\r\n if s1[i] not in c1_dict:\r\n c1_dict[s1[i]]=[i]\r\n else:\r\n c1_dict[s1[i]].append(i)\r\n # print(c1_dict)\r\n for j in range(len(s2)):\r\n if s2[j] not in c2_dict:\r\n c2_dict[s2[j]]=[j]\r\n else:\r\n c2_dict[s2[j]].append(j)\r\n # print(c2_dict)\r\n d=0\r\n for key in c1_dict:\r\n b1=set(c1_dict[key])\r\n b2=set(c1_dict[key]+ c2_dict[key])\r\n d+=abs(len(b1)-len(b2))\r\n if d>=3:\r\n ans='NO'\r\n break\r\n print(ans)\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[204]:\n\n\n# # n = int(input())\n# # line = list(map(int, input().split()))\n# # line = list(str(input()))\n\n\n# In[12]:\n\n\nfrom collections import Counter\n\n\n# In[17]:\n\n\nline1 = list(str(input()))\nline2 = list(str(input()))\n\n\n# In[18]:\n\n\ncount_1 = Counter(line1)\ncount_2 = Counter(line2)\n\n\n# In[19]:\n\n\nif count_1 != count_2:\n print('NO')\nelse:\n count = 0\n for a, b in zip(line1, line2):\n if a != b:\n count += 1\n \n if count == 2:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\n# In[ ]:\n\n\n\n\n", "s1 = list(str(input()))\r\ns2 = list(str(input()))\r\n\r\nif len(s1) != len(s2):\r\n print(\"NO\")\r\nelse:\r\n swap_index = 0\r\n flag = False\r\n for i in range(len(s1)):\r\n if s1[i] != s2[i] and not flag:\r\n swap_index = i\r\n flag = True\r\n elif s1[i] != s2[i]:\r\n s1[swap_index], s1[i] = s1[i], s1[swap_index]\r\n break\r\n print(\"YES\" if s1 == s2 else \"NO\")", "s1 = str(input())\r\ns2 = str(input())\r\n\r\nif(sorted(s1) != sorted(s2)):\r\n print('NO')\r\nelse:\r\n c = 0\r\n s1 = list(s1)\r\n s2 = list(s2)\r\n for i in range(len(s1)):\r\n if(s1[i] != s2[i]):\r\n c += 1 \r\n \r\n if(c == 2):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "def solve(s1, s2):\r\n if len(s1) != len(s2):\r\n return \"NO\"\r\n else:\r\n diff = []\r\n same = []\r\n hasDupe = False\r\n for i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n if len(diff) == 0:\r\n diff.append(s1[i])\r\n diff.append(s2[i])\r\n elif len(diff) == 2:\r\n if diff[0] == s2[i] and diff[1] == s1[i]:\r\n diff.append(s1[i])\r\n diff.append(s2[i])\r\n else:\r\n return \"NO\"\r\n else:\r\n return \"NO\"\r\n \r\n if s1[i] not in same:\r\n same.append(s1[i])\r\n else:\r\n hasDupe = True\r\n if (len(diff) == 0 and hasDupe == True) or len(diff) == 4:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n \r\n \r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nprint(solve(s1, s2))", "def find_genome():\r\n\tfirst_gnome = input()\r\n\tsecond_gnome = input()\r\n\r\n\tif len(second_gnome) != len(first_gnome):\r\n\t\tprint(\"NO\")\r\n\t\treturn\r\n\telse:\r\n\t\tdifferent_char_pairs = []\r\n\t\tfor index in range(len(first_gnome)):\r\n\t\t\tif first_gnome[index] != second_gnome[index]:\r\n\t\t\t\tdifferent_char_pairs.append(first_gnome[index])\r\n\t\t\t\tdifferent_char_pairs.append(second_gnome[index])\r\n\t\t\t\r\n\t\t\tif len(different_char_pairs) > 4:\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\treturn\r\n\r\n\tif len(different_char_pairs) < 4:\r\n\t\tprint(\"NO\")\r\n\t\treturn\r\n\t\r\n\tif different_char_pairs[0] == different_char_pairs[-1] and different_char_pairs[1] == different_char_pairs[2]:\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n\r\nfind_genome()", "a = input()\r\nb = input()\r\nif set(a) != set(b) or len(a) != len(b):\r\n print('NO')\r\nelse :\r\n dif , tmp = 0 , True\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n dif+=1\r\n if dif > 2 :\r\n print('NO')\r\n tmp = False\r\n break\r\n if tmp:\r\n print('YES')", "gene1=input()\r\ngene2=input()\r\n\r\nn=min(len(gene1),len(gene2))\r\nz=0\r\nif sorted(gene1)==sorted(gene2):\r\n for t in range(n):\r\n if gene1[t]!=gene2[t]:\r\n z+=1\r\n if z==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def func(s,v,l):\r\n count = 0\r\n for i in range(l):\r\n if s[i] != v[i]:\r\n count += 1\r\n for j in range(i+1,l):\r\n if s[j] != v[j]:\r\n if s[i]==v[j] and s[j]==v[i]:\r\n s[i],s[j] = s[j],s[i]\r\n break\r\n else:\r\n count += 1\r\n break\r\n if s[i] != v[i]:\r\n return 'NO'\r\n if count==2:\r\n return 'NO'\r\n return 'YES'\r\ns = list(input())\r\nv = list(input())\r\nl = len(s)\r\nif l==len(v):\r\n print(func(s,v,l))\r\nelse:\r\n print('NO')", "first = input()\nsecond = input()\n\ncount = 0\npos = []\n\nif (len(first) != len(second)):\n\tprint(\"NO\")\nelse:\n\tfor i in range(0, len(first)):\n\t\tif(first[i] != second[i]):\n\t\t\tcount += 1\n\t\t\tpos.append(i)\n\t\n\n\tif (count == 2):\n\t\tchar1 = first[pos[0]]\n\t\tchar2 = first[pos[1]]\n\t\tchar3 = second[pos[0]]\n\t\tchar4 = second[pos[1]]\n\n\t\tif (char1 == char4 and char2 == char3):\n\t\t\tprint(\"YES\")\n\t\telse:\n\t\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"NO\")\n", "def race(gen1,gen2):\r\n if len(gen1)!=len(gen2):\r\n return \"NO\"\r\n \r\n count=0\r\n swap=[]\r\n for i in range(len(gen1)):\r\n if gen1[i]!=gen2[i]:\r\n count+=1\r\n swap.append(i)\r\n \r\n if count>2:\r\n return \"NO\"\r\n if count==2 and gen1[swap[0]]==gen2[swap[1]] and gen1[swap[1]]==gen2[swap[0]]:\r\n return \"YES\"\r\n \r\n return \"NO\"\r\n \r\ngen1=input()\r\ngen2=input()\r\nprint(race(gen1,gen2))", "x = input()\r\ny = input()\r\nif len(x) != len(y):\r\n print('NO')\r\nelse:\r\n flag = 0\r\n n = len(x)\r\n l = -1\r\n r = -1\r\n for i in range(n): \r\n if x[i] != y[i] :\r\n if flag == 0:\r\n l = i\r\n elif flag == 1:\r\n r = i\r\n else:\r\n print('NO')\r\n exit() \r\n flag += 1\r\n if l == -1 or r == -1:\r\n print('NO')\r\n else:\r\n if x[l] == y[r] and x[r] == y[l]:\r\n print('YES') \r\n else:\r\n print('NO') \r\n\r\n \r\n # elif x[l] == y[l] and x[r]!= y[r] and y[r] == x[l]:\r\n # flag += 1\r\n # l+=1\r\n # r-=1\r\n # elif x[l] != y[l] and x[r] == y[r] and y[r] == x[l]:\r\n # flag += 1\r\n # l+=1\r\n # r-=1\r\n # continue \r\n # a a a c d \r\n # a b b a d\r\n\r\n\r\n \r\n # if flag>=2:\r\n # print('NO')\r\n # else:\r\n # print('YES') \r\n # ab\r\n # aa\r\n \r\n\r\n", "s=input()\r\nt=input()\r\nif len(s)!=len(t):\r\n print(\"NO\")\r\nelse:\r\n ch1=\"\"\r\n ch2=\"\"\r\n for i in range(len(s)):\r\n if s[i]!=t[i]:\r\n ch1+=s[i]\r\n ch2+=t[i]\r\n if len(ch1)!=2 or len(ch2)!=2:\r\n print(\"NO\")\r\n else:\r\n if ch1==ch2[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from sys import exit as ex\r\ngenome1 = input()\r\ngenome2 = input()\r\n\r\nif len(genome1) != len(genome2):\r\n print(\"NO\")\r\n ex(0)\r\n\r\ndiff_count = 0\r\ndiff_index_1 = diff_index_2 = -1\r\n\r\nfor i in range(len(genome1)):\r\n if genome1[i] != genome2[i]:\r\n diff_count += 1\r\n if diff_count > 2:\r\n print(\"NO\")\r\n ex(0)\r\n if diff_index_1 == -1:\r\n diff_index_1 = i\r\n else:\r\n diff_index_2 = i\r\n\r\nif diff_count == 0 or (diff_count == 2 and genome1[diff_index_1] == genome2[diff_index_2] and genome1[diff_index_2] == genome2[diff_index_1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n# d = \"-100\"\r\n# e = \"20\"\r\n# f = 30\r\n# g = True\r\n\r\n# print(eval(f\"{d} * {e} * -1\")) # 2000\r\n# print(\"Write Your Code Here\") # 173\r\n\r\n# def unique_in_order(iterable)\r\n# result = []\r\n# for item in iterable:\r\n# if not result or item != result[-1]:\r\n# result.append(item)\r\n# return result\r\n\r\n# print(unique_in_order('AAAABBBCCDAABBB'))\r\n# print(unique_in_order([1, 2, 2, 3, 3]))\r\n# print(unique_in_order([1, 4, 2, 2, 3, 3]))\r\n\r\n# import numpy as np\r\n\r\n# def format_phone(n):\r\n# n = np.array(n, str)\r\n# return \"({0}) {1}-{2}\".format(\"\".join(n[:3]), \"\".join(n[3:6]), \"\".join(n[6:])) if len(n) == 10 else \"Invalid Phone Number\"\r\n\r\n# def format_phone(n):\r\n# for i, e in enumerate(n):\r\n# n[i] = str(e)\r\n# return \"({0}) {1}-{2}\".format(\"\".join(n[:3]), \"\".join(n[3:6]), \"\".join(n[6:])) if len(n) == 10 else \"Invalid Phone Number\"\r\n\r\n# print(format_phone([1, 2, 3, 4, 5, 6, 7, 8, 9, 0])) # (123) 456-7890\r\n# print(format_phone([6, 2, 4, 7, 2, 1, 0, 2, 1, 1])) # (624) 721-0211\r\n# print(format_phone([1, 5, 5, 4, 9, 8, 6, 7, 1, 2, 1])) # Invalid Phone Number\r\n\r\n# def word_to_nums(word):\r\n# word = word.lower()\r\n# c = \"\"\r\n# for i in word:\r\n# c += f\" {ord(i)-96}\"\r\n# return c\r\n\r\n# # Tests\r\n# print(word_to_nums(\"Elzero\")) # \"5 12 26 5 18 15\"\r\n\r\n\r\n# holidays = 0\r\n# money = 0\r\n# if holidays == 0 :\r\n# money = 5000\r\n# print(f\"My Money is {money}\")\r\n# elif holidays == 1 or holidays == 2:\r\n# money = 3000\r\n# print(f\"My Money is {money}\")\r\n# elif holidays == 3:\r\n# money = 2000\r\n# print(f\"My Money is {money}\")\r\n# elif holidays == 4:\r\n# money = 1000\r\n# print(f\"My Money is {money}\")\r\n# elif holidays == 5:\r\n# money = 0\r\n# print(f\"My Money is {money}\")\r\n# else:\r\n# money = 0\r\n# print(f\"My Money is {money}\")\r\n\r\n\r\n# zero = 0\r\n# counter = 3\r\n# my = [\"Ahmed\", \"Mazero\", \"Elham\", \"Osama\", \"Gamal\", \"Ameer\"]\r\n# my = my[:-2]\r\n# my.reverse()\r\n# print(my) # [\"Osama\", \"Elham\", \"Mazero\", \"Ahmed\"]\r\n# print(my[1:3]) # [\"Elham\", \"Mazero\"]\r\n# print(my[1][:2]+my[2][2:]) # \"Elzero\"\r\n# print(my[2][-2:]) # \"ro\"\r\n\r\n# def convert(n):\r\n# l = []\r\n# for i in str(n):\r\n# l.append(i)\r\n# l.reverse()\r\n# return l\r\n\r\n# # Testing Ouput\r\n# print(convert(564987654)) # [4, 5, 6, 7, 8, 9, 4, 6, 5]\r\n# print(convert(529132)) # [2, 3, 1, 9, 2, 5]\r\n\r\n# def reverse(sentence):\r\n# sentence = sentence.split()\r\n# sentence.reverse()\r\n# return \" \".join(sentence)\r\n\r\n# # Testing Ouput\r\n# print(reverse(\"Elzero Web School test\")) # \"School Web Elzero\"\r\n\r\n# def add_commas_and_underscore(num):\r\n# num = str(num)\r\n# if len(num) <= 3:\r\n# return num\r\n# elif 6 >= len(num) >= 4:\r\n# return f\"{num[:-3]}_{num[-3:]}\"\r\n# # elif 9 >= len(num) >= 7:\r\n# # return f\"{num[:-6]},{num[-6:-3]}_{num[-3:]}\"\r\n# return f\"{int(num[:-6]):,}{num[-6:-3]}_{num[-3:]}\"\r\n\r\n\r\n# # Testing Ouput\r\n# print(add_commas_and_underscore(120)) # 120\r\n# print(add_commas_and_underscore(1530)) # 1_530\r\n# print(add_commas_and_underscore(120510650)) # 120,510_650\r\n# print(add_commas_and_underscore(123456789)) # 120,510_650\r\n# print(add_commas_and_underscore(510650480910)) # 510,650,480_910\r\n# print(add_commas_and_underscore(12069057014032)) # 12,069,057,014_032\r\n\r\n\r\n# def swapping(word):\r\n# # Your Code\r\n# c = \"\"\r\n# for i in word:\r\n# if not i.isdigit():\r\n# if i.islower():\r\n# c += i.upper()\r\n# else :\r\n# c += i.lower()\r\n# return c\r\n\r\n# # Test Cases\r\n# print(swapping(\"HellO\")) # hELLo\r\n# print(swapping(\"WOrld\")) # woRLD\r\n# print(swapping(\"12ProGRAM12\")) # pROgram\r\n\r\n# def remove_char_from(word, c):\r\n# l = \"\"\r\n# for i in word:\r\n# for cl in i:\r\n# if cl.lower() != c.lower():\r\n# l += cl\r\n# return l\r\n\r\n# # Testing Ouput\r\n# print(remove_char_from(\"ElddzeroD WebDD ddSchool\", \"d\")) # Elzero Web School\r\n# print(remove_char_from(\"ElxzeroX Web Sxchool\", \"x\")) # Elzero Web School\r\n# print(remove_char_from(\"Elzero@ Web@@ @@School\", \"@\")) # Elzero Web School\r\n\r\n# def longest_word_in(sentence):\r\n# sentence = sentence.split()\r\n# max = sentence[0]\r\n# for i in sentence:\r\n# if len(i) > len(max):\r\n# max = i\r\n# return max\r\n# # Testing Ouput\r\n# print(longest_word_in(\"In Programming We Love Elzero Academy Tooooooooooo Much\")) # Tooooooooooo\r\n\r\n\r\n# def remove_duplicate_words_from(sentence):\r\n# s = sentence.split()\r\n# for i in range(len(s)-1, 1, -1):\r\n# if s[i-1] == s[i]:\r\n# s.pop(i)\r\n# return \" \".join(s)\r\n\r\n# # Testing Ouput\r\n# print(remove_duplicate_words_from(\"Hello Elzero Web Web Hello School\"))\r\n# # Hello Elzero Web School\r\n\r\n\r\n# def find_position_for(letter):\r\n# return ord(letter.lower()) - 96\r\n\r\n# # Testing Ouput\r\n# print(find_position_for(\"C\")) # 3\r\n# print(find_position_for(\"P\")) # 16\r\n# def find_missing_letter_in(letters):\r\n# i = ord(letters[0])\r\n# for letter in letters:\r\n# if chr(i) != letter :\r\n# return chr(i)\r\n# i+=1\r\n# else :\r\n# return \"No Missing Letter In Sequence\"\r\n\r\n# # Testing Ouput\r\n# print(find_missing_letter_in(\"abcdeghi\")) # f\r\n# print(find_missing_letter_in(\"defgi\")) # h\r\n# print(find_missing_letter_in(\"xyz\")) # No Missing Letter In Sequence\r\n\r\n# list1= []\r\n# for l in \"abcdeghi\":\r\n# list1.append(str(ord(l)))\r\n\r\n# print(list1)\r\n\r\n\r\n# def wordBeforeLastLength(sentence):\r\n# # Your Code\r\n# sentence = sentence.split()\r\n# if len(sentence[-1]) == 1:\r\n# sentence.pop(-1)\r\n# if len(sentence) == 1:\r\n# return False\r\n# elif len(sentence) == 2:\r\n# return sentence[0]\r\n# if len(sentence[-1]) == 1:\r\n# sentence.pop(-1)\r\n# return len(sentence[-2])\r\n\r\n\r\n# print(wordBeforeLastLength(\"Elzero Web School\")) # Web => 3\r\n# print(wordBeforeLastLength(\"Hello Elzero Web School A \")) # Web => 3\r\n# print(wordBeforeLastLength(\"Hello Elzero Web School \")) # Web => 3\r\n# print(wordBeforeLastLength(\"Hello\")) # False\r\n# print(wordBeforeLastLength(\"Hello Elzero\")) # Hello\r\n# print(wordBeforeLastLength(\"Hello Elzero A\")) # Hello\r\n\r\n\r\n# import requests as r\r\n# s = r.get(\"https://encrypted-tbn0.gstatic.com/images?q=tbn:ANd9GcR8UaO8zvh5DjMIZ3C-jUQyIdtnCH9VUBvPRCZIbf60YQ&s\")\r\n# with open(\"img.jpg\", \"wb\") as f :\r\n# f.write(s.content)\r\n", "s1 = input()\r\ns2 = input()\r\n\r\nif len(s1)!=len(s2):\r\n print(\"NO\")\r\n exit()\r\n\r\nres = []\r\n\r\nfor i in range(len(s1)):\r\n if s1[i]!=s2[i]:\r\n res.append(i)\r\n \r\n\r\n if len(res)>2:\r\n print(\"NO\")\r\n exit()\r\n\r\nif len(res)==0:\r\n print(\"YES\")\r\n exit()\r\nif len(res)!=2 or s1[res[0]]!=s2[res[1]] or s1[res[1]]!=s2[res[0]]:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "import collections\r\ns1=input()\r\ns2=input()\r\nc=0\r\nif(len(s1)!=len(s2)):\r\n print(\"NO\")\r\nelse:\r\n for i in range(len(s1)):\r\n if(s1[i]!=s2[i]):\r\n c+=1\r\n if(c==2):\r\n d1=collections.Counter(s1)\r\n d2=collections.Counter(s2)\r\n for i in d1:\r\n if(d1[i]!=d2[i]):\r\n c=1\r\n break\r\n if(c==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")", "s1 = input()\r\nn1 = len(s1)\r\ns2 = input()\r\nn2 = len(s2)\r\ncnt = 0\r\nans = \"NO\"\r\nif n1 == n2:\r\n for i in range(n1):\r\n if s1[i] != s2[i]:\r\n cnt += 1\r\n if (cnt == 2 and sorted(s1) == sorted(s2)) or cnt == 0:\r\n ans = \"YES\"\r\nprint(ans)", "s1 = input()\r\ns2 = input()\r\nc = 0\r\nn1 = len(s1)\r\nn2 = len(s2)\r\nu1 = u2 = -1\r\nif(n1!=n2):\r\n print('NO')\r\nelse:\r\n for i in range(n1):\r\n if(s1[i]!=s2[i]):\r\n c+=1\r\n if(u1 == -1):\r\n u1 = i\r\n else:\r\n u2 = i\r\n if(c!=2):\r\n print('NO')\r\n else:\r\n if(s1[u1]==s2[u2] and s1[u2]==s2[u1]):\r\n print('YES')\r\n else:\r\n print('NO')", "s1 = list(input())\r\ns2 = list(input())\r\nct = 0\r\n# non matching elements 1 and 2\r\n\r\nst1 = list(s1)\r\nst2 = list(s2)\r\nans = \"NO\"\r\nst1.sort()\r\nst2.sort()\r\nif st1 == st2:\r\n for i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n ct += 1\r\n\r\n if ct == 2:\r\n ans = \"YES\"\r\n\r\nprint(ans)\r\n", "from sys import stdin;input = lambda: stdin.readline().rstrip('\\r\\n')\r\ns = input()\r\ns2 = input()\r\nc = 0\r\nif sorted(s2) != sorted(s) or len(s) != len(s2):\r\n print('NO')\r\nelse:\r\n for i in range(len(s)):\r\n if s[i] != s2[i]:\r\n c += 1\r\n if c > 2:\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\n \r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\n'''\r\nppp\r\nn0p\r\n000\r\n\r\ncriteria=at least one 0, at least one negative\r\nif no positives, there must be at least two negatives\r\n'''\r\nsys.setrecursionlimit(1500)\r\n\r\ndef f(n, a):\r\n if n == 1:\r\n return\r\n else:\r\n a[n-2], a[n-1] = a[n-1], a[n-2]\r\n f(n-1, a)\r\n\r\ndef solve():\r\n a = [c for c in I().strip()]\r\n b = [c for c in I().strip()]\r\n if len(a) != len(b):\r\n print('NO')\r\n else:\r\n swap = []\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n swap.append(i)\r\n \r\n if len(swap) != 2:\r\n print('NO')\r\n else:\r\n a[swap[0]], a[swap[1]] = a[swap[1]], a[swap[0]]\r\n print('YES' if a == b else 'NO')\r\n\r\n\r\nsolve()", "str1 = input()\nstr2 = input()\nkeys = \"abcdefghijklmnopqrstuvwxyz\"\nvalues = range(1, 27)\nif(len(str1) != len(str2)):\n\tprint(\"NO\")\n\texit()\nstr1_dict = {}\nif(str1 == str2):\n\tfor char in str1:\n\t\tstr1_dict[char] = str1_dict.get(char, 0) + 1\n\tfor k, v in str1_dict.items():\n\t\tif(v > 1):\n\t\t\tprint(\"YES\")\n\t\t\texit()\n\tprint(\"NO\")\n\texit()\n\nletter2number = {i:j for (i, j) in zip(keys, values)}\nstr1 = [letter2number[x] for x in str1]\nstr2 = [letter2number[x] for x in str2]\ndiff = [str1[i] - str2[i] for i in range(len(str1))]\ndiff2 = [x for x in diff if x != 0]\n#print(diff2)\nif(len(diff2) == 2 and -diff2[0] == diff2[1]):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n\"\"\"\nif(len(str1) == 2):\n\tif(str1[1] == str2[0] and str1[0] == str2[1]):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\nelif(sum(diff) != 0 or len(diffsorted) > 3 or diffsorted[1] != 0 or -diffsorted[0] != diffsorted[2]):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\"\"\"\n\n", "s1 = input()\r\ns2 = input()\r\nrs1, rs2 = list(), list()\r\nif len(s1) == len(s2):\r\n cnt = 0\r\n for i in range(len(s1)):\r\n if s1[i] != s2[i]:\r\n rs1.append(s1[i])\r\n rs2.append(s2[i])\r\n if len(rs1) == 2:\r\n rs1 = sorted(rs1)\r\n rs2 = sorted(rs2)\r\n if rs1 == rs2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "from collections import Counter, defaultdict\r\n\r\n# list(map(list(int, input().split())))\r\n\r\n\r\ndef solve():\r\n a = input()\r\n b = input()\r\n if len(a) != len(b):\r\n return \"NO\"\r\n x, y = None, None\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n if x is None:\r\n x = i\r\n elif y is None:\r\n y = i\r\n else:\r\n return \"NO\"\r\n if x is None or y is None:\r\n return \"NO\"\r\n if a[x] == b[y] and a[y] == b[x]:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nfor _ in range(1):\r\n print(solve())\r\n", "a = input()\r\nb = input()\r\nans = 'NO'\r\n\r\nif len(a)==len(b):\r\n a = list(a)\r\n b = list(b)\r\n lt=[]\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n lt.append(i)\r\n if len(lt)==2:\r\n a[lt[0]], a[lt[1]] = a[lt[1]], a[lt[0]]\r\n if a==b:\r\n ans = 'YES'\r\n \r\nprint(ans)\r\n", "a=input()\r\nb=input()\r\nc=0\r\nr=[]\r\nfor x,y in zip(a,b):\r\n if x!=y:\r\n c+=1\r\n r+=[(x,y)]\r\nprint('YNEOS'[len(a)!=len(b) or c!=2 or r[0]!=r[1][::-1]::2])", "s = input()\ns1 = input()\nans = \"NO\"\nif len(s)!=len(s1) or set(s) != set(s1):\n print(ans)\n exit()\ns2 = 0\nfor i in range(len(s)):\n if s[i] != s1[i]:\n s2 += 1\n if s2 == 3:\n print(\"NO\")\n break\nelse:\n print(\"YES\")\n", "# https://codeforces.com/problemset/problem/186/A\r\n\r\n\"\"\"\r\ngenomes encoded as lowercase latin letters\r\ntwo genomes are the same if you can swap two characters to get to the other\r\n\r\nIf different lengths then obviously not the same\r\nThen check for how many differences if it has\r\n\r\nIf difference is 2 then check that the swap works\r\nIf difference is 0 then it's a bit weird but we have to check that\r\nat least one character is repeated otherwise if we had ab and ab there\r\nare no two things we can swap to get to the other\r\n\"\"\"\r\n\r\nfrom collections import Counter\r\n\r\ndef main():\r\n first = input().strip()\r\n second = input().strip()\r\n\r\n if len(first) != len(second):\r\n return False\r\n\r\n first_dif = []\r\n second_dif = []\r\n dif_count = 0\r\n\r\n for i in range(len(first)):\r\n if first[i] != second[i]:\r\n dif_count += 1\r\n first_dif.append(first[i])\r\n second_dif.append(second[i])\r\n\r\n if dif_count == 2:\r\n return first_dif[1] == second_dif[0] and first_dif[0] == second_dif[1]\r\n\r\n if dif_count == 0: # This means that the strings are the same\r\n for count in Counter([letter for letter in first]).values():\r\n if count >= 2:\r\n return True\r\n\r\n return False\r\n\r\n\r\nif __name__ == '__main__':\r\n if main():\r\n print('YES')\r\n else:\r\n print('NO')", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate, zip_longest, \\\r\n combinations_with_replacement\r\nfrom math import gcd, floor, inf, log2, sqrt, log10, factorial\r\nfrom bisect import bisect_right, bisect_left, insort_left\r\nfrom statistics import mode\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom heapq import heapify, heappop, heappush, heappushpop, heapreplace, nlargest, nsmallest, \\\r\n merge\r\nfrom copy import deepcopy\r\nfrom random import shuffle\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nif Counter(s1) == Counter(s2) and sum(1 for i, j in zip(s1, s2) if i != j) == 2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n\r\n\r\n", "def dell():\r\n one = input()\r\n two = input()\r\n\r\n if len(one) != len(two):\r\n print(\"NO\")\r\n return\r\n\r\n different = []\r\n for k in range(len(one)):\r\n if one[k] != two[k]:\r\n different.append([one[k],two[k]])\r\n\r\n if len(different) != 2:\r\n print(\"NO\")\r\n return\r\n\r\n #diffent = [[a,b],[b,a]]\r\n\r\n if (different[0][0] == different[1][1]) and (different[0][1] == different[1][0]):\r\n print(\"YES\")\r\n return\r\n print(\"NO\") \r\n\r\n\r\ndell()\r\n", "s=input()\r\na=input()\r\nif sorted(s)!=sorted(a):\r\n print(\"NO\")\r\nelse:\r\n c=0\r\n flag=1\r\n for i in range(len(s)):\r\n if s[i]!=a[i]:\r\n c+=1\r\n if c==3:\r\n flag=0\r\n break\r\n if flag==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n ", "s1=input()\r\ns2=input()\r\nd1={}\r\nd2={}\r\ncount=0\r\nif(len(s1)!=len(s2)):\r\n print('NO')\r\nelse:\r\n for i in range(len(s1)):\r\n if(s1[i]!=s2[i]):\r\n count+=1\r\n if(count==1):\r\n start=i\r\n if(count==2):\r\n end=i\r\n if(count==2 and s1[start]==s2[end] and s1[end]==s2[start]):\r\n print('YES')\r\n else:\r\n print('NO')", "ch=list(input())\r\nz=list(input())\r\nif len(ch)!=len(z):\r\n print(\"NO\")\r\nelse:\r\n m=k=-1\r\n for x in range(len(ch)):\r\n if ch[x]!=z[x]:\r\n m=x \r\n break\r\n for y in range(x+1,len(ch)):\r\n if ch[y]!=z[y]:\r\n k=y\r\n break\r\n if m!=-1 and k!=-1:\r\n ch[m],ch[k]=ch[k],ch[m]\r\n if ch==z:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "from collections import Counter\n\nf, s = (input() for _ in range(2))\nres = \"NO\"\nif len(f) == len(s):\n cnt, prv = Counter(), []\n for i in range(len(f)):\n cnt[f[i]] += 1\n if f[i] != s[i]:\n if not prv or (len(prv) == 1 and f[prv[0]] == s[i] and f[i] == s[prv[0]]):\n prv.append(i)\n res = \"YES\" if len(prv) == 2 else \"NO\"\n continue\n res = \"NO\"\n break\n if not prv and len(cnt) < len(f):\n res = \"YES\"\nprint(res)\n", "x=input()\r\ny=input()\r\n\r\nif sorted(x)!=sorted(y):\r\n print('NO')\r\nelse:\r\n s=0\r\n for i in range(len(x)):\r\n if x[i]!=y[i]:\r\n s+=1\r\n\r\n if(s==2):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "first=input()\r\nsec=input()\r\nif len(first)!=len(sec):\r\n print('NO')\r\nelse:\r\n char1=[]\r\n char2=[]\r\n i=0\r\n while(i<len(first)):\r\n if first[i]!=sec[i]:\r\n char1.append(first[i])\r\n char2.append(sec[i])\r\n i+=1\r\n if len(char1)!=2 or set(char1)!=set(char2):\r\n print('NO')\r\n else:\r\n print('YES')", "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\nt = list(input().rstrip())\r\nif len(s) ^ len(t):\r\n ans = \"NO\"\r\n print(ans)\r\n exit()\r\nx = []\r\nfor i in range(len(s)):\r\n if s[i] ^ t[i]:\r\n x.append(i)\r\nans = \"NO\"\r\nif len(x) == 2:\r\n u, v = x\r\n if s[u] == t[v] and s[v] == t[u]:\r\n ans = \"YES\"\r\nelif not len(x):\r\n ans = \"YES\"\r\nprint(ans)", "# Comparing Strings\n# ------------------------------------------------\ndef solve(d1, d2):\n n = len(d1)\n if len(d2) != n:\n return \"NO\"\n if len(d1) == 1:\n return \"NO\"\n \n if d1 == d2:\n if len(set(d1)) < len(d1):\n return \"YES\"\n else:\n return \"NO\"\n \n first = None \n for i in range(len(d1)):\n \n if d1[i] != d2[i]:\n \n if first is None:\n first = i \n else:\n newString = list(d1)\n newString[i], newString[first] = newString[first], newString[i]\n if \"\".join(newString) == d2:\n return \"YES\"\n else:\n return \"NO\"\n return \"NO\"\ndef main():\n d1 = input()\n d2 = input()\n print(solve(d1, d2))\nif __name__ == \"__main__\":\n main()\n \t\t\t\t \t \t \t \t\t \t \t \t\t", "a = input()\r\nb = input()\r\nif len(a) != len(b):\r\n print(\"NO\")\r\nelse:\r\n d = []\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n d.append(i)\r\n if len(d) == 2 and a[d[0]] == b[d[1]] and a[d[1]] == b[d[0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "a = list(input())\r\nb = list(input())\r\n\r\nanswer = \"YES\"\r\nif len(a) != len(b):\r\n answer = \"NO\"\r\nelse:\r\n indexes = []\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n indexes.append(i)\r\n if len(indexes) != 2:\r\n answer = \"NO\"\r\n else:\r\n temp = a[indexes[0]]\r\n a[indexes[0]] = a[indexes[1]]\r\n a[indexes[1]] = temp\r\n if a != b:\r\n answer = \"NO\"\r\nprint(answer) ", "s1=str(input())\r\ns2=str(input())\r\nif len(s1)!=len(s2):\r\n print('NO')\r\nelse:\r\n key=[]\r\n \r\n count=0\r\n for i in range(len(s1)):\r\n if s1[i]!=s2[i] and count==0:\r\n key.append([s1[i],s2[i]])\r\n count+=1 \r\n elif s1[i]!=s2[i] and count>0:\r\n count+=1 \r\n key.append([s2[i],s1[i]]) \r\n if count!=2 :\r\n print('NO')\r\n elif len(key)!=2:\r\n print('NO') \r\n elif key[1]!=key[0]:\r\n print('NO') \r\n else:\r\n print('YES')", "g1=input()\r\ng2=input()\r\nif len(g2)!=len(g1): print(\"NO\"); exit()\r\ndif=0; j=k=-1\r\nfor i in range(len(g1)):\r\n if g1[i]!=g2[i]:\r\n dif+=1\r\n if j>-1: k=i\r\n else: j=i\r\n if dif>2: break\r\nif dif!=2: print(\"NO\")\r\nelif g1[k]==g2[j] and g1[j]==g2[k]: print(\"YES\")\r\nelse: print(\"NO\")", "a = input()\r\nb = input()\r\nx = sorted(a)\r\ny = sorted(b)\r\ncnt = 0\r\nif x != y:\r\n\tprint(\"NO\")\r\n\t#exit()\r\nelse:\r\n\tn = min(len(a), len(b))\r\n\tfor i in range(n):\r\n\t\tif a[i] != b[i]:\r\n\t\t\tcnt += 1\r\n\t\tif cnt > 2:\r\n\t\t\tprint(\"NO\")\r\n\t\t\tbreak\r\n\telse:\r\n\t\tif cnt == 2:\r\n\t\t\tprint(\"YES\")\r\n\t\telse:\r\n\t\t\tprint(\"NO\")\r\n", "a = input()\r\nb = input()\r\nlena = len(a)\r\nlenb = len(b)\r\nif(lena != lenb):\r\n print('NO')\r\nelse:\r\n k = 0\r\n p = 0\r\n x = 0\r\n y = 0\r\n for i in range(lena):\r\n if(a[i] != b[i]):\r\n k += 1\r\n if(k==1):\r\n x = a[i]\r\n y = b[i]\r\n elif(k==2):\r\n if(a[i]==y and b[i]==x):\r\n p = 1\r\n\r\n else:\r\n break\r\n if(p==1 and k==2):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\n", "s = input()\r\nst = input()\r\nd_1 = []\r\nd_2 = []\r\nl1 = len(s)\r\nl2 = len(st)\r\n\r\nif l1 != l2:\r\n print(\"NO\")\r\n exit()\r\n \r\nfor i in range(l1):\r\n if s[i] != st[i]:\r\n if len(d_1) + 1 > 2:\r\n print(\"NO\")\r\n exit()\r\n d_1.append(s[i])\r\n d_2.append(st[i])\r\n \r\nd_1.sort()\r\nd_2.sort()\r\n\r\nif len(d_1) == 2 and d_1 == d_2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "f_G = input()\ns_G = input()\n\nif len(f_G) != len(s_G):\n print(\"NO\")\n\nelse:\n dif = 0\n f,s = [],[]\n for i in range(len(f_G)):\n if f_G[i] != s_G[i]:\n f.append(f_G[i])\n s.append(s_G[i])\n dif += 1\n if dif > 2:\n print(\"NO\")\n elif dif == 2 and f[0] == s[1] and f[1] == s[0]:\n print(\"YES\")\n else:\n print(\"NO\")\n \t \t \t\t \t \t\t\t\t\t \t", "s1 = input()\r\ns2 = input()\r\nif(len(s1)!=len(s2)):\r\n print(\"NO\")\r\nelse:\r\n if(len(s1)==1):\r\n print(\"NO\")\r\n else:\r\n c=0\r\n pos1=0\r\n pos2=0\r\n flag=0\r\n for i in range(0,len(s1)):\r\n if(s1[i]!=s2[i]):\r\n c+=1\r\n if(c==1):\r\n pos1=i\r\n elif(c==2):\r\n pos2=i\r\n if(c>2):\r\n flag=1\r\n break\r\n if(flag==1):\r\n print(\"NO\")\r\n else:\r\n if(c==2):\r\n if(s1[pos1]==s2[pos2] and s1[pos2]==s2[pos1]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n else:\r\n if(c==1):\r\n print(\"NO\")\r\n else:\r\n dict1={}\r\n for i in range(0,len(s1)):\r\n if(s1[i] in dict1):\r\n dict1[s1[i]]+=1\r\n else:\r\n dict1[s1[i]]=1\r\n flag=0\r\n for key in dict1:\r\n if(dict1[key]>=2):\r\n flag=1\r\n break\r\n if(flag==1):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n \r\n ", "from sys import stdin,stdout\r\nii1 = lambda: int(stdin.readline())\r\nis1 = lambda: stdin.readline()\r\niia = lambda : map(int, stdin.readline().split())\r\nisa = lambda: stdin.readline().split()\r\n\r\na = is1()\r\nb = is1()\r\ntemp = []\r\nfor i, j in zip(a, b):\r\n if i != j:\r\n temp.append([i, j])\r\nif len(temp) == 2 and temp[0][0] == temp[1][1] and temp[0][1] == temp[1][0]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "g1 = [*map(str, input())]\r\ng2 = [*map(str, input())]\r\n\r\ncount = 0\r\nt_index = []\r\nif sorted(g1) == sorted(g2):\r\n for i, x in enumerate(g1):\r\n if x != g2[i]:\r\n count += 1\r\n t_index.append(i)\r\n\r\n if count == 2 and len(set([g1[t_index[0]], g2[t_index[0]], g1[t_index[1]], g1[t_index[1]]])) == 2:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n", "genome1 = input()\r\ngenome2 = input()\r\n\r\nif len(genome1) != len(genome2):\r\n print(\"NO\")\r\nelif genome1 == genome2:\r\n print(\"YES\")\r\nelse:\r\n diff_indices = []\r\n diff_chars = []\r\n for i in range(len(genome1)):\r\n if genome1[i] != genome2[i]:\r\n diff_indices.append(i)\r\n diff_chars.append(genome1[i])\r\n\r\n if len(diff_indices) == 2 and diff_chars[0] == genome2[diff_indices[1]] and diff_chars[1] == genome2[diff_indices[0]]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s = input()\r\nt = input()\r\nif len(s)!=len(t):\r\n print('NO')\r\nelse:\r\n mistakes = []\r\n for i in range(len(s)):\r\n if s[i]!=t[i]:\r\n mistakes.append(i)\r\n if len(mistakes)==2:\r\n if s[mistakes[0]]==t[mistakes[1]] and s[mistakes[1]]==t[mistakes[0]]:\r\n print('YES')\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n", "def solve():\r\n a = input()\r\n b = input()\r\n if len(a) != len(b):\r\n print(\"NO\")\r\n return\r\n difs = 0\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n difs += 1\r\n\r\n if ''.join(sorted(a)) == ''.join(sorted(b)) and difs == 2:\r\n print (\"YES\")\r\n else:\r\n print(\"NO\")\r\nsolve()", "s1 = input()\ns2 = input()\ncnt = 0\nn = min(len(s1), len(s2))\nfor i in range(n):\n if s1[i] != s2[i]:\n cnt += 1\n\n\nif cnt == 2 and set(s1) == set(s2):\n print('YES')\nelse:\n print('NO')", "fgenome= input()\r\nsgenome=input()\r\ndef answer(fgenome,sgenome):\r\n if len(fgenome)!=len(sgenome):\r\n print(\"NO\")\r\n return \r\n ptr1=0\r\n counter=0\r\n while ptr1< len(fgenome):\r\n if fgenome[ptr1]!= sgenome[ptr1]:\r\n if counter==0:\r\n fval= fgenome[ptr1]\r\n sval=sgenome[ptr1]\r\n counter+=1\r\n elif counter==1:\r\n if fval==sgenome[ptr1] and sval==fgenome[ptr1]:\r\n counter+=1\r\n else:\r\n print(\"NO\")\r\n return\r\n else:\r\n print(\"NO\")\r\n return\r\n ptr1+=1\r\n if counter==2:\r\n print(\"YES\")\r\n return\r\n else:\r\n print(\"NO\")\r\n return \r\nanswer(fgenome,sgenome)\r\n \r\n \r\n \r\n \r\n ", "string1=input()\r\nstring2=input()\r\nif sorted(string1)!=sorted(string2):\r\n print(\"NO\")\r\nelse:\r\n wrong=0\r\n for i in range(len(string1)):\r\n if string1[i]!=string2[i]:\r\n wrong+=1\r\n if wrong==0 or wrong==2:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def dif(a, b):\r\n k = 0\r\n i = 0\r\n while i < len(a):\r\n if a[i] != b[i]:\r\n k+=1\r\n i += 1\r\n return k\r\nx, y = input(), input()\r\nprint('YES' if len(x) == len(y) and dif(x, y) <= 2 and sorted(x) == sorted(y) else 'NO')\r\n", "s1=input()\r\ns2=input()\r\n\r\nif sorted(s1)==sorted(s2):\r\n diff=0\r\n flag=0\r\n for i in range(len(s1)):\r\n if s1[i]!=s2[i]:\r\n diff+=1\r\n \r\n if diff>2:\r\n print('NO')\r\n flag=1\r\n break\r\n \r\n if flag==0:\r\n if diff==2:\r\n print('YES')\r\n \r\n else:\r\n print('NO')\r\n \r\nelse:\r\n print('NO')", "def main():\n #elems = list(sorted(map(int, input().split(' '))))\n s1 = input()\n s2 = input()\n\n if len(s1) != len(s2):\n print('NO')\n return\n\n cnt1, cnt2 = {}, {}\n\n for i in range(len(s1)):\n if s1[i] not in cnt1:\n cnt1[s1[i]] = 0\n if s2[i] not in cnt2:\n cnt2[s2[i]] = 0\n\n cnt1[s1[i]] += 1\n cnt2[s2[i]] += 1\n\n\n for key, val in cnt1.items():\n val2 = cnt2.get(key, 0)\n if val != val2:\n print('NO')\n return\n\n d = 0\n for i in range(len(s1)):\n if s1[i] != s2[i]:\n d += 1\n\n if d > 2:\n print('NO')\n return\n print('YES')\n\n\nif __name__ == \"__main__\":\n main()\n", "s1=input()\r\ns2=input()\r\ndiff=0\r\nif len(s1)!=len(s2):\r\n print(\"NO\")\r\nelse:\r\n a=[]\r\n for i in range(len(s1)):\r\n if s1[i]!=s2[i]:\r\n a.append(i)\r\n if len(a)==2 and s1[a[1]]==s2[a[0]] and s1[a[0]]==s2[a[1]]:\r\n \r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "def solve():\n p = input()\n q = input()\n if len(p) != len(q):\n print('NO')\n return\n mm = 0\n ans = []\n for i in range(len(p)):\n if p[i] != q[i]:\n mm += 1\n ans += [p[i], q[i]]\n if (mm == 2 and len(set(ans)) == 2) or mm == 0:\n print('YES')\n else:\n print('NO')\n \n\n \n\nt = 1\n\nwhile t:\n solve()\n t -= 1\n \t \t\t\t\t \t \t\t\t\t \t\t \t\t\t\t\t", "from collections import Counter\r\nx=input()\r\ny=input()\r\nd1=Counter(x)\r\nd2=Counter(y)\r\nif d1!=d2:\r\n print(\"NO\")\r\nelse:\r\n of=False\r\n tf=False\r\n i=0\r\n while i<len(x):\r\n if x[i]!=y[i]:\r\n if of==False:\r\n of = True\r\n elif of == True and tf == False:\r\n tf=True\r\n elif of==True and tf==True:\r\n print(\"NO\")\r\n break\r\n i=i+1\r\n else:\r\n print(\"YES\")\r\n \r\n", "a=input()\r\nb=input()\r\nx=\"\"\r\nt=len(a)\r\nbt=len(b)\r\nc=0\r\nflag=0\r\nl=[]\r\nif t!=bt:\r\n flag=0\r\nelse:\r\n for i in range(t):\r\n if a[i]!=b[i]:\r\n l.append(i)\r\nlt=len(l)\r\nif lt>2:\r\n flag=0\r\nelif lt==0:\r\n flag=0\r\nelif lt==1:\r\n flag=0\r\nelif lt==2:\r\n x=l[0]\r\n y=l[1]\r\n if a[x]==b[y] and b[x]==a[y]:\r\n flag=1\r\n else:\r\n flag=0\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=input()\r\nb=input()\r\nif len(a) != len(b):\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n c=0\r\n k=[]\r\n for i in range(len(a)):\r\n if a[i]!=b[i]:\r\n c+=1\r\n k.append(a[i])\r\n k.append(b[i])\r\n if c>2:\r\n print(\"NO\")\r\n exit()\r\n if c==2 and k.count(k[0])==2 and k.count(k[1])==2 :\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "s1=input()\r\ns2=input()\r\nif len(s1)!=len(s2):\r\n print('NO')\r\nelse:\r\n res,pos=0,[]\r\n for i in range(len(s1)):\r\n if s1[i]!=s2[i]:\r\n res+=1\r\n pos.append(i)\r\n if res!=2:\r\n print('NO')\r\n else:\r\n if s1[pos[0]]==s2[pos[1]] and s1[pos[1]]==s2[pos[0]]:\r\n print('YES')\r\n else:\r\n print('NO')", "a1=input()\r\nb1=input()\r\na,b,c=0,0,0\r\nif(len(a1)!=len(b1)):print(\"NO\")\r\nelse:\r\n for i in range(len(a1)):\r\n if(a1[i]!=b1[i]): a,b,c=b,i,c+1\r\n if(c==2 and a1[a]==b1[b] and a1[b]==b1[a]):print(\"YES\")\r\n else:print(\"NO\")", "s1=input()\r\ns2=input()\r\ns1=list(s1)\r\ns2=list(s2)\r\nif len(s1)!=len(s2):\r\n print('NO')\r\nelse:\r\n c=0\r\n l=[]\r\n l2=[]\r\n f=0\r\n for i in range(len(s1)):\r\n if s1[i]!=s2[i]:\r\n c+=1\r\n l.append(s1[i])\r\n l2.append(s2[i])\r\n if c>2:\r\n f=1\r\n print('NO')\r\n break\r\n if f==0:\r\n l.sort()\r\n l2.sort()\r\n if l==l2:\r\n print('YES')\r\n else:\r\n print('NO')\r\n \r\n ", "gen1=input()\r\ngen2=input()\r\nif(sorted(gen1)!=sorted(gen2)):\r\n print(\"NO \")\r\nelse:\r\n s=0\r\n for i in range(0,len(gen1)):\r\n if(gen1[i]!=gen2[i]):\r\n s=s+1\r\n if(s==2):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")" ]

[ "import sys\r\n\r\n\r\nammount_prices, days_for_trading=map(int, input().split())\r\nstonks=[]\r\nfor i in range (0, ammount_prices):\r\n price=int(sys.stdin.readline())\r\n stonks.append(price)\r\n\r\ndef get_max(days_for_trading, stonks):\r\n size_prices = len(stonks)\r\n if size_prices == 0 or size_prices == 1 or days_for_trading == 0:\r\n return 0\r\n if days_for_trading >= size_prices/2:\r\n profit = 0\r\n for i in range(size_prices-1):\r\n diff = stonks[i + 1] - stonks[i]\r\n if diff > 0:\r\n profit += diff\r\n return profit\r\n \r\n hold = days_for_trading * [float('-inf')]\r\n hold_prev = days_for_trading * [float('-inf')]\r\n release = days_for_trading * [float('-inf')]\r\n release_prev = days_for_trading * [float('-inf')]\r\n\r\n for price in stonks:\r\n for j in range(0, days_for_trading):\r\n if j == 0:\r\n hold[j] = max(-price, hold_prev[j])\r\n else:\r\n hold[j] = max(release_prev[j - 1] - price, hold_prev[j])\r\n release[j] = max(hold_prev[j] + price, release_prev[j])\r\n hold_prev = hold\r\n release_prev = release\r\n return release[-1]\r\n \r\n\r\n\r\nprint(get_max(days_for_trading, stonks))" ]

[ "I = lambda: [float(x) for x in input().split()]\r\nn, m = [int(i) for i in input().split()]\r\nV = [I() for _ in range(n)]\r\ncmp = lambda x: (x >= 0) - (x <= 0)\r\n\r\nfor _ in range(m):\r\n x0, y0, x1, y1 = I()\r\n p0, p1 = x1 - x0, y1 - y0\r\n V3 = [((x - x0)*p0 + (y - y0)*p1, (y - y0)*p0 - (x - x0)*p1) for x, y in V]\r\n res = []\r\n\r\n for (v1x, v1y), (v2x, v2y) in zip(V3, V3[1:] + V3[:1]):\r\n if cmp(v1y) != cmp(v2y):\r\n res.append(((v2x * v1y - v1x * v2y)/(v1y - v2y), cmp(v2y) - cmp(v1y)))\r\n\r\n res.sort()\r\n\r\n t, w = 0, 0.\r\n for i, (tmp, s) in enumerate(res, -1):\r\n if t:\r\n w += tmp - res[i][0]\r\n t += s\r\n print(w/(p0*p0 + p1*p1)**0.5)\r\n" ]

[ "\r\ninput()\r\np=0\r\nfor x in map(int, input().split()):\r\n p=1<<20 if x<p else p^x&1\r\nprint('NO' if p>0 else 'YES')", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split())) + [0]\r\nc = 0\r\nans = \"YES\"\r\nfor i in a:\r\n if not i and c % 2:\r\n ans = \"NO\"\r\n break\r\n c += i\r\nprint(ans)", "import math\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n is_answer_given = False\r\n a = [int(i) for i in input().split(\" \")]\r\n for i in range(len(a)):\r\n if i != len(a) - 1:\r\n if a[i] % 2 != 0:\r\n if a[i + 1] == 0:\r\n is_answer_given = True\r\n print(\"NO\")\r\n break\r\n else:\r\n a[i + 1] -= 1\r\n else:\r\n if a[i] % 2 != 0:\r\n print(\"NO\")\r\n is_answer_given = True\r\n break\r\n if not is_answer_given:\r\n print(\"YES\")\r\n\r\n\r\n\r\nmain_function()\r\n", "def main():\r\n n = int(input())\r\n pizzas = [int(i) for i in input().split()]\r\n\r\n for i in range(n):\r\n # un-normal response\r\n if pizzas[i] < 0:\r\n print('NO')\r\n return\r\n\r\n if pizzas[i]%2 == 1:\r\n # pizzas[i] = 0\r\n # affect next day: make it prone for un-normal alarm from it\r\n # Eception here if last day pizza pizzas[n-1]%2==1: FAIL CASE\r\n if i == n-1:\r\n if pizzas[i]%2==1:\r\n print('NO')\r\n return\r\n else:\r\n pizzas[i+1] -= 1\r\n print('YES')\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\ncol = [int(i) for i in input().split()] + [0]\r\n\r\nans = 'YES'\r\n\r\nfor i in range(n):\r\n if col[i] % 2 != 0:\r\n if col[i+1] > 0:\r\n col[i+1] -= 1\r\n else:\r\n ans = 'NO'\r\n break\r\n\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n if l[i]<0:\r\n print('NO')\r\n exit()\r\n if l[i]%2==1:\r\n l[i+1]-=1\r\nif l[-1]%2==1:print('NO')\r\nelse:print('YES')\r\n", "I=input\r\nI()\r\na=0\r\nfor x in map(int,I().split()):\r\n\tx-=a;a=x%2\r\n\tif x<0:break\r\nprint('YNEOS'[a::2])", "i = int(input())\r\nl = list(map(int,input().split()))\r\nc = 0\r\nfor x in l:\r\n if c == 1:\r\n x -= 1\r\n if x < 0:\r\n print('NO'); exit()\r\n c = x%2\r\nprint('NO' if c == 1 else 'YES')", "n = int(input())\r\na = list((map(int, input().split())))\r\nfor i in range(n):\r\n if a[i] != 0:\r\n a[i] = a[i] % 2\r\n else:\r\n a[i] = -1\r\nt = \"YES\"\r\nfor i in range(n):\r\n if a[i] == 1:\r\n if i == n - 1 or a[i + 1] == -1:\r\n t = \"NO\"\r\n else:\r\n a[i + 1] = (a[i + 1] + 1) % 2 \r\nprint(t)\r\n", "n = int(input())\r\n\r\nl_p = list(map(int, input().split()))\r\n\r\nfor i in range(len(l_p)):\r\n if l_p[i] % 2 == 1:\r\n if i + 1 == len(l_p) or l_p[i + 1] == 0:\r\n print(\"NO\")\r\n quit()\r\n l_p[i + 1] -= 1\r\nprint(\"YES\")", "n = int(input())\na = list(map(int, input().split()))\nfor i in range(n - 1):\n if a[i] < 0:\n print(\"NO\")\n break\n a[i + 1] -= a[i] % 2\nelse:\n print(\"YES\" if a[-1] % 2 == 0 else \"NO\")\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nans = 'YES'\r\nfor i in range(n-1):\r\n if w[i] % 2:\r\n if w[i+1] == 0:\r\n ans = \"NO\"\r\n break\r\n else:\r\n w[i+1] += 1\r\nif w[-1] % 2:\r\n ans = \"NO\"\r\nprint(ans)", "n=int(input())\r\narr = map(int,input().split())\r\n\r\nlast = 0\r\nfor c in arr:\r\n if last==0:\r\n last = c%2\r\n elif last==1:\r\n if c==0:\r\n print(\"NO\")\r\n exit()\r\n else:\r\n last = (c-1)&1\r\nif last==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")" ]

[ "n=int(input())\r\ns=[[] for i in range(60)]\r\nfor b in list(map(int,input().split())):\r\n\tfor i in range(59,-1,-1):\r\n\t\tif b>>i&1:\r\n\t\t\ts[i].append(b)\r\n\t\t\tbreak\r\nans=[]\r\ncur=0\r\nfor i in range(n):\r\n\tfl=False\r\n\tfor j in range(60):\r\n\t\tif s[j]!=[] and cur>>j&1==0:\r\n\t\t\tans.append(s[j][-1])\r\n\t\t\tcur^=s[j][-1]\r\n\t\t\ts[j].pop()\r\n\t\t\tfl=True\r\n\t\t\tbreak\r\n\tif not fl:\r\n\t\tprint('No')\r\n\t\texit()\r\nprint('Yes')\r\nprint(' '.join(str(i) for i in ans))" ]

[ "n = int(input())\r\nif n%2: print(1)\r\nelse: print(2)", "n = int(input())\r\nprint(1 if n % 2 == 1 else 2)\n# Sun Aug 06 2023 11:19:08 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\nif n % 2 == 0:\n print(2)\nelse:\n print(1)\n# Mon Oct 02 2023 10:20:23 GMT+0300 (Moscow Standard Time)\n", "print(1 if int(input()) % 2 else 2)", "print((int(input())+1)%2+1)", "# LUOGU_RID: 130380027\nprint(2-(int(input())&1))", "n=int(input())\r\nif n%2==0:print(2)\r\nelse:print(1)", "print(1) if int(input())&1 else print(2)", "print(2-(int(input())%2))", "n = int(input())\r\nprint(1 if n % 2 == 1 else 2)", "print(2-int(input())%2)\r\n", "a=int(input())\r\nprint(2) if a%2==0 else print(1)", "n = int(input())\r\nans = n % 2\r\nif (ans == 0):\r\n ans = 2\r\nprint(ans)", "n = int(input())\r\nprint(2 - n % 2)" ]

[ "# LUOGU_RID: 96253599\nn = input()\r\na = [int(i) for i in n]\r\ntmp = 0\r\ncnt = 0\r\nans = 0\r\nfor i in a:\r\n t = i % 3\r\n tmp = (tmp + t) % 3\r\n cnt += 1\r\n if t == 0 or tmp == 0 or cnt == 3:\r\n ans += 1\r\n cnt = 0\r\n tmp = 0\r\n\r\nprint(ans)", "str = input()\r\npre = 0\r\nans = 0\r\nvisited = {0}\r\n\r\nfor i, c in enumerate(str):\r\n pre += int(c)\r\n pre %= 3\r\n\r\n if pre in visited:\r\n ans += 1\r\n pre = 0\r\n visited = {0}\r\n else:\r\n visited.add(pre)\r\n\r\nprint(ans)", "st = input()\r\ndef_x = []\r\nfor char in st:\r\n def_x.append(char)\r\n\r\nans = 0\r\nk1 = 0\r\nk2 = 0\r\ntemp = 0\r\nfor i in def_x:\r\n temp = int(i)\r\n check = True\r\n \r\n if temp %3 == 0:\r\n ans += 1\r\n k1 = 0\r\n k2 = 0\r\n continue\r\n elif (k1+1)%3 == 0 or (k2+temp)%3 == 0:\r\n ans+= 1\r\n k1=0\r\n k2=0\r\n check=False\r\n \r\n if(check):\r\n k1+=1\r\n k2+=temp\r\n \r\nprint(ans)\r\n\n# Fri Oct 01 2021 13:11:39 GMT+0300 (Москва, стандартное время)\n", "s=input()\r\nl=0\r\nr=0\r\nsum=0\r\nans=0\r\nwhile(l<len(s)):\r\n sum+=int(s[l])\r\n if(sum%3==0 or (int(s[l]))%3==0):\r\n sum=0\r\n ans+=1\r\n l+=1\r\n r=l\r\n elif(l-r>=1 and (sum-(int(s[r])))%3==0):\r\n sum=0\r\n ans+=1\r\n l+=1\r\n r=l\r\n elif(l-r>=2 and (sum-int(s[r])-int(s[r+1]))%3==0):\r\n sum=0\r\n ans+=1\r\n l+=1\r\n r=l\r\n else:\r\n l+=1\r\nprint(ans)\r\n", "s = input()\r\nans = 0\r\nacc = [0, 0, 0]\r\nstep = 0\r\n\r\nfor c in s:\r\n for i in range(3):\r\n if i <= step:\r\n acc[i] += int(c)\r\n if acc[i] % 3 == 0: ans += 1; step = -1; acc = [0, 0, 0]; break\r\n step += 1\r\n\r\nprint(ans)", "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\n3121\r\n'''\r\n\r\ns = myinput()\r\ncount = 0 \r\ntotal = 0 \r\nthree = 0 \r\n\r\nfor i in s: \r\n total += int(i) \r\n count += 1 \r\n if total % 3 == 0 or int(i) % 3 == 0 or count == 3: \r\n count = 0\r\n three += 1\r\n total = 0\r\nprint(three)", "from collections import defaultdict\r\n\r\ns = input()\r\nsu = 0\r\nrem = set()\r\nrem.add(0)\r\nans = 0\r\nfor i in s :\r\n i = int(i)\r\n if i % 3 == 0 or (su + i) % 3 in rem :\r\n ans += 1\r\n rem = set()\r\n rem.add(0)\r\n su = 0\r\n else :\r\n rem.add((su + i) % 3)\r\n su += i\r\nprint(ans)\r\n\r\n\r\n \r\n \r\n\r\n\r\n", "n=input()\nans=0\nr,c=0,0\nfor i in n:\n r+=int(i)\n c+=1\n if int(i)%3==0 or r%3==0 or c==3:\n ans+=1\n r,c=0,0\nprint(ans)\n \t\t \t \t \t \t \t\t \t\t\t \t \t\t", "s = input()\r\nsm, ans = 0, 0\r\ni, j = 0, 0\r\nwhile i < len(s) :\r\n sm += int(s[i])\r\n if sm%3 == 0 or int(s[i])%3 == 0 :\r\n sm = 0\r\n ans += 1\r\n i += 1\r\n j = i\r\n else :\r\n if i-j >= 1 and (sm - int(s[j]))%3 == 0 :\r\n sm = 0\r\n ans += 1\r\n i += 1\r\n j = i\r\n elif i-j >= 2 and (sm - int(s[j]) - int(s[j+1]))%3 == 0 :\r\n sm = 0\r\n ans += 1\r\n i += 1\r\n j = i\r\n else :\r\n i += 1\r\nprint(ans)", "from bisect import bisect\r\nimport os,sys;from io import BytesIO, IOBase\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno();self.buffer = BytesIO();self.writable = \"x\" in file.mode or \"r\" not in file.mode;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:break\r\n ptr = self.buffer.tell();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:b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE));self.newlines = b.count(b\"\\n\") + (not b);ptr = self.buffer.tell();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:os.write(self._fd, self.buffer.getvalue());self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file);self.flush = self.buffer.flush;self.writable = self.buffer.writable;self.write = lambda s: self.buffer.write(s.encode(\"ascii\"));self.read = lambda: self.buffer.read().decode(\"ascii\");self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ntry:sys.stdin,sys.stdout=open('in.txt','r'),open('out.txt','w')\r\nexcept:pass\r\nii1=lambda:int(sys.stdin.readline().strip()) # for interger\r\nis1=lambda:sys.stdin.readline().strip() # for str\r\niia=lambda:list(map(int,sys.stdin.readline().strip().split())) # for List[int]\r\nisa=lambda:sys.stdin.readline().strip().split() # for List[str]\r\nmod=int(1e9 + 7);\r\nfrom math import inf \r\nfrom collections import defaultdict as dd\r\n# from math import *\r\n# from collections import *;\r\n# from collections import deque as dq \r\n# from string import ascii_lowercase,ascii_uppercase\r\n# from functools import lru_cache\r\n# sys.setrecursionlimit(500000)\r\nfrom bisect import bisect_left as bl,bisect_right as br\r\nfrom heapq import heapify,heappop,heappush\r\n# def google(p):print('Case #'+str(p)+': ',end='')\r\n###################### Start Here ######################\r\ndef main(t):\r\n s = is1()\r\n prev = []\r\n ans = 0 \r\n for i in s:\r\n v = int(i)\r\n if v % 3 == 0:\r\n ans += 1 \r\n prev = []\r\n continue\r\n prev.append(v)\r\n val = 0 \r\n for j in prev[::-1]:\r\n val = val * 10 + j \r\n if val % 3 == 0:\r\n ans += 1 \r\n prev = []\r\n break \r\n # if len(prev)>5:\r\n # prev = []\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\nif __name__ == \"__main__\":\r\n t = 1 \r\n # t = ii1()\r\n for _ in range(t):\r\n main(_)\r\n \r\n# snippets \r\n# @f - for loop \r\n# @bfs - breadth first search \r\n# @Trie - Trie Data Structure \r\n# @rangeupdatepointquery - range update \r\n# @DS - Disjoint Set \r\n# @seive - generate seive ", "num = input()\r\nvisite = set([0])\r\n\r\ntot = 0\r\ncount = 0\r\nfor j, i in enumerate(num):\r\n tot += int(i)\r\n reminder = tot % 3\r\n \r\n if reminder in visite:\r\n visite = set([0])\r\n count += 1\r\n tot = 0\r\n else:\r\n visite.add(reminder)\r\n \r\nprint(count)\r\n \r\n \r\n\r\n", "data = input()\r\nlength = len(data)\r\ncuts = 0\r\ntest = 0\r\nfor index in range(length):\r\n num = int(data[index])\r\n test += num\r\n if not num % 3:\r\n cuts += 1\r\n test = 0\r\n elif not test % 3:\r\n cuts += 1\r\n test = 0\r\n elif not (test % 100) % 3:\r\n cuts += 1\r\n test = 0\r\n else:\r\n test *= 10\r\nprint (cuts)", "import sys\r\nimport threading\r\ninput = sys.stdin.readline().rstrip\r\n\r\nprefix = set([0])\r\nn = map( int , list(input()))\r\nprev = 0 \r\ncount = 0 \r\nfor num in n:\r\n cur = prev + num\r\n\r\n rem = cur % 3 \r\n\r\n if rem in prefix:\r\n count += 1\r\n prefix = set([0])\r\n prev = 0\r\n else:\r\n prev += num \r\n prefix.add(rem)\r\n \r\n\r\nprint(count)\r\n \r\n\r\n \r\n\r\n", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n s = input().strip()\r\n n = len(s)\r\n A = list(map(int, s))\r\n P = list(accumulate(A, initial=0))\r\n\r\n locs = defaultdict(list)\r\n for i, x in enumerate(P):\r\n locs[x % 3].append(i)\r\n\r\n def neighbors(i):\r\n yield 0, i + 1\r\n\r\n x = P[i] % 3\r\n nxt = bisect(locs[x], i)\r\n if 0 <= nxt < len(locs[x]):\r\n yield 1, locs[x][nxt]\r\n\r\n dp = [0] * (n + 1)\r\n for i in range(n - 1, -1, -1):\r\n for weight, nei in neighbors(i):\r\n dp[i] = max(dp[i], weight + dp[nei])\r\n\r\n print(dp[0])\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "S = input()\nN = len(S)\nINF = 10000000000000000\n# dp[index][今作ってる区間の和 % 3] = 今までで作れる最大の3の倍数の数\ndp = [[-INF for i in range(3)] for j in range(N + 1)]\ndp[0][0] = 0\nfor i in range(N):\n for j in range(3):\n if dp[i][j] == -INF:\n continue\n c = int(S[i])\n dp[i + 1][(j + c) % 3] = max(dp[i + 1][(j + c) % 3], dp[i][j])\n dif = 0\n if j == 0:\n dif = 1\n if i != 0:\n dp[i + 1][c % 3] = max(dp[i + 1][c % 3], dp[i][j] + dif)\nans = max([dp[N][0] + 1, dp[N][1], dp[N][2]])\nprint(ans)\n", "s = input()\r\na = [int(s[i]) for i in range(len(s))]\r\nfor i in range(len(a)):\r\n a[i] = a[i] % 3\r\ncount = 0\r\npred = set()\r\ni = 0\r\nwhile i <= len(a) - 1:\r\n if a[i] == 0:\r\n count += 1\r\n pred = set()\r\n elif a[i] == 1 and (2 in pred):\r\n count += 1\r\n pred = set()\r\n elif a[i] == 1:\r\n if 1 in pred:\r\n pred.add(2)\r\n else:\r\n pred.add(1)\r\n elif a[i] == 2 and (1 in pred):\r\n count += 1\r\n pred = set()\r\n else:\r\n if 2 in pred:\r\n pred.add(1)\r\n else:\r\n pred.add(2)\r\n i += 1\r\nprint(count)\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n ", "s = input()\r\nans = 0\r\ncurr = 0\r\nflag=False\r\nfor i in range(len(s)):\r\n if flag:\r\n ans+=1\r\n curr=0\r\n flag = False\r\n continue\r\n if(int(s[i])%3==0):\r\n ans+=1\r\n curr=0\r\n flag=False\r\n else:\r\n if curr!=0:\r\n if int(s[i])%3!=curr:\r\n ans+=1\r\n curr=0\r\n else:\r\n flag = True\r\n else:\r\n curr = int(s[i])%3\r\n # if (curr + int(s[i])%3) == 3:\r\n # ans+=1\r\n # curr=0\r\n # continue\r\n # curr = int(s[i])%3\r\nprint(ans)\r\n \r\n ", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nS = [int(c) for c in input()]\r\nN = len(S)\r\n\r\ndp = [0]*(N+1)\r\nlib = {}\r\nlib[0] = 0\r\ncur = 0\r\nfor i in range(N):\r\n cur = (cur+S[i])%3\r\n if cur in lib:\r\n dp[i+1] = max(dp[lib[cur]]+1, dp[i])\r\n else:\r\n dp[i+1] = dp[i]\r\n lib[cur] = i+1\r\n #print(lib,dp)\r\n \r\nprint(dp[-1])\r\n \r\n\r\n\r\n\r\n\r\n", "def ss(x):\r\n x = str(x) \r\n ans = 0 \r\n for i in x:\r\n ans+=int(i) \r\n return ans \r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = stack.append(f(*args, **kwargs))\r\n while True:\r\n try:\r\n to = stack.append(stack[-1].send(to))\r\n except StopIteration as e:\r\n stack.pop()\r\n to = e.value\r\n if not stack:\r\n break\r\n return to\r\n \r\n return wrappedfunc\r\n \r\n@bootstrap\r\n\r\n\r\ndef go(ind,curs):\r\n if (ind==n):\r\n if (curs%3==0):\r\n return 1\r\n return 0 \r\n if (curs>9):\r\n curs = ss(curs) \r\n if (dp[curs][ind]!=-1):\r\n return dp[curs][ind] \r\n \r\n \r\n c1 = 0 \r\n c2 = 0 \r\n if (curs%3==0):\r\n c1 = 1 + (yield go(ind+1,int(s[ind])))\r\n else:\r\n c1 = (yield go(ind+1,curs+int(s[ind]))) \r\n c2 = (yield go(ind+1,int(s[ind])))\r\n ans = max(c1,c2) \r\n dp[curs][ind]=ans \r\n return (ans) \r\n \r\n\r\n\r\n\r\n\r\ns = input() \r\nn = len(s) \r\ndp = [ ] \r\nfor i in range(10):\r\n y = [ ]\r\n for j in range(n):\r\n y.append(-1) \r\n dp.append(y) \r\n\r\n\r\nprint(go(1,int(s[0]))) ", "s = input()\r\nans = 0\r\npr = 0\r\nfor i in range(len(s)):\r\n if int(s[i]) % 3 == 0:\r\n ans += 1\r\n pr = 0\r\n else:\r\n if pr == 1:\r\n if (int(s[i]) + int(s[i - 1])) % 3 == 0:\r\n pr = 0\r\n ans += 1\r\n else:\r\n pr += 1\r\n elif pr == 2:\r\n ans += 1\r\n pr = 0\r\n else:\r\n pr += 1\r\nprint(ans)\r\n", "s = [int(i) for i in input()]\r\ndp = [0] * (len(s) + 1)\r\nfor i in range(len(s)):\r\n dp[i + 1] = dp[i]\r\n for j in range(3):\r\n if i - j < 0:\r\n break\r\n t = sum(s[i - j : i + 1])\r\n if t % 3 == 0:\r\n dp[i + 1] = max(dp[i + 1], dp[i - j] + 1)\r\nprint(dp[-1])\r\n", "from sys import stdin, stdout\r\n\r\ncounter = 0\r\ntemp = 0\r\nstep = 1\r\n\r\nfor num in map(int, stdin.readline().rstrip()):\r\n temp += num\r\n if not num % 3 or not temp % 3 or step == 3:\r\n counter += 1\r\n temp = 0\r\n step = 0\r\n step += 1\r\n\r\nstdout.write(f'{counter}\\n')", "\r\ns=input()\r\nn=len(s)\r\nd=[0]*(n+1)\r\npre=[0,-1,-1]\r\ncnt=0\r\nfor i in range(1,n+1):\r\n cnt+=int(s[i-1])\r\n d[i]=d[i-1]\r\n j=cnt%3\r\n if pre[j]!=-1:\r\n d[i]=max(d[i],d[pre[j]]+1)\r\n pre[j]=i\r\nprint(max(d))\r\n", "s = input()\r\nans = sums = 0\r\nm = [0,0,0]\r\n\r\nfor i in s:\r\n sums = (sums + (ord(i) - ord('0')))%3\r\n \r\n if sums == 0 or m[sums]!=0:\r\n ans += 1\r\n sums = 0\r\n m[0] = m[1] = m[2] = 0\r\n else:\r\n m[sums] = 1\r\n\r\nprint(ans)", "\r\n\r\ndef Convert(string):\r\n list1=[]\r\n list1[:0]=string\r\n return list1\r\n\r\n\r\n\r\nl = Convert(input())\r\n\r\nctr = 0\r\n\r\nrem2 = 0\r\nrem1 = 0\r\nfor i in range(len(l)):\r\n if (int(l[i])%3 == 0):\r\n ctr+=1\r\n l[i] = '*'\r\n rem1=0\r\n rem2=0\r\n elif (int(l[i])%3 == 1):\r\n rem1+=1\r\n else:\r\n rem2+=1\r\n \r\n\r\n\r\n if (rem1>=1 and rem2>=1):\r\n ctr+=1\r\n rem1=0\r\n rem2=0\r\n if (rem1==3 or rem2==3):\r\n rem1=0\r\n rem2=0\r\n ctr+=1\r\nprint(ctr)\r\n", "num = input()\r\nchecker = 0\r\ncount = 0\r\npigeon = 0\r\nfor i in num:\r\n checker += int(i)\r\n pigeon += 1\r\n if pigeon % 3 == 0 or int(i) % 3 == 0 or checker % 3 == 0:\r\n count += 1\r\n checker = 0\r\n pigeon = 0\r\n\r\nprint(count) ", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n s = input().strip()\r\n n = len(s)\r\n\r\n A = list(map(int, s))\r\n P = list(accumulate(A, initial=0))\r\n\r\n dp = [0] * (n + 1)\r\n for i in range(n):\r\n for nei in (i + 1, i + 2, i + 3):\r\n if nei - i > 1 and s[i] == \"0\":\r\n continue\r\n\r\n if 0 <= nei <= n:\r\n if (P[nei] - P[i]) % 3 == 0:\r\n dp[nei] = max(dp[nei], 1 + dp[i])\r\n else:\r\n dp[nei] = max(dp[nei], dp[i])\r\n\r\n print(dp[n])\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\nn = len(s)\r\n\r\n\r\nar = [1, 0, 0]\r\n\r\nsm = 0\r\nans = 0\r\nfor i in range(n):\r\n sm += int(s[i])\r\n sm %= 3\r\n ar[sm] += 1\r\n if ar[sm] == 2:\r\n ans += 1\r\n ar[0] = 1\r\n ar[1] = 0\r\n ar[2] = 0\r\n sm = 0\r\n\r\n\r\n\r\nprint(ans)\n# Wed Sep 29 2021 19:59:13 GMT+0300 (Москва, стандартное время)\n", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n s = input().strip()\r\n n = len(s)\r\n\r\n A = list(map(int, s))\r\n P = list(accumulate(A, initial=0))\r\n for i, x in enumerate(P):\r\n P[i] %= 3\r\n\r\n next_occurrence = {}\r\n\r\n def neighbors(i):\r\n yield 0, i + 1\r\n if P[i] in next_occurrence:\r\n yield 1, next_occurrence[P[i]]\r\n\r\n dp = [0] * (len(P) + 1)\r\n for i in range(len(P) - 1, -1, -1):\r\n for weight, nei in neighbors(i):\r\n dp[i] = max(dp[i], weight + dp[nei])\r\n next_occurrence[P[i]] = i\r\n\r\n print(dp[0])\r\n\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\r\nres=0\r\nt=[]\r\nfor i in s:\r\n if not int(i)%3:\r\n res+=1\r\n t=[]\r\n else:\r\n rem=int(i)%3\r\n if 3-rem in t:\r\n res+=1\r\n t=[]\r\n else:\r\n t.append(rem)\r\n if len(t)==3:\r\n res+=1\r\n t=[]\r\nprint(res)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef f(x):\r\n q = 0\r\n s = ''\r\n for i in x:\r\n s += i\r\n if s in {'bc', 'cb', 'bbb', 'ccc', 'bbc', 'ccb'}:\r\n s = ''\r\n q += 1\r\n return q\r\n\r\ns = input()[:-1]\r\nd = ['a' if int(i) % 3 == 0 else 'b' if int(i) % 3 == 1 else 'c' for i in s]\r\nc = d.count('a')\r\nd = ''.join(d).split('a')\r\nd = [i for i in d if i != '']\r\nx = sum(f(i) for i in d if len(i) > 1)\r\nprint(x+c)\r\n", "from functools import lru_cache\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nnum = input().strip()\r\n\r\nn = len(num)\r\n\r\n# @lru_cache(None)\r\n# def dp(i, sum_under_mod):\r\n# if i >= n:\r\n# return 0\r\n \r\n# sum_under_mod = ( sum_under_mod + int(num[i]) ) % 3\r\n# return max(\r\n# dp(i + 1, sum_under_mod),\r\n# dp(i + 1, 0) + (sum_under_mod % 3 == 0)\r\n# )\r\n\r\n# print(dp(0, 0))\r\n\r\ndp = [[0 for _ in range(3)] for _ in range(n + 1)]\r\n\r\nfor i in range(n - 1, -1, -1):\r\n for j in range(2, -1, -1):\r\n hold = (j + int(num[i])) % 3\r\n dp[i][j] = max(dp[i + 1][hold], dp[i + 1][0] + (hold % 3 == 0))\r\n\r\nprint(dp[0][0])\r\n# print(dp)\r\n\r\n# 3 1 2 1\r\n# 6", "s=input()\r\nn=len(s)\r\nl=[1,0,0]\r\nc,ans=0,0\r\nfor i in range(n):\r\n c+=int(s[i])\r\n c%=3\r\n l[c]+=1\r\n if(l[c]==2):\r\n ans+=1\r\n l=[1,0,0]\r\n c=0\r\n\r\nprint(ans)\r\n", "m=1\r\nr=s=0\r\nfor c in input():\r\n s+=int(c);b=1<<s%3\r\n if m&b:m=0;r+=1\r\n m|=b\r\nprint(r)", "# https://codeforces.com/contest/1005\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\ns = input()\n\na = list(map(lambda x: int(x) % 3, list(s)))\nn = len(a)\n\nans = 0\n\ni = 0\nwhile i < n:\n if a[i] == 0:\n ans += 1\n i += 1\n elif i + 1 < n:\n if a[i] == 1 and a[i + 1] in [0, 2]:\n ans += 1\n i += 2\n elif a[i] == 2 and a[i + 1] in [0, 1]:\n ans += 1\n i += 2\n elif i + 2 < n:\n ans += 1\n i += 3\n else:\n break\n else:\n break\n\nprint(ans)\n", "s = str(input())\r\nr = 0\r\nn = len(s)\r\nfin = [-1]*3\r\nfin[0] = 0\r\nz = [0]*(n+1)\r\nfor i in range(1,n+1):\r\n r = (r+int(s[i-1]))%3\r\n z[i]=z[i-1]\r\n if fin[r] != -1:\r\n z[i] = max(z[i],z[fin[r]]+1)\r\n fin[r] = i\r\nprint(z[n])", "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 s = str(input())\r\n\r\n last = \"\"\r\n res = 0\r\n\r\n for i in range(len(s)):\r\n last += s[i]\r\n cur = \"\"\r\n for j in range(len(last) - 1, -1, -1):\r\n cur += last[j]\r\n if int(cur) % 3 == 0:\r\n res += 1\r\n last = \"\"\r\n break\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom itertools import accumulate\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log, ceil,inf\r\nfrom collections import defaultdict, Counter, deque\r\nimport heapq\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\nmod=1000000007\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n \r\ndef solve():\r\n number = list(map(int,list(input())))\r\n arr = [0] + list(accumulate(number))\r\n for i in range(len(arr)):\r\n arr[i] %= 3\r\n\r\n pre = [[inf,inf,inf] for i in range(len(arr)-1)]\r\n pre[-1][arr[-1]] = len(pre)-1\r\n\r\n for i in range(len(pre)-2,-1,-1):\r\n pre[i] = pre[i+1].copy()\r\n pre[i][arr[i+1]] = i\r\n leng = len(number)\r\n\r\n memo = defaultdict(int)\r\n for i in range(leng,0,-1):\r\n cur = pre[i-1][arr[i-1]] + 2\r\n if cur == inf: memo[i] = memo[i+1]\r\n else:memo[i] = max(memo[cur]+1,memo[i+1])\r\n \r\n return memo[1]\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n print(solve())" ]

[ "import math\r\nk=int(input())\r\nl=int(input())\r\nn=0\r\ntmp=k\r\nwhile(l>tmp and l!=tmp):\r\n\ttmp=tmp*k\r\n\tn+=1\r\nif(l==tmp):\r\n\tprint(\"YES\")\r\n\tprint(n)\r\nelse:\r\n\tprint(\"NO\")\r\n", "m=int(input())\r\nn=int(input())\r\nc=0\r\nwhile n!=1:\r\n if n%m!=0:\r\n break\r\n n=n//m\r\n c+=1\r\nif n==1:\r\n print(\"YES\")\r\n print(c-1)\r\nelse:\r\n print(\"NO\")", "k=int(input())\r\nl=int(input())\r\ni=0\r\nwhile l>1:l/=k;i+=1\r\nif l==1:\r\n print(\"YES\")\r\n print(i-1)\r\nelse:print(\"NO\")", "a = int(input())\r\nb = int(input())\r\n\r\nc = 1\r\np = 0\r\nd = 0\r\nwhile c < b:\r\n c = (a**p)\r\n if c == b:\r\n print(\"YES\")\r\n print(str(p - 1))\r\n d = 1\r\n p = p+1\r\n\r\nif d == 0:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\np = k\r\nimportance = 0\r\ncifiera = False\r\nif k == 1:\r\n cifiera = (k == l)\r\nelse:\r\n while p < 2 ** 31:\r\n if p == l:\r\n cifiera = True\r\n break\r\n p *= k\r\n importance += 1\r\n \r\nif cifiera:\r\n \r\n print('YES')\r\n print(importance)\r\nelse:\r\n print('NO')\r\n ", "a = int(input());b = int(input());\r\nif a>b:\r\n print(\"NO\")\r\nelse:\r\n i=0\r\n j=1\r\n while abs(b)>abs(j):\r\n j*=a\r\n i+=1\r\n \r\n if b == j:\r\n print(\"YES\")\r\n print(i-1)\r\n else:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\nc = 0\r\nb = k\r\nwhile k < l:\r\n k *= b\r\n c += 1\r\nif k == l:\r\n print('YES')\r\n print(c)\r\nelse:\r\n print('NO')\r\n", "# Target - Expert on CF\r\n# Be Humblefool\r\n\r\nimport sys\r\n\r\ninf = float(\"inf\")\r\n# sys.setrecursionlimit(100000)\r\n\r\n# abc='abcdefghijklmnopqrstuvwxyz'\r\n# abd={'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\n# mod, MOD = 1000000007, 998244353\r\n# words = {1:'one',2:'two',3:'three',4:'four',5:'five',6:'six',7:'seven',8:'eight',9:'nine',10:'ten',11:'eleven',12:'twelve',13:'thirteen',14:'fourteen',15:'quarter',16:'sixteen',17:'seventeen',18:'eighteen',19:'nineteen',20:'twenty',21:'twenty one',22:'twenty two',23:'twenty three',24:'twenty four',25:'twenty five',26:'twenty six',27:'twenty seven',28:'twenty eight',29:'twenty nine',30:'half'}\r\n# vow=['a','e','i','o','u']\r\n# dx,dy=[0,1,0,-1],[1,0,-1,0]\r\n\r\n# import random\r\n# from collections import deque, Counter, OrderedDict,defaultdict\r\n# from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace\r\n# from math import ceil,floor,log,sqrt,factorial,pi,gcd\r\n# from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\nm = int(input())\r\n\r\nct = 0\r\nwhile m%n==0:\r\n m//=n\r\n ct+=1\r\nif m==1:\r\n print('YES')\r\n print(ct-1)\r\nelse:\r\n print('NO')", "import sys\r\nimport math\r\n#from 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\nk=inp()\r\nl=inp()\r\nans=-1\r\nwhile l%k==0:\r\n\tl//=k\r\n\tans+=1\r\nif l==1:\r\n\tprint(\"YES\")\r\n\tprint(ans)\r\nelse:\r\n\tprint(\"NO\")\r\n", "k=int(input())\r\nl=int(input())\r\nn=1\r\nwhile k**n<l:\r\n n+=1\r\nif k**n==l:\r\n print(\"YES\"),print(n-1)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nl=int(input())\r\nz=n\r\ncnt=0\r\nwhile z<l:\r\n z=z*n\r\n cnt+=1\r\nif z==l:\r\n print(\"YES\")\r\n print(cnt)\r\nelse:\r\n print(\"NO\")", "if __name__ == '__main__':\r\n k = int(input())\r\n l = int(input())\r\n p = k\r\n num = 0\r\n while p < l:\r\n p *= k\r\n num += 1\r\n if p == l:\r\n print('YES')\r\n print(num)\r\n else:\r\n print('NO')\r\n", "import math\r\n\r\nk = int(input())\r\nl = int(input())\r\nl1 = l\r\n\r\ncnt = 0\r\nwhile not l % k and l != k:\r\n l /= k\r\n cnt += 1\r\n\r\nif not l % k:\r\n print('YES')\r\n print(cnt)\r\nelse:\r\n print('NO')\r\n", "k=int(input())\r\nl=int(input())\r\ncou=0\r\nwhile(l%k==0):\r\n\tl=l/k\r\n\tcou+=1\r\nif(l==1):\r\n\tprint(\"YES\")\r\n\tprint(cou-1)\r\nelse:\r\n\tprint(\"NO\")\t\t\r\n", "k = int(input())\r\nl = int(input())\r\nh = k\r\nc = 0\r\nwhile(k<l):\r\n c+=1\r\n k*=h\r\nif k==l:\r\n print(\"YES\")\r\n print(c)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\na = int(input())\r\nans = 0\r\nx = n\r\nwhile x<a:\r\n x*=n\r\n ans+=1\r\nif x==a:\r\n print(\"YES\")\r\n print(ans)\r\nelse:\r\n print(\"NO\")", "import sys\r\n\r\nk = int(sys.stdin.readline())\r\nl = int(sys.stdin.readline())\r\n\r\ncur = k\r\nn = 0\r\n\r\nwhile cur < l:\r\n cur *= k\r\n n += 1\r\n\r\nif cur == l:\r\n print(\"YES\")\r\n print(n)\r\nelse:\r\n print(\"NO\")", "k = int(input())\nl = int(input())\n\n\nfor i in range(1,50):\n if k**i==l:\n print(\"YES\")\n print(i-1)\n break\nelse:\n print(\"NO\")\n", "k=int(input())\r\nl=int(input())\r\nx,i=0,1\r\nwhile(x<l):\r\n x=k**i\r\n i=i+1\r\nif x==l:\r\n print(\"YES\")\r\n print(i-2)\r\nelse:\r\n print(\"NO\")", "n = k = int(input())\r\nl = int(input())\r\ns = 0\r\nwhile n <= l:\r\n if n == l:\r\n print(f\"YES\\n{s}\")\r\n break\r\n else:\r\n n = n*k\r\n s += 1\r\nelse:\r\n print(\"NO\")", "# Target - Expert on CF\r\n# Be Humblefool\r\n\r\nimport sys\r\n\r\ninf = float(\"inf\")\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nn = int(input())\r\nm = int(input())\r\n\r\nct = 0\r\nwhile m%n==0:\r\n m//=n\r\n ct+=1\r\nif m==1:\r\n print('YES')\r\n print(ct-1)\r\nelse:\r\n print('NO')", "k = int(input())\r\nl = int(input())\r\n\r\nc = 1\r\nwhile (l / k) != 1 and l - k > 0 and l != 1:\r\n l /= k\r\n c += 1\r\nif l / k == 1:\r\n print('YES')\r\n print(c - 1)\r\nelse:\r\n print('NO')\r\n", "import math\r\nl=int(input())\r\nm=int(input())\r\nc=0\r\nwhile(m%l==0):\r\n m=m//l\r\n c+=1\r\nif(m==1):\r\n print(\"YES\")\r\n print(c-1)\r\nelse:\r\n print(\"NO\")\r\n", "a=int(input())\r\nb=list(a**i for i in range(1,32))\r\nc=int(input())\r\nif c in b:\r\n\tprint(\"YES\")\r\n\tprint(b.index(c))\r\nelse:\r\n\tprint(\"NO\")", "n = int ( input ())\r\nm = int ( input ())\r\nc = 0\r\nfor i in range ( 1 , 31 ):\r\n if ( m == ( n ** i )):\r\n print ( \"YES\" )\r\n print ( i - 1 )\r\n c+=1\r\n break\r\nif ( c == 0 ):\r\n print ( \"NO\" )", "a, b, n = int(input()), int(input()), 1\r\nwhile a ** n < b:\r\n n += 1\r\nif a ** n == b:\r\n print(\"YES\")\r\n print(n - 1)\r\nelse:\r\n print(\"NO\")", "k= int(input())\r\nl= int(input())\r\nif k>l or l%k!=0:\r\n print('NO')\r\nelif l==k:\r\n print('YES')\r\n print(0)\r\nelse:\r\n count=0\r\n while l%k==0:\r\n count+=1\r\n l= l//k\r\n \r\n if l!=1:\r\n print('NO')\r\n else:\r\n print('YES')\r\n print(count-1)\r\n ", "import itertools\r\nimport 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 x = int(input())\r\n y = int(input())\r\n for i in range(100):\r\n if y == 1:\r\n print('YES')\r\n print(i - 1)\r\n return\r\n if y % x == 0:\r\n y //= x\r\n else:\r\n print('NO')\r\n return\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n = int(input())\r\nx = int(input())\r\n\r\nz = n\r\ncount = 0\r\n\r\nwhile z < x:\r\n z = z * n\r\n count +=1\r\n\r\nif z == x :\r\n print('YES')\r\n print(count)\r\nelse:\r\n print('NO')\r\n", "\n\nk = int(input())\nl = int(input())\n\namount = 0\n\nwhile l % k == 0:\n l //= k\n amount += 1\n\nif l == 1:\n print(\"YES\")\n print(amount - 1)\nelse:\n print(\"NO\")\n\n\n", "import math\r\n\r\nx = int(input())\r\np = int(input())\r\n\r\ne=int((math.log(p, x)))\r\nif x**e== p and e>0:\r\n\tprint('YES')\r\n\tprint(e-1)\r\nelse:\r\n\tprint('NO')\r\n", "k = int(input())\r\na = int(input())\r\ns = 2\r\nz = 0\r\np = 0\r\nx = k\r\nwhile x != a:\r\n z += 1\r\n x = x * k\r\n s += 1\r\n if x > a:\r\n p = -1\r\n break\r\n else:\r\n continue\r\nif p == -1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(z)\r\n", "k=int(input())\nl=int(input())\ni=0\nwhile l>1:l/=k;i+=1\nif l==1:\n print(\"YES\")\n print(i-1)\nelse:print(\"NO\")", "n=int(input())\r\nl=int(input())\r\nif n==l:\r\n print(\"YES\")\r\n print(0)\r\nelif l%n:\r\n print(\"NO\")\r\nelse:\r\n ans=0\r\n while(l%n==0):\r\n l/=n\r\n ans+=1\r\n if ans>=0 and l==1:\r\n print(\"YES\")\r\n print(ans-1)\r\n else:\r\n print(\"NO\")", "#import math\n#n, m = input().split()\n#n = int (n)\n#m = int (m)\n#k = int (k)\nn = int(input())\nm = int(input())\n#s = input()\n#t = input()\n#h = list(map(int, input().split()))\n#b = list(map(int, input().split()))\n#c = list(map(int, input().split()))\n\n#x1, y1, x2, y2 =map(int,input().split())\n#n = int(input())\n#f = []\n#f = [0]*n\n#t = [0]*n\n#f = [(int(s1[0]),s1[1]), (int(s2[0]),s2[1]), (int(s3[0]), s3[1])]\n#f = sorted (f, key = lambda tup: tup[0] )\n\n#h = [\"\"] * n\n#f1 = sorted(f, key = lambda tup: tup[0])\n\n\n#f1 = sorted(t, key = lambda tup: tup[0])\nc = n\ni = 0\nf = False\nwhile c <= m:\n if (c == m):\n f = True\n i -= 1\n c *= n\n i+= 1\nif f:\n print (\"YES\")\n print(i)\nelse:\n print(\"NO\")\n", "n = int(input())\r\nx = int(input())\r\ntemp = -1\r\n\r\nwhile x != 1 and x % n == 0:\r\n x //= n\r\n temp += 1\r\n\r\nif x == 1:\r\n print(\"YES\\n\" + str(temp))\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\nres = -1\r\nwhile (l % k) == 0 :\r\n l //= k\r\n res += 1\r\nif l == 1 : \r\n print('YES')\r\n print(res)\r\nelse :\r\n print('NO')", "k = int(input())\r\nl = int(input())\r\nans = 0\r\nwhile l%k==0:\r\n ans+=1\r\n l//=k\r\nif l==1:\r\n print(\"YES\")\r\n print(ans-1)\r\nelse:\r\n print(\"NO\")", "k=int(input())\r\nl=int(input())\r\nm,i=k,0\r\nwhile m<l:\r\n m*=k\r\n i+=1\r\nif m==l:\r\n print('YES')\r\n print(i)\r\nelse:\r\n print('NO')", "a = int(input())\r\nb = int(input())\r\nc = 0\r\nwhile b > 1:\r\n b = b / a\r\n c = c + 1\r\nif b == 1:\r\n print('YES')\r\n print(c - 1)\r\nelse:\r\n print('NO')\r\n", "base = int(input())\r\nfinal = int(input())\r\nnew = base\r\ncount = 0\r\nwhile new<final:\r\n new*=base\r\n count+=1\r\nif new==final:\r\n print(\"YES\")\r\n print(count)\r\nelse:\r\n print(\"NO\")", "x = int(input())\r\ny = int(input())\r\nk = 0\r\nt = 0\r\nwhile True:\r\n\tif y == 1:\r\n\t\tbreak\r\n\tif y%x != 0:\r\n\t\tk = 1\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\telse:\r\n\t\ty = y//x\r\n\t\tt = t+1\r\nif k == 0:\r\n\tprint(\"YES\")\r\n\tprint(t-1)", "k = int(input())\r\nl = int(input())\r\n\r\ndef isPower(k,l): #sprawdzamy czy k^pow == l istnieje\r\n if(k==l):\r\n print(\"YES\")\r\n print(\"0\")\r\n return\r\n \r\n pow = 1\r\n i = 0\r\n while(pow<l):\r\n pow = pow * k\r\n i += 1\r\n \r\n if pow == l:\r\n print(\"YES\")\r\n print(i - 1)\r\n return\r\n \r\n print(\"NO\")\r\n return\r\n\r\nisPower(k,l)", "# coding: utf-8\nk = int(input())\nl = int(input())\ntmp = k\nans = 0\nwhile tmp < l:\n tmp *= k\n ans += 1\nif pow(k,ans+1)==l:\n print('YES',ans,sep='\\n')\nelse:\n print('NO')\n", "k=int(input())\r\nl=int(input())\r\na=0\r\nwhile(l!=1):\r\n if(l%k!=0):\r\n break\r\n l=l//k\r\n a+=1\r\nif(l==1):\r\n print(\"YES\")\r\n print(a-1)\r\nelse:\r\n print(\"NO\")", "\r\nk,n =int(input()),int(input())\r\np = 1\r\nc=0\r\nwhile(p<n):\r\n p*=k\r\n if p==n:\r\n print(\"YES\")\r\n print(c)\r\n break\r\n c+=1\r\nif p>n:\r\n print(\"NO\") ", "# the first line contains integer k\nk = int(input())\n# the second line contains integer number I\ni = int(input())\n\n# p is the power \np = 1\n\n# whether k belongs to the set petricium\npetric = False\n\nwhile k**p <= i:\n\tif k**p == i:\n\t\tpetric = True\n\t\tbreak\n\tp += 1\n\nif petric:\n\tprint(\"YES\")\n\tprint(p-1)\nelse:\n\tprint(\"NO\")", "k=int(input())\r\nn=a=int(input())\r\ni=0\r\nwhile k**i<n:\r\n\ti+=1\r\nif(k**i==a):\r\n\tprint('YES')\r\n\tprint(i-1)\r\nelse:\r\n\tprint('NO')", "n=int(input())\r\nk=int(input())\r\np=[]\r\nfor i in range(1,32):\r\n p.append(i)\r\nflag=0 \r\nfor i in p: \r\n if(n**i==k):\r\n print('YES')\r\n print(p.index(i))\r\n flag=1\r\n break\r\nif(flag==0):\r\n print(\"NO\")", "n=int(input())\r\np=int(input())\r\nsam=n\r\nsim=0\r\nif n==p:\r\n print(\"YES\")\r\n print(0)\r\nwhile n<p:\r\n n*=sam\r\n sim+=1\r\n if n==p:\r\n print(\"YES\")\r\n print(sim)\r\n break\r\n else:\r\n pass\r\nif n>p:\r\n print(\"NO\")\r\n", "from sys import stdin,stdout\r\nn=int(stdin.readline())\r\nm=int(stdin.readline())\r\ntest=n\r\nans=0\r\nwhile m>test:\r\n test*=n\r\n ans+=1\r\nif m==test:\r\n stdout.write('YES'+'\\n')\r\n stdout.write(str(ans)+'\\n')\r\nelse:\r\n stdout.write('NO'+'\\n')\r\n", "#ROUNIAAUDI\r\nnum1=int(input())\r\nnum2=int(input())\r\nc=0\r\nb=False\r\nb1=False\r\nif num1==num2:\r\n print(\"YES\")\r\n print(0)\r\n b1=True\r\nelif num2>num1:\r\n while(num2>num1):\r\n num2/=num1\r\n c+=1\r\n if num2==num1:\r\n b=True\r\nif b and b1==False:\r\n print(\"YES\")\r\n print(c)\r\nelif b1==False:\r\n print(\"NO\")", "k=int(input())\r\nl=int(input())\r\nla=0\r\nwhile l:\r\n if l==k: print('YES'); print(la); break\r\n if l%k==0: l//=k; la+=1\r\n else: print('NO'); break", "a=int(input())\r\nb=int(input())\r\ni=2\r\nj=pow(2,15)\r\nk=j-1\r\nc=0\r\nfor i in range(j):\r\n v=pow(a,i)\r\n if(v==b):\r\n c=1\r\n m=i-1\r\n elif(v>b):\r\n break\r\nif(c==1):\r\n print(\"YES\")\r\n print(m)\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "Base = int(input())\r\nSymbol = int(input())\r\nNumber = 0\r\n\r\nwhile Symbol % Base == 0:\r\n Symbol = Symbol // Base\r\n Number += 1\r\nif Symbol == 1:\r\n print(\"YES\", Number - 1, sep=\"\\n\")\r\nelse:\r\n print(\"NO\")\r\n\r\n# UB_CodeForces\r\n# Advice: Be on your own\r\n# Location: Based on popular demand \"\" \"\" \"\" \"\"\r\n# Caption: Last breath\r\n# CodeNumber: 574\r\n", "import sys\nfrom math import sqrt\n\nn = int(input().strip())\nk = int(input().strip())\n\nl = []\nfor i in range(1,int(sqrt(k)+1)):\n if k < n**i: break\n else: l.append(n**i)\n\nif k in l:\n print(\"YES\\n{}\".format(l.index(k)))\nelse:\n print(\"NO\")\n", "n=int(input())\r\nm=int(input())\r\ni=int(1)\r\nflag=int(0)\r\nl=int(0)\r\nwhile True:\r\n if n**i<m:\r\n i+=1\r\n continue\r\n elif n**i==m:\r\n l=i-1\r\n flag=1\r\n break\r\n else:\r\n break\r\nif flag==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(l)", "k = int(input())\r\nn = int(input())\r\ncnt = 0\r\nwhile n%k==0:\r\n n//=k\r\n cnt += 1\r\nif n != 1 or cnt <1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(cnt-1)", "k=int(input())\r\nl=int(input())\r\nr=l/k\r\nx=0\r\nwhile r>=k:\r\n if r%k==0:\r\n x=x+1\r\n r=r/k\r\nn=k\r\nfor i in range(1,x+1):\r\n n=n*k\r\n\r\nif n==l:\r\n print('YES')\r\n print(x)\r\nelse:\r\n print('NO')\r\n", "a=int(input())\r\nb=int(input())\r\nans=0\r\nwhile b%a==0:\r\n ans=ans+1\r\n b/=a\r\nif b>1:\r\n print(\"NO\")\r\nif b<=1:\r\n print(\"YES\")\r\n print(ans-1)\r\n", "x=int(input())\r\ny=int(input())\r\na=1;\r\nk=0;\r\nfor i in range (0,32):\r\n x=x*a;\r\n if a==1:\r\n a=x\r\n if x==y:\r\n print(\"YES\")\r\n print(i)\r\n k=1;\r\nif k==0:\r\n print(\"NO\")", "def main():\r\n k=float(input())\r\n l=float(input())\r\n i=0\r\n if(l%k==0):\r\n while(k**i!=l and k**i<l):\r\n i=i+1\r\n if(k**i!=l):\r\n print(\"NO\")\r\n return\r\n else:\r\n print(\"YES\")\r\n print(i-1) \r\n else:\r\n print(\"NO\")\r\n\r\nmain()\r\n", "\r\nimport math\r\n #fuck another solve using python\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nl=int(input())\r\n\r\ncnt=0\r\nwhile(l%n==0):\r\n\tcnt+=1\r\n\tl/=n\r\n\r\n\r\nif(l==1):\r\n\tprint(\"YES\")\r\n\tprint(cnt-1)\r\nelse:\r\n\tprint(\"NO\")\r\n", "k = int(input())\r\nl = int(input())\r\ncnt = 0\r\nflag = True\r\nwhile l != 1:\r\n if l % k != 0:\r\n flag = False\r\n print(\"NO\")\r\n break\r\n else:\r\n l //= k\r\n cnt += 1\r\n\r\nif flag:\r\n print(\"YES\")\r\n print(cnt - 1)", "import math\r\nk=int(input())\r\nl=int(input())\r\np=int(math.log(l,k))\r\nif l==k**p:\r\n print(\"YES\")\r\n print(p-1)\r\nelse:\r\n print(\"NO\")\r\n ", "k = int(input())\r\nl = int(input())\r\n\r\ni = 1\r\nflag = False\r\nwhile l >= k**i:\r\n if k**i == l:\r\n flag = True\r\n break\r\n i += 1\r\n\r\nif flag:\r\n print(\"YES\")\r\n print(i - 1)\r\nelse:\r\n print(\"NO\")", "k, l = int(input()), int(input())\r\nt, dem = k, 0\r\nwhile t < l: t, dem = t * k, dem + 1\r\nprint(\"YES\", dem, sep = \"\\n\") if t == l else print(\"NO\")", "k = int(input())\r\nl = int(input())\r\nif l%k:\r\n print(\"NO\")\r\nelse:\r\n ans = -1\r\n while l%k==0:\r\n l = l//k\r\n ans+=1\r\n if l==1:\r\n print(\"YES\")\r\n print(ans)\r\n else:\r\n print(\"NO\")\r\n \r\n", "petriciumus = int(input().strip())\nl = int(input().strip())\n\nl_importance = -1\n\nwhile (l % petriciumus == 0):\n l = l // petriciumus\n \n l_importance += 1\n\nif (l_importance < 0):\n print('NO')\nelif (l == 1):\n print('YES')\n print(l_importance)\nelse:\n print('NO')\n\n \t \t \t \t\t\t\t\t \t \t\t \t \t\t \t", "k = int(input())\r\nl = int(input())\r\nh = 0\r\nmult = k\r\nwhile mult < l:\r\n mult = mult * k\r\n h = h + 1\r\nif mult == l:\r\n print(\"YES\")\r\n print(h)\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "import math\r\nk = int(input())\r\nn = int(input())\r\n\r\nc = math.log(n, k)\r\nc=round(c)\r\nk= pow(k, int(c))\r\n\r\nif k== n:\r\n print(\"YES\")\r\n print(int(c - 1))\r\nelse:\r\n print(\"NO\")", "n= int(input())\r\nk = int(input())\r\nc = 0\r\nwhile not k % n and k != 1:\r\n k//=n\r\n c += 1\r\nprint([\"NO\",f\"YES\\n{c-1}\"][k==1])\r\n", "import sys\r\nk=int(input())\r\nx=int(input())\r\ncount=0\r\ny=1\r\nwhile(x>y):\r\n y=y*k\r\n if(y==x):\r\n print(\"YES\")\r\n print(count)\r\n sys.exit(0)\r\n count=count+1\r\nprint(\"NO\")\r\nsys.exit(0)\r\n", "k = int(input())\r\nl = int(input())\r\nif(l==k):\r\n print(\"YES\\n0\")\r\n exit(0)\r\ni=2\r\nx = k**i\r\nwhile(x<=l):\r\n if(x==l):\r\n print(\"YES\")\r\n print(i-1)\r\n exit(0)\r\n i+=1\r\n x = k**i\r\nprint(\"NO\")", "from math import log\r\nk=int(input())\r\nl=int(input())\r\nif(l%k==0):\r\n p=int(log(l,k))\r\n if(k**p==l):\r\n print(\"YES\")\r\n print(p-1)\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "import math\r\nk=int(input())\r\nl=int(input())\r\nc=0\r\nt=k\r\nwhile(t<=l):\r\n if t==l:\r\n print(\"YES\")\r\n print(c)\r\n c=-1\r\n break\r\n c+=1\r\n t*=k\r\nif c!=-1:print(\"NO\")", "a,b=int(input()),int(input())\r\ncur=a\r\nfor i in range(1,40):\r\n if(a**i==b):\r\n print(\"YES\")\r\n print(i-1)\r\n quit()\r\nprint(\"NO\")\r\n", "import os\n\nx = int(input())\ny = int(input())\n\nif y < x:\n\tprint(\"NO\")\nelse:\n\tcnt = 0\n\twhile y % x == 0:\n\t\ty /= x\n\t\tcnt += 1\n\tif y == 1:\n\t\tprint(\"YES\")\n\t\tprint(cnt - 1)\n\telse:\n\t\tprint(\"NO\")\n", "def q114a():\n\tk = int(input())\n\tl = int(input())\n\tnum = k\n\timportance = 0\n\twhile(num <= 2147483647):\n\t\tif(num == l):\n\t\t\tprint(\"YES\")\n\t\t\tprint(importance)\n\t\t\texit()\n\t\tnum *= k\n\t\timportance += 1\n\tprint(\"NO\")\n\nq114a()", "a=int(input())\r\nb=int(input())\r\nh=a\r\nk=0\r\nwhile h<b:\r\n h=h*a\r\n k+=1\r\nif h==b:\r\n print('YES')\r\n print(k)\r\nelse:\r\n print('NO')", "from math import log\nfrom math import ceil\nt = int(input())\nt2 = int(input())\nt3 = t\nsw = 0\nc = 1\nmax_poss = (2 ** 31) - 1\nwhile t3 <= max_poss:\n if t3 == t2:\n print(\"YES\")\n print(c-1)\n sw = 1\n t3 *= t\n c+=1\nif not sw:\n print(\"NO\")\n", "la, n, l = -1, int(input()), int(input())\r\nwhile l > 1:\r\n if l % n == 0:\r\n l = l // n\r\n la += 1\r\n else:\r\n la = -1\r\n break\r\nif la == -1: print('NO')\r\nelse:\r\n print('YES')\r\n print(la)", "k=int(input())\r\nl=int(input())\r\nx=l%k;importance=-1\r\nif x==0:\r\n while x==0:\r\n l/=k\r\n importance+=1\r\n x=l%k\r\n if l==1.0:\r\n print('YES')\r\n print(importance)\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n", "def solve():\n k = int(input())\n l = int(input())\n power = 0\n while l != 1 and l%k == 0:\n l//=k\n power +=1\n if l == 1:\n print ('YES')\n print (power-1)\n else:\n print ('NO')\n\ndef main():\n solve()\n\nmain()\n \t\t\t\t \t\t \t \t\t\t\t \t \t \t \t", "x=int(input())\r\ny=int(input())\r\nans=0\r\nwhile(y%x==0):\r\n y=y//x\r\n ans+=1\r\nif(y==1):\r\n print(\"YES\")\r\n print(ans-1)\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\ncount = 0\r\nnow = k\r\nwhile now < l:\r\n count += 1\r\n now *= k\r\n\r\nif now == l:\r\n print(\"YES\")\r\n print(count)\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input())\r\nl = int(input())\r\narr = []\r\nfor x in range(1,32):\r\n arr.append(k**x)\r\nfor i in range(31):\r\n if arr[i] == l:\r\n print(\"YES\")\r\n print(i)\r\n break\r\nelse:\r\n print(\"NO\")", "'''input\n3\n8\n'''\nk, l = int(input()), int(input())\nfor x in range(1, 100):\n\tif k**x == l:\n\t\tprint(\"YES\")\n\t\tprint(x-1)\n\t\tbreak\nelse:\n\tprint(\"NO\")\n", "n = int(input())\r\np = int(input())\r\nc = 0\r\nsq = n\r\nwhile p>=sq:\r\n if p == sq:\r\n print('YES')\r\n print(c)\r\n break\r\n else:\r\n sq*=n\r\n c+=1\r\nelse:\r\n print('NO')\r\n ", "import math\r\nx=int(input(\"\"))\r\ny=int(input(\"\"))\r\ns=math.log(y,x)\r\ns=round(s)\r\nif((x**s == y)):\r\n print(\"YES\")\r\n print(s-1)\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nm = int(input())\r\ntmp = 1\r\nwhile n ** tmp < m:\r\n tmp += 1\r\n#tmp -= 1\r\nif m != n ** tmp:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(tmp-1)\r\n", "from sys import *\r\nfrom math import *\r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\ndef ans(k,l):\r\n ct = 0\r\n while l % k == 0 and l != 1:\r\n ct += 1\r\n l = l // k\r\n if l == 1:\r\n print('YES',ct-1,sep = '\\n')\r\n else:\r\n print('NO')\r\n\r\n\r\n\r\nk = int(input())\r\nl = int(input())\r\nans(k,l)\r\n", "n = int(input())\r\na = int(input())\r\nf=0\r\nc = 0\r\nwhile a > 1:\r\n if a%n != 0:\r\n f=1\r\n break\r\n else:\r\n a = a//n\r\n c += 1\r\nif f == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(c-1)", "base = int(input())\r\nnum = int(input())\r\ndef exp(num,base):\r\n count = -1\r\n while num!=1:\r\n if num%base!=0:\r\n return \"NO\"\r\n num//=base\r\n count += 1\r\n return \"YES\\n\"+str(count)\r\nprint(exp(num,base))", "k=int(input())\r\nl=int(input())\r\ncnt=0\r\nwhile(l%k==0 and l!=1):\r\n l=l/k\r\n cnt+=1\r\nif(l==1):\r\n print(\"YES\")\r\n print(cnt-1)\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nk = int(input())\r\nl = int(input())\r\nc = 0\r\nwhile l % k == 0:\r\n l //= k\r\n c += 1\r\nif l != 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(c-1)", "import math\r\nn1=int(input())\r\nn2=int(input())\r\nx=math.log(n2,n1)\r\nxx=int(x)\r\nif(n1**xx==n2):\r\n print(\"YES\")\r\n print(xx-1)\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\nc = 1\r\nwhile(k**c<l):\r\n c += 1\r\nif(k**c == l):\r\n print('YES')\r\n print(c-1)\r\nelse:\r\n print('NO')", "k, l = int(input()), int(input())\r\nimportance = 0\r\nwhile l > k and l % k == 0:\r\n l //= k\r\n importance += 1\r\nif k == l:\r\n print(\"YES\")\r\n print(importance)\r\nelse:\r\n print(\"NO\")", "n = float(input())\r\nt = float(input())\r\n\r\nc = 1\r\nwhile n**c<t:\r\n c+=1\r\n\r\nif t == n**c:\r\n print ('YES')\r\n print (c-1)\r\nelse:\r\n print ('NO')", "\r\nk = int(input())\r\nl = int(input())\r\n\r\nx = 0\r\nc = k\r\n\r\nwhile(c < l):\r\n c *= k\r\n x += 1\r\n\r\nif c == l :\r\n print('YES')\r\n print(x)\r\nelse:\r\n print('NO')", "import sys\r\nfrom math import log\r\nfrom math import floor, ceil\r\n\r\na=int(input())\r\nb=int(input())\r\ncount=0\r\nwhile (b%a==0):\r\n\tb=b/a\r\n\tcount+=1\r\nif b>1:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(count-1)\r\n\t\r\n", "def cyfera(k, l):\r\n x = k\r\n y = 0\r\n while x < l:\r\n x *= k\r\n y += 1\r\n if x == l:\r\n return \"YES\", y\r\n return \"NO\",\r\n\r\n\r\nK = int(input())\r\nL = int(input())\r\nprint(*cyfera(K, L), sep='\\n')\r\n", "import math\r\n\r\nk, l = int(input()), int(input())\r\np = 0\r\nwhile l >= k and l % k == 0:\r\n l //= k\r\n p += 1\r\n\r\nif p > 0 and l == 1:\r\n print('YES')\r\n print(p - 1)\r\nelse:\r\n print('NO')", "n=int(input())\r\nm=int(input())\r\nif m%n!=0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tp,x=0,0\r\n\twhile p<m:\r\n\t\tp=n**x\r\n\t\tif p==m:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tprint(max(x-1,0))\r\n\t\t\tbreak\r\n\t\tx+=1\r\n\telse:\r\n\t\tprint('NO')", "k=int(input())\r\nl=int(input())\r\nc=0\r\nwhile k**c<l:\r\n c+=1\r\nif k**c==l:\r\n print(\"YES\")\r\n print(c-1)\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\ncount = 0\r\ni = 2\r\nele = k\r\nflag = 0\r\nwhile ele <= l:\r\n if ele == l:\r\n flag = 1\r\n break\r\n ele = k**i\r\n i+=1\r\n count += 1\r\n\r\nif (count==0 or flag==0) and k!=l:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(count)", "from math import log10\n\nk = int(input())\nl = int(input())\np = -1\nrecon_l = 0;\nfor i in range(1,32):\n recon_l = k**i\n if recon_l==l:\n p=i\n break\n elif recon_l>l:\n break\n\nif p!=-1:\n print(\"YES\")\n print(p-1)\nelse:\n print(\"NO\")", "# -*- coding: utf-8 -*-\n\"\"\"Untitled75.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1D1x8mgVYBiLay890KzZPAq2TMoXX-k_G\n\"\"\"\n\nn=int(input())\nm=int(input())\nimport math\ni=0\nc=n\nwhile m>c:\n i=i+1\n c=n*c\nif m==c:\n print(\"YES\")\n print(i)\nelse:\n print(\"NO\")", "import math\r\nk=int(input())\r\nl=int(input())\r\nd=0\r\nwhile(l%k==0):\r\n l//=k\r\n d+=1\r\nif(l==1):\r\n print(\"YES\")\r\n print(d-1)\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\n\r\nx = 0\r\nc = 1\r\n\r\nwhile(c < l):\r\n c *= k\r\n x += 1\r\n\r\nif c == l :\r\n print('YES')\r\n print(x-1)\r\nelse:\r\n print('NO')", "inp1 = int(input())\r\ninp2 = int(input())\r\ndef power(inp2,inp1):\r\n count = -1\r\n while inp2!=1:\r\n if inp2%inp1 != 0:\r\n return \"NO\"\r\n inp2//=inp1\r\n count+=1\r\n return \"YES\\n\"+str(count)\r\nprint(power(inp2,inp1))\r\n", "import sys\nk, l = int(input()), int(input())\nn = 1\nwhile True:\n s = k ** n\n if s > l:\n break\n if s == l:\n print('YES')\n print(n - 1)\n sys.exit()\n n += 1\nprint('NO')", "k = int(input())\r\nl = int(input())\r\n\r\ni=1\r\n\r\nwhile(True):\r\n if(k**i == l):\r\n print(\"YES\")\r\n print(i-1)\r\n break\r\n elif(k**i>l):\r\n print(\"NO\")\r\n break\r\n i+=1\r\n\r\n \r\n", "# LUOGU_RID: 113222783\nk=int(input())\r\nl=int(input())\r\nn=0\r\nwhile l%k==0:\r\n l//=k\r\n n+=1\r\nif l==1:\r\n print('YES\\n%d'%(n-1))\r\nelse:\r\n print('NO')", "k = int(input())\nl = int(input())\nc = k\nens = 0\nwhile c < l:\n c *= k\n ens += 1\nif c == l:\n print(f\"YES\\n{ens}\")\n exit(0)\nprint(\"NO\")", "k, l = int(input()), int(input())\r\n\r\nx, t = 0, k\r\nwhile t < l:\r\n\tt *= k\r\n\tx += 1\r\n\r\nif t == l:\r\n\tprint(\"YES\")\r\n\tprint(x)\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\nl=int(input())\r\na=[]\r\npow=0\r\ni=1\r\nwhile pow<=l+1:\r\n pow=n**i\r\n a.append(pow)\r\n i+=1\r\n#print(a) \r\nif l in a :\r\n print('YES')\r\n print([a.index(l),'1'][n==1 and l==1])\r\nelse :\r\n print('NO')", "k=int(input())\r\nkn=int(input())\r\nl=list(range(1,31))\r\nf=True\r\nfor i in l:\r\n if k**i==kn:\r\n print(\"YES\")\r\n print(i-1)\r\n f=False\r\n break\r\n\r\nif f:\r\n print(\"NO\")", "k=int(input())\r\nl=int(input())\r\n\r\nnum=0\r\nstop=True\r\nanswer=0\r\nstart=k\r\n\r\nwhile start<=l and stop:\r\n if start==l:\r\n print(\"YES\")\r\n print(num)\r\n stop=False\r\n answer=1\r\n else:\r\n num+=1\r\n start*=k\r\n\r\nif answer==0:\r\n print(\"NO\")", "x=int(input())\r\ny=int(input())\r\ntemp=x\r\ncount=0\r\nflag=0\r\nwhile(temp <= y):\r\n if(temp==y):\r\n flag=1\r\n break\r\n else:\r\n temp=temp*x\r\n count+=1\r\nif(flag==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(count) \r\n ", "k, l = int(input()), int(input())\r\n\r\nfor i in range(30):\r\n if k ** (i + 1) == l:\r\n print('YES', i, sep='\\n')\r\n break\r\nelse:\r\n print('NO')", "import sys\r\nk = int(input())\r\nl = int(input())\r\nx = 0; y = k\r\nwhile k != l:\r\n k *= y\r\n x += 1\r\n if k > l:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")\r\nprint(x)\r\n", "import math\n\n\nk = int(input())\nl = int(input())\n\nn = math.log10(l) / math.log10(k)\nf = math.floor(n)\nc = math.ceil(n)\nif k ** int(f) == l:\n print(\"YES\")\n print(f\"{int(f) - 1}\")\nelif k ** int(c) == l:\n print(\"YES\")\n print(f\"{int(c) - 1}\")\nelse:\n print(\"NO\")\n", "k = int(input())\r\nl = int(input())\r\ni = 0\r\nwhile (k**i)<=l:\r\n\tif k**i == l: print('YES');print(i-1);exit()\r\n\ti +=1\r\nprint('NO')", "K = int(input())\nL = int(input())\n\nimportance = 0\nflag = 0\nfor i in range(1,65):\n if K**i == L:\n flag = 1\n importance = i\n break\nif flag == 1:\n print('YES')\n print(importance-1)\nelse:\n print('NO')\n", "k=int(input())\r\nl=int(input())\r\ntemp=0\r\ncnt=0\r\nwhile(l>1):\r\n\tif(l%k!=0):\r\n\t\ttemp=1\r\n\t\tbreak\r\n\tcnt+=1\r\n\tl/=k\r\n\r\nif(temp==1):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tprint(cnt-1)", "k=int(input())\nl=int(input())\n\nres,t=0,k\nwhile t<l:\n\tres+=1\n\tt*=k\n\nif t==l:\n\tprint(\"YES\")\n\tprint(res)\nelse:\n\tprint(\"NO\")", "a, b = int(input()), int(input())\r\nn = 0\r\ntemp = a\r\nwhile a < b:\r\n a *= temp\r\n n += 1\r\nif a == b:\r\n print(\"YES\")\r\n print(n)\r\nelse:\r\n print(\"NO\")", "if __name__ == '__main__':\n k = int(input())\n l = int(input())\n \n importance = 0\n found = False\n\n for i in range(1, 31):\n if k**i == l:\n found = True\n importance = i\n break\n \n if found:\n print(\"YES\")\n print(importance - 1)\n else:\n print(\"NO\") \n \t\t \t\t\t\t\t \t\t\t \t \t \t \t", "n=int(input())\r\np=int(input())\r\ni=0\r\nd=n\r\nwhile n<p:\r\n n=n*d\r\n i+=1\r\nif(n==p):\r\n print('YES\\n',i,sep='')\r\nelse:\r\n print('NO')\r\n", "# Problem 114A \r\n# A. Cifera\r\n# Time limit 2 s\r\n# Memory limit 256 Mb\r\n\r\nk = int(input())\r\nl = int(input())\r\nans = 0\r\ntemp = k\r\nwhile temp<l:\r\n\ttemp *= k\r\n\tans += 1\r\nif temp == l:\r\n\tprint('YES')\r\n\tprint(ans)\r\nelse:\r\n\tprint('NO')", "k,n=int(input()),int(input())\r\nfor i in range(40):\r\n if k**i==n:\r\n print('YES\\n',i-1)\r\n exit()\r\nprint('NO')", "from math import log\r\nc = 0\r\nn1 = int(input())\r\nn2 = int(input())\r\n\r\nwhile n2>n1:\r\n\tn2 = n2/n1\r\n\tc+=1\r\n\r\n\r\nif n2==n1:\r\n\tprint(\"YES\")\r\n\tprint(c)\r\nelse:\r\n\tprint(\"NO\")", "k = int(input())\r\nl = int(input())\r\nx = (k**i for i in range((l//k) + 2))\r\ny = next(x)\r\ni = 0\r\nwhile y <= l:\r\n\tif y == l:\r\n\t\tprint(\"YES\")\r\n\t\tprint(i - 1)\r\n\t\texit()\r\n\ti += 1\r\n\ty = next(x)\r\nprint(\"NO\")\r\n", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out.out\",'w')\r\nk=int(input())\r\nl=int(input())\r\nc=0\r\nx=l\r\nwhile x%k==0:\r\n\tx//=k\r\n\tc+=1\r\nif c and k**c==l:\r\n\tprint(\"YES\")\r\n\tprint(c-1)\r\nelse:\r\n\tprint(\"NO\")\t\r\n", "k=int(input())\r\nl=int(input())\r\ncount = 0\r\nwhile l%k == 0:\r\n\tcount += 1\r\n\tl //= k\r\nif l == 1:\r\n\tprint(\"YES\")\r\n\tprint(count-1)\r\nelse:\r\n\tprint(\"NO\")", "import math\r\na=int(input())\r\nb=int(input())\r\nfor i in range(35):\r\n if math.pow(a,i)<=b:\r\n if math.pow(a,i)==b:\r\n print(\"YES\")\r\n print(int(i)-1)\r\n break\r\n else:\r\n print(\"NO\")\r\n break;\r\n\r\n", "\r\nk = int(input())\r\n\r\nl = int(input())\r\n\r\nfor i in range(34):\r\n\tif k ** i > l:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\telse:\r\n\t\tif k **i == l:\r\n\t\t\tprint(\"YES\")\r\n\t\t\tprint(i - 1)\r\n\t\t\tbreak", "n = int(input())\nf = int(input())\n\nc = 1\nwhile n**c < f:\n c += 1\n\nprint(['NO', 'YES\\n'+str(c-1)][n**c == f])\n \t\t \t \t\t \t\t \t\t\t \t\t \t \t \t", "import sys,math\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn = int(input())\r\ntarget = int(input())\r\nnum,ind = 1,0\r\nwhile(num<target):\r\n num *= n\r\n ind += 1\r\nif num==target:\r\n print(\"YES\")\r\n print(ind-1)\r\nelse:\r\n print(\"NO\")", "k, l = int(input()), int(input())\r\ncur, ans = k, 0\r\n\r\nwhile cur < l:\r\n cur *= k\r\n ans += 1\r\nprint('NO' if cur != l else f\"YES\\n{ans}\")\r\n", "k=int(input())\r\nkk=int(input())\r\nd=-1\r\nc=0\r\nwhile kk>0:\r\n if kk==1:\r\n break\r\n else:\r\n if kk%k==0:\r\n d=d+1\r\n kk=kk//k\r\n else:\r\n c=-1\r\n break\r\nif c==-1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(d)", "a = int(input())\r\nb = int(input())\r\n\r\nt = -1\r\nwhile b != 1 and b % a == 0:\r\n b //= a\r\n t = t + 1\r\nif b == 1:\r\n print(\"YES\\n\" + str(t))\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input())\n\nl = int(input())\n\nres = 0\n\ngone = False\n\nwhile l > 1 and not gone:\n if l %k != 0:\n gone = True\n else:\n l/=k\n res+=1\n\n\nif gone:\n print(\"NO\")\n\nelse:\n print(\"YES\")\n\n print(res-1)", "def main():\r\n k = int(input())\r\n n = int(input())\r\n\r\n imp = 0\r\n mult = k\r\n while k < n:\r\n k *= mult\r\n imp += 1\r\n\r\n if k == n:\r\n print('YES')\r\n print(imp)\r\n else:\r\n print('NO')\r\n\r\nmain()", "a=int(input())\r\nb=int(input())\r\nmul=a \r\nt=0\r\ndef func(a,b,mul,t):\r\n if a>b:\r\n return -1\r\n if a==b:\r\n return t \r\n if a<b:\r\n a=a*mul\r\n t+=1\r\n return func(a,b,mul,t)\r\n \r\nans=func(a,b,mul,t) \r\nif ans==-1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\") \r\n print(ans)", "k, l = int(input()), int(input())\r\ne = 0\r\nwhile k ** e <= l + 1:\r\n e += 1\r\n if k ** e == l:\r\n print(\"YES\")\r\n print(e - 1)\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "l=int(input())\r\nk=int(input())\r\nif l==k:\r\n\tprint(\"YES\")\r\n\tprint(0)\r\n\texit()\r\nans=1\r\ncount=0\r\nwhile ans<k:\r\n\tans*=l\r\n\tcount+=1\r\nif ans==k:\r\n\tprint(\"YES\")\r\n\tprint(count-1)\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\nm=int(input())\r\nif m%n!=0:\r\n print('NO')\r\nelse:\r\n count=0\r\n flag=0\r\n while m/n!=1:\r\n if m%n==0:\r\n m=m//n\r\n count=count+1\r\n else:\r\n flag=1\r\n print('NO')\r\n break\r\n if flag==0:\r\n print('YES')\r\n print(count)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "import sys, os\r\nfrom collections import defaultdict\r\nfrom math import gcd\r\ninput = sys.stdin.readline\r\nread = lambda: list(map(int, input().strip().split()))\r\n\r\n\r\n\r\ndef main():\r\n k = int(input()); l = int(input())\r\n c = 0\r\n while l%k == 0:c += 1;l//=k\r\n if l == 1:\r\n print(\"YES\")\r\n print(c-1)\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n\r\n\"\"\"\r\n3 2\r\n1 1\r\n2 2\r\n\r\n\r\n\r\n\"\"\"", "k = int(input())\r\nd = int(input()) \r\ncounter =0\r\ni =0\r\nwhile k**(i) < d : \r\n i+=1\r\n counter +=1\r\nif k**(counter) == d: \r\n print(\"YES\")\r\n print(counter-1)\r\nelse: \r\n print('NO')\r\n", "n = int(input())\r\nk = int(input())\r\nt = -1\r\n\r\nwhile k!=1 and k%n==0:\r\n k=k/n\r\n t=t+1\r\nif k==1:\r\n print('YES \\n' + str(t) )\r\nelse:\r\n print('NO') \r\n", "a,b,n=int(input()),int(input()),1\r\nwhile a**n<b:\r\n n+=1\r\nif a**n==b:\r\n print(\"YES\"),print(n-1)\r\nelse:\r\n print(\"NO\")", "imp=-1 \r\nk=int(input())\r\nl=int(input())\r\nwhile l%k==0:\r\n l=l//k\r\n imp+=1\r\nif imp>=0 and l==1:\r\n print(\"YES\")\r\n print(imp)\r\nelse:\r\n print(\"NO\")", "l=int(input())\r\nk=int(input())\r\nla_count=-1\r\nwhile True:\r\n la_count +=1\r\n k/=l;\r\n if k%l!=0:\r\n break\r\nif la_count>=0 and k==1:\r\n print(\"YES\")\r\n print(la_count)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nk=int(input())\r\nf=1\r\ncount=int(0)\r\nwhile(1):\r\n if(k%n!=0):\r\n f=0\r\n break\r\n else:\r\n k=k/n\r\n count+=1\r\n if(k==1):\r\n break\r\nif(f==1):\r\n print(\"YES\")\r\n print(count-1)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nk=int(input())\r\nres=0\r\nwhile k%n==0:\r\n k//=n\r\n res+=1\r\nif k==1:\r\n print('YES')\r\n print(res-1)\r\nelse:\r\n print('NO')", "a=int(input())\r\nfrom math import *\r\nb=int(input())\r\nc=0\r\nwhile(b>a):\r\n\tb/=a\r\n\tc+=1\r\n\r\nif(a==b):\r\n\tprint(\"YES\")\r\n\tprint(c)\r\nelse:\r\n\tprint(\"NO\")", "from math import log\r\nn = int(input())\r\nl = int(input())\r\ns = int(log(l,n))\r\ny = s+1\r\nif n**s==l:\r\n print(\"YES\")\r\n print(s-1)\r\nelif n**y==l:\r\n print(\"YES\")\r\n print(y-1)\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nl=int(input())\r\ni=1\r\nflag=0\r\nwhile(True):\r\n x=pow(n,i)\r\n \r\n if x>l:\r\n break\r\n elif x==l:\r\n flag=1\r\n break\r\n else:\r\n i+=1\r\nif flag==1:\r\n print(\"YES\")\r\n print(i-1)\r\nelse:\r\n print(\"NO\")\r\n ", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-02 23:49:11\nLastEditTime: 2021-11-28 22:21:11\nDescription: Cifera\nFilePath: CF114A.py\n'''\n\n\ndef func():\n k, l = int(input()), int(input())\n for n in range(1, l):\n if k ** n == l:\n print(\"YES\")\n print(n - 1)\n return\n elif k ** n > l:\n break\n print(\"NO\")\n\n\nif __name__ == '__main__':\n func()\n", "k = int(input())\r\nl = int(input())\r\nbelongs = False\r\nfor i in range(l):\r\n if (k ** i) == l:\r\n belongs = True\r\n x = i\r\n break\r\n elif (k ** i) > l:\r\n break\r\n\r\nif belongs :\r\n print('YES')\r\n print(x-1)\r\nelse:\r\n print('NO')", "I=input\r\nk=int(I())\r\nl=int(I())\r\nr=1\r\nwhile k**r<l:r+=1\r\nprint(['NO','YES\\n'+str(r-1)][k**r==l])", "a=int(input())\r\nb=int(input())\r\nc=a\r\n\r\n\r\nif a==b:\r\n print(\"YES\")\r\n print(0)\r\nelse:\r\n \r\n for i in range(100000):\r\n a=a*c\r\n if a==b:\r\n print(\"YES\")\r\n print(i+1)\r\n break\r\n elif a>b:\r\n print(\"NO\")\r\n break\r\n", "import math\n\n\nclass CodeforcesTask114ASolution:\n def __init__(self):\n self.result = ''\n self.k = 0\n self.l = 0\n\n def read_input(self):\n self.k = int(input())\n self.l = int(input())\n\n def process_task(self):\n is_ = False\n re = 0\n for x in range(int(math.log(self.l, self.k)) + 2):\n if self.l == self.k ** x:\n re = x\n is_ = True\n break\n self.result = \"YES\\n{0}\".format(re - 1) if is_ else \"NO\"\n\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask114ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\nfrom functools import lru_cache\r\nimport cmath\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# sys.stdin = open('input.txt')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\ndef fc(n):\r\n ans = Counter()\r\n d = 2\r\n while d * d <= n:\r\n if n % d == 0:\r\n ans[d]+=1\r\n n //= d\r\n else:\r\n d += 1\r\n if n > 1:\r\n ans[n]+=1\r\n return ans\r\n\r\ndef ip(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n d = 3\r\n while d * d <= n and n % d != 0:\r\n d += 2\r\n return d * d > n\r\n\r\n\r\n@lru_cache(None)\r\ndef daa(n):\r\n ct = 0\r\n for x in range(1, int(pow(n, 0.5)) + 1):\r\n if n % x == 0:\r\n ct += 1\r\n if x != n // x:\r\n ct += 1\r\n return ct\r\nn=nt()\r\nk=nt()\r\np=fc(k)\r\nh=fc(n)\r\nans=set()\r\nfor x in p:\r\n if h[x]>0:\r\n if p[x]%h[x]==0:\r\n ans.add(p[x]//h[x])\r\n continue\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nif len(ans)>1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for x in ans:\r\n k=x\r\n print(k-1)", "k = int(input())\r\nl = int(input())\r\nif l%k ==0 :\r\n nada = True\r\n for i in range(1,32):\r\n if k**i == l:\r\n print(\"YES\")\r\n print(i-1)\r\n nada = False\r\n break\r\n if nada:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input())\r\nl = int(input())\r\nnum=k\r\nc=1\r\nflag=1\r\nwhile True:\r\n\tif num==l:\r\n\t\tbreak\r\n\telif num<l:\r\n\t\tnum = num*k\r\n\t\tc+=1\r\n\telse:\r\n\t\tflag=0\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(\"YES\")\r\n\tprint(c-1)\r\nelse:\r\n\tprint(\"NO\")", "import math\r\nk = int(input())\r\nl = int(input())\r\nc=-1\r\nwhile(l>1):\r\n if(l%k==0):\r\n l//=k\r\n c+=1\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\nprint(c)", "def verif(x,y):\r\n c=0\r\n while x%y==0:\r\n x=x//y\r\n c+=1\r\n if x!=1:\r\n return False\r\n else:\r\n return c,True\r\n \r\nk=int(input())\r\nl=int(input())\r\nres =verif(l,k)\r\nif res:\r\n print('YES')\r\n print(res[0]-1)\r\nelse:\r\n print('NO')\r\n \r\n \r\n\r\n \r\n\r\n\r\n5\r\n25\r\n", "n=int(input())\r\nl=int(input())\r\nk=-1\r\nwhile l%n==0:\r\n l//=n\r\n k+=1\r\nif l==1:print(\"YES\\n\",k)\r\nelse:print(\"NO\")", "k = int(input())\r\nl = int(input())\r\nimportance = 0\r\nflag = 0\r\nfor i in range(1,65):\r\n if k**i == l:\r\n flag = 1\r\n importance = i\r\n break\r\nif flag == 1:\r\n print(\"YES\")\r\n print(importance-1)\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\nm = 0\r\nwhile(l-1):\r\n if l%k==0 :\r\n l = l/k\r\n m += 1\r\n else:\r\n break\r\nif l == 1 : \r\n print(\"YES\")\r\n print(m-1)\r\nelse : print(\"NO\")", "import math\r\na=int(input())\r\nb=int(input())\r\ni=0\r\nx=a\r\nwhile (x<b):\r\n i+=1\r\n x=x*a\r\n # print(x) \r\nif(x==b):\r\n print(\"YES\")\r\n print(i)\r\nelse :\r\n print(\"NO\")\r\n \r\n ", "k=(int)(input())\r\nl=(int)(input())\r\ni=1\r\nn=0\r\nwhile(n<l):\r\n n=k**i\r\n i=i+1\r\nif(n==l):\r\n print(\"YES\")\r\n print(i-2)\r\nelif(n!=l):\r\n print(\"NO\")\r\n ", "k=int(input())\r\na=k\r\nl=int(input())\r\nans=0\r\nwhile(k<l):\r\n k*=a\r\n ans+=1\r\nif k==l:\r\n print(\"YES\")\r\n print(ans)\r\nelse:\r\n print(\"NO\")", "k=int(input())\nl=int(input())\ni=1\nflag=0\nwhile k**i<=l:\n if k**i==l:\n print(\"YES\")\n print(i-1)\n flag=1\n break\n else:\n i += 1\nif flag==0:\n print(\"NO\")", "#114a\nimport sys\ninput = sys.stdin.readline\n\nk = int(input())\nl = int(input())\n\ncnt, tmp = 0, k\nwhile l > tmp:\n tmp *= k\n cnt += 1\n\nif l == tmp:\n print(f'YES\\n{cnt}')\nelse:\n print(\"NO\")", "x = int(input())\r\ny = int(input())\r\nm = 0\r\nwhile x**m <= y:\r\n if(x**m == y):\r\n print(\"YES\")\r\n print(m-1)\r\n exit(0)\r\n else:\r\n m+=1\r\n\r\n\r\nprint(\"NO\")\r\n\r\n", "n=int(input())\r\nx=int(input())\r\nl=[n]\r\nfor c in range(40):\r\n\tl.append(l[-1]*n)\r\nif x in l:\r\n\tprint(\"YES\")\r\n\tprint(l.index(x))\r\nelse:\r\n\tprint(\"NO\")", "k, l = int(input()), int(input())\r\ni, cur = 0, k\r\nwhile cur < l:\r\n i += 1\r\n cur *= k\r\nif cur == l:\r\n print('YES')\r\n print(i)\r\nelse:\r\n print('NO')", "k = int(input())\nl = int(input())\ncur = k\nans = 0\nwhile cur < l:\n ans += 1\n cur *= k\nif cur == l:\n print(\"YES\")\n print(ans)\nelse:\n print(\"NO\")# 1698351759.1619253", "k=int(input())\r\nl=int(input())\r\ncount=0\r\nwhile l>=k:\r\n l/=k\r\n count+=1\r\nl*=k\r\ncount-=1\r\nif l==k:\r\n print(\"YES\")\r\n print(count)\r\nelse:\r\n print(\"NO\")\r\n", "k=int(input())\r\nl=int(input())\r\nn=0\r\nx=l\r\nif l<k:\r\n print('NO')\r\nelse:\r\n while x>=k :\r\n x=x/k\r\n n+=1\r\n if x==1 :\r\n print('YES')\r\n print(n-1)\r\n else:\r\n print('NO')\r\n", "from sys import *\r\n\r\nK = int(stdin.readline())\r\nc = K\r\nL = int(stdin.readline())\r\n\r\nf = False\r\nind = 0\r\nwhile K < L:\r\n K *= c\r\n ind += 1 \r\n\r\nif K == L:\r\n print(\"YES\")\r\n print(ind)\r\nelse:\r\n print(\"NO\")\r\n\r\n", "x=input(\"\")\r\ny=input(\"\")\r\nx=int(x)\r\nr = x\r\ny=int(y)\r\ni = 0\r\nwhile(x<y):\r\n x=x*r\r\n i = i +1\r\n\r\n#print(x)\r\nif(x == y):\r\n print(\"YES\")\r\n print(i)\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nb=int(input())\r\nc = -1\r\nwhile b%a==0:\r\n b = b/a\r\n c+=1\r\nif b == 1:\r\n print('YES')\r\n print(c)\r\nelse:\r\n print('NO')", "k=int(input())\r\nL=int(input())\r\nst,x=1,0\r\nwhile st<L:\r\n st*=k\r\n x+=1\r\nif st==L:\r\n print(\"YES\")\r\n print(x-1)\r\nelse:\r\n print(\"NO\")\r\n \r\n", "n = int(input())\nm = int(input())\nl = 0\nx = n\nwhile x<m:\n l += 1\n x *= n\n\nif x == m:\n print(\"YES\")\n print(l)\nelse:\n print(\"NO\")\n\n", "k, l, la = float(input()), float(input()), 0\r\nla = 0\r\n\r\n\r\ndef find_root(l, k):\r\n global la\r\n if l == k:\r\n return True\r\n if l % k != 0 or l < k * k:\r\n return False\r\n la += 1\r\n l /= k\r\n return find_root(l, k)\r\n\r\nif find_root(l, k):\r\n print('YES')\r\n print(la)\r\n\r\nelse:\r\n print('NO')\r\n", "nm = int(input())\r\nkl = int(input())\r\n\r\nt = -1\r\nwhile kl != 1 and kl % nm == 0:\r\n kl //= nm\r\n t += 1\r\nif kl == 1:\r\n print(\"YES\\n\" + str(t))\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\nitr = 0\r\nstatus =False\r\nn = k\r\n\r\nwhile k<=l:\r\n if k==l:\r\n status = True\r\n break\r\n k=k*n\r\n itr = itr +1\r\n\r\nif status:\r\n print('YES')\r\n print(itr)\r\nelse:\r\n print(\"NO\")", "num = int(input())\r\nnum2= int(input())\r\nit = 0\r\n\r\nwhile num2 >num:\r\n num2 /= num\r\n it+=1\r\nif num2 !=num:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(it)", "n = int(input())\r\nk = int(input())\r\n\r\nt = -1\r\nwhile k != 1 and k % n == 0:\r\n k //= n\r\n t += 1\r\nif k == 1:\r\n print(\"YES\\n\" + str(t))\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input())\nl = int(input())\nif l < k:\n print('NO')\nelse:\n cnt = 0\n init = k\n while k < l:\n cnt += 1\n k *= init\n if k > l:\n print('NO')\n elif k == l:\n print('YES')\n print(cnt)\n", "n = int(input())\r\nk = int(input())\r\np = n\r\ni = 0\r\nwhile (p<k) :\r\n p *= n\r\n i += 1\r\n\r\nif p == k :\r\n print('YES')\r\n print(i)\r\nelse :\r\n print('NO')", "k, l = int(input()), int(input())\nans = 1\nwhile k ** ans <= l:\n ans += 1\nans -= 1\nif l != k ** ans :\n print(\"NO\")\n\nelse:\n print(\"YES\\n%d\" % (ans - 1))", "k=int(input())\r\nl=int(input())\r\nr,t=0,k\r\nwhile t<l:\r\n\tr=r+1\r\n\tt=t*k\r\nif t==l:\r\n\tprint(\"YES\")\r\n\tprint(r)\r\nelse:\r\n\tprint(\"NO\")", "k = int(input())\r\nl = int(input())\r\na = 0\r\ns = False\r\nwhile k**a <= l:\r\n a +=1\r\n if k**a == l: \r\n s = True\r\n break\r\nif s: \r\n print(\"YES\")\r\n print(a-1)\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n", "import math\r\nk,l = [int(input()) for i in range(2)]\r\ni=math.floor(math.log(l,k)+0.5)\r\nprint('NO' if l!=(k**i) else 'YES\\n'+str(i-1))\r\n", "k = int(input())\r\nl = int(input())\r\n\r\ncnt = 0\r\nwhile l % k == 0:\r\n l //= k\r\n cnt += 1\r\n\r\nif l == 1:\r\n print(f\"YES\\n{cnt - 1}\")\r\nelse:\r\n print(\"NO\")", "k = int(input())\nl = int(input())\n\npc = k\ncounter = 0\nwhile pc < l:\n pc *= k\n counter += 1\nif pc == l:\n print(\"YES\")\n print(counter)\nelse:\n print(\"NO\")\n", "k = int(input())\nl = int(input())\nr = -1\nwhile l > 1:\n if l%k != 0:\n print('NO')\n break\n else:\n r += 1\n l //= k\nelse:\n print('YES')\n print(r)\n", "import math\r\nk = int(input())\r\nl = int(input())\r\nc = 1\r\np = k\r\nwhile(p<=l):\r\n\tif(p == l):\r\n\t\tprint('YES')\r\n\t\tprint(c-1)\r\n\t\tbreak\r\n\tp *= k\r\n\tc+=1\r\nif(p>l):\r\n\tprint('NO')\r\n", "a,b,n=int(input()),int(input()),1\nwhile a**n<b: n+=1\nif a**n==b: print(\"YES\"),print(n-1)\nelse: print(\"NO\")", "import math\r\nk = int(input())\r\nl = int(input())\r\nflag = 0\r\nxray = int(math.log(l) / math.log(k))\r\nfor i in range(xray + 2):\r\n if pow(k,i) == l:\r\n print(\"YES\")\r\n print(i-1)\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(\"NO\")\r\n ", "k=int(input())\r\nl=int(input())\r\ni=0\r\nwhile(l>1):\r\n l/=k\r\n i+=1\r\nif(l==1):\r\n print(\"YES\")\r\n print(i-1)\r\nelse:print(\"NO\")", "def main():\n k = int(input())\n l = int(input())\n x = -1\n while not l % k:\n x += 1\n l //= k\n if l == 1:\n print('YES')\n print(x)\n else:\n print('NO')\n\n\nif __name__ == '__main__':\n main()\n", "A,B,N=int(input()),int(input()),1\r\nwhile A**N<B: N+=1\r\nif A**N==B: \r\n print(\"YES\"),print(N-1)\r\nelse: \r\n print(\"NO\")", "n = int(input())\r\nk = int(input())\r\ns = 1\r\nwhile True:\r\n if n**s == k:\r\n print(\"YES\")\r\n print(s-1)\r\n break\r\n if n**s > k:\r\n print(\"NO\")\r\n break\r\n s += 1\r\n", "q = int(input())\r\nf = int(input())\r\n\r\ni = -1\r\nwhile f != 1 and f % q == 0:\r\n f //= q\r\n i += 1\r\nif f == 1:\r\n print(\"YES\\n\" + str(i))\r\nelse:\r\n print(\"NO\")", "petino = int(input())\r\nvvod = int(input())\r\nfor i in range(1, 32):\r\n if petino**i == vvod:\r\n print('YES')\r\n print(i - 1)\r\n break\r\nelse:\r\n print('NO')\r\n", "a=input().strip()\r\nb=input().strip()\r\na,b=int(a),int(b)\r\nc=0\r\nwhile 1:\r\n\tif a==b:\r\n\t\tprint(\"YES\")\r\n\t\tprint(c)\r\n\t\tbreak\r\n\tif b%a!=0:\r\n\t\tprint(\"NO\")\r\n\t\tbreak\r\n\tb//=a\r\n\tc+=1\r\n", "t=int(input())\r\np=t\r\nl=int(input())\r\nx=False\r\ncount=0\r\nwhile(True):\r\n if t==l:\r\n x=True\r\n count=count+1\r\n break\r\n count=count+1\r\n t=t*p\r\n if t>l:\r\n break\r\nif x==True:\r\n print(\"YES\")\r\n print(count-1)\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nnum = int(input())\r\nans = 0\r\nwhile num % k == 0:\r\n ans += 1\r\n num //= k\r\n\r\nif num != 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(ans-1)\r\n\r\n", "k=int(input())\r\nn=int(input())\r\nn1=k\r\nif(n<k):\r\n print(\"NO\")\r\nelse:\r\n power=1\r\n while(n1<n):\r\n n1=n1*k\r\n power+=1\r\n if(n1==n):\r\n print(\"YES\")\r\n print(power-1)\r\n else:\r\n print(\"NO\")", "from sys import stdin,stdout\r\n\r\nst=lambda:list(stdin.readline().strip())\r\nli=lambda:list(map(int,stdin.readline().split()))\r\nmp=lambda:map(int,stdin.readline().split())\r\ninp=lambda:int(stdin.readline())\r\npr=lambda n: stdout.write(str(n)+\"\\n\")\r\nfrom math import floor\r\nmod=1000000007\r\nINF= float('inf')\r\ndef solve():\r\n n=inp()\r\n l=inp()\r\n base=n\r\n c=1\r\n while base<=l:\r\n if base==l:\r\n pr('YES')\r\n pr(c-1)\r\n return \r\n base*=n\r\n c+=1\r\n pr('NO')\r\n \r\nfor _ in range(1):\r\n solve()\r\n", "import math\n\nk = int(input())\nl = int(input())\n# log_a = int(math.log(l, k))\nacc = k\nc = 0\nfound = False\nwhile acc <= l:\n if acc == l:\n found = True\n break\n else:\n acc *= k\n c += 1\n\nif found:\n print(\"YES\")\n print(c)\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\t\t", "k=int(input())\r\nl=int(input())\r\nf=0 \r\nz=1\r\ntemp=k\r\nwhile temp<=2**33:\r\n temp=k**z\r\n if temp==l:\r\n f=1 \r\n ans=z-1 \r\n break \r\n z+=1 \r\nif f: \r\n print('YES')\r\n print(ans)\r\nelse:\r\n print('NO')", "k = int(input())\r\nvaluev = int(input())\r\npower = 1\r\nfor i in range(1,valuev + pow(10, 5)):\r\n power = pow(k, i)\r\n if power == valuev:\r\n print(\"YES\")\r\n print(i - 1)\r\n break\r\n else:\r\n if power > valuev :\r\n print(\"NO\")\r\n break\r\n\r\n", "n = int(input())\r\nx = int(input())\r\n\r\ni = -1\r\ntemp = n\r\nwhile True:\r\n i += 1\r\n if x==temp:\r\n print(\"YES\")\r\n print(i)\r\n break\r\n elif temp > x:\r\n print(\"NO\")\r\n break\r\n temp = temp*n", "k = int(input())\r\nl = int(input())\r\n\r\ni = 0\r\nwhile k**i <= l:\r\n i+=1 \r\ni-=1 \r\nif k**i == l:\r\n print('YES')\r\n print(i-1)\r\nelse:\r\n print('NO')", "k=int(input())\r\nl=int(input())\r\nc=1\r\nif k==l:print(\"YES\");print(0);exit()\r\nwhile k**c<l:c+=1\r\nif k**c==l:print('YES');print(c-1)\r\nelse:print(\"NO\")", "n=int(input())\r\nl=int(input())\r\na=n\r\nc=0\r\nwhile(n!=l):\r\n if n<l:\r\n n=n*a\r\n c+=1\r\n else:\r\n break\r\nif l==n:\r\n print(\"YES\")\r\n print(c)\r\nelse:\r\n print(\"NO\")", "\r\n\r\nni = int(input())\r\nki = int(input())\r\n\r\nti = -1\r\nwhile ki != 1 and ki % ni == 0:\r\n ki //= ni\r\n ti += 1\r\nif ki == 1:\r\n print(\"YES\\n\" + str(ti))\r\nelse:\r\n print(\"NO\")", "a=int(input())\nb=int(input())\nr=0\nn=a\nwhile a<b:\n a=a*n\n r+=1\nif a==b:\n print(\"YES\")\n print(r)\nelse:\n print(\"NO\")\n\n \t\t \t \t\t\t \t \t\t \t \t", "k = int(input())\r\nl = int(input())\r\nnum = k\r\npower = 1\r\ncon = False\r\nwhile num<=l:\r\n if num == l:\r\n con = True\r\n break\r\n num *= k\r\n power += 1\r\nif con:\r\n print('YES')\r\n print(power-1)\r\nelse:\r\n print('NO')", "k=int(input())\r\nl=int(input())\r\nfor i in range(32):\r\n if k**i==l:\r\n break\r\nif k**i==l:\r\n print(\"YES\")\r\n print(i-1)\r\nelse:\r\n print(\"NO\")\r\n", "n, m = int(input()), int(input())\r\ncount, res = 0, n\r\nwhile res < m:\r\n res *= n\r\n count += 1\r\nif res == m:\r\n print(\"YES\")\r\n print(count)\r\nelse:\r\n print(\"NO\")\r\n", "from math import log\nfrom decimal import *\ngetcontext().prec = 6\nk = int(input())\nl = int(input())\n\nans = 0\nwhile(l>1 and l%k==0):\n l /= k\n ans += 1\nif l==1:\n print (\"YES\")\n print (ans-1)\nelse:\n print (\"NO\")\n", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n p=1\r\n for i in range(35):\r\n if(k**p==l):\r\n print('YES')\r\n return p-1\r\n p+=1\r\n return 'NO'\r\nk=int(input())\r\nl=int(input())\r\nprint(exe())", "k=int(input())\r\nl=int(input())\r\n# if int(l%k)==0:\r\n# print('YES')\r\n# x=0\r\n# while l>1:\r\n# l=int(l/k)\r\n# x+=1\r\n# print(x-1)\r\n# else:\r\n# print('NO')\r\ndef isPower (x, y): \r\n\r\n if (x == 1): \r\n return (y == 1) \r\n pow = 1\r\n\r\n while (pow < y): \r\n pow = pow * x\r\n \r\n return (pow == y)\r\nif isPower(k,l):\r\n print('YES')\r\n x=0\r\n while l>1:\r\n l=int(l/k)\r\n x+=1\r\n print(x-1)\r\nelse:\r\n print('NO')", "import math;x=int(input(\"\"));y=int(input(\"\"));s=round(math.log(y,x))\r\nif((x**s == y)):print(\"YES\");print(s-1)\r\nelse:print(\"NO\")", "k = int(input())\r\nl = int(input())\r\ncnt = 0\r\nwhile l%k==0:\r\n cnt += 1\r\n l //= k\r\nif l==1:\r\n print(\"YES\")\r\n print(cnt-1)\r\nelse:\r\n print(\"NO\")", "\r\nimport math\r\na=int(input())\r\nb=int(input())\r\nz=math.log(b,a)\r\nprint('YES\\n'+str(int(z)-1) if int(z)==z or z==3.0000000000000004 else 'NO')", "a = int(input())\r\nb = int(input())\r\nc = 0\r\nx = a\r\nwhile a*x <= b:\r\n c+=1\r\n a*=x\r\n\r\n\r\nif a == b:\r\n print(\"YES\\n\" , c)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nk=int(input())\r\nt=-1\r\nwhile k!=1 and k%n==0:\r\n k //= n\r\n t += 1\r\nif k == 1:\r\n print(\"YES\\n\" + str(t))\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\ni = 0\r\n\r\nwhile l % k == 0:\r\n l = int(l / k)\r\n i += 1\r\n\r\nif l == 1:\r\n print(\"YES\")\r\n print(i - 1)\r\nelse:\r\n print(\"NO\")\r\n", "k = int(input())\nl = int(input())\nn = -1\nwhile l%k==0:\n l//=k\n n+=1\nif n >= 0 and l == 1:\n print('YES')\n print(n)\nelse:\n print('NO')\n\t \t\t \t\t \t \t \t \t\t\t \t\t\t", "I=input\r\nk=int(I())\r\nl=int(I())\r\ns=1\r\nwhile k**s<l: s+=1\r\nprint(['NO','YES\\n'+str(s-1)][k**s==l])", "n = int(input())\r\nx = int(input())\r\n\r\nans = 0\r\nwhile x > 1:\r\n if x % n != 0:\r\n break\r\n x //= n\r\n ans += 1\r\n\r\nif x == 1:\r\n print(\"YES\")\r\n print(ans - 1)\r\nelse:\r\n print(\"NO\")", "k = int(input())\r\nl = int(input())\r\n\r\nb = k\r\np = 0\r\n\r\nif k==l:\r\n print('YES')\r\n print(0)\r\nelse:\r\n while b < l:\r\n b = b * k\r\n p = p + 1\r\n if b==l:\r\n print('YES')\r\n print(p)\r\n else:\r\n print('NO')\r\n", "n=int(input())\r\nl=int(input())\r\nk=0\r\nwhile l%n==0 and l!=n :\r\n l=l//n\r\n k=k+1\r\nif l%n!=0 :\r\n print('NO')\r\nelse :\r\n print('YES')\r\n print(k)\r\n", "k=int(input())\r\nx=k\r\ncnt=0\r\nl=int(input())\r\nwhile x<l :\r\n x*=k\r\n cnt+=1\r\nif x==l :\r\n print(\"YES\")\r\n print(cnt)\r\nelse :\r\n print(\"NO\")", "def f(x,y):\r\n if y==x:return True\r\n if y%x:return False\r\n return f(x,y//x)\r\ndef g(x,y):\r\n if y==x:return 0\r\n return 1+g(x,y//x)\r\na=int(input())\r\nb=int(input())\r\nprint('YES\\n'+str(g(a,b))if f(a,b)else'NO')\r\n", "k,l=int(input()),int(input())\r\nx,t=0,k\r\nwhile t<l:\r\n\tt*=k\r\n\tx+=1\r\n\r\nif t==l:\r\n\tprint(\"YES\")\r\n\tprint(x)\r\nelse:\r\n\tprint(\"NO\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nk = int(input())\r\nl = int(input())\r\nx = k\r\nans = \"NO\"\r\nc = 0\r\nwhile x <= l:\r\n if x == l:\r\n ans = \"YES\"\r\n break\r\n c += 1\r\n x *= k\r\nprint(ans)\r\nif ans == \"YES\":\r\n print(c)", "n =int(input())\nm = int(input())\ni=0\nval =n\nwhile(val<=m):\n if(val==m):\n print(\"YES\")\n print(i)\n exit()\n val *=n\n i+=1\n\nprint(\"NO\")\n", "k = int(input())\r\nl = int(input())\r\nfor x in range(32):\r\n if l == k * pow(k,x):\r\n print('YES')\r\n print(x)\r\n break\r\n if l < k * pow(k,x):\r\n print('NO')\r\n break\r\n", "# python 3\n\"\"\"\n\"\"\"\n\n\ndef cifera(k_int: int, l_int: int) -> None:\n curr = l_int\n la_count = -1\n while True:\n if curr % k_int == 0:\n la_count += 1\n curr = curr // k_int\n if curr == 1:\n print(\"YES\")\n print(la_count)\n break\n else:\n print(\"NO\")\n break\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n k = int(input())\n l = int(input())\n cifera(k, l)\n", "k = int(input())\r\nm = int(input())\r\n\r\nleft = 1\r\nright = 50\r\nwhile right-left > 1:\r\n middle = (left+right) // 2\r\n if k**middle <= m:\r\n left = middle\r\n else:\r\n right = middle\r\n\r\nif k**left == m:\r\n print('YES\\n{}'.format(left-1))\r\nelse:\r\n print('NO')", "x=int(input())\r\ny=int(input())\r\nc=0\r\nwhile(y%x==0):\r\n y=y//x\r\n c=c+1\r\nif(y>1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(c-1)", "k = int(input())\nl = int(input())\n\nn = 0\nwhile k ** n <= l:\n if (k ** n == l):\n print(\"YES\")\n print(n - 1)\n exit()\n n += 1\nprint(\"NO\")\n", "k = int(input())\nn = int(input())\nt = k\nc = 0\nwhile t < n:\n t *= k\n c += 1\n\nif t == n:\n print('YES')\n print(c)\nelse:\n print('NO')\n\n", "if __name__ == '__main__':\r\n k = int(input())\r\n l = int(input())\r\n if l % k == 0:\r\n num = 0\r\n while l > k and l % k == 0:\r\n num += 1\r\n l /= k\r\n if l == k:\r\n print('YES')\r\n print(num)\r\n else:\r\n print('NO')\r\n else:\r\n print('NO')\r\n", "k=int(input())\r\nl=int(input())\r\nr=0\r\nj=2\r\nt=k\r\nwhile(k<l):\r\n k=t**j\r\n r=r+1\r\n j=j+1\r\nif(k==l):\r\n print(\"YES\")\r\n print(r)\r\nelse:\r\n print(\"NO\")", "k=int(input())\r\nl=int(input())\r\ni=0\r\nwhile True:\r\n if k**i==l:\r\n print('YES\\n'+str(i-1))\r\n break\r\n elif k**i>l:\r\n print('NO')\r\n break\r\n i+=1\r\n", "x = int(input())\r\ny = int(input())\r\ncount = 0\r\nchecker = 0\r\n\r\nfor i in range(1000):\r\n if x ** i == y:\r\n count = i\r\n print(\"YES\")\r\n print(count - 1)\r\n break\r\n elif x ** i > y:\r\n print(\"NO\")\r\n break\r\n", "import math\r\n\r\nk = int(input())\r\nl = int(input())\r\nx = math.log(l, k)\r\ny = round(x)\r\nif k ** y == l:\r\n print('YES')\r\n print(y - 1)\r\nelse:\r\n print('NO')\r\n", "a = int(input())\r\nb = int(input())\r\ni = 0\r\nc = a\r\nwhile a < b:\r\n a *= c\r\n i += 1\r\nif a == b:\r\n print('YES')\r\n print(i)\r\nelse:\r\n print('NO')\r\n\r\n", "n=int(input())\r\nm=int(input())\r\nx=1;cnt=0\r\nwhile x<m:\r\n x*=n\r\n cnt+=1\r\nif x==m:\r\n print('YES')\r\n print(cnt-1)\r\nelse:\r\n print('NO')", "n = int(input())\r\n\r\nx = int(input())\r\n\r\ny = n\r\ncount = 0\r\n\r\nwhile y < x :\r\n y = y * n\r\n count +=1\r\n\r\nif y == x :\r\n print('YES')\r\n print(count)\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n", "a=int(input())\r\nb=int(input())\r\ni=1\r\nwhile a**i<=b:\r\n\tif a**i==b:\r\n\t\tbreak\r\n\ti+=1\r\nif a**i==b:\r\n\tprint(\"YES\")\r\n\tprint(i-1)\r\nelse:\r\n\tprint(\"NO\")", "k = int(input())\r\nl = int(input())\r\n\r\nc=0\r\nwhile(l>1 and l%k==0):\r\n l = l//k\r\n #print(l)\r\n c+=1\r\nif(l==1):\r\n print('YES')\r\n print(c-1)\r\nelse:\r\n print(\"NO\")", "a=int(input())\r\nb=int(input())\r\n\r\ncount=-1\r\nwhile b%a==0:\r\n count=count+1\r\n b=b//a\r\nif b==1:\r\n print(\"YES\")\r\n print(count)\r\nelse:\r\n print(\"NO\")", "\r\nk = int(input())\r\nl = int(input())\r\n\r\ncount = 0\r\nwhile l%k==0:\r\n l//=k\r\n count += 1\r\n\r\nif l==1:\r\n print(\"YES\")\r\n print(count-1)\r\nelse:\r\n print(\"NO\")", "k=int(input())\r\nl=int(input())\r\n\r\ni=0\r\n\r\nwhile k**i<l:\r\n\ti+=1\r\n\r\nif l==k**i:\r\n\tprint(\"YES\")\r\n\tprint(i-1)\r\nelse:\r\n\tprint('NO')", "k=int(input())\r\nl=int(input())\r\ncount=-1\r\nif k!=l:\r\n while l % k == 0:\r\n l /= k\r\n count += 1\r\n if count > 0 and l == 1:\r\n print(\"YES\")\r\n print(count)\r\n else:\r\n print(\"NO\")\r\n\r\nelif k==l:\r\n print(\"YES\")\r\n print(0)", "k=int(input())\r\nl=int(input())\r\ni=1\r\nwhile 1:\r\n if pow(k, i)>l:\r\n print(\"NO\")\r\n break\r\n elif pow(k, i)==l:\r\n print(\"YES\", i-1, sep='\\n')\r\n break\r\n i+=1", "k = int(input())\r\nl = int(input())\r\nb = 0\r\nfor i in range(32):\r\n if l == k**(i+1):\r\n print(\"YES\")\r\n print(i)\r\n b = 1\r\n break\r\nif b == 0:\r\n print(\"NO\")", "\ndef solve(k,l) :\n ans=0\n val=k\n while val <= l :\n if val==l: \n return f'YES\\n{ans}'\n val=val*k\n ans+=1\n return 'NO'\n\n\n\n\n\n\n\n\n \n\n \nk=int(input())\nl=int(input())\n\nprint(solve(k,l))\n\n\n\n'''\nn,m= [int(x) for x in input().split()]\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n'''\n'''\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "k = int(input())\nl = int(input())\nc = -1\nwhile l != 1 and l % k == 0:\n l //= k\n c += 1\nif l == 1:\n print('YES')\n print(c)\nelse:\n print('NO')\n \n", "import math\r\na=int(input())\r\nb=int(input())\r\n\r\nd=0\r\nwhile(b>1):\r\n b/=a\r\n d+=1\r\nif b==1:\r\n print(\"YES\")\r\n print(d-1)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nm=int(input())\r\nimport math\r\nflag=0\r\nfor i in range(0,32):\r\n a=math.pow(n,i)\r\n if(int(a)==m):\r\n c=i\r\n flag=1\r\n break\r\nif(flag==1):\r\n print('YES')\r\n print(c-1)\r\nelse:\r\n print('NO')", "n = int(input())\r\nm = int(input())\r\n\r\na = n\r\ncnt = 0\r\nwhile n < m:\r\n cnt += 1\r\n n *= a\r\n\r\nif n == m:\r\n print(\"YES\")\r\n print(cnt)\r\nelse:\r\n print(\"NO\")\r\n", "from math import log\r\nx=int(input())\r\ny=int(input())\r\nn=1\r\nif x==1:\r\n\tprint('NO')\r\nelse:\r\n\twhile 1:\r\n\t\tif (x**n)==y:\r\n\t\t\tbreak\r\n\t\telif (x**n)>y:\r\n\t\t\tn=-1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tn+=1\r\n\tif n==-1:\r\n\t\tprint('NO')\r\n\telse:\r\n\t\tprint('YES')\r\n\t\tprint(n-1)", "k= int(input())\r\nl=int(input())\r\nc=1\r\nbool = False\r\nwhile(k**c<=l):\r\n if(k**c==l):\r\n bool=True\r\n break\r\n c+=1\r\nif(bool==False):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(c-1)\r\n \r\n ", "def find_importance(k, l):\r\n importance = 0\r\n\r\n while l % k == 0 and l > 1:\r\n l //= k\r\n importance += 1\r\n\r\n return importance if l == 1 else 0\r\n\r\ndef main():\r\n k = int(input())\r\n l = int(input())\r\n\r\n importance = find_importance(k, l)\r\n if importance > 0:\r\n print(\"YES\")\r\n print(importance - 1)\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "k = int(input())\r\nl = int(input())\r\ni=k\r\ncount =0\r\nwhile i<l:\r\n i = i*k\r\n count = count+1\r\nif i==l:\r\n print(\"YES\")\r\n print(count)\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nnumber=int(input())\r\nc=0\r\nfor i in range(1,32):\r\n if number==n**i:\r\n print(\"YES\")\r\n c=1\r\n print(f\"{i-1}\")\r\n break\r\nif c!=1:\r\n print(\"NO\")", "c=0\r\ndef r():\r\n k=int(input())\r\n l=int(input())\r\n t=k\r\n while(t<=l):\r\n if t==l:\r\n return\"YES\"\r\n global c\r\n c+=1\r\n t*=k\r\n c=-1\r\n return\"NO\"\r\nprint(r())\r\nif c!=-1:print(c)", "k = x = int(input())\r\nl = int(input())\r\ncnt = 0\r\nb = False\r\n\r\nwhile x <= l:\r\n if x == l:\r\n b = True\r\n break\r\n x *= k\r\n cnt += 1\r\nif b:\r\n print('YES')\r\n print(cnt)\r\nelse:\r\n print('NO')", "k, l = int(input()), int(input())\n\nx, t = 0, k\nwhile t < l:\n\tt *= k\n\tx += 1\n\nif t == l:\n\tprint(\"YES\")\n\tprint(x)\nelse:\n\tprint(\"NO\")\n", "import math\r\nk = int(input())\r\nl= int(input())\r\nfor i in range(1,33):\r\n if math.pow(k,i) == l:\r\n print('YES')\r\n print(i-1)\r\n break\r\nelse:\r\n print('NO') \r\n# n = math.log(l)/math.log(k)\r\n# if n %1 == 0:\r\n# print('YES')\r\n# print(int(n-1))\r\n# else:\r\n# print('NO') \r\n" ]

[ "from typing import List\n\ndef prettiest_permutation(n :int, arr: List[int], s: List[str]) -> List[int]:\n par=[0]*310\n rank=[0]*310\n def init_union_find(V):#initial state\n for i in range(V):\n par[i]=i\n rank[i]=0\n def find(x):#where the root\n if par[x]==x:\n return x\n else:\n par[x]=find(par[x])\n return par[x]\n def unite(x,y):#x and y unite\n x=find(x)\n y=find(y)\n if x==y:\n return\n if rank[x]<rank[y]:\n par[x]=y\n else:\n par[y]=x\n if(rank[x] == rank[y]): rank[x] += 1\n \n init_union_find(310)\n edge=[0]*310\n node=[0]*310\n\n uv=[]\n for i in range(n):\n for j in range(n):\n if s[i][j]=='1':\n uv.append([i,j])\n for u,v in uv:\n unite(u,v)\n\n for i in range(len(arr)):\n for j in range(i+1,len(arr)):\n if arr[i]>arr[j] and find(i)==find(j):\n arr[i], arr[j]=arr[j], arr[i]\n return arr\n\nn=int(input())\np=list(map(int, input().split()))\narr = []\nfor i in range(n):\n s=str(input())\n arr.append(s)\nans = prettiest_permutation(n, p, arr)\nprint (\" \".join(map(str,ans)))\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nd={i:[] for i in range(n)}\r\nfor i in range(n):\r\n s=str(input())\r\n for j in range(n):\r\n if s[j]=='1':\r\n d[i].append(j)\r\n\r\n\r\ndef ss(node):\r\n v[node]=1\r\n pos.append(node)\r\n for child in d[node]:\r\n if v[child]==0:\r\n ss(child)\r\n \r\n\r\nv=[0 for _ in range(n)]\r\nfor i in range(n):\r\n if v[i]==0:\r\n pos=[]\r\n ss(i)\r\n t=[]\r\n for ind in pos:\r\n t.append(l[ind])\r\n t=sorted(t)\r\n pos=sorted(pos)\r\n # print(t)\r\n for a in range(len(t)):\r\n l[pos[a]]=t[a]\r\n \r\nprint(*l)\r\n ", "from collections import defaultdict\r\n\r\n\r\nn = int(input())\r\n\r\nf = list(range(n))\r\ndef find(x):\r\n if f[x] != x: f[x] = find(f[x])\r\n return f[x]\r\ndef union(x, y):\r\n f[find(x)] = find(y)\r\n\r\na = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n t = input()\r\n for j in range(n):\r\n if t[j] == '1': union(i, j)\r\n\r\nmp = defaultdict(list)\r\nfor i in range(n): mp[find(i)].append(i)\r\n\r\nans = [0]*n\r\nfor k in mp:\r\n mp[k].sort()\r\n vals = sorted(a[i] for i in mp[k])\r\n i = 0\r\n for p in mp[k]:\r\n ans[p] = vals[i]\r\n i += 1\r\n\r\nprint(*ans)", "n = int(input())\r\np = list(map(int, input().split()))\r\nA = [list(map(int, input())) for _ in range(n)]\r\n\r\nparent = list(range(n))\r\nrank = [0] * n\r\n\r\ndef find(x):\r\n if parent[x] != x:\r\n parent[x] = find(parent[x])\r\n return parent[x]\r\n\r\ndef union(x, y):\r\n x_root = find(x)\r\n y_root = find(y)\r\n if x_root == y_root:\r\n return\r\n if rank[x_root] < rank[y_root]:\r\n parent[x_root] = y_root\r\n elif rank[x_root] > rank[y_root]:\r\n parent[y_root] = x_root\r\n else:\r\n parent[y_root] = x_root\r\n rank[x_root] += 1\r\n\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if A[i][j] == 1:\r\n union(i, j)\r\n\r\ngroups = {}\r\nfor i in range(n):\r\n root = find(i)\r\n if root not in groups:\r\n groups[root] = []\r\n groups[root].append(p[i])\r\n\r\nfor group in groups.values():\r\n group.sort()\r\n\r\nans = [0] * n\r\nused = [False] * n\r\nfor i in range(n):\r\n root = find(i)\r\n if not used[root]:\r\n used[root] = True\r\n j = 0\r\n for k in range(n):\r\n if find(k) == root:\r\n ans[k] = groups[root][j]\r\n j += 1\r\n\r\nprint(*ans)", "import sys, functools, bisect, collections, string\r\nfrom heapq import *\r\ninput = sys.stdin.readline\r\n\r\nrs = lambda: input().strip()\r\nri = lambda: int(input())\r\nrmi = lambda: map(int, input().split())\r\nra = lambda: [int(x) for x in input().split()]\r\n\r\nINF = 10**18\r\nMOD = 10**9+7\r\n\r\nclass DSU:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.rank = [0] * n\r\n \r\n def find(self, x):\r\n if self.parent[x] != x:\r\n self.parent[x] = self.find(self.parent[x])\r\n return self.parent[x]\r\n \r\n def union(self, x, y):\r\n x_root = self.find(x)\r\n y_root = self.find(y)\r\n \r\n if x_root == y_root:\r\n return\r\n \r\n if self.rank[x_root] < self.rank[y_root]:\r\n self.parent[x_root] = y_root\r\n elif self.rank[x_root] > self.rank[y_root]:\r\n self.parent[y_root] = x_root\r\n else:\r\n self.parent[y_root] = x_root\r\n self.rank[x_root] += 1\r\n\r\n\r\n#def solve():\r\n \r\n \r\n \r\n \r\ntest_case = 1\r\nfor _ in range(test_case):\r\n n = ri()\r\n A = ra()\r\n \r\n uf = DSU(n)\r\n for u in range(n):\r\n tmp = rs()\r\n for v in range(n):\r\n if tmp[v] == '1':\r\n uf.union(u, v)\r\n \r\n mp = collections.defaultdict(list)\r\n for u in range(n):\r\n mp[uf.find(u)].append(A[u])\r\n #print(mp)\r\n for v in mp.values():\r\n v.sort(reverse = True)\r\n \r\n ans = [0] * n\r\n for u in range(n):\r\n pu = uf.find(u)\r\n A[u] = mp[pu].pop() \r\n \r\n print(*A)", "n = int(input())\r\nt = list(map(int, input().split()))\r\na = [input() for i in range(n)]\r\nu = [0] * n\r\ndef dfs(i):\r\n p.append(i)\r\n u[i] = 1\r\n for j in range(n):\r\n if a[i][j] == '1' and not u[j]:\r\n dfs(j)\r\nfor i in range(n):\r\n if not u[i]:\r\n p = []\r\n dfs(i)\r\n k = [t[i] for i in p]\r\n p.sort()\r\n k.sort()\r\n for i, j in enumerate(p):\r\n t[j] = k[i]\r\nprint(' '.join(map(str, t)))", "import gc\r\nimport itertools\r\nimport math\r\nimport sqlite3\r\nfrom collections import Counter, deque, defaultdict\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\nfrom decimal import Decimal\r\nimport threading\r\nfrom heapq import *\r\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 _next(c, a1, a2):\r\n if a1 > a2:\r\n a1, a2 = a2, a1\r\n if c + 1 != a1 and c + 1 != a2:\r\n return c + 1\r\n elif c + 2 != a2:\r\n return c + 2\r\n else:\r\n return c + 3\r\n\r\n\r\ndef main():\r\n n = II()\r\n p = I()\r\n idxing = [-1] * (n + 1)\r\n for i in range(n):\r\n idxing[p[i]] = i\r\n\r\n matrix = [IS() for _ in range(n)]\r\n indexes = set(range(n))\r\n while indexes:\r\n idx = indexes.pop()\r\n keys = [idx]\r\n values = [p[idx]]\r\n queue = deque([idx])\r\n while queue:\r\n idx = queue.pop()\r\n for i in range(n):\r\n if matrix[idx][i] == '1' and i in indexes:\r\n queue.append(i)\r\n indexes.remove(i)\r\n values.append(p[i])\r\n keys.append(i)\r\n values.sort()\r\n keys.sort()\r\n for i in range(len(keys)):\r\n p[keys[i]] = values[i]\r\n print(*p)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "from collections import deque\r\n\r\ndef bfs(v):\r\n q = deque([v])\r\n vis[v] = 1\r\n reg = [v]\r\n while q:\r\n vertex = q.popleft()\r\n for next in gr[vertex]:\r\n if not vis[next]:\r\n q.append(next)\r\n reg.append(next)\r\n vis[next] = 1\r\n return reg\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\ngr = [[] for i in range(n+1)]\r\nfor i in range(1, n+1):\r\n s = input()\r\n for j in range(1, n+1):\r\n if s[j-1] == '1':\r\n gr[i].append(j)\r\n\r\n# for i in range(1, n+1):\r\n# print(i, gr[i])\r\n\r\nregions = []\r\nvis = [0 for i in range(n+1)]\r\nfor i in range(1, n+1):\r\n if vis[i]:\r\n continue\r\n regions.append(bfs(i))\r\n\r\nfor i in range(len(regions)):\r\n indeces = []\r\n vals = []\r\n for j in regions[i]:\r\n vals.append(a[j-1])\r\n indeces.append(j-1)\r\n indeces.sort()\r\n vals.sort()\r\n\r\n for k in range(len(indeces)):\r\n a[indeces[k]] = vals[k]\r\n\r\n\r\nprint(*a)", "n = int(input())\r\np = [int(x) for x in input().split()]\r\nadj = [[] for x in range(n+1)]\r\nfor x in range(1,n+1):\r\n\ttemp = input()\r\n\ti=1\r\n\twhile i<n:\r\n\t\tif temp[i-1]=='1':\r\n\t\t\tadj[x].append(i)\r\n\t\t\tadj[i].append(x)\r\n\t\ti+=1\r\n\r\n\r\nans = [0 for x in range(n)]\r\ncomponent_index = [-1 for _ in range(n + 1)]\r\ndef dfs(u, c):\r\n\tcomponent_index[u] = c\r\n\tfor v in adj[u]:\r\n\t\tif component_index[v] == -1:\r\n\t\t\tdfs(v, c)\r\n\r\nnum_components = 0\r\nfor u in range(1, n + 1):\r\n\tif component_index[u] == -1:\r\n\t\tdfs(u, num_components)\r\n\t\tnum_components += 1\r\n\r\nswappable = [[] for x in range(num_components)]\r\nperms = [[] for x in range(num_components)]\r\ni=0\r\nwhile i<n+1:\r\n\tif component_index[i]!=-1:\r\n\t\tswappable[component_index[i]].append(i)\r\n\t\tperms[component_index[i]].append(p[i-1])\r\n\ti+=1\r\n\r\nfor x in perms:\r\n\tx = x.sort()\r\ni=0\r\nwhile i<num_components:\r\n\tj=0\r\n\twhile j<len(swappable[i]):\r\n\t\tans[swappable[i][j]-1] = perms[i][j]\r\n\t\tj+=1\r\n\ti+=1\r\nprint(*ans)", "from collections import deque\r\ndef connected_components(graph):\r\n seen = set()\r\n for root in range(1, len(graph)):\r\n if root not in seen:\r\n seen.add(root)\r\n component = []\r\n queue = deque([root])\r\n while queue:\r\n node = queue.popleft()\r\n component.append(node)\r\n for neighbor in graph[node]:\r\n if neighbor not in seen:\r\n seen.add(neighbor)\r\n queue.append(neighbor)\r\n yield component\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\nadj = [[] for x in range(n+1)]\r\nfor x in range(n):\r\n a = input()\r\n for y in range(n):\r\n if a[y] == '1':\r\n adj[x+1].append(y+1)\r\nans = [0 for x in range(n)]\r\ncc = list(connected_components(adj))\r\nfor y in cc:\r\n y.sort()\r\n temp = []\r\n for x in y:\r\n temp.append(arr[x-1])\r\n temp.sort()\r\n for x in range(len(y)):\r\n ans[y[x] - 1] = temp[x]\r\nprint(*ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\ngraph=[[] for _ in range(n)]\r\nfor i in range(n):\r\n s=input()\r\n for j in range(n):\r\n if s[j]=='1':\r\n graph[i].append(j)\r\n graph[j].append(i)\r\n\r\nvis=[False]*n \r\nindex=[]\r\nvalue=[]\r\ndef dfs(i):\r\n vis[i]=True\r\n index.append(i)\r\n value.append(a[i])\r\n for g in graph[i]:\r\n if not vis[g]:\r\n dfs(g)\r\n\r\nfor i in range(n):\r\n if not vis[i]:\r\n dfs(i)\r\n \r\n value.sort()\r\n index.sort()\r\n \r\n for j in range(len(value)):\r\n a[index[j]]=value[j]\r\n value=[]\r\n index=[]\r\nprint(*a)\r\n \r\n\r\n", "# import string\r\n# from sys import setrecursionlimit\r\n# setrecursionlimit(300000)\r\n\r\n# def lcs(a, b, m, n):\r\n# if m==0 or n==0:\r\n# return 0\r\n# if record[m][n] != -1:\r\n# return record[m][n]\r\n# if a[m-1] == b[n-1]:\r\n# record[m][n] = lcs(a, b, m-1, n-1) + 1\r\n# return record[m][n]\r\n# else:\r\n# record[m][n] = max(lcs(a, b, m-1, n), lcs(a, b, m, n-1))\r\n# return record[m][n]\r\n\r\n\r\n# n1 = int(input())\r\n# a = list(map(int, input().split()))\r\n# n2 = int(input())\r\n# b = list(map(int, input().split()))\r\n# record = [ [-1 for i in range(n2+1)] for j in range(n1+1)]\r\n# print(lcs(a, b, n1, n2))\r\n\r\n#print(\"YNEOS\"[((n%2<1 or d+n>t) if d%2 else d>t)::2])\r\n\r\n#open(0) is sys.stdin \r\n#So [*open(0)] is telling python to put every line of stdin into a list.\r\n#(s,n),*a=[[*map(int,z.split())]for z in open(0)]\r\n\r\n\r\ndef dfs(v):\r\n pos.append(v)\r\n used[v] = True\r\n for g in range(n):\r\n if int(s[v][g]) and not used[g]:\r\n dfs(g)\r\n \r\nn = int(input())\r\np = list(map(int, input().split()))\r\ns = [input() for i in range(n)]\r\nused = [False] * n\r\nfor j in range(n):\r\n if not used[j]:\r\n pos = []\r\n dfs(j)\r\n values = [p[i] for i in pos]\r\n pos.sort()\r\n values.sort()\r\n for (i, po) in enumerate(pos):\r\n p[po] = values[i]\r\nprint(' '.join([str(x) for x in p]))", "from collections import deque\r\n\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\n\r\na = []\r\nfor _ in range(n):\r\n a += [list(map(int, input()))]\r\n\r\n\r\nv = [0] * n\r\ncl = []\r\nfor i, val in enumerate(v):\r\n if v[i]:\r\n continue\r\n d = deque([i])\r\n cl += [deque([i])]\r\n while d:\r\n cu = d.pop()\r\n v[cu] = 1\r\n for j in range(n):\r\n if a[cu][j] and not v[j]:\r\n d.append(j)\r\n cl[-1].append(j)\r\n v[j] = 1\r\n\r\nans = [0] * n\r\nsocl = []\r\nfor i in cl:\r\n li = []\r\n for j in i:\r\n li += [p[j]]\r\n socl += [deque(sorted(li))]\r\n for j in sorted(i):\r\n ans[j] = socl[-1].popleft()\r\n\r\nprint(*ans)\r\n", "class DSU:\n\n\tdef __init__(self, n):\n\t\tself.dsu = [i for i in range(n)]\n\t\tself.weights = [0] * n \n\n\tdef find(self, u):\n\t\tif u == self.dsu[u]:\n\t\t\treturn u\n\t\tself.dsu[u] = self.find(self.dsu[u])\n\t\treturn self.dsu[u]\n\n\tdef union(self, u, v):\n\t\tu = self.find(u)\n\t\tv = self.find(v)\n\t\tif u!=v:\n\t\t\tif self.weights[u] < self.weights[v]:\n\t\t\t\tu, v = v, u\n\t\t\tself.dsu[v] = u \n\t\t\tif self.weights[u] == self.weights[v]:\n\t\t\t\tself.weights[u] += 1\n\nn = int(input())\np = [int(x) for x in input().split()]\ndsu = DSU(n)\n\nfor i in range(n):\n\tline = input()\n\tfor j in range(n):\n\t\tif line[j] == '1':\n\t\t\tdsu.union(i, j)\n\ncomponents = {}\nfor i in range(n):\n\tpar = dsu.find(i)\n\tif par not in components:\n\t\tcomponents[par] = []\n\tcomponents[par].append(i)\n\nfor comp in components:\n\tarr = [p[a] for a in components[comp]]\n\tarr = sorted(arr)\n\tfor idx, a in enumerate(components[comp]):\n\t\tp[a] = arr[idx]\n\nprint(\" \".join([str(x) for x in p])) ", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nP = []\r\nfor _ in range(N):\r\n P.append(input())\r\n\r\nseen = [0]*N\r\n\r\ndef paint(idx, color):\r\n v = [idx]\r\n while v:\r\n i = v.pop()\r\n if seen[i]:continue\r\n seen[i] = color\r\n \r\n for j in range(N):\r\n if P[i][j]=='1':\r\n v.append(j)\r\n\r\ncolor = 0\r\nfor i in range(N):\r\n if seen[i]==0:\r\n color+=1\r\n paint(i,color)\r\nD = [[] for _ in range(color)]\r\nfor i in range(N):\r\n D[seen[i]-1].append(A[i])\r\nfor i in range(color):\r\n D[i].sort(reverse=True)\r\n\r\nans = [0]*N\r\nfor i in range(N):\r\n ans[i] = D[seen[i]-1].pop()\r\nprint(*ans)" ]

[ "import sys\r\n \r\ndef pro():\r\n\treturn sys.stdin.readline().strip()\r\n \r\ndef rop():\r\n\treturn map(int, pro().split())\r\n \r\ndef main():\r\n\ts = list(rop())\r\n\ta = list(rop())\r\n\tq = list(rop())\r\n\to = list(rop())\r\n\tp = -1\r\n\tt = (1e100, -1, -1)\r\n\tfor i in range(s[1]):\r\n\t\twhile not((p == - 1 or s[2] * q[i] - s[3] * a[p] >= 0)\r\n\t\t\tand (p + 1 == s[0] or s[2] * q[i] - s[3] * a[p+1] < 0)):\r\n\t\t\tp += 1\r\n\t\tif p != -1:\r\n\t\t\tt = min(t, (o[i] + (s[2] ** 2 + a[p] ** 2) ** 0.5 + ((s[3] - s[2]) ** 2 + (q[i] - a[p]) ** 2) ** 0.5, p, i))\r\n\t\tif p + 1 != s[0]:\r\n\t\t\tt = min(t, (o[i] + (s[2] ** 2 + a[p + 1] ** 2) ** 0.5 + ((s[3] - s[2]) ** 2 + (q[i] - a[p + 1]) ** 2) ** 0.5, p + 1, i))\r\n\tprint(t[1] + 1, t[2] + 1)\r\n \r\nmain()", "from math import sqrt,fabs\r\n\r\ndef dist(x1, y1, x2, y2):\r\n return sqrt(pow(abs(x1 - x2), 2) + pow(abs(y1 - y2), 2))\r\n\r\ndef calcOptimumRightPoint(startX, startY):\r\n l = float(\"inf\")\r\n idx = -1\r\n for i in range(len(B)):\r\n d = dist(startX, startY, b, B[i]) + L[i]\r\n if d <= l:\r\n l = d\r\n idx = i\r\n return idx\r\n\r\nn,m,a,b = [int(x) for x in input().split()]\r\n\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\nL = [int(x) for x in input().split()]\r\n\r\noptimumRightPoint = calcOptimumRightPoint(0,0)\r\n\r\nintersectLeft = (a * B[optimumRightPoint]) / b\r\n\r\nl = float(\"inf\")\r\noptimumLeftPoint = -1\r\nfor i in range(len(A)):\r\n if fabs(intersectLeft-A[i]) < l:\r\n l = fabs(intersectLeft-A[i])\r\n optimumLeftPoint = i\r\n\r\noptimumRightPoint = calcOptimumRightPoint(a, A[optimumLeftPoint])\r\n\r\nprint(optimumLeftPoint + 1, optimumRightPoint + 1)" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n\r\n\r\ndef solve():\r\n n, k = read_tuple(int)\r\n grid = [['S' for _ in range(n)] for _ in range(n)]\r\n flag = True\r\n for i in range(n):\r\n for j in range(n):\r\n if k and flag:\r\n grid[i][j] = 'L'\r\n k -= 1\r\n flag ^= True\r\n if n % 2 == 0:\r\n flag ^= True\r\n if k == 0:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n if k == 0:\r\n for row in grid:\r\n print(''.join(row))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n ", "n, k = [int(x) for x in input().split()]\r\nif (n * n + 1) // 2 < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n arr = ['L'] * k + ['S'] * ((n * n + 1) // 2 - k)\r\n s = 'S'.join(arr)\r\n if n % 2 == 0:\r\n s += 'S'\r\n turn = 1\r\n while s:\r\n print(s[:n][::turn])\r\n s = s[n:]\r\n if n % 2 == 0:\r\n turn = - turn\r\n", "n,k=input().split()\r\nn,k=int(n),int(k)\r\nif k>(n*n+1)//2:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if((i+j)%2==0and k>0):\r\n print('L',end='')\r\n k-=1\r\n else:\r\n print('S',end='')\r\n print()", "from sys import stdin\nfrom collections import deque\nfrom math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin\ndef ii(): return int(stdin.readline())\ndef fi(): return float(stdin.readline())\ndef mi(): return map(int, stdin.readline().split())\ndef fmi(): return map(float, stdin.readline().split())\ndef li(): return list(mi())\ndef lsi():\n x=list(stdin.readline())\n x.pop()\n return x\ndef si(): return stdin.readline()\nres=['YES', 'NO']\n############# CODE STARTS HERE #############\nn, k=mi()\na=[['S']*n for _ in range(n)]\nfor i in range(n):\n for j in range(n):\n if k:\n if not (i+j)%2:\n a[i][j]='L'\n k-=1\n else:\n break\n if not k:\n break\nif not k:\n print('YES')\n for ss in a:\n print(*ss, sep='')\n exit()\nprint('NO')\n \t\t \t \t\t\t\t \t \t \t \t \t", "import sys\r\n\r\n#fin = open(\"input.txt\", 'r')\r\nfin = sys.stdin\r\n\r\nn, k = map(int, fin.readline().split())\r\nans = [[0 for i in range(n)] for j in range(n)]\r\nfor y in range(n):\r\n if k == 0:\r\n break\r\n for x in range(n):\r\n if k == 0:\r\n break\r\n \r\n if (y % 2) == (x % 2):\r\n ans[y][x] = 1\r\n k -= 1\r\nif k > 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for y in range(n):\r\n for x in range(n):\r\n print(\"L\" if ans[y][x] else \"S\", end = '')\r\n print()\r\n", "\r\nn,k=map(int,input().split())\r\n\r\nlm=(n*n+1)//2\r\n\r\nif lm<k:\r\n\r\n print('NO')\r\n\r\nelse:\r\n\r\n print('YES')\r\n\r\n for i in range(n):\r\n\r\n for j in range(n):\r\n\r\n if k>0 and (i+j)%2==0:\r\n\r\n print('L',end='')\r\n\r\n k-=1\r\n\r\n else:\r\n\r\n print('S',end='')\r\n\r\n\r\n print() \r\n", "n, k = [int(i) for i in input().split()]\r\nif k > (n**2 + 1) // 2:\r\n print('NO')\r\n exit()\r\nres = [x[:] for x in [['S']*n]*n]\r\nfor i in range(n):\r\n for j in range(i%2, n, 2):\r\n if k > 0:\r\n res[i][j] = 'L'\r\n k -= 1\r\nprint('YES')\r\nfor i in res:\r\n print(*i, sep='')\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\nprint = sys.stdout.write\r\ninp = lambda: map(int, input().split())\r\n\r\nn, target = inp()\r\nword = \"\"\r\nif (n ** 2 // 2 + (n % 2)) < target:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\" + \"\\n\")\r\nfor i in range(n // 2):\r\n word += (\"LS\" * (n // 2) + \"L\" * (n % 2))\r\n word += (\"SL\" * (n // 2) + \"S\" * (n % 2))\r\nif n % 2 == 1:\r\n word += (\"LS\" * (n // 2) + \"L\" * (n % 2))\r\nword = word.replace(\"L\", \"S\", word.count(\"L\") - target)\r\n\r\nfor i in range(0, n ** 2, n):\r\n print(word[i: i + n] + \"\\n\")\r\n", "import math\r\nn,k=map(int,input().split())\r\ncheck=math.ceil((n*n)/2)\r\nrow=[]\r\ncol=[]\r\nif(k<=check):\r\n print(\"YES\")\r\n for i in range(0,n):\r\n row=[]\r\n for j in range(0,n):\r\n row.append(\"S\")\r\n col.append(row)\r\n for i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if(k!=0):\r\n if(i%2!=0):\r\n if(j%2!=0):\r\n col[i-1][j-1]=\"L\"\r\n k=k-1\r\n else:\r\n if(j%2==0):\r\n col[i-1][j-1]=\"L\"\r\n k=k-1\r\n else:\r\n break\r\n \r\n for i in range(n):\r\n for j in range(n):\r\n print(col[i][j],end=\"\")\r\n print() \r\nelse:\r\n print(\"NO\")\r\n", "def inp(n):\r\n if n == 1:\r\n return map(int, stdin.readline().split())\r\n elif n == 2:\r\n return map(float, stdin.readline().split())\r\n else:\r\n return map(str, stdin.readline().split())\r\n\r\n\r\ndef flip(x):\r\n return 'S' if x == 'L' else 'L'\r\n\r\n\r\nfrom sys import stdin\r\nfrom math import ceil\r\n\r\nn, k = inp(1)\r\ntotal = n * n\r\nif n & 1:\r\n if k <= ceil((total) / 2):\r\n print('YES')\r\n for i in range(n):\r\n ans = ''\r\n for j in range(n):\r\n s = 'S'\r\n if total > 0 and total & 1:\r\n if k:\r\n k -= 1\r\n s = 'L'\r\n else:\r\n total = 0\r\n total -= 1\r\n ans += s\r\n print(ans)\r\n else:\r\n print('NO')\r\nelse:\r\n if k <= total // 2:\r\n print('YES')\r\n for i in range(n):\r\n ans, s = '', 'S'\r\n if i & 1:\r\n s = 'L'\r\n for j in range(n):\r\n if s == 'L':\r\n if k:\r\n k -= 1\r\n else:\r\n total = 0\r\n s='S'\r\n ans+=s\r\n if total:\r\n s = flip(s)\r\n print(ans)\r\n else:\r\n print('NO')\r\n", "n,k=map(int,input().split())\r\na=[[0 for i in range(n)]for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i%2==j%2 and k>0:\r\n a[i][j]=1\r\n k-=1\r\nif k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n for j in range(n):\r\n if a[i][j]:\r\n print(\"L\",end='')\r\n else:\r\n print(\"S\",end='')\r\n print()\r\n", "in1=input().split()\nn,k=int(in1[0]),int(in1[1])\nif n%2==0:\n max_islands=(n**2)//2\nelse:\n max_islands=((n**2)+1)//2\nif k>max_islands:\n print(\"NO\")\nelse:\n print(\"YES\")\n row=0\n island_count=0\n while island_count<k:\n column=0\n if row%2==0:\n sym=\"L\"\n else:\n sym=\"S\"\n while column<n:\n print(sym,end=\"\")\n column+=1\n if island_count<k:\n if sym==\"L\":\n sym=\"S\"\n island_count+=1\n else:\n sym=\"L\"\n print()\n row+=1\n while row<n:\n print(\"S\"*n)\n row+=1\n\n\n \n\t \t \t\t\t \t\t \t \t\t", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\narr = [[] for i in range(n)]\r\nFlag = False\r\nfor i in range(n):\r\n if(i%2==0):Flag = False\r\n else:Flag = True\r\n for j in range(n):\r\n if( not Flag and k > 0 ):\r\n arr[i].append('L');Flag = not Flag;k-=1\r\n elif( Flag and k > 0 ):\r\n arr[i].append('S');Flag = not Flag\r\n else:arr[i].append('S')\r\nif(k > 0):\r\n print(\"NO\");quit()\r\nprint(\"YES\")\r\nfor i in range(n):\r\n for j in range(n):\r\n print(arr[i][j],end='')\r\n print()", "import math\r\nn,k = map(int, input().strip().split(' '))\r\nif k>math.ceil(n*n/2):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n c=0\r\n for i in range(n):\r\n for j in range(n):\r\n if i%2==0:\r\n if j%2==0 and c<k:\r\n c+=1\r\n print('L',end=\"\")\r\n else:\r\n print('S',end=\"\")\r\n else:\r\n if j%2!=0 and c<k:\r\n c+=1\r\n print('L',end=\"\")\r\n else:\r\n print('S',end=\"\")\r\n print()", "n,k=map(int,input().split())\r\nmatrix=[[\"S\" for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if k>0:\r\n if i%2==0 and j%2==0:\r\n matrix[i][j]=\"L\"\r\n k-=1\r\n elif i%2==1 and j%2==1:\r\n matrix[i][j]=\"L\"\r\n k-=1\r\nif k>0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for lst in matrix: print(\"\".join(lst))", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn,x = getints()\r\nm = n*(n//2) if n%2 == 0 else ((n-1)//2)*(n)+n//2+1\r\nif x > m: print('NO')\r\nelse:\r\n print('YES')\r\n l = []\r\n for i in range(x):\r\n l.append('LS')\r\n for i in range(2*x,n*n):\r\n l.append('S')\r\n l = ''.join(l)\r\n\r\n if n%2:\r\n for i in range(0,n*n,n):\r\n print(l[i:i+n])\r\n else:\r\n j = 0\r\n for i in range(0,n*n,n):\r\n if j%2: print(l[i:i+n])\r\n else:\r\n t = list(l[i:i+n])\r\n t.reverse()\r\n print(''.join(t))\r\n j += 1\r\n", "n, k = map(int, input().split())\r\n\r\nmatrix = [[0 for j in range(n)] for i in range(n)]\r\nnbPossible = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n matrix[i][j] = 1 - ((i + j) % 2)\r\n if matrix[i][j]:\r\n nbPossible += 1\r\n\r\nif nbPossible < k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(n):\r\n for j in range(n):\r\n if matrix[i][j] and k:\r\n k -= 1\r\n else:\r\n matrix[i][j] = 0\r\n\r\n for i in range(n):\r\n print(''.join(map(lambda x: 'L' if x else 'S', matrix[i])))\r\n", "args = input().strip().split()\r\nn = int(args[0])\r\nk = int(args[1])\r\nmaxisl = (n*n+1)//2\r\nif k > maxisl:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\nfor i in range(n):\r\n s = \"\"\r\n for j in range(n):\r\n if ((i%2)==(j%2)) and k>0:\r\n s+='L'\r\n k -= 1\r\n else:\r\n s+='S'\r\n print(s)", "#!/usr/bin/python3\nn,k=map(int,input().split())\nnum=0\nisend=False\nres=\"\"\nfor i in range(0,n):\n for j in range(0,n):\n if (i+j)%2 == 0 and num < k: \n res+=\"L\"\n num+=1\n else:\n res+=\"S\"\n if i!=n-1:\n res+=\"\\n\" \nif num==k:\n print (\"YES\")\n print (res)\nelse:\n print(\"NO\")\n\n\n\n", "import math\r\n\r\nn, m = map(int, input().split())\r\n\r\nif m > math.ceil(n**2/2):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(1, n+1):\r\n for j in range(1, n+1):\r\n if m>0:\r\n if i%2 == j%2:\r\n m -= 1\r\n print('L', end=\"\")\r\n else:\r\n print('S', end=\"\")\r\n else:\r\n print('S', end=\"\")\r\n print()\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n# from math import gcd as gcd\r\n# import bisect #-->For bisect.bisect_left=lower_bound and bisect_right=upper_bound)\r\n\r\ndef solve(ans, k, n):\r\n cnt = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if(i % 2 == 0):\r\n if(j % 2 == 0):\r\n ans[i][j] = 'L'\r\n cnt += 1\r\n if (cnt == k):\r\n return ans\r\n else:\r\n if(j % 2):\r\n ans[i][j] = 'L'\r\n cnt += 1\r\n if(cnt == k):\r\n return ans\r\n return ans\r\nt = 1\r\n# t = int(input())\r\nfor _ in range(t):\r\n n, k = map(int, input().split())\r\n x = 0\r\n if(n%2):\r\n x = (n // 2 + 1) ** 2 + (n // 2) ** 2\r\n else:\r\n x = (n // 2) * n\r\n if(k > x):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n ans = [['S' for i in range(n)] for i in range(n)] \r\n cnt = 0\r\n if (k == 0):\r\n for i in ans:\r\n print(\"\".join(i))\r\n else:\r\n ans = solve(ans, k, n)\r\n for i in ans:\r\n print(\"\".join(i))", "n, k = map(int, input().split())\n\ndef ans_output(n, k, x):\n\tif k > x/2:\n\t\tprint(\"NO\")\n\telse:\n\t\tprint(\"YES\")\n\t\tgrid = [['S' for i in range(n)] for j in range(n)]\n\t\tfor i in range(n):\n\t\t\tj = i%2\n\t\t\twhile j < n and k > 0:\n\t\t\t\tgrid[i][j] = 'L'\n\t\t\t\tj += 2\n\t\t\t\tk -= 1\n\t\tfor i in range(n):\n\t\t\tprint(''.join(grid[i]))\n\nif n%2:\n\tans_output(n, k, n**2+1)\nelse:\n\tans_output(n, k, n**2)", "def main():\r\n n, k = [int(i) for i in input().split()]\r\n result = [['S' for i in range(n)] for j in range(n)]\r\n for i in range(n):\r\n for j in range(i % 2, n, 2):\r\n if k > 0:\r\n result[i][j] = 'L'\r\n k -= 1\r\n \r\n if k > 0:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print('\\n'.join(''.join(j for j in i) for i in result))\r\n \r\n\r\nmain()\r\n", "import pdb;\r\nn, k = map(int, input().split());\r\nt = -(-n//2);\r\nnum_isl = 0;\r\nts = ['LS', 'SL', 'L', 'S'];\r\nio = (n%2 != 0)\r\ndef intz_terms():\r\n if(num_isl >= k):\r\n ts[0], ts[1], ts[2], ts[3] = 'SS', 'SS', 'S', 'S';\r\nintz_terms();\r\nif(n%2 != 0):\r\n max_isl = t**2 + (t-1)**2;\r\nelse:\r\n max_isl = 2*(t**2);\r\nif(max_isl < k):\r\n print(\"NO\");\r\nelse:\r\n print(\"YES\");\r\n for i in range(n):\r\n if(i%2 == 0):\r\n for j in range(int(n/2)):\r\n print(ts[0], end = '');\r\n num_isl += 1;\r\n intz_terms();\r\n print(ts[2]) if n%2 != 0 else print();\r\n num_isl = num_isl+1 if (ts[2] == 'L' and io) else num_isl;\r\n intz_terms();\r\n else:\r\n for j in range(int(n/2)):\r\n print(ts[1], end = '');\r\n num_isl += 1;\r\n intz_terms();\r\n print(ts[3]) if n%2 != 0 else print();", "import sys,os,io\r\nimport math,bisect,operator\r\ninf,mod = float('inf'),10**9+7\r\n# sys.setrecursionlimit(10 ** 6)\r\nfrom itertools import groupby,accumulate\r\nfrom heapq import heapify,heappop,heappush\r\nfrom collections import deque,Counter,defaultdict\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nNeo = lambda : list(map(int,input().split()))\r\n# test, = Neo()\r\nn,k = Neo()\r\nA = [['S']*n for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if k == 0:\r\n break\r\n if (i%2==0 and j%2==0) or (i%2 and j%2):\r\n A[i][j] = 'L'\r\n k -= 1 \r\n if k == 0:\r\n break\r\nif k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in A:\r\n print(''.join(i))\r\n ", "n, k = map(int, input().split())\nm = 0\nif(n%2==0):\n\tm = n*n//2\nelse:\n\tm = ((n+1)*(n+1))//4 + ((n-1)*(n-1))//4\n\nif(m < k):\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\tfor i in range(n):\n\t\ts = \"\"\n\t\tfor j in range(n):\n\t\t\tif(i%2==1):\n\t\t\t\tif(k > 0):\n\t\t\t\t\tif(j%2==1):\n\t\t\t\t\t\ts += \"L\"\n\t\t\t\t\t\tk -= 1\n\t\t\t\t\telse:\n\t\t\t\t\t\ts += \"S\"\n\t\t\t\telse:\n\t\t\t\t\ts += \"S\"\n\t\t\telse:\n\t\t\t\tif(k > 0):\n\t\t\t\t\tif(j%2==1):\n\t\t\t\t\t\ts += \"S\"\n\t\t\t\t\telse:\n\t\t\t\t\t\ts += \"L\"\n\t\t\t\t\t\tk -= 1\n\t\t\t\telse:\n\t\t\t\t\ts += \"S\"\n\t\tprint(s)\n", "n, k = map(int, input().split())\r\n\r\nif k > (n * n + 1) // 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n f = 1 if i % 2 else 0\r\n for j in range(n):\r\n if k:\r\n print(\"S\" if f else \"L\", end=\"\")\r\n if not f:\r\n k -= 1\r\n else:\r\n print(\"S\", end=\"\")\r\n f ^= 1\r\n print()# 1698246257.5335772", "import math\r\n\r\nn, k = [int(i) for i in input().split()]\r\n\r\nif k > math.ceil(n**2 / 2):\r\n print('NO')\r\nelse:\r\n field = [x[:] for x in [['S']*n]*n]\r\n for i in range(0, n, 2):\r\n for j in range(0, n, 2):\r\n if k > 0:\r\n field[i][j] = 'L'\r\n k -= 1\r\n for i in range(1, n, 2):\r\n for j in range(1, n, 2):\r\n if k > 0:\r\n field[i][j] = 'L'\r\n k -= 1\r\n print('YES')\r\n for line in field:\r\n print(''.join(line))", "from math import ceil\r\n\r\nn, k = map(int, input().split())\r\n\r\nmax_islands = ceil(n**2 / 2)\r\n\r\ndef program(n, k):\r\n if k > max_islands:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n for i in range(n):\r\n s = \"\"\r\n for j in range(n):\r\n if k > 0 and (i+j)%2 == 0:\r\n k -= 1\r\n s += \"L\"\r\n else:\r\n s += \"S\"\r\n print(s)\r\n\r\nprogram(n, k)\r\n\r\n\r\n", "import time\r\nimport string\r\nclass Profiler(object):\r\n def __enter__(self):\r\n self._startTime = time.time()\r\n\r\n def __exit__(self, type, value, traceback):\r\n print(\"Elapsed time: {:.3f} sec\".format(time.time() - self._startTime))\r\n\r\n\r\n#k = int(input())\r\n#s = input()\r\nn, k = list(map(int, input().split()))\r\n\r\nm = []\r\ns = 0\r\nfor i in range(n):\r\n t = ['S' if (j%2+i%2)%2 else 'L' for j in range(n)]\r\n m.append(t)\r\ns = int(n*n / 2+.9)\r\nif s < k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for el in m:\r\n for i in range(len(el)):\r\n if el[i] == 'L':\r\n if k > 0:\r\n k -= 1\r\n else:\r\n el[i] = 'S'\r\n\r\n for el in m:\r\n print(\"\".join(el))\r\n\r\n\r\n\r\n'''\r\nfin = open(\"input.txt\")\r\nfout = open(\"output.txt\", \"w\")\r\n\r\nn = int(fin.readline())\r\ncases = list()\r\n\r\nfor i in range(n):\r\n fin.readline()\r\n cases.append(list(fin.readline().split()))\r\n\r\nfor i in range(1, len(cases)+1):\r\n cur_min = 1001\r\n added_min = 0\r\n lst = list(map(int, cases[i-1]))\r\n while max(lst) > 1:\r\n mmax = max(lst)\r\n if cur_min > mmax + added_min:\r\n cur_min = mmax + added_min\r\n count_max = lst.count(mmax)\r\n tmp_lst = list()\r\n for sym in lst:\r\n if sym is not mmax:\r\n tmp_lst.append(sym)\r\n else:\r\n if sym % 2 is 0:\r\n tmp_lst.append(sym//2)\r\n tmp_lst.append(sym//2)\r\n else:\r\n tmp_lst.append(sym//2)\r\n tmp_lst.append(sym//2 + 1)\r\n added_min += count_max\r\n lst = tmp_lst.copy()\r\n\r\n\r\n\r\n fout.write(\"Case #\" + i.__str__() + \": \" + cur_min.__str__() + \"\\n\")\r\nfin.close()\r\nfout.close()\r\n'''", "n, k = map(int, input().split())\r\nif n % 2 == 0:\r\n max = n * n / 2\r\n if max < k:\r\n print('NO')\r\n else:\r\n print('YES')\r\n for i in range(n):\r\n for t in range(n):\r\n if k > 0 and (i + t) % 2 == 0:\r\n print('L', end = '')\r\n k -= 1\r\n else:\r\n print('S', end = '')\r\n print()\r\nelse:\r\n max = (n // 2 + 1) ** 2 + (n // 2) ** 2\r\n if max < k:\r\n print('NO')\r\n else:\r\n print('YES')\r\n for i in range(n):\r\n for t in range(n):\r\n if k > 0 and (i + t) % 2 == 0:\r\n print('L', end = '')\r\n k -= 1\r\n else:\r\n print('S', end = '')\r\n print()\r\n", "n, k = map(int, input().split())\ns = n*n\nm = s//2 + s%2 # максимальное количество островов\n\nif k > m:\n print('NO')\nelse:\n # делаем нечто похожее на шахматное поле\n print('YES')\n for i in range(n):\n s = ''\n for j in range(n):\n if i % 2 == 0:\n if (j % 2 == 0) and (k != 0):\n s += 'L'\n k -= 1\n else:\n s += 'S'\n else:\n if (j % 2 == 1) and (k != 0):\n s += 'L'\n k -= 1\n else:\n s += 'S'\n print(s)", "N, K = map(int, input().split())\n\nl = [['S'] * N for i in range(N)]\ncount = 0\nfor i in range(N):\n for j in range(N):\n if count < K and (i + j) % 2 == 0:\n l[i][j] = 'L'\n count += 1\n\nif count < K:\n print(\"NO\")\n quit()\n\nprint(\"YES\")\nfor i in range(N):\n for j in range(N):\n print(l[i][j], end='')\n print()\n", "# Contest: 20 - 2100 <= Codeforces Rating <= 2199 (https://a2oj.com/ladder?ID=20)\n# Problem: (21) Sea and Islands (Difficulty: 4) (http://codeforces.com/problemset/problem/544/B)\n\ndef rint():\n return int(input())\n\n\ndef rints():\n return list(map(int, input().split()))\n\n\nn, k = rints()\nm = [['S'] * n for _ in range(n)]\nfor y in range(n):\n for x in range(y % 2, n, 2):\n if k > 0:\n m[y][x] = 'L'\n k -= 1\nif k > 0:\n print('NO')\nelse:\n print('YES')\n for r in m:\n print(''.join(r))\n", "n,k=map(int,input().split())\r\nif k > (n*n)//2 + n%2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n cnt = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if (i+j)%2 == 0:\r\n if cnt < k:\r\n cnt+=1\r\n print(\"L\", end=\"\")\r\n else:\r\n print(\"S\", end=\"\")\r\n else:\r\n print(\"S\", end=\"\")\r\n print()", "import math\nzzz = list(map(int, input().split()))\nn,k = zzz[0],zzz[1]\nif k > math.ceil((n**2)/2):\n print('NO')\nelse:\n print('YES')\n \n for i in range (n):\n s=''\n for j in range(n):\n if (i+j)%2 == 0 and k > 0:\n s+='L'\n k -=1\n else:\n s+='S'\n \n \n print(s)", "n,m = map(int,input().split())\nres = [['S']*n for i in range(n)]\nfor i in range(n):\n for j in range(n):\n if (i+j)%2==0 and m > 0:\n res[i][j] = 'L'\n m-=1\nif m == 0:\n print('YES')\n for i in range(n):\n print(''.join(res[i]))\n\nelse:\n print('NO')\n\n\n", "n, k = map(int, input().split())\r\n\r\nmatrix = [[0 for j in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if 1 - ((i + j) % 2) == 1 and k:\r\n matrix[i][j] = 1\r\n k -= 1\r\n else:\r\n matrix[i][j] = 0\r\n\r\nif k != 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(n):\r\n print(''.join(map(lambda x: 'L' if x else 'S', matrix[i])))\r\n", "n, k = (int(x) for x in input().split())\nl = [['S'] * n for _ in range(n)]\nfor i in range(n):\n\tfor j in range(n):\n\t\tif (i + j) % 2:\n\t\t\tcontinue\n\t\tif k > 0:\n\t\t\tl[i][j] = 'L'\n\t\t\tk -= 1\nprint('YES\\n' + '\\n'.join(''.join(x) for x in l) if k == 0 else 'NO')\n", "n, k = map(int, input().split())\r\nx = 0\r\nif k <= max(n**2 // 2, n**2 - (n**2 // 2)):\r\n print('YES')\r\n for i in range(n):\r\n for j in range(n):\r\n if i % 2 == j % 2 and x < k:\r\n print('L', end='')\r\n x += 1\r\n else: print('S', end='')\r\n print()\r\nelse: print('NO')\r\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Sea and Islands\"\r\n# Class: B\r\n\r\nfrom math import ceil\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, k = list(map(int, input().split()))\r\n if k>ceil(n/2)**2+(n//2)**2:\r\n print(\"NO\")\r\n else:\r\n ans = [[\"S\"]*n for i in range(n)]\r\n x = 0\r\n print(\"YES\")\r\n for i in range(n):\r\n for v in range(x, n, 2):\r\n if k!=0:\r\n ans[i][v] = \"L\"\r\n k-=1\r\n if x==0: x=1\r\n else: x=0\r\n \r\n for line in ans:\r\n print(\"\".join(line))\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # for t in range(int(input())):\r\n Solve()", "from sys import stdin\r\ninput = stdin.readline\r\n\r\n\r\nsize, num_islands = [int(x) for x in input().split()]\r\nhalf_size = size//2\r\n\r\nmax_num_islands = size * half_size if size&1==0 else half_size**2 + (half_size + 1)**2\r\n\r\nif max_num_islands < num_islands:\r\n print(\"NO\")\r\n\r\n\r\n\r\nelse:\r\n print(\"YES\")\r\n \r\n full_row_1 = \"\".join([\"S\" if j&1 else \"L\" for j in range(size)])\r\n num_islands_1 = (size + 1)//2\r\n \r\n full_row_2 = \"\".join([\"L\" if j&1 else \"S\" for j in range(size)])\r\n num_islands_2 = size//2\r\n \r\n # print(\"size = \", size)\r\n # print(\"num_islands = \", num_islands)\r\n # print(\"full_row_1 = \", full_row_1)\r\n # print(\"full_row_2 = \", full_row_2)\r\n \r\n \r\n # start with ones on even rows \r\n \r\n for i in range(size):\r\n if not num_islands:\r\n num_rows_left = size - i \r\n empty_row = \"S\"*size\r\n for _ in range(num_rows_left):\r\n print(empty_row)\r\n break\r\n if i&1:\r\n if num_islands >= num_islands_2:\r\n print(full_row_2)\r\n num_islands -= num_islands_2\r\n else:\r\n # SLSL...\r\n row = full_row_2[:2*num_islands] + \"S\" * (size - 2 * num_islands)\r\n print(row)\r\n num_islands = 0 \r\n\r\n else:\r\n if num_islands >= num_islands_1:\r\n print(full_row_1)\r\n num_islands -= num_islands_1\r\n else:\r\n # LSLSLS\r\n row = full_row_1[:2*num_islands-1] + \"S\" * (size - 2 * num_islands + 1)\r\n print(row)\r\n num_islands = 0 \r\n \r\n", "'''\r\n Created on 17.05.2015\r\n \r\n @author: Netsch\r\n \r\n'''\r\n\r\nn, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nif (k > (n * n + 1) // 2) :\r\n print('NO')\r\n exit()\r\nelse :\r\n print('YES');\r\nfor i in range(0, n) :\r\n for j in range(0, n) :\r\n if (i % 2 == j % 2) and (k > 0) :\r\n k -= 1\r\n print('L', end = '')\r\n else :\r\n print('S', end = '')\r\n print();", "r = lambda : map(int,input().split())\r\n\r\nimport sys\r\nn,k = r()\r\nm = (n//2)**2+(n-n//2)**2\r\nif k>m :\r\n print('NO')\r\n sys.exit(0)\r\n\r\nprint('YES')\r\na = [list('S'*n )for i in range(n)]\r\nfor i in range(n) :\r\n if not k : break\r\n for j in range(n) :\r\n if not k : break\r\n if (i+j+2)%2==0 :\r\n a[i][j] = 'L'\r\n k-=1\r\n\r\n\r\n\r\nfor lst in a :\r\n print(''.join(lst))\r\n", "from math import *\r\nfrom bisect import *\r\nfrom collections import Counter,defaultdict\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn,k=M()\r\nif (n*n+1)//2<k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n for j in range(n):\r\n if (i+j)%2==0 and k:\r\n print(\"L\",end=\"\")\r\n k-=1\r\n else:\r\n print(\"S\",end=\"\")\r\n print()\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n", "'''\r\n /\\\r\n / `.\r\n ,' `.\r\n /`.________ ( :\r\n \\ `. _\\_______ )\r\n \\ `.----._ `. \"`-.\r\n ) \\ \\ ` ,\"__\\\r\n \\ \\ ) ,-- (/o\\\\\r\n ( _ `. `---' ,--. \\ _)).\r\n `(-',-`----' ( (O \\ `--,\"`-.\r\n `/ \\ \\__) ,' O )\r\n / `--' ( O ,'\r\n ( `--,'\r\n \\ `== _.-'\r\n \\ .____.-;-'\r\n -hrr- ) `._ /\r\n ( |`-._\\ | ,' /\r\n `.__|__/ \"\\ |' /\r\n `._|_,'\r\n\r\nHAS ANYONE SEEN MY RIDER?\r\n----------------------------------CODING SUCKS----------YOUR STALKING DOES NOT THOUGH------\r\n\r\n'''\r\nimport math\r\nn, k = map(int, input().split())\r\npeak = (n*n +1) //2\r\nif k>peak:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n l = []\r\n for i in range(n):\r\n x = []\r\n for j in range(n):\r\n x.append('S')\r\n l.append(x)\r\n for i in range(n):\r\n for j in range(n):\r\n if (i+j)%2==0 and k:\r\n l[i][j] = 'L'\r\n k = k -1\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n print(l[i][j], end = '')\r\n print()", "import math\r\nn,k=map(int,input().split(\" \"))\r\ntt=1\r\nans=[['S' for x in range(n)]for y in range(n)]\r\nfor x in range(0,n):\r\n chk=0\r\n if tt==0:\r\n tt=1\r\n else:\r\n tt=0\r\n for y in range(tt,n,2):\r\n if k>0:\r\n ans[x][y]='L'\r\n k=k-1\r\nif k==0:\r\n print(\"YES\")\r\n for x in ans:\r\n print(*x,sep=\"\")\r\nelse:\r\n print(\"NO\")", "[n, k] = [int(i) for i in input().split()]\r\nislands = 0\r\nresult = []\r\nfor i in range(n):\r\n if i % 2 == 0 and islands < k:\r\n result.append('L')\r\n islands += 1\r\n else:\r\n result.append('S')\r\n for j in range(n - 1):\r\n if result[-1][-1] == 'S' and islands < k:\r\n result[-1] += 'L'\r\n islands += 1\r\n else:\r\n result[-1] += 'S'\r\n\r\nif islands == k:\r\n print('YES')\r\n for i in range(n):\r\n print(result[i])\r\nelse:\r\n print('NO')\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\nans = \"YES\" if k <= (n * n + 1) // 2 else \"NO\"\r\nprint(ans)\r\nif ans == \"NO\":\r\n exit()\r\nans = []\r\nfor i in range(n):\r\n ans0 = [\"S\"] * n\r\n for j in range(i % 2, n, 2):\r\n if not k:\r\n break\r\n ans0[j] = \"L\"\r\n k -= 1\r\n ans.append(\"\".join(ans0))\r\nsys.stdout.write(\"\\n\".join(ans))", "n, k = [int(i) for i in input().split()]\r\nif k > ((n + 1) // 2) ** 2 + (n // 2) ** 2:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n for j in range(n):\r\n if (i + j) % 2 == 0 and k > 0:\r\n print('L',end='')\r\n k -= 1\r\n else:\r\n print('S',end='')\r\n print()\r\n", "n,k = map(int, input().split())\r\n\r\nx = (n*n+1)//2\r\nif k>x:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n for j in range(n):\r\n if k==0:\r\n print('S',end='')\r\n continue\r\n if (i+j)%2==0:\r\n print('L',end='')\r\n k-=1\r\n else:\r\n print('S',end='')\r\n print()\r\n\r\n ", "a=list(map(int,input().rstrip().split()))\nn=a[0]\n\nk=a[1]\ns=['S']*int(n*n)\n#print(s)\n\nif n%2==0:\n\tmax_land = int((n*n)/2)\nelse:\n\tmax_land=int((n*n+1)/2)\nif n%2!=0 and k<=max_land:\n\tprint(\"YES\")\n\tj=0\n\tfor i in range(k):\n\t\ts[j]='L'\n\t\tj+=2\n\tj=0\n\tk=0\n\tfor i in range(n):\n\t\tk=n+j\n\t\tprint(*s[j:k],sep=\"\")\n\t\tj=k\nelif n%2==0 and k<=max_land:\n\tprint(\"YES\")\n\tj=0\n\tj=0\n\ttemp=1\n\tfor i in range(k):\n\t\tif j>=n*temp and j%n==0:\n\t\t\ttemp+=1\n\t\t\tj+=1\n\t\tif j>=n*temp and j%n!=0:\n\t\t\ttemp+=1\n\t\t\tj-=1\n\t\ts[j]='L'\n\t\tj+=2\n\tj=0\n\tk=0\n\tfor i in range(n):\n\t\tk=n+j\n\t\tprint(*s[j:k],sep=\"\")\n\t\tj=k\n\nelse:\n\tprint(\"NO\")\n#21bcm033\n\t \t \t \t \t\t \t \t\t\t\t \t \t\t \t\t", "n,k=map(int,input().split())\nif k>(n*n+1)//2:\n\tprint('NO')\n\texit()\nprint('YES')\nfor i in range(n):\n\tfor j in range(n):\n\t\tif k:\n\t\t\tif i%2==0:\n\t\t\t\tif j%2==0:\n\t\t\t\t\tprint('L',end='')\n\t\t\t\t\tk-=1\n\t\t\t\telse:\n\t\t\t\t\tprint('S',end='')\n\t\t\telse:\n\t\t\t\tif j%2==1:\n\t\t\t\t\tprint('L',end='')\n\t\t\t\t\tk-=1\n\t\t\t\telse:\n\t\t\t\t\tprint('S',end='')\n\t\telse:\n\t\t\tprint('S',end='')\n\tif j==n-1:\n\t\tprint(sep='\\n')\nprint()\n\n\n\n\n", "#!/usr/bin/env python3\nimport collections, itertools, functools, math\n\ndef solve():\n n, k = map(int, input().split())\n\n grid = [['S']*n for _ in range(n)]\n\n for i in range(n):\n if k <= 0:\n break\n for j in range(n):\n if k <= 0:\n break\n if (i+j)%2 == 0:\n k -= 1\n grid[i][j] = 'L'\n if k:\n print('NO')\n else:\n print('YES')\n for row in grid:\n print(*row, sep='')\n\n\nif __name__ == '__main__':\n solve()\n\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\n(n, k) = [ int(i) for i in input().split() ]\n\nnow = 0\n\nif ( k > n**2/2+divmod(n**2, 2)[1] ):\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in range(n):\n flag = divmod(i, 2)[1]\n for j in range(n):\n if flag == 0 and now < k:\n print(\"L\", end='')\n flag = 1\n now += 1\n else:\n print(\"S\", end='')\n flag = 0\n print()\n\n", "def is_possible(n, k):\r\n if n%2 == 0:\r\n num_max = (n//2)*n\r\n else:\r\n num_max = (n//2 + 1)**2 + (n//2)**2\r\n if k > num_max:\r\n return False\r\n return True\r\n\r\n\r\ndef generate_string(row_number, n):\r\n x = n//2\r\n if row_number % 2 == 0:\r\n if n % 2 == 0:\r\n s = \"LS\"*x\r\n l = x\r\n else:\r\n s = \"LS\"*x + \"L\"\r\n l = x + 1\r\n else:\r\n if n % 2 == 0:\r\n s = \"SL\"*x\r\n l = x\r\n else:\r\n s = \"SL\"*x + \"S\"\r\n l = x\r\n\r\n return s,l\r\n\r\n\r\ndef get_ans(n, k):\r\n if not is_possible(n, k):\r\n return \"NO\"\r\n #l = [\"YES\"]\r\n l = []\r\n num_islands = 0\r\n for i in range(n):\r\n gs,l_count = generate_string(i, n)\r\n num_islands+=l_count\r\n if num_islands == k:\r\n l.append(gs)\r\n break\r\n if num_islands < k:\r\n l.append(gs)\r\n continue\r\n if num_islands > k:\r\n extra = num_islands - k\r\n gs = gs.replace('L','S',extra)\r\n l.append(gs)\r\n break\r\n num_rows_left = n - len(l)\r\n for i in range(num_rows_left):\r\n l.append(\"S\"*n)\r\n s = '\\n'.join(l)\r\n return \"YES\\n\" + s\r\n\r\n\r\nn,k = map(int, input().split())\r\nans = get_ans(n,k)\r\nprint(ans)\r\n\"\"\"\r\ndef test_get_ans():\r\n n = 6\r\n for k in range(n**2):\r\n ans = get_ans(n, k)\r\n print(ans)\r\n\r\ntest_get_ans()\r\n\"\"\"", "from collections import defaultdict\ndef solution():\n n,k = map(int, input().split())\n count = 0\n for i in range(n):\n for j in range(n):\n is_l = (i+j)%2 == 0 and k > 0\n count += is_l \n if count < k:\n return print(\"NO\")\n\n print(\"YES\")\n for i in range(n):\n for j in range(n):\n is_l = (i+j)%2 == 0 and k > 0\n print(\"L\" if is_l else \"S\", end = \"\")\n k -= is_l \n print()\n\n \ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n\nmain()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\n\r\nif k > (n**2+1)//2:\r\n print('NO')\r\n exit(0)\r\n\r\nprint('YES')\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n c = (n+1)//2\r\n if k >= c:\r\n k -= c\r\n print(('LS'*n)[:n])\r\n else:\r\n print((('LS'*k) + 'S'*n)[:n])\r\n k = 0\r\n else:\r\n c = n//2\r\n if k >= c:\r\n k -= c\r\n print(('SL'*n)[:n])\r\n else:\r\n print((('SL'*k) + 'S'*n)[:n])\r\n k = 0", "from collections import defaultdict\ndef solution():\n n,k = map(int, input().split())\n a = n//2\n b = n//2 + n%2\n count = b * b + (n-b)*a\n\n if count < k:\n return print(\"NO\")\n\n print(\"YES\")\n for i in range(n):\n for j in range(n):\n is_l = (i+j)%2 == 0 and k > 0\n print(\"L\" if is_l else \"S\", end = \"\")\n k -= is_l \n print()\n\n \ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n\nmain()\n", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n ans = [['S'] * n for _ in range(n)]\r\n # 如果超过孤立岛屿的最大数量，则不可能构成\r\n if (n & 1 and k > (n // 2 + 1) ** 2 + (n >> 1) ** 2) or (not n & 1 and k > n ** 2 // 2):\r\n print('NO')\r\n else:\r\n print('YES')\r\n for i in range(n):\r\n if k == 0:\r\n break\r\n for j in range(i & 1, n, 2):\r\n if k == 0:\r\n break\r\n ans[i][j] = 'L'\r\n k -= 1\r\n for i in ans:\r\n print(''.join(i))", "import math\r\n\r\nn,k = map(int, input().split())\r\n\r\ndef print_map(n, k):\r\n if k > math.ceil(n*n/2):\r\n print(\"NO\")\r\n return\r\n\r\n print(\"YES\")\r\n for i in range(n):\r\n w = \"\"\r\n for j in range(n):\r\n if i%2 == j%2 and k > 0:\r\n w += \"L\"\r\n k -= 1\r\n else:\r\n w += \"S\"\r\n print(w)\r\n\r\nprint_map(n, k)\r\n\r\n ", "#This code is contributed by Siddharth\r\nfrom bisect import *\r\nimport math\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom itertools import *\r\ninf=10**18\r\nmod=10**9+7\r\n\r\n# ---------------------------------------------------------Code---------------------------------------------------------\r\n\r\nn,k=map(int,input().split())\r\nmat=[[0 for _ in range(n)] for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i%2==j%2 and k>0:\r\n mat[i][j]=1\r\n k-=1\r\nif k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(n):\r\n for j in range(n):\r\n if mat[i][j]:\r\n print('L',end=\"\")\r\n else:\r\n print('S',end=\"\")\r\n print()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\nimport math\nfrom collections import defaultdict\nimport itertools\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\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 for i in range(len(ans)):\n for j in range(len(ans)):\n sys.stdout.write(ans[i][j])\n if i != len(ans) - 1:\n sys.stdout.write(\"\\n\")\n\n\ndef solve(a, b):\n grid = [[\"S\" for _ in range(a)] for _ in range(a)]\n for row in range(a):\n if row % 2 == 0:\n for col in range(0, a, 2):\n if b > 0:\n grid[row][col] = \"L\"\n b -= 1\n else:\n for col in range(1, a, 2):\n if b > 0:\n grid[row][col] = \"L\"\n b -= 1\n\n printOutput(grid)\n\n\ndef readinput():\n a, b = getInts()\n if (a * a + 1) // 2 >= b:\n print(\"YES\")\n solve(a, b)\n else:\n print(\"NO\")\n\n\nreadinput()\n", "import math\r\n\r\nn, k = [int(i) for i in input().split()]\r\nmax = math.ceil(n ** 2 / 2)\r\nif max >= k:\r\n ans = []\r\n print('YES')\r\n for i in range(n):\r\n a = []\r\n for j in range(n):\r\n if i % 2 == 0:\r\n if j % 2 == 0:\r\n if k != 0:\r\n a.append('L')\r\n k -= 1\r\n else:\r\n a.append('S')\r\n else:\r\n a.append('S')\r\n else:\r\n if j % 2 == 0:\r\n a.append('S')\r\n else:\r\n if k != 0:\r\n a.append('L')\r\n k -= 1\r\n else:\r\n a.append('S')\r\n ans.append(a)\r\n for i in range(n):\r\n b = \"\"\r\n for j in range(n):\r\n b += ans[i][j]\r\n print(b)\r\nelse:\r\n print('NO')", "n,r=[int(x) for x in input().split()]\nL=[['S']*n for i in range(n)]\nmaxc=((n+1)//2)*((n+1)//2)+(n//2)*(n//2)\nif maxc<r:\n print('NO')\n exit()\nprint('YES')\nfor i in range(n):\n if r<1:\n break\n if i&1:\n for j in range(1,n,2):\n if r<1:\n break\n L[i][j]='L'\n r-=1 \n else:\n for j in range(0,n,2):\n if r<1:\n break\n L[i][j]='L'\n r-=1\nfor i in L:\n print(''.join(i))\n", "def main():\n n, k = map(int, input().split())\n if (n * n + 1) // 2 < k:\n print(\"NO\")\n return\n print(\"YES\")\n for i in range(n):\n row, l = [], (i & 1) ^ 1\n for j in range(n):\n if k:\n row.append((\"S\", \"L\")[l])\n k -= l\n else:\n row.append(\"S\")\n l ^= 1\n print(''.join(row))\n\n\nif __name__ == '__main__':\n main()\n", "n, k = map(int, input().split())\r\n\r\ndef solve(n, k):\r\n if k > (n * n) // 2 + (n % 2):\r\n return False\r\n if n % 2:\r\n lines = []\r\n for i in range(n):\r\n if k == 0:\r\n lines.append('S' * n)\r\n else:\r\n if i % 2:\r\n if k >= n // 2:\r\n k -= n // 2\r\n lines.append('SL' * (n // 2) + 'S')\r\n else:\r\n lines.append('SL' * k + 'S' * (n - k * 2))\r\n k = 0\r\n else:\r\n if k >= (n // 2) + 1:\r\n k -= (n // 2) + 1\r\n lines.append('LS' * (n // 2) + 'L')\r\n else:\r\n lines.append('LS' * k + 'S' * (n - k * 2))\r\n k = 0\r\n return lines\r\n else:\r\n lines = []\r\n for i in range(n):\r\n if k == 0:\r\n lines.append('S' * n)\r\n else:\r\n if i % 2:\r\n if k >= n // 2:\r\n k -= n // 2\r\n lines.append('SL' * (n // 2))\r\n else:\r\n lines.append('SL' * k + 'S' * (n - k * 2))\r\n k = 0\r\n else:\r\n if k >= n // 2:\r\n k -= n // 2\r\n lines.append('LS' * (n // 2))\r\n else:\r\n lines.append('LS' * k + 'S' * (n - k * 2))\r\n k = 0\r\n return lines\r\n\r\nans = solve(n, k)\r\nif ans:\r\n print('YES')\r\n for line in ans:\r\n print(line)\r\nelse:\r\n print('NO')", "import math\nn, k = [int(i) for i in input().split()]\nif n%2 ==0:\n m = n*n/2\nelse:\n m = (n//2)**2+(n//2+1)**2\nif k > m:\n print(\"NO\")\nelif k == 0:\n print(\"YES\")\n for i in range(n):\n print(\"S\"*n)\nelse:\n \n print(\"YES\")\n s = [\"\" for i in range(n)]\n if n%2 == 0:\n for i in range(n):\n if i%2 == 0:\n s[i] = \"LS\"*(n//2)\n else:\n s[i] = \"SL\"*(n//2)\n else:\n for i in range(n):\n if i%2 == 0:\n s[i] = \"LS\"*(n//2)+\"L\"\n else:\n s[i] = \"SL\"*(n//2)+\"S\"\n for i in range(n):\n for j in range(n):\n if s[i][j] == \"L\":\n k-=1\n if k < 1:\n break\n if k < 1:\n break\n for t in range(i):\n print(s[t])\n print(s[i][:j+1]+\"S\"*(n-j-1))\n for t in range(n-i-1):\n print(\"S\"*n)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Aug 12 16:24:37 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 65 - CF544-DIV2B\r\n\"\"\"\r\nimport math\r\n\r\nn,k = map(int,input().split())\r\nif k > math.ceil(pow(n,2)/2):\r\n print(\"NO\")\r\nelse:\r\n grid = [[0]*n for _ in range(n)]\r\n ct = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if (i+j)%2 == 0 and ct < k:\r\n grid[i][j] = \"L\"\r\n ct += 1\r\n else:\r\n grid[i][j] = \"S\"\r\n print(\"YES\")\r\n for i in range(n):\r\n print(\"\".join(grid[i]))", "n, k = map(int, input().split())\r\na = [['S' for _ in range(n)] for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if k > 0 and (i + j) % 2 == 0:\r\n a[i][j] = 'L'\r\n k -= 1\r\nprint('YES\\n%s' % '\\n'.join(''.join(row) for row in a) if k == 0 else 'NO')", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\nfrom math import ceil\r\n\r\ninput = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\n\r\ndef solve():\r\n n, k = read()\r\n if k > ceil(n * n / 2):\r\n return [[\"NO\"]]\r\n lst = [['S'] * n for i in range(n)]\r\n # print(lst)\r\n i = j = 0\r\n print(\"YES\")\r\n while k:\r\n for idx in range(i, n, 2):\r\n if idx % 2 == i:\r\n lst[j][idx] = 'L'\r\n k -= 1\r\n if not k:\r\n break\r\n i = (i + 1) % 2\r\n j += 1\r\n return lst\r\n\r\n # for test in range(int(input())):\r\n\r\n\r\nprint(*list(map(\"\".join, solve())), sep='\\n')\r\n", "n,k = map(int,input().split())\r\npemitted = n**2 //2\r\nif n %2 ==1:\r\n pemitted +=1\r\nif k > pemitted :\r\n print(\"NO\")\r\n exit()\r\nprint('YES')\r\n\r\ngrid = [['S']*n for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if k == 0:\r\n break\r\n if (i+j) %2 == 0:\r\n grid[i][j] = 'L'\r\n k-=1\r\n# for i in range(n):\r\n# for\r\n[print(*line,sep=\"\") for line in grid]", "n,k = list(map(int,input().split()))\r\nisl = k\r\nif(n%2==0 and (n**2)//2>=k):\r\n\tprint(\"YES\")\r\n\tfor i in range(n):\r\n\t\tif isl==0:\r\n\t\t\tprint(\"S\"*n)\r\n\t\telif i%2==0:\r\n\t\t\tif isl>=(n//2):\r\n\t\t\t\tprint(\"LS\"*(n//2),end=\"\")\r\n\t\t\t\tisl-=n//2\r\n\t\t\telse:\r\n\t\t\t\tprint(\"LS\"*isl,end=\"\")\r\n\t\t\t\tprint(\"S\"*((n-isl*2)),end=\"\")\r\n\t\t\t\tisl = 0\r\n\t\t\tprint()\r\n\t\telse:\r\n\t\t\tif isl>=(n//2):\r\n\t\t\t\tprint(\"SL\"*(n//2),end=\"\")\r\n\t\t\t\tisl-=n//2\r\n\t\t\telse:\r\n\t\t\t\tprint(\"SL\"*isl,end=\"\")\r\n\t\t\t\tprint(\"S\"*((n-isl*2)),end=\"\")\r\n\t\t\t\tisl = 0\r\n\t\t\tprint()\r\n\r\nelif(n%2!=0 and ((n**2)//2)+1>=k):\r\n\tprint(\"YES\")\r\n\tfor i in range(n):\r\n\t\tif isl==0:\r\n\t\t\tprint(\"S\"*n)\r\n\t\telif i%2==0:\r\n\t\t\tif isl>=(n//2+1):\r\n\t\t\t\tprint(\"LS\"*(n//2),end=\"\")\r\n\t\t\t\tprint(\"L\",end=\"\")\r\n\t\t\t\tisl-=n//2+1\r\n\t\t\telse:\r\n\t\t\t\tprint(\"LS\"*isl,end=\"\")\r\n\t\t\t\tprint(\"S\"*((n-isl*2)),end=\"\")\r\n\t\t\t\tisl = 0\r\n\t\t\tprint()\r\n\t\telse:\r\n\t\t\tif isl>=(n//2):\r\n\t\t\t\tprint(\"SL\"*(n//2),end=\"\")\r\n\t\t\t\tprint(\"S\",end=\"\")\r\n\t\t\t\tisl-=n//2\r\n\t\t\telse:\r\n\t\t\t\tprint(\"SL\"*isl,end=\"\")\r\n\t\t\t\tprint(\"S\"*((n-isl*2)),end=\"\")\r\n\t\t\t\tisl = 0\r\n\t\t\tprint()\r\nelse:\r\n\tprint(\"NO\")\r\n\r\n", "\r\n\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 if k > 1 and k >= n ** 2:\r\n print('NO')\r\n return\r\n output = [['' for _ in range(n)] for _ in range(n)]\r\n last_symbol = 'S'\r\n for row in range(n):\r\n for col in range(n):\r\n if k > 0:\r\n if col == 0 and row > 0:\r\n if output[row - 1][0] == 'S':\r\n last_symbol = 'L'\r\n k -= 1\r\n output[row][col] = 'L'\r\n else:\r\n output[row][col] = 'S'\r\n last_symbol = 'S'\r\n\r\n else:\r\n if last_symbol == 'S':\r\n last_symbol = 'L'\r\n k -= 1\r\n output[row][col] = 'L'\r\n else:\r\n output[row][col] = 'S'\r\n last_symbol = 'S'\r\n\r\n else:\r\n output[row][col] = 'S'\r\n if k > 0:\r\n print('NO')\r\n else:\r\n print('YES')\r\n for row in output:\r\n print(''.join(row))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\nimport math\nimport bisect\nimport math\nfrom itertools import accumulate\nfrom itertools import combinations\nimport string\ninput = sys.stdin.readline\ndef inpit(): #int\n return(int(input()))\ndef inplt(): #list \n return(list(map(int,input().split())))\ndef inpstr(): #string\n s = input()\n return(list(s[:len(s) - 1]))\ndef inpspit(): #spaced intergers \n return(map(int,input().split()))\n \npow = math.pow\nfl = math.floor\nceil = math.ceil\ndis = math.hypot # cartesian distance \n\ndef lcm(a):\n return abs(math.prod(a)) // math.gcd(*a)\n \ndef cumulativeSum(input): # prefix sum\n return (list(accumulate(input))) \n\ndef all_set(string):\n lt = []\n for i in range(0,len(string)+1):\n for element in combinations(string,i):\n lt.append(''.join(element))\n return(lt)\n\n\n\n\n\nn, k = inpspit()\nif(k > ceil((n*n)/2) ):\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in range(n):\n print()\n if(i % 2 == 0 ):\n for j in range(n):\n if(j % 2 == 0 and k > 0):\n print('L',end = \"\" )\n k -= 1\n else:\n print(\"S\",end = \"\")\n\n else:\n for j in range(n):\n if(j % 2 != 0 and k > 0):\n print('L',end = \"\" )\n k -= 1\n else:\n print(\"S\",end = \"\")\n\n\n\n\n\n\n", "w,l=map(int,input().split())\r\n\r\nif l>w**2//2+w%2:\r\n print('NO')\r\n quit()\r\nelse:\r\n print('YES')\r\n\r\nfor i in range(w):\r\n for j in range(w):\r\n if (i+j)%2==0 and l>0:\r\n l-=1\r\n print('L',end='')\r\n else:\r\n print('S',end='')\r\n print()\r\n \r\n" ]

[ "from sys import stdin, stdout\n\ndef need_to_check(card, vowels=['a','e','i','o','u']):\n return (ord(card) >= ord('0') and ord(card) <= ord('9') and int(card) % 2 == 1) or (card in vowels)\n\ndef number_of_reveals(cards):\n count = 0\n for card in cards:\n count = count+1 if need_to_check(card) else count\n return count\n\nstdout.write( str(number_of_reveals(stdin.readline())) +'\\n')\n \t \t\t\t \t\t \t \t", "s = input().strip()\nprint (sum([s.count(x) for x in \"aeiou13579\"]))\n\n", "print(sum(1 for c in input() if c in 'aeiou13579'))", "def even(a):\n if(a >= '0' and a <= '9' and (int(a) % 2 != 0)):\n return True\n return False\n\ns = list(input())\nsum = 0\n\nfor i in range(len(s)):\n if(s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or even(s[i])):\n sum += 1\nprint(sum)\n\t\t\t\t \t\t\t \t \t\t \t \t \t\t\t\t\t", "VOGAIS = 'aeiou'\nIMPARES = '13579'\n\ns = input()\nvezes = 0\nfor caractere in s:\n if caractere not in VOGAIS and caractere not in IMPARES:\n continue\n vezes += 1\n\nprint(vezes)\n \t\t\t \t\t\t \t \t\t \t\t \t \t\t\t \t \t\t\t\t", "n=list(input())\r\nt=['a','e','i','o','u']\r\ncount=0\r\nfor i in range(len(n)):\r\n\tif n[i] in t and n[i].isdigit()==False:\r\n\t\tcount+=1\r\n\tif n[i].isdigit() and int(n[i])%2!=0:\r\n\t\tcount+=1\t\r\nprint(count)\t\r\n", "x=input()\r\ny=\"aeiou\"\r\nc=0\r\nfor i in x:\r\n try:\r\n i=int(i)\r\n if i%2==1:\r\n c+=1\r\n except:\r\n for e in y:\r\n if i==e:\r\n c+=1\r\nprint(c)\r\n", "cards = input()\n\nvowels = set([\"a\",\"e\",\"i\",\"o\",\"u\"])\nevens = set([\"1\",\"3\",\"5\",\"7\",\"9\"])\n\nneeded_flips = 0\n\nfor card in cards:\n if card in vowels or card in evens:\n needed_flips += 1\n\nprint(needed_flips)\n \t\t \t \t \t \t\t\t\t\t \t", "vowels = ['a','e','i','o','u']\r\nl = [str(i) for i in range(10)]\r\ns = input()\r\ncount = 0\r\nfor i in s:\r\n\tif(i in vowels):\r\n\t\tcount+=1\r\n\telif(i not in vowels and i not in l):\r\n\t\tpass\r\n\telse:\r\n\t\ta = int(i)\r\n\t\tif(a%2!=0):\r\n\t\t\tcount+=1\r\nprint(count)", "l=['a', 'e', 'i', 'o', 'u']\r\nk=['1','3','5','7','9']\r\ns=input()\r\nans=0\r\nfor i in range(len(s)):\r\n\tif s[i] in l :\r\n\t\t# print(s[i])\r\n\t\tans+=1\r\n\telif s[i] in k:\r\n\t\t# print(s[i])\r\n\t\tans+=1\r\n\telse:\r\n\t\tcontinue\r\nprint(ans)", "def needFlip(card):\n verifications = set({\n 97,101,105,111,117,\n 49,51,53,55,57\n })\n return ord(card) in verifications\n\nstring = input()\n\ni = 0\nj = len(string) - 1\nflips = 0\n\nwhile i <= j:\n if i==j and needFlip(string[i]):\n flips += 1\n break\n if needFlip(string[i]):\n flips += 1\n if needFlip(string[j]):\n flips += 1\n i += 1\n j -= 1\n\nprint(flips)\n\t \t\t \t\t \t \t \t\t\t\t\t\t\t \t", "s = input()\nwhile not 1<= len(s) <= 50:\n s = input()\n\nvogais = ['a','e','i','o','u'] \nnumimp = ['1','3','5','7','9'] \n\nres = 0\nfor i in s:\n if i in vogais:\n res += 1\n elif i in numimp:\n res += 1\nprint(res) \n\t \t \t \t\t\t\t \t\t \t \t\t\t \t\t\t", "print(sum(ch in 'aeiou13579' for ch in input()))", "cards = input()\n\nflips = 0\nfor card in cards: \n if (card in 'aeiou13579'):\n flips += 1\n\nprint(flips)\n \t\t \t \t \t \t \t \t \t \t\t \t\t \t\t", "s = input()\r\n\r\nans = 0\r\nfor i in s:\r\n\tif(i=='a' or i=='e' or i=='i' or i=='o' or i=='u' ):\r\n\t\tans+=1\r\n\telse:\r\n\t\ttry:\r\n\t\t\tj = int(i)\r\n\t\t\tif(j%2==1):\r\n\t\t\t\tans+=1\r\n\t\texcept ValueError:\r\n\t\t\tcontinue\r\n\r\nprint(ans)", "s = input()\ncount = 0\nfor c in s:\n if c in 'aeiou' or (c.isdigit() == True and int(c) % 2 != 0): count += 1\nprint(count)\n\n\t\t \t\t\t\t \t \t\t\t\t\t \t \t\t", "# import os\r\n\r\ns = input()\r\n\r\nc =0\r\nfor l in s:\r\n if l in ['a','e','i','o','u']:\r\n c += 1\r\n elif l in ['1','3','5','7','9']:\r\n c += 1\r\nprint(c)\r\n\r\n", "a = input()\r\nb = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nc = [\"1\",\"3\",\"5\",\"7\",\"9\"]\r\nd=0\r\nfor i in a:\r\n\tif i in b or i in c:\r\n\t\td+=1\r\nprint(d)", "cards = input()\n\ncount = 0\nfor card in cards:\n if card in 'a e i o u 1 3 5 7 9':\n count += 1\n\nprint(count)\n \t \t\t \t\t\t\t\t \t \t\t\t\t\t\t\t\t", "a = input()\r\nans=0\r\nif a.count(\"a\")>0:\r\n ans+=a.count(\"a\")\r\nif a.count(\"i\")>0:\r\n ans+=a.count(\"i\")\r\nif a.count(\"1\")>0:\r\n ans+=a.count(\"1\")\r\nif a.count(\"3\")>0:\r\n ans+=a.count(\"3\")\r\nif a.count(\"5\")>0:\r\n ans+=a.count(\"5\")\r\nif a.count(\"7\")>0:\r\n ans+=a.count(\"7\")\r\nif a.count(\"9\")>0:\r\n ans+=a.count(\"9\")\r\nif a.count(\"o\")>0:\r\n ans+=a.count(\"o\")\r\nif a.count(\"e\")>0:\r\n ans+=a.count(\"e\")\r\nif a.count(\"u\")>0:\r\n ans+=a.count(\"u\")\r\nprint(ans)", "a=str(input())\r\nx=k=int(0)\r\ny=len(a)\r\nwhile x<y:\r\n if a[x]=='a' or a[x]=='e' or a[x]=='i' or a[x]=='o' or a[x]=='u' or a[x]=='1' or a[x]=='3' or a[x]=='5' or a[x]=='7' or a[x]=='9':\r\n k=k+1\r\n x=x+1\r\nprint(k)", "s = input()\n\ncheck_list = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\n\ncount = 0\nfor i in range(len(s)):\n if s[i] in check_list: count = count + 1\n\nprint(count)\n \t \t \t \t\t \t \t \t \t\t\t \t", "# Language practice purpose\r\n\r\nx=input()\r\na=\"aeiou13579\"\r\ns=0;\r\nfor i in x:\r\n s+=int(i in a)\r\nprint(s)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n# L=[\"a\",\"e\",\"o\",\"u\",\"i\"]\r\ncount=0\r\nY=list(input())\r\nfor i in Y:\r\n\tif i=='a'or i=='e' or i=='u' or i=='i' or i=='o':\r\n\t\tcount+=1\r\n\telif( (ord(i)>=48 and ord(i)<=57) and (ord(i)-48)%2!=0):\r\n\t\tcount+=1\r\n\r\nprint(count)", "s=input()\r\nx=0\r\nif 'a' in s:\r\n x=x+s.count('a')\r\nif 'e' in s:\r\n x=x+s.count('e')\r\nif 'i' in s:\r\n x=x+s.count('i')\r\nif 'o' in s:\r\n x=x+s.count('o')\r\nif 'u' in s:\r\n x=x+s.count('u')\r\nif '1' in s:\r\n x=x+s.count('1')\r\nif '3' in s:\r\n x=x+s.count('3')\r\nif '5' in s:\r\n x=x+s.count('5')\r\nif '7' in s:\r\n x=x+s.count('7')\r\nif '9' in s:\r\n x=x+s.count('9')\r\nprint(x)", "l=input()\r\n\r\ncount=0\r\nfor x in l:\r\n if x=='a' or x=='e' or x=='i' or x=='o' or x=='u' or x=='1' or x=='3' or x=='5' or x=='7' or x=='9':\r\n count+=1\r\n\r\nprint(count)", "text = input()\n\nvogals = ['a', 'e', 'i', 'o', 'u']\n\ncount = 0\n\nfor c in text:\n\n if c.isnumeric():\n if int(c) % 2 != 0:\n count += 1\n else:\n if c in vogals:\n count += 1\n\nprint(count)\n\n\t \t \t\t\t\t \t \t\t\t \t \t\t \t\t\t \t\t \t", "import sys\r\n\r\ns = input()\r\nn = len(s)\r\nodd_digits = ('1', '3', '5', '7', '9')\r\nvowel = ('a', 'e', 'i', 'o', 'u')\r\nsum = 0\r\n\r\nfor i in range(0,n):\r\n\tif((s[i] in vowel) or (s[i] in odd_digits)):\r\n\t\tsum += 1\r\nprint(sum)", "s=input()\r\ns1=\"aeoiu\"\r\ns2=\"02468\"\r\ns3=\"13579\"\r\ncount=0\r\nfor i in range(len(s)):\r\n if s[i] in s1:\r\n count+=1\r\n elif s[i] in s3:\r\n count+=1\r\nprint(count)\r\n", "s = 0\r\nfor i in input():\r\n if i in 'aeiou13579':\r\n s += 1\r\nprint(s)", "s = input()\nletters = ['a', 'e', 'i', 'o', 'u']\ncount = 0\nfor char in s:\n if char in letters or char.isdigit() and int(char) % 2 != 0:\n count += 1\n\nprint(count)\n", "Sum = 0\r\nfor ch in input():\r\n if ch in 'aeiou13579':\r\n Sum += 1\r\nprint(Sum)", "s=input()\r\nc=0\r\nfor i in s:\r\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u' or (ord(i)%2!=0 and ord(i)>=48 and ord(i)<=57)):\r\n c+=1\r\n else:\r\n c+=0\r\nprint(c)", "def int_lst_input():\n return [int(val) for val in input().split()]\n\ndef int_input():\n return int(input())\n\ndef print_lst(lst):\n print(' '.join([str(val) for val in lst]))\n\ndef solve():\n s = input()\n\n vowels = {'a', 'e', 'i', 'o', 'u'}\n\n count = 0\n for val in s:\n if val in vowels or (val.isnumeric() and int(val) % 2 == 1):\n count += 1\n\n print(count)\n\nif __name__ == '__main__':\n solve()\n", "v=\"aeiou\"\r\nn=\"13579\"\r\ns=input()\r\nc=0\r\nfor i in s:\r\n\r\n\tif i in v:\r\n\t\tc=c+1\r\n\telif i in n:\r\n\t\tc=c+1\r\nprint(c)", "'''\n\nWelcome to GDB Online.\nGDB online is an online compiler and debugger tool for C, C++, Python, Java, PHP, Ruby, Perl,\nC#, VB, Swift, Pascal, Fortran, Haskell, Objective-C, Assembly, HTML, CSS, JS, SQLite, Prolog.\nCode, Compile, Run and Debug online from anywhere in world.\n\n'''\nk=['1','3','5','7','9','a','e','i','o','u']\ns=list(input(''));c=0\nfor i in s:\n if i in k:\n c+=1\nprint(c) ", "if __name__ == \"__main__\":\r\n cards = input()\r\n vowels = ['a', 'e', 'i', 'o', 'u']\r\n odd = ['1', '3', '5', '7', '9']\r\n flips = sum([1 for c in cards if (c in vowels or c in odd)])\r\n print(flips)", "word = input()\ncheck = 0\nfor i in range(len(word)):\n if word[i] == 'a' or word[i] == 'e' or word[i] == 'o' or word[i] == 'i' or word[i] == '1' or word[i] == 'u' or word[i] == '3' or word[i] == '5' or word[i] == '9' or word[i] == '7':\n check += 1\nprint(check)", "\r\ndef solve():\r\n s = input()\r\n cnt = 0\r\n for i in s:\r\n try:\r\n t = int(i)\r\n if t%2!=0:\r\n cnt+=1\r\n except:\r\n if i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n cnt+=1\r\n print(cnt)\r\nfor _ in range(1):\r\n solve()\r\n", "set = {'a','e','i','o','u','1','3','5','7','9'}\ns = input()\ncnt=0\nfor letter in s:\n\tif letter in set:\n\t\tcnt += 1\nprint(cnt)\n\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\nx=input()\r\nl=['a','e','i','o','u']\r\nd=['1','3','5','7','9']\r\nc=0\r\nfor i in x:\r\n\tif (i in l) or (i in d):\r\n\t\tc+=1\r\nprint(c)\r\n", "a=input()\r\na = list(a)\r\ncount=0\r\nfor letter in a:\r\n\tif letter== 'a'or letter== 'e' or letter== 'i' or letter== 'o' or letter== 'u':\r\n\t\tcount = count +1\r\n\telif letter== '1'or letter== '3' or letter== '5' or letter== '7'or letter== '9':\r\n\t\tcount= count + 1\r\nprint(count)\r\n", "s = input()\r\ncount = 0\r\nfor c in s:\r\n if c in 'aeiou13579':\r\n count += 1\r\nprint(count)", "ab = str(input())\r\n\r\ntest= 'aeiou13579'\r\nc=0\r\nfor i in ab:\r\n if i in test:\r\n c=c+1\r\nprint(c)\r\n\r\n", "s = input()\r\nprint(len([char for char in s if char in 'aeiou' or char in '13579']))", "texto = input()\nvogais = ['a','e','i','o','u']\nconsoantes = ['b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','x','w','y','z']\ncontador = 0\n\nfor letra in texto:\n if letra in vogais:\n contador += 1\n \n elif letra in consoantes:\n pass\n\n else:\n if int(letra) % 2 != 0:\n contador +=1\n\nprint(contador)\n \t\t \t \t \t\t \t \t\t\t\t \t\t\t", "s = input()\nvowels = ['a', 'e', 'i', 'o', 'u']\nodd = ['1', '3', '5', '7', '9']\ncount = 0\nfor i in range(len(s)):\n if s[i] in vowels or s[i] in odd:\n count += 1\nprint(count)\n", "a='aeiou13579'\nx=input()\nprint(sum(x.count(i)for i in a))\n", "s = input()\ncnt = 0\nfor c in s:\n if c in \"aeiou13579\":\n cnt += 1\n\nprint(cnt)\n\t \t\t \t\t\t \t\t \t \t \t\t\t \t \t\t \t\t\t \t\t", "x = input()\r\nwtf = lambda x: x in \"aeiou13579\"\r\nprint(len(list(filter(wtf, x))))", "s=input()\r\nans=0\r\nfor i in range(0,len(s)):\r\n if s[i]=='1' or s[i]=='3' or s[i]=='5' or s[i]=='7' or s[i]=='9' or s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u':\r\n ans+=1\r\nprint(ans) ", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\ncont = 0\r\nfor x in range(len(s)):\r\n\tif s[x]=='a' or s[x]=='e' or s[x]=='i' or s[x]=='o' or s[x]=='u' or s[x]=='1' or s[x]=='3' or s[x]=='5' or s[x]=='7' or s[x]=='9':\r\n\t\tcont=cont+1\r\nprint (cont)\r\n", "CS = ['1','3','5','7','9','a','e','i','o','u']\nS = input()\nprint(sum(1 for c in S if c in CS))\n", "s = input()\r\nc = int(0)\r\nq = {\"1\", \"3\", \"5\", \"7\", \"9\", \"a\", \"e\", \"i\", \"o\", \"u\"}\r\nfor i in range(len(s)):\r\n if s[i] in q:\r\n c += 1\r\nprint(c)", "s=input()\r\na=['a','e','i','o','u','1','3','5','7','9']\r\ncount=0\r\nfor i in range(len(s)):\r\n if s[i] in a:\r\n count+=1\r\nprint(count)", "s = list(input())\nans = 0\nv = ['a','e','i','o','u']\nr = ['b','c','d','f','g','h','i','j','k','l','m','n','p','q','r','s','t','v','w','x','z','y']\nn = ['0', '2', '4', '6', '8']\nfor i in s:\n if i in v:\n ans += 1\n elif i in r:\n continue\n elif i not in n:\n ans += 1\n\nprint(ans)\n\n\t \t \t \t\t \t \t \t \t\t\t\t \t", "# 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 s = rs()\r\n cnt = 0\r\n for c in s:\r\n if c=='a' or c=='e' or c=='i' or c=='o' or c=='u' or c=='1' or c=='3' or c=='5' or c=='7' or c=='9':\r\n cnt += 1\r\n \r\n wi(cnt)\r\n\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "ans = 0\r\nfor i in input():\r\n if i in 'aeiou13579':\r\n ans=ans+1\r\nprint(ans)", "cards = str(input())\ncount = 0\nfor i in range(len(cards)):\n if 97 <= ord(cards[i]) <= 122:\n if cards[i] not in 'aeiou':\n continue\n else:\n count += 1\n else:\n if int(cards[i]) % 2 == 0:\n continue\n else:\n count += 1\nprint(count)", "s = input()\r\nvad = \"aeiou13579\"\r\nans = 0\r\nfor c in s:\r\n ans += c in vad\r\nprint(ans)\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\ns=input()\r\nl=0\r\nfor i in s:\r\n\tl+=i in \"aeiou13579\"\r\nprint(l)", "a=input()\r\nk=0\r\nfor i in range(len(a)):\r\n if a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='1' or a[i]=='3' or a[i]=='5' or a[i]=='7' or a[i]=='9':\r\n k+=1\r\nprint(k) ", "x = input()\nn = len(x)\nv = ['a','e','i','o','u']\no = ['1','3','5','7','9']\nans = 0\nfor i in range (0,n):\n\tif (x[i] in v):\n\t\tans = ans+1\n\telif (x[i] in o):\n\t\tans = ans+1\n\nprint(ans)\n", "print(sum(map(input().count, \"aeiou13579\")))\r\n", "l=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\ns=input()\r\nc=0\r\nfor i in s:\r\n\tif i.isdigit()==True:\r\n\t\tif int(i)%2==1:\r\n\t\t\tc+=1\r\n\telse:\r\n\t\tif i in l:\r\n\t\t\tc+=1\r\nprint(c)", "s=input()\r\nr=['a','e','i', 'o', 'u']\r\nl=['1','3','5','7','9']\r\nt=0\r\nfor i in s:\r\n if i in r or i in l:\r\n t+=1\r\nprint(t)\r\n", "count =0\r\ninput_string = input();\r\nvowel = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nnumbers = ['1','3','5','7','9']\r\nfor i in range(len(input_string)):\r\n if input_string[i] in vowel:\r\n count+=1\r\n elif input_string[i] in numbers:\r\n count+=1\r\nprint(count)", "s=input()\r\nk=0\r\na=['a','e','i','o','u','1','3','5','7','9']\r\nfor i in s:\r\n\tif i in a:\r\n\t\tk+=1\r\nprint(k)", "cards = input()\ncount = 0\n\nfor character in cards:\n\tif character in ['a','e','i','o','u']:\n\t\tcount+=1\n\telif character in ['1','3','5','7','9']:\n\t\tcount+=1\n\nprint (count)\n\t \t\t\t \t\t\t \t \t \t \t\t \t\t", "s=input()\r\nm=0\r\nb=['a','e','i','o','u','1','3','5','7','9']\r\nfor i in range(len(s)):\r\n\tif s[i] in b:\r\n\t\tm+=1\r\nprint(m)", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\na=['a','e','i','o','u','1','3','5','7','9']\r\ns=input()\r\nc=0\r\nfor i in s:\r\n\tif i in a:\r\n\t\tc+=1\r\nprint(c)\t\t", "s = input()\ncount = 0\nfor x in s:\n if x.isnumeric():\n x = int(x)\n if x%2!=0:\n count += 1\n else:\n if x in ['a', 'e', 'i', 'o', 'u']:\n count+=1\n\nprint(count)", "cards = input()\n\ncont = 0\nfor l in cards:\n #if (l in cont) and l.isdigit():\n #continue\n if l== 'a'or l== 'e'or l== 'i'or l== 'o'or l== 'u':\n cont = cont + 1\n elif l== '1'or l== '3'or l== '5'or l== '7'or l== '9':\n cont = cont + 1\n\nprint(cont)\n\n\n\n", "s = input().lower()\r\ng = 'aeiou13579'\r\nn = [c for c in s if c in g]\r\nprint(len(n))\r\n", "s=list(input())\r\n# print(type(s[-1]))\r\ns1=['b','c','d','f','g','h','j','k','l','m','n','r','q','p','s','t','v','w','x','y','z']\r\nc=0\r\nfor i in s:\r\n if(i==\"a\"):\r\n c+=1\r\n elif(i==\"e\"):\r\n c+=1\r\n elif(i==\"i\"):\r\n c+=1\r\n elif(i==\"o\"):\r\n c+=1\r\n elif(i==\"u\"):\r\n c+=1\r\n elif(i in s1):\r\n pass\r\n else:\r\n if(int(i)%2!=0):\r\n c+=1\r\n \r\nprint(c)", "s=input()\r\nl=['a','e','i','o','u','1','3','5','7','9']\r\nc=0\r\nfor i in s:\r\n if i in l:\r\n c+=1\r\nprint(c)\r\n \r\n", "c = input()\r\nprint(sum(map(c.count, 'aeiou13579')))\r\n", "k = 0\r\nvsp = \"aeiou13579\"\r\ns = input()\r\nfor sim in s:\r\n if sim in vsp:\r\n k += 1\r\nprint(k)", "vowel=\"aeiou\"\r\nstring=input()\r\ncount=0\r\nfor i in string:\r\n\tif i.isdigit():\r\n\t\tif int(i)%2:\r\n\t\t\tcount+=1\r\n\telse:\r\n\t\tfor j in vowel:\r\n\t\t\tif j==i:\r\n\t\t\t\tcount+=1\r\n\t\t\t\tbreak\r\nprint(count)", "cartas = input()\n\ncasosCriticos = ['a','e','i','o','u','1','3','5','7','9']\n\ncount = 0\nfor carta in cartas:\n if carta in casosCriticos:\n count+=1\n\nprint(count)\n\t\t\t \t \t \t\t \t\t \t\t \t \t", "def funcao(string):\n cont = 0\n for l in string:\n if l.isdigit():\n if int(l) % 2 != 0:\n cont += 1\n elif l in ('a', 'e', 'i', 'o', 'u'):\n cont += 1\n return cont\n\nprint(funcao(input()))\n\t \t\t\t \t \t \t \t\t\t \t\t\t\t \t\t", "st=input()\r\nmin_flip=0\r\nfor i in st:\r\n \r\n try:\r\n int(i)\r\n\r\n if int(i)%2!=0:\r\n min_flip+=1\r\n\r\n except:\r\n if str(i) in ['a','e','i','o','u']:\r\n min_flip+=1\r\n\r\n\r\nprint(min_flip)\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "s=input()\r\nL=['a','u','i','o','e','1','3','5','7','9']\r\n\r\ncoun=0\r\nfor i in range(len(s)):\r\n if s[i] in L:\r\n coun=coun+1\r\n \r\nprint(coun)", "cards = input()\n\nvowels = set('aeiou')\n\ncount = 0\nfor c in cards:\n if c in vowels:\n count += 1\n if c.isnumeric() and int(c) % 2 != 0:\n count += 1\n\nprint(count)\n\t\t\t \t \t \t\t\t\t \t\t \t \t\t\t\t \t\t \t", "vowels = {'a', 'e', 'i', 'o', 'u'}\nodd_nums = {'1', '3', '5', '7', '9'}\nnum_flips = 0\ns = input().strip()\nfor ch in s:\n if ch in vowels or ch in odd_nums:\n num_flips += 1\n\n\n\n# vowels2freq = {} # freq := flip frequency\n# even_num2freq = {}\n# for i in range(len(vowels)):\n# vowels2freq[vowels[i]] = 0\n# even_num2freq[even_numbers[i]] = 0\n#\n# s = input().strip()\n#\n# num_flips = 0\n# for ch in s:\n# if ch in vowels2freq and vowels2freq[ch] == 0:\n# vowels2freq[ch] = 1\n# num_flips += 1\n# elif ch in even_num2freq and even_num2freq[ch] == 0:\n# even_num2freq[ch] = 1\n# num_flips += 1\n\nprint(num_flips)\n", "vogais = ['a','e','i','o','u']\nodds = ['1','3','5','7','9']\nx = input()\nv =0\nfor i in range(len(x)):\n if x[i] in vogais or x[i] in odds:\n v+=1\n\nprint(v)\n\t\t \t\t\t\t\t \t \t \t \t\t\t\t \t\t", "c = input()\r\nans = 0\r\nfor i in c:\r\n if i in \"aeiou\" or i in \"13579\":\r\n ans += 1\r\nprint(ans)", "def main():\n s = input()\n\n vogais = \"aeiou\"\n pares = \"02468\"\n\n cont = 0\n for c in s:\n if c.isalpha() and c not in vogais:\n continue\n if c.isnumeric() and c in pares:\n continue\n\n cont += 1\n\n print(cont)\n\n\n\nif __name__ == \"__main__\":\n main()\n\n", "#!python3\n\nfrom collections import deque, Counter\nfrom itertools import combinations, permutations\nfrom math import sqrt\nimport unittest\n\n\ndef read_int():\n return int(input().strip())\n\n\ndef read_int_array():\n return [int(i) for i in input().strip().split(' ')]\n\n######################################################\n\ns = input().strip()\nvowels = 'aeiou'\nevens = '02468'\nprint(sum(1 if (c in vowels or (c in '0123456789' and c not in evens) ) else 0 for c in s))\n\n", "x=input()\r\nn=len(x)\r\ny=['a','e','i','o','u','1','3','5','7','9']\r\nc=0\r\nfor i in range(n):\r\n if x[i] in y:\r\n c+=1\r\nprint(c)", "import re\n\n\ndef main():\n cards = input()\n re_filter = re.findall(r\"[13579aeiou]\", string=cards)\n print(len(re_filter))\n\n\nif __name__ == '__main__':\n main()\n", "cards = input()\nvogais = ['a', 'e', 'i', 'o', 'u']\n\ncount = 0\nfor card in cards:\n if (card in vogais):\n count += 1\n elif (card.isdigit() and int(card) % 2 != 0):\n count += 1\n\nprint(count)\n\n \t \t \t \t\t\t\t\t \t \t\t\t \t \t", "def solve(w):\n return sum([1 for i in w if i in \"aeiou13579\"])\n\n\ndef main():\n print(solve(input().strip()))\n\n\nmain()\n", "\ndef analise(seq):\n vogais = [\"a\", \"e\", \"i\", \"o\", \"u\", \"A\", \"E\", \"I\", \"O\", \"U\"]\n\n count = 0\n\n for e in seq:\n if e.isdigit():\n if int(e)%2 == 1:\n count +=1\n else:\n if e in vogais:\n count +=1 \n\n return count \n\n\nseq = str(input())\nprint(analise(seq))\n\t \t\t\t\t\t \t \t \t\t \t \t\t \t\t\t", "s=list(input().lower())\r\nc = 0\r\nfor x in s:\r\n if x in ['a','e','i','o','u'] or x in ['1','3','5','7','9']:\r\n c+=1\r\nprint(c)\r\n", "vowels = ['a', 'e', 'i', 'o', 'u']\r\n\r\ncards = input()\r\ncount = 0\r\nfor i in cards:\r\n if(i in vowels):\r\n count += 1\r\n elif(i.isnumeric() and int(i)%2 != 0):\r\n count += 1\r\n\r\nprint(count)", "s=str(input())\r\nspace='aeiou13579'\r\nc=0\r\nfor i in s:\r\n\tif i in space:\r\n\t\tc+=1\r\nprint(c)", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n S = wtf[0]\r\n V = 'aeiou'\r\n E = '02468'\r\n ans = 0\r\n for s in S:\r\n if s.isalpha() and s in V:\r\n ans += 1\r\n if s.isdigit() and s not in E:\r\n ans += 1\r\n print(ans)\r\n", "a=list(input())\r\ncount=0\r\nb=['a','e','i','o','u']\r\nc=['1','3','5','7','9']\r\nfor i in range(len(a)):\r\n if(a[i] in b):\r\n count+=1\r\n elif(a[i] in c):\r\n count+=1\r\nprint(count)\r\n", "cartas = input()\nquant = 0\n\nfor i in cartas:\n if i.isalpha():\n if i in \"aeiou\":\n quant += 1\n else:\n if int(i) % 2 != 0:\n quant += 1\n\nprint (quant)\n \t\t \t\t\t\t \t\t \t\t\t\t \t \t \t\t \t", "b = {'a','e','i','o','u','1','3','5','7','9'}\nc=0\ns = list(input()) #(1,50)\nfor i in s:\n if(i in b):\n c+=1\nprint(c)\n \t\t\t\t \t\t\t\t\t \t\t\t \t \t\t\t\t\t", "n=input()\r\ns=0\r\nfor i in ['a','e','o','u','i']:\r\n s+=n.count(i)\r\nfor i in range(1, 11, 2):\r\n s+=n.count(str(i))\r\n\r\nprint(s)\r\n \r\n", "k=str(input())\r\ngl=['a', 'e', 'i', 'o', 'u']\r\np=0\r\nfor a in k:\r\n if 49<=ord(a)<=57:\r\n if int(a)%2==1:\r\n p+=1\r\n elif a in gl:\r\n p+=1\r\nprint(p)", "s = input()\r\ncounter = 0\r\nans = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\r\nfor i in s:\r\n for j in ans:\r\n if i == j:\r\n counter += 1\r\nprint(counter)\r\n", "c = 0\r\nfor i in input():\r\n if i in \"aeiou13579\":\r\n c += 1\r\nprint(c)\r\n", "li=[\"a\",\"e\",\"i\",\"o\",\"u\"]\nli2=[\"1\",\"3\",\"5\",\"7\",\"9\"]\na=input()\ns=0\nfor i in a:\n if i in li or i in li2 :\n s+=1\nprint(s)\n \t \t\t\t\t \t \t\t \t \t \t\t \t \t", "s = input()\nt = set(['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9'])\nprint(sum(map(lambda x: 1 if x in t else 0, s)))\n", "cnt = 0\r\nfor c in input():\r\n cnt += int(c in \"aiueo13579\")\r\nprint(cnt)", "s=input()\r\nc1=s.count('a')+s.count('e')+s.count('i')+s.count('o')+s.count('u')\r\nc2=s.count('1')+s.count('3')+s.count('5')+s.count('7')+s.count('9')\r\nprint(c1+c2)\r\n", "string = input()\r\n\r\nvowels = ['a','e','i','o','u']\r\nnumbers = ['1','3','5','7','9']\r\nans = 0\r\nfor s in string:\r\n if s in vowels:\r\n ans+=1\r\n elif s in numbers:\r\n ans+=1\r\n \r\nprint(ans)", "inp = list(input())\r\ncounter = 0\r\n\r\nfor i in range(len(inp)):\r\n if (inp[i] >= '1' and inp[i] <= '9'):\r\n inp[i] = int(inp[i])\r\n if inp[i] % 2 == 1:\r\n counter += 1\r\n\r\n if inp[i] == 'a' or inp[i] == 'e' or inp[i] == 'i' or inp[i] == 'o' or inp[i] == 'u':\r\n counter += 1\r\n\r\nprint(counter)\r\n", "print(sum(c in 'aeiou13579' for c in input()))", "a = input()\r\ncounter = 0\r\nb = 'aeiou13579'\r\nfor i in a:\r\n if i in b:\r\n counter += 1\r\nprint(counter)", "s = str(input())\r\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\nc = 0\r\nfor i in s:\r\n if i in vowels:\r\n c += 1\r\n elif i.isdigit() and int(i) % 2 != 0:\r\n c += 1\r\nprint(c)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri May 28 23:51:25 2021\r\n\r\n@author: TSSPDCL\r\n\"\"\"\r\n\r\ns=input()\r\nl=['a','e','i','o','u']\r\nmin_num=0\r\nfor i in s:\r\n if i.isalpha():\r\n if i in l:\r\n min_num+=1\r\n if i.isnumeric():\r\n if int(i)%2!=0:\r\n min_num+=1\r\n \r\nprint(min_num)", "# Question: A - 1\n# Assignment 11\n# Daniel Perez, bd2255\n\n# this algorithm is not to return true of false of the claim but rather\n# the instances in which flipping would yield a true statement or not\n\ndef rainy(S):\n # contains vowels and odd numbers \n COMP = \"aeiou13579\"\n\n # i in \"aeiou13579\" will return true or false, 1 or 0\n # then this is done for every character in the string\n COUNT = sum(i in COMP for i in S)\n\n return COUNT\n\n\nSTRING = input()\nprint(rainy(STRING))\n\n\t \t\t\t \t\t \t\t\t \t\t \t\t", "main_input = input();\nvalid = \"aeiou13579\";\ncount = 0;\n\nfor input in main_input:\n if(input in valid):\n count += 1;\n \nprint(count);\n \t \t \t\t\t \t \t \t \t\t\t\t\t\t\t \t\t\t", "print(sum(q in'aeiou13579'for q in input()))", "lis=['a', 'e', 'i', 'o' , 'u','1','3','5','7','9']\r\ns=input()\r\ncnt=0\r\nfor i in range(len(s)):\r\n if s[i] in lis:\r\n cnt+=1\r\nprint(cnt)\r\n", "cartas = input()\nsoma = 0\nbase = \"aeiou13579\"\nfor c in cartas:\n if c in base:\n soma += 1\nprint(soma)\n \t\t\t\t \t\t\t\t \t\t\t\t\t\t \t\t\t \t", "vovel = 'aeiou'\r\nodd = '13579'\r\ns = input()\r\ncount = 0\r\nfor c in s:\r\n if c in vovel:\r\n count+=1\r\n elif c in odd:\r\n count+=1\r\n\r\nprint(count)\r\n", "# import sys\r\n# sys.stdin = open(\"#input.txt\", \"r\")\r\n\r\nvowels=['a','e','i','o','u','1','3','5','7','9']\r\nans = 0\r\nfor c in input():\r\n\tans += c in vowels\r\nprint(ans)", "entrada = input()\r\nflags = ['a','e','i','o','u','1','3','5','7','9']\r\nn_cartas = 0\r\n\r\n\r\nfor caractere in entrada:\r\n if flags.count(caractere) > 0:\r\n n_cartas += 1\r\n\r\nprint(n_cartas)", "c = input()\nprint(sum(map(c.count, 'aeiou13579')))\n\n\t \t \t\t\t\t \t \t\t\t\t\t\t \t \t \t\t", "cards = input()\n\nvowels = ['a', 'e', 'i', 'o', 'u']\nodds = ['1', '3', '5', '7', '9']\n\ncount = 0\nfor card in cards:\n if card in vowels or card in odds:\n count += 1\n\nprint(count)\n\n \t\t\t\t\t\t \t \t\t \t\t\t\t \t \t \t \t \t\t", "s = input()\r\ncount = 0\r\nfor letter in s:\r\n if letter in ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']:\r\n count += 1\r\nprint(count)", "s=input()\r\nc=0\r\nv=['a','e','i','o','u']\r\nfor i in s:\r\n if i in v:\r\n c+=1\r\n elif(ord(i)<65):\r\n if(int(i)%2!=0):\r\n c+=1\r\nprint(c)", "n = input()\r\nans = 0\r\nfor i in n:\r\n if i.isdigit() and int(i)%2==1:ans += 1\r\n elif i in ['a', 'e', 'i', 'o', 'u']: ans += 1\r\nprint(ans)", "s = input()\r\nA = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\nres = 0\r\nfor i in s:\r\n if i in A or (i.isdigit() and int(i) % 2 == 1):\r\n res += 1\r\nprint(res)\r\n", "v = 'aeiou13579'\r\ns = input()\r\nc = 0\r\nfor i in s:\r\n if(i in v):\r\n c += 1\r\nprint(c) \r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n", "cards=input()\nnumbers=\"0123456789\"\neven = \"02468\"\nvowals=\"aeiou\"\ncount = 0\n\nfor s in range(len(cards)):\n if cards[s] in vowals:\n count += 1\n else:\n if cards[s] in numbers and cards[s] not in even:\n count += 1\n\nprint(count)\n \t\t \t \t \t \t \t\t \t\t", "print (len(list(filter(lambda x: x in ['a','e','i','o','u'] or x.isdigit() and (int(x)-int('0'))%2!=0, input()))))", "a = 'aiueo13579'\r\n\r\ns = input()\r\n\r\nans = 0\r\n\r\nfor c in s:\r\n\tif a.find(c) >= 0:\r\n\t\tans += 1\r\n\r\nprint(ans)\r\n\r\n", "entrada = input()\nflags = ['a','e','i','o','u','1','3','5','7','9']\nn_cartas = 0\n\n\nfor caractere in entrada:\n if flags.count(caractere) > 0:\n n_cartas += 1\n\nprint(n_cartas)\n \t \t \t \t \t\t\t\t\t \t \t\t \t \t\t\t", "s=input()\r\nr=0\r\nv=['a','e','i','o','u']\r\ne=['0','2','4','6','8']\r\nfor i in s:\r\n if(i.isdigit()):\r\n if(i not in e):\r\n r=r+1\r\n else:\r\n if(i in v):\r\n r=r+1\r\nprint(r)\r\n \r\n", "s=input()\r\nc,l=0,['a','e','i','o','u','1','3','5','7','9']\r\nfor i in s:\r\n if i in l:\r\n c+=1 \r\nprint(c)", "s = input()\r\nl = ['a','e','i','o','u']\r\nll = ['1','3','5','7','9']\r\nans = 0\r\nfor i in s:\r\n\tif i in l or i in ll :\r\n\t\tans+=1\r\nprint(ans)\r\n", "A=input()\r\ns=0\r\nfor k in range(len(A)):\r\n if(A[k]in '1,3,5,7,9,a,e,i,o,u'):\r\n s+=1\r\nprint(s)\r\n \r\n", "s=input()\r\ncnt=0\r\nfor p in s:\r\n\tif p==\"1\" or p==\"3\" or p==\"5\" or p==\"7\" or p==\"9\" or p==\"a\" or p==\"e\" or p==\"o\" or p==\"u\" or p==\"i\":\r\n\t\tcnt+=1\r\nprint(cnt)", "s=input();\r\ncnt = 0;\r\nfor i in range(len(s)) :\r\n if s[i] in ['a','e','i','o','u','1','3','5','7','9'] :\r\n cnt += 1;\r\n \r\nprint(cnt);", "# @author Nayara Souza\r\n# UFCG - Universidade Federal de Campina Grande\r\n# AA - Basico\r\n\r\nvogais = ['a','e','i','o','u']\r\n\r\ncount = 0\r\n\r\nx = input()\r\nfor i in range(len(x)):\r\n\r\n if x[i].isdigit():\r\n if int(x[i]) % 2 != 0:\r\n count += 1\r\n\r\n else:\r\n if x[i] in vogais:\r\n count += 1\r\n\r\nprint(count)", "def competitive(str1):\r\n\r\n ans=0\r\n vow='aeiou'\r\n oh='13579'\r\n for i in str1:\r\n if i in vow or i in oh:\r\n ans+=1\r\n return ans\r\n\r\n\r\n\r\nstr1=input()\r\nprint(competitive(str1))\r\n", "s = input()\ncheck = ['1', '3', '5', '7', '9', 'a', 'e', 'i', 'o', 'u']\ncounts = 0\nfor char in s:\n if char in check:\n counts += 1\n\nprint(counts)", "s=input()\r\ncount=0\r\nfor 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'):\r\n count+=1\r\n elif(s[i]=='1'or s[i]=='3'or s[i]=='5'or s[i]=='7'or s[i]=='9'):\r\n count+=1\r\nprint(count)", "l=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nc=0\r\ns=input()\r\nfor i in s:\r\n if i in l:\r\n c+=1\r\n continue\r\n if i.isdigit() and int(i)%2!=0:\r\n c+=1\r\nprint(c)", "entrada = input()\ncontador = 0\nfor i in entrada:\n\tif i in \"13579aeiou\":\n\t\tcontador+=1\n\nprint(contador)\n \t\t\t \t \t \t\t \t\t\t\t\t \t \t", "vowels = set(['a', 'e', 'i', 'o', 'u'])\n\ncards = input()\n\ncount = 0\nfor i in cards:\n if i in vowels or (i.isdigit() and int(i) % 2 != 0):\n count += 1\nprint(count)", "n=list(input())\r\n \r\ncount =n.count('1')+n.count('3')+n.count('5')+n.count('7')+n.count('9')+n.count('a')+n.count('e')+n.count('i')+n.count('o')+n.count('u')\r\nprint(count)", "s = input()\na = ['a', 'e', 'i', 'o', 'u']\nans = 0\nfor i in range(len(s)):\n if s[i].isalpha() and s[i] not in a:\n continue\n if s[i].isdigit() and ord(s[i]) % 2 == 0:\n continue\n ans += 1\nprint(ans)\n", "word = input()\r\nprint(sum(1 for c in word if c in 'aeiou13579'))", "s = input()\r\nans = 0\r\na = ['1', '3', '5', '7', '9', 'a', 'o', 'u', 'i', 'e']\r\nfor i in range(len(s)):\r\n if (s[i] in a):\r\n ans += 1\r\nprint(ans)", "s = input()\r\ncount = 0\r\nfor e in s:\r\n if e in '13579aeoui':\r\n count+=1\r\nprint(count) ", "\r\ns = input()\r\ncnt = 0\r\nfor i in s :\r\n \r\n if i=='a' or i=='e' or i=='o' or i=='i' or i=='u' :\r\n \r\n cnt = cnt + 1 \r\n \r\n if not(ord(i)>=97 and ord(i)<=122) :\r\n \r\n if int(i)%2 !=0 :\r\n \r\n cnt = cnt + 1 \r\nprint(cnt)", "stri=input()\r\ncount=0\r\nlist1=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nfor i in stri:\r\n\tif i in list1:\r\n\t\tcount+=1\r\n\telif i.isdigit():\r\n\t\tif int(i)%2!=0:\r\n\t\t\tcount+=1\r\nprint(count)\r\n", "cards = input()\r\n\r\nvowels = ['a', 'e', 'i', 'o', 'u']\r\nodd_digits = [\"1\", \"3\", \"5\", \"7\", \"9\"]\r\n\r\ncount = 0\r\nfor letter in cards:\r\n if letter in vowels:\r\n count += 1\r\n elif letter in odd_digits:\r\n count += 1\r\n\r\nprint(count)\r\n", "__author__ = \"Daniel Mitre\"\n\ncards = input()\n\nvowels = 'aeiou'\ndigits = '0123456789'\n\ndef is_odd(n: str) -> bool:\n\treturn (n in digits) and (int(n) % 2 == 1)\n\ntotal = 0\nfor c in cards:\n\tif (c in vowels) or is_odd(c):\n\t\ttotal += 1\n\t\t\nprint(total)\n \t \t \t\t \t \t \t\t \t\t", "s=input()\r\nc=0\r\nvowels=['a','e','i','o','u']\r\nfor i in range(len(s)):\r\n if s[i] in vowels:\r\n c+=1\r\n elif s[i].isnumeric():\r\n x=int(s[i])\r\n if x%2!=0:\r\n c+=1\r\nprint(c)", "a=input()\r\nb=0\r\nfor x in range(len(a)):\r\n\tif 48<=ord(a[x])<=57 and int(a[x])%2!=0:\r\n\t\tb+=1\r\n\telif a[x]==\"a\" or a[x]==\"e\" or a[x]==\"i\" or a[x]==\"o\" or a[x]==\"u\":\r\n\t\tb+=1 \r\nprint(b)", "t = input()\nv = {'a','e','i','o','u'}\nn = {'1','3','5','7','9'}\no = 0\nfor i in t:\n if i in v or i in n:\n o += 1\nprint(o)\n\n\t\t \t \t\t\t \t \t \t\t\t \t \t", "s = input()\ncount = 0\nfor e in s:\n if e in 'aeiou13579':\n count += 1\nprint(count)\n\t \t \t\t\t \t\t\t\t \t \t\t \t \t", "a=input()\r\nprint(sum([a.count(i) for i in 'aeiou13579']))", "s=input()\r\nz=\"aeiou13579\"\r\nans=0\r\nfor x in z:\r\n ans+=s.count(x)\r\nprint(ans)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 6 11:52:07 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\ns = input()\r\nvowel = 'aeiou'\r\nn = len(s)\r\ne = 0\r\nfor i in range(n):\r\n if s[i].isalpha(): \r\n if s[i] in vowel:\r\n e+=1\r\n else:\r\n if int(s[i])%2 !=0:\r\n e+=1\r\nprint(e)", "s = input()\r\nansw = 0\r\nfor e in s:\r\n if e in ['a', 'e', 'i', 'o', 'u']:\r\n answ += 1\r\n elif e in ['1', '3', '5', '7', '9']:\r\n answ += 1\r\n \r\nprint (answ)", "l = [i for i in input().lower()]\nl.sort()\nc = 0\n\nfor i in l:\n if i in ['1','3','5','7','9','a','e','i','o','u']:\n c += 1\n\nprint(c)\n", "############\nprint(sum(i in 'aoeui13579' for i in input()))\n \t \t \t \t \t \t", "word=input()\r\ncounter=0\r\nfor i in word:\r\n if i=='a' or i=='e' or i=='u' or i=='o' or i=='i' :\r\n counter+=1\r\n elif i.isdigit():\r\n if int(i)%2 !=0:\r\n counter += 1\r\nprint(counter)\r\n", "A=input()\r\nS=0\r\nL=[\"a\",\"e\",\"i\",\"o\",\"u\",\"1\",\"3\",\"5\",\"7\",\"9\"]\r\nfor i in A:\r\n if i in L:\r\n S+=1\r\nprint(S)", "\"\"\"\r\n New Year and Counting Cards\r\n\"\"\"\r\ns = input()\r\nflips = 0\r\nfor digit in s:\r\n try:\r\n if(digit == 'a' or digit=='e' or digit=='i' or digit=='o' or digit=='u'):\r\n flips += 1\r\n continue\r\n digit = int(digit)\r\n if(digit % 2 == 1):\r\n flips += 1\r\n except(ValueError):\r\n continue\r\nprint(flips)", "s = input()\r\nc = 0\r\nfor i in s:\r\n if i in ('a', 'e', 'i', 'o', 'u'):\r\n c += 1\r\n elif i in ('1', '3', '5', '7', '9'):\r\n c += 1\r\nprint(c)\r\n", "s = input()\r\na = 0\r\nv = 'aeiou'\r\nn = '13579'\r\nfor i in s:\r\n if i in v or i in n:\r\n a+=1\r\nprint(a)", "s=input()\nc=0\nfor i in range(len(s)):\n if s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u':\n c+=1\n if s[i]=='1' or s[i]=='3' or s[i]=='5' or s[i]=='7' or s[i]=='9':\n c+=1\nprint(c)\n \t\t\t \t\t\t \t \t\t \t \t \t\t \t\t", "S = input()\r\nflips = S.count('a')+S.count('e')+S.count('i')+S.count('o')+S.count('u')\r\nflips += S.count('1')+S.count('3')+S.count('5')+S.count('7')+S.count('9')\r\nprint(flips)", "entrada = input()\n\nmovimentos = 0\nfor char in entrada:\n if char in 'aeiou13579':\n movimentos += 1\n\nprint(movimentos)\n\n\t\t\t \t\t\t \t\t \t \t \t\t \t \t\t \t", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Tue Jan 2 21:26:56 2018\nA. New Year and Counting Cards\ntime limit per test1 second\nmemory limit per test256 megabytes\ninputstandard input\noutputstandard output\nYour friend has n cards.\n\nYou know that each card has a lowercase English letter on one side and a digit on the other.\n\nCurrently, your friend has laid out the cards on a table so only one side of each card is visible.\n\nYou would like to know if the following statement is true for cards that your friend owns:\n\"If a card has a vowel on one side, then it has an even digit on the other side.\" More specifically,\na vowel is one of 'a', 'e', 'i', 'o' or 'u', and even digit is one of '0', '2', '4', '6' or '8'.\n\nFor example, if a card has 'a' on one side, and '6' on the other side, then this statement is true for it.\nAlso, the statement is true, for example, for a card with 'b' and '4', and for a card with 'b' and '3' (since\nthe letter is not a vowel). The statement is false, for example, for card with 'e' and '5'.\nYou are interested if the statement is true for all cards. In particular, if no card has a vowel, the statement is true.\n\nTo determine this, you can flip over some cards to reveal the other side. You would like to know what is the minimum\nnumber of cards you need to flip in the worst case in order to verify that the statement is true.\n\nInput\nThe first and only line of input will contain a string s (1 ≤ |s| ≤ 50), denoting the sides of the cards that you can\nsee on the table currently. Each character of s is either a lowercase English letter or a digit.\n\nOutput\nPrint a single integer, the minimum number of cards you must turn over to verify your claim.\n@author: yefengwang\n\"\"\"\n\ncards = input()\n\ncounter = 0\nfor card in cards:\n if card in ['a','e','i','o','u']:\n counter += 1\n if 48 <= ord(card) <= 57:\n cardnum = ord(card) - 48\n if cardnum % 2 == 1:\n counter += 1\n\nprint(counter)\n", "s = input()\r\nprint(sum(val in '13579aeiou' for val in s))", "print(sum(x in\"aeiou13579\"for x in input()))", "check = [\"a\", \"e\", \"i\", \"o\", \"u\", \"1\", \"3\", \"5\", \"7\", \"9\"]\r\ncards = input()\r\ncnt = 0\r\nfor x in cards:\r\n if x in check:\r\n cnt += 1\r\nprint(cnt)\r\n", "s = input()\r\ncount = 0\r\nfor i in s:\r\n if i in \"aeiou13579\":\r\n count += 1\r\nprint(count)", "s = input()\r\nans = 0\r\nfor c in \"aeiou13579\":\r\n ans += s.count(c)\r\nprint(ans)\r\n", "s = input()\r\ncnt = 0\r\nfor i in s:\r\n if i in [\"a\", \"e\", \"i\", \"o\", \"u\"]:\r\n cnt += 1\r\n elif i.isdigit() and int(i) % 2 != 0:\r\n cnt += 1\r\nprint(cnt)", "import sys\n\n\ndef get_string(): return sys.stdin.readline().strip()\n\n\nstringy = get_string()\n\nstringyLength = len(stringy)\nanswer = 0\n\nfor i in range(stringyLength):\n if (stringy[i] == 'a' or stringy[i] == 'e' or stringy[i] == 'i' or stringy[i] == 'o' or stringy[i] == 'u' or\n stringy[i] == '1' or stringy[i] == '3' or stringy[i] == '5' or stringy[i] == '7' or stringy[i] == '9'):\n answer += 1\nprint(answer)\n\n \t\t\t \t\t\t\t\t \t \t\t\t\t \t \t\t\t\t \t", "cards = input()\n\ncount = 0\n\nvowels = 'aeiou'\nodd = '13579'\n\nfor element in cards:\n if element in vowels or element in odd:\n count += 1\n\nprint(count) \n\n\n\t \t \t\t \t \t\t\t \t \t\t \t\t", "s=set(['a','e','i','o','u','1','3','5','7','9'])\r\nans=0\r\nfor c in input():\r\n if c in s:\r\n ans+=1\r\nprint(ans)", "s=input()\r\nch=('a','e','i','o','u','1','3','5','7','9')\r\ncount=0\r\nfor i in s:\r\n if i in ch:\r\n count+=1\r\nprint(count)\r\n", "palavra = input()\n\ncont = 0\n\nfor i in range(len(palavra)):\n if(palavra[i] == 'a' or palavra[i] == 'e' or palavra[i] == 'i' or palavra[i] == 'o' or palavra[i] == 'u'):\n cont += 1\n elif(palavra[i] == '1' or palavra[i] == '3' or palavra[i] == '5' or palavra[i] == '7' or palavra[i] == '9'):\n cont += 1\n\nprint(cont)\n \t \t\t \t\t \t\t \t \t\t \t\t\t\t \t", "# Año nuevo y tarjetas de conteo\r\nf=lambda x:x%2\r\ng=lambda x:x in \"aeiou\" and 1 or 0\r\ncont=0\r\nfor k in input():\r\n if(k in \"1234567890\"):\r\n cont+=f(int(k))\r\n else:\r\n cont+=g(k)\r\nprint(cont)\r\n \r\n", "x=list(input())\r\nz=['a','e','i','o','u']\r\nk=0\r\nfor i in range(len(x)):\r\n if x[i].isalpha():\r\n if x[i] in z:\r\n k+=1\r\n elif x[i].isdigit():\r\n if int(x[i])%2!=0:\r\n k+=1\r\nprint(k)", "s = input()\r\nb = ['a','e','i','o','u','1','3','5','7','9']\r\n\r\ncount=0\r\nfor i in s:\r\n\tif i in b:\r\n\t\tcount+=1\r\nprint(count)", "print(sum(q in \"aeiou13579\" for q in input()))", "s = input()\r\nres = 0\r\nfor el in s:\r\n if el in ('1', '3', '5', '7', '9'):\r\n res += 1\r\n continue\r\n if el in ('a', 'e', 'i', 'o', 'u'):\r\n res += 1\r\n continue\r\n \r\nprint(res)", "s='aeiou13579'\r\nn=input()\r\ncnt=0\r\nfor i in n:\r\n if i in s:\r\n cnt+=1\r\nprint(cnt)", "s=input()\r\nv=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nd=[\"1\",\"3\",\"5\",\"7\",\"9\"]\r\nans=0\r\nfor x in s:\r\n ans+= (x in v) or (x in d)\r\nprint(ans)\r\n", "s = input()\r\n\r\ntup = ('a','e','i','o','u','1', '3', '5', '7', '9')\r\n\r\nprint(sum(1 for letter in s if letter in tup))", "a = input()\r\nres = 0;\r\nfor i in a:\r\n if i in 'AaEeIiOoUu13579':\r\n res = res + 1\r\n else:\r\n continue\r\nprint(res)", "a=input()\r\ncount=0\r\nfor i in a:\r\n if i in \"aeiou\" or i in \"13579\":\r\n count+=1\r\nprint(count)\r\n", "print(len(list(filter(lambda x: x in ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9'], input()))))", "s=input()\r\ns=list(s)\r\n\r\nl=['a','e','i','o','u','1','3','5','7','9']\r\nc=0\r\nfor i in l:\r\n for j in range(len(s)):\r\n if i==s[j]:\r\n c+=1\r\nprint(c)\r\n", "s = input()\ncount = 0\nfor c in s:\n if c in \"aeiou\":\n count+=1\n if c in \"13579\":\n count += 1\nprint(count)\n\t \t\t \t \t \t \t \t\t \t\t \t \t \t", "d = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\n\ns = input()\nc = 0\nfor i in s:\n if(i in d):\n c += 1\nprint(c)\n \t\t \t \t\t \t \t \t\t\t\t \t\t\t \t \t \t\t", "from sys import stdin\r\n\r\ncards = stdin.readline().strip()\r\n\r\nanswer = 0\r\nvowels = ['a', 'e', 'i', 'o', 'u']\r\nfor i in cards:\r\n if i in vowels:\r\n answer += 1\r\n elif not i.isalpha() and int(i) & 1:\r\n answer += 1\r\n\r\nprint(answer)\r\n", "check_set = set('13579aeiou')\r\nchecks = 0\r\nfor letter in input():\r\n if letter in check_set:\r\n checks += 1\r\nprint(checks)\r\n\r\n\r\n\r\n", "s=input()\r\nvowels='aeiou'\r\nc=0\r\nfor i in s:\r\n if i in vowels:\r\n c+=1\r\n# print('c',c)\r\nfor i in s:\r\n if i.isdigit():\r\n if(int(i)%2!=0):\r\n c+=1\r\nprint(c)", "print(sum(i in \"aeiou13579\" for i in input()))", "vowel_odd = \"aeiou13579\"\r\ns = input()\r\nc = 0\r\nfor char in s:\r\n if char in vowel_odd:\r\n c += 1\r\nprint(c)", "s=input()\r\nt=\"aeiou13579\"\r\nc=0\r\nfor i in s:\r\n if i in t:\r\n c+=1\r\nprint(c)", "l=list(input())\nv=['a','e','i','o','u','1','3','5','7','9']\nc=0\nfor i in range(len(l)):\n if(l[i] in v):\n c+=1\nprint(c)\n \n ", "# flip card that are vowel to check the other side must be even\n# flip card that are odd to make sure the other side is not a vowel.\nmagic = 'aeiou13579'\ns = input()\nprint(sum([1 for i in s if i in magic]))", "a=input()\r\ns=\"aeiou\"\r\nt=0\r\nfor i in a:\r\n if i.isdigit():\r\n if int(i)%2==0:\r\n pass\r\n else:\r\n t +=1\r\n else:\r\n if i in s:\r\n t +=1\r\nprint(t)\r\n \r\n", "string=input()\nc=0\nfor i in string:\n if i in ('a','e','i','o','u') or i in ('1','3','5','7','9'):\n c+=1\n \nprint(c)\n\n \t\t\t \t\t\t \t \t\t \t \t \t \t \t\t \t", "s = input()\r\nvowel = \"aeiou\"\r\ncnt = 0\r\nfor i in s:\r\n\tif i in vowel:\r\n\t\tcnt += 1\r\n\tif i.isdigit():\r\n\t\tif int(i) % 2 == 1:\r\n\t\t\tcnt += 1\r\nprint(cnt)\r\n", "def main():\r\n\ts = input()\r\n\tn = len(s)\r\n\tvowels = {\"a\", \"e\", \"i\", \"o\", \"u\"}\r\n\tc = 0\r\n\tfor i in range(n):\r\n\t\tif s[i] in vowels or (s[i].isdigit() and int(s[i]) % 2):\r\n\t\t\tc += 1\r\n\tprint(c)\r\n\t\r\nmain()", "cards = input()\n\nvowels = ['a', 'e', 'i', 'o', 'u']\neven = ['1', '3', '5', '7', '9']\n\nanswer = 0\nfor i in range(len(cards)):\n if cards[i] in vowels or cards[i] in even:\n answer += 1\n\nprint(answer)\n\n \t\t \t \t \t \t \t\t \t\t\t \t \t \t\t\t\t", "string = input()\n\nvowels = ['a', 'e', 'i', 'o', 'u']\nodd = ['1', '3', '5', '7', '9']\n\nturns = 0\n\nfor s in string:\n if s in vowels or s in odd:\n turns += 1\n\nprint(turns)\n", "s = input()\r\nt = \"aeiou13579\"\r\ncnt = 0\r\nfor c in s:\r\n if c in t:\r\n cnt+=1\r\nprint(cnt)", "s = input()\nnum_need_check = 0\nfor ch in s:\n if ch.isdigit():\n if eval(ch) in [1,3,5,7,9]:\n num_need_check += 1\n else:\n if ch in ['a','e','i','o','u']:\n num_need_check += 1\n\nprint(num_need_check)", "s1=input()\r\ncount=0\r\nfor i in range (len(s1)):\r\n if(s1[i]==\"1\" or s1[i]==\"3\" or s1[i]==\"5\" or s1[i]==\"7\" or s1[i]==\"9\"):\r\n count+=1\r\n elif(s1[i]==\"a\" or s1[i]==\"e\" or s1[i]==\"i\" or s1[i]==\"o\" or s1[i]==\"u\"):\r\n count+=1\r\nprint(count)", "s = input()\n\nvowel = ['a', 'e', 'u', 'i', 'o']\neven = ['0', '2', '4', '6', '8']\nanswer = 0\nfor c in s:\n\tif c.isdigit():\n\t\tif c not in even:\n\t\t\tanswer += 1\n\telse:\n\t\tif c in vowel:\n\t\t\tanswer += 1\nprint(answer)\n", "cards = input()\n\nn_flips = 0\n\nfor s in cards:\n if s in ('a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9'):\n n_flips += 1\n\nprint(n_flips)\n \t\t\t \t\t \t \t\t\t\t\t\t \t \t\t", "str_input = input()\nvalids = \"aeiou13579\"\ncount = 0\nfor char in str_input:\n if(char in valids):\n count += 1\nprint(count)\n\t\t\t\t \t\t \t \t \t \t\t\t\t\t \t\t\t \t", "a = input()\r\ncount = 0\r\nfor i in a:\r\n if i in \"aiueo13579\": count+=1\r\nprint(count)\r\n\r\n\r\n", "f=lambda:map(int,input().split())\r\ns=input()\r\nl='aeiou13579'\r\nprint(sum(i in l for i in s))\r\n", "s = input()\r\ne = ['0','2','4','6','8']\r\nv = ['a','e','i','o','u']\r\nd = ['0','1','2','3','4','5','6','7','8','9']\r\ncount = 0\r\nfor i in range(len(s)):\r\n if s[i] in v:\r\n count = count+1\r\n elif s[i] not in e and s[i] in d :\r\n count = count+1\r\nprint(count)", "def main():\n\ts= input()\n\tcount=0\n\tfor i in s:\n\t\tif i in 'aeiou13579':\n\t\t\tcount+=1\n\tprint(count)\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "s = list(input())\r\nd = {'a', 'u', 'o', 'e', 'i', '1', '3', '5', '7', '9'}\r\nans = 0\r\nfor i in s:\r\n if i in d:\r\n ans += 1\r\nprint(ans)\r\n", "n = input()\r\nl = []\r\ncount = 0\r\nfor i in n:\r\n\tif 97<=ord(i)<=123:\r\n\t\tl.append(i)\r\n\telse:\r\n\t\tif int(i)%2!=0:\r\n\t\t\tcount += 1\r\nfor j in range(len(l)):\r\n\tif l[j]==\"a\" or l[j]==\"e\" or l[j]==\"i\" or l[j]==\"o\" or l[j]==\"u\":\r\n\t\tcount += 1\r\nprint(count)\t\t\r\n", "s = str(input())\r\n\r\nl = [\"a\" ,\"e\" ,\"i\" , \"o\" ,\"u\",\"1\",\"3\",\"5\",\"7\",\"9\"]\r\ncnt = 0\r\nfor x in s:\r\n if x in l:\r\n cnt += 1 \r\nprint(cnt) ", "y=input()\r\nprint(sum(x in 'aeiou' or x in '13579' for x in y))", "s=list(input())\r\ntest=[ 'a', 'e', 'i', 'o', 'u']\r\ncard=0\r\nfor i in s:\r\n try:\r\n if int(i)%2:card+=1\r\n except:\r\n if i in test:card+=1\r\nprint(card)", "arr=list(input().lower())\r\ncnt=0\r\nfor i in arr:\r\n if i in \"aeiou13579\":\r\n cnt+=1\r\nprint(cnt)", "a = input()\r\nb = len(a)\r\ne = 0\r\nfor i in range(b):\r\n if a[i] == '1' or a[i] == '3' or a[i] == '5' or \\\r\n a[i] == '7' or a[i] == '9':\r\n e -= -1\r\n elif a[i] == 'a' or a[i] == 'e' or a[i] == 'i' or \\\r\n a[i] == 'o' or a[i] == 'u':\r\n e += 1\r\nprint(e)\r\n", "# A. New Year and Counting Cards\n\nvowels = ['a', 'e', 'i', 'o', 'u']\neven = ['0', '2', '4', '6', '8']\ns = input()\nans = 0\nfor i in s:\n if i in vowels or (i.isdigit() and (i not in even)):\n ans += 1\nprint(ans)\n", "s = list(input())\rans = 0\rgl = ['a', 'e', 'i', 'o', 'u']\rnums = ['1', '3', '5', '7', '9']\ri = 0\rwhile i < len(s):\r if (s[i] in gl) or (s[i] in nums):\r ans += 1\r i += 1\rprint(ans)", "s=input()\r\ncount=0\r\nv=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nfor i in s:\r\n if(i in v):\r\n count+=1\r\n if(ord(i)>=48 and ord(i)<=57):\r\n if(int(i)%2!=0):\r\n count+=1\r\nprint(count)", "x = \"aeiou13579\"\ncount = 0\nfor i in input():\n\tif i in x:\n\t\tcount+=1\nprint (count)", "s=input()\r\ncount=0\r\nfor i in range(len(s)):\r\n if(ord(s[i])==55 or ord(s[i])==53 or ord(s[i])==57 or ord(s[i])==51 or ord(s[i])==49 or ord(s[i])==97 or ord(s[i])==101 or ord(s[i])==105 or ord(s[i])==111 or ord(s[i])==117):\r\n count+=1\r\nprint(count)", "cards = input()\n\nvowels = ['a', 'e', 'i', 'o', 'u']\nnumbers = ['1','3','5','7','9']\nsteps = 0\n\nfor i in range(len(cards)):\n if cards[i] in vowels or cards[i] in numbers:\n steps += 1\n\nprint(steps)\n\t\t \t \t\t\t \t\t \t \t \t\t \t \t \t\t\t\t\t\t", "def min_cards_to_flip(s):\r\n vowels = \"aeiou\"\r\n odd_digits = \"13579\"\r\n\r\n vowel_count = sum(1 for char in s if char in vowels)\r\n odd_digit_count = sum(1 for char in s if char in odd_digits)\r\n\r\n return vowel_count+odd_digit_count\r\n\r\n# Input\r\ns = input().strip()\r\n\r\n# Calculate and print the minimum number of cards to flip\r\nresult = min_cards_to_flip(s)\r\nprint(result)\r\n\r\n", "s = input()\ncount = 0\nfor letter in s:\n if letter in {'a', 'e', 'i', 'o', 'u'}:\n count += 1\n try:\n if int(letter) % 2 == 1:\n count += 1\n except:\n pass\nprint(count)\n \t \t\t \t \t\t\t \t\t \t\t", "s = input()\nvowels = 'aeiou'\nc = 0\nfor i in s:\n if i in vowels:\n c += 1\n else:\n try:\n if int(i) % 2 == 1:\n c += 1\n except:\n pass\nprint(c)", "def solve(n):\r\n\r\n count = 0\r\n for x in n:\r\n if x == 'a' or x == 'e' or x == 'i' or x == 'o' or x == 'u':\r\n count += 1\r\n elif ord(x) <= 48 or ord(x) <= 57:\r\n if int(x) % 2 != 0:\r\n count += 1\r\n\r\n return count\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = list(input())\r\n print(solve(n))\r\n", "def isvowel(c):\r\n if(c==\"a\" or c==\"e\" or c==\"i\" or c==\"o\" or c==\"u\" ):\r\n return True\r\n \r\n else: return False\r\ndef isodd(c):\r\n if(c==\"0\" or c==\"1\" or c==\"2\" or c==\"3\" or c==\"4\" or c==\"5\" or c==\"6\" or c==\"7\" or c==\"8\" or c==\"9\" ):\r\n if(int(c)%2!=0):\r\n return True\r\n else:return False\r\n \r\n else: pass\r\ns = input()\r\ncount = 0\r\nfor i in s:\r\n if(isvowel(i)==True or isodd(i)==True ):\r\n count+=1\r\n \r\nprint(count)", "import collections\r\n\r\n#####################################\r\n\r\ns = input()\r\n\r\nr = 0\r\n\r\nfor c in s:\r\n if c in {'a','e','i','o','u','1','3','5','7','9'}:\r\n r = r+1\r\n\r\nprint(r)\r\n", "s=input()\r\np=0\r\na=[\"1\",\"3\",\"5\",\"7\",\"9\",\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nfor i in s:\r\n\tif i in a:\r\n\t\tp+=1\r\nprint(p)\t\t \r\n", "s=input()\r\nv=\"aeiou13579\"\r\nprint(sum(i in v for i in s))", "cards = input()\n\nanswer = 0\n\nvowels = ['a', 'e', 'i', 'o', 'u']\nodds = ['1', '3', '5', '7', '9']\n\nfor i in range(len(cards)):\n\tif cards[i] in vowels:\n\t\tanswer += 1\n\telif cards[i] in odds:\n\t\tanswer += 1\n\nprint(answer)\n\t\t \t \t\t\t\t\t \t \t\t\t\t\t \t \t \t", "VOCAB = {'a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9'}\r\n\r\n\r\nif __name__ == '__main__':\r\n res = 0\r\n for ch in input():\r\n res += ch in VOCAB\r\n print(res)\r\n", "s=input()\r\na=s.count(\"a\")\r\ne=s.count(\"e\")\r\ni=s.count(\"i\")\r\no=s.count(\"o\")\r\nu=s.count(\"u\")\r\nnum1=s.count(\"1\")\r\nnum3=s.count(\"3\")\r\nnum5=s.count(\"5\")\r\nnum7=s.count(\"7\")\r\nnum9=s.count(\"9\")\r\nprint(a+e+i+o+u+num1+num3+num5+num7+num9)", "import sys\r\nfrom math import sqrt, floor, factorial\r\nfrom collections import deque, Counter\r\ninp = sys.stdin.readline\r\nread = lambda: list(map(int, inp().strip().split()))\r\ndef gcd(a, b):\r\n\tmini = min(a,b)\r\n\tmaxi = max(a,b)\r\n\twhile maxi % mini != 0:\r\n\t\tmaxi, mini = mini, maxi%mini\r\n\treturn(mini)\r\n\r\ndef solve():\r\n\ts = inp().strip(); v_set = {\"a\", \"e\", \"i\", \"o\", \"u\"}; ans = 0\r\n\tfor i in s:\r\n\t\tif i.isalpha():ans += (i in v_set)\r\n\t\telse:ans += (int(i)%2 == 1)\r\n\tprint(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsolve()", "cards = list(input())\r\nclaimlist = [\"a\", \"e\", \"i\",\"o\", \"u\", \"1\", \"3\", \"5\", \"7\", \"9\"]\r\ne = 0\r\nfor i in cards:\r\n if i in claimlist:\r\n e+=1 \r\nprint(e)", "a=list(input())\r\nb=['a','e','i','o','u','1','3','5','7','9']\r\nans=0\r\nfor i in a:\r\n if i in b:\r\n ans+=1\r\nprint(ans)", "s = input()\r\n\r\nc = 0\r\nfor 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':\r\n c = c + 1\r\n\r\n elif s[i] == '1' or s[i] == '3' or s[i] == '5' or s[i] == '7' or s[i] == '9':\r\n c = c + 1\r\n\r\nprint(c)", "import re\ns = input(\"\")\nx = re.findall(\"a|e|i|o|u|[13579]\", s)\nprint(len(x))\n \t \t\t\t \t \t \t\t \t \t \t\t\t\t \t\t", "s = input()\n\nprint(len([i for i in s if i in\"aeiou13579\"]))\n", "a=input()\r\ns=0\r\nfor i in a:\r\n for j in \"aeiou13579\":\r\n if i==j:\r\n s=s+1\r\nprint(s)\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\n\r\na=list(input())\r\ncount=0\r\nb=['a','e','i','o','u']\r\ne=['1','3','5','7','9']\r\nfor x in range(len(a)):\r\n\tif a[x] in b:\r\n\t\tcount+=1\r\n\telif a[x] in e:\r\n\t\tcount+=1\r\nprint(count)", "deck = input()\r\n\r\nvowels = ['a', 'e', 'i', 'o', 'u'] \r\nconsoants = ['b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'm', 'n', 'p', 'q', 'r', 's', 't', 'v', 'w', 'x', 'y', 'z']\r\n\r\nres = 0\r\n\r\nfor i in range(len(deck)):\r\n if deck[i] in vowels:\r\n res += 1\r\n elif deck[i] in consoants:\r\n continue\r\n elif int(deck[i]) % 2 == 1:\r\n res += 1\r\n \r\nprint(res)", "s = list(input())\r\nc = 0\r\nb = ['a','e','i','o','u','1','3','5','7','9']\r\nfor i in range(len(s)):\r\n if(s[i] in b):\r\n c += 1\r\nprint(c) ", "a=input()\r\ns=0\r\nfor i in range(len(a)):\r\n if a[i]=='a' or a[i]=='e' or a[i]=='i'or a[i]=='o'or a[i]=='u'or a[i]=='1'or a[i]=='3'or a[i]=='5' or a[i]=='7' or a[i]=='9':\r\n s=s+1\r\nprint(s)\r\n \r\n\r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n", "n=input()\r\nv=['a', 'e', 'i', 'o','u']\r\ne=[\"0\",\"2\",\"4\",\"6\",\"8\"]\r\nc=0\r\nfor i in range(len(n)):\r\n\tif (n[i] in v):\r\n\t\tc+=1\r\n\ttry:\r\n\t\tif int(n[i])%2!=0:\r\n\t\t\tc+=1\r\n\texcept:\r\n\t\tpass\r\nprint(c)", "needs_flipping = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\r\n \r\ndef flip(s):\r\n flip_count = 0\r\n for letter in s:\r\n if letter in needs_flipping:\r\n flip_count += 1\r\n return flip_count\r\n \r\nprint(flip(input()))\r\n", "s = input()\nvan = 0\nfor i in s:\n\tif i in 'aeiou':\n\t\tvan += 1\n\tif i in '13579':\n\t\tvan += 1\nprint(van)\n# easy mode ; # also hard!!!!!!!!\n", "s = str(input())\r\nres = 0\r\nvowels = \"aeiou\"\r\nvowel_set = set(vowels)\r\n\r\nfor i in s:\r\n if i.isdigit() and int(i) % 2 != 0:\r\n res += 1\r\n elif i in vowel_set:\r\n res += 1\r\n\r\nprint(res)", "s=input()\r\nss='13579aeiou'\r\nc=0\r\nfor i in s:\r\n if(i in ss):\r\n c+=1\r\n \r\nprint(c)\r\n", "s = input()\nc = 0\nfor i in s:\n if i in 'aeiou13579':\n c+=1\nprint(c)\n\n \t \t\t\t\t\t \t \t\t\t \t \t \t", "if __name__ == '__main__':\r\n s = input()\r\n a = '13579ueoai'\r\n lst = []\r\n for i in s:\r\n if i in a:\r\n lst.append(i)\r\n print(len(lst))", "\r\nstr_val = input()\r\nans = 0\r\nfor i in str_val:\r\n if i in 'aeiou':\r\n ans += 1\r\n elif i.isnumeric() and int(i) % 2 != 0:\r\n ans += 1\r\n\r\nprint(ans)", "def main():\n S = input()\n\n cards = len(S)\n for s in S:\n if s.isdigit():\n if not int(s) & 1:\n cards -= 1\n elif not s in ('a', 'i', 'u', 'e', 'o'):\n cards -= 1\n print(cards)\n\nmain()\n", "s=input()\r\ns=list(s)\r\nc=0\r\nfor 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':\r\n c+=1\r\n elif s[i]>='a' and s[i]<='z':\r\n c+=0\r\n elif int(int(s[i])%2)!=0:\r\n c+=1\r\nprint(c)", "str=input()\nn=len(str)\nb=['a','e','i','o','u']\nk=0\nfor i in range(n):\n if (str[i] in b):\n k+=1\nfor i in range(n):\n try:\n c=int(str[i])\n if(c%2==1):\n k+=1\n except:\n pass\nprint(k)\n \t \t \t \t \t \t\t\t \t\t \t\t \t", "s = input()\r\nans = 0\r\ncheck = [\"a\", \"e\", \"i\", \"o\", \"u\", \"1\", \"3\", \"5\", \"7\", \"9\"]\r\nfor c in s:\r\n if c in check:\r\n ans += 1\r\nprint(ans)", "cartas = input()\ncontador = 0\nfor a in cartas:\n if a in \"aeiou13579\":\n contador += 1\nprint(contador)\n\t \t\t\t\t\t\t \t \t \t\t \t\t", "a = input()\ntotal = 0\nfor c in a:\n if (c in ['a','e','i','o','u','1','3','5','7','9']):\n total += 1\nprint(total)\n", "s=input()\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i] in ['a','e','i','o','u']:\r\n c+=1\r\n if s[i].isdigit():\r\n if int(s[i])%2!=0:\r\n c+=1\r\nprint (c) \r\n ", "vogais = 'aeiou'\r\nodd = '13579'\r\na = input()\r\nans = 0\r\nfor i in a:\r\n if i in vogais or i in odd:\r\n ans += 1\r\nprint(ans)", "ans=0\r\nt=\"0123456789\"\r\nvo=\"aeiou\"\r\ns=input()\r\nfor i in s:\r\n if i not in t:\r\n if i in vo:\r\n ans+=1\r\n else:\r\n if i in \"13579\":\r\n ans+=1\r\nprint(ans) \r\n", "n=input()\r\nhasil=0\r\nx=['a','i','u','e','o','1','3','5','7','9']\r\nfor i in range(len(n)):\r\n for j in range(len(x)):\r\n if(n[i]==x[j]):\r\n hasil+=1\r\nprint(hasil)\r\n", "s=input()\r\n\r\ndef is_evenvowel(a):\r\n\tif a==\"a\" or a==\"e\" or a==\"i\" or a==\"o\" or a==\"u\":\r\n\t\treturn True\r\n\tif a==\"1\" or a==\"3\" or a==\"5\" or a==\"7\" or a==\"9\":\r\n\t\treturn True\r\n\telse:\r\n\t\treturn False\r\ndef check(s):\r\n\tdef loop(x,a):\r\n\t\tif x<len(s):\r\n\t\t\tif is_evenvowel(s[x]):\r\n\t\t\t\treturn loop(x+1,a+1)\r\n\t\t\telse:\r\n\t\t\t\treturn loop(x+1,a)\r\n\t\treturn a\r\n\treturn loop(0,0)\r\n\r\nprint (check(s))", "print(len([x for x in input() if x in \"aeiou13579\"]))", "s=(input())\r\nv='aeiou'\r\nd='13579'\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i] in v or s[i] in d:\r\n c+=1\r\nprint(c)", "cards = input()\nvowels_and_odd_digits = \"aeiou13579\"\ncounter = 0\nfor card in cards:\n if card in vowels_and_odd_digits:\n counter += 1\n\nprint(counter)", "s=input()\r\nprint(s.count('1')+s.count('3')+s.count('5')+s.count('7')+s.count('9')+s.count('a')+s.count('e')+s.count('o')+s.count('u')+s.count('i'))", "# import sys\r\n# sys.stdin = open(\"test.in\",\"r\")\r\n# sys.stdout = open(\"test.out\",\"w\")\r\na=input()\r\nb=['a','e','i','o','u','1','3','5','7','9']\r\nc=0\r\nfor i in a:\r\n\tif i in b:\r\n\t\tc+=1\r\nprint(c)\t\t", "s = input()\r\ncardsTurned: int = 0\r\ni = 0\r\nwhile i < len(s):\r\n if s[i].isdigit():\r\n if int(s[i]) % 2 != 0:\r\n cardsTurned += 1\r\n elif s[i] in {'a', 'e', 'u', 'i', 'o'}:\r\n cardsTurned += 1\r\n\r\n i += 1\r\nprint(cardsTurned)\r\n", "def main():\n x=input()\n count=0\n for i in x:\n if i in ['a','e','i','o','u','1','3','5','7','9']:\n count+=1\n print(count)\n\nmain()\n\n \t \t \t\t\t \t \t\t\t\t \t\t\t", "a=input()\r\ncount=0\r\nfor k in a:\r\n if k in 'aeiou13579':\r\n count+=1\r\nprint(count)", "ans=0\r\nfor i in input():\r\n ans+=i in 'aoeiu13579'\r\nprint(ans)", "respostas = [49, 51, 53, 55, 57, 97, 101, 105, 111, 117]\nstring = input()\nerros = 0\nfor i in string:\n if int(ord(i)) in respostas:\n erros += 1\nprint(erros)\n\t\t\t\t \t \t \t\t\t \t\t \t\t \t\t \t", "s = input()\r\ncount = 0\r\nfor i in range(0,len(s)):\r\n if(s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u'):\r\n count += 1\r\n elif(s[i]=='1' or s[i]=='3' or s[i]=='5' or s[i]=='7' or s[i]=='9'):\r\n count += 1\r\nprint(count)", "str = input()\r\ncn = 0;\r\n\r\nfor c in str:\r\n if c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u' or c == '1' or c == '3' or c == '5' or c == '7' or c == '9':\r\n cn += 1\r\n\r\nprint(cn)", "def need_flip(card):\n verifications = set({\n 'a','e','i','o','u',\n '1','3','5','7','9'\n })\n return card in verifications\n\nflips = 0\n\nfor card in input():\n if need_flip(card):\n flips += 1\n\nprint(flips)\n \t\t \t \t \t\t \t\t \t\t \t\t\t\t\t\t\t\t\t \t", "s=input()\r\nc=0\r\nfor i in s:\r\n if(i=='1'or i=='3'or i=='5'or i=='7'or i=='9'or i=='e'or i=='a'or i=='i' or i=='u'or i=='o'):\r\n c+=1\r\n \r\nprint(c)\r\n", "n=input()\r\nvowel=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nx=0\r\nfor i in n:\r\n if i.isalpha():\r\n if i in vowel:\r\n x+=1\r\n elif i.isnumeric():\r\n if int(i)%2==1:\r\n x+=1\r\nprint(x)", "s = input()\r\ncnt = 0\r\nfor c in s:\r\n cnt += 1 if c in \"aeiou13579\" else 0\r\nprint(cnt)", "l=['a','e','i','o','u']\r\nl1=['1','3','5','7','9']\r\ns=list(input())\r\nc=0\r\nfor i in s:\r\n\tif i in l:\r\n\t\tc+=1\r\n\telif i in l1:\r\n\t\tc+=1\r\nprint(c)", "a = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\r\nsum = 0\r\nb = input()\r\nfor i in b:\r\n if i in a:\r\n sum += 1\r\nprint(sum)", "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(list(\"aeiou13579\"))\r\nans = 0\r\nfor i in s:\r\n if i in u:\r\n ans += 1\r\nprint(ans)", "from collections import Counter\nc=Counter(input())\nprint(sum(c[i] for i in 'aeiou13579'))\n\n \n \n", "entrada = input()\r\nentrada = list(map(str, entrada))\r\ncont = 0\r\nfor i in entrada:\r\n\tif i in [\"a\", \"e\", \"i\", \"o\", \"u\", \"1\", \"3\", \"5\", \"7\", \"9\"]:\r\n\t\tcont += 1\r\nprint(cont)", "#New year and counting Cards\r\ns = input()\r\nc = 0\r\nfor i in s:\r\n if i in ['a','e','i','o','u']:\r\n c+=1\r\n elif i in ['1','3','5','7','9']:\r\n c+=1\r\nprint(c)", "entrada = str(input())\nviradas = 0\n\nvogais = ['a', 'e', 'i', 'o', 'u']\nimpares = ['1', '3', '5', '7', '9']\n\nfor i in range(len(entrada)):\n if (entrada[i] in vogais) or (entrada[i] in impares):\n viradas += 1\n\nprint(viradas)\n \t\t \t \t\t\t \t\t\t \t \t \t \t\t", "from collections import defaultdict as dd\r\nfrom collections import deque\r\nimport bisect\r\nimport heapq\r\n\r\ndef ri():\r\n return int(input())\r\n\r\ndef rl():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n s = input()\r\n # claim vowel => even\r\n # So, need to check vowel and odd\r\n ans = 0\r\n for c in s:\r\n if c in \"aeoui13579\":\r\n ans += 1\r\n print (ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmode = 's'\r\n\r\nif mode == 'T':\r\n t = ri()\r\n for i in range(t):\r\n solve()\r\nelse:\r\n solve()\r\n", "#!/usr/bin/env python3\n\ninf = float('inf')\nread_ints = lambda : list(map(int, input().split()))\n\ndef solve(arr):\n return 42\n\nif __name__ == '__main__':\n special = 'aeiou13579'\n print(len(list(filter(lambda l: l in special, input()))))\n", "s = list(input())\r\n\r\nflip = 0\r\n\r\nfor i in s:\r\n if i.isdigit():\r\n if int(i) % 2 != 0:\r\n flip += 1\r\n elif i in [\"a\", \"e\", \"i\", \"o\", \"u\"]:\r\n flip += 1\r\n\r\nprint(flip)\r\n", "f_cards = {'a', 'e', 'i', 'o', 'u'}\r\nans = 0\r\nfor i in input():\r\n if i in f_cards:\r\n ans += 1\r\n if i.isdigit() and int(i) % 2 == 1:\r\n ans += 1\r\n\r\nprint(ans)", "s = input()\r\ncnt = 0\r\nfor c in s:\r\n cnt += 1 if \"aeiou13579\".find(c) != -1 else 0\r\nprint(cnt)", "cards = input()\ncont = 0\n\nfor i in cards:\n if(i.isdigit()):\n if(int(i)%2 !=0):\n cont = cont+1\n elif(i in 'aeiou'):\n cont = cont+1\n\nprint(cont)\n\t \t \t\t\t \t \t \t\t\t \t \t \t \t \t\t\t", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\na=input()\r\nl='aeiou13579'\r\nn=0\r\nfor i in a:\r\n\tif i in l:\r\n\t\tn+= 1\r\nprint(n)", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\nvov = \"aeiou\"\r\ndigs = \"0123456789\"\r\n\r\nll = list(input())\r\nvc = 0\r\ncc = 0\r\nodd=0\r\nfor i in range(len(ll)):\r\n if ll[i] in vov:\r\n vc+=1\r\n elif ll[i] not in vov and ll[i] not in digs:\r\n cc+=1\r\n elif ll[i] in digs and int(ll[i])%2!=0:\r\n odd+=1\r\nprint(vc+odd)", "print((lambda y: sum(map(lambda x: y.count(x), '13579aeiou')))(input()))", "n=list(input())\r\na,b=0,['a','e','i','o','u','1','3','5','7','9']\r\nfor i in n:\r\n\tif i in b:\r\n\t\ta+=1\r\nprint(a)", "s = input()\r\nlst = list('aeiou13579')\r\ncount = 0\r\nfor i in s:\r\n if i in lst:\r\n count += 1 \r\nprint(count)\r\n", "ans=0\r\nfor i in input():\r\n if i in 'aeoui13579':ans+=1\r\nprint(ans)", "\r\nn=list(input())\r\nc=0\r\nfor i in range(len(n)):\r\n\ta=n[i]\r\n\tif(a==\"a\" or a==\"e\" or a==\"i\" or a==\"o\" or a==\"u\" or a==\"1\" or a==\"3\" or a==\"5\" or a==\"7\" or a==\"9\"):\r\n\t\tc+=1\r\n\t\t\r\nprint(c)\r\n\t", "s=input()\r\nchk='aeiou13579'\r\ncnt=0\r\nfor i in s:\r\n if i in chk:\r\n cnt+=1\r\nprint(cnt)", "a = input()\r\nx = 'aeiou13579'\r\nprint(sum(a.count(i) for i in x))", "\r\n\r\n\r\na=input()\r\n\r\nf=['a','e','i','o','u']\r\n\r\n\r\nr=0\r\nfor j in range(len(a)):\r\n t=ord(a[j])\r\n if 97<=t<=122:\r\n if a[j] in f:\r\n r+=1\r\n else:\r\n if int(a[j])%2!=0:\r\n r+=1\r\n\r\nprint(r)\r\n", "s = input()\r\n\r\nvowel = \"aeiou\"\r\nk = 0\r\nfor x in s:\r\n try:\r\n if int(x) % 2 == 1:\r\n k += 1\r\n except ValueError:\r\n if x in vowel:\r\n k += 1\r\n\r\nprint(k)\r\n", "\r\ns=input()\r\nc=0\r\nfor i in s:\r\n\tif i.isdigit() and int(i)%2!=0:\r\n\t\tc+=1\r\n\telif i in [\"a\",\"e\",\"i\",\"o\",\"u\"]:\r\n\t\tc+=1\r\nprint(c)", "n = input()\r\na = {'a': 1, 'e': 2, 'i': 3, 'o': 4, 'u': 5, '1': 6, '3': 7, '5': 8, '7': 9, '9': 10}\r\npaso = 0\r\nfor i in range(len(n)):\r\n\r\n if n[i] not in a:\r\n continue\r\n else:\r\n paso = paso+1\r\n \r\nprint(paso)", "entrada = input()\n\nx = list(entrada)\ninpares = ['1','3','5','7','9']\nvogais = ['a','e','i','o','u']\ncont = 0\n\nfor i in x:\n \n if (i in vogais) or (i in inpares):\n cont += 1\n\nprint(cont)\n\t\t \t\t\t \t \t\t \t \t \t \t\t\t", "s = input()\r\nprint(sum(s.count(i)\r\n for i in \"aeiou13579\"))\r\n", "from sys import stdin,stdout\r\ninput=stdin.readline\r\nstring1=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nstring=input()\r\ncount=0\r\nfor i in string:\r\n if i in string1:\r\n count+=1\r\n elif ord(i)&1 and 48<=ord(i)<=57:\r\n count+=1\r\n else:\r\n continue\r\nprint(count)\r\n", "print(len([1 for x in input() if x in 'aeiou13579']))", "s = str(input())\r\ncards = 0\r\nvowels = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\r\nfor i in range(len(s)):\r\n\tif s[i] in vowels:\r\n\t\tcards += 1\r\nprint(cards)", "n = input()\r\ncount = 0\r\nfor i in range(len(n)):\r\n if n[i] in ['1', '3', '5', '7', '9', 'a', 'e', 'i', 'u', 'o']:\r\n count += 1\r\nprint(count)", "s = input()\r\nc = [\"a\", \"o\", \"u\", \"i\", \"e\", \"1\", \"3\", \"5\", \"7\", \"9\"]\r\nt = 0\r\nfor ch in s:\r\n if ch in c:\r\n t += 1\r\nprint(t)", "s = input(\"\")\r\ncount = 0\r\nfor i in s:\r\n if i in \"aeiou13579\":\r\n count +=1\r\nprint (count)", "s = input()\r\ncount = 0\r\nturns = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\r\nfor turn in turns:\r\n count += s.count(turn)\r\nprint(count)\r\n", "vogais = ['a', 'e', 'i', 'o', 'u']\nimpar = ['1', '3', '5', '7', '9']\ncount = 0\n\nstring = list(input())\nfor l in string:\n if l in vogais or l in impar:\n count += 1\n\nprint(count)\n\t \t\t \t \t \t\t \t\t \t\t\t \t\t\t\t\t\t", "#collaborated with Prasoon Shakya\ns=list(input())\nchecker_var=['a','e','i','o','u','1','3','5','7','9']\ncounter=0\nfor i in s:\n if i in checker_var:\n counter+=1\nprint(counter)\n\t \t \t\t\t \t\t\t \t\t\t\t\t\t \t \t\t\t", "s = set(['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9'])\nt = 0\nfor i in input():\n if i in s:\n t += 1\nprint(t)\n", "if __name__ == '__main__' :\r\n s = input()\r\n c = 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] == '1' or s[i] == '3' or s[i] == '5' or s[i] == '7' or s[i] == '9' :\r\n c = c+1\r\n print(c)", "a = input()\r\nb = \"aeiou13579\"\r\ncnt =0 \r\nfor i in range(len(a)):\r\n if a[i] in b : \r\n cnt+=1 \r\nprint(cnt) ", "cards = input()\n\nhaveToSee = 0\n\nfor character in cards:\n\tif character in 'aeiou13579':\n\t\thaveToSee += 1\n\nprint(haveToSee)\n \t \t \t\t\t \t \t\t \t\t\t \t \t", "s=str(input())\r\nsum=0\r\nl=len(s)\r\nfor i in range(0,l,1):\r\n if(s[i]=='a'or s[i]=='e'or s[i]=='i'or s[i]=='o'or s[i]=='u'):\r\n sum+=1\r\n elif(s[i]=='1'or s[i]=='3'or s[i]=='5'or s[i]=='7'or s[i]=='9'):\r\n sum+=1\r\nprint(sum)\r\n", "str = input()\r\nsum=0\r\nfor i in range(0,len(str)):\r\n if str[i]==\"1\" or str[i]==\"3\" or str[i]==\"5\" or str[i]==\"7\" or str[i]==\"9\" or str[i]==\"a\" or str[i]==\"e\" or str[i]==\"i\" or str[i]==\"o\" or str[i]==\"u\":sum+=1\r\nprint(sum)", "s,c=input(),0\r\nfor x in s:\r\n if x=='a' or x=='e' or x=='i' or x=='o' or x=='u':c+=1\r\n elif x.isnumeric():\r\n if int(x)%2!=0:c+=1\r\nprint(c)", "\naux = [\"a\", \"e\", \"i\", \"o\", \"u\", \"1\", \"3\", \"5\", \"7\", \"9\"]\ndef func(string):\n count = 0\n for el in string:\n if el in aux:\n count+=1\n return count\n \nstring = str(input())\nprint(func(string))\n\n\n \t\t\t\t \t\t\t \t \t \t\t\t \t\t\t \t\t", "vowels_and_even_numbers = ['1', '3', '5', '7', '9', 'a' ,'e', 'i', 'o', 'u']\nminimum = 0\ns = input()\n\nfor char in s:\n\tif char in vowels_and_even_numbers:\n\t\tminimum += 1\n\nprint(minimum)\n \t\t\t\t \t \t \t \t \t\t\t\t \t", "s = input()\r\n\r\nflips = 0\r\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\nodd_digits = [\"1\", \"3\", \"5\", \"7\", \"9\"]\r\nfor c in s:\r\n if c in vowels or c in odd_digits:\r\n flips += 1\r\n\r\nprint(str(flips))\r\n", "s=\"aoeiu13579\"\r\nx=input()\r\nk=0\r\nfor i in x:\r\n if i in s:\r\n k += 1\r\nprint(k)", "caracteres_para_checar = ['a','e','i','o','u','1','3','5','7','9']\nvirar = 0\ncartas = input()\n\nfor i in range(len(cartas)):\n if (cartas[i] in caracteres_para_checar):\n virar += 1\n\nprint(virar)\n \t \t\t\t\t\t \t \t\t \t\t \t\t\t\t\t\t\t", "a = \"aeiou\"\r\nd = {c:True for c in a}\r\ncnt = 0\r\ns = input()\r\nfor c in s:\r\n if c.isalpha():\r\n if d.get(c):\r\n cnt += 1\r\n elif int(c) % 2:\r\n cnt += 1\r\nprint(cnt)", "vowels = ['a', 'e', 'i', 'o', 'u']\nodds = ['1', '3', '5', '7', '9']\ncheck = 0\ncards = input()\n\nfor s in cards:\n if s in vowels or s in odds:\n check += 1\n\nprint(check)\n \t \t \t\t\t\t\t\t\t\t\t\t\t\t \t\t \t\t", "n=input()\r\ncnt=0\r\n\r\nfor i in n:\r\n if i==\"a\" or i==\"o\" or i==\"u\" or i==\"e\" or i==\"i\":\r\n cnt+=1\r\n if i.isdigit()==True:\r\n if int(i)%2==1:\r\n cnt+=1\r\nprint(cnt)\r\n ", "s=input()\r\nt=0\r\nfor i in s:\r\n if ord(i)==97 or ord(i)==101 or ord(i)==105 or ord(i)==111 or ord(i)==117 or ord(i)==49 or ord(i)==51 or ord(i)==53 or ord(i)==55 or ord(i)==57:\r\n t+=1\r\nprint(t)", "print(input().translate(str.maketrans('aeiou13579','!!!!!!!!!!')).count('!'))", "s = input()\r\nprint(len([char for char in s if char in 'aeiou13579']))", "n = input()\n\ncount = 0\n\nfor i in n:\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\n count += 1\n elif i == '1' or i == '3' or i == '5' or i == '7' or i == '9':\n count += 1\n\nprint(count) ", "print(len(list(filter(lambda x: x in \"aeiou13579\",input()))))\r\n", "test_string = input()\nturns = 0\n\nfor char in test_string:\n if char in ['1', '3', '5', '7', '9', 'a', 'e', 'i', 'o', 'u']:\n turns += 1\n\nprint(turns)\n \t\t\t \t\t\t \t\t \t \t \t \t\t\t \t\t\t\t", "cartas = input()\nvogais = [\"a\", \"e\", \"i\", \"o\", \"u\"]\nnum = [\"1\", \"3\", \"5\", \"7\", \"9\"]\ncont = 0\n\nfor e in cartas:\n\tif e in vogais or e in num:\n\t\tcont += 1\n\nprint(cont)\t\n\n \t \t\t \t\t\t\t\t \t\t\t \t\t \t\t\t\t \t \t \t", "def add_count(c):\n\treturn c + 1\n\nentry = input()\ncount = 0\n\nswitcher = {\n\t\"a\": add_count, \"e\": add_count, \"i\": add_count, \"o\": add_count, \"u\": add_count,\n\t\"1\": add_count, \"3\": add_count, \"5\": add_count, \"7\": add_count, \"9\": add_count\n}\nfor letter in entry:\n\tfunc = switcher.get(letter) or \"Erro\"\n\tif func != \"Erro\":\n\t\tcount = func(count)\n\nprint(count)\n\n\t\t \t\t \t \t\t\t\t \t \t \t\t\t\t\t", "s = input()\r\ncnt = 0\r\nlis = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\nnum = [\"1\", \"3\", \"5\", \"7\", \"9\"]\r\nfor i in s:\r\n if i in lis: cnt += 1\r\n if i in num: cnt += 1\r\nprint(cnt)", "s = input()\r\nvowels = ['a','e','i','o','u']\r\nodds = ['1','3','5','7','9']\r\nt = 0\r\nfor i in s:\r\n if i in vowels:\r\n t += 1\r\n if i in odds:\r\n t += 1\r\nprint(t)", "print(len([i for i in input() if i in 'aeoiu13579']))", "z=input()\r\ncount=0\r\nfor i in z :\r\n if i.isalpha() :\r\n if i==\"a\" or i==\"e\" or i==\"i\" or i==\"o\" or i==\"u\" :\r\n count+=1\r\n else :\r\n if int(i)%2!=0 :\r\n count+=1\r\n\r\nprint(count)", "def A1():\n s = input()\n cnt = 0\n vowels = ['a', 'e', 'i', 'o', 'u']\n even = ['0', '2', '4', '6', '8']\n for i in s:\n\n if i.isalpha() and i in vowels:\n cnt +=1\n if not i.isalpha() and i not in even:\n cnt +=1\n\n print(cnt)\n\nif __name__=='__main__':\n A1()\n\t \t \t \t \t \t\t\t \t \t\t\t\t\t \t \t", "s=str(input())\r\nc=0\r\nfor i in s:\r\n if(i=='a' or i=='e' or i=='i' or i=='o' or i=='u'):\r\n c+=1\r\n elif(ord(i)<97 and int(i)%2!=0): \r\n c+=1\r\nprint(c)", "s = input()\nans = 0;\nfor i in s:\n\tif i in ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']:\n\t\tans+=1\nprint(ans)", "v = ['a','e','i','o','u']\r\no = ['1','3','5','7','9']\r\ns = input()\r\nc = 0\r\nfor i in s:\r\n if(i in v):\r\n c+=1\r\n elif(i in o):\r\n c+=1\r\nprint(c)", "slov = {'e':1, 'o':1, 'a':1, 'i':1, 'u':1,'1':1,'3':1,'5':1,'7':1,'9':1}\r\na = input()\r\nk = 0\r\nfor i in a:\r\n if i in slov:\r\n k+=1\r\nprint(k)\r\n", "s=input()\r\nc=0\r\nfor i in range(len(s)):\r\n if s[i]in ['a','e','i','o','u','1','3','5','7','9']:\r\n c+=1\r\n\r\nprint(c)\r\n", "str = input()\r\ntemp = \"13579aeiou\"\r\nsum=0\r\nfor i in range(0,len(str)):\r\n for j in range(0,10):\r\n if str[i]==temp[j]:\r\n sum+=1\r\n break\r\nprint(sum)", "s = input()\nv = [\"a\",\"e\",\"i\",\"o\",\"u\"]\nd = \"0123456789\"\nctt = 0\nfor x in s:\n if x in v:\n ctt += 1\n if (x in d and int(x)%2 != 0):\n ctt += 1\nprint(ctt)\n\n\t \t\t \t\t \t\t\t \t\t\t \t\t \t\t\t \t", "s = input()\r\n\r\nans = 0\r\nans += s.count('a')\r\nans += s.count('e')\r\nans += s.count('i')\r\nans += s.count('o')\r\nans += s.count('u')\r\nans += s.count('1')\r\nans += s.count('3')\r\nans += s.count('5')\r\nans += s.count('7')\r\nans += s.count('9')\r\n\r\nprint(ans)", "#Problem Set A: Collaborated with no one\n\nstr1 = input()\nresult = map(str1.count, 'aeiou13579')\nfinal_ans = sum(result)\n\nprint(final_ans)\n \t\t \t\t \t \t \t \t\t\t \t \t\t\t", "s = input()\ncount = 0\nfor c in s:\n if c in \"13579aeiou\":\n count+=1\nprint(count)\n\t \t \t \t\t\t\t \t \t\t \t \t\t\t\t \t\t\t", "cards = input()\n\nprecisa = 'aeiou13579'\ncount = 0\n\nfor i in cards:\n if i in precisa:\n count = count + 1\nprint(count)\n", "def main():\r\n from re import subn\r\n (s, n) = subn(r'[aeiou13579]', '', input())\r\n print(n)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s,s1,c=input(),'aeiou13579',0\r\nfor i in s:\r\n\tif i in s1:c+=1\r\nprint(c)\r\n", "cards = str(input())\r\nvowels = ['a','e','i','o','u']\r\ncont = 0\r\nfor c in cards:\r\n if c.isdigit():\r\n if((int(c) % 2) != 0):\r\n cont += 1 \r\n else:\r\n if(c in vowels):\r\n cont += 1\r\nprint(cont)", "line = input()\r\nlst = ['a', 'o', 'u', 'e', 'i', '1', '3', '5', '7', '9']\r\nres = 0\r\n\r\nfor i in range(len(line)):\r\n if line[i] in lst:\r\n res += 1\r\nprint(res)\r\n", "#!/bin/python3\r\ncards = str(input())\r\nvowels = \"aeiou\"\r\nsingleOdds = \"13579\"\r\nflips = 0\r\nfor lol in range(len(cards)):\r\n if cards[lol] in vowels:\r\n flips += 1\r\n elif cards[lol] in singleOdds:\r\n flips += 1\r\nprint(flips)\r\n\r\n", "s=input()\nans=0\nfor cell in s:\n\tif cell.isdigit():\n\t\tif int(cell)%2==1:\n\t\t\tans+=1\n\telse:\n\t\tif cell in \"aiueo\":\n\t\t\tans+=1\nprint(ans)\n", "S = input()\n\nans = 0\nfor ch in S:\n if ch in 'aeiou13579':\n ans += 1\n\nprint(ans)\n", "s=input()\r\nj=0\r\na=(\"1\",\"3\",\"5\",\"7\",\"9\")\r\nvow=\"aieuo\"\r\nfor i in s:\r\n if vow.find(i)!=-1 or i in a:\r\n j+=1\r\nprint(j)", "string = input()\n\nvowel = [\"a\", \"e\", \"i\", \"o\", \"u\"]\n\ncount = 0\nfor i in string:\n if i in vowel:\n count += 1\n elif i.isnumeric() and int(i) % 2 != 0:\n count += 1\n\nprint(count)\n\t \t\t \t\t \t\t \t \t\t \t\t\t \t \t\t\t\t\t", "s = input()\r\nres = 0\r\n\r\nfor char in s:\r\n if (char in ('a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9')):\r\n res += 1\r\n\r\nprint(res)", "x = input()\r\nlist1 = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\ncount = 0\r\nfor i in x:\r\n if i in list1:\r\n count+=1\r\n continue\r\n if i.isdigit() == True:\r\n if int(i) % 2 != 0:\r\n count+=1\r\n \r\nprint(count)", "sadonok=[\"a\",\"o\",\"i\",\"u\",\"e\"]\r\njuft=[\"0\",\"2\",\"4\",\"6\",\"8\"]\r\nharf=[\"q\",\"w\",\"e\",\"r\",\"t\",\"y\",\"u\",\"i\",\"o\",\"p\",\"a\",\"s\",\"d\",\"f\",\"g\",\"h\",\"j\",\"k\",\"l\",\"z\",\"x\",\"c\",\"v\",\"b\",\"n\",\"m\"]\r\nraqam=[\"1\",\"2\",\"3\",\"4\",\"5\",\"6\",\"7\",\"8\",\"9\",\"0\"]\r\nans=0\r\nx,y=[],[]\r\nl=list(input())\r\nfor i in range(len(l)):\r\n if l[i] in harf:\r\n x.append(l[i])\r\n else:\r\n y.append(l[i])\r\nfor i in range(len(x)):\r\n if x[i] in sadonok:\r\n ans+=1\r\nfor i in range(len(y)):\r\n if y[i] not in juft:\r\n ans+=1\r\nprint(ans)\r\n", "def is_number(s):\n try:\n float(s)\n return True\n except ValueError:\n pass\n\n try:\n import unicodedata\n unicodedata.numeric(s)\n return True\n except (TypeError, ValueError):\n pass\n\n return False\n\n\nif __name__ == '__main__':\n s = input()\n #\n count = 0\n #\n vowel_list = ('a', 'e', 'i', 'o', 'u')\n #\n even_list = ('0', '2', '4', '6', '8')\n for char in s:\n if not is_number(char) and char in vowel_list:\n count += 1\n elif is_number(char) and char not in even_list:\n count += 1\n print(count)\n \t \t\t\t\t\t \t \t\t\t \t\t \t\t \t\t \t", "s, dem = input(), 0\r\nfor x in s:\r\n if x in ['u', 'e', 'o', 'a', 'i', '1', '3', '5', '7', '9']: dem += 1\r\nprint(dem)", "a = 'aeiou'\ncnt = 0\n\nfor c in input():\n if c in a or c.isdigit() and ord(c) % 2 == 1:\n cnt += 1\n \nprint(cnt)\n \t \t\t \t \t \t\t\t \t\t \t \t\t \t\t", "cards = input()\n\nd = 0\nfor card in cards:\n if card == 'a' or card == 'e' or card == 'i' or card == 'o' or card == 'u':\n d += 1\n elif card.isdigit():\n if int(card) % 2 != 0:\n d += 1\n\nprint(d)\n\n\t\t \t\t \t\t\t\t \t\t\t \t\t \t\t\t \t", "side = input()\ncount = 0\n\nfor i in side:\n if(i in \"13579aeiou\"):\n count += 1\n \nprint(count)\n \t\t \t\t \t \t\t\t \t\t \t \t \t \t\t\t", "s = input()\r\nans = 0\r\nc = ['a', 'e', 'o', 'u', 'i']\r\nfor i in s:\r\n if i.isalpha():\r\n if i in c:\r\n ans += 1\r\n else:\r\n if int(i) & 1:\r\n ans += 1\r\nprint(ans)", "entrada = input()\n\nlista = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\n\ncount = 0\n\nfor i in entrada:\n if(i in lista):\n count += 1\n\nprint(count)\n\n\t\t\t\t \t \t\t \t\t \t\t\t\t \t \t \t\t", "print(len(list(filter(lambda x: x in 'aeiou' or x in '13579', input() ) ) ) )\n", "inp = input();\r\n\r\nodd = ('1','3','5','7','9');\r\nvowel = ('a','e','i','o','u');\r\n\r\nflip = 0;\r\nfor i in inp:\r\n\tif i in vowel or i in odd:\r\n\t\tflip = flip+1;\r\nprint(flip);\r\n\t\t\t\t\r\n\r\n", "s=input()\r\n\r\nb=0\r\nfor i in range(len(s)):\r\n if (s[i] in ['a','e','i','o','u']) or (s[i].upper()==s[i] and s[i] not in['0','2','4','6','8']):\r\n b=b+1\r\n \r\n \r\nprint(b)\r\n \r\n", "#G17_A\n\narr = [\"a\", \"e\", \"i\", \"o\", \"u\", \"1\", \"3\", \"5\", \"7\", \"9\"]\n\ns = list(input())\n\nsm = 0\n\nfor i in s:\n if i in arr:\n sm += 1\n\nprint(sm)\n", "s=str(input())\r\nst=(\"aeiou\")\r\nsp=(\"13579\")\r\nk=0\r\nfor i in range(len(s)):\r\n if st.count(s[i])>0 or sp.count(s[i])>0:\r\n k=k+1\r\nprint(k)\r\n", "odd = ['1', '3', '5', '7', '9']\r\nvowel = ['a', 'e', 'i', 'o', 'u']\r\ncount = 0\r\nfor i in input():\r\n if i in odd or i in vowel:\r\n count += 1\r\nprint(count)", "def deve_virar(c):\n casos = {\"a\",\"e\",\"i\",\"o\",\"u\",'1','3','5','7','9'};\n if(c in casos):\n return True;\n else:\n return False;\n\ncartas = input();\ncont = 0;\n\nfor carta in cartas:\n if(deve_virar(carta)):\n cont += 1;\n\nprint(cont);\n \t\t\t \t\t \t\t\t\t\t\t \t \t\t \t\t\t \t\t\t\t \t", "s=input()\r\nl=['a','e','i','o','u','1','3','5','7','9']\r\nz=0\r\nfor i in s:\r\n if i in l:\r\n z+=1\r\nprint(z) ", "s=input()\r\nvowels=['a','e','i','o','u']\r\ndigits=['1','3','5','7','9']\r\nc=0\r\nfor i in range(len(s)):\r\n if(s[i] in vowels or s[i] in digits):\r\n c+=1\r\nprint(c)", "s = input()\nans = 0\nfor x in s:\n if x in ['a', 'e', 'i', 'o', 'u'] or x.isdigit() and int(x) % 2 == 1:\n ans += 1\nprint(ans)", "print(sum(el in 'aeiou13579' for el in input()))\r\n", "# Collaborated with no one\ninputString = input()\ncounter = 0\nfor i in range(0, len(inputString)):\n if(inputString[i]==\"a\" or inputString[i]==\"e\" or inputString[i]==\"i\" or inputString[i]==\"o\" or inputString[i]==\"u\"):\n counter += 1\n if(inputString[i].isdigit()):\n if(int(inputString[i])%2!=0):\n counter += 1\nprint(counter)\n\t\t\t\t \t \t\t \t \t \t \t \t\t\t \t\t", "n=input()\r\nn=list(n)\r\nm=['a','e','i','o','u']\r\nb=['1','3','5','7','9']\r\nc=0\r\nfor i in range(len(n)):\r\n\tif n[i] in m:\r\n\t\tc=c+1\r\n\tif n[i] in b:\r\n\t\tc=c+1\r\nprint(c)", "cartas = list()\nvogais = ['a', 'e', 'i', 'o','u']\nnum = ['1', '3', '5', '7', '9']\nentrada = input().lower()\nop = 0\nfor k in range(len(entrada)):\n cartas.append(entrada[k])\nfor carta in cartas:\n if carta in vogais:\n op += 1\n elif carta in num:\n op += 1\nprint(op)\n\t\t \t\t\t\t \t \t\t \t \t\t\t \t \t\t\t \t", "# New Year and Counting Cards\r\n# https://codeforces.com/problemset/problem/908/A\r\n\r\ninteresting = \"aeiou13579\"\r\n\r\ns = input();\r\nans = 0\r\nfor ch in s:\r\n if ch in interesting:\r\n ans += 1\r\nprint(ans)\r\n", "s = input()\ncount = 0\nfor c in s:\n\tif c in \"aeiou\":\n\t\tcount += 1\n\tif c in \"13579\":\n\t\tcount += 1\nprint(count)\n \t\t \t\t \t \t \t\t \t \t \t \t\t", "chars = list(\"aeiou13579\")\r\nword = input()\r\nprint(sum([word.count(i) for i in chars]))", "n=input()\r\ncnt=0\r\nfor i in n:\r\n if (ord(i)==49 or ord(i)==51 or ord(i)==53 or ord(i)==55 or ord(i)==57) or (ord(i)==97 or ord(i)==101 or ord(i)==105 or ord(i)==111 or ord(i)==117) :\r\n cnt=cnt+1\r\n \r\nprint(cnt)\r\n\r\n ", "s = input()\r\nans = 0\r\nfor c in s:\r\n if c in 'aeiou13579':\r\n ans += 1\r\nprint(ans)\r\n", "s = input()\n\nans = 0\nfor i in range(0, len(s)) :\n\tif(\"aeiou\".find(s[i]) != -1) :\n\t\tans = ans + 1\n\telif(\"13579\".find(s[i]) != -1) :\n\t\tans = ans + 1\n\nprint(ans)", "line = input()\r\ncount = 0\r\nlist = list(line)\r\nvowel = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\nnum = [\"1\", \"3\", \"5\", \"7\", \"9\"]\r\nfor i in list:\r\n if i in vowel or i in num:\r\n count += 1\r\nprint(count)", "s = input()\r\na = 0\r\nm = 'aeiou13579'\r\nfor i in s:\r\n if i in m:\r\n a+=1\r\nprint(a)", "vowels = ['a', 'e', 'i', 'o', 'u']\n\ncards = input()\n\ncount = 0\n\nfor i in range(len(cards)):\n if cards[i].isdigit() and int(cards[i]) % 2 == 1:\n count += 1\n\n elif cards[i] in vowels:\n count += 1\n\nprint(count)\n \t \t \t\t \t\t\t \t\t \t\t", "# cf 908 A 800\ns = input()\ncount = 0\n\nfor c in s:\n if c in ('a', 'e', 'i', 'o', 'u'):\n count += 1\n elif ord(c) >= ord('0') and ord(c) <= ord('9'):\n ch = ord(c) - ord('0')\n if ch % 2 == 1:\n count += 1\n\nprint(count)\n", "def answer():\r\n alfie=\"aeiou\"\r\n odds=\"13579\"\r\n a = list(input())\r\n ans=0\r\n for x in a:\r\n if x in odds or x in alfie:\r\n ans+=1\r\n print(ans)\r\nanswer()", "print (sum(i in \"aeiou13579\" for i in input()) )", "a = input()\nprint(sum([a.count(i) for i in ('1','3','5','7','9','a','e','u','i','o')]))", "s=input()\r\nlst=['a','e','i','o','u','1','3','5','7','9']\r\ncnt=0\r\nfor i in s:\r\n if i in lst:\r\n cnt+=1\r\nprint(cnt)", "# test = int(input())\r\n# for t in range(test):\r\ns = input()\r\nx = 0\r\nfor i in range(len(s)):\r\n if s[i].isalpha():\r\n if s[i]==\"a\" or s[i]==\"e\" or s[i]==\"i\" or s[i]==\"o\" or s[i]==\"u\":\r\n x += 1\r\n elif s[i].isdigit():\r\n if int(s[i])%2==1:\r\n x += 1\r\nprint(x)", "s = input()\r\n\r\nans = 0\r\n\r\nfor c in s:\r\n if c in '13579' or c in 'aeiou':\r\n ans += 1\r\n\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "s = input()\r\nt = \"aoeiu13579\"\r\n\r\ncnt = 0\r\nfor i in range(0, len(t)):\r\n cnt += s.count(t[i])\r\n\r\nprint(cnt)", "string =input()\r\ncounter =0\r\nfor char in string:\r\n if (char == 'a' or char == 'e' or char == 'i' or char == 'o' or char =='u'):\r\n counter+=1\r\n continue\r\n if (char == '1' or char =='3' or char =='5' or char =='9' or char == '7'):\r\n counter+=1\r\n continue\r\nprint (counter)", "string = input()\n\nvowels = ['a','e','i','o','u']\nnumbers = ['1','3','5','7','9']\nans = 0\nfor s in string:\n if s in vowels:\n ans+=1\n elif s in numbers:\n ans+=1\n \nprint(ans)\n \t \t\t\t \t\t \t \t\t \t \t\t", "#-*-coding:utf8;-*-\n#qpy:3\n#qpy:console\n\ntoCheck = {'1', '3', '5', '7', '9', 'a', 'e', 'i', 'u', 'o'}\nans = 0\nfor i in input():\n if i in toCheck:\n ans += 1\nprint(ans)", "s = input()\r\nch = \"aeiou13579\"\r\nans = 0\r\nfor x in s:\r\n ans += 1 if x in ch else 0\r\nprint(ans)\r\n", "s = input()\r\nanswer = 0\r\nfor char in s : answer += char in \"13579aeiou\"\r\nprint(answer)", "\ns = input()\nflips, i = 0, 0\n\nwhile i < len(s):\n if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == '1' or s[i] == '3' or s[i] == '5' or s[i] == '7' or s[i] == '9':\n flips += 1\n i += 1\n\nprint(flips)\n", "s = input()\r\nprint (sum(map(s.count, \"aeiou13579\")))", "cards = input()\nvowels = ['a', 'e', 'i', 'o', 'u']\nodd_digit = ['1', '3', '5', '7', '9']\nfliped = 0\nfor card in cards:\n if (card in vowels) or (card in odd_digit):\n fliped += 1\nprint(fliped)\n\n \t \t\t \t \t \t \t \t\t\t \t\t\t \t\t", "import re\r\n\r\ns = input().lower()\r\n\r\ns = re.sub(\"[^aeuio13579]\", '', s)\r\nprint(len(s))", "#Codeforce 908A\r\nans=0\r\nlist1=[\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nlist2=[\"1\",\"3\",\"5\",\"7\",\"9\"]\r\nx=[v for v in input().strip(\"\\n\\r\")]\r\nfor i in range(len(x)):\r\n if x[i] in list1 or x[i] in list2:\r\n ans+=1\r\nprint(ans)", "count = 0\nfor c in input():\n if c in 'aeiou13579':\n count += 1\nprint(count)\n", "s=input()\r\nd=0\r\nfor i in s:\r\n\tif i=='a' or i=='e' or i=='i' or i=='u' or i=='o': d+=1\r\n\tif '0'<=i<='9':\r\n\t\tif int(i)%2!=0: d+=1\r\nprint (d)", "k=input()\nprint(k.count(\"a\")+k.count(\"e\")+k.count(\"i\")+k.count(\"o\")+k.count(\"u\")+k.count(\"1\")+k.count(\"3\")+k.count(\"5\")+k.count(\"7\")+k.count(\"9\"))\n", "def main():\n\ttext = input()\n\tcount = 0\n\tfor alpha in text:\n\t\tif alpha in \"aeiou\":\n\t\t\tcount += 1\n\t\telif alpha in \"bcdfghjklmnpqrstvwxyz\":\n\t\t\tpass\n\t\telif int(alpha)%2==1:\n\t\t\tcount+=1\n\tprint(count)\n\nif __name__ == \"__main__\":\n\tmain()\n\n \t\t\t\t\t \t \t\t \t\t \t \t \t \t \t \t\t", "vowels = {'a','e','i','o','u'}\r\ns = input()\r\nans = 0\r\nfor i in s:\r\n if i in vowels:\r\n ans += 1\r\n elif i.isnumeric():\r\n if int(i) % 2 != 0:\r\n ans += 1\r\nprint(ans)", "s = str(input())\r\ncount = 0\r\nfor j in range(len(s)):\r\n if s[j] in 'aeiou':\r\n count += 1\r\n elif s[j] in '97531':\r\n count += 1\r\nprint(count)\r\n", "print(sum(q in 'aeiou13579'for q in input()))", "x = input()\nnum = 0\nfor char in x:\n\tif(char in 'aeiou13579'):\n\t\tnum += 1\nprint(num)", "\r\nl = list(input())\r\nl1 = list('aeiou13579')\r\nn = 0\r\nfor i in l:\r\n\tif i in l1:\r\n\t\tn += 1\r\n\r\nprint(n)", "# Collaborated with Rudransh Singh\n\ninp = list(input())\ncheck = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\n\ncount = 0\n\nfor i in inp:\n if i in check:\n count += 1\nprint(count)\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 ans = 0\r\n for c in input():\r\n if c in 'aeiou':\r\n ans += 1\r\n elif ord(c) >= ord('0') and ord(c) <= ord('9'):\r\n val = int(c)\r\n if val % 2 == 1:\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "l=['a','e','i','o','u','1','3','5','7','9']\r\ns=input()\r\nans=0\r\nfor ch in s:\r\n\tif ch in l:\r\n\t\tans=ans+1\r\nprint (ans)", "a = input()\r\nb = \"aeiou13579\"\r\ns = 0\r\nfor i in a:\r\n if i in b:s+=1\r\nprint(s)", "s=input()\r\ncount=0\r\nfor i in s:\r\n if i in 'aeiou13579':\r\n count+=1\r\nprint(count)\r\n", "string = input()\ncount = 0\nfor i in range(len(string)):\n if string[i] in \"aeiou\" or string[i] in \"13579\":\n count += 1\nprint(count)\n \t \t\t\t\t \t\t\t \t \t \t \t \t\t", "n = input()\nvogals = [\"a\",\"e\",\"i\",\"o\",\"u\"]\nquant=0\n\nfor letter in n:\n if(letter.isdigit()):\n if(int(letter)%2!=0):\n quant+=1\n\n elif(letter in vogals):\n quant+=1\n\nprint(quant)\n\t\t\t \t\t \t \t \t \t\t\t\t \t \t \t", "def main():\r\n s = input()\r\n vowels = \"aeiou\"\r\n count = 0\r\n \r\n for char in s:\r\n if char.isdigit():\r\n if int(char) % 2 == 1:\r\n count += 1\r\n else:\r\n if char in vowels:\r\n count += 1\r\n \r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s=str(input())\r\ncount=0\r\nvowel=['a','e','i','o','u']\r\nfor i in range(0,len(s)):\r\n if s[i].isdigit():\r\n if int(s[i])%2==1:\r\n count+=1\r\n if s[i].isalpha():\r\n if vowel.count(s[i])==1:\r\n count+=1\r\nprint(count)\r\n \r\n ", "s=input()\r\nc=0\r\nvow=['a','e','i','o','u']\r\nod=['1','3','5','7','9']\r\nfor i in range(len(s)):\r\n if s[i] in od:\r\n c+=1\r\n elif s[i] in vow:\r\n c+=1\r\nprint(c)", "a = input()\r\ncnt = 0\r\nfor i in a:\r\n if i in \"aeiou\":\r\n cnt += 1\r\n elif ord(i) >= ord('0') and ord(i) <= ord('9'):\r\n cnt += int(i) % 2\r\nprint(cnt)", "S = input()\r\nchar = set(['a','e','i','o','u','1','3','5','7','9'])\r\nflips = sum(X in char for X in S)\r\nprint(flips)", "cnt=0\r\ns=input()\r\nfor ele in s:\r\n if ele in \"aeiou13579\":\r\n cnt+=1\r\nprint(cnt)", "x=input()\r\nprint(x.count('a')+x.count('e')+x.count('i')+x.count('o')+x.count('u')+x.count('1')+x.count('3')+x.count('5')+x.count('7')+x.count('9'))", "cards = input()\nvogais = 'aeiou'\nimpares = '13579'\n\ntotal = 0\nfor i in range(len(cards)):\n if cards[i] in vogais or cards[i] in impares:\n total += 1\n\nprint(total)\n\n\t \t\t\t \t\t \t\t\t\t \t\t\t \t \t\t \t", "card_list = list(input())\nminimum_flips = 0\n\nfor card in card_list:\n if (card.isdigit() and int(card) % 2 != 0) or (card in ['a', 'e', 'i', 'o', 'u']):\n minimum_flips += 1\n\nprint(minimum_flips)\n\n \t \t \t\t\t\t \t\t \t\t \t\t \t\t", "flipped_cards = {'a', 'e', 'i', 'o', 'u'}\r\nx = 0\r\nfor c in input():\r\n if c in flipped_cards:\r\n x += 1\r\n if c.isdigit() and int(c) % 2 == 1:\r\n x += 1\r\n\r\nprint(x)", "x=str(input())\r\nk=\"aieou\"\r\nm=\"02468\"\r\nh=0\r\nfor i in range(0,len(x)):\r\n p=x[i]\r\n if p.isdigit():\r\n j=int(p)\r\n if j%2!=0:\r\n h+=1\r\n # print(h) \r\n if(k.find(x[i])<len(k) and k.find(x[i])!=-1 ):\r\n h+=1\r\n \r\n \r\n \r\nprint(h)\r\n \r\n \r\n\r\n", "abc = input()\r\n\r\nq = 0\r\nfor sym in abc:\r\n if sym in 'aueoi' or sym.isdigit() and int(sym) % 2 == 1:\r\n q += 1\r\nprint(q)", "s = input()\n\nvowels = ['a', 'e', 'i', 'o', 'u']\n\ncards_to_turn = 0\n\nfor w in s:\n\tif (w in vowels): cards_to_turn += 1\n\telif (w.isnumeric() and int(w) % 2 != 0): cards_to_turn += 1\t\n\nprint(cards_to_turn)\n\t \t\t\t \t\t\t \t\t\t\t \t\t \t \t\t\t\t", "s = input()\r\nd = {'a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9'}\r\nret = 0\r\nfor c in s:\r\n if c in d:\r\n ret += 1\r\nprint(ret)", "s=input()\r\ncount=0\r\nfor i in range(len(s)):\r\n if s[i]==\"a\" or s[i]==\"e\" or s[i]==\"o\" or s[i]==\"i\" or s[i]==\"u\" or s[i]==\"1\" or s[i]==\"3\" or s[i]==\"5\" or s[i]==\"7\" or s[i]==\"9\":\r\n count=count+1\r\nprint(count)\r\n \r\n", "cards = input()\n\nvowels = set('aeiou')\nodds = set('13579')\n\ncount = 0\nfor c in cards:\n if c in vowels or c in odds:\n count += 1\n\nprint(count)\n \t\t\t\t\t \t \t \t\t \t \t \t\t \t \t", "s = input()\nres = sum(c in {\"a\", \"e\", \"i\", \"o\", \"u\"} or (c.isdigit() and int(c) & 1 == 1) for c in s)\nprint(res)\n", "string = str(input())\ncounter = 0\nl = ['1','3','5','7','9','a','i','o','u','e']\n\nfor ch in string:\n if ch in l:\n counter += 1\n\nprint(counter)\n \n \t \t \t\t\t \t \t\t\t \t\t \t \t\t\t \t\t\t", "s = input()\r\nt = 0\r\nfor i in s:\r\n if i.isdigit() and int(i) % 2 or i in \"aeiou\":\r\n t += 1\r\nprint(t)\r\n", "g = ['a','e','i','o','u']\r\nch = ['1','3','5','7','9',]\r\nans = 0\r\ns = input()\r\nn = len(s)\r\nfor i in range(n):\r\n if (s[i] in ch or s[i] in g):\r\n ans+=1\r\nprint(ans) \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n", "d = [ 'a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9' ]\r\ns = input()\r\nans = 0\r\nfor ch in s:\r\n\tif ch in d:\r\n\t\tans += 1\r\nprint(ans)", "card={ 'a', 'e', 'i', 'o', 'u'}\r\na=input()\r\nx=0\r\nfor c in a:\r\n\tif c in card:\r\n\t\tx+=1\r\n\telif c.isdigit() and int(c)%2==1:\r\n\t\tx+=1\r\nprint(x)", "a = input()\r\nans = 0\r\nfor i in a:\r\n if i.isdigit():\r\n if int(i)%2==1:\r\n ans += 1\r\n elif i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n ans += 1\r\nprint(ans)", "s = input()\r\na = ['e', 'o', 'u', 'a', 'i', '1', '3', '5', '7', '9']\r\nc = 0\r\nfor i in s:\r\n if i in a: c += 1\r\nprint(c)", "l = list(str(input()))\r\nresult = 0\r\nfor x in l:\r\n if x in 'aeiou13579':\r\n result += 1\r\nprint(result)\r\n", "cards = input()\nc = 0\nvowels = 'aeiou'\neven = '13579'\n\nfor o in cards:\n if o in vowels or o in even:\n c += 1\n\nprint(c)\n \t \t \t \t\t\t\t \t\t\t\t \t \t\t\t \t\t\t\t \t", "v = {'a', 'e', 'i', 'o', 'u'}\r\ns = input().strip()\r\nres = 0\r\nfor i in s:\r\n if i in v:\r\n res += 1\r\n elif i.isdigit() and int(i) % 2 == 1:\r\n res += 1\r\nprint(res)\r\n\r\n", "s = input()\r\nprint(sum(map(s.count, \"aeiou13579\")))\r\n", "x = input()\n\np = ['a','e','i','o','u','1','3','5','7','9']\n\nn = 0\nfor i in x:\n if i in p:\n n = n+1\nprint(n)\n\n \t \t\t \t\t\t \t\t\t\t \t\t\t \t \t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nmemo = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\r\ndata = input().rstrip()\r\nprint(len([1 for i in data if i in memo]))", "t = input()\r\n\r\ntime = 0\r\nref = \"aeiou\"\r\nref2= \"0123456789\"\r\nfor x in list(t):\r\n if (x in ref):\r\n time += 1\r\n else:\r\n if (x in ref2):\r\n if int(x)%2 != 0:\r\n time += 1\r\n\r\nprint (time)\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\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\nd=0\r\nfor i in range(len(s)):\r\n\tif s[i]=='a' or s[i]=='e' or s[i]=='i' or s[i]=='o' or s[i]=='u':\r\n\t\td+=1\t\t\r\n\tif s[i].isdigit()==True:\r\n\t\tif int(s[i])%2!=0:\r\n\t\t\td+=1\r\nprint(d)", "def isVowel(c):\r\n return c == 'a' or c=='e' or c=='i' or c=='o' or c=='u'\r\ndef isDigit(n):\r\n return n=='1' or n=='3' or n=='5' or n=='7' or n=='9'\r\nc = 0\r\ns = input()\r\nfor i in range(len(s)):\r\n if isVowel(s[i]) or isDigit(s[i]):\r\n c += 1\r\nprint(c)", "s = input()\ncount = 0\n\nfor c in s:\n if c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u':\n count += 1\n if c == '1' or c == '3' or c == '5' or c == '7' or c == '9':\n count += 1\n\nprint(count)\n\n\t \t\t\t\t \t \t \t \t \t\t \t\t\t \t", "vowels = {'a', 'e', 'i', 'o', 'u'}\nodds = {'1', '3', '5', '7', '9'}\n\ns = input()\nflip = 0\n\nfor c in s:\n if c in vowels or c in odds:\n flip += 1\n\nprint(flip)\n", "a = input()\r\ncount = 0\r\ncount1 = 0\r\nvowel = [\"a\",\"e\",\"i\",\"o\",\"u\"]\r\nodd = [\"1\",\"3\",\"5\",\"7\",\"9\"]\r\nlis = []\r\nfor i in a:\r\n lis.append(i)\r\nfor k in range(len(lis)):\r\n if lis[k] in vowel:\r\n count += 1\r\n if (lis[k]) in odd:\r\n count1 += 1\r\nprint(count1+count)\r\n", "a=str(input())\r\ncount=0\r\nfor i in a:\r\n if str.isdigit(i) and int(i)%2!=0:\r\n count=count+1\r\n elif i=='a' or i=='e' or i=='i' or i=='o' or i=='u':\r\n count=count+1\r\nprint(count)\r\n", "s = input()\ncnt = 0\nfor x in s:\n if x in ['a', 'e', 'i', 'o', 'u']: cnt += 1\n if x.isdigit():\n if int(x) % 2 == 1: cnt += 1\nprint(cnt)\n", "w = str(input())\nw = list(w)\nv = 0\nvogal = \"aeiou\"\nimpar = \"13579\"\n\nfor x in range(len(w)):\n if w[x] in vogal or w[x] in impar:\n v += 1\nprint(v)\n \t \t\t \t \t\t \t\t \t \t \t\t\t", "def test(v):\n if v in \"aeiou13579\":\n return True\n else:\n return False\n\ncont=0\nlista = input()\nfor x in lista:\n if(test(x)):\n cont=cont+1\nprint (cont)\n\t \t\t\t\t\t\t\t \t \t \t \t\t\t \t\t\t \t", "cards = input()\r\n\r\nhaveToSee = 0\r\n\r\nfor character in cards:\r\n\tif character in 'aeiou13579':\r\n\t\thaveToSee += 1\r\n\r\nprint(haveToSee)", "vowels = ['a', 'e', 'i', 'o', 'u']\nodd_numbers = ['1', '3','5','7','9']\ncards = input()\nanswer = 0\n\nfor i in range(len(cards)):\n\tif cards[i] in vowels or cards[i] in odd_numbers:\n\t\tanswer += 1\n\t\t\nprint(answer)\n\n \t \t\t \t\t\t\t \t\t\t \t \t\t \t", "s = input()\nsett1 = {'a', 'u', 'o', 'e', 'i'}\nsett2 = {'0', '2', '4', '6', '8'}\nans = 0\na = []\nfor element in s:\n try:\n if type(int(element)) == int:\n a.append(int(element))\n except ValueError:\n a.append(element)\nfor item in a:\n if (type(item) is int and str(item) not in sett2) or (type(item) is str and item in sett1):\n ans += 1\nprint(ans)\n", "str = input()\nvowels = 'aeiou'\ndigits = '0123456789'\n\nl = len(str)\nans = 0\n\nfor i in range(l):\n if str[i] in vowels:\n ans+=1\n if str[i] in digits and int(str[i]) % 2 != 0:\n ans+=1\n \nprint(ans)\n \t\t \t\t \t \t\t \t\t\t\t \t \t", "s = input()\r\ne = 0\r\n\r\nfor i in s:\r\n if 96 < ord(i) < 123:\r\n if i == 'a' or i == 'e' or i == 'i' or i == 'o' or i == 'u':\r\n e += 1\r\n\r\n else:\r\n if int(i) % 2 != 0:\r\n e += 1\r\n\r\nprint(e)", "chars = set('13579aeiou')\r\nprint(sum(c in chars for c in input()))\r\n", "# cook your dish here\r\ns = input()\r\nt = \"aeiou\"\r\np = \"0123456789\"\r\nc=0\r\nfor i in s:\r\n if i in t or (i in p and int(i)&1):\r\n c+=1\r\nprint(c)", "# Eddie Kaleb - 117110271 - CC@UFCG - ATAL - Melina Mongiovi\n\nINVALID_INPUT = \"Erro\"\n\ninputs = input()\n\ndef sum_card(n):\n\treturn n + 1\n\ncallbacks = {\n\t\"a\": sum_card, \"e\": sum_card, \"i\": sum_card, \"o\": sum_card, \"u\": sum_card,\n\t\"1\": sum_card, \"3\": sum_card, \"5\": sum_card, \"7\": sum_card, \"9\": sum_card\n}\n\ni = 0\n\nfor caractere in inputs:\n\n\tcallback = callbacks.get(caractere) or INVALID_INPUT\n\t\n\tif callback != INVALID_INPUT:\n\n\t\ti = callback(i)\n\nprint(i)\n \t\t\t \t\t \t \t\t\t\t \t\t\t\t \t\t", "#!/bin/python3\r\ncards = str(input())\r\n\r\nflips = 0\r\nfor lol in range(len(cards)):\r\n if cards[lol] == 'a' or cards[lol] == 'e' or cards[lol] == 'i' or cards[lol] == 'u' or cards[lol] == 'o':\r\n flips += 1\r\n elif cards[lol] == '1' or cards[lol] == '3' or cards[lol] == '5' or cards[lol] == '7' or cards[lol] == '9':\r\n flips += 1\r\n\r\nprint(flips)", "c=0\r\ns='aeiou13579'\r\nz=input()\r\nfor i in z:\r\n if i in s:\r\n c+=1\r\nprint(c)", "s=input()\r\ncnt=0\r\nfor alph in s:\r\n if(alph in \"aeiou13579\"):\r\n cnt+=1\r\nprint(cnt)", "z=(\"aeiou13579\")\r\na=input()\r\n\r\ncnt=0\r\n\r\nfor i in range(len(a)):\r\n if a[i] in z:\r\n cnt+=1\r\nprint(cnt)", "text = input()\r\nvogais = ['a','e','i','o','u', '1','3','5','7','9']\r\ncount = 0\r\nfor letra in text:\r\n if letra in vogais:\r\n count += 1\r\n\r\nprint(count)", "s = input()\r\nres = 0\r\nli = ['a', 'e', 'i', 'o', 'u']\r\nfor i in s:\r\n if i.isalpha() and (i in li):\r\n res += 1\r\n if i.isnumeric():\r\n if int(i) % 2 == 1:\r\n res += 1\r\nprint(res)", "l=['e','a','i','o','u','1','3','5','7','9']\r\nres=0\r\nfor i in input():\r\n if i in l:res+=1\r\nprint(res)\r\n", "s = input().lower()\r\ncount = 0 \r\ndigits = 0\r\n# print(s)\r\nfor i in s:\r\n if i == 'a' or i == 'e' or i == 'i' or i=='o' or i=='u':\r\n count += 1 \r\n \r\n elif i == '1' or i == '3' or i == '5' or i =='7' or i =='9':\r\n digits += 1 \r\nprint(count+digits)", "vowel = ['a','e','i','o','u']\r\ndigit = ['0','2','4','6','8']\r\nsummation = 0\r\nfor i in input():\r\n if ord(i) >= 97 and ord(i) <= 122:\r\n summation += i in vowel\r\n else:\r\n summation += i not in digit\r\nprint(summation)", "s = list(input())\r\nmoo = 0\r\npor = \"aeiou\"\r\nblu = \"13579\"\r\nfor i in range(len(s)):\r\n if s[i] in por:\r\n moo += 1\r\n elif s[i] in blu:\r\n moo += 1\r\nprint(moo)", "cards_sides = input()\nminimum_turn = 0\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\nodd_digits = [\"1\", \"3\", \"5\", \"7\", \"9\"]\n\nfor card_side in cards_sides:\n if card_side in vowels or card_side in odd_digits:\n minimum_turn += 1\n\nprint(minimum_turn)\n\t\t\t \t\t\t\t\t \t\t \t \t \t\t", "l = ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']\r\n\r\ns = input()\r\nc = 0\r\nfor i in range(len(s)):\r\n if s[i] in l:\r\n c += 1\r\nprint(c)", "print(sum(1 for x in input() if x in '13579aeiou'))", "import sys\n\ns = sys.stdin.readline()\nflips = 0\n\ni = 0\nwhile i < len(s):\n if s[i] == 'a' or s[i] == 'e' or s[i] == 'i' or s[i] == 'o' or s[i] == 'u' or s[i] == '1' or s[i] == '3' or s[i] == '5' or s[i] == '7' or s[i] == '9':\n flips += 1\n else:\n flips += 0\n i += 1\n\nprint(flips)\n", "def cards(s):\r\n count = 0\r\n for elem in s:\r\n if elem in 'aeiou':\r\n count += 1\r\n if elem in '13579':\r\n count += 1\r\n return count\r\n\r\n\r\nprint(cards(input()))\r\n", "a=input()\r\nprint(sum(i in \"aeiou13579\" for i in a))", "l = list(input())\r\nm = l.count('a')+l.count('e')+l.count('i')+l.count('o')+l.count('u')\r\nfor i in l:\r\n if i.isdigit():\r\n if i=='0' or i=='2' or i=='4' or i=='6' or i=='8':\r\n pass\r\n else:\r\n m+=1\r\nprint(m)", "l=input()\r\ncnt=0\r\nfor i in l:\r\n if i in \"aeiou\":\r\n cnt+=1\r\n if i in \"13579\":\r\n cnt+=1\r\nprint(cnt)", "s=list(input())\r\narr=[\"a\",\"i\",\"o\",\"e\",\"u\", \"1\",\"3\",\"5\",\"7\",\"9\"]\r\ncount=0\r\nfor i in s:\r\n if i in arr:\r\n count+=1\r\nprint(count)", "s=input()\r\ncnt,i=0,0\r\nvowel=['a','e','i','o','u']\r\nwhile(i<len(s)):\r\n if(ord(s[i])<=60):\r\n if(int(s[i])%2):\r\n cnt+=1\r\n else:\r\n if s[i] in vowel:\r\n cnt+=1\r\n i+=1\r\nprint(cnt)\r\n ", "s = input()\r\nf = 0\r\nfor i in s:\r\n if i in ['a', 'e', 'i', 'o', 'u', '1', '3', '5', '7', '9']:\r\n f += 1\r\nprint(f)", "n=input()\r\ncount=0\r\nfor j in n:\r\n \r\n if(j==\"a\" or j==\"e\" or j==\"i\" or j==\"o\" or j==\"u\"):\r\n count=count+1\r\n if(j==\"1\" or j==\"3\" or j==\"5\" or j==\"7\" or j==\"9\"):\r\n count=count+1\r\nprint(count) " ]

[ "from math import floor, ceil, sqrt\ndef solve(n):\n quad = sqrt(2*n+1/4)-1/2\n x = floor(quad)\n y = ceil(quad)\n a = int(x*(x-1)/2 + n - x)\n b = n - x\n c = n - y\n d = 2*c\n if a > d:\n print(a)\n else:\n print(d)\n return\nn=int(input())\nfor i in range (n):\n solve(int(input()))\n ", "def bin_search(left,right):\r\n mid = (left+right+1) // 2\r\n while abs(left-right) > 1:\r\n mid = (left+right+1) // 2\r\n x = mid * (mid-1) // 2\r\n if x + 2 <= n-mid-1:\r\n left = mid\r\n else:\r\n right = mid\r\n mid = max(1, mid-5)\r\n while True:\r\n x = mid * (mid-1) // 2\r\n if not x + 2 <= n - mid - 1:\r\n return mid\r\n mid += 1\r\n\r\nq = int(input())\r\nfor i in range(q):\r\n n = int(input())\r\n x = bin_search(1,n)\r\n ans = n - x\r\n ans += min(ans, x * (x-1) // 2)\r\n print(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2 + 1) // 2\r\n while abs(c1 - c2) > 1:\r\n m = (c1 + c2 + 1) // 2\r\n x = m * (m - 1) // 2\r\n if x + 2 <= n - m - 1:\r\n c1 = m\r\n else:\r\n c2 = m\r\n m = max(1, m - 5)\r\n while True:\r\n x = m * (m - 1) // 2\r\n if not x + 2 <= n - m - 1:\r\n return m\r\n m += 1\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n n = int(input())\r\n x = binary_search(1, n)\r\n ans = n - x\r\n ans += min(ans, x * (x - 1) // 2)\r\n print(ans)", "import math\r\n\r\ndef solve():\r\n q = int(input())\r\n for _ in range(q):\r\n n = int(input())\r\n x = int((-1 + math.sqrt(1 + 8 * n)) // 2)\r\n if n - x - 1 < x * (x - 1) // 2 + 1:\r\n print(n - x + x * (x - 1) // 2)\r\n else:\r\n print(2 * (n - x - 1))\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "#! /usr/bin/env python\n\n# http://codeforces.com/problemset/problem/818/F\n# Problem name ::: F. Level Generation\n# submission number\n\n#212055293\n#508427854\n\n\ndef newest_approach(n):\n from math import floor, ceil, sqrt\n\n quad_solv = sqrt(2*n+1/4)-1/2\n x = floor(quad_solv)\n y = ceil(quad_solv)\n\n xed = int(x*(x-1)/2 + n - x)\n xbr = n - x\n\n ybr = n - y\n yed = 2*ybr\n\n if xed > yed:\n print(xed)\n # print(\"nodes = %s :: edges = %s :: bridges = %s\" % (n, xed, xbr))\n else:\n print(yed)\n # print(\"nodes = %s :: edges = %s :: bridges = %s\" % (n, yed, ybr))\n\n return\n\n\n\ndef main():\n\n import sys\n\n data = [line.rstrip() for line in sys.stdin.readlines()]\n num_graphs = data[0]\n graph_sizes = [int(x) for x in data[1:]]\n\n for val in graph_sizes:\n # binary_search(val)\n # new_approach(val)\n newest_approach(val)\n\n\n\n\n\nif __name__ == '__main__':\n main()\n", "from collections import defaultdict,Counter\nimport math\nimport bisect\nfrom itertools import accumulate\nfrom math import ceil, log,gcd\nfrom functools import lru_cache \nfrom sys import stdin, stdout\ndef read():\n return stdin.readline().rstrip()\nimport sys\n\ntotal = int(read())\n\n\ndef check(k,n):\n return n-k >= k*(k-1)//2\n\n# ss= read()\n\n\nfor i in range(total):\n n = int(read())\n l = 0\n r = n\n while r > l:\n mid = l + (r-l)//2 + 1\n if check(mid,n):\n l = mid\n else:\n r = mid- 1\n \n print(max(l * (l-1)//2 + (n-l), 2 * (n- (l+1)))) \n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\nn, k = map(int,input().split())\r\nif n//k < 3 :\r\n print(-1)\r\nelse :\r\n ans = []\r\n for i in range(k-1) :\r\n ans.append(i+2)\r\n ans.append(1)\r\n for i in range(n-k) :\r\n ans.append(i%k+1)\r\n print(*ans)", "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 if n < 3 * k:\r\n print(-1)\r\n return\r\n q = deque(range(n))\r\n ans = [0 for i in range(n)]\r\n m = n // k\r\n for i in range(k):\r\n for j in range(m - 1):\r\n ans[q.popleft()] = i + 1\r\n if len(q) == 1:\r\n ans[q.pop()] = i + 1\r\n else:\r\n last = q.pop()\r\n ans[q.pop()] = i + 1\r\n q.append(last)\r\n while q:\r\n ans[q.pop()] = i + 1\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" ]

[ "def solve(n, arr):\r\n for i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n for x, y in [(-1, 0), (0, 1), (1, 0), (0, -1)]:\r\n ni, nj = x + i, y + j\r\n if ni >= 0 and ni < n and nj >= 0 and nj < n:\r\n if arr[ni][nj] == \"o\":\r\n cnt += 1\r\n \r\n if cnt % 2 != 0:\r\n return \"NO\"\r\n return \"YES\"\r\n \r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n temp = input()\r\n arr.append(list(temp))\r\nprint(solve(n, arr))\r\n", "num = int(input())\r\nli = []\r\n\r\nfor x in range(num):\r\n l = input()\r\n for i in l:\r\n if i == \"x\":\r\n li.append(0)\r\n else: \r\n li.append(1)\r\nli = [0 for x in range(num)] + li + [0 for x in range(num)]\r\nlis = []\r\n\r\nfor x in range(num,len(li)-num):\r\n if x%num==0:\r\n lis.append(li[x+1]+ li[x-num]+ li[x+num])\r\n elif (x+1)%num==0:\r\n lis.append(li[x-1]+ li[x-num]+ li[x+num])\r\n else:\r\n lis.append(li[x-1]+ li[x+1]+ li[x-num]+ li[x+num])\r\nyes = True\r\nfor i in lis:\r\n if i%2 == 0:\r\n yes = True\r\n else:\r\n yes = False\r\n break\r\nif yes: print(\"YES\")\r\nelse: print(\"NO\")", "n=int(input())\r\np=[]\r\nzoj=True\r\nfor i in range(n):\r\n\ts=input()\r\n\tp.append(s)\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tcnt=0\r\n\t\tif i>0:\r\n\t\t\tif p[i-1][j]==\"o\":\r\n\t\t\t\tcnt+=1\r\n\t\tif j>0:\r\n\t\t\tif p[i][j-1]==\"o\":\r\n\t\t\t\tcnt+=1\r\n\t\tif i<n-1:\r\n\t\t\tif p[i+1][j]==\"o\":\r\n\t\t\t\tcnt+=1\r\n\t\tif j<n-1:\r\n\t\t\tif p[i][j+1]==\"o\":\r\n\t\t\t\tcnt+=1\r\n\t\tif cnt%2==1:\r\n\t\t\tzoj=False\r\n\t\t\tbreak\r\nif zoj:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom decimal import *\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\n'''\r\ndef solve():\r\n n = II()\r\n grid = []\r\n for _ in range(n):\r\n grid.append([x for x in I().strip()])\r\n\r\n directions = [[1,0],[-1,0],[0,1],[0,-1]]\r\n ans = True\r\n for r in range(n):\r\n for c in range(n):\r\n cnt = 0\r\n for dr,dc in directions:\r\n dr += r\r\n dc += c\r\n if 0<=dr and dr<n and 0<=dc and dc<n:\r\n cnt += int(grid[dr][dc]=='o')\r\n ans &= (cnt%2==0)\r\n\r\n print('YES' if ans else 'NO')\r\n\r\nsolve()\r\n", "n = int(input())\r\nc = \"\"\r\nfor i in range(n):\r\n c+=input()\r\nif c==c[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print('NO')\r\n", "li=[]\nn= int(input())\nmatrix = [[0 for i in range(n)] for i in range(n)]\nfor _ in range(n):\n\tl=input()\n\tli.append(l)\nflag = 0\nfor i in range(n):\n\tfor j in range(n):\n\t\tcount = 0\n\t\tif(j>=1):\n\t\t\tif(li[i][j-1]=='o'):\n\t\t\t\tcount = count+1\n\t\tif(j<n-1):\n\t\t\tif(li[i][j+1]=='o'):\n\t\t\t\tcount = count+1\n\t\tif(i<n-1):\n\t\t\tif(li[i+1][j]=='o'):\n\t\t\t\tcount = count+1\n\t\tif(i>=1):\n\t\t\tif(li[i-1][j]=='o'):\n\t\t\t\tcount = count+1\n\t\tif(count%2!=0):\n\t\t\tflag=1\n\t\t\tbreak\n\t\t\tbreak\nif(flag==0):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "grid = []\r\nn = None\r\n\r\n\r\ndef countAdj(i, j):\r\n cnt = 0\r\n #print(i,j)\r\n if j < n-1 and grid[i][j+1] == 'o': cnt += 1\r\n if j > 0 and grid[i][j-1] == 'o': cnt += 1\r\n if i < n-1 and grid[i+1][j] == 'o': cnt += 1\r\n if i > 0 and grid[i-1][j] == 'o': cnt += 1\r\n return cnt\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n grid.append(list(input()))\r\nbv = True\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if countAdj(i,j) %2 != 0:\r\n bv = False\r\n break\r\nif bv: print(\"YES\")\r\nelse: print(\"NO\")", "n = int(input())\r\na = [input() for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n if i > 0:\r\n cnt += a[i-1][j] == 'o'\r\n if i < n-1:\r\n cnt += a[i+1][j] == 'o'\r\n if j > 0:\r\n cnt += a[i][j-1] == 'o'\r\n if j < n-1:\r\n cnt += a[i][j+1] == 'o'\r\n if cnt % 2 == 1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "n=int(input())\r\nl=[]\r\nf=0\r\nfor i in range(n):\r\n s=input()\r\n l.append(list(s))\r\nf=0\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n c=0\r\n if j!=n-1:\r\n if l[i][j+1]==\"o\":\r\n c+=1\r\n if j!=0:\r\n if l[i][j-1]==\"o\":\r\n c+=1\r\n if i!=0:\r\n if l[i-1][j]==\"o\":\r\n c+=1\r\n if i!=n-1:\r\n if l[i+1][j]==\"o\":\r\n c+=1\r\n if c%2:\r\n f=1\r\n break\r\n if f==1:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n ", "n = int(input())\r\nm = []\r\nfor _ in range(n):\r\n m.append(input())\r\n\r\nv = [[0, 1], [0, -1], [1, 0], [-1, 0]]\r\nans = 'YES'\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n for x, y in v:\r\n if i + x in range(n) and j + y in range(n) and m[i + x][j + y] == 'o':\r\n cnt += 1\r\n if cnt % 2 != 0:\r\n ans = 'NO'\r\nprint(ans)", "n=int(input())\r\nf=[\"x\"*(n+2)]\r\nfor i in range(n):\r\n s=str(input())\r\n f.append(list(\"x\"+s+\"x\"))\r\nf.append(\"x\"*(n+2))\r\nflag=True\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n k=[f[i+1][j],f[i-1][j],f[i][j+1],f[i][j-1]]\r\n if k.count(\"o\")%2!=0:\r\n flag=False\r\n \r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def miniSin(angle):\r\n return (2 - angle) * (angle % 2) \r\n\r\nn = int(input())\r\ngridList = [[i for i in input()] for x in range(n) ]\r\n\r\ndef checkOs():\r\n for RowIndex in range(n):\r\n for columnIndex in range(n):\r\n numberOfOs = 0\r\n for i in range(4):\r\n RI = RowIndex + miniSin((i+1)%4)\r\n CI = columnIndex + miniSin(i)\r\n if RI < 0 or RI == n or CI < 0 or CI == n:\r\n continue\r\n if gridList[RowIndex + miniSin((i+1)%4)][columnIndex + miniSin(i)] == \"o\":\r\n numberOfOs += 1\r\n if numberOfOs % 2 != 0:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\nprint(checkOs())", "def fun():\n n = int(input())\n a = []\n for _ in range(n):\n a.append(input())\n for row, v in enumerate(a):\n for col, c in enumerate(v):\n os = 0\n if row - 1 >= 0 and a[row-1][col] == 'o':\n os += 1\n if col - 1 >= 0 and a[row][col-1] == 'o':\n os += 1\n if row + 1 < n and a[row+1][col] == 'o':\n os += 1\n if col + 1 < n and a[row][col+1] == 'o':\n os += 1\n if os % 2 != 0:\n return 'NO'\n return 'YES'\n \nprint(fun())\n", "######################################################################\r\n# Write your code here\r\nimport sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : input().strip().split()\r\nls = lambda : list(input().strip()) # for strings to list of char\r\nfrom collections import defaultdict as df\r\nimport heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\n#import random\r\n#random.shuffle(list)\r\ninfinite = float('inf')\r\n#######################################################################\r\n\r\nn=int(input())\r\nl=[[] for i in range(n)]\r\n\r\nfor i in range(n):\r\n l[i]=ls()\r\n#print(l)\r\nf=0\r\nfor i in range(n):\r\n for j in range(n):\r\n c=0\r\n if(i!=0):\r\n if(l[i-1][j]=='o'):\r\n c+=1\r\n if(i!=n-1):\r\n if(l[i+1][j]=='o'):\r\n c+=1\r\n if(j!=0):\r\n if(l[i][j-1]=='o'):\r\n c+=1\r\n if(j!=n-1):\r\n if(l[i][j+1]=='o'):\r\n c+=1\r\n if(c%2==1):\r\n f=1\r\n break\r\nif(f==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\r\ns=str()\r\nfor i in range(n):s+=input()\r\nprint('YES' if s==s[::-1] else 'NO')\r\n", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n\tl.append(input())\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tc=0\r\n\t\tif i>0:\r\n\t\t\tif l[i-1][j]==\"o\":\r\n\t\t\t\tc+=1\r\n\t\tif i<n-1:\r\n\t\t\tif l[i+1][j]==\"o\":\r\n\t\t\t\tc+=1\r\n\t\tif j>0:\r\n\t\t\tif l[i][j-1]==\"o\":\r\n\t\t\t\tc+=1\r\n\t\tif j<n-1:\r\n\t\t\tif l[i][j+1]==\"o\":\r\n\t\t\t\tc+=1\r\n\t\tif c%2==1:\r\n\t\t\tprint(\"NO\")\r\n\t\t\texit()\r\nprint(\"YES\")", "#in the name of god\r\n#Mr_Rubick\r\nn=int(input())\r\nb=[input() for _ in range(n)]\r\nans=1\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tans &= sum(1 for di, dj in [(1, 0), (-1, 0), (0, 1), (0, -1)] if 0 <= i + di < n and 0 <= j + dj < n and b[i + di][j + dj] == 'o') % 2 == 0\r\nif (ans == True):print(\"YES\")\r\nelse:print(\"NO\")", "n=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n mat.append(list(input()))\r\ncnt=0\r\nfor i in range(n):\r\n for j in range(n):\r\n c=0\r\n if j+1<n:\r\n if mat[i][j+1]==\"o\":\r\n c+=1\r\n if j-1>=0:\r\n if mat[i][j-1]==\"o\":\r\n c+=1\r\n if i+1<n:\r\n if mat[i+1][j]==\"o\":\r\n c+=1\r\n if i-1>=0:\r\n if mat[i-1][j]==\"o\":\r\n c+=1\r\n if c%2==0:\r\n cnt+=1\r\n\r\nif cnt==(n*n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n \r\n \r\n", "n = int(input())\nl=[]\nfor i in range(n):\n\tl.append(input())\n\n# if condition then direct YES\ncount = 0\ns= []\nfor i in range(n):\n\tfor j in range(n):\n\t\tif (i-1)>-1 and (i-1)<n:\n\t\t\tif l[i-1][j] =='o':\n\t\t\t\tcount+=1\n\t\tif (j-1)>-1 and (j-1)<n:\n\t\t\tif l[i][j-1] =='o':\n\t\t\t\tcount+=1\n\t\tif (i+1)>-1 and (i+1)<n:\n\t\t\tif l[i+1][j] =='o':\n\t\t\t\tcount+=1\n\t\tif (j+1)>-1 and (j+1)<n:\n\t\t\tif l[i][j+1] =='o':\n\t\t\t\tcount+=1\n\t\tif count%2==0:\n\t\t\tcount=0\n\t\telse:\n\t\t\ts.append(0)\n\t\t\tcount=0\n\nif 0 in s:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")\n\n\n\n\t \t\t \t \t\t \t \t\t\t\t\t\t \t\t\t\t\t", "n=int(input())\r\nl=[]\r\nflag=False\r\nfor i in range(n):\r\n s=input()\r\n l.append(list(s))\r\nfor i in range(n):\r\n for j in range(n):\r\n \r\n c=0\r\n if i-1>=0 and l[i-1][j]=='o':\r\n c+=1\r\n if i+1<n and l[i+1][j]=='o':\r\n c+=1\r\n if j-1>=0 and l[i][j-1]=='o':\r\n c+=1\r\n if j+1<n and l[i][j+1]=='o':\r\n c+=1\r\n\r\n if c&1:\r\n flag=True\r\n break\r\n \r\nif flag:\r\n print('NO')\r\n\r\nelse:\r\n print('YES')\r\n\r\n\r\n \r\n", "# Problem Statement - https://codeforces.com/problemset/problem/462/A\r\n\r\nn = int(input())\r\n\r\nboard = []\r\neven = 0\r\n\r\nfor i in range(n):\r\n board.append(str(input()))\r\n \r\nfor i in range(n):\r\n if even == 1:\r\n break\r\n\r\n for j in range(n):\r\n cell = 0\r\n\r\n if i > 0 and board[i-1][j] == \"o\":\r\n cell += 1\r\n\r\n if i < n - 1 and board[i + 1][j] == 'o':\r\n cell += 1\r\n\r\n if j > 0 and board[i][j - 1] == 'o':\r\n cell += 1\r\n\r\n if j < n - 1 and board[i][j + 1] == 'o':\r\n cell += 1\r\n\r\n if cell % 2 != 0:\r\n even = 1\r\n break\r\n \r\nif(even == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\nm = []\nfor i in range(n):\n # m.append(list(input()))\n m.append(input())\nfor i in range(n):\n for j in range(n):\n c = (1 if i-1 >= 0 and m[i-1][j] == 'o' else 0)\n c += (1 if j+1 <= n-1 and m[i][j+1] == 'o' else 0)\n c += (1 if i+1 <= n-1 and m[i+1][j] == 'o' else 0)\n c += (1 if j-1 >= 0 and m[i][j-1] == 'o' else 0)\n if c % 2 == 1:\n print(\"NO\")\n exit(0)\nprint(\"YES\")\n", "def pad(a):\r\n l = [[0 for i in range(len(a[0])+2)]]\r\n for i in range(len(a)):\r\n c = [0]\r\n c+=a[i]\r\n c+=[0]\r\n l.append(c)\r\n l.append([0 for i in range(len(a[0])+2)])\r\n return l\r\nn = int(input())\r\nc = []\r\nfor i in range(n):\r\n s = list(input())\r\n c.append(s)\r\nl = pad(c)\r\nk = 0\r\nfor i in range(1,len(l)-1):\r\n for j in range(1,len(l[i])-1):\r\n z = 0\r\n if(l[i-1][j]=='o'):\r\n z+=1\r\n if(l[i][j-1]=='o'):\r\n z+=1\r\n if(l[i+1][j]=='o'):\r\n z+=1\r\n if(l[i][j+1]=='o'):\r\n z+=1\r\n if(z%2==0):\r\n k+=1\r\nif(k==n*n):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "res = 'YES'\r\nn = int(input())\r\nboard = [None]*n\r\nfor i in range(n):\r\n board[i] = input()\r\nfor i in range(n):\r\n for j in range(n):\r\n adj_o_cells_num = 0\r\n candidates = []\r\n for candidate in ([i-1, j], [i+1, j], [i, j-1], [i, j+1]):\r\n if candidate[0] >= 0 and candidate[0] < n and candidate[1] >= 0 and candidate[1] < n:\r\n candidates.append(candidate)\r\n for candidate in candidates:\r\n if board[candidate[0]][candidate[1]] == 'o':\r\n adj_o_cells_num += 1\r\n if adj_o_cells_num % 2:\r\n res = 'NO'\r\n break\r\n if res == 'NO':\r\n break\r\nprint(res)\r\n", "n = int(input())\nl = [list(input()) for x in range(n)]\nfor i in range(n):\n for j in range(n):\n count = 0\n if j-1>=0 and l[i][j-1] == 'o':\n count += 1\n if j+1<n and l[i][j+1] == 'o':\n count += 1\n if i-1>=0 and l[i-1][j] == 'o':\n count += 1\n if i+1<n and l[i+1][j] == 'o':\n count += 1\n if count%2 != 0:\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n\t\t \t\t \t \t\t \t\t \t \t\t \t\t", "n = int(input())\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(input())\r\n\r\n\r\ndef checkNeighbors(i, j):\r\n tuples = [(-1, 0), (0, 1), (1, 0), (0, -1)]\r\n adjOs = 0\r\n for thing in tuples:\r\n newX = i + thing[0]\r\n newY = j + thing[1]\r\n if newX < 0 or newY < 0 or newX >= n or newY >= n:\r\n continue\r\n if grid[newX][newY] == 'o':\r\n adjOs += 1\r\n return adjOs % 2 == 0\r\n\r\noutput = \"YES\"\r\nfor i in range(n):\r\n for j in range(n):\r\n if not checkNeighbors(i, j):\r\n output = \"NO\"\r\nprint(output)\r\n\r\n\r\n", "n = int(input())\r\nboard = [input() for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n c = 0\r\n for di,dj in [(-1,0),(1,0),(0,-1),(0,1)]:\r\n if i+di>=0 and j+dj>=0 and i+di<n and j+dj<n:\r\n if board[i+di][j+dj] == 'o':\r\n c += 1\r\n if c%2:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n = int(input())\r\nBoard = []\r\nEven = True\r\nfor i in range(n):\r\n Board.append(input())\r\nfor i in range(n):\r\n for j in range(n):\r\n S = 0\r\n if i != (n-1):\r\n if Board[i+1][j] == \"o\":\r\n S+=1\r\n if i != 0:\r\n if Board[i-1][j] == \"o\":\r\n S += 1\r\n if j != (n-1):\r\n if Board[i][j+1] == \"o\":\r\n S += 1\r\n if j != 0:\r\n if Board[i][j-1] == \"o\":\r\n S += 1\r\n if S % 2 != 0:\r\n Even = False\r\n break\r\nif Even:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nx = [0,1,-1,0]\r\ny = [1,0,0,-1]\r\narr = [[0 for v in range(n)] for c in range(n)]\r\n\r\nfor i in range(n):\r\n arr[i]=input()\r\nfor i in range(n):\r\n for j in range(n):\r\n c = 0\r\n for k in range(4):\r\n if i+x[k]<0 or i+x[k]>=n or j+y[k]<0 or j+y[k]>=n:\r\n continue\r\n if arr[i+x[k]][j+y[k]] == 'o':\r\n c+=1\r\n if c%2:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "n = int(input())\r\na = []; k = 0\r\na.append([0 for i in range(n+2)])\r\nfor i in range(n):\r\n b = list(input())\r\n b = [0] + b;b.append(0)\r\n a.append(b)\r\na.append([0 for i in range(n+2)])\r\nfor i in range(1,len(a)-1):\r\n for j in range(1,len(a)-1):\r\n if a[i][j+1] == \"o\": k+=1\r\n if a[i][j-1] == \"o\": k+=1\r\n if a[i-1][j] == \"o\": k+=1\r\n if a[i+1][j] == \"o\": k+=1\r\n if k % 2 != 0:\r\n print(\"NO\")\r\n exit()\r\n else: k=0\r\nprint(\"YES\")", "n = int(input())\r\nm =[]\r\nfor k in range(n):\r\n a = list(input())\r\n m.append(a)\r\nfor i in range(n):\r\n for j in range(n):\r\n c = 0\r\n if i-1>=0 and m[i-1][j] == \"o\":\r\n c = c+1\r\n if i+1 < n and m[i+1][j] == \"o\":\r\n c = c+1\r\n if j-1>=0 and m[i][j-1] == \"o\":\r\n c = c+1\r\n if j+1 < n and m[i][j+1] == \"o\":\r\n c = c+1\r\n if c%2 !=0:\r\n l = 1\r\n break\r\n else:\r\n l = 0\r\n if c%2 !=0:\r\n break\r\nif l == 1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nAnswer = True\r\na = []\r\nnumber = 0\r\nfor i in range(n):\r\n a.append(list(input()))\r\ncounter = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n counter = 0;\r\n if (i + 1 >= 0 and i + 1 < n and a[i + 1][j] == 'o'):\r\n counter+=1\r\n\r\n if (i - 1 >= 0 and i - 1 < n and a[i - 1][j] == 'o'):\r\n counter+=1\r\n\r\n if (j + 1 >= 0 and j + 1 < n and a[i][j + 1] == 'o'):\r\n counter+=1\r\n\r\n if (j - 1 >= 0 and j - 1 < n and a[i][j - 1] == 'o'):\r\n counter+=1\r\n if (counter % 2 == 1):\r\n print (\"NO\")\r\n exit(0)\r\n\r\n\r\nprint (\"YES\")", "n=int(input())\r\na=[(n+2)*'r']\r\nfor i in range(n):\r\n a.append('r'+input()+'r')\r\na.append((n+2)*'r')\r\nf='YES'\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n t=0\r\n if a[i][j-1]=='o':\r\n t+=1\r\n if a[i-1][j]=='o':\r\n t+=1\r\n if a[i+1][j]=='o':\r\n t+=1\r\n if a[i][j+1]=='o':\r\n t+=1\r\n if t%2!=0:\r\n f='NO'\r\n break\r\n if f=='NO':\r\n break\r\nprint(f)\r\n", "n=int(input())\r\nc=''\r\nfor _ in range(n):\r\n s=input()\r\n c=c+s\r\nif(c==c[::-1]):\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\nanswer=\"\"\r\nfor i in range(n):\r\n s=input()\r\n answer+=s\r\nif answer==answer[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(list(input()))\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n c = 0\r\n if i > 0 and arr[i - 1][j] == 'o':\r\n c += 1\r\n if i < n - 1 and arr[i + 1][j] == 'o':\r\n c += 1\r\n if j > 0 and arr[i][j - 1] == 'o':\r\n c += 1\r\n if j < n - 1 and arr[i][j + 1] == 'o':\r\n c += 1\r\n if c % 2 != 0:\r\n print(\"NO\")\r\n flag = False\r\n break\r\n if not flag:\r\n break\r\nif flag:\r\n print(\"YES\")\r\n", "n = int(input())\nmat = list()\nfor i in range(n):\n mat.append(list(input()))\nans = set()\nfor i in range(n):\n for j in range(n):\n neighbour = [(i, j-1), (i, j+1), (i-1, j), (i+1, j)]\n s = 0\n for nbr in neighbour:\n if nbr[0] < 0 or nbr[1] < 0 or nbr[1] > n-1 or nbr[0] > n-1:\n continue\n else:\n if mat[nbr[0]][nbr[1]] == 'o':\n s += 1\n ans.add(s)\nresult = True\nfor i in ans:\n if i % 2 == 1:\n print(\"NO\")\n result = False\n break\nif result:\n print(\"YES\")", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\ngrid = [list(input().strip()) for i in range(n)]\ndirs = [(1, 0), (-1, 0), (0, 1), (0, -1)]\n\n\nans = True\nfor i in range(n):\n for j in range(n):\n valid = []\n for dir in dirs:\n if i+dir[0] < 0 or i+dir[0] >= n or j+dir[1] < 0 or j+dir[1] >= n:\n continue\n valid.append(grid[i+dir[0]][j+dir[1]])\n \n if valid.count('o') % 2:\n ans = False\n break\n\nprint('YES' if ans else 'NO')\n ", "n = int(input())\r\nmemo = [['x'] * (n + 2)]\r\nfor _ in range(n):\r\n memo.append(['x'] + list(input()) + ['x'])\r\nmemo.append(['x'] * (n + 2))\r\n\r\nmove = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\n\r\nflag = True\r\nfor i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n cnt = 0\r\n for k in move:\r\n if memo[i + k[0]][j + k[1]] == 'o':\r\n cnt += 1\r\n if cnt % 2 == 1:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/24 22:42\r\n\r\n\"\"\"\r\n\r\n\r\n\r\nN = int(input())\r\n\r\nA = []\r\nfor i in range(N):\r\n A.append(list(input()))\r\n\r\n\r\nfor r in range(N):\r\n for c in range(N):\r\n count = 0\r\n for d in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\r\n nr, nc = r+d[0], c+d[1]\r\n if 0 <= nr < N and 0 <= nc < N:\r\n if A[nr][nc] == 'o':\r\n count += 1\r\n\r\n if count %2 != 0:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")\r\n", "n = int(input())\r\nboard = []\r\n\r\nfor _ in range(n):\r\n board.append(list(input()))\r\n\r\nflag = True\r\ncur_col = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n cur_col = 0\r\n\r\n if i + 1 < n and board[i + 1][j] == 'o':\r\n cur_col += 1\r\n if j + 1 < n and board[i][j + 1] == 'o':\r\n cur_col += 1\r\n if j - 1 >= 0 and board[i][j - 1] == 'o':\r\n cur_col += 1\r\n if i - 1 >= 0 and board[i - 1][j] == 'o':\r\n cur_col += 1\r\n\r\n if cur_col % 2 != 0:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nboard=\"\"\r\nfor i in range(n):\r\n cell=input()\r\n board+=cell\r\nif board == board[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import math\r\nimport sys\r\n\r\n#imgur.com/Pkt7iIf.png\r\n\r\n#n, m = map(int, input().split())\r\n#n = int(input())\r\n#d = list(map(int, input().split()))\r\n\r\ndef check(d, n, i, j):\r\n if i < 0 or i > n - 1 or j < 0 or j > n - 1:\r\n return 0\r\n return d[i][j] == 'o'\r\n\r\nn = int(input())\r\nd = []\r\nfor i in range(n):\r\n d.append(input())\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n r = check(d, n, i - 1,j) + check(d, n, i + 1, j) + \\\r\n check(d, n, i, j - 1) + check(d, n, i, j + 1)\r\n if r%2 != 0:\r\n exit(print('NO'))\r\nprint('YES')", "X = ''\r\nfor i in range(int(input())):\r\n X+=input()\r\nprint(\"YES\" if X == X[::-1] else \"NO\")", "import sys, collections, math, itertools, random\r\nINF = sys.maxsize\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nmod = 1000000007\r\n\r\nn = int(input())\r\ns = ''\r\nfor tt in range(n):\r\n temp = input()\r\n s += temp\r\nif list(s) == list(reversed(s)):\r\n print('YES')\r\nelse:\r\n print('NO')", "\r\n\r\n\r\n'''\r\n '''\r\n\r\ndef func():\r\n n=int(input())\r\n s=[]\r\n tt=\"\"\r\n for i in range(n):\r\n tt=tt+'xx'\r\n s.append(tt)\r\n for i in range(n):\r\n st=input()\r\n s.append('x'+st+'xxxxxxxxxxx')\r\n s.append(tt)\r\n for i in range(1,n+1):\r\n for j in range(1,n+1):\r\n\r\n c = 0\r\n if (s[i][j - 1] == 'o'): c += 1\r\n if (s[i][j + 1] == 'o'): c += 1\r\n if (s[i - 1][j] == 'o'): c += 1\r\n if (s[i + 1][j] == 'o'): c += 1\r\n if (c % 2 == 1):\r\n print(\"NO\")\r\n return;\r\n print(\"YES\")\r\n\r\n\r\n\r\n\r\nfunc()\r\n\r\n\r\n", "n = int(input())\r\n\r\nAnswer = True\r\nMassif = []\r\nnumber = 0\r\nfor i in range(n):\r\n Massif.append(list(input()))\r\n\r\nfor i in range(len(Massif[0])):\r\n for j in range(len(Massif[0])):\r\n if(i-1 >= 0):\r\n if(Massif[i-1][j] == 'o'):\r\n number += 1\r\n if(i+1 < len(Massif[0])):\r\n if(Massif[i+1][j] == 'o'):\r\n number += 1\r\n if(j-1 >= 0):\r\n if (Massif[i][j-1] == 'o'):\r\n number += 1\r\n if (j+1 < len(Massif[0])):\r\n if (Massif[i][j + 1] == 'o'):\r\n number += 1\r\n if(number%2 != 0):\r\n Answer = False\r\n break\r\n else:\r\n number = 0\r\n if(Answer == False):\r\n break\r\nif(Answer == False):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\r\nc = \"\"\r\nfor i in range(n):\r\n c+=input()\r\nprint('YES' if c==c[::-1] else 'NO')", "n = int(input())\na = []\nfor i in range(n):\n a.append(input()[0:n])\nfor i in range(n):\n for j in range(n):\n c = 0\n f = 0\n if i-1 >= 0 and a[i-1][j] == 'o':\n c += 1\n if j-1 >= 0 and a[i][j-1] == 'o':\n c += 1\n if j+1 < n and a[i][j+1] == 'o':\n c += 1\n if i+1 < n and a[i+1][j] == 'o':\n c += 1\n if c % 2 == 1:\n f = 1\n break\n if f == 1:\n break\nif f == 1:\n print('NO')\nelse:\n print('YES')\n", "n=int(input())\r\nl1=[]\r\nfor i in range(n):\r\n l1.append(input())\r\nflag=0\r\nc1=0\r\nflag=0\r\nfor i in range(len(l1)):\r\n if(flag==1):\r\n break\r\n for j in range(len(l1)):\r\n if(i-1>=0 and l1[i-1][j]=='o'):\r\n c1+=1\r\n if(i+1<len(l1) and l1[i+1][j]=='o'):\r\n c1+=1\r\n if(j-1>=0 and l1[i][j-1]=='o'):\r\n c1+=1\r\n if(j+1<len(l1) and l1[i][j+1]=='o'):\r\n c1+=1\r\n if(c1%2!=0):\r\n print(\"NO\")\r\n flag=1\r\n break\r\n else:\r\n continue\r\nif(flag==0):\r\n print(\"YES\") \r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\n\r\np=[]\r\n\r\nfor i in range(n):\r\n p.append(input())\r\n\r\nz=0\r\nfor i in range(n):\r\n for j in range(n):\r\n a=j+1\r\n b=j-1\r\n c=i+1\r\n d=i-1\r\n l=[]\r\n if(a>n-1):\r\n pass\r\n else:\r\n l.append(p[i][a])\r\n if(c>n-1):\r\n pass\r\n else:\r\n l.append(p[c][j])\r\n if(b<0):\r\n pass\r\n else:\r\n l.append(p[i][b])\r\n if(d<0):\r\n pass\r\n else:\r\n l.append(p[d][j])\r\n if(l.count('o')%2==0):\r\n continue\r\n else:\r\n z=1\r\n break\r\n if(z==1):\r\n break\r\nif(z==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n = int(input())\r\nlst=[]\r\nflag=1\r\n\r\nfor _ in range(n):\r\n x = list(input())\r\n lst.append(x)\r\n \r\nfor i in range(n):\r\n cnt=0\r\n \r\n for j in range(n):\r\n if i-1 >= 0 and lst[i-1][j] == \"o\":\r\n cnt+=1\r\n if i+1 < n and lst[i+1][j] == \"o\":\r\n cnt+=1\r\n \r\n if j-1 >= 0 and lst[i][j-1] == \"o\":\r\n cnt+=1\r\n if j+1 < n and lst[i][j+1] == \"o\" and i<n:\r\n cnt+=1\r\n \r\n if cnt%2 == 1:\r\n flag=0\r\n\r\nif flag==1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import *\r\nn=int(input())\r\nl=['x'*(n+2)]+['x'+input()+'x' for i in range(n)]+['x'*(n+2)]\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n k=0\r\n if l[i+1][j]=='o': k+=1\r\n if l[i-1][j]=='o': k+=1\r\n if l[i][j+1]=='o': k+=1\r\n if l[i][j-1]=='o': k+=1\r\n if k%2: print('NO'); exit()\r\nprint('YES')", "n = int(input())\r\narr = [['p']*(n+2)]\r\nfor i in range(n):\r\n lst = list(input())\r\n lst.insert(0,'p')\r\n lst.append('p')\r\n arr.append(lst)\r\narr += [['p']*(n+2)]\r\ncheck = 0\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n count = 0\r\n if arr[i][j-1]=='o':\r\n count += 1\r\n if arr[i][j+1]=='o':\r\n count += 1\r\n if arr[i-1][j]=='o':\r\n count += 1\r\n if arr[i+1][j]=='o':\r\n count += 1\r\n if count%2 != 0:\r\n check = 1\r\n break\r\nif check==0:\r\n print('YES')\r\nelse:\r\n print('NO')", "n=int(input())\r\n\r\nb=[]\r\nz=\"z\"*(n+2)\r\n\r\nb.append(z)\r\n\r\nfor i in range(n):\r\n b.append(\"z\"+input()+\"z\")\r\n\r\nb.append(z)\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n count=0\r\n if b[i][j+1]==\"o\":\r\n count+=1\r\n if b[i][j-1]==\"o\":\r\n count+=1\r\n if b[i+1][j]==\"o\":\r\n count+=1\r\n if b[i-1][j]==\"o\":\r\n count+=1\r\n if count%2!=0:\r\n print(\"NO\")\r\n break\r\n elif i == n and j==n:\r\n print(\"YES\")\r\n if count%2!=0:\r\n break", "ReadStr = lambda : input()\r\nReadList = lambda : list(map(int,input().split()))\r\nReadInt = lambda : int(input())\r\nReadMultipleValues = lambda :map(int,input().split())\r\n\r\n# Python3 program \r\nn = ReadInt()\r\nstring =\"\"\r\nfor i in range(n):\r\n string +=ReadStr()\r\nprint(\"YES\" if string == string[::-1] else \"NO\")\r\n", "n = int(input())\r\neven_flag = True\r\nchecker = list()\r\nfor i in range(n):\r\n inp = input()\r\n checker.append(inp)\r\nfor i in range(n):\r\n c = 0\r\n for j in range(n):\r\n if i-1 >= 0 and checker[i-1][j] == 'o':\r\n c += 1\r\n if i+1 < n and checker[i+1][j] == 'o':\r\n c += 1\r\n if j-1 >= 0 and checker[i][j-1] == 'o':\r\n c += 1\r\n if j+1 < n and checker[i][j+1] == 'o':\r\n c += 1\r\n if c % 2 != 0:\r\n even_flag = False\r\n break\r\nif even_flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\nf = 0\r\nfor i in range(n):\r\n \r\n for j in range(n):\r\n c = 0 \r\n if(i > 0 and l[i - 1][j] == 'o'):\r\n c += 1 \r\n if(j > 0 and l[i][j - 1] == 'o'):\r\n c += 1 \r\n if(i < n - 1 and l[i + 1][j] == 'o'):\r\n c += 1 \r\n if(j < n - 1 and l[i][j + 1] == 'o'):\r\n c += 1 \r\n if(c % 2):\r\n f = 1 \r\n\r\nif(f):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "# from dust i have come dust i will be\r\n\r\nn = int(input())\r\n\r\ns = [None] * n\r\nfor i in range(n):\r\n s[i] = input()\r\n\r\ndx = [1, -1, 0, 0]\r\ndy = [0, 0, 1, -1]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n for k in range(4):\r\n x = i + dx[k]\r\n y = j + dy[k]\r\n\r\n if x >= 0 and y >= 0 and x < n and y < n:\r\n if s[x][y] == 'o':\r\n cnt += 1\r\n\r\n if cnt % 2 == 1:\r\n print('NO')\r\n exit(0)\r\n\r\nprint('YES')\r\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline().strip())\r\nboard = []\r\nrow_0 = list((n + 1) * 'e')\r\nboard.append(row_0)\r\nfor i in range(n):\r\n row = list(stdin.readline().strip())\r\n row.insert(0, 'e')\r\n row.append('e')\r\n board.append(row)\r\nlast_row = list((n + 1) * 'e')\r\nboard.append(last_row)\r\nbool_value = True\r\nfor i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n nbors = [board[i][j+1], board[i+1][j], board[i][j-1], board[i-1][j]]\r\n if nbors.count('o') % 2 != 0:\r\n bool_value = False\r\n break\r\n if bool_value == False:\r\n break\r\n\r\nif bool_value:\r\n stdout.write('YES')\r\nelse:\r\n stdout.write('NO')", "n = int(input()) # Вводим число строк\r\nboard = [input() for _ in range(n)] # Формируем доску\r\nfor i in range(n):\r\n for j in range(n): # Цикл в цикле для прогона по всем элементам доски\r\n c = 0 # Счётчик ячеек с символом 'o'\r\n for di, dj in [(-1,0),(1,0),(0,-1),(0,1)]: # Здесь мы смотрим на координаты проверяемых ячеек, относительно текущего элемента\r\n if i + di >= 0 and j + dj >= 0 and i + di < n and j + dj < n: # Проверка на не выход с доски\r\n if board[i + di][j + dj] == 'o': # Буквально, если проверяемая ячейка - 'o', прибавляем счётчик\r\n c += 1\r\n if c%2: # Проверка на чётность количества ячеек с 'o'\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "'''\r\n1 Habib_2010\r\n2 ___Hafizullo___\r\n3 Cyber_Snake\r\n4 mr.itmo\r\n5 I_am_Naruto\r\n6 JahongirLucifer\r\n7 _Habibolloh_\r\n'''\r\nn = int(input())\r\na = [input() for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n if i > 0 and a[i-1][j] == 'o':\r\n cnt += 1\r\n if i < n-1 and a[i+1][j] == 'o':\r\n cnt += 1\r\n if j > 0 and a[i][j-1] == 'o':\r\n cnt += 1\r\n if j < n-1 and a[i][j+1] == 'o':\r\n cnt += 1\r\n if cnt % 2 == 1:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "n=int(input())\r\ndef solve(n):\r\n\tl=[]\r\n\tc=0\r\n\tfor i in range(n):\r\n\t\tl+=[input()]\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif (i-1)>=0:\r\n\t\t\t\tif l[i-1][j]==\"o\":\r\n\t\t\t\t\tc+=1\r\n\t\t\tif (j-1)>=0:\r\n\t\t\t\tif l[i][j-1]==\"o\":\r\n\t\t\t\t\tc+=1\r\n\t\t\tif (i+1)<n:\r\n\t\t\t\tif l[i+1][j]==\"o\":\r\n\t\t\t\t\tc+=1\r\n\t\t\tif (j+1)<n:\r\n\t\t\t\tif l[i][j+1]==\"o\":\r\n\t\t\t\t\tc+=1\r\n\t\t\tif c%2:\r\n\t\t\t\tprint('NO')\r\n\t\t\t\treturn\r\n\telse:\r\n\t\tprint(\"YES\")\r\nsolve(n)", "n=int(input())\r\ncnt=0;\r\ndirx = [0,0,1,-1];\r\ndiry = [1,-1,0,0];\r\nch = []\r\ndef valid_step(r, c):\r\n\treturn r>=0 and r<n and c>=0 and c<n\r\n\r\nfor i in range(n):\r\n\tch.append(input())\r\n\r\ndef solve_o(n):\r\n\tfor i in range(n):\r\n\t\tfor g in range(n):\r\n\t\t\tcnt=0\r\n\t\t\tfor k in range(4):\r\n\t\t\t\tx = dirx[k] +i\r\n\t\t\t\ty = diry[k] +g\r\n\t\t\t\tif valid_step(x,y) and ch[x][y] =='o':\r\n\t\t\t\t\tcnt +=1\r\n\t\t\tif cnt % 2 != 0:\r\n\t\t\t\treturn 0\r\n\treturn 1\r\n\r\nprint(\"YES\") if(solve_o(n)) else print(\"NO\")\r\n", "size = int(input())\nlines = []\nfor _ in range(size):\n lines.append(input())\n\ndef getIndexOfNeighoringTiles(i, j):\n neighbors = []\n if (j % size != 0):\n neighbors.append(lines[i][j - 1])\n if (j % size != (size - 1)):\n neighbors.append(lines[i][j + 1])\n if (i % size != 0):\n neighbors.append(lines[i - 1][j])\n if (i % size != (size - 1)):\n neighbors.append(lines[i + 1][j])\n return neighbors\n\ndef main(size, lines):\n for i in range(size):\n for j in range(size):\n neighbors = getIndexOfNeighoringTiles(i, j)\n count = neighbors.count('o')\n if count % 2 != 0:\n return False\n return True\nthing = main(size, lines)\nif thing == True:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n s=input()\r\n arr.append(s)\r\nel=0\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt=0\r\n if(i-1>=0 and arr[i-1][j]=='o'):\r\n cnt+=1\r\n if(i+1<n and arr[i+1][j]=='o'):\r\n cnt+=1\r\n if(j-1>=0 and arr[i][j-1]=='o'):\r\n cnt+=1\r\n if(j+1<n and arr[i][j+1]=='o'):\r\n cnt+=1\r\n\r\n if(cnt%2==0):\r\n el+=1\r\nif(el==n*n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ncheck = [[0]*n for _ in range(n)]\nfor i in range(n):\n\tstring = input()\n\tcheck[i] = list(string)\nflag = True\nfor i in range(n):\n\tfor j in range(n):\n\t\tcount = 0\n\t\tif (i-1 >= 0 and check[i-1][j] is 'o'):\n\t\t\tcount += 1\n\t\tif (i+1 < n and check[i+1][j] is 'o'):\n\t\t\tcount += 1\n\t\tif (j-1 >= 0 and check[i][j-1] is 'o'):\n\t\t\tcount += 1\n\t\tif (j+1 < n and check[i][j+1] is 'o'):\n\t\t\tcount += 1\n\t\tif count % 2 != 0:\n\t\t\tflag = False\n\t\t\tbreak\n\nprint(\"YES\" if flag is True else \"NO\")\n\t\t", "def countAdj(grid, n, i, j):\r\n\tc = 0\r\n\tif i+1 < n:\r\n\t\tif grid[i+1][j] == 'o':\r\n\t\t\tc += 1\r\n\tif j+1 < n:\r\n\t\tif grid[i][j+1] == 'o':\r\n\t\t\tc += 1\r\n\tif i-1 >= 0:\r\n\t\tif grid[i-1][j] == 'o':\r\n\t\t\tc += 1\r\n\tif j-1 >= 0:\r\n\t\tif grid[i][j-1] == 'o':\r\n\t\t\tc += 1\r\n\treturn c\r\n\r\ndef weGood(grid):\r\n\tfor i in range(n):\r\n\t\tfor j in range(n):\r\n\t\t\tif countAdj(grid, n, i, j) % 2 != 0:\r\n\t\t\t\treturn False\r\n\treturn True \r\ngrid = []\r\nn = int(input().strip())\r\nfor i in range(n):\r\n\tgrid.append(list(input().strip()))\r\nprint(['NO', 'YES'][weGood(grid)])", "a= int(input())\r\nli = [0]*a\r\nx= 1\r\nfor i in range(a):\r\n li[i] = input()\r\nfor i in range(a):\r\n for j in range(a):\r\n \r\n count =0\r\n if i-1 >=0:\r\n if li[i-1][j]== 'o': count += 1\r\n if i+1 <a:\r\n if li[i+1][j]== 'o': count += 1\r\n if j-1>= 0:\r\n if li[i][j-1] == 'o': count += 1\r\n if j+1<a:\r\n if li[i][j+1]== 'o': count += 1\r\n if count%2 !=0 : print('NO');x =0; break\r\n if x==0: break\r\nif x : print('YES')\r\n", "n=int(input())\nc=['x' for i in range(n+2)]\na=[]\na.append(c)\n\nfor i in range(n):\n inp=input()\n b=['x']\n for j in inp:\n b.append(j)\n b.append('x')\n a.append(b)\n\na.append(c)\nda=True\n\nfor i in range(1,n+1):\n for j in range(1,n+1):\n br=0\n if a[i-1][j]=='o':\n br+=1\n if a[i][j+1]=='o':\n br+=1\n if a[i+1][j]=='o':\n br+=1\n if a[i][j-1]=='o':\n br+=1\n if br%2!=0:\n da=False\n break\n\nif da:\n print('YES')\n\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\nmatrix=[]\r\nrow=[]\r\nif n==2:\r\n row1=input()\r\n row2=input()\r\n row=row1+row2\r\n if row=='xoox'or row=='oxxo':\r\n print(\"YES\")\r\n exit()\r\n else:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(n):\r\n string=input()\r\n for char in string:\r\n row.append(char)\r\n matrix.append(row)\r\n row=[]\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n if matrix[i][j]!=matrix[j][i]:\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\nX = ''\r\nfor i in range(int(input())):\r\n X+=input()\r\nprint(\"YES\" if X==X[::-1] else \"NO\")", "n = int(input())\r\n\r\nc = [[] for i in range(n+2)]\r\nfor i in range(n+2):\r\n for _ in range(n+2):\r\n c[i].append(0)\r\n\r\nfor i in range(1,n+1) :\r\n for k,j in enumerate(input(),1) :\r\n if j == 'o':\r\n c[i][k-1]+=1\r\n c[i][k+1]+=1\r\n c[i+1][k]+=1\r\n c[i-1][k]+=1\r\n\r\no = True \r\nfor i in range(1,n+1) :\r\n for j in range(1,n+1) :\r\n if c[i][j] %2 != 0:\r\n o = False\r\n break\r\n\r\nif o :\r\n print('YES')\r\nelse :\r\n print('NO')", "n = int(input())\r\nboard = [None]*n\r\nfor i in range(n):\r\n board[i] = input()\r\n\r\ndef is_inside(i,j,n):\r\n if 0<=i and i<n and 0<=j and j<n:\r\n return True\r\n else:\r\n return False\r\n \r\ndx = [0, 0, 1, -1] # u d r l\r\ndy = [-1, 1, 0, 0]\r\n\r\nret = True\r\nfor j in range(n):\r\n for i in range(n):\r\n num_circle = 0\r\n for d in range(4):\r\n if is_inside(i+dx[d], j+dy[d], n):\r\n if board[i+dx[d]][j+dy[d]] == 'o':\r\n num_circle += 1\r\n if num_circle%2!=0:\r\n ret = False\r\nif ret:\r\n print('YES')\r\nelse:\r\n print('NO')", "N = int(input())\n\nboard = [None] * N\nfor i in range(N):\n board[i] = input()\n\nis_even = 0\nfor i in range(N):\n if is_even == 1:\n break\n for j in range(N):\n count_adjacent_cells = 0\n if i > 0 and board[i - 1][j] == 'o':\n count_adjacent_cells += 1\n if i < N - 1 and board[i + 1][j] == 'o':\n count_adjacent_cells += 1\n if j > 0 and board[i][j - 1] == 'o':\n count_adjacent_cells += 1\n if j < N - 1 and board[i][j + 1] == 'o':\n count_adjacent_cells += 1\n\n if count_adjacent_cells%2 != 0:\n is_even = 1\n break\n\nif is_even == 0:\n print('YES')\nelse:\n print('NO')\n \n \n", "n = int(input())\r\nstring = ''\r\nfor i in range(n):\r\n string += input()\r\nif string == string[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import heapq\r\nimport sys, math, bisect\r\nfrom heapq import *\r\nfrom queue import PriorityQueue\r\n\r\nfrom collections import Counter, defaultdict\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# print = sys.stdout.write\r\ninl = lambda: list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n = inl()[0]\r\n mat = [input() for _ in range(n)]\r\n\r\n for r in range(n):\r\n for c in range(n):\r\n count = 0\r\n for i, j in [(-1, 0), (1, 0), (0, -1), (0, 1)]:\r\n nr, nc = r + i, c + j\r\n if nr in range(n) and nc in range(n):\r\n count += (mat[nr][nc] == \"o\")\r\n\r\n if count % 2 != 0:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\n\r\nprint(solve())\r\n", "# -*- coding: utf-8 -*-\r\n# @Author: SyedAli\r\n# @Date: 2019-05-26 03:29:22\r\n# @Last Modified by: SyedAli\r\n# @Last Modified time: 2019-05-26 03:34:15\r\n\r\nx = ''\r\nfor _ in range(int(input())):\r\n x+=input()\r\nif list(x) == list(reversed(x)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n# print(x,\"\".join(list(reversed(x))))", "X = ''\r\nfor i in range(int(input())):\r\n X+=input()\r\nprint(\"YES\" if X==X[::-1] else \"NO\")", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n for i in range(n):\r\n for j in range(n):\r\n cnt=0\r\n if(i>0):\r\n if(l[i-1][j]=='o'):\r\n cnt+=1\r\n if(i<n-1):\r\n if(l[i+1][j]=='o'):\r\n cnt+=1\r\n if(j>0):\r\n if(l[i][j-1]=='o'):\r\n cnt+=1\r\n if(j<n-1):\r\n if(l[i][j+1]=='o'):\r\n cnt+=1\r\n if(cnt%2==1):\r\n return 'NO' \r\n return 'YES'\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n string=input()\r\n a = [string[x] for x in range(len(string)-1)]\r\n l.append(a)\r\n\r\nprint(exe())", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\nn = int(input())\r\na=list()\r\n\r\nfor i in range(n):\r\n a.append(list(map(lambda x: 1 if x==\"o\" else 0, list(input()))))\r\n\r\nfor x in range(n):\r\n for y in range(n):\r\n c=0\r\n if x!=0: c+=a[x-1][y]\r\n if y!=0: c+=a[x][y-1]\r\n if x!=n-1: c+=a[x+1][y]\r\n if y!=n-1: c+=a[x][y+1]\r\n\r\n if c%2==1:\r\n print(\"NO\")\r\n break\r\n else: continue\r\n break\r\nelse: print(\"YES\")\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nmat=[]\r\nb=True\r\nfor _ in range(n):\r\n s=list(map(str,input().split()))\r\n mat.append(s)\r\n\r\ncol=0\r\na=True\r\nfor row in range(n):\r\n if not a:break\r\n for val in range(n):\r\n c=0\r\n if val+1<n and mat[row][col][val+1]=='o':\r\n c+=1\r\n if row+1<n and mat[row+1][col][val]=='o':\r\n c+=1\r\n if val>0 and mat[row][col][val-1]=='o':\r\n c+=1\r\n if row-1>=0 and mat[row-1][col][val]=='o':\r\n c+=1\r\n \r\n if c%2==0:\r\n b=True\r\n else:\r\n b=False\r\n a=False\r\n break\r\n\r\nif b:print(\"YES\")\r\nelse:print(\"NO\")", "# coding=utf-8\n\nn = int(input())\ns = []\nadjacent = [[0 for i in range(n)] for j in range(n)]\nfor i in range(n):\n s.append(input())\n\nfor i in range(n):\n for j in range(n):\n if s[i][j] == 'o':\n if i + 1 < n:\n adjacent[i + 1][j] += 1\n if i - 1 >= 0:\n adjacent[i - 1][j] += 1\n if j + 1 < n:\n adjacent[i][j + 1] += 1\n if j - 1 >= 0:\n adjacent[i][j - 1] += 1\nfor i in range(n):\n for j in range(n):\n if adjacent[i][j] > 0 and adjacent[i][j] & 1 == 1:\n print('NO')\n break\n else:\n continue\n break\nelse:\n print('YES')\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\ndef main():\r\n n = inp()\r\n data = []\r\n for i in range(n):\r\n data.append(insr())\r\n moves = [(-1, 0), (1, 0), (0, 1), (0, -1)]\r\n ok = True\r\n for i in range(n):\r\n for j in range(n):\r\n\r\n c = 0\r\n for m in moves:\r\n x = i + m[0]\r\n y = j + m[1]\r\n if 0<= x <n and 0<= y <n and data[x][y]=='o':\r\n c+=1\r\n if c%2!=0:\r\n ok = False\r\n print(\"YES\" if ok else \"NO\")\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", "def get_adj(x, y):\r\n a = [(x, y + 1), (x, y - 1), (x + 1, y), (x - 1, y)]\r\n return [(i, j) for i, j in a if 0 <= i < n and 0 <= j < n]\r\n\r\n\r\nn = int(input())\r\nli = [input() for _ in range(n)]\r\nyes = True\r\nfor d in range(n):\r\n for e in range(n):\r\n k = 0\r\n for f, g in get_adj(d, e):\r\n if li[f][g] == \"o\":\r\n k += 1\r\n if k % 2:\r\n yes = False\r\nprint(\"YES\" if yes else \"NO\")\r\n", "n=int(input())\r\nmat=[]\r\neven=True\r\nfor i in range(n):\r\n mat.append(list(input()))\r\n\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if i-1 >=0 and mat[i-1][j]=='o':\r\n c+=1\r\n if i+1 <n and mat[i+1][j]=='o':\r\n c+=1\r\n if j-1>=0 and mat[i][j-1]=='o':\r\n c+=1\r\n if j+1<n and mat[i][j+1]=='o':\r\n c+=1\r\n if c&1:\r\n even=False\r\nif even:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#A. Appleman and Easy Task\r\nn = int(input())\r\nboard = []\r\nfor _ in range(n):\r\n board.append([x for x in input()])\r\n\r\nfor i in range(len(board)):\r\n for j in range(len(board[i])):\r\n tot = 0\r\n if i!=0: \r\n if board[i-1][j] == \"o\": tot+=1\r\n if i!=n-1: \r\n if board[i+1][j] == \"o\": tot+=1\r\n if j!=0: \r\n if board[i][j-1] == \"o\": tot+=1\r\n if j!=n-1: \r\n if board[i][j+1] == \"o\": tot+=1\r\n if not tot%2==0:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\na = []\r\nb = [(1, 0),(-1, 0), (0, 1), (0, -1)]\r\nfor _ in range(n):\r\n a.append(stdin.readline().strip())\r\n\r\nres = 'YES'\r\nfor i in range(n):\r\n for j in range(n):\r\n cur = 0\r\n for t in b:\r\n if 0 <= i+t[0] < n and 0 <= j+t[1] < n and a[i+t[0]][j+t[1]] == 'o':\r\n cur += 1\r\n if cur % 2 != 0:\r\n res = 'NO'\r\n break\r\n if res == 'NO':\r\n break\r\nprint(res)\r\n", "n = int(input())\r\ndata = [input() for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n if i!=0 and data[i-1][j]=='o':\r\n cnt += 1\r\n if j!=0 and data[i][j-1]=='o':\r\n cnt += 1\r\n if i!=n-1 and data[i+1][j]=='o':\r\n cnt += 1\r\n if j!=n-1 and data[i][j+1]=='o':\r\n cnt += 1\r\n if cnt%2!=0:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "n = int(input())\nfield = []\nfor i in range(n):\n\tfield.append(input())\nf = True\nsteps = ((1, 0), (-1, 0), (0, 1), (0, -1))\nfor i in range(n):\n\tfor j in range(n):\n\t\tcnt = 0\n\t\tfor step in steps:\n\t\t\tx = i + step[0]\n\t\t\ty = j + step[1]\n\t\t\tif x < 0 or y < 0 or x >= n or y >= n:\n\t\t\t\tcontinue\n\t\t\tif field[x][y] == 'o':\n\t\t\t\tcnt += 1\n\t\tif cnt % 2:\n\t\t\tf = False\nprint('YES' if f else 'NO')\n", "n = int(input())\r\n\r\nrow = []\r\nfor i in range (n): row.append(input())\r\n\r\nleft = row[:n//2+1]\r\nright = row[n//2:]\r\n\r\nright = right[::-1]\r\n\r\ncheck = True\r\nfor i in range (n//2):\r\n if(right[i][::-1] != left[i]):\r\n check = False\r\n break\r\n\r\nprint('YES' if (check) else 'NO')", "#n, d = input().split()\n#n = int (n)\n#d = int (d)\nn = int(input())\n#h = list(map(int, input().split()))\n#g = list(map(int, input().split()))\n#x1, y1, x2, y2 =map(int,input().split())\n#n = int(input())\n# = [\"\"]*n\ns = [[]]*(n+2)\ns[0] = ['x']*(n+2)\nfor i in range(1, n+1):\n s[i] = ['x']+list(input())+ ['x']\ns[n+1] = ['x']*(n+2) \n#print (s)\nf = True\nfor i in range(1, n+1):\n for j in range (1, n+1):\n c = 0\n if s[i-1][j] == 'o':\n c += 1\n if s[i][j-1] == 'o':\n c += 1\n if s[i+1][j] == 'o':\n c += 1\n if s[i][j+1] == 'o':\n c += 1\n #print(i,j,c)\n if c % 2 != 0:\n f = False\n break\nif f:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n \n\n", "X=''\r\nfor i in range(int(input())):\r\n X+=input()\r\nprint(\"YES\"if X==X[::-1]else\"NO\")", "n = int(input())\r\nboard = [list(input()) for _ in range(n)]\r\n\r\ndef is_valid(r, c):\r\n return 0 <= r < n and 0 <= c < n\r\n\r\ndx = [1, -1, 0, 0]\r\ndy = [0, 0, 1, -1]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n o_count = 0\r\n for k in range(4):\r\n x, y = i + dx[k], j + dy[k]\r\n if is_valid(x, y) and board[x][y] == 'o':\r\n o_count += 1\r\n \r\n if o_count % 2 != 0:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "def get_result(board):\n for row_num in range(n):\n for col_num in range(n):\n if not check(board, row_num, col_num):\n return 'NO'\n return 'YES'\n\n\ndef check(board, row_num, col_num):\n count = 0\n if row_num > 0 and board[row_num - 1][col_num] == 'o':\n count += 1\n if row_num < len(board) - 1 and board[row_num + 1][col_num] == 'o':\n count += 1\n if col_num > 0 and board[row_num][col_num - 1] == 'o':\n count += 1\n if col_num < len(board) - 1 and board[row_num][col_num + 1] == 'o':\n count += 1\n return count % 2 == 0\n\n\nn = int(input())\nboard = [input() for _ in range(n)]\nprint(get_result(board))\n", "n=int(input())\r\nx=\"\"\r\nfor _ in range(n):\r\n x+=input()\r\nprint(\"YES\" if x==x[::-1] else \"NO\")", "n = int(input())\nk = \"\"\nfor i in range(n):\n\tk += input()\nif list(k)==list(reversed(k)):\n\tprint(\"YES\")\n\nelse:\n\tprint(\"NO\")\n", "def valid(i,j):\n if i>=0 and j>=0 and i<n and j<n and s[i][j]=='o':\n return 1\n return 0\nn = int(input())\ns = []\ndx = [-1,1,0,0]\ndy = [0,0,1,-1]\nfor i in range(n):\n a = input()\n s.append(a)\nf = 0\nfor i in range(n):\n for j in range(n):\n t = 0\n for k in range(4):\n t+=valid(i+dx[k],j+dy[k])\n if t%2==1:\n f = 1\n break\n if f==1:\n break\nif f==1:\n print(\"NO\")\nelse:\n print(\"YES\")", "n = int(input())\r\nb = [[1 if c=='o' else 0 for c in input()]+[0] for _ in range(n)]+[[0]*(n+1)]\r\nr = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n r |= b[i-1][j]+b[i+1][j]+b[i][j-1]+b[i][j+1]\r\nprint(\"NO\" if r%2 else \"YES\")", "# Description of the problem can be found at http://codeforces.com/problemset/problem/462/A\r\n\r\nn = int(input())\r\nl_r = list(input() for _ in range(n))\r\n\r\ndx = [0, -1, 1, 0]\r\ndy = [-1, 0, 0, 1]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n t = 0\r\n for k in range(4):\r\n if i + dx[k] >= 0 and i + dx[k] < n:\r\n if j + dy[k] >= 0 and j + dy[k] < n: \r\n if l_r[i + dx[k]][j + dy[k]] == 'o':\r\n t += 1\r\n if t % 2 != 0:\r\n print(\"NO\")\r\n quit()\r\nprint(\"YES\")", "n = int(input())\nb = [input() for i in range(n)]\nf = True\nfor i in range(n):\n for j in range(n):\n c = 0\n if i - 1 > -1 and b[i-1][j] == 'o':\n c += 1\n if i + 1 < n and b[i+1][j] == 'o':\n c += 1\n if j - 1 > -1 and b[i][j-1] == 'o':\n c += 1\n if j + 1 < n and b[i][j+1] == 'o':\n c += 1\n if c % 2:\n f = False\n break\n if not f:\n break\n\nprint('YES' if f else 'NO')\n", "# Contest: 20 - 2100 <= Codeforces Rating <= 2199 (https://a2oj.com/ladder?ID=20)\n# Problem: (5) Appleman and Easy Task (Difficulty: 2) (http://codeforces.com/problemset/problem/462/A)\n\ndef rint():\n return int(input())\n\n\ndef rints():\n return list(map(int, input().split()))\n\n\nn = rint()\nb = [input() for _ in range(n)]\na = True\nfor y in range(n):\n for x in range(n):\n c = 0\n c += int(x > 0 and b[y][x-1] == 'o')\n c += int(x < n - 1 and b[y][x+1] == 'o')\n c += int(y > 0 and b[y-1][x] == 'o')\n c += int(y < n - 1 and b[y+1][x] == 'o')\n a = a and c % 2 == 0\nprint('YES' if a else 'NO')\n", "n=int(input())\r\n\r\nanswer=\"YES\"\r\nx=[0]*(n+2)\r\nfor i in range(n):\r\n x[i+1]=\"q\"+input()+\"q\"\r\nx[0]=\"q\"*(n+2)\r\nx[n+1]=\"q\"*(n+2)\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n counter=0\r\n if x[i][j+1]=='o':counter+=1\r\n if x[i][j-1]=='o':counter+=1\r\n if x[i+1][j]=='o':counter+=1\r\n if x[i-1][j]=='o':counter+=1\r\n if counter%2==0:continue\r\n else:\r\n answer=\"NO\"\r\n break\r\n if answer=='NO':break\r\n\r\nprint(answer)", "def nbrs (a,i,j):\r\n ctr = 0\r\n if a[i-1][j]=='o':\r\n ctr+=1\r\n if a[i+1][j]=='o':\r\n ctr+=1\r\n if a[i][j-1]=='o':\r\n ctr+=1\r\n if a[i][j+1]=='o':\r\n ctr+=1\r\n return ctr\r\nflag = True\r\nn = int (input())\r\na = [0]*(n+2)\r\na[0] = 'x'*(n+2)\r\na[n+1] = 'x'*(n+2)\r\nfor i in range(1, n+1):\r\n a[i] = 'x' + input().split()[0] + 'x'\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if nbrs (a,i,j) %2 ==1:\r\n flag = False\r\nif flag:\r\n print ('YES')\r\nelse:\r\n print ('NO')", "def positive_answer(A, n):\r\n for i in range(n):\r\n for j in range(n):\r\n if sum(0 <= x < n and 0 <=y < n and A[x][y] == 'o'\r\n for x, y in ((i - 1, j), (i, j - 1),\r\n (i, j + 1), (i + 1, j))) % 2:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\n\r\nprint('YES' if positive_answer([input() for _ in range(n)], n) else 'NO')", "n=int(input())\r\nm=[]\r\neven=True\r\nfor i in range(n):\r\n a=[]\r\n for j in input():\r\n a.append(j)\r\n m.append(a)\r\nfor i in range(n):\r\n count=0\r\n for j in range(n):\r\n if i-1>=0 and m[i-1][j]=='o':\r\n count+=1\r\n if i+1<n and m[i+1][j]=='o':\r\n count+=1\r\n if j-1>=0 and m[i][j-1]=='o':\r\n count+=1\r\n if j+1<n and m[i][j+1]=='o':\r\n count+=1\r\n if count%2==1:\r\n even=False\r\nif even:print(\"YES\")\r\nelse:print(\"NO\")", "import sys\r\ncheck = \"YES\"\r\nmatrix = []\r\nn = int(input())\r\nfor i in range(n):\r\n matrix.append(input())\r\ni = 0\r\nif (n == 1):\r\n print(\"YES\")\r\n sys.exit()\r\nwhile i < n:\r\n j = 0\r\n while j < n:\r\n \r\n counter = 0\r\n\r\n if (i - 1 >= 0 and matrix[i - 1][j] == 'o'):\r\n counter += 1\r\n\r\n if (i + 1 < n and matrix[i + 1][j] == 'o'):\r\n counter += 1\r\n\r\n if (j - 1 >= 0 and matrix[i][j - 1] == 'o'):\r\n counter += 1\r\n\r\n if (j + 1 < n and matrix[i][j + 1] == 'o'):\r\n counter += 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 # if (x - 1) < 0:\r\n # north = n - 1\r\n # else:\r\n # north = x - 1\r\n \r\n # if (y - 1) < 0:\r\n # west = n - 1\r\n # else:\r\n # west = y - 1\r\n \r\n # if (x + 1) > (n - 1):\r\n # south = 0\r\n # else:\r\n # south = x + 1\r\n \r\n # if (y + 1) > (n - 1):\r\n # east = 0\r\n # else:\r\n # east = y + 1\r\n # if (north == south) or (west == east):\r\n # if (matrix[north][y] == \"o\"):\r\n # counter += 1\r\n # if (matrix[x][east] == \"o\"):\r\n # counter += 1\r\n # else:\r\n # if (matrix[north][y] == \"o\"):\r\n # counter += 1\r\n \r\n # if (matrix[south][y] == \"o\"):\r\n # counter += 1\r\n \r\n # if (matrix[x][east] == \"o\"):\r\n # counter += 1\r\n \r\n # if (matrix[x][west] == \"o\"):\r\n # counter += 1\r\n \r\n if (counter % 2) != 0:\r\n check = \"NO\"\r\n print(check)\r\n sys.exit()\r\n \r\n \r\n \r\n j += 1\r\n \r\n \r\n i+= 1\r\n\r\nprint(check)", "n = int(input())\r\nboard = [[0] * (n + 2)]\r\nfor i in range(n):\r\n board += [[0] + [0 if x == 'x' else 1 for x in input()] + [0]]\r\nboard += [[0] * (n + 2)]\r\nyn = True\r\nfor i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n yn = yn and (board[i - 1][j] + board[i + 1][j] + board[i][j - 1] + board[i][j + 1]) % 2 == 0\r\nprint(\"YES\" if yn else \"NO\")", "m = []\r\na = int(input())\r\nfor y in range(a):\r\n s_raw = input()\r\n r = []\r\n for x in range(a):\r\n if s_raw[x] == 'x':\r\n r += ['x']\r\n elif s_raw[x] == 'o':\r\n r += ['o']\r\n m += [r]\r\nm_new = []\r\nm_new += [['x']*(a+2)]\r\nfor y in range(a):\r\n r_new = ['x']+m[y]+['x']\r\n m_new += [r_new]\r\nm_new += [['x']*(a+2)]\r\nfor y in range(1, a+1):\r\n for x in range(1, a+1):\r\n c = 0\r\n if m_new[x][y+1] == 'o':\r\n c += 1\r\n if m_new[x][y-1] == 'o':\r\n c += 1\r\n if m_new[x+1][y] == 'o':\r\n c += 1\r\n if m_new[x-1][y] == 'o':\r\n c += 1\r\n if c % 2 != 0:\r\n print('NO')\r\n quit()\r\nprint('YES')\r\n", "n=int(input())\r\nlist1=[]\r\nfor i in range(n):\r\n ll=list(input())\r\n list1.append(ll) \r\n \r\nlist2=[]\r\nfor i in range(n):\r\n ll=[0]*n\r\n list2.append(ll) \r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i>0):\r\n if(list1[i-1][j]==\"o\"):\r\n list2[i][j]+=1\r\n if(j>0):\r\n if(list1[i][j-1]==\"o\"):\r\n list2[i][j]+=1\r\n if(i<n-1):\r\n if(list1[i+1][j]==\"o\"):\r\n list2[i][j]+=1\r\n if(j<n-1):\r\n if(list1[i][j+1]==\"o\"):\r\n list2[i][j]+=1\r\n \r\nf=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(list2[i][j]%2!=0):\r\n f=1\r\n break\r\nif(f==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = 0\r\nc1 = 0\r\na = [ [0] * (n) for i in range(n) ]\r\nfor i in range(n):\r\n tmp = input()\r\n for j in range(len(tmp)):\r\n a[i][j] = tmp[j]\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n s = 0\r\n if (i - 1 >= 0):\r\n if (a[i-1][j] == 'o'):\r\n s = s + 1\r\n if (j - 1 >= 0):\r\n if (a[i][j-1] == 'o'):\r\n s = s + 1\r\n if (i + 1 < len(a)):\r\n if (a[i+1][j] == 'o'):\r\n s = s + 1\r\n if (j + 1 < n):\r\n if (a[i][j+1] == 'o'):\r\n s = s + 1\r\n if (s % 2 != 0):\r\n c1 = -1\r\n break\r\n if (c1 == -1):\r\n break\r\nif (c1 == 0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\n\r\nf = []\r\n\r\ndx = [0, 0, 1, -1]\r\ndy = [1, -1, 0, 0]\r\n\r\ndef ok(x ,y):\r\n return 0 <= x < n and 0 <= y < n\r\n\r\nfor i in range(n):\r\n f.append(input())\r\n\r\nans = True\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n cur = 0\r\n for d in range(4):\r\n nx = dx[d] + i\r\n ny = dy[d] + j\r\n if ok(nx,ny) and f[nx][ny] == 'o':\r\n cur += 1\r\n if cur % 2 != 0:\r\n ans = False\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "f=True\r\nboard=[]\r\nn=int(input())\r\nfor i in range(n):\r\n arr=input()\r\n board.append(arr)\r\n k=0\r\n \r\nfor i in range(n):\r\n c = 0\r\n for j in range(len(board)):\r\n if (i - 1 >= 0 and board[i - 1][j] == 'o'):\r\n c+=1\r\n if (i + 1 < n and board[i + 1][j] == 'o'):\r\n c+=1\r\n if(j - 1 >= 0 and board[i][j - 1] == 'o'):\r\n c+=1\r\n if(j + 1 < n and board[i][j + 1] == 'o'):\r\n c+=1\r\n if (c%2==1):\r\n f=False\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')", "def valid_index(x,y):\r\n return x>=0 and y>=0 and x<n and y<n\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n s = str(input())\r\n arr.append(s)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n if(valid_index(i-1,j) and arr[i-1][j] == 'o'):\r\n cnt += 1\r\n if(valid_index(i+1,j) and arr[i+1][j] == 'o'):\r\n cnt += 1\r\n if(valid_index(i,j-1) and arr[i][j-1] == 'o'):\r\n cnt += 1\r\n if(valid_index(i,j+1) and arr[i][j+1] == 'o'):\r\n cnt += 1\r\n \r\n if(cnt in [1,3]):\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "'''Author: Abdurasul !!!'''\r\nn=int(input());a,s,k=[],'',''\r\nfor i in range(n):f=input();a.append(f)\r\nfor i in a:s=s+i\r\nfor i in range(len(s)-1,-1,-1):k=k+s[i]\r\nif s==k:print('YES')\r\nelse:print('NO')\r\n", "# import sys\r\n# import math\r\n# import collections\r\n\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\nn=int(input())\r\ns=\"\"\r\nfor i in range(n):\r\n s+=input()\r\nif list(s)==list(reversed(s)):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n=int(input())\r\nm=''\r\nfor i in range(n):\r\n s=input()\r\n m=m+s\r\nif(m==m[::-1]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def is_odd(matrix, i, j):\n num = 0\n if i > 0:\n num += matrix[i - 1][j] == 'o'\n if i < len(matrix) - 1:\n num += matrix[i + 1][j] == 'o'\n if j > 0:\n num += matrix[i][j - 1] == 'o'\n if j < len(matrix) - 1:\n num += matrix[i][j + 1] == 'o'\n return num % 2\n\nnum = int(input())\nmatrix = [input() for _ in range(num)]\n\ndef foo(num, matrix):\n for i in range(num):\n for j in range(num):\n if is_odd(matrix, i, j):\n print('NO')\n return\n print('YES')\n\nfoo(num, matrix)", "n, l, flag, o = int(input()), [], True, 0\r\nfor i in range(n):\r\n l.append('0')\r\n l[i] = str(input())\r\nfor i in range(n):\r\n for el in range(n):\r\n if el - 1 >= 0:\r\n if l[i][el - 1] == 'o':\r\n o += 1\r\n if el + 1 < n:\r\n if l[i][el + 1] == 'o':\r\n o += 1\r\n if i - 1 >= 0:\r\n if l[i - 1][el] == 'o':\r\n o += 1\r\n if i + 1 < n:\r\n if l[i + 1][el] == 'o':\r\n o += 1\r\n flag &= (o % 2 == 0)\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\ne=''\r\nfor i in range(n):\r\n s=str(input())\r\n e=e+s\r\nif(e==e[::-1]):\r\n print('YES')\r\nelse:\r\n print('NO')", "fs=\"\"\r\nfor _ in range(int(input())):\r\n\tfs+=input()\r\nif fs==fs[-1::-1]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "n=int(input())\r\na=[]\r\nfor i in range(0,n):\r\n a.append(input())\r\n\r\ns=''\r\n\r\nfor i in range(0,n):\r\n s=s+'t'\r\na.append(s)\r\na.insert(0,s)\r\n\r\nfor i in range(0,len(a)):\r\n a[i]='t'+a[i]+'t'\r\n\r\nflag=0\r\nfor i in range(1,n+1):\r\n c=0\r\n for j in range(1,n+1):\r\n if(a[i][j+1]=='o'):\r\n c+=1\r\n if(a[i][j-1]=='o'):\r\n c+=1\r\n if(a[i+1][j]=='o'):\r\n c+=1\r\n if(a[i-1][j]=='o'):\r\n c+=1\r\n if c%2==0:\r\n flag+=1\r\n\r\nif flag==(n*n):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "s = \"\"\r\nfor i in range(int(input())):\r\n s+=input()\r\nprint(\"YES\" if s == s[::-1] else \"NO\") ", "n = int(input())\r\nboard = [input() for _ in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n count = 0\r\n if i > 0 and board[i-1][j] == 'o':\r\n count += 1\r\n if i < n-1 and board[i+1][j] == 'o':\r\n count += 1\r\n if j > 0 and board[i][j-1] == 'o':\r\n count += 1\r\n if j < n-1 and board[i][j+1] == 'o':\r\n count += 1\r\n if count % 2 == 1:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "def check(grid,n):\r\n for i in range(n):\r\n for j in range(n):\r\n count=0\r\n if i!=n-1:\r\n if grid[i+1][j]=='o':\r\n count+=1\r\n if j!=n-1:\r\n if grid[i][j+1]=='o':\r\n count+=1\r\n if i!=0:\r\n if grid[i-1][j]=='o':\r\n count+=1\r\n if j!=0:\r\n if grid[i][j-1]=='o':\r\n count+=1\r\n if count%2!=0:\r\n return(\"NO\")\r\n return(\"YES\")\r\n \r\n\r\n\r\n\r\n\r\nn=int(input())\r\ngrid=[]\r\nfor i in range(n):\r\n x=input()\r\n m=list(x)\r\n grid.append(m)\r\nprint(check(grid,n))\r\n", "\ndef solve(n,mat):\n\tfor i in range(n) :\n\t\tfor j in range(n) :\n\t\t\tc=0\n\t\t\tif i+1 < n :\n\t\t\t\tif mat[i+1][j] =='o' :\n\t\t\t\t\tc+=1\n\t\t\t\t\t\n\t\t\tif j+1 < n :\n\t\t\t\tif mat[i][j+1] =='o' :\n\t\t\t\t\tc+=1\n\t\t\t\t\t\n\t\t\tif i-1 >=0 :\n\t\t\t\tif mat[i-1][j] =='o' :\n\t\t\t\t\tc+=1\n\t\t\t\t\t\n\t\t\tif j-1 >= 0 :\n\t\t\t\tif mat[i][j-1] =='o' :\n\t\t\t\t\tc+=1\n\t\t\t\t\n\t\t\tif c%2!=0 :\n\t\t\t\treturn 'NO'\n\treturn 'YES'\n\n\n\n\nfrom sys import stdin\ninput = stdin.readline\nn=int(input())\nmat=[]\nfor i in range(n):\n\tl2=input()\n\tmat.append(l2)\nprint(solve(n,mat))\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\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 s = ''\r\n for i in range(int(input())):\r\n s += input()\r\n start = 0\r\n end = len(s)-1\r\n res = True\r\n while start < end:\r\n if s[start] != s[end]:\r\n res = False\r\n print(\"NO\")\r\n break \r\n start += 1\r\n end -= 1\r\n if res:\r\n print(\"YES\")\r\n \r\n\r\n# for printing format\r\n# print(\"Case #{}: {}\".format(t+1, ans))\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nboard = [input() for _ in range(n)]\r\n\r\n# Function to count the number of adjacent 'o' cells for a given cell (i, j)\r\ndef count_adjacent_o(i, j):\r\n count = 0\r\n if i > 0 and board[i - 1][j] == 'o':\r\n count += 1\r\n if i < n - 1 and board[i + 1][j] == 'o':\r\n count += 1\r\n if j > 0 and board[i][j - 1] == 'o':\r\n count += 1\r\n if j < n - 1 and board[i][j + 1] == 'o':\r\n count += 1\r\n return count\r\n\r\n# Check if every cell has an even number of adjacent 'o' cells\r\nfor i in range(n):\r\n for j in range(n):\r\n if count_adjacent_o(i, j) % 2 != 0:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "from collections import defaultdict\r\nfrom operator import inv\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inps():\r\n return(input())\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn = inp()\r\ngrid = []\r\nfor i in range(n):\r\n row = insr()\r\n grid.append(row)\r\n\r\ndirections = [(0,1), (0,-1), (1,0), (-1,0)]\r\ndef getZeroes(i, j):\r\n count = 0\r\n for d in directions:\r\n newI = i + d[0]\r\n newJ = j + d[1]\r\n if newI >=0 and newI < n and newJ >= 0 and newJ < n and grid[newI][newJ] == \"o\":\r\n count += 1\r\n return count\r\n\r\nflag = True\r\nfor i in range(n):\r\n if flag:\r\n for j in range(n):\r\n count = getZeroes(i, j)\r\n if count % 2 != 0:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\ndata = [[0] * (n+2)]\r\nfor _ in range(n):\r\n data.append([0]+list(input())+[0])\r\ndata.append([0]*(n+2))\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n cnt = 0\r\n if data[i][j-1]=='o':\r\n cnt += 1\r\n if data[i][j+1]=='o':\r\n cnt += 1\r\n if data[i-1][j]=='o':\r\n cnt +=1\r\n if data[i+1][j]=='o':\r\n cnt += 1\r\n if cnt%2!=0:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "def f(arr, i, j, n):\n evens = 0\n\n if j+1 < n:\n if arr[i][j+1] == 'o':\n evens += 1\n if j-1 > -1:\n if arr[i][j-1] == 'o':\n evens += 1\n if i+1 < n:\n if arr[i+1][j] == 'o':\n evens += 1\n if i-1 > -1:\n if arr[i-1][j] == 'o':\n evens += 1\n\n if evens % 2 == 0:\n return True\n return False\n\n\nn = int(input())\n\narr = []\n\nfor i in range(n):\n arr.append(list(input()))\nans = 'YES'\nfor i in range(n):\n for j in range(n):\n if f(arr, i, j, n) == False:\n ans = 'NO'\n break\n if ans == \"NO\":\n break\n\nprint(ans)\n", "def solve():\r\n n = int(input())\r\n grid = [input() for row in range(n)]\r\n\r\n def adjacents(i, j):\r\n c = []\r\n if i > 0:\r\n c.append(grid[i - 1][j])\r\n if i < n - 1:\r\n c.append(grid[i + 1][j])\r\n if j > 0:\r\n c.append(grid[i][j - 1])\r\n if j < n - 1:\r\n c.append(grid[i][j + 1])\r\n return c.count(\"o\")\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if adjacents(i, j) % 2 == 1:\r\n return \"NO\"\r\n\r\n return \"YES\"\r\n\r\nprint(solve())", "n = int(input())\r\nboard =[]\r\nfor line in range(0,n) :\r\n board.append(input())\r\n\r\nyn = True;\r\nfor i in range(0,n) :\r\n for j in range(0,n) :\r\n count = 0\r\n if i - 1 >= 0 :\r\n if board[i - 1][j] == 'o' :\r\n count = count + 1\r\n if i + 1 < n :\r\n if board[i + 1][j] == 'o' :\r\n count = count + 1\r\n if j - 1 >= 0 :\r\n if board[i][j - 1] == 'o' :\r\n count = count + 1\r\n if j + 1 < n :\r\n if board[i][j + 1] == 'o' :\r\n count = count + 1\r\n if count % 2 != 0 :\r\n yn = False;\r\nif yn :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n s = input()\r\n a.append(s)\r\ncnt = 0\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n # a[i][j]\r\n # a[i][j + 1], a[i][j - 1], a[i + 1][j], a[i -1][j]\r\n if j + 1 < n and a[i][j + 1] == 'o':\r\n cnt += 1\r\n if j - 1 >= 0 and a[i][j - 1] == 'o':\r\n cnt += 1\r\n if i + 1 < n and a[i + 1][j] == 'o':\r\n cnt += 1\r\n if i - 1 >= 0 and a[i - 1][j] == 'o':\r\n cnt += 1\r\n if cnt % 2 != 0:\r\n flag = False\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nn = int(input())\r\na = []\r\nfor el in range(n):\r\n r = list(input())\r\n a.append(r)\r\ncount = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n c = 0\r\n if(i > 0):\r\n if(a[i-1][j] == 'o'):\r\n c += 1\r\n if(i < n - 1):\r\n if(a[i+1][j] == 'o'):\r\n c += 1\r\n if(j > 0):\r\n if(a[i][j-1] == 'o'):\r\n c += 1\r\n if(j < n-1):\r\n if(a[i][j+1] == 'o'):\r\n c += 1\r\n if(c % 2 == 1):\r\n count += 1\r\n break\r\n\r\nif(count == 0):\r\n print('YES')\r\nelse:\r\n print('NO')", "n = int(input())\r\n\r\nmat = [ input() for _ in range(n) ]\r\n\r\nstatus = True\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n count = 0\r\n if i>=1 and mat[i-1][j] == 'o':\r\n count+=1 \r\n if j>=1 and mat[i][j-1] == 'o':\r\n count+=1 \r\n if i<=n-2 and mat[i+1][j] == 'o':\r\n count+=1 \r\n if j<=n-2 and mat[i][j+1] =='o': \r\n count+=1 \r\n if count%2!=0:\r\n status = False\r\n break\r\n \r\nif status:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Apr 11 18:54:10 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n\r\n#https://codeforces.com/problemset/problem/462/A --- Alexis Galvan\r\n\r\n\r\ndef check(i, j, matrix):\r\n counter = 0\r\n for new_position in [(0, 1),(0, -1),(-1, 0),(1, 0)]:\r\n \r\n node_position = (i+new_position[0], j+new_position[1])\r\n \r\n if node_position[0] < 0 or node_position[0] > len(matrix)-1 or node_position[1] < 0 or node_position[1] > len(matrix[node_position[0]])-1:\r\n continue\r\n \r\n if matrix[node_position[0]][node_position[1]] == 'o':\r\n counter += 1\r\n\r\n return counter\r\n \r\n\r\ndef apple_man():\r\n \r\n size_matrix = int(input())\r\n matrix = []\r\n \r\n for i in range(size_matrix):\r\n matrix.append(input())\r\n \r\n for i in range(len(matrix)):\r\n for j in range(len(matrix[i])):\r\n temp = check(i, j, matrix)\r\n if temp % 2 != 0:\r\n return 'NO'\r\n return 'YES'\r\n\r\nA = apple_man()\r\nprint(A)", "def f(x): return 1 if x == 'x' else 0\r\nn = int(input())\r\nt = [list(map(f, input())) + [1] for i in range(n)] + [[1] * (n + 1)]\r\nfor i in range(n):\r\n for j in range(n):\r\n if t[i - 1][j] + t[i + 1][j] + t[i][j + 1] + t[i][j - 1] & 1:\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "x = ''\r\nfor _ in range(int(input())):\r\n x+=input()\r\nif list(x) == list(reversed(x)):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\ncheckerboard = []\r\n\r\nfor _ in range(n):\r\n checkerboard.append(input())\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n n_adjacent = 0\r\n if i - 1 > -1 and checkerboard[i - 1][j] == 'o':\r\n n_adjacent += 1\r\n if i + 1 < n and checkerboard[i + 1][j] == 'o':\r\n n_adjacent += 1\r\n if j - 1 > -1 and checkerboard[i][j - 1] == 'o':\r\n n_adjacent += 1\r\n if j + 1 < n and checkerboard[i][j + 1] == 'o':\r\n n_adjacent += 1\r\n\r\n if n_adjacent & 1:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nprint(\"YES\")\r\n", "def cadj(s, n, x, y):\n\to = 0\n\tif x-1 >= 0 and s[x-1][y] == 'o':\n\t\to += 1\n\tif x+1 < n and s[x+1][y] == 'o':\n\t\to += 1\n\tif y-1 >= 0 and s[x][y-1] == 'o':\n\t\to += 1\n\tif y+1 < n and s[x][y+1] == 'o':\n\t\to += 1\n\treturn o & 1 == 1\n\nn, YN = int(input()), 'YES'\n\ns = [list(input()) for _ in range(n)]\n\nfor i in range(n):\n\tfor j in range(n):\n\t\tif cadj(s, n, i, j):\n\t\t\tYN = 'NO'\n\nprint(YN)\n", "n = int(input())\r\nboard = []\r\nfor i in range(n):\r\n r = input()\r\n board.append(r)\r\n#print(board)\r\ncan = True\r\nfor i in range(n):\r\n row = board[i]\r\n for j in range(n):\r\n ele = row[j]\r\n c = 0\r\n ind_r = [j + 1, j - 1]\r\n ind_c = [i + 1, i - 1]\r\n for k in range(2):\r\n if ind_r[k] >= n or ind_r[k] < 0 :\r\n continue\r\n \r\n else:\r\n #print(row[ind_r[k]])\r\n #print(\"----------\")\r\n if row[ind_r[k]] == 'o':\r\n c += 1\r\n for k in range(2):\r\n if ind_c[k] >= n or ind_c[k] < 0:\r\n continue\r\n \r\n else:\r\n #print(board[ind_c[k]][j])\r\n #print(\"----------\")\r\n if board[ind_c[k]][j] == 'o':\r\n c += 1\r\n #print(c)\r\n if c % 2 != 0:\r\n can = False\r\n break\r\n if can == False:\r\n break\r\nif can == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n \r\n \r\n", "def check():\r\n for i in range(n):\r\n for j in range(n):\r\n c = 0\r\n if j < n - 1 and m[i][j + 1] == 'o': c += 1\r\n if j > 0 and m[i][j - 1] == 'o': c += 1\r\n if i < n - 1 and m[i + 1][j] == 'o': c += 1\r\n if i > 0 and m[i - 1][j] == 'o': c += 1\r\n if c == 1 or c == 3 : return \"NO\"\r\n return \"YES\"\r\n\r\nm = []\r\nn = int(input())\r\nfor i in range(n):\r\n m.append(input())\r\n\r\nprint(check())", "s = ''\r\nn = int(input())\r\nfor _ in range(n) :\r\n\ts += input()\r\nprint(\"YES\") if s == s[::-1] else print(\"NO\")", "def main():\n n = int(input())\n grid = []\n for i in range(n):\n grid.append(list(input()))\n for i in range(n):\n for j in range(n):\n o = 0\n for (k, l) in [(1, 0), (0, 1), (-1, 0), (0, -1)]:\n if i + k >= 0 and i + k < n and j + l >= 0 and j + l < n:\n if grid[i + k][j + l] == 'o':\n o += 1\n if o % 2 != 0:\n return \"NO\"\n return \"YES\"\n\nprint(main())\n \n\n", "# coding: utf-8\ndef check(m,n):\n for i in range(n):\n for j in range(n):\n cnt = 0\n if i+1>=0 and i+1<n and m[i+1][j]=='o':\n cnt += 1\n if i-1>=0 and i-1<n and m[i-1][j]=='o':\n cnt += 1\n if j+1>=0 and j+1<n and m[i][j+1]=='o':\n cnt += 1\n if j-1>=0 and j-1<n and m[i][j-1]=='o':\n cnt += 1\n if cnt%2 == 1:\n return False\n return True\nn = int(input())\nm = []\nfor i in range(n):\n m.append([ch for ch in input()])\nif check(m,n):\n print('YES')\nelse:\n print('NO')\n", "def prepare(n):\n table = [[0] * n for _ in range(n)]\n \n for i in range(n):\n line = input()\n for j in range(n):\n if line[j] == 'o':\n if i - 1 >= 0:\n table[i - 1][j] = (table[i - 1][j] + 1) % 2\n if table[i - 1][j] != 0:\n return 'NO'\n if j - 1 >= 0:\n table[i][j - 1] = (table[i][j - 1] + 1) % 2\n if j + 1 < n:\n table[i][j + 1] = (table[i][j + 1] + 1) % 2\n if i + 1 < n:\n table[i + 1][j] = (table[i + 1][j] + 1) % 2\n for j in range(n):\n if table[n - 1][j] != 0:\n return 'NO'\n return 'YES'\n\n\nif __name__ == '__main__':\n n = int(input())\n \n print(prepare(n))\n\n", "'''input\n4\nxxxo\nxoxo\noxox\nxxxx\n'''\nn = int(input())\nx = sum([list(input()) for _ in range(n)], [])\nt1 = []\nfor i in range(n*n):\n\tt = 0\n\tif i + 1 < n*n and (i+1) % n != 0:\n\t\tif x[i+1] == 'o':\n\t\t\tt += 1\n\tif i + n < n*n:\n\t\tif x[i+n] == 'o':\n\t\t\tt += 1\n\tif i - 1 >= 0 and (i) % n != 0:\n\t\tif x[i-1] == 'o':\n\t\t\tt += 1\n\tif i - n >= 0:\n\t\tif x[i-n] == 'o':\n\t\t\tt += 1\n\tt1.append(t)\n\tif t % 2 == 1:\n\t\tprint(\"NO\")\n\t\tbreak\nelse:\n\tprint(\"YES\")\n\n\n\n\n\n\n\n\n\n\n\n", "s = int(input())\n\nb = []\nfor _ in range(s):\n b.append(input())\n\nmoves = [[1, 0], [-1, 0], [0, 1], [0, -1]]\n\nyes = True\n\nfor i in range(s):\n for j in range(s):\n cell = b[i][j]\n\n c = 0\n\n for move in moves:\n new_ij = [i + move[0], j + move[1]]\n if s > new_ij[0] >= 0 and s > new_ij[1] >= 0:\n new_cell = b[new_ij[0]][new_ij[1]]\n if new_cell == \"o\":\n c += 1\n\n if c % 2 == 1:\n yes = False\n\nprint(\"YES\" if yes else \"NO\")\n", "import sys\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n if i > 0 and a[i - 1][j] == 'o':\r\n cnt^=1\r\n if i + 1 < n and a[i+1][j] == 'o':\r\n cnt ^= 1\r\n if j > 0 and a[i][j-1] == 'o':\r\n cnt^=1\r\n if j + 1 < n and a[i][j + 1] == 'o':\r\n cnt^=1\r\n \r\n if cnt != 0:\r\n print('NO')\r\n sys.exit(0)\r\nprint('YES')\r\n ", "import sys\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n c=0\r\n if(i+1<n and j<n and l[i+1][j]=='o'):c+=1\r\n if(i<n and j+1<n and l[i][j+1]=='o'):c+=1\r\n if(i-1>=0 and j<n and l[i-1][j]=='o'):c+=1\r\n if(i<n and j-1>=0 and l[i][j-1]=='o'):c+=1\r\n if(c%2!=0):\r\n print('NO')\r\n sys.exit()\r\nprint('YES')", "n = int(input())\na = []\n\nfor i in range(n):\n a.append(input())\n\nfor i in range(n):\n for j in range(n):\n count = 0\n if i != 0:\n if a[i-1][j] == 'o':\n count += 1\n if i != n-1:\n if a[i+1][j] == 'o':\n count += 1\n if j != 0:\n if a[i][j-1] == 'o':\n count += 1\n if j != n-1:\n if a[i][j+1] == 'o':\n count += 1\n if count % 2 != 0:\n print(\"NO\")\n break\n else:\n continue\n break\nelse:\n print(\"YES\")\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\nres = 'YES'\r\nfor i in range(n):\r\n for j in range(n):\r\n y = 0\r\n y+= (i!=0 and a[i-1][j]=='o')\r\n y += (i+1 != n and a[i + 1][j] == 'o')\r\n y += (j != 0 and a[i][j-1] == 'o')\r\n y += (j+1 != n and a[i][j+1] == 'o')\r\n if y % 2 == 1:\r\n res = 'NO'\r\n break\r\nprint(res)", "#!/usr/bin/env python\n# encoding: utf-8\n\ndef solve(n):\n mp = []\n for i in range(n):\n mp.append(input())\n for i in range(n):\n for j in range(n):\n count = 0\n if i > 0 and mp[i - 1][j] == 'o':\n count = count + 1\n if j > 0 and mp[i][j - 1] == 'o':\n count = count + 1\n if i + 1 < n and mp[i + 1][j] == 'o':\n count = count + 1\n if j + 1 < n and mp[i][j + 1] == 'o':\n count = count + 1\n if count % 2 > 0:\n return False\n return True\n\n\nn = int(input())\nif solve(n):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n = int(input())\r\ntable = []\r\nfor i in range(n):\r\n row = input()\r\n table.append(row)\r\nres = \"YES\"\r\ncountRes = []\r\n# Count the o's\r\nfor i in range(n):\r\n row = []\r\n for j in range(n):\r\n count = 0\r\n #Up\r\n if i - 1 >= 0:\r\n if table[i-1][j] == 'o':\r\n count += 1\r\n #Down\r\n if i + 1 <= n-1:\r\n if table[i+1][j] == 'o':\r\n count += 1\r\n #Left\r\n if j-1 >= 0:\r\n if table[i][j-1] == 'o':\r\n count += 1\r\n #Right\r\n if j+1 <= n-1:\r\n if table[i][j+1] == 'o':\r\n count += 1\r\n row.append(count)\r\n countRes.append(row)\r\n\r\n# Check if all evens\r\nfor row in countRes:\r\n for x in row:\r\n if x % 2 == 1:\r\n res = \"NO\"\r\n break\r\nprint(res)\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n ", "from sys import stdin\r\n\r\nA = int(stdin.readline())\r\nB=list()\r\n\r\nfor k in range(0,A):\r\n C=stdin.readline()\r\n B.append(C)\r\n\r\nK=0\r\n\r\n\r\nfor i in range(0,A):\r\n for j in range(0,A):\r\n sum=0\r\n #C[i,j]\r\n if i-1>=0:\r\n if B[i-1][j]=='o':\r\n sum+=1\r\n if i+1<=A-1:\r\n if B[i+1][j]=='o':\r\n sum+=1\r\n if j-1>=0:\r\n if B[i][j-1]=='o':\r\n sum+=1\r\n if j+1<=A-1:\r\n if B[i][j+1]=='o':\r\n sum+=1\r\n if sum%2==1:\r\n print('NO')\r\n K=1\r\n break\r\n if K==1:\r\n break\r\n\r\nif K==0:\r\n print('YES')", "from sys import stdin\n\n\ndef main():\n n = int(stdin.readline().strip())\n l = [stdin.readline().strip() for _ in range(n)]\n c = [[False] * n for _ in range(n)]\n for y in range(n - 1):\n for x in range(n):\n c[y][x] ^= l[y + 1][x] == 'o'\n c[y + 1][x] ^= l[y][x] == 'o'\n for x in range(n - 1):\n for y in range(n):\n c[y][x] ^= l[y][x + 1] == 'o'\n c[y][x + 1] ^= l[y][x] == 'o'\n return ('YES', 'NO')[any(map(any, c))]\n\nprint(main())\n", "a=int(input())\r\nb=[]\r\nfor i in range(a):b+=[input()]\r\nd=False\r\nfor i in range(a):\r\n for j in range(a):\r\n c=0\r\n if i>0:c^=(b[i-1][j]=='o')\r\n if i<a-1:c^=(b[i+1][j]=='o')\r\n if j>0:c^=(b[i][j-1]=='o')\r\n if j<a-1:c^=(b[i][j+1]=='o')\r\n if c%2:\r\n d=True\r\n break\r\n if d:break\r\nprint('NO'if d else'YES')\r\n", "import math as m\r\n#from math import comb as nCr\r\nt=input\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=map(int,t().split())\r\n a=list(map(int,t().split()))\r\n'''\r\ns=''\r\nfor i in range(int(t())):\r\n s+=t()\r\nprint('YES' if s==s[::-1] else 'NO')", "n = int(input())\r\ngrid = []\r\nfor i in range(n):\r\n grid.append(list(input()))\r\n\r\nfor x in range(n):\r\n count = 0\r\n for y in range(n):\r\n if x > 0 and grid[x-1][y] == 'o':\r\n count += 1\r\n if x < n-1 and grid[x+1][y] == 'o':\r\n count += 1\r\n if y > 0 and grid[x][y-1] == 'o':\r\n count += 1\r\n if y < n-1 and grid[x][y+1] == 'o':\r\n count += 1\r\n if count % 2 != 0:\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "def valid(i,j,n,grid):\r\n return i>=0 and j>=0 and i<=n-1 and j<=n-1 and grid[i][j]=='o'\r\nn=int(input())\r\n\r\ngrid=[\"\"]*n\r\nfor i in range(n):\r\n grid[i]=str(input())\r\n\r\nflag=True\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n c+=valid(i+1,j,n,grid)\r\n c+=valid(i-1,j,n,grid)\r\n c+=valid(i,j+1,n,grid)\r\n c+=valid(i,j-1,n,grid)\r\n flag&=(c%2==0)\r\n \r\nprint(\"YES\") if flag else print(\"NO\")", "n = int(input())\r\nm = list()\r\nfor i in range(n):\r\n m.append(input())\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n s = 0\r\n if i > 0 and m[i-1][j] == 'o':\r\n s+=1\r\n if i <n-1 and m[i+1][j] == 'o':\r\n s+=1\r\n if j > 0 and m[i][j-1] == 'o':\r\n s+=1\r\n if j <n-1 and m[i][j+1] == 'o':\r\n s+=1\r\n if s%2 != 0 :\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())\r\nb = [input() for _ in range(n)]\r\nans = True\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tans &= sum(1 for di, dj in [(1, 0), (-1, 0), (0, 1), (0, -1)] if 0 <= i + di < n and 0 <= j + dj < n and b[i + di][j + dj] == 'o') % 2 == 0\r\nif (ans == True):\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "def matrix_protect(Matrix, a=0):\r\n Matrix.insert(0, [a]*len(Matrix[0]))\r\n Matrix.append([a]*len(Matrix[0]))\r\n for i in Matrix:\r\n i.insert(0,a)\r\n i.append(a)\r\n\r\nn=int(input())\r\nmatrix=[]\r\nfor i in range(n):\r\n matrix.append([str(x) for x in input()])\r\nmatrix_protect(matrix,'1')\r\nflag=True\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n neighbour=matrix[i-1][j]+matrix[i+1][j]+matrix[i][j-1]+matrix[i][j+1]\r\n num=neighbour.count('o')\r\n if num%2==1:\r\n flag=False\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n = int(input())\r\nmatrix = []\r\nfor i in range(n):\r\n row = list(input())\r\n matrix.append(row)\r\nans = True\r\nfor i in range(n):\r\n for j in range(n):\r\n counter = 0\r\n if i-1 >=0:\r\n if matrix[i-1][j] == 'o': counter += 1\r\n if i+1 < n:\r\n if matrix[i+1][j] == 'o': counter += 1\r\n if j-1 >= 0:\r\n if matrix[i][j-1] == 'o': counter += 1\r\n if j+1 < n:\r\n if matrix[i][j+1] == 'o': counter += 1\r\n\r\n if counter % 2 == 1:\r\n ans = False\r\n break\r\n\r\nif ans:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "q = int(input())\r\n\r\nfrom collections import defaultdict\r\n\r\nd = defaultdict(lambda: 'x')\r\n\r\nfor i in range(q):\r\n for j, value in enumerate(input()):\r\n d[i, j] = value\r\n\r\ndef help_yablov():\r\n for i in range(q):\r\n for j in range(q):\r\n neigbours = [d[i, j-1], d[i, j+1], d[i-1, j], d[i+1, j]]\r\n if neigbours.count('o') % 2 == 1:\r\n print('NO')\r\n return\r\n print('YES')\r\n\r\n\r\nhelp_yablov()", "n = int(input())\r\narr = []\r\nfor z in range(n):\r\n arr.append(input())\r\nfor i in range(n):\r\n for j in range(n):\r\n c=0\r\n if i - 1 in range(0, n):\r\n if arr[i - 1][j] == \"o\":\r\n c = c + 1\r\n if i + 1 in range(0, n):\r\n if arr[i + 1][j] == \"o\":\r\n c = c + 1\r\n if j - 1 in range(0, n):\r\n if arr[i][j - 1] == \"o\":\r\n c = c + 1\r\n if j + 1 in range(0, n):\r\n if arr[i][j + 1] == \"o\":\r\n c = c + 1\r\n if c % 2 != 0:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n", "def simple_task(lst):\r\n for i in range(len(lst)):\r\n count = 0\r\n for j in range(len(lst)):\r\n if j > 0 and lst[i][j - 1] == 'o':\r\n count += 1\r\n if j < len(lst) - 1 and lst[i][j + 1] == 'o':\r\n count += 1\r\n if i > 0 and lst[i - 1][j] == 'o':\r\n count += 1\r\n if i < len(lst) - 1 and lst[i + 1][j] == 'o':\r\n count += 1\r\n if count & 1:\r\n return \"NO\"\r\n count = 0\r\n return \"YES\"\r\n\r\n\r\nn = int(input())\r\nz = list()\r\nfor i in range(n):\r\n s = input()\r\n z.append(list(s))\r\nprint(simple_task(z))\r\n", "rows = int(input());\r\n\r\nmatrix = [];\r\n\r\nfor i in range(0, rows):\r\n matrix.append(str(input()));\r\n \r\nmatrix2 = []\r\n\r\nfor i in range(0, len(matrix)):\r\n matrix2.append([]);\r\n for c in matrix[i]:\r\n matrix2[i].append(0);\r\n \r\n\r\nfor i in range(0, len(matrix)):\r\n for j in range(0, len(matrix[i])):\r\n if(matrix[i][j]=='o'):\r\n if(i > 0):\r\n matrix2[i-1][j]+=1;\r\n if(i < len(matrix)-1):\r\n matrix2[i+1][j]+=1;\r\n \r\n if(j > 0):\r\n matrix2[i][j-1]+=1; \r\n \r\n if(j < len(matrix[i])-1):\r\n matrix2[i][j+1]+=1;\r\n \r\noutString = \"YES\";\r\n\r\nfor a in matrix2:\r\n for b in a:\r\n if(b%2==1):\r\n outString = \"NO\";\r\n \r\nprint(outString);", "q=\"\";exec(\"q+=input();\"*int(input()));print(\"YES\"if q==q[::-1]else\"NO\")", "def func():\r\n n = int(input())\r\n \r\n board= []\r\n for row in range(0, n):\r\n board.append([x for x in input()])\r\n \r\n # print(board)\r\n cont = 0\r\n for row in range(0, n):\r\n for col in range(0, n):\r\n cont = 0\r\n \r\n # col +- 1\r\n if col + 1 < n and board[row][col + 1] == 'o':\r\n cont += 1\r\n \r\n if col - 1 >= 0 and board[row][col - 1] == 'o':\r\n cont += 1\r\n # print('as2')\r\n \r\n #row +- 1\r\n if row + 1 < n and board[row + 1][col] == 'o':\r\n cont += 1\r\n # print('as3')\r\n if row - 1 >= 0 and board[row - 1][col] == 'o':\r\n cont += 1\r\n # print('as4')\r\n \r\n # print(cont, row, col,)\r\n if cont%2 != 0:\r\n return 'NO'\r\n \r\n return 'YES'\r\n \r\n \r\nprint(func())", "#!/usr/bin/python3\n# -*- coding: <utf-8> -*-\n\nimport itertools as ittls\nfrom collections import Counter\n\nimport string\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func = int):\n return map(func, input().split())\n\n# -------------------------------\n# -------------------------------\n\nN = int(input())\nA = [ [0]*(N + 2) for _ in range(N + 2) ]\n\nfor i in range(1, N + 1):\n s = input()\n for j,v in enumerate(s):\n A[i][j + 1] = int(v == 'o')\n\nfor i in range(1, N + 1):\n for j in range(1, N + 1):\n s = A[i - 1][j - 0] + A[i + 1][j + 0] + A[i - 0][j - 1] + A[i + 0][j + 1]\n if s&1:\n print('NO')\n quit()\n\nprint('YES')\n", "n=int(input())\r\nM=[input() for i in range(n)]\r\nc=0\r\nfor i in range(n) :\r\n for j in range(n) :\r\n k=0\r\n if i>0 :\r\n if M[i-1][j]=='o' :\r\n k=k+1\r\n if i<n-1 :\r\n if M[i+1][j]=='o' :\r\n k=k+1\r\n if j>0 :\r\n if M[i][j-1]=='o' :\r\n k=k+1\r\n if j<n-1 :\r\n if M[i][j+1]=='o' :\r\n k=k+1\r\n if k!=0 and k%2!=0 :\r\n c=1\r\n break\r\n break\r\nif c==0 :\r\n print('YES')\r\nelse :\r\n print('NO')\r\n", "def arr_inp(n):\r\n return [input() for x in range(n)]\r\n\r\n\r\ndef get_col(arr, i):\r\n return ''.join([row[i] for row in arr])\r\n\r\n\r\nn = int(input())\r\ns = arr_inp(n)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n sum = 0\r\n if(i<n-1 and s[i+1][j]=='o'):\r\n sum+=1\r\n if(i>0 and s[i-1][j]=='o'):\r\n sum+=1\r\n if(j>0 and s[i][j-1]=='o'):\r\n sum+=1\r\n if(j<n-1 and s[i][j+1]=='o'):\r\n sum+=1\r\n if (sum % 2 != 0):\r\n exit(print('NO'))\r\n\r\nprint('YES')", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l1=input()\r\n l.append(l1)\r\nflag=0\r\nfor i in range(n):\r\n for j in range(n):\r\n s=0\r\n if(i!=0):\r\n if(l[i-1][j]=='o'):\r\n s+=1\r\n if(j!=0):\r\n if(l[i][j-1]=='o'):\r\n s+=1\r\n if(i!=n-1):\r\n if(l[i+1][j]=='o'):\r\n s+=1\r\n if(j!=n-1):\r\n if(l[i][j+1]=='o'):\r\n s+=1\r\n if(s%2!=0):\r\n flag=1\r\n break\r\nif(flag):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "n=int(input())\ns = ''\nfor i in range(n):\n a = input()\n s+=a\nif s == s[::-1]:\n print('YES')\nelse:\n print(\"NO\")\n", "import fileinput as f\n\ncontent = []\n\nfor line in f.input():\n if f.lineno() == 1:\n [n] = list(map(int, line.split()));\n else:\n content.append(line.strip());\n\nmat = [[0 for i in range(n)] for i in range(n)];\nfor j in range(n):\n for i in range(n):\n piece = content[j][i]\n if piece == 'o':\n if j > 0:\n mat[i][j-1] += 1\n if i > 0:\n mat[i-1][j] += 1\n if j < n-1:\n mat[i][j+1] += 1\n if i < n-1:\n mat[i+1][j] += 1\n\nhas_even = True\nfor ll in mat:\n for item in ll:\n if int(item) % 2 == 1:\n has_even = False\n break\n\nprint(\"YES\") if has_even else print(\"NO\")\n", "p=int(input())\nM=[]\nfor i in range(p):\n s=input()\n a=[]\n for j in range(p):\n a.append(s[j])\n M.append(a)\nsol=1\nfor i in range(p):\n for j in range(p):\n n=i-1\n s=i+1\n e=j+1\n w=j-1\n N=0\n if n>=0 and n<p:\n if M[n][j]==\"o\":\n N+=1\n if s>=0 and s<p:\n if M[s][j]==\"o\":\n N+=1\n if w>=0 and w<p:\n if M[i][w]==\"o\":\n N+=1\n if e>=0 and e<p:\n \n if M[i][e]==\"o\":\n N+=1\n if N%2==1:\n sol=0\nif sol==0:\n print(\"NO\")\nif sol==1:\n print(\"YES\")\n\n\t\t\t \t\t \t \t \t\t \t\t\t \t\t \t\t \t \t", "a=int(input())\r\np=[]\r\nt1=[]\r\np.append('x'*(a+2))\r\nfor i in range(a):\r\n n='x'\r\n n+=input()\r\n p.append(n+'x')\r\np.append('x'*(a+2))\r\nf='YES'\r\nh=0\r\nfor i in range(1,a+1):\r\n for j in range(1,a+1):\r\n t=0\r\n if p[i][j-1]=='o':\r\n t+=1\r\n if p[i][j+1]=='o':\r\n t+=1\r\n if p[i+1][j]=='o':\r\n t+=1\r\n if p[i-1][j]=='o':\r\n t+=1\r\n if t%2!=0:\r\n f='NO'\r\n h=1\r\n break\r\n if h==1:\r\n break\r\nprint(f)\r\n", "def check(i, j, n):\r\n arr = []\r\n if (i - 1 >= 0):\r\n arr.append(i - 1)\r\n arr.append(j)\r\n \r\n if (j - 1 >= 0):\r\n arr.append(i)\r\n arr.append(j - 1)\r\n\r\n if (i + 1 < n):\r\n arr.append(i + 1)\r\n arr.append(j)\r\n \r\n if (j + 1 < n):\r\n arr.append(i)\r\n arr.append(j + 1)\r\n \r\n return arr\r\n\r\n\r\nn = int(input())\r\narr = []\r\nfor _ in range(n): arr.append(input())\r\nfor i in range(n):\r\n for j in range(n):\r\n count, tmp = 0, check(i, j, n)\r\n for k in range(0, len(tmp), 2):\r\n if (arr[tmp[k]][tmp[k + 1]] == 'o'): count = count + 1\r\n if (count % 2) == 1:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n\r\n", "num=int(input())\r\nlst=['0'*(num+2)]\r\nno_flag=False\r\nfor i in range(num):\r\n string=input()\r\n lst.append('0'+string+'0')\r\ncount=0\r\nlst.append('0'*(num+2))\r\n\r\nfor i in range(1,len(lst)-1):\r\n for j in range(1,len(lst)-1):\r\n if(lst[i-1][j]=='o'):\r\n count+=1\r\n if(lst[i+1][j]=='o'):\r\n count+=1\r\n if(lst[i][j-1]=='o'):\r\n count+=1\r\n if(lst[i][j+1]=='o'):\r\n count+=1\r\n\r\n if(count%2!=0):\r\n no_flag=True\r\n break\r\n count=0\r\n if(no_flag):\r\n break\r\nif(no_flag):\r\n print('NO')\r\nelse:\r\n print('YES')", "n=int(input())\r\nc=\"\"\r\nfor i in range(n):\r\n a=input()\r\n c+=a\r\nd=c[::-1]\r\nif c==d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nres = str()\r\nfor i in range(n):\r\n res+=str(input())\r\nif res == res[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isValid(i,j,n):\r\n return i<n and i>=0 and j<n and j>=0\r\n\r\ndef even_o(b, n):\r\n moves = [[-1,0], [0,-1], [1,0], [0,1]]\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n num = 0\r\n for move in moves:\r\n new_i = i+move[0]\r\n new_j = j+move[1]\r\n\r\n if isValid(new_i,new_j,n) and b[new_i][new_j] == 'o':\r\n num+=1\r\n\r\n if num%2 != 0:\r\n return False\r\n return True\r\n \r\n \r\nn = int(input())\r\n\r\nb = [[] for i in range(n)]\r\n\r\nfor i in range(n):\r\n b[i] = list(input())\r\n\r\nif even_o(b, n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n=int(input())\r\nm=list()\r\nfor i in range (n):\r\n m.append(input())\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n k=0\r\n if (i>0) and (m[i-1][j]=='o'):\r\n k+=1\r\n if (i<(n-1)) and (m[i+1][j]=='o'):\r\n k+=1\r\n if (j>0) and (m[i][j-1]=='o'):\r\n k+=1\r\n if (j<n-1) and (m[i][j+1]=='o'):\r\n k+=1\r\n if (k%2):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n,a,cnt=int(input()),[],0\r\na.append(\"x\"*n+\"xx\")\r\nfor i in range(n):\r\n a.append(\"x\"+input()+\"x\")\r\na.append(\"x\"*n+\"xx\")\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if((a[i-1][j]==\"o\")+(a[i+1][j]==\"o\")+(a[i][j-1]==\"o\")+(a[i][j+1]==\"o\"))%2:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "\"\"\"\nhttps://codeforces.com/problemset/problem/462/A\n\"\"\"\ntaille = int(input())\ntable = [input() for _ in range(taille)]\n\ndico = dict()\n\nfor x in range(-1, taille + 1):\n for y in range(-1, taille + 1):\n dico[(x, y)] = dico.get((x, y), \"z\")\nfor x in range(taille):\n for y in range(taille):\n dico[(x, y)] = table[x][y]\nbon = True\nfor x in range(taille):\n if bon:\n for y in range(taille):\n if (\n sum(\n (\n dico[(x - 1, y)] == \"o\",\n dico[(x + 1, y)] == \"o\",\n dico[(x, y - 1)] == \"o\",\n dico[(x, y + 1)] == \"o\",\n )\n )\n % 2\n != 0\n ):\n bon = False\n break\n else:\n break\nif bon:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n=int(input())\r\nl1=[]\r\nflag=0\r\nfor i in range(n):\r\n l2=list(input())\r\n l1.append(l2)\r\nflag=0\r\nfor i in range(n):\r\n for j in range(n):\r\n c=0\r\n if (i+1)<n:\r\n if l1[i+1][j]=='o':\r\n c+=1\r\n if (i-1)>-1:\r\n if l1[i-1][j]=='o':\r\n c+=1\r\n if (j+1)<n:\r\n if l1[i][j+1]=='o':\r\n c+=1\r\n if (j-1)>-1:\r\n if l1[i][j-1]=='o':\r\n c+=1\r\n if c%2==1:\r\n flag=1\r\n break\r\n if flag==1:\r\n break\r\nif flag==1:\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n \r\n \r\n ", "n,s =int(input()), ''\r\nfor i in range(n):\r\n s+=input()\r\nprint(\"YES\") if s==s[::-1] else print(\"NO\")", "__author__ = 'Глеб'\r\nimport sys\r\nn = int(input())\r\ndesk = [[0] * (n + 10) for j in range(n + 10)]\r\nfor i in range(n):\r\n str = input()\r\n for j in range(n):\r\n if str[j] == 'x':\r\n desk[i][j] = 0\r\n else:\r\n desk[i][j] = 1\r\nfor i in range(n):\r\n for j in range(n):\r\n if (desk[i][j + 1] + desk[i][j - 1] + desk[i + 1][j] + desk[i - 1][j]) % 2 != 0:\r\n print('NO')\r\n sys.exit()\r\nprint('YES')", "n = int(input())\r\n\r\nar=[]\r\n\r\nfor i in range(n):\r\n ar.append(list(input()))\r\n\r\ncheck=True\r\n\r\nfor i in range(n):\r\n c=0\r\n for j in range(n):\r\n if i - 1 >= 0:\r\n if ar[i-1][j] == \"o\":\r\n c += 1\r\n if i + 1 < n:\r\n if ar[i+1][j] == \"o\":\r\n c += 1\r\n if j - 1 >= 0:\r\n if ar[i][j - 1] == \"o\":\r\n c += 1\r\n if j + 1 < n:\r\n if ar[i][j+1] == \"o\":\r\n c += 1\r\n\r\n if c%2!=0:\r\n check=False\r\n\r\nif check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ns = [list(input()) for _ in range(n)]\r\ncount = 0\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if i>0 and s[i-1][j]=='o': count+=1\r\n if j>0 and s[i][j-1]=='o': count+=1\r\n if i<n-1 and s[i+1][j]=='o': count+=1\r\n if j<n-1 and s[i][j+1]=='o': count+=1\r\n if count%2:\r\n flag = False\r\n break\r\nprint('YES' if flag else 'NO')", "# http://codeforces.com/problemset/problem/462/A\r\ndef check(i, j, mat):\r\n size = len(mat) - 1\r\n cant = 0\r\n # left\r\n a = j - 1\r\n if a >= 0:\r\n if mat[i][a] == 'o':\r\n cant += 1\r\n # right\r\n a = j + 1\r\n if a <= size:\r\n if mat[i][a] == 'o':\r\n cant += 1\r\n # top\r\n a = i - 1\r\n if a >= 0:\r\n if mat[a][j] == 'o':\r\n cant += 1\r\n # bot\r\n a = i + 1\r\n if a <= size:\r\n if mat[a][j] == 'o':\r\n cant += 1\r\n return cant\r\n\r\ndef main():\r\n n = int(input())\r\n mat = [['' for x in range(n)] for y in range(n)]\r\n mat = []\r\n for i in range(0, n):\r\n s = str(input())\r\n mat.append(list(s))\r\n size = len(mat)\r\n for i in range(size):\r\n for j in range(size):\r\n cant = check(i, j, mat)\r\n if cant % 2 != 0:\r\n print('NO')\r\n return\r\n print('YES')\r\n return\r\n\r\nmain()", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\ndef trueBoard(a):\r\n n=len(a) \r\n if n==1:\r\n return True \r\n for i in range(n):\r\n for j in range(n):\r\n res=0\r\n if i-1>=0:\r\n if a[i-1][j]=='o':\r\n res+=1 \r\n if j-1>=0:\r\n if a[i][j-1]=='o':\r\n res+=1 \r\n if i+1<=n-1:\r\n if a[i+1][j]=='o':\r\n res+=1 \r\n if j+1<=n-1:\r\n if a[i][j+1]=='o':\r\n res+=1 \r\n if res%2!=0:\r\n return False\r\n return True\r\nif trueBoard(a):\r\n print('YES')\r\nelse:\r\n print('NO')", "def adjacent(M,i,j,n):\r\n count=0\r\n x=[-1,1,0,0]\r\n y=[0,0,1,-1]\r\n for q in range(4):\r\n a=x[q]+i\r\n b=y[q]+j\r\n if(a>=0 and a<n and b>=0 and b<n):\r\n if (M[a][b]=='o'):\r\n count+=1\r\n return count\r\n\r\nn=int(input())\r\nM=[]\r\nfor i in range(n):\r\n s=input()\r\n M.append(s)\r\nco=True\r\nfor i in range(n):\r\n for j in range(n):\r\n if(adjacent(M,i,j,n)%2!=0):\r\n co=False\r\n break\r\n if(not co):\r\n break\r\nif co:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\ng = []\nfor _ in range(n):\n g.append(input())\nres = \"YES\"\nfor r in range(n):\n for c in range(n):\n s = g[r - 1][c] == \"o\" if r > 0 else 0\n s += g[r + 1][c] == \"o\" if r < n - 1 else 0\n s += g[r][c - 1] == \"o\" if c > 0 else 0\n s += g[r][c + 1] == \"o\" if c < n - 1 else 0\n if s & 1 == 1:\n res = \"NO\"\n break\nprint(res)\n", "c=\"\"\r\nfor i in range(int(input())):\r\n s=input()\r\n c+=s\r\nC=c[::-1]\r\nif c==C:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s = lambda x: x=='x';\r\nn = int(input());\r\nt = [list(map(s,input())) + [1] for i in range(n)] + [[1]*(n+1)]\r\n\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if t[i-1][j] + t[i+1][j] + t[i][j-1] + t[i][j+1]&1:\r\n print('NO');\r\n exit(0);\r\n\r\n\r\n\r\nprint(\"YES\");\r\n", "n = int(input())\r\nmat = []\r\nfor i in range(n):\r\n mat.append(list(input()))\r\nflag = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n count = 0\r\n if (i-1 >= 0 and mat[i-1][j] == 'o'):\r\n count += 1\r\n if (i+1 < n and mat[i+1][j] == 'o'):\r\n count += 1\r\n if (j+1 < n and mat[i][j+1] == 'o'):\r\n count += 1\r\n if (j-1 >= 0 and mat[i][j-1] == 'o'):\r\n count += 1\r\n\r\n if (count % 2 == 1):\r\n flag = 1\r\n break\r\n if (flag == 1):\r\n break\r\nif (flag == 0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "if __name__ == '__main__':\r\n\tn = int(input())\r\n\ttable, adj, flag = ['x' * (n + 1)], 0, True\r\n\r\n\tfor i in range(0, n):\r\n\t\ttable.append('x' + input() + 'x')\r\n\ttable.append('x' * (n + 1))\r\n\r\n\tfor i in range(1, n + 1):\r\n\t\tif not flag: break\r\n\t\tfor j in range(1, n + 1):\r\n\t\t\tif ((table[i + 1][j], table[i][j + 1], table[i - 1][j], table[i][j - 1]).count('o')) % 2:\r\n\t\t\t\tprint('NO')\r\n\t\t\t\tflag = False\r\n\t\t\t\tbreak\r\n\tif flag: print('YES')", "n = int(input())\r\nboard = [input() for _ in range(n)]\r\n\r\n# Define the four possible adjacent directions\r\ndirections = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\n\r\ndef count_adjacent_o(x, y):\r\n count = 0\r\n for dx, dy in directions:\r\n new_x, new_y = x + dx, y + dy\r\n if 0 <= new_x < n and 0 <= new_y < n and board[new_x][new_y] == 'o':\r\n count += 1\r\n return count\r\n\r\n# Check if all cells have an even number of adjacent 'o' cells\r\nfor i in range(n):\r\n for j in range(n):\r\n if count_adjacent_o(i, j) % 2 != 0:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(str(input()))\r\nf = True\r\nj = 0\r\nwhile f and j < n:\r\n for i in range(n):\r\n k = 0\r\n if i > 0 and a[j][i - 1] == 'o':\r\n k += 1\r\n if i < n - 1 and a[j][i + 1] == 'o':\r\n k += 1\r\n if j > 0 and a[j - 1][i] == 'o':\r\n k += 1\r\n if j < n - 1 and a[j + 1][i] == 'o':\r\n k += 1\r\n if k % 2 != 0:\r\n f = False\r\n break\r\n j += 1\r\nif f:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nmat = []\r\nfor i in range(n):\r\n mat.append(list(input()))\r\n \r\nfor i in range(n):\r\n for j in range(n):\r\n count = 0\r\n if i > 0 and mat[i - 1][j] == 'o':\r\n count += 1\r\n if j > 0 and mat[i][j - 1] == 'o':\r\n count += 1\r\n if i < (n - 1) and mat[i + 1][j] == 'o':\r\n count += 1\r\n if j < (n - 1) and mat[i][j + 1] == 'o':\r\n count += 1\r\n if count & 1:\r\n print('NO')\r\n exit()\r\nprint('YES')", "\"\"\"http://codeforces.com/problemset/problem/462/A\"\"\"\n\ndef solve(board):\n max_height = len(board)\n max_width = len(board[0])\n for i, row in enumerate(board):\n for j, cell in enumerate(row):\n count = 0\n # if board[i][j] == 'o':\n # continue\n # print('----')\n for o in range(i-1, i+2):\n for p in range(j-1, j+2):\n # print(o, p)\n if o < 0 or o >= max_height:\n continue\n if p < 0 or p >= max_width:\n continue\n if o == i and p == j:\n continue\n if abs(i - o) + abs(j - p) == 1 and board[o][p] == 'o':\n count += 1\n if count & 1:\n # print(i, j, count)\n return 'NO'\n return 'YES'\n\nif __name__ == '__main__':\n n = int(input())\n b = []\n for i in range(n):\n b.append(input())\n print(solve(b))\n", "class CodeforcesTask462ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.board = []\n\n def read_input(self):\n self.n = int(input())\n for x in range(self.n):\n self.board.append(input())\n\n def process_task(self):\n adj = [[0] * self.n for x in range(self.n)]\n pos = True\n for x in range(self.n):\n for y in range(self.n):\n if x:\n adj[x][y] += 1 if self.board[x - 1][y] == \"o\" else 0\n if y:\n adj[x][y] += 1 if self.board[x][y - 1] == \"o\" else 0\n if x < self.n - 1:\n adj[x][y] += 1 if self.board[x + 1][y] == \"o\" else 0\n if y < self.n - 1:\n adj[x][y] += 1 if self.board[x][y + 1] == \"o\" else 0\n if adj[x][y] % 2:\n pos = False\n break\n if not pos:\n break\n self.result = \"YES\" if pos else \"NO\"\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask462ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def get(mat, x, y, n):\r\n if x >= 0 and y >= 0 and x < n and y < n:\r\n if mat[x][y] == 'o':\r\n return 1\r\n return 0\r\n return 0\r\nn = int(input())\r\nmat = []\r\nfor j in range(n):\r\n mat.append(str(input()))\r\noutput = 1\r\nfor j in range(n):\r\n for k in range(n):\r\n count = get(mat, j + 1, k, n) + get(mat, j - 1, k, n)\r\n count += get(mat, j, k + 1, n) + get(mat, j, k - 1, n)\r\n if count % 2 == 1:\r\n output = 0\r\n break\r\n if output == 0:\r\n break\r\nif output == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "v=int(input())\na=[]\nfor i in range(v):\n a.append(list(input()))\n\nfor i in range(v):\n for j in range(v):\n c=0\n if i < v and i >= 0 and j+1 < v and j+1 >=0:\n if a[i][j+1] == \"o\":\n c+=1\n if i < v and i >= 0 and j-1 < v and j-1 >=0:\n if a[i][j-1] == \"o\":\n c+=1\n if i-1 < v and i-1 >= 0 and j < v and j >=0:\n if a[i-1][j] == \"o\":\n c+=1\n if i+1 < v and i+1 >= 0 and j < v and j >=0:\n if a[i+1][j] == \"o\":\n c+=1\n if c % 2 != 0:\n print(\"NO\")\n exit()\nprint(\"YES\")\n", "n = int(input())\r\nrows = []\r\nfor x in range(n):\r\n string = input()\r\n rows.append(string)\r\nresults = \"YES\"\r\nfor x in range(n):\r\n for y in range(n):\r\n a = y + 1\r\n b = y - 1\r\n c = x + 1\r\n d = x - 1\r\n z = 0\r\n if a < n:\r\n if rows[x][a] == \"o\":\r\n z += 1\r\n if b >= 0:\r\n if rows[x][b] == \"o\":\r\n z += 1\r\n if c < n:\r\n if rows[c][y] == \"o\":\r\n z += 1\r\n if d >= 0:\r\n if rows[d][y] == \"o\":\r\n z += 1\r\n if z % 2 != 0:\r\n results = \"NO\"\r\n break\r\nprint(results)", "n = int(input())\r\nflag = 0\r\nxo = []\r\nfor i in range(n):\r\n\ts = input()\r\n\txo.append(s)\r\n\r\nfor i in range(n):\r\n\tfor j in range(len(xo[i])):\r\n\t\tc = 0\r\n\t\tif(j-1>=0 and xo[i][j-1] == 'o'):\r\n\t\t\tc += 1\r\n\t\tif(i-1 >=0 and xo[i-1][j] == 'o'):\r\n\t\t\tc += 1\r\n\t\tif(i+1 < n and xo[i+1][j] == 'o'):\r\n\t\t\tc += 1\r\n\t\tif(j+1 < len(xo[i]) and xo[i][j+1] == 'o'):\r\n\t\t\tc += 1\r\n\t\tif(c%2 != 0):\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\r\nif(flag == 1):\r\n\tprint('NO')\r\nelse:\r\n\tprint('YES')\r\n\t\t\t\r\n\r\n\r\n", "n = int(input())\r\nchecker = [[0 for j in range(n)] for i in range(n)]\r\nfor i in range(n):\r\n string = input()\r\n for j in range(n):\r\n checker[i][j] = string[j]\r\n#print (checker)\r\nfor i in range(n):\r\n for j in range(n):\r\n count = 0\r\n if i-1 >= 0 and checker[i-1][j] == 'o': count += 1\r\n if i+1 < n and checker[i+1][j] == 'o': count += 1\r\n if j-1 >= 0 and checker[i][j-1] == 'o': count += 1\r\n if j+1 < n and checker[i][j+1] == 'o': count += 1\r\n if count%2 == 1:\r\n print (\"NO\")\r\n exit()\r\nprint (\"YES\")", "n = int(input())\r\nl = []\r\nfor _ in range(n):\r\n b = list(input().split())\r\n l.append(b[0])\r\nm = len(l[0])\r\ne = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n c = 0\r\n if (i-1>=0 and l[i-1][j] == 'o'):\r\n c += 1\r\n if (i+1<n and l[i+1][j] == 'o'):\r\n c += 1\r\n if (j-1>=0 and l[i][j-1] == 'o'):\r\n c += 1\r\n if (j+1<m and l[i][j+1] == 'o'):\r\n c += 1\r\n if c == 1 or c == 3:\r\n break\r\n else:\r\n e+=1\r\n else:\r\n continue\r\n break\r\nif e != n*m:\r\n print('NO')\r\nelse:\r\n print('YES')", "def valid(i):\n return i >= 0 and i < n\nn = int(input())\na = []\nfor i in range(n):\n s = input()\n a.append(s)\nfor i in range(n):\n for j in range(n):\n c = 0\n if valid(i+1) and a[i+1][j] == \"o\":\n c += 1\n if valid(i-1) and a[i-1][j] == \"o\":\n c += 1\n if valid(j+1) and a[i][j+1] == \"o\":\n c += 1\n if valid(j-1) and a[i][j-1] == \"o\":\n c += 1\n if c%2 != 0:\n print(\"NO\")\n quit()\nprint(\"YES\")\n", "n=int(input())\r\ngrid=[]\r\nfor i in range(n):\r\n s=input()\r\n grid.append(list(s))\r\nflag=0\r\nc=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(j-1>=0 and grid[i][j-1]=='o'): c+=1\r\n if(i-1>=0 and grid[i-1][j]=='o'): c+=1\r\n if(j+1<n and grid[i][j+1]=='o'): c+=1\r\n if(i+1<n and grid[i+1][j]=='o'): c+=1\r\n if(c%2!=0):\r\n flag=1\r\n break\r\nif(flag==0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "\n\"\"\"\ndef press( name, typed):\n i=0\n for j in range(len(typed)):\n if i<len(name) and typed[j]==name[i]:i+=1\n elif j==0 or typed[j]!=typed[j-1]:return False\n return i==len(name)\n\nprint(press(\"kitkcxmvzi\",\"kiikcxxmmvvzz\"))\n########### [0,1,2,3,4,5,6]\n##Input: \"kikcxmvzi\", \"kiikcxxmmvvzz\"\n#output: false\n---\ndef sortedSqr(A):\n i,j,r=0,len(A)-1,[]\n while i<=j:\n if (A[j]**2)>=(A[i]**2):\n r.append(A[j]**2);j-=1\n else:r.append(A[i]**2);i+=1\n return r[::-1]\nprint(sortedSqr( [-4,-1,0,3,10] ))\n\n#Input: [-4,-1,0,1,2,3,7,8,9,10]\n#Output: [0,1,9,16,100]\n---\n#Length of the longest substring with equal 1s and 0s\n\ndef lenLong(A):\n d,c,r={0:0},0,0\n for j in range(len(A)):\n c=c+1 if int(A[j]) else c-1\n if c not in d:d[c]=j+1\n r=max(r,j+1-d.setdefault(c,j+1))\n return r\nprint(lenLong(\"101001000\"))\n---\nnum of subarray with eq num of 1s & 0s\ndef sub(s):\n c,d=0,{0:1}\n r=0\n for j in s:\n c=c+1 if int(j) else c-1\n d[c]=d.setdefault(c,0)+1\n r+=d[c]-1\n return r\n\n\nprint(sub(\"0\"))\n#00110011\n---\ndef insertInterval(intervals,newInterval):\n b,e=newInterval[0],newInterval[1]\n r,f=[],False\n for i in intervals:\n if i[1]>=b and i[0]<=e:\n b,e=min(b,i[0]),max(e,i[1])\n elif e<i[0] and not f:\n r.append([b,e]);f=True\n r.append([i[0],i[1]])\n else:r.append([i[0],i[1]])\n if not f:r.append([b,e])\n return r\n\n\nprint(insertInterval([[1,2],[3,5],[6,7],[8,10],[12,16]],[4,8]))\n#Input: intervals = [[1,2],[3,5],[6,7],[8,10],[12,16]], newInterval = [4,8]\n#Output: [[1,2],[3,10],[12,16]]\n---\ndef mxNon(nums,target):\n f,d,pr=0,set([0]),0\n for j in nums:\n pr+=j\n if pr-target in d:\n f+=1;d=set()\n d.add(j)\n return f\n\nprint(mxNon([1,1,1,1,1],2))\n#Input: nums = [1,1,1,1,1], target = 2\n#Output: 2\n\"\"\"\nx=''\nfor _ in range(int(input())):x+=input()\nif list(x)==list(reversed(x)):print('YES')\nelse:print('NO')\n", "dx=[1,0,-1,0]\r\ndy=[0,1,0,-1]\r\n\r\ndef inlims(x,y,n):\r\n return x>=0 and y>=0 and x<n and y<n\r\n\r\nn = int(input())\r\nmx = [input() for _ in range(n)]\r\n\r\nflag=True\r\nfor x in range(n):\r\n for y in range(n):\r\n temp=[1 for i in range(4) if inlims(x+dx[i],y+dy[i],n) and mx[x+dx[i]][y+dy[i]]=='o']\r\n if len(temp)%2!=0:\r\n flag = False\r\n break\r\n if not flag: break\r\n\r\nprint(\"YES\" if flag else \"NO\")", "n=int(input())\r\narr=[]\r\nflag=0\r\nfor i in range(n):\r\n arr.append(input())\r\n# print(arr[0][2])\r\nfor i in range(n):\r\n for j in range(n):\r\n count=0\r\n k=j\r\n if k+1<n and arr[i][k+1]=='o':\r\n count=count+1\r\n if k-1>=0 and arr[i][k-1]=='o':\r\n count=count+1\r\n if i-1>=0 and arr[i-1][k]=='o':\r\n count=count+1\r\n if i+1<n and arr[i+1][k]=='o':\r\n count=count+1\r\n if count%2!=0:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "#!/usr/bin/env python3\nn = int(input())\n\ncheckerboard = []\nfor i in range(n):\n checkerboard.append(input())\n\nis_all_even = True\nfor i in range(n):\n for j in range(n):\n o_neighbours = 0\n l, r = j-1, j+1\n u, d = i-1, i+1\n if l >= 0 and checkerboard[i][l] == 'o':\n o_neighbours += 1\n if r < n and checkerboard[i][r] == 'o':\n o_neighbours += 1\n if u >= 0 and checkerboard[u][j] == 'o':\n o_neighbours += 1\n if d < n and checkerboard[d][j] == 'o':\n o_neighbours += 1\n\n if o_neighbours % 2 != 0:\n is_all_even = False\n \n if not is_all_even:\n break\n\nif is_all_even:\n print('YES')\nelse:\n print('NO')\n\n", "n = int(input())\r\nk = \"\"\r\nfor i in range(n):\r\n\tk += input()\r\nif list(k)==list(reversed(k)):\r\n\tprint(\"YES\")\r\n\r\nelse:\r\n\tprint(\"NO\")", "n = int(input())\nboard = ['0'*(n+2)]\nfor i in range(n):\n row = input()\n board.append('0'+row+'0')\nboard.append('0'*(n+2))\nd = [(-1,0), (1,0), (0,1), (0,-1)]\nfor i in range(1,n+1):\n for j in range(1,n+1):\n count = 0\n for dx, dy in d:\n if board[i+dx][j+dy] == 'o':\n count += 1\n if count%2:\n print(\"NO\")\n exit()\nprint(\"YES\")\n\n\n\n", "#import sys\r\n#input = sys.stdin.readline\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nflag = True\r\nfor i in range(n):\r\n for j in range(n):\r\n s = 0\r\n if (i + 1 < n) and a[i+1][j] == 'o':\r\n s += 1\r\n if (j + 1 < n) and a[i][j+1] == 'o':\r\n s += 1\r\n if (i - 1 >= 0) and a[i-1][j] == 'o':\r\n s += 1\r\n if (j - 1 >= 0) and a[i][j-1] == 'o':\r\n s += 1\r\n if s %2 == 1:\r\n flag = False\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "from collections import Counter\r\nimport string\r\nimport math\r\nimport sys\r\n\r\ndef array_int():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\ndef vary(number_of_variables):\r\n if number_of_variables==1:\r\n return int(sys.stdin.readline())\r\n if number_of_variables>=2:\r\n return map(int,sys.stdin.readline().split()) \r\ndef makedict(var):\r\n return dict(Counter(var))\r\nmod=1000000007\r\nn=vary(1)\r\narr=[[-1 for i in range(n+2)]for j in range(n+2)]\r\nfor i in range(1,n+1):\r\n s=input()\r\n st=list(s)\r\n for j in range(1,n+1):\r\n arr[i][j]=st[j-1]\r\nflag=0\r\nfor i in range(1,n+1):\r\n if flag==-1:\r\n break\r\n for j in range(1,n+1):\r\n count=0\r\n if arr[i][j+1]=='o': \r\n count+=1\r\n if arr[i][j-1]=='o':\r\n count+=1\r\n if arr[i+1][j]=='o':\r\n count+=1\r\n if arr[i-1][j]=='o':\r\n count+=1\r\n if count%2!=0:\r\n flag=-1\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n\r\n\r\n\r\n", "X = ''\r\ng = int(input())\r\nfor i in range(g):\r\n X+=input()\r\nif X==X[::-1]: print(\"YES\")\r\nelse: print(\"NO\")", "n=int(input(\"\"))\r\na=[[x for x in input()] for j in range(n)]\r\n#n=4\r\n#a=[['x','o','o','o'],['o','o','x','o'],['o','x','o','o'],['o','o','o','x']]\r\n\r\nflag=0\r\nif(n>1):\r\n for i in range(n):\r\n for j in range(n):\r\n count=0\r\n if(a[i][j]):\r\n \r\n k1 = j+1 if j+1<n else j\r\n k2= j if j-1<0 else j-1\r\n k3 = i+1 if i+1<n else i\r\n k4= i if i-1<0 else i-1\r\n if(k1!=j and k2!=j):\r\n \r\n if(a[i][k1]==\"o\"): \r\n count+=1\r\n if(a[i][k2]==\"o\"): \r\n count+=1\r\n else:\r\n if(a[i][k1 if k2==j else k2]==\"o\"): \r\n count+=1\r\n if(k3!=i and k4!=i):\r\n \r\n if(a[k3][j]==\"o\"): \r\n count+=1\r\n if(a[k4][j]==\"o\"): \r\n count+=1\r\n else:\r\n if(a[k3 if k4==i else k4][j]==\"o\"): \r\n count+=1\r\n \r\n if(count%2!=0):\r\n flag=1\r\n break\r\n if(flag==1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"YES\") \r\n \r\n \r\n \r\n ", "n = int(input())\r\nmatrix = []\r\ncheck = True\r\nfor i in range (0, n):\r\n row = list(input())\r\n matrix.append(row)\r\nfor i in range (0, n):\r\n for j in range (0, n):\r\n count = 0\r\n if i != 0:\r\n if matrix[i - 1][j] == 'o':\r\n count += 1\r\n if j != 0:\r\n if matrix[i][j - 1] == 'o':\r\n count += 1\r\n if i != n - 1:\r\n if matrix[i + 1][j] == 'o':\r\n count += 1\r\n if j != n - 1:\r\n if matrix[i][j + 1] == 'o':\r\n count += 1\r\n if count % 2 != 0:\r\n check = False\r\n break\r\n break\r\nif check:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "displacements = ((-1, 0), (1, 0), (0, -1), (0, 1))\r\nn = int(input())\r\nboard = list(input() for _ in range(n))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n for dx, dy in displacements:\r\n x = j + dx\r\n y = i + dy\r\n\r\n if x < 0 or x >= n or y < 0 or y >= n: continue\r\n cnt += int(board[y][x] == \"o\")\r\n if cnt & 1:\r\n print(\"NO\")\r\n exit(0)\r\nprint(\"YES\")", "n = int(input())\r\nle = []\r\nfor i in range(n):\r\n le.append(list(map(str, input().split())))\r\nc = 0\r\nx = True\r\nfor i in range(n):\r\n for j in range(n):\r\n if j != n-1:\r\n if le[i][0][j+1] == \"o\":\r\n c+=1\r\n if i != n-1:\r\n if le[i+1][0][j] == \"o\":\r\n c+=1\r\n if i != 0:\r\n if le[i-1][0][j] == \"o\":\r\n c+=1\r\n if j != 0:\r\n if le[i][0][j-1] == \"o\":\r\n c+=1\r\n if c % 2 != 0:\r\n x = False\r\n break\r\nif x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\ngrid = []\r\nfor _ in range(n):\r\n s = input().strip()\r\n grid.append(list(s))\r\ndirs = [(1, 0), (-1, 0), (0, -1), (0, 1)]\r\nposs = True\r\nfor i in range(n):\r\n for j in range(n):\r\n cnt = 0\r\n for d in dirs:\r\n ni, nj = i + d[0], j + d[1]\r\n if 0 <= ni < n and 0 <= nj < n and grid[ni][nj] == \"o\": cnt += 1\r\n if cnt % 2 != 0: poss = False\r\nprint(\"YES\") if poss else print(\"NO\")", "n = int(input())\r\nnum = n\r\nl = []\r\nwhile num>0:\r\n s = input()\r\n l.append(s)\r\n num-=1\r\neven = True\r\nfor i in range(n):\r\n c = 0\r\n for j in range(n):\r\n if i-1>=0 and l[i-1][j] == 'o':\r\n c+=1\r\n if i+1<n and l[i+1][j] == 'o':\r\n c+=1\r\n if j-1>=0 and l[i][j-1] == 'o':\r\n c+=1\r\n if j+1<n and l[i][j+1] == 'o':\r\n c+=1\r\n if c%2 == 1:\r\n even = False\r\nif even:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n for i in range(n):\r\n for j in range(n):\r\n val = 0\r\n if i - 1 >= 0 and A[i-1][j] == 'o':\r\n val += 1\r\n if j - 1 >= 0 and A[i][j-1] == 'o':\r\n val += 1\r\n if i + 1 < n and A[i+1][j] == 'o':\r\n val += 1\r\n if j + 1 < n and A[i][j+1] == 'o':\r\n val += 1\r\n if val % 2 == 1:\r\n return False\r\n return True\r\n\r\ndef main():\r\n n = int(input())\r\n A = []\r\n for i in range(n):\r\n A.append(list(input()))\r\n if solve(A):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "x = int(input())\r\nl = []\r\n\r\nbo = True\r\nfor i in range(x):\r\n l.append(input())\r\n\r\nfor i in range(x):\r\n for j in range(x):\r\n counter =0\r\n if i-1 >=0 and l[i-1][j] =='o':\r\n counter +=1\r\n if i+1 < x and l[i+1][j] =='o':\r\n counter +=1\r\n if j+1 < x and l[i][j+1] == 'o':\r\n counter +=1\r\n if j-1 >= 0 and l[i][j-1] == 'o':\r\n counter +=1\r\n if counter %2 == 1:\r\n bo =False\r\n print('NO')\r\n exit()\r\n \r\nif bo :\r\n print('YES')", "def isvalid(i,j,n):\r\n return i>=0 and j>=0 and i<n and j<n\r\nn=int(input())\r\nmat=[]\r\nfor _ in range(n):\r\n mat.append(input())\r\nf=1\r\nfor i in range(n):\r\n for j in range(n):\r\n c=0 \r\n if isvalid(i+1,j,n) and mat[i+1][j]=='o':\r\n c+=1 \r\n if isvalid(i,j+1,n) and mat[i][j+1]=='o':\r\n c+=1 \r\n if isvalid(i-1,j,n) and mat[i-1][j]=='o':\r\n c+=1 \r\n if isvalid(i,j-1,n) and mat[i][j-1]=='o':\r\n c+=1 \r\n if c&1:\r\n f=0\r\n #print(c)\r\n # print(i,j)\r\n break \r\n if not f:\r\n break\r\nprint('YES' if f else 'NO')\r\n", "\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nfor i in range(n):\r\n for j in range(n):\r\n os = 0\r\n for dx, dy in [(-1, 0), (0, -1), (1, 0), (0, 1)]:\r\n x = i + dx\r\n y = j + dy\r\n if x < 0 or y < 0 or x >= n or y >= n:\r\n continue\r\n if s[x][y] == 'o':\r\n os += 1\r\n if os % 2 != 0:\r\n print('NO')\r\n exit()\r\nprint('YES')", "n = int(input())\ns = \"\"\nfor i in range(n):\n s += str(input())\nif s == s[::-1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\nfrom typing import Counter\nfrom bisect import bisect_right, bisect_left\nimport math\nhpop = heappop\nhpush = heappush\n\ndef solution():\n n = int(input())\n grid = []\n for _ in range(n):\n grid.append(input())\n for i in range(n):\n for j in range(n):\n count = 0\n for di,dj in [(0,1),(1,0),(0,-1),(-1,0)]:\n ni = i + di\n nj = j + dj\n if ni < 0 or nj < 0 or ni >= n or nj >= n:\n continue\n count += grid[ni][nj] == \"o\"\n if count % 2 == 1:\n print(\"NO\")\n return\n\n print(\"YES\")\n\n\n \n\n \n \n \n \ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n \n#import sys\n#import threading\n#sys.setrecursionlimit(1 << 30)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n\n\n\n\n\"\"\"\n num = int(input())\n arr = list(map(int, input().split()))\n a,b = map(int, input().split())\n graph = defaultdict(list)\n for i in range(#)\n graph[a].append(b)\n graph[b].append(a)\n MOD = 10**9 + 7\n\nfor di,dj in [(0,1),(1,0),(0,-1),(-1,0)]:\n ni = i + di\n nj = j + dj\n if not (0<= ni < len(grid) and 0<= nj < len(grid[0])):\n continue\n\ndef gcd(a,b):\n if a < b:\n a,b = b,a\n if b == 0:\n return a\n\n return gcd(a%b,b)\n\n\"\"\"\n", "n = int(input())\n\nA = []\nfor i in range(0,n):\n s = input()\n B = []\n for j in s:\n if j == 'x':\n B.append(0)\n elif j == 'o':\n B.append(1)\n A.append(B)\n\nflag = 0\nfor k in range(0,n):\n if n == 1:\n break\n for l in range(0,n):\n if k == 0:\n if l == 0:\n count = A[k][l+1] + A[k+1][l]\n elif l == n-1:\n count = A[k][l-1] + A[k+1][l]\n else:\n count = A[k][l+1] + A[k][l-1] + A[k+1][l]\n elif k == n-1:\n if l == 0:\n count = A[k][l+1] + A[k-1][l]\n elif l == n-1:\n count = A[k][l-1] + A[k-1][l]\n else:\n count = A[k][l+1] + A[k][l-1] + A[k-1][l]\n else:\n if l == 0:\n count = A[k][l+1] + A[k+1][l] + A[k-1][l]\n elif l == n-1:\n count = A[k][l-1] + A[k+1][l] + A[k-1][l]\n else:\n count = A[k][l+1] + + A[k][l-1] + A[k+1][l] + A[k-1][l]\n if count%2 != 0:\n flag = 1\n break\nif flag == 0:\n print('YES')\nelse:\n print('NO')\n " ]

[ "def cal(m,n,i):\r\n tot=1\r\n for j in range(1,n-i+1):\r\n tot=tot*(n*m-m-n+i+j)/(n*m-n+i+j)\r\n for j in range(1,i+1):\r\n tot=tot*(m-i+j)/(n*m-n+j)\r\n for j in range(1,i+1):\r\n tot=tot/j*(n-i+j)\r\n return tot\r\n\r\n\r\nn,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nans = 0\r\n\r\nfor i in range(1, min(n,m)+1):\r\n ans += i * i /n * cal(m,n,i)\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nif 1 == n:\r\n print(1)\r\nelse:\r\n print(1 / n + (n - 1) * (m - 1) / (n * (n * m - 1)))\r\n", "m, n = map(int, input().split())\n\nif m == 1:\n print(1)\nelse:\n print(1 / m + (n - 1) * (m - 1) / (m * (m * n - 1)))", "import math\r\nimport sys\r\nfrom collections import deque\r\nfrom itertools import permutations\r\nfrom math import inf\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_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\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 if m == n == 1:\r\n ac.st(1)\r\n else:\r\n ac.st(1 / n + (n - 1) / n * (m - 1) / (m * n - 1))\r\n return\r\n\r\n\r\nSolution().main()\r\n", "m, n = map(int, input().split())\r\nif m == 1:\r\n print(1)\r\nelse:\r\n print(1/m + (m-1)/m*(n-1)/(n*m-1))", "n, m = map(int, input().split())\r\n\r\nif n == 1:\r\n print(1)\r\nelse:\r\n print('{:9}'.format((n-1)/n * (m - 1) / (n*m - 1) + 1 / n))", "import collections\r\nimport math\r\n\r\ndef readLine():\r\n\treturn list(map(int, input().strip().split()))\r\n\r\ndef readInt():\r\n\treturn int(input())\r\n\r\ndef readString():\r\n\treturn input()\r\n\r\ndef tcase():\r\n\tt = readInt()\r\n\tfor _ in range(t):\r\n\t\tsolve()\r\n\r\ndef solve():\r\n\tn, m = readLine()\r\n\r\n\tf = [0] * (n*m+1)\r\n\tfor i in range(2, n*m+1):\r\n\t\tf[i] = f[i-1] + math.log(i)\r\n\r\n\tdef c(n, k):\r\n\t\treturn f[n] - f[k] - f[n-k]\r\n\r\n\r\n\tans = 0\r\n\tfor num in range(1, min(n, m) + 1):\r\n\t\ttemp = c(m, num) + c(m*(n-1), n-num) - c(m * n, n)\r\n\t\tpro = (num * num * 1.) / (n * 1.)\r\n\t\t# print(temp, pro)\r\n\t\tans += pro * math.pow(math.e, temp)\r\n\t# ans = ans / math.comb(m * n, n)\r\n\tprint(ans)\r\n\r\n\t\r\n\r\n\r\n# tcase()\r\nsolve()", "n,m=map(int,input().split())\r\nif n*m==1:\r\n print(1)\r\nelse:\r\n print((2*n*m-n-m)/(n*(n*m-1)))", "var=input(\"\")\r\nvar=var.split(\" \")\r\nx=int(var[0])\r\ny=int(var[1])\r\nif x==1 and y==1:\r\n print( \"1\")\r\nelse:\r\n p1=(y-1)/(x*y-1)\r\n p2=(1-p1)*(1/x)\r\n print(p1+p2)\r\n \r\n", "n,m=map(int,input().split())\r\nif n*m==1:\r\n print(1)\r\nelse:\r\n print(1/n+(n-1)*(m-1)/(n*(n*m-1)))", "n, m = list(map(int, (input().split())))\nif(m*n > 1):\n print(1 / n + (n - 1) * (m - 1) / n / (m*n - 1))\nelse:\n print(1)\n# Thu Feb 27 2020 19:23:17 GMT+0300 (MSK)\n", "def main():\n n, m = map(int, input().split())\n if n == 1 == m:\n res = 1.\n else:\n res = (2 * n * m - n - m) / (n * m - 1) / n\n\n print('{:.16f}'.format(res))\n\n\nif __name__ == '__main__':\n main()\n", "n, m, ans = map(int, input().split() + [0])\r\nf = [1] * 1005\r\nfor i in range(1, 1005):\r\n f[i] = i * f[i -1]\r\nfor i in range(1, 1 + min(n, m)):\r\n t = f[n] // (f[i] * f[n - i])\r\n for j in range(i):\r\n t *= (m - j) / (n * m - j)\r\n for j in range(n - i):\r\n v = n * m - i - j\r\n t *= (v - m + i) / (v)\r\n ans += (t * i * i) / n\r\nprint(ans)", "n,m=map(int,input().split())\n\nprint(1.0 if n==m==1 else 1/n*((n-1)*(m-1)/(n*m-1)+1))\n\n\n\n\n\n# Made By Mostafa_Khaled", "n,m = map(float, input().split())\r\nif n==1:print(1)\r\nelse:print((1+(n-1)*(m-1)/(n*m-1))/n)", "n, m = map(int, input().split())\n\nif n == 1:\n print(1)\nelse:\n ans = 1/n+((m-1)/(m*n-1))*((n-1)/n)\n print(ans)", "F=[1,1]\r\nfor i in range(2,1001):\r\n F.append(F[-1]*i)\r\ndef ncr(x,y):\r\n return F[x]//(F[y]*F[x-y])\r\n\r\nn,m=map(int,input().split())\r\nP=[0]*2000\r\n\r\nfor j in range(1,min(m,n)+1):\r\n mine=m\r\n total=n*m\r\n p=1\r\n for x in range(j):\r\n p*=mine/total\r\n mine-=1\r\n total-=1\r\n for x in range(n-j):\r\n p*=(total-mine)/total\r\n total-=1\r\n p*=n\r\n p*=ncr(n,j)\r\n P[j]=p\r\n\r\nans=0\r\n\r\nfor j in range(1,min(m,n)+1):\r\n # What is the probability that the deck will contain j cards of type i\r\n p=P[j]\r\n ans+=P[j]*(j*j)/(n*n)\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nprint(1.0 if n==m==1 else ((n*m-n-m+1)/(n*m-1)+1)/n)", "import sys\r\ninput=sys.stdin.readline\r\n\r\nn,m=map(int,input().split())\r\nif(n==1):\r\n print(1)\r\nelse:\r\n print((2*m*n-m-n)/(n*(n*m-1)))\r\n \r\n ", "# https://codeforces.com/problemset/problem/452/C\r\nn, m = map(int, input().split())\r\n\r\nif n*m==1:\r\n print(1)\r\nelse:\r\n print(1/n + (m-1)*(n-1) / ((m*n-1) * n))", "# LUOGU_RID: 102441700\nn, m = map(int, input().split())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n print(1 / n + (n - 1) / n * (m - 1) / (n * m - 1))", "def cal(m,n,i):\r\n tot=1\r\n for j in range(1,n-i+1):\r\n tot=tot*(n*m-m-n+i+j)/(n*m-n+i+j)\r\n for j in range(1,i+1):\r\n tot=tot*(m-i+j)*(n-i+j)/(n*m-n+j)/j\r\n return tot\r\nn,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nans = 0\r\nfor i in range(1, min(n,m)+1):\r\n ans += i * i /n * cal(m,n,i)\r\nprint(ans)", "from math import *\n\n# logger[n] = log(n!)\nlogger = []\nfor n in range(1000111):\n if n == 0:\n logger.append(log(factorial(0)))\n else:\n logger.append(logger[n - 1] + log(n))\n\ndef binomial(n, k):\n if k < 0:\n return 0\n tmp = logger[n] - logger[k] - logger[n - k]\n return tmp\n\ndef main():\n n, m = [int(x) for x in input().split()]\n ans = 0\n for i in range(n):\n tmp = binomial((n-1)*m, n-1-i) + binomial(m-1, i) + log(i + 1)\n tmp -= (log(n) + binomial(n*m - 1, n - 1))\n ans += exp(tmp)\n print('%.12lf' % ans)\n\nmain()", "n, m = map(int, input().split())\r\nt = m * n\r\nprint(1 if t == 1 else (2 * t - (m + n)) / (n * (t - 1)))", "import itertools\r\nimport math\r\n\r\n\r\nS = 1000000\r\n\r\n\r\nif __name__ == '__main__':\r\n fact = list(itertools.accumulate(range(S + 1), lambda x, y: x + math.log(y)))\r\n n, m = [int(x) for x in input().split()]\r\n res = 0.0\r\n for i in range(1, min(n, m) + 1):\r\n res += math.exp(\r\n math.log(n) + (fact[m] - fact[i] - fact[m - i]) +\\\r\n (fact[(n - 1) * m] - fact[n - i] - fact[(n - 1) * m - n + i]) -\\\r\n (fact[n * m] - fact[n] - fact[n * m - n]) +\\\r\n math.log((1.0 * i / n) ** 2))\r\n print(res)\r\n", "#!/usr/bin/env pypy3\r\n\r\nfrom sys import stdin, stdout\r\n\r\ndef input(): return stdin.readline().strip()\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\nimport random\r\nfrom collections import defaultdict\r\nfrom functools import lru_cache\r\n\r\n### CODE HERE\r\n\r\ndef mean(f):\r\n sample = [f() for _ in range(10**5)]\r\n return sum(sample) / len(sample)\r\n\r\ndef ans_very_slow(n, m):\r\n def trial():\r\n big_pool = list(range(n))*m\r\n small_pool = random.sample(big_pool, n)\r\n return 1.0 if random.choice(small_pool) == random.choice(small_pool) else 0.0\r\n\r\n return mean(trial)\r\n\r\ndef runs_sample(arr):\r\n freq = defaultdict(int)\r\n for a in arr: freq[a] += 1\r\n ret = 0\r\n for k in freq:\r\n ret += freq[k]**2\r\n return ret\r\n\r\ndef runs_slow(n, m):\r\n def trial():\r\n big_pool = list(range(n))*m\r\n small_pool = random.sample(big_pool, n)\r\n return runs_sample(small_pool)\r\n return mean(trial)\r\n\r\ndef exp_x2(k, a, b):\r\n # Exp[X^2 | X = number of 1's drawn from a pool of a 1's and b 0's ]\r\n\r\n def trial():\r\n pool = [1]*a + [0]*b\r\n X = sum(random.sample(pool, k))\r\n return X**2\r\n\r\n return mean(trial)\r\n\r\ndef dp_x(k, a, b):\r\n # Exp[X | X = number of 1's drawn from a pool of a 1's and b 0's ]\r\n return k*a/(a+b)\r\n\r\n@lru_cache(None)\r\ndef dp_x2(k, a, b):\r\n # Exp[X^2 | X = number of 1's drawn from a pool of a 1's and b 0's ]\r\n if k == 0: return 0.0\r\n if b == 0: return k**2\r\n if a == 0: return 0.0\r\n\r\n total = a+b\r\n\r\n a_exp = dp_x2(k-1, a-1, b) + 2*dp_x(k-1, a-1, b) + 1\r\n b_exp = dp_x2(k-1, a, b-1)\r\n\r\n # w.p. a/total, you will select a 1, and Exp((X+1)^2) = Exp(X^2) + 2Exp(X) + 1\r\n ret = a/total * a_exp + b/total * b_exp\r\n\r\n return ret\r\n\r\ndef runs(n, m):\r\n total = n*m\r\n good = m\r\n return dp_x2(n, good, total-good)\r\n\r\ndef ans(n, m):\r\n return runs(n, m) / n\r\n\r\nprint(ans(*read_int_list()))" ]

[ "def f(n, mod=10**9+7):\r\n ans = 1\r\n for i in range(1, n + 1): ans = ans * i % mod\r\n return ans\r\n \r\ndef g(n, mod=10**9+7):\r\n num1 = f(n * 2)\r\n den1 = f(n) ** 2 % mod\r\n return num1 * pow(den1, mod - 2, mod) % mod\r\n \r\nn = int(input()) + 1\r\nprint(g(n) - 1)", "p = 10**9+7\r\ndef power(x, y, p):\r\n b = bin(y)[2:]\r\n x = x % p\r\n start = x\r\n answer = 1\r\n for i in range(len(b)-1, -1, -1):\r\n if b[i]=='1':\r\n answer = (answer*start) % p\r\n start = (start*start) % p\r\n return answer\r\n\r\ndef binom(n, m, p):\r\n num = 1\r\n den = 1\r\n for i in range(m):\r\n num = (num*(n-i)) % p\r\n den = (den*(m-i)) % p\r\n den = power(den, p-2, p)\r\n return (num*den) % p\r\n \r\ndef process(n):\r\n answer = binom(2*n+2, n+1, p)\r\n return (answer-1) % p\r\n\r\nn = int(input())\r\nprint(process(n))", "MOD = 10**9+7\r\nx=int(input())+1\r\nn=1\r\nn2=1\r\nfac=1\r\nfor i in range(1,2*x+1):\r\n fac = (fac*i)%MOD\r\n if i==x:\r\n n=fac\r\n if i==2*x:\r\n n2=fac\r\nres= (n2*pow(n,MOD-2,MOD)**2)%MOD-1\r\n\r\nprint(res)\r\n", "from sys import stdin, stdout, setrecursionlimit\r\ninput = stdin.readline\r\n# setrecursionlimit(int(1e6))\r\ninf = float('inf')\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter, deque\r\nfrom heapq import *\r\nimport math\r\nfrom math import floor, ceil, sqrt\r\ndef geti(): return map(int, input().strip().split())\r\ndef getl(): return list(map(int, input().strip().split()))\r\ndef getis(): return map(str, input().strip().split())\r\ndef getls(): return list(map(str, input().strip().split()))\r\ndef gets(): return input().strip()\r\ndef geta(): return int(input())\r\ndef print_s(s): stdout.write(s+'\\n')\r\n# def count(a,b):\r\n# if not a or not b:\r\n# return max(a, b) + 1\r\n# return count(a-1, b) + count(a, b-1) + 1\r\nmod = int(1e9+7)\r\nmaxi=int(1e6+2)\r\ninverse = [0]*(maxi)\r\ninverse[0]=inverse[1]=1\r\nfor i in range(2,maxi):\r\n inverse[i]=(mod-(mod//i))*inverse[mod%i]%mod\r\nfor i in range(1,maxi):\r\n inverse[i]=(inverse[i-1]*inverse[i])%mod\r\ndef solve():\r\n n = geta() + 1\r\n # 2*n! / n! ^ 2\r\n temp = 1\r\n for i in range(2*n, n, -1):\r\n temp *= i\r\n temp %= mod\r\n # for i in range(n, 1, -1):\r\n # other *= i\r\n # other = binary(other, mod - 2)\r\n print((temp* inverse[n]) % mod - 1)\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n solve()\r\n", "import cmath\nn = int(input())\nq=1\np=1\ndef inv(a,b):\n if(a>1):\n return b-inv(b%a,a)*b//a\n else:\n return 1\nfor j in range(1,n+2):\n p=p*(n+1+j)% 1000000007\n q=(q*j)% 1000000007\n\nprint(p*inv(q,1000000007) % 1000000007 -1)\n \t \t \t\t\t \t\t\t\t\t\t \t \t\t \t", "MOD = 10**9+7 # declarando una variable para tener el modulo\r\nfact = [1]*(2*10**6+5) # declaro un array de longitud mayor que 2*10^6 +2 donde voy a tener el factorial previamente calculado modulo 10^9+7 \r\n\r\nfor i in range(1,len(fact)): # recorro todos los valores de array fact y calculo el factorial de un numero y lo guardo en el indice (para despues poder acceder a el en O(1))\r\n fact[i] = (fact[i-1]* i)% (MOD) # el factiral de i es el factorial de i-1 por i , y me quedo con el su modulo 10^9+7 \r\n\r\n# me devuelve n en k \r\n# n cantidad de objetos \r\n# k tamano de los subconjuntos \r\ndef C(n,k): \r\n return (fact[n] * pow(fact[k], MOD - 2 , MOD)**2) % MOD\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n print (C(2*n+2 , n+1) -1 )", "MOD = 10**9+7\r\n\r\nfact = [1]*2000004\r\nfor i in range(1,2000004):\r\n fact[i] = (fact[i-1]*i)%MOD\r\n\r\ndef C(n,k):\r\n return (fact[n]*pow(fact[k],MOD-2,MOD)**2)%MOD\r\nx=int(input())+1\r\nres = C(x*2,x)-1\r\nprint(res)\r\n", "M=10**9+7\r\nR=2*10**6+1\r\nF=[1]*(R+1)\r\nfor i in range(2, R+1):\r\n F[i]=(F[i-1]*i)%M\r\ndef modpow(x, p):\r\n if p==0:\r\n return 1\r\n y=modpow(x, p//2)\r\n if p%2:\r\n return (y*y*x)%M\r\n return (y*y)%M\r\ndef modhyp(x):\r\n return modpow(x, M-2)\r\nFhyp=[1]*(R+1)\r\nFhyp[R]=modhyp(F[R])\r\nfor i in range(R-1, -1, -1):\r\n Fhyp[i]=(Fhyp[i+1]*(i+1))%M\r\ndef C(n, k):\r\n if k<0 or n<0:\r\n return 0\r\n if k>n:\r\n return 0\r\n return (F[n]*Fhyp[n-k]*Fhyp[k])%M\r\nn=int(input())\r\nans=0\r\nfor j in range(n+1):\r\n ans+=C(n+j+1,j+1)\r\n ans%=M\r\nprint(ans)", "n = int(input())\nu, v, f, B = 1, 1 , 1, 10**9+7\nfor i in range(2,n+2):\n u = u * i % B\nfor i in range(2,n+n+3):\n f = f * i % B\ndef inv(u):\n if u < 2:\n return 1\n return (-(B // u) * inv(B % u)) % B\n\nprint((f * inv(u) * inv(u) + B - 1) % B)\n \n", "p = int(1e9+7)\r\nN = int(2e6+2)\r\nfact= [1]*(N+1)\r\nfor i in range(2,N+1):\r\n fact[i]=(fact[i-1]*i)%p\r\n\r\ndef bpow(a,b,p):\r\n c = 1\r\n while b>0:\r\n if b&1: c=(c*a)%p\r\n a = (a*a)%p\r\n b = b>>1\r\n return c\r\n \r\ndef inv(a,p): return bpow(a,p-2,p)\r\n\r\ndef solv(n):\r\n t = n+1\r\n return (fact[t<<1]*inv(fact[t],p)%p*inv(fact[t],p)-1)%p\r\n\r\nn = int(input())\r\nprint(solv(n))\r\n", "import math\r\nn = int (input()) + 1\r\nmod = 10 ** 9 + 7\r\nfact = [1] * (2 * (10 ** 6) + 3)\r\nfor i in range (1, 2 * n + 1):\r\n fact[i] = (fact[i - 1] * i) % mod\r\ndef C (n, k):\r\n return (fact[n] * pow (fact[k], mod - 2, mod) ** 2) % mod\r\nprint (C (2 * n, n) - 1)\r\n", "# https://codeforces.com/problemset/problem/575/H\r\n\r\nimport sys\r\nimport math\r\n\r\nMOD = 1000000007\r\n\r\n\r\ndef inv(a, b):\r\n if(a > 1):\r\n return b-inv(b % a, a)*b//a\r\n else:\r\n return 1\r\n\r\n\r\ndef main():\r\n # sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n # sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n # sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n\r\n n = int(sys.stdin.readline().strip())\r\n # a, b = map(int, sys.stdin.readline().strip().split()[:2])\r\n\r\n # C(n+1, 2n + 2) = (2n+2)! : (n+1)! : n+1!\r\n # = (n+2)(n+3)...(2n+2) /\r\n\r\n t = 1\r\n m = 1\r\n for i in range(1, n + 2):\r\n t = (t * (n + i + 1)) % MOD\r\n m = (m * i) % MOD\r\n print(t * inv(m, MOD) % MOD - 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", "import cmath\r\nn = int(input())\r\nq=1\r\np=1\r\ndef inv(a,b):\r\n if(a>1):\r\n return b-inv(b%a,a)*b//a\r\n else:\r\n return 1\r\nfor j in range(1,n+2):\r\n p=p*(n+1+j)% 1000000007\r\n q=(q*j)% 1000000007\r\n\r\nprint(p*inv(q,1000000007) % 1000000007 -1)" ]

[ "word = input()\r\nn = len(word)\r\nbreaks = [False] * n\r\nvowels = set({'a', 'e', 'i', 'o', 'u'})\r\nstreak = 1 if word[0] not in vowels else 0\r\nnumdiff = streak\r\nfor i in range(1, n):\r\n if word[i] not in vowels:\r\n streak += 1\r\n if word[i] != word[i - 1]:\r\n numdiff += 1\r\n else:\r\n streak = 0\r\n numdiff = 0\r\n if streak >= 3 and numdiff >= 2:\r\n breaks[i] = True\r\n streak = 1\r\n numdiff = 1\r\nresult = \"\"\r\nfor i in range(n):\r\n if breaks[i]:\r\n result += \" \"\r\n result += word[i]\r\nprint(result)# 1689956231.6888063", "def insert (source_str, insert_str, pos):\r\n return source_str[:pos]+insert_str+source_str[pos:]\r\n\r\ndef isVowel(c):\r\n vowels = [\"a\", \"i\", \"o\", \"u\", \"e\"]\r\n if (c in vowels):\r\n return True\r\n return False\r\n\r\nword = input()\r\nnewWord = word\r\nconCount, cutCount = 0, 0\r\nblock = set()\r\nisTypo = False\r\nfor i in range(len(word)):\r\n letter = word[i]\r\n if (isVowel(letter)):\r\n conCount = 0\r\n block.clear()\r\n else:\r\n conCount += 1\r\n block.add(letter)\r\n if (len(block) > 1 and conCount >= 3):\r\n isTypo = True\r\n newWord = insert(newWord, \" \", i + cutCount)\r\n cutCount += 1\r\n conCount = 1\r\n block.clear()\r\n block.add(letter)\r\nif (isTypo):\r\n print(newWord)\r\nelse:\r\n print(word)\r\n", "x=str(input())\r\nn,count,count1,ans=len(x),0,0,[0]*3001\r\nfor i in range(n):\r\n if x[i] in {\"a\",\"e\",\"i\",\"o\",\"u\"}:\r\n count=0\r\n else:\r\n count+=1\r\n if count==3:\r\n if x[i]==x[i-1]==x[i-2]: #not sure\r\n count=2\r\n else:\r\n ans[i-1]=1\r\n count=1\r\nfor i in range(n):\r\n print(x[i],end=\"\")\r\n if ans[i]==1:\r\n print(\" \",end=\"\")\r\n", "def consonant(char):\n\ta =['a','e','i','o','u']\n\tif ord(char) >= ord('b') and ord(char) <= ord('z') and char not in a:\n\t\treturn 1\n\treturn 0\ndef f(string,n):\n\tfor i in range(n-2):\n\t\tif consonant(string[i]) and consonant(string[i+1]) and consonant(string[i+2]):\n\t\t\tif string[i] != string[i+1] or string[i+1] != string[i+2]:\n\t\t\t\treturn 1\n\treturn 0\nstring =input()\nn =len(string)\nif len(string) < 3:\n\tprint (string)\n\tquit()\nelif not f(string,n):\n\tprint (string)\n\tquit()\n\nstart,i,ans=0,0,\"\"\nwhile(i < n-2):\n\tif consonant(string[i]) and consonant(string[i+1]) and consonant(string[i+2]):\n\t\tif string[i] != string[i+1] or string[i+1] != string[i+2]:\n\t\t\tans+=string[start:i+2]+\" \"\n\t\t\tstart,i =i+2,i+2\n\t\t\tcontinue\n\ti+=1\nans+=string[start:n]\nprint (ans)", "a = input()\r\n \r\ngl = 'aeiou'\r\nlas = 0\r\ni = 0\r\nwhile i < len(a) - 2:\r\n\ti += 1\r\n\t#print(str(i) + ' ' + a[i - 1 : i + 2])\r\n\tif a[i - 1] == a[i] and a[i] == a[i + 1]:\r\n\t\tcontinue\r\n\tif a[i] in gl or a[i - 1] in gl or a[i + 1] in gl:\r\n\t\tcontinue\r\n\ti += 1\r\n\tprint(a[las: i])\r\n\tlas = i\r\nprint(a[las:len(a)])", "# brownfox2k6\r\n\r\nimport sys\r\n\r\ns = input()\r\nvowels = \"aeiou\"\r\nspaces = []\r\n\r\ni = 1\r\nwhile i < len(s) - 1:\r\n if s[i-1] not in vowels\\\r\n and s[i] not in vowels\\\r\n and s[i+1] not in vowels\\\r\n and len(set(s[i-1:i+2])) != 1:\r\n spaces.append(i+1)\r\n i += 2\r\n else:\r\n i += 1\r\n\r\nind = 0\r\nfor i in range(len(s)):\r\n if ind < len(spaces) and spaces[ind] == i:\r\n sys.stdout.write(' ')\r\n ind += 1\r\n sys.stdout.write(s[i])", "s = input().lower()\r\n\r\nnotypos = s[0]\r\n\r\nvog = \"aeiou \"\r\n\r\nlast = \"\"\r\n\r\nfor i in range(1, len(s)):\r\n\tif s[i] not in vog:\r\n\t\tif i < len(s) - 1 and notypos[-1] not in vog and s[i+1] not in vog:\r\n\t\t\tif s[i] != notypos[-1] or s[i] != s[i+1]:\r\n\t\t\t\tnotypos += s[i] + \" \"\r\n\t\t\telse:\r\n\t\t\t\tnotypos += s[i]\r\n\t\telse:\r\n\t\t\tnotypos += s[i]\r\n\telse:\r\n\t\tnotypos += s[i]\r\n\r\n\r\nprint(notypos)", "s=input()\r\nl='aeiou'\r\ni=2\r\nwhile(i<len(s)):\r\n if(s[i]!=s[i-1] or s[i]!=s[i-2] or s[i-1]!=s[i-2]) and (s[i] not in l) and (s[i-1] not in l) and (s[i-2] not in l) :\r\n s=s[:i]+\" \"+s[i:]\r\n i+=2\r\n i+=1\r\nprint(s)", "import sys\ninput = sys.stdin.readline\n\ns = input().strip()\nn = len(s)\nc = {'a','e','i','o','u'}\nind = []\ni = 0\nwhile i <= n - 3:\n\tif (s[i] not in c) and (s[i+1] not in c) and (s[i+2] not in c):\n\t\tif s[i] == s[i+1] == s[i+2]:\n\t\t\ti += 1\n\t\t\tcontinue\n\t\telse:\n\t\t\tind.append(i+2)\n\t\t\ti +=2\n\telse:\n\t\ti += 1\nind = [0] + ind + [n]\nz = len(ind)\nfor i in range(z - 1):\n\tprint(s[ind[i]:ind[i+1]], end = \" \")\nprint()\n\n", "s = input()\r\n\r\ngl = ['a', 'i', 'e', 'o', 'u']\r\n\r\nt = []\r\ni = 0\r\nwhile i + 2 < len(s):\r\n good = 0\r\n if s[i] in gl or s[i + 1] in gl or s[i + 2] in gl or s[i] == s[i + 1] == s[i + 2]:\r\n good = 1\r\n \r\n t.append(s[i])\r\n if not good:\r\n t.append(s[i + 1])\r\n t.append(' ')\r\n i += 1\r\n i += 1\r\n\r\nwhile i < len(s):\r\n t.append(s[i])\r\n i += 1\r\n\r\nprint(''.join(t))\r\n", "s=input()\r\ni=0\r\nans=[]\r\nv='aeiou'\r\ndif=set()\r\nn=0\r\nwhile i < len(s):\r\n if s[i] not in v:\r\n dif.add(s[i])\r\n n+=1\r\n elif s[i] in v:\r\n dif=set()\r\n n=0\r\n if len(dif) > 1 and n > 2:\r\n ans.append(' ')\r\n dif=set([s[i]])\r\n n=1\r\n ans.append(s[i])\r\n i+=1\r\nprint(*ans,sep='')", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nimport random\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef check(s):\n x=[\"a\",\"e\",\"i\",\"o\",\"u\"]\n c=0\n f=0\n for i in range(len(s)):\n k=1\n for j in x:\n if(s[i]==j):\n c=0\n k=0\n if(k):\n c+=1\n if(len(set(s))>=2 and c==3):\n return (True,c)\n return (False,c)\n\ns=input().strip()\ns=list(s)\ni=0\nwhile(i<len(s)-2):\n if(check(s[i:i+3])[0]):\n \n for j in range(i,i+2):\n print(s[j],end=\"\")\n print(\" \",end=\"\")\n i+=2\n else:\n print(s[i],end=\"\")\n i+=1\nif(i<len(s)):\n for j in range(i,len(s)):\n print(s[j],end=\"\")\n", "s = input()\r\ns2 = s[0]\r\ngl = 'aeiou'\r\ncount = 0\r\nmark = 0\r\nif (s[0] not in gl):\r\n count = 1\r\nfor i in range(1, len(s)):\r\n if (s[i] not in gl):\r\n if (count >= 2):\r\n if (mark == 1 or s[i] != s[i - 1]):\r\n s2 += \" \"\r\n count = 1\r\n mark = 0\r\n else:\r\n if ((s[i] != s[i - 1]) and (s[i - 1] not in gl)):\r\n mark = 1\r\n count += 1\r\n else:\r\n count = 0\r\n mark = 0\r\n s2 += s[i]\r\nprint(s2)\r\n", "s = input()\r\nres = ''\r\nco = 0\r\nnorm = 1\r\nt = 'a'\r\nd = ['a','e','i','o','u']\r\nfor i in s:\r\n\tif i in d:\r\n\t\tco = 0\r\n\t\tt = 'a'\r\n\t\tnorm = 1\r\n\t\tres += i\r\n\telse:\r\n\t\tif (co >= 2 and (t != i or (not norm))):\r\n\t\t\tres += ' ' + i\r\n\t\t\tco = 1\r\n\t\t\tt = i\r\n\t\t\tnorm = 1\r\n\t\telse:\r\n\t\t\tco += 1\r\n\t\t\tnorm = (norm and (t == 'a' or t == i))\r\n\t\t\tt = i\r\n\t\t\tres += i\r\nprint(res)\r\n", "good = ['a', 'e', 'i', 'o', 'u']\ns = input().strip()\nans = []\nnw = ''\ni = 0\nwhile i < len(s) - 2:\n nw += s[i]\n if not (s[i] == s[i + 1] == s[i + 2]):\n if not (s[i] in good or s[i + 1] in good or s[i + 2] in good):\n nw += s[i + 1]\n ans.append(nw)\n i += 1\n nw = ''\n i += 1\nans.append(nw + s[i:])\nprint(' '.join(ans))\n", "s=input()\n\nglas='aeiou'\n\ni=1\n\nwhile i < len(s)-1:\n if s[i-1] not in glas and s[i] not in glas and s[i+1] not in glas:\n if s[i-1]!=s[i] or s[i]!=s[i+1] or s[i-1]!=s[i+1]:\n s=s[:i+1]+' '+s[i+1:]\n\n i+=3\n continue\n i+=1\nprint(s)\n\n\n\n", "word = input()\nvowels = ['a', 'e', 'i', 'o', 'u']\ncnt = []\nfor c in word:\n if c not in vowels:\n cnt.append(c)\n else:\n cnt = []\n if len(cnt) >= 3 and len(set(cnt)) != 1:\n print(' ', end='')\n cnt = [c]\n print(c, end='')\n \t\t \t \t\t \t \t \t\t \t\t\t\t\t\t\t \t", "# In this template you are not required to write code in main\r\n\r\n # Remember you were also a novice when you started,\r\n # hence never be rude to anyone who wants to learn something\r\n # Never open a ranklist untill and unless you are done with solving problems, wastes 3/4 minuts\r\n # Donot treat CP as a placement thing, love it and enjoy it, you will succeed for sure.\r\n\r\nimport sys\r\n# inf = float(\"inf\")\r\n\r\n# abc='abcdefghijklmnopqrstuvwxyz'\r\n# abd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nMOD,mod=1000000007,998244353\r\n# vow=['a','e','i','o','u']\r\n# dx,dy=[-1,1,0,0],[0,0,1,-1]\r\n# sys.setrecursionlimit(10000000)\r\n\r\n\r\n# from collections import deque, Counter, OrderedDict,defaultdict\r\n# from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace\r\n# from math import ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n# from bisect import bisect_left,bisect_right\r\n#import numpy as np\r\n\r\ndef get_array(): return list(map(int , sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\n\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nstring=input()\r\nn=len(string)\r\ni=0\r\nans=''\r\nvowel=['a','e','i','o','u']\r\nwhile i<n-2:\r\n if string[i] in vowel:\r\n ans+=string[i]\r\n i+=1\r\n else:\r\n if string[i]==string[i+1]==string[i+2]:\r\n ans+=string[i]\r\n i+=1\r\n else:\r\n if string[i+1] not in vowel and string[i+2] not in vowel:\r\n ans+=string[i]+string[i+1]+' '\r\n i+=2\r\n else:\r\n ans+=string[i]\r\n i+=1\r\nans+=string[i:]\r\nprint(ans)\r\n\r\n\r\n", "s = input()\r\nn = len(s)\r\ni = 0\r\nj = 0\r\nk = 0\r\nwhile i < n:\r\n if s[i] in ['a', 'e', 'i', 'o', 'u']:\r\n j = k = 0\r\n else:\r\n j += 1\r\n if j == 1:\r\n k = ord(s[i]) - ord('a')\r\n elif k != ord(s[i]) - ord('a'):\r\n k = 100\r\n if j >= 3 and k == 100:\r\n print(\" \", end=\" \")\r\n j = 1\r\n k = ord(s[i]) - ord('a')\r\n print(s[i], end=\"\")\r\n i += 1\r\nprint()# 1698072960.8896239", "s=input()\r\nn=len(s)\r\nyuan=['a','e','i','o','u']\r\ni=0\r\nans=[]\r\nwhile i<n-2:\r\n\tif not(s[i] in yuan) and not(s[i+1] in yuan) and not(s[i+2] in yuan) and not(s[i]==s[i+1]==s[i+2]):\r\n\t\tans.append(i+2)\r\n\t\ti+=1\r\n\ti+=1\r\npos=0\r\nfor i in ans:\r\n\tprint(s[pos:i],end=\" \")\r\n\tpos=i\r\nprint(s[pos:])", "\"\"\"http://codeforces.com/problemset/problem/858/C\"\"\"\nvowels = {'a', 'e', 'i', 'o', 'u'}\n\ndef longestValidBlock(word, startPos):\n lastCons = dict()\n for i in range(startPos, len(word)):\n if word[i] in vowels:\n lastCons = dict()\n else:\n lastCons.setdefault(word[i], 0)\n lastCons[word[i]] += 1\n s = sum(v for (k,v) in lastCons.items())\n if s >= 3 and len(lastCons) >= 2:\n return i\n return len(word)\n \nword = input()\nres = \"\"\nnextWordPos = 0\nwhile nextWordPos != len(word):\n startPos = nextWordPos\n nextWordPos = longestValidBlock(word,startPos)\n res += word[startPos:nextWordPos]\n if nextWordPos != len(word):\n res += \" \"\nprint(res) \n \n", "s = input()\r\nans = []\r\n\r\nstart = 0\r\nc = 0\r\nconst = set()\r\nfor i in range(len(s)):\r\n if s[i] in 'aeiou':\r\n const = set()\r\n c = 0\r\n else:\r\n c += 1\r\n const.add(s[i])\r\n if c>=3 and len(const) >= 2:\r\n ans.append(s[start:i])\r\n start = i\r\n const = set({s[i]})\r\n c = 1\r\nans.append(s[start:])\r\nprint(' '.join(ans))\r\n\r\n", "s = input()\r\nc = []\r\nans = ''\r\nfor i in s:\r\n if i in 'eioua':\r\n c = []\r\n else:\r\n c.append(i)\r\n if len(c) > 2 and len(set(c)) > 1:\r\n ans += ' '\r\n c = [i]\r\n ans += i\r\nprint(ans)\r\n\r\n", "s=input()\r\nans=s\r\ni=0\r\nvo=\"aeiou \"\r\nwhile i<len(ans)-2:\r\n\tif ans[i]==ans[i+1] and ans[i]==ans[i+2]:\r\n\t\ti+=1\r\n\t\tcontinue\r\n\tif ans[i] not in vo and ans[i+1] not in vo and ans[i+2] not in vo:\r\n\t\tans=ans[:i+2]+' '+ans[i+2:]\r\n\ti+=1\r\nprint(ans)", "def check(ch):\r\n return ch not in 'aeiou'\r\n\r\n\r\ns = input()\r\npos = []\r\ni = 0\r\nwhile i < len(s) - 2:\r\n a, b, c = s[i], s[i + 1], s[i + 2]\r\n if check(a) and check(b) and check(c) and not (a == b == c):\r\n pos.append(i + 2)\r\n i += 1\r\n i += 1\r\nans = ''\r\nfor i in range(len(s)):\r\n if i in pos:\r\n ans += ' '\r\n ans += s[i]\r\nprint(ans)\r\n", "n=input()\r\nk=0\r\nf=['a','e','i','o','u']\r\ns=\"\"\r\nfor i in range(len(n)) :\r\n if n[i] in f :\r\n k=0\r\n else :\r\n if k<2 :\r\n k+=1\r\n else :\r\n if n[i-2]==n[i-1]==n[i] :\r\n k+=1\r\n else :\r\n k=1\r\n s+=\" \"\r\n s+=n[i]\r\nprint(s)\r\n \r\n", "s = input()\r\nc = 'aeiou'\r\nans = \"@\"\r\ncn = 0 \r\nsm = 1\r\n\r\nfor i in s:\r\n if(i in c):\r\n cn = 0\r\n sm = 1\r\n elif(i == ans[-1]):\r\n sm += 1\r\n cn += 1\r\n elif(i != ans[-1]):\r\n cn += 1\r\n \r\n if(cn == sm or cn <3):\r\n ans += i\r\n elif(cn>2):\r\n ans += \" \"\r\n ans += i\r\n cn = 1\r\n sm = 1\r\n \r\nprint(ans[1:])", "s = input()\ngl = ['a', 'e', 'i', 'o', 'u']\nuk = 0\notv = \"\"\nfor i in range(len(s)):\n\tif s[i] in gl:\n\t\tuk = 0\n\t\totv += s[i]\n\telse:\n\t\tuk += 1\n\t\tif uk >= 3 and (s[i] != s[i - 1] or s[i] != s[i - 2]):\n\t\t\tuk = 1\n\t\t\totv += \" \" + s[i]\n\t\telse:\n\t\t\totv += s[i]\nprint(otv)\n", "s = input()\nn = len(s)\nalf = ['a','e','i','u','o']\ni = 0\nch = 0\nwhile i < n:\n\tif not s[i] in alf:\n\t\tch += 1\n\telse:\n\t\tch = 0\n\tif ch == 3:\n\t\tif not(s[i - 2] == s[i - 1] == s[i]):\n\t\t\tprint(' ',end = '')\n\t\t\tch = 1\n\t\telse:\n\t\t\tch = 2\n\tprint(s[i],end = '')\n\ti += 1", "import re\r\n\r\ndef change(s):\r\n res = ''\r\n while s:\r\n n = len(s)\r\n idx = 0\r\n while idx+1 < n and s[0] == s[idx+1]:\r\n idx += 1\r\n length = max(idx+1, 2)\r\n res += s[:length] + (' ' if length < n else '')\r\n s = s[length:]\r\n return res\r\n\r\nw = input()\r\nres, s = '', ''\r\nfor c in w:\r\n if c in 'aeiou':\r\n res += change(s)\r\n s = ''\r\n res += c\r\n else:\r\n s += c\r\nif s:\r\n res += change(s) \r\nprint(res)", "a=str(input())\r\nsgl=\"bcdfghjklmnpqrstvwxyz\"\r\nans=\"\"\r\nfor i in range(len(a)):\r\n ans+=a[i]\r\n if len(ans)>2:\r\n if sgl.count(ans[-1]) and sgl.count(ans[-2]) and sgl.count(ans[-3]) and (ans[-1]!=ans[-2] or ans[-1]!=ans[-3]):\r\n ans=ans[:-1]+\" \"+ ans[-1]\r\n\r\nprint(ans)", "gl = [\"a\", \"e\", \"i\", \"o\", \"u\"]\r\ndef mist(a, b, c):\r\n if a in gl or b in gl or c in gl:\r\n return False\r\n if a == b and b == c:\r\n return False\r\n return True\r\ns = input()\r\nn = len(s)\r\nif n == 1:\r\n print(s[0])\r\nelse:\r\n print(s[0] + s[1], end='')\r\n last1 = s[0]\r\n last2 = s[1]\r\n for i in range(2, n):\r\n now = s[i]\r\n if now in gl:\r\n print(now, end='')\r\n last1, last2 = last2, now\r\n continue\r\n if mist(last1, last2, now):\r\n print(\" \" + now, end='')\r\n last1 = \"a\"\r\n last2 = now\r\n else:\r\n print(now, end='')\r\n last1, last2 = last2, now\r\n ", "s = input()\r\nwords = ''\r\ng = 'aeiou'\r\n\r\n\r\ni=0\r\nwhile(len(s)>2):\r\n if((s[i] not in g)and(s[i+1] not in g)and(s[i+2]not in g)):\r\n if(s[i]==s[i+1]==s[i+2]):\r\n i+=1\r\n if(i==len(s)-2):\r\n break\r\n continue\r\n words+=s[:i+2]+' '\r\n s = s[i+2:]\r\n i=0\r\n else:\r\n i+=1\r\n if(i==len(s)-2):\r\n break\r\n \r\n\r\n\r\nprint(words+s)\r\n", "i = input()\r\nalp= [\"B\",\"C\",\"D\",\"F\",\"G\",\"H\",\"J\",\"K\",\"L\",\"M\",\"N\",\"P\",\"Q\",\"R\",\"S\",\"T\",\"V\",\"W\",\"X\",\"Y\",\"Z\"]\r\nres=''\r\nr=0\r\nfor j in range(len(i)) :\r\n if r>0:\r\n r-=1\r\n res+=i[j]\r\n continue\r\n if j!=0 and j!=len(i)-1:\r\n if (i[j].upper() in alp and i[j-1].upper() in alp and i[j+1].upper() in alp) and not (i[j-1]==i[j] and i[j]==i[j+1]):\r\n res+=(i[j]+' ')\r\n r=1\r\n continue\r\n else:\r\n res+=i[j]\r\n else: res+=i[j]\r\nprint(res)", "s = input()\r\nfl = False\r\nl1 = ''\r\nl2 = ''\r\nl = 0\r\ngl = {'a', 'e', 'i', 'o', 'u'}\r\nfor i in range(len(s)):\r\n if s[i] in gl:\r\n l1 = ''\r\n l2 = ''\r\n else:\r\n if l2 == '': \r\n l2 = s[i]\r\n continue\r\n elif l1 == '':\r\n l1 = s[i]\r\n continue\r\n elif s[i] == l2 and s[i] == l1:\r\n continue\r\n else:\r\n print(s[l:i] + ' ', end = '')\r\n l1 = ''\r\n l2 = s[i]\r\n l = i\r\nprint(s[l:])", "import sys,math,itertools\r\nfrom collections import Counter,deque,defaultdict\r\nfrom bisect import bisect_left,bisect_right \r\nfrom heapq import heappop,heappush,heapify, nlargest\r\nfrom copy import deepcopy\r\nmod = 10**9+7\r\nINF = float('inf')\r\ndef inp(): return int(sys.stdin.readline())\r\ndef inpl(): return list(map(int, sys.stdin.readline().split()))\r\ndef inpl_1(): return list(map(lambda x:int(x)-1, sys.stdin.readline().split()))\r\n\r\ns = sys.stdin.readline()\r\ns = s[:len(s)-1]\r\nboin = {'a','i','u','e','o'}\r\nspl = []\r\ntmp = []\r\npre = -1\r\nfor i,t in enumerate(s):\r\n now = t in boin\r\n if i == 0: pre = now; tmp.append(t); continue\r\n if pre != now:\r\n spl.append(tmp)\r\n tmp = []\r\n tmp.append(t)\r\n pre = now\r\nif tmp: spl.append(tmp)\r\n# print(spl)\r\nres = []\r\nfor st in spl:\r\n if st[0] in boin or len(set(st)) == 1:\r\n for x in st: res.append(x)\r\n continue\r\n tmp = []\r\n ans = []\r\n fr = pre = 0\r\n while fr < len(st):\r\n j = fr+1\r\n while j < len(st):\r\n if st[fr] != st[j]: break\r\n j += 1\r\n if j-fr >= 3:\r\n if fr != pre: ans.append(st[pre:fr])\r\n ans.append(st[fr:j])\r\n pre = j\r\n fr = j\r\n if pre != len(st): ans.append(st[pre:])\r\n for i,st in enumerate(ans):\r\n if i: res.append(' ')\r\n if len(set(st)) == 1:\r\n for x in st: res.append(x)\r\n else:\r\n for i,x in enumerate(st):\r\n if i!=0 and i%2 == 0:\r\n res.append(' ')\r\n res.append(x)\r\nprint(''.join(res))", "k = 0\r\nt = y = z = ''\r\nfor x in input():\r\n k = 0 if x in 'aeiou' else k + 1\r\n if k > 2 and not (x == y == z):\r\n t += ' '\r\n k = 1\r\n y, z = x, y\r\n t += x\r\nprint(t)", "# import atexit\r\n# import io\r\n# import sys\r\n#\r\n# _INPUT_LINES = sys.stdin.read().splitlines()\r\n# input = iter(_INPUT_LINES).__next__\r\n# _OUTPUT_BUFFER = io.StringIO()\r\n# sys.stdout = _OUTPUT_BUFFER\r\n#\r\n#\r\n# @atexit.register\r\n# def write():\r\n# sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n\r\n\r\ndef main():\r\n str = input() + \" \"\r\n\r\n vows = {'a', 'e', 'i', 'o', 'u'}\r\n\r\n idx = 0\r\n res = []\r\n\r\n while idx + 2 < len(str):\r\n if str[idx] not in vows and str[idx + 1] not in vows and str[idx + 2] not in vows and not str[idx] == str[idx + 1] == str[idx + 2]:\r\n res.append(str[idx:idx + 2])\r\n res.append(\" \")\r\n idx += 2\r\n else:\r\n res.append(str[idx])\r\n idx += 1\r\n\r\n print(\"\".join(res).rstrip())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\r\nc=s+''\r\na=[]\r\nb=['b', 'c', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'm', 'n', 'p', 'q', 'r', 's', 't', 'v', 'w', 'x', 'y', 'z']\r\nfor i in range(2,len(s)):\r\n if not(c[i-2]==c[i-1]==c[i]) and c[i-2] in b and c[i-1] in b and c[i] in b:\r\n a.append(i)\r\n c=c[:i-1]+'a'+c[i:]\r\nfor i in range(len(s)):\r\n if i in a:\r\n print(' '+s[i],end='')\r\n else:\r\n print(s[i],end='')\r\n", "a = input()\r\nnew = \"\"\r\nl = [ 'a', 'e', 'i', 'o', 'u']\r\ni = 0\r\n \r\nwhile i < len(a)-2:\r\n if a[i] in l:\r\n new += a[i]\r\n i += 1\r\n else:\r\n if a[i] == a[i+1] == a[i+2]:\r\n new += a[i]\r\n i += 1\r\n else:\r\n if a[i+1] not in l and a[i+2] not in l:\r\n new += a[i]+a[i+1]+\" \"\r\n i += 2\r\n else:\r\n new += a[i]\r\n i += 1\r\nfor i in range(i, len(a)):\r\n new += a[i]\r\nprint(new)\r\n", "s = input()\ns2 = ''\ngl = \"aeiou\"\ni = 0\nwhile(i < len(s)):\n s2 += s[i]\n if i + 2 < len(s):\n if not ((s[i] in gl) or (s[i + 1] in gl) or (s[i + 2] in gl)):\n if not(s[i] == s[i + 1] and s[i + 1] == s[i + 2]):\n s2 += s[i+1] + ' '\n i += 1\n i += 1\nprint(s2)\n", "s = list(input())\nsame = True\nblock = 0\nvowels = [\"a\", \"e\", \"i\", \"o\", \"u\"]\nspaces = []\nfor a in range(len(s)):\n if s[a] in vowels:\n block = 0\n same = True\n else:\n block += 1\n if block > 1 and s[a] != s[a-1]:\n same = False\n if block >= 3 and not same:\n spaces.append(a)\n block = 1\n same = True\n\nfor a in spaces[::-1]:\n s.insert(a, \" \")\n\nprint(\"\".join(s))\n\n\t\t\t \t\t \t \t \t \t \t\t\t \t", "t = 1\r\n# alf = \"abcdefghijklmnopqrstuvwxyz\"\r\nalfsog = \"bcdfghjklmnpqrstvwxyz\"\r\n\r\nfor qwe in range(t):\r\n \r\n # s = f.readline()[:-1]\r\n s = input()\r\n \r\n alfsog = set(alfsog)\r\n alf = alfsog\r\n listt = []\r\n \r\n flag = False\r\n \r\n for i in range(len(s)-2):\r\n if flag:\r\n flag = False\r\n continue\r\n if (s[i] == s[i+1] and s[i+1] == s[i+2]):\r\n continue\r\n elif (s[i] in alf) and (s[i+1] in alf) and (s[i+2] in alf):\r\n listt.append(i+2)\r\n flag = True\r\n continue\r\n \r\n listt.insert(0, 0)\r\n \r\n for i in range(len(listt)-1):\r\n print(s[listt[i]:listt[i+1]], end=\" \")\r\n print(s[listt[-1]:])", "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 = 10**9+7\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n\n\ndef main():\n cs = 'aeiou'\n s = S()\n tc = set()\n c = 0\n r = ''\n for k in s:\n if k in cs:\n tc = set()\n c = 0\n r += k\n continue\n c += 1\n tc.add(k)\n if c >= 3 and len(tc) >= 2:\n r += ' '\n c = 1\n tc = set([k])\n r += k\n\n return r\n\nprint(main())\n\n\n\n\n", "s=input()\r\nd=s[0]\r\na=[ 'a', 'e', 'i', 'o' , 'u']\r\ni=1\r\nwhile i<len(s)-1:\r\n d+=s[i]\r\n if (not(s[i] in a))&(not(s[i+1] in a))&(not(s[i-1] in a))&(not(s[i]==s[i+1]==s[i-1])):\r\n d+=' '+s[i+1]\r\n i+=1\r\n i+=1\r\nif i<len(s):\r\n d+=s[i]\r\nprint(d)\r\n", "s=input()\r\nk=0\r\ns1=''\r\ns2=['','','']\r\nfor a in s:\r\n if a=='a' or a=='e' or a=='i' or a=='o' or a=='u':\r\n s1+=a\r\n k=0\r\n else:\r\n if k+1==3:\r\n s2[2]=a\r\n if (s2[0]!=s2[1] or s2[0]!=s2[2]):\r\n s1=s1+' '+a\r\n k=1\r\n s2[0]=a\r\n else:\r\n k=2\r\n s1+=a\r\n else:\r\n s2[k] = a\r\n k+=1\r\n s1+=a\r\nprint(s1)", "input_str = input(\"\")\r\ninput_str_len = len(input_str)\r\n\r\nif input_str_len > 3000 or input_str_len < 1:\r\n print(\"-\")\r\nelse :\r\n vowels = {\"a\",\"e\",\"i\",\"o\",\"u\",\" \"}\r\n last_char = \"\"\r\n final_str = \"\"\r\n consecutive_consonants = 0\r\n consecutive_same_consonants_in_a_row = 0\r\n for v in input_str:\r\n final_str += last_char\r\n if v in vowels:\r\n consecutive_consonants = 0\r\n consecutive_same_consonants_in_a_row = 0\r\n else:\r\n if consecutive_consonants >= 2:\r\n if consecutive_same_consonants_in_a_row == 1 or last_char != v:\r\n final_str += \" \"\r\n consecutive_consonants = 0\r\n consecutive_same_consonants_in_a_row = 0\r\n if last_char == v:\r\n consecutive_same_consonants_in_a_row += 1\r\n else:\r\n consecutive_same_consonants_in_a_row = 1\r\n \r\n consecutive_consonants += 1\r\n last_char = v\r\n \r\n final_str += last_char\r\n print(final_str)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()\r\nn = len(s)\r\ncons = 0\r\nli = []\r\ndef isvowel(c):\r\n if(c=='a' or c=='e' or c=='i' or c=='o' or c=='u'):\r\n return 1\r\n else:\r\n return 0\r\n \r\nfor i in range(0,n):\r\n \r\n cons += (isvowel(s[i]) == 0)\r\n \r\n if isvowel(s[i]):\r\n cons = 0\r\n li.extend(s[i])\r\n else:\r\n \r\n if(cons == 3):\r\n if(s[i]==s[i-1] and s[i]==s[i-2]):\r\n cons -= 1\r\n li.extend(s[i])\r\n else:\r\n cons = 1\r\n li.extend([' ',s[i]])\r\n \r\n else:\r\n li.extend(s[i])\r\n\r\nprint(''.join(li))\r\n ", "a = input()\r\nk = 0\r\nS = \"\"\r\n\r\ni = 0\r\nwhile i != len(a):\r\n if (a[i] != \"a\") and (a[i] != \"e\") and (a[i] != \"i\") and (a[i] != \"o\") and (a[i] != \"u\"):\r\n if i + 2 < len(a):\r\n if (a[i + 1] != \"a\") and (a[i + 1] != \"e\") and (a[i + 1] != \"i\") and (a[i + 1] != \"o\")\\\r\n and (a[i + 1] != \"u\"):\r\n if (a[i + 2] != \"a\") and (a[i + 2] != \"e\") and (a[i + 2] != \"i\") and (a[i + 2] != \"o\")\\\r\n and (a[i + 2] != \"u\"):\r\n if (a[i] != a[i + 1]) or (a[i] != a[i + 2]):\r\n S = S + a[i] + a[i + 1] + \" \"\r\n i = i + 2\r\n else:\r\n S = S + a[i]\r\n i = i + 1\r\n else:\r\n S = S + a[i]\r\n i = i + 1\r\n else:\r\n S = S + a[i]\r\n i = i + 1\r\n else:\r\n S = S + a[i]\r\n i = i + 1\r\n else:\r\n S = S + a[i]\r\n i = i + 1\r\n\r\n\r\nprint(S)", "ans=input()\ni=0\nwhile i<len(ans)-2:\n if (ans[i]==ans[i+1] and ans[i]==ans[i+2]):\n i+=1\n continue\n if(ans[i] not in 'aeiou ' and ans[i+1] not in 'aeiou ' and ans[i+2] not in 'aeiou ' ):\n \n ans=ans[:i+2] + ' ' + ans[i+2:]\n i+=1\nprint(ans)\n\t\t \t \t \t\t \t\t \t\t\t\t\t \t", "ans=[]\r\ns1=input()\r\nc=prev=0\r\np=False\r\nfor i in range(len(s1)):\r\n if s1[i] in \"aeiou\":\r\n c=0\r\n p=False\r\n else:\r\n c+=1\r\n if c>1:\r\n if s1[i]!=s1[i-1]:\r\n p=True\r\n if c>=3 and p:\r\n ans.append(s1[prev:i])\r\n prev=i\r\n p=False\r\n c=1\r\n\r\nans.append(s1[prev:])\r\nprint(*ans)", "w = input()\r\nres, l = '', 0\r\nfor c in w:\r\n if c in 'aeiou':\r\n res += c\r\n l = 0\r\n else:\r\n if l>=2 and (res[-l] != c or res[-l+1] != c):\r\n res += ' ' + c\r\n l = 1\r\n else:\r\n res += c\r\n l += 1\r\nprint(res)", "s = input()\nvowels = ('a', 'e', 'u', 'o', 'i')\n\nres = ''\ni = 0\nwhile i < len(s) - 2:\n if s[i] not in vowels and s[i + 1] not in vowels and s[i + 2] not in vowels and s[i: i + 3] != s[i] * 3:\n res += s[i: i + 2] + ' '\n i += 2\n else:\n res += s[i]\n i += 1\nres += s[i:]\nprint(res)\n", "ch=str(input())\r\ni=0\r\nC=['a','e','i','u','o']\r\nif len(ch)<=2:\r\n print(ch)\r\nelse:\r\n while i<=len(ch)-3:\r\n if not(ch[i] in C) and not(ch[i+1] in C) and not(ch[i+2] in C) and (ch[i]!=ch[i+1] or ch[i]!=ch[i+2] or ch[i+1]!=ch[i+2]):\r\n ch=ch[0:i+2]+' '+ch[i+2:len(ch)]\r\n i=i+3\r\n else:\r\n i=i+1\r\n print(ch)\r\n \r\n \r\n", "s = input()\nans = ''\nvowels = {'a', 'e', 'i', 'o', 'u'}\nct = 0\nfor i in range(len(s)):\n if s[i] in vowels:\n ct = 0\n else:\n ct += 1\n if ct >= 3 and not (s[i] == s[i-1] == s[i-2]):\n ans += ' '\n ct = 1\n ans += s[i]\nprint(ans)\n\n\t\t\t \t \t \t\t\t \t\t\t \t\t \t\t \t\t\t\t", "v = {'a', 'e', 'i', 'o', 'u'}\r\nline = list(input())\r\nl = []\r\ns = []\r\nn = len(line)\r\nfor i in range(n):\r\n if line[i] not in v:\r\n s.append(line[i])\r\n #print(s)\r\n if len(s) >= 3 and len(set(s)) >= 2:\r\n l.append(' ')\r\n l.append(line[i])\r\n s = [line[i]]\r\n else:\r\n l.append(line[i])\r\n else:\r\n l.append(line[i])\r\n s = []\r\nprint(''.join(l))\r\n\r\n", "def glas(gl, s):\r\n if (s[0] in gl) or (s[1] in gl) or (s[2] in gl):\r\n return 1\r\n else:\r\n return 0\r\n\r\n \r\ndef right(gl, s):\r\n if (((s[0] == s[1]) and (s[0] == s[2])) or glas(gl, s)):\r\n return 1\r\n else:\r\n return 0\r\n \r\n\r\ns = input()\r\ni = len(s)\r\ngl = 'aeoiu'\r\nk = 0\r\nwhile ( k <= (i - 3) ):\r\n s1 = s[k:k+3]\r\n if not right(gl, s1):\r\n s = s[:(k + 2)] + ' ' + s[(k + 2):]\r\n i += 1\r\n k += 3\r\n else:\r\n k += 1\r\nprint(s)\r\n \r\n", "st = input()\r\nk = 0\r\ni = 0\r\nwhile i < len(st):\r\n if not (st[i] in ['a', 'e', 'i', 'o', 'u']):\r\n if k < 3:\r\n k += 1\r\n else:\r\n k = 0\r\n if k == 3:\r\n if not(st[i] == st[i-1] == st[i-2]):\r\n st = st[:i] + ' ' + st[i::]\r\n k = 1\r\n i += 1\r\n i += 1\r\nprint(st)\r\n \r\n", "import sys\r\ns = input()\r\np = [0] * 30000\r\ni = 0\r\nwhile i < len(s) - 2:\r\n if s[i] not in 'aeiou' and s[i + 1] not in 'aeiou' and s[i + 2] not in 'aeiou' and (s[i] != s[i + 1] or s[i] != s[i + 2]):\r\n p[i + 1] = 1\r\n i += 2\r\n else:\r\n i += 1\r\nans = ''\r\nfor i in range(len(s)):\r\n ans += s[i]\r\n if p[i]:\r\n ans += ' '\r\nprint(ans)", "s = input()\r\nn = len(s)\r\nif n==1 or n==2:\r\n print(s)\r\nelse:\r\n a = ['a','e','i','o','u']\r\n q,w = '',''\r\n if s[0] not in a:\r\n q = s[0]\r\n if s[1] not in a:\r\n w = s[1]\r\n res = s[:2]\r\n for i in range(2,n):\r\n e = s[i]\r\n if e not in a:\r\n if q!='' and w!='':\r\n if q==w==e:\r\n q=w\r\n res+=e\r\n else:\r\n res+=' '+e\r\n q,w='',e\r\n else:\r\n q,w = w,e\r\n res+=e\r\n else:\r\n res+=e\r\n q,w = '',''\r\n print(res)", "a = input()\r\nb = []\r\nl = 0\r\nfor i in range(len(a)):\r\n if a[i] != 'a' and a[i] != 'e' and a[i] != 'i' and a[i] != 'o' and a[i] != 'u':\r\n if l < 2:\r\n l += 1\r\n else:\r\n if a[i] != a[i - 1] or a[i] != a[i - 2]:\r\n l = 1\r\n b.append(' ')\r\n else:\r\n l = 0\r\n b.append(a[i])\r\nprint(''.join(map(str, b)))", "s = input()\r\ns2 = s1 = ''\r\nl1 = {'a', 'e', 'i', 'o', 'u'}\r\nk = 0\r\nfor i in range(len(s)):\r\n if s[i] not in l1:\r\n if k == 2:\r\n if s[i] != s[i-1] or s[i-1] != s[i-2]:\r\n print(s1 + ' ', end = '', sep = '')\r\n s1 = s[i]\r\n k = 1\r\n else:\r\n s1 += s[i] \r\n else:\r\n k += 1\r\n s1 += s[i]\r\n else:\r\n k = 0\r\n s1 += s[i]\r\nprint(s1)", "vowels=set(['a','e','i','o','u'])\r\nword=list(input())\r\nanswer=\"\"\r\ni=0\r\nwhile(i<len(word)-2):\r\n # print(i)\r\n if(word[i] in vowels or word[i+1] in vowels or word[i+2] in vowels):\r\n answer+=word[i]\r\n i+=1\r\n continue\r\n elif(word[i]==word[i+1]==word[i+2]):\r\n answer+=word[i]\r\n i+=1\r\n continue\r\n else:\r\n answer+=word[i]\r\n answer+=word[i+1]\r\n i=i+2\r\n answer+=\" \"\r\n\r\nwhile(i<len(word)):\r\n answer+=word[i]\r\n i+=1\r\nprint(answer)", "def f(x): \r\n return x not in 'aeiou'\r\n\r\ns, res = input(), ''\r\ni = 0\r\nwhile i < len(s)-2:\r\n if f(s[i]) and f(s[i+1]) and f(s[i+2]) and \\\r\n (s[i] != s[i+1] or s[i+1] != s[i+2]):\r\n res += s[i] + s[i+1] + ' '\r\n i += 2\r\n else:\r\n res += s[i]\r\n i += 1\r\nres += s[i:]\r\nprint(res)\r\n", "s = input()\r\na = []\r\nvolumes = ['a', 'e', 'i', 'o', 'u']\r\ni = 0\r\nf = 0\r\nwhile i + 2 < len(s):\r\n if s[i] not in volumes and s[i + 1] not in volumes and s[i + 2] not in volumes and (s[i] != s[i + 1] or s[i] != s[i + 2] or s[i + 1] != s[i + 2]):\r\n a.append(s[f:i + 2])\r\n f = i + 2\r\n i += 2\r\n continue\r\n i += 1\r\nif len(a) == 0:\r\n print(s)\r\nelse:\r\n a.append(s[f:len(s)])\r\n print(\" \".join(a))", "# cf 858/C\n# 1500\ndef f(s):\n cons = [True] * 26\n for c in ('a', 'e', 'i', 'o', 'u'):\n cons[ord(c) - ord('a')] = False\n\n out = []\n n = len(s)\n count = 0\n wsize = 0\n for i in range(n):\n c = s[i]\n if wsize == 3:\n prev = s[i - wsize]\n if cons[ord(prev) - ord('a')]:\n count -= 1\n wsize -= 1\n if cons[ord(c) - ord('a')]:\n count += 1\n wsize += 1\n if count == 3 and not (s[i - 2] == s[i - 1] and s[i - 1] == s[i]):\n out.append(' ')\n while count != 1:\n prev = s[i - wsize + 1]\n assert cons[ord(prev) - ord('a')]\n count -= 1\n wsize -= 1\n\n out.append(c)\n return \"\".join(out)\n\nassert f(\"hellno\") == \"hell no\"\nassert f(\"abacaba\") == \"abacaba\"\nassert f(\"asdfasdf\") == \"asd fasd f\"\nassert f(\"yhlj\") == \"yh lj\"\n#assert f(\"orfyaenanabckumulsboloyhljhacdgcmnooxvxrtuhcslxgslfpnfnyejbxqisxjyoyvcvuddboxkqgbogkfz\") == \"orf yaenanabc kumuls boloyh lj hacd gc mnooxv xr tuhc sl xg sl fp nf nyejb xqisx jyoyv cvudd boxk qg bogk fz\"\ns = input()\nans = f(s)\nprint(ans)\n", "import sys\n\nvowels = set(['a', 'e', 'i', 'o', 'u'])\nword = sys.stdin.readline().rstrip('\\n')\n\ncorrect = []\ncurr = []\ncons = []\nfor i in range(len(word)):\n\tif word[i] in vowels:\n\t\tcurr.append(word[i])\n\t\tcons = []\n\telse:\n\t\tcons.append(word[i])\n\t\tif len(set(cons)) != 1 and len(cons) > 2:\n\t\t\tcurr = ''.join(curr)\n\t\t\tcorrect.append(curr)\n\t\t\tcurr = []\n\t\t\tcons = [cons[-1]]\n\t\tcurr.append(word[i])\n\nif len(curr) > 0:\n\tcorrect.append(''.join(curr))\n\nsys.stdout.write(' '.join(correct) + '\\n')", "s = input()\r\n\r\nalphabet = 'aeiou'\r\n\r\nresult = []\r\n\r\nstart = 0\r\ni = 0\r\nc = 0\r\nstack = set()\r\nwhile i < len(s):\r\n if s[i] not in alphabet:\r\n c += 1\r\n stack.add(s[i])\r\n else:\r\n c = 0\r\n stack.clear()\r\n\r\n if c >= 3:\r\n # print(set(list(s[i - c + 1:i + 1])))\r\n if len(stack) != 1:\r\n result.append(s[start:i])\r\n start = i\r\n c = 1\r\n stack = {s[i]}\r\n i += 1\r\nresult.append(s[start: i])\r\nprint(*result)\r\n", "vow = ['a', 'e', 'i', 'o', 'u']\nstr = input()\n\ni = 0\nwhile True:\n if i + 3 > len(str):\n break\n found = True\n for j in range(i, i + 3):\n if str[j] in vow:\n found = False\n break\n if found:\n if str[i] != str[i + 1] or str[i] != str[i + 2]:\n str = str[0:i + 2] + ' ' + str[i + 2:]\n i = i + 3\n continue\n i += 1\n\nprint(str)\n", "checking = input()\nvowels = [\"a\",\"e\",\"i\",\"o\",\"u\"]\nstreak = []\nnew = \"\"\nfor i,letter in enumerate(checking):\n # print(streak)\n if letter not in vowels:\n streak.append(letter)\n else:\n streak = []\n if len(streak) == 3:\n if streak.count(letter) == 3:\n streak = [letter, letter]\n else:\n streak = [letter]\n new += \" \"\n new += letter\nprint(new)\n", "s = input()\ncheck = \"aeiou\"\ni = 2\narr = \"\"\narr2 = \"\"\nj = 0\nwhile i<len(s):\n\tif (s[i-1] not in check) and (s[i-2] not in check) and (s[i] not in check):\n\t\tif(s[i]!=s[i-1] or s[i-1]!=s[i-2] or s[i]!=s[i-2]):\n\t\t\t\tarr += s[j:i]\n\t\t\t\tarr += \" \"\n\t\t\t\tj = i\n\t\t\t\ti = i+1\n\ti+=1\narr += s[j:i]\n\n\n\ni = 2\nj = 0\ns2 = s[::-1]\n\nwhile i<len(s2):\n\tif (s2[i-1] not in check) and (s2[i-2] not in check) and (s2[i] not in check):\n\t\tif(s2[i]!=s2[i-1] or s2[i-1]!=s2[i-2] or s2[i]!=s2[i-2]):\n\t\t\t\tarr2 += s2[j:i]\n\t\t\t\tarr2 += \" \"\n\t\t\t\tj = i\n\t\t\t\ti = i+1\n\ti+=1\n\t\narr2 += s2[j:i]\narr2 = arr2[::-1]\n#print(arr)\n#print(arr2)\nif(len(arr)<len(arr2)):\n\tprint(arr)\nelse:\n\tprint(arr2)\n", "from os import path;import sys,time\r\nmod = int(1e9 + 7)\r\nfrom math import ceil, floor,gcd,log,log2 ,factorial,sqrt\r\nfrom collections import defaultdict ,Counter , OrderedDict , deque;from itertools import combinations,permutations\r\nfrom string import ascii_lowercase ,ascii_uppercase\r\nfrom bisect import *;from functools import reduce;from operator import mul;maxx = float('inf')\r\nI = lambda :int(sys.stdin.buffer.readline())\r\nlint = lambda :[int(x) for x in sys.stdin.buffer.readline().split()]\r\nS = lambda: sys.stdin.readline().strip('\\n')\r\ngrid = lambda r :[lint() for i in range(r)]\r\nlocalsys = 0\r\nstart_time = time.time()\r\n#left shift --- num*(2**k) --(k - shift)\r\nnCr = lambda n, r: reduce(mul, range(n - r + 1, n + 1), 1) // factorial(r)\r\ndef ceill(n,x):\r\n return (n+x -1 )//x\r\nT =0\r\ndef ok(se):\r\n\tfor i in se:\r\n\t\tif i in 'aeiou':\r\n\t\t\treturn False\r\n\treturn True\r\n\r\ndef solve():\r\n\ts = S()\r\n\tN , ans, prev , i = len(s) , [] , 0 , 0\r\n\twhile i < N-2:\r\n\t\tse = {s[i], s[i+1] , s[i+2]}\r\n\t\tif len(se) > 1 and ok(se):\r\n\t\t\ti+=1\r\n\t\t\tans.append(s[prev:i+1])\r\n\t\t\tprev = i +1\r\n\t\ti+=1\r\n\tif prev != N:\r\n\t\tans.append(s[prev:N])\r\n\tprint(' '.join(ans))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef run():\r\n if (path.exists('input.txt')):\r\n sys.stdin=open('input.txt','r')\r\n sys.stdout=open('output.txt','w')\r\n\r\n\r\nrun()\r\nT = I() if T else 1\r\nfor _ in range(T):\r\n solve()\r\n\r\n\r\nif localsys:\r\n print(\"\\n\\nTime Elased :\",time.time() - start_time,\"seconds\")\r\n\r\n\r\n", "s=input()\r\nt=\"\"\r\nn=len(s)\r\nans=[]\r\narr=['a','e','i','o','u']\r\nif(n<3):\r\n print(s)\r\nelse:\r\n i=0\r\n while(i<n-2):\r\n\r\n p=[s[i],s[i+1],s[i+2]]\r\n # print(p)\r\n if(len(set(p))==1):\r\n ans.append(s[i])\r\n i+=1\r\n else:\r\n if(s[i] not in arr and s[i+1] not in arr and s[i+2] not in arr):\r\n ans.append(s[i])\r\n ans.append(s[i+1])\r\n r=\" \"\r\n ans.append(r)\r\n i+=2\r\n # print(t)\r\n else:\r\n ans.append(s[i])\r\n i+=1\r\n\r\n for j in range(i,n):\r\n ans.append(s[j])\r\n for i in ans:\r\n t+=i\r\n print(t)\r\n", "s = input()\r\nop = []\r\ndl = len(s)\r\ni = 2\r\ngl = {'a','e','i','o','u'}\r\nl = -1\r\nwhile i<dl:\r\n if s[i-2] not in gl and s[i-1] not in gl and s[i] not in gl and s[i-2:i+1]!=s[i-2]*3:\r\n if l==-1:\r\n l = i-2\r\n elif l!=-1:\r\n op.append(str(l)+'-'+str(i-1))\r\n l = -1\r\n i+=1\r\nelse:\r\n if l!=-1:\r\n op.append(str(l)+'-'+str(i-1))\r\ndlo = len(op)\r\nfor i in range(dlo-1,-1,-1):\r\n l = int(op[i][:op[i].find('-')])\r\n r = int(op[i][op[i].find('-')+1:])\r\n st = s[l:r+1]\r\n dl = len(st)\r\n st1 = ''\r\n for j in range(0,dl,2):\r\n st1+=st[j]\r\n if j<dl-1:\r\n st1+=st[j+1]\r\n if j<dl-2:\r\n st1+=' '\r\n s = s[:l]+st1+s[r+1:]\r\nprint(s)\r\n", "a = input()\r\nans = ''\r\nb = ['a', 'e', 'i', 'o', 'u']\r\nfl = 0\r\nfor i in range(len(a)):\r\n\tif a[i] in b:\r\n\t\tans+=a[i]\r\n\t\tfl = 0\r\n\telse:\r\n\t\tfl += 1\r\n\t\tif fl > 2 and (a[i] != a[i-fl+1] or a[i] != a[i-fl+2]):\r\n\t\t\tans+=' '+a[i]\r\n\t\t\tfl = 1\r\n\t\telse:\r\n\t\t\tans += a[i]\r\nprint(ans)\r\n", "s = input()\n\nvowels = \"aeiou\"\nns = \"\"\nblurb = \"\"\n\nfor c in s: \n if c in vowels:\n blurb = \"\"\n else:\n blurb += c\n\n if len(blurb) == 3:\n if blurb.count(c) != 3: \n blurb = c\n ns += \" \" \n else:\n blurb = c + c # same guy \n ns += c\n\nprint(ns)\n \n", "vowels = ['a', 'e', 'i', 'o', 'u']\r\n\r\ndef skip_vowels(s, i):\r\n while i < len(s) and s[i] in vowels:\r\n i = i + 1\r\n return i\r\n\r\nss = input()\r\npre, cur = 0, 0\r\nans = []\r\nwhile cur < len(ss):\r\n cur = skip_vowels(ss, cur)\r\n flag = 0\r\n while cur + 1 < len(ss) and ss[cur] == ss[cur + 1]:\r\n cur = cur + 1\r\n flag = 1\r\n\r\n if flag and cur + 1 < len(ss) and ss[cur + 1] not in vowels:\r\n ans.append(ss[pre:cur + 1])\r\n pre = cur + 1\r\n cur = cur + 1\r\n elif flag and cur + 1 < len(ss) and ss[cur] != ss[cur + 1] and ss[cur + 1] in vowels:\r\n cur = cur + 1\r\n elif flag == 0 and cur + 1 < len(ss) and ss[cur + 1] in vowels:\r\n cur = cur + 1\r\n elif flag == 0 and cur + 2 < len(ss) and ss[cur + 1] not in vowels and ss[cur + 2] in vowels:\r\n cur = cur + 2\r\n elif flag == 0 and cur + 2 < len(ss) and ss[cur + 1] not in vowels and ss[cur + 2] not in vowels:\r\n ans.append(ss[pre:cur + 2])\r\n pre = cur + 2\r\n cur = cur + 2\r\n else:\r\n cur = cur + 1\r\nans.append(ss[pre:cur])\r\nfor i in ans:\r\n print(i, end = ' ')\r\n\r\n", "result, seq, same, prev = [], 0, True, ''\r\nfor i in input():\r\n seq = 0 if i in 'aeiou' else seq + 1\r\n same = seq == 1 or (same and (i == prev))\r\n prev = i\r\n if seq >= 3 and not same:\r\n result.append(' ')\r\n seq, same = 1, True\r\n result.append(i)\r\nprint(''.join(result))", "def check3x(s):\r\n if (s==s[0]*len(s)) or (len(s)<3):\r\n return True\r\n return False\r\n\r\ns=input()\r\nc=''\r\na=s\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i] in 'uioea':\r\n c=''\r\n continue\r\n c+=s[i]\r\n if (not check3x(c)) and (c in a):\r\n x=i+k\r\n k+=1\r\n a=a[:x]+' '+a[x:]\r\n c=c[-1]\r\n\r\nprint(a)\r\n\r\n", "a = input()\r\ngl = set(['a', 'e', 'i', 'o', 'u'])\r\ncn = [0] * (200 + 1)\r\nans = []\r\nfor i in range(len(a)):\r\n if a[i] in gl:\r\n for i1 in range(ord('a'), ord('z') + 1):\r\n cn[i1] = 0\r\n continue\r\n cn[ord(a[i])] += 1\r\n st = set()\r\n cnt = 0\r\n for j in range(ord('a'), ord('z') + 1):\r\n if (chr(j) in gl) or cn[j] == 0:\r\n continue\r\n cnt += cn[j]\r\n st.add(j)\r\n if len(st) > 1 and cnt >= 3:\r\n ans.append(i)\r\n for i1 in range(ord('a'), ord('z') + 1):\r\n cn[i1] = 0\r\n cn[ord(a[i])] += 1\r\n break\r\nfor i in range(len(a)):\r\n if i in ans:\r\n print(' ', end='')\r\n print(a[i], end='')\r\n", "n = input()\nl = 0\nq = len(n)\nsogl = ['q', 'w', 'r', 't', 'y', 'p', 's', 'd', 'f', 'g', 'h', 'j', 'k', 'l', 'z', 'x', 'c', 'v', 'b', 'n', 'm']\nfor i in range(1, len(n) - 1):\n\tif (((n[i - 1] != n[i + 1]) or ((n[i] != n[i - 1]) and (n[i-1] == n[i + 1]))) and (n[i - 1] in sogl) and (n[i] in sogl) and (n[i + 1] in sogl)):\n\t\tprint (n[l:i + 1:1], end=\" \")\n\t\tl = i + 1\n\t\tn = n[0:i] + 'a' + n[i + 1:q]\n\t\t\nprint (n[l:len(n):1])\n", "def is_vowel(ch):\r\n return ch in 'ieaou'\r\n\r\ndef main():\r\n word = input()\r\n consonant_count = 0\r\n \r\n for i in range(len(word)):\r\n if is_vowel(word[i]):\r\n consonant_count = 0\r\n else:\r\n consonant_count += 1\r\n \r\n if consonant_count >= 3:\r\n if word[i] != word[i - 1] or word[i] != word[i - 2]:\r\n print(' ', end = '')\r\n consonant_count = 1\r\n \r\n print(word[i], end = '')\r\n \r\nmain()", "def fix_typo_word(s):\r\n n = len(s)\r\n breaks = [False] * n\r\n vowels = set({'a', 'e', 'i', 'o', 'u'})\r\n streak = 1 if s[0] not in vowels else 0\r\n numdiff = streak\r\n for i in range(1, n):\r\n if s[i] not in vowels:\r\n streak += 1\r\n if s[i] != s[i - 1]:\r\n numdiff += 1\r\n else:\r\n streak = 0\r\n numdiff = 0\r\n if streak >= 3 and numdiff >= 2:\r\n breaks[i] = True\r\n streak = 1\r\n numdiff = 1\r\n\r\n result = \"\"\r\n for i in range(n):\r\n if breaks[i]:\r\n result += \" \"\r\n result += s[i]\r\n return result\r\n\r\nword = input().strip()\r\nfixed_word = fix_typo_word(word)\r\nprint(fixed_word)\r\n", "s = input()\r\ng = {'a', 'e', 'i', 'o', 'u'}\r\nl = 0\r\n\r\nlc1 = \"\"\r\nlc2 = \"\"\r\nfor ch in s:\r\n if ch not in g: l+=1\r\n else: l=0\r\n if l>2 and not (ch==lc1==lc2):\r\n print(\" \", end=\"\")\r\n l = 1\r\n lc2 = lc1\r\n lc1 = ch\r\n print(ch, end=\"\")", "s = input()\r\ngl = ['a', 'e', 'i', 'o', 'u']\r\nuk = 0\r\notv = \"\"\r\nfor i in range(len(s)):\r\n\tif s[i] in gl:\r\n\t\tuk = 0\r\n\t\totv += s[i]\r\n\telse:\r\n\t\tuk += 1\r\n\t\tif uk >= 3 and (s[i] != s[i - 1] or s[i] != s[i - 2]):\r\n\t\t\tuk = 1\r\n\t\t\totv += \" \" + s[i]\r\n\t\telse:\r\n\t\t\totv += s[i]\r\nprint(otv)", "string = input()\r\nl = len(string)\r\nstring += \" \"\r\nconsonents = \"bcdfghjklmnpqrstvwxyz\"#['b','c','d','f','g','h','j','k','l','m','n','p','q','r','s','t','v','w','x','y','z']\r\nvowels = \"aeiou\"#['a','e','i','o','u']\r\noutput = ''\r\nif len(string) < 3:\r\n\tprint(string)\r\nelse:\r\n\ti = 0\r\n\twhile i < l:\r\n\t\t#print(string[i], string[i + 1], string[i + 2])\r\n\t\tif string[i] in vowels or string[i + 1] in vowels or string[i + 2] in vowels:\r\n\t\t\toutput += string[i]\r\n\t\t\ti += 1\r\n\t\telif string[i] == string[i + 1] == string[i + 2]:\r\n\t\t\toutput += string[i]\r\n\t\t\ti += 1\r\n\t\telif string[i] != string[i + 1] or string[i + 1] != string[i + 2] or string[i] != string[i + 2] or string[i] != string[i + 1] != string[i + 2]:\r\n\t\t\toutput += string[i] + string[i + 1] + \" \"\r\n\t\t\ti += 2\r\n\t\t\r\n\t\t#print(output)\r\nprint(output.strip())", "s=input()\r\nt=\"aeiou\"\r\ni=0\r\nwhile i<len(s)-2 :\r\n if s[i] not in t and s[i+1] not in t and s[i+2] not in t and len(set(s[i:i+3]))>1:\r\n s=s[:i+2]+\" \"+s[i+2:]\r\n #s.insert(i+2,\" \")\r\n i+=3\r\n else:\r\n i+=1\r\nprint(s)\r\n#print(\"\".join(s))\r\n\r\n\r\n\r\n" ]

[ "n = input()\r\nstol = input()\r\nstol = stol.split(' ')\r\nnums = {}\r\nfor i in range(0,len(stol)):\r\n nums[stol[i]] = [i, len(stol)-i]\r\ndif = []\r\nmax = -1\r\nimax = 0\r\nfl = 0\r\nfor num in nums:\r\n if max<nums[num][1]:\r\n max = nums[num][1]\r\n imax = num\r\nprint(imax)", "from functools import reduce\r\n\r\nn = int(input())\r\ndic = {}\r\na = list(map(int, input().split()))\r\nfor i in range(n):\r\n dic[a[i]] = i\r\n\r\narr = []\r\n\r\nfor i in dic:\r\n arr.append((dic[i], i))\r\n\r\narr.sort()\r\n\r\nprint(arr[0][1])", "k = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nlast = dict()\r\n\r\nfor index in range(k):\r\n item = arr[index]\r\n last[item] = index\r\n\r\nprint(min(list(last.items()), key= lambda x: x[1])[0])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i, b in enumerate(a): d[b] = i\r\nM = min(d.values())\r\nfor k, v in d.items():\r\n if v == M:\r\n print(k)\r\n break", "from collections import deque\r\n\r\nused = [0]*1000000\r\na = deque()\r\nn = int(input())\r\nfor i in input().split(' '):\r\n a.append(int(i))\r\n used[int(i)] += 1\r\ni = a.popleft()\r\nwhile (used[i] != 1):\r\n used[i] -= 1\r\n i = a.popleft()\r\nprint(i)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmyset = set()\r\nans = a[-1]\r\nfor x in a[::-1]:\r\n if x not in myset:\r\n ans = x\r\n myset.add(x)\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [0]*(max(a)+1)\r\nk = len(set(a))\r\nt = 0\r\np = 0\r\nfor i in range (n):\r\n b[a[i]] = n-i\r\n \r\nprint (b.index(max(b))) ", "n=input()\nar=list(map(int,input().split()))\nd=dict()\ni=0\nfor x in ar:\n d[x]=i\n i+=1\nmn,mnel=float('inf'),0\nfor el in d.keys():\n if d[el] < mn:\n mnel=el\n mn=d[el]\nprint(mnel)", "n = int(input())\r\na = list(map(int, input().split()))[::-1]\r\nvis = [False] * 300000\r\nans = -1\r\nfor x in a:\r\n if not vis[x]:\r\n vis[x] = True\r\n ans = x\r\nprint(ans)", "n = int(input())\na = [int(i) for i in input().split()]\nx={}\ny=-1\nfor j in range(n):\n\tif a[n-j-1] not in x:\n\t\tx[a[n-j-1]]=1\n\t\ty=a[n-j-1]\nprint(y)", "n = int(input())\r\ncofas = list(map(int, input().split()))[::-1]\r\nprint(list({}.fromkeys(cofas).keys())[-1])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=len(set(l))\r\nd=set()\r\nl=l[::-1]\r\nfor i in range(n):\r\n d.add(l[i])\r\n if(len(d)==s):\r\n print(l[i])\r\n break\r\n\r\n", "n = int(input())\r\nd = dict()\r\na = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n d[a[i]] = i\r\nans = -1\r\nm = 10 ** 7\r\nfor i in d.keys():\r\n if d[i] < m:\r\n ans = i\r\n m = d[i]\r\nprint(ans)\r\n", "import sys,math\nsys.setrecursionlimit(10**8)\n'''\ndef fun():\n for i in range(16):\n for j in range(4):\n if i&(1<<j):\n print(j,end='')\n print()\nimport binarytree\nfrom collections import deque\nbst = binarytree.tree(height=4,is_perfect=True)\nprint(bst)\ndef s(bst):\n if bst:\n bst.left,bst.right = bst.right,bst.left\n s(bst.right)\n s(bst.left)\ns(bst)\nprint(bst)\n'''\nt = int(input())\narr = list(map(int,input().split()))\narr = arr[::-1]\nd = {i:0 for i in set(arr)}\nl = len(d)\nfor i in arr:\n if d[i] == 0:\n d[i]+=1\n if l == 1:\n print(i)\n l-=1\n else:\n d[i]+=1\n", "def main():\n n_visits = int(input())\n visits = [int(_) for _ in input().split()]\n last = {}\n\n for i in range(n_visits):\n last[visits[i]] = i\n\n print(visits[min(last.values())])\n\n\nif __name__ == '__main__':\n main()\n", "n, a = int(input()), (int(i) for i in input().split())\nlast, res, longest = {e: i for i, e in enumerate(a)}, 0, 0\nfor e, i in last.items():\n if n - i > longest:\n res, longest = e, n - i\nprint(res)\n", "length = int(input());\r\ncanteens = list(map(int, input().split(' ')));\r\n\r\nlast = canteens[-1];\r\narray = set();\r\n\r\nfor i in range(length - 1, -1, -1):\r\n if canteens[i] not in array:\r\n array.add(canteens[i]);\r\n last = i;\r\n \r\nprint(canteens[last]);", "n = int(input())\r\ncafes = input()\r\ndic = {}\r\nindex = 0\r\nlistOfSeq = cafes.split(' ')\r\nuniqueCafes = set(listOfSeq)\r\nfor x in uniqueCafes:\r\n dic.update({x: 0})\r\nfor y in listOfSeq:\r\n dic[y] = index\r\n index += 1\r\n\r\nprint(min(dic, key=dic.get))", "n = int(input())\r\na = list(map(int, input().split()))[::-1]\r\ns = set()\r\nc = -1\r\nfor x in a:\r\n if x not in s:\r\n c = x\r\n s.add(x)\r\nprint(c)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb={}\r\nfor i in range(n):\r\n b[a[i]]=i\r\nmi=300000\r\nfor i in b:\r\n if b[i]<mi:\r\n mi=b[i]\r\n ans=i\r\nprint(ans)\r\n", "n = int(input())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\n\r\nx = set(arr)\r\narr = arr[::-1]\r\ny = set()\r\nfor i in arr:\r\n y.add(i)\r\n if len(y) == len(x):\r\n print(i)\r\n break", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set()\r\nfor i in range(n):\r\n if a[i] not in s:\r\n s.add(a[i])\r\nfor i in range(n - 1, -1, -1):\r\n if a[i] in s:\r\n s.remove(a[i])\r\n if len(s) == 0:\r\n print(a[i])\r\n break\r\n \r\n", "count = int(input())\ndiary = list(map(int, input().split()))\n\noldest = diary[-1]\nvisited = set([oldest])\nfor record in reversed(diary[:-1]):\n if record not in visited:\n oldest = record\n visited.add(oldest)\n\nprint(oldest)\n", "N = int(input())\r\n\r\ncafes = list(map(int,input().split()))\r\n\r\nindices = set(cafes)\r\nmet = set()\r\nfor i in range(N -1, -1, -1):\r\n met.add(cafes[i])\r\n if len(met) == len(indices):\r\n print(cafes[i])\r\n break", "n = int(input())\nmasln = list(map(int, input().split()))\nmal = {}\nfor i in range(n):\n mal[masln[i]] = i\nminindex = 2147483647\nch = 0\nfor i in mal:\n if mal[i] < minindex:\n minindex = mal[i]\n ch = i\nprint(ch)\n", "n = int(input())\r\nl = [int(el) for el in input().split()]\r\ncol = [-1] * 200001\r\nfor i in range(len(l)):\r\n col[l[i]] = i\r\nmin = 2000000\r\nmincol = 0\r\nfor i in range(200001):\r\n if col[i] != -1 and col[i] < min:\r\n min = col[i]\r\n mincol = i\r\nprint(mincol)", "n=int(input())\r\na = list(map(int,input().split()))\r\n\r\nl=2*10**5+1\r\na1=[-1]*l\r\n\r\nfor i in range(n):\r\n a1[a[i]]=i\r\n\r\nmax=9999999999\r\nimax=-99\r\n\r\nfor i in range(l):\r\n if a1[i]>=0 and a1[i]<max:\r\n imax=i\r\n max=a1[i]\r\n\r\nprint(imax)\r\n\r\n\r\n", "input()\r\nX = list(map(int, input().split()))\r\nMyDict = {}\r\nfor i in range(len(X)):\r\n MyDict[X[i]] = i\r\nprint(X[min(MyDict.values())])\r\n", "n = int(input())\r\nl= list( map (int , input().split()))[::-1]\r\nx = [False]*210000\r\nmin=0\r\nfor i in range(n):\r\n if(not(x[l[i]])):\r\n x[l[i]]=True\r\n min=l[i]\r\n\r\nprint(min)", "n = int(input())\r\na = list(map(int, input().split()))\r\n# a.reverse() \r\n# u=[]\r\n# for р in range(n):\r\n# \tif a[р] not in u:\r\n# \t\t# print(a[i])\r\n# \t\tout = a[р]\r\n# \t\tu.append(a[р])\r\nd = {}\r\nfor p in range(n):\r\n\td[a[p]]= p\r\nout = min(d, key=lambda x: d[x])\r\nprint(out)", "n = int(input())\r\na = list(map(int, input().split()))\r\noriginal = set(a)\r\nseen = set()\r\n\r\nfor i in range(len(a) -1, -1, -1):\r\n seen.add(a[i])\r\n\r\n if seen == original:\r\n print(a[i])\r\n break", "n = int(input())\r\nt = list(map(int,input().split()))\r\ns = set(t)\r\ni = n - 1\r\nwhile len(s) != 1:\r\n if t[i] in s:\r\n s.remove(t[i])\r\n i -= 1\r\nprint(*s)\r\n\r\n", "f = lambda: map(int, input().split())\r\nn=int(input())\r\nl=list(f())[::-1]\r\nm=len(set(l))\r\ndup=set()\r\nfor i in l:\r\n dup.add(i)\r\n if len(dup)==m:\r\n print(i)\r\n break\r\n\r\n", "n = int(input())\n\ncafes = list(map(int,input().strip().split(' ')))\n\nindices = {}\n\nfor i,cafe in enumerate(cafes):\n\tindices[cafe] = i\n\nprint(min(indices,key=indices.get))", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=[0]*200000\r\ni=n-1\r\nx=0\r\nwhile i>-1:\r\n if b[a[i]-1]==0:\r\n b[a[i]-1]+=1\r\n x=a[i]\r\n i-=1\r\nprint(x)\r\n ", "def main():\n N = int(input())\n A = tuple(map(int, input().split()))\n\n num = len(set(A))\n x = set()\n for i in A[::-1]:\n x.add(i)\n if len(x) == num:\n print(i)\n break\n\nmain()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = input()[:-1].split()\r\nd = {}\r\nfor i in range(n):\r\n d[w[i]] = i\r\nprint(min(d, key=d.get))\r\n", "n = int(input())\nq = {}\nt = {}\nfor i, x in enumerate(input().split()):\n y = int(x)\n t[i] = y\n if y in q:\n t.pop(q[y])\n q[y] = i\nprint(t[min(t)])\n", "import sys\r\n\r\nN = int( sys.stdin.readline().strip() )\r\np = [int(x) for x in sys.stdin.readline().strip().split() ]\r\n\r\nlast = [0] * 200500\r\ns = list(set(p))\r\nfor i in range(N):\r\n\tlast[p[i]] = i\r\n\r\nmx = 0\r\nfor x in s:\r\n\tmx = max(mx, N-last[x])\r\n\r\nfor x in s:\r\n\tif N-last[x] == mx:\r\n\t\tprint(x)", "n=input()\r\na=input().split()\r\nb={}\r\nfor i in range(len(a)):\r\n b[a[i]]=i\r\nprint(a[min(b.values())])\r\n", "n = int (input())\na = list(map(int,input().split()))\nh = [0]*200010\nk = 0\nfor j in range(0,len(a)):\n h[a[j]-1]=1\nfor i in range(0,len(h)):\n if h[i]==1:\n k +=1\np = [0]*200010\nw = 0\ni = len(a)\nwhile w!=k:\n i = i-1\n if p[a[i]-1] == 0:\n p[a[i]-1]= 1\n w = w + 1\n \nprint(a[i])\n\n \n \n", "n = int(input())\na = list(map(int, input().split(' ')))\n\nm = {}\nfor i in range(n):\n m[a[i]] = i\n\nw = -1\ns = n\nfor key in m.keys():\n if m[key] < s:\n s = m[key]\n w = key\nprint(w)\n\n\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na=a[::-1]\r\nb=[0]*(200004)\r\nl=len(set(a))\r\nj=0\r\nfor i in a:\r\n if b[i]==0 and j!=l:\r\n b[i]=1\r\n j+=1\r\n if j==l:\r\n print(i)\r\n exit(0)\r\n ", "n = int(input())\r\ncafe = list(map(int, input().split()))\r\narray = set()\r\nlast = -1\r\n\r\nfor i in range(len(cafe) - 1, -1, -1):\r\n if cafe[i] not in array:\r\n array.add(cafe[i])\r\n last = i\r\n\r\nprint(cafe[last])\r\n", "n = int(input ())\r\na = (list(map(int,input().split())))\r\na.reverse()\r\na_set = set()\r\nfor i in range(0,len(a)):\r\n if not(a[i] in a_set) :\r\n a_set.add(a[i])\r\n max_a=a[i]\r\nprint(max_a) \r\n", "l=int(input())\r\na=list(map(int,input().split()))\r\nvu=[10000000000 for i in range(2001000)]\r\n\r\nfor i in range(l):\r\n vu[a[i]]=i\r\n\r\nprint(vu.index(min(vu)))\r\n", "n=int(input())\r\na=input().split()\r\nb=set(a)\r\na=a[::-1]\r\nfor i in a:\r\n if len(b)!=1:\r\n if i in b:\r\n b.remove(i)\r\n else:\r\n print(*b)\r\n break\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\na={}\r\ner=set()\r\np=0\r\nfor i in range(n-1,-1,-1):\r\n if t[i] not in er:\r\n p+=1\r\n a[p]=t[i]\r\n er.add(t[i])\r\nprint(a[max(a)])\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[0]*(max(a)+1)\r\nres=a[n-1]\r\nb[a[n-1]]=1\r\nfor i in range(n-2,-1,-1):\r\n if b[a[i]]==0:\r\n res=a[i]\r\n b[a[i]]=1\r\nprint(res)", "N = int(input())\r\ntexts = [0] * N\r\ntexts = input().split()\r\n\r\nends=set()\r\n#print(ends)\r\n\r\n\r\ncount=0\r\n\r\nfor i in range(N):\r\n if not (int(texts[N-i-1]) in ends):\r\n ends.add(int(texts[N-i-1]))\r\n count=texts[N-i-1]\r\n #print(ends)\r\n\r\nprint(int(count))\r\n\r\n", "n = int(input())\r\n\r\narray = list(map(str, input().split()))\r\n\r\nd = {}\r\n\r\nfor i in range(n):\r\n d[array[i]] = i\r\n\r\nprint(array[min([d[key] for key in d.keys()])])\r\n", "n=int(input())\r\nA=[int(i) for i in input().split(\" \")]\r\nprev=[len(A) for i in range(max(A)+1)]\r\nfor i in range(n):\r\n prev[A[i]]=i\r\nprint(prev.index(min(prev)))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nif n == 1 :\r\n print(*l)\r\nelse:\r\n seet = set(l)\r\n\r\n for i in range(n-1 , - 1 , -1):\r\n if len(seet) == 1 :\r\n break\r\n\r\n if l[i] in seet:\r\n seet.remove(l[i])\r\n\r\n for i in seet:\r\n print(i)\r\n\r\n", "number_of_cafes = int(input())\nvisited_cafes = list(map(int, input().split(' ')))\nnumber_of_different_cafes = set(visited_cafes)\nvisited_cafes.reverse()\n\nfor i in range(number_of_cafes):\n if len(number_of_different_cafes) == 1:\n break\n\n if visited_cafes[i] in number_of_different_cafes:\n number_of_different_cafes.remove(visited_cafes[i])\n\n\nprint(*number_of_different_cafes)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb={}\r\nfor i in range(0,n):\r\n b[a[i]]=i\r\nc=min(b.values())\r\nprint(a[c])\r\n", "n, a, d = int(input()), list(map(int, input().split())), {}\r\nfor i in range(n):\r\n d[a[i]] = i\r\nprint(a[min(d.values())])\r\n", "def main():\r\n n = int(input())\r\n a = {}\r\n j = 0\r\n for i in list(map(int, input().split())):\r\n a[i] = j\r\n j += 1\r\n m = -1\r\n for i in a:\r\n if m == -1 or a[i] < a[m]:\r\n m = i\r\n return m\r\n\r\n\r\nprint(main())\r\n", "n = int(input())\r\nai = list(map(int,input().split()))\r\nnums = [200001] * 200001\r\n\r\nfor i in range(n):\r\n nums[ai[i]] = i\r\n\r\nmini = 0\r\nminNum = 200001\r\nfor i in range(200001):\r\n if minNum > nums[i]:\r\n minNum = nums[i]\r\n mini = i\r\nprint(mini)\r\n", "n = int(input())\ns = map(int, input().split())\n\nd = {}\n\nfor i, p in enumerate(s):\n d[p] = i\n\nmin_i = min(d.values())\n\nfor s in d:\n if d[s] == min_i:\n print(s)\n break\n", "t=int(input())\r\narr=list(map(int,input().split()))\r\nfinalindex={}\r\nj=1\r\nfor i in reversed(arr):\r\n\tif i not in finalindex:\r\n\t\tfinalindex[i]=j\r\n\t\tj+=1\r\nprint(max(finalindex, key=finalindex.get))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nm = dict()\r\nfor i in range(n):\r\n m[arr[i]] = i\r\nminn = 10 ** 9\r\nind = -1\r\nfor i in m:\r\n if m[i] < minn:\r\n minn = m[i]\r\n ind = i\r\nprint(ind)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nt=set(a)\r\nt1=len(t)\r\nd={}\r\nans=0\r\nfor i in range(n-1,-1,-1):\r\n d[a[i]]=0\r\n if len(d)==t1:\r\n break\r\nprint(a[i])\r\n \r\n \r\n", "m=input()\r\na=list(map(int,input().split()))\r\na.reverse()\r\ndic={};i=0\r\nfor m in a:\r\n if m not in dic:\r\n dic[m]=i\r\n i+=1\r\nprint(max(dic, key=dic.get))", "n = int(input())\r\na = list(map(int, input().split()))\r\nlast = [-1] * 200001\r\nif n == 1:\r\n print(a[0])\r\n exit()\r\nans = 1e9\r\nfor i in range(n-1, -1, -1):\r\n if last[a[i]] == -1:\r\n ans = a[i]\r\n last[a[i]] = i\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = dict()\r\nfor i in range(len(a)):\r\n d[a[i]] = i\r\nm = 300000\r\nx = 0\r\nfor i in range(len(a)):\r\n if m > d[a[i]]:\r\n m = d[a[i]]\r\n x = i\r\nprint(a[x])", "n = int(input())\nA = list(map(int, input().split()))\n\nINF = 10**18\nX = [INF]*(2*10**5+1)\nfor i, a in enumerate(A):\n X[a] = i\nans = INF\nidx = -1\nfor i, x in enumerate(X):\n if x < ans:\n idx = i\n ans = x\nprint(idx)\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/12 23:56\r\n\r\n\"\"\"\r\n\r\nN = int(input())\r\nA = [int(x) for x in input().split()]\r\n\r\n\r\nvis = {}\r\n\r\nfor i in range(N-1, -1, -1):\r\n v = A[i]\r\n if v not in vis:\r\n vis[v] = N-i\r\n\r\nmx = 0\r\nans = -1\r\n\r\nfor k, v in vis.items():\r\n if v > mx:\r\n mx = v\r\n ans = k\r\n\r\nprint(k)", "'''\r\n6\r\n2 1 2 2 4 1\r\n5\r\n1 3 2 1 2\r\n'''\r\nn = int(input())\r\nm = list(map(int, input().split()))\r\n\r\nr = set(m)\r\nt = []\r\nx = len(m) - 1\r\nwhile len(r) :\r\n if m[x] in r :\r\n t.append(m[x])\r\n r.remove(m[x])\r\n x -= 1\r\n \r\nprint(t[-1])", "# Problem Link: https://codeforces.com/problemset/problem/890/B\r\n# Problem Status:\r\n# ---------------- Separator ----------------\r\ndef TheAmazingFunction(Arr: list, K):\r\n LastVisitTable = dict()\r\n temp = 999999\r\n Ans = -1\r\n for i in range(K):\r\n LastVisitTable.update({Arr[i]: i})\r\n for Key, Value in LastVisitTable.items():\r\n if Value < temp:\r\n temp = Value\r\n Ans = Key\r\n else:\r\n continue\r\n return Ans\r\n\r\n\r\n# ---------------- Separator ----------------\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nprint(TheAmazingFunction(A, N))\r\n# ---------------- Separator ----------------\r\n", "from collections import defaultdict\r\n\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nd = defaultdict()\r\ni = 1\r\nfor r in a:\r\n d[r] = i\r\n i += 1\r\nl = list(d.items())\r\nprint(min(l, key=lambda r: r[1])[0])\r\n", "def main():\r\n n = int(input())\r\n b = set()\r\n a = list(map(int, input().split()))\r\n k = a[n-1]\r\n b.add(k)\r\n for i in range(1, n):\r\n if not(a[n-i-1] in b):\r\n b.add(k)\r\n k = a[n-i-1]\r\n b.add(k)\r\n\r\n print(k)\r\n\r\nmain()", "n = int(input())\r\nvector = dict()\r\nj = 1\r\nfor i in map(int,input().split()):\r\n\tvector[i] = j\r\n\tj += 1\r\nm = min(vector.values())\r\nfor i,j in vector.items():\r\n\tif j == m:\r\n\t\tprint(i)\r\n\t\tbreak\r\n\r\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\nH=list(reversed(L))\r\nd={}\r\nfor i in set(L):\r\n d[i]=30000005\r\nfor i in range(len(H)):\r\n d[H[i]]=min(d[H[i]],i)\r\nK=list(d.keys())\r\nV=list(d.values())\r\nprint(K[V.index(max(V))])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ntmp = dict()\r\nfor i in range(n):\r\n tmp[a[i]] = i\r\n\r\nprint(a[min(tmp.values())])\r\n\r\n\r\n# Codeforcesian\r\n# ♥\r\n", "import math\r\nn = int(input())\r\nb = [int(i) for i in input().split()][::-1]\r\nc = dict()\r\n\r\ni = 0\r\nfor s in b:\r\n if s not in c:\r\n c[s] = i\r\n i += 1\r\n\r\n\r\nmax_n = 0\r\nmax_s = b[n - 1]\r\nfor s in c:\r\n if c[s] > max_n:\r\n max_n = c[s]\r\n max_s = s\r\n\r\nprint(max_s)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nd = dict()\r\nminN = 2e5 + 10\r\nans = 0\r\n\r\nfor i in range(n):\r\n d[a[i]] = i\r\n\r\n\r\nfor key in d:\r\n if d[key] < minN:\r\n minN = d[key]\r\n ans = key\r\n\r\nprint(ans)", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n d = dict()\r\n for i in range(n):\r\n d[A[i]] = i\r\n min_val = min(list(d.values()))\r\n for a in d:\r\n if d[a] == min_val:\r\n print(a)\r\n break\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nsl = dict()\r\ns = input().split()\r\nfor i in range(n):\r\n sl[int(s[i])] = i\r\nc = n\r\nfor j in sl:\r\n if sl[j] < c:\r\n c = sl[j]\r\n t = j\r\nprint(t)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[0]*200001\r\nans=0\r\nfor i in range(n-1,-1,-1):\r\n if (b[a[i]]==0):\r\n b[a[i]]=1\r\n ans=a[i]\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nposl_pos = {}\r\nfor i in range(n):\r\n posl_pos[a[i]] = i+1\r\na = list(set(a))\r\nposl = []\r\npos = {}\r\nfor i in range(len(a)):\r\n pos[posl_pos[a[i]]] = a[i]\r\n posl.append(posl_pos[a[i]])\r\nposl = sorted(posl)\r\nprint(pos[min(posl)])", "n = int(input())\r\na = list(map(int, input().split()))\r\nv = [200000] * 200001\r\nfor i, ai in enumerate(a):\r\n v[ai] = i\r\nprint(a[min(v)])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nlast = dict()\r\nfor i in range(n):\r\n\tc = a[i]\r\n\tlast[c] = i\r\n\r\nlatest = ''\r\nwhen = 2*10**5+1\r\nfor i in last.keys():\r\n\tif last[i]<when:\r\n\t\twhen = last[i]\r\n\t\tlatest = i\r\nprint(latest)", "import sys\n\nn = int(sys.stdin.readline())\nls = list(map(int, sys.stdin.readline().rstrip().split()))\ncafe_set = set(ls)\nfor i in range(n):\n if len(cafe_set) == 1:\n print(cafe_set.pop())\n break\n if ls[-i - 1] in cafe_set:\n cafe_set.remove(ls[-i - 1])\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nd = {}\r\nfor i in range(n):\r\n d[a[i]] = i\r\nmx = 10**20\r\notv = 0\r\nfor x in d.items():\r\n if x[1] < mx:\r\n mx = x[1]\r\n otv =x[0]\r\nprint(otv)\r\n ", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nmemo = {}\r\n\r\nfor i in range(n):\r\n memo[data[i]] = i\r\n\r\nprint(sorted(memo, key=lambda x: memo[x])[0])", "from collections import Counter\nfrom fractions import Fraction\nfrom math import factorial\nfrom random import randint\nimport math\nfrom collections import defaultdict\n\ndef vlad(n,a):\n # l=list(a)\n # s=set(l)\n # s_count=len(s)\n # print(s, s_count)\n d=defaultdict(int)\n for i,j in enumerate(a):\n d[j]=i\n # print(i)\n # if i in s:\n # s.remove(i)\n # s_count-=1\n # if s_count == 0:\n # return i\n return min(d,key=d.get)\n\nn=int(input())\na=map(int, input().split())\n# # n=200000\n# a = [randint(1,10000) for _ in range(200000)]\nprint(vlad(n,a))\nassert(vlad(5,[1,3,2,1,2]) == 3)\nassert(vlad(6,[2,1,2,2,4,1]) == 2)\n", "import sys\r\n\r\nn = int(sys.stdin.readline().rstrip(\"\\n\"))\r\nr = list(map(int, sys.stdin.readline().split()))\r\n\r\nm = [-1] * 210000\r\n\r\nfor i in range(len(r)):\r\n m[r[i]] = i\r\n\r\nmn = 500000\r\nind = -1\r\n\r\nfor j in range(len(m)):\r\n if m[j] < mn and m[j] != -1:\r\n mn = m[j]\r\n ind = j\r\n\r\nprint(ind)", "hashmap = {}\r\nn = int(input())\r\nc = 0\r\nfor i in input().split():\r\n hashmap.update({int(i):c})\r\n c+=1\r\nsot = [(hashmap[i],i) for i in hashmap]\r\nsot.sort()\r\nprint(sot[0][1])\r\n", "n=int(input())\r\na=input().split(' ')\r\na=[int(i) for i in a]\r\nd={}\r\nfor i in range(len(a)):\r\n d[a[i]]=i\r\nans=0\r\nmi=1000000\r\nfor i in d:\r\n if d[i]<mi:\r\n ans=i\r\n mi=d[i]\r\nprint(ans)\r\n", "import sys, math\r\nfrom itertools import permutations\r\n\r\nDEBUG = 0\r\nif DEBUG:\r\n f = open(\"input.txt\", \"r\")\r\n input = f.readline\r\nelse:\r\n input = sys.stdin.readline\r\n\r\ndef mp():\r\n return list(map(int, input().split()))\r\n\r\ndef main():\r\n INF = int(1e9)\r\n n = int(input())\r\n a = mp()\r\n last = [INF] * 200001\r\n for i in range(n):\r\n last[a[i]] = i\r\n print(last.index(min(last)))\r\nmain()", "n = int(input())\r\nar = list(map(int, input().split()))\r\nstore = []\r\nfor i in range(0, 200010):\r\n store.append(0)\r\ncheck = ar[n - 1]\r\nstore[check] += 1\r\nfor i in range(n - 1, -1, -1):\r\n if(check != ar[i] and store[ar[i]] == 0):\r\n check = ar[i]\r\n store[check] += 1\r\nprint(check)\r\n\r\n", "import re\n\nin1 = int(input())\nin2 = re.split(\"\\\\s\", input())\n\ntest = {}\n\ncount = 0\nfor x in in2:\n test[x] = count\n count += 1\n \nprint(min(test, key=test.get))\n \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\n# lst.reverse()\r\n\r\ns = set(lst)\r\ni = n-1\r\nwhile len(s) > 1:\r\n if lst[i] in s:\r\n s.remove(lst[i])\r\n i -= 1\r\nprint(s.pop())", "\r\ndef ok(arr1):\r\n m={}\r\n ans=[]\r\n n=len(arr1)\r\n for i in range(n):\r\n m[arr1[i]]=i\r\n for key,value in m.items():\r\n ans.append((value,key))\r\n return sorted(ans)[0][1]\r\nn=int(input())\r\narr1=list(map(int,input().split()))\r\nprint(ok(arr1))\r\n", "n = int(input())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\ndaf = daf[::-1]\r\nhas = set()\r\nlast = 0\r\n\r\nfor x in daf:\r\n if x in has:\r\n continue\r\n else:\r\n has.add(x)\r\n last = x\r\n\r\nprint(last)\r\n", "n = int(input())\r\nl = input().split()\r\n\r\ns1, s2 = set(l), set()\r\n\r\nfor i in range(n - 1, -1, -1):\r\n\ts2.add(l[i])\r\n\t\r\n\tif len(s2) == len(s1):\r\n\t\tprint(l[i])\r\n\t\tbreak", "n = int(input())\narr = list(map(int,input().split()))\nseen = set()\nans = 0\n\nfor i in range(n-1,-1,-1):\n if arr[i] in seen:\n pass\n else:\n ans = arr[i]\n seen.add(arr[i])\n\nprint(ans)\n \n \n \n \n", "def main():\n n = int(input())\n nums = [int(x) for x in input().split(' ')]\n uniques = set()\n res = nums[-1]\n for i in range(n-1, -1, -1):\n if not nums[i] in uniques:\n res = nums[i]\n uniques.add(res)\n print(res)\n\nmain()", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nsize = len(set(lst))\r\n\r\nans = set()\r\nlst.reverse()\r\nfor i in range(n):\r\n\tans.add(lst[i])\r\n\tif len(ans)== size:\r\n\t\tprint(lst[i])\r\n\t\tbreak\r\n\r\n", "def main():\n input()\n l = [999999] * 200001\n for i, a in enumerate(map(int, input().split())):\n l[a] = i\n print(min(range(200001), key=l.__getitem__))\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nar = list(reversed(input().split()))\r\n\r\na = len(ar) - len(set(ar))\r\nd = dict()\r\nk = 1\r\nfor i in ar:\r\n if i not in d.keys():\r\n d[i] = k\r\n k += 1\r\n\r\nm = 0\r\nfor i, j in d.items():\r\n if j >= m:\r\n ans = i\r\n m = j\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nL = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n if L[i] in d:\r\n d[L[i]] += 1\r\n else:\r\n d[L[i]] = 1\r\nv = len(d)\r\nd.clear()\r\nfor i in range(n - 1, -1, -1):\r\n if L[i] in d:\r\n d[L[i]] += 1\r\n else:\r\n d[L[i]] = 1\r\n if len(d) == v:\r\n print(L[i])\r\n exit()", "n = int(input())\nstol = [int(x) for x in input().split()]\nbil = set()\nfor i in range (n-1, -1, -1):\n if stol[i] not in bil:\n res = stol[i]\n bil.add(stol[i])\nprint(res)", "n = int(input())\n\nc = [int(i) for i in input().split()]\ncc = {}\n\nfor i in range(len(c)):\n cc[c[i]] = i\n\n\nmi = 99999999\nmc = 99999999\nfor i in cc.keys():\n if cc[i] < mi:\n mi = cc[i]\n mc = i\n\nprint(mc)\n\n", "vis = [0 for i in range(200005)]\r\nn = int(input())\r\na = []\r\nline = input().split()\r\nfor i in range(n):\r\n a.append(int(line[i]))\r\n pass\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n if vis[a[i]] == 1:\r\n continue\r\n else:\r\n vis[a[i]] = 1\r\n ans = a[i]\r\n continue\r\n continue\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\ns1=set()\r\nfor i in range(n-1,-1,-1):\r\n s1.add(l[i])\r\n if s1==s:\r\n print(l[i])\r\n break", "n = int(input()); a = input().split()\nb = dict((a[i], i) for i in range(n))\nprint(a[min(b.values())])\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0 for i in range(2 * (10 ** 5) + 1)]\r\nm = 0\r\nfor i in reversed(range(n)):\r\n if b[a[i]] == 0:\r\n m = a[i]\r\n b[a[i]] = 1\r\nprint(m)\r\n", "\r\n\r\ndef best_cafe(cafe_visits):\r\n\tlast_visit = {}\r\n\tfor visit, cafe in enumerate(cafe_visits):\r\n\t\tlast_visit[cafe] = visit\r\n\r\n\treturn min(last_visit, key=lambda cafe: last_visit[cafe])\r\n\r\nnum_cafes = int(input())\r\ncafe_visits = [int(x) for x in input().split()]\r\nprint(best_cafe(cafe_visits))\r\n", "n = int(input())\na = [int(x) for x in input().split()]\nb = {}\nfor i in range(len(a)):\n b[a[i]] = i\njav = m = 5000000\nfor key, value in b.items():\n if value<m:\n jav = key\n m = value\nprint(jav)\n", "def max_dict(d: dict):\r\n max_key = 0\r\n max_elem = -float(\"inf\")\r\n for i in d:\r\n if d[i] > max_elem:\r\n max_elem = d[i]\r\n max_key = i\r\n\r\n return max_key\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = {x: float('inf') for x in a}\r\n\r\nfor i in range(len(a)):\r\n b[a[i]] = min(len(a) - i - 1, b[a[i]])\r\n\r\nprint(max_dict(b))\r\n", "n = int(input())\r\ncaffe = list(map(int, input().split()))\r\n\r\nd = {}\r\n\r\nfor i in range(n):\r\n p = caffe[i]\r\n d[p] = i\r\n\r\nprint(min(d, key=d.get))", "n=int(input())\r\nl=input().split()\r\nd={}\r\nfor i in range(n):\r\n d[l[i]]=i\r\nk=min(d, key=d.get)\r\nprint(int(k))", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(len(a)):\r\n if d.get(a[i]):\r\n d.get(a[i]).append(i)\r\n else:\r\n d[a[i]] = [i]\r\nmini = 100000000000\r\nfor i in d.values():\r\n mini = min(i[-1], mini)\r\nprint(a[mini])", "from sys import *\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nd,ans = {},[]\r\nfor i in range(n):\r\n d[l[i]]=i\r\nfor key,value in d.items():\r\n ans.append((value,key))\r\nprint((sorted(ans))[0][1])", "n=int(input())\r\na=list(map(int,input().split()))\r\na=a[::-1]\r\nw=set(a)\r\nr=set()\r\nfor i in range(len(a)):\r\n if a[i] not in r:\r\n r.add(a[i])\r\n if r==w:\r\n print(a[i])\r\n raise SystemExit", "n = int(input())\r\nA = list(map(int, input().split()))\r\nD = {}\r\nfor i in range (n):\r\n D[A[i]] = i\r\n \r\nB = sorted(list(D.items()), key = lambda x: x[1])\r\nprint(B[0][0])\r\n\r\n \r\n", "def main():\r\n n = int(input())\r\n data = [int(v) for v in input().split()]\r\n last = {}\r\n for i,v in enumerate(data):\r\n last[v]=i\r\n r = sorted(last.items(), key=lambda b:b[1])\r\n print(r[0][0])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "input()\r\na = input().split()\r\nb = {}\r\ni = 0\r\nwhile i < len(a):\r\n b[a[i]]=i\r\n i += 1\r\nprint(a[min(b.values())])", "l = []\r\nn = int(input())\r\na = input().split()[::-1]\r\na = list(dict.fromkeys(a))\r\na = a[::-1]\r\nprint(a[0])\r\n", "n = int(input())\r\na = input().split()\r\nm = set(a)\r\nans = a[n-1]\r\nfor i in a[::-1]:\r\n if i in m and len(m) > 1:\r\n m.remove(i)\r\n if len(m) == 1:\r\n break\r\nprint(*m)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nla = dict()\r\nfor i in range(n):\r\n la[a[i]] = i\r\nfor i in range(n):\r\n if la[a[i]] == i:\r\n ans = a[i]\r\n break\r\nprint(ans)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nvis = [0] * (max(s) + 1)\r\nfor i in range(n - 1, -1, -1):\r\n if vis[s[i]] == 0:\r\n ans = s[i]\r\n vis[s[i]] = 1\r\nprint(ans)", "import fractions\r\nimport math\r\nn=int(input()) \r\na=list(map(int,input().split(' '))) \r\na.reverse() \r\na2=set(a) \r\nkey=dict.fromkeys(list(a2),0) \r\nleng=len(a2)\r\nsch=0 \r\nfor i in a: \r\n if key[i]==0: \r\n sch+=1\r\n key[i]=1 \r\n if leng==sch: \r\n print(i)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = set(a)\r\ni = n - 1\r\nwhile len(s) > 1:\r\n\ts.discard(a[i])\r\n\ti -= 1\r\n\t\r\nprint(s.pop())", "def main() -> str:\r\n n = int(input()) # количество выписанных Владом номеров столовых\r\n input_data = tuple([str(x) for x in input().split(\" \")]) # номера столовых в порядке посещения Владом\r\n input_set = set(input_data)\r\n my_dict = {}\r\n for i in input_set:\r\n my_dict[i] = 0\r\n for i in range(n):\r\n my_dict[input_data[i]] = n - i\r\n result, max_res = n, 0\r\n for key, value in my_dict.items():\r\n if value > max_res:\r\n max_res = value\r\n result = key\r\n\r\n return result\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n = int(input())\na = [int(x) for x in input().split()][::-1]\nc = set(a)\nfor i in a:\n if len(c) != 1:\n c -= {i}\nprint(*c)\n", "n=int(input())\r\n\r\nlst=input().split()\r\n\r\n\r\nd={}\r\nfor i in range(0,n):\r\n item = lst[i]\r\n d[item]=i\r\n\r\n_min=n\r\nres=0\r\nfor item in d:\r\n if d[item]<_min:\r\n _min=d[item]\r\n res=item\r\n\r\n\r\nprint(res)\r\n", "n = int(input())\ncount = set()\ncafe = 0\nr = [int(x) for x in input().split()]\nr = r[::-1]\nfor i in r:\n if i not in count:\n cafe = i\n count.add(i)\nprint(cafe)\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\nb = [-1 for i in range(max(a) + 1)]\r\nmpos = 10000000\r\nfor i in range(n):\r\n b[a[i] ] = i\r\nfor i in range(len(b)):\r\n if b[i] != -1:\r\n if b[i] < mpos:\r\n mpos = b[i]\r\n ans = i\r\n \r\nprint(ans)", "a = int(input())\r\nl = list(map(int, input().split()))\r\nm = {}\r\nfor i in range(a):\r\n m[l[i]] = i+1\r\nprint(min(m, key=m.get))", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=len(set(a))\r\ns=set()\r\nfor i in range(n-1,-1,-1):\r\n s.add(a[i])\r\n if len(s)==k:\r\n print(a[i])\r\n break\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nst = [2*10**5]*(max(a)+1)\r\nmins=2*10**5\r\nfor j in range(n):\r\n st[a[j]]=j\r\nfor i in range(max(a)+1):\r\n if st[i]<mins:\r\n mins=st[i]\r\n f=i\r\nprint(f) ", "n=input()\r\na=input().split(' ')\r\na=[int(b) for b in a]\r\na.reverse()\r\nkeylist=set(a)\r\nkei={}\r\ncont=0\r\nfor k in a:\r\n if(cont==len(keylist)-1 and k not in kei):\r\n ans=k\r\n break\r\n if(k not in kei):\r\n cont+=1\r\n kei[k]=1\r\nprint(ans)\r\n\r\n", "n = int(input())\r\nA = [int(i) for i in input().split()] \r\nD = set()\r\nm = -1\r\nfor i in range(len(A)):\r\n if A[len(A)-i-1] not in D:\r\n D.add(A[len(A)-i-1])\r\n m = A[len(A)-i-1]\r\n\r\nprint (m)\r\n", "import sys\n\nn = int(input())\narr = [x for x in input().split()]\nres = set()\nmaxInt = -1\nmaxVal = -1\nfor i, ind in enumerate(arr[::-1]):\n if ind not in res and i > maxInt:\n maxInt = i\n maxVal = ind\n res.add(ind)\n\nprint(maxVal)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set()\r\nc = a[-1]\r\nfor i in a[::-1]:\r\n\tif not i in s:\r\n\t\ts.add(i)\r\n\t\tc = i\r\nprint(c)", "n = int(input())\r\na = []\r\nfor i in range(200001):\r\n a.append(1000000)\r\nnumbers = input().split()\r\nfor i in range(n):\r\n temp = int(numbers[i])\r\n a[temp] = i\r\ni_min = 0\r\nfor i in range(1,200001):\r\n if a[i]<a[i_min]:\r\n i_min = i\r\nprint(i_min)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n d[a[i]] = i\r\nc = list(d.items())\r\nc.sort(key=lambda x:x[1])\r\n#print(c)\r\nansw = c[0][0]\r\nprint(answ)", "l = []\nn = int(input())\na = input().split()[::-1]\na = list(dict.fromkeys(a))\na = a[::-1]\nprint(a[0])\n", "n = int(input())\r\n\r\nd = {}\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n d[a[i]] = i\r\n\r\nl = list(list(i) for i in (d.items()))\r\nprint(sorted(l, key = lambda x: x[1])[0][0])\r\n", "n = int(input())\r\nvisits = [int(i) for i in input().split()]\r\nresults = dict()\r\nfor i, e in enumerate(visits):\r\n\tresults[e] = i\r\nprint(visits[min(results.values())])", "# Main maut ko takiya, aur kafan ko chaadar banakar audhta hoon!\r\nn=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\nb={}\r\n\r\nfor i in a:\r\n\tb[i]=1\r\n\t\r\nfor i in range(n-1,-1,-1):\r\n\tif(len(b)==1):\r\n\t\tbreak\r\n\t\r\n\tif(a[i] in b):\r\n\t\tdel b[a[i]]\r\n\r\nd=list(b.keys())\r\nd=d[0]\r\n\r\nprint(d)\r\n\t\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmark = [0]*2*(10**5)\r\nlast = a[n-1]\r\n\r\nfor i in range(n-1, -1, -1):\r\n if (mark[a[i]-1] == 0):\r\n mark[a[i] -1 ] = 1\r\n last = a[i]\r\nprint (last)", "#\r\n# Created by Polusummator on 24.10.2020\r\n# --------- Little PyPy Squad ---------\r\n# Verdict: \r\n#\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nd = {}\r\nfor i in range(n):\r\n d[a[i]] = i\r\nans = 1000000\r\nans2 = 0\r\nfor i in d.keys():\r\n if d[i] < ans:\r\n ans2 = i\r\n ans = d[i]\r\nprint(ans2)\r\n", "def main():\r\n n = int(input())\r\n arr={}\r\n z=0\r\n for i in list(map(int, input().split())):\r\n arr[i]=z\r\n z+=1\r\n ii=-1\r\n for i in arr:\r\n if ii==-1 or arr[i]<arr[ii]:\r\n ii=i\r\n return ii\r\n\r\nprint(main())", "s={-1}\r\nfor x in[*open(0)][1].split()[::-1]:\r\n if x not in s:r=x\r\n s|={x}\r\nprint(r)", "n=int(input())\r\nd={}\r\na=[int(j)+1 for j in input().split()]\r\nfor i in range(n):\r\n if (a[i]!=0):\r\n d[a[i]]=i\r\nmi=-1\r\nfor key in d:\r\n if ((mi==-1) or (d[key]<d[mi])):\r\n mi=key;\r\nprint(mi-1)", "def solution(cafes):\n\tvisited = {}\n\tfor i, c in enumerate(cafes):\n\t\tvisited[c] = i\n\tlast = len(cafes)\n\tcafe = len(cafes)\n\tfor c, k in visited.items():\n\t\tif k < last:\n\t\t\tlast = k\n\t\t\tcafe = c\n\treturn cafe\n\ninput()\ncafes = list(map(int, input().split()))\nprint(solution(cafes))\n", "q = int(input())\nw = list(map(int, input().split()))\nz = 0\ne = [-1] * 200010 \n\n\nfor i in w:\n e[i] = 1\n\nfor i in range(len(e)):\n if e[i] == 1:\n z += 1\n\nd = 0\nn = len(w)\nm = 0\n\nwhile d < z:\n n -= 1\n if e[w[n]] == 1:\n e[w[n]] = 0\n d += 1\n m = w[n]\nprint(m)\n", "#آخرین بازدید از اون کافه قبل آخرین بازدید از کافه های دیگر باشه\r\n\r\nn=int(input())\r\nl = [*map(int,input().split())]\r\ntmp={}\r\nAns=None\r\nfor i in range(n-1,-1,-1):\r\n if tmp.get(l[i],-1)==-1:\r\n tmp[l[i]]=1\r\n Ans=l[i]\r\n else:\r\n pass\r\nprint(Ans)", "\r\nt=int(input())\r\n\r\na=list(map(int,input().split()))\r\ndct={}\r\ntemp=0\r\nfor i in a:\r\n dct[i]=temp\r\n temp=temp+1\r\n\r\nsorted_dct=dict(sorted(dct.items(),key=lambda x:x[1]))\r\n\r\n\r\nfor i in sorted_dct:\r\n print(i)\r\n break", "# LUOGU_RID: 101736691\nn, *a = map(int, open(0).read().split())\r\nd = {}\r\nfor i, x in enumerate(a):\r\n d[x] = i\r\np = (-1, -1)\r\nfor x, y in d.items():\r\n if y < p[1] or p[1] == -1:\r\n p = (x, y)\r\nprint(p[0])", "input()\r\na = list(map(int,input().split()))\r\nt = {}\r\nrs = 0\r\nfor i in range(len(a)):\r\n t[a[i]] = i\r\nprint(a[min(t.values())])", "n = int( input() )\ns = list( map( int, input().split() ) )\na = [ False ] * 200001\n\nnewest = None\nwhile n > 0:\n n -= 1\n if a[ s[ n ] ] == False:\n a[ s [ n ] ] = True\n newest = s[ n ]\n\nprint( newest )\n", "n = input(); a = input().split()\nb = dict((j, i) for i, j in enumerate(a))\nprint(a[min(b.values())])\n", "n = int(input())\r\na = [int(x) for x in input().split()][::-1]\r\ns = set()\r\nans = 0\r\nfor i in a:\r\n if not (i in s):\r\n ans = i\r\n s.add(i)\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\nvis = [False] * (max(a) + 1)\r\nans = list()\r\n\r\nfor i in range(len(a) - 1, -1, -1):\r\n\tif not vis[a[i]]:\r\n\t\tans.append(a[i])\r\n\t\tvis[a[i]] = True\r\n\t\r\nprint(ans[len(ans) - 1])", "sl=int(input())\r\ntime=list(map(int, input().split()))\r\nlast=dict()\r\nrs=time[0]\r\ntmp=sl\r\ndem=0\r\nfor i in time:\r\n dem+=1\r\n last[i]=dem\r\nfor i,j in last.items():\r\n if j<tmp:\r\n rs=i\r\n tmp=j\r\nprint(rs)", "n = int(input());l = list(map(int, input().split()))[::-1]\r\nb = set();a = set(l);c = len(a)\r\nfor i in l:\r\n if i not in b:\r\n if c-1==len(b):print(i);break\r\n else:b.add(i)\r\n", "n = int(input())\na = [int(i) for i in input().split()]\nh = {}\n\n#hash the visit to the restaurant\nfor i in range(len(a)):\n h[a[i]] = i\n\nprint(a[min(h.values())])\n\n\n\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn = ii()\r\nprint(list({el: 1 for el in iis()[::-1]}.keys())[-1])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nb = {}\r\nfor i in range(len(a)):\r\n b[a[i]] = i\r\n \r\nprint(a[min(b.values())])", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\ns=set([])\r\nfor i in range(n-1,-1,-1):\r\n x=len(s)\r\n s.add(a[i])\r\n if len(s)>x:\r\n k=a[i]\r\nprint(k)", "n = int(input())\r\nc = [int(i) for i in input().split()][::-1]\r\na= {}\r\nx = len(set(c))\r\ni = 0\r\nwhile len(a.keys()) < x:\r\n try:\r\n a[c[i]]+=1\r\n except KeyError:\r\n a[c[i]] = 1\r\n i+=1\r\n\r\nprint(c[i-1])\r\n ", "kol = int(input())\r\ndate = list(map(int, input().split()))\r\ndict = {}\r\nfor i in range(len(date)):\r\n dict[date[i]] = i\r\nmin = 1000000\r\nfor i in dict:\r\n if dict[i] < min:\r\n min = dict[i]\r\n last = i\r\n\r\n\r\nprint(last)", "from collections import defaultdict\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\nc = defaultdict(lambda: 0)\r\n\r\nfor i in range(len(a)):\r\n c[a[i]] = i\r\n# print(c)\r\nmaxi = 0\r\nk = len(a)\r\nne = 0\r\nfor key in c:\r\n if(k - c[key] > maxi):\r\n ne = key\r\n maxi = max(maxi, k - c[key])\r\n # print(maxi)\r\nprint(ne)", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = len(set(a))\r\n\r\nwas = set()\r\nans = -1\r\nfor i in a[::-1]:\r\n if i not in was:\r\n was.add(i)\r\n ans = i\r\n if len(was) == c:\r\n print(ans)\r\n exit()\r\n\r\nprint(ans)\r\n", "n = int(input())\r\n\r\nmas = list(map(int, input().split()))\r\n\r\ns = dict()\r\nfor i, e in enumerate(mas):\r\n s[e] = i\r\n\r\nprint(mas[min(s.values())])", "input()\r\na=[int(i) for i in input().split()]\r\nb={}\r\nfor i in range(len(a)):b[a[i]]=i\r\nprint(a[min(b.values())])", "n=int(input())\r\nb=[0]*(200002)\r\na=list(map(int,input().split()))\r\nl=len(set(a))\r\ncount=0\r\nfor i in a[::-1]:\r\n if b[i]==0:\r\n b[i]=1\r\n m=i\r\n count+=1\r\n if l==count:\r\n break\r\nprint(m)\r\n ", "n = int(input())\r\ndata = list(map(int, input().split()))\r\ntime = [-1 for i in range(2 * 10**5 + 1)]\r\nfor i in range(n - 1, -1, -1):\r\n if time[data[i]] == -1:\r\n time[data[i]] = n - i - 1\r\nmax_time = -1\r\nindex = 0\r\nfor i in range(2 * 10**5 + 1):\r\n if time[i] > max_time:\r\n max_time = time[i]\r\n index = i\r\nprint(index)\r\n", "n = int(input())\nindices = list(map(int,input().strip().split(' ')))\n\nvisits = {}\nfor i,index in enumerate(indices):\n\tvisits[index] = i\n\nlast_visit = n-1\nlast_index = indices[-1]\nfor index,visit in visits.items():\n\tif visit < last_visit:\n\t\tlast_index = index\n\t\tlast_visit = visit\n\nprint(last_index)\n", "input()\r\nh = {a:i for i,a in enumerate(map(int, input().split()))}\r\n\r\nprint(min(h, key=h.get))", "n = int(input())\r\nA = [int(x) for x in input().split()]\r\nlast = [10**6 for x in range(max(A)+1)]\r\nfor i in range(0,n):\r\n last[A[i]] = i\r\nprint(A[min(last)])\r\n", "length = input()\r\nindexes = input().split(\" \")\r\nlook = {}\r\nfor x in range(0,len(indexes)):\r\n look[indexes[x]] = int(length) - x\r\nma = -1\r\nkey = -1\r\nfor r in look:\r\n if look[r] > ma:\r\n ma = look[r]\r\n key = r\r\nprint(key)\r\n \r\n \r\n", "INF = 10 ** 6\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\npos = dict()\r\nstol = dict()\r\n\r\nfor i in range(n - 1, -1, -1):\r\n stol = arr[i] - 1\r\n if pos.get(stol) is None:\r\n pos[stol] = n - i\r\nans = arr[0] - 1\r\nfor stol in pos.keys():\r\n if pos[stol] > pos[ans]:\r\n ans = stol\r\nprint(ans + 1)\r\n", "n=int(input().strip())\na=list(map(int,input().strip().split()))\nprev=[-1]*200001\nfor i in range(0,n):\n\tprev[a[i]]=i\nmin=n\npos=-1\nfor i in range(0,200001):\n\tif prev[i]!=-1 and prev[i]<min:\n\t\tmin=prev[i]\n\t\tpos=i\nprint(pos)", "n = int(input())\r\n\r\ncafes = list(map(int, input().split()))\r\n\r\nlastChecked = {}\r\n\r\nfor i in range(len(cafes)):\r\n\tlastChecked[cafes[i]] = i\r\nprint(cafes[min(lastChecked.values())])\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=[1000000]*(1000000)\r\nfor i in range (n):\r\n b[a[i]]=i+1\r\nmin=20000000\r\nnum=0\r\nfor i in range (1000000):\r\n if(b[i]!=-1):\r\n if(b[i]<min):\r\n min=b[i]\r\n num=i\r\nprint(num)\r\n \r\n", "def solve():\n n = int(input())\n nums = list(map(int, input().split()))\n\n last_seen = [10000000] * (2 * 10**5 + 1)\n\n for i, n in enumerate(nums):\n last_seen[n] = i\n\n min_seen = min(last_seen)\n for i, n in enumerate(last_seen):\n if n == min_seen:\n return i\n\nprint(solve())\n\n", "from array import array\r\nn = int(input())\r\na = array('I', map(int, input().split()))\r\nd = {}\r\nfor i, s in enumerate(a):\r\n\td[s] = i\r\nprint(min(d, key=d.get))\r\n", "n = int(input())\r\np = input().split()\r\narr = {}\r\nfor i in range(n):\r\n arr[p[i]] = i\r\nss = min(arr, key = arr.get)\r\nprint(int(ss))\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\nmas = [-1]*2*10*10*10*10*10\r\nper = m[len(m)-1]-1\r\nfor i in range(0, n):\r\n if mas[m[n-i-1]-1] == -1:\r\n mas[per] = 0\r\n mas[m[n-i-1]-1] = 1\r\n per = m[n-i-1]-1\r\nprint(per+1)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nset_a=set(a)\r\nif len(set_a)==1:\r\n\tprint(a[0])\r\n\texit()\r\nfor i in range(n):\r\n\tcur=a[~i]\r\n\tif cur in set_a:\r\n\t\tset_a.remove(cur)\r\n\t\tif len(set_a)==1:\r\n\t\t\tprint(list(set_a)[0])\r\n\t\t\tbreak", "n=int(input())\r\narray=[]\r\narray=list(map(int, input().split()))\r\nmy_dict={}\r\nfor i in range(len(array)):\r\n my_dict[array[i]]=i\r\n\r\nresult=min(my_dict,key=my_dict.get)\r\n\r\nprint(result)", "import sys, os.path\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nl=l[::-1]\r\nans=0\r\nl1=set()\r\nfor i in range(n):\r\n\tif l[i] not in l1:\r\n\t\tl1.add(l[i])\r\n\t\tans=l[i]\r\nprint(ans)\r\n", "input()\r\na=list(map(int,input().split()))\r\nn=len(set(a))\r\nb=[0]*200001;k=0\r\nfor i in a[::-1]:\r\n if b[i]==0:\r\n k+=1;b[i]=1\r\n if k==n:\r\n print(i)\r\n break", "n = [None for x in range(int(input()))]\r\nu = input().split()\r\nu.reverse()\r\nx = dict(zip(u,n))\r\nfor key in x:\r\n n = key\r\nprint(n)\r\n", "\n\nn = int(input())\nvisited = input().split()[::-1]\n\n\ncafes = set(visited)\n\nfor i in visited:\n\tif len(cafes) == 1:\n\t\tprint(cafes.pop())\n\t\tbreak\n\tif i in cafes:\n\t\tcafes.remove(i)\n\n\n", "# 445b\n\nn = int(input())\n\na = input().split()\n\nuniq = {}\n\nfor i in range(n - 1, -1, -1):\n if a[i] not in uniq:\n uniq[a[i]] = i\n\ntmp = n\noldest = 0\nfor key, val in uniq.items():\n if tmp > val:\n tmp = val\n oldest = key\nprint(oldest)\n", "n = int(input())\nm = list(map(int, input().split()))\nk = [-1]*2*10*10*10*10*10\nl = m[len(m)-1]-1\nfor i in range(0, n):\n if k[m[n-i-1]-1] == -1:\n k[l] = 0\n k[m[n-i-1]-1] = 1\n l = m[n-i-1]-1\nprint(l+1)\n", "#B問題\r\n\r\nN = int(input())\r\na = list(map(int,input().split(\" \")))\r\nindex = {}\r\n\r\nfor i in range(N):\r\n\tindex[a[i]] = i\r\n\r\nprint(min(index.items(), key=lambda x:x[1])[0])", "n = int(input())\r\na = list(map(int, str(input()).split()))\r\nb = [-1 for i in range(max(a) + 1)]\r\nm = 10 ** 6\r\nfor i in range(n):\r\n b[a[i]] = i\r\nfor i in range(len(b)):\r\n if b[i] != -1:\r\n if b[i] <= m:\r\n v = a[b[i]]\r\n m = b[i]\r\nprint(v)", "n=int(input())\r\nl=[int(s) for s in input().split()]\r\nk=len(set(l))\r\n#print(k)\r\nl1=set()\r\nfor i in range(n-1,-1,-1):\r\n l1.add(l[i])\r\n #print(l1)\r\n if len(l1)==k:\r\n print(l[i])\r\n break", "n = int(input())\r\nmyd = {}\r\narr = [int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n myd[arr[i]] = i\r\n\r\nprint(arr[min(myd.values())])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd1,d2={},{}\r\nfor i in l:\r\n\ttry:\r\n\t\td1[i]+=1\r\n\texcept:\r\n\t\td1.update({i:0})\r\n\t\td1[i]+=1\r\nx=list(d1.keys())\r\nf=len(x)-1\r\nif f==0:\r\n\tprint(l[0])\r\nelse:\r\n\ts=set()\r\n\tfor i in range(n-1,-1,-1):\r\n\t\ts.add(l[i])\r\n\t\tif len(s)==f:\r\n\t\t\tbreak\r\n\tprint(list(set(x)-s)[0])", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [0]*(max(a)+1)\r\nfor i in range (n):\r\n b[a[i]] = n-i\r\nprint (b.index(max(b)))", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\ninput()\r\na = input().split()\r\nb = {}\r\ni = 0\r\nwhile i < len(a):\r\n b[a[i]]=i\r\n i += 1\r\nprint(a[min(b.values())])", "n = int(input());\r\nA = list(map(int, input().split()));\r\ncount = 0;\r\nB = [];\r\nfor q in range(300000):\r\n B.append(n + 1);\r\nfor q in range(len(A)):\r\n B[A[q]] = q;\r\nprint(B.index(min(B)));", "n = int(input())\r\nA = input().split()\r\nA = [int(i) for i in A]\r\nm = max(A)\r\nlast = [n+3]*(m+1)\r\nfor i in range (0,n):\r\n v = A[i]\r\n last[v] = i\r\nprint(last.index(min(last)))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=set(a)\r\nfor i in range(1,n+1):\r\n if a[-i] in b:\r\n b.remove(a[-i])\r\n ans=a[-i]\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\na.reverse()\r\nlength = len(set(a))\r\nst = set()\r\nfor i in a:\r\n st.add(i)\r\n if len(st) == length:\r\n print(i)\r\n break\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl = l[::-1]\r\n\r\nindices = {} # Dictionary to store indices of items\r\nmaxf = -1 # Initialize max frequency\r\nelement = 0 # Initialize the element with max frequency\r\n\r\nfor i, item in enumerate(l):\r\n if item not in indices:\r\n indices[item] = i # Store the first occurrence of the item\r\n\r\n if i > maxf:\r\n maxf = i # Update max frequency if necessary\r\n element = item\r\n\r\nprint(element)", "n=int(input())\r\na=list(map(int,input().split()))\r\ndist=len(set(a))\r\ntemp=set()\r\nfor z in range(n-1,-1,-1):\r\n tempz=a[z]\r\n temp.add(a[z])\r\n if(len(temp)==dist):\r\n print(tempz)\r\n break\r\n ", "n = int(input())\nv = []\nvar = input().split()\nfor i in range(n):\n v.append(int(var[i]))\n\ndict = {}\nv.reverse()\nrez = 0;\nfor i in v:\n if dict.get(i) == None:\n rez = i\n dict[i] = 1\n\nprint (rez)", "def solution():\r\n n= int(input())\r\n arr = [int(i) for i in input().split(' ')]\r\n k, v = float('inf'), 0\r\n d = {}\r\n for i, x in enumerate(arr):\r\n d[x] = i\r\n for val, key in d.items():\r\n if k > key:\r\n k = key\r\n v = val\r\n print(v)\r\n\r\nif __name__ == \"__main__\":\r\n solution()\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-13 22:41:02\nLastEditTime: 2021-12-03 23:43:54\nDescription: Vlad and Cafes\nFilePath: CF886B.py\n'''\n\n\ndef func():\n n = int(input())\n lst1 = list(map(int, input().strip().split()))\n lst2 = [0] * 200005\n for i in range(n - 1, -1, -1):\n if lst2[lst1[i]] != 1:\n ans = lst1[i]\n lst2[lst1[i]] = 1\n print(ans)\n\n\nif __name__ == '__main__':\n func()\n", "n=int(input())\r\nDict={}\r\na=[int(x) for x in input().split()]\r\n\r\nfor i in range(n):\r\n Dict[a[i]]=i+1\r\n\r\nmina=min(list(Dict.values()))\r\nfor caf,ind in Dict.items():\r\n if ind==mina: print(caf) ; break\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncafes = set(a)\r\noutput = 0\r\nfor i in range(1, n+1):\r\n if a[-i] in cafes:\r\n cafes.remove(a[-i])\r\n output = a[-i]\r\nprint(output)", "n = int(input())\narr = list(map(int,input().split()))\ns = set()\ninf = dict()\nfor i in range(n):\n\tinf[arr[i]] = i+1\n\ts.add(arr[i])\nmi = 10**10\nind = -1\nfor i in s:\n\tmi = min(inf[i],mi)\n\tif inf[i]==mi:\n\t\tind = i\nprint(ind)\n", "\"\"\"\r\nproblem : https://codeforces.com/problemset/problem/886/B\r\nauther : Jay Saha\r\nhandel : ponder_\r\ndate : 15/07/2020\r\n\"\"\"\r\n\r\nn = int(input())\r\nvisited = list(map(int, input().split()))\r\nnotVisied = set(visited)\r\nfor i in range(n - 1, -1, -1):\r\n if len(notVisied) == 1:\r\n break\r\n if visited[i] in notVisied:\r\n notVisied.remove(visited[i])\r\nfor elm in notVisied:\r\n print(elm)", "import os, sys, io\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\ninput()\r\n\r\ncafes = input().split()[::-1]\r\nnr_cafes = len(set(cafes))\r\nused = set()\r\nfor x in cafes:\r\n if x in used:\r\n pass\r\n else:\r\n if len(used) < nr_cafes - 1:\r\n used.add(x)\r\n else:\r\n ans = x\r\n\r\nsys.stdout.write(ans.decode())", "n = int(input())\r\nl = input().split()\r\nd = {}\r\nfor i in range(n):\r\n d[l[i]] = i\r\nk = min(d, key=d.get)\r\nprint(int(k))\r\n", "from collections import Counter\r\nn=int(input())\r\nli= list(map(int, input().split()))\r\nli=li[::-1]\r\nprint(list(Counter(li))[-1])" ]

[ "import string\r\n\r\n\r\ndef selection_sort(l):\r\n for i in range(len(l)):\r\n min_val = l[i]\r\n min_val_index = i\r\n for j in range(i, len(l)):\r\n if l[j] < min_val:\r\n min_val = l[j]\r\n min_val_index = j\r\n l[i], l[min_val_index] = l[min_val_index], l[i]\r\n return l\r\n\r\n\r\ndef merge_sort(l):\r\n def merge(l1, l2):\r\n output_list = []\r\n i, j = 0, 0\r\n while i < len(l1) and j < len(l2):\r\n if l1[i] < l2[j]:\r\n output_list.append(l1[i])\r\n i += 1\r\n else:\r\n output_list.append(l2[j])\r\n j += 1\r\n if i == len(l1):\r\n output_list += l2[j:]\r\n else:\r\n output_list += l1[i:]\r\n return output_list\r\n\r\n def sort(li):\r\n if len(li) < 2:\r\n return li\r\n mid = len(li) // 2\r\n left = sort(li[:mid])\r\n right = sort(li[mid:])\r\n return merge(left, right)\r\n\r\n return sort(l)\r\n\r\n\r\ndef main_function():\r\n is_len_greater_than_5 = False\r\n does_contain_digit = False\r\n does_contain_upper = False\r\n does_contain_lower = False\r\n password = input()\r\n if len(password) >= 5:\r\n is_len_greater_than_5 = True\r\n for i in password:\r\n if i.isdigit():\r\n does_contain_digit = True\r\n elif i.isupper():\r\n does_contain_upper = True\r\n elif i.islower():\r\n does_contain_lower = True\r\n if is_len_greater_than_5 and does_contain_lower and does_contain_upper and does_contain_digit:\r\n return \"Correct\"\r\n return \"Too weak\"\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "pw = input()\r\nstrong = False\r\nif len(pw) >= 5:\r\n for i in pw:\r\n if i.isupper() == True:\r\n for y in pw:\r\n if y.islower() == True:\r\n for x in pw:\r\n if x.isdigit() == True:\r\n strong = True\r\nif strong == True:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "w = 0\r\nx = 0\r\nz = 0\r\n\r\na = input()\r\nif len(a) >= 5:\r\n for i in a:\r\n if i.islower():\r\n w = 1\r\n if i.isupper():\r\n x = 1\r\n if i.isnumeric():\r\n z = 1\r\nif w == 1 and x == 1 and z == 1:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "i=input()\r\na,b,c=0,0,0\r\nl=[\"!\",\"?\",\".\",\",\",\"_\"]\r\nif len(i)<5:\r\n\tprint(\"Too weak\")\r\nelse:\r\n\tfor x in i:\r\n\t\tif x==\" \" or x in l:\r\n\t\t\tcontinue\r\n\t\telif 65<=ord(x)<=90:\r\n\t\t\ta+=1\r\n\t\telif 97<=ord(x)<=122:\r\n\t\t\tb+=1\r\n\t\telif 48<=ord(x)<=57:\r\n\t\t\tc+=1\r\n\tprint([\"Too weak\",\"Correct\"][a>0 and b>0 and c>0])", "s = input()\r\nif s.lower() != s and s.upper() != s and len([x for x in s if x.isdigit() == True]) != 0 and len(s) >= 5:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "import re\r\nf = input().strip()\r\nif re.compile('[0-9]+').findall(f)and re.compile('[a-z]+').findall(f)and re.compile('[A-Z]+').findall(f)and len(f) > 4:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "s=input()\r\nu,l,k=False,False,False\r\nfor i in s:\r\n if i.isupper():\r\n u=True\r\n if i.islower():\r\n l=True\r\n if i.isdigit():\r\n k=True\r\nif u and k and l and len(s) >= 5:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "s = input()\r\nres = True\r\nif len(s) < 5:\r\n res = False\r\nflag1 = False\r\nflag2 = False\r\nflag3 = False\r\nfor i in range(len(s)):\r\n if (ord(s[i]) >= ord('A')) and (ord(s[i]) <= ord('Z')):\r\n flag1 = True\r\n if (ord(s[i]) >= ord('a')) and (ord(s[i]) <= ord('z')):\r\n flag2 = True\r\n if (ord(s[i]) >= ord('0')) and (ord(s[i]) <= ord('9')):\r\n flag3 = True\r\nres = res & flag1 & flag2 & flag3\r\nif res:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "s = input()\r\ndigit = 0\r\nchar = 0\r\nlarge = 0\r\nsmall = 0\r\nif len(s) < 5:\r\n\tprint(\"Too weak\")\r\n\texit()\r\nfor i in s:\r\n\tif i.isdigit():\r\n\t\tdigit+=1\r\n\telif i.isupper():\r\n\t\tlarge+=1\r\n\telif i.islower():\r\n\t\tsmall+=1\r\n\telse:\r\n\t\tchar+=1\r\nif large >= 1 and small >= 1 and digit >= 1:\r\n\tprint(\"Correct\")\r\nelse:\r\n\tprint(\"Too weak\")", "password = input()\r\nup = False\r\nlow = False\r\ndig = False\r\nlength = False\r\nfor i in password:\r\n if i.isupper():\r\n up = True\r\n if i.islower():\r\n low = True\r\n if i.isdigit():\r\n dig = True\r\nif len(password) >= 5:\r\n length = True\r\nif up and low and dig and length:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "st = input()\r\nnum = 0\r\nfor x in st:\r\n if x.isupper() and len(st) >= 5:\r\n num += 2\r\n break\r\nfor y in st:\r\n if y.islower() and len(st) >= 5:\r\n num += 1\r\n break\r\nfor z in st:\r\n if z.isdigit() and len(st) >= 5:\r\n num += 1\r\n break\r\nif num == 4:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "x=input()\r\nl=0\r\nU=0\r\nlo=0\r\nd=0\r\nif len(x)>=5:\r\n l=1\r\nfor i in x:\r\n if i.isupper():\r\n U=1\r\nfor i in x:\r\n if i.islower():\r\n lo=1\r\nfor i in x:\r\n if i.isdigit():\r\n d=1\r\nif l and U and lo and d:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "s = input()\r\n\r\nln = cap = low = digit = False\r\n\r\n\r\nfor char in s:\r\n if len(s) > 4:\r\n ln = True\r\n if char.isupper():\r\n cap = True\r\n if char.islower():\r\n low = True\r\n if char.isdigit():\r\n digit = True\r\n\r\nif ln == cap == low == digit != False:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n\r\n", "def pass_check(passw):\r\n is_large = 0 \r\n is_small = 0\r\n if len(passw) < 5 :\r\n print(\"Too weak\")\r\n return\r\n if \"0\" not in passw and \"1\" not in passw and \"2\" not in passw and \"3\" not in passw and \"4\" not in passw and \"5\" not in passw and \"6\" not in passw and \"7\" not in passw and \"8\" not in passw and \"9\" not in passw:\r\n print(\"Too weak\")\r\n return\r\n for i in passw:\r\n if ord(i) in range(65,91):\r\n is_large = 1\r\n elif ord(i) in range(97,123):\r\n is_small = 1\r\n if is_large == 1 and is_small ==1:\r\n print(\"Correct\")\r\n return\r\n else:\r\n print(\"Too weak\")\r\n return\r\n\r\n\r\n \r\npass_check(input())", "n = input()\r\nprint([\"Too weak\", \"Correct\"][len(n)>=5 and any([x for x in n if x in 'qwertyuiopasdfghjklzxcvbnm']) and any([x for x in n if x in 'QWERTYUIOPASDFGHJKLZXCVBNM']) and any([x for x in n if x in '1234567890'])])", "password = input()\nupper_characters = []\nlower_characters = []\ndigits = []\n\nfor s in password:\n if s.isupper():\n upper_characters.append(s)\n elif s.islower():\n lower_characters.append(s)\n elif s.isdigit():\n digits.append(s)\n\nif len(password) >= 5 and len(upper_characters) >= 1 and len(lower_characters) >= 1 and len(digits) >= 1:\n print('Correct')\nelse:\n print('Too weak')", "a=input()\r\nif(len(a)>=5):\r\n f1=False\r\n f2=False\r\n f3=False\r\n for i in range(len(a)):\r\n if(65<=ord(a[i])<=90):\r\n f1=True\r\n elif(97<=ord(a[i])<=122):\r\n f2=True\r\n elif(48<=ord(a[i])<=57):\r\n f3=True\r\n if(f1 and f2 and f3):print(\"Correct\")\r\n else:print(\"Too weak\")\r\nelse:print(\"Too weak\") ", "s = input()\r\na, b, c = 0, 0, 0\r\n\r\nfor i in s:\r\n if 47 < ord(i) < 58:\r\n a += 1\r\n break\r\n\r\nfor j in s:\r\n if 64 < ord(j) < 91:\r\n b += 1\r\n break\r\n\r\n\r\nfor k in s:\r\n if 96 < ord(k) < 123:\r\n c += 1\r\n break\r\n\r\nif len(s) > 4:\r\n if a != 0 and b != 0 and c != 0:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\") \r\nelse:\r\n print(\"Too weak\") ", "s=str(input())\r\ncount1 = sum(1 for elem in s if elem.isupper())\r\ncount2 = sum(1 for elem in s if elem.islower())\r\ncount3 = sum(1 for elem in s if elem.isdigit())\r\nif len(s)>4 and count1>0 and count2>0 and count3>0:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n \r\n ", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n S = wtf[0]\r\n ans = [False]*4\r\n ans[0] = len(S) >= 5\r\n for s in S:\r\n if ans[1] is False:\r\n ans[1] = s.isdigit()\r\n if ans[2] is False:\r\n ans[2] = s.isupper()\r\n if ans[3] is False:\r\n ans[3] = s.islower()\r\n print('Correct' if all(ans) else 'Too weak')\r\n", "s=input()\r\nprint(\"Correct\" if (len(s)>=5 and any(c.isupper() for c in s) and any(c.islower() for c in s) and any(c.isdigit() for c in s)) else \"Too weak\")", "\"\"\"\nProblem https://codeforces.com/problemset/problem/411/A\nAuthor: @byandrev - https://github.com/byandrev\n\"\"\"\n\nchar_arr = [\"!\", \"?\", \".\", \",\", \"_\"]\n\n\ndef solve():\n password = input()\n ans = False\n\n characters = 0\n largeLetter = 0\n smallLetter = 0\n digits = 0\n\n for letter in password:\n asciiCode = ord(letter)\n\n if asciiCode >= 48 and asciiCode <= 57:\n digits += 1\n characters += 1\n elif asciiCode >= 65 and asciiCode <= 90:\n largeLetter += 1\n characters += 1\n elif asciiCode >= 97 and asciiCode <= 122:\n smallLetter += 1\n characters += 1\n\n if letter in char_arr:\n characters += 1\n\n ans = characters >= 5 and largeLetter >= 1 and smallLetter >= 1 and digits >= 1\n\n if ans:\n print(\"Correct\")\n else:\n print(\"Too weak\")\n\n\nsolve()\n", "s = input()\r\ncountup = countdown = countdigit = 0\r\nfor i in range(len(s)):\r\n\tif s[i].isupper():\r\n\t\tcountup+=1\r\n\telif s[i].islower():\r\n\t\tcountdown+=1\r\n\telif s[i].isdigit():\r\n\t\tcountdigit+=1\r\nif countdigit==0 or countdown==0 or countup==0 or len(s)<5:\r\n\tprint(\"Too weak\")\r\nelse:\r\n\tprint(\"Correct\")", "s=input()\r\nif len(s)<5:\r\n\tprint(\"Too weak\")\r\nelse:\r\n\tn=len(s)\r\n\ta=[]\r\n\tb=[]\r\n\tc=[]\r\n\tfor i in range(n):\r\n\t\tif s[i].isupper():\r\n\t\t\ta.append(s[i])\r\n\t\telif s[i].islower():\r\n\t\t\tb.append(s[i])\r\n\t\telif s[i].isnumeric():\r\n\t\t\tc.append(s[i])\r\n\tif len(a)==0 or len(b)==0 or len(c)==0:\r\n\t\tprint(\"Too weak\")\r\n\telse:\r\n\t\tprint(\"Correct\")", "\r\nimport random,math,itertools,string,time\r\n#from turtle import title \r\n#import matplotlib.pyplot as pl\r\n#import numpy as np\r\n'''\r\nx = np.linspace(1,10,4)\r\ny= x**2 +2 +np.exp (x )+1\r\ngraph =pl.plot (x,y,label='legende')\r\npl.show()\r\nprint(y)\r\n'''\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef reverse (sentence) :\r\n \r\n i,j = 0,len(sentence)-1\r\n while i<j:\r\n sentence[i],sentence[j] = sentence[j],sentence[i]\r\n i = i+1\r\n j = j-1\r\n return (\"{}\".format(sentence) )\r\n\r\ndef dec_to_bin(a):\r\n n = a\r\n value = list()\r\n base = 2\r\n while n > 0:\r\n \r\n r = n % base\r\n n//=base\r\n value.append(r)\r\n\r\n reverse(value) \r\n return (value) \r\n\r\n\r\ndef is_leap(year):\r\n leap = False\r\n if year%4==0 and (year%100) !=0:\r\n leap =True\r\n if year%400==0:\r\n leap =True\r\n return leap\r\n\r\ndef swap (a,i,j):\r\n temp=a[i]\r\n a[i]=a[j]\r\n a[j]=temp\r\n \r\nstarttime =time.time()\r\n\r\n# Write your code here\r\ndef veri (ss,i):\r\n c=0\r\n no=0\r\n #temp = list()\r\n for a in range(len(ss)-1):\r\n if ss[a] ==ss[a+1] or int(ss[a]) ==0 :\r\n no=1\r\n return 0\r\n else:\r\n \r\n c+= int( ss[a])\r\n #temp.append(ss[a])\r\n \r\n if c >i:\r\n return 0\r\n \r\n \r\n if int(ss[-1])!= 0 and no!=1:\r\n c+= int(ss[-1])\r\n #temp.append(ss[-1])\r\n #print(c,no)\r\n #print(temp)\r\n if c== i and '0' not in ss:\r\n return 1\r\n else:\r\n #print(c,i,ss)\r\n return 0\r\n'''nums =[17.4, 4.7, 18.41, 12.33, 0.0, 7.49, 1.05, 5.33, 15.22, 0.0, 8.52, 5.21, 10.52, 0.0, 4.35, 6.18, 2.21, 1.17, 0.45, 1.56, 0.88, 5.13, 8.61, 2.84, 4.21, 9.16, 13.87, 3.37, 9.95, 2.27, 1.39, 5.71, 6.16, 5.95, 10.08, 8.44]\r\na,b =list(),list()\r\nlessthannine =list()\r\nnineandtwelve = list()\r\nmorethantwelve = list()\r\nfor s in nums:\r\n if s>=6 and s<9:\r\n a.append(s)\r\n if s<9 :\r\n lessthannine.append(s)\r\n if s>=9 and s<12:\r\n nineandtwelve.append(s)\r\n if s >12:\r\n morethantwelve.append(s)\r\nprint(len(lessthannine),len(nineandtwelve),len(morethantwelve))\r\n\r\n'''\r\n\r\ndef prime(i):\r\n c=0\r\n if i==1:\r\n return 0\r\n if i == 2:\r\n return 1 \r\n else:\r\n\r\n for a in range(2,i+1):\r\n if i% a ==0:\r\n c+=1\r\n if c>1:\r\n return 0\r\n else:\r\n return 1\r\n\r\ndef sof(c):\r\n s= 0 \r\n for i in str(c):\r\n s+=int(i)\r\n return s\r\n\r\np = str(input(''))\r\nd,l,s= 0,0 ,0\r\nfor letter in p:\r\n try:\r\n if letter.isupper():\r\n l+=1\r\n elif letter.islower():\r\n s+=1\r\n elif letter.isdigit():\r\n d+=1\r\n except:\r\n pass\r\nif len(p) <5 or d==0 or l==0 or s ==0:\r\n print('Too weak')\r\n\r\nelse :\r\n print('Correct')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n'''\r\nt= int(input(''))\r\nfor k in range(t):\r\n n=int(input(''))\r\n num= input(\"\").rsplit()\r\n if sorted(num)== num:\r\n print( (' ').join(num))\r\n else:\r\n temp= num\r\n for i in range(n-1):\r\n if int(temp[i]) > int(temp[i+1]):\r\n swap (temp,i,i+1)\r\n break\r\n print(' '.join(temp))\r\n '''", "a=input()\r\nk=0\r\nif len(a)>=5:\r\n k+=1\r\n for i in range(len(a)):\r\n if 65<=ord(a[i])<=90:\r\n k+=1\r\n break\r\n for i in range(len(a)):\r\n if 97<=ord(a[i])<=122:\r\n k+=1\r\n break\r\n for i in range(len(a)):\r\n if 48<=ord(a[i])<=57:\r\n k+=1\r\n break\r\nif k==4:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "a = input().strip()\r\nflag1 = 0\r\nflag2 = 0\r\nflag3 = 0\r\nfor i in range(26):\r\n if chr(i + ord('a')) in a:\r\n flag1 = 1\r\n if chr(i + ord('A')) in a:\r\n flag2 = 1\r\n if str(i % 10) in a:\r\n flag3 = 1\r\nif len(a) >= 5 and flag1*flag2*flag3 == 1:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "def check(): \r\n pwd=input()\r\n count=0\r\n while True:\r\n for i in range(len(pwd)):\r\n if count==0 and len(pwd)>=5:\r\n count+=1\r\n break\r\n if count==1 and pwd[i]>='a' and pwd[i]<='z':\r\n count+=1\r\n break\r\n if count==2 and pwd[i]>='A' and pwd[i]<='Z':\r\n count+=1\r\n break\r\n if count==3 and pwd[i]>='0' and pwd[i]<='9':\r\n print('Correct')\r\n return\r\n if i==len(pwd)-1:\r\n print('Too weak')\r\n return\r\n \r\ncheck()", "s=input()\r\nu,l,d=map(lambda x:sum(map(x, s)),[str.isupper,str.islower,str.isdigit])\r\n\r\nprint([\"Too weak\",\"Correct\"][(len(s)>=5)*u*l*d!=0])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Nov 1 01:08:40 2017\r\n\r\n@author: tarek\r\n\"\"\"\r\n\r\ndef is_small(letter):\r\n if (letter >= 'a' and letter <= 'z'):\r\n return True\r\n else:\r\n return False\r\n\r\ndef is_big(letter):\r\n if (letter >= 'A' and letter <= 'Z'):\r\n return True\r\n else:\r\n return False\r\n\r\ndef is_digit(letter):\r\n if (letter >= '0' and letter <= '9'):\r\n return True\r\n else:\r\n return False\r\n \r\ndef is_strong(to_check):\r\n length = len(to_check)\r\n at_least_big = False\r\n at_least_small = False\r\n at_least_digit = False\r\n for i in range(len(to_check)):\r\n if(is_small(to_check[i])):\r\n at_least_small = True\r\n if(is_big(to_check[i])):\r\n at_least_big = True\r\n if(is_digit(to_check[i])):\r\n at_least_digit = True\r\n if(at_least_big == True and at_least_small == True and at_least_digit == True and length >= 5):\r\n return True\r\n return False\r\n\r\npassword = input()\r\nif (is_strong(password)):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n ", "p = list(input())\r\n\r\ndef hasupper():\r\n for i in p:\r\n if ord(i) >= 65 and ord(i) <= 90:\r\n return True\r\n return False\r\ndef haslower():\r\n for i in p:\r\n if ord(i) >= 97 and ord(i) <= 122:\r\n return True\r\n return False\r\ndef hasdigit():\r\n for i in p:\r\n if ord(i) >= 48 and ord(i) <= 57:\r\n return True\r\n return False\r\n\r\nif len(p) < 5 or not hasupper() or not haslower() or not hasdigit():\r\n print(\"Too weak\")\r\nelse:\r\n print(\"Correct\")\r\n", "pw = list(input())\r\ncount1 = count2 = count3 = 0\r\nif len(pw) >= 5:\r\n for i in range(len(pw)):\r\n if pw[i].isupper():\r\n count1 = count1 +1\r\n elif pw[i].islower():\r\n count2 = count2 + 1\r\n elif pw[i].isdigit():\r\n count3 = count3 + 1\r\nif count1 and count2 and count3 >= 1:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "password=input()\r\nu=l=d=s=0\r\nif len(password)<5:\r\n print(\"Too weak\")\r\nelse:\r\n for i in password:\r\n if i.isupper():\r\n u=1\r\n elif i.islower():\r\n l=1\r\n elif i.isdigit():\r\n d=1\r\n else:\r\n s=1\r\n if u==1 and l==1 and d==1:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")", "pw=input()\r\nlength=False\r\nlel=False\r\nsel=False\r\ncod=False\r\nif len(pw)>=5:\r\n\tlength=True\r\nfor i in range(len(pw)):\r\n\tts=pw[i]\r\n\tif ts.islower():\r\n\t\tsel=True\r\n\tif ts.isupper():\r\n\t\tlel=True\r\n\tif ts.isdigit():\r\n\t\tcod=True\r\nif length and sel and lel and cod:\r\n\tprint(\"Correct\")\r\nelse:\r\n\tprint(\"Too weak\")", "s = input()\r\ndigit = False\r\nupper = False\r\nlower = False\r\n\r\nfor i in range(len(s)):\r\n if s[i].isdigit():\r\n digit = True\r\n if s[i].isupper():\r\n upper = True\r\n if s[i].islower():\r\n lower = True\r\n\r\nif len(s) >= 5 and digit and upper and lower:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "line = input()\r\nlength = False\r\nlittle = False\r\nbig = False\r\nnumber = False\r\nlength = (len(line) > 4)\r\nfor symbol in line:\r\n if '0' <= symbol <= '9':\r\n number = True\r\n elif 'a' <= symbol <= 'z':\r\n little = True\r\n elif 'A' <= symbol <= 'Z':\r\n big = True\r\nif length and little and big and number:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "s = input()\nup, low, digit = False, False, False\nfor ch in s:\n if ch.isdigit():\n digit = True\n elif ch.isalpha():\n if ch.isupper():\n up = True\n else:\n low = True\nif len(s) >= 5 and up and low and digit:\n print('Correct')\nelse:\n print('Too weak')\n\n", "s = input()\r\nsmall = 0\r\ncap = 0\r\ndigit = 0\r\nif len(s) < 5:\r\n print(\"Too weak\")\r\nelse:\r\n l = list(s)\r\n for i in range(len(l)):\r\n if 97 <= ord(l[i]) <= 122:\r\n small = 1\r\n if 65 <= ord(l[i]) <= 91:\r\n cap = 1\r\n if 48 <= ord(l[i]) <= 57:\r\n digit = 1\r\n if small and cap and digit:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n", "s=input()+\"?\"\r\nprint([\"Too weak\",\"Correct\"][(len(s)>=6)&(len(set([(i.isupper(),i.islower(),i.isdigit()) for i in s]))==4)])", "s = input()\r\nprint(('Too weak', 'Correct')[len(s) > 4 and any(ord(i) in range(65, 92) for i in s) and any(ord(i) in range(97, 124) for i in s) and any(i in '1234567890' for i in s)])", "s, ok1, ok2, ok3 = input(), False, False, False\r\nif len(s) < 5: print(\"Too weak\")\r\nelse:\r\n for x in s:\r\n if 48 <= ord(x) <= 57: ok1 = True\r\n elif 65 <= ord(x) <= 90: ok2 = True\r\n elif 97 <= ord(x) <= 122: ok3 = True\r\n if ok1 and ok2 and ok3: print(\"Correct\")\r\n else: print(\"Too weak\")", "pwd = input()\r\nif len(pwd)<5:\r\n print('Too weak')\r\nelse:\r\n hasUpper = False\r\n hasLower = False\r\n hasDigit = False\r\n for c in pwd:\r\n if c.islower():\r\n hasLower = True\r\n if c.isupper():\r\n hasUpper = True\r\n if c.isdigit():\r\n hasDigit = True\r\n if hasUpper and hasDigit and hasLower:\r\n print('Correct')\r\n else:\r\n print('Too weak')\r\n", "def solve():\r\n s = input()\r\n\r\n if len(s) < 5:\r\n return \"Too weak\"\r\n \r\n large = False\r\n small = False\r\n digit = False\r\n\r\n for letter in s:\r\n if letter.islower():\r\n small = True\r\n if letter.isupper():\r\n large = True\r\n if letter.isnumeric():\r\n digit = True\r\n \r\n if large and small and digit:\r\n return \"Correct\"\r\n return \"Too weak\"\r\n\r\nprint(solve())", "p = input()\r\na = len(p) > 4\r\nb = any(s.isdigit() for s in p)\r\nc = any(s.islower() for s in p)\r\nd = any(s.isupper() for s in p)\r\nprint(\"Correct\" if all([a, b, c, d]) else \"Too weak\")", "y = [i for i in input()]\nx= set(y)\nnum= set([i for i in \"0123456789\"])\nA= set([i for i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"])\na=set([i for i in \"abcdefghijklmnopqrstuvwxyz\"])\n\nif len(y) >=5 and len(A.intersection(x))>0 and len(a.intersection(x))>0 and len(num.intersection(x))>0 :\n\tprint(\"Correct\")\nelse:\n\tprint(\"Too weak\")\n\n", "\nimport re\n\npsw = input()\n\nif (len(psw) < 5):\n print(\"Too weak\")\nelif (not re.findall(r'[A-Z]', psw)):\n print(\"Too weak\")\nelif (not re.findall(r'[a-z]', psw)):\n print(\"Too weak\")\nelif (not re.findall(r'[0-9]', psw)):\n print(\"Too weak\")\nelse:\n print(\"Correct\")\n\n \t\t \t \t \t \t \t\t \t \t", "# so 48 - 57\r\n# hoa 65 - 90\r\n# thuong 97 - 122\r\npas = input()\r\ncheck = 0\r\nif len(pas) < 5:\r\n print(\"Too weak\")\r\nelse:\r\n checkLen = True\r\n checkNum = False\r\n checkUp = False\r\n checkLow = False\r\n for i in pas:\r\n if ord(i) in range(48, 58):\r\n checkNum = True\r\n if ord(i) in range(65, 91):\r\n checkUp = True\r\n if ord(i) in range(97, 123):\r\n checkLow = 1\r\n if checkNum == True and checkUp == True and checkLow == True:\r\n break\r\n if checkNum == True and checkUp == True and checkLow == True:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n", "s = input()\r\nk, l, m = False, False, False\r\nfor i in s:\r\n if i.isupper():\r\n k = True\r\n \r\n if i.islower():\r\n l = True\r\n \r\n if i.isdigit():\r\n m = True\r\n\r\nif (len(s)>4 and k and l and m):\r\n print(\"Correct\")\r\n \r\nelse:\r\n print(\"Too weak\")\r\n", "chars = list(input())\nlength = False\nupper = False\nlower = False\ndigit = False\n\nif len(chars) >= 5:\n\tlength = True\n\nfor char in chars:\n\tif char.islower() == True:\n\t\tlower = True\n\telif char.isupper() == True:\n\t\tupper = True\n\telif char.isdigit() == True:\n\t\tdigit = True\n\nif length == True and upper == True and lower == True and digit == True:\n\tprint(\"Correct\")\nelse:\n\tprint(\"Too weak\")", "#Davidson Lisboa Della Piazza, 169786\n\ndef checkPWD(senha):\n lenght = len(senha)\n if(lenght<5):\n print(\"Too weak\")\n return\n else:\n lenght = True\n hasUpper = False\n hasLower = False\n hasDig = False\n for i in range(len(senha)):\n if(lenght and hasUpper and hasLower and hasDig):\n print(\"Correct\")\n return\n if(senha[i].isupper()):\n hasUpper = True\n elif(senha[i].islower()):\n hasLower = True\n elif(senha[i]==\"0\" or senha[i]==\"1\" or senha[i]==\"2\" or senha[i]==\"3\" or senha[i]==\"4\" or senha[i]==\"5\" \n or senha[i]==\"6\" or senha[i]==\"7\" or senha[i]==\"8\" or senha[i]==\"9\"):\n hasDig = True\n print(\"Too weak\")\n return\n\nstring = input()\nstring = list(string)\ncheckPWD(string)\n \t\t \t\t \t \t \t\t \t\t", "s = input()\r\nx = ''\r\n\r\nif any(i.islower() for i in s) and any(i.isupper() for i in s) and any(i.isdigit() for i in s) and len(s) >= 5:\r\n print('Correct')\r\nelse:\r\n print(\"Too weak\")", "s=input()\r\nl=list(s)\r\nl1=[\"!\", \"?\", \".\", \",\", \"_\"]\r\nch=0\r\nlo=0\r\nd=0\r\nup=0\r\n\r\nif(len(l)>=5):\r\n for i in range(0,len(l)):\r\n if(l[i]>='A' and l[i]<='Z'):\r\n lo=lo+1\r\n break\r\n for i in range(0,len(l)):\r\n if(l[i]>='a' and l[i]<='z'):\r\n up=up+1\r\n break\r\n for i in range(0,len(l)):\r\n if(l[i].isdigit()):\r\n d=d+1\r\n break\r\n if(up>0 and lo>0 and d>0):\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\nelse:\r\n print(\"Too weak\")\r\n", "s=input()\r\n_len=False\r\n_az=False\r\n_AZ=False\r\n_19=False\r\nif len(s)>=5: _len=True\r\nfor i in range (len(s)):\r\n if s[i] in 'QWERTYUIOPASDFGHJKLZXCVBNM': _AZ=True\r\n if s[i] in 'qwertyuiopasdfghjklzxcvbnm': _az=True\r\n if s[i] in '1234567890': _19=True\r\nif _len and _AZ and _az and _19: print('Correct')\r\nelse: print('Too weak')", "def main():\n s = input()\n if len(s) < 5:\n print(\"Too weak\")\n return\n score = 0\n lower, upper, digit = False, False, False\n for c in s:\n if not lower and c.islower():\n score += 1\n lower = True\n if not upper and c.isupper():\n score += 1\n upper = True\n if not digit and c.isdigit():\n score += 1\n digit = True\n if score == 3:\n break\n if score == 3:\n print(\"Correct\")\n else:\n print(\"Too weak\")\n\n\nif __name__ == '__main__':\n main()", "import string\r\nlow = string.ascii_lowercase\r\nhigh = string.ascii_uppercase\r\ndigits = \"1234567890\"\r\ns = input()\r\nlower = 0\r\nupper = 0\r\ndigit = 0\r\n\r\nfor i in s:\r\n if i in low:\r\n lower+=1\r\n elif i in high:\r\n upper+=1\r\n elif i in digits:\r\n digit+=1\r\nif digit > 0 and lower > 0 and upper > 0 and len(s) >= 5:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n\r\n", "maiusculas = \"QWERTYUIOPASDFGHJKLÇZXCVBNM\"\nminusculas = \"qwertyuiopasdfghjklçzxcvbnm\"\ndigitos = \"1234567890\"\n\na = input()\n\nif (any(filter(lambda x: x in maiusculas, a)) and any(filter(lambda x: x in minusculas, a)) and any(filter(lambda x: x in digitos, a)) and len(a) >= 5):\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n\n\t\t\t\t\t \t \t \t\t \t \t\t \t \t \t", "import re\n\npassword = input()\n\n\ndef verify():\n if len(password) < 5:\n return 'Too weak'\n\n if re.search('[A-Z]', password) == None or re.search('[a-z]', password) == None or re.search('\\d', password) == None:\n return 'Too weak'\n\n return 'Correct'\n\n\nprint(verify())\n\n\t\t \t \t\t \t \t \t \t \t \t \t \t \t", "password = input()\nlower, upper, digit = 0, 0, 0\nfor char in password:\n if char.islower():\n lower = 1\n if char.isupper():\n upper = 1\n if char.isdigit():\n digit = 1\n\nif len(password) >= 5 and lower and upper and digit:\n print(\"Correct\")\nelse:\n print(\"Too weak\")", "# A. Password Check\r\n\r\nfrom string import ascii_lowercase\r\nfrom string import ascii_uppercase\r\n\r\nans = False\r\n\r\ns = input()\r\n\r\nis_len = True if len(s) >= 5 else False\r\n\r\nif is_len:\r\n is_lower = False\r\n is_upper = False\r\n is_digit = False\r\n\r\n for ch in s:\r\n if ch.lower() and ch in ascii_lowercase:\r\n is_lower = True\r\n if ch.upper() and ch in ascii_uppercase:\r\n is_upper = True\r\n if ch.isdigit():\r\n is_digit = True\r\n\r\n if is_lower and is_upper and is_digit:\r\n ans = True\r\n\r\nif ans:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "def check(alpha, s):\r\n for i in range(len(s)):\r\n if alpha.find(s[i]) != -1:\r\n return 1\r\n return 0\r\ns = input()\r\nll = \"qewrtyuiopasdfghjklzxcvbnm\"\r\nbl = \"QWERTYUIOPASDFGHJKLZXCVBNM\"\r\nd = \"0123456789\"\r\nif len(s) > 4 and check(ll,s) and check(bl,s) and check(d,s):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "x=u=l=d=0\r\nfor c in input():\r\n u|=c.isupper()\r\n l|=c.islower()\r\n d|=c.isdigit()\r\n x+=1\r\nprint('TCooor rweecatk'[u&l&d&(x>4)::2])", "def check(s):\r\n x = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\n y = 'abcdefghijklmnopqrstuvwxyz'\r\n z = '0123456789'\r\n if len(s) < 5:\r\n return False\r\n if len(list(set(list(s)) & set(list(x)))) == 0:\r\n return False\r\n if len(list(set(list(s)) & set(list(y)))) == 0:\r\n return False \r\n if len(list(set(list(s)) & set(list(z)))) == 0:\r\n return False \r\n return True\r\ns = input()\r\nif check(s):\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "t = input()\r\nAlpha = False\r\nalpha = False\r\ncount = False\r\nif len(t) < 5:\r\n print(\"Too weak\")\r\nelse:\r\n for i in range(len(t)):\r\n if t[i].isupper():\r\n Alpha = True\r\n elif t[i].islower():\r\n alpha = True\r\n elif t[i].isdigit():\r\n count = True\r\n if Alpha == alpha == count == True:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 1/14/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\ndef check(password):\n if len(password) < 5:\n return False\n \n hasUpper = any([v in [chr(ord('A')+i) for i in range(26)] for v in password])\n hasLower = any([v in [chr(ord('a')+i) for i in range(26)] for v in password])\n \n if not hasLower or not hasUpper:\n return False\n \n hasDigit = any([v in [str(i) for i in range(10)] for v in password])\n if not hasDigit:\n return False\n \n return True\n\n\npassword = input()\nvalid = check(password)\nprint('Correct' if valid else 'Too weak')", "import string\na = input()\nf1=len(a)>4\nf2=True if sum([1 if i in string.ascii_lowercase else 0 for i in a])>0 else False\nf3=True if sum([1 if i in string.ascii_uppercase else 0 for i in a])>0 else False\nf4=True if sum([1 if i in '0123456789' else 0 for i in a])>0 else False\nif f1 and f2 and f3 and f4:print('Correct')\nelse: print('Too weak')", "s=str(input())\r\nd=0\r\nu=0\r\nl=0\r\nfor i in range(len(s)):\r\n if s[i].isupper():\r\n u+=1\r\n elif s[i].islower():\r\n l+=1\r\n elif s[i].isnumeric():\r\n d+=1\r\nif len(s)>=5 and u>=1 and l>=1 and d>=1:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n\r\n", "word = list(input())\r\ndig = up = low = 0\r\nif len(word) >= 5:\r\n for i in word:\r\n if i in list('0123456789'): dig += 1\r\n elif i.isupper() == True: up += 1\r\n elif i.islower() == True: low += 1\r\nif dig!=0 and up!= 0 and low!= 0: print('Correct')\r\nelse: print('Too weak')", "a=input()\r\nt=0\r\nif len(a)>=5:\r\n t+=1\r\nfor i in range(len(a)):\r\n if ord(a[i])>=ord('A') and ord(a[i])<=ord('Z'):\r\n t+=1\r\n break\r\nfor i in range(len(a)):\r\n if ord(a[i])>=ord('a') and ord(a[i])<=ord('z'):\r\n t+=1\r\n break\r\nb='0123456789'\r\nf=0\r\nfor i in range(len(a)):\r\n if f==0:\r\n for j in range(10):\r\n if a[i]==b[j]:\r\n t=t+1\r\n f=1\r\nif t==4:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "def main():\r\n string = input()\r\n\r\n flag1, flag2, flag3 = False, False, False\r\n for character in string:\r\n if character.isupper():\r\n flag1 = True\r\n elif character.islower():\r\n flag2 = True\r\n elif character.isdigit():\r\n flag3 = True\r\n if flag1 and flag2 and flag3 and len(string) >= 5:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = input()\r\nif len(a) < 5:\r\n print('Too weak')\r\n exit(0)\r\narr = [0] * 3\r\nfor el in a:\r\n if el.isupper():\r\n arr[0] = 1\r\n if el.islower():\r\n arr[1] = 1\r\n if (ord(el) >= ord('0')) and ord(el) <= ord('9'):\r\n arr[2] = 1\r\nif not all(arr):\r\n print('Too weak')\r\nelse:\r\n print('Correct')", "s=input()\r\nif len(s)<5:\r\n\tprint('Too weak')\r\nelse:\r\n\tc=0\r\n\tfor i in s:\r\n\t\tif i.isupper():\r\n\t\t\tc+=1\r\n\t\t\tbreak\r\n\tfor i in s:\r\n\t\tif i.islower():\r\n\t\t\tc+=1\r\n\t\t\tbreak\r\n\tfor i in s:\r\n\t\tif i.isnumeric():\r\n\t\t\tc+=1\r\n\t\t\tbreak\r\n\tprint(['Too weak','Correct'][c==3])", "str = input()\nsmall = 0\nbig = 0\nnum = 0\nfor i in range(10):\n if chr(i + ord('0')) in str:\n num = 1\nfor i in range(26):\n if chr(i + ord('a')) in str:\n small = 1\nfor i in range(26):\n if chr(i + ord('A')) in str:\n big = 1\nif len(str) >= 5 and big and small and num:\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n", "s = input().strip()\r\nflag1 = len(s) >= 5\r\nd1 = 'qwertyuiopasdfghjklzxcvbnm'\r\nd2 = 'QWERTYUIOPASDFGHJKLZXCVBNM'\r\nd3 = '1234567890'\r\nflag2 = False\r\nflag3 = False\r\nflag4 = False\r\n\r\nfor i in d1:\r\n if i in s:\r\n flag2 = True\r\nfor i in d2:\r\n if i in s:\r\n flag3 = True\r\nfor i in d3:\r\n if i in s:\r\n flag4 = True \r\nif(flag1 and flag2 and flag3 and flag4):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n\r\n ", "n = str(input())\n\nif len(n) >= 5:\n\thasLarge = False\n\thasSmall = False\n\thasDigit = False\n\tfor i in n:\n\t\tif i.isalpha() and i == i.upper():\n\t\t\thasLarge = True\n\t\tif i.isalpha() and i == i.lower():\n\t\t\thasSmall = True\n\t\ttry:\n\t\t\ttemp = int(i)\n\t\t\thasDigit = True\n\t\texcept ValueError:\n\t\t\tcontinue\n\tif hasDigit and hasSmall and hasLarge:\n\t\tprint(\"Correct\")\n\telse:\n\t\tprint(\"Too weak\")\nelse:\n\tprint(\"Too weak\")\n \t\t \t\t \t\t\t\t\t \t \t \t \t\t\t \t", "s = input()\nans = \"Correct\"\nif len(s) < 5:\n ans = \"Too weak\"\na = 0\nb = 0\nc = 0\nfor i in range(len(s)):\n if s[i].isalpha():\n if s[i].isupper():\n a += 1\n else:\n b += 1\n if s[i].isdigit():\n c += 1\nif a == 0 or b == 0 or c == 0:\n ans = \"Too weak\"\nprint(ans)\n", "senha = input()\n\nlen_senha = 0\nlarge = False\nsmall = False\ndigito = False\n\nfor x in senha:\n len_senha += 1\n if '1' <= x <= '9':\n digito = True\n\n if 'a' <= x <= 'z':\n small = True\n\n if 'A' <= x <= 'Z':\n large = True\n\n\n\nif len_senha >= 5 and small and digito and large:\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n \t\t\t\t\t\t \t\t\t \t \t \t\t\t\t\t \t\t \t", "s = input().strip()\r\n\r\nif len(s) < 5:\r\n\tprint(\"Too weak\")\r\n\texit()\r\n\r\ncl = 0\r\nsl = 0\r\nd = 0\r\nfor c in s:\r\n\toc = ord(c)\r\n\tif oc >=65 and oc <=90:\r\n\t\tcl = 1\r\n\tif oc >=97 and oc <=122:\r\n\t\tsl = 1\t\r\n\tif oc >=48 and oc <=57:\r\n\t\td = 1\t\r\n\tif d == 1 and sl == 1 and cl == 1:\r\n\t\tprint(\"Correct\")\r\n\t\texit()\r\n\t\r\nprint(\"Too weak\")\r\n", "a = str(input())\r\ncheck_len = check_upper = check_lower = check_digit = False\r\ncheck_len = len(a) >= 5\r\nfor c in a:\r\n if c.islower():\r\n check_lower = True\r\n elif c.isupper():\r\n check_upper = True\r\n elif c.isdigit():\r\n check_digit = True\r\nif check_len and check_upper and check_lower and check_digit:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "s = input()\nprint(\n \"Correct\"\n if len(s) >= 5\n and any(filter(str.isdecimal, s))\n and any(filter(str.islower, s))\n and any(filter(str.isupper, s))\n else \"Too weak\"\n)\n", "import re; s = input()\nprint('Correct' if all([re.search(r'[0-9]',s), re.search(r'[a-z]',s), re.search(r'[A-Z]',s), len(s) >= 5]) else 'Too weak')", "\nsenha = input()\nhasUpperCase = False\nhasLowerCase = False\nhasDigit = False\nhasFive = False\nfor i in senha:\n if (i.isupper()):\n hasUpperCase = True\n if (i.islower()):\n hasLowerCase = True \n if (i.isdigit()):\n hasDigit = True\nif (len(senha)>=5):\n hasFive = True\n\nif (hasUpperCase and hasLowerCase and hasDigit and hasFive):\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n \t \t \t \t \t\t\t \t\t\t \t\t \t", "import string\n\nchar_seq = [char for char in input()]\n\nif len(char_seq) < 5:\n print(\"Too weak\")\nelse:\n all_digits = string.digits\n\n lowercase_letters = string.ascii_lowercase\n uppercase_letters = string.ascii_uppercase\n\n has_lowercase = False\n has_uppercase = False\n has_digit = False\n\n for element in char_seq:\n if has_digit and has_lowercase and has_uppercase:\n break\n elif element in lowercase_letters:\n has_lowercase = True\n elif element in uppercase_letters:\n has_uppercase = True\n elif element in all_digits:\n has_digit = True\n else:\n continue\n\n if has_digit and has_lowercase and has_uppercase:\n print(\"Correct\")\n else:\n print(\"Too weak\")\n\t \t\t\t \t\t\t \t\t\t \t\t \t \t \t \t \t\t", "n=input()\r\nf1,f2,f3=0,0,0\r\n\r\nfor ele in n:\r\n if f1==f2==f3==1:\r\n break\r\n \r\n if ele.islower():\r\n f1=1\r\n \r\n elif ele.isupper():\r\n f2=1\r\n \r\n elif ele.isdigit():\r\n f3=1\r\n\r\nif f1+f2+f3==3 and len(n)>4:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "password = list(input())\r\nuppercase= False\r\nlowercase = False\r\ndigit =False\r\ndigits = \"123456789\"\r\nfor i in password:\r\n if i.isupper():\r\n uppercase = True\r\n\r\nfor j in password:\r\n if j.islower():\r\n lowercase = True\r\n\r\nfor k in digits:\r\n if k in password:\r\n digit = True\r\n\r\nif len(password) >= 5 and uppercase and lowercase and digit:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n\r\n", "s=input()\na=False\nb=False\nc=False\nd=False\nif(len(s)>=5):\n a=True\nfor i in range(len(s)):\n if(ord(s[i])>=ord('A') and ord(s[i])<=ord('Z')):\n b=True\n if(ord(s[i])>=ord('a') and ord(s[i])<=ord('z')):\n c=True\n if(ord(s[i])>=ord('1') and ord(s[i])<=ord('9')):\n d=True\nif(a and b and c and d):\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n", "s=input()\r\nif len(s)>=5:\r\n c=0\r\n sm=0\r\n n=0\r\n for i in s:\r\n if i.isupper():\r\n c=1\r\n elif i.islower():\r\n sm=1\r\n elif i.isnumeric():\r\n n=1\r\n if c+sm+n>=3:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\nelse:\r\n print(\"Too weak\")\r\n \r\n", "\r\nst = input()\r\nif len(st) < 5:\r\n\tprint('Too weak')\r\n\texit()\r\n\r\nfor i in st:\r\n\tif i.isupper():\r\n\t\tbreak\r\n\r\nelse:\r\n\tprint('Too weak')\r\n\texit()\r\n\r\n\r\nfor i in st:\r\n\tif i.islower():\r\n\t\tbreak\r\n\r\nelse:\r\n\tprint('Too weak')\r\n\texit()\r\n\r\nfor i in st:\r\n\tif ord(i) in range(48, 58):\r\n\t\tbreak\r\n\r\nelse:\r\n\tprint('Too weak')\r\n\texit()\r\n\r\nprint('Correct')", "s = input()\r\nleft_a = ord(\"a\")\r\nright_a = ord(\"z\")\r\nleft_A = ord(\"A\")\r\nright_A = ord(\"Z\")\r\nleft_1 = ord(\"0\")\r\nright_1 = ord(\"9\")\r\nx = 0\r\ny = 0\r\nz = 0\r\nfor elem in s:\r\n if left_a <= ord(elem) <= right_a:\r\n x += 1\r\n elif left_A <= ord(elem) <= right_A:\r\n y += 1\r\n elif left_1 <= ord(elem) <= right_1:\r\n z += 1\r\nif len(s) >= 5 and x > 0 and y > 0 and z > 0:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "from string import ascii_uppercase, ascii_lowercase\ns=input()\ns1=0\ns2=0\ns3=0\ns4=0\nif len(s)<5:\n print(\"Too weak\")\n exit()\nelse:\n s4=1\nfor i in s:\n if i in \"1234567890\":\n s1=1\n elif i in ascii_uppercase:\n s2=1\n elif i in ascii_lowercase:\n s3=1\nif s1+s2+s3+s4==4:\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n", "n=input()\r\ns=0\r\nif(len(n)>=5):\r\n for i in n:\r\n if(i>='a' and i<='z'):\r\n s=s+1\r\n break\r\n if(s==1):\r\n for j in n:\r\n if(j>='A' and j<='Z'):\r\n s=s+1\r\n break\r\n if(s==2):\r\n for k in n:\r\n if(k>='0' and k<='9'):\r\n s=s+1\r\n break\r\n if(s==3):\r\n print('Correct')\r\n else:\r\n print('Too weak')\r\n else:\r\n print('Too weak')\r\n else:\r\n print('Too weak')\r\nelse:\r\n print('Too weak')\r\n\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\ns=list(input())\r\nn=len(s)-1\r\nif(n>=5):\r\n c1,c2,c3=0,0,0\r\n for i in range(n):\r\n if(ord(s[i])>=ord('a') and ord(s[i])<=ord('z')):\r\n c1=1\r\n elif(ord(s[i])>=ord('A') and ord(s[i])<=ord('Z')):\r\n c2=1\r\n elif(s[i]>='0' and s[i]<='9'):\r\n c3=1\r\n if(c1==1 and c2==1 and c3==1):\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\nelse:\r\n print(\"Too weak\")", "sifre=input()\r\nozel=[\"!\", \"?\", \".\", \",\", \"_\"]\r\nbOzel=False\r\nbDigit=False\r\n\r\nfor n in sifre:\r\n if n.isnumeric():\r\n bDigit=True\r\n if bDigit:\r\n break\r\n\r\nif len(sifre)>4 and sifre.upper()!=sifre and sifre.lower()!=sifre and bDigit:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "password = input()\n\nif all(\n (len(password) >= 5,\n any((c.isdigit() for c in password)),\n any((c.islower() for c in password)),\n any((c.isupper() for c in password))\n )):\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n", "password=str(input())\r\nres1=False\r\nres2=False\r\nres3=False\r\n\r\nif(len(password)>=5):\r\n \r\n for s in password:\r\n if(s.islower()):\r\n res2=True\r\n break\r\n for s in password: \r\n if(s.isupper()):\r\n res1=True\r\n break\r\n for s in password: \r\n if(s.isnumeric()):\r\n res3=True\r\n break\r\nif(res1 and res2 and res3):\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n", "n=input()\r\n\r\n\r\n\r\nif len(n)<5:\r\n print('Too weak')\r\nelse:\r\n y=[0]*3\r\n for k in range(len(n)):\r\n if 48<=ord(n[k])<=57:\r\n y[0]+=1\r\n if 97<=ord(n[k])<=122:\r\n y[1]+=1\r\n if 65<=ord(n[k])<=90:\r\n y[2]+=1\r\n if min(y)>=1:\r\n print('Correct')\r\n else:\r\n print('Too weak')\r\n \r\n", "p=input()\r\nsmall=0\r\nlarge=0\r\ndigit=0\r\nfor i in p:\r\n if i.islower():\r\n small=1\r\n if i.isupper():\r\n large=1\r\n if i.isdigit():\r\n digit=1\r\nif len(p)>=5 and small==1 and large==1 and digit==1 :\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n \r\n ", "pw = input()\r\n\r\ncon1 = False\r\nif len(pw) >= 5 : con1 = True\r\ncon2 = bool([x for x in pw if x.isupper()])\r\ncon3 = bool([x for x in pw if x.islower()])\r\ncon4 = bool([x for x in pw if x.isdigit()])\r\n\r\nif all([con1, con2, con3, con4]):\r\n print('Correct')\r\nelse: print('Too weak')\r\n", "def f():\r\n pw=input()\r\n if len(pw)>=5:\r\n if not pw==pw.upper() and not pw==pw.lower():\r\n if any(i.isdigit() for i in pw):\r\n return 'Correct'\r\n else: return 'Too weak'\r\n return 'Too weak'\r\nprint(f())", "def oneSmall(s):\r\n for i in range(len(s)):\r\n if s[i].islower():\r\n return True\r\n return False \r\n \r\ndef oneLarge(s):\r\n for i in range(len(s)):\r\n if s[i].isupper():\r\n return True\r\n return False \r\ndef num(s):\r\n for i in range(len(s)):\r\n if s[i].isnumeric():\r\n return True\r\n return False \r\n\r\ns=input()\r\n\r\nif len(s)>=5 and num(s) and oneSmall(s) and oneLarge(s):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "def small(c):\r\n return 'a' <= c <= 'z'\r\n\r\ndef big(c):\r\n return 'A' <= c <= 'Z'\r\n\r\ndef digit(c):\r\n return '0' <= c <= '9'\r\n\r\n\r\nline = input()\r\ncheck = [0] * 4\r\nif len(line) >= 5:\r\n for elem in line:\r\n if small(elem):\r\n check[1] = 1\r\n if big(elem):\r\n check[2] = 1\r\n if digit(elem):\r\n check[3] = 1\r\nif sum(check) == 3:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n ", "isLength = False\nisLarge = False\nisSmall = False\nisDigit = False\npassword = input()\nif len(password) >= 5:\n isLength = True\nfor m in password:\n if m.isupper():\n isLarge = True\n if m.islower():\n isSmall = True\n if m.isdigit():\n isDigit = True\nif isSmall and isDigit and isLarge and isLength:\n print('Correct')\nelse:\n print('Too weak')\n\n\t \t \t\t \t\t \t \t \t\t \t\t\t \t", "\r\ns = input()\r\nprint(\"Correct\" if(len(s)>4 and any(x.isupper() for x in s) and any(x.islower() for x in s) and any(x.isdigit() for x in s)) else \"Too weak\")\r\n", "temLower = False\ntemUpper = False\ntemNumbe = False\n\nt = str(input())\n\nif len(t) < 5:\n print(\"Too weak\")\n\nelse:\n for c in t:\n if c.islower():\n temLower = True\n\n elif c.isupper():\n temUpper = True\n\n else:\n if c.isnumeric():\n temNumbe = True\n \n if temLower and temUpper and temNumbe:\n break\n\n if temLower and temUpper and temNumbe:\n print(\"Correct\")\n\n else:\n print(\"Too weak\")\n \t \t\t \t \t\t \t\t\t \t \t", "s=input()\r\ny1=y2=y3=False\r\nfor x in s:\r\n\tif x.isupper():\r\n\t\ty1=True\r\n\tif x.islower():\r\n\t\ty2=True\r\n\tif x.isnumeric():\r\n\t\ty3=True\r\n\tif y1 and y2 and y3:\r\n\t\tif len(s)>=5:\r\n\t\t\tprint('Correct')\r\n\t\t\tbreak\r\n\t\telse:\t\r\n\t\t\tprint(\"Too weak\" )\r\n\t\t\tbreak\r\n\r\nelse:\r\n\tprint(\"Too weak\" )", "a = input()\r\nu, l, n = False, False, False\r\nfor i in a:\r\n if i.isupper() == True:\r\n u = True\r\n if i.islower() == True:\r\n l = True\r\n if i in '1234567890':\r\n n = True\r\nprint('Correct' if u == l == n == True and len(a) >= 5 else 'Too weak')", "# Matheus de Souza Oliveira RA: 203407\n\nimport re\n\nsenha = input()\npattern = '^(?=.*[0-9])(?=.*[a-z])(?=.*[A-Z]).{5,}$'\ncompiledRegex = re.compile(pattern)\nmatch = re.fullmatch(compiledRegex, senha)\n\nif match:\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n\t\t \t\t\t \t\t\t\t\t \t \t \t", "'''input\r\nCONTEST_is_STARTED!!11\r\n'''\r\ncheck = [False, False, False, False]\r\ns = input().strip()\r\nif len(s)>= 5: check[0] = True\r\nfor c in s:\r\n\tif c.isupper(): check[1] = True\r\n\tif c.islower(): check[2] = True\r\n\tif c.isdigit(): check[3] = True\r\nprint(\"Correct\") if sum(check)==4 else print(\"Too weak\")", "import string\ns = input()\nletraMax = False\nletraMin = False\nnumber = False\nif len(s) >= 5:\n for i in s:\n if i in list(string.ascii_uppercase):\n letraMax = True\n if i in list(string.ascii_lowercase):\n letraMin = True\n if i in ['0', '1', '2', '3', '4', '5', '6', '7', '8', '9']:\n number = True\n\nif letraMax and letraMin and number:\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n\t \t\t\t\t\t \t \t\t\t\t \t \t \t \t\t", "from sys import exit\r\n\r\npassword = input()\r\nworks = False\r\n\r\nif len(password) < 5:\r\n print(\"Too weak\")\r\n exit(0)\r\n\r\nfor i in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\":\r\n if i in password:\r\n works = True\r\n break\r\n\r\nif not works:\r\n print(\"Too weak\")\r\n exit(0)\r\n\r\nworks = False\r\nfor i in \"abcdefghijklmnopqrstuvwxyz\":\r\n if i in password:\r\n works = True\r\n\r\nif not works:\r\n print(\"Too weak\")\r\n exit(0)\r\n\r\nworks = False\r\n\r\nfor i in \"1234567890\":\r\n if i in password:\r\n works = True\r\n\r\nif not works:\r\n print(\"Too weak\")\r\n exit(0)\r\n\r\nprint(\"Correct\")", "import re\n\npassword = input()\n\nif re.search('^.*(?=.{5})(?=.*\\d)(?=.*[a-z])(?=.*[A-Z]).*$', password):\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n \t\t \t\t\t \t\t \t \t \t\t \t\t", "def tem_maiuscula(string):\r\n for letra in string:\r\n if ord(letra) in range(65,91):\r\n return True\r\n return False\r\n\r\ndef tem_minuscula(string):\r\n for letra in string:\r\n if ord(letra) in range(97,123):\r\n return True\r\n return False\r\n\r\ndef tem_numero(string):\r\n for letra in string:\r\n if ord(letra) in range(48,58):\r\n return True\r\n return False\r\n\r\ndef tamanho_certo(string):\r\n if(len(string)>=5):\r\n return True\r\n else:\r\n return False\r\n\r\ndef main():\r\n string = input()\r\n if (tem_maiuscula(string) and tem_minuscula(string) and tamanho_certo(string) and tem_numero(string)):\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\nmain()", "s = input()\r\nyes = True\r\nyes &= len(s) >= 5\r\nyes &= any(c.isupper() for c in s)\r\nyes &= any(c.islower() for c in s)\r\nyes &= any(c.isdigit() for c in s)\r\n\r\nif yes:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "s=input()\r\nl=[]\r\nbolB=\"QWERTYUIOPLKJHGFDSAZXCVBNM\"\r\nmalB=\"qwertyuioplkjhgfdsazxcvbnm\"\r\ncifr='1234567890'\r\np1=0\r\np2=0\r\np3=0\r\np4=0\r\nfor h in s:\r\n l.append(h)\r\n if bolB.find(h)>=0:\r\n p1+=1\r\n if malB.find(h)>=0:\r\n p2+=1\r\n if cifr.find(h)>=0:\r\n p3+=1\r\nif len(l)>=5:\r\n p4+=1\r\nif p1>=1 and p2>=1 and p3>=1 and p4>=1:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n\r\n\r\n", "s = input()\r\nlarge_cnt, small_cnt, digit_cnt = 0, 0, 0\r\nfor x in s:\r\n if x.isupper():\r\n large_cnt += 1\r\n elif x.islower():\r\n small_cnt += 1\r\n elif x.isdigit():\r\n digit_cnt += 1\r\nif len(s) >= 5 and large_cnt >= 1 and small_cnt >= 1 and digit_cnt >= 1:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "s=input()\r\na,b,c,d=0,0,0,0\r\nif len(s)>=5:\r\n a=1\r\nfor i in s:\r\n if i.isupper():\r\n b=1\r\nfor i in s:\r\n if i.islower():\r\n c=1\r\nfor i in s:\r\n if i.isdigit():\r\n d=1\r\nif b and a and c and d:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "n = input()\r\nq = 0\r\nw = 0\r\ne = 0\r\nfor i in range(len(n)):\r\n if \"a\" <= n[i] <= \"z\":\r\n q += 1\r\n if \"A\" <= n[i] <= \"Z\":\r\n w += 1 \r\n if \"0\" <= n[i] <= \"9\":\r\n e += 1\r\nif q > 0 and w > 0 and len(n) >= 5 and e > 0:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "S, Check = input(), [False] * 3\r\nfor i in S:\r\n if i.islower(): Check[0] = True\r\n if i.isupper(): Check[1] = True\r\n if i.isdigit(): Check[2] = True\r\nprint(\"Correct\" if len(S) >= 5 and Check.count(True) == 3 else \"Too weak\")\r\n\r\n# Hope the best for Ravens\r\n# Never give up\r\n", "s=input(\"\")\nu,l,j=0,0,0\nfor i in range(len(s)):\n if s[i].isupper():\n u+=1\n elif s[i].islower():\n l+=1\n elif s[i].isnumeric():\n j+=1\nk=[len(s)>=5,u>0,l>0,j>0]\nif all(k):\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n", "small='abcdefghijklmnopqrstuvwxyz'\nlarge=small.upper()\nnumber='0123456789'\nother='!?.,_'\n\ns=input()\n\nstrength=0\n\nfor i in s:\n if i in small:\n strength+=1\n break\nfor i in s:\n if i in large:\n strength+=1\n break\n\nfor i in s:\n if i in number:\n strength+=1\n break\nif len(s)>=5:\n strength+=1\n\nif strength==4:\n print('Correct')\nelse:\n print('Too weak')\n\n\t \t\t \t\t\t\t\t \t \t\t \t\t \t\t\t \t", "a = input()\r\nLITTLE = 0\r\nBIG = 0\r\nNUMBER = 0\r\nsum = 0\r\nfor i in range(len(a)):\r\n if ord(a[i]) >= 97 and ord(a[i]) <= 122:\r\n LITTLE = 1\r\n elif ord(a[i]) >= 65 and ord(a[i]) <= 90:\r\n BIG = 1\r\n elif ord(a[i]) >= 49 and ord(a[i]) <= 57:\r\n NUMBER = 1\r\n sum+=1\r\nif LITTLE == 1 and BIG == 1 and NUMBER == 1 and sum >= 5:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "stri = input()\r\nd = 0\r\na = 0\r\nb = 0 \r\nc = 0\r\n\r\nif len(stri)>4:\r\n d = 1\r\n\r\nfor i in range(10):\r\n if str(i) in stri:\r\n a = 1\r\n break\r\n\r\nsma = {'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\nbig = {'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 sma:\r\n if i in stri:\r\n b = 1\r\n break\r\n\r\nfor i in big:\r\n if i in stri:\r\n c = 1\r\n break\r\n\r\nif(a and b and c and d):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "import re\na1=re.compile('[a-z]')\na2=re.compile('[A-Z]')\na3=re.compile('[0-9]')\ns=input()\nif len(s)>=5:\n s=list(s)\n ar=[0,0,0]\n for i in s:\n if(a1.match(i)!=None):\n ar[0]+=1\n for i in s:\n if(a2.match(i)!=None):\n ar[1]+=1\n for i in s:\n if(a3.match(i)!=None):\n ar[2]+=1\n if (ar[0]!=0 and ar[1]!=0 and ar[2]!=0):\n print('Correct')\n else:\n print('Too weak')\nelse:\n print('Too weak')\n", "a = input()\r\nq,w,e,r=0,0,0,0\r\nif len(a)>4:r=1\r\nfor i in a:\r\n\tif i.isupper():q=1\r\n\telif i.islower():w=1\r\n\telif i.isdigit():e=1\r\nif min(q,w,e,r)==1:print(\"Correct\")\r\nelse:print(\"Too weak\")", "# LUOGU_RID: 101567669\ns = input()\r\nprint((len(s) >= 5 and any(c.isdigit() for c in s) and any(c.isupper() for c in s) and any(c.islower() for c in s)) and 'Correct' or 'Too weak')", "s=list(input())\r\nflag=0\r\nif len(s)<5:\r\n print(\"Too weak\")\r\n flag=-1 \r\nelse: \r\n a=0\r\n b=0\r\n c=0\r\n for i in range(len(s)):\r\n if ord(s[i])>=65 and ord(s[i])<=91:\r\n a+=1 \r\n if ord(s[i])>=97 and ord(s[i])<=122:\r\n b+=1\r\n if s[i]=='0' or s[i]=='1' or s[i]=='2' or s[i]=='3' or s[i]=='4' or s[i]=='5' or s[i]=='6' or s[i]=='7' or s[i]=='8' or s[i]=='9':\r\n c+=1\r\n if flag==0 and a>=1 and b>=1 and c>=1:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n \r\n \r\n", "#codeforces_411A\r\nimport re;\r\nline = input();\r\nprint([\"Too weak\",\"Correct\"][len(line)>4 and re.search(r\"[0-9]\",line) != None and re.search(r\"[a-z]\",line) != None and re.search(r\"[A-Z]\",line) != None])\r\n", "import string\r\n\r\n\r\ndef check_len(s) -> bool:\r\n return len(s) >= 5\r\n\r\n\r\ndef check_lower(s: string) -> bool:\r\n for c in s:\r\n if c in string.ascii_lowercase:\r\n return True\r\n return False\r\n\r\n\r\ndef check_upper(s: string) -> bool:\r\n for c in s:\r\n if c in string.ascii_uppercase:\r\n return True\r\n return False\r\n\r\n\r\ndef check_digits(s: string) -> bool:\r\n for c in s:\r\n if c in string.digits:\r\n return True\r\n return False\r\n\r\n\r\ndef main() -> None:\r\n s = input()\r\n print('Correct' if check_len(s) and check_lower(s) and check_upper(s) and check_digits(s) else 'Too weak')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import string\r\np = input()\r\nlu = list()\r\nll = list()\r\nld = list()\r\nif len(p) >= 5:\r\n for i in p:\r\n if i in string.ascii_uppercase:\r\n lu.append(i)\r\n if i in string.ascii_lowercase:\r\n ll.append(i)\r\n if i in string.digits:\r\n ld.append(i)\r\nif len(lu) >= 1 and len(ll) >= 1 and len(ld) >= 1:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "#!/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\naz = re.compile('.*[a-z].*')\nAZ = re.compile('.*[A-Z].*')\nzn = re.compile('.*[0-9].*')\n\nif __name__ == '__main__':\n p = rstr()\n\n if az.match(p) and AZ.match(p) and zn.match(p) and len(p) >=5:\n print('Correct')\n else:\n print('Too weak')\n", "cap=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\ncap=list(cap)\r\nsm=\"abcdefghijklmnopqrstuvwxyz\"\r\nsm=list(sm)\r\nnum=\"123456789\"\r\nnum=list(num)\r\ninp=input()\r\nl,s,b,n=0,0,0,0\r\nif len(inp)>=5:\r\n l=1\r\nfor i in inp:\r\n if i in cap:\r\n b=1\r\n if i in sm:\r\n s=1\r\n if i in num:\r\n n=1 \r\nk=l+s+n+b\r\nif k==4:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "pw = str(input())\r\ndef search(l, r):\r\n for j in range(len(pw)):\r\n if ord(pw[j]) >= l and ord(pw[j]) <= r:\r\n return True\r\n return False\r\noutput = \"Too weak\"\r\nif len(pw) > 4 and search(97, 122) == True and search(65, 90) == True and search(48, 57) == True:\r\n output = \"Correct\"\r\nprint(output)\r\n", "S=input()\r\nif len(S)<5:\r\n print(\"Too weak\")\r\nelse:\r\n B,Sm,D=0,0,0\r\n for Val in S:\r\n if Val.isupper():\r\n B+=1\r\n elif Val.islower():\r\n Sm+=1\r\n elif Val.isdigit():\r\n D+=1\r\n if B>0 and Sm>0 and D>0:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n ", "\r\n# Problem: A. Password Check\r\n# Contest: Codeforces - Coder-Strike 2014 - Qualification Round\r\n# URL: https://codeforces.com/problemset/problem/411/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\ns = input()\r\nif len(s)>=5:\r\n\tlower = False\r\n\tfor i in s:\r\n\t\tif i.islower():\r\n\t\t\tlower = True\r\n\t\t\tbreak\r\n\tupper = False\r\n\tfor i in s:\r\n\t\tif i.isupper():\r\n\t\t\tupper = True\r\n\t\t\tbreak\r\n\tnum = False\r\n\tfor i in s:\r\n\t\tif i.isnumeric():\r\n\t\t\tnum = True\r\n\t\t\tbreak\r\n\tif lower and upper and num:\r\n\t\tprint(\"Correct\")\r\n\t\texit()\r\nprint(\"Too weak\")", "flA=False\r\nfla=False\r\nflts=False\r\ns=input()\r\nfor ch in s:\r\n if ch.isdigit():\r\n flts=True;\r\n elif ord('A')<=ord(ch)<=ord('Z'):\r\n fla=True\r\n elif ord('a')<=ord(ch)<=ord('z'):\r\n flA=True\r\nif flts and fla and flA and (len(s)>=5): \r\n print('Correct')\r\nelse:\r\n print('Too weak')", "s,l,u,d=input(),0,0,0\r\nfor i in s:u+=i.isupper();l+=i.islower();d+=i.isdigit()\r\nprint([\"Too weak\",\"Correct\"][(len(s)>=5)*u*l*d!=0])", "l,u,p,d=0,0,0,0\r\ns=input()\r\nif (len(s)>=5):\r\n for i in s: \r\n if (i.islower()):\r\n l+=1 \r\n if (i.isupper()):\r\n u+=1 \r\n if (i.isdigit()):\r\n d+=1 \r\nif (l>=1 and u>=1 and d>=1):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "s = input()\r\na, b, c = 0, 0, 0\r\nfor ch in s:\r\n if ord(ch) >= ord('A') and ord(ch) <= ord('Z'):\r\n a = 1\r\n elif ord(ch) >= ord('a') and ord(ch) <= ord('z'):\r\n b = 1\r\n elif ord(ch) >= ord('0') and ord(ch) <= ord('9'):\r\n c = 1\r\n \r\nif len(s) >= 5 and a + b + c == 3:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "passwd= input() \r\nif len(passwd)>= 5 and len(passwd)<=100:\r\n val = True\r\nelse:\r\n val = False\r\n \r\nfor char in passwd:\r\n if char.isdigit():\r\n digit = True\r\n break\r\n else:\r\n digit = False\r\nfor char in passwd:\r\n if char.isupper():\r\n upper = True\r\n break\r\n else:\r\n upper = False\r\nfor char in passwd:\r\n if char.islower():\r\n lower = True\r\n break\r\n else:\r\n lower = False\r\nif val==True and digit == True and upper == True and lower == True:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\") ", "x = str(input())\r\nlist1=[]\r\nlist2=[\"!\", \"?\", \".\", \",\", \"_\"]\r\nlist0=[]\r\nif len(x) <= 100 :\r\n# .................. range ...........................................\r\n\r\n for m in x :\r\n list0.append(m)\r\n if len(list0) >= 5 :\r\n list1.append(\"1\")\r\n\r\n # ............ lower .............\r\n for m in x :\r\n if m.islower():\r\n list1.append(\"1\")\r\n break\r\n # ............upper ............\r\n for m in x :\r\n if m.isupper():\r\n list1.append(\"1\")\r\n break\r\n # ............digit.............\r\n for m in x :\r\n if m.isdigit():\r\n list1.append(\"1\")\r\n break\r\n # .............output..............\r\n\r\n if len(list1) == 4 :\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-04 23:08:26\nLastEditTime: 2021-11-04 23:15:32\nDescription: \nFilePath: CF411A.py\n'''\n\n\ndef func():\n complexity = [False] * 4\n password = input().strip()\n if len(password) >= 5:\n complexity[0] = True\n else:\n return \"Too weak\"\n \n for item in password:\n if all(complexity):\n return \"Correct\"\n if item.isupper():\n complexity[1] = True\n elif item.islower():\n complexity[2] = True\n elif item.isdigit():\n complexity[3] = True\n return \"Too weak\"\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "s=input()\r\nif not s==s.upper() and not s==s.lower() and any([i.isdigit() for i in s]) and len(s)>=5:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "pw = input()\r\nif len(pw) < 5:\r\n pw_good = False\r\nelif len([char for char in pw if char.isupper()]) < 1:\r\n pw_good = False\r\nelif len([char for char in pw if char.islower()]) < 1:\r\n pw_good = False\r\nelif len([char for char in pw if char.isnumeric()]) < 1:\r\n pw_good = False\r\nelse:\r\n pw_good = True\r\n\r\nif pw_good:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "s = str(input())\r\n\r\nif (any(x.isupper() for x in s) and any(x.islower() for x in s) and any(x.isdigit() for x in s) and len(s) >= 5):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "inp = input()\n\nlength = False\nupper = False\nlower = False\ndigit = False\n\nuppers = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\nlowers = \"abcdefghijklmnopqrstuvwxyz\"\ndigits = \"0123456789\"\n\nfor c in inp:\n\tif c in uppers:\n\t\tupper = True\n\tif c in lowers:\n\t\tlower = True\n\tif c in digits:\n\t\tdigit = True\n\nif len(inp) >= 5:\n\tlength = True\n\nif length and upper and lower and digit:\n\tprint('Correct')\nelse:\n\tprint('Too weak')\n\t \t \t\t\t \t\t\t\t \t\t\t\t \t \t", "string=input();\r\nl=0;s=0;d=0;\r\nif(len(string)>=5):\r\n for ele in string:\r\n if ele.isdigit():\r\n d=1;\r\n elif ele.isupper():\r\n l=1;\r\n elif ele.islower():\r\n s=1;\r\n if(s==1 and l==1 and d==1):\r\n print(\"Correct\");\r\n else:\r\n print(\"Too weak\");\r\nelse:\r\n print(\"Too weak\")\r\n ", "s = input()\n\nif (len(s) >= 5 and\nany(str(i) in s for i in range(10)) and\nany(chr(i) in s for i in range(ord('a'), ord('z') + 1)) and\nany(chr(i) in s for i in range(ord('A'), ord('Z') + 1))):\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n", "a = input()\r\nif len(a) < 5:\r\n print('Too weak')\r\nelse:\r\n A = []\r\n for x in a:\r\n A.append(x)\r\n n = 0\r\n b = 0\r\n c = 0\r\n for i in A:\r\n if ord('a') <= ord(i) <= ord('z'):\r\n n += 1\r\n if ord('A') <= ord(i) <= ord('Z'):\r\n b += 1\r\n if ord('0') <= ord(i) <= ord('9'):\r\n c += 1\r\n if (n == 0) or (b == 0) or (c == 0):\r\n print('Too weak')\r\n else:\r\n print('Correct')\r\n", "if __name__ == \"__main__\":\n pwd = input()\n \n flags = [False, False, False] \n \n if len(pwd) >= 5:\n for c in pwd:\n if c.isupper():\n flags[0] = True\n elif c.islower():\n flags[1] = True\n elif c.isdigit():\n flags[2] = True\n if all(flags):\n print(\"Correct\")\n break\n\n if not all(flags):\n print(\"Too weak\")\n \t\t\t\t \t \t\t \t\t \t\t \t \t\t \t", "import re\r\ns=input()\r\nprint([\"Too weak\",\"Correct\"][all([re.search(t,s) for t in ['.{5}','[a-z]','[A-Z]','\\d']])])", "n = list(input())\r\nph = 0\r\nif len(n) >= 5:\r\n ph += 1\r\nfor i in range(len(n)):\r\n if ord('a') <= ord(n[i]) <= ord('z'):\r\n ph += 1\r\n break\r\nfor i in range(len(n)):\r\n if ord('A') <= ord(n[i]) <= ord('Z'):\r\n ph += 1\r\n break\r\nfor i in range(len(n)):\r\n if ord('0') <= ord(n[i]) <= ord('9'):\r\n ph += 1\r\n break\r\nif ph == 4:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "s=str(input())\r\nl=0;S=0;d=0\r\nfor i in s:\r\n\tif i>='a' and i<='z':\r\n\t\tS+=1\r\n\tif i>='A' and i<='Z':\r\n\t\tl+=1\r\n\tif i>='0' and i<='9':\r\n\t\td+=1\r\nprint('Correct' if len(s)>4 and S>0 and l>0 and d>0 else 'Too weak')", "big = False\nlow = False\ndigit = False\nword = input()\nfor i in word:\n if len(word) < 5:\n print(\"Too weak\")\n exit()\n if i.isupper():\n big = True\n if i.islower():\n low = True\n if i.isdigit():\n digit = True\n\nif big and low and digit:\n print(\"Correct\")\n exit()\nprint(\"Too weak\")", "import sys\r\n \r\ns=str(input())\r\nt2=0\r\nt3=0\r\nt4=0\r\nif len(s)<5:\r\n\tprint(\"Too weak\")\r\n\tsys.exit(0)\r\nfor i in range(len(s)):\r\n\tif 'a'<=s[i]<='z':\r\n\t\tt2=1\r\n\tif 'A'<=s[i]<='Z':\r\n\t\tt3=1\r\n\tif '0'<=s[i]<='9':\r\n\t\tt4=1\r\nif t2&t3&t4:\r\n\tprint(\"Correct\")\r\nelse:\r\n\tprint(\"Too weak\")", "string = input()\r\nflag_l, flag_s, flag_d = False, False, False\r\nif len(string) > 4:\r\n for i in range(len(string)):\r\n if string[i].isupper():\r\n flag_l = True\r\n elif string[i].islower():\r\n flag_s = True\r\n elif string[i].isnumeric():\r\n flag_d = True\r\n if flag_l and flag_s and flag_d:\r\n print(\"Correct\")\r\n break\r\n if not flag_l or not flag_s or not flag_d:\r\n print(\"Too weak\")\r\nelse:\r\n print(\"Too weak\")", "password = input()\r\n\r\nmeets_length = len(password) >= 5\r\nhas_uppercase = False\r\nhas_lowercase = False\r\nhas_digit = False\r\n\r\nfor character in password:\r\n if character.isupper():\r\n has_uppercase = True\r\n if character.islower():\r\n has_lowercase = True\r\n if character.isdigit():\r\n has_digit = True\r\n\r\nif meets_length and has_uppercase and has_lowercase and has_digit:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "# Coded By Block_Cipher\r\n\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom math import gcd\r\nfrom math import sqrt\r\n\r\ns = input()\r\nsm = False\r\ncp = False\r\ndg = False\r\n\r\n# for i in s:\r\n# \tif i.isupper():\r\n# \t\tcp=True\r\n# \t\t# continue\r\n\r\n\r\n# for j in s:\r\n# \tif i.islower():\r\n# \t\tsm=True\r\n# \t\t# continue\r\n\r\n# for k in s:\r\n# \tif i.isdigit():\r\n# \t\tdg=True\r\n# \t\t# continue\r\n# print(sm)\r\n# print(cp)\r\n# print(dg)\r\n\r\n\r\nfor i in s:\r\n\tk = i.islower()\r\n\tif k==True:\r\n\t\t# print('YES')\r\n\r\n\t\tsm=True\r\n\t\tbreak\r\n\r\nfor i in s:\r\n\tk = i.isupper()\r\n\tif k==True:\r\n\t\t# print('YES')\r\n\r\n\t\tcp=True\r\n\t\tbreak\r\n\r\nfor i in s:\r\n\tk = i.isdigit()\r\n\tif k==True:\r\n\t\t# print('YES')\r\n\r\n\t\tdg=True\r\n\t\tbreak\r\n\r\n\r\nif (len(s)>=5 and sm == True and cp == True and dg==True):\r\n\tprint('Correct')\r\nelse:\r\n\tprint('Too weak')", "def m(v):\r\n\t\"\"\"multiple vector\"\"\"\r\n\tfor c in v:\r\n\t\tif not c:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\r\ndef ic(s):\r\n\tif len(s)<5:\r\n\t\treturn 0\r\n\t\"\"\"is correct\"\"\"\r\n\tvc=3*[0]\r\n\tfor c in s:\r\n\t\tif not vc[0] and c.islower():\r\n\t\t\tvc[0]=1\r\n\t\telif not vc[1] and c.isupper():\r\n\t\t\tvc[1]=1\r\n\t\telif not vc[2] and c.isnumeric():\r\n\t\t\tvc[2]=1\r\n\t\tif m(vc):\r\n\t\t\treturn 1\r\n\treturn 0\r\n\t\r\ns='Correct' if (ic(input())) else 'Too weak'\r\nprint(s)", "def check_password_complexity(password):\r\n if len(password) >= 5 and any(c.isupper() for c in password) and any(c.islower() for c in password) and any(c.isdigit() for c in password):\r\n return \"Correct\"\r\n else:\r\n return \"Too weak\"\r\np=input()\r\nprint(check_password_complexity(p))", "import sys\npw = sys.stdin.readline().strip()\nif len(pw) >= 5 \\\n and any(c.isupper() for c in pw) \\\n and any(c.islower() for c in pw) \\\n and any(c.isdigit() for c in pw):\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n", "n, l, h = False, False, False\r\nord_a, ord_z, ord_A, ord_Z, ord_0, ord_9 = ord('a'), ord('z'), ord('A'), ord('Z'), ord('0'), ord('9')\r\ncnt = 0\r\nfor elm in input():\r\n ord_elm = ord(elm)\r\n if ord_a <= ord_elm <= ord_z:\r\n l = True\r\n elif ord_A <= ord_elm <= ord_Z:\r\n h = True\r\n elif ord_0 <= ord_elm <= ord_9:\r\n n = True\r\n cnt += 1\r\nprint('Correct' if n and l and h and cnt >= 5 else 'Too weak')", "from string import ascii_lowercase, ascii_uppercase\na = input()\nprint('Correct' if len(a) >= 5 and\n any(x in a for x in ascii_lowercase) and\n any(x in a for x in ascii_uppercase) and\n any(x in a for x in '0123456789') else 'Too weak')\n", "lower=upper=digit=size=0\r\nfor i in input():\r\n if i.islower():lower+=1\r\n elif i.isupper():upper+=1\r\n elif i.isnumeric():digit+=1\r\n size+=1\r\nif size>4 and lower and upper and digit:print('Correct')\r\nelse:print('Too weak')", "sifre=input()\r\nbDigit=False\r\n\r\nfor n in sifre:\r\n if n.isdigit():\r\n bDigit=True\r\n break\r\n\r\nif len(sifre)>4 and sifre.upper()!=sifre and sifre.lower()!=sifre and bDigit:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "password = input()\nis_password_weak = False\n\nif any([\n len(password) < 5,\n len([c for c in password if c in \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"]) == 0,\n len([c for c in password if c in \"abcdefghijklmnopqrstuvwxyz\"]) == 0,\n len([c for c in password if c in \"123456789\"]) == 0,\n]):\n print(\"Too weak\")\nelse:\n print(\"Correct\")\n", "password = input()\n\n\ndef is_ok(password) -> bool:\n is_small = False\n is_big = False\n is_digit = False\n\n for ch in password:\n if 'A' <= ch <= 'Z':\n is_big = True\n elif 'a' <= ch <= 'z':\n is_small = True\n elif 48 <= ord(ch) <= 57:\n is_digit = True\n\n return (len(password) >= 5 and\n is_small and\n is_big and\n is_digit)\n\n\nok = is_ok(password)\n\nif ok:\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n", "s = input()\r\n\r\n\r\nflag1 = False\r\nflag2 = False\r\nflag3 = False\r\n\r\nfor i in s:\r\n if \"a\" <= i <= \"z\":\r\n flag1 = True\r\n if \"A\" <= i <= \"Z\":\r\n flag2 = True\r\n if \"0\" <= i <= \"9\":\r\n flag3 = True\r\nif len(s) >= 5 and flag1 and flag2 and flag3:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "password = input() \r\nlength = len(password)\r\nhas_uppercase = False\r\nhas_lowercase = False\r\nhas_digit = False\r\n\r\nif length >= 5:\r\n for char in password:\r\n if char.isupper():\r\n has_uppercase = True\r\n \r\n elif char.islower():\r\n has_lowercase = True\r\n \r\n elif char.isdigit():\r\n has_digit = True\r\n\r\n\r\nif length >= 5 and has_uppercase and has_lowercase and has_digit:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "n = input()\r\nl = []\r\nif len(n)>=5:\r\n\tl.append(\"1\")\r\nfor i in n:\r\n\tif i.isupper():\r\n\t\tl.append(\"2\")\r\n\telif i.islower():\r\n\t\tl.append(\"3\")\r\n\telif i.isdigit():\r\n\t\tl.append(\"4\")\r\nif len(set(l))==4:\r\n\tprint(\"Correct\")\r\nelse:print(\"Too weak\")\t\t\t\t\t\r\n", "s = input ()\r\nprint (\"Correct\" if len (s) >= 5 and list (filter (str.islower, s)) and list (filter (str.isupper, s)) and list (filter (str.isdigit, s)) else \"Too weak\")\r\n", "import re\r\nn = input()\r\nx = re.findall('\\d' , n)\r\ny = re.findall('[a-z]' , n)\r\nz = re.findall('[A-Z]' , n)\r\nif len(n) >= 5 and x and y and z:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "from re import findall\r\nif (lambda s: len(s) > 4 and findall(r'[A-Z]', s) and findall(r'[a-z]', s) and findall(r'[0-9]', s))(input().strip()):\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "def hasNumber(value):\n for character in value:\n if character.isdigit():\n return True\n return False\n\n\ndef hasUpper(value):\n for character in value:\n if character.isupper():\n return True\n return False\n\n\ndef hasSmall(value):\n for character in value:\n if character.islower():\n return True\n return False\n\n\nif __name__ == '__main__':\n\n password = input()\n\n if len(password) < 5:\n print(\"Too weak\")\n elif not hasNumber(password):\n print(\"Too weak\")\n elif not hasUpper(password):\n print(\"Too weak\")\n elif not hasSmall(password):\n print(\"Too weak\")\n else:\n print(\"Correct\")\n\n \t \t\t\t \t \t\t \t \t \t\t \t", "s = input()\r\nupper = 0\r\nlower = 0\r\ndigit = 0\r\nif len(s) < 5:\r\n ans = 'Too weak'\r\nelse:\r\n for i in range(len(s)):\r\n if s[i].isalpha():\r\n if s[i].isupper():\r\n upper += 1\r\n else:\r\n lower += 1\r\n if s[i].isnumeric():\r\n digit += 1\r\n if upper != 0 and lower != 0 and digit != 0:\r\n ans = 'Correct'\r\n else:\r\n ans = 'Too weak'\r\nprint(ans)\r\n", "# LUOGU_RID: 97767865\na=input()\r\nv1=v2=v3=v4=v5=v6=0\r\nl1=[]\r\nfor m in a:\r\n l1.append(m)\r\n if int(len(l1))>=5:\r\n v6=1\r\nfor i in a:\r\n i=str(i)\r\n if i.isdigit() is True:\r\n v1+=1\r\n if i.isalpha() is True:\r\n v5+=1\r\n if i.isupper() is True:\r\n v2+=1\r\n if i.islower() is True:\r\n v3+=1\r\n else:\r\n v4+=1\r\n else:\r\n v4=0\r\nif v1>=1 and v2>=1 and v3>=1 and v5>=1 and v6==1:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "\nimport string\n\ndef __main__():\n password = input(\"\")\n\n lower = set(string.ascii_lowercase)\n upper = set(string.ascii_uppercase)\n number = set(string.digits)\n\n if(len(password) < 5):\n tooWeak() \n exit(0)\n\n hasUpper = False\n hasLower = False\n hasNumber = False\n\n for char in password:\n if char in lower:\n hasLower = True\n if char in upper:\n hasUpper = True\n if char in number:\n hasNumber = True\n if hasLower and hasUpper and hasNumber:\n break\n\n if(hasLower and hasUpper and hasNumber):\n tooStronk()\n else:\n tooWeak()\n\n\ndef tooWeak():\n print(\"Too weak\")\n\n\ndef tooStronk():\n print(\"Correct\")\n\nif __name__ == \"__main__\":\n __main__()\n\n", "def checkPass(mypass: str) -> bool:\r\n if len(mypass) < 5:\r\n return False\r\n\r\n cntlrg = 0\r\n smlrg = 0\r\n dig = 0\r\n for c in mypass:\r\n if c.isupper():\r\n cntlrg+=1\r\n if c.islower():\r\n smlrg+=1\r\n \r\n if c.isdigit():\r\n dig+=1\r\n \r\n if cntlrg<1 or smlrg<1 or dig<1:\r\n return False\r\n\r\n return True\r\n\r\n\r\nx = input()\r\nif checkPass(x):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "import string\r\nword = input()\r\ncek = False\r\nfor i in word:\r\n\tif(i.isdigit()):\r\n\t\tcek = True\r\n\t\tbreak\r\nif (cek and not(word==word.lower()) and not(word==word.upper()) and (len(word)>=5)):\r\n\tprint (\"Correct\")\r\nelse:\r\n\tprint (\"Too weak\")", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\ns = input()\r\nmsg = ['Too weak', 'Correct']\r\nif len(s) < 5:\r\n print(msg[0])\r\nelse:\r\n flag = [False] * 3\r\n for c in list(s):\r\n if 'A' <= c <= 'Z':\r\n flag[0] = True\r\n elif 'a' <= c <= 'z':\r\n flag[1] = True\r\n elif '0' <= c <= '9':\r\n flag[2] = True\r\n print(msg[all(flag)])\r\n", "s=input()\r\nif len(s)>=5:\r\n c=k=p=0\r\n for i in range(len(s)):\r\n if 'A'<=s[i]<='Z':\r\n c+=1\r\n elif 'a'<=s[i]<='z':\r\n k+=1 \r\n elif '0'<=s[i]<='9':\r\n p+=1 \r\n if c>=1 and k>=1 and p>=1:\r\n print('Correct')\r\n else:\r\n print('Too weak')\r\nelse:\r\n print('Too weak')\r\n", "import re\r\n\r\ndef getAnswer(x):\r\n if len(x) < 5:\r\n return \"Too weak\"\r\n if (re.search('[A-Z]',x)) == None:\r\n return \"Too weak\"\r\n if (re.search('[a-z]',x)) == None:\r\n return \"Too weak\"\r\n if (re.search('[0-9]',x)) == None:\r\n return \"Too weak\"\r\n return \"Correct\"\r\ndef main():\r\n x = input()\r\n print(getAnswer(x))\r\n\r\nmain()", "s=input()\r\nl=len(s)\r\nx=0\r\ny=0\r\nz=0\r\nm=['0','1','2','3','4','5','6','7','8','9']\r\nfor i in s:\r\n if(i in m):\r\n x=1\r\n elif(ord(i) in range(65,91)):\r\n y=1\r\n elif(ord(i) in range(97,123)):\r\n z=1\r\nif(l>=5 and x==1 and y==1 and z==1):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "s = sorted(input())\r\na = len(s) >= 5\r\nb = False; c = False; d = False\r\n\r\nfor i in s:\r\n if i.isupper():\r\n b = True\r\n if i.islower():\r\n c = True\r\n if i.isdigit():\r\n d = True\r\n\r\nif a and b and c and d :\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n\r\n", "import re\r\nS = input()\r\nif len(S) >= 5 and re.search('[A-Z]', S) and re.search('[a-z]', S) and re.search('[0-9]', S):\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "s=input()\r\na,b,c=0,0,0 \r\nif len(s)>=5:\r\n a=1\r\nif s.lower()!=s and s.upper()!=s:\r\n b=1\r\nfor i in s:\r\n if i.isnumeric():\r\n c=1\r\nif a and b and c:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "n=input()\r\na=len(n)\r\nc=0\r\nc1=0\r\nc2=0\r\nnum=['0','1','2','3','4','5','6','7','8','9']\r\nif a>=5:\r\n\tfor i in range(a):\r\n\t\tif n[i] in num:\r\n\t\t\tc+=1\r\n\t\telif n[i]==n[i].upper() and n[i].isalpha():\r\n\t\t\tc1+=1\r\n\t\telif n[i]==n[i].lower() and n[i].isalpha():\r\n\t\t\tc2+=1\r\n\t\tif c>0 and c1>0 and c2>0:\r\n\t\t\tbreak\r\n\tif c>0 and c1>0 and c2>0:\r\n\t\tprint('Correct')\r\n\telse:\r\n\t\tprint('Too weak')\r\nelse:\r\n\tprint('Too weak')\r\n", "s=input()\r\nif len(s)>4 and any(i.isupper()for i in s) and any(i.islower()for i in s) and any(i.isdigit()for i in s):\r\n print('Correct')\r\nelse:print('Too weak')\r\n", "from re import findall\r\n\r\ns = input()\r\nif len(s) >= 5:\r\n if findall(\"[A-Z]\", s):\r\n if findall(\"[a-z]\", s):\r\n if findall(\"[0-9]\", s):\r\n print(\"Correct\")\r\n exit()\r\nprint(\"Too weak\")", "s = input()\r\n\r\nn = len(s)\r\n\r\nhas_upper = False\r\nhas_lower = False\r\nhas_digit = False\r\nhas_min_lenght = n >= 5\r\n\r\nfor a in s:\r\n if a.isupper():\r\n has_upper = True\r\n if a.islower():\r\n has_lower = True\r\n if a.isdigit():\r\n has_digit = True\r\n\r\nprint(\"Correct\" if has_upper and has_lower and has_digit and has_min_lenght else \"Too weak\")\r\n", "s = input().strip()\r\nc = 0\r\nif len(s) >= 5:\r\n c += 1\r\n for i in range(len(s)):\r\n if ord(\"a\") <= ord(s[i]) <= ord(\"z\"):\r\n c += 1\r\n break\r\n for i in range(len(s)):\r\n if ord(\"A\") <= ord(s[i]) <= ord(\"Z\"):\r\n c += 1\r\n break\r\n for i in range(len(s)):\r\n if ord(\"0\") <= ord(s[i]) <= ord(\"9\"):\r\n c += 1\r\n break\r\nif c == 4:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "a = input()\r\nprint(['Too weak', 'Correct'][\r\n len(a) >= 5 and sum(1 for c in a if c.isupper()) >= 1 and sum(1 for c in a if c.islower()) >= 1 and sum(1 for c in a if c.isdigit()) >= 1])", "s = input()\n\nif (any(x.isupper() for x in s) and any(x.islower() for x in s) \n and any(x.isdigit() for x in s) and len(s) >= 5):\n\tprint('Correct')\nelse:\n\tprint('Too weak')\n\t\n", "s = input()\r\nflag3 = flag2 = flag1 = False \r\nfor i in s:\r\n\tif (i.isupper()): flag1 = True\r\n\telif (i.islower()): flag2 = True\r\n\telif (i in '1234567890'): flag3 = True\r\nif (flag1 and flag2 and flag3 and len(s) >= 5): print('Correct')\r\nelse: print('Too weak')", "from cmath import *\r\nfrom decimal import *\r\nfrom collections import *\r\nimport sys\r\nfrom typing import Collection\r\nfrom warnings import filters\r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\ndef _int(): return int(input())\r\n\r\n\r\ndef solves():\r\n s=input()\r\n if not s==s.upper() and not s==s.lower() and any([i.isdigit() for i in s]) and len(s)>=5:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n\r\n \r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "s=input()\r\nup=False\r\nlo=False\r\ndi=False\r\nfor i in (s):\r\n if(i.isupper()):\r\n up=True\r\n elif(i.islower()):\r\n lo=True\r\n elif(i.isdigit()):\r\n di=True\r\nif(up==True and lo==True and di==True and len(s)>=5):\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "s = input()\r\nif len(s) < 5:\r\n print(\"Too weak\")\r\n exit()\r\n\r\na=b=c=0\r\nfor i in s:\r\n x = ord(i)\r\n \r\n if x>=ord('a') and x<=ord('z'):\r\n a+=1\r\n if x>=ord('A') and x<=ord('Z'):\r\n b+=1\r\n if x>=ord('0') and x<=ord('9'):\r\n c+=1\r\n \r\nif a and b and c:\r\n print('Correct')\r\nelse: print('Too weak')", "import string\r\n\r\na = input()\r\nprint('Correct' if set(a) & set(string.ascii_lowercase) and\r\n set(a) & set(string.ascii_uppercase) and\r\n set(a) & set(string.digits) and len(a) >= 5 else 'Too weak')", "a=input()\r\nlge=False\r\nsme=False\r\nhsd=False\r\nfor i in a:\r\n if i.isupper():\r\n lge=True\r\n elif i.islower():\r\n sme=True\r\n elif i.isdigit():\r\n hsd=True\r\nif len(a)>=5 and lge and sme and hsd:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "x = input()\r\nif(len(x)<5):\r\n print(\"Too weak\")\r\nelse:\r\n y = 0\r\n z = 0\r\n j = 0\r\n for i in range(len(x)):\r\n if(x[i].isupper()):\r\n y=1\r\n if(x[i].islower()):\r\n z=1\r\n if(x[i].isdigit()):\r\n j=1\r\n if(y == 1 and z == 1 and j == 1):\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n \r\n", "sa=[\"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\nla=[\"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\nd=[\"1\", \"2\", \"3\", \"4\", \"5\", \"6\", \"7\", \"8\", \"9\", \"0\"]\r\ns=input()\r\ndc=0\r\nlac=0\r\nsac=0\r\nfor i in s:\r\n if i in sa:\r\n sac+=1\r\n elif i in la:\r\n lac+=1\r\n elif i in d:\r\n dc+=1\r\nif lac>=1 and sac>=1 and dc>=1 and len(s)>4:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "s_lower = 'abcdefghijklmnopqrstuvwxyz'\r\ns_upper = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ndigits = '0123456789'\r\n\r\n\r\ndef parol(s):\r\n count1, count2, count3 = 0, 0, 0\r\n for elem in s:\r\n if elem in s_lower:\r\n count1 += 1\r\n if elem in s_upper:\r\n count2 += 1\r\n if elem in digits:\r\n count3 += 1\r\n if count1 >= 1 and count2 >= 1 and count3 >= 1 and len(s) >= 5:\r\n return \"Correct\"\r\n return \"Too weak\"\r\n\r\n\r\nprint(parol(input()))\r\n", "s = input()\r\nstrength = []\r\nif len(s)>=5:\r\n\td =False\r\n\tfor i in s:\r\n\t\tif i.isupper():\r\n\t\t\td = True\r\n\t\t\tbreak\r\n\tstrength.append(True)\r\n\r\n\tif d:\r\n\t\td1 =False\r\n\t\tfor i in s:\r\n\t\t\tif i.islower():\r\n\t\t\t\td1 = True\r\n\t\t\t\tbreak\r\n\t\tstrength.append(True)\r\n\t\tif d1:\r\n\t\t\td2 = False\r\n\t\t\tfor i in s:\r\n\t\t\t\tif i.isdigit():\r\n\t\t\t\t\td2 = True\r\n\t\t\t\t\tbreak\r\n\t\t\tstrength.append(True)\r\n\t\t\tif d2:\r\n\t\t\t\tstrength.append(True)\r\n\t\t\telse:\r\n\t\t\t\tstrength.append(False)\r\n\t\telse:\r\n\t\t\tstrength.append(False)\r\n\telse:\r\n\t\tstrength.append(False)\r\nelse:\r\n\tstrength.append(False)\r\n\r\nif strength.count(True) == len(strength):\r\n\tprint('Correct')\r\nelse:\r\n\tprint('Too weak')", "a=input()\r\nb=[False]*3\r\nfor k in a:\r\n if 'A'<=k<=\"Z\":\r\n b[0]=True\r\n if 'a'<=k<=\"z\":\r\n b[1]=True\r\n if '0'<=k<='9':\r\n b[2]=True\r\n \r\nif len(a)>=5 and b[0]and b[1]and b[2]:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Dec 11 09:32:17 2022\r\n\r\n@author:Fares Samer ID:120210029\r\n\"\"\"\r\n# quiz\r\ndef password_check(passwrd) :\r\n\r\n wrd = True\r\n \r\n if len(passwrd) < 5:\r\n wrd = False\r\n if not any(char.isdigit() for char in passwrd):\r\n wrd = False\r\n if not any(char.isupper() for char in passwrd):\r\n wrd = False\r\n \r\n if not any(char.islower() for char in passwrd):\r\n wrd = False\r\n if wrd:\r\n return wrd \r\n \r\n\r\ndef main():\r\n passwrd = input(\"\")\r\n \r\n if (password_check(passwrd)):\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n\r\nmain()\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n ", "s=input()\r\n\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\n\r\nif(len(s)>=5):\r\n a=1\r\nfor i in s:\r\n if(i.isupper()==True):\r\n b=1\r\n if(i.isdigit()==True):\r\n c=1\r\n if(i.islower()==True):\r\n d=1\r\n if(b== 1 and c==1 and d==1):\r\n break\r\n\r\nif(a==1 and b==1 and c==1 and d==1):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "p=input()\r\nu,l,d=0,0,0\r\nfor i in p:\r\n if i.isupper():\r\n u+=1 \r\n if i.islower():\r\n l+=1\r\n if i.isdigit():\r\n d+=1 \r\nif len(p)>4 and u>0 and l>0 and d>0:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "s = input()\r\n\r\nif(len(s) < 5):\r\n print(\"Too weak\")\r\nelse:\r\n truth_table = [False, False, False]\r\n for x in s:\r\n if x.isupper():\r\n truth_table[0] = True\r\n elif x.islower():\r\n truth_table[1] = True\r\n elif x.isdigit():\r\n truth_table[2] = True\r\n \r\n if all(truth_table):\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n", "s=input()\r\nc,d,e=0,0,0\r\nif(len(s)<5):\r\n print(\"Too weak\")\r\nelse: \r\n for i in s:\r\n if(i.isdigit()):\r\n c+=1\r\n if(i.isupper()):\r\n d+=1\r\n if(i.islower()):\r\n e+=1\r\n if(c>=1 and d>=1 and e>=1):\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")", "def main():\r\n x = input(\"\")\r\n pass_cap = False\r\n pass_sml = False\r\n pass_dig = False\r\n lower = [chr(num) for num in range(97,123)]\r\n upper = [x.upper() for x in lower]\r\n dig = [str(y) for y in range(10)]\r\n if (len(x))<5:\r\n print(\"Too weak\")\r\n return\r\n for c in lower:\r\n if c in x:\r\n pass_sml=True\r\n break\r\n if(pass_sml==False):\r\n print(\"Too weak\")\r\n return\r\n for c in upper:\r\n if c in x:\r\n pass_cap = True\r\n if(pass_cap==False):\r\n print(\"Too weak\")\r\n return\r\n for i in dig:\r\n if i in x:\r\n pass_dig = True\r\n if (pass_dig==False):\r\n print(\"Too weak\")\r\n return\r\n print(\"Correct\")\r\n \r\nif __name__==\"__main__\":\r\n main()", "print('Correct' if (lambda s: len(s) >= 5 and any([elem.isupper() for elem in s]) and any([elem.islower() for elem in s]) and any([elem.isdigit() for elem in s]))(input()) else 'Too weak')\r\n", "s = str(input())\r\nc1=0\r\nc2=0\r\nc3=0\r\nc4=0\r\nif len(s)>=5: c4=1\r\nfor c in s:\r\n if c in \"qwertyuipoasdfghjklzxcvbnm\":c1=1\r\n if c in \"QWERTYUIOPASDFGHJKLZXCVBNM\": c2=1 \r\n if c in \"1234567890\": c3=1\r\nif bool(c1) and bool(c2) and bool(c3) and bool(c4): print(\"Correct\")\r\nelse: print(\"Too weak\")", "from math import*\r\n\r\ndef add_bit(n, k):\r\n return n | (1 << k)\r\n\r\ns = input().strip()\r\nans = 0\r\n\r\nif len(s) >= 5:\r\n ans = add_bit(ans, 0)\r\n\r\nfor i in range(len(s)):\r\n if s[i] >= 'a' and s[i] <= 'z':\r\n ans = add_bit(ans, 1)\r\n if s[i] >= 'A' and s[i] <= 'Z':\r\n ans = add_bit(ans, 2)\r\n if s[i] >= '0' and s[i] <= '9':\r\n ans = add_bit(ans, 3)\r\n\r\nif ans == 15:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "def check(a):\n if len(a) < 5:\n return 0\n does_have_little = 0\n for elem in [chr(i) for i in range(ord('a'), ord('z') + 1)]:\n if elem in a:\n does_have_little = 1\n break\n if not does_have_little:\n return 0\n does_have_big = 0\n for elem in [chr(i) for i in range(ord('A'), ord('Z') + 1)]:\n if elem in a:\n does_have_big = 1\n break\n if not does_have_big:\n return 0\n number = 0\n for elem in [chr(i) for i in range(ord('0'), ord('9') + 1)]:\n if elem in a:\n number = 1\n break\n if not number:\n return 0\n return 1\n\na = input()\nif check(a):\n print(\"Correct\")\nelse:\n print(\"Too weak\")", "s=input()\r\nif len(s)>=5:\r\n if any (i.isupper() for i in s):\r\n if any(i.islower() for i in s):\r\n if any(i.isdigit() for i in s):\r\n print('Correct')\r\n else:\r\n print(\"Too weak\")\r\n else:\r\n print(\"Too weak\")\r\n else:\r\n print(\"Too weak\") \r\nelse:\r\n print(\"Too weak\") ", "s=input().rstrip()\r\nS=set(s)\r\nA=set('QWERTYUIOPASDFGHJKLZXCVBNM')\r\na=set('qwertyuiopasdfghjklzxcvbnm')\r\na0=set('1234567890')\r\nif(len(s)>=5 and A&S!=set() and a&S!=set() and a0 &S!=set()):\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "s = input()\r\nl = [0, 0, 0]\r\n\r\nif len(s) < 5:\r\n\tprint(\"Too weak\")\r\nelse:\r\n\tfor i in s:\r\n\t\tif 65 <= ord(i) <= 90:\r\n\t\t\tl[0] = 1\r\n\t\telif 97 <= ord(i) <= 122:\r\n\t\t\tl[1] = 1\r\n\t\telif 48 <= ord(i) <= 57:\r\n\t\t\tl[2] = 1\r\n\t\t\t\r\n\tif 0 in l:\r\n\t\tprint(\"Too weak\")\r\n\telse:\r\n\t\tprint(\"Correct\")", "import sys\r\n\r\nx = input()\r\n\r\ncount_small = 0\r\ncount_big = 0\r\nfor i in x:\r\n if i.islower():\r\n count_small += 1\r\nfor y in x:\r\n if y.isupper():\r\n count_big += 1\r\nu = len(x)\r\n\r\nif u >= 5:\r\n if count_big >= 1:\r\n if count_small >= 1:\r\n if \"1\" in x or \"2\" in x or \"3\" in x or \"4\" in x or \"5\" in x or \"6\" in x or \"7\" in x or \"8\" in x or \"9\" in x or \"0\" in x:\r\n print(\"Correct\")\r\n sys.exit()\r\n\r\n\r\nprint(\"Too weak\")", "s, ans = input(), 0\r\nfor i in s:\r\n if i.isdigit():\r\n ans += 1\r\n break\r\nfor i in s:\r\n if i.isupper():\r\n ans += 1\r\n break\r\nfor i in s:\r\n if i.islower():\r\n ans += 1\r\n break\r\nprint('Correct' if ans == 3 and len(s) >= 5 else 'Too weak')\r\n", "s=input()\r\nlarge=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nsmall=\"abcdefghijklmnopqrstuvwxyz\"\r\ndigit=\"0123456789\"\r\n\r\ncnd1=False\r\ncnd2=False\r\ncnd3=False\r\ncnd4=False\r\n\r\nfor i in range(len(s)):\r\n if (s[i] in large):\r\n cnd2=True\r\n if (s[i] in small):\r\n cnd3=True\r\n if (s[i] in digit):\r\n cnd4=True\r\n\r\nif (len(s)>=5):\r\n cnd1=True\r\n\r\nif (cnd1 and cnd2 and cnd3 and cnd4):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "pawd = str(input())\r\nnum = 0\r\nfor x in pawd:\r\n if x.isupper() == True:\r\n num +=1\r\n break\r\nfor y in pawd:\r\n if y.islower() == True:\r\n num +=1\r\n break\r\nfor z in pawd:\r\n if z.isdigit() == True:\r\n num +=1\r\n break\r\nif num == 3 and len(pawd) > 4:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "s=input()\r\nif len(s)>=5:\r\n a=0\r\n b=0\r\n c=0\r\n for i in s:\r\n if i.isdigit():\r\n c+=1\r\n elif i.isupper():\r\n a+=1\r\n elif i.islower():\r\n b+=1\r\n if a>=1 and b>=1 and c>=1:\r\n print('Correct')\r\n else:\r\n print('Too weak')\r\nelse:\r\n print('Too weak')", "p=input()\nu=[]\nl=[]\nd=[]\nfor i in p:\n if i.islower():\n l.append(i)\n elif i.isupper():\n u.append(i)\n elif i.isdigit():\n d.append(i)\nif (len(p)>=5) and (len(l)>0) and (len(u)>0) and (len(d)>0):\n print(\"Correct\")\nelse:\n print(\"Too weak\")\n \n ", "s = input()\r\nprint(\"Correct\" if len(s) >= 5 and any(list(map(lambda x: x in '0123456789',list(s)))) and any(list(map(lambda x: x.isupper(),list(s)))) and any(list(map(lambda x: x.islower(),list(s)))) else \"Too weak\")", "b=0\nc=0\nd=0\ne=0\na=input()\nif len(a)<5: \n print(\"Too weak\")\nelse:\n c=0\n for f in a:\n j=ord(f)\n if b+c+d==3: \n e+=1\n print(\"Correct\")\n break\n elif 48<=j and j<=57: b=1\n elif 97<=j and 122>=j: c=1\n elif 65<=j and j<=90: d=1\n if e==0: print(\"Too weak\")\n \n\t \t\t\t\t\t\t\t \t\t \t \t \t \t\t \t", "n=list(input())\r\n\r\nans=\"Too weak\"\r\nl=[False]*3\r\nif len(n)<5:\r\n print(ans)\r\nelse:\r\n for i in n:\r\n if i.isnumeric():\r\n l[0]=True\r\n if i.islower():\r\n l[1]=True\r\n if i.isupper():\r\n l[2]=True\r\n if False in l:\r\n print(ans)\r\n else:\r\n print('Correct')", "s = input()\nres = len(s) >= 5 and any(c.islower() for c in s) and any(c.isupper() for c in s) and any(c.isdigit() for c in s)\nres = \"Correct\" if res else \"Too weak\"\nprint(res)\n", "b='ZXCVBNMLKJHGFDSAQWERTYUIOP'\r\nc='zxcvbnmlkjhgfdsaqwertyuiop'\r\nq1='0123456789'\r\na=input()\r\ns=0\r\nt=0\r\nr1=0\r\nfor i in a:\r\n if i in b:\r\n s+=1\r\n if i in c:\r\n t+=1\r\n if i in q1:\r\n r1+=1\r\nif len(a)>=5 and s>0 and t>0 and r1>0:\r\n print('Correct')\r\nelse:\r\n print('Too weak')\r\n", "s=input()\r\nlow,up,dig=0,0,0\r\nfor i in s:\r\n if i.islower():\r\n low+=1 \r\n elif i.isupper():\r\n up+=1 \r\n elif i.isdigit():\r\n dig+=1 \r\nif len(s)>=5 and low*up*dig!=0:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "s=str(input())\r\nflag=0\r\nif(len(s)<5):\r\n flag=1\r\ne=0\r\nf=0\r\ng=0\r\nfor i in range(0,len(s)):\r\n if(s[i].isdigit()):\r\n g=g+1\r\n elif(s[i]>='a' and s[i]<='z'):\r\n e=e+1\r\n elif(s[i]>='A' and s[i]<='Z'):\r\n f=f+1\r\nif(e==0 or f==0 or g==0):\r\n flag=1\r\nif(flag==1):\r\n print('Too weak')\r\nelse:\r\n print('Correct')", "s = input()\r\na = []\r\na.append(len(s) >= 5)\r\na.append(False)\r\nfor i in s:\r\n if i.isupper():\r\n a[-1] = True\r\na.append(False)\r\nfor i in s:\r\n if i.islower():\r\n a[-1] = True\r\na.append(False)\r\nfor i in s:\r\n if i.isdigit():\r\n a[-1] = True\r\nif all(a):\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "d = {\"!\", \"?\", \".\", \",\", \"_\"}\r\n\r\ndef solve():\r\n s = input()\r\n \r\n n = len(s)\r\n if n >= 5 \\\r\n and any(x.isupper() for x in s) \\\r\n and any(x.islower() for x in s) \\\r\n and any(x.isdigit() for x in s):\r\n return \"Correct\"\r\n else:\r\n return \"Too weak\"\r\n\r\nprint(solve())", "word=str(input())\r\ncounter=0\r\nif len(word)>=5:\r\n counter+=1\r\nfor char in word:\r\n if char.isupper()==True:\r\n counter+=1\r\n break\r\nfor char in word:\r\n if char.islower()==True:\r\n counter+=1\r\n break\r\nfor char in word:\r\n if char.isdigit()==True:\r\n counter+=1\r\n break\r\nif counter==4:\r\n print(\"Correct\")\r\nelse :\r\n print(\"Too weak\")", "n=input() \r\nres=False\r\nres1=False\r\nres2= False\r\nif(len(n)<5):\r\n print(\"Too weak\")\r\n quit()\r\nelse:\r\n for i in range(len(n)):\r\n if(n[i].isupper()):\r\n res=True\r\n elif(n[i].islower()):\r\n res1=True\r\n elif(n[i].isdigit()):\r\n res2=True\r\nif(res==True and res1==True and res2==True):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n ", "s=input()\r\na=False\r\nb=False\r\nc=False\r\nd=False\r\nfor i in range(len(s)):\r\n if i>=4:\r\n a=True\r\n if s[i]<='Z' and s[i]>='A' :\r\n b=True\r\n if s[i]<='z' and s[i]>='a' :\r\n c=True\r\n if s[i]>='0' and s[i]<='9':\r\n d=True\r\n if a and b and c and d:\r\n break\r\nif a and b and c and d:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "s=input()\r\nx,y,z=0,0,0\r\nn=len(s)\r\nif(n<5):\r\n print(\"Too weak\")\r\nelse:\r\n for i in s:\r\n if(i.isupper()):\r\n x=1\r\n break\r\n for i in s:\r\n if(i.islower()):\r\n y=1\r\n break\r\n for i in s:\r\n if(i.isdigit()):\r\n z=1\r\n break\r\n if(x==1 and y==1 and z==1):\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")", "password = list(input())\r\nlengthOk = False\r\nlargeOk = False\r\nsmallOk = False\r\ndigitOk = False\r\nfor ch in password:\r\n if(ch.islower()):\r\n smallOk = True\r\n elif(ch.isupper()):\r\n largeOk = True\r\n elif(ch.isdigit()):\r\n digitOk = True\r\nif(len(password) >= 5):\r\n lengthOk = True\r\nif(lengthOk and largeOk and smallOk and digitOk):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "pw = input()\n\nlg = case = numb = 0\n\nif len(pw) >= 5:\n lg = 1\nif pw.lower() != pw and pw.upper() != pw:\n case = 1\nfor i in pw:\n if i.isnumeric():\n numb = 1\n\n#print(lg, case, numb)\n\nif numb and case and lg:\n print('Correct')\nelse:\n print('Too weak')\n", "line = input()\n\ndef has_lower(test_string):\n\tfor i in test_string:\n\t\tif i.islower() == True:\n\t\t\treturn True\n\treturn False\n\ndef has_digit(test_string):\n\tfor i in test_string:\n\t\tif i.isdigit() == True:\n\t\t\treturn True\n\treturn False\n\ndef has_upper(test_string):\n\tfor i in test_string:\n\t\tif i.isupper() == True:\n\t\t\treturn True\n\treturn False\n\nif len(line) >= 5 and has_upper(line) == True and has_lower(line) == True and has_digit(line):\n\tprint('Correct')\nelse:\n\tprint('Too weak')\n\n", "st = input()\r\ncount_Capital = 0\r\ncount_Small = 0\r\ncount_char = len(st)\r\ncount_digit = 0\r\nn = len(st)\r\nif count_char<5:\r\n print(\"Too weak\")\r\nelse:\r\n for i in range (0,n):\r\n if 65<=ord(st[i])<=90:\r\n count_Capital+=1\r\n elif 97<=ord(st[i])<=122:\r\n count_Small+=1\r\n elif 48<=ord(st[i])<=57:\r\n count_digit+=1\r\n\r\n if count_Capital*count_Small*count_digit>0:\r\n print(\"Correct\")\r\n break\r\n elif i==n-1:\r\n print(\"Too weak\")", "password = input()\r\nif len(password) >= 5 and any(c.isupper() for c in password) and any(c.islower() for c in password) and any(c.isdigit() for c in password):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "n = input()\r\nfirst, second, third, fourth = False, False, False, False\r\nif len(n) >= 5:\r\n\tfirst = True\r\nfor x in n:\r\n\tif x.isupper():\r\n\t\tsecond = True\r\n\tif x.islower():\r\n\t\tthird = True\r\n\tif x.isdigit():\r\n\t\tfourth = True\r\n\r\nif first and second and third and fourth:\r\n\tprint(\"Correct\")\r\nelse:\r\n\tprint(\"Too weak\")", "p = input()\nl = s = d = False\nfor c in p:\n if c.isupper(): l = True\n if c.islower(): s = True\n if c.isdigit(): d = True\nprint('Correct' if len(p) >= 5 and l and s and d else 'Too weak')\n", "st = input()\r\nlower = []\r\nupper = []\r\nspecial = []\r\ndigit = []\r\nfor i in st:\r\n if i >= 'a' and i <= 'z':\r\n lower.append(i)\r\n elif i >= 'A' and i <= 'Z':\r\n upper.append(i)\r\n elif i >= '0' and i <= '9':\r\n digit.append(i)\r\n else:\r\n special.append(i)\r\nif len(st) >= 5 and len(lower)*len(upper)*len(digit) > 0:\r\n print(\"Correct\")\r\nelse:\r\n print('Too weak')\r\n", "# LUOGU_RID: 113481645\ndef main():\r\n a=input()\r\n if len(a)>=5 and a.lower()!=a and a.upper()!=a:\r\n for i in a:\r\n if ord(i)>=ord('0') and ord(i)<=ord('9'):\r\n print('Correct')\r\n return\r\n print('Too weak')\r\nmain()", "s = input()\r\nprint('Correct' if len(s) >= 5 and any([elem.isupper() for elem in s]) and any([elem.islower() for elem in s]) and any([elem.isdigit() for elem in s]) else 'Too weak')", "\r\nimport sys\r\nimport math\r\n \r\nst = sys.stdin.readline()\r\n\r\nl = 0\r\n \r\na1 = 0\r\na2 = 0\r\na3 = 0\r\n \r\nfor i in st:\r\n v = ord(i)\r\n if(v >= 48 and v <= 57):\r\n a1 = 1\r\n if(v >= 65 and v <= 90):\r\n a2 = 1\r\n if(v >= 97 and v <= 122):\r\n a3 = 1\r\n \r\n l += 1\r\n \r\nif(a1 == 1 and a2 == 1 and a3 == 1 and l - 1 >= 5):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n\r\n", "s = input()\r\nl = len(s)\r\nsmall = 0\r\nbig = 0\r\ndigit = 0\r\nif l >= 5:\r\n for i in range(l):\r\n if 'a' <= s[i] <= 'z':\r\n small = 1\r\n elif 'A' <= s[i] <= 'Z':\r\n big = 1\r\n elif '0' <= s[i] <= '9':\r\n digit = 1\r\n if small + big + digit == 3:\r\n ans = 'Correct'\r\n else:\r\n ans = 'Too weak'\r\nelse:\r\n ans = 'Too weak'\r\nprint(ans)\r\n", "s = input()\r\nif len(s) >= 5 and any(x.isupper() for x in s) and any(x.islower() for x in s) and any(x.isdigit() for x in s):\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "a = input()\r\no = 0\r\nt = 0\r\nf = 0\r\nfor i in a:\r\n if \"0\" <= i <= \"9\":\r\n o += 1\r\n elif \"a\" <= i <= \"z\":\r\n t += 1\r\n elif \"A\" <= i <= \"Z\":\r\n f += 1\r\nif len(a) >= 5 and o >= 1 and t >= 1 and f >= 1:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "# LUOGU_RID: 97768193\na=input()\r\nb=c=d=e=0\r\nl1=[]\r\nfor i in a:\r\n i=str(i)\r\n l1.append(i)\r\n if int(len(l1))>=5:\r\n e=1\r\n if i.isdigit() is True:\r\n b+=1\r\n if i.isupper() is True:\r\n c+=1\r\n if i.islower() is True:\r\n d+=1\r\nif b>=1 and c>=1 and d>=1 and e==1:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "s=input()\r\nif len(s)<5:\r\n print(\"Too weak\")\r\nelse:\r\n count=0\r\n g,h,u=True,True,True\r\n for i in s:\r\n if u==True:\r\n if ord(i) in list(range(48,58)):\r\n count+=1\r\n u=False\r\n if g==True:\r\n if ord(i) in list(range(65,91)):\r\n count+=1\r\n g=False\r\n if h==True:\r\n if ord(i) in list(range(97,123)):\r\n h=False\r\n count+=1\r\n if count==3:\r\n print(\"Correct\")\r\n else:\r\n print(\"Too weak\")\r\n \r\n \r\n \r\n ", "import re\n\nx = input()\ncorrect = True\nif len(x) < 5:\n\tcorrect = False\nif re.search(\"[A-Z]\",x) is None:\n\tcorrect = False\nif re.search(\"[a-z]\",x) is None:\n\tcorrect = False\nif re.search(\"\\d\",x) is None:\n\tcorrect = False\nif correct:\n\tprint(\"Correct\")\nelse:\n\tprint(\"Too weak\")\n \t \t \t\t \t \t\t\t \t\t \t\t\t\t", "\r\ndef check(a):\r\n res = [\"Too weak\", \"Correct\"]\r\n r = 0\r\n if len(a) < 5:\r\n return res[r]\r\n \r\n w = [False] * 3\r\n \r\n capitals = [chr(x) for x in range(ord(\"A\"), ord(\"Z\") + 1)]\r\n letters = [chr(x) for x in range(ord(\"a\"), ord(\"z\") + 1)]\r\n digits = [chr(x) for x in range(ord(\"0\"), ord(\"9\") + 1)]\r\n \r\n for i in a:\r\n if i in capitals:\r\n w[0] = True\r\n if i in letters:\r\n w[1] = True\r\n if i in digits:\r\n w[2] = True\r\n \r\n r = all(x for x in w)\r\n \r\n return res[r]\r\n\r\nt = input()\r\nprint(check(t))", "import re\r\ns=input()\r\nprint([\"Too weak\",\"Correct\"][(len(s)>=5)&all([re.search(t,s) for t in ['[a-z]','[A-Z]','\\d']])])", "password=input()\r\na=b=c=0\r\nif len(password)>4:\r\n for i in password:\r\n if a==0 and (ord(i) in range(48,58)): a=1\r\n if b==0 and (ord(i) in range(65,91)): b=1\r\n if c==0 and (ord(i) in range(97,123)): c=1\r\n if a+b+c>2:\r\n print('Correct')\r\n exit()\r\nprint ('Too weak')\r\n\r\n", "s = input()\r\ngot_low = False\r\ngot_high = False\r\ngot_digit = False\r\nfor char in s:\r\n if 'a' <= char <= 'z':\r\n got_low = True\r\n if 'A' <= char <= 'Z':\r\n got_high = True\r\n if '0' <= char <= '9':\r\n got_digit = True\r\nif got_low and got_high and got_digit and len(s) >= 5:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "s = input()\r\nd,u,l = 0,0,0\r\nfor i in s:\r\n if(i.isdigit()):\r\n d+=1\r\n if(i.islower()):\r\n l+=1\r\n if(i.isupper()):\r\n u+=1\r\nif( d == 0 or u == 0 or l == 0 or len(s)<5):\r\n print(\"Too weak\")\r\nelse:\r\n print(\"Correct\")", "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\n# a〜z -- START --\nalf1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']\n# a〜z --- END ---\n\n# A~Z -- START --\nalf2=['A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z']\n# A~Z --- END ---\n\n\ndef main():\n s=list(S())\n\n if len(s)<5:\n return 'Too weak'\n\n num_list=[str(x) for x in range(10)]\n f1=f2=f3=False\n for x in s:\n if x in alf1:\n f1=True\n if x in alf2:\n f2=True\n if x in num_list:\n f3=True\n\n if not f1 or not f2 or not f3:\n return 'Too weak'\n\n return 'Correct'\n\n# main()\nprint(main())\n", "a, b, c = 0, 0, 0\r\ns = input()\r\nfor i in s:\r\n a += i.islower()\r\n b += i.isupper()\r\n c += i.isdigit()\r\nprint('Correct' if a * b * c * (len(s) >= 5) else 'Too weak')\r\n", "import string\ns = input()\nf1 = f2 = f3 = False\nfor c in s:\n if c in string.ascii_lowercase:\n f1 = True\n if c in string.ascii_uppercase:\n f2 = True\n if c in string.digits:\n f3 = True\nif len(s) >= 5 and f1 and f2 and f3:\n print('Correct')\nelse:\n print('Too weak')", "def main():\n s = input()\n print((\"Too weak\", \"Correct\")[len(s) > 4 and all(any(map(f, s)) for f in (str.isdigit, str.islower, str.isupper))])\n\n\nif __name__ == '__main__':\n main()\n", "s = input()\r\n\r\na = False\r\nb = False\r\nc = False\r\nd = False\r\n\r\nif len(s)>=5:\r\n a = True\r\n \r\nfor i in \"abcdefghijklmnopqrstuvwxyz\":\r\n if i in s:\r\n b = True\r\n if i.upper() in s:\r\n c = True\r\n \r\nfor i in \"0123456789\":\r\n if i in s:\r\n d = True\r\n \r\nif a and b and c and d:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")", "n=input()\r\nsim=0\r\nchis=0\r\nBuk=0\r\nbuk=0\r\nif len(n)>=5:\r\n sim+=1\r\nfor i in range(len(n)):\r\n if ord(n[i])>47 and ord(n[i])<58:\r\n chis+=1\r\n if ord(n[i])>64 and ord(n[i])<91:\r\n Buk+=1\r\n if ord(n[i])>96 and ord(n[i])<123:\r\n buk+=1\r\nif sim>0 and chis>0 and Buk>0 and buk>0:\r\n print('Correct')\r\nelse:\r\n print('Too weak')", "# @Author: Justin Hershberger\r\n# @Date: 30-03-2017\r\n# @Filename: 411A.py\r\n# @Last modified by: Justin Hershberger\r\n# @Last modified time: 30-03-2017\r\n\r\n\r\n\r\n#Justin Hershberger\r\n#Py3.5\r\n\r\nimport fileinput\r\n\r\ndef test():\r\n\tpass\r\nif __name__ == '__main__':\r\n\tpw = input()\r\n\tcriteria = 0\r\n\tif len(pw) >= 5:\r\n\t\tcriteria += 1\r\n\t\tfor let in pw:\r\n\t\t\tif ord(let) in range(65,91):\r\n\t\t\t\tcriteria += 1\r\n\t\t\t\tbreak\r\n\t\tfor let in pw:\r\n\t\t\tif ord(let) in range(97,123):\r\n\t\t\t\tcriteria += 1\r\n\t\t\t\tbreak\r\n\t\tfor let in pw:\r\n\t\t\tif ord(let) in range(48,58):\r\n\t\t\t\tcriteria += 1\r\n\t\t\t\tbreak\r\n\t\tif criteria == 4:\r\n\t\t\tprint(\"Correct\")\r\n\t\telse:\r\n\t\t\tprint(\"Too weak\")\r\n\telse:\r\n\t\tprint(\"Too weak\")\r\n", "# https://codeforces.com/problemset/problem/411/A\r\n\r\nstring = input()\r\n\r\nsmall = None\r\ncapital = None\r\ndigit = None\r\n\r\nif len(string) < 5:\r\n print(\"Too weak\")\r\nelse:\r\n for i in string:\r\n if i.islower():\r\n small = True\r\n if i.isupper():\r\n capital = True\r\n if i.isnumeric():\r\n digit = True\r\n\r\n if small and capital and digit:\r\n print(\"Correct\")\r\n break\r\n else:\r\n print(\"Too weak\")\r\n \r\n", "S = input()\r\na = len(S) >= 5\r\nb, c, d = 0, 0, 0\r\nfor i in S:\r\n if 'A' <= i <= 'Z':\r\n b = 1\r\n if 'a' <= i <= 'z':\r\n c = 1\r\n if '0' <= i <= '9':\r\n d = 1\r\nif a + b + c + d == 4:\r\n print(\"Correct\")\r\nelse:\r\n print(\"Too weak\")\r\n", "p = input()\r\n\r\nb=[]\r\nfor i in p:\r\n\tb.append(ord(i))\r\n\r\nf=0\r\nif len(b) >= 5:\r\n\tf = 1\r\n\r\nl=s=d=0\r\nfor i in b:\r\n\tif i in range(65,91):\r\n\t\tl = 1\r\n\telif i in range(97,123):\r\n\t\ts = 1\r\n\telif i in range(48,58):\r\n\t\td = 1\r\n\r\nif f==l==s==d==1:\r\n\tprint('Correct')\r\nelse:\r\n\tprint('Too weak')", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndata = input().rstrip()\r\n\r\nif len(data) < 5 or not any([True if i.isupper() else False for i in data]) \\\r\n or not any([True if i.islower() else False for i in data]) \\\r\n or not any([True if i.isdigit() else False for i in data]):\r\n print(\"Too weak\")\r\nelse:\r\n print(\"Correct\")\r\n", "s = input()\nx = 0\n\nif len(s) >= 5:\n\tfor i in range(len(s)):\n\t\tif s[i] >= \"a\" and s[i] <= \"z\":\n\t\t\tx = x | 1\n\t\tif s[i] >= \"A\" and s[i] <= \"Z\":\n\t\t\tx = x | 2\n\t\tif s[i] >= \"0\" and s[i] <= \"9\":\n\t\t\tx = x | 4\n\t\tif x == 7:\n\t\t\tbreak\n\nif x == 7:\n\tprint(\"Correct\")\nelse:\n\tprint(\"Too weak\")\n\t\t\t\t\t\t\t\t \t\t\t\t\t \t\t\t \t \t \t \t\t", "class CodeforcesTask411ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.password = ''\r\n\r\n def read_input(self):\r\n self.password = input()\r\n\r\n def process_task(self):\r\n correct = True\r\n if len(self.password) < 5:\r\n correct = False\r\n else:\r\n cond1_met = False\r\n cond2_met = False\r\n cond3_met = False\r\n for c in \"abcdefghijklmnoprstuvwxyz\":\r\n if c in self.password:\r\n cond1_met = True\r\n break\r\n for c in \"abcdefghijklmnoprstuvwxyz\".upper():\r\n if c in self.password:\r\n cond2_met = True\r\n break\r\n for c in \"123456790\":\r\n if c in self.password:\r\n cond3_met = True\r\n break\r\n correct = cond1_met and cond2_met and cond3_met\r\n if correct:\r\n self.result = \"Correct\"\r\n else:\r\n self.result = \"Too weak\"\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask411ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n" ]

[ "def diff(s) : return [s[i] - s[i - 1] for i in range(1, len(s))]\nn, m = map(int, input().split())\nif m > n : print(0) ; exit(0)\nif m == 1 : print(n) ; exit(0)\nt = diff(list(map(int, input().split())))\np = diff(list(map(int, input().split())))\nw = p + [10 ** 9] + t\nres = 0\npi = [0] * len(w)\nfor i in range (1, len(w)):\n j = pi[i - 1]\n while j > 0 and w[i] != w[j] : j = pi[j - 1]\n if w[i] == w[j] : j += 1\n pi[i] = j\n if j == len(p) : res += 1\nprint(res)\n\n \t\t\t\t \t \t \t\t\t \t \t \t \t\t\t", "from sys import stdin\r\n# input=stdin.buffer.readline\r\ninput=lambda : stdin.readline().strip()\r\nlin=lambda :list(map(int,input().split()))\r\niin=lambda :int(input())\r\nmain=lambda :map(int,input().split())\r\nfrom math import ceil,sqrt,factorial,log\r\nfrom collections import deque\r\nfrom bisect import bisect_left\r\nmod=998244353\r\nmod=1000000007\r\ndef kmp_pi(n,w,l,h):\r\n\th=h+[10**9]+l\r\n\tpi=[0 for i in range(len(h))]\r\n\tans=0\r\n\tfor i in range(1,len(h)):\r\n\t\tj=pi[i-1]\r\n\t\twhile(j>0 and h[i]!=h[j]):\r\n\t\t\t# print(j)\r\n\t\t\tj=pi[j-1]\r\n\r\n\t\tif(h[i]==h[j]):\r\n\t\t\tj+=1\t\r\n\t\tpi[i]=j\r\n\t\tif j==w:\r\n\t\t\tans+=1\r\n\t\t# # print(i)\r\n\t# print(pi)\r\n\treturn ans\r\ndef dif(l):\r\n\tx=[]\r\n\tfor i in range(1,len(l)):\r\n\t\tx.append(l[i-1]-l[i])\r\n\treturn x\r\ndef solve(we):\r\n\tn,w=main()\r\n\tl=dif(lin())\r\n\th=dif(lin())\r\n\tif w==1:\r\n\t\tprint(n)\r\n\telse:\r\n\t\tx=kmp_pi(n-1,w-1,l,h)\r\n\t\tprint(x)\r\n\r\nqwe=1\r\n# qwe=iin()\r\nfor _ in range(qwe):\r\n\tsolve(_+1)", "import sys\n\ninput = sys.stdin.readline\nsys.setrecursionlimit(10 ** 4 + 5)\n\ntest = False\n\nmod1, mod2 = 10 ** 9 + 7, 998244353\ninf = 10 ** 18 + 5\nlim = 10 ** 5 + 5\n\n\ndef compute_prefix(pat: list) -> list:\n\n n = len(pat)\n pi = [0 for _ in range(n)]\n\n k = 0\n\n for i in range(2, n):\n\n while k > 0 and pat[k + 1] != pat[i]:\n\n k = pi[k]\n\n if pat[k + 1] == pat[i]:\n\n k += 1\n\n pi[i] = k\n\n return pi\n\n\ndef kmp_matcher(pat: list, s: list) -> int:\n\n pat = [-inf] + pat\n s = [-inf] + s\n\n pi = compute_prefix(pat)\n\n n = len(pat)\n m = len(s)\n\n k = 0\n cnt = 0\n\n for i in range(1, m):\n\n while k > 0 and pat[k + 1] != s[i]:\n\n k = pi[k]\n\n if pat[k + 1] == s[i]:\n\n k += 1\n\n if k == n - 1:\n\n cnt += 1\n k = pi[k]\n\n return cnt\n\n\ndef test_case():\n\n n, w = map(int, input().split())\n\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n\n diff1 = [a[i] - a[i - 1] for i in range(1, n)]\n diff2 = [b[i] - b[i - 1] for i in range(1, w)]\n\n if len(diff2) == 0:\n\n print(n)\n return\n\n if len(diff1) == 0:\n\n print(0)\n return\n\n print(kmp_matcher(diff2, diff1))\n\n\nt = 1\n\nif test:\n\n t = int(input())\n\nfor _ in range(t):\n\n # print(f\"Case #{_+1}: \", end='')\n test_case()\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nMOD = 9223372036854775807\r\nMOD = 18014398241046527\r\nbb = 10**9+7\r\n\r\n# A = [2,1,0,-1,-1,0,0,0,1,0,-1,-1]\r\n\r\n# seen = {}\r\n# cur = 0\r\n# for i in range(len(A)):\r\n# a = A[i]\r\n# cur*=5\r\n# cur+=a\r\n \r\n# k = (cur-119)//625\r\n# print(cur,k)\r\n# if k in seen.keys():\r\n# print(k, seen[k], i)\r\n \r\n# seen[cur]=i\r\n\r\n# exit(0)\r\nN,W = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\nif W==1:\r\n exit(print(N))\r\n \r\n\r\ninv = pow(bb, MOD-2, MOD)\r\ninv = pow(inv, W-1, MOD)\r\n\r\nfind = 0\r\nfor i in range(W-1):\r\n find *= bb\r\n find %= MOD\r\n find += B[i+1]-B[i]\r\n find %= MOD\r\n \r\nans = 0\r\nseen = [str(MOD)]*N\r\nseen[0] = '0'\r\ncur = 0\r\nfor i in range(1,N):\r\n cur *= bb\r\n cur %= MOD\r\n cur += A[i]-A[i-1]\r\n cur %= MOD\r\n \r\n k = (cur-find)*inv\r\n k %= MOD\r\n k = str(k)\r\n #print(cur, k, inv)\r\n if seen[i-W+1]==k:\r\n #print('i',i)\r\n ans+=1\r\n seen[i] = str(cur)\r\n#print(seen)\r\nprint(ans)\r\n\r\n\r\n", "import sys\n\ndef z_function(s):\n n = len(s)\n z = [0] * n\n #for (int i = 1, l = 0, r = 0; i < n; ++i) {\n l, r = 0, 0\n for i in range(1, n):\n if i <= r:\n z[i] = min(r - i + 1, z[i - l])\n while i + z[i] < n and s[z[i]] == s[i + z[i]]:\n z[i] += 1\n if i + z[i] - 1 > r:\n l = i\n r = i + z[i] - 1\n return z\n\nn, m = [int(x) for x in input().split()]\nbig = [int(x) for x in input().split()]\nsmall = [int(x) for x in input().split()]\nbigd = [big[i] - big[i-1] for i in range(1, len(big))]\nsmalld = [small[i] - small[i-1] for i in range(1, len(small))]\nprint(z_function(smalld + ['l'] + bigd).count(len(smalld)))\n\n \n \n\t\t \t \t \t\t\t\t\t \t\t\t \t \t", "def get_fail(pat,lw):\r\n fail = [0]*lw\r\n pos, cnd = 2, 0\r\n fail[0] = -1\r\n\r\n while pos < lw:\r\n if pat[pos - 1] == pat[cnd]:\r\n fail[pos] = cnd + 1\r\n cnd += 1\r\n pos += 1\r\n elif cnd > 0:\r\n cnd = fail[cnd]\r\n else:\r\n pos += 1\r\n\r\n return fail\r\n\r\ndef kmp(txt,pat,ls,lw):\r\n pat += [10**10]\r\n lw += 1\r\n\r\n fail = get_fail(pat,lw)\r\n\r\n i,m,ans = 0,0,0\r\n\r\n while i + m < ls:\r\n if pat[i] == txt[i+m]:\r\n i += 1\r\n if i == lw - 1:\r\n ans += 1\r\n else:\r\n if fail[i] > -1:\r\n m += i - fail[i]\r\n i = fail[i]\r\n else:\r\n i = 0\r\n m += 1\r\n\r\n print(ans)\r\n\r\ndef main():\r\n n,w = map(int,input().split())\r\n if w == 1:\r\n print(n)\r\n quit()\r\n elif n < w:\r\n print(0)\r\n quit()\r\n txt = list(map(int, input().split()))\r\n pat = list(map(int, input().split()))\r\n txt = [txt[i + 1] - txt[i] for i in range(n - 1)]\r\n pat = [pat[i + 1] - pat[i] for i in range(w - 1)]\r\n kmp(txt,pat,n-1,w-1)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 2/11/20\n\n\"\"\"\n\nimport collections\nimport time\nimport os\nimport sys\nimport bisect\nimport heapq\nfrom typing import List\n\n\n\ndef solve_prefix(N, W, A, B):\n # https://cp-algorithms.com/string/prefix-function.html\n if len(B) == 1:\n return N\n\n A = [A[i] - A[i + 1] for i in range(N - 1)]\n B = [B[i] - B[i + 1] for i in range(W - 1)]\n\n v = max(max(A), max(B)) + 1\n C = B + [v] + A\n M = len(C)\n \n pi = [0 for _ in range(M)]\n for i in range(1, M):\n j = pi[i-1]\n while j > 0 and C[i] != C[j]:\n j = pi[j-1]\n if C[i] == C[j]:\n j += 1\n pi[i] = j\n return pi.count(W-1)\n\n\n\ndef solve_zfunc(N, W, A, B):\n # https://cp-algorithms.com/string/z-function.html\n \n if len(B) == 1:\n return N\n \n A = [A[i]-A[i+1] for i in range(N-1)]\n B = [B[i]-B[i+1] for i in range(W-1)]\n \n v = max(max(A), max(B)) + 1\n C = B + [v] + A\n M = len(C)\n z = [0 for _ in range(M)]\n l, r = 0, 0\n # i starts from 1\n for i in range(1, M):\n if i <= r:\n z[i] = min(z[i-l], r-i+1)\n while i + z[i] < M and C[z[i]] == C[i+z[i]]:\n z[i] += 1\n if i + z[i] - 1 > r:\n r = i + z[i] - 1\n l = i\n # print(C)\n # print(z)\n return z.count(W-1)\n \n\nN, W = map(int, input().split())\nA = [int(x) for x in input().split()]\nB = [int(x) for x in input().split()]\n\n# print(solve_zfunc(N, W, A, B))\nprint(solve_prefix(N, W, A, B))", "# Python program for KMP Algorithm\r\ndef KMPSearch(pat, txt):\r\n M = len(pat)\r\n N = len(txt)\r\n count = 0\r\n\r\n lps = [0]*M\r\n j = 0 # index for pat[]\r\n\r\n # Preprocess the pattern (calculate lps[] array)\r\n computeLPSArray(pat, M, lps)\r\n\r\n i = 0 # index for txt[]\r\n while i < N:\r\n if pat[j] == txt[i]:\r\n i += 1\r\n j += 1\r\n\r\n if j == M:\r\n count += 1\r\n j = lps[j-1]\r\n\r\n # mismatch after j matches\r\n elif i < N and pat[j] != txt[i]:\r\n # Do not match lps[0..lps[j-1]] characters,\r\n # they will match anyway\r\n if j != 0:\r\n j = lps[j-1]\r\n else:\r\n i += 1\r\n return count\r\n\r\ndef computeLPSArray(pat, M, lps):\r\n len = 0 # length of the previous longest prefix suffix\r\n\r\n lps[0] # lps[0] is always 0\r\n i = 1\r\n\r\n # the loop calculates lps[i] for i = 1 to M-1\r\n while i < M:\r\n if pat[i]== pat[len]:\r\n len += 1\r\n lps[i] = len\r\n i += 1\r\n else:\r\n if len != 0:\r\n len = lps[len-1]\r\n\r\n # Also, note that we do not increment i here\r\n else:\r\n lps[i] = 0\r\n i += 1\r\n\r\n\r\nn, w = [int(x) for x in input().split()]\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\n\r\nl1_d = []\r\nfor i in range(1, n):\r\n l1_d.append(str(l1[i]-l1[i-1])+',')\r\nl2_d = []\r\nfor i in range(1, w):\r\n l2_d.append(str(l2[i]-l2[i-1])+',')\r\nl1_d = ''.join(l1_d)\r\nl2_d = ''.join(l2_d)\r\n\r\nif l2_d:\r\n count = KMPSearch(l2_d, l1_d)\r\n print(count)\r\nelse:\r\n print(len(l1))\r\n", "def prefix(p):\r\n\tpre = [0] * len(p)\r\n\tj = 0\r\n\ti = 1\r\n\tc = 0\r\n\twhile i < len(p):\r\n\t\tif p[i] == p[j]:\r\n\t\t\tj+=1\r\n\t\t\tpre[i] = j\r\n\t\t\ti+=1\r\n\t\telse:\r\n\t\t\tif j != 0:\r\n\t\t\t\tj = pre[j-1]\r\n\t\t\telse:\r\n\t\t\t\tpre[i] = 0\r\n\t\t\t\ti+=1\r\n\treturn pre\r\n\r\ndef solution(s,p,pre):\r\n\ti = j = 0\r\n\tc = 0\r\n\twhile i < len(s):\r\n\t\tif p[j] == s[i]:\r\n\t\t\tj+=1\r\n\t\t\ti+=1\r\n\t\tif j == len(p):\r\n\t\t\tc+=1\r\n\t\t\tj = pre[j-1]\r\n\t\telif i < len(s) and p[j] != s[i]:\r\n\t\t\tif j != 0:\r\n\t\t\t\tj = pre[j-1]\r\n\t\t\telse:\r\n\t\t\t\ti+=1\r\n\treturn c\r\n\r\ndef convert(l):\r\n\treturn [l[i] - l[i-1] for i in range(1,len(l))]\r\n\r\nn, w = map(int,input().split())\r\nbear = list(map(int,input().split()))\r\nelephant = list(map(int,input().split()))\r\nbear = convert(bear)\r\nelephant = convert(elephant)\r\npre = prefix(elephant)\r\nif not pre:\r\n\tprint(n)\r\n\tquit()\r\nres = solution(bear,elephant,pre)\r\nprint(res)\r\n\r\n", "def z_function(s):\r\n n = len(s)\r\n z = [0] * n\r\n l = r = 0\r\n for i in range(1, n):\r\n if i <= r: z[i] = min(r - i + 1, z[i - l])\r\n while i + z[i] < n and s[z[i]] == s[i + z[i]]: z[i] += 1\r\n if i + z[i] - 1 > r: l, r = i, i + z[i] - 1\r\n return z\r\n\r\nn, w = map(int, input().split())\r\nt = list(map(int, input().split()))\r\np = list(map(int, input().split()))\r\nt = [t[i + 1] - t[i] for i in range(n - 1)]\r\np = [p[i + 1] - p[i] for i in range(w - 1)]\r\nz = z_function(p + [1000000001] + t)\r\nprint(z.count(w - 1))", "line = input().split(\" \");\r\n\r\nstr_len = int(line[0]) - 1;\r\nsub_len = int(line[1]) - 1;\r\n\r\nline = input().split(\" \");\r\nstr = [(int(line[i+1]) - int(line[i])) for i in range(str_len)];\r\nline = input().split(\" \");\r\nsub = [(int(line[i+1]) - int(line[i])) for i in range(sub_len)]; \r\n\r\n# Python program for KMP Algorithm\r\ndef KMPSearch(pat, txt):\r\n count = 0;\r\n M = len(pat)\r\n N = len(txt)\r\n \r\n # create lps[] that will hold the longest prefix suffix \r\n # values for pattern\r\n lps = [0]*M\r\n j = 0 # index for pat[]\r\n \r\n # Preprocess the pattern (calculate lps[] array)\r\n computeLPSArray(pat, M, lps)\r\n \r\n i = 0 # index for txt[]\r\n while i < N:\r\n if pat[j] == txt[i]:\r\n i += 1\r\n j += 1\r\n \r\n if j == M:\r\n count += 1;\r\n #print(\"Found pattern at index \" + str(i-j));\r\n j = lps[j-1]\r\n \r\n # mismatch after j matches\r\n elif i < N and pat[j] != txt[i]:\r\n # Do not match lps[0..lps[j-1]] characters,\r\n # they will match anyway\r\n if j != 0:\r\n j = lps[j-1]\r\n else:\r\n i += 1\r\n \r\n return count;\r\n \r\ndef computeLPSArray(pat, M, lps):\r\n len = 0 # length of the previous longest prefix suffix\r\n \r\n lps[0] # lps[0] is always 0\r\n i = 1\r\n \r\n # the loop calculates lps[i] for i = 1 to M-1\r\n while i < M:\r\n if pat[i]==pat[len]:\r\n len += 1\r\n lps[i] = len\r\n i += 1\r\n else:\r\n # This is tricky. Consider the example.\r\n # AAACAAAA and i = 7. The idea is similar \r\n # to search step.\r\n if len != 0:\r\n len = lps[len-1]\r\n \r\n # Also, note that we do not increment i here\r\n else:\r\n lps[i] = 0\r\n i += 1\r\n\r\nif(sub_len == 0):\r\n print(str_len+1);\r\nelse:\r\n print(KMPSearch(sub, str));", "# Python3 program that implements Z algorithm\n# for pattern searching\n\n# Fills Z array for given string str[]\ndef getZarr(string, z):\n n = len(string)\n\n # [L,R] make a window which matches\n # with prefix of s\n l, r, k = 0, 0, 0\n for i in range(1, n):\n\n # if i>R nothing matches so we will calculate.\n # Z[i] using naive way.\n if i > r:\n l, r = i, i\n\n # R-L = 0 in starting, so it will start\n # checking from 0'th index. For example,\n # for \"ababab\" and i = 1, the value of R\n # remains 0 and Z[i] becomes 0. For string\n # \"aaaaaa\" and i = 1, Z[i] and R become 5\n while r < n and string[r - l] == string[r]:\n r += 1\n z[i] = r - l\n r -= 1\n else:\n\n # k = i-L so k corresponds to number which\n # matches in [L,R] interval.\n k = i - l\n\n # if Z[k] is less than remaining interval\n # then Z[i] will be equal to Z[k].\n # For example, str = \"ababab\", i = 3, R = 5\n # and L = 2\n if z[k] < r - i + 1:\n z[i] = z[k]\n\n # For example str = \"aaaaaa\" and i = 2,\n # R is 5, L is 0\n else:\n\n # else start from R and check manually\n l = i\n while r < n and string[r - l] == string[r]:\n r += 1\n z[i] = r - l\n r -= 1\n\n# prints all occurrences of pattern\n# in text using Z algo\ndef search(text, pattern, foreign=\"$\"):\n\n # Create concatenated string \"P$T\"\n concat = pattern + foreign + text\n l = len(concat)\n\n # Construct Z array\n z = [0] * l\n getZarr(concat, z)\n\n # now looping through Z array for matching condition\n res = 0\n for i in range(l):\n\n # if Z[i] (matched region) is equal to pattern\n # length we got the pattern\n if z[i] == len(pattern):\n res += 1\n return res\n\n# This code is contributed by\n# sanjeev2552\n\n\nn, w = map(int, input().split())\narr = list(map(int, input().split()))\npat = list(map(int, input().split()))\n\ndarr = [arr[i] - arr[i-1] for i in range(1, n)]\ndpat = [pat[i] - pat[i-1] for i in range(1, w)]\n\nres = search(darr, dpat, [\":)\"])\nprint(res)\n", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nn, w = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nd = [0]*(n+w)\r\nz = [0]*(n+w)\r\n\r\nfor i in range(w-1):\r\n d[i] = b[i+1] - b[i]\r\n\r\nd[w - 1] = int(1e18)\r\n\r\nfor i in range(n-1):\r\n d[w + i] = a[i+1] - a[i]\r\n\r\nm = (n - 1) + (w - 1) + 1\r\nres = 0\r\nl, r = 0, 0\r\nfor i in range(1, m):\r\n if i <= r:\r\n z[i] = min(r - i + 1, z[i - l])\r\n \r\n while i + z[i] < m and d[z[i]] == d[i+z[i]]:\r\n z[i] += 1\r\n \r\n if i + z[i] - 1 > r:\r\n l = i\r\n r = i + z[i] - 1\r\n \r\n if z[i] == w-1:\r\n res += 1\r\n\r\nprint(n if w == 1 else res)", "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 hack(a,m,r):\n x = 0\n for i in range(len(a)):\n x = (x*m+a[i]) % r\n return x\n\nmod = 1000000007\nbiggermod = 900000000080000000009\nn,m = readints()\nar = readar()\nbr = readar()\ncr = list()\ndr = list()\nfor i in range(n-1):\n cr.append(ar[i+1]-ar[i]+1000000000)\nfor j in range(m-1):\n dr.append(br[j+1]-br[j]+1000000000)\ntarget = hack(dr,mod,biggermod)\nst = hack(cr[:m-1],mod,biggermod)\nans = 0\nc = len(cr)\nd = len(dr)\nif st == target: ans += 1\nsub = pow(mod,m-2,biggermod)\nfor k in range(c-d):\n st = ((st-sub*cr[k])*mod+cr[k+d]) % biggermod\n if st == target: ans += 1\nprint(ans)\n\n\t \t\t \t \t \t\t \t \t \t\t", "import os\nfrom io import BytesIO\n\ninput = BytesIO(os.read(0, os.fstat(0).st_size)).readline\nprint = lambda x: os.write(1, str(x).encode())\n\n\ndef pi(s):\n p = [0] * len(s)\n for i in range(1, len(s) - 1):\n g = p[i - 1]\n while g and (s[i + 1] - s[i] != s[g + 1] - s[g]):\n g = p[g - 1]\n\n p[i] = g + int(s[i + 1] - s[i] == s[g + 1] - s[g])\n\n return p\n\n\ndef match(s, pat):\n res = 0\n p = pi(pat + [float('inf')] + s)\n for i in range(len(p) - len(s), len(p)):\n if p[i] == len(pat) - 1:\n res += 1\n\n return res\n\n\ndef main():\n n, w = map(float, input().split())\n a = [float(i) for i in input().split()]\n b = [float(i) for i in input().split()]\n\n print(match(a, b))\n\n\nif __name__ == '__main__':\n main()\n", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl = [0]\r\nfor i in range(1, n):\r\n l.append(a[i] - a[i - 1])\r\n \r\nb = list(map(int, input().split()))\r\nz = []\r\nfor i in range(1, w):\r\n z.append(b[i] - b[i - 1])\r\n \r\ns = z + ['#'] + l\r\nn = len(s)\r\npre = [0]\r\nfor i in range(1,n):\r\n j = pre[i - 1]\r\n while j > 0 and s[j] != s[i]:\r\n j = pre[j-1]\r\n if s[j] == s[i]:\r\n j += 1\r\n pre.append(j)\r\nans = 0\r\nfor i in range(len(z) * 2 + 1, len(pre)):\r\n if pre[i] == len(z):\r\n ans += 1\r\nprint(ans)\r\n \t \t \t\t\t \t\t\t \t \t\t\t \t \t\t", "def prekmp(b, w):\n next = [-1] * (w + 1)\n i, j = 0, -1\n while i < w:\n while j != -1 and b[i] != b[j]:\n j = next[j]\n i += 1\n j += 1\n next[i] = j\n return next\n\ndef kmpcnt(a, b, n, w):\n if w == 0:\n return n + 1\n\n next = prekmp(b, w)\n i, j, cnt = 0, 0, 0\n while i < n:\n while j != -1 and a[i] != b[j]:\n j = next[j]\n i += 1\n j += 1\n if j >= w:\n cnt += 1\n j = next[j]\n return cnt\n\n\nn, w = map(int, input().split())\na = list(map(int, input().split()))\nfor i in range(n - 1, 0, -1):\n a[i] -= a[i - 1]\na = a[1:n]\n\nb = list(map(int, input().split()))\nfor i in range(w - 1, 0, -1):\n b[i] -= b[i - 1]\nb = b[1:w]\n\nn, w = n - 1, w - 1\nprint(kmpcnt(a, b, n, w))\n\n\t\t \t\t \t\t \t\t \t \t\t \t \t\t\t\t", "# your code goes here\r\nn, m=map(int, input().split())\r\nif m==1:\r\n\tprint(n)\r\nelse:\r\n\tl1d=list(map(int, input().split()))\r\n\tl2d=list(map(int, input().split()))\r\n\tl1=[l1d[i]-l1d[i-1] for i in range(1, n)]\r\n\tl2=[l2d[i]-l2d[i-1] for i in range(1, m)]\r\n\tl3=l2+[float(\"inf\")]+l1\r\n\tpre=[0 for i in range(n+m-1)]\r\n\ti, l=1, 0\r\n\twhile i<n+m-1:\r\n\t\tif l3[i]==l3[l]:\r\n\t\t\tl+=1\r\n\t\t\tpre[i]=l\r\n\t\t\ti+=1\r\n\t\telse:\r\n\t\t\tif l==0:\r\n\t\t\t\tpre[i]=0\r\n\t\t\t\ti+=1\r\n\t\t\telse:\r\n\t\t\t\tl=pre[l-1]\r\n\tcount=0\r\n\tfor i in range(m, n+m-1):\r\n\t\tif pre[i]==m-1:\r\n\t\t\tcount+=1\r\n\tprint(count)", "from collections import defaultdict\r\nfrom math import inf\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef z(s):\r\n l, r = 0, 0\r\n n = len(s)\r\n z = [0]*n\r\n for i in range(1, n):\r\n if i <= r:\r\n z[i] = min(r - i + 1, z[i - l])\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 l = i\r\n r = i + z[i] - 1\r\n return z\r\n\r\n\r\nn, w = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nif w == 1:\r\n print(n)\r\n quit()\r\ndiffa = [0]*(n-1)\r\ndiffb = [0]*(w-1)\r\nfor i in range(n - 1):\r\n diffa[i] = a[i+1] - a[i]\r\nfor i in range(w - 1):\r\n diffb[i] = b[i+1] - b[i]\r\nzxc = z(diffb + diffa)\r\nans = 0\r\nfor i in range(w-1, len(zxc)):\r\n if zxc[i] >= w-1:\r\n ans += 1\r\nprint(ans)", "def gethash(a, b):\r\n return ((hs[b - 1] - hs[a] * pw[b - a - 1]) % p + p) % p\r\n\r\n\r\nn, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nq = 239\r\np = 123426017006182806728593424683999798008235734137469123231828679\r\n\r\nif w == 1:\r\n print(n)\r\n exit()\r\nif n < w:\r\n print(0)\r\n exit()\r\n\r\nhs = [0] * (n+1)\r\npw = [1] * (n+1)\r\nh = 0\r\nfor i in range(1, n):\r\n hs[i] = (hs[i - 1] * q + a[i] - a[i - 1]) % p\r\n pw[i] = (pw[i - 1] * q) % p\r\n if i < w:\r\n h = (h * q + (b[i] - b[i-1])) % p\r\nans = 0\r\nfor i in range(n - w + 1):\r\n if gethash(i, i + w) == h:\r\n ans += 1\r\nprint(ans)", "n, w = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nb = list(map(int, input().split(' ')))\nif w > n:\n print(0)\nelif w == 1:\n print(n)\nelse:\n da = [a[i + 1] - a[i] for i in range(n - 1)]\n db = [b[i + 1] - b[i] for i in range(w - 1)]\n ans = 0\n t = db + [-10000000000] + da\n pi = [0 for i in range(len(t))]\n for i in range(1, len(t)):\n j = pi[i - 1]\n while j != 0 and t[i] != t[j]:\n j = pi[j - 1]\n pi[i] = j + 1 if t[i] == t[j] else 0\n if pi[i] == w - 1:\n ans += 1\n print(ans)\n \t \t \t \t \t\t\t \t\t \t\t \t", "n, k = map(int, input().split())\na = tuple(map(int, input().split()))\nb = tuple(map(int, input().split()))\n \nif k == 1:\n print(n)\nelif k > n:\n print(0)\nelse:\n p = int(1e16 + 7)\n q = int(499)\n h1 = 0\n hs = [0] * (n + 1)\n pw = [1] * (n + 1)\n z = 1\n for i in range(1, n):\n hs[i] = (hs[i - 1] * q + (a[i] - a[i - 1]) % int(1e18)) % p\n pw[i] = (pw[i - 1] * q) % p\n if i < k:\n h1 = (h1 * q + (b[i] - b[i - 1]) % int(1e18)) % p\n \n \n def get_hash(a, b): # hash [a, b)\n return (hs[b - 1] - (hs[a] * pw[b - a - 1]) % p + p) % p\n \n \n ans = 0\n for i in range(n - k + 1):\n if get_hash(i, i + k) - h1 == 0:\n ans += 1\n print(ans)\n \t \t \t\t\t \t \t \t \t\t\t \t", "def KMPPreprocess(p, prefix):\r\n m = len(p)\r\n prefix = [0] * m\r\n j = 0\r\n i = 1\r\n while i < m:\r\n if p[i] == p[j]:\r\n j += 1\r\n prefix[i] = j\r\n i += 1\r\n else:\r\n if j != 0:\r\n j = prefix[j - 1]\r\n else:\r\n prefix[i] = 0\r\n i += 1\r\n return prefix\r\n\r\ndef calc(B, A):\r\n if len(B) == 0:\r\n return len(A) + 1\r\n\r\n prefix = []\r\n prefix = KMPPreprocess(B, prefix)\r\n\r\n cnt = 0\r\n\r\n n = len(A)\r\n m = len(B)\r\n i, j = 0, 0\r\n while i < n:\r\n if B[j] == A[i]:\r\n i += 1\r\n j += 1\r\n if j == m:\r\n cnt += 1\r\n j = prefix[j - 1]\r\n elif i < n and B[j] != A[i]:\r\n if j != 0:\r\n j = prefix[j - 1]\r\n else:\r\n i += 1\r\n return cnt\r\n\r\nif __name__ == '__main__':\r\n n, w = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n A = []\r\n for i in range(n - 1):\r\n x = a[i + 1] - a[i]\r\n A.append(x)\r\n\r\n B = []\r\n for i in range(w - 1):\r\n x = b[i + 1] - b[i]\r\n B.append(x)\r\n\r\n print(calc(B, A))", "import sys\r\ninput = lambda : sys.stdin.readline().rstrip(\"\\r\\n\")\r\nn,w = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\nd = [0]*(n+w)\r\np = [0]*(n+w)\r\nres = 0\r\n\r\nfor i in range(w-1):\r\n d[i] = b[i+1] - b[i]\r\n\r\nd[w - 1] = int(1e18)\r\n\r\nfor i in range(n-1):\r\n d[w + i] = a[i+1] - a[i]\r\n\r\nm = (w - 1) + 1 + (n - 1)\r\n\r\nfor i in range(1,m):\r\n \r\n j = p[i-1]\r\n \r\n while j > 0 and d[i] != d[j]:\r\n j = p[j-1]\r\n \r\n if d[i] == d[j]:\r\n j += 1\r\n \r\n p[i] = j\r\n \r\n if p[i] == w - 1:\r\n res += 1\r\n \r\nprint(n if w == 1 else res)", "def ZFunction(S) :\n\tL = R = 0\n\tN = len(S)\n\tZ = [0] * N\n\tZ[0] = N\n\tfor i in range (1, N) :\n\t\tif i > R :\n\t\t\tL = R = i\n\t\t\twhile R < N and S[R] == S[R - L] :\n\t\t\t\tR += 1\n\t\t\tZ[i] = R - L\n\t\t\tR -= 1\n\t\telse :\n\t\t\tk = i - L\n\t\t\tif Z[k] < R - i + 1 :\n\t\t\t\tZ[i] = Z[k]\n\t\t\telse :\n\t\t\t\tL = i\n\t\t\t\twhile R < N and S[R] == S[R - L] :\n\t\t\t\t\tR += 1\n\t\t\t\tZ[i] = R - L\n\t\t\t\tR -= 1\n\treturn Z\n\nif __name__ == \"__main__\" :\n\tN, W = [int(x) for x in input().split()]\n\tA = [int(x) for x in input().split()]\n\tB = [int(x) for x in input().split()]\n\tS = [0] * (N + W - 2)\n\tif W == 1 :\n\t\tprint(N)\n\t\texit(0)\n\tfor i in range (0, N + W - 2) :\n\t\tif i < W - 1 :\n\t\t\tS[i] = B[i] - B[i + 1]\n\t\telse :\n\t\t\tS[i] = A[i - W + 1] - A[i - W + 2]\n\tZ = ZFunction(S)\n\tcnt = 0\n\tfor i in range (W - 1, N + W - 2) :\n\t\tif Z[i] >= W - 1 :\n\t\t\tcnt += 1\n\tprint(cnt)", "n, w = map(int, input().split())\r\na = [*map(int, input().split())]\r\nb = [*map(int, input().split())]\r\n\r\n\r\ndef adjdiff(a):\r\n\treturn [0] + [j - i for j, i in zip(a[1:], a[:len(a) - 1])]\r\n\r\n\r\ndef prefix_func(s):\r\n\tp = [0]\r\n\tfor i in s[1:]:\r\n\t\tj = p[-1]\r\n\t\twhile j > 0 and s[j] != i:\r\n\t\t\tj = p[j - 1]\r\n\t\tif i == s[j]:\r\n\t\t\tj += 1\r\n\t\tp.append(j)\r\n\treturn p\r\n\r\n\r\ndef kmp(s, p):\r\n\ts = p + ['$'] + s\r\n\tpre = prefix_func(s)\r\n\to = []\r\n\tfor i in range(len(p), len(pre)):\r\n\t\tif pre[i] == len(p):\r\n\t\t\to.append(i - 2 * len(p))\r\n\r\n\treturn len(o) - o.count(0)\r\n\r\n\r\nprint(kmp(adjdiff(a), adjdiff(b)[1:]))\r\n", "from sys import stdin, stdout\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\nfrom collections import defaultdict as dd, deque\nfrom heapq import merge, heapify, heappop, heappush, nsmallest\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\n \nmod = pow(10, 9) + 7\nmod2 = 998244353\n \ndef inp(): return stdin.readline().strip()\ndef iinp(): return int(inp())\ndef out(var, end=\"\\n\"): stdout.write(str(var)+\"\\n\")\ndef outa(*var, end=\"\\n\"): stdout.write(' '.join(map(str, var)) + end)\ndef lmp(): return list(mp())\ndef mp(): return map(int, inp().split())\ndef smp(): return map(str, inp().split())\ndef l1d(n, val=0): return [val for i in range(n)]\ndef l2d(n, m, val=0): return [l1d(m, val) for j in range(n)]\ndef remadd(x, y): return 1 if x%y else 0\ndef ceil(a,b): return (a+b-1)//b\n \ndef isprime(x):\n if x<=1: return False\n if x in (2, 3): return True\n if x%2 == 0: return False\n for i in range(3, int(sqrt(x))+1, 2):\n if x%i == 0: return False\n return True\n\nn, m = lmp()\narr = lmp()\nif m==1:\n print(n)\nelif n<m:\n print(0)\nelse:\n barr = lmp()\n a1 = [arr[i+1]-arr[i] for i in range(n-1)]\n a2 = [barr[i+1]-barr[i] for i in range(m-1)]\n n-=1\n m-=1\n ml = l1d(m)\n i = 1\n j = 0\n while i<m:\n if a2[i]==a2[j]:\n j += 1\n ml[i] = j\n i += 1\n else:\n if j==0:\n ml[i] = 0\n i += 1\n else:\n j = ml[j-1]\n i = 0\n j = 0\n c = 0\n while(i < n):\n if a1[i]==a2[j]:\n i += 1\n j += 1\n else:\n if j==0:\n i += 1\n else:\n j = ml[j-1]\n if j==m:\n j = ml[j-1]\n c += 1\n print(c)" ]

[ "import sys, threading\r\n\r\ndef main():\r\n n , m = map(int, input().split())\r\n\r\n board = []\r\n for _ in range(n):\r\n board.append(input())\r\n\r\n\r\n visited = {}\r\n directions = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\n\r\n def inbound(row, col):\r\n return 0 <= row < len(board) and 0 <= col < len(board[0])\r\n\r\n\r\n def dfs(row, col, dist):\r\n visited[(row, col)] = dist\r\n\r\n for dr, dc in directions:\r\n nr, nc = row + dr , col + dc\r\n if not inbound(nr, nc):\r\n continue\r\n \r\n if (nr, nc) in visited and visited[(nr, nc)] + 1 < dist and board[nr][nc] == board[row][col]:\r\n return True\r\n\r\n elif (nr, nc) not in visited and board[nr][nc] == board[row][col]:\r\n \r\n if dfs(nr, nc, dist + 1):\r\n return True\r\n\r\n # visited[(nr, nc)] = dist + 1\r\n\r\n return False\r\n\r\n\r\n yes = False\r\n for row in range(n):\r\n for col in range(m):\r\n if (row, col) not in visited:\r\n \r\n if dfs(row, col, 1):\r\n yes = True\r\n break\r\n\r\n if yes:\r\n print('Yes')\r\n\r\n else:\r\n print('No')\r\n\r\n\r\n\r\nsys.setrecursionlimit(1 << 30)\r\nthreading.stack_size(1 << 27)\r\n\r\nmain_thread = threading.Thread(target=main)\r\nmain_thread.start()\r\nmain_thread.join()", "def bfs(A, s, visited=None):\r\n parent = [None] * len(A)\r\n parent[s] = s\r\n level = [[s]]\r\n cycle = False\r\n while (len(level[-1]) > 0):\r\n level.append([])\r\n for u in level[-2]:\r\n for v in A[u]:\r\n if parent[v] == None:\r\n parent[v] = u\r\n level[-1].append(v)\r\n elif (parent[u] != v):\r\n cycle= True\r\n return cycle\r\n\r\n\r\ndef main(): \r\n n, m = list(map(int, input().split()))\r\n G = []\r\n A = [[] for _ in range(n * (m))]\r\n for i in range(n):\r\n row = input()\r\n G.append(row)\r\n for j in range(m - 1):\r\n if row[j] == row[j + 1]:\r\n A[i * m + j].append(i * m + j + 1)\r\n A[i * m + j + 1].append(i * m + j)\r\n if i > 0:\r\n for j in range(m):\r\n if row[j] == G[i - 1][j]:\r\n A[(i * m) + j].append(((i - 1) * m) + j)\r\n A[((i - 1) * m) + j].append(i * m + j)\r\n for v in range(len(A)):\r\n cycle = bfs(A, v)\r\n if cycle: break\r\n if cycle: print('Yes')\r\n else: print('No')\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "import sys\r\nfrom enum import Enum\r\nfrom collections.abc import Generator, Iterator\r\nfrom functools import wraps\r\n\r\n\r\ndef iterable(func, stack=None):\r\n \"\"\"\r\n Decorator that converts a generator function into a coroutine that supports recursion and maintains its own call\r\n stack.\r\n \"\"\"\r\n # Initialize an empty stack if there is no input one\r\n if stack is None:\r\n stack = []\r\n\r\n @wraps(func)\r\n def convert_to_iterative(*args, **kwargs):\r\n # Check if the call stack is not empty\r\n if stack:\r\n # This is true when next(to) find the recursive function, in that case convert_to_iterative would be called\r\n # again, so we simply return the generator\r\n return func(*args, **kwargs)\r\n else:\r\n # Execute the generator function and initialize the first generator object\r\n to: Generator = func(*args, **kwargs)\r\n # Start the main loop for stack-based recursion\r\n while True:\r\n # Check if 'to' is still a generator\r\n if isinstance(to, Generator):\r\n # Add the generator to the call stack\r\n stack.append(to)\r\n # Advance the generator to the next yield expression, which can either be another generator or a val\r\n # meaning that there are no more recursive functions.\r\n to = next(to)\r\n else:\r\n # The generator has no more values, so remove the last generator from the call stack\r\n stack.pop()\r\n if not stack:\r\n # Break the loop\r\n break\r\n # Todo: here\r\n to = stack[-1].send(to)\r\n return to\r\n return convert_to_iterative\r\n\r\nclass States(Enum):\r\n UNVISITED = -1\r\n EXPLORED = 0\r\n VISITED = 1\r\n\r\n\r\nmoves = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\n\r\n\r\n@iterable\r\ndef dfs(graph, i, j, color, prev_length, status: list[list[States]], prev_i, prev_j) -> Iterator[bool]:\r\n status[i][j] = States.EXPLORED\r\n\r\n for dr, dc in moves:\r\n if i + dr < 0 or i + dr >= len(graph):\r\n continue\r\n if j + dc < 0 or j + dc >= len((graph[0])):\r\n continue\r\n if graph[i + dr][j + dc] != color:\r\n continue\r\n if status[i + dr][j + dc] == States.VISITED:\r\n # No need to consider forwards edges\r\n continue\r\n # Ignore trivial loops\r\n if prev_i == i + dr and prev_j == j + dc:\r\n continue\r\n # We need to check if it is a back edge, which means ancestor -> parent, and parent is still exploring\r\n # and it is not a trivial cycle\r\n if prev_length + 1 >= 4 and status[i + dr][j + dc] == States.EXPLORED:\r\n yield True\r\n # If found stop doing work and just return\r\n val = yield dfs(graph, i + dr, j + dc, color, prev_length + 1, status, i, j)\r\n if val:\r\n yield True\r\n\r\n # We have completly visited the node so now we are done\r\n status[i][j] = States.VISITED\r\n yield False\r\n\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n m, n = (int(i) for i in read().split())\r\n status = [[States.UNVISITED for _ in range(n)] for _ in range(m)]\r\n graph = []\r\n for _ in range(m):\r\n graph.append(read().strip())\r\n for row in range(m):\r\n for col in range(n):\r\n if status[row][col] == States.UNVISITED:\r\n color = graph[row][col]\r\n found = dfs(graph, row, col, color, 0, status, None, None)\r\n if found:\r\n print('Yes')\r\n return\r\n print('No')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m = map(int, input().split())\r\n\r\ncolors = []\r\n\r\nfor i in range(n):\r\n line = input()\r\n colors.append([])\r\n for col in line:\r\n colors[i].append(col)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n x = j + 1\r\n\r\n while x < m and colors[i][j] == colors[i][x]:\r\n y = i + 1\r\n\r\n while y < n and colors[y][x] == colors[i][j]:\r\n is_valid = True\r\n\r\n for k in range(j, x + 1, 1):\r\n if colors[y][k] != colors[i][j]:\r\n is_valid = False\r\n\r\n if is_valid:\r\n print('Yes')\r\n exit()\r\n\r\n y += 1\r\n x += 1\r\n\r\nprint('No')\r\n", "from collections import deque\r\n\r\nn, m = map(int, input().split())\r\ngrid = [input() for _ in range(n)]\r\nvisited = [[False] * m for _ in range(n)]\r\ndirs = [(0, 1), (0, -1), (1, 0), (-1, 0)]\r\n\r\n\r\ndef bfs(start_x, start_y):\r\n q = deque([(start_x, start_y, None)])\r\n while q:\r\n x, y, parent = q.popleft()\r\n if visited[x][y]:\r\n return True\r\n visited[x][y] = True\r\n for dx, dy in dirs:\r\n nx, ny = x + dx, y + dy\r\n if 0 <= nx < n and 0 <= ny < m and (nx, ny) != parent and grid[x][y] == grid[nx][ny]:\r\n q.append((nx, ny, (x, y)))\r\n return False\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if not visited[i][j]:\r\n if bfs(i, j):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n", "import sys, threading\r\n\r\ndef main():\r\n\r\n n, m = map(int, input().split())\r\n\r\n grid = []\r\n\r\n for _ in range(n):\r\n grid.append(list(input()))\r\n\r\n \r\n direct = [(-1, 0), (0, -1), (1, 0), (0, 1)]\r\n\r\n def in_bound(row, col):\r\n return 0<= row < n and 0 <= col < m\r\n\r\n total_visited = set()\r\n\r\n ans = False\r\n\r\n def dfs(node, visited, depth):\r\n nonlocal ans\r\n \r\n row, col = node\r\n \r\n for dirc in direct:\r\n new_row, new_col = row + dirc[0], col + dirc[-1]\r\n \r\n if not in_bound(new_row, new_col):\r\n continue\r\n \r\n if (new_row, new_col) in visited and depth + 1 - visited[(new_row,new_col)] >= 4 and grid[new_row][new_col] == grid[row][col]:\r\n ans = True\r\n \r\n if (new_row, new_col) not in total_visited and (new_row, new_col) not in visited and grid[new_row][new_col] == grid[row][col]:\r\n \r\n visited[(new_row, new_col)] = depth + 1\r\n dfs((new_row, new_col), visited, depth + 1)\r\n \r\n return visited\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if (i, j) not in total_visited:\r\n total_visited = total_visited.union(set(dfs((i,j), {(i, j): 1}, 1).keys()))\r\n \r\n if ans:\r\n print(\"Yes\")\r\n exit()\r\n \r\n print(\"No\")\r\n\r\nsys.setrecursionlimit(1 << 30)\r\nthreading.stack_size(1 << 27)\r\n\r\nmain_thread = threading.Thread(target = main)\r\nmain_thread.start()\r\nmain_thread.join()", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,M = map(int, input().split())\r\nS = []\r\nfor _ in range(N):\r\n S.append(input())\r\n\r\nseen = [[0]*M for _ in range(N)]\r\n\r\ndirs = [(1,0),(-1,0),(0,1),(0,-1)]\r\ndef check(i,j,c):\r\n v = [(i,j,-1,-1)]\r\n while v:\r\n x,y,px,py = v.pop()\r\n seen[x][y] = 1\r\n \r\n for x1,y1 in dirs:\r\n nx = x+x1\r\n ny = y+y1\r\n if nx<0 or nx>=N:continue\r\n if ny<0 or ny>=M:continue\r\n if (nx,ny)==(px,py):continue\r\n if S[nx][ny]!=c:continue\r\n if seen[nx][ny]:return True\r\n v.append((nx,ny,x,y))\r\n\r\n return False\r\n\r\nfor i in range(N):\r\n for j in range(M):\r\n if seen[i][j]==0:\r\n if check(i,j,S[i][j]):\r\n exit(print('Yes'))\r\n \r\n \r\nprint('No')\r\n\r\n\r\n\r\n", "def dfs_verif(g,start):\r\n parent=[-1]*len(g)\r\n queue=[]\r\n queue.append(start)\r\n seen[start]=True\r\n while len(queue):\r\n node = queue.pop()\r\n for adj in g[node]:\r\n if not seen[adj]:\r\n parent[adj]=node\r\n seen[adj]=True\r\n queue.append(adj)\r\n elif parent[node]!=adj:\r\n return True\r\n return False\r\nn,m=[int(e) for e in input().split()]\r\nmatrix=[]\r\ngraph=[[] for _ in range(n*m)]\r\nseen=[False]*len(graph)\r\nfor i in range(n):\r\n line=[char for char in input()]\r\n matrix.append(line)\r\nfor i in range(n):\r\n for j in range(m):\r\n if i!=0 and matrix[i][j]==matrix[i-1][j]:\r\n graph[j+m*i].append(j+m*(i-1))\r\n if i!=n-1 and matrix[i][j]==matrix[i+1][j]:\r\n graph[j+m*i].append(j+m*(i+1))\r\n if j!=0 and matrix[i][j]==matrix[i][j-1]:\r\n graph[j+m*i].append((j-1)+m*i)\r\n if j!=m-1 and matrix[i][j]==matrix[i][j+1]:\r\n graph[j+m*i].append((j+1)+m*i)\r\ntest=False\r\nfor i in range(len(seen)):\r\n if not seen[i] :\r\n test=dfs_verif(graph,i)\r\n if test==True:\r\n break\r\nif test :print(\"Yes\")\r\nelse:print(\"No\")\r\n\r\n", "def dfs(x,y,x1,y1):\r\n \tv.add((x,y))\r\n \tfor dx,dy in [(-1,0),(0,1),(1,0),(0,-1)]:\r\n \t\tif x+dx>=0 and x+dx<n and y+dy>=0 and y+dy<m and (x+dx,y+dy)!=(x1,y1) and a[x+dx][y+dy]==a[x][y]:\r\n \t\t\tif (x+dx,y+dy) in v or dfs(x+dx,y+dy,x,y):\r\n \t\t\t\treturn True\r\n \treturn False\r\n \r\nimport sys\r\nsys.setrecursionlimit(10000)\r\nn,m=map(int,input().split())\r\na=[input() for i in range(n)]\r\nv=set()\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif not (i,j) in v and dfs(i,j,-1,-1):\r\n\t\t\tprint('Yes')\r\n\t\t\tquit()\r\nprint('No')", "n, m = list(map(int, input().split()))\nmp = [[\"\"] * m for _ in range(n)]\nfor i in range(n):\n s = input()\n for j in range(m):\n mp[i][j] = s[j]\n\nvis = [[0] * m for _ in range(n)]\ndx = [0, -1, 1, 0]\ndy = [1, 0, 0, -1]\nf = 0\ndef check(x: int, y: int) -> int:\n if 0 <= x < n and 0 <= y < m:\n return 1\n return 0\n\ndef dfs(x: int, y: int, qx: int, qy: int) -> None:\n vis[x][y] = 1\n for i in range(4):\n tx = x + dx[i]\n ty = y + dy[i]\n if check(tx, ty) == 1 and (tx != qx or ty != qy) and mp[tx][ty] == mp[x][y]:\n if vis[tx][ty] == 1:\n global f\n f = 1\n return\n dfs(tx, ty, x, y)\n return\n\nfor i in range(n):\n for j in range(m):\n if vis[i][j] == 0:\n dfs(i, j, -1, -1)\n if f == 1:\n break\n if f == 1:\n break\nif f == 1:\n print(\"Yes\")\nelse:\n print(\"No\")\n\n \t\t \t \t\t \t \t\t\t\t\t \t\t\t \t\t\t\t", "import sys\nsys.setrecursionlimit(10**5)\nfrom collections import deque\n\ndef achaCiclo(i, j, pre):\n cor[i][j] = 1\n for v in g[i][j]:\n if v == pre:\n continue\n if cor[v[0]][v[1]] == 0:\n achaCiclo(v[0], v[1], (i, j))\n if cor[v[0]][v[1]] in [1, 3]:\n cor[i][j] = 3\n if cor[i][j] == 1:\n cor[i][j] = 2\n\nn, m = map(int, input().split())\ncor = [[0] * m for _ in range(n)]\ngrid = [list(input().strip()) for _ in range(n)]\ng = [[[] for _ in range(m)] for _ in range(n)]\n\nfor i in range(n):\n for j in range(m):\n if i and grid[i][j] == grid[i - 1][j]:\n g[i][j].append((i - 1, j))\n if j and grid[i][j] == grid[i][j - 1]:\n g[i][j].append((i, j - 1))\n if i < n - 1 and grid[i][j] == grid[i + 1][j]:\n g[i][j].append((i + 1, j))\n if j < m - 1 and grid[i][j] == grid[i][j + 1]:\n g[i][j].append((i, j + 1))\n\nciclo = \"No\"\nfor i in range(n):\n for j in range(m):\n if cor[i][j] == 0:\n achaCiclo(i, j, (-1, -1))\n if cor[i][j] == 3:\n ciclo = \"Yes\"\nprint(ciclo)\n\n\t \t\t\t\t\t \t \t \t \t \t\t\t\t", "def MazeBFS(pi,pj,seen):\r\n queue = [(pi,pj)]\r\n while queue:\r\n node = queue.pop(0)\r\n for k in range(4):\r\n neigh = (node[0]+di[k],node[1]+dj[k])\r\n if neigh[0] < 0 or neigh[0] >= n or neigh[1] < 0 or neigh[1] >= m:\r\n continue\r\n if M[neigh[0]][neigh[1]] == M[pi][pj] and neigh not in seen:\r\n seen.append(neigh)\r\n queue.append(neigh)\r\n parent[neigh] = node\r\n elif M[neigh[0]][neigh[1]] == M[pi][pj] and neigh in seen and neigh != parent[node]:\r\n return True\r\n return False\r\n\r\ndi = [-1,0,1,0]\r\ndj = [0,1,0,-1]\r\nn, m = map(int, input().split())\r\nM = []\r\nfor i in range(n):\r\n l = list(input())\r\n M.append(l)\r\nseen = []\r\nparent = {}\r\nfor i in range(n):\r\n for j in range(m):\r\n if (i,j) not in seen:\r\n seen.append((i,j))\r\n parent[(i,j)] = -1\r\n if MazeBFS(i,j,seen):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n", "from math import ceil\nfrom collections import defaultdict, deque\n\nn, m = (int(i) for i in input().split())\ngrid = []\nfor i in range(n):\n grid.append(list(input()))\n\ndef solve(grid, n, m):\n edges = []\n for i in range(n):\n for j in range(m):\n if i > 0 and grid[i][j] == grid[i - 1][j]:\n edges.append(((i, j), (i - 1, j)))\n if j > 0 and grid[i][j] == grid[i][j - 1]:\n edges.append(((i, j), (i, j - 1)))\n\n adj = [[[] for j in range(m)] for i in range(n)]\n for ((i, j), (k, l)) in edges:\n adj[i][j].append((k, l))\n adj[k][l].append((i, j))\n\n visited = [[False for j in range(m)] for i in range(n)]\n def detect_cycle(si, sj, visited):\n parent = [[None for j in range(m)] for i in range(n)]\n Q = deque([(si, sj)])\n visited[si][sj] = True\n while Q:\n i, j = Q.popleft()\n # print(i, j)\n for k, l in set(adj[i][j]):\n if not visited[k][l]:\n visited[k][l] = True\n parent[k][l] = (i, j)\n Q.append((k, l))\n elif parent[i][j] != (k, l):\n # print(i, j, k, l)\n return True\n return False\n\n for i in range(n):\n for j in range(m):\n if not visited[i][j] and detect_cycle(i, j, visited):\n return True\n return False\n\nif solve(grid, n, m):\n print(\"Yes\")\nelse:\n print(\"No\")\n\n", "def canMove(i,j):\r\n return i >= 0 and i < n and j >= 0 and j < m\r\n\r\ndi = [-1, 0, 1, 0]\r\ndj = [0, 1, 0, -1]\r\n\r\ndef bfs(starti, startj, maze):\r\n seen[starti][startj] = True\r\n to_visit = [(starti,startj)]\r\n while to_visit:\r\n posi, posj = to_visit.pop(0)\r\n\r\n for k in range(4):\r\n neighi = posi + di[k]\r\n neighj = posj + dj[k]\r\n\r\n if canMove(neighi, neighj) and maze[neighi][neighj] == maze[posi][posj]:\r\n if not seen[neighi][neighj]:\r\n seen[neighi][neighj] = True\r\n to_visit.append((neighi, neighj))\r\n parent[neighi][neighj] = (posi, posj)\r\n elif (neighi, neighj) != parent[posi][posj]:\r\n return True\r\n\r\n return False\r\n\r\n\r\nmaze = []\r\n\r\nn,m = [int(e) for e in input().split()]\r\n\r\n\r\nfor i in range(n):\r\n maze.append(list(input()))\r\n\r\nseen = [[False for _ in range(m)] for _ in range(n)]\r\nparent = [[(-1, -1) for _ in range(m)] for _ in range(n)]\r\n\r\ndef isCycle(maze, parent):\r\n for i in range(n):\r\n for j in range(m):\r\n if not seen[i][j]:\r\n if bfs(i, j, maze):\r\n return True\r\n \r\n return False\r\n \r\n\r\nif isCycle(maze, parent):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import sys; input = sys.stdin.readline\r\nsys.setrecursionlimit(2500)\r\n\r\ndir = [(-1, 0), (1, 0), (0, -1), (0, 1)]\r\n\r\ndef dfs(i, j, pi, pj, c):\r\n visited[i][j] = True\r\n result = 0\r\n for di, dj in dir:\r\n if 0 <= i + di < n and 0 <= j + dj < m and not (i + di == pi and j + dj == pj) and board[i + di][j + dj] == c:\r\n if visited[i + di][j + dj] or dfs(i + di, j + dj, i, j, c):\r\n return True\r\n return False\r\n\r\nn, m = map(int, input().split())\r\nboard = [input().strip() for _ in range(n)]\r\n\r\nvisited = [[False] * m for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if visited[i][j]:\r\n continue\r\n if dfs(i, j, -1, -1, board[i][j]):\r\n print('Yes')\r\n exit()\r\nprint('No')", "n, m = map(int, input().split())\r\nM = []\r\nfor i in range(n):\r\n row=[]\r\n l = input()\r\n for j in l:\r\n row.append(j)\r\n M.append(row)\r\n\r\nvisited = [[False] * m for _ in range(n)]\r\ndi=[-1,0,1,0] \r\ndj=[0,1,0,-1]\r\n\r\ndef dfs(pi, pj, prev_x, prev_y, visited):\r\n visited[pi][pj] = True\r\n for k in range(4):\r\n neighi=pi+di[k]\r\n neighj=pj+dj[k]\r\n if neighi < 0 or neighi >= n or neighj < 0 or neighj >= m:\r\n continue\r\n if (neighi, neighj) == (prev_x, prev_y):\r\n continue\r\n if M[neighi][neighj] != M[pi][pj]:\r\n continue\r\n if visited[neighi][neighj]:\r\n return True\r\n if dfs(neighi, neighj, pi, pj, visited):\r\n return True\r\n return False\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if not visited[i][j] and dfs(i, j, None, None, visited):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"No\")\r\n", "from heapq import heapify,heappop,heappush\r\nfrom queue import deque\r\n\r\ndef I(): return int(input())\r\ndef ST(): return input()\r\ndef IL(): return list(map(int, input().split()))\r\ndef ILS(): return sorted(map(int, input().split()))\r\n\r\nn,m = IL()\r\nnums = []\r\nfor _ in range(n):\r\n nums.append(ST())\r\n\r\ndir = [(1,0),(0,1),(-1,0),(0,-1)] \r\ndef inbound(row,col):\r\n return 0<=row<n and 0<=col<m\r\n\r\nseen = set()\r\ndef dfs(row,col,syb,pr,pc):\r\n \r\n seen.add((row,col))\r\n for x,y in dir:\r\n x,y = row+x,col+y\r\n if inbound(x,y) and nums[x][y] == syb:\r\n if (x,y) in seen and pr != -1 and (x,y) != (pr,pc):\r\n print(\"Yes\")\r\n exit()\r\n elif (x,y) not in seen:\r\n dfs(x,y,syb,row,col)\r\n \r\nfor row in range(n):\r\n for col in range(m):\r\n syb = nums[row][col]\r\n if (row,col) not in seen:\r\n dfs(row,col,syb,-1,-1) \r\n \r\nprint(\"No\")", "def has_cycle_with_same_color_adjacent(graph):\r\n rows = len(graph)\r\n cols = len(graph[0])\r\n visited = set()\r\n\r\n def dfs(row, col, parent, color, length):\r\n nonlocal visited\r\n\r\n if length >= 4 and (row, col) == parent:\r\n return True\r\n\r\n visited.add((row, col))\r\n length += 1\r\n\r\n for dr, dc in [(0, 1), (1, 0), (0, -1), (-1, 0)]:\r\n new_row, new_col = row + dr, col + dc\r\n\r\n if (new_row, new_col) == parent:\r\n continue\r\n\r\n if 0 <= new_row < rows and 0 <= new_col < cols and graph[new_row][new_col] == color:\r\n if (new_row, new_col) in visited or dfs(new_row, new_col, (row, col), color, length):\r\n return True\r\n\r\n visited.remove((row, col))\r\n return False\r\n\r\n for row in range(rows):\r\n for col in range(cols):\r\n if (row, col) not in visited:\r\n color = graph[row][col]\r\n if dfs(row, col, None, color, 0):\r\n return True\r\n\r\n return False\r\nn,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(input()))\r\nx=(has_cycle_with_same_color_adjacent(l))\r\nif x:\r\n print('Yes')\r\nelse:\r\n print(\"No\")", "import sys\nsys.setrecursionlimit(10**5)\n\nmx = [1,-1,0,0]\nmy = [0,0,1,-1]\ndef can(x,y):\n if x < 0 or y < 0 or x > n-1 or y > m-1:\n return False\n return True\n\nn, m = map(int, input().split())\nboard = [['' for j in range(m)] for i in range(n)]\nestado = [['ToDo' for j in range(m)] for i in range(n)]\n\nfor i in range(n):\n string = input()\n for j in range(m):\n board[i][j] = string[j]\n\n\ndef dfs(i,j, pai):\n estado[i][j] = 'Doing'\n for k in range(4):\n newi = i + mx[k]\n newj = j + my[k]\n if can(newi, newj) and board[newi][newj] == board[i][j]:\n if (newi, newj) == pai: continue\n if estado[newi][newj] == 'ToDo':\n dfs(newi,newj,(i,j))\n if estado[newi][newj] == 'Doing' or estado[newi][newj] == 'Ciclo':\n estado[i][j] = 'Ciclo'\n if estado[i][j] == 'Doing':\n estado[i][j] = 'Done'\n\nciclo = 'No'\nfor i in range(n):\n for j in range(m):\n if estado[i][j] == 'ToDo':\n pai = (i,j)\n dfs(i,j, pai)\n if estado[i][j] == 'Ciclo':\n ciclo = 'Yes'\n\nprint(ciclo)\n \t \t \t\t \t\t \t\t \t\t\t\t \t\t\t \t\t \t", "n,m = [int(x) for x in input().split()]\r\ngrid = []\r\nfor x in range(n):\r\n temp = list(input())\r\n grid.append(temp)\r\ncount = 0\r\nfor x in range(n):\r\n for y in range(m):\r\n l = grid[x][y]\r\n grid[x][y] = (count, l)\r\n count += 1\r\nadj = [[] for x in range(n*m)]\r\nfor x in range(n):\r\n for y in range(m):\r\n #right\r\n if x+1 < n and grid[x][y][1] == grid[x+1][y][1]:\r\n adj[grid[x][y][0]].append(grid[x+1][y][0])\r\n adj[grid[x+1][y][0]].append(grid[x][y][0])\r\n if y+1 < m and grid[x][y][1] == grid[x][y+1][1]:\r\n adj[grid[x][y][0]].append(grid[x][y+1][0])\r\n adj[grid[x][y+1][0]].append(grid[x][y][0])\r\nfor x in range(n*m):\r\n queue = []\r\n for z in adj[x]:\r\n queue.append((z, 0, x))\r\n visited = [False for y in range(n*m)]\r\n visited[x] = True\r\n for a,b,c in queue:\r\n for y in adj[a]:\r\n if visited[y] and y != c:\r\n print(\"Yes\")\r\n exit()\r\n if not visited[y]:\r\n queue.append((y,b+1, a))\r\n visited[a] = True\r\nprint(\"No\")", "import sys\n\nsys.setrecursionlimit(10 ** 5)\n\n\ndef ciclo(i, j, pre):\n cor[i][j] = 1\n for v in g[i][j]:\n if v == pre:\n continue\n if cor[v[0]][v[1]] == 0:\n ciclo(v[0], v[1], (i, j))\n if cor[v[0]][v[1]] in [1, 3]:\n cor[i][j] = 3\n\n if cor[i][j] == 1:\n cor[i][j] = 2\n\n\nn, m = map(int, input().split())\ncor = [[0] * m for _ in range(n)]\ngrid = [list(input()) for _ in range(n)]\ng = [[[] for _ in range(m)] for _ in range(n)]\n\nfor i in range(n):\n for j in range(m):\n if i and grid[i][j] == grid[i - 1][j]:\n g[i][j].append((i - 1, j))\n if j and grid[i][j] == grid[i][j - 1]:\n g[i][j].append((i, j - 1))\n if i < n - 1 and grid[i][j] == grid[i + 1][j]:\n g[i][j].append((i + 1, j))\n if j < m - 1 and grid[i][j] == grid[i][j + 1]:\n g[i][j].append((i, j + 1))\n\nciclos = 'No'\nfor k in range(n):\n for l in range(m):\n if cor[k][l] == 0:\n ciclo(k, l, (-1, -1))\n if cor[k][l] == 3:\n ciclos = 'Yes'\n\nprint(ciclos)\n\n\t\t\t\t\t\t \t \t \t\t\t\t\t \t\t \t\t\t\t\t\t", "def depth_first_search(start_x, start_y, prev_x, prev_y):\r\n visited.add((start_x, start_y))\r\n for dx, dy in [(-1, 0), (0, 1), (1, 0), (0, -1)]:\r\n if start_x + dx >= 0 and start_x + dx < rows and start_y + dy >= 0 and start_y + dy < columns and (start_x + dx, start_y + dy) != (prev_x, prev_y) and grid[start_x + dx][start_y + dy] == grid[start_x][start_y]:\r\n if (start_x + dx, start_y + dy) in visited or depth_first_search(start_x + dx, start_y + dy, start_x, start_y):\r\n return True\r\n return False\r\n\r\nimport sys\r\nsys.setrecursionlimit(10000)\r\nrows, columns = map(int, input().split())\r\ngrid = [input() for _ in range(rows)]\r\nvisited = set()\r\nfor i in range(rows):\r\n for j in range(columns):\r\n if (i, j) not in visited and depth_first_search(i, j, -1, -1):\r\n print('Yes')\r\n quit()\r\nprint('No')\r\n", "def exists_a_cycle_on_the_field(n, m, colors):\r\n graph = [[] for i in range(n*m)]\r\n for i in range(n):\r\n for j in range(m):\r\n u = i * m + j\r\n u_color = colors[i][j]\r\n \r\n if i+1 < n and u_color == colors[i+1][j]:\r\n v = (i+1) * m + j\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n \r\n if j+1 < m and u_color == colors[i][j+1]:\r\n w = i * m + j + 1\r\n graph[u].append(w)\r\n graph[w].append(u)\r\n \r\n def isCyclicUtil(v, visited, parent):\r\n visited[v] = True\r\n for i in graph[v]:\r\n if visited[i] == False:\r\n if isCyclicUtil(i, visited, v):\r\n return True\r\n elif parent != i:\r\n return True\r\n return False\r\n \r\n def isCyclic(size):\r\n visited = [False] * size\r\n for i in range(size):\r\n if visited[i] == False:\r\n if isCyclicUtil(i, visited, -1) == True:\r\n return True\r\n \r\n return False\r\n size = n*m\r\n if isCyclic(size) == True:\r\n return 'Yes'\r\n return 'No'\r\n \r\nn,m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\nprint(exists_a_cycle_on_the_field(n, m, a))", "import sys\r\nsys.setrecursionlimit(10**6)\r\n\r\ndef dfs(y, x, caractere):\r\n global ladj, visited, altura, largura\r\n if y < 0 or x < 0 or y >= altura or x >= largura:\r\n return False\r\n \r\n if ladj[y][x] != caractere:\r\n return False\r\n\r\n if visited[y][x] == 1:\r\n return False\r\n if visited[y][x] == 2:\r\n return True\r\n \r\n visited[y][x] = 1\r\n if dfs(y + 1, x, caractere) or dfs(y - 1, x, caractere) or dfs(y, x + 1, caractere) or dfs(y, x - 1, caractere):\r\n return True\r\n visited[y][x] = 2\r\n \r\naltura, largura = map(int, input().split())\r\n\r\nladj = []\r\nvisited = []\r\nfor i in range(altura):\r\n ladj.append(list(input()))\r\n visited.append([0] * largura)\r\n\r\nfor i in range(altura):\r\n for j in range(largura):\r\n if visited[i][j] == 0:\r\n if dfs(i, j, ladj[i][j]):\r\n print('Yes')\r\n exit()\r\n\r\nprint('No')", "def canMove(i,j):\r\n return i>=0 and i<n and j>=0 and j<m\r\ndef dfsMaze(i,j,pi,pj):\r\n visited[i][j]=True\r\n for k in range (4):\r\n neighi=i+di[k]\r\n neighj=j+dj[k]\r\n if canMove(neighi,neighj) and graph[i][j]==graph[neighi][neighj] :#do not continue if you can't move to the next neighbor or if the next neighbor is not the same color as the current neighbor\r\n if visited[neighi][neighj] and (neighj!=pj or neighi!=pi):#if the neighbor is visited and is not the neighbor the current node is coming from then there is a cycle\r\n return True\r\n elif not visited[neighi][neighj] and dfsMaze(neighi,neighj,i,j):#if the neighbor is not visited but its dfs cycle detection is true then there is a cycle\r\n return True\r\n return False\r\ndef detectcycle():\r\n for i in range(n):\r\n for j in range(m):\r\n if (not visited[i][j]):\r\n if (dfsMaze(i,j,-1,-1)):\r\n return True\r\n return False\r\ndi=[-1,0,1,0]\r\ndj=[0,1,0,-1]\r\nn,m=map(int,input().split())\r\nvisited= [[False for _ in range(m)] for _ in range(n)]\r\ngraph=[]\r\nfor i in range(n):\r\n graph.append(input())\r\nif detectcycle():\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import sys \r\nsys.setrecursionlimit(1000000)\r\ndef search(i,j,pi = -1,pj = -1):\r\n game[i][j] = True\r\n di = [-1,1,0,0]\r\n dj = [0,0,-1,1]\r\n for k in range(4):\r\n ni = i + di[k]\r\n nj = j + dj[k]\r\n if (0<=ni<n and 0<=nj<m) and (ni != pi or nj != pj) and dot[i][j] == dot[ni][nj]:\r\n if game[ni][nj]:\r\n print('Yes')\r\n exit()\r\n else:\r\n search(ni,nj,i,j)\r\nn,m = [int(i) for i in input().split()]\r\ndot= []\r\ngame = [[False]*m for i in range(n)]\r\nfor i in range(n):\r\n dot.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if not game[i][j]:\r\n search(i,j)\r\nprint('No')", "n, m = map(int, input().split())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(list(input()))\r\n# print(matrix)\r\ndirections = [(0,-1), (-1,0), (0,1), (1,0)]\r\ncolor = [[0]*m for _ in range(n)]\r\n\r\ndef is_valid(x,y):\r\n return 0 <= x < n and 0 <= y < m\r\n\r\ndef dfs(i,j,r,c, val):\r\n if matrix[i][j] != val:\r\n return False\r\n if color[i][j] == 1:\r\n return True\r\n \r\n color[i][j] = 1\r\n for x, y in directions:\r\n nx, ny = x + i, y + j\r\n if is_valid(nx, ny) and (nx, ny)!= (r,c):\r\n if dfs(nx, ny,i,j, val):\r\n return True\r\n return False\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if color[i][j] == 0:\r\n if dfs(i,j,-1,-1,matrix[i][j]):\r\n print(\"Yes\")\r\n exit()\r\nprint(\"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", "n, m = map(int, input().split(' '))\ns = [list(input()+'.') for i in range(n)] \ns += [list('.' * (m + 1))]\n\ndef solve():\n flag = False\n for i in range(n):\n for j in range(m):\n if s[i][j] != '.':\n d = 0\n d += (s[i + 1][j] == s[i][j])\n d += (s[i - 1][j] == s[i][j])\n d += (s[i][j + 1] == s[i][j])\n d += (s[i][j - 1] == s[i][j])\n if d < 2:\n s[i][j] = '.'\n flag = True\n return flag\n\nfor _ in range(500):\n if not solve():\n break\n\nfor i in range(n):\n for j in range(m):\n if s[i][j] != '.':\n print('Yes')\n exit()\n\nprint('No')\n\n \t \t \t \t \t\t \t \t \t \t", "import sys \r\nsys.setrecursionlimit(1000000) #for solving Runtime error\r\ndef cycle_in_maze(i,j,pi = -1,pj = -1):\r\n seen[i][j] = True\r\n di = [-1,1,0,0]\r\n dj = [0,0,-1,1]\r\n for k in range(4):\r\n ni = i + di[k]\r\n nj = j + dj[k]\r\n if (0<=ni<n and 0<=nj<m) and (ni != pi or nj != pj) and dot[i][j] == dot[ni][nj]:\r\n if seen[ni][nj]:\r\n print('Yes')\r\n sys.exit(0)\r\n else:\r\n cycle_in_maze(ni,nj,i,j)\r\nn,m = [int(i) for i in input().split()]\r\ndot= []\r\nseen = [[False]*m for i in range(n)]\r\nfor i in range(n):\r\n dot.append(input())\r\nfor i in range(n):\r\n for j in range(m):\r\n if not seen[i][j]:\r\n cycle_in_maze(i,j)\r\nprint('No')\r\n" ]

[ "x,y,z = list(map(int,input().strip().split()))\r\n\r\nxb,yb,zb = list(map(int,input().strip().split()))\r\n\r\nlabels = list(map(int,input().strip().split()))\r\n\r\nsm = 0\r\n\r\nsm += labels[0] * (y < 0) + labels[1] * (y > yb)\r\nsm += labels[2] * (z < 0) + labels[3] * (z > zb)\r\nsm += labels[4] * (x < 0) + labels[5] * (x > xb)\r\n\r\nprint(sm)", "x, y, z = [int(x) for x in input().split()]\r\nbx, by, bz = [int(x) for x in input().split()]\r\nnums = [int(x) for x in input().split()]\r\nsoma = 0\r\nif y < 0:\r\n soma += nums[0]\r\nif y > by:\r\n soma += nums[1]\r\nif z < 0:\r\n soma += nums[2]\r\nif z > bz:\r\n soma += nums[3]\r\nif x < 0:\r\n soma += nums[4]\r\nif x > bx:\r\n soma += nums[5]\r\nprint(soma)" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nG = [set() for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n G[u].add(v)\r\n G[v].add(u)\r\nq = []\r\nx = [set() for _ in range(n + 1)]\r\ncnt = [len(g) for g in G]\r\nfor i in range(1, n + 1):\r\n if cnt[i] == 1:\r\n q.append(i)\r\n x[i].add(0)\r\nk = 0\r\nans = n - 1\r\nwhile len(q) ^ k and k < n - 1:\r\n i = q[k]\r\n u = x[i].pop()\r\n j = G[i].pop()\r\n G[j].remove(i)\r\n if u + 1 in x[j] or not len(x[j]):\r\n cnt[j] -= 1\r\n if u + 1 in x[j]:\r\n ans -= u + 1\r\n x[j].add(u + 1)\r\n if len(x[j]) == 1 and cnt[j] == 1:\r\n q.append(j)\r\n k += 1\r\nc = 0\r\nfor y in x:\r\n if len(y) >= 3:\r\n ans = -1\r\n elif len(y):\r\n c += 1\r\nif c ^ 1:\r\n ans = -1\r\nwhile not ans % 2:\r\n ans //= 2\r\nprint(ans)" ]

[ "import sys\r\n#input=sys.stdin.readline\r\ndp={}\r\nmod=int(1000000007)\r\nsys.setrecursionlimit(100000)\r\ndef bigmod(n,p):\r\n p=int(p)\r\n if p==0:\r\n return 1\r\n x=bigmod(n,p/2)\r\n x=(x*x)%mod\r\n if p%2==1:\r\n x=(x*n)%mod\r\n return x\r\nk,pa,pb=map(int,input().split())\r\nr=bigmod(pa+pb,mod-2)\r\nr1=bigmod(pb,mod-2)\r\nr1=(pa*r1)%mod\r\np=(pa*r)%mod\r\nq=(pb*r)%mod\r\n\r\n\r\n\r\ndef cal(k1,a1):\r\n if k1+a1>=k:\r\n return (k1+a1+r1)%mod\r\n if (k1,a1) in dp:\r\n return dp[(k1,a1)]\r\n dp[(k1,a1)]=((cal(k1+a1,a1)*q)%mod+(cal(k1,a1+1)*p)%mod)%mod\r\n return dp[(k1,a1)]\r\n\r\nprint(cal(0,1))\r\n\r\n", "import math\r\n\r\ndef Extended_Euclid(n,m):\r\n stack=[]\r\n while m:\r\n stack.append((n,m))\r\n n,m=m,n%m\r\n if n>=0:\r\n x,y=1,0\r\n else:\r\n x,y=-1,0\r\n for i in range(len(stack)-1,-1,-1):\r\n n,m=stack[i]\r\n x,y=y,x-(n//m)*y\r\n return x,y\r\n\r\nclass MOD:\r\n def __init__(self,p,e=1):\r\n self.p=p\r\n self.e=e\r\n self.mod=self.p**self.e\r\n\r\n def Pow(self,a,n):\r\n a%=self.mod\r\n if n>=0:\r\n return pow(a,n,self.mod)\r\n else:\r\n assert math.gcd(a,self.mod)==1\r\n x=Extended_Euclid(a,self.mod)[0]\r\n return pow(x,-n,self.mod)\r\n\r\n def Build_Fact(self,N):\r\n assert N>=0\r\n self.factorial=[1]\r\n self.cnt=[0]*(N+1)\r\n for i in range(1,N+1):\r\n ii=i\r\n self.cnt[i]=self.cnt[i-1]\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.cnt[i]+=1\r\n self.factorial.append((self.factorial[-1]*ii)%self.mod)\r\n self.factorial_inve=[None]*(N+1)\r\n self.factorial_inve[-1]=self.Pow(self.factorial[-1],-1)\r\n for i in range(N-1,-1,-1):\r\n ii=i+1\r\n while ii%self.p==0:\r\n ii//=self.p\r\n self.factorial_inve[i]=(self.factorial_inve[i+1]*ii)%self.mod\r\n\r\n def Fact(self,N):\r\n if N<0:\r\n return 0\r\n return self.factorial[N]*pow(self.p,self.cnt[N],self.mod)%self.mod\r\n\r\n def Fact_Inve(self,N):\r\n if self.cnt[N]:\r\n return None\r\n return self.factorial_inve[N]\r\n\r\n def Comb(self,N,K,divisible_count=False):\r\n if K<0 or K>N:\r\n return 0\r\n retu=self.factorial[N]*self.factorial_inve[K]*self.factorial_inve[N-K]%self.mod\r\n cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K]\r\n if divisible_count:\r\n return retu,cnt\r\n else:\r\n retu*=pow(self.p,cnt,self.mod)\r\n retu%=self.mod\r\n return retu\r\n\r\nK,Pa,Pb=map(int,input().split())\r\ndp=[[0]*K for i in range(K+1)]\r\nmod=10**9+7\r\nMD=MOD(mod)\r\nPa,Pb=Pa*MD.Pow(Pa+Pb,-1)%mod,Pb*MD.Pow(Pa+Pb,-1)%mod\r\ndp[1][0]=1\r\nans=0\r\nfor i in range(K):\r\n for j in range(K):\r\n dp[i+1][j]+=dp[i][j]*Pa\r\n dp[i+1][j]%=mod\r\n if i+j<K:\r\n dp[i][i+j]+=dp[i][j]*Pb\r\n dp[i][i+j]%=mod\r\n else:\r\n ans+=dp[i][j]*Pb*(i+j)\r\n ans%=mod\r\nfor j in range(K):\r\n ans+=dp[K][j]*(K+j+Pa*(MD.Pow(1-Pa,-1)))\r\n ans%=mod\r\nprint(ans)", "from collections import defaultdict as dd\r\nfrom collections import deque\r\nimport bisect\r\nimport heapq\r\n\r\ndef ri():\r\n return int(input())\r\n\r\ndef rl():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n k, a, b = rl()\r\n mod = 10**9 + 7 \r\n denom = pow(a + b, mod - 2, mod)\r\n pa = (a * denom) % mod\r\n pb = (b * denom) % mod\r\n denom2 = pow((1 - pa) % mod, mod - 2, mod)\r\n \r\n # First thought - push forward dp.\r\n # dp[a][ab] = probability of getting to a state with a-many \"a\"\r\n # and ab-many \"ab\".\r\n # Details:\r\n # 1) We don't care about initial bbb..., because that doesn't change \r\n # the value we care about - # of \"ab\"s. So, our start state is \"a\".\r\n # 2) Each state pushes forward to 2 other states. They either have an\r\n # increased \"a\" or \"ab\" (or both), so, we have a DAG order to go in.\r\n # 3) We know ab <= 1000, but, a is in principle unbounded. This is\r\n # annoying, as we need exact answer (i.e. cannot prune).\r\n # This just means that there are two ways to add to EV. Either\r\n # - ab >= k : EV += ab * prob\r\n # - a >= k : Use geometric sum (i.e. we can only see one more b, and\r\n # we know what happens when we do).\r\n\r\n N = k + 1\r\n dp = [] \r\n for i in range(N):\r\n dp.append([0] * N)\r\n\r\n dp[1][0] = 1\r\n ans = 0\r\n for a in range(1, k + 1):\r\n for ab in range(k):\r\n p = dp[a][ab]\r\n if p == 0: continue\r\n # special case: a == k\r\n if a == k:\r\n term1 = (ab + k) % mod\r\n term1 = (term1 * denom2) % mod\r\n term2 = (pa * denom2 * denom2) % mod\r\n contrib = (p * pb * (term1 + term2)) % mod\r\n ans = (ans + contrib) % mod\r\n continue\r\n\r\n # if next thing is a\r\n new_p = (p * pa) % mod\r\n new_a = a + 1\r\n dp[new_a][ab] = (dp[new_a][ab] + new_p)\r\n \r\n # if new thing is b\r\n new_p = (p * pb) % mod\r\n new_ab = ab + a\r\n if new_ab >= k:\r\n ans = (ans + new_ab * new_p) % mod\r\n else:\r\n dp[a][new_ab] = (dp[a][new_ab] + new_p) % mod\r\n\r\n\r\n print (ans)\r\n\r\nmode = 's'\r\n\r\nif mode == 'T':\r\n t = ri()\r\n for i in range(t):\r\n solve()\r\nelse:\r\n solve()\r\n", "# Question: D - 1\n# Assignment 11\n# Daniel Perez, bd2255\n\n# modulus to divide into\nm = 10**9 + 7\n\ndef rainy(K, PA, PB):\n # calculating the values of Q and P provided for by the problem\n P = PA * pow(PB, m - 2, m) % m\n Q = pow(PA + PB, m - 2, m)\n\n # calculate the sequences to initialize the array\n FINAL, CURR = [0] * K, [0] * K\n\n # sequence for getting the values of the sequence generation\n for s in range(K, 0, -1):\n CURR[s - 1] = s + P\n for i in range(s, K):\n # getting the max value from current sequence for the value to\n # use in the formula\n j = max(i - s, s - 1)\n\n # this calculates the value of Q inverse? not sure yet \n CURR[i] = Q * (PA * FINAL[i] + PB * (s + CURR[j])) % m\n\n # swap the value of final and current sequences to continue the calculation\n FINAL, CURR = CURR, FINAL\n # return the last value of the final sequence \n return FINAL[K - 1]\n\n\nk, a, b = map(int, input().split())\nprint(rainy(k, a, b))\n\n\t\t \t \t \t\t\t \t\t \t\t \t \t \t \t\t\t", "n, a, b = map(int, input().split())\r\nP = 10 ** 9 + 7\r\ndef inv(x): return pow(x, P - 2, P)\r\nA = a * inv(a + b)\r\nB = b * inv(a + b)\r\nC = a * inv(b)\r\nf = [[0] * 1005 for i in range(1005)]\r\nfor i in range(n, 0, -1):\r\n for j in range(n - 1, -1, -1):\r\n if(i + j >= n): f[i][j] = (i + j + C) % P\r\n else: f[i][j] = (A * f[i + 1][j] + B * f[i][j + i]) % P\r\nprint(f[1][0])\r\n", "from collections import defaultdict as di\nimport sys\nsys.setreqursiondepth = 1000000\nMOD = int(1e9+7)\ndef modinvEuler(x,mod):\n # if mod is prime\n return pow(x, mod-2, mod)\n # otherwise exponent should be totient(mod)-1\n\nk,pa,pb = [int(x) for x in input().split()]\nPa = (pa*modinvEuler(pa+pb,MOD))%MOD\nPb = (1-Pa)%MOD\n\nEa = modinvEuler(Pa,MOD)\nEb = modinvEuler(Pb,MOD)\n\nPbinv = modinvEuler(Pb,MOD)\n\nmem = di()\ndef f(na,ns):\n #global k,Pa,Pb\n if ns>=k:\n return ns\n if na+ns>=k:\n total = ns\n total += na\n total += Pa*Pbinv\n total%= MOD\n return total\n if (na,ns) not in mem:\n mem[(na,ns)] = ( Pa*(f(na+1,ns))+Pb*(f(na,ns+na)) )%MOD\n\n return mem[(na,ns)]\nprint((f(1,0))%MOD)\n", "k, pa, pb = map(int, input().split())\r\n\r\nMOD = 10**9 + 7\r\nINF = ((pa + pb) * pow(pb, MOD-2, MOD)) % MOD\r\nrAB = pow(pa+pb, MOD-2, MOD)\r\nrB = pow(pb, MOD-2, MOD)\r\n\r\nmemo = {}\r\n\r\ndef dfs(a, ab):\r\n if ab >= k:\r\n return ab\r\n if a + ab >= k:\r\n #return INF\r\n #return (pa + pb) / pb\r\n return ((a + MOD-1) + (pa + pb) * rB + ab) % MOD\r\n return a - 1 + (pa + pb) / pb + ab\r\n if (a, ab) in memo:\r\n return memo[a, ab]\r\n #res = (((dfs(a+1, ab)+1) * pa * rAB) + ((dfs(a, ab+a)+1) * pb * rAB)) % MOD\r\n #res = (dfs(a+1, ab)) * pa / (pa + pb) + (dfs(a, ab+a)) * pb / (pa + pb)\r\n res = (dfs(a+1, ab) * pa * rAB) + (dfs(a, ab+a) * pb * rAB)\r\n #print(a, ab, res)\r\n memo[a, ab] = res = res % MOD\r\n return res\r\n#print((dfs(1, 0) * pa * rAB + 1) % MOD)\r\n#print((pb + dfs(1, 0)*pa) / pa)\r\nprint(dfs(1, 0))\r\n", "import math\r\nimport sys\r\n\r\nk, pa, pb = list( map( int, input().split() ) )\r\n\r\n\r\nmemo = {}\r\n\r\nsys.setrecursionlimit(1500*1500*2)\r\n\r\nMOD = (10**9 + 7 )\r\n\r\ndef pow( a, b ):\r\n\r\n ret = 1\r\n\r\n while b > 0:\r\n\r\n if b & 1:\r\n ret = (ret*a)%MOD\r\n\r\n a = (a*a)%MOD\r\n\r\n b //= 2\r\n\r\n return ( ret )\r\n\r\ndef inv(a):\r\n return pow( a, MOD-2 )\r\n\r\nPa = pa * inv( pa + pb )\r\nPb = pb * inv( pa + pb )\r\npa_inv_pb = pa * inv(pb)\r\n\r\ndef f( total_a, total_ab ):\r\n\r\n if total_a+total_ab >= k:\r\n return total_a+total_ab + pa_inv_pb\r\n\r\n if (total_a,total_ab) in memo:\r\n return memo[ (total_a,total_ab) ]\r\n\r\n Best = 0\r\n\r\n Best += Pa * f( total_a+1, total_ab )\r\n Best %= MOD\r\n\r\n Best += Pb * f( total_a, total_a+total_ab )\r\n Best %= MOD\r\n\r\n memo[ (total_a,total_ab) ] = Best\r\n\r\n return ( Best )\r\n\r\n#print( k, pa, pb )\r\n\r\nprint( ( f(1,0) ) % MOD )\r\n", "mod = 1000000007\r\nN = 1005\r\n#input start\r\nk,pa,pb = map(int,input().split())\r\ndp = [[0 for x in range(k)] for y in range(k+1)]\r\n#end of input\r\n\r\ndef fast_expo(a,b):\r\n\tret = 1\r\n\twhile b:\r\n\t\tif b%2==1:\r\n\t\t\tret = ret*a%mod\r\n\t\tb //= 2\r\n\t\ta = a*a%mod\r\n\treturn ret\r\ndef inv(x):\r\n\treturn fast_expo(x,mod-2)%mod\r\n\r\ndef dp_val(a,b):\r\n\tif b>=k:\r\n\t\treturn b\r\n\treturn dp[a][b]\r\n\r\n\r\nfor i in range(k):\r\n\tdp[k][i] = (i+k+pa*inv(pb))%mod\r\n\r\nden = inv(pa+pb)\r\n\r\nfor i in range(k-1,0,-1):\r\n\tfor j in range(k-1,-1,-1):\r\n\t\tdp[i][j] = pa*dp_val(i+1,j)*den%mod+pb*dp_val(i,i+j)*den%mod\r\n\t\tdp[i][j]%=mod\r\n\r\nprint(dp[1][0])\r\n", "k, a, b = map(int, input().split())\r\nm = 1000000007\r\nd = a * pow(b, m - 2, m) % m\r\nc = pow(a + b, m - 2, m)\r\nu, v = [0] * k, [0] * k\r\nfor s in range(k, 0, -1):\r\n v[s - 1] = s + d\r\n for i in range(s, k):\r\n j = max(i - s, s - 1)\r\n v[i] = c * (a * u[i] + b * (s + v[j])) % m\r\n u, v = v, u\r\nprint(u[k - 1])" ]

[ "n,x,y = map(int,input().split())\r\na = list(map(int,input().split()))\r\na.sort()\r\nx *= 2\r\nfor i in range(n):\r\n kol = x+y\r\n# print(x,y,kol,a[i])\r\n if kol>=a[i]:\r\n if a[i]%2!=0:\r\n if y>0:\r\n y-=1\r\n a[i]-=1\r\n else:\r\n x-=2\r\n a[i]-=1\r\n x-=a[i]\r\n if x<0:\r\n y+=x\r\n x=0\r\n# print(x,y,kol,a[i])\r\n else:\r\n print(i)\r\n break\r\nelse:\r\n print(i+1)\r\n", "[n,x,y]=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nc=0\r\nfor i in a:\r\n chislo=i\r\n if chislo//2<=x:ax=i//2\r\n else: ax=x\r\n x-=ax\r\n chislo=chislo-ax*2\r\n ay=min(chislo,y)\r\n y-=ay\r\n chislo=chislo-ay\r\n if(chislo!=0 and x!=0):\r\n x-=1\r\n chislo-=1\r\n if (chislo==0): c+=1\r\n else: break\r\nprint(c)\r\n", "import sys,math\r\nn,x,y=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nz.sort()\r\nans=0\r\nfor i in range(n):\r\n if z[i]%2==0:\r\n if x>=z[i]//2:\r\n x-=z[i]//2\r\n ans+=1\r\n else:\r\n z[i]-=x*2\r\n x=0\r\n y-=z[i]\r\n if y>=0:\r\n ans+=1\r\n else:\r\n break\r\n else:\r\n if x>=z[i]//2 and y>=1:\r\n x-=z[i]//2\r\n ans+=1\r\n y-=1\r\n elif x>=z[i]//2+1:\r\n x-=z[i]//2+1\r\n ans+=1\r\n else:\r\n z[i]-=x*2\r\n x=0\r\n y-=z[i]\r\n if y>=0:\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n", "M = input().split()\r\nn = int(M[0])\r\nx = int(M[1])\r\ny = int(M[2])\r\nM = input().split()\r\nfor i in range(0,n):\r\n M[i] = int(M[i])\r\nM.sort()\r\n\r\nc = 0\r\nfor i in range(0,n):\r\n if M[i]>0:\r\n dy = M[i]%2\r\n dx = (M[i]-dy)//2\r\n x = x-dx\r\n y = y-dy\r\n if x<0:\r\n y += x*2\r\n x = 0\r\n if y<0: break\r\n if y<0:\r\n x += y\r\n y = 0\r\n if x<0: break\r\n if (x>=0)and(y>=0): c += 1\r\n M[i]=0\r\n if (x==0)and(y==0): break\r\n \r\n \r\nndone = n\r\nfor i in range(0,n):\r\n if M[i]>0: ndone += -1\r\nprint(ndone)\r\n", "n, x, y = map(int, input().split())\nteams = list(map(int, input().split()))\n\nteams.sort()\n\nc = 0\n\nfor team in teams:\n if x:\n pages_to_print = min(team // 2, x)\n x -= pages_to_print\n team -= pages_to_print * 2\n if team:\n if y:\n pages_to_print = min(team, y)\n y -= pages_to_print\n team -= pages_to_print\n if team:\n pages_to_print = sum(divmod(team, 2))\n if pages_to_print > x: break\n x -= pages_to_print\n c += 1\n\nprint(c)\n", "def main():\r\n read = lambda: map(int, input().split())\r\n n, x, y = read()\r\n a = sorted(read())\r\n cnt = 0\r\n for k in a:\r\n if 2 * x + y < k:\r\n break\r\n if k % 2 == 0 and 2 * x >= k:\r\n cx = k // 2\r\n cy = 0\r\n elif k % 2 == 0 and 2 * x < k:\r\n cx = x\r\n cy = k - 2 * cx\r\n elif k % 2 and y:\r\n cx = k // 2\r\n cy = 1\r\n elif k % 2 and y == 0:\r\n cx = k // 2 + 1\r\n cy = 0\r\n y -= cy\r\n x -= cx\r\n cnt += 1\r\n print(cnt)\r\nmain()\r\n" ]

[ "n = int(input())\nans = [n] * (2 * n)\nfor i in range(1, n + 1):\n x = i // 2 if i & 1 else n - 1 + i // 2\n y = x + n - i\n ans[x], ans[y] = i, i\nprint(*ans)\n", "N = int( input() )\r\nans = [ N for i in range( 2 * N ) ]\r\nfor i in range( 1, N + 1 ):\r\n x = i // 2 if i & 1 else N - 1 + i // 2\r\n y = x + N - i\r\n ans[ x ], ans[ y ] = i, i\r\nprint( *ans )\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque, Counter\r\nfrom heapq import heappop, heappush\r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import gcd\r\n\r\nn = int(input())\r\nodd = []\r\neven = []\r\nfor i in range(n):\r\n if i % 2 == 0:\r\n even.append(n-i)\r\n else:\r\n odd.append(n-i)\r\nodd = odd[::-1]\r\neven = even[::-1]\r\n\r\n\r\noddque = deque()\r\nevenque = deque()\r\n\r\nevenque.append(n)\r\neven.pop()\r\nwhile even:\r\n num = even.pop()\r\n evenque.append(num)\r\n evenque.appendleft(num)\r\n\r\nwhile odd:\r\n num = odd.pop()\r\n oddque.append(num)\r\n oddque.appendleft(num)\r\n\r\nevenque = list(evenque)\r\noddque = list(oddque)\r\nans = evenque + oddque + [n]\r\nprint(*ans)", "from sys import stdin, stdout, setrecursionlimit\r\ninput = stdin.readline\r\n# setrecursionlimit(int(1e6))\r\ninf = float('inf')\r\nfrom functools import cmp_to_key\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter, deque\r\nfrom heapq import *\r\nimport math\r\nfrom math import floor, ceil, sqrt\r\ndef geti(): return map(int, input().strip().split())\r\ndef getl(): return list(map(int, input().strip().split()))\r\ndef getis(): return map(str, input().strip().split())\r\ndef getls(): return list(map(str, input().strip().split()))\r\ndef gets(): return input().strip()\r\ndef geta(): return int(input())\r\ndef print_s(s): stdout.write(s+'\\n')\r\nfrom itertools import permutations as perm\r\n\r\ndef calc(a):\r\n cost = 0\r\n index = dd(list)\r\n n = len(a)\r\n for i in range(n):\r\n index[a[i]].append(i)\r\n # for i in sorted(index):\r\n # print(i, index[i])\r\n n //= 2\r\n for i in range(1, n+1):\r\n # print(i)\r\n d = index[i][1] - index[i][0]\r\n cost += (n - i)*abs(d + i - n)\r\n return cost\r\ndef solve():\r\n n = geta()\r\n diff = n - 1\r\n ans = [0]*(2*n)\r\n index = 0\r\n for i in range(1, n, 2):\r\n # print(ans)\r\n ans[index] = i\r\n ans[index + diff] = i\r\n diff -= 2\r\n while index < 2*n and ans[index]:\r\n index += 1\r\n if index == 2*n:\r\n break\r\n # print(ans)\r\n index = n\r\n diff = n - 2\r\n for i in range(2, n, 2):\r\n ans[index] = i\r\n ans[index + diff] = i\r\n diff -= 2\r\n while index < 2*n and ans[index]:\r\n index += 1\r\n for i in range(2*n):\r\n if not ans[i]:\r\n ans[i] = n\r\n # for _ in range(20):\r\n # temp = getl()\r\n # print(*temp)\r\n print(*ans)\r\n # print(calc(ans))\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n solve()\r\n", "n = int(input())\r\nr = list(range(n))\r\na, b = r[2 - n % 2::2], r[1 + n % 2::2]\r\nprint(' '.join(map(str, a + [n] + a[::-1] + b + b[::-1] + [n])))", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\ndef solve(): \r\n n=int(input())\r\n if n%2==0:\r\n data=[0]*(2*n+1)\r\n for i in range(1,n,2):\r\n now=i//2+1\r\n data[now]=i\r\n data[n+1-now]=i\r\n for i in range(2,n,2):\r\n now=i//2\r\n data[n+now]=i\r\n data[2*n-now]=i\r\n data[n+n//2]=n\r\n data[-1]=n\r\n print(*data[1:],sep=' ')\r\n else:\r\n data=[0]*(2*n+1)\r\n for i in range(1,n,2):\r\n now=i//2+1\r\n data[now]=i\r\n data[n-now+1]=i\r\n data[n//2+1]=n\r\n data[-1]=n\r\n for i in range(2,n,2):\r\n now=i//2\r\n data[n+now]=i\r\n data[2*n-now]=i\r\n print(*data[1:],sep=' ')\r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "n = int(input())\r\neven, odd = [], []\r\nfor i in range(1, n):\r\n if (n - i) % 2 == 1:\r\n odd.append(i)\r\n else:\r\n even.append(i)\r\nprint(*even, end=' ')\r\nprint(n, end=' ')\r\nprint(*reversed(even), end=' ')\r\nprint(*odd, end=' ')\r\nprint(*reversed(odd), end=' ')\r\nprint(n)", "# |\r\n# _` | __ \\ _` | __| _ \\ __ \\ _` | _` |\r\n# ( | | | ( | ( ( | | | ( | ( |\r\n# \\__,_| _| _| \\__,_| \\___| \\___/ _| _| \\__,_| \\__,_|\r\n\r\nimport sys\r\nimport math\r\n\r\ndef read_line():\r\n\treturn sys.stdin.readline()[:-1]\r\n \r\ndef read_int():\r\n\treturn int(sys.stdin.readline())\r\n\t\r\ndef read_int_line():\r\n\treturn [int(v) for v in sys.stdin.readline().split()]\r\n\r\ndef read_float_line():\r\n\treturn [float(v) for v in sys.stdin.readline().split()]\r\n\r\nn = read_int()\r\nx1 = 0\r\ny1 = n\r\nans = [0]*(2*n)\r\n\r\nfor i in range(1,n+1):\r\n\tif i&1:\r\n\t\tans[x1] = i\r\n\t\tans[x1+n-i] = i\r\n\t\tx1+=1\r\n\telse:\r\n\t\tans[y1] = i\r\n\t\tans[y1+n-i] = i\r\n\t\ty1+=1\r\n\r\nfor i in range(2*n):\r\n\tif ans[i] == 0:\r\n\t\tans[i] = n\r\n\r\nprint(*ans)\r\n\r\n", "import collections\r\nimport math\r\n\r\nn = int(input())\r\narr = [0] * (2 * n)\r\nl, r = 0, 0\r\nfor i in range(1, n):\r\n if i % 2 == 1:\r\n arr[l] = arr[l + n - i] = i\r\n l += 1\r\n else:\r\n arr[n + r] = arr[n + r + n - i] = i\r\n r += 1\r\nfor i in range(2):\r\n while arr[l]:\r\n l += 1\r\n arr[l] = n\r\nprint(' '.join(str(x) for x in arr))", "n = int(input())\r\na = []\r\nfor i in range(1 + n % 2, n, 2):\r\n a.append(i)\r\nfor i in range(n // 2):\r\n a.append(a[-(2 * i + 1)])\r\nfor i in range(1 + (n % 2 ^ 1), n, 2):\r\n a.append(i)\r\na.append(n)\r\nfor i in range((n - 1) // 2):\r\n a.append(a[-(2 * i + 2)])\r\na.append(n)\r\nprint(*a)", "if __name__ == \"__main__\":\r\n\r\n n = int(input())\r\n res = [n]*(2*n)\r\n\r\n if n % 2 == 0:\r\n for i in range(1,n+1,2):\r\n index = i//2\r\n res[index] = i\r\n res[n-1-index] = i\r\n\r\n for i in range(2,n+1,2):\r\n index = i//2-1\r\n res[n+index] = i\r\n res[2*n-2-index] = i\r\n\r\n else:\r\n m = n//2*2\r\n for i in range(2,n+1,2):\r\n index = i//2-1\r\n res[index] = i\r\n res[m-1-index] = i\r\n #print(\" \".join(map(str,res)))\r\n\r\n for i in range(1,n+1,2):\r\n index = i//2\r\n res[m+index] = i\r\n res[2*n-2-index] = i\r\n #print(\" \".join(map(str,res)))\r\n\r\n print(\" \".join(map(str,res)))\r\n", "n = int(input())\nA = [i for i in range(1, n+1, 2)]\nB = [i for i in range(n-2 if n%2 else n-1, 0, -2)]\nC = [i for i in range(2, n+1, 2)]\nD = [i for i in range(n-1 if n%2 else n-2, 0, -2)]\nans = ' '.join(map(str, A+B+C+D+[n]))\nprint(ans)\n", "n=int(input())\r\nl=[n]*(2*n)\r\nfor x in range(1,n+1):\r\n if x%2:\r\n a = x>>1\r\n else:\r\n a = n-1+(x>>1)\r\n b = a + (n-x)\r\n l[a] = x\r\n l[b] = x\r\nprint(\" \".join(map(str,l)))", "n=int(input())\r\nif n%2==0:\r\n a=[]\r\n for i in range(1,n,2):\r\n a.append(i)\r\n a=a+a[::-1]\r\n b=[]\r\n for i in range(2,n,2):\r\n b.append(i)\r\n a=a+[n]+b+[n]+b[::-1]\r\n print(*a)\r\nelse:\r\n a=[]\r\n for i in range(1,n,2):\r\n a.append(i)\r\n a=a+[n]+a[::-1]+[n]\r\n b=[]\r\n for i in range(2,n,2):\r\n b.append(i)\r\n a=a+b+b[::-1]\r\n print(*a)" ]

[ "n = int(input())\r\nlst = list(map(int,input().split()))\r\na=0\r\nb=100\r\nmax_ind=0\r\nmin_ind=0\r\n\r\nfor i in range(n):\r\n if lst[i]>a:\r\n a=lst[i]\r\n max_ind = i\r\n if lst[i]<=b:\r\n b = lst[i]\r\n min_ind = i\r\nif max_ind<min_ind:\r\n print(max_ind+(n-min_ind)-1)\r\nelse:\r\n print(max_ind+((n-min_ind)-2))", "n = int(input())\r\nx = list(map(int, input().split()))\r\ny = max(x); z = min(x)\r\na = x.index(y); x.pop(a); x.insert(0,y)\r\nx.reverse()\r\nb = x.index(z)\r\nprint(a+b)", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = l.index(max(l)) + l[::-1].index(min(l))\r\nswaps = a - (a >= n)\r\nprint(swaps)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = a.index(max(a)) + a[::-1].index(min(a))\r\nprint(b - (b >= n))", "n=int(input())\r\nheights=list(map(int,input().split()))\r\nmaxheight=max(heights)\r\nminheight=min(heights)\r\nmaxpos=heights.index(maxheight)\r\nminpos=None\r\nfor i in range(n-1, -1, -1):\r\n if heights[i] == minheight:\r\n minpos = i\r\n break\r\nif maxpos>minpos:\r\n minpos=minpos+1\r\noutput=maxpos+(n-1-minpos)\r\nprint(output)\r\n", "a = eval(input())\r\n\r\ns = input()\r\ns = s.split()\r\nmin=int(s[0])\r\nminidx = 0\r\nmaxidx = 0\r\nmax = int(s[0])\r\nfor i in range(a):\r\n if int(s[i]) > max:\r\n max = int(s[i])\r\n maxidx=i\r\n elif int(s[i])<=min:\r\n min = int(s[i])\r\n minidx = i\r\n\r\n\r\nif minidx<maxidx:\r\n print(maxidx+(a-minidx)-2)\r\nelse:\r\n print(maxidx +a- minidx-1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmaxi = max(l)\r\nmini = min(l)\r\nfor i in range(len(l)):\r\n if l[i] == maxi:\r\n maxi = i\r\n l.pop(i)\r\n break\r\nfor i in range(1,len(l)+1):\r\n if l[-1*i] == mini:\r\n mini = i\r\n break\r\nprint(maxi+mini-1)\r\n ", "n = int(input())\na = list(map(int, input().split(' ')))\n\nn_gaps = len(a) - 1\na_max, a_min = max(a), min(a)\nmax2first_gaps = a.index(a_max)\nrightmost_min_idx = len(a) - a[::-1].index(a_min) - 1\nmin2end_gaps = n_gaps - rightmost_min_idx\n\nmin_steps = max2first_gaps + min2end_gaps\nif min_steps > n_gaps:\n min_steps -= 1\nprint(min_steps)\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\ns = n - l[::-1].index(min(l)) - 1\r\nb = l.index(max(l))\r\n\r\nif s < b:\r\n print(n-s+b-2)\r\nelse:\r\n print(n-s+b-1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\na = max(i for i, val in enumerate(arr)\r\n if val == min(arr))\r\nb = min(i for i, val in enumerate(arr)\r\n if val == max(arr))\r\nif b < a:\r\n print(b+len(arr)-1-a)\r\nelse:\r\n print((b+len(arr)-1-a)-1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=l.index(max(l))\r\nb=l[::-1].index(min(l))\r\nif a<n-b-1:\r\n print(a+b)\r\nelse:\r\n print(a+b-1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nma=0\r\nmi=0\r\nfor i in range(1,n):\r\n if a[ma]<a[i]:\r\n ma=i\r\n if a[mi]>=a[i]:\r\n mi=i\r\nif ma>mi:\r\n mi+=1\r\nprint(ma+((n-1)-mi))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nif a[0] == max(a) and a[-1] == min(a):\r\n print(0)\r\nelse:\r\n minind = max([ind for ind,ele in enumerate(a) if ele == min(a)])\r\n maxind = min([ind for ind,ele in enumerate(a) if ele == max(a)])\r\n if maxind > minind:\r\n print(maxind+(n-1)-minind-1)\r\n else:\r\n print(maxind+(n-1)-minind)", "n = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nmax_height = max(heights)\r\nmin_height = min(heights)\r\n\r\nmax_idx = heights.index(max_height)\r\nmin_idx = heights[::-1].index(min_height)\r\n\r\nif max_idx > (n - 1 - min_idx):\r\n swaps = max_idx + min_idx - 1\r\nelse:\r\n swaps = max_idx + min_idx\r\n\r\nprint(swaps)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=[i for i in range(n) if l[i]==max(l)]\r\ny=[i for i in range(n) if l[i]==min(l)]\r\np=min(x)\r\nq=max(y)\r\nif p<q:\r\n print(p+(n-1-q))\r\nelse:\r\n print(p+(n-q-2))", "s=int(input())\r\nc=list(map(int,input().split()))\r\nr=max(c)\r\no=c.index(max(c))\r\nc.remove(r)\r\nc.insert(0,r)\r\ne=c.count(min(c))\r\nif e>1:\r\n for i in range(1,e):\r\n c.remove(min(c))\r\nprint(o+(len(c)-c.index(min(c)))-1) ", "n = int(input())\r\nx = [int(a) for a in input().split()]\r\nmx = x[0]\r\nI = 0\r\nmn = x[0]\r\nJ = 0\r\nfor i in range(len(x)):\r\n if x[i] > mx:\r\n mx = x[i]\r\n I = i\r\n elif x[i] == mx:\r\n I = min(I,i)\r\nfor i in range(len(x)):\r\n if x[i] < mn:\r\n mn = x[i]\r\n J = i\r\n elif x[i] == mn:\r\n J = max(J,i)\r\nif I < J:\r\n print(I + n - J-1) \r\nelse:\r\n print(I + n - J-2)\r\n", "import math\ndef main():\n input()\n v = tuple([int(el) for el in input().split()])\n max_h = v.index(max(v))\n min_h = len(v) -1 - v[::-1].index(min(v))\n s = max_h + (len(v) - 1 - min_h)\n if max_h > min_h:\n s -= 1\n print(s)\n\n\nif __name__ == '__main__':\n main()", "soldiers_count = int(input())\r\nsoldiers_height = list(map(int, input().split()))\r\n\r\nmax_height = max(soldiers_height)\r\nmin_height = min(soldiers_height)\r\n\r\nfirs_max_index = soldiers_height.index(max_height)\r\nsoldiers_height.reverse()\r\nlast_min_index = soldiers_height.index(min_height)\r\n\r\n\r\nlast_index_value = soldiers_height[last_min_index]\r\nsoldiers_height.pop(last_min_index)\r\nsoldiers_height.reverse()\r\nsoldiers_height.append(last_index_value)\r\nfirs_max_index = soldiers_height.index(max_height)\r\nprint(firs_max_index + last_min_index)\r\n\r\n \r\n", "n = int(input())\r\nheights = list(map(int, input().split()))\r\nmax_height = max(heights)\r\nmax_height_index = heights.index(max_height)\r\n\r\ncount = 0\r\n\r\nwhile max_height_index > 0:\r\n heights[max_height_index-1], heights[max_height_index] = heights[max_height_index], heights[max_height_index-1]\r\n max_height_index -= 1\r\n count += 1\r\n\r\nmin_height = min(heights)\r\nmin_height_index = n-heights[::-1].index(min_height)-1\r\n\r\nwhile min_height_index < n-1:\r\n heights[min_height_index+1], heights[min_height_index] = heights[min_height_index], heights[min_height_index+1]\r\n min_height_index += 1\r\n count += 1\r\n\r\nprint(count)\r\n", "n=int(input())\r\norder=list(map(int, input().split()))\r\nsecs=0\r\nMin=len(order)-order[::-1].index(min(order))-1\r\nMax=order.index(max(order))\r\nsec=Max+n-1-Min\r\nif Max>Min:\r\n sec-=1\r\nprint(sec)", "def rindex(mylist, myvalue):\r\n return len(mylist) - mylist[::-1].index(myvalue) - 1\r\n\r\nnum_soldiers = int(input())\r\nsoldiers_height = list(map(int, input().split()))\r\n\r\nmax_height = max(soldiers_height)\r\nmin_height = min(soldiers_height)\r\nmax_ind = soldiers_height.index(max_height)\r\nmin_ind = rindex(soldiers_height, min_height)\r\n\r\nmin_moves = num_soldiers-min_ind-1\r\nif min_ind < max_ind:\r\n print(max_ind+min_moves-1)\r\nelse:\r\n print(max_ind + min_moves)\r\n", "n = int(input())\r\nsquad_soldiers = [int(x) for x in input().split()]\r\nlargest = max(squad_soldiers)\r\nsmallest = min(squad_soldiers)\r\nlargest_index = squad_soldiers.index(largest)\r\nsquad_soldiers.remove(largest)\r\nsquad_soldiers.insert(0, largest)\r\nreverse_squad_soldiers = squad_soldiers[::-1]\r\nsmallest_index = reverse_squad_soldiers.index(smallest)\r\n\r\nprint(smallest_index + largest_index)\r\n", "n = int(input())\r\nlst = list(map(int,input().split(' ')))\r\nmini = min(lst) \r\nmaxi = max(lst)\r\nmin_index = -1\r\nmax_index = -1\r\ncount = 0\r\nl = len(lst)\r\nfor i in range(l-1,-1,-1):\r\n if lst[i] == mini:\r\n min_index = i \r\n break\r\ncount = count + l - min_index - 1\r\nfor i in range(min_index,l-1):\r\n lst[i],lst[i+1] = lst[i+1],lst[i]\r\nfor i in range(0,l):\r\n if lst[i] == maxi:\r\n max_index = i\r\n break\r\ncount = count + max_index\r\nprint(count)", "n = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nmaxIndex = 0\r\nminIndex = 0\r\nfor i in range(1, n):\r\n if heights[i] > heights[maxIndex]:\r\n maxIndex = i\r\n if heights[i] <= heights[minIndex]:\r\n minIndex = i\r\n\r\nsecondsNeeded = maxIndex + (n - 1 - minIndex)\r\n\r\nif maxIndex > minIndex:\r\n secondsNeeded -= 1\r\n\r\nprint(secondsNeeded)\r\n", "def solve(arr,n):\r\n mx=max(arr)\r\n mn=min(arr)\r\n imx=0\r\n imn=0\r\n for i in range(n):\r\n if arr[i]==mn:\r\n imn=i\r\n for i in range(n):\r\n if arr[i]==mx:\r\n imx=i\r\n break\r\n sm=0\r\n sm=imx\r\n sm+=(n-1-imn)\r\n if imx>imn:\r\n sm-=1\r\n print(sm)\r\n \r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nsolve(arr,n)", "n=int(input())\r\nli=list(map(int,input().split()))\r\nmaxi=max(li)\r\nc=li.index(maxi)\r\nli.remove(maxi)\r\nli.insert(0,maxi)\r\nli.reverse()\r\nmini=min(li)\r\nc+=li.index(mini)\r\nprint(c)\r\n\r\n\r\n", "n,*x=map(int,open(0).read().split())\r\ny=x.index(max(x))+x[::-1].index(min(x))\r\nprint(y-(y>=n))", "n = int(input())\r\nq = list(map(int, input().split()))\r\n\r\nmx = 0\r\nmx_p = 0\r\n\r\nmi = 101\r\nmi_p = 0\r\n\r\nfor i in range(n):\r\n if mx < q[i]:\r\n mx = q[i]\r\n mx_p = i\r\n if mi >= q[i]:\r\n mi = q[i]\r\n mi_p = i\r\n\r\nif mx_p > mi_p:\r\n print(mx_p + n - mi_p - 2)\r\nelse:\r\n print(mx_p + n - mi_p - 1)\r\n\r\n\r\n\r\n\"\"\"\r\n\r\n6 2\r\nBBGBBG\r\n\r\n\r\n\"\"\"", "n = int(input())\r\nl1 = [int(x) for x in input().split()]\r\na1 = max(l1)\r\na2 = min(l1)\r\n\r\nfor t in range(n):\r\n if l1[t] == a1:\r\n break \r\n \r\nfor t1 in range(n-1,-1,-1):\r\n if l1[t1] == a2:\r\n break \r\n \r\n \r\nif t > t1:\r\n print(t + n - t1 - 2)\r\nelse:\r\n print(t + n - t1 - 1 )\r\n ", "n = int(input())\n\norder = [int(i) for i in input().split()]\n\nmin, max = min(order), max(order)\n\nindex_max = order.index(max)\nindex_min = n - list(reversed(order)).index(min)\n\nif index_min > index_max:\n print(index_max + n - index_min)\nelse:\n print(index_max + n - index_min - 1)\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n = int(input())\n a = [int(x) for x in input().split()]\n min_i, max_i = 0, 0\n for i in range(n):\n if a[i] <= a[min_i]:\n min_i = i\n elif a[i] > a[max_i]:\n max_i = i\n if min_i > max_i:\n print(max_i + n - 1 - min_i)\n else:\n print(max_i + n - 2 - min_i)\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nsoldier_heights = input().split(' ')\r\ntotal_time = 0 \r\nsoldier_heights = [int(item) for item in soldier_heights]\r\ntotal_time = abs(0-soldier_heights.index(max(soldier_heights)))\r\nx = max(soldier_heights)\r\nsoldier_heights.remove(max(soldier_heights))\r\nsoldier_heights.insert(0,x)\r\nsoldier_heights.reverse()\r\ntotal_time += abs(0 - soldier_heights.index(min(soldier_heights)))\r\nprint(total_time)", "import math \r\ndef arrivalgen(s):\r\n alist=[int(d) for d in s.split()] \r\n c=0\r\n slit=[]\r\n for j in range(len(alist)):\r\n if alist[j]==max(alist):\r\n slit.append(j)\r\n blist=alist.copy()\r\n c+=min(slit)\r\n alist.pop(min(slit))\r\n alist.insert(0,max(blist))\r\n clist=alist.copy()\r\n flist=[]\r\n for i in range(len(clist)):\r\n if clist[i]==min(clist):\r\n flist.append(i)\r\n x=max(flist)\r\n c+=len(blist)-1-x\r\n return c\r\nt=int(input())\r\ns=input()\r\nprint(arrivalgen(s))", "n=input()\nn=int(n)\nlist=list(map(int,input().split()))\nmaxPow= -1\nminPow= -1\nmaxVal=-1\nminVal=100000\n\nfor i in range(0,n,1):\n if list[i]>maxVal:\n maxPow=i\n maxVal=list[i]\n\n if list[i]<= minVal :\n minPow =i\n minVal=list[i]\n\n\nif maxPow>minPow :\n print((maxPow-1)+(n-minPow)-1)\nelse :\n print((maxPow - 1) + (n - minPow))\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\nmax_ = max(x)\r\nmn = min(x)\r\n\r\nmaxid = x.index(max_)\r\nminid = (len(x)-1) - list(reversed(x)).index(mn)\r\n\r\nresult = maxid + ((len(x) - 1) - minid)\r\n\r\nif maxid < minid:\r\n print(result)\r\n\r\nelse:\r\n print(result -1) ", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nmaxi = max(l)\r\nmini = min(l)\r\ni_max , i_min = 0, 0 \r\nfor i in range(n):\r\n if l[i] == maxi:\r\n i_max = i + 1\r\n break\r\nfor i in range(n):\r\n if l[i] == mini:\r\n i_min = i + 1\r\nif i_max > i_min:\r\n ans = i_max + n - i_min - 2\r\nelse:\r\n ans = i_max + n - i_min - 1\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = min(a)\r\nl = max(a)\r\ni = 0\r\nm = 0\r\no = a.index(l)\r\nwhile(i<n):\r\n if a[i]==k:\r\n m = i\r\n i = i + 1\r\nif m<o:\r\n time = o + len(a) - m - 2\r\nelse:\r\n time = o + len(a) - m -1\r\nprint(time)", "n = int(input()) #levels\narr=[int(i) for i in input().split()]\nmini = 10000000; maxi = -1\npos_mini = 0 ; pos_maxi = 0\n\nfor i in range(n):\n if arr[i] <= mini:\n mini = arr[i]\n pos_mini = i\n\nfor i in range(n):\n if arr[i] > maxi:\n maxi = arr[i]\n pos_maxi = i\n\nsec_mini = (n-1) - pos_mini\nsec_maxi = pos_maxi - 0\n\nif pos_mini < pos_maxi:\n ans = (sec_maxi+sec_mini)-1\nelse:\n ans = (sec_maxi + sec_mini)\n\nprint(ans)\n \t\t \t\t\t\t \t\t\t \t \t", "n = int(input())\r\nl = list(map(int, input().split()))\r\nt = max(l)\r\ns = min(l)\r\ndt = l.index(t)\r\nds = l[::-1].index(s)\r\nd = dt + ds\r\nif d > n-2:\r\n d -= 1\r\nprint(d)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nheight = map(int, sys.stdin.readline().split())\r\nheight = list(height)\r\n\r\nmax_index = 0\r\nmin_index = 0\r\nmax = height[0]\r\nmin = height[0]\r\n\r\ni = 0\r\n\r\nwhile i < n:\r\n if height[i] > max:\r\n max = height[i]\r\n max_index = i\r\n elif height[i] <= min:\r\n min = height[i]\r\n min_index = i\r\n i += 1\r\n \r\nsum = max_index + (n - (min_index + 1))\r\n\r\nif min_index < max_index:\r\n sum -= 1\r\n \r\nprint(sum)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmaxi=a.index(max(a))\r\na.reverse()\r\nmini=n-a.index(min(a))-1\r\na.reverse()\r\nif maxi>mini:\r\n print(maxi+(n-mini)-2)\r\nelse:\r\n print(maxi+(n-mini)-1)", "n=int(input())\r\nheights=list(map(int,input().split()))\r\n# print(heights)\r\nmaxh=max(heights)\r\nminh=min(heights)\r\nmaxh_ind=heights.index(maxh)\r\nfor i in range(len(heights)-1,-1,-1):\r\n if heights[i]==minh:\r\n minh_ind=i\r\n break\r\n# print(maxh_ind , minh_ind)\r\nif minh_ind>maxh_ind:\r\n print(maxh_ind + len(heights)- minh_ind -1)\r\nelse:\r\n print(maxh_ind + len(heights)- minh_ind-2) ", "a = int(input())\r\nb = list(map(int,input().split()))\r\ne = max(b)\r\nc=0;d=0\r\nfor i in range(a):\r\n if b[i]==max(b):\r\n c = i\r\n b[i]=0\r\n break\r\nb.remove(0)\r\nb.insert(0,e)\r\nfor i in range(a):\r\n if b[a-1-i]==min(b):\r\n d = i\r\n break\r\nprint(c+d)", "n = int(input())\r\na = input().split()\r\nx = [int(m) for m in a]\r\nMax=max(x)\r\nMaxIndex = x.index(Max)\r\nMin=min(x)\r\nx.reverse()\r\nMinIndex = x.index(Min)\r\nMinIndex = (len(x) - 1) - MinIndex\r\nif MaxIndex < MinIndex:\r\n print(MaxIndex + len(x) - MinIndex -1)\r\nelse:\r\n print(MaxIndex + len(x) - MinIndex - 2)\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/144/A\r\n\r\n_ = input()\r\nsoldiers = list(map(int, input().split()))\r\n\r\n# holds height of our soldiers\r\nmin_height = None\r\nmin_index = None\r\n\r\n# holds max height of our soldiers\r\nmax_height = None\r\nmax_index = None\r\n\r\nfor index in range(len(soldiers)):\r\n # start out by removing all none types\r\n if min_height == None:\r\n min_height = max_height = soldiers[index]\r\n min_index = max_index = index\r\n # since we parse through, we want to find the lowest guy\r\n # that appears last. So if we have 3 3 3 4 as input, we\r\n # want to move the last \"3\" to the lowest position.\r\n elif soldiers[index] <= min_height:\r\n min_height = soldiers[index]\r\n min_index = index\r\n # the same but opposite logic is applied to max height.\r\n elif soldiers[index] > max_height:\r\n max_height = soldiers[index]\r\n max_index = index\r\n\r\n# What a print statement.\r\n# We want to print the number of shifts necessary to move the largest guy to the front\r\n# which is equivalent to the max index,\r\n# then we want to add the result of the total soldiers [0 indexed] - the index of the shortest\r\n# soldier to find how many shifts are necessary to shift the shortest soldier to the end.\r\n# Finally, we subtract one if we end up shifting the shortest soldier and largest soldier\r\n# in one move to account for overlap.\r\nprint(max_index + len(soldiers) - 1 - min_index - (1 if min_index < max_index else 0))\r\n \r\n ", "n = int(input())\r\nnums = [int(num) for num in input().split(\" \")]\r\n\r\n# [num, index]\r\nmax, min = [nums[0], 0], [nums[0], 0]\r\nfor i, num in enumerate(nums):\r\n # Get the max more close to the start\r\n if num > max[0]: max = [num, i]\r\n # Get the min more close to the end\r\n if num <= min[0]: min = [num, i]\r\n\r\nres = 0\r\nif max[1] != 0:\r\n # Min will be moved\r\n if max[1] > min[1]: min[1] += 1\r\n res += max[1]\r\nif min[1] != len(nums) - 1:\r\n res += len(nums) - min[1] - 1\r\nprint(res)", "def main() :\r\n print(min_Swap_Count(input_Heights()))\r\n\r\n\r\ndef min_Swap_Count(heights) :\r\n MAX_INDEX = max_Index_From_Left(heights)\r\n MIN_INDEX = min_Index_From_Right(heights)\r\n return (MAX_INDEX) + (len(heights) - MIN_INDEX - 1) - int(MAX_INDEX > MIN_INDEX)\r\n\r\ndef max_Index_From_Left(array) :\r\n return array.index(max(array))\r\n\r\ndef min_Index_From_Right(array) :\r\n return right_Index(array, min(array))\r\n\r\ndef right_Index(array, val) :\r\n for index in range(len(array)-1, 0-1, -1) :\r\n if array[index] == val : return index\r\n\r\n\r\ndef input_Heights() :\r\n ignore_Line()\r\n return input_Array()\r\n\r\ndef ignore_Line() :\r\n input()\r\n\r\ndef input_Array() :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "n = int(input())\r\nh = list(map(int,input().split()))\r\nfor i in range(n):\r\n if h[i] == max(h):\r\n n_max = i \r\n break \r\nfor i in range(n-1,-1,-1):\r\n if h[i] == min(h):\r\n n_min = i \r\n break \r\nans = n_max + n - 1 - n_min\r\nif n_min < n_max:\r\n ans -= 1\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nb = min(a)\r\nc = max(a)\r\nfor i in range(n):\r\n if a[i] == c:\r\n break\r\nans += i\r\na.insert(0, a[i])\r\na.pop(i+1)\r\nfor i in range(n-1, -1, -1):\r\n if a[i] == b:\r\n break\r\nans += n - i - 1\r\nprint(ans)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmaxind = arr.index(max(arr))\r\nminindexes = [i for i in range(len(arr)) if arr[i] == min(arr)]\r\nminind = minindexes[len(minindexes) - 1]\r\nif maxind == 0 and minind == len(arr) - 1:\r\n print(0)\r\nelif maxind < minind:\r\n print(len(arr) - 1 - minind + maxind)\r\nelse:\r\n print(len(arr) - 2 - minind + maxind)", "def main():\r\n from sys import stdin,stdout\r\n n=int(stdin.readline())\r\n t=tuple(map(int,stdin.readline().split()))\r\n maxim=t[0]\r\n imaxim=0\r\n minim=t[0]\r\n iminim=0\r\n for i in range(1,n):\r\n if t[i] > maxim:\r\n maxim=t[i]\r\n imaxim=i\r\n if t[i] <=minim:\r\n minim=t[i]\r\n iminim=i\r\n if imaxim > iminim:\r\n stdout.write(str(imaxim+n-iminim-2))\r\n else:\r\n stdout.write(str(imaxim+n-iminim-1))\r\nif __name__=='__main__':\r\n main()", "n=int(input())\r\ntemp=list(map(int,input().split()))\r\nmax=max(temp)\r\nmin=min(temp)\r\nif temp[0]==max and temp[-1]==min:\r\n print(\"0\")\r\nelse:\r\n for i,v in enumerate(temp):\r\n if v==max:\r\n maxidx=i\r\n temp.pop(i)\r\n break\r\n new=[max]+temp\r\n for i,v in enumerate(new):\r\n if v==min:\r\n minidx=i\r\n print(maxidx+(len(temp)-minidx))", "n=int(input())\r\nline=[int(i) for i in input().split()]\r\nmi=[x for x ,y in list(enumerate(line)) if y==min(line)]\r\nmini=mi[len(mi)-1]\r\nma=line.index(max(line))\r\nif mini>ma:\r\n print(ma+len(line)-1-mini)\r\nelse:\r\n print(ma-1+len(line)-1-mini)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmax_pos = 0\r\nmin_pos = 0\r\n\r\nfor i in range(n):\r\n if a[i] > a[max_pos]:\r\n max_pos = i\r\n if a[i] <= a[min_pos]:\r\n min_pos = i\r\n\r\nif max_pos > min_pos:\r\n print(max_pos + n - min_pos - 2)\r\nelse:\r\n print(max_pos + n - min_pos - 1)\r\n", "n =int(input())\r\ns = list(map(int,input().split()))\r\ndef m(l:list):\r\n m = max(l)\r\n count = 0\r\n while l.index(m) != 0:\r\n i = l.index(m)\r\n l.insert(i-1, m)\r\n l.pop(i+1)\r\n count += 1\r\n return count,l\r\nlst, s1 = m(s)\r\ns1.reverse()\r\nd = s1.index(min(s1))\r\n\r\nprint(lst+d)", "n = int(input()) # Считываем количество солдат\r\nheights = list(map(int, input().split())) # Считываем росты солдат\r\n\r\nmax_index = heights.index(max(heights))\r\nmin_index = len(heights) - 1 - heights[::-1].index(min(heights))\r\n\r\nresult = max_index + n - min_index - 1\r\nif min_index<max_index:\r\n result -= 1\r\nprint(result)", "n= int(input())\r\na=list(map(int,input().split()))\r\nif set(a)==1:print(0)\r\nelse:\r\n x1=a.index(max(a))\r\n x2=(len(a)-a[::-1].index(min(a))) -1\r\n x3=(len(a)-x2)-1\r\n print(x1+x3-1 if x1>x2 else x1+x3)\r\n", "N = input()\r\nsoldiers = input().split(\" \")\r\n\r\nfor s in range(0, len(soldiers)):\r\n soldiers[s] = int(soldiers[s])\r\n\r\nmaxest = max(soldiers)\r\n\r\nmax_moves = soldiers.index(max(soldiers))\r\nsoldiers.remove(maxest)\r\n\r\nsoldiers.reverse()\r\nmin_moves = soldiers.index(min(soldiers))\r\n\r\nprint(max_moves + min_moves)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nb = l.index(max(l)) + l[::-1].index(min(l))\r\nprint(\r\n b - (b>=n)\r\n)", "n = int(input())\r\na = list(map(int , input().split()))\r\nmax =0\r\nmax_i = 0\r\nmin_i = 0\r\nmin = a[0]\r\nfor i in range(n):\r\n if(a[i] > max):\r\n max = a[i]\r\n max_i = i\r\n elif(a[i] <= min):\r\n min = a[i]\r\n min_i = i\r\nif(min_i < max_i):\r\n print((len(a) - (len(a) -max_i)-1 + (len(a) - min_i - 1)))\r\nelse:\r\n print((len(a) - (len(a) -max_i)-1 + (len(a) - min_i)))\r\n", "n = int(input())\r\ns = list(map(int,input().split()))\r\nmax_num = max(s)\r\nmin_num = min(s)\r\nmax_index = s.index(max_num)\r\nmin_index = s.index(min_num)\r\nfor i in range(min_index,len(s)):\r\n if s[i] == min_num:\r\n min_index = i\r\nif max_index < min_index:\r\n print(max_index+((len(s)-1)-min_index))\r\nelse:\r\n print((max_index+((len(s)-1)-min_index))-1)", "n = int(input())\na = list(input().split())\nma = 0\nmi = 0\nsu = 0\nb = []\nfor i in range(len(a)):\n a[i] = int(a[i])\nfor j in range(len(a)):\n if a[j] > a[ma]:\n ma = j\nif j == 0:\n su = su\nelse:\n su = ma\n pp = a[ma] \n b = a[0:ma] + a[ma+1:len(a)]\n b.insert(0,pp)\nfor l in range(len(a)): \n if b[l] <= b[mi]:\n mi = l\nif mi == len(a)-1:\n su = su\nelse:\n su = su+len(a)-1-mi\nprint(su)\n \n\t \t \t \t\t \t \t \t\t \t\t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=a.index(max(a))\r\ni=len(a)-1\r\nwhile(i>=0):\r\n if(a[i]==min(a)):\r\n d=i\r\n break\r\n i=i-1\r\n\r\nif(x>d):\r\n print(x+len(a)-d-2)\r\nelse:\r\n print(x+len(a)-d-1)", "n = int(input())\r\notv = 0\r\n\r\na = list(map(int, input().split()))\r\nmx = max(a)\r\nmn = min(a)\r\n\r\n\r\nfor i in a:\r\n if i == mx:\r\n break\r\n else: \r\n otv = otv + 1\r\na.insert(0, a.pop(otv))\r\n\r\n\r\nfor i in range(n-1, -1, -1):\r\n if a[i] == mn:\r\n break\r\n else: \r\n otv = otv + 1\r\n\r\nprint(otv)\r\n\r\n\r\n \r\n\r\n \r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ng = 0\r\nh = n - 1\r\n\r\nfor i in range(1, n):\r\n if a[i] <= a[g]:\r\n g = i\r\n\r\nfor i in range(n - 2, -1, -1):\r\n if a[i] >= a[h]:\r\n h = i\r\n\r\nans = n - 1 - g + h\r\n\r\nif g < h:\r\n ans -= 1\r\n\r\nif n == 1:\r\n print(\"0\")\r\nelse:\r\n print(ans)\r\n", "def solution(l, n):\n min_ = 200\n min_index = 0\n\n max_ = 0\n max_index = 0\n\n\n for i in range(n):\n if l[i] <= min_:\n min_ = l[i]\n min_index = i \n if l[i] > max_:\n max_ = l[i]\n max_index = i\n if max_ == min_:\n return 0\n swaps_needed = n - 1 - min_index + max_index\n if max_index > min_index:\n swaps_needed -= 1\n return swaps_needed\n\n\nif __name__ == '__main__': \n n = int(input())\n l = [int(i) for i in input().split()]\n print(solution(l, n))\n \t \t\t\t\t\t \t\t\t \t\t\t \t\t\t \t\t \t\t", "number_of_soldiers = int(input())\r\nlist_of_soldiers = list(map(int, input().split()))\r\ntime = 0\r\ntime += (list_of_soldiers.index(max(list_of_soldiers)))\r\nmaximum = max(list_of_soldiers)\r\nlist_of_soldiers.remove(max(list_of_soldiers))\r\nlist_of_soldiers.insert(0, maximum)\r\nlist_of_soldiers.reverse() # 22 11 33 44\r\ntime += (list_of_soldiers.index(min(list_of_soldiers)))\r\nprint(time)", "n = int(input()) # Read the number of soldiers\r\nheights = list(map(int, input().split())) # Read the heights of the soldiers\r\n\r\nmin_seconds = 0 # Initialize the minimum seconds needed\r\n\r\nfor i in range(n):\r\n if heights[i] == max(heights):\r\n max_index = i\r\n break\r\n\r\nfor i in range(n - 1, -1, -1):\r\n if heights[i] == min(heights):\r\n min_index = i\r\n break\r\n\r\n# Calculate the minimum number of seconds needed\r\nif max_index < min_index:\r\n min_seconds = max_index + (n - 1 - min_index)\r\nelse:\r\n min_seconds = max_index + (n - 1 - min_index) - 1\r\n\r\nprint(min_seconds)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nx=a.index(max(a))\r\ny=a[::-1].index(min(a))\r\nprint((x+y)-(x+y>=n))", "a = 0\nb = 1000000\nf = 0\nc = 0\nd = 0\n\nn = int(input())\nline = list(map(int, input().split()))\n\nfor i in range(1, n+1):\n f = line[i-1]\n if f > a:\n c = i\n a = f\n if f <= b:\n d = i\n b = f\n\nif c > d:\n print(c + n - d - 2)\nelse:\n print(c + n - d - 1)\n#11\n\t\t \t\t \t \t\t\t \t\t \t \t\t \t \t\t \t", "n = int(input())\r\na = input().split()\r\nk = 0\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nif a[0] != max(a):\r\n b = a.index(max(a))\r\n while b != 0:\r\n c = a[b-1]\r\n a[b-1] = a[b]\r\n a[b] = c\r\n b-=1\r\n k+=1\r\nv = a[::-1]\r\nif v[0] != min(a):\r\n b = v.index(min(a))\r\n while b!= 0:\r\n c = v[b-1]\r\n v[b-1] = v[b]\r\n v[b] = c\r\n b-=1\r\n k+=1\r\nprint(k)", "# from bisect import bisect_left\r\nfrom collections import Counter\r\nimport sys\r\n# from functools import lru_cache\r\n\r\nZ=int(input())\r\n\r\narr=list(map(int,input().split()));\r\nrarr=arr[::-1]\r\nl=arr.index(max(arr));r=rarr.index(min(arr))\r\nR=Z-1-r\r\n# print(l,r)\r\nif l>R:print(l+r-1)\r\nelse:print(l+r) \r\n \r\n \r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = a.index(max(a))\r\ne = n - 1 - a[::-1].index(min(a))\r\nif d < e:\r\n print(d + n - 1 - e)\r\nelse:\r\n print(d + n - 1 - e - 1)", "n=int(input())\r\narr=input().split()\r\nl=int(arr[0])\r\ns=l\r\nli=0\r\nsi=li\r\nno=0\r\nfor a in arr:\r\n if int(a)<=s:\r\n s=int(a)\r\n si=no\r\n elif int(a)>l:\r\n l=int(a)\r\n li=no\r\n no+=1\r\noutput=n-1-si+li\r\nif si<li :\r\n output-=1\r\nprint(output)\r\n", "n = int(input())\r\na = list(map(int,(input().split(' '))))\r\nlmx = -1\r\nilmx = -1\r\nrmn = 101\r\nirmn = 10000\r\n\r\nfor i in range(n):\r\n if(lmx < a[i]):\r\n lmx = a[i]\r\n ilmx = i\r\n if(rmn >= a[i]):\r\n rmn = a[i]\r\n irmn = i\r\n\r\nans = ilmx + n-1 - irmn\r\nif(ilmx > irmn):\r\n ans = ans - 1\r\n\r\nprint(ans)", "n,*a=map(int,open(0).read().split())\r\nb=a.index(max(a))+a[::-1].index(min(a))\r\nprint(b-(b>=n))", "no_of_soldiers = int(input())\r\nheights = list(map(int, input().split()))\r\ntemp = heights[0]\r\nmax_extra = min_extra = count = 0\r\nstart = -1\r\nloc = 0\r\nwhile True:\r\n try:\r\n loc = heights.index(min(heights), start+1)\r\n except ValueError:\r\n break\r\n else:\r\n start = loc\r\nfor i in range(loc, no_of_soldiers):\r\n if temp < heights[i]:\r\n heights[i - 1] = heights[i]\r\n heights[i] = temp\r\n count += 1\r\n temp = heights[i]\r\n\r\nif heights[-1] != min(heights):\r\n min_extra = len(heights) - heights.index(min(heights)) - 1\r\nif heights[0] != max(heights):\r\n max_extra = heights.index(max(heights))\r\nprint(count + min_extra + max_extra)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nma=a.index(max(a))\r\nmi=a[::-1].index(min(a))\r\nprint((ma+mi)-(ma+mi>=n))", "n = int(input())\r\nsord = list(map(int,input().split()))\r\ncounter = 0\r\ncounter += sord.index(max(sord))\r\nif sord.index(max(sord)) != 0 :\r\n temp = sord[0]\r\n sord [0] = max(sord)\r\n for i in range(counter,0,-1):\r\n sord[i] = sord[i-1]\r\n sord [1] = temp\r\ncounter += n-len(sord)+sord[::-1].index(min(sord))\r\nprint(counter)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nmax_height=l.index(max(l))\r\nl1=l[::-1]\r\nmin_height=n-l1.index(min(l1))-1\r\nmin_moves=n-min_height-1\r\nif min_height<max_height:\r\n print(max_height+min_moves-1)\r\nelse:\r\n print(max_height+min_moves)", "n = int(input())\na = list(map(int, input().split()))\n\nmax_height = a[0]\nmin_height = a[0]\nmax_index = 0\nmin_index = 0\n\nfor i in range(1, n):\n if a[i] > max_height:\n max_height = a[i]\n max_index = i\n if a[i] <= min_height:\n min_height = a[i]\n min_index = i\n\nif max_index < min_index:\n print(n-1-min_index+max_index)\nelse:\n print(n-1-min_index+max_index-1)\n\t \t\t\t\t\t\t \t\t \t \t \t\t \t \t\t\t \t\n\t\t \t\t \t\t\t \t\t \t\t \t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaxim = a.index(max(a))\r\nfor i in range(n):\r\n if a[i]==min(a):\r\n minim = i\r\nprint(maxim+n-1-minim-(maxim-minim>0))", "n=int(input())\r\narr=[int(x) for x in input().split(' ')]\r\n\r\nptr1,ptr2=0,0\r\n\r\nmax_,min_=0,float(\"inf\")\r\n\r\nfor i,val in enumerate(arr):\r\n if val>max_:\r\n max_=val \r\n ptr1=i \r\n if val<=min_:\r\n min_=val \r\n ptr2=i\r\n# print(ptr1,ptr2)\r\nif ptr1<ptr2:\r\n print(ptr1+(n-1-ptr2))\r\nelse:\r\n print(ptr1+(n-1-ptr2)-1)\r\n ", "v1=int(input());v2=list(map(int,input().split()));m=max(v2);n=min(v2)\r\nb=v2.index(m)+v2[::-1].index(n)\r\n''' print(b>=v1)'''\r\nprint(b-(b>=v1))\r\n", "n = int(input())\nlist = list(map(int,input().split()))\n\nmx = list[0]\nposmx = 0\nmn = list[0]\nposmn = 0\n\nfor i in range(0, n,1):\n if list[i] > mx:\n mx = list[i]\n posmx = i\n if list[i] <= mn:\n mn = list[i]\n posmn = i\nans = posmx + ((n-1)-posmn)\nif posmx > posmn:\n ans -= 1\nprint(ans)\n\n \t \t \t \t\t \t \t\t\t\t\t \t \t\t", "n = int(input())\r\nA = list(map(int, input().split()))\r\nma = max(A)\r\nmi = min(A)\r\ncma = 0\r\ncmi = 0\r\nfor i in range(n):\r\n if A[i] == ma and cma == 0:\r\n i_ma = i\r\n cma = 1\r\n if A[n - 1 - i] == mi and cmi == 0:\r\n i_mi = n - 1 - i\r\n cmi = 1\r\n if cma and cmi:\r\n break\r\n\r\nif i_ma < i_mi:\r\n print(n + i_ma - i_mi - 1)\r\nelse:\r\n print(n + i_ma - i_mi - 2)", "import sys\r\n\r\na = int(input())\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nmn = 0\r\nmx = 0\r\nfor i in range(0, a):\r\n if b[mn] >= b[i]:\r\n mn = i\r\n if b[mx] < b[i]:\r\n mx = i\r\nif mn == mx:\r\n print(0)\r\nelif mn > mx:\r\n print(a - 1 + mx - mn)\r\nelse:\r\n print(mx + (a - mn) - 2)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmini = 101\r\nmaxi = 0\r\nfor i in range(n):\r\n if l[i] <= mini:\r\n mii = i\r\n mini = l[i]\r\n if l[n - i - 1] >= maxi:\r\n mai = n - i - 1\r\n maxi = l[n - i - 1]\r\nif mai < mii:\r\n print((n - mii - 1) + mai)\r\nelse:\r\n print((n - mii - 1) + mai - 1)", "n = int(input())\r\nlis = list(map(int, input().split()))\r\nmx = lis.index(max(lis))\r\nmn = n-1-lis[::-1].index(min(lis))\r\nif mx<=mn:\r\n print(mx+n-1-mn)\r\nelse:\r\n print(mx+n-2-mn)", "n = int(input())\r\na_n = [int(x) for x in input().split()]\r\nif a_n.index(max(a_n)) < abs(a_n[::-1].index(min(a_n)) - len(a_n) + 1):\r\n print(a_n.index(max(a_n)) + a_n[::-1].index(min(a_n)))\r\nelse:\r\n print(a_n.index(max(a_n)) + a_n[::-1].index(min(a_n)) -1)", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\n\r\nmax = 0\r\nmin = len(l) - 1\r\n\r\n\r\nfor i in range(n):\r\n if l[max] < l[i]:\r\n max = i\r\n\r\n\r\nfor j in range(n):\r\n if l[min] >= l[j]:\r\n min = j\r\n\r\n\r\nr = (n-1) - min\r\nr2 = max - 0\r\nif max > min:\r\n print(r + r2 -1)\r\nelse:\r\n print(r + r2)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nsec = 0\r\nminn = min(a)\r\nmini = a[::-1].index(minn)\r\nsec += mini\r\ndel a[len(a) - 1 - mini]\r\na.insert(len(a), minn)\r\nsec += a.index(max(a))\r\nprint(sec)", "n = int(input())\na = [0]*n\nstring = input()\ncount = 0\n\n\nb = string.split(\" \")\nfor x in range(n):\n a[x] = int(b[x])\n\n# print(a)\n\n\nMin = a[0]\nMax = a[0]\n\nfor x in range(n):\n if a[x] < Min:\n Min = a[x]\n if a[x] > Max:\n Max = a[x]\n# print(Min)\n# print(Max)\n\nfor x in range(n):\n if a[x] == Max:\n c = x\n while c != 0:\n a[c], a[c-1] = a[c-1], a[c]\n c = c-1\n count = count + 1\n break\nfor x in range(n):\n if a[n-x-1] == Min:\n c = n - x - 1\n while c != n-1:\n a[c], a[c+1] = a[c+1], a[c]\n c = c + 1\n count = count + 1\n break\nprint(count)\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 \r\n\r\nn=inp()\r\nsolds= inlt()\r\nma = max(solds)\r\nmi = min(solds)\r\n\r\ncount =0\r\nim=0\r\nfor i in range(0,len(solds)):\r\n if(solds[i]==ma):\r\n im=i\r\n break\r\n else:\r\n count+=1\r\npassed = False\r\nfor i in range(len(solds)-1,-1,-1):\r\n if(solds[i]==mi):\r\n if(i<im):\r\n passed=True\r\n break\r\n else:\r\n count+=1\r\nif(passed):\r\n print(count-1)\r\nelse:\r\n print(count)", "n=int(input())\r\na=map(int,input().split())\r\na=list(a)\r\nb=a.index(max(a))+a[::-1].index(min(a))\r\nprint(b-(b>=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\nn=int(input())\r\na=[0]+list(map(int,input().split()))\r\nmaxx=0;minn=101\r\nmaxp=0;minp=0\r\nfor i in range(1,n+1):\r\n if a[i]>maxx:\r\n maxx=a[i]\r\n maxp=i\r\n if a[i]<=minn:\r\n minn=a[i]\r\n minp=i\r\nans=maxp-1+n-minp\r\nif maxp<minp:\r\n print(ans)\r\nelse:\r\n print(ans-1)", "n = int(input())\r\ns = [int(j) for j in input().split()]\r\nmini = len(s) - 1 - s[::-1].index(min(s)) + 1\r\nmaxi = s.index(max(s)) + 1\r\nif mini<maxi:\r\n print(n - mini + maxi - 1 - 1)\r\nelse:\r\n print(n - mini + maxi - 1)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmina,maxa= 999,0;x=0\r\nfor i in range(n):\r\n if l[i] > maxa:maxa = l[i];imaxa=i \r\n if l[i] <= mina:mina = l[i];imina=i\r\nif imina < imaxa:x =1\r\nr = imaxa + (n-1) - imina - x \r\nprint(r)", "num = int(input())\r\nh = input().split()\r\nh = [int(i) for i in h]\r\ncount,c,i,e = 0,0,0,num-1\r\nwhile True:\r\n while i < len(h):\r\n if h[i] == max(h) and h[0] != max(h):\r\n if h[i] != h[i-1]:\r\n count += 1\r\n h[i-1],h[i] = h[i],h[i-1]\r\n i = 0\r\n i += 1\r\n while e >= 0:\r\n if h[e] == min(h) and h[num-1] != min(h) and e != num-1:\r\n if h[e] != h[e+1] :\r\n count += 1\r\n h[e+1],h[e] = h[e],h[e+1]\r\n e = num-1\r\n e -= 1\r\n if h[0] == max(h) and h[num-1] == min(h):\r\n break\r\nprint(count)", "n = int(input()) # Input the number of soldiers\r\nheights = list(map(int, input().split())) # Input the heights of the soldiers\r\n\r\nmax_height = max(heights) # Find the maximum height in the list\r\nmin_height = min(heights) # Find the minimum height in the list\r\n\r\nmax_index = heights.index(max_height) # Find the index of the maximum height\r\nmin_index = n - heights[::-1].index(min_height) - 1 # Find the index of the minimum height in the reversed list\r\n\r\nmoves = max_index + (n - 1 - min_index) # Calculate the number of moves needed\r\n\r\n# Adjust for the case where the maximum and minimum heights are at the same position\r\nif max_index > min_index:\r\n moves -= 1\r\n\r\nprint(moves)\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\nny=[]\r\nfor i in y:\r\n ny.append(i)\r\nny.sort()\r\na=ny[0]\r\nb=ny[-1]\r\nnumb=y.index(b) #numb=the sec it takes the largest number to come to the front\r\ny.remove(b)\r\ny.insert(0,b)\r\ndbi=[]\r\nfor z in range(x):\r\n if y[z]==a:\r\n dbi.append(z)\r\nnuma=dbi[-1]\r\nansa=((x-1)-numa)\r\nprint(ansa+numb)", "n = int(input())\r\nd = list(map(int, input().split()))\r\nmin_, max_ = 0, 0\r\nfor i in range(1, n):\r\n if d[i] <= d[min_]:\r\n min_ = i\r\n elif d[i] > d[max_]:\r\n max_ = i\r\nif min_ < max_:\r\n print(max_ + (n - 1 - min_) - 1)\r\nelse:\r\n print(max_ + (n - 1 - min_))", "n = int(input())\r\n\r\nar = list(map(int, input().split()))\r\n\r\ndef minimum(T):\r\n minii = T[0]\r\n for i in range(1,n):\r\n if minii >= T[i]:\r\n minii = T[i]\r\n x = i\r\n\r\n return minii,x\r\n \r\nmaxv = max(ar)\r\nok = True \r\ni = ar.index(maxv)\r\nnbs = 0\r\nwhile ok:\r\n ok = False\r\n if maxv != ar[0] and i > 0:\r\n Aux = ar[i-1]\r\n ar[i-1] = ar[i]\r\n ar[i] = Aux\r\n i -= 1\r\n nbs += 1\r\n ok = True\r\n\r\nmini,j = minimum(ar)\r\nok = True\r\nwhile ok:\r\n ok = False\r\n if mini != ar[-1] and j < n - 1:\r\n Aux = ar[j+1]\r\n ar[j+1] = ar[j]\r\n ar[j] = Aux\r\n j += 1\r\n nbs += 1\r\n ok = True\r\n\r\nprint(nbs)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nmaxx=max(a)\r\nminn=min(a)\r\nmax_index=a.index(maxx)\r\nc=a[::-1]\r\nmin_index=c.index(minn)\r\nif n-1-min_index<max_index:\r\n h=max_index+min_index-1\r\nelse:\r\n h=max_index+min_index\r\nprint(h)\r\n\r\n ", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na2 = min(a)\r\na1 = max(a)\r\nflag = True\r\nfor i in range(len(a)):\r\n if a[i] == a2:\r\n mina = i\r\n if a[i] == a1 and flag:\r\n maxa = i\r\n flag = False\r\nif mina < maxa:\r\n print(maxa + len(a) - mina - 2)\r\nelse:\r\n print(maxa + len(a) - 1 - mina)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n-1,-1,-1):\r\n if l[i]==min(l):\r\n c+=n-i-1\r\n if i<l.index(max(l)):\r\n c-=1\r\n break \r\nfor i in range(n):\r\n if l[i]==max(l):\r\n c+=i\r\n break\r\nprint(c)", "n=int(input())\r\nb=list(map(int,input().split()))\r\nminimum=min(b)\r\nmaximum=max(b)\r\ny=0\r\nc=0\r\nfor i in range(n):\r\n if b[i]==maximum:\r\n c=i\r\n break\r\nfor j in range(n):\r\n if b[j]==minimum:\r\n y=j\r\nif c > y:\r\n print(sum([n-y-1,c-1]))\r\nelse:\r\n print(sum([n-y-1,c]))\r\n", "people = int(input())\r\nline = list(map(int,input().split()))\r\nmin_idx = 0\r\nmax_moves = 0\r\nmin_moves = 0\r\nfor x in range(people):\r\n if line[x] <= line[min_idx]:\r\n min_idx = x\r\n min_moves = len(line) - 1 - min_idx\r\n if line[x] > line[max_moves]:\r\n max_moves = x\r\nif min_idx < max_moves:\r\n print(min_moves + max_moves - 1)\r\nelse:\r\n print(min_moves + max_moves) ", "n=int(input())\r\ns = input().split()\r\nfor i in range (n):\r\n s[i]=int(s[i])\r\nmax=0\r\nmaxi=0\r\nmin=101\r\nmini=1\r\nfor i in range (n):\r\n if s[i]>max:\r\n max=s[i]\r\n maxi=i\r\n if s[i]<=min:\r\n min=s[i]\r\n mini=i\r\n#print(max)\r\n#print(min)\r\n#print (maxi)\r\n#print (n-1-mini)\r\nif maxi>mini:\r\n print (maxi + (n-1-mini)-1)\r\nelse:\r\n print(maxi + (n - 1 - mini))", "def main():\r\n n = int(input())\r\n heights = list(map(int, input().split()))\r\n h = heights[0]\r\n minh = maxh = h\r\n mini = maxi = 0\r\n\r\n for i in range(1, n):\r\n h = heights[i]\r\n if h > maxh:\r\n maxh = h\r\n maxi = i\r\n if h <= minh:\r\n minh = h\r\n mini = i\r\n if mini < maxi:\r\n result = maxi + (n - 1 - mini) - 1\r\n else:\r\n result = maxi + (n - 1 - mini)\r\n\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\n# Find max\r\nupper, pos = 0, 0\r\nfor i in range(n):\r\n if heights[i] > upper:\r\n upper = heights[i]\r\n pos = i\r\nsteps = pos\r\n\r\n# Move array\r\nheights = [heights[pos]] + heights[0:pos] + heights[pos+1:n]\r\n\r\n# Find min\r\nlower, pos = upper, 0\r\nfor i in range(n):\r\n if heights[i] <= lower:\r\n lower = heights[i]\r\n pos = i\r\nsteps += n - pos -1\r\n\r\nprint(steps)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nma=0\r\nmi=0\r\nfor i in range(n):\r\n if l[i]<=l[mi]:\r\n mi=i\r\n if l[i]>l[ma]:\r\n ma=i\r\nif mi<ma:\r\n print(n-1-mi+ma-1)\r\nelse:\r\n print(n-1-mi+ma)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nmini = 0\r\nmaxi = 0\r\nminval = float('inf')\r\nmaxval = -1\r\nfor i in range(n):\r\n if arr[i] <= minval:\r\n mini = i\r\n minval = arr[i]\r\n if arr[i] > maxval:\r\n maxi = i\r\n maxval = arr[i]\r\nans = maxi - 0 + n - mini - 1\r\nif mini < maxi:\r\n ans -= 1\r\nprint(ans)", "# Hamza nachid Template\r\nimport sys\r\nfrom math import ceil\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef read_int():\r\n return int(input().strip())\r\n\r\n\r\ndef read_int_list():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef read_int_set():\r\n return set(map(int, input().split()))\r\n\r\n\r\ndef read_string():\r\n return input().strip()\r\n\r\n\r\nn=read_int()\r\nl=read_int_list()\r\nmin=min(l)\r\nmax=max(l)\r\ni=1234\r\nfor j in range(len(l)):\r\n if l[j]==min:\r\n i=j\r\nj=1234\r\nfor k in range(len(l)-1,-1,-1):\r\n if l[k]==max:\r\n j=k\r\nop=j\r\nif i > j:\r\n op+=n-i-1\r\nelse:\r\n op+=n-i-2\r\nprint(op)\r\n\r\n\r\n", "t=int(input())\r\na=[int(x) for x in input().split()]\r\nmini=1e9\r\nmaxi=-1\r\nmini_pos=0\r\nmaxi_pos=0\r\nfor i in range(t):\r\n if a[i]<=mini:\r\n mini=a[i]\r\n mini_pos=i\r\n if a[i]>maxi:\r\n maxi=a[i]\r\n maxi_pos=i\r\n\r\nif mini_pos<maxi_pos:\r\n print(t-mini_pos+maxi_pos-2)\r\nelse:\r\n print(t-mini_pos+maxi_pos-1)", "n = int(input())\ns = list(map(int, input().split()))\n\nmxi = s.index(max(s))\ns.reverse()\nmni = n - s.index(min(s)) - 1\n\nif mxi > mni:\n print(mxi + (n - mni - 2))\nelse:\n print(mxi + n -1 - mni)", "n = int(input())\r\na = list(map(int, input().split()))\r\na_1 = a.index(max(a))\r\na_2 = a.index(min(a))\r\nb_2 = min(a)\r\nfor i in range(len(a)):\r\n if a[i] == b_2 and a_2 < i:\r\n a_2 = i\r\nif len(a) == n:\r\n if a_1 > a_2:\r\n print(a_1 + (len(a) - a_2 - 1) - 1)\r\n else:\r\n print(a_1 + (len(a) - a_2 - 1))\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nb = a[:]\r\nb.reverse()\r\nu = a.index(max(a))\r\nl = n - 1 - b.index(min(a))\r\nif u > l:\r\n print(u + (n - 1 - l) - 1)\r\nelse:\r\n print(u + (n - 1 - l))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nhighest = 0\r\nlowest = 0\r\n\r\nfor i in range(n):\r\n if a[i] > a[highest]:\r\n highest = i\r\n if a[i] <= a[lowest]:\r\n lowest = i\r\n\r\nlowest += 1\r\n\r\nif highest < lowest:\r\n highest += 1\r\n\r\nres = n - lowest\r\nres += highest - 1\r\n\r\nprint(res)", "u = int(input())\r\nlistA = list(map(int,input().split(\" \")))\r\nNumMax = max(listA)\r\nNumMin = min(listA)\r\nmaxList = []\r\nfor i in range(u):\r\n if listA[i]==NumMax:\r\n maxList.append(i)\r\nPosMax = min(maxList) +1 \r\nminList = []\r\nfor i in range(u):\r\n if listA[i]==NumMin:\r\n minList.append(i)\r\nPosMin = max(minList) + 1\r\nans1 = PosMax - 1\r\nans2 = u - PosMin\r\nif PosMax>PosMin:\r\n print(ans1+ans2-1)\r\nelse:\r\n print(ans1+ans2)", "x = int(input())\r\ny = list(map(int, input().split()))\r\na ,b = y.index(max(y)),x - y[::-1].index(min(y)) - 1\r\nif b > a:\r\n print(a + x - b - 1)\r\nelse:\r\n print(a + x - b - 2)", "import sys\r\nnum = int(sys.stdin.readline().strip())\r\nlst = sys.stdin.readline().strip().split()\r\n# print(lst)\r\nlst1 = map(int, lst)\r\nmp = list(lst1)\r\n# print(mp)\r\nmaxi = max(mp)\r\nmini = min(mp)\r\n# print(maxi)\r\n# print(mini)\r\nmaxi_inx = []\r\nmini_inx = []\r\nfor i in range(len(mp)):\r\n if mp[i] == maxi:\r\n maxi_inx.append(i)\r\n if mp[i] == mini:\r\n mini_inx.append(i)\r\n# print(maxi_inx)\r\n# print(mini_inx)\r\nif min(maxi_inx) < max(mini_inx):\r\n summ = min(maxi_inx) + len(lst) - (max(mini_inx) + 1)\r\n print(summ)\r\nelse:\r\n summ = min(maxi_inx) + len(lst) - (max(mini_inx) + 1) - 1\r\n print(summ)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nmaxx=0\r\nminn=999\r\nmax_index=0\r\nmin_index=0\r\nfor i in range (len(s)):\r\n if s[i]>maxx:\r\n maxx=s[i]\r\n max_index=i+1\r\nfor i in range (len(s),0,-1):\r\n if s[i-1]<minn:\r\n minn=s[i-1]\r\n min_index=i\r\nc1=0\r\nc2=0\r\nstate=1\r\nif max_index<min_index:\r\n state=0\r\nif max_index==1 and min_index==len(s):\r\n print('0')\r\nelse:\r\n while min_index!=len(s):\r\n c1+=1\r\n min_index+=1\r\n while max_index!=1:\r\n c2+=1\r\n max_index-=1\r\n if state==0:\r\n ans=c1+c2\r\n print(ans)\r\n else:\r\n ans=c1+c2-1\r\n print(ans)\r\n \r\n", "# 144A - Arrival Of The General\r\n# https://codeforces.com/problemset/problem/144/A\r\n\r\n# Inputs:\r\n# 1) Número de soldados\r\n# 2) Altura de soldados\r\nsoldados = int(input())\r\nalturas = list(map(int, input().split()))\r\n\r\n# Altura del soldado más alto\r\naltura_alto = max(alturas)\r\n\r\n# Altura del soldado más bajo\r\naltura_bajo = min(alturas)\r\n\r\n# Posición del soldado más alto\r\n# Se asume que la peor posición posible es al final\r\nposicion_alto = len(alturas)-1\r\n\r\n# Posición del soldado más bajo\r\n# Se asume que la peor posición posible es al inicio\r\nposicion_bajo = 0\r\n\r\nfor posicion_soldado in range(len(alturas)-1, -1, -1):\r\n\r\n # ¿El soldado actual tiene la altura máxima?\r\n if alturas[posicion_soldado] == altura_alto:\r\n\r\n # ¿El soldado está más cerca del inicio?\r\n if posicion_soldado < posicion_alto:\r\n\r\n # Actualiza la posición del soldado con la altura más alta más cercana al inicio\r\n posicion_alto = posicion_soldado\r\n\r\nfor posicion_soldado in range(0,len(alturas)):\r\n\r\n # ¿El soldado actual tiene la altura máxima?\r\n if alturas[posicion_soldado] == altura_bajo:\r\n\r\n # ¿El soldado está más cerca del inicio?\r\n if posicion_soldado > posicion_bajo:\r\n\r\n # Actualiza la posición del soldado con la altura más alta más cercana al inicio\r\n posicion_bajo = posicion_soldado\r\n\r\n# Durante los intercambios, ¿el soldado más alto y más bajo cambian de lugar entre si?\r\n# Si cambian de lugar, entonces el intercambio le ahorrará 1 segundo a alguno de los dos\r\ncruce_alto_bajo = 0\r\n\r\n# Si el soldado más alto está a la derecha del soldado más bajo, entonces intercambiarán lugares entre sí\r\nif posicion_alto > posicion_bajo:\r\n cruce_alto_bajo = 1\r\n\r\n# Calcula el número de segundos para mover al soldado más alto al inicio y al más bajo al final\r\nsegundos = posicion_alto + (len(alturas) - 1 - posicion_bajo) - cruce_alto_bajo\r\n\r\n# Imprime los segundos transcurridos\r\nprint(segundos)\r\n\r\n\r\n\r\n", "t = int(input())\r\nl = list(map(int, input().split()))\r\nn = len(l)\r\na = max(l)\r\np = l.index(a)\r\nx= l\r\nx.reverse()\r\nb= min(x)\r\nf = x.index(b)\r\nq = n-1-(x.index(b))\r\nif(p<q):\r\n print(p+f)\r\nif(p>=q):\r\n print(p+f-1)", "n = int(input())\r\nlistA = list(map(int,input().split(\" \")))\r\nnumMax = max(listA)\r\nnumMin = min(listA)\r\nmaxList = []\r\nfor i in range(n):\r\n if listA[i]==numMax:\r\n maxList.append(i)\r\nposMax = min(maxList) +1 \r\nminList = []\r\nfor i in range(n):\r\n if listA[i]==numMin:\r\n minList.append(i)\r\nposMin = max(minList) + 1\r\n \r\nans1 = posMax - 1\r\nans2 = n - posMin\r\nif posMax>posMin:\r\n print(ans1+ans2-1)\r\nelse:\r\n print(ans1+ans2)", "# Version 16.0\r\ndef main() -> None:\r\n # 2023-07-17 00:06:43\r\n # high leftmost, low rightmost\r\n\r\n\r\n def max_min(l):\r\n high = [None,float('-inf')] # idx, val\r\n low = [None,float('inf')] # idx, val\r\n for idx,i in enumerate(l):\r\n if i > high[1] : high[1] = i; high[0] = idx\r\n if i < low[1] : low[1] = i; low[0] = idx\r\n return high,low\r\n\r\n length = ii()\r\n l = li()\r\n collected = max_min(l) # max, min\r\n counter = 0 # main counter\r\n\r\n idx = collected[0][0]\r\n while idx != 0:\r\n # swap idx and idx -1\r\n l[idx-1],l[idx] = l[idx],l[idx-1]\r\n idx-=1\r\n counter+=1\r\n \r\n\r\n smallest = l[::-1].index(collected[1][1])\r\n idx = length-1-smallest\r\n \r\n while idx != length - 1:\r\n l[idx+1],l[idx] = l[idx],l[idx+1]\r\n idx+=1\r\n counter+=1\r\n p(counter)\r\n \r\n\r\n\r\n\r\n \r\nif __name__ == \"__main__\":\r\n import os,sys,math,itertools;from collections import deque,defaultdict,OrderedDict,Counter\r\n from bisect import bisect,bisect_left,bisect_right,insort\r\n from heapq import heapify,heappush,heappop,nsmallest,nlargest,heapreplace, heappushpop\r\n ii,si=lambda:int(input()),lambda:input() \r\n mi,msi=lambda:map(int,input().strip().split(\" \")),lambda:map(str,input().strip().split(\" \")) \r\n li,lsi=lambda:list(mi()),lambda:list(msi())\r\n out,export,p,pp=[],lambda:print('\\n'.join(map(str, out))),lambda x :out.append(x),lambda array:p(' '.join(map(str,array)))\r\n try:exec('from hq import L,LT,see,info,cmdIO,_generator_\\nline=[cmdIO(),main(),export(),_generator_()]\\nfor l in line:l')\r\n except(FileNotFoundError,ModuleNotFoundError):main();export()", "n = int(input())\r\np = list(map(int, input().split()))\r\nc = 0\r\nx, y = min(p), max(p)\r\nix, iy = 0, p.index(y)\r\n\r\nfor e, i in enumerate(p):\r\n if i == x:\r\n ix = e\r\n\r\nif ix < iy:\r\n c = ((n-1)-ix) + iy - 1\r\nelse:\r\n c = ((n-1)-ix) + iy \r\n\r\nprint(c)", "n = int(input())\r\na = input()\r\nl = a.split(' ')\r\nl = [int(s) for s in l]\r\nx = l.index(max(l))\r\ncount1 = 0\r\ncount2 = 0\r\nwhile x>0 :\r\n l[x], l[x-1] = l[x-1],l[x]\r\n count1 += 1\r\n x = x-1\r\ny = l.index(min(l))\r\ncount = 0\r\nfor i in l:\r\n if i==min(l):\r\n count += 1\r\nfor i in range(0,count-1):\r\n l.remove(min(l))\r\ny = l.index(min(l))\r\nwhile y<(n-count) :\r\n l[y], l[y+1] = l[y+1],l[y]\r\n count2 += 1\r\n y = y+1\r\nprint(count1 + count2)", "a=int(input())\r\n*b,=map(int,input().split())\r\nk=b.index(max(b))+b[::-1].index(min(b))\r\nprint(k-1 if k>=a else k)", "n = int(input())\r\nsoldiers = list(map(int, input().split()))\r\ncount_moves_max = 0\r\ncount_moves_min = 0\r\nloopi = True\r\nwhile loopi:\r\n if soldiers[0] != max(soldiers):\r\n i = soldiers.index(max(soldiers))\r\n soldiers[i], soldiers[i - 1] = soldiers[i - 1], soldiers[i]\r\n count_moves_max += 1\r\n else:\r\n loopi = False\r\n\r\nloopf = True\r\nsoldiers.reverse()\r\nwhile loopf:\r\n if soldiers[0] != min(soldiers):\r\n i = soldiers.index(min(soldiers))\r\n soldiers[i], soldiers[i - 1] = soldiers[i - 1], soldiers[i]\r\n count_moves_min += 1\r\n else:\r\n loopf = False\r\n\r\nprint(count_moves_max + count_moves_min)", "l = int(input())\r\ns = list(map(int, input().split(\" \")))\r\nMax = s.index(max(s))\r\nMin = s[::-1].index(min(s))\r\nsteps = Max + Min\r\nprint(steps-(steps>=l))", "n = int(input())\r\n\r\nheight_list = list(map(int, input().split()))\r\n\r\nx = []\r\ny = []\r\n\r\nfor i in range(len(height_list)):\r\n try:\r\n if i == height_list.index(max(height_list), i):\r\n x.append(i)\r\n except ValueError:\r\n continue\r\n \r\nfor i in range(len(height_list)):\r\n try:\r\n if i == height_list.index(min(height_list), i):\r\n y.append(i)\r\n except ValueError:\r\n continue\r\n\r\nmax_index = min(x)\r\nmin_index = max(y)\r\n\r\nif max_index < min_index:\r\n min_moves = abs(0-max_index) + abs(n-1-min_index)\r\n \r\nelse:\r\n min_moves = abs(0-max_index) + abs(n-1-min_index) - 1\r\n\r\nprint(min_moves)", "a = int(input())\r\nq = list(map(int, input().split()))\r\nmn = min(q)\r\nmx = max(q)\r\nmn1 = 0\r\nmx1 = 0\r\nfor i in range(a - 1, -1, -1):\r\n if q[i] == mn:\r\n mn1 = i\r\n break\r\n else:\r\n continue\r\nfor k in range(a):\r\n if q[k] == mx:\r\n mx1 = k\r\n break\r\n else:\r\n continue\r\nif mn1 < mx1:\r\n print ((mx1 - 1) + (a - mn1 - 1))\r\nelse:\r\n print (mx1 + (a - 1 - mn1))", "n = int(input())\r\nmax_value = 0\r\nmin_value = 1000\r\nmax_index = 0\r\nmin_index = 0\r\nx = list(map(int,input().split()))\r\nfor i in range(len(x)):\r\n \r\n \r\n if x[i] > max_value:\r\n max_index = i\r\n max_value = x[i]\r\n\r\n if x[i] <= min_value:\r\n min_index = i\r\n min_value = x[i]\r\n\r\nif max_index > min_index:\r\n print((max_index - 1) + (n - min_index) - 1)\r\nelse:\r\n print((max_index - 1) + (n - min_index))\r\n", "x,*y=map(int,open(0).read().split())\r\nb=y.index(max(y))+y[::-1].index(min(y))\r\nprint(b-(b>=x))", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmaxIndex = 0\r\nminIndex = n - 1\r\n\r\nfor i in range(n):\r\n if arr[i] > arr[maxIndex]:\r\n maxIndex = i\r\n if arr[i] <= arr[minIndex]:\r\n minIndex = i\r\n\r\nswaps = maxIndex + (n - 1 - minIndex)\r\nif minIndex < maxIndex:\r\n swaps -= 1\r\n\r\nprint(swaps)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx = -99\r\ncx = 0\r\nmn = 99\r\ncn = 0\r\nsn = 0\r\nsx = 0\r\n\r\nfor i in range(n):\r\n if (a[i]>mx):\r\n mx = a[i]\r\n cx = i\r\n if (a[i]<=mn):\r\n mn = a[i]\r\n cn = i\r\n\r\nsn = n - 1 - cn\r\nsx = cx\r\n\r\nif (cn<cx):\r\n sn -= 1\r\n\r\nprint(sx+sn)", "n=int(input())\na=list(map(int,input().split()))\ns=0\nmx_i=0\nmn_i=0\nmx=max(a)\nmn=min(a)\nfor i in range(n):\n if a[i]==mx:\n mx_i=i\n break\nfor i in range(n-1,-1,-1):\n if a[i]==mn:\n mn_i=i\n break\nif mx_i<mn_i:\n s=mx_i+n-1-mn_i\nelse:\n s=mx_i+n-2-mn_i\nprint(s)", "n = int(input())\r\nline = [int(s) for s in input().split()]\r\npos_max = line.index(max(line))\r\npos_min = 0\r\nfor i in range(n):\r\n if line[i] <= line[pos_min]:\r\n pos_min = i\r\nflag = pos_max > pos_min\r\nprint(pos_max+n-1-pos_min-flag)", "n = int(input())\r\ns = [int(x) for x in input().split()]\r\n\r\na = max(s)\r\nb = min(s)\r\nx = s.index(a)\r\ns.reverse()\r\ny = n - 1 - s.index(b)\r\n\r\n\r\nif x > y:\r\n print(abs(x - 0) + abs((n - 1)- y) - 1)\r\nelse:\r\n print(abs(x - 0) + abs((n - 1)- y))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nidx=arr.index(max(arr))\r\nmaxi=max(arr)\r\ns=0\r\ni=n-1\r\nwhile i>=0:\r\n if (arr[i]==maxi):\r\n idx=i \r\n i-=1\r\nwhile idx!=0:\r\n arr[idx-1],arr[idx]=arr[idx],arr[idx-1]\r\n idx=idx-1\r\n s+=1\r\n# print(arr)\r\nmini=min(arr)\r\nidx=arr.index(min(arr))\r\ni=0\r\nwhile i<len(arr):\r\n if arr[i]==mini:\r\n idx=i \r\n i+=1\r\nwhile idx!=n-1:\r\n if arr[idx]==arr[idx+1]:\r\n idx=idx+1\r\n else:\r\n arr[idx+1],arr[idx]=arr[idx],arr[idx+1]\r\n idx=idx+1 \r\n s+=1\r\n # print(arr)\r\nprint(s)\r\n \r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmini = min(a)\r\nmaxi = max(a)\r\n\r\n\r\nimini = len(a) - a[::-1].index(mini) - 1\r\nimaxi = a.index(maxi)\r\n\r\nif imini < imaxi:\r\n print(imaxi + n - imini - 2)\r\nelse:\r\n print(imaxi + n - imini - 1)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nmini = a[0]\r\nmaxi = a[0]\r\nimin = 0\r\nimax = 0\r\n\r\nfor i in range(n):\r\n if maxi < a[i]:\r\n maxi = a[i]\r\n imax = i\r\n if mini >= a[i]:\r\n mini = a[i]\r\n imin = i\r\n\r\nif imax > imin:\r\n imin = (n - 1) - imin\r\n print(imin + imax - 1)\r\nelse:\r\n imin = (n - 1) - imin\r\n print(imin + imax)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmax_e=0\r\nmax_i=0\r\nmin_e=105\r\nmin_i=0\r\nfor i in range(len(l)):\r\n if l[i]>max_e:\r\n max_i=i\r\n max_e=l[i]\r\n if l[i]<=min_e:\r\n min_i=i\r\n min_e=l[i]\r\n#print(max_e,max_i,min_e,min_i)\r\nif max_i<min_i:\r\n print((max_i-1)+(n-min_i))\r\nelse:\r\n print((max_i-1)+(n-min_i)-1)\r\n ", "n=int(input())\r\na=input()\r\nb=[]\r\na=a.split()\r\nfor i in a:\r\n b.append(int(i))\r\n\r\nn1=len(b)\r\nM=max(b)\r\nm=min(b)\r\nMi=b.index(M)\r\nmi=n1-1-(b[::-1].index(m))\r\n\r\nif Mi-mi>0:\r\n print(n1-1-mi+Mi-1)\r\nelse:\r\n print(n1-1-mi+Mi)", "_ = input()\r\ns = list(map(int, input().split()))\r\nn = len(s)\r\nz = n - 1 + s.index(max(s)) - (n - 1 - s[::-1].index(min(s)))\r\n\r\nif n > z:\r\n print(z)\r\nelse:\r\n print(z -1)", "size=int(input())\r\narr=list(map(int, input().split()))\r\nmi_array=arr[0]\r\nma_array=arr[0]\r\nmi_i=0\r\nma_i=0\r\nfor i in range(1,size):\r\n if arr[i] >ma_array:\r\n ma_array= arr[i]\r\n ma_i = i\r\n if arr[i] <=mi_array:\r\n mi_array= arr[i]\r\n mi_i = i\r\nans=ma_i + (size-1-mi_i)-(mi_i < ma_i)\r\nprint(ans)\r\n", "n = int(input())\r\nsoldiers = list(map(int, input().split(\" \")))\r\nsoldiers_ = []\r\ncont = 0\r\n\r\nif soldiers[0] == max(soldiers) and soldiers[-1] == min(soldiers):\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n if soldiers[i] == max(soldiers):\r\n max_soldier_ = soldiers[i]\r\n soldiers.remove(max_soldier_)\r\n soldiers.insert(0, max_soldier_)\r\n cont += i\r\n break\r\n\r\n soldiers.reverse()\r\n\r\n for j in range(n):\r\n if soldiers[j] == min(soldiers):\r\n if j == n:\r\n cont += 0\r\n break\r\n else:\r\n cont += j\r\n break\r\n\r\n print(cont)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmi = min(arr)\r\nma = max(arr)\r\nmin_ind, max_ind = 0, 0\r\nfor i in range(n-1, -1, -1):\r\n if arr[i] == mi:\r\n min_ind = i\r\n break\r\nfor i in range(0, n):\r\n if arr[i] == ma:\r\n max_ind = i\r\n break\r\n# print(min_ind, max_ind)\r\nif max_ind > min_ind:\r\n print(max_ind + n - 2 - min_ind)\r\nelse:\r\n print(max_ind + n - 1 - min_ind)", "num_of_soldiers = int(input())\r\n#height_of_soldiers = list(map(int, input().split()))\r\nmax_value = 0\r\nmin_value = 1000\r\nmax_index = 0\r\nmin_index = 0\r\n\r\nsoldiers_Height = list(map(int, input().split()))\r\n\r\nfor i in range(len(soldiers_Height)):\r\n if soldiers_Height[i] > max_value:\r\n max_index = i\r\n max_value = soldiers_Height[i]\r\n if soldiers_Height[i] <= min_value:\r\n min_index = i\r\n min_value = soldiers_Height[i]\r\n\r\nif max_index > min_index:\r\n answer = max_index + (num_of_soldiers - min_index) - 2\r\nelse:\r\n answer = max_index + (num_of_soldiers - min_index) - 1\r\n\r\nprint(answer)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nsize = len(a)\r\nsmallest = float('inf')\r\nbiggest = float('-inf')\r\nsmallest_index = None\r\nbiggest_index = None\r\n\r\nfor i in range(size):\r\n if a[i] > biggest:\r\n biggest = a[i]\r\n biggest_index = i \r\n if a[i] <= smallest:\r\n smallest, smallest_index = a[i], i\r\n\r\nans = 0\r\nif smallest_index < biggest_index:\r\n ans = -1\r\n\r\nans += abs(size - 1 - smallest_index) + biggest_index\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "a=int(input())\r\nc=map(int,input().split(\" \"))\r\n\r\nlista=list(c)\r\n\r\n\r\nlistarev=lista[::-1]\r\n\r\nlM=lista.index(max(lista))\r\nlm=listarev.index(min(listarev))\r\n\r\nif lista.index(max(lista))>len(lista)-1-listarev.index(min(listarev)):\r\n print(lM+lm-1)\r\nelse:\r\n print(lM+lm)", "n = int(input())\r\ns = [int(el) for el in input().split()]\r\nmaxim = max(s)\r\nminim = min(s)\r\nimx = s.index(maxim)\r\nimn = s[::-1].index(minim)\r\nprint(imx+imn-(imx+imn>=n))", "n = int(input())\r\nh = list(map(int, input().split()))\r\nh_min = 100\r\nh_max = 0\r\ni_min = 0\r\ni_max = 100\r\nfor i in range(n):\r\n if h[i] > h_max:\r\n h_max = h[i]\r\n i_max = i\r\n if h[i] <= h_min:\r\n h_min = h[i]\r\n i_min = i\r\nif i_max < i_min:\r\n a = i_max + (n - i_min - 1)\r\nelse:\r\n a = i_max + (n - i_min - 2)\r\nprint(a)", "\n\ndef iMin(a):\n im = len(a) - 1\n for i in range(len(a) - 1, -1, -1):\n if a[im] > a[i]:\n im = i\n return im\n\ndef iMax(a):\n im = 0\n for i in range(len(a)):\n if a[im] < a[i]:\n im = i\n return im\n\nn = int(input())\na = list(map(int, input().split()))\n\nif n == 1:\n print(0)\n exit(0)\n\nim = iMin(a)\niM = iMax(a)\n\nif iM < im:\n print(iM - 0 + len(a) - 1 - im)\nelif im < iM:\n print(iM - 0 + len(a) - 1 - im - 1)\n\n\n", "n=int(input());l=list(map(int,input().split()))\r\ns=l.index(max(l))+l[::-1].index(min(l))\r\nprint(s-(s>=n))", "n = int(input())\na = [int(i) for i in input().split()]\nmaxn = max(a)\nmaxn = a.index(maxn)\nfor i in range(maxn, 0, -1):\n a[i], a[i-1] = a[i-1], a[i]\nb = [a[len(a)-1]]\nfor i in range(len(a)-1, 0, -1):\n b.append(a[i-1])\nminn = min(b)\nminn = b.index(minn)\nsteps = maxn+minn\nprint(steps)\n\t\t\t\t \t \t \t\t\t\t \t\t\t\t\t\t \t\t \t", "\r\n\r\nn = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\n\r\n\r\nmaxi_idx = 0 \r\nmaxi_ele = nums[0]\r\n\r\nmini_ele = nums[0]\r\nmini_idx = 0 \r\n\r\n\r\nfor i in range(n):\r\n curr = nums[i]\r\n if curr <= mini_ele :\r\n mini_ele = curr \r\n mini_idx = i \r\n \r\n if curr > maxi_ele :\r\n maxi_ele = curr \r\n maxi_idx = i \r\n \r\nans = maxi_idx + (n - mini_idx - 1)\r\nif mini_idx < maxi_idx :\r\n ans -= 1 \r\nprint(ans)\r\n\r\n", "n=input()\nn=int(n)\n\nlist=list(map(int,input().split()))\n\nmx=0\nmn=1000000000000\nposMx=0\nposMn=0\n\nfor i in range(n):\n if list[i]<=mn:\n mn=list[i]\n posMn=i\n if list[i]>mx:\n mx=list[i]\n posMx=i\n\n\n\nans=(n-1)-posMn + posMx\nif posMx>posMn :\n ans-=1\n\nprint(ans)\n\n\n\t\t \t\t\t\t\t\t \t \t\t\t\t\t\t\t\t\t\t\t\t \t", "n = int(input())\r\nsoldiers = list(map(int, input().split()))\r\n\r\nmost_tall = max(soldiers)\r\nmost_short = min(soldiers)\r\n\r\ntall_index = soldiers.index(most_tall)\r\nsoldiers.insert(0,most_tall,)\r\ndel soldiers[tall_index + 1]\r\n\r\n\r\nshort_index = soldiers.index(most_short)\r\ncoun = soldiers.count(most_short)\r\nif coun == 1:\r\n short_index = soldiers.index(most_short)\r\n soldiers.append(most_short)\r\n del soldiers[short_index]\r\n ans1 = tall_index + ((n-short_index)-1)\r\n print(ans1)\r\nelse:\r\n index = soldiers.index(most_short)\r\n x=0\r\n while x < coun -1:\r\n index += 1\r\n index = soldiers.index(most_short,index)\r\n x += 1\r\n \r\n \r\n soldiers.append(most_short)\r\n del soldiers[index]\r\n ans2 = tall_index + ((n-index)-1)\r\n print(ans2)\r\n\r\n\r\n", "def line_up_soldiers(soldiers):\r\n first_max = soldiers[0]\r\n first_max_index = 0\r\n last_min = soldiers[0]\r\n last_min_index = 0\r\n for i in range(len(soldiers)):\r\n if soldiers[i] > first_max:\r\n first_max = soldiers[i]\r\n first_max_index = i\r\n elif soldiers[i] <= last_min:\r\n last_min = soldiers[i]\r\n last_min_index = i\r\n seconds = first_max_index + len(soldiers) - last_min_index - 1\r\n if first_max_index > last_min_index:\r\n seconds -= 1\r\n return seconds\r\n\r\nn = int(input())\r\nprint(line_up_soldiers(soldiers=[int(item) for item in input().split()]))", "t = int(input())\r\nli=list(map(int,input().split()))\r\np=min(li)\r\nq=max(li)\r\nr=[]\r\ns=[]\r\nif li[1:]==li[:-1]:\r\n print(0)\r\nelse:\r\n for i in range(0,t):\r\n if(li[i]==p):\r\n r.append(i)\r\n elif(li[i]==q):\r\n s.append(i)\r\n \r\n m=max(r)\r\n n=min(s)\r\n if(m<n):\r\n print(n+t-m-2)\r\n else:\r\n print(n+t-m-1)\r\n\r\n \r\n \r\n ", "n,x=input(),list(map(int,input().split()))\r\ni=x.index(max(x))\r\ny=x+[]\r\na=b=0\r\nwhile i>0: y[i],y[i-1]=y[i-1],y[i];i,a=i-1,a+1\r\ny=y[::-1]\r\ni=y.index(min(y))\r\nwhile i>0: y[i],y[i-1]=y[i-1],y[i];i,a=i-1,a+1\r\ny=x[::-1]\r\ni=y.index(min(x))\r\nwhile i>0: y[i],y[i-1]=y[i-1],y[i];i,b=i-1,b+1\r\ny=y[::-1]\r\ni=y.index(max(y))\r\nwhile i>0: y[i],y[i-1]=y[i-1],y[i];i,b=i-1,b+1\r\nprint(min(a,b))", "a = int(input())\nb = input()\n\nlist_soldiers = map(int, b.split(' '))\n\nmin_hieght = None\nmax_hieght = None\nmin_hieght_index = None\nmax_hieght_index = None\nfor i, hieght in enumerate(list_soldiers):\n\tif min_hieght == None:\n\t\tmin_hieght =hieght\n\t\tmax_hieght = hieght\n\t\tmin_hieght_index = i\n\t\tmax_hieght_index = i\n\tif hieght < min_hieght:\n\t\tmin_hieght = hieght\n\t\tmin_hieght_index = i\n\telif hieght == min_hieght:\n\t\tif i > min_hieght_index:\n\t\t\t\tmin_hieght_index = i\n\tif hieght > max_hieght:\n\t\tmax_hieght = hieght\n\t\tmax_hieght_index = i\n\telif hieght == max_hieght:\n\t\tif i < max_hieght_index:\n\t\t\t\tmax_hieght_index = i\nprint(max_hieght_index + a - min_hieght_index - 1 - (1 if min_hieght_index < max_hieght_index else 0))\n\n", "# URL: https://codeforces.com/problemset/problem/144/A\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\nn = int(inp())\na = list(map(int, inp().split()))\nmaxp = a.index(max(a))\nminp = a[::-1].index(min(a))\nprint(maxp + minp - (n - minp - 1 < maxp))\n", "n = int(input())\r\nsoldiers = list(map(int, input().split()))\r\nindex_max = soldiers.index(max(soldiers))\r\nindex_min = len(soldiers) - 1 - soldiers[::-1].index(min(soldiers))\r\n\r\nif index_min < index_max:\r\n print(index_max + (len(soldiers) - 1) - index_min - 1)\r\nelse:\r\n print(index_max + (len(soldiers) - 1) - index_min)", "n=int(input());l=list(map(int,input().split()))\r\nbl=l.index(max(l))+l[::-1].index(min(l))\r\nprint(bl-(bl>=n))", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nlargest = 0\r\nsmallest = 0\r\n\r\nfor i in range(n):\r\n if arr[i] > arr[largest]:\r\n largest = i\r\n if arr[i] <= arr[smallest]:\r\n smallest = i\r\n\r\nif largest < smallest:\r\n res = largest + (n - smallest - 1)\r\nelif largest > smallest:\r\n res = largest + (n - smallest - 1) - 1\r\nelse:\r\n res = 0\r\nprint(res)", "n = int(input())\r\ns = 0\r\nlst = [int(i) for i in input().split()]\r\n\r\nif max(lst) == lst[0] and min(lst) == lst[-1]:\r\n print(s)\r\nelse:\r\n\r\n imx = lst.index(max(lst))\r\n mx = max(lst)\r\n mn = min(lst)\r\n while imx != 0:\r\n s += 1\r\n lst[imx] = lst[imx - 1]\r\n imx -= 1\r\n\r\n lst.reverse()\r\n imn = (lst.index(min(lst)) + 1) * -1\r\n while imn != -1:\r\n imn += 1\r\n s += 1\r\n\r\n print(s)\r\n\r\n", "x,*v=map(int,open(0).read().split())\r\nf=v.index(max(v))+v[::-1].index(min(v))\r\nprint(f-(f>=x))\r\n#HI CODEFORCES\r\n#", "n=int(input())\r\nk=list(map(int,input().split()))\r\nminimum=min(k)\r\nmaximum=max(k)\r\nindmin=[]\r\nindmax=[]\r\nfor i in range(n):\r\n if minimum==k[i]:\r\n indmin.append(i)\r\n if maximum==k[i]:\r\n indmax.append(i)\r\nc=d=0\r\n# print(indmin,indmax)\r\nmi=indmin[-1]\r\nma=indmax[0]\r\nif mi<ma:\r\n print((n-1-mi)+(ma-1))\r\nelse:\r\n print((n-1-indmin[-1])+ma)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb = a[:]\r\nb.reverse()\r\nu = a.index(max(a))\r\nl = n-1-b.index(min(a))\r\nif u > l:\r\n print(u+(n-1-l)-1)\r\nelse:\r\n print(u+(n-1-l))", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx = max(a)\r\nmn = min(a)\r\ninn = []\r\nixx = []\r\nans = 0\r\nfor i in range(n):\r\n if a[i] == mx:\r\n ixx.append(i)\r\n if a[i] == mn:\r\n inn.append(i)\r\n\r\nfor i in range(n):\r\n if a[i] == mx:\r\n if i == min(ixx):\r\n ans += i\r\n if a[i] == mn:\r\n if i == max(inn):\r\n ans += n - i - 1\r\nif max(inn) < min(ixx):\r\n ans += -1\r\n\r\nprint(abs(ans))\r\n", "m = int(input())\r\nn = list(map(int, input().split()))\r\n\r\nb=n.index(max(n))+n[::-1].index(min(n))\r\n\r\nif b>=m:\r\n b-=1\r\nprint(b)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = l.index(max(l))+l[::-1].index(min(l))\r\nprint(s-(s>=n))", "def main():\n num_soldiers = int(input())\n lst = input().split()\n minimum = 101\n maximum = 0\n idx_min = 0\n idx_max = 0\n for i in range(len(lst)):\n lst[i] = int(lst[i])\n if lst[i] <= minimum:\n minimum = lst[i]\n idx_min = i\n if maximum < lst[i]:\n maximum = lst[i]\n idx_max = i\n if idx_min < idx_max:\n subtract_by = 2\n else:\n subtract_by = 1\n print(idx_max + num_soldiers - subtract_by - idx_min)\nmain()\n", "n = int(input())\r\nx = input().split()\r\nx = list(map(int, x))\r\nmx = max(x)\r\nmn = min(x)\r\nitmx = 0\r\nitmn = 0\r\npozmn = 0\r\npozmx = 0\r\nfor i in range(n):\r\n if x[i] == mx:\r\n itmx = i\r\n pozmx = i\r\n break\r\nfor i in range(n):\r\n if x[i] == mn:\r\n itmn = n - 1 - i\r\n pozmn = i\r\nif pozmx > pozmn:\r\n itmx -= 1\r\nprint(itmx + itmn)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmx=max(a)\r\nmn=min(a)\r\nind_mx=a.index(mx)\r\nind_mn=0\r\nfor i in range(n-1,-1,-1):\r\n if(a[i]==mn):\r\n ind_mn+=1\r\n break\r\n ind_mn+=1\r\n \r\nif(n-ind_mn<ind_mx):\r\n print(ind_mx+(ind_mn-2))\r\nelse:\r\n print(ind_mx+ind_mn-1)", "n=int(input())\r\nsoldiers=list(map(int,input().split()))\r\nreverse=soldiers[::-1]\r\nmaxpositon=soldiers.index(max(soldiers))\r\nminpositon=reverse.index(min(soldiers))\r\nif 2+maxpositon+minpositon>n:\r\n print(maxpositon+minpositon-1)\r\nelse:\r\n print(maxpositon+minpositon)", "number = int(input())\narrangement = list(map(int, input().split()))\nmoves = 0\n\nmini = min(arrangement)\nmaxi = max(arrangement)\nlocationmax = arrangement.index(maxi)\n\nfor i in range(number-1 ,-1,-1):\n if arrangement[i] == min(arrangement):\n locationmini = i+1\n break\nif locationmax>=locationmini:\n moves = locationmax + (number - locationmini - 1)\nelse:\n moves= locationmax + (number - locationmini)\nprint(moves)\n", "a,*b=map(int,open(0).read().split())\r\nn=b.index(max(b))+b[::-1].index(min(b))\r\nprint(n-(n>=a))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmaxInd = l.index(max(l))\r\nminEle = l[-1]\r\nminInd = n - 1\r\n\r\nfor i in range(n - 2, -1, -1):\r\n if l[i] < minEle:\r\n minEle = l[i]\r\n minInd = i\r\n\r\na = n - minInd - 1\r\nb = maxInd\r\nif minInd < maxInd:\r\n a -= 1\r\nprint(a + b)", "n = int(input())\r\nline = list(map(int, input().split()))\r\nminimum = min(line)\r\nmaximum = max(line)\r\ncount = line.index(maximum)\r\nline.pop(count)\r\nline.insert(0, maximum)\r\nline.reverse()\r\ncount += line.index(minimum)\r\nprint(count)\r\n", "numbers=int(input())\r\nlist_=list(map(int,input().split()))\r\nmax_=max(list_)\r\nmax_index=list_.index(max_)+1\r\ndiff_max=max_index-1\r\nmin_=min(list_)\r\nmin_index=(len(list_) - list_[-1::-1].index(min_) - 1)+1\r\ndiff_min=numbers-min_index\r\nif(min_index<max_index):\r\n diff_max-=1\r\nprint(diff_max+diff_min) ", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nc=max(a)\r\nd=a.index(c)\r\ne=d\r\ndel a[d]\r\na.insert(0,c)\r\nq=min(a)\r\nfor i in range(n):\r\n if a[i]==q:\r\n k=i \r\np=n-k-1\r\nprint(e+p)\r\n\r\n\r\n", "n=input()\nn=int(n)\nlist=list(map(int,input().split()))\n\n\nmx=list[0]\nposmx=0\nmn=list[0]\nposmn=0\n\nfor i in range(0,n,1):\n if list[i]>mx:\n mx=list[i]\n posmx=i\n if list[i]<=mn:\n mn=list[i]\n posmn=i\n\nans= posmx + ((n-1)-posmn)\nif posmx >posmn:\n ans-=1\nprint(ans)\n\t\t \t\t \t\t\t \t \t\t\t \t \t\t\t\t \t\t", "n = int(input())\r\nlist = list(map(int, input().split()))\r\nmax = max(list)\r\nsec = 0\r\n\r\nminDex = 0\r\n\r\nwhile list.index(max) != 0:\r\n max_index = list.index(max)\r\n list[max_index], list[max_index-1] = list[max_index-1], list[max_index]\r\n sec += 1\r\n\r\nmin = min(list)\r\n\r\nfor i in range(len(list)):\r\n if list[i] == min and i > minDex:\r\n minDex = i\r\n\r\nwhile minDex != len(list)-1:\r\n list[minDex], list[minDex+1] = list[minDex+1], list[minDex]\r\n minDex += 1\r\n sec += 1\r\n\r\nprint(sec)", "\r\ndef findMaxIndex():\r\n index = 0\r\n value = soldes[0]\r\n for i in range(1,n):\r\n if soldes[i]>value:\r\n value = soldes[i]\r\n index = i\r\n return index\r\n\r\n\r\n\r\ndef findMinIndex():\r\n index = n-1\r\n value = soldes[-1]\r\n for i in range(n-1,-1,-1):\r\n if soldes[i]<value:\r\n value = soldes[i]\r\n index = i\r\n return index\r\n\r\n\r\nn = int(input())\r\nsoldes = list(map(int,input().split()))\r\ncount = 0\r\nmn = findMinIndex()\r\n\r\nwhile mn!=n-1:\r\n temp = soldes[mn]\r\n soldes[mn] = soldes[mn+1]\r\n soldes[mn+1] = temp\r\n mn += 1\r\n count += 1\r\n\r\nmx = findMaxIndex()\r\nwhile mx!=0:\r\n temp = soldes[mx]\r\n soldes[mx] = soldes[mx-1]\r\n soldes[mx-1] =temp\r\n mx -= 1\r\n count += 1\r\nprint(count)", "n = int(input())\r\nc = 0\r\nsolider = list(map(int,input().split()))\r\nposimax = solider.index(max(solider))\r\nc += posimax\r\nsolider.pop(posimax)\r\nsolider.insert(0,max(solider))\r\nsolider = solider[::-1]\r\nposimin = solider.index(min(solider))\r\nc += posimin\r\nprint(c)\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\na,b = max(l), min(l)\r\nx = 0\r\n\r\nfor i in range(0,n):\r\n if l[i] == a: \r\n a = i\r\n break\r\nl = l[i:i+1] + l[:i] + l[i+1:]\r\nx += i\r\nfor i in range(0,n):\r\n if l[-i-1] == b: \r\n b = i\r\n break\r\nx += i\r\n\r\nprint(x)", "n = int(input())\r\na = [int(s) for s in input().split(\" \")]\r\n\r\nmaxIndex = a.index(max(a))\r\nminIndex = a[::-1].index(min(a))\r\n\r\nif len(a)-1-minIndex < maxIndex:\r\n print(maxIndex+minIndex-1)\r\nelse:\r\n print(maxIndex+minIndex)", "num = int(input())\r\na_s = list(map(int, input().split()))\r\nmina = maxa = a_s[0]\r\nmini = maxi = 0\r\nfor i in range(1, num):\r\n a = a_s[i]\r\n if a > maxa:\r\n maxa = a\r\n maxi = i\r\n if a <= mina:\r\n mina = a\r\n mini = i\r\nres = maxi + (num - 1 - mini) - (mini < maxi)\r\nprint(res)\r\n", "s,*k=map(int,open(0).read().split())\r\nb=k.index(max(k))+k[::-1].index(min(k))\r\nprint(b-(b>=s))", "n = int(input())\r\nh = list(map(int, input().split()))\r\nfirst = max(h)\r\nlast = min(h)\r\ni = h.index(first)\r\nj = n - h[::-1].index(last) - 1\r\nif i < j:\r\n print(i + n - j - 1)\r\nelse:\r\n print(i + n - j - 2)", "def main():\r\n n =int(input())\r\n val =list(map(int, input().split()))\r\n maximum_val =max(val)\r\n max_height_swaps =val.index(max(val))\r\n val.remove(maximum_val)\r\n val.insert(0, maximum_val)\r\n val.reverse()\r\n miniumu_height_swaps =val.index(min(val))\r\n print(max_height_swaps + miniumu_height_swaps)\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\nif __name__ ==\"__main__\":\r\n main()\r\n", "def general(a):\r\n max_pos = int()\r\n min_pos = int()\r\n for item in range (len(a)):\r\n if a[item] == max(a):\r\n max_pos = item+1\r\n break\r\n for item in range (len(a)):\r\n if a[item] == min(a):\r\n min_pos = item+1\r\n if max_pos > min_pos:\r\n return max_pos + len(a) - min_pos - 2\r\n else:\r\n return max_pos + len(a) - min_pos - 1\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n print(general(a))", "n = int(input())\r\n\r\nl = list(map(int, input().split()))\r\n\r\nmx, mx_p = l[0], 0 \r\nmn, mn_p = l[0], 0\r\n\r\nfor i in range(1,n):\r\n if l[i]>mx:\r\n mx= l[i]\r\n mx_p = i\r\n elif l[i]<=mn:\r\n mn = l[i]\r\n mn_p = i\r\n\r\nif mn_p<mx_p:\r\n print(mx_p+n-mn_p-2)\r\nelse:\r\n print(mx_p+n-mn_p-1)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nsoldiers = list(map(int, input().split()))\r\ncount_moves_max = 0\r\ncount_moves_min = 0\r\nloop = True\r\nwhile loop:\r\n if soldiers[0] != max(soldiers):\r\n i = soldiers.index(max(soldiers))\r\n soldiers[i], soldiers[i - 1] = soldiers[i - 1], soldiers[i]\r\n count_moves_max += 1\r\n elif soldiers[-1] != min(soldiers):\r\n soldiers.reverse()\r\n i = soldiers.index(min(soldiers))\r\n soldiers[i], soldiers[i - 1] = soldiers[i - 1], soldiers[i]\r\n count_moves_min += 1\r\n soldiers.reverse()\r\n else:\r\n loop = False\r\n\r\nprint(count_moves_max + count_moves_min)", "x = int(input())\r\ny = [int(i) for i in input().split()]\r\nm1 = list()\r\nm2 = list()\r\nfor i in range(x):\r\n if y[i] == max(y):\r\n m1.append(i+1)\r\n if y[i] == min(y):\r\n m2.append(i+1)\r\na = min(m1)\r\nb = max(m2)\r\nif a > b:\r\n print((a-1)+(x-b)-1)\r\nelse:\r\n print((a-1)+(x-b))", "moves = 0\r\n\r\nn = int(input())\r\nline = list(map(int, input().split()))\r\n\r\nmax_h = max(line)\r\nmin_h = min(line)\r\n\r\nfor h in line:\r\n if h == max_h:\r\n line.remove(h)\r\n line.insert(0, h)\r\n break\r\n else:\r\n moves+=1\r\n\r\nline.reverse()\r\nfor h in line:\r\n if h == min_h:\r\n break\r\n else:\r\n moves+=1\r\n\r\n\r\n\r\nprint(moves)", "def General(n):\r\n\r\n data = input().split()\r\n\r\n bg = 0\r\n bg_idx = 0\r\n sml = int(data[0])\r\n sml_idx = 0\r\n\r\n for i in range(len(data)):\r\n\r\n if int(data[i]) > bg:\r\n bg = int(data[i])\r\n bg_idx = i\r\n \r\n if int(data[i]) <= sml:\r\n sml_idx = i\r\n sml = int(data[i])\r\n\r\n if bg_idx > sml_idx:\r\n sml_idx += 1\r\n \r\n\r\n return (bg_idx + (len(data) - 1)- sml_idx)\r\n\r\nprint(General(int(input())))", "n = int(input())\r\n\r\np = list(map(int, input().split()))\r\nmaxi = max(p)\r\nmini = min(p)\r\nm = p.index(maxi) \r\np.pop(m)\r\n\r\np.insert(0,m)\r\np.reverse()\r\nm += p.index(mini)\r\nprint(m)\r\n\r\n\r\n \r\n\r\n\r\n \r\n", "import sys\r\n#import math\r\n#import datetime\r\n#import numpy as np\r\n\r\ndef main():\r\n #n,k = map(int, input().split())\r\n #a = [int(x) for x in sys.stdin.readline().split()]\r\n #t = int(input())\r\n n = int(input())\r\n a = [int(x) for x in sys.stdin.readline().split()]\r\n min_number = min(a)\r\n max_index = a.index(max(a))\r\n for i in range(a.index(min_number), n):\r\n if a[i]==min_number:\r\n min_index = i\r\n if min_index<max_index:\r\n print(n-2-min_index+max_index)\r\n else:\r\n print(n-1-min_index+max_index)\r\nmain()\r\n", "a=int(input())\r\nl=list(map(int,input().split()))\r\nla=max(l)\r\nmi=min(l)\r\nla_in=l.index(la)\r\nl1=l\r\nl1.reverse()\r\nmin_in=len(l)-1-l1.index(mi)\r\nco=0\r\nl.reverse()\r\nfor i in range(min_in,len(l)-1):\r\n if l[i]<l[i+1]:\r\n l[i],l[i+1]=l[i+1],l[i]\r\n co+=1\r\nl.reverse()\r\nfor i in range(len(l)-la_in-1,len(l)-1):\r\n if l[i]>l[i+1]:\r\n l[i],l[i+1]=l[i+1],l[i]\r\n co+=1\r\nprint(co)", "n = int(input())\r\na = [int(e) for e in input().split(' ')]\r\nmi, mx, c = min(a), max(a), 0\r\nmi_i, mx_i = 0, 0\r\nfor i in range(n):\r\n if a[i] == mx:\r\n mx_i = i\r\n break\r\nfor i in range(n):\r\n if a[i] == mi:\r\n mi_i = i\r\nif mx_i < mi_i:\r\n print(mx_i+n-1-mi_i)\r\nelse:\r\n print(mx_i+n-1-mi_i-1)\r\n \r\n", "n = int(input())\r\nx = input().split(\" \")\r\nmin = 100\r\nminindex = 0\r\nmax = 0\r\nmaxindex = 0\r\nfor i in range(n):\r\n if int(x[i]) > max:\r\n max = int(x[i])\r\n maxindex = i\r\n if int(x[n - 1 - i]) < min:\r\n min = int(x[n - 1 - i])\r\n minindex = n - 1 - i\r\nif maxindex > minindex:\r\n print((maxindex + (n - 1 - minindex) - 1))\r\nelse:\r\n print((maxindex + (n - 1 - minindex)))", "# list(map(int,input().split()))\r\nimport sys\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nmi=sys.maxsize\r\nfor i in range(n):\r\n if arr[i]<=mi:\r\n mi=min(mi,arr[i])\r\n mii=i\r\nma=-sys.maxsize\r\nfor i in range(n-1,-1,-1):\r\n if arr[i]>=ma:\r\n ma=max(ma,arr[i])\r\n mai=i\r\nif mii<mai:\r\n print((n-mii-1)+(mai-0)-1)\r\nelse:\r\n print((mai-0)+(n-1-mii))", "count=0\r\nn=int(input())\r\nls=list(map(int, input().split()))\r\nmx=float(\"-inf\")\r\nfor i in range(n):\r\n\tif ls[i]>mx:\r\n\t\tmx=ls[i]\r\n\t\tmx_ind=i\r\nfor i in range(mx_ind,0,-1):\r\n\tls[i],ls[i-1]=ls[i-1],ls[i]\r\n\tcount+=1\r\nmn=float(\"+inf\")\r\nfor i in range(n-1,0,-1):\r\n\tif ls[i]<mn\t:\r\n\t\tmn=ls[i]\r\n\t\tmn_ind=i\r\nfor i in range(mn_ind,n-1):\r\n\tls[i],ls[i+1]=ls[i+1],ls[i]\r\n\tcount+=1\r\nprint(count)", "b=int(input())\r\na=list(map(int,input().split()))\r\nmx=a[0]\r\nmn=a[0]\r\nmnindex=0 \r\nmxindex=0\r\nfor i in range(b):\r\n if(a[i]>mx):\r\n mx=a[i]\r\n mxindex=i\r\nfor i in range(b):\r\n if(a[i]<=mn):\r\n mn=a[i]\r\n mnindex=i\r\nd=mxindex-2+(b-mnindex)\r\nif(mxindex<mnindex):\r\n print(d+1)\r\nelse:\r\n print(d)", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = a.index(max(a))\r\nd = min(a)\r\ne = 0\r\nfor i in range(n):\r\n if(a[i] == d):\r\n e = i\r\nif(c>e):\r\n print(c+n-e-2)\r\nelse:\r\n print(c+n-e-1) ", "n = int(input())\r\nheights = list(map(int, input().split()))\r\nmax_height_idx = heights.index(max(heights))\r\nmin_height_idx = heights[::-1].index(min(heights))\r\nif max_height_idx + min_height_idx >= n:print(max_height_idx + min_height_idx - 1)\r\nelse:print(max_height_idx + min_height_idx)", "n=int(input())\r\nl=list(map(int,input().split()[:]))\r\ni=l.index(max(l))\r\nans=i\r\nl.pop(i)\r\nl.reverse()\r\nans+=l.index(min(l))\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nif min(l)!=max(l):\r\n for i,v in enumerate(l):\r\n if v==max(l):\r\n l1.append(i)\r\n elif v==min(l):\r\n l2.append(i)\r\n count=min(l1)\r\n if min(l1)>max(l2):\r\n count+=(len(l)-1)-(max(l2)+1)\r\n else:\r\n count+=(len(l)-1)-(max(l2))\r\n print(count)\r\nelse:\r\n print(0)", "import sys\r\ndef read_input():\r\n return sys.stdin.readline().rstrip()\r\ndef read_ints():\r\n return map(int, read_input().split())\r\nnum1 = int(read_input())\r\nlist1 = list(read_ints())\r\nnum_max = list1.index(max(list1))\r\nfor x in range(1,num1+1):\r\n if list1[-x] == min(list1):\r\n num_min = x -1\r\n break\r\nif num1 - num_min > num_max:\r\n print(num_min + num_max)\r\nelse:\r\n print(num_min + num_max - 1)", "def minimum_seconds_to_lineup(n, heights):\r\n min_height = max_height = heights[0]\r\n min_index = max_index = 0\r\n\r\n for i in range(1, n):\r\n a = heights[i]\r\n if a > max_height:\r\n max_height = a\r\n max_index = i\r\n if a <= min_height:\r\n min_height = a\r\n min_index = i\r\n\r\n distance = max_index + (n - 1 - min_index) - (1 if min_index < max_index else 0)\r\n return distance\r\n\r\n# Input\r\nn = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\n# Calculate the minimum seconds needed to form the line-up\r\nresult = minimum_seconds_to_lineup(n, heights)\r\n\r\n# Output the result\r\nprint(result)\r\n", "def II():\r\n return(int(input()))\r\ndef LMI():\r\n return(list(map(int,input().split())))\r\ndef I():\r\n return(input())\r\ndef MII():\r\n return(map(int,input().split()))\r\nimport sys\r\ninput=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\nimport math\r\n# from collections import defaultdict\r\n# mod=10**9+7\r\n# from collections import deque\r\n\r\n\r\n\r\ndef t():\r\n n=II()\r\n L=LMI()\r\n ans=0\r\n mas=max(L)\r\n for i in range(n):\r\n if L[i]==mas:\r\n ma=i\r\n break\r\n while ma>0:\r\n L[ma],L[ma-1]=L[ma-1],L[ma]\r\n ans+=1\r\n ma-=1\r\n mis=min(L)\r\n for j in range(n-1,-1,-1):\r\n if L[j]==mis:\r\n mi=j\r\n break\r\n for j in range(mi,n-1):\r\n L[j],L[j+1]=L[j+1],L[j]\r\n ans+=1\r\n print(ans)\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n\r\n # for _ in range(II()):\r\n # t()\r\n t()", "# Arrival of the General\r\n\r\nnum_soldiers = int(input())\r\nheights = list(map(int, input().split()))\r\nmin_height = 101\r\nmin_height_index = 0\r\nmax_height = 0\r\nmax_height_index = 0\r\nfor i in range(num_soldiers):\r\n if(heights[i] > max_height):\r\n max_height = heights[i]\r\n max_height_index = i\r\n if(heights[i] <= min_height):\r\n min_height = heights[i]\r\n min_height_index = i\r\nif(max_height_index > min_height_index):\r\n print(max_height_index + (num_soldiers - min_height_index - 2))\r\nelse:\r\n print(max_height_index + (num_soldiers - min_height_index - 1))\r\n", "s=int(input())\r\nm=list(map(int,input().split()))\r\nu=m.index(max(m))\r\nk=m[::-1].index(min(m))\r\nif(u+k)>=s:\r\n print(u+k-1)\r\nelse:\r\n print(u+k)\r\n \r\n \r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndef solve(n: int, a:list) -> int:\r\n max_n = a[0]\r\n min_n = a[0]\r\n max_ind = 0\r\n min_ind = 0\r\n for i in range(n):\r\n if a[i] <= min_n:\r\n min_n = a[i]\r\n min_ind = i \r\n \r\n if a[i] > max_n:\r\n max_n = a[i] \r\n max_ind = i\r\n \r\n n = n - 1\r\n if max_ind < min_ind:\r\n ans = max_ind + (n - min_ind)\r\n else:\r\n ans = max_ind + (n-min_ind) - 1\r\n \r\n return ans\r\n \r\nprint(solve(n,a))", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\n#find the first occurence of the maximum number\r\n#find the last occurenec of the minimum number?\r\nx=arr.index(max(arr))\r\nmini=min(arr)\r\nfor i in range(n-1,-1,-1):\r\n if arr[i]==mini:\r\n break\r\ny=i\r\n#let last occurence of minimum be y and first occurence of maximum be x\r\n#if index of first occurence of maximum > last occurence of minimum, then ans=(x+(len(arr)-y))-1\r\nans=(x+(len(arr)-y-1))\r\nif x>y:\r\n print(ans-1)\r\nelse:\r\n print(ans)", "n = int(input())\r\nmaxvalue = 0\r\nminvalue = 1000\r\nmaxindex = 0\r\nminindex = 0\r\nl = list(map(int,input().split()))\r\nfor i in range(len(l)):\r\n if l[i] > maxvalue:\r\n maxindex = i\r\n maxvalue = l[i]\r\n if l[i] <= minvalue:\r\n minindex = i\r\n minvalue = l[i]\r\n\r\nif maxindex > minindex:\r\n print((maxindex - 1) + (n - minindex) - 1)\r\nelse:\r\n print((maxindex - 1) + (n - minindex))\r\n", "def solve(s1,l):\r\n max1=max(s1)\r\n min1=min(s1)\r\n maxi=0\r\n mini=0\r\n for i in range(l):\r\n if s1[i]==max1:\r\n maxi=i\r\n break\r\n \r\n count=0\r\n c=0\r\n while s1[0]!=max1:\r\n c=s1[maxi]\r\n s1[maxi]=s1[maxi-1]\r\n s1[maxi-1]=c\r\n maxi=maxi-1\r\n count+=1\r\n for j in range(l-1,0,-1):\r\n if s1[j]==min1:\r\n mini=j\r\n break\r\n while s1[l-1]!=min1:\r\n c=s1[mini+1]\r\n s1[mini+1]=s1[mini]\r\n s1[mini]=c\r\n mini=mini+1\r\n count+=1\r\n print(count)\r\n\r\nl=int(input(\"\"))\r\ns1=input().split()\r\ns2=[int(i) for i in s1]\r\nsolve(s2,l)\r\n \r\n \r\n \r\n \r\n", "input()\r\nusers = list(map(int, input().split()))\r\n\r\nminn = min(users)\r\nmaxx = max(users)\r\n\r\nminn_index = len(users) - 1 - users[::-1].index(minn)\r\nmaxx_index = users.index(maxx)\r\nans = 0;\r\nif maxx_index <= (len(users) - 1 - minn_index):\r\n ans += maxx_index\r\n if minn_index < maxx_index:\r\n minn_index += 1 \r\n ans += len(users) - 1 - minn_index\r\nelse:\r\n ans += (len(users) - 1 - minn_index)\r\n if maxx_index > minn_index:\r\n maxx_index -= 1 \r\n ans += maxx_index\r\n# else:\r\n# print(\"OK\", maxx_index, minn_index)\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nvr = 99999999999999999999\r\nv1 = 0\r\nfor i, e in reversed(list(enumerate(a))):\r\n if a[i] < vr:\r\n vr = a[i]\r\n v1 = i\r\nif v1 < a.index(max(a)):\r\n ans -= 1\r\nans += len(a) - v1 + (a.index(max(a)))\r\nprint(ans - 1)\r\n", "#Arrival of the General\r\nn=int(input());a=map(int, input().split()); a=list(a)\r\nb=a.index(max(a))+a[::-1].index(min(a))\r\nprint(b-(b>=n))", "x = int(input())\nli = [int(x) for x in input().split()]\nlow = 0\nhigh = 0\nfor i in range(x):\n if li[i]>li[high]:\n high = i\n elif li[i]<li[low]:\n low = i\n if li[i]==li[low]:\n low = i\n \nif low<high:\n print(x-low-2+high)\nelse:\n print(x-low+high-1)", "# Read the number of elements\r\nnum_elements = int(input())\r\n\r\n# Read the list of heights and store them in a list\r\nheights = [int(i) for i in input().split()]\r\n\r\n# Initialize variables to track minimum and maximum height and their indices\r\nmin_height = heights[0]\r\nmin_index = 0\r\nmax_height = heights[0]\r\nmax_index = 0\r\n\r\n# Iterate through the list of heights\r\nfor i in range(num_elements):\r\n # Check if the current height is greater than the maximum height\r\n if heights[i] > max_height:\r\n max_height = heights[i]\r\n max_index = i\r\n \r\n # Check if the current height is less than or equal to the minimum height\r\n if heights[i] <= min_height:\r\n min_height = heights[i]\r\n min_index = i\r\n\r\n# Calculate the result based on the given formula\r\nresult = max_index + (num_elements - 1 - min_index) - (1 if min_index < max_index else 0)\r\n\r\n# Print the calculated result\r\nprint(result)\r\n", "x = int(input())\r\nn = list(map(int, input().split()))\r\na = 100\r\nb = 0\r\nc = 0\r\nd = 0\r\nfor i in range(x):\r\n if n[i] <= a:\r\n a = n[i]\r\n b = i\r\n if n[i] > c:\r\n c = n[i]\r\n d = i\r\nif d < b:\r\n print(d + x - 1 - b)\r\nelse:\r\n print(d + x - 2 - b)\r\n", "class Element():\r\n\r\n def __init__(self, index, value):\r\n self.index = index\r\n self.value = value\r\n\r\n def __repr__(self):\r\n return f'Element array[{self.index}] = {self.value}'\r\n \r\ndef find_extreme(array, direction):\r\n extreme_x = array[0]\r\n extreme_i = 0\r\n for i, x in enumerate(array):\r\n if direction == 'min':\r\n to_check = x <= extreme_x\r\n elif direction == 'max':\r\n to_check = x > extreme_x\r\n else:\r\n print('Direction can be `min` or `max`')\r\n return Element(0, 0)\r\n if to_check:\r\n extreme_x = x\r\n extreme_i = i\r\n return Element(extreme_i, extreme_x)\r\n \r\ndef count_swaps(heights):\r\n max_height = find_extreme(heights, 'max')\r\n min_height = find_extreme(heights, 'min')\r\n n = len(heights)\r\n swaps = 0 if min_height.index >= max_height.index else -1\r\n if max_height.index != 0:\r\n swaps += max_height.index\r\n if min_height.index != n-1:\r\n swaps += (n-1-min_height.index)\r\n return swaps\r\n\r\nn = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nprint(count_swaps(heights))\r\n\r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split(\" \")))\r\n\r\nmaxi=-(2**31-1)\r\nmini=(2**31-1)\r\nimin=n-1\r\nimax=0\r\nfor i in range(0,n):\r\n if(arr[i]>maxi):\r\n maxi=arr[i]\r\n imax=i\r\n if(arr[i]<=mini):\r\n mini=arr[i]\r\n imin=i\r\nif(imin>imax):\r\n print(n-1-imin+imax-0)\r\nelse:\r\n print(n-1-imin+imax-0-1)\r\n \r\n \r\n ", "a = int(input())\r\narr = [int(i) for i in input().split()]\r\nr = arr[::-1]\r\nmi = r.index(min(r))\r\nmi_p = a-(mi+1)\r\nma = arr.index(max(arr))\r\nprint((ma-1)+(a-mi_p)-1 if ma>mi_p else (ma-1)+(a-mi_p))\r\n", "n = int(input())\r\nm = [int(x) for x in input().split()]\r\n\r\na = max(m)\r\nx = m.index(a)\r\n\r\nm.remove(a)\r\nm.insert(0,a)\r\n\r\nb = min(m)\r\n\r\nfor i in range(len(m)):\r\n if m[i] == b:\r\n c = i\r\n\r\n\r\ny = len(m) - 1 - c\r\n\r\nprint(x+y)\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nmin=a[0]\r\nmin_index=0\r\nmax=a[0]\r\nmax_index=0\r\nfor i in range(1,n):\r\n if min>=a[i]:\r\n min=a[i]\r\n min_index=i\r\n if max<a[i]:\r\n max=a[i]\r\n max_index=i\r\nif min_index<max_index:\r\n min_index=(n-1)-min_index\r\n print(min_index+max_index-1)\r\nelse:\r\n min_index=(n-1)-min_index\r\n print(min_index+max_index)", "n=int(input())\r\nli=list(map(int,input().strip().split()))\r\nmini=min(li)\r\nmaxi=max(li)\r\nli1=li[::-1]\r\ni1=li1.index(mini)\r\ni=n-1-i1\r\ni2=li.index(maxi)\r\nif i<i2:\r\n ans=i1+i2-1\r\nelse:\r\n ans=i1+i2\r\n\r\nprint(ans)\r\n", "n = int(input())\na = [int(x) for x in input().split()]\nmin_value = min(a)\nmax_value = max(a)\nmin_index = n-1\nwhile min_index>0 and a[min_index] != min_value:\n min_index -= 1\nmax_index = 0\nwhile max_index<n and a[max_index] != max_value:\n max_index += 1\nleft_swaps = max_index\nright_swaps = n - 1 - min_index\nif min_index < max_index:\n print(left_swaps + right_swaps-1)\nelse:\n print(left_swaps+right_swaps)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = a.index(max(a))\r\na.remove(max(a))\r\nans += a[::-1].index(min(a))\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nminimum = l[0]\r\nmin_index = -1\r\nfor i in range(n) : \r\n if l[i] <= minimum : \r\n minimum = l[i] \r\n min_index = i\r\nmax_index = l.index(max(l))\r\nn_index = n-1\r\nprint((n_index-min_index) + max_index if min_index > max_index else (n_index-min_index) + max_index -1) # this -1 is because the overlap so skip a second\r\n# print(min_index , \" \" , l.min_index(min(l)))", "from collections import Counter\r\nimport math\r\ninput()\r\nls = list(map(int, input().split()))\r\nmx, mn = -1, 1000\r\nfor i in range(len(ls)):\r\n mx = max(ls[i], mx)\r\n mn = min(ls[i], mn)\r\n\r\ncnt = 0\r\n\r\nfor i in range(len(ls)):\r\n if ls[i] == mx:\r\n j = i\r\n while j > 0:\r\n ls[j], ls[j - 1] = ls[j - 1], ls[j]\r\n cnt += 1\r\n j -= 1\r\n break\r\n\r\n\r\nfor i in reversed(range(len(ls))):\r\n if ls[i] == mn:\r\n cnt += len(ls) - i - 1\r\n break\r\n\r\nprint(cnt)", "n = int(input())\na = [int(i) for i in input().split()]\nmaxi = -1 ; pos_maxi = 0\nmini = 10000000 ; pos_mini = 0\n\n# get maximum and his position\nfor i in range (n):\n if a[i] > maxi:\n maxi = a[i]\n pos_maxi = i\n\n#get minimum and his position\n if a[i] <= mini:\n mini = a[i]\n pos_mini = i\n\nsec_maxi= pos_maxi-0\nsec_mini= (n-1)-pos_mini\n\nif pos_mini < pos_maxi:\n ans = abs(sec_maxi + sec_mini) - 1\n\nelse:\n ans = abs(sec_maxi + sec_mini)\n\nprint(ans) \n##############\n\t\t\t\t \t\t \t\t \t \t\t\t\t \t \t\t\t\n\t\t \t\t \t \t \t \t\t\t\t \t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nls=a[::-1]\r\nif a.index(max(a))<(len(ls)-ls.index(min(ls))):\r\n print(a.index(max(a))+ls.index(min(ls)))\r\nelse:\r\n print(a.index(max(a))+ls.index(min(ls))-1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nma=0\r\nmi=1e5\r\nstart=0\r\nend=0\r\nfor i in range(n):\r\n if l[i]>ma:\r\n ma=l[i]\r\n start=i\r\n if l[i]<=mi:\r\n mi=l[i]\r\n end=i\r\nif start>end:\r\n res=(start-1)+(n-end)-1\r\nelse:\r\n res=start-1+(n-end)\r\nprint(res)", "n = int(input())\r\narr = map(int, input().split())\r\n\r\namax = -1\r\nM = -1\r\nm = -1\r\namin = 101\r\n\r\nfor i, x in enumerate(arr):\r\n if x > amax:\r\n amax = x\r\n M = i\r\n # print(\"amax: \", amax, \" M: \", M)\r\n \r\n if x <= amin:\r\n amin = x\r\n m = i\r\n # print(\"amin: \", amin, \" m: \", m)\r\n\r\nif M < m:\r\n sol = M + n - 1 - m\r\nelif M > m:\r\n sol = M + n - 1 - m - 1\r\nelse: sol = 0\r\n\r\nprint(sol)\r\n\r\n", "s = int(input())\r\na = list(map(int, input().split()))\r\nmimi = a[0]\r\nmaxi = a[0]\r\nimin = 0\r\nimaxx = 0\r\n\r\nfor i in range(s):\r\n if maxi < a[i]:\r\n maxi = a[i]\r\n imaxx = i\r\n if mimi >= a[i]:\r\n mimi = a[i]\r\n imin = i\r\nif imaxx > imin:\r\n imin = (s - 1) - imin\r\n print(imin + imaxx - 1)\r\nelse:\r\n imin = (s - 1) - imin\r\n print(imin + imaxx)", "n = int(input())\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\nh = arr.index(max(arr))\r\n\r\nl = min(arr)\r\n\r\nla = []\r\n\r\nwhile(l in arr):\r\n la.append(arr.index(l))\r\n arr[arr.index(l)]+=1\r\n\r\n\r\nl = max(la)\r\n\r\nif h>l:\r\n print(h + (n-1) - (l+1))\r\n \r\nelse:\r\n print(h + n - (l+1))\r\n\r\n\r\n", "n = int(input())\r\nh = list(map(int,input().split()))\r\n\r\nm = None #minimium height\r\nm_i = None #minimium height index\r\nM = None #max height\r\nM_i = None #max height index\r\n\r\nfor i in range(len(h)):\r\n if m == None:\r\n m = M = h[i]\r\n m_i = M_i = i\r\n elif h[i] <= m:\r\n m = h[i]\r\n m_i = i\r\n elif h[i] > M:\r\n M = h[i]\r\n M_i = i\r\n\r\nprint(M_i + len(h) - 1 - m_i - (1 if m_i < M_i else 0))", "n = int(input())\r\na = list(map(int, input().split()))\r\nl, r = 0, 0\r\nlm, rm = -1, 101\r\nfor i in range(n):\r\n if lm<a[i]:\r\n lm = a[i]\r\n l = i\r\n if rm>=a[i]:\r\n rm = a[i]\r\n r = i\r\nans = l+(n-r-1)\r\nif r<l:\r\n ans-=1\r\nprint(ans)", "o = int(input())\r\nl = list(map(int, input().split()))\r\nmin1 = l.index(min(l))\r\nma = l.index(max(l))\r\n\r\nif o == 1:\r\n print(0)\r\nelse:\r\n if len(set(l)) == o:\r\n if (ma>min1):\r\n print(o-min1-2 +ma)\r\n else:\r\n print(ma +o - min1-1)\r\n \r\n else:\r\n z=l[::-1]\r\n min3=len(z)-z.index(min(l))\r\n if(ma<min3):\r\n print(ma+o-min3)\r\n else:\r\n print(ma+o-min3-1)", "def max(a):\r\n max = 0\r\n for i in range(len(a)):\r\n if a[i] > a[max]:\r\n max = i\r\n return max\r\n\r\ndef min(a):\r\n min = 0\r\n for i in range(len(a)):\r\n if a[i] <= a[min]:\r\n min = i\r\n return min\r\n\r\nn = int(input())\r\na = list(map(int,input().strip().split(' ')))\r\nr = 0\r\n\r\nif max(a) > min(a):\r\n print(max(a) + len(a) - min(a) - 2)\r\nelse:\r\n print(max(a) + len(a) - min(a) - 1)", "n = int(input())\r\nheights = list(map(int, input().split()))\r\nmaxi = 0\r\nmini = 1000\r\nmaxindex = 0\r\nminindex = 0\r\n\r\nfor i in range(n):\r\n x = heights[i]\r\n if x > maxi:\r\n maxindex = i\r\n maxi = x\r\n if x <= mini:\r\n minindex = i\r\n mini = x\r\n\r\nif maxindex > minindex:\r\n print((maxindex - 1) + (n - minindex) - 1)\r\nelse:\r\n print((maxindex - 1) + (n - minindex))\r\n", "n = int(input())\r\n\r\nh = [int(i) for i in input().split()]\r\n\r\nminH = h[0]\r\nminI = 0\r\nmaxH = h[0]\r\nmaxI = 0\r\n\r\nfor i in range(n):\r\n if h[i] > maxH:\r\n maxH = h[i]\r\n maxI = i\r\n if h[i] <= minH:\r\n minH = h[i]\r\n minI = i\r\n\r\nprint(maxI + (n - 1 - minI) - (1 if minI < maxI else 0))\r\n\r\n", "def sol():\r\n n=int(input())\r\n l=list(map(int,input().split(\" \")))\r\n mi=min(l)\r\n imi1=l[::-1].index(mi)\r\n ma=max(l)\r\n ima=l.index(ma)\r\n\r\n if (imi1+ima)>=n:\r\n s=imi1+ima-1\r\n else:\r\n s=imi1+ima\r\n print(s)\r\n \r\n \r\n \r\n\r\n \r\n \r\nsol()\r\n\r\n \r\n\r\n\r\n\r\n", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\nthap=0\r\ncao=0\r\nsnn=200\r\nsln=0\r\nfor i in range(0,n):\r\n snn=min(snn,s[i])\r\n sln=max(sln,s[i])\r\nfor i in range(0,n):\r\n if s[i]==snn:\r\n thap=i\r\nfor i in range(n-1,-1,-1):\r\n if s[i]==sln:\r\n cao=i\r\nif cao>=thap:\r\n print(cao+(n-1-thap)-1)\r\nelse:\r\n print(cao+n-1-thap)", "n = int(input())\r\nvls = list(map(int, input().split()))\r\n\r\nx = min(vls)\r\niX = len(vls) - 1 - vls[::-1].index(x)\r\ndel vls[iX]\r\nvls.append(x)\r\n\r\nr = len(vls) - iX - 1\r\nr += vls.index(max(vls))\r\nprint(r)", "n, h = int(input()), [_ for _ in map(int, input().split())]\r\ncorrh = sorted(h)\r\nhigh, low = corrh[-1], corrh[0]\r\nhIndex = h.index(high)\r\nswapsForHigh = hIndex\r\nh.remove(high)\r\nh = [high] + h\r\nlIndices = [i for i, x in enumerate(h) if x == low]\r\nLIndex = max(lIndices)\r\nswapsForLow = (n - 1) - LIndex\r\nprint(swapsForHigh + swapsForLow)", "size=int(input())\nheights=input()\nheights=heights.split(' ')\nheights=[int(x) for x in heights]\n\nmax_idx=heights.index(max(heights))\n\nrev=heights[::-1]\nmin_idx=size-1-rev.index(min(heights))\n\ncount=0\nif(max_idx>min_idx):\n count-=1\ncount=count+max_idx+(size-1-min_idx)\nprint(count)\n\t \t\t\t \t \t \t \t \t \t \t \t \t", "q=int(input())\r\nw=[*map(int,input().split())]\r\ne=w.index(max(w))+w[::-1].index(min(w))\r\nprint(e-(e>=q))", "def Arrival_of_the_General(n, heights):\r\n min, min_index = heights[0],0\r\n max, max_index = heights[0],0\r\n for i in range(len(heights)):\r\n \r\n if heights[i] <= min:\r\n min = heights[i]\r\n min_index = i\r\n if heights[i] > max:\r\n max = heights[i]\r\n max_index = i\r\n moves = 0\r\n moves+= abs(max_index - 0)\r\n moves+= abs(min_index - (n-1))\r\n \r\n if min_index < max_index:\r\n moves-=1\r\n return moves \r\n \r\nn ,heights = int(input()), map(int, input().split())\r\nheights = list(heights)\r\nprint(Arrival_of_the_General(n, heights))", "n = int(input())\n\nsoldiers = list(map(int, input().split()))\n\nlow = (float('inf'), 0)\n\nhigh = (0, 0)\n\nfor i in range(n): \n if soldiers[i] <= low[0]: \n low = (soldiers[i], i)\n if soldiers[i] > high[0]: \n high = (soldiers[i], i)\nres = high[1] + (n-1) - low[1]\n\nif high[1] > low[1]: \n res -= 1\nprint(res)\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\n\r\nmax_arr=max(arr)\r\nmin_arr=min(arr)\r\n\r\nmax_dist=1000\r\nmin_dist=0\r\n\r\nfor i in range(len(arr)):\r\n if arr[i]==min_arr:\r\n min_dist=max(min_dist,i)\r\n\r\nfor i in range(len(arr)):\r\n if arr[i]==max_arr:\r\n max_dist=min(max_dist,i)\r\n\r\nif max_dist<min_dist:\r\n ans=(max_dist)+(n-1-min_dist)\r\n print(ans)\r\nelse:\r\n ans=(max_dist)+(n-1-(min_dist+1))\r\n print(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmax_index = a.index(max(a))\r\nmin_index = n - 1 - a[::-1].index(min(a))\r\n\r\nif max_index > min_index:\r\n min_index += 1\r\n\r\nprint(max_index + (n - 1 - min_index))\r\n", "l = int(input())\r\na = list(map(int,input().split()))\r\nmax_index = a.index(max(a))\r\nmin_index = a[::-1].index(min(a))\r\nprint(max_index+min_index -(max_index+min_index >= l))\r\n\r\n", "n = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nmax_height = max(heights)\r\nmin_height = min(heights)\r\n\r\nmax_index = heights.index(max_height)\r\nmin_index = n - 1 - heights[::-1].index(min_height)\r\n\r\nif max_index > min_index:\r\n total_swaps = max_index + (n - 1 - min_index) - 1\r\nelse:\r\n total_swaps = max_index + (n - 1 - min_index)\r\n\r\nprint(total_swaps)", "n = int(input())\r\nmass = list(map(int, input().split()))\r\ncount = mass.index(max(mass))\r\nmass.insert(0, mass.pop(mass.index(max(mass))))\r\nprint(count + mass[::-1].index(min(mass)))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ns=lst.index(max(lst))\r\nfor i in range(n-1,-1,-1):\r\n if(lst[i]==min(lst)):\r\n e=i\r\n break\r\nif(s>e):\r\n print(s+(n-e-2))\r\nelse:\r\n print(s+(n-e-1))", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = a.index(max(a))\r\nb = list(reversed(a))\r\nr = b.index(min(b))\r\nif l > n - 1 - r:\r\n print(l + r - 1)\r\nelse:\r\n print(l + r)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nma = max(a)\r\nmi = min(a)\r\n\r\nfor i in range(n):\r\n if a[i] == ma:\r\n index_ma = i\r\n break\r\nfor i in range(n - 1, -1, -1):\r\n if a[i] == mi:\r\n index_mi = i\r\n break\r\n\r\nif index_ma > index_mi:\r\n res = index_ma + n - index_mi - 2\r\nelse:\r\n res = index_ma + n - index_mi - 1\r\n\r\nprint(res)\r\n", "n = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nmax_height_position = 0\r\nmin_height_position = 0\r\n\r\nfor i in range(n):\r\n if heights[i] > heights[max_height_position]:\r\n max_height_position = i\r\n if heights[i] <= heights[min_height_position]:\r\n min_height_position = i\r\n\r\ntotal_swaps = max_height_position + (n - 1 - min_height_position)\r\nif max_height_position > min_height_position:\r\n total_swaps -= 1\r\n\r\nprint(total_swaps)\r\n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nindex_maxi = lst.index(max(lst))\r\n\r\ntotal = 0\r\n\r\nmaxi = lst[index_maxi]\r\ntotal += index_maxi\r\ndel lst[index_maxi]\r\nlst.insert(0, maxi)\r\n\r\nlst.reverse()\r\nindex_mini = lst.index(min(lst))\r\nmini = lst[index_mini]\r\ntotal += index_mini\r\ndel lst[index_mini]\r\nlst.insert(0, mini)\r\n\r\nprint(total)\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nmax_value = 0\r\nmax_pos = 0\r\nmin_value = 101\r\nmin_pos = 0\r\n\r\nfor i in range(n):\r\n num = numbers[i]\r\n if num > max_value:\r\n max_value = num\r\n max_pos = i\r\n if num <= min_value:\r\n min_value = num\r\n min_pos = i\r\n\r\nif max_pos > min_pos:\r\n result = (max_pos - 1) + (n - (min_pos + 1))\r\nelse:\r\n result = (max_pos - 1) + (n - min_pos)\r\n\r\nprint(result)\r\n", "n = int(input())\r\n\r\nli = list(map(int, input().split()))\r\n\r\nbige =(len(li)-1) - li[::-1].index(min(li))\r\n\r\nsmol = li.index(max(li))\r\n\r\nprint((abs(0-smol)+abs((len(li)-1)-bige))-1 if bige<smol else (abs(0-smol)+abs((len(li)-1)-bige)))", "n=int(input())\r\na=[int(v) for v in input().split()]\r\n\r\nmost=max(a)\r\nleast=min(a)\r\n\r\nmostind=a.index(most)\r\n\r\na.reverse()\r\n\r\nleastind=a.index(least)\r\nleastind=n-leastind-1\r\n\r\n\r\nans=mostind\r\nans=ans+n-leastind-1\r\n\r\nif(mostind>leastind):\r\n print(ans-1)\r\nelse:\r\n print(ans)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nans=a.index(max(a))\r\ntemp=a.pop(ans)\r\na.insert(0,temp)\r\nans+=a[::-1].index(min(a))\r\nprint(ans)", "# N = int(input())\r\n# N,M = map(int,input().split())\r\n# A = list(map(int,input().split()))\r\n\r\n\r\nN = int(input())\r\nA = list(map(int,input().split()))\r\ni = j = 0\r\nmn = mx = A[0]\r\n\r\nfor x,n in enumerate(A):\r\n if n <= mn:\r\n mn = n\r\n i = x\r\n elif n > mx:\r\n mx = n\r\n j = x\r\n\r\nif i > j:\r\n print(j + N - i - 1)\r\nelse:\r\n print(j + N - i - 2)\r\n", "number_of_soldiers = int(input())\r\npositions = list(map(int, input().split()))\r\npos_reversed = positions[::-1]\r\nmax_index = positions.index(max(positions))\r\nmin_index = len(pos_reversed)-pos_reversed.index(min(pos_reversed))-1\r\n\r\nprint((max_index-1)+(number_of_soldiers-min_index)-(1 if min_index < max_index else 0))", "n = int(input())\r\nheights = list(map(int, input().split()))\r\nmin_height_index = max_height_index = 0\r\nfor i in range(1, n):\r\n if heights[i] > heights[max_height_index]:\r\n max_height_index = i\r\n if heights[i] <= heights[min_height_index]:\r\n min_height_index = i\r\nprint(max_height_index + n - 1 - min_height_index - (1 if max_height_index > min_height_index else 0))\r\n", "n = int(input())\r\ncost = 0\r\nlist1 = list(map(int, input().split()))\r\n\r\nif list1[0] != max(list1):\r\n cost += list1.index(max(list1))\r\n list1.insert(0, list1.pop(list1.index(max(list1))))\r\n\r\nlist1.reverse()\r\n\r\nif list1[0] != min(list1):\r\n cost += list1.index(min(list1))\r\n list1.insert(0, list1.pop(list1.index(min(list1))))\r\n\r\nprint(cost)", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = 0\r\nmax = 0\r\nmin = 999999\r\nl = 0\r\nf = 0\r\nfor i in range (n):\r\n if a[i]>max:\r\n max = a[i]\r\n l = i\r\n if a[i]<=min:\r\n min = a[i]\r\n f = i\r\nif l>0:\r\n k += l-0\r\nif f<n:\r\n k += n-1-f\r\nif l>f:\r\n k -= 1\r\nprint(k)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmin1=a[0]\r\nmax1=a[0]\r\nmin2=0\r\nmax2=0\r\nfor i in range(n):\r\n if max1<a[i]:\r\n max1=a[i]\r\n max2=i\r\n if min1>=a[i]:\r\n min1=a[i]\r\n min2=i\r\nif max2>min2:\r\n min2=(n-1)-min2\r\n print(min2+max2-1)\r\nelse:\r\n min2=(n-1)-min2\r\n print(min2+max2)", "\r\ninput()\r\nl=list(map(int,input().split()))\r\nmin=0\r\nmax=0\r\nfor i in range(1,len(l)):\r\n if l[i]>l[max]:\r\n max=i\r\n if l[i]<=l[min]:\r\n min=i\r\nif min<max:\r\n min+=1\r\n#print(min,max)\r\nprint(max+(len(l)-min-1))", "n = input()\r\nlist_of_soldiers = list(map(int, input().split()))\r\nmin_num = min(list_of_soldiers)\r\ncount, min_indx = 0, 0\r\nfor i in range(len(list_of_soldiers)):\r\n if list_of_soldiers[i] <= min_num:\r\n min_indx = i\r\nfor i in range(min_indx, len(list_of_soldiers) - 1):\r\n swop = list_of_soldiers[i + 1]\r\n list_of_soldiers[i + 1] = list_of_soldiers[i]\r\n list_of_soldiers[i] = swop\r\n count += 1\r\nprint(list_of_soldiers.index(max(list_of_soldiers)) + count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 17:17:36 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\nsoldiers=int(input())\r\nheights=[int(height) for height in input().split()]\r\nmax_=sorted(heights)[-1]\r\nmin_=sorted(heights)[0]\r\ncounter=0\r\nfor i in range(soldiers):\r\n if heights[i]==max_:\r\n j=i\r\n while j!=0:\r\n heights[j],heights[j-1]=heights[j-1],heights[j]\r\n j-=1\r\n counter+=1\r\n break\r\ni=soldiers-1\r\nwhile i != 0:\r\n if heights[i]==min_:\r\n j=i\r\n while j != soldiers-1:\r\n heights[j],heights[j+1]=heights[j+1],heights[j]\r\n j += 1\r\n counter+=1\r\n break\r\n i-=1\r\nprint(counter)", "\"\"\"\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\"\"\"\r\n\r\n\"\"\"\r\n$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\r\n\"\"\"\r\n\r\nmod = 10**9 + 7\r\n\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\ninp3 = lambda: int(input())\r\ninp4 = lambda: input()\r\n\r\ndef compute_gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n \r\ndef compute_lcm(x, y):\r\n lcm = (x*y)//compute_gcd(x,y)\r\n return lcm\r\n\r\n\"\"\"\r\n$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$\r\n\"\"\"\r\n \r\nqty = inp3()\r\nheight = inp2()\r\n\r\nresult = height.index(max(height)) + height[::-1].index(min(height))\r\n\r\nprint(result - (result >= qty))\r\n\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nmaxi, mini = float(\"-inf\"), float(\"inf\")\r\nfirst_max_idx = -1\r\nlast_min_idx = -1\r\nfor i in range(0, len(nums)): #0 -> len(nums)-1\r\n ele = nums[i]\r\n if ele > maxi:\r\n maxi = ele\r\n first_max_idx = i\r\n if ele <= mini:\r\n mini = ele\r\n last_min_idx = i\r\nswaps = len(nums)-1-last_min_idx + first_max_idx\r\nif first_max_idx > last_min_idx:\r\n print(swaps -1)\r\nelse:\r\n print(swaps)\r\n \r\n \r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sorted(a)\r\nfor i in range(n):\r\n if a[i]==b[-1]:\r\n mi=i\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if a[i]==b[0]:\r\n mo=i\r\n break\r\nif mo<mi:print(mi+(n-mo-1-1))\r\nelse:print(mi+n-mo-1)\r\n", "n= int(input())\r\nl=[int(x) for x in input().split()]\r\nma=max(l)\r\nmi=min(l)\r\nma_ind=l.index(ma)\r\nl.reverse()\r\nmi_ind=l.index(mi)\r\nprint(ma_ind+mi_ind -1 if n-1-mi_ind<ma_ind else ma_ind+mi_ind )", "n = int(input())\r\na = list(map(int, input().split()))\r\nminnum = min(a)\r\nmaxnum = max(a)\r\npmin = -1\r\npmax = -1\r\nfor i, j in enumerate(a):\r\n if j == minnum:\r\n pmin = i\r\n if pmax == -1 and j == maxnum:\r\n pmax = i\r\n\r\nif pmin >= pmax:\r\n print(n - pmin + pmax - 1)\r\nelse:\r\n print(n - pmin + pmax - 2)\r\n", "import sys\r\na = int(input(\"\"))\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nmn = 0\r\nmx = 0\r\nfor i in range(1,a):\r\n if b[i] <= b[mn]:\r\n mn = i\r\n if b[i] > b[mx]:\r\n mx = i\r\nif mn < mx:\r\n print(a - 1 - mn + mx - 1)\r\nelif mn > mx:\r\n print(mx + (a - 1 - mn))\r\nelse:\r\n print(0)", "n = int(input())\r\nr = list(map(int, input().split()))\r\nma = r.index(max(r))\r\nmi = r[::-1].index(min(r))\r\nif (n-1)-ma > mi:\r\n print(ma+mi)\r\nelse:\r\n print(ma+mi-1)\r\n", "n, h = int(input()), [_ for _ in map(int, input().split())]\r\nhigh, low = sorted(h)[-1], sorted(h)[0]\r\nswapsForHigh = h.index(high)\r\nh.remove(high)\r\nh = [high] + h\r\nprint(swapsForHigh + (n - 1) - max([i for i, x in enumerate(h) if x == low]))", "n = int(input())\r\nh = [int(i) for i in input().split()]\r\nmin_H = h[0]\r\nmin_I = 0\r\nmax_H = h[0]\r\nmax_I = 0\r\nfor i in range(n):\r\n if h[i] > max_H:\r\n max_H = h[i]\r\n max_I = i\r\n if h[i] <= min_H:\r\n min_H = h[i]\r\n min_I = i\r\nprint(max_I + (n - 1 - min_I) - (1 if min_I < max_I else 0))", "l=int(input())\r\narr=list(map(int,input().split()))\r\nmini=min(arr)\r\nmaxi=max(arr)\r\nmax_index=arr.index(maxi)\r\nrev_arr=arr[::-1]\r\nmin_index=l-1-(rev_arr.index(mini))\r\ncount=0\r\nif max_index<min_index:\r\n count=max_index+l-1-min_index\r\nelse:\r\n count=max_index+l-1-min_index-1\r\nprint(count)\r\n \r\n\r\n\r\n ", "n = int(input())\r\ny = list(map(int, input().split()))\r\ne1 = []\r\ne2 = []\r\nfor i in range(n):\r\n if y[i] == max(y):\r\n e1.append(i+1)\r\n if y[i] == min(y):\r\n e2.append(i+1)\r\nvlt1 = min(e1)\r\nvlt2 = max(e2)\r\nif vlt1 > vlt2:\r\n print((vlt1-1)+(n-vlt2)-1)\r\nelse:\r\n print((vlt1-1)+(n-vlt2))", "import sys\r\nimport bisect\r\nfrom math import *\r\nfrom queue import PriorityQueue\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 answer=0\r\n a=[int(x) for x in input().split()]\r\n mx=a.index(max(a))\r\n for i in range(mx,0,-1):\r\n a[i],a[i-1]=a[i-1],a[i]\r\n answer+=1\r\n mn=min(a)\r\n ind=-1\r\n for i in range(n):\r\n if(a[i]==mn):\r\n ind=i \r\n for i in range(ind,n-1):\r\n a[i],a[i+1]=a[i+1],a[i]\r\n answer+=1\r\n print(answer)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\n n = int(input())\n heights = list(map(int, input().split(' ')))\n max_idx, min_idx = len(heights) - 1, 0 \n max_val, min_val = max(heights), min(heights)\n for idx, h in enumerate(heights):\n if h == max_val:\n max_idx = min(max_idx, idx)\n if h == min_val:\n min_idx = max(min_idx, idx)\n if min_idx < max_idx:\n print(max_idx + (n - 1 - min_idx) - 1)\n else:\n print(max_idx + (n - 1 - min_idx))\nif __name__ == \"__main__\":\n main()\n", "def solve(n,l):\r\n return l[::-1].index(min(l))+ l.index(max(l)) - (l[::-1].index(min(l))+ l.index(max(l)) >= n)\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nprint(solve(n,l))\r\n", "n=int(input())\r\nrow=list(map(int,input().split()))\r\nleft=row.index(max(row))\r\nrow.reverse()\r\nright=row.index(min(row))\r\npruf=n-right\r\nprint(left+right-1 if left>=pruf else left+right)\r\n\r\n\r\n\r\n", "if __name__ == \"__main__\":\r\n _ = int(input())\r\n arr = list(map(int, input().split()))\r\n minVal = (arr[0], 0)\r\n maxVal = (arr[0], 0)\r\n \r\n for i in range(len(arr)):\r\n if arr[i] <= minVal[0]:\r\n minVal = (arr[i], i)\r\n if arr[i] > maxVal[0]:\r\n maxVal = (arr[i], i)\r\n diff = 0\r\n if minVal[1] < maxVal[1]:\r\n diff = 1\r\n print(maxVal[1] + len(arr) - 1 - minVal[1] - diff)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nindice_max = l.index(max(l))\r\nt = 0\r\nj = 0\r\nwhile l[0]!= max(l):\r\n l[indice_max-j],l[indice_max-j-1] = l[indice_max-j-1],l[indice_max-j]\r\n t = t+1 \r\n j = j+1\r\nl = list(reversed(l))\r\nindice_max = l.index(min(l))\r\nj = 0\r\nwhile l[0]!= min(l):\r\n l[indice_max-j],l[indice_max-j-1] = l[indice_max-j-1],l[indice_max-j]\r\n t = t+1 \r\n j = j+1\r\n\r\nprint(t)", "iint = lambda : map(int,input().split())\r\nilist = lambda : list(iint()) \r\n\r\nn = int(input())\r\narr = ilist()\r\n\r\n_max = []\r\n_min = []\r\nans = 0\r\nfor i in range(len(arr)):\r\n if max(arr) == arr[i]:\r\n _max.append(i)\r\n if min(arr) == arr[i]:\r\n _min.append(i)\r\n\r\nans = (min(_max))+(len(arr) - max(_min))\r\nif min(_max)>max(_min):\r\n print(ans-2)\r\nelse:\r\n print(ans-1)", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nmx=max(a)\r\nmn=min(a)\r\nmxi=a.index(mx)\r\nmni=n-1-a[::-1].index(mn)\r\nans=mxi\r\nans+=n-1-mni\r\nif mni<mxi:\r\n ans-=1\r\nprint(ans)\r\n", "a = int(input())\r\nnumbers = list(map(int, input().split()))\r\nmax = numbers[0]\r\nmin = numbers[0]\r\nmax_index = 0\r\nmin_index = 0\r\nfor i in range(1, a):\r\n if numbers[i] > max:\r\n max = numbers[i]\r\n max_index = i\r\n if numbers[i] <= min:\r\n min = numbers[i]\r\n min_index = i\r\nif max_index > min_index:\r\n print(max_index + a - min_index - 2)\r\nelse:\r\n print(max_index + a - min_index - 1)", "n=int(input())\r\nx=list(map(int,input().split()))\r\na=(x.index(max(x)))\r\nx=x[::-1]\r\nb=(x.index(min(x)))\r\nif (a+b)<len(x):\r\n print(a+b)\r\nelse:\r\n print(a+b-1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmax_val = 0\r\nmax_index = 0\r\nmin_val = 110\r\nmin_index = 0\r\n\r\nfor i in range(n):\r\n if arr[i] > max_val:\r\n max_val = arr[i]\r\n max_index = i+1\r\n if arr[i] <= min_val:\r\n min_val = arr[i]\r\n min_index = i+1\r\n\r\nif max_index > min_index:\r\n print((max_index-1) + (n-min_index) - 1)\r\nelse:\r\n print((max_index-1) + (n-min_index))\r\n", "n = input()\r\nlst = list(map(int, input().split()))\r\nmn = min(lst)\r\nmx = max(lst)\r\ncount = lst.index(mx)\r\nlst.pop(count)\r\nlst.insert(0, count)\r\nlst.reverse()\r\ncount += lst.index(mn)\r\nprint(count)", "def main():\r\n num_soldiers = int(input())\r\n soldiers = list(map(int, input().split()))\r\n\r\n min_soldier = 101\r\n max_soldier = 0\r\n min_pos = 100\r\n max_pos = 0\r\n\r\n for k in range(num_soldiers):\r\n current_soldier = soldiers[k]\r\n if current_soldier > max_soldier:\r\n max_pos = k\r\n max_soldier = current_soldier\r\n if current_soldier <= min_soldier:\r\n min_pos = k\r\n min_soldier = current_soldier\r\n \r\n output = max_pos + (num_soldiers - 1 - min_pos)\r\n if min_pos < max_pos:\r\n output -= 1\r\n \r\n print(output)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a= input()\r\nb=[int(x) for x in input().split()]\r\nc=max(b)\r\nd=min(b)\r\ne=b.index(c)\r\nb.pop(e)\r\nb.insert(0,e)\r\nb.reverse()\r\ne+=b.index(d)\r\nprint(e)", "n, *arr = map(int, open(0).read().split())\r\nfirst_index = arr.index(max(arr)) + arr[::-1].index(min(arr))\r\nprint(first_index - (first_index >= n))\r\n\r\n", "from bisect import (\r\n bisect_left, bisect_right,\r\n insort_left, insort_right\r\n)\r\nfrom collections import defaultdict\r\nfrom functools import cache\r\nfrom itertools import accumulate, permutations, product\r\nfrom math import gcd, lcm, factorial, ceil, pi, inf, dist\r\n# from sys import set_int_max_str_digits\r\nfrom sys import stdin\r\n\r\nMOD = 998244353\r\nALPHA = 'abcdefghijklmnopqrstuvwxyz'\r\n#set_int_max_str_digits(10000)\r\n\r\ninput = lambda: stdin.readline().rstrip()\r\ndef inpi(): return int(input())\r\ndef inpf(): return float(input())\r\ndef inpis(): return map(int, input().split())\r\ndef inpfs(): return map(float, input().split())\r\ndef inpli(): return list(map(int, input().split()))\r\ndef srtinpli(reverse=False): return sorted(map(int, input().split()), reverse=reverse)\r\ndef inpli2(n): return [int(input()) for _ in range(n)]\r\ndef inplf(): return list(map(float, input().split()))\r\ndef inplf2(n): return [float(input()) for _ in range(n)]\r\ndef inpls(): return input().split()\r\ndef inpls2(n): return [input() for _ in range(n)]\r\ndef inpset(): return set(map(int, input().split()))\r\ndef inpset2(n): return {int(input()) for _ in range(n)}\r\ndef inpmat(n): return [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\n# Main\r\n\r\nn = inpi()\r\na = inpli()\r\n\r\nma = -inf\r\nmi = inf\r\nfor i in range(n):\r\n if a[i] > ma:\r\n ma = a[i]\r\n l = i\r\n if a[i] <= mi:\r\n mi = a[i]\r\n r = i\r\n \r\nans = l + n - r - 1\r\nif r < l:\r\n ans -= 1\r\n\r\nprint(f\"{ans}\")", "n = int(input())\r\nnums = list(map(int, input().split()))\r\na, b = nums.index(max(nums)), abs((nums[::-1].index(min(nums))) - n + 1) \r\n\r\nif a > b:\r\n print((a) + abs((n - 1) - b) - 1)\r\n\r\nelse:\r\n print(a + abs((n - 1) - b))", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmin_index, max_index = 0, 0\r\nmin_val, max_val = arr[0], arr[0]\r\n\r\nfor i in range(1, n):\r\n if arr[i] > max_val:\r\n max_val = arr[i]\r\n max_index = i\r\n if arr[i] <= min_val:\r\n min_val = arr[i]\r\n min_index = i\r\n\r\nresult = max_index + (n - 1 - min_index) - (1 if min_index < max_index else 0)\r\nprint(result)\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nmx=max(l)\r\npos1=l.index(mx)\r\nmn=101\r\nfor i in range(n):\r\n if mn>=l[i]:\r\n mn=l[i]\r\n pos2=i\r\nif pos1>pos2:\r\n print(pos1+n-2-pos2)\r\nelse:\r\n print(pos1+n-1-pos2)", "#!/usr/bin/env python3\r\nn = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nmax_height = max(heights)\r\nmin_height = min(heights)\r\n\r\nmax_idx = heights.index(max_height)\r\nmin_idx = heights[::-1].index(min_height)\r\n\r\nif max_idx > n - 1 - min_idx:\r\n seconds = max_idx + min_idx - 1\r\nelse:\r\n seconds = max_idx + min_idx\r\n\r\nprint(seconds)\r\n\r\n", "n,*a=map(int,open(0).read().split())\nb=a.index(max(a))+a[::-1].index(min(a))\nprint(b-(b>=n))\n \t\t \t\t \t \t \t\t\t \t \t \t", "count = int(input()) - 1\r\nheights = list(map(int,input().split()))\r\nmaximum = heights.index(max(heights))\r\nminimum = count - heights[::-1].index(min(heights)) \r\nif maximum == minimum : print(0)\r\nelse :\r\n print(count - minimum + maximum if maximum < minimum else maximum + (count - minimum) - 1) \r\n ", "# Arrival of the General\r\n\r\nn = int(input())\r\nnums = [int(x) for x in input().split(' ')]\r\nmaximo = max(nums)\r\nminimo = min(nums)\r\n# Buscar indice del maximo\r\nindice_maximo = nums.index(maximo)\r\n# Buscar indice del minimo\r\nindice_minimo = -1\r\nfor indice, x in enumerate(nums):\r\n if x == minimo:\r\n indice_minimo = indice\r\ncant = 0\r\ncant += indice_maximo\r\ncant += n - indice_minimo - 1\r\nif indice_maximo > indice_minimo:\r\n cant -= 1\r\nprint(cant)\r\n", "# Input\r\nt = int(input())\r\ncontent = [int(x) for x in input().split()]\r\n\r\n# Define the number of moves, which is the biggest number and which is the smallest number\r\nmoves = 0\r\nbig = 0\r\nsmall = float('infinity')\r\n\r\nfor i in range(len(content)):\r\n if content[i] > big:\r\n big = content[i]\r\n\r\npoppers = content.index(big)\r\n\r\ncontent.pop(poppers)\r\ncontent.insert(0, big)\r\nmoves += poppers\r\n\r\nfor i in range(len(content)):\r\n if content[i] < small:\r\n small = content[i]\r\n\r\ndef rindexList(list, value):\r\n \"\"\"Find last occurance of smallest integer in the list. Acts as the index method of strings, but for lists. This is for cases where the different people have the same height.\"\"\"\r\n return len(list)-list[::-1].index(value)\r\n\r\n\r\nmoves += len(content)-rindexList(content, small)\r\n\r\nprint(moves)", "def solve(n, heights):\r\n max_height = float(\"-inf\")\r\n min_height = float(\"inf\")\r\n max_index = -1\r\n min_index = -1\r\n\r\n # Loop through the list of heights\r\n for i in range(n):\r\n # If the current height is greater than max_height, update max_height and max_index\r\n if heights[i] > max_height:\r\n max_height = heights[i]\r\n max_index = i\r\n # If the current height is less than or equal to min_height, update min_height and min_index\r\n if heights[i] <= min_height:\r\n min_height = heights[i]\r\n min_index = i\r\n \r\n # Calculate the minimum time\r\n if max_index > min_index:\r\n return max_index + (n - 1 - min_index) - 1\r\n else:\r\n return max_index + (n - 1 - min_index)\r\n\r\n\r\ndef main():\r\n # Reading multiple test cases\r\n n = int(input())\r\n lst = list(map(int, input().split()))\r\n print(solve(n, lst))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nheights = list(map(int, input().split()))\r\nmax_height_index = heights.index(max(heights))\r\nmin_height_index = n - 1 - heights[::-1].index(min(heights))\r\nif max_height_index < min_height_index:\r\n seconds = max_height_index + (n - 1 - min_height_index)\r\nelse:\r\n seconds = max_height_index + (n - 1 - min_height_index) - 1\r\nprint(seconds)\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nmx,mxIdx,mi,miIdx = lst[0],0,lst[-1],n-1\r\nfor i in range(n):\r\n if lst[i]>mx:\r\n mx = lst[i]\r\n mxIdx = i\r\n if lst[i]<=mi:\r\n mi = lst[i]\r\n miIdx = i\r\nif miIdx<mxIdx:\r\n print(mxIdx + (n-1-miIdx) - 1)\r\nelse:\r\n print(mxIdx + (n-1-miIdx))", "n = int(input())\r\na = [int(el) for el in input().split()]\r\nmin_ = min(a)\r\nmax_ = max(a)\r\ni_max = a.index(max_)\r\ni_min = a.index(min_)\r\nfor i in range(i_min + 1, n):\r\n if a[i] == min_:\r\n i_min = i\r\nif i_max < i_min:\r\n print(i_max + (n - i_min) - 1)\r\nelse:\r\n print(i_max + (n - i_min) - 2)\r\n \r\n\r\n", "no_of_soldiers = int(input())\r\n\r\nheights = list(map(int, input().split()))\r\nmax_height, min_height = max(heights), min(heights)\r\n\r\nmin_height_idx_to_move = None\r\nmax_height_idx_to_move = None\r\n\r\nfor idx, height in enumerate(heights):\r\n\tif height == min_height:\r\n\t\tmin_height_idx_to_move = idx\r\n\r\n\tif max_height_idx_to_move is None and height == max_height:\r\n\t\tmax_height_idx_to_move = idx\r\n\r\ntime_taken = (no_of_soldiers - 1 - min_height_idx_to_move) + (max_height_idx_to_move)\r\n\r\nif max_height_idx_to_move > min_height_idx_to_move:\r\n\ttime_taken -= 1\r\n\r\nprint(time_taken)", "n = int(input())\r\nsoldiers = input().split()\r\nsoldiers = [int(i) for i in soldiers]\r\nmax_index,min_index,maxsol,minsol = 0,0,soldiers[0],soldiers[0]\r\nfor i in range(n):\r\n if soldiers[i] > maxsol:\r\n maxsol = soldiers[i]\r\n max_index = i\r\n if soldiers[i] <= minsol:\r\n minsol = soldiers[i]\r\n min_index = i\r\nif min_index > max_index:\r\n print(max_index + (n-min_index-1))\r\nelse:\r\n print(max_index + (n-min_index-2))", "n = int(input())\r\nlinha = input().split()\r\nfor i in range(n):\r\n temp = int(linha[0])\r\n linha.remove(linha[0])\r\n linha.append(temp)\r\n\r\nmoves = 0\r\n\r\ninicio = linha.index(max(linha))\r\nmoves += inicio\r\ntemp = max(linha)\r\nlinha.remove(temp)\r\nlinha.insert(0, temp)\r\na = linha[0]\r\ncontador = 0\r\nfor x in linha[::-1]:\r\n if x == min(linha):\r\n break\r\n contador +=1\r\n\r\nmoves += contador\r\n \r\n\r\n\r\nprint(moves)\r\n", "n = int(input())\r\nheights = [int(x) for x in input().split()]\r\nMax = Min = heights[0]\r\ndist1 = dist2 = 0\r\nfor i in range(n):\r\n if heights[i] > Max:\r\n Max = heights[i]\r\n if heights[i] < Min:\r\n Min = heights[i]\r\ncount = 0\r\nindex1 = heights.index(Max)\r\n\r\nfor i in range(n):\r\n if Max != heights[0]:\r\n heights[index1], heights[index1-1] = heights[index1-1], heights[index1]\r\n count += 1\r\n index1 -= 1\r\n\r\nindex2 = len(heights) - 1 - list(reversed(heights)).index(Min)\r\nfor i in range(n):\r\n if Min != heights[-1]:\r\n heights[index2], heights[index2+1] = heights[index2+1], heights[index2]\r\n count += 1\r\n index2 += 1\r\n\r\n\r\nprint(count)\r\n", "# 2:49\r\nitr = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nmaxi = l.index(max(l))+1\r\ns = min(l)\r\nmini = (itr - l[::-1].index(s)-1)+1\r\nif maxi < mini:\r\n print((itr-mini)+maxi-1)\r\nelse:\r\n print((itr-mini)+maxi-2)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nmin_val = max_val = a[0]\nmin_index = max_index = 0\n\nfor i in range(n):\n if min_val >= a[i]:\n min_val = a[i]\n min_index = i\n if max_val < a[i]:\n max_val = a[i]\n max_index = i\n\nif min_index < max_index:\n min_index = (n - 1) - min_index\n print(min_index + max_index - 1)\nelse:\n min_index = (n - 1) - min_index\n print(min_index + max_index)\n\n \t \t\t\t\t\t \t\t \t \t \t \t \t\t\t \t", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n index1 = a.index(max(a))\r\n index2 = -1\r\n for i in range(n-1, -1, -1):\r\n if a[i] == min(a):\r\n index2 = i\r\n break\r\n if index1 > index2:\r\n print(index1 + n - 1 - index2 - 1)\r\n else:\r\n print(index1 + n-1- index2)\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nsoliders=list(map(int,input().split()))\r\nmin_solider,max_solider=1000,0\r\nmin_index,max_index=0,0\r\nfor i in range(len(soliders)):\r\n if soliders[i]>max_solider:\r\n max_solider=soliders[i]\r\n max_index=i\r\n if soliders[i]<=min_solider:\r\n min_solider=soliders[i]\r\n min_index=i\r\n\r\nif max_index>min_index:\r\n print((max_index-1)+(n-min_index)-1)\r\nelse:\r\n print((max_index-1)+(n-min_index))", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = a.index(max(a))\r\na = [a.pop(a.index(max(a)))] + a\r\ns += a[::-1].index(min(a))\r\nprint(s)", "def solve():\r\n n = int(input())\r\n nums = list(map(int, input().split()))\r\n mini = maxi = 0\r\n minv, maxv = float(\"inf\"), float(\"-inf\")\r\n\r\n for idx, num in enumerate(nums):\r\n if num <= minv:\r\n minv = num\r\n mini = idx\r\n if num > maxv:\r\n maxv = num\r\n maxi = idx\r\n\r\n if mini > maxi:\r\n print(maxi + n - mini - 1)\r\n else:\r\n print(maxi + n - mini - 2)\r\n\r\nif \"__main__\" == __name__:\r\n solve()", "n=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\nmn=min(a)\r\nmx=max(a)\r\nk=0\r\nwhile True:\r\n if a[0]==mx and a[-1]==mn:\r\n break\r\n if a[0]<mx:\r\n k+=1\r\n p=a.index(mx)\r\n a[p],a[p-1]=a[p-1],a[p]\r\n if a[-1]>mn:\r\n k+=1\r\n p=0\r\n for i in range(n):\r\n if a[i]==mn:\r\n p=i\r\n a[p],a[p+1]=a[p+1],a[p]\r\nprint(k)", "n = int(input())\r\nsequence = list(map(int,input().split()))\r\na = min(sequence) # 找到最小的数\r\nb = max(sequence) # 找到最大的数\r\nnum_b = sequence.index(b) # 找到最大的数对应的位置\r\nsequence.reverse()\r\nnum_a = sequence.index(a) # 找到最小的数反向对应的位置\r\n\r\nif num_a + num_b + 2 <= len(sequence):\r\n times = num_a + num_b\r\nelse:\r\n times = num_a + num_b - 1\r\nprint(times)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmax_n = a[0]\r\nmin_n = a[0]\r\nmax_ind = 0\r\nmin_ind = 0\r\nfor i in range(n):\r\n if a[i] <= min_n:\r\n min_n = a[i]\r\n min_ind = i \r\n\r\n if a[i] > max_n:\r\n max_n = a[i] \r\n max_ind = i\r\n\r\nn = n - 1\r\nif max_ind < min_ind:\r\n ans = max_ind + (n - min_ind)\r\n\r\nelse:\r\n ans = max_ind + (n-min_ind) - 1\r\n\r\nprint(ans)\r\n\r\n", "x=int(input(\"\"))\r\nm=input(\"\")\r\nt=m.split(\" \")\r\nl=[]\r\nfor i in t:\r\n l.append(int(i))\r\na=l.index(max(l))\r\nl1=[max(l),]\r\nl.pop(a)\r\nl1.extend(l)\r\nl1.reverse()\r\nb=l1.index(min(l1))\r\nprint(a+b)", "import math\r\n\r\n\r\ndef inp(): # int inputs\r\n return (int(input()))\r\n\r\n\r\ndef inlt(): # list inputs\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr(): # string inputs\r\n s = input()\r\n return (list(s[:len(s)]))\r\n\r\n\r\ndef invr(): # space sepreated intergel varibales\r\n return (map(int, input().split()))\r\n\r\nturns = int(input())\r\nline = inlt()\r\n\r\nmaximum = max(line)\r\nminimum = min(line)\r\n\r\nminimum_position = 0\r\nfor i in range(0, turns):\r\n if (line[i] == minimum):\r\n minimum_position = i\r\n\r\nmaximum_position = 0\r\nfor i in range(turns-1, -1, -1):\r\n if (line[i] == maximum):\r\n maximum_position = i\r\n\r\n\r\nif (minimum_position > maximum_position):\r\n print((turns - minimum_position - 1) + maximum_position)\r\nelse:\r\n print((turns - minimum_position - 1) + maximum_position - 1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\n\r\ndef General(n,arr):\r\n my_min=arr[0]\r\n my_max=arr[0]\r\n min_pos=0\r\n max_pos=0\r\n for i in range (1,n):\r\n if my_min>=arr[i]:\r\n my_min=arr[i]\r\n min_pos=i\r\n elif my_max<arr[i]:\r\n my_max=arr[i]\r\n max_pos=i\r\n if min_pos>max_pos:\r\n return (max_pos+n-min_pos-1)\r\n else:\r\n return (max_pos+n-min_pos-2)\r\nprint(General(n,arr))", "n = int(input())\r\nsldr = list(map(int, input().split(\" \")))\r\n\r\nmin_sldr = min(sldr)\r\nmax_sldr = max(sldr)\r\n\r\nmin_list = [i for i in range(len(sldr)) if sldr[i] == min_sldr]\r\nmin_list.sort()\r\nmin_indx = min_list[-1]\r\n\r\nmax_list = [i for i in range(len(sldr)) if sldr[i] == max_sldr]\r\nmax_list.sort()\r\nmax_indx = max_list[0]\r\n\r\nt_move = (n-1-min_indx)+max_indx\r\nif max_indx > min_indx:\r\n t_move -= 1\r\nprint(t_move)\r\n", "def main():\r\n n = int(input())\r\n h = [int(i) for i in input().split()]\r\n mn = min(h)\r\n mx = max(h)\r\n hash_map = dict()\r\n for i in range(n):\r\n if h[i] == mn or h[i] == mx:\r\n if h[i] not in hash_map:\r\n hash_map[h[i]] = [i]\r\n else:\r\n hash_map[h[i]].append(i)\r\n mx_idx = max(hash_map[mn])\r\n min_move = n - 1 - mx_idx\r\n max_move = min(hash_map[mx])\r\n if mx_idx < max_move:\r\n print(min_move + max_move - 1)\r\n else:\r\n print(min_move + max_move)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\na=list(map(int,input().split()))\r\n \r\nma=a.index(max(a))\r\ni=0\r\nwhile i<n :\r\n if a[i]==min(a) :\r\n ind=i\r\n i+=1\r\nj1=(n-1)-ind\r\nif ma>ind :\r\n print(j1+ma-1)\r\nelse :\r\n print(j1+ma)", "\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmin_val = arr[0]\r\nmax_val = arr[0]\r\nindex_min = 0\r\nindex_max = 0\r\n\r\nfor i in range(n):\r\n if arr[i] > max_val:\r\n max_val = arr[i]\r\n index_max = i\r\n if arr[i] <= min_val:\r\n min_val = arr[i]\r\n index_min = i\r\n\r\nif index_max > index_min:\r\n index_min = (n - 1) - index_min\r\n print(index_min + index_max - 1)\r\nelse:\r\n index_min = (n - 1) - index_min\r\n print(index_min + index_max)\r\n", "n = int(input())\r\nscores = list(map(int, input().split()))\r\nz=max(scores)\r\nm=min(scores)\r\nk=0\r\nx=0\r\nfor i in range(0,n):\r\n if(m==scores[i]):\r\n k=i\r\n\r\nfor i in range(0,n):\r\n if(z==scores[i]):\r\n x=i\r\n break\r\nm=k\r\nz=x\r\n\r\n \r\n# print(m,z)\r\nif m<z:\r\n print(z+n-1-m-1)\r\nelse:\r\n print(z+n-1-m)\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "z=input()\r\na=list(map(int,input().split()))\r\nmini=-1\r\nc=0\r\nfor i in a[::-1]:\r\n if c<=0:\r\n mini+=1\r\n if min(a)==i:\r\n c+=1\r\nmaxi=(a.index(max(a)))\r\n#print(mini,maxi)\r\nma=len(a)-(mini)-1\r\n#print(ma)\r\nif ma<maxi :\r\n print((mini+maxi)-1)\r\nelse:\r\n print(mini+maxi)", "y=int(input())\r\nx=list(map(int,input().split()))\r\n\r\nans=x.index(max(x))+x[::-1].index(min(x))\r\n \r\nif ans>=y: #[ ___ min ____ max ___] 순서의 경우\r\n print(ans-1)\r\nelse: #[___max ___ min___] 순서의 경우\r\n print(ans)\r\n ", "def zamienMiejscami(lista, i, j):\r\n lista[i], lista[j] = lista[j], lista[i]\r\n\r\nliczbaZolnierzy = int(input())\r\nzolnierze = list(map(int, input().split()))\r\n\r\n\r\n\r\nliczbaZmian = 0\r\n\r\n\r\n\r\n\r\nwhile True:\r\n minW = min(zolnierze)\r\n maxW = max(zolnierze)\r\n if maxW == zolnierze[0] and minW == zolnierze[liczbaZolnierzy-1]:\r\n\r\n break\r\n else:\r\n if maxW != zolnierze[0]:\r\n pozMax = zolnierze.index(maxW)\r\n liczbaZmian = pozMax\r\n zolnierze.pop(pozMax)\r\n zolnierze.insert(0,maxW)\r\n\r\n if minW != zolnierze[liczbaZolnierzy-1]:\r\n\r\n pozMin = zolnierze[::-1].index(minW)\r\n liczbaZmian = liczbaZmian + pozMin\r\n zolnierze.pop(pozMin)\r\n zolnierze.insert(liczbaZolnierzy,minW)\r\n\r\n\r\n\r\nprint(liczbaZmian)\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\nheights = list(map(int, input().split()))\r\na = heights[0]\r\nb = heights[n-1]\r\ne=0\r\nf=n-1\r\nfor i in range(n):\r\n if a < heights[i]:\r\n a=heights[i]\r\n e=i\r\n if b>heights[n-1-i]:\r\n b=heights[n-1-i]\r\n f=n-1-i\r\nif e>f:\r\n print(e+n-2-f)\r\nelse: \r\n print(e+n-1-f)\r\n ", "n = int(input())\r\nLINE = list(map(int,list(input().split())))\r\n\r\nTALLEST_INDEX = LINE.index(max(LINE)) + 1 \r\nSHORTEST_INDEX = list(reversed(LINE)).index(min(LINE)) + 1\r\n\r\nif TALLEST_INDEX + SHORTEST_INDEX > n:\r\n print(TALLEST_INDEX + SHORTEST_INDEX - 3)\r\nelse:\r\n print(TALLEST_INDEX + SHORTEST_INDEX - 2)", "t=int(input())\r\na=list(map(int,input().split()))\r\nm1=max(a)\r\nm2=min(a)\r\nind1=a.index(m1)\r\nfor i in range(len(a)):\r\n if a[i]==m2:\r\n ind2=i\r\nif ind2>ind1:\r\n print(ind1+(len(a)-ind2-1))\r\nelse:\r\n print(ind1+(len(a)-ind2-1)-1)\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc,d=max(b),min(b)\r\nc_ind=b.index(c)\r\ni=0\r\nwhile b[0]!=c:\r\n c_ind=b.index(c)\r\n b[c_ind],b[c_ind-1]=b[c_ind-1],b[c_ind]\r\n i+=1\r\nz=b.count(d)\r\nd_ind=b.index(d)\r\nwhile z >1:\r\n d_ind=b.index(d,d_ind+1)\r\n z-=1\r\nx=(len(b)-1)-d_ind\r\nprint(i+x)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nmx=lst[0]\r\nmxi=0\r\nfor i in range(len(lst)):\r\n if(lst[i]>mx):\r\n mx=lst[i]\r\n mxi=i\r\nmn=lst[0]\r\nmni=0\r\nfor i in range(len(lst)):\r\n if(lst[i]<=mn):\r\n mn=lst[i]\r\n mni=i\r\nif(mxi>mni):\r\n print(mxi+n-mni-2)\r\nelse:\r\n print(mxi+n-mni-1)", "n = int(input());del n\r\na = [int(x) for x in input().split()]\r\nb=a.index(max(a))+a[::-1].index(min(a))\r\nprint(b-(b>=len(a)))", "n = int(input())\r\ns = list(map(int, input().split(' ')))\r\n\r\nmax_index = 0\r\nfor i in range(1, n):\r\n if s[i] > s[max_index]:\r\n max_index = i\r\n\r\nfirst = s[max_index]\r\ncount = 0\r\ni = max_index\r\nwhile s[0] != first:\r\n s[i], s[i - 1] = s[i - 1], s[i]\r\n count += 1\r\n i -= 1\r\n\r\nmin_index = -1\r\nfor i in range(-1, -(len(s)) - 1, -1):\r\n if s[i] < s[min_index]:\r\n min_index = i\r\n\r\nend = s[min_index]\r\ni = min_index\r\nwhile s[-1] != end:\r\n s[i], s[i + 1] = s[i + 1], s[i]\r\n count += 1\r\n i += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nmaxn = max(a)\r\nmaxn = a.index(maxn)\r\nfor i in range(maxn, 0, -1):\r\n a[i], a[i-1] = a[i-1], a[i]\r\nb = [a[len(a)-1]]\r\nfor i in range(len(a)-1, 0, -1):\r\n b.append(a[i-1])\r\nminn = min(b)\r\nminn = b.index(minn)\r\nsteps = maxn+minn\r\nprint(steps)", "N = int(input())\r\njärjend = list(map(int,input().split()))\r\npikk = max(järjend)\r\nlühike = min(järjend)\r\n\r\npikka_asukoht = 0\r\nfor i in range(N):\r\n if järjend[i] == pikk:\r\n pikka_asukoht = i\r\n break\r\n\r\nlühikese_asukoht = 0\r\nfor i in range(N):\r\n if järjend[i] == lühike:\r\n lühikese_asukoht = i\r\n\r\nkokku = ((N-1)-lühikese_asukoht) + pikka_asukoht\r\n\r\nif pikka_asukoht > lühikese_asukoht:\r\n kokku -= 1\r\n\r\nprint(kokku)\r\n \r\n", "n = int(input())\r\nl = [*map(int, input().split())]\r\n\r\nans = 0\r\n\r\nbig = [idx for idx, value in enumerate(l) if value == max(l)]\r\nans += big[0]\r\n\r\nj = [l[big[0]]]\r\nl.remove(max(l))\r\nj.extend(l)\r\n\r\nsmall = [x for x, val in enumerate(j) if val == min(j)]\r\nans += n - 1 - small[-1]\r\n\r\nprint(ans)", "n=int(input(\"\"))\r\nL=list(map(int,input().split()))\r\nma=max(L)\r\nmi=min(L)\r\nx=L.index(ma)\r\nL.reverse()\r\ny=L.index(mi)\r\nm=n-1-y \r\nif(x<m):\r\n print(x+y)\r\nelse:\r\n print(x+y-1)", "t=int(input())\r\nn=[int(i) for i in input().split()]\r\nma=max(n)\r\nmi=min(n)\r\nima=0\r\nimi=0\r\nz=0\r\nfor i in range(t):\r\n if ma==n[i] and z==0:\r\n z+=1\r\n ima=i+1\r\n if mi==n[i]:\r\n imi=i+1\r\nif ima>imi:\r\n print(abs(ima-1)+abs(imi-t)-1)\r\nelse:\r\n print(abs(ima-1)+abs(imi-t))", "n = int(input())\r\nheight = list(map(int, input().split()))\r\n\r\nmax = height[0]\r\nmin = height[0]\r\nmax_i = 0\r\nmin_i = 0\r\n\r\nfor i in range(n): \r\n if height[i] > max: # 가장 앞에 있는 최댓값 구하기\r\n max = height[i]\r\n max_i = i\r\n\r\n if height[i] <= min: # 가장 뒤에 있는 최댓값 구하기\r\n min = height[i]\r\n min_i = i\r\n\r\nif min_i < max_i: # 제일 작은 친구가 max인 친구보다 앞에 있으면,\r\n print(max_i + (n-1 - min_i) -1 )\r\nelse:\r\n print(max_i + (n-1 - min_i) )\r\n", "n=int(input())\na=list(map(int,input().split()))\nmn=min(a)\nmx=max(a)\nkn=kx=-1\nfor i in range(n):\n if mx==a[i]:\n kx=i\n break\nfor i in range(n-1,-1,-1):\n if mn==a[i]:\n kn=i\n break\n# print(kn,kx)\nif kx<kn:\n print(-kn+n+kx-1)\nelse:\n print(-kn+n+kx-2)", "def rindex(a, x):\r\n for i in range(len(a) -1 ,- 1, -1):\r\n if a[i] == x:\r\n return i\r\n return -1\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nmaxind = a.index(max(a))\r\n\r\nminind = rindex(a, min(a))\r\n\r\nif minind < maxind:\r\n print(maxind + n - minind - 2)\r\nelse:\r\n print(maxind + n - minind - 1)\r\n", "def rindex(lst, value):\r\n return len(lst) - lst[::-1].index(value) - 1\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\na = min(l)\r\nb = max(l)\r\ni = rindex(l, a)\r\nj = l.index(b)\r\nx = (n-1 - i) + j\r\nif i < j:\r\n print(x - 1)\r\nelse:\r\n print(x)", "n = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nmax_height = max(heights)\r\nmin_height = min(heights)\r\nmax_height_pos = heights.index(max_height)\r\nmin_height_pos = heights[::-1].index(min_height)\r\nmin_seconds = max_height_pos + min_height_pos\r\n\r\nif max_height_pos + min_height_pos >= n:\r\n min_seconds -= 1\r\n\r\nprint(min_seconds)\r\n", "n = int(input())\r\nq = list(map(int,input().split()))\r\na = [0]*10000\r\nb = int(0)\r\ns = int(0)\r\nfor i in range (len(q)):\r\n if q[b] < q[i]:\r\n #print(q[b],q[i])\r\n b = i\r\n if q[s] >= q[i]:\r\n #print(q[s], q[i])\r\n s = i\r\n#print(b,s)\r\nc = len(q) - (s+1)\r\n#print(c)\r\nif b>s:\r\n print((b+c)-1)\r\nelse:\r\n print(b+c)", "\r\nn = int(input())\r\nns = list(map(int, input().split()))\r\nc = 0\r\nmaxin = max(ns)\r\nminm = min(ns)\r\nlminm = len(ns) - 1\r\n\r\nstart = 1\r\nwhile ns[0] != maxin:\r\n ns[0], ns[start] = ns[start], ns[0]\r\n start+=1\r\n\r\nend = 1\r\nwhile ns[lminm] != minm:\r\n ns[lminm], ns[lminm - end] = ns[lminm - end], ns[lminm]\r\n end += 1\r\n\r\nprint(start +end - 2)", "from _ast import While\r\nfrom math import inf\r\nfrom collections import *\r\nimport math, os, sys, heapq, bisect, random, threading\r\nfrom functools import lru_cache, reduce\r\nfrom itertools import *\r\n\r\n\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef out(var): sys.stdout.write(str(var))\r\n\r\n\r\ndef binary_search(arr, target):\r\n left, right = 0, len(arr) - 1\r\n\r\n while left <= right:\r\n mid = left + (right - left) // 2 # Calculate the middle index\r\n\r\n if arr[mid] == target:\r\n return mid # Found the target, return its index\r\n elif arr[mid] < target:\r\n left = mid + 1 # Target is in the right half\r\n else:\r\n right = mid - 1 # Target is in the left half\r\n\r\n return -1 # Target not found in the array\r\n\r\n\r\n'''''''''\r\nBELIVE\r\n0 «.»\r\n1 «-.»\r\n2 «--»\r\n'''''''''\r\n\r\n# sys.stdin = open(\"test\", 'r')\r\n# Write your code here\r\nn = int(input()) - 1\r\na = list(map(int, input().split()))\r\n# mx = max(a)\r\n# mn = min(a)\r\n# inn = []\r\n# ixx = []\r\n# ans = 0\r\n# for i in range(n):\r\n# if a[i] == mx:\r\n# ixx.append(i)\r\n# if a[i] == mn:\r\n# inn.append(i)\r\n#\r\n# for i in range(n):\r\n# if a[i] == mx:\r\n# if i == min(ixx):\r\n# ans += i\r\n# if a[i] == mn:\r\n# if i == max(inn):\r\n# ans += n - i - 1\r\n# if max(inn) < min(ixx):\r\n# ans += -1\r\n\r\nprint(n - (abs(a[::-1].index(min(a)) - n)) + a.index(max(a)) if (abs(a[::-1].index(min(a)) - n)) > a.index(max(a)) else n - (abs(a[::-1].index(min(a)) - n)) + a.index(max(a)) - 1)\r\n", "def hallar_pos_num_mayor(fila):\r\n mayor = 0 \r\n posicion_mayor = 0\r\n for i in range(len(fila)):\r\n if fila[i] > mayor:\r\n mayor = fila[i]\r\n posicion_mayor = i\r\n return posicion_mayor\r\n\r\n\r\ndef hallar_pos_num_menor(fila):\r\n menor = 9999\r\n posicion_menor = 0\r\n tam = len(fila) - 1\r\n\r\n for i in range(tam,-1,-1):\r\n if fila[i] < menor:\r\n menor = fila[i]\r\n posicion_menor = i\r\n return posicion_menor\r\n\r\n\r\n\r\nn_soldados = int(input())\r\nfila = list(map(int,input().split()))\r\ntam = len(fila) - 1\r\n\r\npos_num_mayor = hallar_pos_num_mayor(fila)\r\npos_num_menor = hallar_pos_num_menor(fila)\r\nposicion_mayor = pos_num_mayor\r\nposicion_menor = pos_num_menor\r\n\r\nif posicion_mayor < posicion_menor:\r\n tiempo1 = (posicion_mayor - 0) \r\n tiempo2 = (tam - posicion_menor)\r\n tiempofinal = tiempo1 + tiempo2\r\nelse:\r\n tiempo1 = (posicion_mayor - 0) \r\n tiempo2 = (tam - posicion_menor)\r\n tiempofinal = (tiempo1 + tiempo2) - 1 \r\n\r\nprint(tiempofinal)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nminimum=min(l)\r\nmaximum=max(l)\r\ncounter=0\r\nl1=list(l)\r\nl1.reverse()\r\nl2=list(l)\r\nindex1=l1.index(minimum)\r\nindex2=l2.index(maximum)\r\nx=len(l)-index1-1\r\ny=index2\r\nif minimum==maximum:\r\n print(0)\r\nelif minimum!=maximum:\r\n if x<y:\r\n f=n-1-x+y-1\r\n print(f)\r\n elif x>y:\r\n f=n-1-x+y\r\n print(f)\r\n\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nmaxind=a.index(max(a))\r\nfor i in range(n-1,-1,-1):\r\n if a[i]==min(a):\r\n minind=i\r\n min_backind=n-1-i\r\n break\r\nif maxind>minind:\r\n print(maxind+min_backind-1)\r\nelif maxind<minind:\r\n print(maxind+min_backind)\r\n", "x = int(input())\r\nmas = list(map(int, input().split()))\r\nc1 = 0\r\nc2 = 0\r\nfor i in mas:\r\n if i == max(mas):\r\n break\r\n c1 += 1\r\nmax_mas = mas[c1]\r\nmas.pop(c1)\r\nfor i in reversed(mas):\r\n if i == min(mas):\r\n break\r\n c2 += 1\r\nprint(c1 + c2)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmax_height = a[0]\r\nmax_pos = 0\r\nfor i in range(n):\r\n if a[i] > max_height:\r\n max_height = a[i]\r\n max_pos = i\r\n\r\nmin_height = a[n-1]\r\nmin_pos = n-1\r\nfor i in range(n-2, -1, -1):\r\n if a[i] < min_height:\r\n min_height = a[i]\r\n min_pos = i\r\n\r\nif max_pos > min_pos:\r\n print(max_pos + (n - 1 - min_pos) - 1)\r\nelse:\r\n print(max_pos + (n - 1 - min_pos))", "class Solution:\r\n def __init__(self):\r\n pass\r\n\r\n def solver(self, nums):\r\n n = len(nums)\r\n moves = 0\r\n mx = max(nums)\r\n mn = min(nums)\r\n imax = 0\r\n imin = 0\r\n for i in range(n):\r\n if nums[i] == mx:\r\n imax = i\r\n break\r\n for i in range(n):\r\n if nums[i] == mn:\r\n imin = i\r\n moves += imax\r\n moves += (n - 1 - imin)\r\n if imax > imin:\r\n moves -= 1\r\n return moves\r\n\r\n def sovle(self):\r\n n = int(input())\r\n nums = list(map(int, input().split()))\r\n print(self.solver(nums))\r\n\r\ns = Solution()\r\ns.sovle()\r\n", "n=int(input())\r\na=input().split()\r\nw=[]\r\nfor a1 in a:\r\n a1=int(a1)\r\n w.append(a1)\r\nk=1\r\nr=0\r\nf=-2\r\nwhile w[0]!=max(w):\r\n w[0],w[k]=w[k],w[0]\r\n k+=1\r\n r+=1\r\nwhile w[-1]!=min(w):\r\n w[-1],w[f]=w[f],w[-1]\r\n f-=1\r\n r+=1\r\nprint(r)", "l = int(input())\r\ninp = list(map(int, input().split()))\r\n\r\nfor i in range(l):\r\n if inp[i] == max(inp):\r\n max_idx = i\r\n break\r\nfor j in range(l-1,-1,-1):\r\n if inp[j] == min(inp):\r\n min_idx = j\r\n break\r\nif max_idx<min_idx:\r\n print(max_idx+(l-1-min_idx))\r\nelse:\r\n print(max_idx+(l-1-min_idx)-1)", "n = int(input())\r\nmax, min = 0, 0\r\nsoldiers = list(map(int, input().split()))\r\nfor x in range(n):\r\n if soldiers[max] < soldiers[x]:\r\n max = x\r\n if soldiers[min] >= soldiers[x]:\r\n min = x\r\n \r\nans = max + n - min -1\r\nif max > min:\r\n ans -= 1\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nax = a[0]\r\nbn = a[0]\r\nc = 0\r\nd = 0\r\n\r\nfor i in range(n):\r\n if a[i] > ax:\r\n c = i\r\n ax = max(a[i], ax)\r\n\r\nfor i in range(n):\r\n if a[i] <= bn:\r\n d = i\r\n bn = min(a[i], bn)\r\n\r\nif d < c:\r\n f = c + (n - 1 - d) - 1\r\n print(f)\r\nelse:\r\n f = c + (n - 1 - d)\r\n print(f)\r\n", "n = int(input())\nxs = list(map(int, input().split()))\nma = max(xs)\nmi = min(xs)\ni = xs.index(ma)\nj = n - 1 - list(reversed(xs)).index(mi)\nprint(i + (n - 1 - j) - (j < i))\n", "n = int(input())\r\nheights = list(map(int, input().split()))\r\n\r\nmax_height_index = heights.index(max(heights))\r\nmin_height_index = heights[::-1].index(min(heights))\r\n\r\nif max_height_index + min_height_index >= n:\r\n print(max_height_index + min_height_index - 1)\r\nelse:\r\n print(max_height_index + min_height_index)\r\n", "n = input()\r\narr = input()\r\nmax_value = 0\r\nmin_value = 1000\r\nmini_idx = -1\r\nmax_idx = -1\r\ngiven_arr = [\r\n int(each.strip())\r\n for each in arr.split()\r\n]\r\nans = 0\r\nfor i in range(len(given_arr)):\r\n if given_arr[i] > max_value:\r\n max_value = given_arr[i]\r\n max_idx = i\r\n if given_arr[i] <= min_value:\r\n min_value = given_arr[i]\r\n mini_idx = i\r\nif max_idx > mini_idx:\r\n ans = len(given_arr) -1 - mini_idx + max_idx -1\r\nelse:\r\n ans = len(given_arr) -1 - mini_idx + max_idx\r\n\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\nx = a.index(max(a))\r\ny = a[::-1].index(min(a))\r\nans += x + y\r\nif n - y - 1 < x:\r\n ans -= 1\r\nprint(ans)\r\n", "n = int(input())\r\nq = [int(i) for i in input().split()]\r\n\r\nmaxm = q.index(max(q))\r\n\r\nfor i in range(n-1,-1,-1):\r\n if q[i] == min(q):\r\n minm = i\r\n break\r\nif maxm < minm:\r\n print(maxm+(n-1-minm))\r\nelse:\r\n print(maxm+(n-1-minm)-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Arrival_of_the_General():\r\n n = inp()\r\n sequence = inlt()\r\n max_ht = max(sequence)\r\n min_ht = min(sequence)\r\n\r\n max_ht_index = []\r\n min_ht_index = []\r\n\r\n for index,ht in enumerate(sequence):\r\n if ht == max_ht:\r\n max_ht_index.append(index) \r\n if ht == min_ht:\r\n min_ht_index.append(index) \r\n \r\n smallest_max_ht_index = min(max_ht_index)\r\n largest_min_ht_index = max(min_ht_index)\r\n\r\n if smallest_max_ht_index < largest_min_ht_index:\r\n steps = (smallest_max_ht_index) + (n-1-largest_min_ht_index)\r\n else:\r\n steps = (smallest_max_ht_index) + (n-1-largest_min_ht_index) - 1\r\n \r\n print(steps)\r\n return \r\n\r\nArrival_of_the_General()", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split(' ')))\r\n sum = 0\r\n _min = min(a)\r\n imin = a[::-1].index(_min)\r\n imin = len(a) - imin - 1\r\n\r\n for i in range(imin, len(a) - 1):\r\n a[i], a[i + 1] = a[i + 1], a[i]\r\n sum += 1\r\n\r\n _max = max(a)\r\n imax = a.index(_max)\r\n\r\n for i in range(imax, 0, - 1):\r\n a[i], a[i - 1] = a[i - 1], a[i]\r\n sum += 1\r\n print(sum)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmaxi=l[0]\r\nmini=l[0]\r\nmax_index=0\r\nmin_index=0\r\nfor i in range(n):\r\n if(l[i]>maxi):\r\n max_index=i\r\n maxi=l[i]\r\n if(l[i]<=mini):\r\n min_index=i\r\n mini=l[i]\r\nif(max_index>min_index):\r\n print(n-1-min_index+max_index-1)\r\nelse:\r\n print(n-1-min_index+max_index)\r\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nlef = min(a)\r\nrig = max(a)\r\nvmin = [i for i in range(n) if a[i]==lef]\r\nvmax = [i for i in range(n) if a[i]==rig]\r\np1 = vmin[-1]\r\np2 = vmax[0]\r\nans = p2+n-p1-1\r\nif p1<=p2:\r\n ans-=1\r\nprint(str(ans)+\"\\n\")\r\n", "n = int(input())\nheights = [int(x) for x in input().split()]\n\nseconds = 0\n\nax = min(heights)\nan = max(heights)\n\nseconds += heights.index(an)\nheights.remove(an)\nheights.insert(0, an)\n\nindex = len(heights) - 1 - heights[::-1].index(ax)\n\nseconds += ((len(heights) - 1) - index)\n\nprint(seconds)", "def main():\r\n n = int(input())\r\n hghts = list(map(int, input().split()))\r\n mx, mn = [0, 0], [101, 0]\r\n for i, h in enumerate(hghts):\r\n if h > mx[0]:\r\n mx = [h, i]\r\n if h <= mn[0]:\r\n mn = [h, i]\r\n ans = mx[1] + n-1-mn[1]\r\n if mx[1] > mn[1]:\r\n ans -= 1\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\n# sys.stderr = open(\"error.txt\", \"w\")\r\n# # your remaining code\r\n\r\nt = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\n\r\nx,y = -1,-1\r\n\r\nmn,mx = 1000000 , -1000000\r\n\r\nfor i in reversed(range(t)):\t\r\n\tif a[i] < mn :\r\n\t\tmn = a[i]\r\n\t\ty=i\r\nfor i in range(t):\r\n\tif a[i] > mx :\r\n\t\tmx = a[i]\r\n\t\tx=i\r\n\r\ntx = -1\r\nty = -1\r\n\r\nif x > y :\r\n\ty+=1\r\n\r\nif x==0 :\r\n\ttx = 0\r\nelif x != 0 :\r\n\ttx = x\r\n\r\nif y == t-1:\r\n\tty = 0\r\nelif y!= t-1 :\r\n\tty = t-1 - y\r\n\r\nprint(tx+ty)\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def arrange(list,n):\r\n count=0\r\n #find the index of max incase of duplicate take the first one\r\n h=list.index(max(list))\r\n #incase of duplicate take the last min one\r\n l=n-list[::-1].index(min(list))-1\r\n\r\n if h>l:\r\n count = (n-l-1)+(h-1)\r\n else:\r\n count = (n-l-1)+h\r\n \r\n return count\r\n# #taking a number input\r\nn=int(input())\r\nstr=input()\r\n# #convert str into int array\r\nlist=[int(x) for x in str.split()]\r\nprint(arrange(list,n))", "def highest_index(n,l,x):\r\n a=[]\r\n for i in range(n):\r\n if l[i]==x:\r\n a.append(i)\r\n return max(a)\r\n\r\n\r\nn = int(input())\r\nl=list(map(int,input().split()))\r\nif l.index(max(l)) < highest_index(n,l,min(l)):\r\n print(l.index(max(l)) + n -1 -highest_index(n,l,min(l)))\r\nelse:\r\n print(l.index(max(l)) + n -2 -highest_index(n,l,min(l))) ", "n = int(input())\r\nline = list(map(int, input().split()))\r\n\r\n\r\nminimum = min(line)\r\n\r\nmaximum = max(line)\r\n\r\ncount = line.index(maximum)\r\n\r\nline.pop(count)\r\n\r\nline.insert(0, count)\r\n\r\nline.reverse()\r\n\r\ncount += line.index(minimum)\r\n\r\nprint(count)\r\n\r\n", "n = int(input())\r\ns = input().split()\r\nmy_list = [int(i) for i in s]\r\nmy_list1 = my_list[-1::-1]\r\nm = my_list.index(max(my_list))\r\nmi = my_list1.index(min(my_list))\r\nmi1 = 0\r\nif mi != 0 and mi != 1:\r\n mi -= 1\r\n for i in range(len(my_list)):\r\n if my_list[i] == min(my_list) and i > mi1:\r\n mi1 = i\r\n if mi1 > m:\r\n mi += 1\r\nif len(my_list) == 2:\r\n print(m)\r\nelse:\r\n print(m + mi)", "n = int(input())\r\nmas = [int(el) for el in input().split()]\r\nmx = 0\r\nmn = 0\r\nfor i in range(n):\r\n if mas[i] > mas[mx]:\r\n mx = i\r\n if mas[i] <= mas[mn]:\r\n mn = i\r\nprint(mx + n - 1 - mn - int(mx > mn))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmi=0\r\nsi=0\r\nfor i in range(1,n):\r\n if l[mi]<l[i]:\r\n mi=i \r\n if l[si]>=l[i]:\r\n si=i\r\nans=mi+(n-1-si)\r\nif si<mi:\r\n print(ans-1)\r\nelse:\r\n print(ans)", "n = int(input()) \r\nheights = list(map(int, input().split())) \r\nmax_value = max(heights)\r\nmin_value = min(heights)\r\nmax_index = heights.index(max_value)\r\nmin_index = len(heights) - heights[::-1].index(min_value) - 1\r\ntotal_swaps = max_index + (n - 1 - min_index)\r\nif max_index > min_index:\r\n total_swaps -= 1\r\nprint(total_swaps)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmaxi,mini=0,n-1\r\nfor i in range(n):\r\n if l[i]>l[maxi]:\r\n maxi=i\r\nfor i in range(n-1,-1,-1):\r\n if l[i]<l[mini]:\r\n mini=i\r\nif maxi<mini:\r\n print(maxi+n-1-mini)\r\nelse:\r\n print(maxi+n-2-mini)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nz=[]\r\nmin=101\r\nmax = 0\r\nfor i in range(a):\r\n if b[i] <= min:\r\n min = b[i]\r\n if b[i] >= max:\r\n max = b[i]\r\nMinM =[]\r\nMaxM =[]\r\nfor i in range(len(b)):\r\n if b[i] == min:\r\n MinM.append(i)\r\n if b[i] == max:\r\n MaxM.append(i)\r\nx= len(MinM) + len(MaxM)\r\n\r\nmoves = MaxM[0]\r\nif MinM[len(MinM)-1] > MaxM[0]:\r\n moves += len(b)-1 - MinM[len(MinM)-1]\r\nelif MaxM[0] > MinM[len(MinM)-1]:\r\n moves += len(b)-1 - MinM[len(MinM)-1] -1\r\nprint(moves)\r\n\r\n\r\n", "def last_occurrence(arr, x):\r\n last_idx = -1 # Khởi tạo vị trí cuối cùng\r\n for i in range(len(arr)):\r\n if arr[i] == x:\r\n last_idx = i\r\n return last_idx\r\nt = int(input())\r\nip = input().split(' ')\r\narr = list(map(int,ip))\r\nmin = min(arr)\r\nmax = max(arr)\r\nmin_index = last_occurrence(arr,min)\r\nmax_index = arr.index(max)\r\nif max_index > min_index:\r\n print(max_index-1 + t-min_index-1)\r\nelse:\r\n print(max_index-1 + t-min_index)\r\n\r\n\r\n", "def min_moves_to_sort(n, soldiers):\r\n max_height = max(soldiers)\r\n min_height = min(soldiers)\r\n max_index = soldiers.index(max_height)\r\n min_index = soldiers[::-1].index(min_height)\r\n return max_index + min_index if max_index + min_index <= n - 1 else max_index + min_index - 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n soldiers = list(map(int, input().split()))\r\n result = min_moves_to_sort(n, soldiers)\r\n print(result)\r\n" ]

[ "mod=1000000007\r\ndef powmod(a, b, mod):\r\n res = 1\r\n a %= mod\r\n assert b >= 0\r\n while b:\r\n if b & 1:\r\n res = res * a % mod\r\n a = a * a % mod\r\n b >>= 1\r\n return res\r\nN = 10100\r\nn, k = map(int, input().split())\r\npoly = [0] * N\r\nq = [0] * N\r\nret = [0] * N\r\na = list(map(int, input().split()))\r\nans = 0\r\npoly[0] = 1\r\nfor i in range(n):\r\n for j in range(i, -1, -1):\r\n poly[j + 1] = (poly[j] + poly[j + 1]) % mod\r\n poly[j] = poly[j] * (mod - a[i]) % mod\r\nfor i in range(n):\r\n for j in range(n + 1):\r\n q[j] = poly[j]\r\n for j in range(n, 0, -1):\r\n ret[j - 1] = (ret[j - 1] + q[j]) % mod\r\n q[j - 1] = (q[j - 1] + q[j] * a[i]) % mod\r\ncoef = 1\r\nfor i in range(n):\r\n coef = coef * (k - i) % mod\r\n ans = (ans + powmod(n, mod - 2 - i, mod) * coef % mod * powmod(i + 1, mod - 2, mod) % mod * ret[i]) % mod\r\nans = ans * powmod(mod - 1, n + 1, mod) % mod\r\nprint(ans)# 1693218474.6046677" ]

[ "def solve(mid):\r\n tmp = 0\r\n for i in cnt_t:\r\n if cnt_t[i] * mid <= cnt_s[i]:\r\n pass\r\n else:\r\n tmp += cnt_t[i] * mid - cnt_s[i]\r\n return tmp <= cnt_s[\"?\"]\r\n\r\ndef solve2(mid):\r\n tmp = deque([])\r\n for i in cnt_t:\r\n if cnt_t[i] * mid <= cnt_s[i]:\r\n pass\r\n else:\r\n for _ in range(cnt_t[i] * mid - cnt_s[i]):\r\n tmp.append(i)\r\n return tmp\r\n \r\n\r\nfrom collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\nt = input()[:-1]\r\n\r\ncnt_s = {\"?\": 0}\r\ncnt_t = {}\r\nfor i, char in enumerate(t):\r\n if char not in cnt_t:\r\n cnt_t[char] = 1\r\n cnt_s[char] = 0\r\n else:\r\n cnt_t[char] += 1\r\nfor i, char in enumerate(s):\r\n if char not in cnt_s:\r\n cnt_s[char] = 1\r\n else:\r\n cnt_s[char] += 1\r\n\r\n\r\nok = -1\r\nng = 10 ** 9\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) // 2\r\n if solve(mid):\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\n\r\ns = list(s)\r\nq = solve2(ok)\r\n\r\nfor i in range(len(s)):\r\n if s[i] == \"?\":\r\n if q:\r\n s[i] = q.pop()\r\n else:\r\n s[i] = \"a\"\r\nprint(\"\".join(s))", "def check(mid,ha,has,c):\r\n need=0\r\n for i in range(26):\r\n need+=max(0,ha[i]*mid-has[i])\r\n# print(mid,need) \r\n return c>=need \r\nss='abcdefghijklmnopqrstuvwxyz'\r\ns = list(input())\r\nt = list(input())\r\nha=[0]*26\r\nhas=[0]*26\r\nm=10000000000\r\nc=0\r\nfor i in t:\r\n ha[ord(i)-ord('a')]+=1\r\nfor i in s:\r\n if i=='?':\r\n c+=1\r\n else: \r\n has[ord(i)-ord('a')]+=1\r\nl=0\r\nr=10000000000\r\n#print(has,ha)\r\nwhile l<=r:\r\n mid = l + (r-l)//2\r\n if(check(mid,ha,has,c)):\r\n l=mid+1\r\n else:\r\n r=mid-1\r\nj=0\r\nll=len(s)\r\nfor i in range(26):\r\n req=max(0,ha[i]*r-has[i])\r\n while j<ll and req!=0:\r\n if s[j]=='?':\r\n s[j]=ss[i]\r\n req-=1\r\n j+=1\r\nfor i in range(ll):\r\n if s[i]=='?':\r\n s[i]='a' \r\nprint(''.join(s)) \r\n\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2 + 1) // 2\r\n while abs(c1 - c2) > 1:\r\n m = (c1 + c2 + 1) // 2\r\n if ok(m):\r\n c1 = m\r\n else:\r\n c2 = m\r\n ans = max(0, m - 3)\r\n while ok(ans):\r\n ans += 1\r\n ans -= 1\r\n return ans\r\n\r\ndef ok(m):\r\n d = 0\r\n for i in alph:\r\n d += max(0, m * cnt2[i] - cnt1[i])\r\n return True if d <= x else False\r\n\r\ns = list(input().rstrip())\r\nt = list(input().rstrip())\r\nh = []\r\ncnt1 = defaultdict(lambda : 0)\r\ncnt2 = defaultdict(lambda : 0)\r\nfor i in s:\r\n cnt1[i] += 1\r\nfor i in t:\r\n cnt2[i] += 1\r\nx = cnt1[\"?\"]\r\nalph = [chr(i) for i in range(97, 123)]\r\nc = binary_search(0, len(s) + 1)\r\ny = []\r\nfor i in alph:\r\n for j in range(max(0, c * cnt2[i] - cnt1[i])):\r\n y.append(i)\r\nfor i in range(len(s)):\r\n if s[i] == \"?\":\r\n if y:\r\n s[i] = y.pop()\r\n else:\r\n s[i] = \"a\"\r\nprint(\"\".join(s))", "from collections import Counter\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\nt = input().rstrip()\r\ncnt1 = Counter(s)\r\ncnt2 = Counter(t)\r\n\r\nif cnt1['?'] == 0:\r\n print(*s, sep='')\r\n exit()\r\n\r\nok, ng = 0, 10**9\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) // 2\r\n hatena = cnt1['?']\r\n for k, v in cnt2.items():\r\n hatena -= max(0, v*mid - cnt1[k])\r\n\r\n if hatena >= 0:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\nkeys = list(cnt2.keys())\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '?':\r\n while keys and cnt2[keys[-1]] * ok <= cnt1[keys[-1]]:\r\n keys.pop()\r\n if keys:\r\n s[i] = keys[-1]\r\n cnt1[keys[-1]] += 1\r\n else:\r\n s[i] = 'z'\r\n\r\nprint(*s, sep='')\r\n", "import sys\r\n#import random\r\nfrom bisect import bisect_left as lb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue as pq\r\nfrom math import *\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\ninv =lambda x:pow(x,mod-2,mod)\r\nmod = 10**9 + 7\r\n \r\ns = list(ip())\r\nt = ip()\r\n\r\nl = [0 for i in range (26)]\r\n\r\nfor i in s :\r\n if (i != \"?\") :\r\n l[ord(i)-97] += 1\r\n\r\ni = 0\r\nc = 0\r\n\r\nwhile (i<len(s)) :\r\n if (s[i] == \"?\") :\r\n c += 1\r\n if (l[ord(t[c%len(t)]) - 97] > 0) :\r\n l[ord(t[c%len(t)]) - 97] -= 1\r\n i -= 1\r\n\r\n else :\r\n s[i] = t[c%len(t)]\r\n\r\n i += 1\r\n \r\n\r\nprint(\"\".join(s))\r\n", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\ndef can(x):\r\n rem = ops\r\n for k in need:\r\n rem -= max(0, x*need[k]-have[k])\r\n return rem >= 0\r\n\r\ns = list(input())\r\nt = input()\r\nneed, have = {}, {}\r\nfor ti in t:\r\n if ti in need:\r\n need[ti] += 1\r\n else:\r\n have[ti] = 0\r\n need[ti] = 1\r\nops = 0\r\nfor si in s:\r\n if si in have: have[si] += 1\r\n elif si == '?': ops += 1\r\n\r\nlow, high = 0, len(s)//len(t)\r\nwhile low <= high:\r\n mid = (low+high)//2\r\n if can(mid):\r\n ans = mid\r\n low = mid+1\r\n else:\r\n high = mid-1\r\n\r\nx = []\r\nfor k in need:\r\n for i in range(max(0, ans*need[k]-have[k])):\r\n x.append(k)\r\nj = 0\r\nfor i in range(len(s)):\r\n if s[i] != '?': continue\r\n if j == len(x): s[i] = 'z'\r\n else:\r\n s[i] = x[j]\r\n j += 1\r\nprint(''.join(s))", "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\ns = input().strip()\r\nt = input().strip()\r\nfreq = [0] * 26\r\nfor c in t:\r\n freq[ord(c) - ord('a')] += 1\r\nf = [0] * 26\r\nfor c in s:\r\n if c == \"?\": continue\r\n f[ord(c) - ord('a')] += 1\r\n\r\nb = []\r\nfor i in range(26):\r\n if freq[i] > 0: heappush(b, (f[i]//freq[i], i))\r\n\r\nss = []\r\nfor i in range(len(s)):\r\n if s[i] != \"?\":\r\n ss.append(s[i])\r\n else:\r\n g, c = heappop(b)\r\n f[c] += 1\r\n ss.append(chr(ord('a') + c))\r\n heappush(b, (f[c]//freq[c], c))\r\nprint(\"\".join(ss))", "import sys\r\nfrom collections import Counter\r\n\r\ns = list(sys.stdin.buffer.readline().decode('utf-8').rstrip())\r\ns_cnt = Counter(s)\r\nt_cnt = Counter(sys.stdin.buffer.readline().decode('utf-8').rstrip())\r\n\r\nok, ng = 0, 10**6+1\r\nhatena = s_cnt['?']\r\n\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) >> 1\r\n req = 0\r\n for k, v in t_cnt.items():\r\n req += max(0, v*mid - s_cnt[k])\r\n if req <= hatena:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\nkeys = list(t_cnt.keys())\r\n\r\nfor i in range(len(s)):\r\n if s[i] != '?':\r\n continue\r\n\r\n while keys and t_cnt[keys[-1]] * ok <= s_cnt[keys[-1]]:\r\n keys.pop()\r\n if keys:\r\n s[i] = keys[-1]\r\n s_cnt[keys[-1]] += 1\r\n else:\r\n s[i] = 'a'\r\n\r\nsys.stdout.buffer.write((''.join(s)).encode('utf-8'))\r\n", "import sys\r\nfrom array import array\r\nfrom heapq import *\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ns, t = array('u', input()), array('u', input())\r\nmem = [0] * 26\r\nrem = [0] * 26\r\n\r\nfor i in t:\r\n mem[ord(i) - 97] += 1\r\n\r\nfor i in s:\r\n if i != '?':\r\n rem[ord(i) - 97] += 1\r\n\r\nque = []\r\nfor i in range(26):\r\n if mem[i]:\r\n que.append((rem[i] // mem[i], i))\r\n\r\nheapify(que)\r\nfor i in range(len(s)):\r\n if s[i] == '?':\r\n div, ch = heappop(que)\r\n s[i] = chr(ch + 97)\r\n rem[ch] += 1\r\n heappush(que, (rem[ch] // mem[ch], ch))\r\n\r\nprint(''.join(s))\r\n", "import sys\r\nfrom array import array\r\nfrom string import ascii_lowercase as chrs\r\n\r\n\r\nclass dict_(dict):\r\n def __missing__(self, key):\r\n return 0\r\n\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ns, t = array('u', input()), array('u', input())\r\nmem = [0] * 26\r\nrem = [0] * 26\r\n\r\nfor i in t:\r\n mem[ord(i) - 97] += 1\r\n\r\nfor i in s:\r\n if i != '?':\r\n rem[ord(i) - 97] += 1\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '?':\r\n mi = 10 ** 9\r\n for j in range(26):\r\n if mem[j]:\r\n mi = min(mi, rem[j] // mem[j])\r\n\r\n for j in range(26):\r\n if mem[j] and rem[j] // mem[j] == mi:\r\n s[i] = chr(j + 97)\r\n rem[j] += 1\r\n break\r\n\r\nprint(''.join(s))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nS = input()\r\nT = input()\r\ncs = Counter(S)\r\nct = Counter(T)\r\n\r\nans = [c for c in S]\r\nidx = 0\r\n\r\ndef paint(m,k):\r\n global idx\r\n cnt = 0\r\n while idx<len(S):\r\n if ans[idx]=='?':\r\n ans[idx] = k\r\n cnt+=1\r\n if cnt==m:break\r\n idx+=1\r\n\r\nwhile True:\r\n ok = True\r\n for k,v in ct.items():\r\n if cs[k]>=v:\r\n cs[k]-=v\r\n elif cs['?']+cs[k]>=v:\r\n cs['?']-=v-cs[k]\r\n paint(v-cs[k],k)\r\n cs[k]=0\r\n else:\r\n ok = False\r\n break\r\n if not ok:break\r\npaint(len(S), 'a')\r\nprint(''.join(ans))\r\n", "def get_ord(x):\r\n return ord(x) - ord('a')\r\n \r\ns = input()\r\nt = input()\r\nbar = [0 for _ in range(26)]\r\nfor i in range(len(t)):\r\n bar[get_ord(t[i])] += 1\r\n \r\nq = 0\r\naar = [0 for _ in range(26)]\r\nfor i in range(len(s)):\r\n if s[i] == '?':\r\n q += 1\r\n else:\r\n aar[get_ord(s[i])] += 1\r\n\r\nl = 0\r\nr = len(s) // len(t) + 2\r\n\r\nwhile r - l > 1:\r\n mid = (r + l) // 2\r\n \r\n diff = 0\r\n for i in range(26):\r\n diff += max(0, bar[i] * mid - aar[i])\r\n \r\n if q >= diff:\r\n l = mid\r\n else:\r\n r = mid\r\n \r\ndiff = 0\r\nfor i in range(26):\r\n diff += max(0, bar[i] * r - aar[i])\r\nif q >= diff:\r\n ans = r\r\nelse:\r\n ans = l\r\n \r\nstack = []\r\nfor i in range(26):\r\n if bar[i] * ans - aar[i] > 0:\r\n stack.extend((bar[i] * ans - aar[i]) * (chr(ord('a') +i)))\r\n \r\n \r\nfinal_ans = []\r\nfor i in range(len(s)):\r\n if s[i] != '?':\r\n final_ans.append(s[i])\r\n elif len(stack) > 0:\r\n el = stack.pop()\r\n final_ans.append(el)\r\n else:\r\n final_ans.append('a')\r\n \r\nprint(*final_ans, sep='')\r\n \r\n", "a, b = input(), input()\n\ni = 0\nj = len(a) // len(b)\ne = a.count('?')\n\nfrom collections import Counter\nca, cb = Counter(a), Counter(b)\n\nwhile i <= j:\n\tm = (i + j) // 2\n\tif sum(cb[x] * m - min(cb[x] * m, ca[x]) for x in set(b)) <= e:\n\t\ti = m + 1\n\telse:\n\t\tj = m - 1\n\nr = []\nfor i in set(b):\n\tr.extend([*i * max(0, cb[i] * j - ca[i])])\nans = [*a]\nfor i in range(len(a)):\n\tif ans[i] == '?':\n\t\tif len(r):\n\t\t\tans[i] = r[-1]\n\t\t\tdel r[-1]\n\t\telse:\n\t\t\tans[i] = 'a'\n\nprint(''.join(ans))", "import sys\r\nfrom array import array\r\nfrom string import ascii_lowercase as chrs\r\n\r\n\r\nclass dict_(dict):\r\n def __missing__(self, key):\r\n return 0\r\n\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\ns, t = array('u', input()), array('u', input())\r\nmem = [0] * 26\r\nrem = [0] * 26\r\n\r\nfor i in t:\r\n mem[ord(i) - 97] += 1\r\n\r\nfor i in s:\r\n if i != '?':\r\n rem[ord(i) - 97] += 1\r\n\r\nfor i in range(len(s)):\r\n if s[i] == '?':\r\n mi = 10 ** 9\r\n for j in chrs:\r\n ch = ord(j) - 97\r\n if mem[ch]:\r\n mi = min(mi, rem[ch] // mem[ch])\r\n\r\n for j in chrs:\r\n ch = ord(j) - 97\r\n if mem[ch] and rem[ch] // mem[ch] == mi:\r\n s[i] = j\r\n rem[ch] += 1\r\n break\r\n\r\nprint(''.join(s))\r\n", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nhist1=[0]*26\r\nhist2=[0]*26\r\nneed=[0]*26 # characters needed\r\n\r\nremain=0\r\n\r\ns=input().strip()\r\nfor i in s:\r\n if i=='?': remain+=1\r\n else: hist1[ord(i)-ord('a')]+=1\r\n\r\nt=input().strip()\r\nfor i in t:\r\n hist2[ord(i)-ord('a')]+=1\r\n\r\nwhile remain:\r\n # find suitability\r\n suit=len(s)\r\n for i in range(26):\r\n if hist2[i]==0: continue\r\n suit=min(suit,hist1[i]//hist2[i])\r\n # increase suitability\r\n suit+=1\r\n for i in range(26):\r\n if hist2[i]==0: continue\r\n while hist1[i]//hist2[i]<suit:\r\n hist1[i]+=1\r\n need[i]+=1\r\n remain-=1\r\n if remain==0: break\r\n if remain==0: break\r\n\r\n# construct string\r\nout=[]\r\nlow=0\r\nfor i in s:\r\n if i=='?':\r\n while not need[low]: low+=1\r\n if need[low]:\r\n need[low]-=1\r\n out.append(chr(low+ord('a')))\r\n else:\r\n out.append(i)\r\n\r\nprint(\"\".join(out))", "def main():\r\n\r\n s = str(input())\r\n t = str(input())\r\n from collections import Counter\r\n\r\n Ct = Counter(t)\r\n Cs = Counter(s)\r\n cnt = 0\r\n for c in s:\r\n if c == '?':\r\n cnt += 1\r\n\r\n def is_ok(x):\r\n temp = 0\r\n for k, v in Ct.items():\r\n temp += max(0, x*v-Cs[k])\r\n return temp <= cnt\r\n\r\n ok = 0\r\n ng = 10**7\r\n while ok+1 <ng:\r\n mid = (ok+ng)//2\r\n if is_ok(mid):\r\n ok = mid\r\n else:\r\n ng = mid\r\n #print(ok)\r\n X = []\r\n for k, v in Ct.items():\r\n y = max(0, ok*v-Cs[k])\r\n X += [k]*y\r\n #print(X)\r\n if len(X) < cnt:\r\n X =['a']*(cnt-len(X))+X\r\n X.reverse()\r\n ans = []\r\n for c in s:\r\n if c == '?':\r\n ans.append(X.pop())\r\n else:\r\n ans.append(c)\r\n print(''.join(ans))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import string\r\nsource = {i:0 for i in string.ascii_lowercase}\r\nq = 0\r\nstra = input()\r\nfor i in stra:\r\n if i == '?':\r\n q += 1\r\n else:\r\n source[i] += 1\r\npack = {i:0 for i in string.ascii_lowercase}\r\nstrb = input()\r\nfor i in strb:\r\n pack[i] += 1\r\n\r\ndef check(source, pack, q, pkcount):\r\n for i in pack:\r\n if source[i] - pack[i] * pkcount < 0:\r\n q -= pack[i] * pkcount - source[i]\r\n return q >= 0\r\n \r\nl, r = 0, 1000001\r\nwhile l + 1 != r:\r\n m = (l + r) // 2\r\n if check(source, pack, q, m):\r\n l = m\r\n else:\r\n r = m\r\nst = ''\r\nfor i in pack:\r\n if source[i] - pack[i] * l < 0:\r\n q -= pack[i] * l - source[i]\r\n st = st + i * (pack[i] * l - source[i])\r\nst = st + ('a' * q)\r\nres = ''\r\np = 0\r\nfor i in stra:\r\n if i == '?':\r\n res = res + st[p]\r\n p += 1\r\n else:\r\n res = res + i\r\nprint(res)", "s=list(input())\r\nt=input()\r\nL=[0]*27\r\nfor i in range(len(s)):\r\n if s[i]!='?':\r\n L[ord(s[i])-ord('a')]+=1\r\ncount=0\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='?':\r\n count+=1\r\n if L[ord(t[count%len(t)])-ord('a')]>0:\r\n L[ord(t[count%len(t)])-ord('a')]-=1\r\n i-=1\r\n else:\r\n s[i]=t[count%len(t)]\r\n i=i+1\r\nprint(''.join(s))\r\n " ]

[ "n = int(input())\r\nans = 0\r\ns = input()\r\nmod = 1000000007\r\nnums = [int(x) for x in input().split()]\r\ndp1 = [0]*1002\r\ndp2 = [0]*1002\r\ndp1[0]=1\r\nfor i in range(1,n+1):\r\n curr = 0\r\n dp2[i]=n\r\n for j in range(i-1,-1,-1):\r\n curr= max(curr,i-nums[ord(s[j])-ord(\"a\")])\r\n if curr > j:\r\n continue\r\n dp1[i]=(dp1[i]+dp1[j])%mod\r\n dp2[i]=min(dp2[i],1+dp2[j])\r\n ans=max(ans,i-j)\r\nprint(dp1[n])\r\nprint(ans)\r\nprint(dp2[n])", "n=int(input())\r\ns=input()\r\nl=list(map(int,input().split()))\r\ndp=[0]*(n+2)\r\nmn=[10**4]*(n+2)\r\ndp[0]=dp[n+1]=1\r\nmn[0]=1\r\nmn[n+1]=0\r\nmod=10**9+7\r\nmaxx=1\r\nfor i in range(1,n):\r\n cur=10**4\r\n\r\n for j in range(i,-1,-1):\r\n c=ord(s[j])-ord('a')\r\n cur=min(cur,l[c])\r\n if cur<(i-j+1):\r\n break\r\n dp[i]=(dp[i]+dp[j-1])%mod\r\n mn[i]=min(mn[i],mn[j-1]+1)\r\n maxx=max(maxx,i-j+1)\r\n#print(dp)\r\nprint(dp[n-1])\r\nprint(maxx)\r\nprint(mn[n-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\nmod = pow(10, 9) + 7\r\ns = list(input().rstrip())\r\ns = [i - 97 for i in s]\r\na = list(map(int, input().split()))\r\ninf = pow(10, 9) + 1\r\ndp1 = [0] * (n + 1)\r\ndp1[0] = 1\r\ndp2 = [inf] * (n + 1)\r\ndp2[0] = 0\r\nma = 0\r\nfor i in range(n):\r\n mi = inf\r\n dp1i, dp2i = dp1[i], dp2[i]\r\n for j in range(i, n):\r\n mi = min(mi, a[s[j]])\r\n if mi < j - i + 1:\r\n break\r\n ma = max(ma, j - i + 1)\r\n dp1[j + 1] += dp1i\r\n dp1[j + 1] %= mod\r\n dp2[j + 1] = min(dp2i + 1, dp2[j + 1])\r\nans = [dp1[n], ma, dp2[n]]\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "mod = int(1e9 + 7)\r\nn = int(input())\r\ns = input()\r\nnums = list(map(int, input().split()))\r\n\r\ndp1 = [0] * 1002\r\ndp1[0] = 1\r\n\r\ndp2 = [0] * 1002\r\nans = 0\r\n\r\nfor i in range(1, n + 1):\r\n curr = 0\r\n dp2[i] = n\r\n for j in range(i, 0, -1):\r\n j -= 1\r\n curr = max(curr, i - nums[ord(s[j]) - 97])\r\n if curr > j:\r\n continue\r\n \r\n dp1[i] = (dp1[i] + dp1[j]) % mod\r\n dp2[i] = min(dp2[i], 1 + dp2[j])\r\n ans = max(ans, i - j)\r\n\r\nprint(dp1[n])\r\nprint(ans)\r\nprint(dp2[n])", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\np = 10**9+7 \r\n\r\ndef process(S, A):\r\n n = len(S)\r\n valid_count = [0 for i in range(n+1)]\r\n max_length = [0 for i in range(n+1)]\r\n string_count = [float('inf') for i in range(n+1)]\r\n valid_count[0] = 1 \r\n string_count[0] = 0\r\n for i in range(1, n+1):\r\n curr = float('inf')\r\n for j in range(i, 0, -1):\r\n l = ord(S[j-1])-ord('a')\r\n l = A[l]\r\n curr = min(curr, l)\r\n if i-j+1 <= curr:\r\n valid_count[i] = (valid_count[i]+valid_count[j-1]) % p\r\n max_length[i] = max(max_length[i], max(max_length[j-1], i-j+1))\r\n string_count[i] = min(string_count[i], 1+string_count[j-1])\r\n print(valid_count[-1])\r\n print(max_length[-1])\r\n print(string_count[-1])\r\n \r\n \r\n \r\n \r\n \r\nn = int(input())\r\nS = input().decode().strip()\r\nA = [int(x) for x in input().split()]\r\nprocess(S, A)", "import copy\r\n\r\nmod = 10 ** 9 + 7\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n l = list(map(int, input().split()))\r\n p = [i for i in range(n + 1)]\r\n dp = [0 for i in range(n + 1)]\r\n dp[0] = 1\r\n maxlength = 0\r\n\r\n for i in range(1, n + 1):\r\n f = 0\r\n for j in range(i - 1, -1, -1):\r\n f = max(f, i - l[ord(s[j]) - ord('a')])\r\n if f > j:\r\n continue\r\n\r\n dp[i] = (dp[i] + dp[j]) % mod\r\n p[i] = min(p[i], 1 + p[j])\r\n maxlength = max(maxlength, i - j)\r\n print(dp[n])\r\n print(maxlength)\r\n print(p[n])\r\n" ]

[ "def f(v, x, n):\n\tif v<0:\n\t\treturn 0\n\tfor i in range(1, 7):\n\t\tif x<<i>n or i==6:\n\t\t\treturn (250-v)*i<<1\n\nn=int(input())\na=[list(map(int, input().split())) for _ in range(n)]\nc=[sum(_[i]>=0 for _ in a) for i in range(5)]\nans=-1\nfor i in range(10000):\n\tp, q=0, 0\n\tfor j in range(5):\n\t\tif a[0][j]>a[1][j] and a[1][j]>=0:\n\t\t\tc[j]+=1\n\t\tp+=f(a[0][j], c[j], n+i)\n\t\tq+=f(a[1][j], c[j], n+i)\n\tif p>q:\n\t\tans=i\n\t\tbreak\nprint(ans)\n\n\n\t\t \t \t\t\t \t \t \t\t\t\t \t \t \t\t\t", "def f(v, x, n):\r\n\tif v<0:\r\n\t\treturn 0\r\n\tfor i in range(1, 7):\r\n\t\tif x<<i>n or i==6:\r\n\t\t\treturn (250-v)*i<<1\r\n\r\nn=int(input())\r\na=[list(map(int, input().split())) for _ in range(n)]\r\nc=[sum(_[i]>=0 for _ in a) for i in range(5)]\r\nans=-1\r\nfor i in range(10000):\r\n\tp, q=0, 0\r\n\tfor j in range(5):\r\n\t\tif a[0][j]>a[1][j] and a[1][j]>=0:\r\n\t\t\tc[j]+=1\r\n\t\tp+=f(a[0][j], c[j], n+i)\r\n\t\tq+=f(a[1][j], c[j], n+i)\r\n\tif p>q:\r\n\t\tans=i\r\n\t\tbreak\r\nprint(ans)\r\n\r\n\r\n\t\t \t \t\t\t \t \t \t\t\t\t \t \t \t\t\t", "n=int(input())\na=[list(map(int,input().split())) for i in range(n)]\nsolved=[0 for i in range(5)]\nscore=[0 for i in range(5)]\nfor i in range(n):\n\tfor j in range(5):\n\t\tsolved[j]+=int(a[i][j]>-1)\nfor k in range(31*n+1):\n\tfor i in range(5):\n\t\ttot=n+k\n\t\tcur=solved[i]\n\t\tif a[0][i]>-1 and a[1][i]>-1 and a[0][i]>a[1][i]:\n\t\t\tcur+=k\n\t\tscore[i]=500\n\t\twhile score[i]<3000 and 2*cur<=tot:\n\t\t\tcur*=2;\n\t\t\tscore[i]+=500\n\tres=[0,0]\n\tfor j in range(2):\n\t\tfor i in range(5):\n\t\t\tif a[j][i]>-1:\n\t\t\t\tres[j]+=score[i]/250*(250-a[j][i])\n\tif res[0]>res[1]:\n\t\tprint(k)\n\t\texit()\nprint(\"-1\")", "def get_value(parters, solved):\r\n if solved * 32 <= parters:\r\n return 3000\r\n if solved * 16 <= parters:\r\n return 2500\r\n if solved * 8 <= parters:\r\n return 2000\r\n if solved * 4 <= parters:\r\n return 1500\r\n if solved * 2 <= parters:\r\n return 1000\r\n return 500\r\n\r\ndef points(value, time):\r\n return value - value // 500 * time\r\n\r\nn = int(input())\r\nt = [0] * n\r\nfor i in range(n):\r\n t[i] = list(map(int, input().split()))\r\n\r\nvalue = [0] * 5\r\nsolve = [0] * 5\r\nfor i in range(5):\r\n solved = 0\r\n for j in range(n):\r\n if t[j][i] != -1:\r\n solved += 1\r\n else:\r\n t[j][i] = 250\r\n value[i] = get_value(n, solved)\r\n solve[i] = solved\r\n\r\nvasya = 0\r\nfor i in range(5):\r\n vasya += points(value[i], t[0][i])\r\npetya = 0\r\nfor i in range(5):\r\n petya += points(value[i], t[1][i])\r\n\r\npot = [[0] * 20000 for i in range(5)]\r\n\r\n\r\nfor problem in range(5):\r\n for cur_ac in range(20000):\r\n new_value = 0\r\n if t[0][problem] < t[1][problem]:\r\n new_value = get_value(n + cur_ac, solve[problem])\r\n elif t[0][problem] != 250:\r\n new_value = get_value(n + cur_ac, solve[problem] + cur_ac)\r\n else:\r\n new_value = get_value(n + cur_ac, solve[problem])\r\n win = points(new_value, t[0][problem]) - points(new_value, t[1][problem]) - points(value[problem], t[0][problem]) + points(value[problem], t[1][problem])\r\n pot[problem][cur_ac] = win\r\n\r\n\r\nres = -1\r\n\r\nfor i in range(20000):\r\n tmp = 0\r\n for pr in range(5):\r\n if len(pot[pr]) <= i:\r\n tmp += pot[pr][-1]\r\n else:\r\n tmp += pot[pr][i]\r\n\r\n if tmp > petya - vasya:\r\n res = i\r\n break\r\n\r\nprint(res)\r\n\r\n", "n = int(input())\r\nattempts = [list(map(int, input().split())) for _ in range(n)]\r\n\r\ncorrect_attempts = [sum(attempt[i] >= 0 for attempt in attempts) for i in range(5)]\r\n\r\nanswer = -1\r\n\r\ndef calculate_power_penalty(power, minutes, n):\r\n if power < 0:\r\n return 0\r\n for i in range(1, 7):\r\n if minutes << i > n or i == 6:\r\n return (250 - power) * i << 1\r\n\r\nfor i in range(10000):\r\n penalty_first, penalty_second = 0, 0\r\n\r\n for j in range(5):\r\n if attempts[0][j] > attempts[1][j] and attempts[1][j] >= 0:\r\n correct_attempts[j] += 1\r\n\r\n penalty_first += calculate_power_penalty(attempts[0][j], correct_attempts[j], n + i)\r\n penalty_second += calculate_power_penalty(attempts[1][j], correct_attempts[j], n + i)\r\n\r\n if penalty_first > penalty_second:\r\n answer = i\r\n break\r\n\r\nprint(answer)# 1698324396.883597", "def f(v, x, n):\n\tif v<0:\n\t\treturn 0\n\telif x<<1>n:\n\t\treturn int( 500*(1-v/250))\n\telif x<<2>n:\n\t\treturn int(1000*(1-v/250))\n\telif x<<3>n:\n\t\treturn int(1500*(1-v/250))\n\telif x<<4>n:\n\t\treturn int(2000*(1-v/250))\n\telif x<<5>n:\n\t\treturn int(2500*(1-v/250))\n\telse:\n\t\treturn int(3000*(1-v/250))\n\nn=int(input())\na=[list(map(int, input().split())) for _ in range(n)]\nc=[sum(_[i]>=0 for _ in a) for i in range(5)]\nans=-1\nfor i in range(10000):\n\tp, q=0, 0\n\tfor j in range(5):\n\t\tx, y=c[j], n\n\t\tif a[0][j]>a[1][j] and a[1][j]>=0:\n\t\t\tx+=i\n\t\tp+=f(a[0][j], x, n+i)\n\t\tq+=f(a[1][j], x, n+i)\n\tif p>q:\n\t\tans=i\n\t\tbreak\nprint(ans)\n\n\n\n\n\n# Made By Mostafa_Khaled", "n=int(input())\r\na=[list(map(int,input().split())) for i in range(n)]\r\nsolved=[0]*5\r\nscore=[0]*5\r\nfor i in range(n):\r\n\tfor j in range(5):\r\n\t\tsolved[j]+=int(a[i][j]>-1)\r\nfor k in range(31*n+1):\r\n\tfor i in range(5):\r\n\t\ttot=n+k\r\n\t\tcur=solved[i]\r\n\t\tcur+=k*(a[0][i]>-1 and a[1][i]>-1 and a[0][i]>a[1][i])\r\n\t\tscore[i]=500\r\n\t\twhile score[i]<3000 and 2*cur<=tot:\r\n\t\t\tcur*=2;\r\n\t\t\tscore[i]+=500\r\n\tres=[0,0]\r\n\tfor j in range(2):\r\n\t\tfor i in range(5):\r\n\t\t\tres[j]+=(a[j][i]>-1)*score[i]/250*(250-a[j][i])\r\n\tif res[0]>res[1]:\r\n\t\tprint(k)\r\n\t\tbreak\r\nelse:\r\n\tprint(\"-1\")" ]

[ "s=list(map(int,input().split()))\r\nn=s[0]\r\nk=s[1]\r\nM=s[2]\r\nD=s[3]\r\nans=0\r\nfor d in range(0,D+1):\r\n x=n//((d-1)*k+1)\r\n if x>M:\r\n x=M\r\n if x*d>ans:\r\n ans=x*d\r\nprint(ans)\r\n", "n, k, m, d = map(int, input().split())\r\nans = int(0)\r\nfor i in range(1, d + 1):\r\n l, r, mid = 1, m + 1, 0\r\n while l + 1 < r:\r\n mid = (l + r) // 2\r\n if (n - mid) // (k * mid) < i - 1:\r\n r = mid\r\n else:\r\n l = mid\r\n if (n - l) // (k * l) < i - 1:\r\n break\r\n ans = max(ans, l * i)\r\nprint(ans)\r\n", "# cook your dish here\r\nn, k, m, d = [int(x) for x in input().split()]\r\nres = -1\r\nfor i in range(1,d+1):\r\n iter = (i-1)*k + 1\r\n max_x = n//iter\r\n min_x = n//(i*k)\r\n if min_x > m:\r\n continue\r\n if max_x > m:\r\n res = max(res, i*m)\r\n else:\r\n res = max(res, i*max_x)\r\nprint(int(res))", "n,k,m,d=map(int,input().split())\r\nans=0\r\nfor i in range(1,d+1):\r\n maxx=min(n // ((i - 1) * k + 1), m)\r\n if maxx:\r\n curd = (n // maxx + k - 1) // k\r\n if curd==i:\r\n ans=max(ans, i*maxx)\r\nprint(ans)\t", "n, k, M, D = map(int, input().split())\r\nres = 0\r\n\r\nfor day in range(1, D + 1):\r\n ma = n // ((day-1) * k + 1)\r\n# print(day, ' -- ', mi, ma)\r\n if ma <= M :\r\n res = max(res, ma * day)\r\n\r\n\r\nif (n//M - 1)//k + 1 <= D :\r\n res = max(res, M * ((n//M-1)//k + 1))\r\n\r\nprint(res)\r\n", "n, k, m, d = map(int, input().split())\nbest=-1\nfor i in range(1,d+1):\n curr=min(m,n//(k*(i-1)+1))\n if curr==0:\n continue\n times=n//curr\n check=times//k\n if times%k!=0:\n check+=1\n if check!=i:\n continue\n best=max(best,curr*i)\nprint(best)\n", "ins = input().split(\" \")\nn = int(ins[0])\nk = int(ins[1])\nm = int(ins[2])\nd = int(ins[3])\nans = m * (((n // m) + k - 1) // k)\nfor p in range(1, d + 1):\n if n // (k * (p - 1) + 1) <= m:\n ans = max(ans, (n // (k * (p - 1) + 1)) * p)\nprint(ans)\n\n \t \t\t \t\t\t\t \t \t\t\t\t \t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k, m, d = map(int, input().split())\r\nans = 0\r\nfor i in range(d):\r\n u = min(m, n // (k * i + 1))\r\n ans = max(ans, u * (i + 1))\r\nprint(ans)", "def ifthen(x, y, z):\n return y if x else z\n\nn, k, M, D = map(int, input().split())\nt = M\nt2 = (n//M)//k + ifthen((n//M)%k, 1, 0)\nans = t*t2\nfor i in range(2, D+1):\n l = n//(k*i)\n r = n//(k*(i-1))\n tmp = k*(i-1)+1\n while (r-l > 1):\n mid = (l+r)//2\n if tmp*mid <= n:\n if mid <= M:\n ans = max(ans, mid*i);\n l = mid;\n else:\n r = mid;\n if (tmp*l <= n) and (l <= M):\n ans = max(ans, l*i)\n if (tmp*r <= n) and (r <= M):\n ans = max(ans, r*i)\n\nprint(ans)", "import math\r\nn,k,M,D = input().split()\r\nn = int(n)\r\nk = int(k)\r\nM = int(M)\r\nD = int(D)\r\nans =-1\r\nfor a in range(1,D+1):\r\n r=a*k\r\n l=(a-1)*k+1\r\n l1 = math.ceil(n/(r+1))\r\n if (l>0):\r\n r1 = n//l\r\n else:\r\n r1=999999999999999999\r\n if ((r1>=l1) and (M>=l1)):\r\n x = min(r1,M)\r\n ans = max(ans,x*a)\r\nprint(ans) \r\n \r\n", "n, k, M, D = map(int, input().split())\r\nans = 0\r\nfor i in range(1, D + 1):\r\n x = M\r\n x = min(n // ((i - 1) * k + 1), x)\r\n if x != 0 and (n // x + k - 1) // k == i:\r\n ans = max(ans, x * (i - 1) + x)\r\n\r\nprint(ans)", "n, k, M, D = map(int, input().split())\r\n \r\nans = 0\r\nfor d in range(1, D + 1):\r\n maxx = M\r\n maxx = min(n // ((d - 1) * k + 1), maxx)\r\n \r\n if maxx == 0:\r\n continue\r\n reald = (n // maxx + k - 1) // k\r\n if reald != d:\r\n continue\r\n \r\n def f(x):\r\n return x * (d - 1) + x\r\n \r\n ans = max(ans, f(maxx))\r\nprint(ans)", "n, k, m, d = map(int, input().split())\r\nans = 0\r\nfor cd in range(1, d + 1):\r\n cmax = min(m, n // ((cd - 1) * k + 1))\r\n if(cmax == 0): continue\r\n hd = (n // cmax + k - 1) // k\r\n if(hd != cd): continue\r\n ans = max(ans, cmax * (cd - 1) + cmax)\r\nprint(ans)\r\n", "# n,a,b,c,d = list(map(int, input().split()))\n\n# t=int(input())\nt=1\nwhile t>0:\n\tt-=1\n\tn,k,m,d = list(map(int, input().split()))\n\t\n\tans=0\n\tfor i in range(1,d+1):\n\t\tx=m\n\t\tx=min(m, (n//((i-1)*k +1)))\n\t\tif(x==0):\n\t\t\tcontinue\n\t\trd= (n-x)//(k*x)\n\t\trd=rd+1\n\t\tif(i!=rd):\n\t\t\tcontinue\n\t\tans=max(ans, x*(i-1)+x)\n\tprint(ans)", "import sys\n\nn, k, M, D = map(int, sys.stdin.readline().strip().split())\n\nbest = 0\nfor d in range(1, D + 1):\n x = min(M, n // (1 + (d - 1) * k))\n best = max(best, d * x)\nprint(best)\n", "n,k,m,d = [int(i) for i in input().split()]\nans = 0\nfor i in range(1,d+1):\n x = n//(k*i-k+1)\n if(x > m):\n x = m\n if(x <= 0):\n continue\n if(not (k*i-k+1 <= n//x and n//x <= k*i)):\n continue\n while(k*i-k+1 <= n//(x+1) and x+1 <= m): \n x+=1\n if(x*i > ans):\n ans = x*i\nprint(ans)", "n, k, M, D = map(int, input().split())\r\nans = 0\r\n\r\nfor a in range(D):\r\n ans = max(ans, min(n // (k * a + 1), M) * (a + 1))\r\n\r\nprint(ans)", "import sys,math\r\nsys.setrecursionlimit(100000000)\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef 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############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn,k,m,d=invr()\r\n\r\nans=1\r\n\r\nfor i in range(1,d+1):\r\n\thi=m\r\n\tlo=1\r\n\t\r\n\twhile hi>=lo:\r\n\t\tmid=(hi+lo)//2\r\n\t\t\r\n\t\ttemp=n//(mid*k)\r\n\t\t\r\n\t\tif n%(mid*k)>=mid:\r\n\t\t\ttemp+=1\r\n\t\t\r\n\t\tif temp>=i:\r\n\t\t\tans=max(ans,mid*i)\r\n\t\t\tlo=mid+1\r\n\t\telse:\r\n\t\t\thi=mid-1\r\n\t\r\nprint(ans)\r\n\r\n", "a = input().split(' ')\r\nn = int(a[0])\r\nk = int(a[1])\r\nm = int(a[2])\r\nd = int(a[3])\r\n\r\nans = 0\r\nfor i in range(1,d+1):\r\n l,r,x = 1,m,-1\r\n cur = (i - 1) * k + 1\r\n while(l <= r):\r\n mid = (l+r)//2\r\n if n//mid >= cur :\r\n l = mid + 1\r\n x = mid\r\n else:\r\n r = mid - 1\r\n if x == -1 or n//x > i * k:\r\n continue\r\n if x * i > ans :\r\n ans = x * i\r\nprint(int(ans))\r\n", "import sys\nimport math\n\nn, k, M, D = list(map(int,sys.stdin.readline().strip().split(' ')))\n\nmaxsf = 0\nfor d in range(D):\n\tx = int(math.floor(n//(k*d+1)))\n\tmaxsf = max(maxsf, min(M,x)*(d+1))\nprint(maxsf)", "N, K, M, D = map(int, input().split())\n\nmaxi = 0\nfor i in range(0, D):\n x = max(N // ((i + 1) * K),\n min(M, N // (i * K + 1)))\n\n if(x > M):\n continue\n\n maxi = max(maxi, (i + 1) * x)\n\nprint(maxi)\n", "str = input()\nls = str.split(' ')\nn = int(ls[0])\nk = int(ls[1])\nM = int(ls[2])\nD = int(ls[3])\nans = 0\nfor i in range(D + 1):\n maxX = n // (i * k - k + 1)\n minX = n // (i * k + 1)\n if n % (i * k + 1) == 0 :\n minX += 1\n maxX = min(maxX, M)\n if minX <= maxX:\n ans = max(ans, i * maxX)\nprint(ans)\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n n,k,m,d = map(int,input().split())\r\n ma = -1\r\n for i in range(1,d+1):\r\n xma = min(n//((i-1)*k + 1) , m)\r\n ma = max(ma , xma*i)\r\n print(ma)\r\n\r\n", "n, k, m, d = map(int, input().split())\r\n\r\nfor i in range(1,d+1):\r\n t=0\r\n if i==1:\r\n if (n//m)%k==0:\r\n re=((n//m)//k)*m\r\n else:\r\n re=(1+(n//m)//k)*m\r\n else:\r\n x=n//((i-1)*k+1)\r\n r=n%((i-1)*k+1)\r\n if x<=m and x>(n-r)//(k*d):\r\n t=i*x\r\n if t>re: \r\n re=t\r\nprint(re)", "n,k,M,D = [int(x) for x in input().split()]\r\nans = M\r\nfor tim in range(1,D+1):\r\n\tx = min(M,n//(k*tim))\r\n\tval = x*tim\r\n\tif n-x*tim*k>=x and tim!=D:\r\n\t\tval += x\r\n\tans = max(ans,val)\r\n\tif tim!=D:\r\n\t\tx = min(M,n//(k*tim+1))\r\n\t\tans = max(ans,x*(tim+1))\r\nprint(ans)", "\r\ndef get(sp,n,k,m,d):\r\n\thx=n//(sp*k-k+1)\r\n\tlx=n//(sp*k)\r\n\tif(lx>m):return 0\r\n\telse: return min(m,hx)*sp;\r\n\r\n\r\nif (__name__ == '__main__'):\r\n k=input()\r\n lis=k.split(' ')\r\n #print(\"{}\\n\".format(k))\r\n #print(\"{}\\n\".format(lis))\r\n n=int(lis[0])\r\n k=int(lis[1])\r\n m=int(lis[2])\r\n d=int(lis[3])\r\n ans=-1\r\n for i in range(1,d+1):\r\n ans=max(ans,get(i,n,k,m,d))\r\n \r\n print(\"{}\\n\".format(ans))", "n, k, M, D = map(int, input().split())\r\nprint(max((d + 1) * min(M, n // (k * d + 1)) for d in range(D)))", "n, k, M, D = map(int, input().split())\nans = 0\nfor i in range(1, D+1):\n x = min(M, n // (k*(i-1)+1))\n ans = max(ans, i * x)\nprint(ans)\n", "n, k, m, d = map( int, input().split( ' ' ) )\r\n\r\nans = 0\r\nhand = 0\r\n\r\nfor i in range( d ):\r\n\tkoita = hand + 1\r\n\tval = min( n // koita, m )\r\n\tans = max( ans, val * ( i + 1 ) )\r\n\thand += k\r\n\r\nprint( ans )", "from math import floor\n\nn, k, M, D = map(int, input().split())\n\n_max = M\n\nfor g in range(2, D + 1):\n x = min(M, n // ((g - 1) * k + 1))\n max_g = g * x\n _max = max(_max, max_g)\n\nprint(_max)", "n,k,m,d = map(int,input().split())\r\nans=0\r\nfor i in range(d):ans = max(ans,min(n//(k*i+1),m)*(i+1))\r\nprint(ans)", "n, k, M, D = map(int, input().split())\nflo = lambda a, b: (a + b - 1) // b \nprint(max([d * (n // (k * d - k + 1)) for d in range(1, D + 1) \n if M >= n // (k * d - k + 1)] + [M * flo(n//M, k)]))\n", "\r\ndef ceil_div(a, b):\r\n res = a // b\r\n if a % b != 0:\r\n res += 1\r\n return res\r\n\r\ndef solve_range(n, k, m, r):\r\n low, up = 1, m\r\n\r\n up = min(up, n // (1 + (r - 1) * k))\r\n low = max(low, n // (1 + r * k) + (1 if n % (1 + r * k) == 0 else 0))\r\n\r\n return (low, up)\r\n\r\ndef main():\r\n n, k, m, d = tuple([int(part) for part in input().split(' ')])\r\n\r\n ans = 0\r\n for r in range(1, d + 1):\r\n xmin, xmax = solve_range(n, k, m, r)\r\n if xmin <= xmax:\r\n ans = max(ans, r * xmax)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k, m, d = list(map(int, input().split()))\r\nfinal, max = 0, 0\r\nfor i in range(1, d + 1):\r\n final = min(m, n // ((i - 1) * k + 1)) * i\r\n if final > max:\r\n max = final\r\nprint(max)", "n, k, M, D = map(int, input().split())\r\nres = 0\r\nfor d in range(1, D+1):\r\n max_paquetes_repartidos = (d-1)*k + 1 # Todos tienen d-1 y arkady uno mas\r\n caramelos_por_paquete = n // max_paquetes_repartidos\r\n maxv = min(M, caramelos_por_paquete) # Min porque no puedo tomar mas de M\r\n res = max(res, maxv * d) # Cada paquete tiene d caramelos\r\n\r\nprint(res)", "N, K, M, D = input().split(' ')\r\nN = int(N)\r\nK = int(K)\r\nM = int(M)\r\nD = int(D)\r\nans = M\r\nfor d in range(1, D + 1):\r\n\tx_1 = N // (K * (d - 1) + 1)\r\n\tfin_x = min(x_1, M)\r\n\tans = max(ans, fin_x * d)\r\n\r\nprint(ans)", "import sys\r\nimport math\r\n\r\ndef main():\r\n n, k, M, D = map(int, input().split())\r\n \r\n ans = 1\r\n for i in range(1, D + 1):\r\n d = (k * (i - 1) + 1)\r\n \r\n left = (n // (i * k))\r\n right = n // d\r\n \r\n cnt = 1\r\n if (M <= right):\r\n cnt = M\r\n else:\r\n cnt = right\r\n \r\n added = cnt * i\r\n ans = max(ans, added)\r\n \r\n print(ans)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "ans = 0\r\nn,k,M,D = map(int,input().split(' '))\r\nfor q in range(0,D):\r\n x = min(M, n // (k * q + 1))\r\n ans = max(ans, (q + 1) * x)\r\nprint(ans)\r\n", "#!/usr/bin/env python3\n# -*- coding: UTF-8 -*-\n\nn, k, m, d = (int(x)for x in input().split())\nans = 0\nfor i in range(d):\n ans = max(ans, min(m, n//(k*i+1))*(i+1))\nprint(ans)\n\n\t\t \t\t\t \t \t\t \t \t\t\t\t\t\t\t \t\t", "'''\n Python3(PyPy3) Template for Programming-Contest.\n'''\n\nimport sys\n\n\ndef input():\n return sys.stdin.readline().rstrip()\n\n\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # LDRU\nmod = 998244353\ninf = 1 << 64\n\ndef ceil(x,y):\n return (x + y - 1) // y \n\ndef naive():\n N,K,M,D = map(int,input().split())\n ans = 0\n for x in reversed(range(1,M + 1)):\n distribution = ceil(N // x,K)\n if (distribution > D):\n break\n ans = max(ans ,distribution * x)\n print(ans)\n return 0\n\n\ndef slv():\n N,K,M,D = map(int,input().split())\n ans = 0\n for dist in range(1,D + 1):\n '''\n dist <= ceil(N // x, K) < dist + 1\n この元で x <= Mを最大化する\n y = N // x\n dist <= (y + K - 1) // K < dist + 1\n K * (dist) <= y + K - 1 < (dist + 1) * K \n K * (dist) - K + 1 <= N // x < (dist + 1) * K - K + 1\n\n '''\n lower_bound = K * dist - K + 1\n upper_bound = K * dist + 1\n '''\n lower_bound <= N // x < upper_bound \n lower_bound * x <= N < upper_bound * x \n N / upper_bound < x <= N / lower_bound\n N // uupper_bound < x <= N // lower_bound \n '''\n L = N // upper_bound\n R = min(N // lower_bound,M)\n if L < R:\n ans = max(ans,R * dist)\n print(ans)\n return 0\n\ndef main():\n slv()\n\nif __name__ == \"__main__\":\n main()\n", "def atoi(s):\r\n s = s[::-1]\r\n num = 0\r\n for i, v in enumerate(s):\r\n for j in range(0, 10):\r\n if v == str(j):\r\n num += j * (10 ** i)\r\n return num\r\nif __name__ == \"__main__\":\r\n n,k,M,D = input().split()\r\n n = atoi(n)\r\n k = atoi(k)\r\n M = atoi(M)\r\n D = atoi(D)\r\n ans = 0\r\n for i in range(1,D + 1):\r\n x = n//(k*(D-i)+1)\r\n if x>M:\r\n x = M\r\n else:\r\n ans = max(ans,x*(D-i+1))\r\n ndivM = n//M\r\n cnt = ndivM//k\r\n if ndivM%k!=0 :\r\n cnt+=1\r\n if cnt>D:\r\n cnt = D\r\n ans = max(ans,cnt*M)\r\n print(ans)", "n,k,M,D=map(int,input().split())\r\nw=0\r\ndef binarySearchCount(i, n): \r\n left = 0\r\n right = M\r\n mid = 0\r\n count=0\r\n while (left <= right): \r\n mid = (right + left) // 2\r\n w=(k-1)*(i-1)*mid+i*mid\r\n if (w <= n): \r\n count = mid\r\n left = mid + 1\r\n else: \r\n right = mid - 1 \r\n return count\r\nfor i in range(1,D+1):\r\n c=binarySearchCount(i,n)\r\n #print(c,i)\r\n w=max(w,c*i)\r\nprint(w)", "n, k, M, D = map(int, input().split())\n\nans = 0\nfor d in range(1, D+1):\n x = min(M, n // (k * (d - 1) + 1))\n if x == 0:\n continue\n rd = (n // x + k - 1) // k\n if rd != d:\n continue;\n ans = max(ans, x*d)\nprint(ans)\n", "def calc(n,k,M,D):\r\n\tans = 0\r\n\tfor d in range(1, D+1):\r\n\t\tg = k*d-k+1\r\n\t\tx = min(n // g, M)\r\n\t\tans = max(ans, x*d)\r\n\t\t# print(\"d\", x*d)\r\n\treturn ans\r\n\r\nn, k, M, D = map(int, input().split())\r\nans = calc(n, k, M, D)\r\nprint(ans)", "n, k, M, D = map(int, input().split())\r\nres = 0\r\nfor d in range(1, D + 1):\r\n x = n // (d * k - k + 1)\r\n x = min(x, M)\r\n res = max(res, x * d)\r\nprint(res)", "s=input().split()\r\ns=[int(c) for c in s]\r\nn,k,M,Du=s\r\n\r\nDb=((n//M)-1+k)//k\r\nans=Db*M\r\nfor i in range(Db+1,Du+1):\r\n ans=max(ans, n//((i-1)*k+1)*i )\r\nprint(ans)\r\n", "\r\nn, k, m, d = map(int, input().split())\r\nans = -1\r\nfor i in range(1, d+1):\r\n cur = n // (k*i - k + 1)\r\n ans = max(ans, min(cur, m) * i)\r\nprint(ans)\r\n ", "n,k,m,d=map(int,input().split())\r\nr=0\r\nfor i in range(1,d+1):\r\n x=n//(i*k-k+1)\r\n x=min(x,m)\r\n r=max(r,x*i)\r\nprint(r)", "n, k, m, d = map(int, input().split())\r\nans = int(0)\r\nfor i in range(1, d+1):\r\n num = n // (k*(i-1)+1)\r\n if num > m:\r\n num = m\r\n ans = max(ans, num * i)\r\nprint(ans)", "n, k, m, d = map(int, input().split())\nprint(max([min(m, n // (k * (i-1) + 1)) * i for i in range(1, d+1)]))\n", "n,k,m,d = [int(x) for x in input().split()]\r\nx = 0\r\n\r\nfor i in range(d):\r\n\tz = n//(i*k+1)\r\n\tx = max(x, (i+1)*min(z,m))\r\nprint(max(m,x))", "n, k, M, D = map(int, input().split())\nans = 0\nfor time in range(1, D+1):\n x = n//((time-1)*k+1)\n if x > M:\n x = M\n if n//x>time*k:\n continue\n ans = max(ans,time*x)\nprint(ans)\n", "Q = [int(x) for x in input().split(' ')]\r\nn = Q[0]\r\nk = Q[1]\r\nM = Q[2]\r\nD = Q[3]\r\n\r\nmm = 0\r\n\r\nfor i in range(D):\r\n m = n // (i * k + 1)\r\n if m > M:\r\n m = M\r\n mm = max(m * (i + 1), mm)\r\n\r\nprint(mm)\r\n", "import sys\nimport math\n\n[n, k, M, D] = list(map(int, sys.stdin.readline().split(\" \")))\nbest = min(n, M)\n\nfor d in range(D):\n ppl = d * k + 1\n x = min(n // ppl, M)\n best = max(best, x * (d + 1))\n\nprint(best)\n", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\nimport heapq\r\nmod=10**9+7\r\nn, k, m, d = map(int, sys.stdin.readline().split())\r\nans = 0\r\nfor i in range(d):\r\n low = 1\r\n high = k\r\n x = -1\r\n while low <= high:\r\n mid = (low + high) // 2\r\n y = n // (i * k + mid)\r\n if y <= m:\r\n x = mid\r\n high = mid - 1\r\n else:\r\n # rounds = n // (k * m)\r\n # if n % (k * m) != 0:\r\n # rounds += 1\r\n # if rounds <= d:\r\n # ans = max(ans, m * rounds)\r\n # print(ans, rounds, m)\r\n ans = max(ans, m * (i + 1))\r\n low = mid + 1\r\n if x != -1:\r\n y = n // (i * k + x)\r\n ans = max(ans, y * (i + 1))\r\n # print(ans, x, i, y)\r\nprint(ans)\r\n ", "n, k, M, D = map(int, input().split())\nans = 0\nfor d in range (D+1):\n\tx1 = (n//(k*(d-1) + 1))\n\tx2 = 0\n\t\t\n\tif((M*(k*(d-1) + 1)) <= n):\n\t\tx2 = M\n\tif(x1 > M):\n\t\tx1 = 0\n\n\tans = max(ans, max(x1*d, x2*d))\n\t\nprint(ans)\n", "n,k,m,d=map(int,input().split())\r\nans=-10e18\r\nsr=n//m\r\nsr=(sr+(k-1))//k\r\nsr=sr*m\r\nfor i in range(1,d,1):\r\n x=n//(i*k+1)\r\n if (x<=m):\r\n cur_res=(i+1)*x\r\n ans=max(ans,cur_res)\r\n else:\r\n continue\r\nprint(max(ans,sr))\r\n", "n,k,m,d=map(int,input().split())\r\na=0\r\nfor i in range(1,d+1):\r\n a=max(a,min(m*i,n//((i-1)*k+1)*i))\r\nprint(a) ", "n, k, M, D = map(int, input().split())\r\n\r\nans = 0\r\nfor d in range(1, D + 1):\r\n a = 1 + k * (d - 1)\r\n\r\n b = M\r\n b = min(n // a, b)\r\n\r\n if b == 0: continue\r\n\r\n dd = (n // b + (k - 1)) // k\r\n if dd != d: continue\r\n\r\n ans = max(ans, b * (d - 1) + b)\r\n\r\nprint(ans)\r\n", "n,k,m,D=[int(x) for x in input().split()]\r\nprint(max(d*min(m,n//(k*(d-1)+1)) for d in range(1,D+1)))", "n,k,M,D=map(int,input().split())\r\nmax_=0\r\nfor i in range(1,D+1):\r\n max_=max(max_,i*(min(M,n//(i*k-k+1))))\r\nprint (max_)\r\n", "name = input()\r\nn,k,M,D=[int(i) for i in name.split(' ')]\r\nret=0\r\nif k > n/M:\r\n ret = M\r\n\r\nfor i in range(D):\r\n d=i+1\r\n l1 = (n + d * k + 1) // (1 + d * k)\r\n l2 = (n + d * k + k) // (k + d * k)\r\n r1 = n // (d * k)\r\n r2 = n // (1 + d * k)\r\n if max(l1, l2) <= min(M, r1):\r\n ret = max(ret, min(M, r1) * d)\r\n\r\n if l2 <= min(M, min(r1, r2)) and d + 1 <= D:\r\n ret = max(ret, min(M, min(r2, r1)) * (d + 1))\r\nprint(ret)", "Q = [int(x) for x in input().split(' ')]\nn = Q[0]\nk = Q[1]\nM = Q[2]\nD = Q[3]\nm1=0\n\nfor i in range(D):\n\tm = n//(i*k+1)\n\tif m>M:\n\t\tm=M\n\tm1=max(m*(i+1),m1)\n\nprint(m1)\n", "import math\r\n\r\n[n,k,M,D]=input().split()\r\nn=int(n)\r\nk=int(k)\r\nM=int(M)\r\nD=int(D)\r\n\"\"\"\r\nll best=0;\r\n\tfor (ll i=0; i<=(D-1); i++){\r\n\t\tll x=min(up,n/(i*k+1));\r\n\t\tll score=(i+1)*x;\r\n\t\tbest=max(best,score);\r\n\t}\r\n\t\r\n\tcout<<best<<endl;\r\n\"\"\"\r\nbest=0\r\nfor i in range(D):\r\n\t#print(n, i*k+1)\r\n\tx=min(M,(n//(i*k+1)))\r\n\t#print(i, x)\r\n\tscore=(i+1)*x\r\n\tbest=max(best,score)\r\nprint(best)", "#!/usr/bin/python3\n\nn, k, M, D = (int(x) for x in input().split())\nans = 0\nfor d in range(1, D+1):\n\tl = n // (k * d + 1)\n\tr = min(n // (k*(d-1) + 1), M)\n\tif l < r:\n\t\tans = max(ans, r * d)\nprint(ans)\n", "n, k, m, d = map (int, input ().split ())\r\nresult = 0\r\nfor f in range (1, d + 1):\r\n x_max = n // (k * (f - 1) + 1)\r\n x_min = n // (k * f)\r\n if x_min > m:\r\n continue\r\n result = max (result, f * min (m, x_max))\r\nprint (result)", "n, k, m, d0 = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor d in range(1, d0 + 1):\r\n x = min(m, n // ((d - 1) * k + 1));\r\n if (x == 0):\r\n continue\r\n new_d = ((n // x) + k - 1) // k\r\n if (d != new_d):\r\n continue\r\n ans = max(ans, x * d)\r\nprint(ans)", "num = list(map(int, input().split()))\r\nn = num[0]\r\nk = num[1]\r\nm = num[2]\r\np = num[3]\r\nans = 0\r\nfor d in range(1,p+1):\r\n var1 = d + (k-1)*(d-1)\r\n var2 = n//var1\r\n if(var2 > m):\r\n var2 = m\r\n ans = max(ans,d*var2)\r\nprint (ans)\r\n", "n,k,m,d=map(int,input().split())\r\nans = 0\r\nfor t in range(1, d+1):\r\n r = n //(t + (t - 1) * (k - 1))\r\n \r\n r = min(r, m)\r\n \r\n if r == 0:\r\n continue\r\n \r\n T = n//(r * k)\r\n \r\n if (n % (r * k)) >= r:\r\n T = T + 1\r\n \r\n if T <= d :\r\n ans = max(ans, r*T)\r\n\r\nprint(ans)\r\n\r\n", "n,k,m,d = map(int, input().split())\nans = 0\nfor i in range(1,d+1):\n\tx = n//(1 + k*(i-1));\n\t#cout << i << ' ' << x << '\\n';\n\tif (x == 0) or ((i-1)*k*x + x) > n:\n\t\tcontinue\n\tif(x > m):\n\t\tx = m;\n\tans = max(ans,i*x)\n\nprint(ans)", "import math\r\n\r\nn, k, M, D = [int(x) for x in input().split()]\r\nans = 0\r\nfor d in range(1, D + 1):\r\n max_x = int(n // (k * (d - 1) + 1))\r\n max_x = min(M, max_x)\r\n min_x = int(math.ceil((n - (max_x - 1)) / (k * (d - 1) + k)))\r\n min_x = max(1, min_x)\r\n x = -1\r\n l = min_x\r\n r = max_x\r\n while l <= r:\r\n m = l + (r - l) // 2\r\n d_check = ((n // m) + k - 1) // k\r\n if d_check == d:\r\n x = m\r\n l = m + 1\r\n elif d_check > d:\r\n l = m + 1\r\n else:\r\n r = m - 1\r\n ans = max(ans, x * d)\r\nprint(ans)\r\n", "n, k, M, d = map(int, input().split())\r\nans = 0\r\nfor i in range(1, d + 1):\r\n l = 1\r\n r = M + 1\r\n while (r - l > 1):\r\n m = (l + r) // 2\r\n if (n // (k * m) + ((n % (k * m)) >= m)) >= i:\r\n l = m\r\n else:\r\n r = m\r\n ii = n // (k * l) + (((n % (k * l)) >= l))\r\n if ii > i:\r\n continue\r\n ans = max(ans, l * ii)\r\nprint(ans)", "n, k, m, d = map(int, input().split())\r\n\r\nans = 0\r\nfor i in range(1, d+1):\r\n\ttimes = (i-1)*k+1\r\n\tper = n//times\r\n\tper = min(per, m)\r\n\tans = max(ans, i*per)\r\n\r\nprint(ans)", "import sys\r\nn, k, M, D = [int(x) for x in sys.stdin.readline().split()]\r\nans = 0\r\nfor d in range(1, D+1):\r\n\tx = min(M, n // (k*(d-1)+1))\r\n\tif n < (k*d+1)*x:\r\n\t\tans = max(ans, d*x)\r\nprint(ans)", "n, k, m, d = map(int, input().split())\r\n\r\nans = 0\r\nfor i in range(1, d + 1):\r\n \r\n mix = min(n // ((i - 1) * k + 1), m)\r\n \r\n if mix == 0:\r\n continue\r\n r = (n // mix + k - 1) // k\r\n if r != i:\r\n continue\r\n \r\n def ror(x):\r\n return x * (i - 1) + x\r\n \r\n ans = max(ans, ror(mix))\r\nprint(ans)\r\n", "numCandies, numPeople, maxiCandies, maxiTurn = map(int, input().split())\r\nans = 0\r\nfor turn in range(1, maxiTurn + 1):\r\n maxi = maxiCandies\r\n maxi = min(maxi, numCandies // ((turn - 1) * numPeople + 1))\r\n if maxi == 0:\r\n continue\r\n if turn != (numCandies // maxi + numPeople - 1) // numPeople:\r\n continue\r\n x = maxi * (turn - 1) + maxi\r\n ans = max(ans, x)\r\nprint(ans)\r\n", "n, k, m, d = map(int, input().split())\n\nans = 0\n\nfor y in range(1, d + 1):\n x = min(m, n // (k * (y - 1) + 1))\n if x == 0:\n continue\n yy = (n // x + k - 1) // k\n if yy != y:\n continue\n ans = max(ans, x * y)\nprint(ans)", "n,k,m,d=map(int,input().split(' '))\n\nans=0\nfor i in range(1,d+1):\n\tant=min(m,n//(k*i))\n\tant=max(ant,min(m,n//((k-1)*(i-1)+i)))\n\tif(ant==0):\n\t\tcontinue\n\tc=int((n//ant)//k)\n\tif((n//ant)%k!=0):\n\t\tc=c+1\n\tif(c>d):\n\t\tcontinue\n\tans=max(ans,ant*c)\n\nprint(ans)", "v = input().split()\nn = int(v[0])\nk = int(v[1])\nM = int(v[2])\nD = int(v[3])\nans = -100000000000000000000000000000000000\nfor times in range(1, D + 1):\n\tden = (times - 1) * k + 1\n\tx = min(n // den, M)\n\tans = max(ans, times * x)\nprint(ans)", "n, k, m, d = [int(x) for x in input().split()]\nres = 0\nfor a in range(1, d + 1):\n x = n // (a * k - k + 1)\n x = min(x, m)\n res = max(res, x * a)\nprint(res)", "n,k,m,d=map(int,input().split())\r\nif n%(k*d)==0:\r\n p=n//(k*d)\r\nelse:\r\n p=n//(k*d)+1\r\nans=0\r\nfor j in range(1,d+1):\r\n if k*(j-1)>(10**18) or k*(j-1)<0:\r\n break\r\n x=n//(k*(j-1)+1)\r\n x=min(x,m)\r\n x*=j\r\n ans=max(ans,max(x,0))\r\nprint(ans)", "n,k,m,d=map(int,input().split())\r\nr=0;l=1\r\nwhile l<=d:\r\n r=max(r,min(m*l,(n//(((l-1)*k+1))*(l))))\r\n l+=1\r\nprint(max(r,m))\r\n ", "n,k,m,d=[int(x) for x in input().split(' ')]\r\n\r\nans=-1\r\n\r\nfor i in range(1,d+1):\r\n \r\n maxserve=i+(i-1)*(k-1)\r\n minserve=i*k\r\n \r\n # print(maxserve)\r\n # print(minserve)\r\n xmax=-1\r\n xmin=-1\r\n \r\n xmax=n//maxserve\r\n xmin=n//minserve\r\n \r\n if xmin<=m:\r\n bc=min(xmax,m)\r\n ans=max(ans,bc*i)\r\n # bb=123+1\r\n\r\nprint(ans)\r\n ", "n,k,m,q=map(int,input().split())\r\nprint(max(i*min(m,n//(k*i-k+1))for i in range(1,q+1)))", "n, k, m, d = input().split()\r\nn, k, m, d = int(n), int(k), int(m), int(d)\r\n\r\nres = 0\r\n\r\nfor t in range(0, d):\r\n x = min(m, n // (t * k + 1))\r\n \r\n if x == 0:\r\n continue\r\n \r\n curr = (n // x + k - 1) // k\r\n \r\n if curr == (t + 1):\r\n res = max(res, x*(t + 1))\r\n\r\nprint(res)", "n, k, m, d = map(int, input().split())\r\nans = 0\r\nfor i in range(1, d + 1):\r\n if m < n // (k * i):\r\n continue\r\n if n < (k * (i - 1) + 1):\r\n break\r\n ans_here = min(n // (k * (i - 1) + 1), m)\r\n # print(i, ans_here)\r\n ans = max(ans, ans_here * i)\r\nprint(ans)\r\n", "'''input\n1000000000 324934 1000 1000\n'''\nn,k,m,q = map(int,input().split())\nans = m\nfor i in range(q):\n\tx = min(m,n//(k*i+1))\n\tans=max(ans,(i+1)*x);\nprint(ans)", "'''\r\n#include<bits/stdc++.h>\r\n#define elif else if\r\nusing namespace std;\r\ntypedef long long ll;\r\ntypedef unsigned long long ull;\r\n\r\nll n, k, m, d;\r\n\r\nint main()\r\n{\r\n cin >> n >> k >> m >> d;\r\n ll maxn = min(n,m);\r\n ll thisrun = 0;\r\n ll round = 0;\r\n if(d==1)\r\n {\r\n cout << m;\r\n return 0;\r\n }\r\n for (int i = 1;i<d;i++)\r\n {\r\n if(m*(i*k+1)>n)\r\n {\r\n break;\r\n }\r\n maxn = max(maxn, m*(i+1));\r\n }\r\n for (int i = 1;i<d;i++)\r\n {\r\n thisrun = n / (k * i + 1);\r\n if(thisrun<=m)\r\n {\r\n maxn = max(maxn, thisrun * (i + 1));\r\n }\r\n }\r\n cout << maxn;\r\n return 0;\r\n}\r\n'''\r\nins = input().split(' ')\r\nn =eval(ins[0])\r\nk =eval(ins[1])\r\nm =eval(ins[2])\r\nd = eval(ins [3])\r\nmaxn = min(n,m)\r\nthisrun = 0\r\nround = 0\r\nif d==1:\r\n print(m)\r\n exit(0)\r\nfor i in range(1,d):\r\n if m*(i*k+1)>n:\r\n break\r\n maxn = max(maxn, m * (i + 1))\r\nfor i in range(1,d):\r\n thisrun = n // (k * i + 1)\r\n if thisrun<=m:\r\n maxn = max(maxn, thisrun * (i + 1))\r\nprint(maxn)", "import sys\n\nn, k, M, D = map(int, sys.stdin.readline().strip().split())\n\nbest = 0\nfor d in range(1, D + 1):\n R = (d - 1) * k + 1\n x = n // R\n if x > M:\n x = M\n if d * x > best:\n best = d * x\nprint(best)\n", "N, K, M, D = map(int, input().split())\r\n\r\nans = 0\r\n\r\nfor d in range(1, D + 1):\r\n x = min(M, N // ((d-1) * K + 1))\r\n ans = max(ans, d * x)\r\n # print(d, x, d * x)\r\n\r\nprint(ans)\r\n", "n,k,m,d=map(int,input().split())\r\nans=0\r\nfor i in range(1,d+1):\r\n\ts=1\r\n\te=m\r\n\twhile s<e:\r\n\t\tmid=(s+e+1)//2\r\n\t\tif mid*(k*(i-1)+1)<=n:\r\n\t\t\ts=mid\r\n\t\telse:\r\n\t\t\te=mid-1\r\n\tif s*(k*(i-1)+1)<=n:\r\n\t\tans=max(ans,i*s)\r\n\t\"\"\"print(\"%d %d %d \",ans,i,s)\"\"\"\r\nprint(ans)\r\n", "from sys import stdin\nn, k, M, D = map(int, stdin.readline().strip().split())\nprint(max(map(lambda d: d * min(M, n // (1 + (d - 1) * k)), range(1, D + 1))))\n", "n, k, m, d = map(int, input().split())\r\nmaxr = 0\r\nfor i in range(1, d+1):\r\n\tpeeps = k*(i-1) + 1\r\n\tt = n//peeps\r\n\tif t <= m:\r\n\t\tmaxr = max(maxr, t*i)\r\n\t\tcontinue\r\n\tsec = k*i\r\n\tt2 = n//sec\r\n\tif(t2 > m):\r\n\t\tcontinue\r\n\tr = n//m\r\n\t# cyc = (r%k == 0 ? r//k : r//k + 1)\r\n\tif(r%k == 0):\r\n\t\tcyc = r//k\r\n\telse:\r\n\t\tcyc = r//k + 1\r\n\tmaxr = max(maxr, cyc*m)\r\nprint(maxr)", "n,k,M,D=input().split()\r\nn=int(n)\r\nk=int(k)\r\nM=int(M)\r\nD=int(D)\r\nval=0\r\nfor d in range(1,D+1):\r\n\ty=(d-1)*k+1\r\n\tx=n//y\r\n\tif x>M:\r\n\t\tx=M\r\n\tif x*d>val:\r\n\t\tval=x*d\r\nprint(val)", "n, k, m, d = map(int, input().split())\r\nres = 0\r\nfor a in range(1, d + 1):\r\n x = n // (a * k - k + 1)\r\n x = min(x, m)\r\n res = max(res, x * a)\r\nprint(res)", "n, k, m, d = map(int, input().split())\r\nif (d == 1):\r\n print(m)\r\nelse:\r\n ans = 0\r\n for i in range(0, d):\r\n x = (n // ((k * i) + 1))\r\n if (x > m): x = m\r\n ans = max(ans, x * (i + 1))\r\n print(ans)", "import sys\r\nn, k, m, d = map(int, sys.stdin.readline().split())\r\nans = 0\r\nfor i in range(d):\r\n low = 1\r\n high = k\r\n x = -1\r\n while low <= high:\r\n mid = (low + high) // 2\r\n y = n // (i * k + mid)\r\n if y <= m:\r\n x = mid\r\n high = mid - 1\r\n else:\r\n ans = max(ans, m * (i + 1))\r\n low = mid + 1\r\n if x != -1:\r\n y = n // (i * k + x)\r\n ans = max(ans, y * (i + 1))\r\nprint(ans)\r\n ", "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\nfor _ in range(tests):\r\n n, k, m, d = inp(int)\r\n ans = 0\r\n\r\n for curd in range(1, d + 1):\r\n be, en = 1, m\r\n x = -1\r\n while be <= en:\r\n md = (be + en) >> 1\r\n vald = ceil1(n // md, k)\r\n\r\n if vald < curd:\r\n en = md - 1\r\n elif vald > curd:\r\n be = md + 1\r\n else:\r\n be, x = md + 1, md\r\n\r\n ans = max(ans, curd * x)\r\n\r\n out.append(ans)\r\nprint('\\n'.join(map(str, out)))\r\n", "n,k,m,D= map(int, input().split())\r\nres = 0\r\nfor d in range(1, D+1):\r\n x = m\r\n x = min(x, n // ((d-1)*k+1))\r\n if(x*k*(d-1)+x > n):\r\n break\r\n if(res==0 or res < x*d):\r\n res = x*d\r\nprint(res)", "n,k,M,D = [int(x) for x in input().split()]\r\ntim = min(D,n//(M*k))\r\nans = M*tim\r\nif tim!=D and n-M*tim*k >= M:\r\n ans += M\r\nfor tim in range(1,D+1):\r\n\tx = n//(k*tim)\r\n\tif x<=M:\r\n\t\tval = x*tim\r\n\t\tif n-x*tim*k>=x and tim!=D:\r\n\t\t\tval += x\r\n\t\tans = max(ans,val)\r\n\tif tim!=D:\r\n\t\tx = n//(k*tim+1)\r\n\t\tif x<=M:\r\n\t\t\tans = max(ans,x*(tim+1))\r\nprint(ans)", "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):\r\n c,p,M,D=lst()\r\n ans=0\r\n for i in range(1,D+1):\r\n r=min(M,c//(p*i-p+1))\r\n l=c//(p*i)\r\n # print(i,l,r)\r\n while l<=r:\r\n mid=(l+r)>>1\r\n if i*mid>=i*l:\r\n l=mid+1\r\n else:r=mid-1\r\n ans=max(ans,r*i)\r\n print(ans)", "n, k, M, D = map(int, input().split())\r\n \r\nans = 0\r\nfor d in range(1, D + 1):\r\n maxx = min(n // ((d - 1) * k + 1), M)\r\n ans = max(ans, maxx * d)\r\nprint(ans)", "\nN, K, M, D = input().split(' ')\nN = int(N)\nK = int(K)\nM = int(M)\nD = int(D)\nans = -1\nfor d in range(1, D+1):\n numDivisors = K * (d - 1) + 1\n candiesPer = N // numDivisors\n if candiesPer == 0:\n continue\n if candiesPer > M:\n candiesPer = M\n if (N // (candiesPer * K) > D):\n candiesPer = N // (D * K)\n ans = max(ans, candiesPer * d)\n# }\nprint(ans)\n", "n,k,m,d = map(int,input().split())\nans = m\nfor i in range(d):\n\ttemp = min(m,n//(k*i+1))\n\tans=max(ans,(i+1)*temp)\nprint(ans)\n", "n, k, M, D = map(int, input().split())\nprint(max(d * min(M, n // (k * d - k + 1)) for d in range(1, D + 1)))\n" ]

[ "read = lambda: map(int, input().split())\r\nn, m = read()\r\nv = list(read())\r\n\r\ne = []\r\nfor i in range(m):\r\n x, y = map(lambda x: int(x) - 1, input().split())\r\n e.append((x, y, min(v[x], v[y])))\r\ne.sort(key = lambda x: x[2], reverse = True)\r\n\r\nbelong = list(range(n))\r\nunion = [[i] for i in belong]\r\nsize = [1] * n\r\n\r\nans = 0\r\n\r\nfor i, j, k in e:\r\n fi, fj = belong[i], belong[j];\r\n if fi == fj: continue\r\n if not (len(union[fi]) > len(union[fj])):\r\n fi, fj = fj, fi\r\n ans += k * size[fi] * size[fj]\r\n size[fi] += size[fj]\r\n union[fi] += union[fj]\r\n for t in union[fj]: belong[t] = fi\r\n \r\nprint(\"%.7lf\" % (ans * 2 / n / (n - 1)))\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef findroot(root_dict, x):\r\n L = []\r\n while root_dict[x] != x:\r\n L.append(x)\r\n x = root_dict[x]\r\n for y in L:\r\n root_dict[y] = x\r\n return x\r\n\r\ndef process(A, G):\r\n n = len(A)\r\n answer = 0\r\n g = [[] for i in range(n+1)]\r\n root_dict = [i for i in range(n+1)]\r\n roots = [1 for i in range(n+1)]\r\n m = len(G)\r\n for i in range(m):\r\n x, y = G[i]\r\n if A[x-1] <= A[y-1]:\r\n g[x].append(y)\r\n else:\r\n g[y].append(x)\r\n A2 = sorted(enumerate(A), key=lambda a:a[1], reverse=True)\r\n for i, value in A2:\r\n i+=1\r\n for j in g[i]:\r\n i1 = findroot(root_dict, i)\r\n j1 = findroot(root_dict, j)\r\n if i1 != j1:\r\n answer+=2*value*roots[i1]*roots[j1]\r\n root_dict[i1] = i1\r\n root_dict[j1] = i1\r\n roots[i1]+=roots[j1]\r\n return answer/(n*(n-1))\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 u, v = [int(x) for x in input().split()]\r\n G.append([u, v])\r\nprint(process(A, G))", "# Time Complexity: O(n)\n# Space Complexity: O(n)\n# The solution iterates through every edge to build the MST O(m)\n# When merging two trees, it calculates every shortest pairs between elements of the tress O(1)\n# References:\n# - Fast I/O for Competitive Programming in Python\n# https://www.geeksforgeeks.org/fast-i-o-for-competitive-programming-in-python/\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n# The line above helps the solution to read all inputs quickly.\nimport io, os\nimport math\n\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nedges = []\nfor i in range(m):\n u, v = map(int, input().split())\n smallest = min(a[u-1], a[v-1]);\n edges.append((u-1, v-1, smallest))\n\n# Kruskal MST\nparent = [i for i in range(n)]\nsize = [1] * (n)\nsiblings = [[i] for i in range(n)]\ns = 0\n\ndef find(x):\n if x != parent[x]:\n parent[x] = find(parent[x])\n return parent[x]\n\ndef union(x, y, w):\n global s\n smaller = find(x)\n larger = find(y)\n if smaller == larger:\n return False\n if size[smaller] > size[larger]:\n smaller, larger = larger, smaller\n parent[smaller] = larger\n siblings[larger].extend(siblings[smaller])\n s += size[larger] * size[smaller] * w\n size[larger] += size[smaller]\n return True\n\n# Sort by weight\nL = sorted(edges, reverse=True, key=lambda x: x[2])\nfor edge in L:\n u, v, w = edge\n union(u, v, w)\n\ns = s << 1\ns = s / n / (n - 1)\nprint(s)\n\n \t \t\t \t \t \t\t\t\t\t \t\t\t\t \t\t", "n, m = map(int, input().split())\r\np, c = list(range(n + 1)), [1] * (n + 1)\r\nv = [0] + list(map(int, input().split()))\r\ns, e = 0, [()] * m\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n e[i] = (x, y, min(v[x], v[y]))\r\ne.sort(key = lambda x: x[2], reverse = True)\r\nq = [[i] for i in range(n + 1)]\r\nfor l, r, v in e:\r\n l, r = p[l], p[r]\r\n if l == r: continue\r\n if len(q[l]) > len(q[r]): l, r = r, l\r\n q[r].extend(q[l])\r\n for t in q[l]: p[t] = r\r\n s += c[l] * c[r] * v\r\n c[r] += c[l]\r\nprint(s * 2 / (n * (n - 1)))", "import io, os\nimport math\n\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\nedges = []\nfor i in range(m):\n u, v = map(int, input().split())\n smallest = min(a[u-1], a[v-1]);\n edges.append((u-1, v-1, smallest))\n\n# Kruskal MST\nparent = [i for i in range(n)]\nsize = [1] * (n)\nsiblings = [[i] for i in range(n)]\ns = 0\n\ndef find(x):\n if x != parent[x]:\n parent[x] = find(parent[x])\n return parent[x]\n\ndef union(x, y, w):\n global s\n smaller = find(x)\n larger = find(y)\n if smaller == larger:\n return False\n if size[smaller] > size[larger]:\n smaller, larger = larger, smaller\n parent[smaller] = larger\n siblings[larger].extend(siblings[smaller])\n s += size[larger] * size[smaller] * w\n size[larger] += size[smaller]\n return True\n\n# Sort by weight\nL = sorted(edges, reverse=True, key=lambda x: x[2])\nfor edge in L:\n u, v, w = edge\n union(u, v, w)\n\ns = s << 1\ns = s / n / (n - 1)\nprint(s)\n" ]

[ "n, m = map(int, input().split())\r\nans = 0\r\nx, y = 0, 0\r\n\r\nfor i in range(n):\r\n a = input()\r\n d = 1 - i % 2 * 2\r\n\r\n j = (m-1) * (i % 2)\r\n while j >= 0 and j < m:\r\n if a[j] == 'G':\r\n t =0\r\n j += d\r\n else:\r\n ans += abs(x - i) + abs(y - j)\r\n x, y = i, j\r\n j += d\r\n\r\nprint(ans)\r\n", "rows, cols = map(int, input().split())\r\ntotal_moves = 0\r\ncurrent_row, current_col = 0, 0\r\n\r\nfor i in range(rows):\r\n row_data = input()\r\n direction = 1 - i % 2 * 2\r\n\r\n col = (i % 2) * (cols - 1)\r\n\r\n \r\n while col >= 0 and col < cols:\r\n if row_data[col] == 'G':\r\n col += direction\r\n else:\r\n total_moves += abs(current_row - i) + abs(current_col - col)\r\n current_row, current_col = i, col\r\n col += direction\r\n\r\nprint(total_moves)# 1690657572.5011148", "def calcbound(n, m):\r\n bound = [[0, 0] for _ in range(n + 1)]\r\n for i in range(n):\r\n bound[i][0] = 0\r\n while bound[i][0] < m and dat[i][bound[i][0]] != 'W':\r\n bound[i][0] += 1\r\n bound[i][1] = m - 1\r\n while bound[i][1] >= 0 and dat[i][bound[i][1]] != 'W':\r\n bound[i][1] -= 1\r\n bound[n][0] = m\r\n bound[n][1] = -1\r\n return bound\r\ndef mincount(n, m, bound):\r\n ans = 0\r\n now = 0\r\n for i in range(n):\r\n if i % 2:\r\n temp = now - min(bound[i][0], bound[i + 1][0])\r\n if temp >= 0:\r\n ans += temp\r\n now = min(bound[i][0], bound[i + 1][0])\r\n else:\r\n temp = max(bound[i][1], bound[i + 1][1]) - now\r\n if temp >= 0:\r\n ans += temp\r\n now = max(bound[i][1], bound[i + 1][1])\r\n if i > 0:\r\n ans += 1\r\n for i in range(n - 1, 0, -1):\r\n if bound[i][0] > bound[i][1]:\r\n ans -= 1\r\n else:\r\n break\r\n\r\n return ans\r\nn, m = map(int, input().split())\r\ndat = [list(input().strip()) for _ in range(n)]\r\nbound = calcbound(n, m)\r\nprint(mincount(n, m, bound))# 1698172956.5903385", "n, m = [int(x) for x in input().split(' ')]\r\nmatrix = [[0] * m for _ in range(n)]\r\nans = 0\r\nlast_row_pos = 0\r\nlast_row_true = 0\r\ndef find_index(arr):\r\n if all(element == 0 for element in arr):\r\n return False, -1, -1\r\n first_index = -1\r\n last_index = -1\r\n # find first 1 and the last 1, store their indexes\r\n for i in range(len(arr)):\r\n if arr[i] == 1 and first_index == -1:\r\n first_index = i\r\n if arr[i] == 1:\r\n last_index = i\r\n return True, first_index, last_index\r\n\r\n# read data\r\nfor i in range(n):\r\n one_row = list(input())\r\n assert len(one_row) == m\r\n for j in range(m):\r\n matrix[i][j] = 1 if one_row[j] == 'W' else 0\r\n\r\n# process data\r\nfor i in range(n):\r\n #found, first_index, last_index = find_index(matrix[i] if i % 2 == 0 else matrix[i][::-1])\r\n found, first_index, last_index = find_index(matrix[i])\r\n #print(found, first_index, last_index)\r\n if found:\r\n ans += i - last_row_true\r\n last_row_true = i\r\n if i % 2 == 0:\r\n if first_index < last_row_pos:\r\n ans += last_row_pos - first_index\r\n last_row_pos = first_index\r\n ans += last_index - last_row_pos\r\n last_row_pos = last_index\r\n else:\r\n if last_index > last_row_pos:\r\n ans += last_index - last_row_pos\r\n last_row_pos = last_index\r\n ans += last_row_pos - first_index\r\n last_row_pos = first_index\r\n\r\nprint(ans)\r\n" ]

[ "MOD = 10**9 + 7\r\nn = int(input())\r\nS = input()\r\ncnt = [S.count('A'), S.count('C'), S.count('G'), S.count('T')]\r\nmax_val = max(cnt)\r\nop = cnt.count(max_val)\r\nprint((op**n)%MOD )\r\n", "length, dna = int(input()), input()\r\nnums = [dna.count('A'), dna.count('C'), dna.count('G'), dna.count('T')]\r\nprint((nums.count(max(nums))**length) % 1000000007)", "from random import randint, choice\n\nMOD = 10 ** 9 + 7\nfact = [1]\nfor i in range(1, 500):\n fact.append(fact[-1] * i)\n\ndef stupid(s):\n n = len(s)\n\n d = dict()\n for x in 'ACGT':\n d[x] = s.count(x)\n\n mx = -1\n cnt = 0\n for a in range(n + 1):\n for c in range(n - a + 1):\n for g in range(n - a - c + 1): \n cur = fact[n] // fact[a] // fact[g] // fact[c] // fact[n - a - c - g]\n\n val = d['A'] * a + d['C'] * c + d['G'] * g + d['T'] * (n - a - c - g)\n val *= n\n\n if val > mx:\n mx = val\n cnt = cur\n elif val == mx:\n cnt += cur\n\n return (mx, cnt)\n\ndef check_dist():\n while True:\n n = randint(1, 100)\n s = ''\n for i in range(n):\n s += choice('ACGT')\n\n if stupid(s)[0] == max(s.count(x) for x in 'ACGT') * n * n:\n print('OK')\n else:\n print('WA')\n print(s)\n break\n\nn = int(input())\ns = input()\n\ncnt = dict()\nfor x in 'ACGT':\n cnt[x] = s.count(x)\n\nmx = max(cnt.values())\nr = list(cnt.values()).count(mx)\n\nprint(pow(r, n, MOD))\n", "n=int(input())\r\ns=input()\r\nw=[0]*4\r\nw[0]=s.count('A')\r\nw[1]=s.count('C')\r\nw[2]=s.count('G')\r\nw[3]=s.count('T')\r\nprint ((w.count(max(w))**n)%1000000007)\r\n", "n = int(input())\r\ns = {}\r\nfor i in input():\r\n if i in s:\r\n s[i] += 1\r\n else:\r\n s[i] = 1\r\nm = 0\r\nfor i in s:\r\n if s[i] > m:\r\n m = s[i]\r\nr = 0\r\nfor i in s:\r\n if s[i] == m:\r\n r += 1\r\nprint(r ** n % (10 ** 9 + 7))", "def main() -> object:\r\n \"\"\"\r\n\r\n :return: The answer which the problem is required.\r\n \"\"\"\r\n MOD = int(1e9+7)\r\n n = int(input())\r\n str = input()\r\n ATCG = [str.count('A'), str.count('T'), str.count('C'), str.count('G')]\r\n base = ATCG.count(max(ATCG))\r\n return base ** n % MOD\r\n\r\nif __name__ == \"__main__\":\r\n res = main()\r\n print(res)", "from sys import stdin, stdout\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\nfrom collections import Counter\r\n\r\ndef modulo_exponentiation(k, n):\r\n iter = 0\r\n result = 1\r\n modulus = 10**9 + 7\r\n base = k%modulus\r\n exponent = n\r\n while exponent > 0:\r\n if exponent&1:\r\n result = (result*base)%modulus\r\n exponent = exponent >> 1\r\n base = (base*base)%modulus\r\n \r\n return result\r\n\r\nif __name__ == \"__main__\":\r\n #k = int(input().strip())\r\n n = int(input().strip())\r\n s = input().strip()\r\n\r\n freq_counter = Counter(s)\r\n max_value = max(freq_counter.values())\r\n candidate = [k for k,v in freq_counter.items() if v == max_value]\r\n\r\n result = modulo_exponentiation(len(candidate), n)\r\n\r\n print(f\"{result}\\n\")\r\n", "n=int(input())\na=input()\ncnt={'A':0,'G':0,'C':0,'T':0}\nfor x in a: cnt[x]+=1\nk=max(list(cnt.values()))\nnum=0\nfor x in list(cnt.values()):\n\tif x==k: num+=1\nprint((num**n)%1000000007)\n", "def fast_power(b, e, MOD):\r\n res = 1\r\n while e > 0:\r\n if e % 2 == 1:\r\n res = res * b % MOD\r\n b = b * b % MOD\r\n e //= 2\r\n return res\r\n \r\nn = int(input())\r\nd = {'A':0 , 'C':0 , 'G':0 , 'T':0}\r\ns = input()\r\nfor i in s:\r\n d[i] += 1\r\nm, cnt = 0, 0\r\nfor i in d:\r\n if d[i] == m:\r\n cnt += 1\r\n elif d[i] > m:\r\n m = d[i]\r\n cnt = 1\r\nprint(fast_power(cnt, n, int(1e9+7)))\r\n", "n = int(input())\r\ns = input()\r\nl = [s.count('A'), s.count('C'), s.count('G'), s.count('T')]\r\nprint((l.count(max(l)) ** n) % 1000000007)", "n = int(input())\r\nL = {'A':0 , 'C':0 , 'G':0 , 'T':0}\r\ns = input()\r\nfor item in s:\r\n L[item] += 1\r\nm = 0\r\ncnt = 0\r\nfor item in L:\r\n if(L[item]==m):\r\n cnt+=1\r\n elif(L[item]>m):\r\n m = L[item]\r\n cnt = 1\r\nprint(pow(cnt,n,10**9+7))\r\n", "n = int(input())\r\na = input()\r\nocc = [a.count(p) for p in 'ACGT']\r\ncnt = occ.count(max(occ))\r\nmod = 1000000007\r\nans=1\r\nfor i in range(n):\r\n ans = ans * cnt % mod\r\nprint(ans)\r\n\r\n ", "from collections import Counter\nn = int(input())\nct = Counter(input())\nk = len([v for k, v in ct.most_common() if v == ct.most_common(1)[0][1]])\nprint(pow(k, n, 1000000007))\n", "__author__ = 'ksidorov'\n\ndef main():\n n = int(input())\n S = input()\n count = {'A': 0, 'G': 0, 'C': 0, 'T': 0}\n for ch in S:\n count[ch] += 1\n count_values = [count['A'], count['G'], count['C'], count['T']]\n min_value = max(count_values)\n print(pow(len(list(filter(lambda x: x == min_value, count_values))), n, 1000000007))\n\nif __name__ == '__main__':\n main()\n", "n, s = int(input()), input()\n\nc = sorted(s.count(b) for b in 'ACGT')\n\nprint(c.count(c[-1]) ** n % (10 ** 9 + 7))\n\n\n\n# Made By Mostafa_Khaled", "def dna(s):\r\n cnt = [0, 0, 0, 0]\r\n for i in range(len(s)):\r\n if s[i] == 'A':\r\n cnt[0] += 1\r\n if s[i] == 'C':\r\n cnt[1] += 1\r\n if s[i] == 'G':\r\n cnt[2] += 1\r\n if s[i] == \"T\":\r\n cnt[3] += 1\r\n cnt1 = sorted(cnt)\r\n j = 0\r\n while j <= 3 and cnt1[4 - j -1] == cnt1[3]:\r\n j += 1\r\n result = 1\r\n for i in range(len(s)):\r\n result = (result * j) % 1000000007\r\n return result\r\n\r\n\r\nn = int(input())\r\nt = input()\r\nprint(dna(t))\r\n", "N = int(input())\ns = input()\nm = max(s.count(c) for c in \"ATCG\")\nn = sum(s.count(c)==m for c in \"ATCG\")\nresult = 1\nfor _ in s:\n result *= n\n result %= 10 ** 9 + 7\nprint(result)\n" ]

[ "#A. Colorful Stones\r\n\r\nfrom tkinter import S\r\n\r\n\r\ns = input()\r\nt = input()\r\ni = 0\r\nj = 0\r\ncounter = 1\r\n\r\nwhile j < len(t):\r\n if s[i] != t[j]:\r\n j += 1\r\n elif s[i] == t[j]:\r\n i += 1\r\n j += 1\r\n counter += 1\r\n\r\nprint(counter)", "input1=list(input())\r\ninstructions=list(input())\r\nans=1\r\ncounter1=0\r\ncounter2=0\r\nfor i in range(len(instructions)):\r\n if instructions[counter1]==input1[counter2]:\r\n ans+=1\r\n counter2+=1\r\n counter1+=1\r\nprint(ans)", "s = input()\r\nt = input()\r\ncount=1\r\nsi=0\r\nfor i in range(len(t)):\r\n if t[i] == s[si]:\r\n count+=1\r\n si+=1\r\n\r\nprint(count)", "str1 = input()\r\nstr2 = input()\r\npos = 1\r\nfor ch in str2:\r\n if str1[pos-1] == ch:\r\n pos += 1\r\nprint(pos)", "s = input()\r\n\r\nt = input()\r\n\r\ncount = 0\r\n\r\nfor i in t:\r\n\r\n liss = s[count]\r\n\r\n if liss == i:\r\n liss = s[count]\r\n\r\n count += 1\r\n\r\nprint(count+1)", "s = input()\r\nc = input()\r\nj = 0\r\nans = 0\r\nfor i in range(len(c)):\r\n if s[j] == c[i] :\r\n ans += 1\r\n j += 1\r\nprint(ans+1)", "colorful_stones = input()\ninstructions = input()\n\nliss_position = 1\n\nfor instruction in instructions:\n if colorful_stones[liss_position - 1] == instruction:\n liss_position += 1\n\nprint(liss_position)\n\n ", "s=input()\r\nt=input()\r\ncount=0\r\ni=0\r\nx=s[0]\r\nwhile i<len(t):\r\n if x==t[i]:\r\n count+=1\r\n x=s[count]\r\n i+=1\r\nprint(count+1)", "s1=input()\r\ns2=input()\r\nj=0\r\nfor i in range(len(s2)):\r\n if s2[i]==s1[j]:\r\n j+=1 \r\nif j>len(s1)-1:\r\n print(len(s1))\r\nelse:\r\n print(j+1)", "# import sys\r\n# sys.stdin = open('input.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\n\r\n\r\n\r\ns = input()\r\npos = 0\r\nt = input()\r\nfor i in range(len(t)):\r\n\tif t[i] == s[pos]:\r\n\t\tpos += 1\r\nprint(pos+1)\r\n\r\n", "a = input()\r\nb = input()\r\nd = 0\r\nfor j in range(len(b)):\r\n if b[j] == a[d]:\r\n d += 1\r\nprint(d + 1)", "s = input()\r\nt = input()\r\ns_len = len(s)\r\nt_len = len(t)\r\ni ,j = 0,0\r\nwhile(i < s_len and j < t_len):\r\n if s[i] == t[j] :\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(i+1)", "s = input()\r\nt = input()\r\n\r\nn = len(t)\r\n\r\nres = 1\r\nindex = 0\r\n\r\nfor i in range(n):\r\n if t[i] == s[index]:\r\n res += 1\r\n index += 1\r\n\r\nprint(res)", "s=input()\nt=input()\n\ns_c = 0\n# t_c = 0\n\nfor k in t:\n\tif k == s[s_c]:\n\t\ts_c += 1\nprint(s_c + 1)", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\ts = input()\r\n\t\tt = input()\r\n\t\ti = 0; j = 0\r\n\r\n\t\twhile j < len(t):\r\n\t\t\tif t[j] == s[i]:\r\n\t\t\t\ti += 1\r\n\t\t\tj += 1\r\n\r\n\t\tprint(i + 1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "#Strings always win\r\nW= str(input())\r\nQ = str(input())\r\nn = 0\r\nfor i in W:\r\n if i in Q:\r\n n+=1\r\n Q =Q[Q.index(i)+1:]\r\n else:\r\n break\r\n\r\nprint(n+1)\r\n", "stones=list(input())\r\ninstructions=list(input())\r\nstone=0\r\nfor i in instructions:\r\n if stones[stone]==i:\r\n stone+=1\r\nprint(stone+1)", "s = input()\r\nt = input()\r\ni = 0\r\nfor x in t:\r\n if s[i] == x:\r\n i += 1\r\nprint(i+1)\r\n", "# 265A\r\nstones = input()\r\nseq = input()\r\npos = 1\r\nfor inst in seq:\r\n if stones[pos-1] == inst:\r\n pos+=1\r\nprint(pos)", "s = input()\r\nt = input()\r\n\r\ncount = 1\r\nj = 0\r\ncurr = s[j]\r\nfor i in t:\r\n\tif i == curr:\r\n\t\tcount += 1\r\n\t\tj += 1\r\n\t\tcurr = s[j]\r\n\r\nprint(count)\r\n", "s = input()\r\nt = input()\r\nn = 0\r\n\r\nfor c in t:\r\n n += (s[n] == c)\r\nprint(n + 1)\r\n", "path = input()\r\n\r\ninstructions = input()\r\n\r\npathList = list(path)\r\n\r\ninstrList = list(instructions)\r\n\r\nposition = 0\r\n\r\n\r\nfor i,value in enumerate(instrList):\r\n # print(f\"Instr = {value}\")\r\n # print(f\"path = {pathList[position]}\")\r\n if(value == pathList[position]):\r\n # print(\"added to position\")\r\n position += 1\r\n\r\n\r\nprint(position + 1)\r\n", "import sys\r\ndef inp() : return sys.stdin.readline().strip()\r\ndef get_ints(): return map(int, inp().split())\r\ndef get_arr(): return list(map(int, inp().split()))\r\ndef get_int(): return int(inp())\r\ns=inp()\r\nt=inp()\r\nj=0\r\nfor c in t:\r\n if(c==s[j]):\r\n j+=1\r\nprint(j+1)", "s = input()\r\nt = input()\r\na = 0\r\nptr = 0\r\nwhile ptr<len(t):\r\n if t[ptr]==s[a]:\r\n a+=1\r\n ptr+=1\r\nprint(a+1)", "s = input()\r\nt = input()\r\npos = 1\r\nfor i in t:\r\n if s[pos-1] == i:\r\n pos+=1\r\n\r\nprint(pos)", "s = input()\r\ni = 0\r\nfor j in input():\r\n if s[i] == j:\r\n i += 1\r\nprint(i+1)", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n c=0\r\n ans=0\r\n for i in range(len(s)):\r\n a=s[i]\r\n #print(ans,c)\r\n while(c<len(t) and t[c]!=a):\r\n c+=1\r\n #print(ans,c)\r\n ans+=1\r\n c+=1\r\n if(c>=len(t)):\r\n if(t[len(t)-1]==a):\r\n ans+=1\r\n \r\n return ans\r\n return ans\r\ns=input()\r\nt=input()\r\nprint(exe())", "inst=list(input())\r\nseq=list(input())\r\nn=len(inst)\r\nm=len(seq)\r\ni,j=0,0\r\nres=1\r\nwhile i<n and j<m:\r\n if inst[i]==seq[j]:\r\n j+=1\r\n i+=1\r\n res+=1\r\n else:j+=1\r\nprint(res)", "s = input()\nt = input()\npos = 0\nfor command in t:\n if s[pos] == command:\n pos += 1\nprint(pos + 1)", "def split(string, sep=\" \"):\n prev = 0\n for i, char in enumerate(string):\n if char == sep:\n if i != prev:\n yield string[prev:i]\n prev = i + 1\n\n ret = string[prev:]\n if ret:\n yield ret\n\ns = input()\nt = input()\n\ni = 0\n\nfor inst in t:\n if s[i] == inst:\n i += 1\n\nprint(i + 1)", "stones = input()\ninstructions = input()\nliss_position = 0\nfor instruction in instructions:\n if instruction == stones[liss_position]:\n liss_position += 1\nprint(liss_position + 1)\n", "standing = input() #RGB\r\ninst = input() #RRR\r\nstanding_on = 0\r\nfor char in inst:\r\n if char == standing[standing_on]:\r\n standing_on+=1\r\nprint(standing_on + 1)", "# RRRBGBRBBB\r\n# BBBRR\r\ns = input()\r\nt = input()\r\nstep = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[step]:\r\n step+=1\r\nprint(step+1)\r\n\r\n", "s = input() \r\nt = input() \r\nj = 0 \r\npos = 1\r\nfor i in range(len(t)): \r\n if t[i] == s[j]: \r\n pos += 1 \r\n j += 1\r\nprint(pos)", "# 122 ms, 0KB\r\ns = input()\r\nt = input()\r\npos = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[pos]:\r\n pos += 1\r\nprint(pos + 1)\r\n\r\n# 124 ms, 0KB\r\n\"\"\"\r\nimport sys\r\n\r\nlst1, lst2 = [], []\r\npos = 0\r\nstring = sys.stdin.readline().strip()\r\ninstructions = sys.stdin.readline().strip()\r\n\r\nfor instruction in instructions:\r\n lst2.append(instruction)\r\nfor color in string:\r\n lst1.append(color)\r\n\r\nfor i in range(len(lst2)):\r\n if lst2[i] == lst1[pos]:\r\n pos += 1\r\nprint(pos + 1)\r\n\"\"\"\r\n", "S=input()\r\nk=0\r\nS1=input()\r\nfor i in range(len(S1)) :\r\n if S1[i]==S[k] :\r\n k=k+1\r\n if k+1==len(S) :\r\n break\r\nprint(k+1)", "n = str(input())\r\ncolors = str(input())\r\nx = 0\r\nfor i in range (len(colors)):\r\n if colors[i] == n[x]:\r\n x += 1\r\nprint(x + 1)", "s= input()\r\nt= input()\r\ncount = 0\r\ni = 0\r\nfor j in t:\r\n if s[i] == j:\r\n i+= 1\r\nprint(i+ 1)", "s = input()\r\nc = input()\r\n\r\nans = 1\r\ncurr = s[0]\r\n\r\nfor char in c:\r\n if char == curr:\r\n ans += 1\r\n curr = s[ans - 1]\r\n\r\nprint(ans)", "s = input()\r\nt = input()\r\ni = 0\r\nj = 0\r\nwhile i<len(t):\r\n while i<len(t) and t[i]!=s[j]:\r\n i+=1\r\n if i<len(t):\r\n j+=1\r\n i+=1\r\nprint(j+1)\r\n\r\n", "stons = input()\r\nins = input()\r\ni = 0\r\nj = 0\r\nwhile i < len(stons) and j < len(ins):\r\n if stons[i] == ins[j]:\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n\r\nprint(i + 1)", "s = input()\r\nt = input()\r\nind = 0\r\nfor t1 in range(len(t)):\r\n\tif s[ind] == t[t1]:\r\n\t\tind += 1\r\nprint(ind + 1)", "s = list(input())\r\nt = list(input())\r\nposition = 1\r\n\r\nfor x in range(0, len(s)):\r\n while len(t)>0:\r\n if s[x] == t[0] :\r\n position+=1\r\n t.pop(0)\r\n break\r\n t.pop(0)\r\n\r\n \r\n\r\nprint (position)", "s = input()\r\nss = input()\r\nres = 0\r\nfor i in range(len(ss)):\r\n if s[res] == ss[i]:\r\n res+=1\r\nprint(res+1) ", "S = str(input())\nT = str(input())\npedraS = list(S)\ninstrucaoT = list(T)\ni= 0\nn = 0\n\nfor n in range(0, len(instrucaoT)):\n if pedraS[i] == instrucaoT[n]:\n i = i + 1\n\nprint(i+1)\n\t\t \t \t\t\t \t\t\t \t \t \t\t \t \t\t\t", "a = input()\r\nb = input()\r\nx = 0\r\nfor i in b:\r\n if i == a[x]:\r\n x += 1\r\nprint(x+1)", "s = input().strip()\r\nl = input().strip()\r\n \r\nless = 0\r\n \r\nfor i in range(len(l)) :\r\n if s[less] == l[i] :\r\n less += 1\r\n \r\nprint(less + 1)\r\n", "l = input(\"\")\r\nt = input(\"\")\r\ncurrPos = 0\r\nfor i in t:\r\n if l[currPos] == i:\r\n currPos+=1\r\nprint(currPos+1)\r\n", "a=input()\r\nb=input()\r\nc=0\r\nfor x in range(len(b)):\r\n if b[x]==a[c]:\r\n c+=1\r\nprint(c+1)", "if __name__ == '__main__':\r\n c = input()\r\n s = input()\r\n move = 0\r\n k = 0\r\n for i in range(len(s)):\r\n if s[i] == c[k]:\r\n move += 1\r\n k += 1\r\n print(move+1)\r\n", "s=input('')\r\nx=input('')\r\nj=0\r\nfor i in x:\r\n if i==s[j]:\r\n j+=1\r\nprint(j+1)", "s = input()\r\nt = input()\r\ns_l = list(s)\r\n\r\nn = 0\r\nc = 0\r\nfor i in s_l[:len(s) - 1]:\r\n for c in range(c, len(t)):\r\n if t[c] == i:\r\n n += 1\r\n break\r\n c += 1\r\n if c == len(t):\r\n break\r\n\r\nprint(n+1)", "def move(colors, instructions):\r\n idx = 0\r\n for ch in instructions:\r\n if ch == colors[idx]:\r\n idx += 1\r\n return idx + 1\r\n\r\ncolors = input()\r\ninstructions = input()\r\nprint(move(colors, instructions))\r\n", "A = input()\r\nB = input()\r\nBB = list(B)\r\nAA = list(A)\r\nn = len(B)\r\nk = 1\r\nfor i in range(n):\r\n if AA[0] == BB[0]:\r\n AA.remove(AA[0])\r\n BB.remove(BB[0])\r\n k += 1\r\n else:\r\n BB.remove(BB[0])\r\nprint(k)\r\n", "import sys\r\n\r\ndef main():\r\n l = sys.stdin.read().strip().split('\\n')\r\n i = 0\r\n for j in l[1]:\r\n if j == l[0][i]: i += 1\r\n return i + 1\r\n \r\nprint(main())", "s = input()\nt = input()\nsteps = 0\nj = 0\nfor i in range(len(t)):\n if t[i] == s[j]:\n steps += 1\n j += 1\n\nprint(steps + 1)", "loc=input()\r\ntest=input()\r\nl=0\r\nfor x in range(len(test)):\r\n if loc[l]==test[x] :\r\n l+=1\r\nprint(l+1)", "s=input()\r\nt=input()\r\nlp=0\r\nfor i in range(len(t)):\r\n if t[i]==s[lp]:\r\n lp+=1\r\n \r\nprint(lp+ 1)", "n = list(input())\r\nt = list(input())\r\npos = 0\r\nfor i in range(len(t)):\r\n if t[i]==n[pos]:\r\n pos += 1\r\nprint(pos+1)", "n=input()\r\na=[]\r\na[:0]=n\r\nm=input()\r\nb=[]\r\nb[:0]=m\r\nc=1\r\nd=0\r\nfor i in range(len(b)):\r\n if(a[d]==b[i]):\r\n c+=1\r\n d+=1\r\nprint(c)", "A=input()\r\nB=input()\r\nn,m,count=[],[],0\r\npos=0\r\nfor i in range(len(B)):\r\n if B[i]==A[pos]:\r\n pos+=1\r\nprint(pos+1)", "\"\"\"\r\ninput().split()\r\n\"\"\"\r\ns = list(input())\r\nt = list(input())\r\n\r\ncounter = 0\r\nindex = 0\r\n\r\nfor i in range(0, len(t)):\r\n for x in range(index, len(s)):\r\n if(t[i] != s[x]):\r\n break\r\n elif(t[i] == s[x]):\r\n index = index + 1\r\n break\r\n\r\nprint(index + 1)\r\n", "s=input()\r\nt=input()\r\nss=list(s)\r\ntt=list(t)\r\na=1\r\nj=0\r\nfor i in range(len(t)):\r\n\r\n if tt[i]==ss[j]:\r\n a+=1\r\n j+=1\r\n \r\nprint(a)", "x,y=input(),input()\r\ni,j=0,0\r\nans=1\r\n\r\nwhile i<len(x) and j<len(y):\r\n if x[i]==y[j]:\r\n ans+=1\r\n i+=1\r\n j+=1\r\nprint(ans)\r\n", "'''\r\n ************************ বিসমিল্লাহির রাহমানির রাহিম\r\n\r\n بِسْمِ ٱللَّٰهِ ٱلرَّحْمَٰنِ ٱلرَّحِيمِ *********************\r\n\r\n ********************************************* Bismillahir Rahmanir Rahim\r\n'''\r\n\r\n'''************************************************************************\r\n\r\n PROBLEM :A. Colorful Stones (Simplified Edition)\r\n SOLUTATOIN....\r\n\r\n ************************************************************************\r\n'''\r\ns=input()\r\nt=input()\r\nc=0\r\nfor i in range(len(t)):\r\n if t[i]==s[c]:\r\n c+=1\r\nprint(c+1)", "S = input()\nC = input()\n\ncurr_idx = 0\nans = 0\nfor c in C:\n if c == S[curr_idx]:\n curr_idx += 1\n ans += 1\n\nprint(ans+1)\n", "a=input()\r\nb=input()\r\nlen_a=len(a)\r\nlen_b=len(b)\r\ni,j=0,0\r\nwhile len_a>i and len_b>j:\r\n\tif a[i]==b[j]:\r\n\t\ti+=1\r\n\tj+=1\r\nprint(i+1)\r\n", "s=input()\r\nt=input()\r\ni=0\r\nj=0\r\ncount=0\r\nwhile(j<len(t)):\r\n if(t[j]==s[i]):\r\n i+=1\r\n count+=1\r\n j+=1\r\nprint(count+1) \r\n", "s=input()\r\nt=input()\r\ncount=0\r\nfor a in range(0,len(t)):\r\n if(s[count]==t[a]):\r\n count+=1\r\nprint(count+1)", "x = input(); y = input()\r\ncurr_pos = 0\r\n\r\nfor i in y : \r\n if i == x[curr_pos] : curr_pos += 1\r\n\r\nprint(curr_pos + 1)\r\n", "s = input()\r\nt = input()\r\nind = 0\r\nfor c in t:\r\n if c == s[ind]:\r\n ind += 1\r\nprint(ind + 1)", "x=list(str(input()))\r\ny=list(str(input()))\r\nt=0\r\nfor m in y:\r\n if m==x[t]:\r\n t+=1\r\nprint(t+1)\r\n ", "import sys\r\n\r\n\r\ndef sol():\r\n\tread = sys.stdin.readline\r\n\ts: str = read()\r\n\tt: str = read()\r\n\r\n\ts_idx: int = 0\r\n\tfor instruction in t:\r\n\t\tif instruction == s[s_idx]:\r\n\t\t\ts_idx += 1\r\n\tprint(s_idx + 1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol()", "a=list(input())\r\nb=list(input())\r\nj=0\r\nfor i in b:\r\n if i==a[j]:\r\n j+=1\r\nprint(j+1)", "s = input()\r\nt = input()\r\ncurr = s[0]\r\nans = 1\r\nfor each in t:\r\n if each == curr:\r\n ans += 1\r\n curr = s[ans-1]\r\nprint(ans)", "s,t=input(),input()\r\nl,m=0,0\r\nwhile m<len(t):\r\n\tif s[l]==t[m]:\r\n\t\tl+=1\r\n\tm+=1\r\nprint(l+1)", "s,i=input(),0\r\nfor a in input():i+=(a==s[i])\r\nprint(i+1)", "s = input()\r\nt = input()\r\ncount = 0\r\nfor i in range(len(t)):\r\n if t[i]==s[count]:\r\n count+=1\r\nprint(count+1)\r\n \r\n", "s=input()\r\nt=input()\r\n\r\ni=j=0\r\nk=len(t)\r\n\r\nwhile j<k:\r\n if s[i]==t[j]:\r\n i=i+1\r\n j=j+1\r\n\r\nprint(i+1)\r\n", "s = input()\r\nc = input()\r\nj = 0\r\nfor i in c:\r\n if s[j] == i :\r\n j+=1\r\nprint(j+1)\r\n\r\n", "stones = list(input())\ninstructions = list(input())\nposition = 0\n\nfor instruction in instructions:\n if instruction == stones[position]:\n position += 1\n\nprint(position + 1)\n", "# LUOGU_RID: 101473534\ns, t = input(), input()\r\np = 0\r\nfor c in t:\r\n if s[p] == c:\r\n p += 1\r\nprint(p + 1)", "p=str(input())#posi\r\nt=str(input())#insTruction\r\nlent,lenp=len(t),len(p)\r\ni=0\r\nj=0\r\nwhile j!=len(t):\r\n if p[i]==t[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(i+1)\r\n ", "a = input()\ninstructions = input()\n\nl = 1\nfor x in instructions:\n if a[l-1] == x:\n l += 1\n\nprint(l)", "s = input()\r\ncom = input()\r\nt = 0\r\nfor i in range(len(com)):\r\n if com[i] == s[t]:\r\n t += 1\r\n\r\nprint(t+1)\r\n\r\n\r\n\r\n", "inp = input()\r\ninpp = input()\r\n\r\ns = 0\r\n\r\nfor i in range(len(inpp)):\r\n if inpp[i] == inp[s]:\r\n s += 1\r\n\r\n\r\nprint(s + 1)", "a = input()\r\nb = input()\r\n\r\nans = 1\r\n\r\na1 = 0\r\n\r\nfor i in b:\r\n if a[a1] == i:\r\n ans += 1\r\n a1 += 1\r\n \r\nprint(ans)", "s = input()\r\nt = input()\r\nlen2 = len(t)\r\ni = 0\r\nj = 0\r\nwhile j != len2:\r\n if s[i] == t[j]:\r\n i+=1\r\n j+=1\r\nprint(i+1)", "x =(input())\r\ny =(input())\r\na = 0\r\nb = 0\r\nc = 1\r\nwhile a<len(x) and b < len(y):\r\n if x[a]==y[b]:\r\n a+=1\r\n c+=1\r\n b+=1\r\n else:\r\n b+=1\r\nprint(c)\r\n", "s=input()\r\nt=input()\r\nind=1\r\ni=0\r\nfor j in range(0,len(t)):\r\n if s[i]==t[j]:\r\n ind+=1\r\n i+=1\r\n \r\nprint(ind)", "s = list(map(str, input()))\r\nc_instrctions = list(map(str, input()))\r\nthe_counter = 1\r\ni=0\r\nif len(s) > 1:\r\n for c in range(len(c_instrctions)):\r\n if c_instrctions[c] == s[i]:\r\n the_counter += 1\r\n i += 1\r\n\r\n\r\n\r\n\r\nif the_counter> len(s):\r\n print(len(s))\r\nelse:\r\n print(the_counter)\r\n", "f =input()\ng = input()\ny = 0 \nfor x in range(len(g)):\n if g[x]==f[y]:\n y=y+1\n else:\n pass\n \n\nprint(y+1)\n\n \n\n\n", "s = input()\r\nt = input()\r\nidx = 0\r\n\r\nfor i in range(len(t)):\r\n if t[i] == s[idx]:\r\n idx += 1\r\n\r\nprint(idx+1)\r\n", "a=input(\"\")\r\nb=input(\"\")\r\na=list(a)\r\np=1\r\nfor i in b:\r\n if i==a[0]:\r\n p+=1\r\n a.remove(a[0])\r\nprint(p)\r\n", "s = input()\r\nt = list(input())\r\nc = 1\r\nii = 0\r\nfor a in t:\r\n if a==s[ii]:\r\n c+=1\r\n ii+=1\r\nprint(c)\r\n", "a,b=input(),input()\r\nc=1\r\nfor i in range(len(b)):\r\n\tif a[c-1]==b[i]:\r\n\t\tc+=1\r\nprint(c)", "s = list(input())\r\nt = list(input())\r\ncount = 0\r\ncurrent = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[current]:\r\n count += 1\r\n current += 1\r\nprint(count + 1)\r\n", "s = input()\r\n\r\ns2 = input()\r\nl = 0\r\nl2 = 0\r\n\r\nfor c in s2 :\r\n if c == s[l]:\r\n l+=1\r\n\r\nprint(l+1)", "n = input()\r\nni=0\r\na = input()\r\nfor i, o in enumerate(a):\r\n\r\n if(o == n[ni]):\r\n ni+=1\r\nprint(ni+1)", "s = input()\r\nt = input()\r\nj, i = 0, 0\r\nwhile i < len(s) and j < len(t):\r\n if s[i] != t[j]:\r\n i -= 1\r\n j += 1\r\n if i+1 < len(s) and t[0] == s[i+1]:\r\n j %= len(t)\r\n i += 1\r\nprint(min(len(s),i+1))\r\n\r\n\r\n\r\n\r\n", "s = list(input())\r\nt = list(input())\r\nposition = 1\r\nj = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[j]:\r\n position += 1\r\n j += 1\r\n else:\r\n continue\r\nprint(position)\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 ColorfulStonesSimple:\n def solve(self, s, t):\n pos = 0\n for c in t:\n if s[pos] == c: pos += 1\n print(pos+1)\n\nif __name__ == \"__main__\":\n s = Input.insr()\n t = Input.insr()\n colorfulStonesSimple = ColorfulStonesSimple()\n colorfulStonesSimple.solve(s, t)\n", "s = input()\r\nt = input()\r\nh = 0\r\n\r\nfor i in range(len(t)):\r\n if t[i] == s[h]:\r\n h += 1\r\n\r\nprint(h+1)\r\n", "s = str(input())\r\nt = str(input())\r\ni =0\r\nj =0\r\nwhile(j<len(t)):\r\n if s[i]==t[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(i+1)", "s=input()\r\nt=input()\r\nind=0\r\nfor i in range(len(t)):\r\n if t[i]==s[ind]:\r\n ind+=1\r\nprint(ind+1)", "\"\"\"Colorful Stones (Simplified Edition)\"\"\"\r\ns = input()\r\nt = input()\r\ni = 0\r\nfor j in t:\r\n if j == s[i]:\r\n i += 1\r\n else:\r\n continue\r\nprint(i+1)\r\n", "s1 = input()\r\n\r\ns2 = input()\r\n\r\ni = 0\r\n\r\nfor d in s2:\r\n if d == s1[i]:\r\n i +=1\r\n\r\nprint(i+1)\r\n", "colors = input()\nmoves = input()\nindex = 0\n\nfor m in moves:\n if m == colors[index]:\n index += 1\n\nprint(index + 1)", "s=input()\r\nt=input()\r\nc=0\r\np=0\r\nfor j in range(len(t)):\r\n if s[p]==t[j]:\r\n c+=1\r\n p+=1\r\nprint(c+1)\r\n", "s = input()\r\nt = input()\r\nans = 0\r\nfor _ in range(len(t)):\r\n if t[_] == s[ans]:\r\n ans+=1\r\nprint(ans + 1)", "s=input()\r\nt=input()\r\nl1 = len(s)\r\nl2 = len(t)\r\ni=0\r\nj=0\r\nwhile i<l1 and j<l2:\r\n if s[i]==t[j]:\r\n i+=1\r\n j+=1\r\nprint(i+1)", "stones = list(map(str,input()))\r\ncolors = list(map(str,input()))\r\n\r\n#print(stones)\r\n#print(colors)\r\n\r\nmove = 1\r\ncounter = 0\r\n\r\nfor i in range(len(colors)):\r\n if colors[i] == stones[counter]:\r\n move += 1\r\n counter += 1\r\n\r\nprint(move)\r\n ", "s=input()\r\nc=input()\r\nx=0\r\nfor y in c:\r\n if y==s[x]:x+=1\r\nprint(x+1)\r\n \r\n", "x=input()\r\ny=input()\r\nc=1 \r\nfor i in y:\r\n if i==x[(c-1)]:\r\n c+=1\r\nprint(c)\r\n \r\n", "x = input()\r\ny = input()\r\nit = 0\r\np = 0\r\nfor i in range(len(y)):\r\n if y[i] == x[p]:\r\n it += 1\r\n p += 1\r\nprint(it + 1)", "i=input;s,t=i(),i();ans,idx=1,0\r\nfor i in t:\r\n if s[idx]==i:ans+=1;idx+=1\r\nprint(ans)", "# -*- coding: utf-8 -*-\n\"\"\"Untitled75.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1D1x8mgVYBiLay890KzZPAq2TMoXX-k_G\n\"\"\"\n\ns=input()\nt=input()\nc=0\nfor x in t:\n if x==s[c]:\n c=c+1\nprint(c+1)", "s = input ()\r\nt = input ()\r\npos = 0\r\nfor char in t:\r\n if s [pos] == char:\r\n pos += 1\r\nprint (pos + 1)\r\n", "a = input()\r\nb = input()\r\npos = 0\r\nfor i in range(len(b)):\r\n\tif a[pos]==b[i]:\r\n\t\tpos+=1\r\nprint(pos+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun May 2 12:45:26 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\ns = input().lower()\r\nt = input().lower()\r\ns = [i for i in s]\r\nt = [i for i in t]\r\nans = 0\r\na = \"\"\r\nb = \"\"\r\nx = True\r\nc = 0\r\nfor i in range(len(t)):\r\n if x == True:\r\n a = s[c]\r\n b = t[i]\r\n else:\r\n b = t[i]\r\n if a == b:\r\n ans += 1\r\n c += 1\r\n x = True\r\n else:\r\n x = False\r\nprint(ans + 1)", "s=list(input())\r\nt=list(input())\r\npos=1\r\nj=0\r\nfor i in range(len(t)):\r\n\tif t[i]==s[j]:\r\n\t\tpos+=1\r\n\t\tj+=1\r\nprint(pos)", "t = input()\r\ns = input()\r\n\r\ni = 0\r\nfor x in s:\r\n if t[i] == x:\r\n i += 1\r\n\r\nprint(i + 1)", "s = input()\r\nt = input()\r\nn = len(t)\r\nj = 0\r\nfor i in range(n):\r\n if t[i] == s[j]:\r\n j+=1\r\nprint(j+1)\r\n", "s = input()\r\nt = input()\r\nthe_structure = s+t\r\ni = 0\r\nk = len(s)\r\nposition = 1\r\n\r\nfor _ in range(len(t)):\r\n if the_structure[i]==the_structure[k]:\r\n i +=1\r\n k +=1\r\n position +=1\r\n else:\r\n k += 1\r\nprint(position)", "s = input()\r\nt = input()\r\n\r\nposition = 0\r\n\r\nfor ins in t:\r\n current_color = s[position]\r\n if ins == current_color:\r\n position += 1\r\n\r\nprint(position + 1)\r\n", "step=input()\r\ninstruction=input()\r\nj=0\r\nfor i in range(len(instruction)):\r\n if instruction[i]==step[j]:\r\n j+=1\r\nprint(j+1)", "s = input()\r\nt = input()\r\nposition = 0\r\nfor i in t :\r\n if i == s[position] :\r\n position +=1\r\nprint(position+1)\r\n\r\n", "import sys\n\nimport re\nimport collections\nimport math\nimport itertools\n\n\nclass Point(object):\n\tdef __init__(self, x=0, y=0):\n\t\tself.x = x\n\t\tself.y = y\n\n\n\ndef function(*args):\n N = lambda: int(input())\n A = lambda: [int(e) for e in input()]\n P = lambda: map(int, input().split())\n s = input()\n t = input()\n ps = 0\n pt = 0\n while pt < len(t):\n if t[pt] == s[ps]:\n ps+=1\n pt+=1\n else:\n pt+=1\n print(ps+1)\nif __name__ == '__main__':\n\tfunction()\t\n", "stones = input()\r\ninst = input()\r\nsq = 0\r\n\r\nfor i in range(len(inst)):\r\n if inst[i] == stones[sq]:\r\n sq+=1\r\nprint(sq+1)\r\n", "colors_of_stones = input().strip()\r\ncolors_of_instruction = input().strip()\r\ny = 0\r\nfor i in colors_of_instruction :\r\n if i == colors_of_stones[y] :\r\n y = y + 1\r\nprint(y + 1)\r\n", "\r\ns = input()\r\nt = input()\r\nindex = 0\r\ncounter = 0\r\n\r\nfor i in range(len(t)):\r\n if s[index] == t[i]:\r\n index += 1\r\n counter += 1\r\n\r\nprint(counter+1)\r\n", "s=input()\r\nx=input()\r\na=0\r\nfor i in range(len(x)):\r\n if x[i] == s[a]:\r\n a += 1\r\nprint(a+1)", "from math import *\r\ndef solve():\r\n s = input()\r\n t = input()\r\n count1 = count2 = 0\r\n ans = 1\r\n while(1):\r\n if(s[count1] == t[count2]): count1 += 1; ans += 1; count2 += 1\r\n else: count2 += 1\r\n if(count1 >= len(s) or count2 >= len(t)): break\r\n print(ans)\r\n\r\n\r\n\r\nsolve()\r\n\r\n\r\n\r\n\r\n", "a=input()\r\nb=input()\r\nB=0\r\nfor i in b:\r\n if i==a[B]:\r\n B=B+1\r\nprint(B+1)", "stones = input()\r\ninstruction = input()\r\nposition = 0\r\nfor i in range(len(instruction)):\r\n if instruction[i] == stones[position]:\r\n position += 1\r\nprint(position+1)\r\n", "x = input()\r\norders = list(input())\r\npos = 0\r\nfor i in orders:\r\n if i == x[pos]:\r\n pos+=1\r\nprint(pos+1)", "stones = input()\r\ninstructions = input()\r\nposition = 0\r\nj = 0\r\nwhile j < len(instructions):\r\n if stones[position] == instructions[j]:\r\n position += 1\r\n j += 1\r\nprint(position + 1)\r\n\r\n", "x=input()\r\nn=input()\r\nz=len(n)\r\nc=0\r\nfor i in range(z):\r\n if x[c]==n[i]:\r\n c+=1\r\n \r\nprint(c+1)", "s = list(input())\r\nt = list(input())\r\npos = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[pos]:\r\n pos += 1\r\n else:\r\n pos = pos\r\nprint(pos+1)", "s = input()\r\nt = input()\r\nfp = 1\r\ni = 0\r\nj = 0\r\nwhile i< len(s) and j < len(t):\r\n if s[i] == t[j]:\r\n fp += 1\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(fp)", "s = input()\r\nt = input()\r\nposition = 1\r\nflag = True\r\ncheck = list('RGB')\r\nfor i in list(s):\r\n if i not in check: flag = False\r\nfor i in list(t):\r\n if i not in check: flag = False\r\nif flag == True:\r\n if len(s) > len(t): t = ''.join((t, '0'*(len(s)-len(t))))\r\n elif len(s) < len(t): s = ''.join((s, '0'*(len(t)-len(s))))\r\n while min(len(t),len(s)) > 0:\r\n if s[0] == t[0]:\r\n position += 1\r\n s, t = s[1:], t[1:]\r\n else: t = t[1:]\r\nprint(position)", "s=input()\r\nt=input()\r\nc=1\r\nk=0\r\nfor i in t:\r\n if i==s[k]:\r\n k+=1\r\n c+=1\r\nprint(c)\r\n", "s = input()\r\nt = input()\r\ncurr = 0\r\nfor i in t:\r\n if i == s[curr]:\r\n curr += 1\r\nprint(curr + 1)", "stones = input('')\r\ninstructions = input('')\r\n\r\nstone_position = 0\r\n\r\nfor c in instructions:\r\n if c == stones[stone_position]:\r\n stone_position += 1\r\n\r\nprint(stone_position + 1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input().strip()\r\nt = input().strip()\r\ni = 0\r\n\r\nfor c in t:\r\n if s[i] == c:\r\n i += 1\r\nprint(i+1)", "# Colorful Stones (Simplified Edition)\ndef stones(s, t):\n ans = 1\n i = 0\n j = 0\n while i < len(s) and j < len(t):\n if s[i] == t[j]:\n ans += 1\n i += 1\n j += 1\n return ans\n\ns = input()\nt = input()\nprint(stones(s, t))", "idx = 0\r\ns = input()\r\nt = input()\r\nfor i in t:\r\n if i == s[idx]:\r\n idx += 1\r\nprint(idx+ 1)", "def stones(s,t):\r\n k=1\r\n h=[char for char in s]\r\n i=0\r\n for j in t:\r\n if j==h[i]:\r\n k+=1\r\n i+=1\r\n return k\r\n\r\ns=input()\r\nt=input()\r\nprint(stones(s,t))", "mycolors = list(input().upper())\r\nques = list(input().upper())\r\nz = 0\r\nx = 0\r\nblock = 1\r\n# print(len(ques))\r\nfor i in range(len(ques)):\r\n if mycolors[z] == ques[x]:\r\n z+=1\r\n x+=1\r\n block+=1\r\n elif mycolors[z] != ques[x]:\r\n x+=1\r\nprint(block)", "# q19 A. Colorful Stones (Simplified Edition)\r\ns = input()\r\ninst = input()\r\nposition=0\r\nfor i in range (len(inst)):\r\n if inst[i] == s[position]:\r\n position+=1\r\nprint (position+1) \r\n", "i = 0\r\ns = input()\r\nfor j in input():\r\n if j == s[i]:\r\n i += 1\r\nprint(i + 1)", "a1 = list(input())\r\n\r\na2 = list(input())\r\n\r\ntmp = a1[0]\r\n\r\nj = 0\r\n\r\nfor i in range(len(a2)):\r\n \r\n if tmp == a2[i]:\r\n \r\n j += 1\r\n \r\n tmp = a1[j]\r\n \r\nprint(j+1)", "s = input()\r\nt = input()\r\n\r\nm = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[m]:\r\n m += 1\r\nprint(m+1)", "s = input()\r\nt = input()\r\ncur_pos = 0 # 0-based\r\nfor i in range(0, len(t)):\r\n if t[i] == s[cur_pos]:\r\n cur_pos += 1\r\nprint(cur_pos + 1) # 1-based\r\n", "i=0\r\ns=input()\r\nx=input()\r\nc=0\r\nfor e in x:\r\n if e==s[i]:\r\n i+=1\r\nprint(i+1)\r\n ", "stones = input()\ninstraction = input()\nposition = 0\nfor char in instraction:\n if char == stones[position]:\n position += 1\nprint(position + 1)\n", "p = input()\r\ni = input()\r\nc = 0\r\nfor ii in i:\r\n if ii == p[c]:\r\n c += 1\r\nprint(c + 1)", "s = input()\r\nt = input()\r\nans = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[ans]:\r\n ans +=1\r\n \r\nprint(ans+1)", "s = input()\r\nr = input()\r\n\r\npos = 0\r\nx=len(r)\r\n\r\nfor i in range (x) :\r\n if r[i] == s[pos]:\r\n pos+=1\r\n\r\n\r\nprint (pos + 1)", "s = input()\r\nw = input()\r\ni1 = 0\r\ni2 = 0\r\nn = 0\r\nwhile i1 != len(s) and i2 != len(w):\r\n if s[i1]==w[i2]:\r\n n += 1\r\n i1 += 1\r\n i2 += 1\r\nprint(n+1)", "def main():\r\n #dice = list(map(int, input().split(' ')))\r\n stone = input()\r\n instructions = input()\r\n jump = 0\r\n count = 1\r\n for i in range(len(instructions)):\r\n if instructions[i] == stone[jump]:\r\n count+=1\r\n jump+=1\r\n if jump == len(stone):\r\n break\r\n print(count)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "stone = input()\r\ninstr = input()\r\nviTri = 1\r\nfor i in range(0, len(instr)):\r\n if instr[i] == stone[0]:\r\n viTri += 1\r\n stone = stone[1::]\r\n else:\r\n continue\r\nprint(viTri)\r\n", "color=input()\r\ninst=input()\r\nx=0\r\npos=1\r\nfor i in range(len(inst)):\r\n if color[x]==inst[i]:\r\n pos+=1\r\n x+=1\r\nprint(pos)", "s = input()\nt = input()\np = 0\nfor i in t:\n if s[p] == i:\n p += 1\nprint(p + 1)\n", "s=input()\r\nc=0\r\nt=input()\r\ni=0\r\nj=0\r\nwhile i<len(s) and j<len(t):\r\n if s[i]==t[j]:\r\n i+=1\r\n c+=1\r\n j+=1\r\nprint(c+1)\r\n", "s = list(input())\r\nt = list(input())\r\npos = 1\r\n\r\nfor i in range(len(t)):\r\n\tif s[pos-1] == t[i]:\r\n\t\tpos += 1\r\n\t\r\nprint(pos)\r\n\t\t", "s=input()\r\nd=input()\r\n\r\na=0\r\n\r\nfor i in range(len(d)):\r\n if(d[i]==s[a]):\r\n a+=1\r\nprint(a+1)\r\n", "s = input()\r\nt = input()\r\nspos = 0\r\nfor i in range(0, len(t)):\r\n if t[i]== s[spos]:\r\n spos+=1\r\n \r\nprint(spos+1)", "def main():\r\n s = input()\r\n t = input()\r\n pos = 0\r\n for ti in t:\r\n if s[pos] == ti:\r\n pos += 1\r\n print(pos + 1)\r\n\r\n\r\nmain()\r\n", "s = input()\nt = input()\n\nn = 0\nfor i in range(len(t)):\n if t[i] == s[n]:\n n+=1\n\nprint(n+1)\n", "s = list(input())\nt = list(input())\n\nstone = 0\n\nfor c in t:\n if s[stone] == c:\n stone += 1\n \nprint(stone + 1)", "x = input()\r\ny = input()\r\nz = 0\r\nfor i in range(len(y)):\r\n if y[i] == x[z]:\r\n z = z + 1 \r\nprint(z+1)", "s = input()#字符串\r\nt = input()#指令\r\nlocation = 1\r\nfor x in t:\r\n if x == s[location-1]:\r\n location += 1\r\nprint(location)", "s = input()\r\nr = input()\r\ncount = 1\r\nindex = 0\r\nfor i in r:\r\n if i == s[index]:\r\n count += 1\r\n index += 1\r\nprint(count)", "n,m = input(),input()\r\ni = 0\r\nfor j in m:i+=1 if (n[i] == j) else 0\r\nprint(i+1)", "n=input()\r\ns=input()\r\na=0\r\nfor i in range(len(s)) :\r\n if s[i]==n[a] : a+=1\r\nprint(a+1)\r\n\r\n", "seq=input()\r\ninst=input()\r\ni,j=0,0\r\nwhile True:\r\n if j==len(inst):\r\n break\r\n check=inst[j]\r\n current=seq[i]\r\n if check==current:\r\n i+=1\r\n j+=1\r\nprint(i+1)\r\n \r\n", "str1=input()\r\nstr2=input()\r\ncounter=0\r\nj=0\r\nfor i in range(len(str2)):\r\n if str1[j]==str2[i]:\r\n j+=1\r\nprint(j+1)", "s=input()\r\nt=input()\r\n\r\nc=0\r\nfor i in t:\r\n if s[c]==i:\r\n c+=1\r\nprint(c+1)", "s = input()\nt = input()\ni=0 \nj=0 \n\nwhile (i<len(s) and j<len(t)):\n if s[i]==t[j]:\n i+=1\n j+=1\n else:\n j+=1 \nprint(i+1)\n ", "a = input()\r\nb = input()\r\na1 = 0\r\nb1 = 0\r\nwhile b1 <= len(b)-1:\r\n if a[a1] == b[b1] and not a1 == len(a)-1:\r\n a1 +=1\r\n elif a[a1]== b[b1] and a1 == len(a)-1 :\r\n a1 =0\r\n b1 +=1\r\nprint(a1 +1)\r\n", "s = input()\nt = input()\ni = 0\nn = 0\nwhile n < len(t) and i < len(s):\n if t[n] == s[i]:\n n += 1\n i += 1\n else:\n n += 1\nprint(i+1)", "a=input()\r\nx=input()\r\ns=1\r\nfor i in a:\r\n if i in x:\r\n x=x[x.index(i)+1:]\r\n s+=1\r\n else: break\r\nprint(s)", "stones = input()\ninstructions = input()\n\ni, j = 0, 0\nwhile i < len(stones) and j < len(instructions):\n\tif instructions[j] == stones[i]:\n\t\ti+= 1\n\tj+= 1\nprint(i + 1)\t", "a = input()\r\nb = input()\r\nx = 1\r\ni = 0\r\nfor j in range(len(b)):\r\n if a[i] == b[j]:\r\n x += 1\r\n i += 1\r\nprint(x)", "s = input()\r\nq = input()\r\nc = 0\r\nfor i in range(len(q)):\r\n if q[i] == s[c]:\r\n c += 1\r\nprint(c+1)", "S = input()\r\nT = input()\r\n\r\nliss_pos = 1\r\nfor i in range(len(T)):\r\n if T[i] == S[liss_pos-1]:\r\n liss_pos += 1\r\n\r\nprint(liss_pos)", "s = list(input())\r\nt = list(input())\r\n\r\ncount = 1\r\npos = 0\r\n\r\nfor i in t:\r\n if i == s[pos]:\r\n pos += 1\r\n count += 1\r\n\r\nprint(count)", "n = input()\r\nm = input()\r\nl = len(m)\r\n\r\na = 0\r\nfor i in range(l):\r\n\tif m[i] == n[a]:\r\n\t\ta += 1\r\nprint(a+1)", "path = list(map(str,input().split())) \r\ninstruction = list(map(str,input().split()))\r\ncount = 1\r\ni = 0 \r\nj = 0 \r\nwhile i <len(instruction[0]) : \r\n if instruction[0][i] == path[0][j] : \r\n j += 1 \r\n count +=1 \r\n i += 1\r\nprint(count)", "a=input()\r\nb=input()\r\ns=0\r\nfor i in range(len(b)):\r\n if a[s]==b[i]:\r\n s+=1\r\nprint(s+1)", "s,t=input(),input();index=0\r\nfor i in t:\r\n if s[index]==i:index+=1\r\nprint(index+1)", "#!/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:33:05 2021\r\n# problem name: Colorful_Stones_Simplified_Edition\r\n# contest: 265-Codeforces Round #162 (Div. 2)\r\n# problem difficulty: A-D2\r\n# problem url: https://codeforces.com/contest/265/problem/A\r\n# ------------------------------------------------------------------------------\r\n\r\nfrom typing import *\r\n\r\n\r\nclass Problem(object):\r\n\r\n def __init__(self, name: str) -> None:\r\n self.name = name\r\n\r\n def solution(self) -> Union[str, int, float]:\r\n stones: str = input().strip()\r\n move_commands: str = input().strip()\r\n position: int = 0\r\n\r\n for move in move_commands:\r\n if move == stones[position]:\r\n position += 1\r\n\r\n return position + 1\r\n\r\nproblem = Problem(\"Colorful_Stones_Simplified_Edition\")\r\n\r\nif __name__ == \"__main__\":\r\n solution: Union[str, int, float] = problem.solution()\r\n print(solution)\r\n\r\n", "s = input()\nt = input()\na = 1\nb = 0\nfor i in range(len(t)):\n if t[i]==s[b]:\n a += 1\n b += 1\n if b == len(s)-1:\n break\n \nprint(a) ", "t = input()\r\nc = input()\r\nj = 0\r\np = 1\r\nfor i in c:\r\n if i == t[j]:\r\n j += 1\r\nprint(j+1)", "a=input()\r\nb=input()\r\ni=0\r\nfor j in b:\r\n if(a[i]==j):\r\n i=i+1\r\nprint(i+1)", "s=input()\r\nt=input()\r\nj=0\r\nfor i in t:\r\n if i==s[j]:\r\n j+=1 \r\nprint(j+1)", "s = input()\r\nt = input()\r\np = 0 # position\r\n\r\nfor c in t:\r\n if s[p] == c:\r\n p += 1\r\n\r\n\r\nif p + 1 > len(s):\r\n print(len(s))\r\nelse:\r\n print(p + 1)\r\n", "s = input()\r\nt = input()\r\ncurrent = 1\r\nfor instruction in t:\r\n if instruction == s[current-1]:\r\n current += 1\r\nprint(current)", "s = input()\r\nn = input()\r\n\r\nc =0\r\nfor i in range(len(n)):\r\n if n[i] == s[c]:\r\n c +=1\r\n\r\nprint(c + 1)", "l=list(input())\r\nres = list(input())\r\n\r\n\r\nsum=1\r\na=[]\r\ni=0\r\nfor j in range(len(res)):\r\n if(l[i]==res[j]):\r\n sum+=1\r\n i+=1\r\nprint(sum)\r\n#l=list(map(int, input().split()))\r\n#l.sort()\r\n#print(min(sum_n1_1,sum_n1_0)+min(sum_n2_1,sum_n2_0))'''", "s=input()\r\nt=input()\r\nk=0\r\nl=0\r\nwhile k<len(s) and l<len(t):\r\n for i in range(l,len(t)):\r\n if s[k]==t[i]:\r\n k+=1\r\n l+=1\r\n break\r\n else:\r\n l+=1\r\nprint(k+1)", "s=input()\r\nt=input()\r\ncount=1\r\ni=0\r\nj=0\r\nwhile i<len(s) and j<len(t):\r\n if s[i]==t[j]:\r\n count+=1\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(count) \r\n", "import sys\r\n\r\nlst1, lst2 = [], []\r\npos = 0\r\nstring = sys.stdin.readline().strip()\r\ninstructions = sys.stdin.readline().strip()\r\n\r\nfor instruction in instructions:\r\n lst2.append(instruction)\r\nfor color in string:\r\n lst1.append(color)\r\n\r\nfor i in range(len(lst2)):\r\n if lst2[i] == lst1[pos]:\r\n pos += 1\r\nprint(pos + 1)\r\n", "s=input()\r\nt=input()\r\ni=0\r\nc=0\r\nj=0\r\nwhile True:\r\n if(t[i]==s[j]):\r\n c=c+1\r\n j=j+1\r\n i=i+1\r\n if(i==len(t)):\r\n break\r\nprint(c+1)\r\n \r\n ", "colors = input()\r\npattern = input()\r\ncounter = 1\r\ncurrent = colors[0]\r\nfor i in range(len(pattern)):\r\n if pattern[i] == current:\r\n current = colors[counter]\r\n counter += 1\r\nprint(counter)", "stones= input()\r\ninstructions= input()\r\ni=0\r\nfor inst in instructions:\r\n if inst==stones[i]:\r\n i+=1\r\nprint(i+1)", "a = input()\r\nb = input()\r\nind = 0\r\nfor i in b:\r\n if i == a[ind]:\r\n ind += 1\r\nprint(ind+1)", "inp1 = input()\ninp2 = input()\n\nposs = 0\nfor i in inp2:\n if i == inp1[poss]: poss+=1\n\nprint(poss+1)", "s=input()\r\nt=input()\r\na=0\r\nfor i in t:\r\n\r\n if i==s[a]:\r\n\r\n a+=1\r\na+=1\r\nprint(a)\r\n", "l1=input()\r\nl2=input()\r\npos=0\r\nfor i in range(len(l2)):\r\n if l2[i]==l1[pos]:\r\n pos+=1\r\nprint(pos+1)", "s1 = input()\r\ns2 = input()\r\nk = 0\r\nfor i in s2:\r\n if i == s1[k]:\r\n k += 1\r\nprint(k + 1)", "s = input()\r\nt = input()\r\nval = 1\r\ni,j = 0,0\r\nwhile(i<len(t) and j<len(s)):\r\n if t[i]==s[j]:\r\n i+=1\r\n j+=1\r\n val+=1\r\n else:\r\n i+=1\r\nprint(val)", "s = input()\r\nt = input()\r\npos = 0\r\nfor i in t:\r\n if i == s [pos]:\r\n pos +=1\r\nprint(pos+1)", "n = list(input())\r\nc = list(input())\r\ncount = 1\r\nfor i in c :\r\n if i == n[count-1]:\r\n count += 1\r\nprint(count)", "\ns = input()\ng = input()\n\npos = 0\ncur = 0\nwhile cur < len(s) and pos < len(g):\n if s[cur]==g[pos]:\n pos += 1\n cur += 1\n else:\n pos += 1\nprint(cur+1)\n", "s1=input()\r\ns2=input()\r\nj=0\r\nfor i in range(len(s2)):\r\n if s2[i] == s1[j]:\r\n j=j+1\r\nprint(j+1)", "s = input()\r\nt = input()\r\ni = 0\r\nfor c in t:\r\n if(c == s[i]):\r\n i+=1\r\n if(i==len(s) -1):\r\n break\r\nprint(i+1)", "s = input()\r\nseq = input()\r\ncur = 0\r\n\r\nfor i in seq:\r\n while s[cur] == i:\r\n cur += 1\r\n break\r\n\r\nprint(cur + 1)\r\n", "#s represents the color of the i-th stone\r\ns = input()\r\n#t represents the color of the stone in the instructions\r\nt = input()\r\n#start with position 1\r\nposition = 1\r\nfor i in range(len(t)):\r\n if t[i] == s[position-1]:\r\n position += 1\r\n\r\nprint(position)", "s = input()\r\nt = input()\r\nc =0\r\nfor i in range(len(t)):\r\n if t[i]==s[c]:\r\n c+=1\r\nprint(c+1)", "a=input()\r\nb = input()\r\nn = 0\r\nfor i in range (len(b)):\r\n if b[i] == a[n]:\r\n n+=1\r\nprint(n+1)", "a=list(input())\r\nb=list(input())\r\nn=len(b)\r\nans=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if a[i]==b[j]:\r\n i+=1\r\n ans+=1\r\n else:\r\n break\r\n\r\nprint(ans+1)", "s=input()\r\nt=input()\r\nu=0\r\nr=1\r\nfor i in range(len(t)):\r\n if(t[i]==s[u]):\r\n u=u+1\r\n r=r+1\r\nprint(r)", "s = input()\r\nt = input()\r\npos = 1\r\nfor i in t:\r\n if i == s[pos - 1]:\r\n pos += 1\r\nprint(pos)", "s = input()\r\nt = input()\r\n\r\nposition = 0\r\n\r\nfor i in range(len(t)):\r\n if t[i] == s[position]:\r\n position += 1\r\n\r\nprint(position+1)", "s=input()\r\ns2 = input()\r\nans = 0\r\nfor i in range(len(s2)):\r\n if s[ans] == s2[i]:\r\n ans += 1\r\n if ans == len(s):break\r\nprint(ans+1)", "s1=input()\r\ns2=input()\r\nj=0\r\nc=0\r\nfor i in range(len(s2)):\r\n if(j<len(s1)-1):\r\n if(s2[i]==s1[j]):\r\n c+=1\r\n j+=1\r\n else:\r\n break\r\nprint(j+1)", "s = input()\r\nc = input()\r\npos = 1\r\n\r\nfor i in c:\r\n if i == s[pos-1]:\r\n pos+=1\r\n\r\nprint(pos)", "s1=input()\r\ns2=input()\r\na=0\r\nc=1\r\nfor i in s2:\r\n if i ==s1[a]:\r\n a+=1\r\n c+=1\r\nprint(c)", "#k = int(input())\r\n\r\n#k, r = map(int, input().split())\r\n\r\n#lst = list(map(int, input().split()))\r\nstr = (input())\r\nstr2 = input()\r\nindex = 0\r\n\r\nfor i in range(len(str2)):\r\n\r\n if str[index] == str2[i]:\r\n index += 1\r\n\r\nprint(index + 1)\r\n", "stones = list(input())\r\ninst = list(input())\r\nmoves = 0\r\n\r\nfor i in range(len(inst)):\r\n if stones[moves] == inst[i]:\r\n moves += 1\r\n else:\r\n moves = moves\r\n\r\nprint(moves + 1)", "s=list(input())\r\nt=list(input())\r\nc=0\r\nfor i in range(0, len(t)):\r\n if s[c]==t[i]:\r\n c+=1\r\n else:\r\n continue\r\nprint(c+1)", "# https://codeforces.com/contest/265/problem/A\r\ninput1 = input()\r\ninput2 = input()\r\ncounter = 0\r\nfor i in range(len(input2)):\r\n if input1[counter] == input2[i]:\r\n counter+=1\r\nprint(counter+1)", "a = input()\nc = input()\npos = 0\nfor cmd in c:\n if cmd==a[pos]: pos+=1\nprint(pos+1)", "s=input()\r\nt=input()\r\nc=0\r\nfor i in t:\r\n if i==s[c]:\r\n c+=1\r\n else:\r\n continue\r\nprint(c+1)", "mapStones = list(input())\r\nindexFox = 0\r\ncommandGo = list(input())\r\nfor command in commandGo:\r\n if mapStones[indexFox] == command:\r\n indexFox += 1\r\nprint(indexFox+1)", "\r\nt = input()\r\ns = input()\r\np = 0\r\nfor x in s:\r\n\tif x == t[p]:\r\n\t\tp+=1\r\nprint(p+1)", "s1=list(str(input()))\r\ns2=list(str(input()))\r\nl=len(s2)\r\ns=0\r\nr=1\r\nfor a in range(l):\r\n if s1[s]==s2[a]:\r\n s+=1\r\nprint(s+1)\r\n", "S = input()\r\nT = input()\r\n\r\nlast_pos = 0\r\nfor i in range(len(T)):\r\n if(T[i] == S[last_pos]):\r\n last_pos += 1\r\n\r\nprint(last_pos+1)", "s=input()\r\nt=input()\r\ni=0\r\nn=len(t)\r\nfor j in range(n):\r\n\tif t[j]==s[i]:\r\n\t\ti+=1\r\n\r\nprint(i+1)", "s1 = input()\r\ns2 = input()\r\n\r\ncounter=1\r\nj=0\r\nfor i in s2:\r\n if i==s1[j]:\r\n counter+=1\r\n\r\n j+=1\r\n\r\n\r\nprint(counter)", "t = input()\r\ns = input()\r\nc = 0\r\nfor i in s:\r\n if i==t[c]:\r\n c+=1\r\nprint(c+1)", "stones,instructions = input().strip(),input().strip()\r\npos =1\r\nfor i in range(len(instructions)):\r\n if stones[pos-1] == instructions[i]:\r\n pos+=1\r\nprint(pos)", "s = input()\r\nt = input()\r\nlen_t = len(t)\r\ni = 0\r\nfor j in range(len_t):\r\n if t[j] == s[i]:\r\n i += 1\r\nprint(i+1)\r\n ", "s = input()\r\nt = input()\r\nx = 0\r\nfor i in t:\r\n if i == s[x]:\r\n x+=1\r\nprint(x+1)", "a = input()\r\nb = input()\r\ni = 0\r\nj = 0\r\nwhile(j<len(b)):\r\n\tif(b[j]==a[i]):\r\n\t\ti+=1\r\n\tj+=1\r\nprint(i+1)", "class Solution():\n \n def final_position_of_liss():\n sequence = input()\n instructions = input()\n index_of_the_sequence = 0\n for index in range(len(instructions)):\n if instructions[index] == sequence[index_of_the_sequence]:\n index_of_the_sequence += 1\n \n return f\"{index_of_the_sequence + 1}\"\n\n\nif __name__ == '__main__':\n print(Solution.final_position_of_liss())", "s=input()\r\nt=input()\r\nj=0\r\nfor i in range (0,len(t)):\r\n\t\tif s[j]==t[i] :\r\n\t\t\tj=j+1\r\n\r\nprint(j+1)", "s = input()\r\nt = input()\r\n\r\nres = 1\r\ni = 0\r\n\r\nfor c in t:\r\n if c == s[i]:\r\n res += 1\r\n i += 1\r\n\r\n\r\nprint(res)\r\n\r\n\r\n\r\n\r\n", "s=input()\r\nt=input()\r\nflag=0\r\nfor i in t:\r\n if i==s[flag]:\r\n flag+=1\r\nprint(flag+1)", "s = input()\r\nt = input()\r\nsindex = tindex = 0\r\nwhile tindex < len(t):\r\n if s[sindex] == t[tindex]:\r\n sindex += 1\r\n tindex += 1\r\n continue\r\n else:\r\n tindex += 1\r\nprint(sindex+1)", "a = input()\r\ne = input()\r\nr = 0\r\nt = 0\r\n\r\nfor i in e:\r\n if a[r]==e[t]:\r\n r+=1\r\n t+=1\r\nprint(r+1)\r\n", "s=input()\r\nt=input()\r\nc=0\r\nj=0\r\nfor i in range(len(t)):\r\n #print(t[i],s[j])\r\n if t[i]==s[j]:\r\n c+=1\r\n j+=1\r\n \r\nprint(c+1)", "stones = input()\ninstructions = input()\ni = 0\nfor c in instructions:\n if c==stones[i]:\n i += 1\n if i==len(stones):\n break\nprint(i+1)\n\n", "\ndef verif(ch):\n ok=True\n i=0\n while ok and i<len(ch):\n ok=((ch[i]=='R') or (ch[i]=='G') or (ch[i]=='B'))\n i+=1\n return(ok)\n\n\ndef saisir():\n while True:\n s=input()\n if verif(s) and len(s)!=0:\n break\n while True:\n t=input()\n if verif(t) and len(t)!=0:\n break\n return s,t\n\ndef afficher(s,t):\n pos=0\n for i in range(len(t)):\n if s[pos]==t[i]:\n pos+=1\n print(pos+1)\n \n\n\n\n\n\n\n\n\n\n\n#pp\nif __name__=='__main__':\n s,t=saisir()\n afficher(s,t)\n", "a = list(input())\r\nb = list(input())\r\ncou = 0\r\nfor i in range(0, len(b)):\r\n if a[cou] == b[i]:\r\n cou += 1\r\n else:\r\n continue\r\nprint(cou + 1)", "s=input().strip()\r\nt=input().strip()\r\nins=0\r\npos=0\r\nwhile ins<len(t):\r\n\tif t[ins]==s[pos]:\r\n\t\tpos+=1\r\n\tins+=1\r\nprint(pos+1)", "liz=input()\r\nope=input()\r\nl=len(liz)\r\nj=0\r\npos=1\r\nfor i in ope:\r\n #print(pos,i)\r\n if i==liz[j]:\r\n pos+=1 \r\n j+=1 \r\n \r\n if j>=l:\r\n break\r\nprint(pos)", "s1 = input()\r\ns2 = input()\r\nj = 0\r\nres = 1\r\nfor i in s2:\r\n if i==s1[j]:\r\n j+=1\r\n res+=1\r\nprint(res)\r\n", "s=input()\r\nt= input()\r\ncounter=0\r\nfor i in range(0,len(t)):\r\n if(s[counter]==t[i]):\r\n counter = counter + 1\r\nprint(counter+1)\r\n ", "\"\"\"\r\nThere is a sequence of colorful stones. The color of each stone is one of red, green, or blue. You are given a string s. The i-th (1-based) character of s represents the color of the i-th stone. If the character is \"R\", \"G\", or \"B\", the color of the corresponding stone is red, green, or blue, respectively.\r\n\r\nInitially Squirrel Liss is standing on the first stone. You perform instructions one or more times.\r\n\r\nEach instruction is one of the three types: \"RED\", \"GREEN\", or \"BLUE\". After an instruction c, if Liss is standing on a stone whose colors is c, Liss will move one stone forward, else she will not move.\r\n\r\nYou are given a string t. The number of instructions is equal to the length of t, and the i-th character of t represents the i-th instruction.\r\n\r\nCalculate the final position of Liss (the number of the stone she is going to stand on in the end) after performing all the instructions, and print its 1-based position. It is guaranteed that Liss don't move out of the sequence.\r\n\r\nInput\r\nThe input contains two lines. The first line contains the string s (1 ≤ |s| ≤ 50). The second line contains the string t (1 ≤ |t| ≤ 50). The characters of each string will be one of \"R\", \"G\", or \"B\". It is guaranteed that Liss don't move out of the sequence.\r\n\r\nOutput\r\nPrint the final 1-based position of Liss in a single line.\r\n\"\"\"\r\n\r\nstones = input()\r\ninstructions = input()\r\nposition = 1\r\n\r\nfor i in instructions:\r\n if i == stones[position - 1]:\r\n position += 1\r\n\r\nprint(position)\r\n", "s = input()\r\nt = input()\r\np = 0\r\nfor i in range(len(t)):\r\n if s[p] == t[i]:\r\n p += 1\r\nprint(p + 1)", "import collections\r\nimport math\r\nfrom math import *\r\nfrom collections import *\r\nfrom itertools import permutations\r\nmod = 1000000007\r\ndef calc(n):\r\n if n%2==0:\r\n return 2\r\n for i in range(3,int(sqrt(n))+1,2):\r\n if n%i==0:\r\n return i\r\n return n\r\ndef main():\r\n # test = int(input())\r\n # for _ in range(test):\r\n # n = int(input())\r\n # a = list(map(int, input().split()))\r\n a = input()\r\n b = input()\r\n pos1=0\r\n pos2=0\r\n while pos2 < len(b):\r\n if b[pos2] == a[pos1]:\r\n pos1 += 1\r\n pos2+=1\r\n print(pos1+1)\r\nif __name__ == \"__main__\":\r\n main()", "position = input()\r\ninstruction = input()\r\ninst_len = len(instruction)\r\ntemp = 0\r\nfor i in range(inst_len):\r\n if (instruction[i] == position[temp]):\r\n temp = temp + 1;\r\nprint(temp+1)", "str0 = input()\r\nstr1 = input()\r\ncounter = 0\r\nfor i in str1:\r\n if i == str0[counter]:\r\n counter += 1\r\nprint(counter + 1)", "s = input().strip() # stones\nt = input().strip() # instructions\ni = 0\nj = 0\nwhile j < len(t):\n\tif t[j] == s[i]:\n\t\ti += 1\n\tj += 1\nprint(i + 1)\n", "s = input()\r\nt = input()\r\ni = 1\r\nfor j in range(len(t)):\r\n if t[j] == s[i-1]:\r\n i+=1\r\n\r\nprint(i)\r\n", "s=input()\r\nt=input()\r\nx=0\r\nfor i in range(len(t)):\r\n if t[i]==s[x]:\r\n x+=1\r\n else:\r\n continue\r\nprint(x+1)", "s = input()\r\nt = input()\r\nidx = 0\r\nfor inst in t:\r\n if s[idx] == inst:\r\n idx+=1\r\nprint(idx+1)\r\n ", "from sys import stdin\r\n\r\ndef get_data(instructions,stones):\r\n cont = 0\r\n for i in stones:\r\n if instructions[cont] == i:\r\n cont += 1\r\n return cont + 1\r\n\r\ndef main():\r\n instructions = stdin.readline()\r\n stones = stdin.readline()\r\n print(get_data(instructions,stones))\r\n\r\nmain()", "def solve():\r\n\tcs = input()\r\n\tts = input()\r\n\tp = 0\r\n\tfor e in ts :\r\n\t\tif e == cs[p]:\r\n\t\t\tp+=1\r\n\tprint(p+1)\r\n\t\r\n\t\r\n\treturn None\r\n\r\n\r\n\r\nsolve()", "sequence =input()\r\nmoveLiss=input()\r\nmoves=1\r\nfor i in range(len(moveLiss)):\r\n if sequence[moves-1] == moveLiss[i]:\r\n moves+=1\r\n\r\nprint (moves)\r\n\r\n\r\n\r\n", "s1 = input()\r\ns2 = input()\r\nplace = 0\r\nfor i in s2:\r\n if i == s1[place]: place += 1\r\nprint(place + 1)", "s = input()\r\nt = input()\r\npos = 0\r\nfor x in t:\r\n if x == s[pos]:\r\n pos += 1\r\nprint(pos + 1)\r\n", "stones, instructions = input(), input()\r\ninstruction_reader_index, stone_position = -1, 1\r\nfor stone_color in stones:\r\n try:\r\n while not instructions[(instruction_reader_index := instruction_reader_index + 1)] == stone_color:\r\n pass\r\n except IndexError:\r\n print(stone_position)\r\n exit()\r\n stone_position += 1", "s=input()\r\nr=input()\r\nj=0\r\ncnt=0\r\nfor i in range(len(r)):\r\n if s[j]==r[i]:\r\n cnt += 1\r\n j += 1\r\nprint(cnt+1)", "x = input()\r\ny = input()\r\nz = len(y)\r\npos = 0\r\nfor i in range(z):\r\n if y[i] == x[pos]:\r\n pos += 1\r\nprint(pos+1)", "t = input()\r\nc = input()\r\np = 0\r\n\r\nfor i in c:\r\n if i == t[p]:\r\n p += 1\r\nprint(p+1)", "s = input()\r\np = input()\r\n\r\nc = 0\r\nfor i in range(len(p)):\r\n if p[i] == s[c]:\r\n c+=1\r\nprint(c+1)", "a = list((i) for i in input())\r\nb = list((y) for y in input())\r\nx = 1\r\ny = 0\r\nfor i in range (len(a)):\r\n \r\n if y<=len(b)-1:\r\n \r\n while a[i] != b[y]: \r\n y+=1\r\n \r\n if y>len(b)-1: \r\n break\r\n \r\n if y <= len(b)-1 and i < len(a)-1:\r\n \r\n if a[i] == b[y]:\r\n y+=1\r\n x+=1\r\nprint(x) ", "a=input()\r\nb=input()\r\nc=0\r\nfor i in b:\r\n if i==a[c]:\r\n c+=1\r\nprint(c+1)\r\n", "s=input()\r\nt=input()\r\nv=len(t)\r\nx=0\r\nfor i in range(v):\r\n if s[x]==t[i]:\r\n x+=1\r\nprint(x+1) ", "from sys import stdin, setrecursionlimit\r\n\r\n\r\ndef solve():\r\n s1 = stdin.readline().rstrip('\\r\\n')\r\n s2 = stdin.readline().rstrip('\\r\\n')\r\n ans = 0\r\n for i in range(len(s2)):\r\n if s1[ans] == s2[i]:\r\n ans += 1\r\n print(ans+1)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "s=input()\r\nt=input()\r\npos=0\r\nfor i in range(len(t)):\r\n if t[i]==s[pos]:\r\n pos +=1\r\nprint(pos+1)", "s = input()\nt = input()\n\nj = 0\nfor i in t:\n # print(s[j], i)\n if s[j] == i:\n j += 1\n\nprint(j+1)\n", "l = list(input())\nins = list(input())\ni = 1\nwhile(ins):\n if l[0] == ins[0]:\n i = i + 1\n l.pop(0)\n ins.pop(0)\n else:\n ins.pop(0)\n\n\nprint(i)", "stone_color = input()\r\ninstruction = input()\r\npos = 0\r\nfor c in instruction:\r\n if c == stone_color[pos]:\r\n pos += 1\r\nprint(pos+1)", "s = input()\r\nt = input()\r\n\r\nc = 0\r\n\r\nfor i in range(0,len(t)):\r\n if s[c] == t[i]:\r\n c+=1\r\nprint(c+1)", "s=input()\r\nt=input()\r\ncount=1\r\nfor i in range(len(t)):\r\n if s[count-1]==t[i]:\r\n count+=1\r\nprint(count)", "o=input()\r\ni=input()\r\nl=0\r\nfor p in range(len(i)):\r\n if i[p]==o[l]:\r\n l+=1\r\nprint(l+1)\r\n", "# coding: utf-8\r\n\r\ns = input()\r\nt = input()\r\nj = 0\r\n\r\nfor i in range(len(t)):\r\n if s[j] == t[i]:\r\n j += 1\r\n \r\nprint(j + 1)", "n= str(input())\r\nt= str(input())\r\npos = 0\r\nfor i in range(len(t)):\r\n if t[i] == n[pos]:\r\n pos=pos+1\r\n \r\nprint(pos+1)", "s=input()\r\nt=input()\r\np=0\r\nfor i in range(len(t)):\r\n if t[i]==s[p]:\r\n p=p+1\r\nprint(p+1)\r\n", "stones = [x for x in str(input())] \r\nmoves = [x for x in str(input())] \r\nposition = 0\r\n\r\nfor item in moves:\r\n if stones[position] == item:\r\n position += 1\r\n \r\nprint (position + 1)", "l1=list(input())\r\nl2=list(input())\r\ncount=0\r\n\r\nk=0\r\n\r\nfor i in range(len(l2)):\r\n if l1[k]==l2[i]:\r\n k+=1\r\n count+=1\r\nprint(count+1)", "if __name__ == '__main__':\n stones = input()\n instructions = input()\n\n j = 0\n color = 0\n length = len(instructions)\n\n while j < length:\n if instructions[j] == stones[color]:\n color += 1\n j += 1\n print(f\"{color+1}\")\n", "x=input()\r\ny=input()\r\nn=len(y)\r\nj=0\r\nfor i in range(n):\r\n if(x[j]==y[i]):\r\n j+=1\r\nprint(j+1)", "S=input(\"\")\r\nT=input(\"\")\r\nj=0\r\ncount =1\r\nfor i in range (len(T)):\r\n if(S[j]==T[i]):\r\n count +=1\r\n j+=1\r\nprint(count)", "s = input()\r\nt = input()\r\nn = len(s)\r\nl = len(t)\r\nstep = 0\r\ni = 0\r\nj = 0\r\nwhile i < n and j < l:\r\n if s[i] == t[j]:\r\n step += 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\n\r\nprint(step+1)", "import sys\ninput = sys.stdin.readline\n\nS = list(input().rstrip())\nT = list(input().rstrip())\n\ncp = 0\nwhile T :\n\tif S[cp] == T.pop(0) : cp += 1\n\nprint(cp+1)", "s = input()\r\nt = input()\r\ni=0\r\nfor x in t:\r\n if s[i] ==x:\r\n i+=1\r\nprint(i+1)", "# http://codeforces.com/contest/265/problem/A\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nres = 1\r\nfor i in range(len(s2)):\r\n if s2[i] == s1[res - 1]:\r\n res += 1\r\n \r\nprint(res)", "s = input()\r\nt =input()\r\nc = 1\r\nj = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[j]:\r\n c += 1\r\n j += 1\r\nprint(c)\r\n", "s = list(input())\r\nt = list(input())\r\n\r\nl=1\r\nfor i in t:\r\n l += 1 if i == s[l-1] else 0\r\n\r\nprint (l)", "s = list(input())\r\nt = list(input())\r\nc = 1\r\nfor i in t:\r\n\tif i == s[c - 1]:\r\n\t\tc += 1\r\n\r\nprint(c)", "def solution(s1, s2):\r\n i = 0\r\n j = 0\r\n while j < len(s2):\r\n if s2[j] == s1[i]:\r\n i = i + 1\r\n j = j + 1\r\n return i + 1\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\nprint(solution(s1, s2))", "\n\na = [x for x in input()]\n\nb = [x for x in input()]\n\n\nans = 0\nfor i in b:\n if a[ans] == i :\n ans +=1\n\nprint(ans+1)\n\n\n\n\n\n\n\n\n\n", "s=input()\r\nt=input()\r\nres=0\r\nfor i in range (len(t)):\r\n if t[i] == s[res]:\r\n res+=1\r\nprint(res+1)", "s = input()\r\nt = input()\r\npos = 1\r\n\r\nfor inst in t:\r\n if inst == s[pos - 1]:\r\n pos += 1\r\n\r\nprint(pos)\r\n", "s = input()\r\nt = input()\r\nst = 0\r\nstart = s[st]\r\nfor elem in t:\r\n if start == elem:\r\n st += 1\r\n start = s[st]\r\nprint(st+1)", "string, instruction = input(), input()\r\n\r\ncurrent_position = 0\r\nfor i in range(len(instruction)):\r\n if string[current_position] == instruction[i]:\r\n current_position += 1\r\nprint(current_position + 1)", "s=input()\r\nt=input()\r\nc=1\r\nfor ch in t:\r\n if ch==s[c-1]:\r\n c+=1\r\nprint(c) ", "a=input()\r\nb=input()\r\npos=0\r\nt=len(b)\r\ns=len(a)\r\nfor i in range(t):\r\n\tif(pos<s and b[i]==a[pos]):\r\n\t\tpos+=1 \r\n\r\nprint(pos+1)\r\n\t\t", "s=input()\r\nt=input()\r\nk=0\r\n\r\nfor i in t:\r\n if i==s[k]:\r\n k+=1\r\nprint(k+1)\r\n ", "n = str(input())\r\nx = str(input())\r\ns = 1\r\ni = 0\r\nj = 0\r\nwhile i != len(x) and j != len(x):\r\n if n[i] == x[j]:\r\n s += 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\nprint(s)\r\n", "s = str(input())\nm = str(input())\nindex = 0\nfor i in m:\n if i == s[index]:\n index += 1\n\nprint(index + 1)\n", "s = input()\r\nt = input()\r\n\r\nj = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[j]:\r\n if j < len(s) :\r\n j+=1\r\n else :\r\n break\r\n\r\nprint(j+1)", "import sys\r\nsys.setrecursionlimit(100000000)\r\ninput=lambda:sys.stdin.readline().strip()\r\nwrite=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\n# from random import randint\r\n# from copy import deepcopy\r\n# from collections import deque\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\n# from math import inf,sqrt,gcd,ceil,floor,log,log2,log10,pi\r\n# from functools import cmp_to_key\r\n\r\n\r\ns=input()\r\nt=input()\r\nj=0\r\nfor i in range(len(t)):\r\n if t[i]==s[j]:\r\n j+=1\r\nprint(j+1)", "stones = input()\r\ninstructions = input()\r\nmoves=0\r\n\r\nfor i in range(len(instructions)):\r\n if stones[moves] == instructions[i]:\r\n moves+=1\r\n\r\nprint(moves+1)", "s = input()\r\nt = input()\r\nans = 0\r\ni = 0\r\nj = 0\r\nwhile i <= len(s)-1 and j <= len(t)-1:\r\n if (s[i] == t[j]):\r\n ans += 1\r\n i += 1\r\n j += 1\r\nprint(ans+1)", "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 s = input()\r\n t = input()\r\n\r\n standing, i = 0, 0\r\n while i < len(t):\r\n if s[standing] == t[i]:\r\n standing += 1\r\n i+=1\r\n print(standing+1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n #t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "import heapq\r\nfrom collections import Counter\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\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 inis():\r\n return(input().split())\r\n###################################################\r\n\r\n# # Code to find top 3 elements and their counts\r\n# # using most_common\r\n#\r\n# arr = [1, 3, 4, 1, 2, 1, 1, 3, 4, 3, 5, 1, 2, 5, 3, 4, 5]\r\n# counter = Counter(arr)\r\n# top_three = counter.most_common()\r\n# print(sorted(top_three))\r\n#\r\n#\r\n# # Python code to find 3 largest and 4 smallest\r\n# # elements of a list.\r\n#\r\n# grades = [110, 25, 38, 49, 20, 95, 33, 87, 80, 90, 110]\r\n# print(heapq.nlargest(3, grades))\r\n# print(heapq.nsmallest(4, grades))\r\n\r\n###########---------Code Here------------##############\r\n\r\ns = insr()\r\nt = insr()\r\ni = 0\r\nfor k in range(len(t)):\r\n if t[k] == s[i]:\r\n i += 1\r\nprint(i + 1)", "stones, i = input(), 0\r\nfor instruction in input():\r\n i += instruction == stones[i]\r\nprint(i + 1)", "stones = list(input())\r\ninstructions = list(input())\r\nmove = 0\r\n\r\nfor i in range(len(instructions)):\r\n if instructions[i] == stones[0]:\r\n move += 1\r\n stones.remove(stones[0])\r\nprint(move + 1)", "s = input() \r\nt = input()\r\n\r\ncnt = 0\r\nfor i in range(len(t)):\r\n if s[cnt] == t[i]:\r\n cnt += 1\r\nprint(cnt + 1)\r\n\r\n", "s1 = input()\r\nc = input()\r\nm = 0\r\nfor i in range(len(c)):\r\n if s1[m] == c[i]:\r\n m += 1\r\nprint(m+1)", "st = str(input())\r\ns = str(input())\r\n\r\n\r\n\r\nx = 0\r\nsum = 0 \r\nfor i in st:\r\n for j in range(x,len(s)):\r\n if s[j] == i:\r\n sum += 1\r\n break\r\n x = j+1\r\n if x == len(s):\r\n break\r\n\r\nprint(sum+1)", "a=input()\r\nb=input()\r\ncnt=0\r\n\r\nj=0\r\nfor i in range(len(b)):\r\n if a[j]==b[i]:\r\n cnt+=1\r\n j+=1\r\nprint(cnt+1)", "s,i=input(),0\r\nfor x in input():i+=(x==s[i])\r\nprint(i+1)", "# input Operation \r\nString_s=list(input())\r\nstring_t=list(input())\r\n\r\n# output operation\r\ncounter=1 \r\nfor i in string_t:\r\n if String_s[counter-1]==i:\r\n counter+=1\r\n\r\nprint(counter)\r\n", "standing = input().strip()\r\ninstruc_str = input().strip()\r\nstart = 0\r\ni = 0\r\n#while(start < len(instruc_str)):\r\nfor j in range(start, len(instruc_str)):\r\n if standing[i] == instruc_str[j]:\r\n i += 1\r\n start = j + 1\r\nprint(i + 1)", "s=input()\nt=input()\ni=0\nj=0\nwhile(i<len(s) and j<len(t)):\n if s[i] == t[j]:\n i +=1\n j+=1\nprint(i+1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\ndef solve(s: int, t: int) -> None:\r\n c = 1\r\n for i in t:\r\n if i == s[c - 1]:\r\n c += 1\r\n\r\n print(c)\r\n\r\ndef main() -> None:\r\n s, t = input(), input()\r\n\r\n solve(s, t)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "#\r\n\n# 24.06.2021\n\r\n#\r\n\n# CF 162 A\r\n\r\n\n\ns = input ()\r\n\nt = input ()\r\n\nn = len (t)\n\n\r\n\r\nk = 0\r\n\nfor i in range (0, n) :\r\n\n if ( t [i] == s [k] ) :\r\n\n k += 1\n\n\r\n\r\nprint ((k+1))\n\n\r\n", "x=input()\ny=input()\na=1 \nfor i in y:\n if i==x[(a-1)]:\n a+=1\nprint(a)\n ", "s = input().strip()\r\nt = input().strip()\r\n\r\nLiss_position = 1\r\n\r\nfor instruction in t:\r\n if instruction == s[Liss_position - 1]:\r\n Liss_position += 1\r\n\r\nprint(Liss_position)\r\n", "s=input()\r\nt=input()\r\ncur=0\r\nfor i in t:\r\n if i==s[cur]:\r\n cur+=1\r\nprint(cur+1)\r\n", "a = input()\r\nb = input()\r\nk = 1\r\nm = 0\r\nfor i in b:\r\n if i == a[m]:\r\n m+=1\r\n k+=1\r\nprint(k)", "\r\ndef solve(n, m):\r\n\r\n steps = 0\r\n for i in range(len(m)):\r\n test = n[steps]\r\n if m[i] == test:\r\n steps += 1\r\n\r\n return steps + 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = input(), input()\r\n print(solve(n, m))", "str1 = input()\r\nstr2 = input()\r\npos = 0\r\nfor i in range(len(str2)):\r\n if str2[i] == str1[pos]:\r\n pos += 1\r\nprint(pos + 1)", "s=input()\r\nt=input()\r\nm=0\r\nfor i in range(len(t)):\r\n \r\n if(s[m]==t[i]):\r\n m+=1\r\n\r\nprint(m+1)", "a=input()\r\nb=input()\r\ny=1\r\nfor i in b:\r\n j=a[y-1]\r\n if i==j:\r\n y+=1\r\n\r\nprint(y)", "s=input()\r\nt=input()\r\ni=0\r\ncount=0\r\nwhile i<len(t):\r\n if s[count]==t[i]:\r\n count+=1\r\n i+=1\r\nprint(count+1)", "s = input(\"\")\r\nt = input(\"\")\r\np = 0\r\n#RGB RRR\r\nfor i in range(len(t)): \r\n if t[i] == s[p]:\r\n p+=1\r\nprint(p+1)\r\n", "a=input()\r\nc=input()\r\ni=0\r\nj=0\r\nwhile(i<len(c)):\r\n if(a[j]==c[i]):\r\n j=j+1\r\n i=i+1\r\nprint(j+1)\r\n ", "s = input()\ni = 0\nfor c in input():\n if c == s[i]:\n i += 1\nprint(i + 1)\n", "s = input()\r\ninstruction = input()\r\nposition = 1\r\n\r\nfor i in instruction:\r\n if s[position-1] == i:\r\n position += 1\r\n\r\nprint(position)\r\n", "a=input()\r\ns=input()\r\nc=1\r\nk=0\r\nfor i in range(len(s)):\r\n if s[i]==a[k]:\r\n c+=1\r\n k+=1\r\nprint(c)", "s = input()\r\nt = input()\r\nnow = s[0]\r\nnown = 1\r\nfor i in range(len(t)):\r\n if t[i] == now:\r\n nown += 1\r\n now = s[nown-1]\r\nprint(nown)\r\n", "s = input()\r\nt = input()\r\npos = 0\r\nfor i in range(len(t)):\r\n\tif(s[pos]==t[i]):\r\n\t\tpos+=1\r\nprint(pos+1)", "s = input()\r\nt = input()\r\n\r\nidx = 0\r\nfor i in t:\r\n if s[idx] == i:\r\n idx += 1\r\n \r\nprint(idx + 1)", "s = list(input())\r\nt = list(input())\r\n\r\npos = 0\r\nfor i in t:\r\n if i == s[pos]:\r\n pos+=1\r\n\r\nprint(pos + 1)\r\n", "stones = input()\r\ninstructions = input()\r\nindex = 0\r\nfor i in range(len(instructions)):\r\n if stones[index] == instructions[i]: index += 1\r\nprint(index+1)\r\n", "x=input()\r\ny=input()\r\ncount=0\r\nl=0\r\nj=0\r\nwhile l<len(y):\r\n if x[j]==y[l]:\r\n j+=1\r\n count+=1\r\n l+=1\r\nprint(count+1)", "stones = input()\r\ninstructions = input()\r\n\r\nidx1, idx2 = 0, 0\r\n\r\nwhile idx2 < len(instructions):\r\n if stones[idx1] == instructions[idx2]:\r\n idx1 += 1\r\n idx2 += 1\r\n\r\nprint(idx1 + 1)\r\n", "a=input()\r\nb=input()\r\ncount=1\r\nx=0\r\nfor i in b:\r\n if i==a[x]:\r\n count+=1\r\n x+=1\r\n if count==len(a):\r\n break\r\nprint(count)", "\ndef verif(ch):\n ok=True\n i=0\n while ok and i<len(ch):\n ok=((ch[i]=='R') or (ch[i]=='G') or (ch[i]=='B'))\n i+=1\n return(ok)\n\n\ndef saisir():\n while True:\n s=input()\n if verif(s) and len(s)!=0:\n break\n while True:\n t=input()\n if verif(t) and len(t)!=0:\n break\n return s,t\n'''\ndef afficher(s,t):\n pos=0\n for i in range(len(t)):\n if s[pos]==t[i]:\n pos+=1\n print(pos+1)\n'''\n#2éme method\ndef afficher(s,t):\n l = len(s)\n l1 = len(t)\n si = ti = 0\n while l > si and ti < l1:\n if s[si] == t[ti]:\n si += 1\n ti += 1\n print(si + 1)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n#pp\nif __name__=='__main__':\n s,t=saisir()\n afficher(s,t)\n", "'''\r\n# Submitted By [email protected]\r\nDon't Copy This Code, Try To Solve It By Yourself\r\n'''\r\n# Problem Name = \"Colorful Stones (Simplified Edition)\"\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\ndef Solve():\r\n s = input().strip(\"\\n\")\r\n o=0\r\n c=s[o]\r\n t = input().strip(\"\\n\")\r\n for i in t:\r\n if i==c:\r\n o+=1\r\n c=s[o]\r\n \r\n print(o+1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "t = list(input())\r\nu = list(input())\r\nans = 1\r\nj = 0\r\n\r\nfor i in range(len(u)):\r\n if t[j] == u[i]:\r\n ans += 1\r\n j += 1\r\n\r\nprint(ans)", "s = input()\r\nt = input()\r\nans = 0\r\n\r\nfor i in t:\r\n if i == s[ans]:\r\n ans += 1\r\n\r\nprint(ans + 1)", "a=input()\r\nb=input()\r\nk=0\r\nfor i in b:\r\n if i==a[k]:k+=1\r\nprint(k+1)", "def solve(test):\r\n ans = 0\r\n s = input()\r\n t = input()\r\n for i in range(len(t)):\r\n if ans < len(s) and s[ans] == t[i]:\r\n ans += 1\r\n print(ans + 1)\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve(_ + 1)", "s = input()\r\nt = input()\r\nfaresal3r9 = 1\r\nfor i in t:\r\n if i == s[faresal3r9-1]:faresal3r9+=1\r\nprint(faresal3r9)\r\n", "S = input()\r\nT = input()\r\n\r\nl = 1\r\nfor i in range(len(T)):\r\n if T[i] == S[l-1]:\r\n l += 1\r\n\r\nprint(l)", "s=input()\r\nt=input()\r\nsteps=1\r\nindex=0\r\n\r\nfor i in range(len(t)):\r\n if s[index]==t[i]:\r\n\r\n steps+=1\r\n index+=1\r\nprint(steps)", "s= input()\nt= input()\ns1 = list(s)\ns2 = list(t)\ni = 0\nfor j in range(len(t)):\n if s1[i] == s2[j]:\n i+=1\nprint(i+1)\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\nz = 0\r\nfor i in t:\r\n if i == s[z]:\r\n z += 1\r\nprint(z+1)\r\n", "s1 = input()\r\ns2 = input()\r\nres = 1\r\nnow = s1[res-1]\r\nn = len(s1)\r\nfor i in s2:\r\n if res == n:\r\n break\r\n if now == i:\r\n now = s1[res]\r\n res += 1\r\nprint(res)", "s=input().upper()\r\nx=input().upper()\r\npo=1\r\ni=0\r\nfor j in range(len(x)):\r\n if x[j]==s[i]:\r\n po+=1\r\n i+=1\r\n \r\n \r\nprint(po)", "s = input()\r\nt = input()\r\nl = s[0]\r\nj = 0\r\n\r\nfor i in t:\r\n if l == i:\r\n j += 1\r\n l = s[j]\r\nprint(j+1)", "s = input()\nt = input()\npos = 0\nsPos = 0\nfor c in t:\n if c == s[sPos]:\n sPos += 1\n pos += 1\nprint(sPos+1)", "s=input()\r\nt=input()\r\nj=1\r\nfor i in t:\r\n if i ==s[j-1]:\r\n j+=1\r\nprint(j)", "s=input()\r\nt=input()\r\nans = 0\r\nfor i in range(len(t)):\r\n if s[ans]==t[i]:\r\n ans+=1\r\n \r\nprint(ans+1)", "s1 = input()\r\ns2 = input()\r\nleft = 0\r\nfor i in s2:\r\n if i==s1[left]:\r\n left+=1;\r\nprint(left+1)", "\r\ns1 = input()\r\ns2 = input()\r\nliss = 0\r\n\r\nfor i in range (len(s2)):\r\n if((s2[i] == s1[liss] )== True):\r\n liss +=1\r\nprint(liss+1)\r\n\r\n\r\n", "import sys\r\nINF = 10**20\r\nMOD = 10**9 + 7\r\nfrom math import gcd\r\nfrom math import ceil, log2, factorial\r\nfrom collections import defaultdict as dd, Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\n\r\ndef fastio():\r\n import sys\r\n from io import StringIO \r\n from atexit import register\r\n global input\r\n sys.stdin = StringIO(sys.stdin.read())\r\n input = lambda : sys.stdin.readline().rstrip('\\r\\n')\r\n sys.stdout = StringIO()\r\n register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\r\nfastio()\r\n\r\nI = lambda:list(map(int,input().split()))\r\nTESTS = 0\r\n\"\"\"\r\nFacts and Data representation\r\nConstructive? Top bottom up down\r\n\"\"\"\r\ndef solve():\r\n s = input()\r\n t = input()\r\n\r\n cur = 0\r\n for i in t:\r\n if cur >= len(s):\r\n break\r\n if i == s[cur]:\r\n cur += 1\r\n\r\n print(cur + 1)\r\n\r\n\r\ndef main():\r\n if not TESTS:\r\n solve()\r\n return\r\n\r\n t, = I()\r\n while t:\r\n solve()\r\n t -= 1\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s, t = input(), input()\r\npos = 0\r\ns_pointer = s[pos]\r\nfor i in range(len(t)):\r\n t_pointer = t[i]\r\n if t_pointer == s_pointer:\r\n pos += 1\r\n s_pointer = s[pos]\r\n else:\r\n if i<len(t)-1:\r\n t_pointer = t[i+1]\r\n if i<len(t)-1:\r\n t_pointer = t[i+1]\r\nprint(pos+1)", "x = input()\r\ny = input()\r\n\r\ncount = 1\r\n\r\ni = 0\r\nfor z in y:\r\n if z == x[i]:\r\n count += 1\r\n i += 1\r\n\r\nprint(count)", "s1=input()\r\ns2=input()\r\nlist1=[]\r\nlist2=[]\r\nlist1.extend(s1)\r\nlist2.extend(s2)\r\ncount=1\r\nfor x in range(len(list2)):\r\n if list2[x]==list1[0]:\r\n count+=1\r\n list1.pop(0)\r\nprint(count)", "\r\ns= input()\r\nt = input()\r\nposition = 0\r\nfor i in range(len(t)):\r\n if s[position] == t[i] :\r\n position +=1\r\n\r\nprint(position+1)", "s=input()\r\nt=input()\r\ncounterS=0\r\ncounterT=0\r\nwhile counterT<len(t):\r\n if s[counterS]==t[counterT]:\r\n counterS=counterS+1\r\n counterT=counterT+1\r\nprint(counterS+1)\r\n", "s=input(\"\")\r\nt=input(\"\")\r\nj=0\r\nfor i in range (len(t)):\r\n if t[i]==s[j]:\r\n j+=1\r\nprint(j+1)", "s=input()\r\nt=input()\r\nn=len(t)\r\ncount=0\r\nind=0\r\nwhile n>0:\r\n if t[ind]==s[count]:\r\n count+=1\r\n ind+=1\r\n n-=1\r\nprint(count+1)", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\ns = input()\r\nt = input()\r\nl = 0\r\nfor i in range(len(t)):\r\n if s[l] == t[i]:\r\n l += 1\r\nprint(l + 1)", "z = input()\r\nw = input()\r\n#print(z)\r\n#print(w)\r\ncount = 1\r\nstart = 0\r\nj = 0\r\nfor i in range(len(w)):\r\n if w[i] == z[j]:\r\n count += 1\r\n j+=1\r\n\r\n\r\nprint(count)", "s = list(map(str, input()))\r\nt = list(map(str, input()))\r\npos = 0\r\nfor i in range(len(t)):\r\n if t[i]==s[pos]:\r\n pos+=1\r\nprint(pos+1)", "stones = list(input())\r\ninstructions = list(input())\r\nposition = 0\r\ni=0\r\n\r\n\r\nfor j in range(len(instructions)):\r\n if instructions[j] == stones[i]:\r\n i+=1\r\n\r\nprint(i+1)\r\n ", "s=input()\r\nb=input()\r\nc=0\r\nm=1\r\nfor i in range(len(b)):\r\n if s[0+c]==b[i]:\r\n c+=1\r\n m+=1\r\nprint(m)", "s = input()\r\ncount = 0\r\ninstructions = input()\r\nfor i in range(len(instructions)):\r\n if instructions[i] == s[count]:\r\n count += 1\r\nprint(count+1)", "from sys import stdin\r\n_input = stdin.readline\r\n_int, _str = int, str\r\ndef solution():\r\n s = _input().rstrip('\\n')\r\n inst = _input().rstrip('\\n')\r\n index = 0\r\n for i in inst:\r\n if i == s[index]:\r\n index += 1\r\n print(index+1)\r\nsolution()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Feb 23 09:15:18 2022\r\n\r\n@author: ahlam-islam\r\n\"\"\"\r\n\r\nstons = input()\r\nmoves = input()\r\n\r\nindex = 0\r\ncounter = 1\r\n\r\nfor i in moves:\r\n if i == stons[index]:\r\n index +=1\r\n counter +=1\r\n\r\nprint(counter)\r\n ", "s = input()\r\npos = 0\r\nfor c in input():\r\n pos += (s[pos] == c)\r\npos += 1\r\nprint(pos)", "# tc = int(input())\r\ntc = 1\r\nwhile tc:\r\n # inp = [int(x) for x in input().split()]\r\n # n = int(input())\r\n # n, m = inp[0], inp[1]\r\n s = input()\r\n t = input()\r\n # n = int(input())\r\n # c = [int(x) for x in input().split()]\r\n i = 0\r\n for j in range(len(t)):\r\n if t[j] == s[i]:\r\n i += 1\r\n print(i+1)\r\n tc -= 1\r\n", "s=input()\r\ns1=input()\r\nj=0\r\nfor i in list(s1):\r\n if i==s[j]:\r\n j+=1\r\n else:\r\n pass\r\nprint(j+1)", "x = input()\ny = input()\nc = 0\nl = len(y)\nb = len(x)\nj = 0\nfor i in range(l):\n\tif y[i]==x[j]:\n\t\tj+=1\n\t\tc+=1\nprint(c+1)\n", "s = list(input())\r\nt = list(input())\r\nposition = 1\r\nj = 0\r\n\r\nfor i in range(0,len(t)):\r\n if s[j] == t[i]:\r\n position = position + 1\r\n j = j + 1\r\n\r\nprint(position)", "s = input()\r\nt = input()\r\na = 1\r\nb = 0\r\nfor i in s:\r\n for j in range(b,len(t)):\r\n if i==t[j]:\r\n a = a+1\r\n b = b+1\r\n break\r\n else:\r\n b = b+1\r\nprint(a)\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\nt = input()\r\n\r\nans, i, j = 0, 0, 0\r\nwhile i<len(t):\r\n if t[i]==s[j]:\r\n ans+=1\r\n j+=1\r\n i+=1\r\nprint(ans+1)", "s = input()\nt = input()\nmove = 0\nfor i in range(len(t)):\n\tif t[i] == s[move]:\n\t\tmove += 1\nprint(move + 1)\n \t\t \t\t \t \t\t \t \t\t\t \t\t", "\r\ns=input()\r\nc = input()\r\ncounter =0\r\nfor i in range(len(c)):\r\n if(c[i] == s[counter]):\r\n counter+=1\r\ncounter+=1\r\nprint(counter)", "s = input()\r\nt = input()\r\np = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[p]:\r\n p += 1\r\nprint(p+1)", "a = input()\r\nb = input()\r\nc= 0\r\nfor i in b:\r\n if i ==a[c]:\r\n c+=1\r\nprint(c+1)", "s=input()\r\nt=input()\r\nans=1\r\nidx=0\r\nfor i in t:\r\n if s[idx]==i:\r\n ans+=1\r\n idx+=1\r\nprint(ans)", "s = input()\r\ninst = input()\r\ncurrent_index = 0\r\nfor i in inst:\r\n if i == s[current_index]:\r\n current_index += 1\r\n\r\nprint(current_index+1)\r\n", "s = input()\r\nt = input()\r\n\r\nn = 0\r\nfor c in t :\r\n if c == s[n] :\r\n n = n+1\r\nprint(n+1)", "##n, b, d = [int(t) for t in input().split()]\n##clean = 0\n##t = 0\n##a = [int(t) for t in input().split()]\n##if n > 1:\n## for i in a:\n## if i <= b:\n## t = t + i\n## if t > d:\n## clean = clean + 1\n## t = 0\n##print(clean)\n \n##n = int(input())\n##city = input()\n##fs = 0\n##sf = 0\n##for i in range(n-1):\n## if city[i] == 'S' and city[i+1] == 'F':\n## sf = sf + 1\n## elif city[i]=='F' and city[i+1]==\"S\":\n## fs = fs + 1\n##if sf > fs:\n## print('YES')\n##else:\n## print('NO')\n\n##contestants = int(input())\n##verdict = 'NO'\n##for i in range(contestants):\n## user, before, after = input().split()\n## if int(before) >= 2400 and int(before) < int(after):\n## verdict = \"YES\"\n## break\n##print(verdict)\n\n##a = int(input())\n##phase = ''\n##phases = []\n##for i in range(0, 3, 1):\n## if a%4 == 1:\n## phase = 'A'\n## elif a%4 == 3:\n## phase = 'B'\n## elif a%4 == 2:\n## phase = 'C'\n## elif a%4 == 0:\n## phase = 'D'\n## a = a + 1\n## phases.append(phase)\n##change = min(phases[0], phases[1], phases[2])\n##print(phases.index(change), change)\n\n##t = int(input())\n##cost = 0\n##for i in range(t):\n## s, a, b, c = [int(f) for f in input().split()]\n## k = a*c\n## gift = (s//k)*b\n## print(s//c+gift)\n\nbridge = input()\ndirections = input()\nwhere = 0\nfor i in directions:\n if i == bridge[where]:\n where = where + 1\nprint(where+1)\n", "s=list(input())\r\nt=list(input())\r\nk=1\r\nfor i in range(len(t)):\r\n if s[0]==t[i]:\r\n k+=1\r\n s.pop(0)\r\n continue\r\nprint(k)\r\n", "s = input()\r\nt = input()\r\n\r\np = 1\r\n\r\nfor i in range(len(t)):\r\n if t[i] == s[p - 1]:\r\n p += 1\r\n\r\nprint(p)\r\n", "# link: https://codeforces.com/contest/265/problem/A\r\n\r\nstones_colors = input()\r\ninstructions_colors = input()\r\n\r\npos = 0\r\nfor c in instructions_colors:\r\n if pos==len(stones_colors)-1:\r\n break\r\n if stones_colors[pos]==c:\r\n pos += 1\r\n\r\n\r\n\r\nprint(pos+1)\r\n", "ground = input()\r\norder = input()\r\npos = 1\r\n\r\nfor i in order:\r\n if ground[pos-1] == i:\r\n pos+=1\r\n\r\nprint(pos)\r\n ", "s = input()\r\nt = input()\r\ns1 = 0\r\nt1 = 0\r\nu = 1\r\nwhile t1 < len(t):\r\n if s[s1] == t[t1]:\r\n s1 = s1 + 1\r\n u = u + 1\r\n t1 = t1 + 1\r\nprint(u)", "b, a, i = input(), input(), 0\r\nfor x in a:\r\n if x == b[i]:\r\n i += 1\r\n if i == len(b): break\r\nif i == len(b): print(i)\r\nelse: print(i + 1)", "path = list(input())\r\ninstructions = list(input())\r\n\r\npointer = 0\r\n\r\nfor i in range(0, len(instructions)):\r\n if instructions[i] == path[pointer]:\r\n pointer += 1\r\n\r\nprint(pointer + 1)\r\n", "#!/usr/bin/env pypy3\r\n\r\nfrom sys import stdin, stdout\r\n\r\ndef input(): return stdin.readline().strip()\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\n### CODE HERE\r\n\r\nS = input()\r\ni = 0\r\nfor c in input():\r\n if c == S[i]:\r\n i += 1\r\nprint(i+1)", "s=input()\r\nt=input()\r\ni=0\r\nj=0\r\nwhile(i < len(s) and j < len(t)):\r\n if s[i]==t[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(i+1) ", "a = input()\r\nm = input()\r\ni = 0\r\nfor c in m:\r\n\tif c == a[i]:\r\n\t\ti += 1\r\nprint(i+1)", "a, b = input(), input()\r\n\r\ncount = 0\r\nfor i in range(len(b)):\r\n if b[i] == a[count]:\r\n count += 1\r\n\r\nprint(count + 1)", "\r\nt = input()\r\nc = input()\r\n\r\nliss_pos = 0\r\n\r\nfor a in range(len(c)):\r\n if c[a] == t[liss_pos]:\r\n liss_pos += 1\r\n\r\nprint(liss_pos + 1)", "s=list(input())\r\nt=list(input())\r\ncount=0\r\nh,te,i=0,len(t),0\r\nwhile(te>0):\r\n\thi=s[h]\r\n\tif hi==t[i]:\r\n\t\tcount+=1\r\n\t\th+=1\r\n\ti+=1\r\n\tte-=1\r\nprint(count+1)", "s1=input()\r\ns2=input()\r\ncount=1\r\nj=0\r\npos=s1[j]\r\nfor i in range(len(s2)):\r\n if(pos==s2[i]):\r\n count+=1\r\n j=j+1\r\n pos=s1[j]\r\nprint(count)", "s=input('')\r\nt=input('')\r\nj=0\r\nfor i in range(len(t)):\r\n if(t[i]==s[j]):\r\n# print(t[i],s[i])\r\n j+=1\r\n# print(j)\r\nprint(j+1)", "a,b,p=input(),input(),0\r\n\r\nfor i in range(len(b)):\r\n if b[i] == a[p]:\r\n p+=1\r\nprint(p+1)\r\n", "import math, sys, itertools, fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n s = wtf[0]\r\n t = wtf[1]\r\n i = 1\r\n for ch in t:\r\n \tif s[i-1] == ch:\r\n \t\ti += 1\r\n print(i)", "stones = input()\r\ninstr = input()\r\n\r\ncounter = 0\r\ni = 0\r\n\r\nfor l in instr:\r\n if l == stones[i]:\r\n counter += 1\r\n i += 1\r\n\r\nprint(counter + 1)\r\n\r\n", "s = input()\r\nt = input()\r\na = 0\r\nfor i in t:\r\n if s[a] == i:\r\n a += 1\r\nprint(a + 1)", "def colorful_stones():\r\n stones = input()\r\n instructions = input()\r\n current = 1\r\n for instruction in instructions:\r\n if instruction == stones[current - 1]:\r\n current += 1\r\n return current\r\nprint(colorful_stones())\r\n", "s1=str(input())\r\ns2=str(input())\r\nposition=int(1)\r\nk=int(0)\r\nfor i in range(len(s2)):\r\n if s2[i]==s1[k]:\r\n k+=1\r\nprint(k+1)", "#ColorfulStones\r\n\r\ncolorStone = input()\r\n\r\ninstruStone = input()\r\n\r\nnuminstr = 0\r\nnumcolor= 0\r\ncount = 0\r\n\r\nwhile(numinstr < len(instruStone)):\r\n\r\n\tif(instruStone[numinstr] == colorStone[numcolor]):\r\n\t\tcount +=1\r\n\t\tnuminstr +=1\r\n\t\tnumcolor+=1\r\n\t\r\n\telse:\r\n\t\tnuminstr+=1\r\n\r\n\t\t\r\nprint(count+1)", "import math\nimport itertools\nfrom sys import stdin\nfrom functools import reduce\nfrom collections import deque\nfrom sys import setrecursionlimit\nfrom collections import defaultdict\nimport heapq\n# setrecursionlimit(10**7)\ninput = stdin.readline\ndef I():return int(input())\ndef IN():return map(int,input().split())\ndef LI():return list(map(int,input().split()))\ndef LIN(N):return [list(map(int,input().split())) for _ in range(N)]\n\ngcd = math.gcd\nInf = float(\"Inf\")\n\n\n\ndef solve():\n s = input()\n t = input()\n i = 0 \n j = 0 \n while j < len(t):\n if t[j] == s[i]:\n i += 1\n j += 1\n print(i+1)\n\ndef main():\n t = 1\n # t = I() \n for i in range(1, t+1):\n solve()\nif __name__ == '__main__':\n main()\n", "s = input()\r\nt = input()\r\nl=0\r\nfor i in range(len(t)): \r\n if t[i] == s[l]:\r\n l+=1\r\nprint(l+1) ", "s = input()\r\nt = input()\r\n\r\np = 0\r\nfor i in t:\r\n if i == s[p]:\r\n p += 1\r\n\r\nprint(p + 1)", "'''\r\n#1\r\nn,m = map(int, input().split())\r\nsp = []\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n sp.append(m*(a/b))\r\nprint(min(sp))\r\n#2\r\nn, b, d = map(int, input().split())\r\na = list(map(int, input().split()))\r\nsumm = 0\r\nk = 0\r\nfor i in range(n):\r\n if a[i] <= b:\r\n summ += a[i]\r\n if summ > d:\r\n k += 1\r\n summ = 0\r\nprint(k)\r\n#3\r\nn = int(input())\r\na = input().lower()\r\nf, s = 0, 0\r\nsf = a.count('sf')\r\nfs = a.count('fs')\r\nif sf > fs:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n#4\r\nn = int(input())\r\nfor i in range(n):\r\n name, before, after = map(str, input().split())\r\n if int(before) >= 2400 and int(after)-int(before) > 0:\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n#5\r\nx = int(input())\r\nk = 0\r\nif x % 4 == 1:\r\n print(0, 'A')\r\nelif x % 4 == 3:\r\n print(2, 'A')\r\nelif x % 4 == 2:\r\n print(1, 'B')\r\nelif x % 4 == 0:\r\n print(1, 'A')\r\n#6\r\nt = int(input())\r\nfor i in range(t):\r\n k = 0\r\n s, a, b, c = map(int, input().split())\r\n ac = a*c\r\n kol = s//ac\r\n if s >= ac:\r\n k = (a+b)*kol + (s-kol*ac)//c\r\n print(k)\r\n else:\r\n print(s//c)\r\n'''\r\ns = input()\r\nt = input()\r\npos = 0\r\nfor i in range(len(t)):\r\n if s[pos] == t[i]:\r\n pos += 1\r\nprint(pos+1)\r\n\r\n\r\n\r\n\r\n\r\n", "arr1=input()\r\narr2=input()\r\nsum1=0\r\nj=0\r\nfor i in range(len(arr2)):\r\n if arr2[i]==arr1[j] and j<len(arr1):\r\n sum1+=1\r\n j=j+1\r\nprint(sum1+1)", "def steps():\r\n stones = input()\r\n instructions = input()\r\n j = 0\r\n \r\n for i in range(len(instructions)):\r\n if stones[j] == instructions[i]:\r\n j += 1\r\n \r\n print(j + 1)\r\n \r\nsteps()", "s=input()\r\nl=input()\r\nc=0\r\nfor i in range(len(l)):\r\n if l[i]==s[c]:\r\n c+=1\r\n \r\nprint(c+1)", "#for _ in range(int(input())):\r\n #n,m,k=map(int,input().split())\r\ns=input()\r\nt=input()\r\nk=0\r\nfor i in range(len(t)):\r\n if(t[i]==s[k]):\r\n k+=1\r\nprint(k+1)", "s1 = list(input())\ns2 = list(input())\n\npos = 0\n\nfor i in s2:\n if i == s1[pos]:\n pos += 1\nprint(pos + 1)\n", "s = input()\r\nt = input()\r\ni,j,k = 0,0,1\r\n\r\nfor i in range(len(t)):\r\n if t[i] == s[j]:\r\n k = k+1\r\n j = j+1\r\n\r\nprint(k)", "s = input().strip()\nt = input().strip()\n\nn = len(t)\n\nj = 0\nfor i in range(n):\n if t[i]==s[j]:\n j+=1\n \nprint(j+1)\n\n ", "s=str(input())\r\nr=str(input())\r\ni=0\r\nfor J in r:\r\n if J==s[i]:\r\n i+=1\r\nprint(i+1)", "s = input()\nt = input()\nindex = 0\nfor i in range(len(t)):\n if t[i] == s[index]:\n index += 1\nprint(index+1)", "[P, I] = [input(), input()]\r\np = 0\r\nfor i in I:\r\n if i == P[p]: p += 1\r\nprint(p+1)\r\n", "stones=input()\r\ninstruction=input()\r\ncounter=1\r\nnumofinst=0\r\nstone=0\r\nfor i in range(len(instruction)):\r\n if stones[stone]== instruction[numofinst]:\r\n numofinst+=1\r\n stone+=1\r\n counter+=1\r\n else:\r\n numofinst+=1\r\nprint(counter)\r\n", "s =input()\r\nt = input()\r\n\r\nres = 1\r\ncntr = 0\r\ntest = s[cntr]\r\nfor i in t:\r\n if i == test:\r\n res += 1\r\n cntr += 1\r\n test = s[cntr]\r\n else:\r\n continue\r\nprint(res)", "from math import gcd, lcm\nimport sys\n\nget_input = lambda: sys.stdin.readline().rstrip(\"\\n\\r\")\n\ndef main():\n s = get_input()\n instr = get_input() \n current = 1\n for j in instr:\n if j == s[current-1]:\n current += 1\n print(current)\n \nmain()", "s = input()\r\nt = input()\r\nstart = 0\r\nfor i in range(len(t)):\r\n if s[start] == t[i]:\r\n start += 1\r\nprint(start+1)", "# https://codeforces.com/contest/265/problem/A\n\ns = input()\nt = input()\nptr=0\n\nfor i in range(len(t)):\n if t[i] == s[ptr]:\n ptr += 1\n\nprint(ptr+1)\n", "s = input()\r\nt = input()\r\ninitial_position = 0\r\nfor instruction in t:\r\n if instruction == s[initial_position]:\r\n initial_position += 1\r\nprint(initial_position + 1)\r\n", "t=input()\r\ns=input()\r\ni=0\r\nj=0\r\nwhile(i<len(s)):\r\n if s[i]==t[j]:\r\n j+=1\r\n i+=1\r\nprint(j+1)", "s = input()\r\nt = input()\r\nsum = 0\r\nj = 0\r\n\r\nfor i in range(len(t)):\r\n j = j\r\n if s[i-j] == t[i]:\r\n sum += 1\r\n else:\r\n j += 1\r\nprint(sum+1)", "s = input()\r\nt = input()\r\n\r\ninst = 0\r\nsptr = 0\r\n\r\nwhile inst < len(t):\r\n if s[sptr] == t[inst]:\r\n sptr+=1\r\n \r\n inst +=1\r\n\r\nprint(sptr+1)", "def final_position(s, t):\r\n position = 1 # Start at the first stone\r\n\r\n for instruction in t:\r\n if s[position - 1] == instruction:\r\n position += 1\r\n\r\n return position\r\n\r\n# Read input\r\ns = input().strip()\r\nt = input().strip()\r\n\r\n# Calculate and print the final position\r\nresult = final_position(s, t)\r\nprint(result)\r\n", "s=input()\r\ns=[*s]\r\nt=input()\r\nt=[*t]\r\nc=1\r\nr=0\r\ncurr=s[0]\r\nfor i in range (len(t)):\r\n if t[i]==curr:\r\n c+=1\r\n r+=1\r\n curr=s[r]\r\n\r\nprint(c)", "s = input('')\r\nt = input('')\r\n\r\nnum = 0\r\nfor a in range(len(t)):\r\n if s[0] == t[a]:\r\n s = s[1:]\r\n num += 1\r\n\r\nprint(num+1)\r\n", "stones, instructions = input(), iter(input())\r\nfor stone_position, stone_color in enumerate(stones, 1):\r\n try:\r\n while not next(instructions) == stone_color:\r\n pass\r\n except StopIteration:\r\n print(stone_position)\r\n exit()", "a=0\r\ns=input()\r\nc=input()\r\nfor i in range(len(c)):\r\n if c[i]==s[a]:\r\n a+=1\r\nprint(a+1)\r\n", "s=input()\r\nt=input()\r\nchk=0\r\ni=0\r\nwhile i!=len(t):\r\n if t[i]==s[chk]:\r\n chk+=1\r\n i+=1\r\nprint(chk+1)\r\n", "a = input()\r\nb = input()\r\ns = 0\r\nfor i in range(len(b)):\r\n if b[i] == a[s]:\r\n s += 1\r\nprint(s+1)\r\n \r\n \r\n", "'''t = int(input())\r\nfor _ in range(t):\r\n'''\r\na = list(input())\r\nb = list(input())\r\nans = 1\r\nwhile min(len(b), len(a)):\r\n if b[0] == a[0]:\r\n del b[0]\r\n del a[0]\r\n ans += 1\r\n else:\r\n del b[0]\r\nprint(ans)\r\n", "s=input()\r\nl=input()\r\nj=0\r\nif s==l:\r\n print(len(s))\r\nelse:\r\n for i in range(len(l)):\r\n if l[i]== s[j]:\r\n j+=1\r\n print(j+1)", "col = input()\ncommand = input()\ni = 0\nfor c in command:\n\tif c == col[i]:\n\t\ti += 1\nprint(i + 1)\n \t\t\t \t \t\t \t \t\t \t \t \t \t", "s = input().upper()\r\nt = input().upper()\r\nliss = 1\r\nfor i in range(len(t)):\r\n if t[i] == s[liss - 1]:\r\n liss += 1\r\nprint(liss)", "s=input()\r\nt=input()\r\ni=0\r\nfor j in range(len(t)):\r\n if t[j]==s[i]:\r\n i+=1\r\nprint(i+1)", "s = input()\r\nt = input()\r\nf = 1\r\nfor i in t:\r\n if s[f-1] == i:\r\n f += 1\r\nprint(f)\r\n\r\n", "s = [str(x) for x in input()]\r\nt = [str(x) for x in input()]\r\nans = 1\r\n\r\ni = 0 \r\nj = 0 \r\n\r\nwhile(i < len(s) and j < len(t)):\r\n\tif(s[i] == t[j]):\r\n\t\tans += 1\r\n\t\ti += 1\r\n\t\tj += 1\r\n\telse:\r\n\t\tj += 1\r\n\r\nprint(ans)", "\r\nstringOne = input();\r\nstringTwo = input();\r\nidxOne = 0;\r\nidxTwo = 0;\r\nwhile(idxOne < len(stringOne) and idxTwo < len(stringTwo)):\r\n if stringOne[idxOne] == stringTwo[idxTwo]:\r\n idxOne += 1;\r\n idxTwo += 1;\r\n continue;\r\n idxTwo += 1;\r\n\r\nprint(idxOne + 1) ", "s = input()\r\nt = input()\r\ncnts = 0\r\ncntt = 0\r\nfor i in range (len(t)):\r\n if t[cntt] == s[cnts]:\r\n cnts += 1\r\n cntt += 1\r\nprint(cnts + 1)", "s = list(input())\r\n\r\nins = list(input())\r\n\r\ncurrent = 0\r\n\r\nfor i in ins:\r\n if i == s[current]:\r\n current+=1\r\n\r\n else:\r\n continue\r\n\r\nprint(current+1)", "#li = list(map(int, input().strip().split()))\ns = input()\nm = input()\n\ncur = 0\nfor c in m:\n\tif c == s[cur]:\n\t\tcur += 1\n\nprint(cur + 1)\n", "s = input().strip()\r\na = input().strip()\r\npos = 0\r\nfor i in range(len(a)):\r\n if a[i] == s[pos]:\r\n pos += 1\r\nprint(pos +1)", "s = input('')\ninstractions = input('')\nc = 1\ni = 0\nfor step in instractions:\n if step == s[i]:\n c += 1\n i += 1\n\n\nprint(c)", "l = [i for i in input()]\r\ninst = [ i for i in input()]\r\n\r\nn = len(l)\r\nm = len(inst)\r\ni=j=0\r\n\r\nwhile(i<n):\r\n while(j<m):\r\n if l[i]==inst[j]:\r\n i+=1\r\n j+=1\r\n if j==m:\r\n break\r\n\r\nprint(i+1)", "s = input()\r\nt = input()\r\nanswer = 1\r\nfor i in t:\r\n if i == s[answer-1]:\r\n answer += 1\r\nprint(answer)", "a = str(input())\r\nb = []\r\nb += a \r\n\r\nc = str(input())\r\nd = []\r\nd += c\r\nm = 1\r\nj = 0\r\nfor i in range(len(d)):\r\n if d[i] == b[j]:\r\n j += 1\r\nprint(j+1)", "way = input()\ninstruct = input()\npos = 1\nfor i in instruct:\n if way[pos-1] == i:\n pos+=1\nprint(pos) ", "s = input()\r\nt = input()\r\nans = 1;j = 0\r\nfor _ in range(len(t)):\r\n\tif(s[j] == t[_]):j += 1;ans += 1\r\nprint(ans)\r\n \r\n", "if __name__ == \"__main__\":\r\n s = input()\r\n t = input()\r\n pos = 0\r\n count = 0\r\n\r\n for i in t:\r\n if(i == s[pos]):\r\n pos += 1\r\n count += 1\r\n \r\n print(count+1)\r\n", "def main():\n s = input()\n t = input()\n\n i = j = 0\n n = len(t)\n\n while i < n:\n\n if t[i] == s[j]:\n j += 1\n\n i += 1\n\n print(j+1)\n\n\nif __name__ == '__main__':\n main()\n", "\r\ns = list(input())\r\nt = list(input())\r\ncount_ = 0\r\nfor i in range(0, len(t)):\r\n if s[count_] == t[i]:\r\n count_ += 1\r\n else:\r\n continue\r\nprint(count_ + 1)", "myStr = input()\r\ninst = input()\r\npos = 0\r\nfor i in inst:\r\n if i==myStr[pos]:\r\n pos+=1\r\nprint(pos+1)", "s = input()\r\nt = input()\r\ni = 0\r\nans = 1\r\ntemp = s[i]\r\nfor c in t:\r\n if(c == temp):\r\n ans += 1\r\n i += 1\r\n temp = s[i]\r\nprint(ans)", "s=input()\r\nt=input()\r\na=0\r\nj=0\r\nfor i in range (len(t)):\r\n if s[j]==t[i]:\r\n a=a+1\r\n j=j+1\r\n \r\nprint(a+1)", "s = str(input())\r\nt = str(input())\r\n\r\npos = 1\r\ns_i = 0\r\n\r\nfor i in range(len(t)):\r\n if t[i] == s[s_i]:\r\n pos += 1\r\n s_i += 1\r\n\r\nprint(pos)", "x='0'+input()\r\nt=input()\r\nc=1\r\nfor i in t:\r\n if x[c]==i:\r\n c+=1\r\nprint(c)", "s = input()\r\nt = input()\r\nc = 1\r\nfor i in range(len(t)):\r\n if t[i] == s[c-1]:\r\n c+=1\r\nprint(c)", "stones = [str(x) for x in input()]\r\ninstructions = [str(u) for u in input()]\r\ncounter = 0\r\nfor i in range(len(instructions)):\r\n if stones[counter] == instructions[i]:\r\n counter +=1\r\nprint(counter+1)", "s=input()\r\nt=input()\r\ni=1\r\nj=0\r\nfor j in range(len(t)) :\r\n if t[j]==s[i-1]:\r\n i=i+1\r\n\r\n if i== len(s)+1:\r\n i=1\r\n\r\nprint(i)", "s=str(input())\r\nt=str(input())\r\nsum=1\r\nx=0\r\nfor i in range(len(t)):\r\n if t[i]==s[x]:\r\n x+=1\r\n sum+=1\r\nprint(sum)", "x=input()\r\ny=input()\r\ni=0\r\nfor j in y:\r\n if x[i]==j:\r\n i+=1\r\nprint(i+1)", "#https://codeforces.com/problemset/problem/265/A\r\n\r\nt = input()\r\ns = input()\r\nposition = 0\r\nfor x in range(len(s)):\r\n if(s[x] == t[position]):\r\n position += 1\r\nprint(position + 1)", "colors=input()\r\ninstructions=input()\r\nj=0\r\nfor instruction in instructions:\r\n if colors[j]==instruction:\r\n j+=1\r\nans=j+1\r\nprint(ans)\r\n", "#!/bin/env python3\n\ns = input()\nt = input()\n\npos = 0\nfor i in range(0, len(t)):\n if t[i] == s[pos]:\n pos += 1\n\nprint(pos+1)\n\n", "a = list(input())\r\nb = list(input())\r\ntmp = a[0]\r\nj = 0\r\nfor i in range(len(b)):\r\n if tmp == b[i]:\r\n j += 1\r\n tmp = a[j]\r\nprint(j+1)", "c,s,i=0,input(),input()\r\nfor j in i:\r\n if j==s[c]: c+=1\r\nprint(c+1)", "def solve(str1,str2):\r\n currentState = 1\r\n for i in str2:\r\n if str1[currentState-1] == i:\r\n currentState += 1\r\n print(currentState)\r\n \r\n \r\nstring = input()\r\nstring2 = input()\r\n\r\nsolve(string,string2)", "snts = input()\ncmds = input()\ni = 1\nfor each in cmds:\n if each == snts[i-1]:\n i = i + 1\nprint(i)", "s1=input()\r\ns2=input()\r\nx=0\r\nfor i in range(len (s2)):\r\n if(s2[i]==s1[x]):\r\n x=x+1\r\ns=x+1\r\nprint(s)", "s=input()\r\nt=input()\r\nnomer_kamny=1\r\nfor i in range (0,len(t)):\r\n now_polozenie=s[nomer_kamny-1]\r\n if now_polozenie==t[i]:\r\n nomer_kamny+=1 \r\nprint(nomer_kamny)\r\n", "s = input()\r\nt = input()\r\ni = 0\r\nfor x in t:\r\n if x == s[i]: i+=1\r\n \r\nprint(i + 1)", "stones = input()\r\nins = input()\r\ninit = 0\r\ncount = 0\r\nfor i in range(0,len(ins)):\r\n if stones[init] == ins[i]:\r\n init += 1\r\n count += 1\r\n\r\nprint(count+1)\r\n", "s=list(input())\r\nt=list(input())\r\npos=1\r\nidx=0\r\nfor i in range(0,len(t)):\r\n if s[idx]==t[i]:\r\n pos+=1\r\n idx+=1\r\nprint(pos)\r\n", "text=input()\r\ninstruction=input()\r\ncounter,index=1,0\r\nfor i in range(len(instruction)):\r\n if instruction[i]==text[index]:\r\n counter+=1\r\n index+=1\r\n \r\nprint(counter)\r\n\r\n", "st1=input()\r\nst2=input()\r\nstep=0\r\ns=0\r\nfor i in st2:\r\n if i==st1[s]:\r\n s+=1\r\n step+=1\r\nprint(step+1)", "s = str(input())\r\nt = str(input())\r\n\r\nans = 0\r\n\r\nl2 = len(t)\r\nl1 = len(s)\r\n\r\nlo = 0\r\n\r\nwhile lo!=l2:\r\n if t[lo] == s[ans]:\r\n ans+=1\r\n lo+=1\r\n else:\r\n lo+=1\r\n \r\nprint(ans+1)", "s = input()\r\nt = input()\r\nq = 1\r\nw = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[w]:\r\n q += 1\r\n w += 1\r\nprint(q)\r\n", "s = input()\r\nt = input()\r\n\r\nj = 0\r\nfor i in t:\r\n if i == s[j]:\r\n j += 1\r\nprint(j+1)\r\n", "a=input()\r\nsum=0\r\nfor i in input():\r\n if a[sum]==i:\r\n sum+=1\r\n\r\nprint(sum+1)", "s = input()\r\nt = input()\r\nidx = 0\r\nfor instruction in t:\r\n if instruction == s[idx]:\r\n idx +=1 \r\nprint(idx + 1)\r\n", "#By Anan instagram: anan.ssw\r\nstones=input()\r\ninst=input()\r\ni=0\r\nfor x in inst:\r\n if x==stones[i]:\r\n i+=1\r\nprint(i+1)\r\n ", "inp1 = input()\r\ninp2 = input()\r\nsum=0\r\nfor i in range(len(inp2)):\r\n if(inp2[i]==inp1[sum]):\r\n sum+=1\r\nprint(sum+1) ", "s = input()\r\nins = input()\r\ncurr = 0\r\nfor i in range(len(ins)):\r\n if ins[i] == s[curr]:\r\n curr += 1\r\nprint(curr + 1)", "s=input()\r\nt=input()\r\nl1,l2=len(s),len(t)\r\ni,j,count=0,0,1\r\nwhile i<l1 and j<l2:\r\n if s[i]==t[j]:\r\n i+=1\r\n j+=1\r\n count+=1\r\n else:\r\n j+=1\r\nprint(count)", "s = input()\r\nt = input()\r\nk = 0\r\nfor i in t:\r\n if i == s[k]:\r\n k += 1 \r\nprint(k + 1)", "x=input()\ny=input()\nans=1\np=0\nfor i in y:\n if x[p]==i:\n ans+=1\n p+=1\nprint(ans)\n", "stones = input()\r\ninstructions = input()\r\n\r\ns, i = 0, 0\r\n\r\nwhile i < len(instructions):\r\n if stones[s] == instructions[i]:\r\n s += 1\r\n i += 1\r\n \r\nprint(s+1)", "s = list(input())\r\nins = list(input())\r\n\r\ncurrent = 0\r\nfor i in ins :\r\n if i == s[current]:\r\n current+=1\r\n \r\n \r\nprint(current+1)", "s = str(input())\r\nt = str(input())\r\nls = list(s)\r\nlt = list(t)\r\nanw = 1\r\np = 0\r\nfor i in range (len(t)):\r\n if ls[0] == lt[p]:\r\n ls.pop(0)\r\n lt.pop(0)\r\n anw+=1\r\n p-=1\r\n else :\r\n lt.pop(0)\r\n p-=1\r\n p+=1\r\nprint(anw)\r\n\r\n\r\n", "s=input()\r\nt=input()\r\npo=0\r\ni=0\r\nfor i in range(0,len(t)):\r\n if(s[po]==t[i]):\r\n po+=1\r\nprint(po+1) ", "\r\n\r\ndef postion(stones: str, instructions: str):\r\n count = 1\r\n stone_ind = 0\r\n for inst in instructions:\r\n if (stones[stone_ind] == inst):\r\n count += 1\r\n stone_ind += 1\r\n return count\r\n\r\n\r\nif __name__ == '__main__':\r\n\r\n stones = input()\r\n instructions = input()\r\n print(postion(stones, instructions))\r\n", "s=list(input())\r\nt=list(input())\r\ni,c=0,1\r\nfor j in t:\r\n if j==s[i]:\r\n i+=1\r\n c+=1\r\nprint(c)", "i=0\r\na=input()\r\nb=input()\r\nfor c in b :\r\n if c == a[i]: i+=1\r\nprint(i+1)", "n1 = input()\r\nn2 = input()\r\n\r\nb1 = False\r\nk1 = 0 \r\nk2 = 0\r\nmovement = 1\r\nwhile b1==False:\r\n if k2 == len(n2) or k1 == len(n1):\r\n print(movement)\r\n break\r\n if n2[k2] == n1[k1]:\r\n movement += 1\r\n k1+=1\r\n k2+=1\r\n else:\r\n k2+=1\r\n \r\n \r\n ", "s = input()\r\nt = input()\r\ncount = 1\r\nj = 0\r\nfor i in range(0, len(t)):\r\n if s[j] == t[i]:\r\n count += 1\r\n j += 1\r\nprint(count)\r\n", "s, t, res = input(), input(), 1\r\nfor i in t:\r\n if i == s[res-1]:\r\n res += 1\r\nprint(res)\r\n", "def solve(s, t):\r\n i = 1\r\n n = len(s)\r\n\r\n c = list(t)\r\n for l in c:\r\n if l == s[i-1]: i += 1\r\n return i\r\n\r\nprint(solve(input(), input()))", "p = 1\ni = 0\n\nroad = input()\ninstr = input()\n\nfor c in instr:\n if c == road[i]:\n p = p+1\n i = i+1\n\nprint( p )\n\t\t\t\t \t \t \t \t \t\t\t\t\t\t \t", "s = list(input())\r\nt = list(input())\r\npos = 1\r\no = 0\r\n\r\nfor x in range(len(t)):\r\n if s[o] == t[x]:\r\n pos = pos + 1\r\n o = o + 1\r\n else:\r\n continue\r\nprint(pos)", "s = input()\r\nt = input()\r\nx = 1\r\nfor i in range(len(t)):\r\n\tif s[x-1]==t[i]:\r\n\t\tx+=1\r\nprint(x)\t\t", "# 코드포스 265A Colorful Stones (Simplified Edition)\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\ns = put().strip()\r\nt = put().strip()\r\nidx = 0\r\n\r\nfor i in t:\r\n if s[idx] == i:\r\n idx += 1\r\n\r\nprint(idx + 1)", "s = input()\r\nx = input()\r\n\r\nindex = 0\r\ncounter = 1\r\n\r\nfor i in x:\r\n if i == s[index]:\r\n index += 1\r\n counter += 1\r\n\r\nprint(counter)", "# CodeForces : Colorful Stones\r\nif __name__ == \"__main__\":\r\n s=input()\r\n t=input()\r\n position=0\r\n for i in t :\r\n if i==s[position]:\r\n position+=1\r\n print(position+1)", "s=input()\nk=input()\ncount=0\nt=0\nch=s[t]\nfor i in k:\n if i==ch:\n count=count+1\n t=t+1\n if (t==len(s)):\n break\n ch=s[t]\nprint(count+1)\n\n \t \t\t\t\t\t \t \t\t\t\t\t\t\t \t \t \t \t\t", "# Colorful Stones\r\n\r\n#https://codeforces.com/contest/265/problem/A\r\n\r\n\r\nstone_queue = input()\r\ninstruction_queue = input()\r\nmove = False\r\nstart_pos= 1\r\n\r\nfor i in range(1,len(instruction_queue)+1):\r\n for j in range(start_pos, len(stone_queue)+1):\r\n #print(start_pos, stone_queue[start_pos-1],i, instruction_queue[i-1])\r\n if stone_queue[start_pos-1] == instruction_queue[i-1]:\r\n start_pos += 1\r\n break\r\n\r\nprint(start_pos)", "s=input()\r\nt=input()\r\ni,j=0,0\r\nwhile j<len(t):\r\n #print('m')\r\n if(s[i]==t[j]):\r\n #print(s[i],t[j],i,j)\r\n i+=1\r\n j+=1\r\n \r\nprint(i+1)", "s = input()\r\nt = input()\r\nj,step=0,1\r\nfor i in t:\r\n if i==s[j]:\r\n step+=1\r\n j+=1\r\nprint(step)", "l=input()\r\ns=input()\r\nc=1\r\nn=len(l)\r\nfor i in s:\r\n if(l[c-1]==i):\r\n c+=1\r\n if(c==n):\r\n break\r\nprint(c)\r\n", "s = input()\r\nt = input()\r\nposition = 0\r\ni = 0\r\nwhile i < len(t):\r\n if s[position] == t[i]:\r\n position += 1\r\n i += 1\r\nprint(position + 1)", "a=input()\r\nb=input()\r\nc=0\r\nm=len(a)\r\nfor i in b:\r\n if c==m-1:\r\n break\r\n if i==a[c]:\r\n c+=1\r\nprint(c+1)", "str1=input()\r\nstr2=input()\r\nstones=list(str1)\r\ndis=list(str2)\r\nx=0\r\nfor i in range(0,len(dis)):\r\n if stones[x]== dis[i]:\r\n x+=1\r\nprint(x+1) \r\n \r\n", "s=input()\r\nt=input()\r\nk=0\r\nfor i in t:\r\n if s[k]==i:\r\n k+=1\r\nprint(k+1)", "#https://codeforces.com/contest/265/problem/A\r\n\r\n\r\nstones = list(input())\r\n\r\ninstr = list(input())\r\n\r\nloc=stones[0]\r\ni=0\r\n\r\nfor j in instr:\r\n loc = stones[i]\r\n if(j==loc):\r\n i+=1\r\n\r\nprint(i+1)\r\n", "a=input()\r\nb=input()\r\nc=0\r\nfor i in b:\r\n if i==a[c]:\r\n c=c+1\r\nprint(c+1)\r\n", "s = str(input())\r\nt = str(input())\r\nindex = 0\r\nfor i in range(len(t)):\r\n\tif s[index] == t[i]:\r\n\t\tindex += 1\r\nprint(index + 1)", "I=input\r\ns,t,k=I(),I(),0\r\nfor i in t:k+=i==s[k]\r\nprint(k+1)", "s = input()\r\nc = input()\r\n\r\ni=0\r\nfor j in c:\r\n if s[i] == j:\r\n i+=1\r\nprint(i+1)", "c = input()\r\nt = input()\r\nj = 0\r\nfor i in range(len(t)):\r\n if t[i] == c[j]:\r\n j +=1\r\nprint(j+1)", "a=input()\r\nl=input()\r\nj=0\r\nfor i in l:\r\n\tif i==a[j]:\r\n\t\tj+=1\r\nprint (j+1)", "x=input()\r\nx= list(x)\r\ny=input()\r\ny= list(y)\r\nn=0\r\ns=0\r\n\r\nfor i in y :\r\n if x[n]==y[s]:\r\n n=n+1\r\n \r\n \r\n elif x[n]!=y[s]:\r\n n=n+0\r\n s=s+1 \r\n \r\n \r\nprint (n+1)", "def ColorfulStones(stones,instructions):\r\n count=1\r\n stonesCounter=0\r\n instructionsCounter=0\r\n while stonesCounter< len(stones) and instructionsCounter < len(instructions):\r\n if stones[stonesCounter]==instructions[instructionsCounter]:\r\n count+=1\r\n stonesCounter+=1\r\n instructionsCounter+=1\r\n return count\r\nstones=input()\r\ninstructions=input()\r\nprint(ColorfulStones(stones,instructions))", "s = input()\r\nt = input()\r\ncounter = 0\r\n\r\nfor item in t:\r\n if item == s[counter]:\r\n counter += 1\r\n \r\nprint(counter+1)", "s = input()\ns = [i for i in s]\n\nt = input()\nt = [i for i in t]\n\npointer = 0\n\nindex = 0\n\n\nfor toGo in t:\n if toGo == s[pointer]:\n pointer+=1\n\nprint(pointer+1)", "path = input()\r\ninstructions = input()\r\n\r\nj = 0\r\nm = 1\r\nfor i in range(len(instructions)):\r\n if(path[j] == instructions[i]):\r\n m+=1\r\n j+=1\r\n\r\nprint(m)", "s1=input('')\r\ns2=input('')\r\ns1=list(s1)\r\ns2=list(s2)\r\nm=0\r\nfor i in s2:\r\n if i==s1[m]:\r\n m+=1\r\nprint(m+1)", "'''HackerRank: Colorful Stones (Simplified Edition)'''\r\n\r\nif __name__ == '__main__':\r\n s, t = input(), input()\r\n pos = 0\r\n for c in t:\r\n if c == s[pos]:\r\n pos += 1\r\n\r\n print(pos + 1)\r\n", "a=list(input())\r\nb=list(input())\r\ni=0\r\nfor x in b:\r\n if x==a[i]:\r\n i+=1\r\nprint(i+1)", "input1 = input()\r\ninput2 = input()\r\n#inputs = inputs.splitlines()\r\nj=1\r\nfor i in input2:\r\n if i==input1[j-1]:\r\n j+=1\r\nprint(j)", "s=input()\r\nt=input()\r\ni=0\r\nfor j in range(len(t)):\r\n if(s[i]==t[j]):\r\n i+=1\r\nprint(i+1)\r\n ", "a = input()\r\nb = input()\r\ni=1\r\nfor val in b:\r\n if a[i-1]==val:\r\n i+=1\r\nprint(i)", "\ns = input()\nt = input()\ni = 0\nfor c in t:\n\tif c == s[i]:\n\t\ti += 1\nprint(i + 1)\n\n", "from sys import stdin\r\n\r\ns = stdin.readline().strip()\r\ni = stdin.readline().strip()\r\n\r\ndef solution(s, us):\r\n res = []\r\n pos = 0\r\n for x in i:\r\n if x == s[pos]:\r\n pos += 1\r\n\r\n return pos + 1\r\n\r\nprint(solution(s,i))", "s=input()\r\nt=input()\r\ni=0\r\nj=0\r\nwhile j < len(t):\r\n if s[i] == t[j] :\r\n i+=1\r\n j+=1\r\nprint(i+1)\r\n", "s = input()\r\nt = input()\r\nres = 1\r\ni = 0\r\nj = 0\r\n\r\nwhile j < len(t):\r\n if s[i] == t[j]:\r\n res += 1\r\n i += 1\r\n j += 1\r\nprint(res)\r\n", "stones = input()\r\ninst = list(input())\r\ncounter = 0\r\nfor x in inst:\r\n if stones[counter]==x:\r\n counter += 1\r\nprint(counter+1)", "n=input()\r\nm=input()\r\ni=0;st=0\r\nwhile i<len(m):\r\n if n[st]==m[i]:\r\n st+=1\r\n i+=1\r\nprint(st+1)", "s1=input()\r\ns2=input()\r\ncount=0\r\nfor x in range(len(s2)):\r\n if s1[count]==s2[x]:\r\n count+=1\r\nprint(count+1)", "from itertools import dropwhile\r\nstones, instructions = input(), iter(input())\r\nfor stone_position, stone_color in enumerate(stones, 1):\r\n try:\r\n next(dropwhile(stone_color.__ne__, instructions))\r\n except StopIteration:\r\n print(stone_position)\r\n exit()", "n=input()\r\nn1=input()\r\nc=0\r\np=1\r\nfor i in n1 : \r\n if i==n[c] : \r\n p+=1\r\n c+=1\r\n continue \r\nprint(p)", "if __name__ == \"__main__\":\r\n s=input()\r\n t=input()\r\n position=0\r\n for i in range(len(t)):\r\n if t[i]==s[position]:\r\n position+=1\r\n print(position+1)", "s=input()\r\nt=input()\r\na=0\r\nfor i in range(len(t)):\r\n if s[a]==t[i]:\r\n a+=1\r\nprint(a+1)", "s = input()\r\nt = input()\r\na = 0\r\nb = s[a]\r\nfor i in t:\r\n if b == i:\r\n a += 1\r\n b = s[a]\r\nprint(a+1)", "stone_colour = input()\r\ntest = input()\r\nstep = 1\r\nj = 0\r\n\r\nfor i in range (len(test)):\r\n if stone_colour[j] == test[i]:\r\n step += 1\r\n j += 1\r\nprint(step)", "s = input()\r\nt = input()\r\nsi = 0\r\ncount = 1\r\nfor i in range(len(t)):\r\n if t[i]==s[si]:\r\n si+=1\r\n count+=1\r\nprint(count)", "st=input()\r\nins=input()\r\npos=0\r\nfor i in range(len(ins)):\r\n if st[pos]==ins[i]:\r\n pos+=1\r\nprint(pos+1)", "s=input()\r\nt=input()\r\npos=0\r\ni=0\r\nwhile pos<len(s) and i<len(t):\r\n if s[pos]==t[i]:\r\n pos+=1\r\n i+=1\r\n else:\r\n i+=1\r\n \r\nprint(pos+1)", "from typing import Counter, Sequence\r\n\r\n\r\ndef main():\r\n insquence=list()\r\n instraction=list()\r\n insquence=input()\r\n instraction=input()\r\n i=0\r\n j=0\r\n count=0\r\n while i != len(instraction):\r\n if insquence[j]==instraction[i]:\r\n count+=1\r\n j+=1\r\n i+=1\r\n print(count+1)\r\nif __name__ ==\"__main__\":\r\n main()", "s = input()\r\nt = input()\r\nflg = -1\r\ncount = 1\r\nfor i in t:\r\n flg += 1\r\n if i == s[flg]:\r\n count+=1\r\n else:\r\n flg -= 1\r\n\r\n \r\nprint(count)", "s = str(input())\r\nt = str(input())\r\nhonda = 0\r\nfor i in range(0,len(t)):\r\n if t[i] == s[honda]:\r\n honda += 1\r\n\r\nprint(honda+1)", "s = input()\r\ninstruct = input()\r\nn, i, j = len(instruct), 0, 0\r\n\r\nwhile j < n:\r\n if s[i] == instruct[j]:\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\nprint(i+1)", "s1=input()\r\ns2=input()\r\ncurrent_stone=0\r\nfor i in range(len(s2)):\r\n if s1[current_stone]==s2[i]:\r\n current_stone+=1\r\nprint(current_stone+1)\r\n", "stones = input()\r\nsteps = input()\r\npos = 0\r\nlstones = list(stones)\r\nlsteps = list(steps)\r\n\r\n\r\nfor a in lsteps:\r\n if a == lstones[pos]:\r\n pos += 1\r\n\r\n\r\nprint(pos + 1)\r\n", "string1 = input().lower()\r\nstring2 = input().lower()\r\nsum = 0\r\nc_str = len(string2)\r\nfor i in range(c_str):\r\n if string1[sum] == string2[i]:\r\n sum+=1\r\nprint(sum+1)", "s = input()\r\nt = input()\r\nposition = 1\r\n\r\nfor i in t:\r\n if s[position-1] == i:\r\n position+=1\r\n\r\nprint(position)\r\n", "s = input()\r\nt = input()\r\nsqurl_pos = 1\r\nfor i in t:\r\n if i == s[squrl_pos - 1]:\r\n squrl_pos += 1\r\nprint(squrl_pos)\r\n", "s=input()\r\nt=input()\r\nl=0 ;r=0\r\nwhile l < len(s) and r <len(t) :\r\n # print(l,r)\r\n if s[l]==t[r] :\r\n l+=1\r\n r+=1\r\n else:\r\n r+=1\r\n\r\nprint(l+1)\r\n", "from math import*\r\nfrom array import*\r\nfrom getpass import*\r\n\r\n# Pi = 3.14556842124\r\ndef gcd(a,b):\r\n while(b!=0):\r\n k=int(a%b)\r\n a=b\r\n b=k\r\n return a\r\n\r\n\r\n\r\n#lst=list(map(int,input().split()))\r\n#n=int(input())\r\n#x,y=zip(*[n().split()for i in'n'*int(n())])\r\n#print(sum(x.count(i)for i in y))\r\ns=input()\r\nt=input()\r\ns1=0\r\nc=0\r\nfor i in range(len(t)) :\r\n if(s[s1]==t[i]):\r\n c=s1+1\r\n s1+=1\r\nprint(c+1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n'''\r\n<<<<<<<<<<< Bubble sort >>>>>>>>>\r\nlst=list(map(int,input().split()))\r\nk=len(lst)\r\nh=0\r\nfor i in range(0 , k):\r\n h=0\r\n for j in range(0 , k):\r\n if(lst[h]>lst[j]):\r\n lst[h],lst[j]=lst[j],lst[h]\r\n h=j\r\n k-=1\r\nprint(lst)\r\n''' \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "s1 = input()\r\ns2 = input()\r\nj = 0\r\nfor i in s2:\r\n if i == s1[j]:\r\n j += 1\r\nprint(j + 1)", "color_position = input()\r\ninstructions = input()\r\nposition = 0\r\nfor instruction in instructions:\r\n if instruction == color_position[position]:\r\n position += 1\r\nprint(position + 1)", "import sys\r\ntry:\r\n sys.stdin = open(\"actext.txt\", \"r\")\r\n OPENFILE = 1\r\nexcept:\r\n pass\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\nj = 0\r\nfor i in s2:\r\n if(i==s1[j]):\r\n j+=1\r\nprint(j+1)", "def getPosition(path, instructions):\r\n pos = 0\r\n for i in range(max(len(path), len(instructions))):\r\n if i >= len(instructions) or pos >= len(path) - 1:\r\n break\r\n if path[pos] == instructions[i]:\r\n pos += 1\r\n return pos + 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n path = input()\r\n instructions = input()\r\n print(getPosition(path, instructions))\r\n", "def solve():\r\n s = str(input())\r\n t = str(input())\r\n j = 0\r\n count = 1\r\n for i in range(len(t)):\r\n if t[i]==s[j]:\r\n count+=1\r\n j+=1\r\n print(count)\r\n \r\n \r\nif __name__ == '__main__':\r\n solve()\r\n", "s=input()\r\nt=input()\r\ncount=0\r\nfor i in range(len(t)):\r\n if s[count]==t[i] and count+1<=len(s)-1:\r\n count+=1\r\nprint(count+1)", "s = input()\nt = input()\n\nsPtr, tPtr = 0,0\nwhile sPtr < len(s) and tPtr < len(t):\n if s[sPtr] == t[tPtr]:\n sPtr += 1\n tPtr += 1\nprint(sPtr+1)", "n=input()\r\ns=input()\r\nflag=0\r\nfor i in s:\r\n\tif n[flag]==i:\r\n\t\tflag+=1\r\n\r\nprint(flag+1)", "sequence= input()\r\ninstructions = input()\r\n\r\nindex =0\r\nfor i in range(len(instructions)):\r\n if sequence[index] == instructions[i]:\r\n index+=1\r\n\r\nprint(index+1)\r\n ", "s = str(input())\r\nt = str(input())\r\n \r\nl = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[l]:\r\n l += 1\r\nprint(l+1)", "s = input()\r\nt = input()\r\nposition = 1\r\nfor i in t:\r\n if i == s[position - 1]:\r\n position += 1\r\nprint(position)", "string=input()\r\ninst=input()\r\ncount=0\r\n\r\nfor i in (inst):\r\n if i==string[count]:\r\n count+=1\r\n\r\nprint(count+1)", "s=input()\r\ns2=input()\r\nc=0\r\nfor i in s2:\r\n if i==s[c]:\r\n c+=1\r\nprint(c+1) ", "s=input()\r\nt=input()\r\nlizz=1\r\np=0\r\nfor i in range(len(t)):\r\n if s[p]==t[i]:\r\n lizz+=1\r\n p+=1\r\nprint(lizz)\r\n \r\n ", "import sys\r\nfrom collections import deque\r\ndef rs(): return sys.stdin.readline().rstrip()\r\ndef ri(): return int(sys.stdin.readline())\r\ndef ria(): return deque(map(int, sys.stdin.readline().split()))\r\ndef ws(s): sys.stdout.write(s)\r\ndef wi(n): sys.stdout.write(str(n) + '\\n')\r\ndef wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + ' ')\r\n #--------------------Solution------------------------\r\ns=rs()\r\nm=rs()\r\nj=0\r\nfor i in range(len(m)):\r\n if s[j]==m[i]:\r\n j+=1\r\nwi(j+1)", "q=input()\r\nw=input()\r\ne=0\r\nfor t in range(len(w)):\r\n if w[t]==q[e]:\r\n e+=1\r\nprint(e+1)", "s = input()\r\nins = input()\r\n\r\n\r\ndef check(s, ins):\r\n p = 0\r\n for i in range(len(ins)):\r\n\r\n if ins[i] == s[p]:\r\n p += 1\r\n\r\n return p+1\r\n\r\n\r\nprint(check(s, ins))\r\n", "s=input() \r\nt=input()\r\nn=len(t)\r\ni=0\r\nj=0\r\nwhile(1):\r\n if(s[i]==t[j]):\r\n i+=1 \r\n j+=1 \r\n else:\r\n j+=1 \r\n if(j>=n):\r\n break \r\nprint(i+1) ", "s = input()\r\nt = input()\r\n\r\nn=0\r\nfor i in range(len(t)):\r\n if(t[i] == s[n]):\r\n n+=1\r\n\r\nprint(n+1)", "s = input().upper()\r\nt = input().upper()\r\n\r\nfinal = 0\r\n\r\nfor letter in t:\r\n if s[final] == letter:\r\n final += 1\r\n\r\nprint(final+1)\r\n", "s=list(input())\r\nt=list(input())\r\n\r\nc=1\r\nfor i in t:\r\n if i==s[c-1]:\r\n c+=1\r\nprint(c)", "s=input()\r\nw=input()\r\nl=1\r\nk=0\r\nfor i in range(len(w)):\r\n \r\n if w[i]==s[k]:\r\n \r\n l=l+1\r\n k=k+1\r\n \r\nprint(l)", "a=input()\r\nb=input()\r\ni=0\r\nj=0\r\nwhile(i<len(a) and j<len(b)):\r\n if(a[i]==b[j]):\r\n # print(i)\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(i+1)", "s1=input()\r\ns2=input()\r\nl1=list(map(str,s1))\r\nl2=list(map(str,s2))\r\ni=0\r\nc=0\r\nwhile i<len(l2):\r\n if l2[i]==l1[c]:\r\n i+=1\r\n c+=1\r\n else:\r\n i+=1\r\nprint(c+1)", "import sys\ninput = sys.stdin.readline\n\ns1 = input().rstrip()\ns2 = input().rstrip()\n\ni = 0\n\nfor c in s2:\n if c == s1[i]:\n i += 1\n\nprint(i+1)\n", "s=input()\r\nt=input()\r\nz=len(t)\r\nc=0\r\nfor i in range(z):\r\n if s[c]==t[i]:\r\n c+=1\r\nprint(c+1)", "s = str(input())\r\n\r\nt = str(input())\r\n\r\na = 0\r\ni = 0\r\nfor j in t:\r\n if s[i] == j:\r\n i+=1\r\n a+=1\r\n\r\n\r\nprint(a+1)", "seq=list(input())\r\nins=list(input())\r\npos=0\r\nans=1\r\nfor i in ins:\r\n if seq[pos]==i:\r\n ans+=1\r\n pos+=1\r\nprint(ans) ", "s = input()\r\nt = input()\r\ni = 0\r\nfor a in t:\r\n if a == s[i]:\r\n i += 1\r\nprint(i+1)\r\n", "s=input()\r\nt=input()\r\np=1\r\nfor i in range(len(t)):\r\n if s[p-1]==t[i]:\r\n p+=1\r\nprint(p)", "n = input()\r\nm = input()\r\nj = 0\r\nfor i in m:\r\n if i == n[j]:\r\n j+=1\r\nprint(j+1)", "x = input()\r\ny = input()\r\ni = 1\r\ndef index (n):\r\n global i\r\n if (n == x[i-1]):\r\n i +=1\r\n\r\nfor z in range (len(y)):\r\n index(y[z])\r\n\r\nprint(i)", "str1 = list(map(str, input()))\r\nstr2 = list(map(str, input()))\r\npos = 1\r\nx = 0\r\nfor i in str2:\r\n\tif i == str1[x]:\r\n\t\tpos += 1\r\n\t\tx += 1\r\n\r\nprint(pos)", "s = input()\r\nt = input()\r\ni, j = 0, 0\r\nwhile(j < len(t)):\r\n if(s[i] == t[j]):\r\n i += 1\r\n j += 1\r\nprint(i + 1)", "string_S,string_T = input(),input()\r\ncount,index = 0,0\r\nfor i in range(len(string_T)):\r\n if string_T[i] == string_S[index]:\r\n count+=1 \r\n index+=1\r\nprint(count+1)", "# 265A\r\nsay1 = str(input())\r\nsay2 = str(input())\r\nsquirrelMove = 0\r\nfor i in range(len(say2)):\r\n if (say2[i] == say1[squirrelMove]):\r\n squirrelMove+=1 \r\nprint(squirrelMove+1)", "s = input()\r\nt = input()\r\n\r\nposition = 0\r\nfor char in t:\r\n if char == s[position]:\r\n position+=1\r\n\r\nprint(position+1)\r\n", "s = input()\r\nt = input()\r\nsi =0\r\ncnt = 1\r\nco_s = 0\r\nco_t = 0\r\nwhile(si < len(t)):\r\n if (s[co_s] == t[co_t]):\r\n cnt += 1\r\n co_s += 1\r\n co_t += 1\r\n else:\r\n co_t +=1\r\n si +=1\r\nprint(cnt)", "a = input()\r\nb = input()\r\npos = 0\r\nfor i in b:\r\n if a[pos] == i: pos += 1\r\nprint (pos + 1)", "a = input()\r\nb = input()\r\nposition = 0\r\nfor i in b:\r\n if i == a[position]:\r\n position+=1\r\nprint(position+1)\r\n", "S = input()\nT = input()\nCurrIndx = 0\nfor i in range(len(T)):\n if T[i] == S[CurrIndx]:\n CurrIndx += 1\nCurrIndx += 1\nprint(CurrIndx)\n \t \t \t\t\t \t\t \t\t \t \t\t \t\t\t", "# import math\r\ndef main():\r\n\ts =str(input())\r\n\tt = str(input())\r\n\ti = 0\r\n\tj = 0\r\n\twhile j<len(t):\r\n\t\tif s[i]==t[j]:\r\n\t\t\ti+=1\r\n\t\tj+=1\r\n\tprint(i+1)\r\n\t\t\r\n\r\n\r\nmain()", "one = input()\r\ntwo = input()\r\nposition = 1\r\nfor i in two:\r\n if i == one[position-1]:\r\n position += 1\r\nprint(position)\r\n", "stones, ins = input(), input()\r\n\r\nj = 0\r\nfor i in range(len(ins)):\r\n if stones[j] == ins[i]:\r\n j += 1\r\nprint(j+1)", "s = input()\r\nb = input()\r\npos = 0\r\nfor i in range(0,len(b)):\r\n if b[i]==s[pos]:\r\n pos+=1\r\nprint(pos+1)", "s1, s2 = input(), input()\r\nj = 0\r\nfor i in s2:\r\n if j < len(s1) - 1 and i == s1[j]:\r\n j += 1\r\nprint(j + 1)\r\n", "ans=1\r\ns=input()\r\nr=input()\r\nfor i in r:\r\n if i==s[ans-1]:\r\n ans+=1\r\nprint(ans)", "x = input()\ny =[i for i in input()]\ncounter =0\nfor i in y:\n\tif x[counter]==i:\n\t\tcounter+=1\nprint(counter+1)\n\n", "q = input(); w = input()\r\nwa = 0 \r\nfor i in range(len(w)):\r\n if w[i] == q[wa] :\r\n wa +=1\r\nprint(wa+1)", "stones = input()\ncommands = input()\n\nstone_num = 1\n\n\nfor i in commands:\n if i == stones[stone_num - 1]:\n stone_num += 1\n\nprint(stone_num)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 23 04:59:40 2023\r\n\r\n@author: RadmediX\r\n\"\"\"\r\n\r\nstones = input()\r\ninstructions = input()\r\npos = 0\r\nfor inst in instructions:\r\n pos += 1 if inst == stones[pos] else 0\r\n \r\nprint(pos+1)\r\n ", "s=input()\r\nt=input()\r\ni=0\r\nj=0\r\nwhile j<len(s) and i<len(t):\r\n for i in range(len(t)):\r\n if t[i]==s[j]:\r\n j+=1\r\n if i==len(t)-1:\r\n break\r\nprint(j+1)", "s = input().strip()\r\nt = input().strip()\r\ncurrent_stone = 1\r\nfor c in t:\r\n if s[current_stone-1] == c:\r\n current_stone += 1\r\nprint(current_stone)\r\n", "s = list(input())\r\nt = list(input())\r\ni = 0\r\nfor x in t:\r\n if x==s[i]:\r\n i+=1\r\nprint(i+1)", "s = str(input()) \r\nt = str(input())\r\nres,j = 0,0\r\nfor i in range(len(t)):\r\n if s[j] == t[i] :\r\n res+=1\r\n j+=1\r\n \r\n \r\nprint(res+1)", "a = input()\r\nq = input()\r\ns = 0\r\nfor i in q:\r\n if i == a[s]:\r\n s += 1\r\nprint(s + 1)\r\n", "from sys import stdin, stdout\r\n\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\ndef get_string(): return stdin.readline().strip()\r\n\r\ndef solve():\r\n s = get_string()\r\n k = get_string()\r\n ans = 0\r\n for c in k:\r\n if c==s[ans]:\r\n ans+=1\r\n stdout.write(str(ans+1)+\"\\n\")\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n ", "s1 = input()\r\nt = input()\r\ns = list(s1)\r\ncount = 0\r\nfor letter in t:\r\n if letter == s[0]:\r\n del s[0]\r\n count += 1\r\n \r\n else:\r\n pass\r\n\r\nprint(count+1)", "s = list(input())\r\nt = list(input())\r\nposition = 1\r\nk = 0\r\nfor i in range(len(t)):\r\n if s[k] == t[i]:\r\n k+=1\r\n position +=1\r\n\r\nprint(position)", "s = input()\nt = input()\nposition = 0\n\nfor i in t:\n if i == s[position]:\n position += 1\n\nprint(position + 1)", "try:\r\n \r\n \r\n f=input()\r\n s=input()\r\n i=0\r\n j=0\r\n count=0\r\n while(i!=len(s)):\r\n if(s[i]==f[j]):\r\n i=i+1\r\n j=j+1\r\n count=count+1\r\n \r\n else:\r\n i=i+1\r\n \r\n \r\n \r\n print(count+1) \r\n \r\n\r\n \r\nexcept:\r\n pass\r\n", "stones = input()\r\ninstructions = input()\r\n\r\nposition = 0\r\nfor i in range(len(instructions)):\r\n if stones[position] == instructions[i]:\r\n position += 1\r\n\r\nprint(position + 1)\r\n", "s = input()\r\nt = input()\r\nc = 0\r\nl = 0\r\nfor i in t:\r\n l = l + 1\r\n\r\nfor i in range(l):\r\n if s[c] == t[i]:\r\n c = c + 1\r\nprint(c+1)\r\n", "s=input()\r\nt=input()\r\ns1=[i for i in s]\r\ns2=[j for j in t]\r\ncount=0\r\ni=0\r\nfor k in range(len(s2)):\r\n if s2[k]==s1[i]:\r\n i+=1\r\n count+=1\r\nprint(count+1)\r\n", "s = input()\r\nt = input()\r\ni = 0\r\nj = 0\r\nwhile(j < len(t)):\r\n if(s[i] == t[j]):\r\n i+= 1\r\n j += 1\r\nprint(i + 1)\r\n", "text = input()\r\nins = input()\r\n\r\ni = 0\r\nj = 0\r\nwhile True:\r\n\twhile j < len(ins):\r\n\t\tif ins[j] == text[i]:\r\n\t\t\ti += 1\r\n\t\t\tj += 1\r\n\t\t\tbreak\r\n\t\tj+=1\r\n\t\t\r\n\tif j == len(ins):\r\n\t\tbreak\r\n\t\r\nprint(i+1)\r\n\r\n", "stones = list(input())\r\ninstructions = list(input())\r\ncurrent = stones[0]\r\nposition = 1\r\nfor i in range(len(instructions)):\r\n if instructions[i] == current:\r\n current = stones[position]\r\n position += 1\r\n \r\nprint(position)", "from sys import stdin\r\nstr1 = stdin.readline().strip()\r\nstr2 = stdin.readline().strip()\r\npositionL = 1\r\nposition = 0\r\nfor i in str1:\r\n while position < len(str2):\r\n if i == str2[position]:\r\n positionL += 1\r\n position += 1\r\n break\r\n position += 1\r\nprint(positionL)", "s=input()\r\nt=input()\r\nj=0\r\nfor i in t:\r\n if(s[j]==i):\r\n j+=1\r\nprint(j+1)", "stones = input()\r\nins = input()\r\n\r\ndef main(stones, ins):\r\n res = 0\r\n for i in range(len(ins)):\r\n if res+1 == len(stones):\r\n return res+1\r\n if stones[res] == ins[i]:\r\n res += 1\r\n return res + 1\r\n\r\nprint(main(stones, ins))", "s = input()\r\nt = input()\r\nn = 0\r\nx = 1\r\n\r\nfor i in t:\r\n if i == s[n]:\r\n x +=1\r\n n +=1\r\nprint (x)", "l1,l2=input(),input()\r\nc=0\r\nfor i in range(len(l2)):\r\n\tif l2[i]==l1[c]:\r\n\t\tc+=1\r\nprint(c+1)", "s = input()\r\nt = input()\r\npos = 1\r\nfor i in range(len(t)):\r\n if s[pos-1] == t[i]:\r\n pos+=1\r\nprint(pos)\r\n", "s=input()\r\nt=input()\r\nk=0\r\nfor i in t:\r\n if i==s[k]:\r\n k=k+1\r\n\r\nprint(k+1)\r\n\r\n", "a = str(input())\r\nb = str(input())\r\ncount = 0\r\nfor c in b:\r\n if a[count] == c:\r\n count += 1\r\nprint(count+1)", "s1 = input()\r\ns2 = input()\r\nans = 1\r\n#i = 0\r\ncurr = 0\r\n\r\n#while i < len(s2):\r\n\r\nfor i in range(len(s2)):\r\n if s2[i] == s1[curr]:\r\n ans += 1\r\n curr += 1\r\n\r\nprint(ans)", "def move(string,instructions):\r\n position = 0\r\n for i in instructions:\r\n if string[position] == i:\r\n position+=1\r\n\r\n return position+1\r\n#listOfInputs = input().split()\r\nstring = str(input())\r\ninstructions = str(input())\r\nprint(move(string,instructions))\r\n", "s=input()\r\nt=input()\r\nans=0\r\nfor i in t:\r\n if i==s[ans]:\r\n ans+=1\r\nprint(ans+1)", "st = list(input())\r\ninst = list(input())\r\nposition = 0\r\nfor i in inst:\r\n if(st[position] == i):\r\n position += 1\r\nlastPosition = position + 1\r\nprint(lastPosition)", "inp = input()\r\ninstr = input()\r\nsteps = 0\r\n\r\nfor i in instr:\r\n if i == inp[steps] :\r\n steps += 1\r\n\r\nprint(steps + 1)", "s =str(input())\r\nins =str(input())\r\n\r\nliss=0\r\nfor i in range(len(ins)):\r\n if(ins[i] == s[liss]):\r\n liss=liss+1\r\n \r\n\r\nprint(liss+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jul 23 11:48:49 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 19 - CF265-DIV2A\r\n\"\"\"\r\nstones = str(input())\r\ninst = str(input())\r\npos = 1\r\nfor i in range(len(inst)):\r\n if inst[i] == stones[pos-1]:\r\n pos += 1\r\nprint(pos)\r\n\r\n", "a,b=(list(input()) for i in range(2))\r\nz=0\r\nfor i in b:\r\n if i==a[z]: z+=1\r\nprint(z+1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jun 19 23:49:49 2020\r\n\r\n@author: ElAhwel\r\n\"\"\"\r\n\r\n\r\nS = input()\r\nT = input()\r\n\r\nstep = 0\r\n\r\nfor i in T:\r\n if i == S[step]:\r\n step +=1\r\n \r\nprint(step+1)", "s = input()\r\nt = input()\r\nc = 0\r\nfor i in t:\r\n if i == s[c]:\r\n c += 1\r\nprint(c+1)", "a=input().strip()\r\n\r\nb=input().strip()\r\n\r\nk=1\r\n\r\nfor i in range(len(b)):\r\n if(b[i]==a[k-1]):\r\n k+=1\r\n else:\r\n pass\r\n\r\nprint(k)", "s=input()\r\nith=input()\r\nres=0\r\nc=0\r\nfor x in ith :\r\n if x==s[c]:\r\n res+=1\r\n c+=1\r\nprint(res+1)", "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\nfirst = insr()\r\nsecond = insr()\r\n\r\nstep = 0\r\nfor i in range(len(second)):\r\n if second[i] == first[step]:\r\n step += 1\r\n\r\nprint(step + 1)\r\n\r\n", "s = input()\r\nt =input()\r\nnowi=1\r\nfor i in range(len(t)):\r\n if t[i]==s[nowi-1]:\r\n nowi+=1\r\nprint(nowi)\r\n\r\n", "s=input()\r\nt=input()\r\n\r\ns=list(s)\r\nt=list(t)\r\n\r\nstep=0\r\ntind=0\r\nsind=0\r\nwhile tind<len(t):\r\n \r\n if t[tind]==s[sind]:\r\n step+=1\r\n sind+=1\r\n tind+=1\r\nprint(step+1)\r\n ", "s=input()\r\ni=input()\r\nc=0\r\nfor j in range(len(i)):\r\n if(s[c]==i[j]):\r\n c+=1\r\nprint(c+1) ", "s = input()\r\nt = input()\r\ncurrentP = 0\r\nfor i in range(len(t)):\r\n if s [currentP] == t [i]:\r\n currentP +=1\r\nprint(currentP+1)", "s1 = list(input())\r\ns2 = list(input())\r\n\r\nc = 0\r\nposition = 0\r\n\r\nfor i in range(0, len(s2)):\r\n \r\n for x in range(position, len(s1)):\r\n if(s2[i] != s1[x]):\r\n \r\n break\r\n \r\n elif(s2[i] == s1[x]):\r\n position = position + 1\r\n \r\n break\r\n\r\nprint(position + 1)\r\n", "s1 = input()\r\ns2 = input()\r\nres = 0\r\nfor i in s2:\r\n if (s1[res] == i):\r\n res += 1\r\nprint(res + 1)\r\n", "s = input()\r\nt = input()\r\nposition = 1\r\nfor i in t:\r\n if s[position-1]==i:\r\n position += 1\r\nprint(position)", "# tc = int(input())\r\nfor i in range(1):\r\n # n = int(input())\r\n # li0 =list(map(int,input().split()))\r\n s1 = input()\r\n s2 = input()\r\n ans = 0\r\n i = 0\r\n j = 0\r\n while(i<len(s1) and j<len(s2)):\r\n if s1[i] == s2[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1 \r\n \r\n\r\n\r\n print(i+1)", "import sys\r\nimport heapq\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n ar = list(input())\r\n arr = list(input())\r\n ans = 1\r\n for c in arr:\r\n if(c == ar[ans-1]):\r\n ans += 1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "a = input()\r\nb = input()\r\nl = 0\r\nfor i in range(len(b)):\r\n\tif a[l]==b[i]:\r\n\t\tl+=1\r\n\r\nprint(l+1)", "s=input()\r\na=list(s)\r\nt=input()\r\nb=list(t)\r\ng=0\r\nfor i in range(len(b)):\r\n if a[g]==b[i]:\r\n g+=1\r\nprint(g+1)\r\n", "sto = input()\r\nins = input()\r\n\r\npos = 0\r\n\r\nfor i in range(0, len(ins)):\r\n if sto[pos] == ins[i]:\r\n pos += 1\r\n\r\nprint(pos + 1)", "# https://codeforces.com/contest/265/problem/A\n\ns = str(input())\nt = str(input())\n\ncount = 0\nl, h = 0, 0\nwhile h < len(t):\n if s[l] == t[h]:\n count += 1\n l += 1\n h += 1\n else:\n h += 1\n\nprint(count+1)\n", "def sol(xs, ys):\r\n plen = len(xs)\r\n for y in ys:\r\n head, *tail =xs\r\n if y == head:\r\n xs = tail\r\n return plen - len(xs) + 1\r\n\r\n# xs = \"RRRBGBRBBB\"\r\n# ys = \"BBBRR\"\r\n# xs = \"RGB\"\r\n# ys = \"RRR\"\r\n#\r\n# xs = \"BRRBGBRGRBGRGRRGGBGBGBRGBRGRGGGRBRRRBRBBBGRRRGGBBB\"\r\n# ys = \"BBRBGGRGRGBBBRBGRBRBBBBRBRRRBGBBGBBRRBBGGRBRRBRGRB\"\r\n#\r\n# print(sol(xs, ys))\r\n\r\nif __name__ == '__main__':\r\n xs = input()\r\n ys = input()\r\n print(sol(xs, ys))\r\n", "s = input()\ni = 0\nt = input()\nfor x in t:\n if x == s[i]:\n i += 1\nprint(i + 1)", "if __name__ == \"__main__\":\r\n s = input()\r\n t = input()\r\n\r\n si = 0\r\n for ti in range(len(t)):\r\n si += 1 if s[si] == t[ti] else 0\r\n\r\n print(si + 1)\r\n", "s = input()\r\nt = input()\r\nm = 0\r\nfor i in range(len(t)):\r\n\r\n if t[i]==s[m]:\r\n m=m+1\r\n\r\nprint(m+1)\r\n", "def final_position(s, t):\r\n position = 1\r\n for instruction in t:\r\n if s[position - 1] == instruction: \r\n position += 1\r\n return position\r\ns = input()\r\nt = input()\r\nfinal_pos = final_position(s, t)\r\nprint(final_pos)", "s = input()\nt = input()\n\ni = j = 0\nwhile j < len(t):\n if s[i] == t[j]:\n i += 1\n j += 1\n\nprint(i + 1)\n", "t = str(input())\r\ns = str(input())\r\n\r\ncur_pos = 0\r\n\r\nfor each in s:\r\n if each == t[cur_pos]:\r\n cur_pos += 1\r\n \r\nprint(cur_pos + 1)", "a=input()\r\nb=input()\r\nk=0\r\nfor i in range(len(b)):\r\n if b[i]==a[k]:\r\n k+=1\r\nprint(k+1)\r\n", "def solve():\r\n a = input()\r\n b = input()\r\n c = 0\r\n for i in b:\r\n if a[c] == i:\r\n c += 1\r\n return c + 1\r\nprint(solve())", "s = list(input())\r\nc = list(input())\r\n\r\ncount = 1\r\n\r\np1 = 0\r\np2 = 0\r\n\r\nwhile p2 < len(c):\r\n if s[p1] == c[p2]:\r\n count += 1\r\n p1 += 1\r\n p2 += 1\r\n else:\r\n p2 += 1\r\n\r\nprint(count)", "s = input()\r\nt = input()\r\nind=0\r\nfor i in range(len(t)):\r\n if s[ind]==t[i]:\r\n ind+=1\r\nprint(ind+1)\r\n", "s = input()\r\nt = input()\r\ncnt = 0\r\ni = 0\r\nfor k in t:\r\n if s[i] == k:\r\n i+=1\r\nprint(i+1)", "Move_colorfulStones = input().upper()\r\nt = input().upper()\r\nif (len(Move_colorfulStones) >= 1 and len(Move_colorfulStones) <=50) and (len(t) >= 1 and len(t) <=50):\r\n ans = 0\r\n for i in range(len(t)):\r\n if t[i] == Move_colorfulStones[ans]:\r\n ans += 1\r\n print(ans +1)\r\nelse:\r\n print('Error: The first line must contain the string s (1 ≤ |s| ≤ 50). The second line must contain the string t (1 ≤ |t| ≤ 50). The characters of each string will be one of \"R\", \"G\", or \"B\".')", "stones = input()\r\ninstructions = input()\r\nfinal_pos = 1\r\nfor i in instructions:\r\n if stones[final_pos-1] == i:\r\n final_pos+=1\r\nprint(final_pos)", "s1 = input()\r\ns2 = input()\r\ni = 0\r\nfor j in range(len(s2)):\r\n\tif s2[j] == s1[i]:\r\n\t\ti+=1\r\nprint( i+1)\r\n\t\r\n", "s = input()\r\ns1 = input()\r\ni = 0\r\nj = 0\r\nwhile(j < len(s1)):\r\n if(s[i] == s1[j]):\r\n i = i+1\r\n j = j+1\r\n else:\r\n j = j+1\r\nprint(i+1)", "def solve(s:str, t:str) -> int:\r\n e=0\r\n for i in range(len(t)):\r\n if t[i]==s[e]:\r\n e+=1\r\n return e+1\r\n \r\ns=input()\r\nt=input()\r\nprint(solve(s,t))", "def solve():\n \n first = input()\n second = input()\n\n pos = 0\n\n for i in second:\n if i == first[pos]:\n pos += 1\n\n print(pos + 1)\n\n#t = int(input())\nt = 1\nwhile t:\n solve()\n t -= 1\n", "s=input()\r\nn=input()\r\nb=0\r\na=s[b]\r\nfor i in n :\r\n if i is a :\r\n b+=1\r\n a=s[b]\r\nprint (b+1)\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n base = input().rstrip()\r\n ins = input().rstrip()\r\n i = 0\r\n pos_ = 0\r\n last_ = len(ins)\r\n step = base[pos_]\r\n while i < last_:\r\n if ins[i] == step:\r\n pos_ += 1\r\n step = base[pos_]\r\n i += 1\r\n output(str(pos_ + 1))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = input()\r\nt = input()\r\n\r\nindex = 0\r\n\r\nfor i in range(len(t)):\r\n\tif t[i] == s[index]:\r\n\t\tindex += 1\r\n\r\nprint(index + 1)\r\n", "s = input()\r\nt = input()\r\nr = 0\r\nfor i in range(len(t)):\r\n if s[r] == t[i]:\r\n r += 1\r\nprint(r + 1)", "s=input()\r\nt= input()\r\nstep=0\r\n\r\nfor i in range(len(t)) :\r\n if t[i] == s[step] :\r\n step+=1\r\n\r\nprint(step+1)", "a = input()\r\nb = input()\r\nc = 0\r\nfor i in b:\r\n if i == a[c]:\r\n c += 1\r\nprint(c + 1)\r\n", "a = input()\r\nb = input()\r\ncount = 0\r\nfor i in b:\r\n if i == a[count]:\r\n count += 1\r\nprint(count+1)\r\n", "Way = input()\r\nInst = input()\r\nNumOfInst = len(Inst)\r\nCurrentLocation = 0\r\nfor i in range (0,NumOfInst):\r\n if Inst[i] == Way[CurrentLocation]:\r\n CurrentLocation += 1\r\nprint(CurrentLocation+1) ", "s = list(input())\r\nc = 1\r\nfor i in input():\r\n if i == s[0]:\r\n c += 1\r\n s.pop(0)\r\nprint(c)", "one, two, i = input(), input(), 0\r\nfor c in two:\r\n if one[i] == c: \r\n i += 1\r\nprint(i+1)", "s= input()\r\ns2= input()\r\ni = 0\r\nste = 1\r\nfor c in s2:\r\n if c == s[i]:\r\n i = i + 1\r\n ste = ste + 1\r\n\r\nprint(ste)", "cl=input()\r\nc=input()\r\ni=0\r\nj=0\r\nwhile (j <len(c) ):\r\n if (cl[i]==c[j]):\r\n i=i+1\r\n j=j+1\r\nprint(i+1)\r\n\r\n", "s = input()\r\nt = input()\r\ncount = 0\r\ni = 0\r\nj = 0\r\nwhile i<len(t):\r\n if t[i]==s[j]:\r\n i+=1\r\n j+=1\r\n count+=1\r\n else:\r\n i+=1\r\nprint(count+1)\r\n\r\n ", "from sys import stdin,stdout\r\n\r\nst=lambda:list(stdin.readline().strip())\r\nli=lambda:list(map(int,stdin.readline().split()))\r\nmp=lambda:map(int,stdin.readline().split())\r\ninp=lambda:int(stdin.readline())\r\npr=lambda n: stdout.write(str(n)+\"\\n\")\r\n\r\nmod=1000000007\r\nINF= float('inf')\r\ndef solve():\r\n s=st()\r\n t=st()\r\n i=0\r\n j=0\r\n while j<len(t):\r\n i+=(t[j]==s[i])\r\n j+=1\r\n pr(i+1)\r\n \r\nfor _ in range(1):\r\n solve()\r\n", "stones=input()\r\ninstructions=input()\r\npos=0\r\nfor i in instructions:\r\n if i == stones[pos]:\r\n pos+=1\r\nprint(pos+1)", "colors = input()\r\ninsructions = input()\r\ncounter = 0\r\nfor i in insructions:\r\n if i == colors[counter]:\r\n counter += 1\r\n\r\n\r\nprint(counter + 1)\r\n", "rocks = input()\npos_rock = 0\nfor c in input():\n if c == rocks[pos_rock]:\n pos_rock += 1\nprint(pos_rock+1)\n", "plane=input()\r\nplane1=[]\r\nfor i in plane:\r\n\tplane1.append(i)\r\n\t\r\n\r\ninst=input()\r\ninst1=[]\r\nfor i in inst:\r\n\tinst1.append(i)\r\ni=0\r\n\r\nfor a in inst1:\r\n\tif a==plane1[i]:\r\n\t\t\r\n\t\ti+=1\r\nif i==len(plane1):\r\n\tprint(i)\r\nelse:\r\n\tprint(i+1)\r\n\t\t\r\n\t\r\n\t\r\n", "liss = input()\ninstructions = input()\nmoves = 1\ni = 0\nfor elem in instructions:\n if elem is liss[i]:\n i += 1\n moves += 1\nprint(moves)\n \t \t\t\t\t\t \t \t\t \t \t", "s = input()\r\nt = input()\r\n\r\nmoves = 0\r\n\r\nfor i in t:\r\n if i == s[moves]:\r\n moves += 1\r\n\r\nprint(moves + 1)", "s = input()\r\nt = input()\r\n\r\nans = 1\r\nfor i in range(len(t)):\r\n if s[ans-1] == t[i]:\r\n ans += 1\r\n\r\nprint(ans)", "v=input()\r\np=input()\r\nb=len(p)\r\nd=0\r\nfor a in range(b):\r\n if v[d]==p[a]:\r\n d+=1\r\n \r\nprint(d+1)", "# t = int(input())\nt = 1\n# # n, m = map(int, input().split())\n# # a = list(map(int, input().split()))\n# # a.sort()\nimport math\nfrom collections import Counter\nimport random\n\nwhile t != 0:\n s1 = input()\n s2 = input()\n flag = False\n i = 0\n j = 0\n while flag == False:\n if j == len(s2) - 1:\n flag = True\n\n if s2[j] == s1[i]:\n i += 1\n j += 1\n else:\n j += 1\n\n print(i + 1)\n t -= 1\n", "seq = input()\ninstructions = input()\nloc = 0 \nfor instruction in instructions :\n if instruction == seq[loc]:\n loc +=1\nprint(loc+1)", "colors = input()\r\ninstructions = input()\r\n\r\npos = 0\r\n\r\nfor i in range(len(instructions)):\r\n if colors[pos] == instructions[i]:\r\n pos += 1\r\n \r\nprint(pos + 1) ", "x=input()\r\nz=input()\r\npos=0\r\nfor i in z:\r\n if i==x[pos]:\r\n pos+=1\r\n\r\nprint(pos+1) \r\n", "x = input()\r\ny = input()\r\ncounter = 0\r\nfor i in y :\r\n if i == x[counter] :\r\n counter = counter + 1\r\nprint(counter + 1)\r\n", "s = input()\r\nc = input()\r\npos = 0\r\n\r\nfor i in range(0,len(c)):\r\n if s[pos] == c[i]:\r\n pos += 1\r\n pass\r\n else:\r\n pos += 0\r\nprint(pos + 1)\r\n", "colors = input()\r\nseq = input()\r\ni = 0\r\nj = 0\r\nsum = 1\r\ns_len = len(seq)\r\nwhile s_len!=0:\r\n if colors[i] == seq[j]:\r\n i+=1\r\n j+=1\r\n sum +=1\r\n s_len-=1\r\n else:\r\n j +=1\r\n s_len -= 1\r\nprint(sum)", "s = input() \r\nt = input() \r\nj = 0\r\nc = 1\r\nfor i in range(len(t)):\r\n if s[j] == t[i]:\r\n j += 1 \r\n c += 1\r\nprint(c)\r\n ", "s=input()\r\nt=input()\r\ncount=1\r\ni=0\r\nfor j in t:\r\n if j==s[i]:\r\n count+=1\r\n i+=1\r\nprint(count)", "s = input()\r\nt = input()\r\n\r\ntmp = list(s)\r\nt = list(t)\r\npos = 0\r\nj = 0\r\nfor i in range(len(t)):\r\n if s[j] == t[i]:\r\n j += 1\r\n pos += 1\r\n\r\nprint(pos+1)\r\n", "q = input()\r\nw = input()\r\ne = 0\r\nfor i in range(len(w)):\r\n if w[i] == q[e]:\r\n e += 1\r\nprint(e + 1)", "s=list(input())\r\nt=list(input())\r\n\r\nc=1\r\n\r\ni=0\r\nwhile True:\r\n for j in range(len(t)):\r\n if s[i]==t[j]:\r\n c+=1\r\n i+=1\r\n \r\n break\r\n \r\nprint(c)", "#liss skipping stones\r\nlist1=[]\r\nlist1.append(input().strip().upper())\r\nlist1.append(input().strip().upper())\r\nn=1\r\nfor i in list1[1]:\r\n if i==list1[0][n-1]:\r\n n+=1\r\nprint(n)\r\n", "# This is a sample Python script.\r\n\r\ns = input()\r\nt = input()\r\nans = 0\r\nfor i in range(len(t)):\r\n if s[ans] == t[i]:\r\n ans+=1\r\n\r\nprint (ans+1)", "s,i=input(),0\r\nt=input()\r\nfor x in t:\r\n if x==s[i]:\r\n i+=1\r\nprint(i+1)", "import sys\r\nstring1 = sys.stdin.readline()\r\nstring2 = sys.stdin.readline()\r\npos = 0\r\nfor i in string2 :\r\n if i == string1[pos] :\r\n pos += 1\r\nprint(pos+1)", "s = input()\r\nt = input()\r\n\r\nliss_pos = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[liss_pos]:\r\n liss_pos += 1\r\n \r\nprint(liss_pos + 1)\r\n", "s = input()\r\nc = input()\r\nlisa = 1\r\nj = 0\r\n\r\nfor i in range(len(c)):\r\n if s[j] == c[i]:\r\n lisa+=1\r\n j+=1\r\nprint(lisa)", "stones = input()\r\ninstructions = input()\r\n\r\nans = 1\r\nfor move in instructions:\r\n if(move == stones[ans-1]):\r\n ans += 1\r\n\r\nprint(ans)", "s=input()\r\nt=input()\r\nk=1\r\nn=0\r\nfor i in range(len(t)):\r\n if (n)>len(s):\r\n break\r\n if s[n]==t[i]:\r\n n+=1\r\n k+=1\r\n\r\nprint(k)\r\n", "s1=input()\r\ns2=input()\r\nj=0\r\nfor i in s2:\r\n if(i==s1[j]):\r\n j+=1\r\nprint (j+1)", "\r\na=input()\r\nb=input()\r\nc=0\r\nfor i in range(len(b)):\r\n if b[i]==a[c]:\r\n c+=1\r\nprint(c+1)", "s=input()\r\nt=input()\r\ni=0\r\nfor j in t:\r\n if(j==s[i]):\r\n i+=1\r\nprint(i+1)", "s = input()\r\nt = input()\r\nresult = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[result]:\r\n result += 1\r\nprint(result+1)\r\n", "road = input()\r\ninstruction = input()\r\n\r\ni, j = 0, 0\r\nwhile i < len(road) and j < len(instruction):\r\n if road[i] == instruction[j]: i += 1\r\n j += 1\r\nprint(i+1)", "#!/usr/bin/python3\r\n\r\n\r\ndef main():\r\n\r\n colors = input()\r\n pos = 0\r\n\r\n for instruc in input():\r\n if instruc == colors[pos]:\r\n pos += 1\r\n print(pos+1)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "s = input()\r\nt = input()\r\n \r\ndef based_position(s,t):\r\n position =0 \r\n for i in range(len(t)) :\r\n if t[i] ==s[position] :\r\n position =position +1\r\n \r\n print(position +1)\r\nbased_position(s,t)", "a, b = input(), input()\r\nans = 0\r\nfor i in b:\r\n\tif a[ans] == i:\r\n\t\tans += 1\r\nprint(ans + 1)", "a, b = list(input() for i in range(2))\r\nz = 0\r\nfor i in b:\r\n if i == a[z]:\r\n z += 1\r\nprint(z+1)\r\n", "\n\n\n\n# Press the green button in the gutter to run the script.\nfrom builtins import input\n\nif __name__ == '__main__':\n stones = input()\n inst = input()\n counter = 0\n\n for i in range(len(inst)):\n if (inst[i] == stones[counter]):\n counter+=1\n\n if (counter == len(inst)):\n break\n print( counter +1)\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "def answer():\r\n a = list(input())\r\n b = list(input())\r\n i=0\r\n targ = a[0]\r\n j=0\r\n while i<len(b):\r\n if targ==b[i]:\r\n j+=1\r\n targ=a[j]\r\n else:\r\n pass\r\n i+=1\r\n print(j+1)\r\nanswer()", "s=input()\r\ns1=input()\r\nk=0\r\nfor i in s1:\r\n if s[k]==i:\r\n k+=1\r\nprint(k+1)\r\n", "stones, instructions = input(), input()\r\ninstruction_reader_index = -1\r\nfor stone_position, stone_color in enumerate(stones, 1):\r\n try:\r\n while not instructions[(instruction_reader_index := instruction_reader_index + 1)] == stone_color:\r\n pass\r\n except IndexError:\r\n print(stone_position)\r\n exit()", "s=input()\r\nk=input()\r\nj=0\r\nfor i in range(0,len(k)):\r\n if k[i]==s[j]:\r\n j+=1\r\nprint(j+1)\r\n", "s=input()\r\nt=input()\r\na=0\r\nb=0\r\nwhile a<len(t):\r\n\tif t[a]==s[b]:\r\n\t\tb=b+1\r\n\ta=a+1\r\nprint(b+1)", "x=input()\r\ny=input()\r\nc=1\r\nfor i in range(len(x)):\r\n\r\n if x[i] in y:\r\n n=y.find(x[i])\r\n y=y[n+1:]\r\n c+=1\r\n \r\n else:\r\n break\r\nprint(c)", "i =0\r\nj = 0\r\nx = input()\r\ny = input()\r\nwhile j < len(y):\r\n if x[i] == y[j]:\r\n i+=1\r\n j+=1\r\n else:\r\n j+=1\r\nprint(i+1)", "colors = input()\r\ninstructions = input()\r\nz = len(instructions)\r\nc = 0\r\nfor i in range(z):\r\n if colors[c] == instructions[i]:\r\n c += 1\r\n\r\nprint(c + 1)", "s = input()\r\ns1 = input()\r\ncnt = 0\r\nfor i in s1:\r\n if s[cnt] == i:\r\n cnt = cnt+1\r\nprint(cnt+1)\r\n ", "l=[x for x in input()]\r\nl1=[x for x in input()]\r\na=0\r\nc=0\r\nfor i in range(len(l1)):\r\n if(l1[i]==l[a]):\r\n a+=1\r\n c+=1\r\nprint(c+1) \r\n\r\n", "s1 = input()\r\ns2 = input()\r\npointer = 0\r\nfor i in range(len(s2)):\r\n if s2[i]==s1[pointer]:\r\n pointer+=1\r\nprint(pointer+1)\r\n", "main_string = input()\r\ninst_string = input()\r\ncount = 0\r\ni = 0\r\nwhile (i < len(inst_string)) and (count < len(main_string)):\r\n if inst_string[i] == main_string[count]:\r\n count += 1\r\n \r\n i += 1\r\n \r\nprint(count+1)", "s = input()\r\nt = input()\r\n\r\nposition = 1 # Starting position of Liss\r\n\r\nfor instruction in t:\r\n if instruction == s[position - 1]: # Check if the instruction matches the color of the stone\r\n position += 1\r\n\r\nprint(position)\r\n", "s=input()\r\nt=input()\r\nj=0\r\na=s[j]\r\nfor i in range(len(t)):\r\n if t[i]==a:\r\n j+=1\r\n a=s[j]\r\nprint(j+1)", "colors = input()\r\ninstructions = input()\r\ncount = 1\r\nx = 0\r\nfor i in instructions:\r\n if i==colors[x]:\r\n count+=1\r\n x+=1\r\nprint(count)", "p=1\r\na=input()\r\nb=input()\r\nfor i in b:\r\n if i==a[p-1]:\r\n p+=1\r\nprint(p)", "k1=input()\r\nk2=input()\r\nctr=0\r\nfor i in range(len(k2)):\r\n if k2[i]==k1[0]:\r\n ctr=ctr+1\r\n k1=k1[1:]\r\n\r\nprint(ctr+1)\r\n\r\n \r\n", "s = input()\nt = input()\ni, j = 0, 0\nwhile i<len(s) and j<len(t):\n if s[i]==t[j]:\n i += 1\n j += 1\nprint(i+1)\n", "m,n=[input() for i in '__']\ns=0\nfor i in n:\n if m[s:][0]==i:\n s+=1\nprint(s+1)\n", "s=input()\r\nc=input()\r\nm=0\r\nfor i in c:\r\n\tif s[m]==i:\r\n\t\tm+=1\r\nprint(m+1)\r\n \r\n", "s=input()\r\ni=0\r\nfor c in input(): \r\n i+=(s[i] == c)\r\nprint(i+1)", "x=input()\r\ny=input()\r\na=1 \r\nfor i in y:\r\n if i==x[(a-1)]:\r\n a+=1\r\nprint(a)\r\n \r\n", "x = 0\r\ns = input()\r\nt = input()\r\nfor i in t:\r\n if i == s[x]:\r\n x += 1\r\nprint(x+1)\r\n", "a = input()\r\nb = input()\r\nq = 0\r\nc = 0\r\nfor i in b:\r\n if i == a[q]:\r\n c+=1\r\n q+=1\r\nprint(c+1)", "s=input()\r\nt=input()\r\ni,j=0,0\r\nwhile i <len(t):\r\n if t[i]==s[j]:\r\n j+=1\r\n i+=1\r\nprint(j+1)", "s = input()\r\nt = input()\r\np=0\r\ncnt=0\r\ni=0\r\nu=0\r\nwhile(i<len(t)):\r\n if s[u]==t[p]:\r\n p+=1\r\n u+=1\r\n cnt+=1\r\n else:\r\n p+=1\r\n i+=1\r\nprint(cnt+1)", "\r\n\r\n\r\n\r\n\r\n\r\nH,P=input(),0\r\n\r\nfor M in input():P+=(M==H[P])\r\n\r\nprint(P+1)", "stones = str(input())\r\ninstructions = str(input())\r\n\r\nindex = 0\r\n\r\nfor i in instructions:\r\n if i == stones[index]:\r\n index += 1\r\n\r\nprint(index+1)\r\n", "a = list(input())\r\nb = list(input())\r\ni = 0\r\nj = 0\r\nwhile j < len(b):\r\n if a[i] == b[j]:\r\n i += 1\r\n j += 1\r\nprint(i+1)\r\n", "# import sys\r\n# sys.stdout = open('DSA/Stacks/output.txt', 'w')\r\n# sys.stdin = open('DSA/Stacks/input.txt', 'r')\r\n\r\n\r\nstones = list(input())\r\nc = list(input())\r\npoint = 0\r\nfor i in range(len(c)):\r\n if c[i]==stones[point]:\r\n point+=1\r\nprint(point+1)", "def dddd(s,l,c) :\r\n if s[0] == l[0] :\r\n s = s[1:]\r\n l = l[1:]\r\n c += 1\r\n elif s[0] != l[0] :\r\n l = l[1:]\r\n\r\n if l == \"\" :\r\n return c\r\n else :\r\n return dddd(s,l,c)\r\n \r\ns = input().strip()\r\nl = input().strip()\r\nc = 1\r\n\r\nprint(dddd(s,l,c))", "s=input()\r\nss=input()\r\ncount=0\r\nfor i in range(len(ss)):\r\n if s[count]==ss[i]:\r\n count+=1\r\nprint(count+1)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nt = input()\r\n\r\ncounter = 0\r\nfor i in t:\r\n if s[counter] == i:\r\n counter += 1\r\n\r\nprint(counter+1)", "s=input()\r\nt=input()\r\ni=0\r\nj=0\r\nwhile(i<len(t)):\r\n if(t[i]==s[j]):\r\n j=j+1\r\n i=i+1\r\n else:\r\n i=i+1\r\nprint(j+1)", "def solve(s,t):\n\t\n\tk=0\n\tpos = s[k]\n\tfor i in t :\n\t\tif i==pos :\n\t\t\tk+=1\n\t\t\tpos= s[k]\n\treturn k+1\n\t\t\n\n\t\n\t\n\n\t\t\n\n\t\n\n\nl3 = input()\n\n\nl4 = input()\n\n\t\n\n\n\n\nprint(solve(l3,l4))\n", "s=input()\r\nr=input()\r\np=0\r\nfor i in r:\r\n if i==s[p]:\r\n p=p+1\r\nprint(p+1)", "s=input()\r\nb=input()\r\nx=0\r\nfor i in b:\r\n if i==s[x]:\r\n x+=1\r\nprint(x+1)\r\n\r\n", "stones = list(input())\r\n\r\ncommands = list(input())\r\n\r\nj = 0\r\nfor i in commands:\r\n if j < len(stones) and i == stones[j]:\r\n j += 1\r\n \r\nprint(j + 1)", "s = str(input())\r\nt = str(input())\r\npos = 1\r\nj = 0\r\nfor i in range(len(t)):\r\n if s[j] == t[i]:\r\n pos += 1\r\n j += 1\r\nprint(pos)", "s = input()\r\nc = input()\r\ni = 0\r\nfor instruction in c:\r\n if (instruction == s[i]):\r\n i += 1\r\nprint(i+1)", "colour, instructions = input(), input()\r\n\r\nposition = 1\r\n\r\nfor i in instructions:\r\n if i == colour[position-1]:\r\n position += 1\r\n\r\nprint(position)", "# Wadea #\r\n\r\nn1 = str(input())\r\nn2 = str(input())\r\nlst1 = []\r\nlst2 = []\r\nlst1 += n1\r\nlst2 += n2\r\na = 0\r\nb = 0\r\nfor i in range(len(lst2)):\r\n if lst2[a] == lst1[b]:\r\n a += 1\r\n b += 1\r\n elif lst2[a] != lst1[b]:\r\n a += 1\r\n \r\nprint(b+1)\r\n", "\r\nif __name__ == \"__main__\":\r\n s = input()\r\n instructions = input()\r\n pos = 1\r\n for i in range(len(instructions)):\r\n if instructions[i] == s[pos - 1]:\r\n pos += 1\r\n if pos == len(s):\r\n break\r\n print(pos)\r\n", "s=input()\r\nt=input()\r\npostion=0\r\nfor i in range(len(t)):\r\n if s[postion]==t[i]:\r\n postion+=1\r\nprint(postion+1)", "s = str(input())\nt = str(input())\npos = 1\nfor i in range(len(t)):\n if t[i] == s[pos - 1]:\n pos += 1\n else:\n pass\nprint(pos)\n \n \n\n", "line = input()\r\ninstructions = input()\r\nj = 0\r\ncount = 1\r\nfor i in range(len(instructions)):\r\n if instructions[i] == line[j]:\r\n count += 1\r\n j += 1\r\nprint(count)", "s1 = input()\r\ns2 = input()\r\np1 = 1\r\np2 = 0\r\nwhile p2 < len(s2):\r\n if s2[p2] == s1[p1-1]:\r\n p1+=1\r\n if p1 == len(s1):\r\n break\r\n p2+=1\r\n\r\nprint(p1)\r\n\r\n # arr.append(maxx)\r\n# print(arr)\r\n # print(\"----\")\r\n \r\n \r\n\r\n", "s = list(input())\r\nt = list(input())\r\nsub = t[:]\r\ni = 0\r\nwhile s[i] in sub:\r\n indX = sub.index(s[i])\r\n sub = sub[indX + 1:]\r\n i += 1\r\nprint(i + 1)", "a=input()\r\nb=input()\r\npos=0\r\nfor i in b:\r\n\tif i==a[pos]:\r\n\t\tpos+=1\r\nprint(pos+1)\t", "Sequence = input()\r\nCommands = input()\r\n\r\nposition = 1\r\n\r\nfor c in Commands:\r\n if Sequence[position-1]==c:\r\n position += 1\r\n\r\nprint(position)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "x = input()\r\ny = input()\r\nk=0\r\npostion =x[k]\r\nfor char in y:\r\n if char == postion:\r\n postion = x[k+1]\r\n k+=1\r\nprint(k+1)\r\n", "s = input()\r\nt = input()\r\n\r\nk = 0\r\n\r\nfor i in range(len(t)):\r\n if t[i] == s[k]:\r\n k += 1\r\n \r\nprint(k + 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\nsequence = insr()\r\ninstructions = insr()\r\n\r\nposition = 1\r\nfor i in range(len(instructions)):\r\n if instructions[i] == sequence[position-1]:\r\n position += 1\r\n\r\nprint(position)", "def count_pos(stones : str, instructions : str):\n stone_i = 0\n for i in instructions:\n if(i==stones[stone_i]):\n stone_i += 1\n return stone_i+1\n\nstones = input()\nins = input()\nprint(count_pos(stones,ins))", "s=input()\r\np=input()\r\nj=0\r\nfor i in p:\r\n if(s[j]==i):\r\n j+=1\r\nprint(j+1)", "s = input()\r\nt = input()\r\ncount = 0\r\n\r\nfor i in range(len(t)):\r\n if t[i] == s[count]:\r\n count += 1\r\n\r\nprint(count + 1)", "s = input()\r\nt = input()\r\np1 = p2 = 0\r\nwhile p1 < len(s) and p2 < len(t) :\r\n if s[p1] == t[p2] :\r\n p1 += 1\r\n p2 += 1\r\nprint(p1+1)", "s = input()\r\nt = input()\r\ncnt=1\r\nfor i in t:\r\n if i==s[cnt-1]:cnt+=1\r\n\r\nprint(cnt)", "s = input()\nc = input()\nans = 1\nfor i in c:\n if i == s[ans-1]:\n ans+=1\nprint(ans)\n\t \t\t \t \t \t\t\t\t \t\t \t\t\t", "s=input()\r\nt=input()\r\ni=0\r\nj=0\r\nfor i in range(len(t)):\r\n if(s[j]==t[i]):\r\n j+=1\r\nprint(j+1)", "# https://codeforces.com/problemset/problem/265/A\r\n\r\nw = input().strip()\r\nt = input().strip()\r\n\r\nw_p, t_p = 0, 0\r\nwhile t_p != len(t):\r\n if w[w_p] == t[t_p]:\r\n w_p += 1\r\n t_p += 1\r\n \r\nprint(w_p + 1)", "k=input()\nn=input()\ns=0\nfor i in range(len(n)):\n if n[i]==k[s]:\n s+=1\nprint(s+1)\n", "from sys import stdin\r\ns = stdin.readline().rstrip()\r\nt = stdin.readline().rstrip()\r\nans = 1\r\nfor i in t:\r\n\tif ans<=len(s) and i==s[ans-1]:\r\n\t\tans+=1\r\nprint(ans)", "s = input()\r\nt = input()\r\np = 0\r\nfor i in t:\r\n if p == len(s)-1:\r\n break\r\n if s[p] == i:\r\n p +=1\r\nprint(p+1)", "x = list(input())\r\ny = list(input())\r\ntemp = 0\r\nfor i in y:\r\n if i == x[temp]:\r\n temp += 1\r\nprint(temp + 1)\r\n", "s=input()\r\nt=input()\r\nl=s[0]\r\ni=0\r\nfor x in t:\r\n if x==l:\r\n i=i+1\r\n l=s[i]\r\nprint(i+1)", "s=input()\r\nt=input()\r\nposition=1\r\nx=0\r\nfor i in range(len(t)):\r\n if t[i]==s[x]:\r\n position+=1\r\n x+=1\r\nprint(position)\r\n ", "stones = input()\r\ncolors = input()\r\nm_pos = 1\r\n\r\nfor i in range(len(colors)):\r\n if colors[i] == stones[m_pos - 1]:\r\n m_pos += 1\r\n\r\nprint(m_pos)", "s = input()\r\nt = input()\r\ncurrent = s[0]\r\nidx = 1\r\nfor i in t:\r\n if current == i:\r\n current = s[idx]\r\n idx += 1\r\nprint(idx)\r\n", "s1 = input()\r\ns2 = input()\r\nd = 1\r\ni = 0\r\nfor c in s2:\r\n if c == s1[i]:\r\n d += 1\r\n i += 1\r\n else:\r\n continue\r\n \r\nprint(d)\r\n \r\n\r\n", "stones = input()\r\nT = input()\r\nposition = 0\r\nfor i in range(len(T)):\r\n if T[i] == stones[position]:\r\n position += 1\r\nprint(position+1)", "from sys import stdin\r\ns = stdin.readline().rstrip()\r\no = stdin.readline().rstrip()\r\nind = 1\r\nfor c in o :\r\n if s[ind-1] == c :\r\n ind += 1\r\nprint(ind)", "def cs(s ,t):\r\n\ti , j = 0,0\r\n\twhile i<len(t):\r\n\t\tif t[i]==s[j]:\r\n\t\t\tj+=1\r\n\t\ti+=1\r\n\treturn j+1\r\ns = input();t = input()\r\nprint(cs(s , t))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Apr 11 17:55:48 2022\r\n\r\n@author: mm\r\n\"\"\"\r\n\r\ns=list(input())\r\nt=input()\r\narow = 0\r\ncont=1\r\nfor i in t:\r\n if i ==s[arow]:\r\n arow+=1\r\n cont+=1\r\n\r\nprint(cont)", "seq = input()\ninstruction = input()\nindex = 0\nfor i in instruction:\n if i == seq[index]:\n index += 1\nprint(index + 1)", "s = input()\r\nt = input()\r\npos =1\r\nfor color in t :\r\n if color == s[pos-1]:\r\n pos+=1\r\nprint(pos)", "w = list(input())\r\ns = list(input())\r\nd = [w[0]]\r\nfor i in range(len(s)):\r\n if s[i] == w[0]:\r\n d.append(w[1])\r\n w.pop(0)\r\nprint(len(d))", "def main():\r\n\r\n s = input()\r\n t = input()\r\n i=0\r\n j=0\r\n\r\n while(i<len(t)):\r\n if t[i] == s[j]:\r\n j += 1\r\n i += 1\r\n\r\n print(j+1)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "n=input()\r\nm=input()\r\nk=0\r\nans=0\r\nfor i in m:\r\n if i==n[k]:\r\n ans+=1\r\n k+=1\r\n\r\nprint(ans+1)", "s = input()\nt = input()\npos = 0\nfor i in range(len(t)):\n if s[pos] == t[i]:\n pos += 1\nprint(pos + 1)\n \t\t \t\t\t \t \t\t \t \t \t\t\t \t \t\t\t", "s=input()\r\nt=input()\r\ni=0;j=0\r\nwhile j<len(t):\r\n if t[j]==s[i]:\r\n i+=1\r\n j+=1\r\nprint(i+1)", "s=input()\r\nt=input()\r\nj=0\r\nfor i in range(len(t)):\r\n if(t[i]==s[j]):\r\n j+=1\r\n\r\nprint(j+1)\r\n", "s=list(input())\r\nt=list(input())\r\nindex_s=0\r\nfor i in t:\r\n if s[index_s]==i:\r\n index_s+=1\r\nprint(index_s+1)\r\n", "s=input()\r\nc=input()\r\nk=0\r\nfor i in c:\r\n if i==s[k]:\r\n k+=1\r\nprint(k+1)", "s = input()\r\nt = input()\r\nn, m = len(s), len(t)\r\ni, j = 0, 0\r\nwhile(i < n and j < m):\r\n\tif s[i] == t[j]:\r\n\t\ti += 1\r\n\t\tj += 1\r\n\telse:\r\n\t\tj += 1\r\nprint(i+1)\r\n", "stones = input()\r\norders = input()\r\n\r\np = 1\r\nidx = 0\r\nfor x in orders:\r\n if(x == stones[idx]):\r\n p+=1\r\n idx+=1\r\nprint(p)", "s = input()\r\nins = input()\r\ncount = 0\r\n\r\nfor i in range(len(ins)):\r\n if ins[i] == s[count]:\r\n count+=1\r\n\r\nprint(count+1)", "a=input()\r\nb=input()\r\nc=0\r\nfor x in range(len(b)):\r\n if a[c]==b[x]:\r\n c+=1\r\nprint(c+1)", "string1,string2,i =input(),input(),0\r\nfor j in string2: i = [i,i+1][string1[i]==j]\r\nprint(i+1)", "#####--------------Template Begin-------------------#####\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\ns=i()\r\nt=i()\r\ncp=0\r\nfor i in t:\r\n\tif i==s[cp]:\r\n\t\tcp+=1\r\nprint(cp+1)", "\r\ns =input()\r\nt =input()\r\nx = 0\r\nfor i in t:\r\n if s[x] == i:\r\n x = x+1\r\nprint(x+1)\r\n", "p = 0\r\nl_s = input()\r\nl_i = input()\r\n\r\nfor i in l_i:\r\n if i == l_s[p]:\r\n p += 1\r\n if p == len(l_s):\r\n break\r\nprint(p + 1)", "stones = input()\r\ninsts = input()\r\npos = 0\r\n\r\nfor i in insts:\r\n if i == stones[pos]:\r\n pos+=1\r\nprint(pos+1)", "# Emit the 0-index, count from 1\r\ns = \".\" + input()\r\nt = \".\" + input()\r\n\r\ns_index = 1\r\nt_index = 1\r\n\r\nwhile t_index < len(t):\r\n if t[t_index] == s[s_index]:\r\n s_index += 1\r\n t_index += 1\r\n\r\nprint(s_index)", "s = input()\r\nt = input()\r\nposition_s = 0\r\nfor j in range(len(t)):\r\n if s[position_s] == t[j]:\r\n position_s += 1\r\nprint(position_s+1)\r\n", "path = input()\r\nins = input()\r\nfirst = 0\r\nsecond = 0\r\nposition = 1\r\nfor i in range(len(ins)):\r\n if ins[first] == path[second]:\r\n position += 1\r\n first += 1\r\n second += 1\r\n elif ins[first] != path[second]:\r\n first += 1\r\nprint(position)", "a = list(input())\r\nb = list(input())\r\nn = 1\r\nfor i in b:\r\n if a[n-1] == i:\r\n n+=1\r\nprint(n)\r\n", "#!/usr/bin/python3\n\nimport sys\nimport argparse\nimport json\n\ndef main():\n colors = sys.stdin.readline().rstrip()\n instructions = sys.stdin.readline().rstrip()\n\n pos = 0\n\n for instruction in instructions:\n if instruction == colors[pos]:\n pos += 1\n\n\n pos += 1\n print(pos)\n\ndef get_tests():\n #tests = [(\"512 4\", \"50\")]\n\n for test in tests:\n print(json.dumps({\"input\": test[0], \"output\": test[1]}))\n\nif __name__ == \"__main__\":\n parser = argparse.ArgumentParser()\n parser.add_argument(\"--get-tests\", action=\"store_true\")\n args = parser.parse_args()\n\n if args.get_tests:\n get_tests()\n else:\n main()\n", "s=input()\r\nt=input()\r\na=0\r\nfor i in t:\r\n if s[a]==i:\r\n a+=1\r\nprint(a+1)", "s = input()\r\ns2 = input()\r\nj = 0\r\nfor i in s2:\r\n if s[j]== i:\r\n j+=1\r\nprint(j+1)", "s=input()\r\nt=input()\r\ncount=0\r\nfor i in range(len(t)):\r\n if t[i]==s[count]:\r\n count+=1\r\nprint(count+1)", "stones = input()\r\ninstructions = input()\r\ncurrent_position = 0\r\n\r\nfor instruction in instructions:\r\n if instruction == stones[current_position]:\r\n current_position += 1\r\n\r\n \r\nprint(current_position + 1)", "s = input()\r\nt = input()\r\n\r\npos = 0\r\n\r\nfor ins in t:\r\n if ins == s[pos]:\r\n pos += 1\r\n\r\nprint(pos + 1)", "li = list(input())\r\nl = list(input())\r\ntmp = li[0]\r\nj = 0\r\nfor i in range(len(l)):\r\n if tmp == l[i]:\r\n j += 1\r\n tmp = li[j]\r\nprint(j+1)", "s,i=input(),0\nfor x in input():i+=(x==s[i])\nprint(i+1)", "s=input()\r\nt=input()\r\nl=1\r\nfor i in range(len(t)):\r\n if t[i]==s[l-1]:\r\n l+=1\r\nprint(l)", "seq = input()\r\nins = input()\r\n\r\ncIndex = 0\r\nfor instruction in ins:\r\n if seq[cIndex] == instruction:\r\n cIndex += 1\r\n\r\nprint(cIndex + 1)", "s = input()\r\nt = input()\r\n\r\ntemp = 0\r\nfor i in range(len(t)) :\r\n if t[i]==s[temp] :\r\n temp+=1\r\nprint(temp+1)", "s = input()\r\nr = input()\r\n\r\n\r\ndef list(x):\r\n l = []\r\n for i in x:\r\n l.append(i)\r\n return l\r\n\r\n\r\ns = list(s)\r\nr = list(r)\r\n\r\ne = 0\r\nf = 0\r\nm = 0\r\n\r\nfor i in range(0, len(r)):\r\n if r[e] == s[f]:\r\n f += 1\r\n m += 1\r\n e += 1\r\nprint(m+1)\r\n", "s = input()\r\nt = input()\r\na = 1\r\nfor x in t:\r\n if x == s[a-1]:\r\n a += 1\r\nprint(a)", "if __name__ == '__main__':\r\n count = 0\r\n s = input()\r\n t = input()\r\n for a in t:\r\n if s[count] == a:\r\n count += 1\r\n print(count + 1)\r\n", "s = input()\r\nt = input()\r\nk = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[0]:\r\n s = s[1:]\r\n k+=1\r\nprint(k+1)", "s=input()\r\nt=input();o=0;c=s[o]\r\nfor i in t:\r\n if i == c:\r\n o += 1\r\n c = s[o]\r\nprint(o + 1)", "# https://codeforces.com/contest/265/problem/A\r\n\r\na = input()\r\nb = input()\r\n\r\nposition = 1\r\nj = 0\r\ncurrent_char = a[j]\r\n\r\nfor i in b:\r\n if i == current_char:\r\n position += 1\r\n j += 1\r\n current_char = a[j]\r\n\r\nprint(position)", "#t = int(input())\r\n#for i in range(t):\r\ns = input()\r\nins = input()\r\npos = 1\r\ncurr = 0\r\nfor j in ins:\r\n if s[curr] == j:\r\n curr += 1\r\n pos +=1\r\nprint(pos)\r\n", "l=input()\r\nl=list(l)\r\nk=input()\r\nk=list(k)\r\nu=0\r\nfor i in range(len(k)):\r\n if k[i]==l[u]:\r\n u=u+1\r\nprint(u+1)", "# JAI SHREE RAM\r\n\r\nimport math; from collections import *\r\nimport sys; from functools import reduce\r\n\r\n# sys.setrecursionlimit(10**6)\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\nUGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)\r\n\r\n# sys.stdin=open(\"input.txt\",\"r\");sys.stdout=open(\"output.txt\",\"w\")\r\n\r\n# for _testcases_ in range(int(input())):\r\ns = input()\r\nt = input()\r\npos = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[pos]:\r\n pos += 1\r\nprint(pos+1)\r\n\r\n'''\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\nTHE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )\r\nLink may be copy-pasted here if it's taken from other source.\r\nDO NOT PLAGIARISE.\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\n'''", "a = list(input())\r\nb = list(input())\r\nc = 0\r\nson = 1\r\nfor i in b:\r\n if i == a[c]:\r\n son += 1\r\n c += 1\r\nprint(son)\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\ns=input()\r\nt=input()\r\ni=0\r\nfor c in t:\r\n if c==s[i]:\r\n i+=1\r\nprint(i+1)", "s=input()\r\nt=input()\r\nk,i=0,0\r\nwhile(i<len(s) and k<len(t)):\r\n if(s[i]==t[k]):\r\n i+=1 \r\n k+=1 \r\n else:\r\n k+=1\r\nprint(i+1) ", "s = list(input())\r\ninstruction = str(input())\r\ncount=0\r\nj=0\r\ncurrent_pos = s[j]\r\nfor i in instruction:\r\n if i == current_pos:\r\n j = j+1\r\n current_pos = s[j]\r\n count = count+1\r\n\r\nprint(count+1)", "s= input()\r\nt=input()\r\nm=1\r\nfor i in t:\r\n if i == s[m-1]:\r\n m +=1\r\nprint(m)", "s = input()\r\nc = input()\r\nk = 0\r\n\r\ncounter = 1\r\n\r\nfor i in c: \r\n if i == s[k] : \r\n counter +=1 \r\n k +=1\r\n \r\n\r\nprint (counter)\r\n", "s = input()\r\ns1 = input()\r\nj = 0\r\ncnt = 0\r\nfor i in range(len(s1)):\r\n if s[j] == s1[i]:\r\n cnt += 1\r\n j += 1\r\n s1.replace('', s1[:i + 1])\r\n \r\nprint(cnt + 1)\r\n", "s=input()\r\nt=input()\r\nk=0\r\nfor i in range(len(t)):\r\n if s[k]==t[i]:\r\n k+=1\r\nprint(k+1)", "s = input()\r\ns = list(s)\r\nt = input()\r\nt = list(t)\r\nsteps = 0\r\nfor i in range(len(t)):\r\n if t[0] == s[0]:\r\n steps += 1\r\n t.pop(0)\r\n s.pop(0)\r\n else:\r\n t.pop(0)\r\n\r\nprint(steps + 1)", "stones = input()\r\ninstructions = input()\r\n\r\ncount = 0\r\nfor i in instructions:\r\n if stones[count] == i:\r\n count += 1\r\n\r\nprint(count + 1)", "# Read input\r\ns = input()\r\nt = input()\r\n\r\n# Initialize Liss's position to 1 (first stone)\r\nposition = 1\r\n\r\n# Iterate through each instruction\r\nfor instruction in t:\r\n # Check if Liss is on the correct color stone\r\n if s[position - 1] == instruction:\r\n position += 1 # Move one stone forward\r\n\r\n# Print the final position of Liss (1-based)\r\nprint(position)\r\n", "s = list(input())\r\nt = list(input())\r\n\r\nposition = 0 #1 will be added to final position\r\n\r\nfor instruction in t:\r\n if instruction == s[position]:\r\n position += 1\r\nprint(position +1)", "s = input()\r\nt = input()\r\ni = 1\r\nfor j in t:\r\n if j == s[i-1]:\r\n i += 1\r\nprint(i)\r\n", "m = input()\r\nb = input()\r\ncounter = 0\r\nfor i in range (len(b)):\r\n if m[counter] == b[i]:\r\n counter += 1\r\nprint (counter + 1)", "s=input()\r\ni=0\r\nfor x in input():i+=(x==s[i])\r\nprint(i+1)", "s=input()\r\nt=input()\r\ncurr=s[0]\r\nj=1\r\nfor i in range(len(t)):\r\n if(curr==t[i]):\r\n curr=s[j]\r\n j+=1\r\nprint(j) ", "s=list(input())\r\nt=list(input())\r\nc,i,l1,l2=1,0,0,0\r\nwhile i<len(t):\r\n if s[l1]==t[l2]:\r\n c+=1\r\n l1+=1\r\n l2+=1\r\n else:\r\n l2+=1\r\n i+=1\r\nprint(c)\r\n", "s,t,cn=input(),input(),0\r\nfor i in range(len(t)):\r\n if s[cn]==t[i]:\r\n cn+=1\r\nprint(cn+1)", "s=input()\r\nt=input()\r\nliss=0\r\nfor i in range(len(t)):\r\n if t[i]==s[liss]:\r\n liss+=1\r\nprint(liss+1)\r\n\r\n\r\n", "from sys import stdin,stdout\nfrom math import gcd,sqrt,floor,ceil\n# Fast I/O\n#input = stdin.readline\n#print = stdout.write\n\ndef list_inp(x):return list(map(x,input().split()))\ndef map_inp(x):return map(x,input().split())\n\ndef lcm(a,b): return (a*b)/gcd(a,b)\n\n\ns1 = input()\ns2 = input()\nll = len(s2)\nj= 0\nfor i in range(ll):\n if s2[i] == s1[j]:\n j+=1\nprint(j+1)\n", "s = input()\r\ninst = input()\r\nstones = list(s)\r\ninstructions = list(inst)\r\n\r\ncounter = 0\r\n\r\nfor i in range(len(instructions)):\r\n if instructions[i] == stones[counter]:\r\n counter += 1\r\nprint(counter + 1)\r\n", "a1=list(input())\r\na2=list(input())\r\nstep=0\r\nfor i in range(len(a2)):\r\n if(a1[step]==a2[i]):\r\n step+=1\r\nprint(step+1)", "stoneseq = [x for x in input()]\r\ninstructset = [x for x in input()]\r\ncurrentcounter = 0\r\nfor i in range(len(instructset)):\r\n if instructset[i] == stoneseq[currentcounter]:\r\n currentcounter += 1\r\nprint(currentcounter + 1)", "stones , instruc = input(), input()\r\nindex = 0\r\nfor i in instruc:\r\n if (i==stones[index]):\r\n index+=1\r\nprint(index+1) \r\n", "# Read input\r\ns = input()\r\nt = input()\r\n\r\n# Initialize Liss's position to 1 (the first stone)\r\nposition = 1\r\n\r\n# Iterate through the instructions in string t\r\nfor instruction in t:\r\n # Check if the instruction matches the color of the current stone\r\n if instruction == s[position - 1]:\r\n # If it matches, move Liss one stone forward\r\n position += 1\r\n\r\n# Print the final position of Liss (1-based index)\r\nprint(position)\r\n", "#print(\"Hello World!\")\r\nl=[y for y in input()]\r\n#print(l)\r\no=[y for y in input()]\r\n#print(o)\r\ncount=1\r\nfor x in o:\r\n if l[count-1]==x:\r\n count=count+1\r\nprint(count)", "if __name__ == \"__main__\":\r\n stones = input()\r\n steps = input()\r\n steps_num = 1\r\n for i in range(0,len(steps)):\r\n if stones[steps_num-1] == steps[i]:\r\n steps_num += 1\r\n print(steps_num)", "s=str(input())\r\ns1=str(input());l=s[0];j=0\r\nfor i in range(len(s1)):\r\n p=s1[i]\r\n if p==l:\r\n j+=1\r\n l=s[j]\r\nprint(j+1)\r\n", "s = input()\r\nt = input()\r\n\r\nindex = 1\r\ni = 0\r\nfor j in range(len(t)):\r\n if t[j] == s[i]:\r\n # print(t[j], s[j], j)\r\n index += 1\r\n i += 1\r\n # print(index)\r\nprint(index)", "s1 = input()\ns2 = input()\nk = 0\nfor i in s2:\n if i == s1[k]:\n k += 1\nprint(k + 1)\n", "# https://codeforces.com/contest/265/problem/A\r\ns = input()\r\nt = input()\r\ni = j = 0\r\nwhile i < len(t):\r\n if t[i] == s[j]:\r\n j += 1\r\n i += 1\r\n\r\nprint(j + 1)\r\n", "stones=list(input())\ninstructions=list(input())\n\nposition=0\n\nfor i in instructions:\n if (i==stones[position]):\n position+=1 \nprint(position+1)", "a=list(input());b=input();c=1\r\nfor i in b:\r\n if i==a[0]: c+=1;a.pop(0)\r\nprint(c)\r\n", "s=input()\r\nc=input()\r\nans=0\r\nfor i in c:\r\n if i==s[ans]:\r\n ans+=1 \r\nprint(ans+1)", "string = input()\r\ninstruction = input()\r\nposition_counter = 1 ;\r\nposition_arr = 0 ;\r\nfor i in range(0 , len(instruction)) :\r\n if instruction[i] == string[position_arr] :\r\n position_counter += 1\r\n position_arr += 1\r\nprint(position_counter)", "s1=input()\r\ns2=input()\r\nj=0\r\nfor i in range(len(s2)):\r\n if(s2[i]==s1[j]):\r\n j+=1\r\nprint(j+1)", "stones = list(input())\ninstructions = list(input())\n\np = 1\n\nfor i in instructions:\n if stones[p - 1] == i:\n p += 1\n\nprint(p)\n", "s = input()\r\nx = input()\r\nn = 0\r\nfor i in range(len(x)):\r\n if x[i] == s[n]:\r\n n += 1\r\nprint(n+1)", "a=input()\r\nb=input()\r\ne=0\r\nfor i in range(len(b)):\r\n if b[i]==a[e]:\r\n e+=1\r\n\r\nprint(e+1)", "s = input()\r\nd = input()\r\nans = 0\r\nfor i in range(len(d)):\r\n if d[i] == s[ans]:\r\n ans += 1\r\nprint(ans + 1)\r\n", "ch1=input()\r\nch2=input()\r\nj=0\r\nfor i in range(len(ch2)):\r\n if ch2[i]==ch1[j]:\r\n j=j+1\r\nprint(j+1) ", "s = input()\r\nc = 0\r\n\r\nfor v in input():\r\n c += (v == s[c])\r\n\r\nprint(c + 1)\r\n", "stones = input()\r\ninsts = input()\r\nindex = 0\r\n\r\nfor i in range(len(insts)):\r\n if insts[i] == stones[index]:\r\n index += 1\r\n\r\nprint(index + 1)", "string = input()\r\nmovement = input()\r\nstring_index = 0\r\ni = 0\r\nwhile i <= len(movement)-1:\r\n if movement[i] == string[string_index]:\r\n string_index += 1\r\n i+=1\r\n else:\r\n i+=1\r\n\r\nprint(string_index+1)", "s = input()\r\nt = input()\r\ncount = 0\r\nfor i in range(len(t)):\r\n if s[count] == t[i]:\r\n count = count+1\r\nprint(count+1)\r\n", "inp = list(input())\nins = list(input())\nres = 0 \nfor i in range(len(ins)):\n if (inp[res] == ins[i]):\n res += 1\n\nprint(res+1)", "a=str(input())\r\nb=str(input())\r\nx=int(0)\r\ny=int(0)\r\nwhile x<len(b):\r\n if b[x]==a[y]:\r\n y=y+1\r\n x=x+1\r\nprint(y+1)", "s1=input()\r\ns2=input()\r\ni=j=0\r\nwhile i<len(s1) and j<len(s2):\r\n\tif s1[i]==s2[j]:\r\n\t\ti+=1\r\n\t\tj+=1\r\n\telse:\r\n\t\tj+=1\r\nprint(i+1)", "x=input()\r\ny=input()\r\nc=0\r\nfor i in range(len(y)):\r\n if y[i]==x[c]:\r\n c+=1\r\n else:\r\n continue\r\nprint(c+1)\r\n ", "s=input()\r\nt=input()\r\nc=1\r\nfor i in range(len(t)):\r\n if s[c-1]==t[i]:\r\n c=c+1\r\nprint(c)", "def colourfulstones(a,b):\r\n i,j=0,0\r\n while i<len(a) and j<len(b):\r\n if a[i]==b[j]:\r\n i=i+1\r\n j=j+1\r\n return i+1\r\ns=str(input())\r\nt=str(input())\r\nprint(colourfulstones(s,t))", "x=input()\r\ny=input()\r\ni,j,c=0,0,1\r\nwhile j<len(y) and i<len(x):\r\n\tif x[i]==y[j]:\r\n\t\tc+=1\r\n\t\ti+=1\r\n\tj+=1\r\nprint(c)", "stones = list(input())\r\ninstruction = list(input())\r\npos = 0\r\nfor i in range(len(instruction)):\r\n if stones[pos] == instruction[i]:\r\n pos+=1\r\n\r\nprint(pos+1)", "s = input()\r\nt = input()\r\nc = s[0]\r\nj = 0\r\ncount = 0\r\nfor i in range(len(t)):\r\n if c == t[i]:\r\n count += 1\r\n j += 1\r\n c = s[j]\r\nprint(count + 1)\r\n", "stones1 = list(map(str,input()))\r\nstones2 = list(map(str,input()))\r\ni = 0\r\nj = 0\r\n\r\nwhile j < len(stones2):\r\n if stones1[i] == stones2[j]:\r\n i+=1\r\n j += 1\r\n\r\nprint (i+1)", "s = input()\r\nt = input()\r\n\r\nposition = 1\r\nfor instruction in t:\r\n if instruction == s[position - 1]:\r\n position += 1\r\n\r\nprint(position)\r\n", "s, t = input(), input()\r\nmoves = 0\r\nfor i in range(len(t)):\r\n c = t[i]\r\n if c == s[moves]:\r\n moves = moves + 1\r\n\r\nprint(moves + 1)", "inp = str(input())\r\nlenn = str(input())\r\ncounter =0\r\n\r\nfor i in range(len(lenn)):\r\n if inp[counter]==lenn[i]:\r\n counter+=1\r\n\r\nprint(counter+1)\r\n", "s = input()\nt = list(input())\nmove = 1\ni = 0\nwhile t:\n if t[0] == s[i]:\n move += 1\n i += 1\n t.pop(0)\nprint(move)", "s1=input()\r\ns2=input()\r\nidx=0\r\nfor i in s2:\r\n if s1[idx]==i:\r\n idx+=1\r\nprint(idx+1)", "s=input()\r\nt=input()\r\npos=0\r\nfor i in t:\r\n if i == s[pos] :\r\n pos+=1\r\nprint(pos+1)\r\n ", "s = input()\r\nt = input()\r\n\r\nposition = 1\r\nindex = 0\r\n\r\nfor i in range(len(t)):\r\n if s[index] == t[i]:\r\n position += 1\r\n index += 1\r\n else:\r\n continue\r\n \r\nprint(position)", "s = input()\r\nt = input()\r\n\r\npos = 0\r\n\r\nfor x in t :\r\n if s[pos] == x :\r\n pos += 1\r\n\r\nprint (pos + 1)\r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "s = input()\r\nt = input()\r\n\r\npos = 1\r\nfor i in range(len(t)):\r\n if s[pos-1] == t[i]:\r\n pos += 1\r\n\r\nprint(pos)", "from collections import Counter\r\n\r\ndef solve():\r\n str1=input()\r\n str2=input()\r\n count,j=1,0\r\n\r\n for i in range(len(str2)):\r\n if str1[j]==str2[i]:\r\n count+=1\r\n j+=1\r\n\r\n return count\r\n\r\n\r\n\r\n\r\n \r\nprint(solve())", "stones =input().strip()\r\norders =input().strip()\r\n \r\np1 = 0\r\np2 = 0\r\noutput= 1\r\n \r\nwhile p1 < len(stones) and p2 <len(orders):\r\n \r\n if stones[p1] == orders[p2]:\r\n output+=1\r\n p1+=1\r\n p2+=1\r\n \r\n else:\r\n p2+=1\r\n \r\n \r\nprint(output)", "x = input()\r\ny = input()\r\np = 0\r\nfor i in y:\r\n if i == x[p]:\r\n p += 1\r\n if p == len(x):\r\n break\r\nprint(p + 1)", "\n\n# 265 A Colorful Stones (Simplified Edition)\n\na = list(input().strip())\nb = list(input().strip())\n\ncounter = 0\nfor i in b:\n if a[counter] == i:\n counter+=1\n\nprint(counter+1)\n\n", "n,d=input(),0\r\nfor i in input():\r\n if i==n[d]:d+=1\r\nprint(d+1)", "s = input()\r\nt = input()\r\nsp = 0 \r\nfor i in t : \r\n if i == s[sp] : \r\n sp+= 1 \r\n\r\nprint(sp+1)", "stones = input()\r\ntmp = input()\r\nidx = 0\r\nfor i in range(len(tmp)):\r\n if tmp[i] == stones[idx]:\r\n idx += 1\r\n if idx == len(stones):\r\n print(len(stones))\r\n break\r\nelse:\r\n print(idx + 1)", "s1=input().strip()\r\ns2=input().strip()\r\ni=0\r\nc=0\r\nwhile(i<len(s2)):\r\n if s2[i]==s1[c]:\r\n c+=1\r\n i+=1\r\nprint(c+1)\r\n", "string1 = input()\nstring2 = input()\nindex = 0\n\nfor i in range(len(string2)):\n\tif string2[i] == string1[index]:\n\t\tindex = index + 1\n\nprint(index + 1)\n", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#-----------------------------------------\r\na=input()\r\nb=input()\r\nindex=1\r\nfor i in b:\r\n if i==a[index-1]:index+=1\r\nprint(index)\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", "stones = input()\ninstructions = input()\n\ni = 0\nfor c in instructions:\n if c == stones[i]:\n i += 1\n\nprint(i+1)", "string1 = input()\r\nstring2 = input()\r\ncount = 0\r\nfor j in range(len(string2)):\r\n if string2[j] == string1[count]:\r\n count += 1\r\nprint(count+1)\r\n", "y1=input()\r\ny2=input()\r\nj=0\r\nc=1\r\nfor i in range(len(y2)):\r\n if y1[j]==y2[i]:\r\n j=j+1\r\n c=c+1\r\n \r\n \r\nprint(c) \r\n", "s =list(input())\r\nt = list(input())\r\n\r\nans = 0\r\n\r\nfor i in range(len(t)) :\r\n if t[i] == s[ans] :\r\n ans += 1\r\n\r\nprint(ans+1)", "s = input()\r\nt = input()\r\ncnt = 1\r\nfor i in t:\r\n if i==s[cnt-1]:\r\n cnt+=1\r\nans = str(cnt)\r\nprint(ans)", "array1 = list(input())\r\narray2 = list(input())\r\ncount = 1\r\nx=0\r\n\r\nfor i in range(len(array1)) :\r\n for J in range (x , len(array2)):\r\n if array1[i] == array2[J] :\r\n count +=1\r\n x += 1\r\n break\r\n x += 1\r\n if x == len(array2) + 1:\r\n break\r\nprint (count)\r\n\r\n\r\n", "s=input()\r\ni=input()\r\npos=0\r\nfor index in i:\r\n if (index==s[pos]):\r\n pos+=1\r\nprint(pos+1) ", "s = input()\r\nx = input()\r\npos = 0\r\nfor i in range(0,len(x),1):\r\n if s[pos]==x[i]:\r\n pos+=1\r\nprint(pos + 1)", "os = input()\r\ndt = input()\r\nans=1\r\nfor i in range(len(dt)):\r\n if dt[i] == os[ans-1]:\r\n ans += 1\r\nprint(ans)", "path = input()\r\ninst = input()\r\nresult = 1\r\ncurrent = 0\r\nfor i in range(len(inst)):\r\n if inst[i] == path[current]:\r\n result += 1 \r\n current += 1\r\nprint(result)", "s1=input()\r\ns2=input()\r\ni=0\r\nj=0\r\nwhile j!=len(s2):\r\n\tif s1[i]==s2[j]:\r\n\t\ti+=1\r\n\tj+=1\r\nprint(i+1)\r\n", "s=input()\r\nt=input()\r\nn,m=len(s),len(t)\r\nc = 1\r\nj = 0\r\nfor i in range(m):\r\n if s[j]==t[i]:\r\n j+=1\r\n c+=1\r\nprint(c)\r\n", "\r\nlst = input()\r\ninst = input()\r\nres = 0\r\n\r\nfor i in inst:\r\n if i == lst[res] :\r\n res +=1\r\nprint(res+1)\r\n\r\n", "a=input()\r\nb=input()\r\nsum = 0\r\ns1=0\r\ns2=0\r\nwhile s2<len(b):\r\n if a[s1]==b[s2]:\r\n sum+=1\r\n s1+=1\r\n s2+=1\r\nprint(sum+1)\r\n \r\n\r\n", "stones = input()\r\ninstrucs = input()\r\npos = 0\r\nfor i in instrucs :\r\n if i == stones[pos] :\r\n pos += 1\r\nprint(pos+1)", "s=list(input())\r\nt=list(input())\r\nc=1\r\nfor i in t:\r\n\tif i==s[0]:\r\n\t\tc+=1\r\n\t\ts.pop(0)\r\nprint(c)", "# https://codeforces.com/contest/265/problem/A\r\n\r\nlistOfStones = list(input())\r\nlistOfInstructions = list(input())\r\n\r\npositionOfLiss = 0\r\n\r\nfor instruction in listOfInstructions:\r\n if instruction == listOfStones[positionOfLiss]:\r\n positionOfLiss += 1\r\n\r\nprint(positionOfLiss+1)\r\n", "s=input()\r\nt=input()\r\ni=0\r\nj=0\r\nwhile i<len(s) and j<len(t):\r\n while j<len(t):\r\n if t[j]==s[i]:\r\n j+=1\r\n i+=1\r\n else:\r\n j+=1\r\n\r\nprint(i+1)\r\n", "s = input()\ni = input()\npos = 1\nn = len(s)\nfor j in i:\n if j == s[pos - 1]:\n pos += 1\n\nprint(pos)\n\n\t\t\t\t \t \t \t\t\t \t \t\t \t \t\t", "a=input()\r\nb=input()\r\nc=1\r\nfor x in range(len(b)):\r\n\tif b[x]==a[c-1]:\r\n\t\tc+=1\r\nprint(c)\r\n", "s, t = input(), input()\nres, i = 1, 0\nwhile res <= len(s) and i < len(t):\n if s[res - 1] == t[i]:\n res += 1\n i += 1\nprint(res)\n", "while True:\r\n try:\r\n s = input()\r\n t = input()\r\n j = 0\r\n for i in t:\r\n if s[j] == i:\r\n j += 1\r\n print(j + 1)\r\n except:\r\n break", "s = input()\r\nt = input()\r\npos = 1\r\nfor c in t :\r\n if c == s[pos-1] and pos!=len(s) :\r\n pos += 1\r\nprint(pos)", "m= list(input())\r\nm1= list(input())\r\n\r\nt = m[0]\r\n\r\nk = 0\r\n\r\nfor i in range(len(m1)):\r\n if t == m1[i]:\r\n #print(t)\r\n k += 1\r\n #print(k)\r\n t = m[k]\r\nprint(k+1)", "s=input()\r\nt=input()\r\nc=0\r\nfor j in range(len(t)):\r\n if c<len(s):\r\n if s[c]==t[j]:\r\n c+=1\r\n else:\r\n continue\r\n else:\r\n break\r\nprint(c+1)\r\n \r\n", "from collections import defaultdict\r\nimport random\r\n\r\nn=input()\r\ns=input()\r\nan=1\r\nfor i in s:\r\n if n[an-1]==i:\r\n an+=1\r\nprint(an)", "s = input()\r\nins = input()\r\ni = 0\r\nfor char in ins:\r\n if char == s[i]:\r\n i += 1\r\nprint(i + 1)", "s = input()\r\ninstruction = input()\r\nk = 0\r\nfor i in range(len(instruction)):\r\n\tif instruction[i] == s[k]:\r\n\t\tk += 1\r\nprint(k+1)", "s, t = input(), input()\r\nstep = 1\r\nfor c in t:\r\n if c == s[step - 1]: \r\n step += 1\r\nprint(step)", "s = input()\r\ns2 = input()\r\nstep = 0\r\nfor i in range(len(s2)):\r\n if s2[i] == s[step]:\r\n step+=1\r\n\r\nprint(step+1)\r\n", "# 265A - Colorful Stones (Simplified Edition)\r\ns, t, n = input(), input(), 0\r\nfor i in range(len(t)):\r\n if t[i] == s[n]:\r\n n += 1\r\nprint(n+1)\r\n", "# n = int(input())\r\n# s = input()\r\n# k_sf, k_fs = 0, 0\r\n#\r\n# for i in range(1, n):\r\n# if s[i] == 'S' and s[i - 1] == 'F':\r\n# k_fs += 1\r\n# if s[i] == 'F' and s[i - 1] == 'S':\r\n# k_sf += 1\r\n#\r\n# a = 'yes' if k_sf > k_fs else 'no'\r\n# print(a)\r\n\r\n\r\n# n = int(input())\r\n#\r\n# for i in range(n):\r\n# s = input().split()\r\n# diff = int(s[2]) - int(s[1])\r\n# if int(s[1]) >= 2400 and diff > 0:\r\n# print('YES')\r\n# break\r\n# else:\r\n# print('NO')\r\n\r\n\r\n# n = int(input())\r\n# a = n % 4\r\n# if a == 0:\r\n# print(1, 'A')\r\n# elif a == 1:\r\n# print(0, 'A')\r\n# elif a == 2:\r\n# print(1, 'B')\r\n# elif a == 3:\r\n# print(2, 'A')\r\n\r\n\r\n# t = int(input())\r\n# for i in range(t):\r\n# s, a, b, c = input().split()\r\n# s = int(s)\r\n# a = int(a)\r\n# b = int(b)\r\n# c = int(c)\r\n# max_c = s // c\r\n# max_c += (max_c // a) * b\r\n# print(max_c)\r\n\r\ns = input()\r\nt = input()\r\nk = 0\r\nfor i in t:\r\n if i == s[k]:\r\n k += 1\r\n\r\nprint(k + 1)\r\n", "stons = input()\r\nactions = input()\r\n\r\nston_num = 1\r\nfor c in actions:\r\n if c == stons[ston_num-1]:\r\n ston_num +=1\r\nprint(ston_num)", "if __name__ == '__main__':\n\tn = input()\n\tt = input()\n\tj = 0\n\tl = len(t)\n\tfor i in range(l):\n\t\tif t[i] == n[j]:\n\t\t\tj+=1\n\tprint(j+1)", "stones = list(input())\r\nstoneInstructions = list(input())\r\nx = 0\r\nstoneCount = 1\r\nfor i in range(len(stoneInstructions)):\r\n if(stoneInstructions[i] == stones[x]):\r\n stoneCount += 1\r\n x += 1\r\n else:\r\n pass\r\n \r\nprint(str(stoneCount))", "s = input()\r\nt = input()\r\nlength = len(t)\r\nstep = 1\r\ni = 0\r\nfor j in range(length):\r\n if s[i] == t[j]:\r\n i += 1\r\nprint(i+1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\ns = input () \r\nn = input() \r\nres = 1 \r\ni,j = 0 ,0 \r\n\r\nwhile i < len(s) and j < len(n):\r\n while ( j < len (n) and s[i] != n[j] ):\r\n j +=1 \r\n if (j<len(n)):\r\n i+=1\r\n j+=1\r\n continue\r\nprint (i+1)\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\nstring=list(input())\r\ninstruction=list(input())\r\n\r\n\r\nl=0\r\nfor i in range(len(instruction)):\r\n if(instruction[i]==string[l]):\r\n l+=1\r\n\r\nprint(l+1)", "# stones w/ 3 colours, R, G, B\n# given string s\n# ith character is the ith colour\n\n# keep a tracker of the current position\n# iterate through the instructions, for every instruction move positions\n# print the final position\n\npositions = input()\ninstr = input()\n\npos = 0\nfor i in range(len(instr)):\n if instr[i] == positions[pos]:\n pos += 1\n\nprint(pos+1)\n", "a = input()\r\nb = input()\r\n\r\npos = 0\r\n\r\nfor i in b:\r\n while(i==a[pos]):\r\n #print(a[pos])\r\n pos+=1\r\n break\r\n \r\nprint(pos+1)", "stones = input().lstrip().rstrip()\r\ninstructions = input().lstrip().rstrip()\r\n\r\ncurrentPos = 1\r\nfor instruction in instructions:\r\n if instruction == stones[currentPos-1]:\r\n currentPos += 1\r\n\r\nprint(currentPos)\r\n", "s = list(input())\nd = list(input())\npos = 0\n\nfor i in d:\n if i == s[pos]:\n pos += 1\nprint(pos + 1)\n", "s1=input()\r\ns2=input()\r\nj=0\r\nfor c in (s2): \r\n if s1[j]==c:j+=1 \r\nprint(j+1)", "from math import ceil,gcd,factorial\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom array import array\r\nfrom collections import Counter as ctr\r\nfrom collections import deque as dq\r\n\r\ndef li():\r\n return list(map(int,input().split()))\r\ndef arr(a):\r\n return array('i',a)\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n # n=int(input())\r\n s=input()\r\n t=input()\r\n j=0\r\n for i in t:\r\n if s[j]==i:\r\n j+=1\r\n print(j+1)\r\nsolve()\r\n", "# -*- coding: utf-8 -*-\r\n\r\n\r\nstones=input()\r\ninstructions=input()\r\nindex=0\r\nfor i in range(0,len(instructions)):\r\n if instructions[i]==stones[index]:\r\n index+=1\r\nprint(index+1)", "s = input()\r\nt = input()\r\nslen = len(s)\r\ntlen = len(t)\r\nsk = 0\r\ntk = 0\r\nans = 0\r\nwhile sk < slen and tk < tlen:\r\n if s[sk] == t[tk]:\r\n ans+=1 \r\n sk+=1 \r\n tk+=1\r\n else:\r\n tk+=1 \r\nprint(ans+1)", "s = input()\nt = input()\n\ntracker=0\nfor i in range(len(t)):\n if t[i]==s[tracker]: tracker +=1\n\n\nprint(tracker+1)\n", "if __name__ == \"__main__\":\n pos = 0\n stones = list(input())\n instructions = list(input())\n for c in instructions:\n if stones[pos] == c:\n pos += 1\n print(pos + 1)", "a = input()\r\nt = input()\r\nc = 0\r\nfor i in t:\r\n if i == a[c]:\r\n c+=1\r\nprint(c+1)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\ndef colorful_stones(s, t):\r\n i = 0\r\n for t_i in t:\r\n if t_i == s[i]:\r\n i += 1\r\n return i + 1\r\n\r\ns = input()\r\nt = input()\r\nans = colorful_stones(s, t)\r\nprint(ans)\r\n", "s = input()\r\nins = input()\r\n\r\npos = 0\r\n\r\nfor i in ins:\r\n if s[pos] == i:\r\n pos += 1\r\n\r\nprint (pos + 1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n# if the first line does not match the second line, the position of that number in the first line stays the same. only until when the second line matches the first line, l += 1.\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp(): # one integer input\r\n return(int(input()))\r\ndef inlt(): # list input\r\n return(list(map(int,input().split())))\r\ndef insr(): # string input\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr(): # muliple integer variables input\r\n return(map(int,input().split()))\r\n\r\nl1i = 0\r\nline_1 = input()\r\nline_2 = input()\r\n\r\nfor i in range(len(line_2)):\r\n if line_1[l1i] == line_2[i]:\r\n l1i += 1\r\n\r\nprint(l1i + 1)", "s = input()\r\nt = input()\r\nindex = 0\r\n\r\nfor c in t:\r\n\tif s[index] == c:\r\n\t\tindex += 1\r\nprint(index+1)", "s1=input()\r\ns2=input()\r\nn=len(s2)\r\ni=0\r\nfor j in range(n):\r\n if s2[j]==s1[i]:\r\n i+=1\r\nprint(i+1)", "\r\n\r\nmain = input()\r\nstep = input()\r\n\r\npos = 0\r\n\r\nfor i in range(len(step)):\r\n if step[i] == main[pos]:\r\n pos += 1\r\nprint(pos+1)", "t = input()\ns = input()\nk=0\nfor i in range(len(s)):\n if s[i] == t[k]:\n k+=1\nprint(k+1)\n", "s = input()\nins = input()\ni = 0\nfor j in range(len(ins)):\n if ins[j] == s[i]:\n i += 1\nprint(i + 1)", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\ns = list(input())\r\nt = deque(list(input()))\r\n\r\n\r\npos = 1\r\n\r\nwhile t:\r\n curr = t.popleft()\r\n\r\n if s[pos-1] == curr:\r\n pos += 1\r\n\r\nprint(pos)", "count = 0\r\nx = input()\r\ny = input()\r\nfor i in range(0, len(y)):\r\n if y[i] == x[count]:\r\n count += 1\r\nprint(count+1)", "a=input()\r\nb=input()\r\nx,y=len(a),len(b)\r\ni=0\r\nj=0\r\nwhile i<x and j<y:\r\n\tif b[j]==a[i]:\r\n\t\ti+=1\r\n\tj+=1\r\nprint(i+1)", "stones = input()\r\ninst = input()\r\npointer = 1\r\nfor i in inst:\r\n if i == stones[pointer-1]:\r\n pointer += 1\r\nprint(pointer)", "s = input()\r\nt = input()\r\nindex = 0\r\nfor n in t:\r\n if n == s[index]:\r\n index += 1\r\nprint(index + 1)", "s=input()\r\nt=input()\r\nn=len(s)\r\nm=len(t)\r\ncount=1\r\nk=0\r\nfor i in range(m):\r\n if s[k]==t[i]:\r\n count+=1\r\n k+=1\r\nprint(count)", "x=input()\r\ny=input()\r\ncount=1\r\nfor i in range(len(x)):\r\n for j in range(len(y)):\r\n if(y[j]==x[i]):\r\n count+=1\r\n i=i+1\r\n else:\r\n continue \r\n print(count) \r\n break ", "n = list(input().strip().split())\r\ns = list(input().split())\r\nn = [i for i in n[0]]\r\ns = [i for i in s[0]]\r\nj = 0\r\ni = 0\r\nwhile j < len(n)-1 and i <= len(s) - 1:\r\n # print('i',i)\r\n # print('j',j)\r\n if n[j] == s[i]:\r\n j = j+1\r\n i = i + 1\r\n else:\r\n i = i + 1\r\n\r\nprint(j+1)\r\n", "s, t, n = input(), input(), 0\r\nfor i in range(len(t)):\r\n if t[i] == s[n]:\r\n n += 1\r\nprint(n+1)", "s=input()\r\nt=input()\r\nile=0\r\nfor i in t:\r\n\tif s[ile]==i:\r\n\t ile+=1\r\nprint(ile+1)", "s = input()\r\nt = input()\r\ni = 0\r\n\r\nfor c in range(len(t)):\r\n if s[i] == t[c]:\r\n i += 1\r\n\r\nprint(i + 1)\r\n", "ch1=input()\r\nch2=input()\r\nn=0\r\nfor i in range(len(ch2)):\r\n if ch2[i]==ch1[n]:\r\n n=n+1\r\nprint(n+1)", "s = input()\r\nt = input()\r\n\r\ni = 0\r\nstatic_i = 0\r\npos = 1\r\nfor i in range(len(t)):\r\n if t[i] == s[static_i]:\r\n pos += 1\r\n static_i += 1\r\n \r\nprint(pos)\r\n\r\n", "# URL: https://codeforces.com/problemset/problem/265/A\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\ns = inp().decode()\nt = inp().decode()\nans = 0\nfor x in t:\n if x == s[ans]:\n ans += 1\nout(f\"{ans+1}\\n\")\n", "a = input()\r\nb = input()\r\nc = 0\r\nfor i in range(len(b)):\r\n if a[c] ==b[i]:\r\n c+=1\r\nprint(c+1)", "s=input()\r\nt=input()\r\ncnt=0\r\nfor x in range(0,len(t)):\r\n if s[cnt]==t[x]:\r\n cnt+=1\r\nprint(cnt+1)", "s=input()\r\nt=input()\r\nc=0\r\nfor i in range(len(t)):\r\n if t[i]==s[c]:\r\n c+=1\r\nprint(c+1)", "p = 0\r\nk = input()\r\nl = input()\r\n\r\nfor i in l:\r\n if i == k[p]:\r\n p += 1\r\n if p == len(k):\r\n break\r\nprint(p + 1)\r\n", "s = input()\nt = input()\npos = 1\n\nfor c in t:\n if c == 'R' and s[pos - 1] == 'R':\n pos += 1\n elif c == 'G' and s[pos - 1] == 'G':\n pos += 1\n elif c == 'B' and s[pos - 1] == 'B':\n pos += 1\n\nprint(pos)", "\r\ninitial_string = input()\r\nins_string = input()\r\n\r\nans = 0\r\n#print(initial_string[ans])\r\nfor i in ins_string:\r\n if i == initial_string[ans]:\r\n ans = ans + 1\r\nprint(ans+1)\r\n", "s, t = input(), input()\r\npos = 0\r\nfor i in range(len(t)):\r\n if t[i] == s[pos]:\r\n pos += 1\r\nprint(pos+1)", "l=list(input())\r\nl1=list(input())\r\nt=l[0]\r\nj=0\r\nfor i in range(len(l1)):\r\n if t==l1[i]:\r\n j+=1\r\n t=l[j]\r\nprint(j+1)", "def Get_Position(colors,instructions):\r\n pos=0\r\n for i in instructions:\r\n if(i==colors[pos]):\r\n pos+=1\r\n return pos+1\r\n\r\ndef main():\r\n str1=input()\r\n str2=input()\r\n print(Get_Position(str1,str2))\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n", "s, i = input(), 0\r\nfor x in input():\r\n i += x == s[i]\r\nprint(i + 1)\r\n", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\nt = sys.stdin.readline().strip()\r\n\r\nres = 1\r\n\r\nfor instruction in t:\r\n if instruction == s[res - 1]:\r\n res += 1\r\nprint(res)\r\n", "s=input()\r\nt=input()\r\nc=0\r\nfor i in t:\r\n if i==s[c]:\r\n c+=1\r\nprint(c+1)", "def Number_Of_Stone(s,t):\r\n s_list=list(s)\r\n t_list=list(t)\r\n\r\n Liss=0\r\n \r\n for i in range (0,len(t_list)):\r\n if s_list[Liss]==t_list[i]:\r\n Liss=Liss+1\r\n if Liss >=len(s_list)-1:\r\n break\r\n\r\n return Liss+1\r\n\r\n\r\ns=input()\r\n\r\ns_no_spaces = s.replace(\" \", \"\")\r\ns_list = list(s_no_spaces)\r\nwhile len(s_list)>50 or len(s_list)==0:\r\n s=input()\r\n s_no_spaces = s.replace(\" \", \"\")\r\n s_list = list(s_no_spaces)\r\n\r\nt=input()\r\n\r\nt_no_spaces = t.replace(\" \", \"\")\r\nt_list = list(t_no_spaces)\r\nwhile len(t_list)>50 or len(t_list)==0:\r\n t=input()\r\n t_no_spaces = t.replace(\" \", \"\")\r\n t_list = list(t_no_spaces)\r\n\r\nprint(Number_Of_Stone(s,t))\r\n\r\n\r\n" ]

[ "def main():\r\n b1, q, l, m = map(int, input().split())\r\n a = set(map(int, input().split()))\r\n\r\n if b1 == 0:\r\n if 0 in a:\r\n return 0\r\n else:\r\n return 'inf'\r\n\r\n if q == 0:\r\n if abs(b1) > l:\r\n return 0\r\n\r\n if b1 in a:\r\n if 0 in a:\r\n return 0\r\n else:\r\n return 'inf'\r\n else:\r\n if 0 in a:\r\n return 1\r\n else:\r\n return 'inf'\r\n\r\n if q == 1:\r\n if abs(b1) > l or b1 in a:\r\n return 0\r\n else:\r\n return 'inf'\r\n\r\n if q == -1:\r\n if abs(b1) > l or b1 in a and -b1 in a:\r\n return 0\r\n else:\r\n return 'inf'\r\n\r\n result = 0\r\n b = b1\r\n while True:\r\n if abs(b) > l:\r\n break\r\n\r\n if b not in a:\r\n result += 1\r\n\r\n b *= q\r\n\r\n return result\r\n\r\n\r\nif __name__ == '__main__':\r\n # import sys\r\n # sys.stdin = open(\"B.txt\")\r\n print(main())\r\n\r\n", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nb,q,l,m = ilele()\r\nA = alele()\r\nC = Counter(A)\r\nAns = [b]\r\nif abs(b) > l:\r\n print(0)\r\n exit(0)\r\nfor i in range(100000):\r\n b*= q\r\n if abs(b) > l:\r\n break\r\n Ans.append(b)\r\n#print(Ans)\r\ncount = 0\r\nG = set()\r\nfor i in Ans:\r\n if C.get(i,-1) == -1 and abs(i) <= l:\r\n count += 1\r\n G.add(i)\r\n \r\nif count >= 10000 or (count > 1000 and len(G) <= 3) :\r\n print(\"inf\")\r\nelse:\r\n print(count)\r\n ", "B1, Q, L, M = map(int, input().split())\nAs = set(map(int, input().split()))\n\nBs = []\ntmp = B1\ncnt = 0\nwhile abs(tmp) <= L and cnt < 100:\n if tmp not in As:\n Bs.append(tmp)\n tmp *= Q\n cnt += 1\nif 32 < len(Bs):\n print('inf')\nelse:\n print(len(Bs))\n", "from collections import *\r\nfrom math import *\r\nfrom sys import *\r\ninput=stdin.readline\r\na,q,k,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd=defaultdict(int)\r\nfor i in range(n):\r\n d[l[i]]=1\r\nh=defaultdict(int)\r\nf=0\r\nwhile(abs(a)<=k):\r\n if(h[a]>=2):\r\n f=1\r\n break\r\n h[a]+=1\r\n a=a*q\r\nfor i in d.keys():\r\n if(i in h):\r\n del h[i]\r\nif(sum(h.values())>=2 and f==1):\r\n print(\"inf\")\r\nelse:\r\n print(len(h.keys()))\r\n", "b,q,l,m=map(int,input().split())\r\na=set(list(map(int,input().split())))\r\nc=0\r\nfor i in range(100):\r\n if abs(b)>l: break\r\n if b not in a: c+=1\r\n b*=q\r\nif c<32:\r\n print (c)\r\nelse:\r\n print('inf')\r\n", "R=lambda:list(map(int,input().split()))\nb,q,i,m=R()\na=set(R())\nc=0\nfor _ in range(99):\n if abs(b)>i: break\n if b not in a: c+=1\n b*=q\nprint(c if c<32 else'inf')\n", "import sys\n\nb, q, l, m = [int(x) for x in input().split()]\na = [int(x) for x in input().split()]\n\nif abs(b) > l:\n print(0)\n sys.exit()\n\nif b == 0:\n if 0 in a:\n print(0)\n else:\n print('inf')\nelif q == 0:\n if not 0 in a: \n print('inf')\n elif b in a:\n print(0)\n else:\n print(1)\nelif q == 1:\n if b in a:\n print(0)\n else:\n print('inf')\nelif q == -1:\n if (not b in a) or (not -b in a):\n print('inf')\n else:\n print(0)\nelse:\n cnt = 0\n bn = b\n while abs(bn)<=l:\n if not bn in a:\n cnt+=1\n bn*=q\n print(cnt)\n\n", "b, q, l, m = list(map(int, input().split()))\r\na = set(map(int, input().split()))\r\nif b == 0 and 0 not in a:\r\n print(\"inf\")\r\nelif q == 0 and abs(b) <= l and 0 not in a:\r\n print(\"inf\")\r\nelif q == 1 and abs(b) <= l and b not in a:\r\n print(\"inf\")\r\nelif q == -1 and abs(b) <= l:\r\n if b in a and -b in a:\r\n print(0)\r\n else:\r\n print(\"inf\")\r\nelse:\r\n ans = 0\r\n while abs(b) <= l:\r\n if b not in a:\r\n ans += 1\r\n if b * q == b:\r\n break\r\n b *= q\r\n print(ans)\r\n", "b1,q,l,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nif abs(b1)>l:\r\n print(0)\r\nelif b1==0:\r\n if b1 in a:\r\n print(0)\r\n else:\r\n print('inf')\r\nelif q==1:\r\n if b1 in a:\r\n print(0)\r\n else:\r\n print('inf')\r\nelif q==-1:\r\n if b1 in a and -b1 in a:\r\n print(0)\r\n else:\r\n print('inf')\r\nelif q==0:\r\n if 0 not in a:\r\n print('inf')\r\n elif b1 in a:\r\n print(0)\r\n else:\r\n print(1)\r\nelse:\r\n ans=0\r\n while abs(b1)<=l:\r\n if b1 not in a:\r\n ans=ans+1\r\n b1=b1*q\r\n print(ans)", "b1, q, l, m = map(int, input().split())\nbad = set(map(int, input().split()))\nif abs(b1) > l:\n print(0)\nelif q == 0 or b1 == 0:\n if 0 in bad:\n if b1 in bad:\n print(0)\n elif abs(b1) <= l:\n print(1)\n else:\n print(0)\n else:\n print(\"inf\")\nelif q == 1:\n if b1 in bad or abs(b1) > l:\n print(0)\n else:\n print(\"inf\")\nelif q == -1:\n if b1 in bad and -b1 in bad or abs(b1) > l:\n print(0)\n else:\n print(\"inf\")\nelse:\n ans = 0\n while abs(b1) <= l:\n if b1 not in bad:\n ans += 1\n b1 *= q\n print(ans)", "miis = lambda:map(int,input().split())\r\nb,q,l,m = miis()\r\n*a, = miis()\r\nc = 0\r\nfor _ in ' '*100:\r\n if abs(b)>l: break\r\n if b not in a: c+=1\r\n b*=q\r\nif c<35:\r\n print (c)\r\nelse:\r\n print ('inf')\r\n", "b, q, l, m = list(map(int, input().split()))\r\na = set(list(map(int, input().split())))\r\nans = 0\r\nboo = False\r\ni = 0\r\nwhile (i < 34) and (abs(b) <= l):\r\n if (b not in a):\r\n ans += 1\r\n if i > 31:\r\n boo = True\r\n b *= q\r\n i += 1\r\nif boo:\r\n print('inf')\r\nelse:\r\n print(ans)", "import sys\r\n\r\ndef solve():\r\n b1, q, L, m = map(int, input().split())\r\n a = [int(i) for i in input().split()]\r\n\r\n a = set(a)\r\n\r\n if b1 == 0:\r\n print(0 if b1 in a else 'inf')\r\n return\r\n\r\n if q == 1:\r\n if abs(b1) > L or b1 in a:\r\n print(0)\r\n else:\r\n print('inf')\r\n elif q == -1:\r\n if abs(b1) > L or (b1 in a and -b1 in a):\r\n print(0)\r\n else:\r\n print('inf')\r\n elif q == 0:\r\n if abs(b1) > L:\r\n print(0)\r\n elif 0 in a:\r\n print(0 if b1 in a else 1)\r\n else:\r\n print('inf')\r\n else:\r\n b = b1\r\n ans = 0\r\n\r\n while abs(b) <= L:\r\n if b not in a:\r\n ans += 1\r\n b *= q\r\n\r\n print(ans)\r\n\r\ndef debug(x, table):\r\n for name, val in table.items():\r\n if x is val:\r\n print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)\r\n return None\r\n\r\nif __name__ == '__main__':\r\n solve()", "R=lambda:list(map(int,input().split()))\r\nb,q,i,m=R()\r\na=set(R())\r\nc=0\r\nfor _ in range(99):\r\n if abs(b)>i: break\r\n if b not in a: c+=1\r\n b*=q\r\nprint(c if c<32 else'inf')\r\n" ]

[ "from sys import stdin, stdout\r\n\r\nclass Block:\r\n def __init__(self, id, offset, size):\r\n self.id = id\r\n self.offset = offset\r\n self.size = size\r\n\r\n def __str__(self):\r\n return \"{0} {1} {2}\".format(self.id, self.offset, self.size)\r\n\r\n\r\nclass MemoryManager:\r\n def __init__(self, capacity):\r\n self.capacity = capacity\r\n self.blocks = [Block(-1, 0, 0), Block(-1, 100, 0)]\r\n self.last_block_id = 0\r\n\r\n def get_available_position(self, amount):\r\n prev_block = self.blocks[0]\r\n for i in range(1, len(self.blocks)):\r\n curr_block = self.blocks[i]\r\n avail_offset = prev_block.offset + prev_block.size\r\n avail_amount = curr_block.offset - avail_offset\r\n if avail_amount >= amount and avail_offset + amount <= capacity:\r\n return i\r\n prev_block = curr_block\r\n return None\r\n\r\n def allocate(self, amount):\r\n avail_position = self.get_available_position(amount)\r\n if avail_position == None:\r\n return None\r\n self.last_block_id += 1\r\n prev_block = self.blocks[avail_position - 1]\r\n self.blocks.insert(avail_position, Block(self.last_block_id, prev_block.offset + prev_block.size, amount))\r\n return self.last_block_id\r\n\r\n def erase(self, block_id):\r\n for block in self.blocks:\r\n if block.id == block_id and block_id != -1:\r\n self.blocks.remove(block)\r\n return True\r\n return False\r\n\r\n def defragment(self):\r\n block_count = len(self.blocks)\r\n prev_block = self.blocks[0]\r\n for i in range(1, block_count):\r\n curr_block = self.blocks[i]\r\n curr_block.offset = prev_block.offset + prev_block.size\r\n prev_block = curr_block\r\n self.blocks[block_count - 1].offset = 100\r\n\r\n\r\nclass MemoryManagerConsole:\r\n def __init__(self, memory_manager: MemoryManager):\r\n self.memory_manager = memory_manager\r\n\r\n def read(self):\r\n input = stdin.readline().rstrip().split()\r\n command = input[0]\r\n if command == 'alloc':\r\n amount = int(input[1])\r\n block_id = self.memory_manager.allocate(amount)\r\n # self.print_blocks()\r\n return str(block_id or 'NULL')\r\n elif command == 'erase':\r\n block_id = int(input[1])\r\n if self.memory_manager.erase(block_id) == False:\r\n # self.print_blocks()\r\n return 'ILLEGAL_ERASE_ARGUMENT'\r\n # self.print_blocks()\r\n elif command == 'defragment':\r\n self.memory_manager.defragment()\r\n # self.print_blocks()\r\n return None\r\n\r\n def print_blocks(self):\r\n for block in self.memory_manager.blocks:\r\n stdout.write(str(block) + \"\\n\")\r\n\r\n\r\ncommand_count, capacity = map(int, stdin.readline().rstrip().split())\r\nmemory_manager = MemoryManager(capacity)\r\nmanager_console = MemoryManagerConsole(memory_manager)\r\noutput_batch = list()\r\nfor i in range(command_count):\r\n result = manager_console.read()\r\n if result != None:\r\n output_batch.append(result)\r\n\r\nfor output in output_batch:\r\n stdout.write(output + \"\\n\")", "mem = [-1] * 150\r\nblock = 0\r\n\r\ndef pfa(n):\r\n for i in range(1, n+1):\r\n print(mem[i], end=\" \")\r\n print()\r\n\r\ndef alloc(n, sz):\r\n global block\r\n cnt, idx = 0, -1\r\n for i in range(1, n+1):\r\n if mem[i] == -1 and idx == -1:\r\n cnt, idx = cnt+1, i\r\n elif mem[i] == -1:\r\n cnt += 1\r\n else:\r\n if cnt < sz:\r\n cnt, idx = 0, -1\r\n if cnt == sz:\r\n block += 1\r\n for j in range(idx, idx+sz):\r\n mem[j] = block\r\n print(block)\r\n return\r\n print(\"NULL\")\r\n\r\ndef erase(n, x):\r\n f = False\r\n for i in range(1, n+1):\r\n if mem[i] == x:\r\n mem[i], f = -1, True\r\n if not f:\r\n print(\"ILLEGAL_ERASE_ARGUMENT\")\r\n\r\ndef defragment(n):\r\n for i in range(1, n+1):\r\n if mem[i] > 0:\r\n k = -1\r\n for j in range(i-1, 0, -1):\r\n if mem[j] == -1:\r\n k = j\r\n else:\r\n if k >= 1:\r\n mem[i], mem[k] = mem[k], mem[i]\r\n k = -1\r\n break\r\n if k != -1:\r\n mem[i], mem[k] = mem[k], mem[i]\r\n\r\nn, m = map(int, input().split())\r\nfor i in range(n):\r\n op = input().split()\r\n if op[0] == \"defragment\":\r\n defragment(m)\r\n else:\r\n x = int(op[1])\r\n if op[0] == \"alloc\":\r\n alloc(m, x)\r\n else:\r\n if x >= 1:\r\n erase(m, x)\r\n else:\r\n print(\"ILLEGAL_ERASE_ARGUMENT\")\r\n # pfa(m)\r\n", "t, m =map(int, input().split())\nalocuente = [0]*m\nind =1\nfor i in range(t):\n op=input().split()\n if op[0]=='alloc':\n pos=0\n for j in range(m):\n if alocuente[j]==0:\n pos += 1\n if pos == int(op[1]):\n alocuente[j-int(op[1])+1:j+1]=[ind]*int(op[1])\n print(ind)\n ind+=1\n break\n else:\n pos=0\n else:\n print(\"NULL\")\n if op[0]=='erase':\n pos=0\n if int(op[1]) not in alocuente or int (op[1])==0:\n print('ILLEGAL_ERASE_ARGUMENT')\n else:\n for j in range(m):\n if int(op[1])>0 and alocuente[j]==int(op[1]):\n alocuente[j]=0\n if op[0] ==\"defragment\":\n cnt=0\n cnt=alocuente.count(0)\n alocuente=[j for j in alocuente if j !=0]\n for j in range(cnt):\n alocuente.append(0)\n\n\n\n\n\n \t\t\t\t \t \t\t \t\t \t \t\t\t \t\t \t\t \t", "t,m=map(int,input().split())\r\nmemory=[0]*m\r\nind=[1]\r\ndef alloc(n):\r\n lng=0\r\n for i in range(m):\r\n if memory[i]==0:\r\n lng+=1\r\n if lng==n:\r\n memory[i-lng+1:i+1]=[ind[0]]*n\r\n ind[0]+=1\r\n return ind[0]-1\r\n else:\r\n lng=0\r\n return \"NULL\"\r\n\r\ndef erase(n):\r\n flag=0\r\n for i in range(m):\r\n if n!=0 and memory[i]==n:\r\n memory[i]=0\r\n flag=1\r\n if flag==0:\r\n print(\"ILLEGAL_ERASE_ARGUMENT\")\r\ndef defrag():\r\n offs=0\r\n for i in range(m):\r\n if offs!=0 and memory[i]!=0:\r\n memory[i-offs],memory[i]=memory[i],0\r\n elif memory[i]==0:\r\n offs+=1\r\n\r\nfor i in range(t):\r\n command=input().split()\r\n if len(command)==2:\r\n if command[0]=='alloc':\r\n print(alloc(int(command[1])))\r\n if command[0]=='erase':\r\n erase(int(command[1]))\r\n else:\r\n defrag()\r\n\r\n", "#7B - Memory Manager\r\n# t - number of further commands\r\n# m - number of bytes to allocate\r\nt, m = map(int, input().split())\r\n# we \"allocate\" the bytes through s:\r\ns = [0] * m\r\n#Counter:\r\nc = 0\r\n\r\nfor i in range(t):\r\n #Now, we take the commands in:\r\n\top = input().split()\r\n #\r\n\tif op[0] == 'alloc':\r\n # n = the value written next to the \"alloc\" statement\r\n\t\tn = int(op[1])\r\n #We allocate the memory to the free blocks that are the closest to byte #1\r\n #So, we look for the beginning of that block:\r\n\t\tp = min([i for i in range(m - n + 1) if all(not x for x in s[i : i + n])] + [m])\r\n #If the index of the free block is not the end of the entire allocated memory array: \r\n\t\tif p < m:\r\n #We count that as a successful operation and add print its number:\r\n\t\t\tc += 1\r\n\t\t\tprint(c)\r\n\t\t\tfor i in range(p, p + n):\r\n\t\t\t\ts[i] = c\r\n #If it is impossible to allocate a free block of this size,\r\n #the function returns NULL:\r\n\t\telse:\r\n\t\t\tprint('NULL')\r\n #If the command is to erase a command:\r\n\telif op[0] == 'erase':\r\n #x - The number of the command to be erased\r\n\t\tx = int(op[1])\r\n #If such command exists (command number x to be erased):\r\n\t\tif x > 0 and s.count(x):\r\n #We set all the cells occupied by that specific block back to 0\r\n\t\t\tfor i in [i for i, v in enumerate(s) if v == x]:\r\n\t\t\t\ts[i] = 0\r\n\t\telse:\r\n\t\t\tprint ('ILLEGAL_ERASE_ARGUMENT')\r\n #If the command is to fragment the memory:\r\n\telse:\r\n #We make the occupied blocks come closer together, to the byte #1\r\n\t\ts = ([v for v in s if v] + [0] * m)[ : m]", "\ndef input_data():\n n, m = list(map(int, input().strip().split()))\n cmd = []\n\n for i in range(n):\n line = input().strip()\n if line[0] == 'a':\n num = int(line[line.find(\" \")+1:])\n cmd.append(('a', num))\n elif line[0] == 'e':\n id = int(line[line.find(\" \")+1:])\n cmd.append(('e', id))\n else:\n cmd.append(('d', 0))\n\n return n, m, cmd\n\n\ndef dump_mem(m, mem):\n mem_list = [0]*m\n for block_id in mem:\n mem_st, mem_ed = mem[block_id]\n if mem_st < 0:\n continue\n for i in range(mem_st, mem_ed+1):\n mem_list[i] = block_id\n\n return mem_list\n\n\ndef try_alloc(m, num, mem):\n mem_list = dump_mem(m, mem)\n for i in range(0, m):\n if mem_list[i] <= 0:\n is_ok = True\n for j in range(0, num):\n if i+j >= m or mem_list[i+j] > 0:\n is_ok = False\n break\n if is_ok:\n return i, i+num-1\n\n return -1, -1\n\n\ndef defragment(m, mem):\n mem_list = dump_mem(m, mem)\n prev_block_id = 0\n mem_st = 0\n # print(\"mem_list=\", mem_list)\n # print(\"mem=\", mem)\n for i in range(m):\n if mem_list[i] != prev_block_id and mem_list[i] != 0:\n prev_block_id = mem_list[i]\n st, ed = mem[mem_list[i]]\n new_st, new_ed = mem_st, mem_st+ed-st\n mem_st = new_ed+1\n # update mem\n mem[mem_list[i]] = (new_st, new_ed)\n # print(\"after defragment, mem=\", mem)\n return mem\n\n\ndef solve_prob(n, m, cmd):\n block_id = 1\n mem = {}\n for c in cmd:\n if c[0] == 'a':\n mem_st, mem_ed = try_alloc(m, c[1], mem)\n if mem_st < 0:\n print(\"NULL\")\n else:\n print(block_id)\n mem[block_id] = (mem_st, mem_ed)\n block_id += 1\n elif c[0] == 'e':\n if c[1] not in mem or mem[c[1]][0] < 0:\n print(\"ILLEGAL_ERASE_ARGUMENT\")\n else:\n mem[c[1]] = (-1, -1)\n else:\n mem = defragment(m, mem)\n\n\nif __name__ == \"__main__\":\n n, m, cmd = input_data()\n solve_prob(n, m, cmd)\n", "\r\ndef alloc(array, number, arr_filled):\r\n req_zeroes = [0]*number\r\n flag = False\r\n if number <= len(array):\r\n for i in range((len(array)+1)-number):\r\n if array[i:i+number] == req_zeroes:\r\n flag = True\r\n if not arr_filled:\r\n for j in range(i, i+number):\r\n array[j] = 1\r\n arr_filled.append(1)\r\n print(1)\r\n break\r\n else:\r\n arr_filled.append(len(arr_filled) + 1)\r\n for j in range(i, i + number):\r\n array[j] = array_filled[-1]\r\n print(array_filled[-1])\r\n break\r\n if not flag:\r\n print('NULL')\r\n return array\r\n\r\ndef erase(array, arr_filled, to_erase):\r\n flag = False\r\n if to_erase not in arr_filled:\r\n print('ILLEGAL_ERASE_ARGUMENT')\r\n else:\r\n for i in range(len(array)):\r\n if array[i] == to_erase:\r\n array[i] = 0\r\n flag = True\r\n else:\r\n if flag:\r\n break\r\n arr_filled[arr_filled.index(to_erase)] = '@'\r\n\r\n return array\r\n\r\n\r\ndef defragment(array, number, arr_filled):\r\n if arr_filled:\r\n array = [i for i in array if i != 0]\r\n new_number = number - len(array)\r\n for i in range(new_number):\r\n array.append(0)\r\n return array\r\n\r\n\r\n\r\n\r\nt, m = map(int, input().split())\r\narray = [0] * m\r\narray_filled = []\r\nfor _ in range(t):\r\n string = input()\r\n if string != 'defragment':\r\n command, number = string.split()\r\n number = int(number)\r\n if command == 'alloc':\r\n array = alloc(array, number, array_filled)\r\n elif command == 'erase':\r\n array = erase(array, array_filled, number)\r\n else:\r\n array = defragment(array, m, array_filled)\r\n\r\n\r\n", "commands, bytes = map(int, input().split())\r\ns = [0] * bytes\r\nc = 0\r\n \r\nfor i in range(commands):\r\n op = input().split()\r\n if op[0] == 'alloc':\r\n # n = the value written next to the \"alloc\" statement\r\n \tn = int(op[1])\r\n # search for a block\r\n \tp = min([i for i in range(bytes - n + 1) if all(not x for x in s[i : i + n])] + [bytes])\r\n # if fitted\r\n \tif p < bytes:\r\n \t\tc += 1\r\n \t\tprint(c)\r\n \t\tfor i in range(p, p + n):\r\n \t\t\ts[i] = c\r\n # if didn't fit\r\n \telse:\r\n \t\tprint('NULL')\r\n \t\t\t\r\n elif op[0] == 'erase':\r\n \tx = int(op[1])\r\n # if command exists\r\n \tif x > 0 and s.count(x):\r\n # set all the cells occupied by that specific block back to 0\r\n \t\tfor i in [i for i, v in enumerate(s) if v == x]:\r\n \t\t\ts[i] = 0\r\n \telse:\r\n \t\tprint ('ILLEGAL_ERASE_ARGUMENT')\r\n else:\r\n # defragment\r\n \ts = ([v for v in s if v] + [0] * bytes)[ : bytes]", "#!/usr/bin/env python\n\n\ndef main():\n t, m = map(int, input().split())\n\n nil = 0, 0, 0\n skip = [list(nil) for _ in range(m + 1)]\n skip[0][:] = 0, m, 0\n\n block = dict()\n\n free = m\n nth = 0\n for _ in range(t):\n line = input()\n cmd = line[0]\n if cmd == \"a\":\n size = int(line[6:])\n if size > free:\n print(\"NULL\")\n continue\n base = 0\n while base < m:\n used, span, last = skip[base]\n if not used and span >= size:\n break\n base += span\n else:\n print(\"NULL\")\n continue\n nth += 1\n print(nth)\n free -= size\n block[nth] = base\n skip[base][:] = nth, size, last\n merge = base + span\n if span != size:\n span -= size\n if skip[merge][0]:\n skip[base + size][:] = 0, span, size\n else:\n skip[base + size][:] = 0, span + skip[merge][1], size\n skip[merge][:] = nil\n elif cmd == \"e\":\n base = block.pop(int(line[6:]), -1)\n if base < 0:\n print(\"ILLEGAL_ERASE_ARGUMENT\")\n continue\n size = skip[base][1]\n free += size\n merge = base + size\n if not skip[merge][0]:\n size += skip[merge][1]\n skip[merge][:] = nil\n merge = base - skip[base][2]\n if not base or skip[merge][0]:\n skip[base][:2] = 0, size\n else:\n skip[merge][1] += size\n skip[base][:] = nil\n elif block and free:\n base = move = last = 0\n while move < m:\n if skip[move][0]:\n if move != base:\n skip[base][:] = skip[move]\n skip[move][:] = nil\n block[skip[base][0]] = base\n skip[base][2] = last\n last = skip[base][1]\n base += last\n move += last\n else:\n size = skip[move][1]\n skip[move][:] = nil\n move += size\n skip[base][:] = 0, free, last\n\n\nif __name__ == '__main__':\n main()\n", "def findnextnonzero(arr,i,end ):\r\n i += 1\r\n while i < end and arr[i] == 0:\r\n i += 1\r\n return i\r\nn,m = map(int, input().split())\r\na = [ 0 for i in range(m)]\r\ncur = 0\r\nal = set()\r\nnum = 1\r\nfor i in range(n):\r\n s = input()\r\n if s[0] == 'a':\r\n x = int(s[6:]) \r\n pos = 0\r\n cur = 0\r\n while cur < x and pos < m:\r\n if a[pos] == 0:\r\n cur += 1\r\n else:\r\n cur = 0\r\n pos += 1\r\n #print(pos,cur)\r\n if cur == x:\r\n print(num)\r\n al.add(num)\r\n for i in range(pos - x,pos):\r\n a[i] = num\r\n num += 1\r\n #print(a)\r\n else:\r\n print('NULL')\r\n \r\n elif s[0] == 'e':\r\n x = int(s[6:]) \r\n if x in al:\r\n for pos in range(m):\r\n if a[pos] == x:\r\n a[pos] = 0\r\n al.remove(x)\r\n else:\r\n print('ILLEGAL_ERASE_ARGUMENT')\r\n \r\n else:\r\n for pos in range(m):\r\n if a[pos] == 0:\r\n x = findnextnonzero(a,pos,m)\r\n if x < m:\r\n a[pos] = a[x]\r\n a[x] = 0\r\n #print(a)\r\n \r\n ", "t, m = [int(w) for w in input().split() if w.isdigit()]\n\nsequence = 1\nmem = []\n\ndef make_mem(n: int):\n global mem\n mem = [[-1,-1,0], [n, n, 0]]\n\ndef alloc(n: int):\n idx = -1\n for i in range(len(mem) -1):\n a, b, _ = mem[i]\n gap = mem[i + 1][0] - b - 1\n if gap >= n:\n global sequence\n mem.insert(i + 1, [b + 1, b + n, sequence])\n print(sequence)\n sequence += 1\n return\n print('NULL')\n\n\ndef erase(n: int):\n for i in range(1, len(mem) - 1):\n if n == mem[i][-1]:\n mem.pop(i)\n return\n print('ILLEGAL_ERASE_ARGUMENT ')\n\n\ndef defrag():\n for i in range(len(mem) - 2):\n if mem[i + 1][0] > mem[i][1] + 1:\n gap = mem[i + 1][0] - (mem[i][1] + 1)\n mem[i + 1][0] -= gap\n mem[i + 1][1] -= gap\n\nmake_mem(m)\nfor _ in range(t):\n command = list(input().split())\n if command[0] == 'alloc':\n alloc(int(command[1]))\n elif command[0] == 'erase':\n erase(int(command[1]))\n elif command[0] == 'defragment':\n defrag()\n", "from bisect import *\n\nt, m = (int(x) for x in input().split())\n\nclass Block:\n def __init__(self, size, free, prv, nxt):\n self.size = size\n self.free = free\n self.prv = prv\n self.nxt = nxt\n\nblock0 = Block(0, m, None, None)\nblocks = {}\nnext_id = 1\n\nfor i in range(t):\n c = input().split()\n \n if c[0] == \"alloc\":\n size = int(c[1])\n \n block = block0\n while block and block.free < size:\n block = block.nxt\n \n if not block:\n print(\"NULL\")\n continue\n \n new = Block(size, block.free - size, block, block.nxt)\n \n block.free = 0\n \n new.prv.nxt = new\n if new.nxt:\n new.nxt.prv = new\n \n blocks[next_id] = new\n print(next_id)\n \n next_id += 1\n \n elif c[0] == \"erase\":\n id = int(c[1])\n \n if id not in blocks:\n print(\"ILLEGAL_ERASE_ARGUMENT\")\n continue\n \n block = blocks[id]\n \n block.prv.free += block.size + block.free\n \n if block.prv:\n block.prv.nxt = block.nxt\n if block.nxt:\n block.nxt.prv = block.prv\n \n del blocks[id]\n \n elif c[0] == \"defragment\":\n defrag = 0\n \n block = block0\n while True:\n defrag += block.free\n block.free = 0\n if not block.nxt:\n break\n block = block.nxt\n \n block.free = defrag\n", "# Codeforces Beta Round #7\n# B. Memory Manager\n\nt, m = map(int, input().split())\n\n# Store memory as a string, where 0 means free and 1 means occupied. This\n# allows us to search for free memory by finding the first index of \"00..0\"\nmem = \"0\" * m\n\nalloc_counter = 0\n\n# Map of index -> (start, size) of used memory blocks\nblocks = {}\n\nfor _ in range(t):\n command = input().split()\n\n if command[0] == \"alloc\":\n size = int(command[1])\n\n # Try to find a free block, if it doesn't exist, continue\n if \"0\" * size not in mem:\n print(\"NULL\")\n continue\n\n # Find the index, and set the block to all 1's\n start = mem.find(\"0\" * size)\n mem = mem[:start] + \"1\" * size + mem[size + start:]\n\n # Update the list of blocks\n alloc_counter += 1\n blocks[alloc_counter] = (start, size)\n print(alloc_counter)\n\n elif command[0] == \"erase\":\n index = int(command[1])\n\n # If the index doesn't exist, continue\n if index not in blocks:\n print(\"ILLEGAL_ERASE_ARGUMENT\")\n continue\n\n # Erase the block and fill the memory with 0's\n start, size = blocks[index]\n del blocks[index]\n mem = mem[:start] + \"0\" * size + mem[size + start:]\n\n else:\n # First store blocks as (start, size, index), and sort by start\n new_blocks = sorted([\n (blocks[index][0], blocks[index][1], index) for index in blocks\n ])\n\n # Compress them, then update blocks and memory\n compressed = {}\n p = 0\n for start, size, index in new_blocks:\n compressed[index] = (p, size)\n p += size\n\n blocks = compressed\n mem = \"1\" * p + \"0\" * (m - p)\n", "t, m = map(int, input().split())\r\nmem = [True] * m\r\nwhere = []\r\nlens = []\r\nfor i in range(t):\r\n cmd = input()\r\n if cmd[0] == 'a':\r\n cmd, n = cmd.split()\r\n n = int(n)\r\n for st in range(m - n + 1):\r\n if all(mem[st : st + n]):\r\n x = len(where)\r\n where.append(st)\r\n lens.append(n)\r\n mem[where[x] : where[x] + lens[x]] = [False] * lens[x]\r\n print(x + 1)\r\n break\r\n else:\r\n print('NULL')\r\n elif cmd[0] == 'e':\r\n cmd, x = cmd.split()\r\n x = int(x) - 1\r\n if x < 0 or x >= len(where) or where[x] == -1:\r\n print('ILLEGAL_ERASE_ARGUMENT')\r\n else:\r\n mem[where[x] : where[x] + lens[x]] = [True] * lens[x]\r\n where[x] = -1\r\n else:\r\n for j in range(1, m):\r\n if not mem[j] and mem[j - 1]:\r\n x = where.index(j)\r\n st = j - 1\r\n while st > 0 and mem[st - 1]:\r\n st -= 1\r\n mem[where[x] : where[x] + lens[x]] = [True] * lens[x]\r\n where[x] = st\r\n mem[where[x] : where[x] + lens[x]] = [False] * lens[x]\r\n" ]

[ "A = list(map(int,input().split()))\r\na = A[0];b = A[1];r = A[2]\r\nif 2*r <= min(a,b):\r\n\tprint('First')\r\nelse:\r\n\tprint('Second')", "a, b, c = map(int, input().split())\r\nif a < c * 2 or b < c * 2:\r\n print(\"Second\")\r\nelse :\r\n print(\"First\")", "# https://codeforces.com/problemset/problem/197/A\r\na,b,r = list(map(int,input().split()))\r\nif 2*r > min(a,b):\r\n print('Second')\r\nelse:\r\n print('First')", "a,b,r=[int(s) for s in input().split()]\r\nif a < r*2 or b < r*2:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\ndef main():\r\n for _ in range(1):\r\n a, b, r =read_int_list()\r\n if r + r <= min(a, b):\r\n print('First')\r\n else:\r\n print('Second')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n # cProfile.run(\"main()\")", "a, b, r=map(int, input().split())\r\nr*=2\r\na//=r\r\nb//=r\r\nif a==0 or b==0:\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"First\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, r = map(int, input().split())\r\nif r*2 > a or r*2 > b:\r\n print('Second')\r\nelse:\r\n print('First')", "def find_plate_game_winner():\r\n\ta, b, r = map(int, input().split())\r\n\tdiameter = 2*r\r\n\r\n\tif a < diameter or b < diameter:\r\n\t\tprint(\"Second\")\r\n\telse:\r\n\t\tprint(\"First\")\r\n\r\n\r\nfind_plate_game_winner()\r\n", "a,b,r=map(int,input().split())\r\nif(a>=2*r and b>=2*r):\r\n\tprint(\"First\")\r\nelse:\r\n\tprint(\"Second\")", "def main(a, b, r):\n return \"First\" if 2 * r <= min(a, b) else \"Second\"\n\n(a, b, r) = map(int, input().split(' '))\nprint(main(a, b, r))\n", "A, B, R = map(int, input().split())\nif 2 * R > min(A, B) :\n print(\"Second\")\nelse :\n print(\"First\")", "a=[int(i) for i in input().split()]\r\nl=a[0]\r\nb=a[1]\r\nr=a[2]\r\nrarea=l*b\r\nparea=3.14*r*r\r\nresult=\"Second\"\r\nwhile(parea<rarea and (2*r<=l) and (2*r<=b)):\r\n result=\"First\"\r\n parea+=parea\r\nprint(result)\r\n \r\n \r\n\r\n", "a,b,r=map(int,input().split())\r\nprint('SFeicrosntd'[min(a,b)>=2*r::2])", "a,b,r = map(int,input().split())\r\nd = r+r\r\nk = a//d\r\np = b//d\r\n\r\nif(k>0 and p>0):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,c=map(int,input().split())\r\ndia=2*c\r\nif(dia>min(a,b)):\r\n print('Second')\r\nelse:\r\n print('First')\r\n\r\n# CodeBy: RAHUL MAHAJAN\r\n# A2OJ: rahulmahajan\r\n# CC: anonymous0201\r\n# CF: rahulmahajan\r\n# CSES: rahulmahajan", "def main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n get = lambda :[int(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\n [a,b,r]=get()\r\n print(\"First\" if min(a,b) >= 2*r else \"Second\")\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\r\n", "a,b,r = map(int,input().split())\r\nd = 2*r \r\nif d <= min(a,b):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,r=map(int,input().split())\r\nif a<2*r or b<2*r:\r\n exit(print('Second'))\r\nelse:\r\n exit(print(\"First\"))", "a,b,r=map(int,input().split())\r\n(print(\"First\")if (a>=2*r and b>=2*r) else print(\"Second\"))\r\n\r\n", "n, m, k = map(int, input().split())\nprint ('SFeicrosntd'[min(n, m) >= k * 2::2])", "a, b, r = map(int, input().split())\r\nprint(\"Second\" if (2*r > min(a, b)) else \"First\")\r\n", "a,b,c=map(int,input().split())\r\nprint(['First','Second'][min(a,b)<2*c])", "from random import *\nimport math as m\n\nw,h,r = map(int,input().split())\n\nif r*2 > min(w,h):\n print(\"Second\")\nelse:\n print(\"First\")\n \t \t\t \t\t\t \t \t\t \t \t", "import math\r\n\r\na , b , r = map(int , input().split())\r\nif r * 2 <= min(a , b):\r\n\tprint ('First')\r\nelse:\r\n\tprint ('Second')\r\n\r\n", "a, b, r = map(int, input().split())\nif r * 2 <= a and r * 2 <= b:\n print(\"First\")\nelse:\n print(\"Second\")\n# Thu Jul 07 2022 18:08:07 GMT+0000 (Coordinated Universal Time)\n", "a, b, r = map(int, input().split())\r\nSc = 3.14 * (r**2)\r\nSs = a * b\r\np = \"First\"\r\nif a < r * 2 or b < r * 2:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "a,b,r=map(int,input().split())\r\nif(2*r>min(a,b)):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "a,b,r = map(int,input().split())\r\nd = r * 2\r\nm = min(a,b)\r\nif m >= d:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "\r\ns = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\nr = int(s[2])\r\n\r\nif 2*r>min(a,b):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "r,p,l= map(int,input().split())\r\nprint(\"First\")if (2*l<=min(r, p))else print(\"Second\")\r\n", "a, b, r = map(int, input().split())\r\nif min(a, b) >= 2 * r:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\na,b,r=(int(i) for i in input().split())\r\nif(2*r>min(a,b)):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "# python 3\n\"\"\"\nFrom tutorial:\nIf first player can't make first move (table is too small and plate doesn't fit it, i.e. 2r > min(a, b)),\nsecond player wins. Else first player wins. Winning strategy for first player:\nplace first plate to the center of table. After that he symmetrically reflects moves of second player\nwith respect to center of table.\nIf second player has move, first player has symmetrical move, too. If not, first player won.\n\"\"\"\n\n\ndef plate_game(a_int, b_int, r_int) -> None:\n if 2 * r_int > min(a_int, b_int):\n print(\"Second\")\n else:\n print(\"First\")\n\n\nif __name__ == \"__main__\":\n \"\"\"\n Inside of this is the test. \n Outside is the API\n \"\"\"\n a, b, r = list(map(int, input().split()))\n\n plate_game(a, b, r)\n", "import sys\r\nfrom math import sqrt,ceil,floor,gcd\r\nfrom collections import Counter\r\n\r\ninput = lambda:sys.stdin.readline()\r\n\r\ndef int_arr(): return list(map(int,input().split()))\r\ndef str_arr(): return list(map(str,input().split()))\r\ndef get_str(): return map(str,input().split())\r\ndef get_int(): return map(int,input().split())\r\ndef get_flo(): return map(float,input().split())\r\ndef lcm(a,b): return (a*b) // gcd(a,b)\r\n\r\nmod = 1000000007\r\n\r\ndef solve():pass\r\n\r\n\r\n# for _ in range(int(input())):\r\nh,w,r = get_int()\r\ndia = 2*r\r\n\r\nl,r,u,d = 0,0,0,0\r\n\r\nif dia > h or dia > w:\r\n print(\"Second\")\r\nelse:\r\n l = w-dia\r\n r = w-dia\r\n u = h-dia\r\n d = h-dia\r\n win = 0\r\n while True:\r\n if l > 0 or r > 0 or u > 0 or d > 0:\r\n if dia <= l:\r\n l -= dia\r\n if not win:\r\n win = 1\r\n else:\r\n win = 0\r\n\r\n if dia <= r:\r\n r -= dia\r\n if not win:\r\n win = 1\r\n else:\r\n win = 0\r\n\r\n if dia <= u:\r\n u -= dia\r\n if not win:\r\n win = 1\r\n else:\r\n win = 0\r\n\r\n if dia <= d:\r\n d -= dia\r\n if not win:\r\n win = 1\r\n else:\r\n win = 0\r\n\r\n else:\r\n break\r\n else:\r\n break\r\n\r\n print(\"First\" if not win else \"Second\")\r\n\r\n\r\n ", "a , b , r = map(int, input().split())\r\nprint(['Second' , 'First'][2*r <= min(a,b)])", "s = input().split()\r\n(a,b,r) = (int(i) for i in s)\r\nif(2*r > min(a,b)):\r\n\tprint('Second')\r\nelse:\r\n\tprint('First')\r\n\r\n", "a,b,r = map(int, input(). strip(). split())\r\nif 2*r > min(a,b):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "import math\r\na,b,r=list(map(int,input().split()))\r\n\r\nif 2*r<=min(a,b):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,r=list(map(int,input().split()))\r\nprint('First' if min(a,b)>=2*r else 'Second')", "n, m, r = map(int, input().split())\nprint('Second' if r + r > n or r + r > m else 'First')", "a,b,r=map(int,input().split());print(\"First\") if(a>=2*r and b>=2*r) else print(\"Second\")", "from math import pow\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\npie=3.142367\r\na,b,r=mi()\r\nif(2*r<=a and 2*r<=b):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,r= map(int, input().split())\r\nif a>=2*r and b>=2*r:\r\n print('First')\r\nelse:\r\n print('Second')", "a, b, r = map(int, input().split())\r\nd = 2 * r\r\nprint('Second' if a < d or b < d else 'First')", "a, b, r = [int(i) for i in input().split()]\nif r > min(a / 2, b /2):\n print('Second')\nelse:\n print(\"First\")\n# Thu Jul 07 2022 18:07:01 GMT+0000 (Coordinated Universal Time)\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 l,b,r=lst()\r\n if 2*r>l or 2*r>b:print('Second')\r\n else:print('First')", "a, b, r = [int(i) for i in input().split()]\nprint('First' if a >= 2 * r and b >= 2 * r else 'Second')\n", "a, b, r = map(int, input().split())\nprint((\"Second\", \"First\")[a >= 2 * r <= b])", "a, b, r = map(int, input().split(' '))\r\nif 2*r <= a and 2*r <= b:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "\r\na,b,r = map(int, input().split())\r\n\r\nif a<r*2 or b<r*2:\r\n print('Second')\r\nelse:\r\n print('First')\r\n", "a , b , r = [int(x) for x in input().split()]\r\n\r\nif a < 2 * r or b < 2 * r:\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")\r\n", "a, b, r = map(int, input().split())\r\nprint(['First', 'Second'][min(a,b) < 2*r])\r\n", "a,b,r=[int(e) for e in input().split()]\r\nprint(\"Second\" if 2*r>min(a,b) else \"First\")", "a,b,r=map(int,input().split())\r\nif a<2*r or b<2*r:print('Second')\r\nelse:print('First')", "a, b, r = map(int, input().split())\nif min(a, b) < 2*r:\n print('Second')\nelse:\n print('First')\n \t\t\t\t\t\t\t \t \t \t\t\t \t\t \t\t \t", "a,b,r=map(int,input().split())\r\nif a>=r*2 and b>=2*r:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "# LUOGU_RID: 132705905\n# pypy3\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nimport sys\r\nIN = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nPN = lambda x: sys.stdout.write(x)\r\nI = lambda: int(IN())\r\nS = lambda: IN().split()\r\nM = lambda: map(int, IN().split())\r\nL = lambda: list(map(int, IN().split()))\r\nG = lambda: map(lambda x: int(x) - 1, IN().split())\r\n\r\na, b, r = M()\r\n\r\nif 2 * r <= a and 2 * r <= b:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "import math\r\na,b,r=map(int,input().split())\r\nprint(['First','Second'][min(a,b)<2*r])", "#code\r\na,b,r = map(int,input().split())\r\n\r\n\r\nif not 2*r>min(a,b):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,r=map(int,input().split())\r\nprint('Second' if min(a,b)<2*r else 'First')", "a, b, r = input().split()\r\na, b, r = int(a), int(b), int(r)\r\n\r\nif(2*r<=a and 2*r<=b):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "\r\na, b, c = list(map(int, input().split()))\r\n\r\nif c <= min(a, b)/2:\r\n print('First')\r\n \r\nelse:\r\n print(\"Second\")", "a,b,r=map(int,input().split())\r\nif min(a,b)/2>=r:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "import sys\r\nimport io, os\r\nimport math\r\nfrom heapq import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\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\ndef main():\r\n arr=list(map(int, input().split()))\r\n a=arr[0]\r\n b=arr[1]\r\n r=arr[2]\r\n if(a>=2*r and b>=2*r):\r\n print(\"First\")\r\n else:\r\n print(\"Second\")\r\nmain()", "a, b, r = map(int, input().split())\nprint('Second' if a < 2 * r or b < 2 * r else 'First')\n \n", "\na, b, r = map(int, input().split())\n\nif a < 2 * r or b < 2 * r:\n print(\"Second\")\nelse:\n print(\"First\")\n", "rud,pig,panda= map(int,input().split())\r\nprint(\"First\")if (2*panda<=min(rud, pig))else print(\"Second\")\r\n", "\nfrom math import pi\n\na,b,r = map(int,input().split())\n\narea_rec = a*b\n\narea_circle = pi*r*r\n\n\nif 2*r > a or 2*r > b:\n print('Second')\nelse:\n print('First')\n\n\n\n", "n, m, r = list(map(int, input().split()))\r\nif n >= r * 2 and m >= r * 2:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "a,b,c=map(int,input().split())\r\nif min(a,b)>=2*c:\r\n print('First')\r\nelse:\r\n print('Second')", "def plates(a, b, r):\r\n if a < 2 * r or b < 2 * r:\r\n return \"Second\"\r\n return \"First\"\r\n\r\n\r\nA, B, R = [int(i) for i in input().split()]\r\nprint(plates(A, B, R))\r\n", "a, b, r = map(int, input().split())\r\nwin = 1\r\nmoves = 0\r\nwhile a >= 2*r and b >= 2*r:\r\n win = 1-0\r\n a -= 2*r\r\n b -= 2*r\r\n moves += 1\r\nif win == 1 and moves > 0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "x=list(map(int,input().split(' ')))\r\nif x[2]*2<=x[0] and x[2]*2<=x[1]:\r\n print('First')\r\nelse:\r\n print('Second')", "a, b, r = map(int, input().split())\r\nif(r * 2 > a or r * 2 > b):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "abr = list(map(int, input().strip().split()))\r\na = abr[0]\r\nb = abr[1]\r\nd = 2 * abr[2]\r\nif d > min(a, b):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "a, b, r = map(int, input().split())\r\n\r\nprint('First' if r * 2 <= min(a, b) else 'Second')", "ri=lambda:map(int,input().split(' '))\r\na,b,r=ri()\r\nif 2*r > min(a,b):\r\n print('Second')\r\nelse:\r\n print('First')", "import math\r\n\r\na, b, r = map(int, input().split())\r\nif a >= 2*r and b >= 2*r:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "a,b,r = list(map(int, input().split()))\r\n\r\nif (2*r<=a and 2*r<=b):\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,r=map(int,input().split())\r\nprint([\"First\",'Second'][a<2*r or b<2*r])", "data = input()\r\ndatalist = data.split()\r\na = int(datalist[0])\r\nb = int(datalist[1])\r\nr = int(datalist[2])\r\n\r\nif a >= 2*r and b >= 2*r:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n\r\n", "a, b, r = map(int, input().split())\r\nr *= 2\r\nprint('Second' if r > a or b < r else 'First')\r\n", "a, b, r = map(int, input().split())\n\nprint('Second' if 2 * r > min(a, b) else 'First')\n", "a,b,r = list(map(int,input().split()))\r\n(print('First') if 2*r<=a and 2*r<=b else print('Second'))", "from math import *\r\nx,y,r=map(int,input().split())\r\nr=r*2\r\nif(r>min(x,y)):\r\n\tprint(\"Second\")\r\nelse:\r\n\tprint(\"First\")\r\n", "from sys import stdin, stdout\r\n\r\na, b, r = map(int, stdin.readline().split())\r\n\r\nif r * 2 <= a and r * 2 <= b:\r\n stdout.write('First')\r\nelse:\r\n stdout.write('Second')", "a,b,r=list(map(int,input().split()))\r\nprint('Second'if r+r>min(a,b)else'First')", "def main():\r\n a,b,r=map(int,input().split())\r\n if(2*r<=min(a,b)):\r\n print('First')\r\n else:\r\n print('Second') \r\nmain()", "a,b,r = map(int,input().split(' '))\r\n\r\nif(2*r<=min(a,b)):print(\"First\")\r\nelse : print(\"Second\")", "a, b, r = map(int, input().split())\nprint(\"First\" if 2 * r <= min(a, b) else \"Second\")\n \t \t \t \t\t \t\t \t\t \t\t\t \t", "a, b, r = list(map(int, input().split()))\r\nif a >= 2*r and b >= 2*r:\r\n answer = True\r\nelse:\r\n answer = False\r\nif answer:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "n=[int(i) for i in input().split()]\r\nmini=min(n[0],n[1])\r\nif(2*n[2]>mini):\r\n print(\"Second\")\r\nelse:\r\n print(\"First\")", "import math\r\na,b,r=map(int,input().split())\r\nn=(a//(2*r))*(b//(2*r))\r\n#print((n))\r\nif n!=0:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")", "a,b,r = map(int,input().split())\r\nprint('Second'if min(a,b) < r * 2 else'First')", "import math, sys\nfrom bisect import bisect_left, bisect_right\nfrom collections import deque\n\ninput = sys.stdin.readline\nmodulo = 998244353\n\n# t = int(input())\n\n\n# for _ in range(t):\na, b, r = map(int, input().split())\n\nif a >= 2*r and b >= 2*r:\n print(\"First\")\nelse:\n print(\"Second\")\n\n\n\n", "def main():\n a,b,r = [int(float(x)) for x in input().split(' ')]\n\n if(a>=r*2 and b>=r*2):\n print('First')\n else:\n print('Second')\n\n# call the main method\nif __name__ == \"__main__\":\n main()\n\n \t\t \t \t \t\t \t\t\t\t \t\t \t \t\t\t \t", "a,b,r=map(int, input().split(\" \"))\r\n\r\nif 2*r <= a and 2*r <=b:\r\n print(\"First\")\r\nelse:\r\n print(\"Second\")\r\n", "import math\r\nx, y, z = map(int, input().split())\r\n\r\nk = min(x, y)\r\n\r\nif 2 * z <= k : \r\n print(\"First\")\r\n\r\nelse : \r\n print(\"Second\")" ]

[ "row1 , row2 = map(int,input().split())\r\ncol1 , col2 = map(int,input().split())\r\ndia1 , dia2 = map(int,input().split())\r\nmessage=1\r\nb1 , b2 = 0,0\r\nb3 , b4 = 0,0\r\nfor a in range(1,10):\r\n b1 = a\r\n for b in range(1,10):\r\n b2 = b\r\n for c in range(1,10):\r\n b3 = c\r\n for d in range(1,10):\r\n b4 = d\r\n if b1!=b2 and b1!=b3 and b1!=b4 and b2!=b3 and b2!=b4 and b3!=b4:\r\n if b1+b4==dia1 and b1+b2==row1 and b1+b3==col1 and b2+b4==col2 and b2+b3==dia2 and b3+b4==row2:\r\n print(b1,b2)\r\n print(b3,b4)\r\n message=0\r\nif message==1:\r\n print(-1)", "r1,r2 = map(int,input().split())\r\nc1,c2 = map(int,input().split())\r\nd1,d2 = map(int,input().split())\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n for k in range(1,10):\r\n for z in range(1,10):\r\n if i+j==r1 and i+k==c1 and i+z==d1 and j+k==d2 and j+z==c2 and k+z==r2:\r\n if len({i,j,k,z})==4:\r\n print(i,j)\r\n print(k,z)\r\n exit()\r\nelse:\r\n print(-1)", "\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\n\r\nl1 = []\r\nl2 = []\r\n\r\nfor i in range(1, 10):\r\n\tfor j in range(1, 10):\r\n\t\tif i + j == r1:\r\n\t\t\tl1.append([i, j])\r\n\r\n\t\tif i + j == r2:\r\n\t\t\tl2.append([i, j])\r\nlp = []\r\nfor i in l1:\r\n\tfor j in l2:\r\n\t\tif i[0] + j[0] == c1 and i[1] + j[1] == c2:\r\n\t\t\tlp.append([i, j])\r\n\r\nli = []\r\nfor i in lp:\r\n\tif i[0][0] + i[1][1] == d1 and i[0][1] + i[1][0] == d2:\r\n\t\tli.append(i) \r\n\r\nif len(li) == 0:\r\n\tprint(-1)\r\n\texit()\r\nfor i in li:\r\n\tcl = [i[0][0], i[1][0], i[1][1], i[0][1]]\r\n\tif len(cl) == len(set(cl)):\r\n\t\tprint(i[0][0], i[0][1])\r\n\t\tprint(i[1][0], i[1][1])\r\n\t\texit()\r\n\r\nprint(-1)\r\n", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\na=(r1+c1-d2)//2\r\nb=r1-a\r\nc=c1-a\r\nd=c2-b\r\nif a+d==d1 and b+c==d2 and a+b==r1 and c+d==r2 and a+c==c1 and b+d==c2 and len(set([a,b,c,d]))==4 and max(a,b,c,d)<10 and min(a,b,c,d)>0:\r\n print(a,b)\r\n print(c,d)\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 \r\n \r\n \r\n", "inn = list(map(int, input().split(\" \")))\nr1 = inn[0]\nr2 = inn[1]\ninn = list(map(int, input().split(\" \")))\nc1 = inn[0]\nc2 = inn[1]\ninn = list(map(int, input().split(\" \")))\nd1 = inn[0]\nd2 = inn[1]\n\nx = int((d1+c1-r2)/2)\ny = int(((2*r1)-d1-c1+r2)/2)\na = int(((2*c1)-d1-c1+r2)/2)\nb = int((r2-(2*c1)+d1+c1)/2)\nif x == y or x == a or x == b or y == a or y == b or a == b or x < 1 or x > 9 or y < 1 or y > 9 or a < 1 or a > 9 or b < 1 or b > 9:\n print(-1)\nelse:\n print(x, y)\n print(a, b)", "\"\"\"\r\n author - Sayan Bose\r\n date - 29.01.2020\r\n Brooklyn 99 is love!\r\n\"\"\"\r\nfrom itertools import permutations\r\n\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\nc = list(permutations([i for i in range(1, 10)], 4))\r\n\r\nfor i in c:\r\n t1, t2, t3, t4 = i\r\n if t1 + t2 == r1 and t3 + t4 == r2 and t1 + t3 == c1 and t2 + t4 == c2 and t1 + t4 == d1 and t2 + t3 == d2:\r\n print(t1, t2)\r\n print(t3, t4)\r\n exit()\r\nprint(-1)\r\n\r\n\r\n\r\n", "from itertools import permutations\r\nif __name__ == '__main__':\r\n r1, r2 = [int(i) for i in input().split(' ')]\r\n c1, c2 = [int(i) for i in input().split(' ')]\r\n d1, d2 = [int(i) for i in input().split(' ')]\r\n\r\n perm = permutations(list(range(1, 10)), 4)\r\n for i in perm:\r\n A, B, C, D = i\r\n if r1 == A + B and r2 == C + D and c1 == A + C and c2 == B + D and d1 == A + D and d2 == B + C:\r\n print(A, B)\r\n print(C, D)\r\n exit()\r\n print(-1)\r\n\r\n\r\n", "def check(x, y, z, w):\r\n if x + y == r1 and z + w == r2 and x + z == c1 and y + w == c2 and x + w == d1 and y + z == d2:\r\n return True\r\n else:\r\n return False\r\n\r\ndef equal(x, y, z, w):\r\n if x != y and x != z and x != w and y != z and y != w and z != w:\r\n return True\r\n else:\r\n return False\r\n\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\nf = True\r\n\r\nfor a in range(1, 10):\r\n for b in range(1, 10):\r\n for c in range(1, 10):\r\n for d in range(1, 10):\r\n if check(a, b, c, d) and equal(a, b, c, d):\r\n f = False\r\n print(a, b)\r\n print(c, d)\r\n break\r\n if not f:\r\n break\r\n if not f:\r\n break\r\n if not f:\r\n break\r\n \r\nif f:\r\n print(-1)\r\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nsol = -1\r\nfor a in range(1,10):\r\n for b in range(1, 10):\r\n for c in range(1, 10):\r\n for d in range(1, 10):\r\n if a + b == r1 and c + d == r2 and a + c == c1 and b + d == c2 and a + d == d1 and b + c == d2 and len({a,b,c,d}) == 4:\r\n sol = [a,b,c,d]\r\nif sol == -1:\r\n print(sol)\r\nelse:\r\n print(sol[0], sol[1])\r\n print(sol[2], sol[3])", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\na=(d1+c1-r2)/2\r\ns=set()\r\nif(int(a)==a and a>0 and a<10):\r\n c=c1-a\r\n if(c>0 and c<10):\r\n b=d2-c\r\n if(b>0 and b<10):\r\n d=d1-a\r\n if(d>0 and d<10):\r\n s.add(a)\r\n s.add(b)\r\n s.add(c)\r\n s.add(d)\r\n if(len(s)==4):\r\n print(int(a),int(b))\r\n print(int(c),int(d))\r\n else:\r\n print(\"-1\")\r\n else:\r\n print(\"-1\")\r\n else:\r\n print(\"-1\")\r\n else:\r\n print(\"-1\")\r\nelse:\r\n print(\"-1\")", "r1, r2 = map(int, input().split())\nc1, c2 = map(int, input().split())\nd1, d2 = map(int, input().split())\ndef valid(s):\n if not 1 <= min(s) <= 9:\n return False\n elif not 1 <= max(s) <= 9:\n return False\n elif len(s) != len(set(s)):\n return False\n elif s[2] + s[3] != r2:\n return False\n elif s[1] + s[3] != c2:\n return False\n elif s[1] + s[2] != d2:\n return False\n else:\n return True\nfor i in range(1, min(r1, c1, d1)):\n if valid([i, r1 - i, c1 - i, d1 - i]):\n print(i, r1 - i)\n print(c1 - i, d1 - i)\n exit()\nprint(-1)\n", "r1, r2 = map(int, input().split())\nc1, c2 = map(int, input().split())\nd1, d2 = map(int, input().split())\n\na = int((r1 - d2 + c1) / 2)\nb = r1 - a\nc = c1 - a\nd = d1 - a\n\n# Se alguma equação for inconsistente\nif (a+b != r1) or (c+d != r2) or (a+d != d1) or (b+c != d2) or (a+c != c1) or (b+d != c2):\n print('-1')\nelif any(map(lambda x: x < 1 or x > 9,[a,b,c,d])): #Se tiver algum numero fora do intervalo [1,9]\n print('-1')\nelif len(set([a,b,c,d])) < 4: #Se tiver algum numero repetido\n print('-1')\nelse:\n print(a, b)\n print(c, d)\n\t\t \t\t\t \t \t\t\t\t \t\t \t \t \t\t\t", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\nr, c, d = [arr_inp() for i in range(3)]\r\nC=((c[0]-d[0]+r[1])/2)\r\nif(C!=int(C)):\r\n exit(print(-1))\r\nC=int(C)\r\nD=r[1]-C\r\nA=d[0]-D\r\nB=r[0]-A\r\narr=[A,B,C,D]\r\nif(min(arr)<1 or max(arr)>9 or A==B or A==C or A==D or B==C or B==D or C==D ):\r\n exit(print(-1))\r\nprint(A,B)\r\nprint(C,D)\r\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\nans = []\r\nfor a in range(1, 10):\r\n for b in range(1, 10):\r\n for c in range(1, 10):\r\n for d in range(1, 10):\r\n if a + b == r1 and c + d == r2 and a + c == c1 and b + d == c2 and a + d == d1 and b + c == d2:\r\n ans.append([a, b, c, d])\r\nfor i in range(len(ans)):\r\n if len(set(ans[i])) == 4:\r\n print(ans[i][0], ans[i][1])\r\n print(ans[i][2], ans[i][3])\r\n exit()\r\nprint(-1)\r\n", "''' d1 c1 c2 d2\r\n r1 a b\r\n r2 c d\r\n'''\r\nr1,r2 = map(int,input().split(' '))\r\nc1,c2 = map(int,input().split(' '))\r\nd1,d2 = map(int,input().split(' '))\r\nres = False\r\nfor i in range(1,10):\r\n a = i\r\n b = r1-a\r\n c = c1-a\r\n d = d1-a\r\n nums = [1,2,3,4,5,6,7,8,9]\r\n try:\r\n nums.remove(a)\r\n nums.remove(b)\r\n nums.remove(c)\r\n nums.remove(d)\r\n if c+d==r2 and b+d==c2 and b+c==d2:\r\n res=True\r\n break\r\n except:\r\n continue\r\nif res==False:\r\n print(-1)\r\nelse:\r\n print('{} {}\\n{} {}'.format(a,b,c,d))\r\n", "R = list(map(int, input().split()))\r\nC = list(map(int, input().split()))\r\nD = list(map(int, input().split()))\r\n \r\nX = [(D[0] + C[0] - R[1]) // 2, (R[0] + C[1] - D[0]) // 2]\r\nY = [(D[1] + C[0] - R[0]) // 2, (R[1] + C[1] - D[1]) // 2]\r\nif len(set(X + Y)) != 4 or any([True for i in X + Y if i>9 or i<=0]):\r\n print(-1)\r\nelse:\r\n print(*X)\r\n print(*Y)\r\n \r\n# A new start\r\n# Here in Tabas\r\n# Waiting for the big news", "# https://codeforces.com/contest/143/problem/A\r\n\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\nif (r1 - c1 + d2) % 2 == 0:\r\n m = (r1 - c1 + d2) // 2\r\n l = r1 - m\r\n n = c1 - l\r\n o = c2 - m\r\n gems = {l, m, n, o}\r\n\r\n if len(gems) != 4:\r\n print(-1)\r\n else:\r\n for i in gems:\r\n if i < 1 or i > 9:\r\n print(-1)\r\n break\r\n else:\r\n if l + m == r1 and n + o == r2 and l + n == c1 and m + o == c2 and l + o == d1 and n + m == d2:\r\n print(l, m)\r\n print(n, o)\r\n else:\r\n print(-1)\r\n\r\nelse:\r\n print(-1)\r\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nans = 0\r\nfor q in range(1, 10):\r\n for w in range(1, 10):\r\n for e in range(1, 10):\r\n for r in range(1, 10):\r\n if q != w and q != e and q != r and w != e and w != r and e != r:\r\n if q + w == r1 and e + r == r2 and q + r == d1 and q + e == c1 and w + r == c2 and w + e == d2:\r\n print(q, w)\r\n print(e, r)\r\n ans = 1\r\n break\r\n if ans:\r\n break\r\n if ans:\r\n break\r\n if ans:\r\n break\r\nelse:\r\n print(-1)\r\n\n# Sun Jun 13 2021 09:43:19 GMT+0300 (Москва, стандартное время)\n", "import itertools\r\ndef f(r,c,d):\r\n lock = []\r\n combinaisons = list(itertools.permutations([i for i in range(1,10)],4))\r\n for i in combinaisons:\r\n t = list(i)\r\n if t[0]+t[1] == r[0] and t[2]+t[3] == r[1] and t[0]+t[2] == c[0] and t[1]+t[3] == c[1] and t[0]+t[3] == d[0] and t[1]+t[2] == d[1]:\r\n return str(t[0])+\" \"+str(t[1])+ \"\\n\" +str(t[2])+\" \"+str(t[3])\r\n return -1\r\n\r\n\r\n\r\n\r\nr = input()\r\nc = input()\r\nd = input()\r\nr = [int(i) for i in r.split(\" \")]\r\nc = [int(i) for i in c.split(\" \")]\r\nd = [int(i) for i in d.split(\" \")]\r\nprint(f(r,c,d))\r\n", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nb=((r1-d1)+c2)//2\r\na=r1-b\r\nd=c2-b\r\nc=c1-a\r\n\r\nif(a==b or a==c or a==d or b==c or b==d or c==d or a>9 or b>9 or c>9 or d>9 or a<1 or b<1 or c<1 or d<1):\r\n print(-1)\r\nelif(a+b==r1 and c+d==r2 and a+c==c1 and b+d==c2 and a+d==d1 and b+c==d2): \r\n print(a,b)\r\n print(c,d)\r\nelse:\r\n print(-1)", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nb1 = False\r\nif r1 == r2 == c1 == c2 == d1 == d2:\r\n print(-1)\r\nelse:\r\n for i in range(1, 10):\r\n for j in range(1, 10):\r\n for k in range(1, 10):\r\n for l in range(1, 10):\r\n if i != j and k != l and i != k and j != k and j != l and i != l and \\\r\n r1 > 1 and r2 > 1 and c1 > 1 and c2 > 1 and d1 > 1 and d2 > 1:\r\n if i + j == r1 and i + k == c1 and i + l == d1 and \\\r\n j + l == c2 and j + k == d2 and k + l == r2:\r\n print(i, j), print(k, l)\r\n b1 = True\r\n\r\n if not b1:\r\n print(-1)\r\n# writer: Deiaa Mohamed || Colin Deiaa\r\n", "r1,r2=map(int,input().split())\nc1,c2=map(int,input().split())\nd1,d2=map(int,input().split())\n\nx=(d1+c1-r2)//2\ny=r1-x\nz=c1-x\nw=d1-x\nif 1<=x<=9 and 1<=y<=9 and 1<=z<=9 and 1<=w<=9 and len(set([x,y,z,w]))==4:\n\tprint(x,y)\n\tprint(z,w)\nelse:\n\tprint(-1)\n \t\t\t\t \t \t\t\t \t \t \t \t \t\t \t \t", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\na=(d1+c1-r2)//2\r\nb=r1-a\r\nc=c1-a\r\nd=d1-a\r\nif 1<=a<=9and 1<=b<=9and 1<=c<=9and 1<=d<=9and len(set([a,b,c,d]))==4:print(a,b);print(c,d)\r\nelse:print(-1)", "r1,r2=input().split()\r\nc1,c2=input().split()\r\nd1,d2=input().split()\r\n\r\nr1=int(r1);r2=int(r2);c1=int(c1);c2=int(c2);d1=int(d1);d2=int(d2)\r\n\r\na=[[0 for i in range(2)]for j in range(2)]\r\n\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n for k in range(1,10):\r\n for l in range(1,10):\r\n if i+j==r1 and l+k==r2 and i+l==c1 and j+k==c2 and i+k==d1 and j+l==d2 and i!=j and i!=k and i!=l and j!=k and j!=l and l!=k:\r\n a[0][0]=i\r\n a[0][1]=j\r\n a[1][0]=l\r\n a[1][1]=k\r\nflag=1\r\nfor i in range(2):\r\n for j in range(2):\r\n if a[i][j]==0:\r\n flag=flag*1\r\n else:\r\n flag=0\r\n\r\nif flag==1:\r\n print('-1')\r\nelse:\r\n print(a[0][0],end=' ')\r\n print(a[0][1])\r\n print(a[1][0],end=' ')\r\n print(a[1][1])\r\n \r\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nd = int(((c2 + d1)-r1) / 2)\r\nc = int(r2 - d)\r\na = int(d1 - d)\r\nb = int(c2 - d)\r\n# print(a, b, c, d)\r\nif a == b or a == c or a == d or b == c or b == d or c == d or\\\r\n a < 1 or b < 1 or c < 1 or d < 1 or\\\r\n a > 9 or b > 9 or c > 9 or d > 9 or\\\r\n a + c != c1 or b + d != c2 or a + b != r1 or c + d != r2:\r\n print('-1')\r\nelse:\r\n print(a, b)\r\n print(c, d)", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nl1,l2,count=[],[],0\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n if i+j==r1 and i!=j:l1.append([i,j])\r\n if i+j==r2 and i!=j:l2.append([i,j])\r\nfor k in range(len(l1)):\r\n for l in range(len(l2)):\r\n if l1[k][1]!=l2[l][0] and l1[k][1]+l2[l][0]==c1 and l1[k][0]!=l2[l][1] and l1[k][0]+l2[l][1]==c2:\r\n if l1[k][0]!=l2[l][0] and l1[k][0]+l2[l][0]==d2 and l1[k][1]!=l2[l][1] and l1[k][1]+l2[l][1]==d1:\r\n print(l1[k][1],l1[k][0])\r\n print(*l2[l])\r\n count+=1\r\n break\r\n if count!=0:break\r\nif count==0:print(-1)", "l=[]\r\nfor i in range(3):l=l+list(map(int,input().split()))\r\nr1,r2,c1,c2,d1,d2 = l\r\nsol = [(r1-c2+d1)//2,(r1+c2-d1)//2,(r1-c2-d1)//-2]\r\nitem = (((c1+d2+r2)-sum(sol))//3)\r\n# print(item)\r\nsol.insert(2,[0,item][item+sol[-1]==r2])\r\nif max(sol)>9 or min(sol)<1 or len(set(sol))!=len(sol):\r\n print(-1)\r\n # print(*sol[:2],\"\\n\",*sol[2:])\r\nelse:\r\n print(*sol[:2],\"\\n\",*sol[2:])", "import itertools\r\nr1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nl=list(range(1,10))\r\nc=itertools.permutations(l,4)\r\nf=0\r\nfor i in c:\r\n #print(i)\r\n if((i[0]+i[1]==r1) and (i[2]+i[3]==r2) and (i[0]+i[2]==c1) and (i[1]+i[3]==c2) and (i[0]+i[3]==d1) and (i[1]+i[2]==d2)):\r\n print(i[0],i[1])\r\n print(i[2],i[3])\r\n f=1\r\n break\r\nif(f==0):\r\n print(-1)", "r1, r2 = map(int, input().split())\nc1, c2 = map(int, input().split())\nd1, d2 = map(int, input().split())\n\nx2 = (r1 - d1 + c2)//2\nx1 = r1 - x2\nx4 = c2 - x2\nx3 = r2 - x4\n\nif x1 in [1,2,3,4,5,6,7,8,9] and \\\n x2 in [1,2,3,4,5,6,7,8,9] and \\\n x3 in [1,2,3,4,5,6,7,8,9] and \\\n x4 in [1,2,3,4,5,6,7,8,9] and \\\n c1 == x1 + x3 and d2 == x2 + x3 and \\\n x1 != x2 and x1 != x3 and x1 != x4 and \\\n x2 != x3 and x2 != x4 and x3 != x4:\n print(x1, x2)\n print(x3, x4)\nelse:\n print(-1)\n\n\t\t \t\t \t\t \t \t\t \t\t \t\t\t\t", "rs = input().strip().split(' ')\r\ncs = input().strip().split(' ')\r\nds = input().strip().split(' ')\r\n\r\nr1 = int(rs[0])\r\nr2 = int(rs[1])\r\nc1 = int(cs[0])\r\nc2 = int(cs[1])\r\nd1 = int(ds[0])\r\nd2 = int(ds[1])\r\n\r\n\r\nif min(r1, r2, c1, c2, d1, d2)==1:\r\n print(-1)\r\nelse:\r\n row1 = []\r\n k = 1\r\n while r1-k>0:\r\n if k!=r1-k and k<=9 and r1-k<=9:\r\n row1.append([k, r1-k])\r\n k+=1\r\n row2 = []\r\n k = 0 \r\n while k<len(row1):\r\n r21 = c1-row1[k][0]\r\n r22 = c2-row1[k][1]\r\n if r21>0 and r22>0 and r21<=9 and r22<=9 and r21+r22==r2 and r21+row1[k][1]==d2 and r22+row1[k][0]==d1 and len(set([r22, r21]+row1[k]))==4:\r\n row2.append([r21, r22])\r\n k += 1\r\n else:\r\n row1.pop(k)\r\n \r\n if len(row1)>0:\r\n print(row1[0][0], row1[0][1])\r\n print(row2[0][0], row2[0][1])\r\n else:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n ", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n if i==j:\r\n continue\r\n for k in range(1,10):\r\n if k==j or k==i:\r\n continue\r\n for l in range(1,10):\r\n if l==i or l==j or l==k:\r\n continue\r\n if i+j==r1 and k+l==r2 and i+k==c1 and j+l==c2 and i+l==d1 and j+k==d2:\r\n print(i,j)\r\n print(k,l)\r\n exit()\r\nprint(-1) \r\n", "from itertools import permutations\r\nr1,r2 = map(int,input().split())\r\nc1,c2 = map(int,input().split())\r\nd1,d2 = map(int,input().split())\r\nfor comb in list(permutations(range(1,10),4)):\r\n if comb[0] + comb[1] == r1 and \\\r\n comb[2] + comb[3] == r2 and \\\r\n comb[0] + comb[2] == c1 and \\\r\n comb[1] + comb[3] == c2 and \\\r\n comb[0] + comb[3] == d1 and \\\r\n comb[1] + comb[2] == d2:\r\n print(comb[0],comb[1])\r\n print(comb[2],comb[3])\r\n exit()\r\nprint(-1)", "a,b=map(int,input().split())\r\nc,d=map(int,input().split())\r\ne,f=map(int,input().split())\r\nfor i1 in range(1,10):\r\n for i2 in range(1,10):\r\n for i3 in range(1,10):\r\n for i4 in range(1,10):\r\n if i1!=i2 and i1!=i3 and i1!=i4 and i2!=i3 and i2!=i4 and i3!=i4:\r\n if i1+i2==a and i3+i4==b and i1+i3==c and i2+i4==d and i1+i4==e and i2+i3==f:\r\n print(i1,i2)\r\n print(i3,i4)\r\n exit(0)\r\nprint(-1)", "\"\"\"\nhttps://codeforces.com/problemset/problem/143/A\ntrouver a,b,c,d entre 1 et 9, tous différents\nr1=a+b\nr2=c+d\nc1=a+c\nc2=b+d\nd1=a+d\nd2=b+c\n\"\"\"\nr1, r2 = [int(x) for x in input().split()]\nc1, c2 = [int(x) for x in input().split()]\nd1, d2 = [int(x) for x in input().split()]\n\nsolution = -1\n\nfor a in range(1, 10):\n for b in range(1, 10):\n if b != a:\n for c in range(1, 10):\n if c != a and c != b:\n for d in range(1, 10):\n if d != a and d != b and d != c:\n if (\n r1 == a + b\n and r2 == c + d\n and c1 == a + c\n and c2 == b + d\n and d1 == a + d\n and d2 == b + c\n ):\n solution = (a, b, c, d)\nif solution != -1:\n print(solution[0], solution[1])\n print(solution[2], solution[3])\nelse:\n print(solution)\n", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\ndef f():\r\n\tfor a in range(1,10):\r\n\t\tfor b in range(1,10):\r\n\t\t\tfor c in range(1,10):\r\n\t\t\t\tfor d in range(1,10):\r\n\t\t\t\t\tif len(set([a,b,c,d]))==4:\r\n\t\t\t\t\t\tif r1==a+b and r2==c+d and c1==a+c and c2==b+d and d1==a+d and d2==b+c:\r\n\t\t\t\t\t\t\treturn [1,a,b,c,d]\r\n\treturn [0]\r\nl=f()\r\nif l[0]:\r\n\tprint(l[1],l[2])\r\n\tprint(l[3],l[4])\r\nelse:\r\n\tprint(-1)", "from itertools import permutations\r\n\r\nr1,r2= map(int, input().split())\r\nc1, c2= map(int, input().split())\r\nd1, d2= map(int, input().split())\r\n\r\nfor i,j,k,l in permutations(range(1,10),4):\r\n if i+j == r1 and k+l == r2 and i+l == c1 and j+k == c2 and i+k == d1 and l+j == d2:\r\n print(i,j)\r\n print(l,k)\r\n quit()\r\nprint(-1)", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nx=int(((d1+r1)-c2)/2) \r\ny=int(r1-x)\r\nz=int(c2-y)\r\nr=int(c1-x)\r\nl=[]\r\nk=[]\r\nif (x!=y) and (x!=r) and (x!=z) and (y!=r) and (y!=z) and (r!=z) and (1<=r<=9) and (1<=x<=9) and (1<=y<=9) and (1<=z<=9) and x+y==r1 and r+z==r2 and x+r==c1 and y+z==c2 and x+z==d1 and r+y==d2:\r\n l.append(x)\r\n l.append(y)\r\n k.append(r)\r\n k.append(z)\r\n print(\" \".join(str(j) for j in l))\r\n print(\" \".join(str(i) for i in k))\r\nelse:\r\n print(-1)", "from collections import Counter\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nc = 0\r\nfor i in range(1,10):\r\n for j in range(1, 10):\r\n for k in range(1, 10):\r\n for l in range(1, 10):\r\n if i+j == r1 and k+l == r2:\r\n if i+k == c1 and j+l == c2:\r\n if i+l == d1 and j+k == d2:\r\n if len(Counter([i,j,k,l])) == 4:\r\n print(f'{i} {j}\\n{k} {l}')\r\n c = 1\r\nif c != 1:\r\n print(-1)\r\n", "r1,r2 = input().split(\" \")\r\nc1,c2 = input().split(\" \")\r\nd1,d2 = input().split(\" \")\r\nr1,r2,c1,c2,d1,d2 = int(r1),int(r2),int(c1),int(c2),int(d1),int(d2)\r\nar1 = []\r\nz = True\r\nm = max(c1,c2)\r\nif(r1+r2 == c1+c2 == d1+d2):\r\n for n in range((r1-1)//2):\r\n ar1.append([r1-1-n,1+n])\r\n for n in ar1:\r\n if n[0] < 10 and n[0] <= m:\r\n ar2 = []\r\n ar2.append(c1-n[0])\r\n ar2.append(r2-ar2[0])\r\n if(n[0] == ar2[0] or n[1] == ar2[1] or ar2[0] == ar2[1] or n[0] == ar2[1] or n[1] == ar2[0]):\r\n n[0],n[1] = n[1],n[0]\r\n ar2 = []\r\n ar2.append(c1-n[0])\r\n ar2.append(r2-ar2[0])\r\n if not (n[0] == ar2[0] or n[1] == ar2[1] or ar2[0] == ar2[1] or n[0] == ar2[1] or n[1] == ar2[0]):\r\n if(n[0]+ar2[1] == d1 and n[1] + ar2[0] == d2 and ar2[0] < 10 and ar2[1] < 10 and ar2[0] > 0 and ar2[1] > 0):\r\n print(n[0],n[1])\r\n print(ar2[0],ar2[1])\r\n z = False\r\n break\r\n else:\r\n if(n[0]+ar2[1] == d1 and n[1] + ar2[0] == d2 and ar2[0] < 10 and ar2[1] < 10 and ar2[0] > 0 and ar2[1] > 0):\r\n print(n[0],n[1])\r\n print(ar2[0],ar2[1])\r\n z = False\r\n break\r\n else:\r\n n[0],n[1] = n[1],n[0]\r\n ar2 = []\r\n ar2.append(c1-n[0])\r\n ar2.append(r2-ar2[0])\r\n if not(n[0] == ar2[0] or n[1] == ar2[1] or ar2[0] == ar2[1] or n[0] == ar2[1] or n[1] == ar2[0]):\r\n if(n[0]+ar2[1] == d1 and n[1] + ar2[0] == d2 and ar2[0] < 10 and ar2[1] < 10 and ar2[1] > 0 and ar2[0] > 0):\r\n print(n[0],n[1])\r\n print(ar2[0],ar2[1])\r\n z = False\r\n break\r\n if z:\r\n print(\"-1\")\r\nelse:\r\n print(\"-1\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\ndef main():\r\n r1,r2 = [int(item) for item in input().split()]\r\n c1,c2 = [int(item) for item in input().split()]\r\n d1,d2 = [int(item) for item in input().split()] \r\n a = r1+d1-c2 \r\n b = r1-d1+c2\r\n c = 2*d2 - r1 + d1 -c2\r\n d = c2-r1+d1\r\n tmp = [a,b,c,d]\r\n ans = True\r\n if(len(set(tmp))!=4):\r\n ans = False\r\n elif(min(tmp)<=0 or max(tmp)>=19):\r\n ans = False\r\n elif(c+d != 2*r2):\r\n ans = False\r\n else:\r\n for x in range(len(tmp)):\r\n tmp[x] = tmp[x]//2\r\n if(ans):\r\n print(tmp[0],tmp[1])\r\n print(tmp[2],tmp[3])\r\n else:\r\n print(-1)\r\n\r\nif __name__ == '__main__':\r\n main()", "def solve() :\n m=int(( c1-r1 + d2 )/2)\n n=r2-m\n x=d1-n\n y=c2-n\n for i in [x,y,m,n] :\n if i<1 or i>9 :\n return -1\n if len(set([x,y,m,n]))!=4 :\n return -1\n return f'{x} {y}\\n{m} {n}'\n\n\n \n\nfrom sys import stdin\ninput = stdin.readline \n \nr1,r2= [int(x) for x in input().split()]\nc1,c2= [int(x) for x in input().split()]\nd1,d2= [int(x) for x in input().split()]\n\nprint(solve())\n \n\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\n\nn=int(input())\n\nx=input().strip()\n\n\nn,m= [int(x) for x in input().split()]\n\n\n\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'''", "r1,r2 = map(int,input().split())\r\nc1,c2 = map(int,input().split())\r\nd1,d2 = map(int,input().split())\r\nx = (c1 + r1 - d2) / 2\r\nif x != int(x): \r\n print(-1)\r\nelse:\r\n a = r1 - x\r\n b = c1 - x\r\n c = d1 - x\r\n if ((x == a) or (x == b) or (x == c) or (a == b) or (a == c) or (b == c)):\r\n print(-1)\r\n elif(x < 1 or x > 9 or a < 1 or a > 9 or b < 1 or b > 9 or c < 1 or c > 9):\r\n print(-1)\r\n elif b + c != r2 or a + c != c2 or a + b != d2:\r\n print(-1)\r\n else:\r\n print(str(int(x)) + \" \" + str(int(a)))\r\n print(str(int(b)) + \" \" + str(int(c)))", "r1,r2 = map(int, input().split())\r\nc1,c2 = map(int, input().split())\r\nd1, d2 = map(int ,input().split())\r\n\r\na = ((c1 + r1 - c2 - r2)//2 + d1)//2\r\nb = d1 - a\r\nc = c1 - a\r\nd = c2 - b\r\nm = list(set([a,b,c,d]))\r\nif len(m)!=4:\r\n print(-1)\r\nelif a<1 or a>9 or b<1 or b>9 or c<1 or c>9 or d<1 or d>9:\r\n print(-1)\r\nelse:\r\n print(a, d)\r\n print(c, b)", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nst = set([])\r\nx = int((c1 - d2 + r1) / 2); y = int(r1 - x)\r\nj = int(c1 - x); k = int(d1 - x)\r\nst.add(x); st.add(y); st.add(j); st.add(k)\r\nif len(st) != 4:\r\n print(\"-1\")\r\nelse:\r\n for gem in st:\r\n yes = 1\r\n if 1 > gem or gem > 9:\r\n print(\"-1\");yes = 0;break\r\n elif (x+y)!=r1 or (j+k)!=r2 or (x+j)!=c1 or (y+k)!=c2 or (x+k)!=d1 or (y+j)!=d2:print(\"-1\");yes = 0;break\r\n if yes == 1:print(x, y);print(j, k)\r\n", "from itertools import permutations\r\nl=list(permutations(range(1,10),4))\r\nr1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nfor x in l:\r\n if x[2]+x[3]==r2 and x[0]+x[1]==r1 and x[0]+x[3]==d1 and x[1]+x[2]==d2 and x[0]+x[2]==c1 and x[1]+x[3]==c2:\r\n print(x[0],x[1])\r\n print(x[2],x[3])\r\n break\r\nelse:\r\n print(-1)", "row1, row2 = map(int, input().split())\r\ncol1, col2 = map(int, input().split())\r\ndiag1, diag2 = map(int, input().split())\r\n\r\nfor i in range(1, 10):\r\n a = i\r\n for j in range(1, 10):\r\n b = j\r\n for k in range(1, 10):\r\n c = k\r\n for l in range(1, 10):\r\n d = l\r\n if a != b and a != c and a != d and b != c and b != d and c != d:\r\n if a+b == row1 and c+d == row2 and a+d == diag1 and b+c == diag2 and a+c == col1 and b+d == col2:\r\n print(a,b)\r\n print(c,d)\r\n exit()\r\nprint('-1')\r\n", "from sys import stdin, stdout\r\n#from bisect import bisect_left, bisect_right\r\n#from collections import Counter, deque\r\n#from queue import Queue\r\n#import heapq\r\n#import math\r\n#from itertools import permutations, combinations, islice\r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\ndef bound(n):\r\n return 1<=n<=9\r\n\r\ndef solve():\r\n r1,r2 = map(int, input().split())\r\n c1,c2 = map(int, input().split())\r\n d1,d2 = map(int, input().split())\r\n a = (d1+c1-r2)//2\r\n r = r1-a\r\n c = c1-a\r\n d = d1-a\r\n if bound(a) and bound(r) and bound(c) and bound(d) and len(set([a,r,c,d])) == 4:\r\n return f\"{a} {r}\\n{c} {d}\"\r\n else:\r\n return \"-1\"\r\n\r\ndef main():\r\n stdout.write(solve())\r\n\r\nmain()", "rows = list(map(int,input().split()))\r\ncols = list(map(int,input().split()))\r\ndiags = list(map(int,input().split()))\r\n\r\n\r\nr1 = rows[0]\r\nr2 = rows[1]\r\nc1 = cols[0]\r\nc2 = cols[1]\r\nd1 = diags[0]\r\nd2 = diags[1]\r\n\r\nboo = True\r\nn = 9\r\n\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n for k in range(1,n+1):\r\n for l in range(1,n+1):\r\n if (i!=j and i!=k and i!=l and j!=k and j!=l and k!=l) and i+j==r1 and k+l==r2 and i+k==c1 and j+l==c2 and i+l==d1 and k+j==d2:\r\n boo = False\r\n print(i,end=\" \")\r\n print(j)\r\n print(k,end=\" \")\r\n print(l)\r\n\r\n\r\n\r\nif boo:\r\n print(-1)\r\n", "r1,r2 = map(int,input().split())\r\nc1,c2 = map(int,input().split())\r\nd1,d2 = map(int,input().split())\r\ns=r1+r2\r\na11=(s*2-d2-r2-c2)//2\r\na12=r1-a11\r\na22=d1-a11\r\na21=d2-a12\r\nss=set([a11,a12,a21,a22])\r\nif len(ss)!=4 or min(ss)<=0 or max(ss)>=10 or not((c1+c2)==s==(d1+d2)):\r\n print(-1)\r\nelse:\r\n print(a11,a12)\r\n print(a21,a22)\n# Sat Oct 10 2020 22:05:20 GMT+0300 (Москва, стандартное время)\n", "import itertools\nl = []\n[l.append(int(x)) for x in input().split()]\n[l.append(int(x)) for x in input().split()]\n[l.append(int(x)) for x in input().split()]\ng = list(range(1, 10))\nlk = True\nfor c in list(itertools.permutations(g)):\n if c[0] + c[1] != l[0]: continue\n if c[2] + c[3] != l[1]: continue\n if c[0] + c[2] != l[2]: continue\n if c[1] + c[3] != l[3]: continue\n if c[0] + c[3] != l[4]: continue\n if c[1] + c[2] != l[5]: continue\n lk = False\n print(c[0], c[1])\n print(c[2], c[3])\n break\nif lk: print('-1')\n \t\t \t \t \t\t\t \t\t\t\t\t\t \t\t\t \t\t", "import itertools\r\nr1,r2=map(int, input().split())\r\nc1,c2=map(int, input().split())\r\nd1,d2=map(int, input().split())\r\nflag=False\r\nfor a,b,c,d in itertools.permutations(range(1,10),4):\r\n if a+b==r1 and c+d==r2 and a+c==c1 and b+d==c2 and a+d==d1 and b+c==d2:\r\n print(a,b)\r\n print(c,d) \r\n flag=True\r\n break\r\nif flag==False:\r\n print(-1)\r\n", "r1, r2 = map(int, input().split())\nc1, c2 = map(int, input().split())\nd1, d2 = map(int, input().split())\n\nx = (r1 + c1 - d2) / 2\ny = (r1 + c2 - d1) / 2\nz = (r2 + c1 - d1) / 2\nw = (r2 + c2 - d2) / 2\n\nans = {x, y, z, w}\n\nif len(ans) != 4 or not ans.issubset({x for x in range(1, 10)}):\n print(-1)\nelse:\n print(int(x), int(y))\n print(int(z), int(w))", "r1, r2 = list(map(int, input().split()))\r\nc1, c2 = list(map(int, input().split()))\r\nd1, d2 = list(map(int, input().split()))\r\nfor i in range(1, 10):\r\n for j in range(1, 10):\r\n if i == j:\r\n continue\r\n for k in range(1, 10):\r\n if i == k or j == k:\r\n continue\r\n for l in range(1, 10):\r\n if i == l or j == l or k == l:\r\n continue\r\n if i + j == r1 and k + l == r2 and i + k == c1 and j + l == c2 and i + l == d1 and j + k == d2:\r\n print(i, j)\r\n print(k, l)\r\n exit()\r\nprint(-1)\r\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\nx1 = (c1 + d2 - r1)\r\nif x1 % 2 == 1:\r\n print(-1)\r\nelse:\r\n x = x1 // 2\r\n y = r2 - x\r\n v = d1 - y\r\n w = r1 - v\r\n\r\n daf = [x, y, v, w]\r\n\r\n set_gem = {1, 2, 3, 4, 5, 6, 7, 8, 9}\r\n\r\n flag = True\r\n\r\n for gem in daf:\r\n if gem in set_gem:\r\n set_gem.remove(gem)\r\n else:\r\n flag = False\r\n break\r\n\r\n if not flag:\r\n print(-1)\r\n else:\r\n print(v, w)\r\n print(x, y)\r\n", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\n\r\nlimit=[1,2,3,4,5,6,7,8,9]\r\n\r\nco=False\r\nx1=0\r\nx2=0\r\nx3=0\r\nx4=0\r\nfor a in range(1,10):\r\n b=r1-a\r\n c=c1-a\r\n d=d1-a\r\n if(b in limit and c in limit and d in limit):\r\n uniq=set()\r\n uniq.add(a)\r\n uniq.add(b)\r\n uniq.add(c)\r\n uniq.add(d)\r\n if(b+c==d2 and b+d==c2 and c+d==r2 and len(uniq)==4):\r\n co=True\r\n x1=a\r\n x2=b\r\n x3=c\r\n x4=d\r\n break\r\n\r\nif(co):\r\n print(x1,x2)\r\n print(x3,x4)\r\nelse:\r\n print(\"-1\")\r\n \r\n \r\n", "e,f=map(int,input().split())\r\ng,h=map(int,input().split())\r\ni,j=map(int,input().split())\r\nif 1<=((i+g-f)//2)<=9 and 1<=(e-(i+g-f)//2)<=9 and 1<=(g-(i+g-f)//2)<=9 and 1<=(i-(i+g-f)//2)<=9 and len(set([(i+g-f)//2,e-(i+g-f)//2,g-(i+g-f)//2,i-(i+g-f)//2]))==4:print((i+g-f)//2,e-(i+g-f)//2);print(g-(i+g-f)//2,i-(i+g-f)//2)\r\nelse:print(-1)", "r = input().split()\r\nc = input().split()\r\nd = input().split()\r\nr1 = int(r[0])\r\nr2 = int(r[1])\r\nc1 = int(c[0])\r\nc2 = int(c[1])\r\nd1 = int(d[0])\r\nd2 = int(d[1])\r\nx2 = int((d2 + c2 -r2)/2)\r\nx1 = r1 - x2\r\nx3 = c1 - x1\r\nx4 = r2 - x3\r\ntotal = [x1,x2,x3,x4]\r\nif max(total) > 9 or len(total) != len(set(total)) or min(total)<=0:\r\n print(-1)\r\nelse:\r\n print(x1,x2)\r\n print(x3,x4)", "r1 , r2 = map(int,input().split(' '))\r\nc1 , c2 = map(int,input().split(' '))\r\nd1 , d2 = map(int,input().split(' '))\r\n\r\nfor a1 in range(1 , 10):\r\n for a2 in range(1 , 10):\r\n for a3 in range(1 , 10):\r\n for a4 in range(1 , 10):\r\n if (a1 != a2 ) and (a1 != a3 ) and (a1 != a4) and (a2 != a3) and (a2 != a4) and (a3 != a4 ) and (a1 + a2 == r1) and (a3 + a4 == r2) and (a1 + a3 == c1) and (a2 + a4 == c2) and (a1 + a4 == d1) and (a2 + a3 == d2):\r\n print(a1 , a2)\r\n print(a3 , a4)\r\n exit()\r\nprint(-1)\r\n\r\n\r\n\r\n", "import sys\nr1, r2 = map(int, input().split())\nc1, c2 = map(int, input().split())\nd1, d2 = map(int, input().split())\na = (d1 + c1 - r2) // 2\nb = (d2 + c2 - r2) // 2\nc = (c1 + d2 - r1) // 2\nd = (c2 + r2 - d2) // 2\ne = [a, b, c, d]\nif (d1 + c1 - r2) % 2 == 0 and (d2 + c2 - r2) % 2 == 0 and (c1 + d2 - r1) % 2 == 0 and (c2 + r2 - d2) % 2 == 0:\n if a >= 1 and a <= 9 and b >= 1 and b <= 9 and c >= 1 and c <= 9 and d >= 1 and d <= 9:\n if a != b and b != c and c != d and a != c and a != d and b != d:\n print(a, b)\n print(c, d)\n sys.exit()\nprint(-1)\n\n# Wed Oct 14 2020 15:48:35 GMT+0300 (Москва, стандартное время)\n", "#Answer is arranged as \r\n# a b\r\n# c d\r\n\r\n#For fast I/O\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nr = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nd = [int(i) for i in input().split()]\r\n\r\nif r[0]+r[1] != c[0]+c[1] or r[0]+r[1] != d[0]+d[1]: #Solution DNE\r\n\tprint(-1)\r\nelif ( r[0]+c[0]-d[1] )%2 != 0: #Non-integer values\r\n\tprint(-1)\r\nelse:\r\n\ta = (r[0]+c[0]-d[1])//2\r\n\tb = r[0]-a\r\n\tc = c[0]-a\r\n\td = d[0]-a\r\n\t\r\n\tif len({a,b,c,d}) != 4: #There is a repeated element\r\n\t\tprint(-1)\r\n\telif min(a,b,c,d) < 1 or max(a,b,c,d) > 9: #Out of range\r\n\t\tprint(-1)\r\n\telse: #Works\r\n\t\tprint(a,b)\r\n\t\tprint(c,d)\r\n", "\nr = list(map(int,input().split()))\nc = list(map(int,input().split()))\nd = list(map(int,input().split()))\n\nb = (d[0]-r[0]+c[1])//2\na = r[1]-b\nx = c[0]-a\ny = r[0]-x\nl = [x,y,a,b]\n\nif len(list(dict.fromkeys([x,y,a,b])))==4:\n\tif min(l)>0 and max(l)<10:\n\t\tprint(x,y,'\\n'+str(a),b)\n\telse:\n\t\tprint(-1)\nelse:\n\tprint(-1)\n\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\n\r\ndef solve():\r\n for i in range(1, 10):\r\n for j in range(1, 10):\r\n for k in range(1, 10):\r\n for l in range(1, 10):\r\n if i + j == r1 and k + l == r2 and i + k == c1 and j + l == c2 and i + l == d1 and k + j == d2:\r\n if len({i, j, k, l}) == 4:\r\n print(i, j)\r\n print(k, l)\r\n return True\r\n return False\r\n\r\n\r\ntmp = solve()\r\nif not tmp:\r\n print(-1)", "def f(ll):\r\n for g0 in range(1,10):\r\n g1 = ll[0][0]-g0 #r1\r\n if g1<1 or g1>9 or g1==g0:\r\n continue\r\n g2 = ll[1][0]-g0 #c1\r\n if g2<1 or g2>9 or g2==g0:\r\n continue\r\n g3 = ll[2][0]-g0 #d1\r\n if g3<1 or g3>9 or g3==g0:\r\n continue\r\n if g1==g2 or g2==g3 or g1==g3:\r\n continue\r\n if g2+g3 != ll[0][1]: #r2\r\n continue\r\n if g1+g3 != ll[1][1]: #c2\r\n continue\r\n if g1+g2 != ll[2][1]: #d3\r\n continue\r\n return [[g0,g1],[g2,g3]]\r\n return [[-1]]\r\n\r\nll = [list(map(int,input().split())) for _ in range(3)]\r\n[print(*r) for r in f(ll)]\r\n", "r=list(map(int,input().split()));c=list(map(int,input().split()));d=list(map(int,input().split()));ok=0\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n for k in range(1,10):\r\n for e in range(1,10):\r\n if(i!=j and i!=k and i!=e and j!=k and j!=e and k!=e and ok==0 and i+j==r[0] and k+e==r[1] and i+k==c[0] and j+e==c[1] and i+e==d[0] and j+k==d[1]):\r\n print(i,j);print(k,e);ok=1\r\nif(ok==0):print(-1)\r\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nc = (c1 - d1 + r2) // 2 \r\nd = r2 - c \r\nb = (c2 + d2 - c - d) // 2 \r\na = r1 - b \r\nl = [a, b, c, d]\r\nif(2 * c == (c1 - d1 + r2) and 2 * b == (c2 + d2 - c - d) and min(l) >= 1 and max(l) <= 9 and len(set(l)) == 4):\r\n print(a, b)\r\n print(c, d)\r\nelse:\r\n print(-1)", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\ny = int((c1 - r1 + d2) / 2)\r\nw = c1 - y\r\nx = r1 - w\r\nz = r2 - y\r\n\r\nif w > 9 or y > 9 or x > 9 or z > 9 or w < 1 or y < 1 or x < 1 or z < 1:\r\n print(-1)\r\nelif c2 != x + z or d1 != w + z or d2 != x + y:\r\n print(-1)\r\nelif w == x or w == y or w == z or x == y or x == z or y == z:\r\n print(-1)\r\nelse:\r\n print(w, x)\r\n print(y, z)\r\n", "r = lambda :map(int,input().split())\nr1,r2 = r()\nc1,c2 = r()\nd1,d2 = r()\nif (r1-c1+d2)%2==0:\n x2 = (r1-c1+d2)//2\n x1 = r1-x2\n x3 = d2-x2\n x4 = c2-x2\n if (0<x1<=9 and 0<x2<=9 and 0<x3<=9 and 0<x4<=9 and x1+x3==c1 and x3+x4==r2 and x1+x4==d1):\n if len(set([x1,x2,x3,x4]))<4:\n print(-1)\n else:\n print(x1,x2)\n print(x3,x4)\n else:\n print(-1)\nelse:\n print(-1)", "from itertools import permutations\n\nr1, r2 = map(int, input().split())\nc1, c2 = map(int, input().split())\nd1, d2 = map(int, input().split())\n\n# n1 n2\n# n3 n4\nfor n1, n2, n3, n4 in permutations(range(1, 10), 4):\n condition = (r1 == n1 + n2 and \n r2 == n3 + n4 and\n c1 == n1 + n3 and\n c2 == n2 + n4 and\n d1 == n1 + n4 and\n d2 == n2 + n3)\n if condition:\n print(f\"{n1} {n2}\\n{n3} {n4}\")\n exit(0)\nprint(-1)\n \t \t \t\t \t \t \t\t\t\t\t \t \t \t", "r1,r2 = map(int, input().split())\nc1,c2 = map(int, input().split())\nd1,d2 = map(int, input().split())\nok = 0\na,b,c = 0,0,0\nfor x in range(1,10):\n if ok == 1:\n break\n for y in range(1,10):\n if ok == 1:\n break\n if (x != y):\n for u in range(1,10):\n if ok == 1:\n break\n if (x != u) and (y != u):\n for v in range(1,10):\n if (x!=v) and (y!=v) and (u!=v):\n o1,o2,o3 = 0,0,0\n if (x+y == r1) and (u+v == r2):\n o1 = 1\n if (x+u == c1) and (y+v == c2):\n o2 = 1\n if (x+v == d1) and (y+u == d2):\n o3 = 1\n if (o1 == o2 == o3 == 1):\n ok = 1\n a,b,c = x,y,u\n break\nif ok == 1:\n print(a,b)\n print(c,v)\nelse:\n print(-1)\n \t \t \t\t \t \t\t \t\t\t \t \t \t\t \t", "import math\nfrom collections import defaultdict\nml=lambda:map(int,input().split())\nll=lambda:list(map(int,input().split()))\nii=lambda:int(input())\nip=lambda:list(input())\n\n\"\"\"========main code===============\"\"\"\n\nt=1\n#t=ii()\nfor _ in range(t):\n a,b=ml()\n c,d=ml()\n e,f=ml()\n \n flag=0\n ans=[]\n for i in range(1,10):\n for j in range(1,10):\n for k in range(1,10):\n for l in range(1,10):\n if((i+k==c and i!=k) and (j+l==d and j!=l) and (i+j==a and i!=j) and (k+l==b and k!=l) and (i+l==e and i!=l) and (j+k==f and j!=k) ):\n flag=1\n ans=[[i,j],[k,l]]\n break\n if(flag):\n for i in ans:\n print(*i)\n else:\n print(-1)\n \t \t\t \t \t\t \t\t \t \t \t \t", "from sys import stdin, stdout\r\nINF=1e11\r\n# import math\r\ndef get_int(): return int(stdin.readline().strip())\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\ndef op(c): return stdout.write(c)\r\n# from collections import defaultdict \r\n# for _ in range(int(stdin.readline())):\r\nr1,r2=get_ints()\r\nc1,c2=get_ints()\r\nd1,d2=get_ints()\r\narr=[[0,0],[0,0]]\r\nf=0\r\nfor i in range(1,10):\r\n arr[0][0]=i\r\n for j in range(1,10):\r\n arr[0][1]=j\r\n for k in range(1,10):\r\n arr[1][0]=k\r\n for l in range(1,10):\r\n arr[1][1]=l\r\n if arr[0][0]+arr[0][1]==r1 and arr[1][0]+arr[1][1]==r2 and arr[0][0]+arr[1][0]==c1 and arr[0][1]+arr[1][1]==c2 and arr[0][0]+arr[1][1]==d1 and arr[1][0]+ arr[0][1]==d2:\r\n s=set()\r\n for x in range(2):\r\n for y in range(2):\r\n s.add(arr[x][y])\r\n if len(s)<4:\r\n continue\r\n f=1\r\n for x in range(2):\r\n for y in range(2):\r\n print(arr[x][y],end=\" \")\r\n print()\r\nif f==0:\r\n print(-1)\r\n", "r1, r2 = [int(x) for x in input().split()]\r\nc1, c2 = [int(x) for x in input().split()]\r\nd1, d2 = [int(x) for x in input().split()]\r\n\r\ncartesian_product = [(i, j, k, m)\r\n for i in range(1, 10, 1)\r\n for j in range(1, 10, 1)\r\n for k in range(1, 10, 1)\r\n for m in range(1, 10, 1)\r\n if len(set([i, j, k, m])) == 4]\r\nfound = False\r\nfor x in cartesian_product:\r\n if x[0] + x[1] == r1 \\\r\n and x[2] + x[3] == r2 \\\r\n and x[0] + x[2] == c1 \\\r\n and x[1] + x[3] == c2 \\\r\n and x[0] + x[3] == d1 \\\r\n and x[1] + x[2] == d2:\r\n found = True\r\n [print(x[i]) for i in range(4)]\r\n\r\nif not found:\r\n print(-1)", "I = lambda: map(int, input().split())\r\n\r\nr1, r2 = I()\r\nc1, c2 = I()\r\nd1, d2 = I()\r\n\r\nfor a in range(1, 10):\r\n b, c, d = r1-a, c1-a, d1-a\r\n if ( 0<b<=9 and 0<c<=9 and 0<d<=9\r\n and b+d==c2 and c+d==r2 and b+c==d2 and len({a,b,c,d})>3\r\n ):\r\n print(a, b)\r\n print(c, d)\r\n break\r\nelse:\r\n print(-1)", "r1, r2 = map(int, input().split(\" \"))\r\nc1, c2 = map(int, input().split(\" \"))\r\nd1, d2 = map(int, input().split(\" \"))\r\ni,j,k,z=9,9,9,9\r\nwhile(i>0):\r\n j=i-1\r\n while(j>0):\r\n k=j-1\r\n while(k>0):\r\n z=k-1\r\n while(z>0):\r\n q, w, r, e = i, j, k, z\r\n for _ in range(4):\r\n for _ in range(3):\r\n for _ in range(2):\r\n if (q + w == r1 and w + e == c2 and e + r == r2 and r + q == c1 and q + e == d1 and w + r == d2 ):\r\n print(q, w)\r\n print(r, e)\r\n exit()\r\n\r\n r,e=e,r\r\n w,r,e=r,e,w\r\n q, w, r,e =w,r,e,q\r\n z-=1\r\n k-=1\r\n j-=1\r\n i-=1\r\n\r\nprint(-1)", "r1, r2 = map(int, input().split(\" \"))\r\nc1, c2 = map(int, input().split(\" \"))\r\nd1, d2 = map(int, input().split(\" \"))\r\n\r\n\r\ndef check(a1, a2, a3, a4):\r\n first = (a3 + a4) == r2\r\n second = (a2 + a4) == c2\r\n third = (a2 + a3) == d2\r\n return first and second and third\r\n\r\n\r\nno_answer = True\r\n\r\nfor i in range(1, 10):\r\n bag = {1, 2, 3, 4, 5, 6, 7, 8, 9}\r\n a1 = i\r\n a2 = r1 - a1\r\n a3 = c1 - a1\r\n a4 = d1 - a1\r\n\r\n bag.remove(a1)\r\n if a2 in bag:\r\n bag.remove(a2)\r\n else:\r\n continue\r\n\r\n if a3 in bag:\r\n bag.remove(a3)\r\n else:\r\n continue\r\n if a4 not in bag:\r\n continue\r\n\r\n if check(a1, a2, a3, a4):\r\n print(a1, a2)\r\n print(a3, a4)\r\n no_answer = False\r\n break\r\nif no_answer:\r\n print(-1)\r\n", "# improved sol...\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nx = (c1 - d2 + r1) // 2; y = r1 - x\r\nj = c1 - x; k = d1 - x\r\nst = {x, y, j, k} # st = set([x, y, j, k])\r\nif len(st) != 4 or max(st)>9 or min(st)<1:\r\n print(\"-1\")\r\nelse:\r\n yes = 1\r\n if (j+k)!=r2 or (y+k)!=c2 or (y+j)!=d2:print(\"-1\");yes = 0\r\n if yes == 1:print(\"{} {}\\n{} {}\".format(x, y, j, k))\r\n", "r1,r2=map(int,input().split())\nc1,c2=map(int,input().split())\nd1,d2=map(int,input().split())\n\nx=(d1+c1-r2)//2\ny=r1-x\nz=c1-x\nm=d1-x\nif 1<=x<=9 and 1<=y<=9 and 1<=z<=9 and 1<=m<=9 and len(set([x,y,z,m]))==4:\n\tprint(x,y)\n\tprint(z,m)\nelse:\n\tprint(-1)\n \t \t \t\t \t\t \t \t \t \t\t\t \t", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\na=-1\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n for h in range(1,10):\r\n for g in range(1,10):\r\n if (i!=j and h!=g and i!=h and j!=h and i!=g and j!=g )and (r1==i+j and r2==h+g and d1==i+g and d2==j+h and c1==i+h and c2==j+g):\r\n a=0\r\n print(i,j)\r\n print(h,g)\r\nif a==-1:\r\n print(-1)", "\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\nr1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\t\t\r\na=(r1+c1-d2)//2\r\nb=c1-a\r\nc=r1-a\r\nd=d1-a\r\nl={a,b,c,d}\r\nif len(l)<4 or min(l)<1 or max(l)>9 or b+d!=r2 or a+d!=d1 or c+d!=c2:\r\n\tprint(-1)\r\nelse:\r\n\tprint(a,c)\r\n\tprint(b,d)", "r1, r2 = tuple(map(int, input().split()))\r\nc1, c2 = tuple(map(int, input().split()))\r\nd1, d2 = tuple(map(int, input().split()))\r\nb11, b12, b21, b22 = 0, 0, 0, 0\r\nfor b11 in range(1, r1 + 1):\r\n b21 = c1 - b11\r\n b22 = d1 - b11\r\n if r2 == b21 + b22 and b21 != b22 and b11 != b21 and b11 != b22:\r\n b12 = c2 - b22\r\n if d2 == b12 + b21 and b12 != b11 and b12 != b21 and b12 != b22:\r\n break\r\nif b11 and b12 and b21 and b22 and b11 < 10 and b12 < 10 and b21 < 10 and b22 < 10:\r\n print(f\"{b11} {b12}\\n{b21} {b22}\", end = '')\r\nelse:\r\n print(-1, end = '')\r\n ", "r1, r2 = map(int, input().split())\nc1, c2 = map(int, input().split())\nd1, d2 = map(int, input().split())\na = (d1 + c1 - r2) // 2\nb = r1 - a\nc = c1 - a\nd = d1 - a\nif 1 <= a <= 9 and 1 <= b <= 9 and 1 <= c <= 9 and 1 <= d <= 9 and len(set([a, b, c, d])) == 4:\n print(a, b)\n print(c, d)\nelse:\n print(-1)\n", "def checking(r1, r2, c1, c2, d1, d2):\r\n lis = [1, 2, 3, 4, 5, 6, 7, 8, 9]\r\n ans = 0\r\n for i in range(1, 10):\r\n x = i\r\n a = r1 - x\r\n b = c1 - x\r\n c = r2 - b\r\n if (x != a and x != b and x != c and a != b and a != c and b != c) and (\r\n a in lis and b in lis and c in lis and x in lis) and (\r\n d1 == x + c and d2 == a + b and r1 == x + a and r2 == b + c and c1 == x + b and c2 == a + c):\r\n print(x, a)\r\n print(b, c)\r\n break\r\n ans += 1\r\n if ans == 9: \r\n print(-1)\r\n\r\nr1, r2 = map(int,input().split())\r\nc1, c2 = map(int,input().split())\r\nd1, d2 = map(int,input().split())\r\n\r\nchecking(r1, r2, c1, c2, d1, d2)\n# Wed Oct 14 2020 14:12:24 GMT+0300 (Москва, стандартное время)\n", "r=[int(x) for x in input().split()]\nc=[int(x) for x in input().split()]\nd=[int(x) for x in input().split()]\n\nans=False\nfor w in range(1,10):\n for x in range(1,10):\n for y in range(1,10):\n for z in range(1,10):\n if w!=x and w!=y and w!=z and x!=y and x!=z and y!=z:\n if r[0]==w+x and r[1]==y+z:\n if c[0]==w+y and c[1]==x+z:\n if d[0]==w+z and d[1]==x+y:\n ans=True\n print(w,x)\n print(y,z)\n break\nif not ans:\n print(-1)\n", "def solve(r1, r2, c1, c2, d1, d2):\n for sup_a in range(1,10):\n sup_b = r1 - sup_a\n sup_c = c1 - sup_a\n sup_d = d1 - sup_a\n list_ = [sup_a, sup_b, sup_c, sup_d]\n set_ = set(list_)\n if \\\n len(set_) == len(list_) and\\\n max(list_) <= 9 and\\\n min(list_) >= 1 and\\\n r1 == sup_a + sup_b and\\\n r2 == sup_c + sup_d and\\\n c1 == sup_a + sup_c and\\\n c2 == sup_b + sup_d and\\\n d1 == sup_a + sup_d and\\\n d2 == sup_b + sup_c:\n print(sup_a, sup_b)\n print(sup_c, sup_d)\n return\n print(-1)\n\nif __name__ == '__main__':\n r1, r2 = list(map(int,input().split()))\n c1, c2 = list(map(int,input().split()))\n d1, d2 = list(map(int,input().split()))\n solve(r1, r2, c1, c2, d1, d2)\n\n \t\t\t \t \t\t \t\t\t\t\t\t\t\t\t \t\t \t\t", "r1,r2 = map(int,input().split())\r\nc1,c2 = map(int,input().split())\r\nd1,d2 = map(int,input().split())\r\na=[]\r\na.append((r1+c1-d2)//2)\r\na.append(r1-a[0])\r\na.append(d2-a[1])\r\na.append(d1-a[0])\r\nif(len(set(a))!=4):\r\n print(-1)\r\n exit(0)\r\nfor i in a:\r\n if(i<1 or i>9):\r\n print(-1)\r\n exit(0)\r\nif(a[0]+a[1]!=r1 or a[2]+a[3]!=r2 or a[0]+a[2]!=c1 or a[1]+a[3]!=c2 or a[0]+a[3]!=d1 or a[1]+a[2]!=d2):\r\n print(-1)\r\n exit(0)\r\nprint(\"{} {}\\n{} {}\".format(a[0],a[1],a[2],a[3]))", "r1,r2 = [int(x) for x in input(\"\").split()]\r\nc1,c2 = [int(x) for x in input(\"\").split()]\r\nd1,d2 = [int(x) for x in input(\"\").split()]\r\nfor i in range(1, 9+1):\r\n for j in range(1, 9+1):\r\n for k in range(1, 9+1):\r\n for l in range(1, 9+1):\r\n if len(set([i,j,k,l])) != 4:\r\n continue\r\n if i + j == r1 and k + l == r2 and i + k == c1 and j + l == c2 and i + l == d1 and j + k == d2:\r\n print(i, j)\r\n print(k, l)\r\n exit()\r\nprint(-1)\r\n", "import itertools\r\nI=lambda:map(int,input().split())\r\na,b=I()\r\nc,d=I()\r\ne,f=I()\r\nfor m in itertools.combinations(range(1,10),4):\r\n for w,x,y,z in itertools.permutations(m):\r\n if [w+x,y+z,w+y,x+z,w+z,x+y]==[a,b,c,d,e,f]:\r\n print(f'{w} {x}\\n{y} {z}')\r\n exit(0)\r\nprint(-1)", "I=lambda:map(int,input().split())\r\nR=list(range(1,10))\r\nP=print\r\nq,w=I()\r\ne,r=I()\r\nt,y=I()\r\nz=[(a,b,c,d)for a in R for b in R for c in R for d in R if len(set((a,b,c,d)))>3 and a+b==q and c+d==w and a+c==e and b+d==r and a+d==t and b+c==y]\r\nif z:z=z[0];P(z[0],z[1]);P(z[2],z[3])\r\nelse:P(-1)", "r=[int(x) for x in input().split()]\r\nc=[int(x) for x in input().split()]\r\nd=[int(x) for x in input().split()]\r\n\r\nw=(d[0]-r[1]+c[0])//2\r\nx=r[0]-w\r\ny=c[0]-w\r\nz=d[0]-w\r\nif 1<=w<=9 and 1<=x<=9 and 1<=y<=9 and 1<=z<=9 and w!=x and w!=y and w!=z and x!=y and x!=z and y!=z:\r\n print(w,x)\r\n print(y,z)\r\nelse:\r\n print(-1)", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nf1,f2,f3,f4=0,0,0,0\r\nfc1=0\r\nfc2=0\r\nfc3=0\r\nfc4=0\r\nfc5=0\r\nfc6=0\r\nx3=0\r\nx1=0\r\nx2=0\r\nx4=0\r\nfor i in range(1,10):\r\n fc1=0\r\n fc2=0\r\n fc3=0\r\n fc4=0\r\n fc5=0\r\n fc6=0\r\n x1=i\r\n for j in range(1,10):\r\n if x1+j==c1:\r\n x3=j\r\n f3=1\r\n for j in range(1,10):\r\n if x1+j==d1:\r\n x4=j\r\n f4=1\r\n x2=c2-x4\r\n if x3+x4==r2:\r\n fc2=1\r\n if x1+x2==r1:\r\n fc1=1\r\n if x1+x3==c1:\r\n fc3=1\r\n if x2+x4==c2:\r\n fc4=1\r\n if x1+x4==d1:\r\n fc5=1\r\n if x2+x3==d2:\r\n fc6=1\r\n if [fc1,fc2,fc3,fc4,fc5,fc6]==[1 for i in range(6)] and x1!=x2 and x2!=x3 and x3!=x4 and x4!=x1 and x1!=x3 and x4!=x2:\r\n break\r\n#print([fc1,fc2,fc3,fc4,fc5,fc6])\r\nif [fc1,fc2,fc3,fc4,fc5,fc6]==[1 for i in range(6)] and x1!=x2 and x2!=x3 and x3!=x4 and x4!=x1 and x1!=x3 and x4!=x2:\r\n print(x1,x2)\r\n print(x3,x4)\r\nelse:\r\n print(-1)\r\n \r\n \r\n", "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\nr1,r2=inp()\r\nc1,c2=inp()\r\nd1,d2=inp()\r\na=0\r\nb=0\r\nc=0\r\nd=0\r\nx=0\r\nfor i in range(1,10):\r\n a=i\r\n for j in range(1,10):\r\n b=j\r\n for k in range(1,10):\r\n c=k\r\n for l in range(1,10):\r\n d=l\r\n if a!=b and a!=c and a!=d and b!=c and b!=d and c!=d:\r\n if a+b==c1 and c+d==c2 and a+c==r1 and b+d==r2 and a+d ==d1 and c+b==d2:\r\n print(a , c)\r\n print(b , d)\r\n x=1\r\nif x==0:\r\n print(-1)\r\n", "r = input().split(' ')\nc = input().split(' ')\nd = input().split(' ')\nr1 = int(r[0])\nr2 = int(r[1])\nc1 = int(c[0])\nc2 = int(c[1])\nd1 = int(d[0])\nd2 = int(d[1])\n\n\n#faz os cálculos das posições usando os valores de r1, c1 e d1\na11 = (r1+c1-d2)/2\na12 = r1 - a11\na21 = c1 - a11\na22 = d1 - a11\n\n#verifica se todos os números são diferentes\nall_diff = a11 != a12 and a11 != a21 and a11 != a22 and a12 != a21 and a12 != a22 and a21 != a22\n#verifica se todos os dígitos estão no intervalo [1,9]\nall_valid = a11 >= 1 and a11 <= 9 and a12 >= 1 and a12 <= 9 and a21 >= 1 and a21 <= 9 and a22 >= 1 and a22 <= 9\n#verifica se as somas batem com os valores que não foram usados antes (d2, c2 e r2)\nall_right = (a21 + a22 == r2) and (a12 + a22 == c2) and (a12 + a21 == d2)\n\nif all_diff and all_valid and all_right:\n print(f\"{int(a11)} {int(a12)}\")\n print(f\"{int(a21)} {int(a22)}\")\nelse:\n print(-1)\n\t \t\t \t\t\t\t \t \t\t \t \t\t \t", "from sys import stdin\r\n\r\nr1,r2 = map(int,stdin.readline().split())\r\nc1,c2 = map(int,stdin.readline().split())\r\nd1,d2 = map(int,stdin.readline().split())\r\np = -1\r\nfor i in range(1,10):\r\n\tfor j in range(1,10):\r\n\t\tfor k in range(1,10):\r\n\t\t\tfor l in range(1,10):\r\n\t\t\t\tif i!=j and i!=k and i!=l and j!=k and k!=l and j!=l:\r\n\t\t\t\t\tif (d1==(i+l)) and (d2==(j+k)) and (r1==(i+j)) and (r2==(k+l)) and (c1==(i+k)) and (c2==(j+l)):\r\n\t\t\t\t\t\tprint(str(i)+\" \"+str(j))\r\n\t\t\t\t\t\tprint(str(k)+\" \"+str(l))\r\n\t\t\t\t\t\tp=1\r\n\t\t\t\t\t\tbreak\r\n\t\t\tif p!=-1:\r\n\t\t\t\tbreak\r\n\t\tif p!=-1:\r\n\t\t\tbreak\r\n\tif p!=-1:\r\n\t\tbreak\r\nif p==-1:\t\r\n\tprint(p)", "r1,r2=[int(x) for x in input().split()]\r\nc1,c2=[int(x) for x in input().split()]\r\nd1,d2=[int(x) for x in input().split()]\r\nif r1+r2!=c1+c2 or r1+r2!=d1+d2 or c1+c2!=d1+d2:\r\n print(-1)\r\nelse:\r\n a,b,c,d=(r1-c2+d1)//2,(r1+c2-d1)//2,(2*c1-r1+c2-d1)//2,(d1+c2-r1)//2\r\n if a*b*c*d==0:\r\n print(-1)\r\n else:\r\n if a>=10 or b>=10 or c>=10 or d>=10:\r\n print(-1)\r\n else:\r\n if len(set([a,b,c,d]))!=4:\r\n print(-1)\r\n else:\r\n print(a,b)\r\n print(c,d)", "r1, r2 = map(int,input().split())\nc1, c2 = map(int,input().split())\nd1, d2 = map(int,input().split())\nfor x1 in range(1, 10):\n for x2 in range(1, 10):\n for y1 in range(1, 10):\n for y2 in range(1, 10):\n k = set([x1,x2,y1,y2])\n if len(k) != 4:\n continue\n if r1 != x1 + x2:\n continue\n if r2 != y1 + y2:\n continue\n if c1 != x1 + y1:\n continue\n if c2 != x2 + y2:\n continue\n if d1 != x1 + y2:\n continue\n if d2 != y1 + x2:\n continue\n print(x1,x2)\n print(y1,y2)\n exit()\nprint(-1)\n# Thu Oct 08 2020 20:55:27 GMT+0300 (Москва, стандартное время)\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\ng1 = (d1 - r2 + c1) // 2\r\ng2 = (2*d2 - c1 + d1 - r2) // 2\r\ng3 = (c1 - d1 + r2) // 2\r\ng4 = (r2 - c1 + d1) // 2\r\n\r\nif (g1 > 0 and g1 < 10) and (g2 > 0 and g2 < 10) and (g3 > 0 and g3 < 10) and (g4 > 0 and g4 < 10) and len(set([g1, g2, g3, g4])) == 4:\r\n print(g1, g2)\r\n print(g3, g4)\r\nelse:\r\n print(-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nl = [1, 2, 3, 4, 5, 6, 7, 8, 9]\r\n\r\na, b = (r1-d2+c1)//2, (r1-c1+d2)//2\r\nc, d = c1 - a, c2 - b\r\n\r\nif c==d or a==b or a==c or b==c or a==d or b==d or c+d != r2 or a+d != d1 or (a not in l) or (b not in l) or (c not in l) or (d not in l):\r\n print(-1)\r\nelse:\r\n print(a, b)\r\n print(c, d)\r\n", "def solution(a,b,c,d):\r\n if (a>0 and a<10) and (b>0 and b<10) and (c>0 and c<10) and (d>0 and d<10) and a!=b and a!=c and a!=d and b!=c and b!=d and c!=d:\r\n print(a,c)\r\n print(d,b)\r\n return 0\r\n print(int(-1))\r\n return 0\r\n\r\nr1,r2=list(map(int,input().split(\" \")))\r\nc1,c2=list(map(int,input().split(\" \")))\r\nd1,d2=list(map(int,input().split(\" \")))\r\na=(c1-r2+d1) >> 1;\r\nb=(r2-c1+d1) >> 1;\r\nc=(c2-r2+d2) >> 1;\r\nd=(r2-c2+d2) >> 1;\r\nsolution(a,b,c,d)", "from itertools import permutations \r\n\r\nperm = permutations([1, 2, 3,4,5,6,7,8,9], 4) \r\nx=0\r\nr1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\ncheck=True\r\nfor i in list(perm): \r\n ans=permutations(list(i),4)\r\n for j in list(ans):\r\n k=list(j)\r\n a=k[0]\r\n b=k[1]\r\n c=k[2]\r\n d=k[3]\r\n #a b\r\n #c d\r\n if((a+b)==r1 and (c+d)==r2 and (a+c)==c1 and (b+d)==c2 and (a+d)==d1 and (b+c)==d2):\r\n print(a,b)\r\n print(c,d)\r\n check=False\r\n if(not check):\r\n break\r\n if(not check):\r\n break\r\nif(check):\r\n print(-1)", "z=0\r\nr1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nfor x in range(1,10):\r\n x2=r1-x\r\n x3=c1-x\r\n if x3<r2:\r\n x4=r2-x3\r\n if x3+x2==d2 and x+x4==d1 and 0<x<10 and 0<x2<10 and 0<x3<10 and 0<x4<10: \r\n if x!=x2 and x3!=x4 and x!=x4 and x3!=x2 and x!=x3 and x2!=x4:\r\n print('%d %d'%(x,x2))\r\n print('%d %d'%(x3,x4))\r\n z+=1\r\nif z==0:\r\n print(-1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import itertools\n\nsum_to_sockets = [\n (0, 1),\n (2, 3),\n (0, 2),\n (1, 3),\n (0, 3),\n (1, 2)\n]\n\nsums = []\nfor _ in range(3):\n sums += list(map(int, input().split()))\n\nfor seq in itertools.permutations(range(1, 10), r=4):\n if all([seq[sum_to_sockets[i][0]] + seq[sum_to_sockets[i][1]] == sums[i]\n for i in range(6)]):\n print(str(seq[0]) + \" \" + str(seq[1]))\n print(str(seq[2]) + \" \" + str(seq[3]))\n break\nelse:\n print(-1)\n", "r1 , r2 = map(int,input().split())\r\nc1 , c2 = map(int,input().split())\r\nd1 , d2 = map(int,input().split())\r\nans = [[0,0],[0,0]]\r\ncnt = 1\r\nwhile (cnt<10):\r\n\tans[0][0] = cnt\r\n\tans[0][1] = r1 - cnt\r\n\tans[1][0] = c1 - cnt\r\n\tans[1][1] = d1 - cnt\r\n\tif (ans[1][0]+ans[1][1]!=r2) or (ans[0][1]+ans[1][1]!=c2) or (ans[1][0]+ans[0][1]!=d2):\r\n\t\tans = [[0,0],[0,0]]\r\n\t\tcnt+=1\r\n\telse:\r\n\t\tbreak\r\nif len(list(set([ans[0][0],ans[0][1],ans[1][0],ans[1][1]])))!=4 or (max(ans[0])>9 or max(ans[1])>9) or (min(ans[0])<1 or min(ans[1])<1):\r\n\tprint(-1)\r\nelse:\r\n\tprint(ans[0][0],ans[0][1])\r\n\tprint(ans[1][0],ans[1][1])", "r1, r2 = [int(i) for i in input().split()]\r\nc1, c2 = [int(i) for i in input().split()]\r\nd1, d2 = [int(i) for i in input().split()]\r\n\r\noutput = ''\r\n\r\nfor i in range(9):\r\n arr = [1, 2, 3, 4, 5, 6, 7, 8, 9]\r\n r1n1 = arr[i]\r\n arr.pop(i)\r\n try:\r\n r1n2i = arr.index(r1 - r1n1)\r\n except:\r\n continue\r\n r1n2 = arr[r1n2i]\r\n arr.pop(r1n2i)\r\n try:\r\n r2n1i = arr.index(c1 - r1n1)\r\n except:\r\n continue\r\n r2n1 = arr[r2n1i]\r\n arr.pop(r2n1i)\r\n try:\r\n r2n2i = arr.index(c2 - r1n2)\r\n except:\r\n continue\r\n r2n2 = arr[r2n2i]\r\n arr.pop(r2n2i)\r\n\r\n if r2n1 + r2n2 == r2 and r1n1 + r2n2 == d1 and r1n2 + r2n1 == d2:\r\n output += f\"{r1n1} {r1n2}\\n{r2n1} {r2n2}\"\r\n else:\r\n continue\r\n\r\nif output == '':\r\n print(-1)\r\nelse:\r\n print(output)", "import itertools\nn = []\n[n.append(int(x)) for x in input().split()]\n[n.append(int(x)) for x in input().split()]\n[n.append(int(x)) for x in input().split()]\ng = list(range(1, 10))\nlk = True\nfor c in list(itertools.permutations(g)):\n if c[0] + c[1] != n[0]: continue\n if c[2] + c[3] != n[1]: continue\n if c[0] + c[2] != n[2]: continue\n if c[1] + c[3] != n[3]: continue\n if c[0] + c[3] != n[4]: continue\n if c[1] + c[2] != n[5]: continue\n lk = False\n print(c[0], c[1])\n print(c[2], c[3])\n break\nif lk: print('-1')\n\t\t\t\t \t \t\t \t\t \t \t\t\t\t \t\t \t\t \t", " \r\nr = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nd = list(map(int,input().split()))\r\n \r\nb = (d[0]-r[0]+c[1])//2\r\na = r[1]-b\r\nx = c[0]-a\r\ny = r[0]-x\r\nl = [x,y,a,b]\r\n \r\nif len(list(dict.fromkeys([x,y,a,b])))==4:\r\n\tif min(l)>0 and max(l)<10:\r\n\t\tprint(x,y,'\\n'+str(a),b)\r\n\telse:\r\n\t\tprint(-1)\r\nelse:\r\n\tprint(-1)\r\n ", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nfor a in range(1,10):\r\n\tfor b in range(1,10):\r\n\t\tif b==a:continue\r\n\t\tfor c in range(1,10):\r\n\t\t\tif c==a or c==b:continue\r\n\t\t\tfor d in range(1,10):\r\n\t\t\t\tif d==c or d==a or d==b:continue\r\n\t\t\t\tif a+b==r1 and\\\r\n\t\t\t\t c+d==r2 and\\\r\n\t\t\t\t a+d==d1 and\\\r\n\t\t\t\t b+c==d2 and\\\r\n\t\t\t\t a+c==c1 and\\\r\n\t\t\t\t b+d==c2:\r\n\t\t\t\t\tprint(a,b)\r\n\t\t\t\t\tprint(c,d)\r\n\t\t\t\t\texit()\r\nprint(-1)\n# Mon Oct 05 2020 12:46:44 GMT+0300 (Москва, стандартное время)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n(r1, r2) = tuple(map(int, input().split()))\r\n(c1, c2) = tuple(map(int, input().split()))\r\n(d1, d2) = tuple(map(int, input().split()))\r\n\r\n\r\na = (r1 + c1 - d2) // 2\r\n\r\nif a != ((c1 + d1 - r2) // 2):\r\n print(-1)\r\n exit()\r\n\r\nb = r1 - a\r\nc = c1 - a\r\nd = d1 - a\r\n\r\nset1 = set([a, b, c, d])\r\n\r\nif len(set1) != 4:\r\n print(-1)\r\n exit()\r\n\r\nfor ele in set1:\r\n if ele > 9 or ele < 1:\r\n print(-1)\r\n exit() \r\n\r\nprint(a, b)\r\nprint(c, d)", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\n\r\nx=(d1+c1-r2)//2\r\ny=r1-x\r\nz=c1-x\r\nw=d1-x\r\nif 1<=x<=9 and 1<=y<=9 and 1<=z<=9 and 1<=w<=9 and len(set([x,y,z,w]))==4:\r\n\tprint(x,y)\r\n\tprint(z,w)\r\nelse:\r\n\tprint(-1)", "r,rr = map(int,input().split())\r\nc,cc = map(int,input().split())\r\nd,dd = map(int,input().split())\r\n\r\n\r\nfor w in range(1, 10):\r\n for x in range(1, 10):\r\n for y in range(1, 10):\r\n for z in range(1, 10):\r\n if len(set([w,x,y,z])) != 4: continue\r\n if w+x == r and y + z == rr and w + y == c and x + z == cc and w + z== d and x +y == dd:\r\n print(w,x)\r\n print(y,z)\r\n exit()\r\n\r\nprint(-1) ", "def is_valid_combination(combination, r1, r2, c1, c2, d1, d2):\r\n a, b, c, d = combination\r\n return (a + b == r1 and c + d == r2 and a + c == c1 and b + d == c2 and a + d == d1 and b + c == d2)\r\n\r\ndef find_valid_combination(r1, r2, c1, c2, d1, d2):\r\n for a in range(1, 10):\r\n for b in range(1, 10):\r\n for c in range(1, 10):\r\n for d in range(1, 10):\r\n combination = (a, b, c, d)\r\n if len(set(combination)) == 4 and is_valid_combination(combination, r1, r2, c1, c2, d1, d2):\r\n return combination\r\n return None\r\n\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\ncombination = find_valid_combination(r1, r2, c1, c2, d1, d2)\r\n\r\nif combination:\r\n a, b, c, d = combination\r\n print(a, b)\r\n print(c, d)\r\nelse:\r\n print(-1)\r\n", "import itertools\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nx = [(0, 1, r1), (0, 2, c1), (0, 3, d1), (1, 2, d2), (1, 3, c2), (2, 3, r2)]\r\np0 = [i for i in range(1, 10)]\r\nc = 0\r\nans = \"-1\"\r\nfor p in itertools.permutations(p0, 4):\r\n ok = 1\r\n for i, j, k in x:\r\n if (p[i] + p[j]) ^ k:\r\n ok = 0\r\n break\r\n if ok:\r\n ans = \" \".join(map(str, p[:2])) + \"\\n\" + \" \".join(map(str, p[2:]))\r\n break\r\nprint(ans)", "r1,r2 = map(int, input().split(\" \"))\r\nc1,c2 = map(int, input().split(\" \"))\r\nd1,d2 = map(int, input().split(\" \"))\r\nfor a1 in range(1,10):\r\n for a2 in range(1,10):\r\n for a3 in range(1,10):\r\n for a4 in range(1,10):\r\n if (a1!=a2)and(a1!=a3)and(a1!=a4)and(a2!=a3)and(a2!=a4)and(a3!=a4)and(a1+a2==r1)and(a3+a4==r2)and(a1+a3==c1)and(a2+a4==c2)and(a1+a4==d1)and(a2+a3==d2):\r\n print(a1,a2)\r\n print(a3,a4)\r\n exit()\r\nprint(-1)\r\n\r\n ", "r1, r2 = [int(x) for x in input().split()]\r\nc1, c2 = [int(x) for x in input().split()]\r\nd1, d2 = [int(x) for x in input().split()]\r\ngems = list(range(1, 10))\r\nx = int(.5 * (c1-r2+d1))\r\ny = int(.5 * (d2+c2-r2))\r\nf = c2 - y\r\nz = c1 - x\r\nif all([1 if q in range(1, 10) else 0 for q in [x, y, z, f]]) and len(set([x, y, z, f])) == 4:\r\n print(x, y)\r\n print(z, f)\r\nelse:\r\n print(-1)\r\n", "r=input().split()\r\nc=input().split()\r\nd=input().split()\r\ndef chick_list(l):\r\n if l[0]+l[1]==int(r[0]) and l[2]+l[3]==int(r[1]) and l[0]+l[2]==int(c[0]) and l[1]+l[3]==int(c[1]) and l[0]+l[3]==int(d[0]) and l[1]+l[2]==int(d[1]):\r\n return 1\r\n return 0 \r\n\r\nll=[0, 0, 0, 0]\r\n\r\nfor i in range(1,10):\r\n ll[0] = i\r\n for j in range(1,10):\r\n if i==j:\r\n continue \r\n ll[1] = j\r\n for k in range(1,10):\r\n if k==j or k==i:\r\n continue\r\n ll[2]=k\r\n for m in range(1,10):\r\n if m==k or m==j or m==i:\r\n continue\r\n ll[3]=m\r\n if chick_list(ll)==1:\r\n print(ll[0],' ',ll[1] ,'\\n' ,ll[2],' ',ll[3],sep='')\r\n exit()\r\nprint('-1') \r\n", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\ndef check1(val):\r\n for i in val:\r\n if i <1 or i > 9:\r\n return False \r\n \r\n return True \r\n\r\ndef solve():\r\n \r\n # write your code here \r\n r1,r2 = II() \r\n c1,c2 = II() \r\n d1,d2 = II() \r\n \r\n a = (d1 + r1 - c2)//2 \r\n y = d1 - a \r\n b = r1 - a \r\n x = r2 - y \r\n\r\n if check1([y,a,b,x]) and len(set([a,y,b,x])) ==4:\r\n if d1 - y == c1 - x == r1 - b and r2 - y == c1 - a == d2 - b and c2 - y == d2 - x == r1 - a and d1 - a == c2 - b == r2 -x:\r\n print(a,b)\r\n print(x,y)\r\n return \r\n \r\n print(-1)\r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nsolve()\r\n", "from sys import stdin,stdout\r\ni1 = lambda : int(stdin.readline())\r\niia = lambda : map(int, stdin.readline().split())\r\nisa = lambda: stdin.readline().split()\r\n\r\nr1, r2 = iia()\r\nc1, c2 = iia()\r\nd1, d2 = iia()\r\nif (c2 + r2 - d2) % 2 == 0:\r\n d = (c2 + r2 - d2) // 2\r\n c = r2 - d\r\n b = c2 - d\r\n a = r1 - b\r\n temp = [a, b, c, d]\r\n if len(set(temp)) != 4:\r\n print(-1)\r\n else:\r\n for i in temp:\r\n if not (i > 0 and i < 10):\r\n print(-1)\r\n break\r\n else:\r\n print(a, b)\r\n print(c, d)\r\nelse:\r\n print(-1)\r\n \r\n\r\n", "s=input('')\r\ns1=input('')\r\ns2=input('')\r\nr1,r2=s.split(' ')\r\nr1=int(r1)\r\nr2=int(r2)\r\nc1,c2=s1.split(' ')\r\nc1=int(c1)\r\nc2=int(c2)\r\nd1,d2=s2.split(' ')\r\nd1=int(d1)\r\nd2=int(d2)\r\na=(2*r1-r2+2*c1-c2+2*d1-d2)/6\r\nb=(2*r1-r2+2*c1+5*c2-4*d1-d2)/6\r\nc=(-4*r1-r2+2*c1-c2+2*d1+5*d2)/6\r\nd=(2*r1+5*r2-4*c1-c2+2*d1-d2)/6\r\n# print(a,b,c,d)\r\nl=[1.0,2.0,3.0,4.0,5.0,6.0,7.0,8.0,9.0]\r\nl1=[]\r\nif(a not in l1):\r\n l1.append(a)\r\nif(b not in l1):\r\n l1.append(b)\r\nif(c not in l1):\r\n l1.append(c)\r\nif(d not in l1):\r\n l1.append(d)\r\nif(a in l and b in l and c in l and d in l):\r\n if(len(l1)==4):\r\n print(int(a),int(b),end='\\n')\r\n print(int(c),int(d))\r\n else:\r\n print('-1')\r\nelse:\r\n print('-1')\r\n", "r1, r2 = list(map(int, input().split(\" \")))\r\nc1, c2 = list(map(int, input().split(\" \")))\r\nd1, d2 = list(map(int, input().split(\" \")))\r\nans = [0]*4\r\nfor i in range(1, 10):\r\n for j in range(1, 10):\r\n for k in range(1, 10):\r\n for l in range(1, 10):\r\n if d1 == i+l and c1 == i + k and c2 == j+l and d2 == j+k and r1 == i+j and r2 == k + l:\r\n ans[0],ans[1],ans[2],ans[3]=i,j,k,l\r\n\r\nif len(set(ans)) < 4:\r\n print(-1)\r\nelse:\r\n print(ans[0],end=\" \")\r\n print(ans[1])\r\n print(ans[2],end=\" \")\r\n print(ans[3])\r\n\r\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nr1,r2 = li()\r\nc1,c2 = li()\r\nd1,d2 = li()\r\nf = 0\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n for k in range(1,10):\r\n for l in range(1,10):\r\n if i + j == r1 and k + l == r2 and i + k == c1 and j + l == c2 and i + l == d1 and j + k == d2 and (i != j and i != k and i != l and j != k and j != l and k != l):\r\n print(i,j)\r\n print(k,l)\r\n f = 1\r\nif not f:\r\n print(-1)", "r1,r2 = map(int,input().split())\r\nc1,c2 = map(int,input().split())\r\nd1,d2 = map(int,input().split())\r\nx = (d2-c1+r1)/2\r\ny = (d2-c2+r2)/2\r\nw = (d1-c2+r1)/2\r\nz = (d1-c1+r2)/2\r\nif x != y and y != z and z != w and x != w and y != w and x != z and x == int(x) and y == int(y) and z == int(z) and w == int(w) and x >= 1 and x <= 9 and y >= 1 and y<= 9 and w >= 1 and w <= 9 and z >= 1 and z <= 9:\r\n print(int(w), end=\" \")\r\n print(int(x))\r\n print(int(y), end=\" \")\r\n print(int(z))\r\nelse:\r\n print(-1)\r\n", "r1, r2 = list(map(int, input().split()))\nc1, c2 = list(map(int, input().split()))\nd1, d2 = list(map(int, input().split()))\n\n\ndef isValid(i, j, k, l):\n rows_good = i + j == r1 and k + l == r2\n cols_good = i + k == c1 and j + l == c2\n diag_good = i + l == d1 and j + k == d2\n return rows_good and cols_good and diag_good\n\n\nfor i in range(1, 10):\n for j in range(1, 10):\n for k in range(1, 10):\n for l in range(1, 10):\n if i == j or i == k or i == l or j == k or j == l or k == l:\n continue\n if isValid(i, j, k, l):\n print(i, j)\n print(k, l)\n exit()\n\nprint(-1)\n\t \t\t\t \t\t \t \t\t \t\t\t \t \t\t\t \t\t", "from itertools import combinations, permutations\nr1, r2 = (int(x) for x in input().split())\nc1, c2 = (int(x) for x in input().split())\nd1, d2 = (int(x) for x in input().split())\nfor x, y, z, w in combinations(range(1, 10), 4):\n\tfor x, y, z, w in permutations([x, y, z, w]):\n\t\tif (x + y == r1 and z + w == r2 and x + z == c1 and\n \t y + w == c2 and x + w == d1 and y + z == d2):\n\t\t\tprint(x, y)\n\t\t\tprint(z, w)\n\t\t\tbreak\n\telse:\n\t\tcontinue\n\tbreak\nelse:\n\tprint(-1)\n", "import itertools\nn = []\n[n.append(int(x)) for x in input().split()]\n[n.append(int(x)) for x in input().split()]\n[n.append(int(x)) for x in input().split()]\ng = list(range(1, 10))\nlk = True\nfor gg in list(itertools.permutations(g)):\n if gg[0] + gg[1] != n[0]: continue\n if gg[2] + gg[3] != n[1]: continue\n if gg[0] + gg[2] != n[2]: continue\n if gg[1] + gg[3] != n[3]: continue\n if gg[0] + gg[3] != n[4]: continue\n if gg[1] + gg[2] != n[5]: continue\n lk = False\n print(gg[0], gg[1])\n print(gg[2], gg[3])\n break\nif lk: print('-1')\n\t \t \t\t \t\t\t \t \t\t \t\t \t \t \t \t", "from itertools import permutations\r\nr1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nfor i,j,k,l in permutations(range(1,10),4):\r\n if i+j == r1 and k+l == r2 and i+l == c1 and j+k == c2 and i+k == d1 and l+j == d2:\r\n print(i,j)\r\n print(l,k)\r\n quit()\r\nprint(-1)\r\n", "from itertools import permutations\n\na = [[0,0],\n [0,0]]\n\ndef check_sudoku(r1,r2,c1,c2,d1,d2):\n return a[0][0] + a[1][1] == (d1) and a[0][0] + a[0][1] == (r1) and a[0][0] + a[1][0] == (c1) and a[1][0] + a[0][1] == (d2) and a[1][0] + a[1][1] == (r2) and a[0][1] + a[1][1] == (c2)\n\ndef solve_sudoku(r1,r2,c1,c2,d1,d2):\n for a00, a01, a10, a11 in permutations(range(1,10), 4):\n a[0][0] = a00\n a[0][1] = a01\n a[1][0] = a10\n a[1][1] = a11\n\n if check_sudoku(r1,r2,c1,c2,d1,d2):\n print(str(a[0][0]) + \" \" + str(a[0][1]))\n print(str(a[1][0]) + \" \" + str(a[1][1]))\n exit(0)\n \n\ndef run():\n r1, r2 = map(int, input().strip().split())\n c1, c2 = map(int, input().strip().split())\n d1, d2 = map(int, input().strip().split())\n\n solve_sudoku(r1,r2,c1,c2,d1,d2)\n\n print(-1)\n\nrun()\n\t \t\t\t\t\t \t \t\t \t \t\t\t\t \t", "l1, l2 = map(int, input().split())\nc1, c2 = map(int, input().split())\nd1, d2 = map(int, input().split())\n\ndef validar(box):\n if box[0] + box[1] == l1 \\\n and box[2] + box[3] == l2 \\\n and box[0] + box[2] == c1 \\\n and box[1] + box[3] == c2 \\\n and box[0] + box[3] == d1 \\\n and box[1] + box[2] == d2:\n for i in range(4):\n for j in range(i+1, 4):\n if box[j] == box[i]: return False\n return True\n return False\n\nfor i in range(1, 10):\n for j in range(1, 10):\n for k in range(1, 10):\n for l in range(1, 10):\n\n if validar([i, j, k, l]):\n print(f\"{i} {j}\\n{k} {l}\\n\")\n exit(0)\nprint(-1)\n\n\t\t \t\t\t\t \t\t\t \t \t \t", "r1, r2 = list(map(int, input().split()))\r\nc1, c2 = list(map(int, input().split()))\r\nd1, d2 = list(map(int, input().split()))\r\nresult = []\r\nfor a in range(1, 10):\r\n for b in range(1, 10):\r\n for c in range(1, 10):\r\n for d in range(1, 10):\r\n if r1 == a+b and r2 == c+d and d1 == a+d and \\\r\n c1 == a+c and c2 == b+d and d2 == b+c:\r\n ans = [[a, b], [c, d]]\r\n result.append(ans)\r\nfinal_result = None\r\nfor ans in result:\r\n if ans and len({ans[0][0], ans[0][1], ans[1][0], ans[1][1],}) == 4:\r\n final_result = ans\r\n\r\nif final_result:\r\n for i in range(2):\r\n for j in range(2):\r\n print(final_result[i][j], end=\" \")\r\n print()\r\nelse:\r\n print(-1)", "import sys\n\nr1, r2 = [int(i) for i in input().split()]\nc1, c2 = [int(i) for i in input().split()]\nd1, d2 = [int(i) for i in input().split()]\n\nx = int((d1 - r2 + c1) / 2)\ny = int(r1 - x)\nz = int(d2 - y)\nw = int(c2 - y)\n\npossible = True\n\nfor i in [x, y, z, w]:\n if i <= 0 or i > 9:\n possible = False\n\nif len([x, y, z, w]) != len(set([x, y, z, w])):\n possible = False\n\nif possible:\n print(f'{x} {y}\\n{z} {w}')\nelse:\n print(-1)\n\n \t\t \t\t\t\t \t \t \t \t \t\t \t \t \t", "r1, r2 = map(int, input().split())\r\n\r\nc1, c2 = map(int, input().split())\r\n\r\nd1, d2 = map(int, input().split()) \r\nfound = False\r\nfor a in range(1,10):\r\n for b in range(1,10):\r\n if b != a:\r\n for c in range(1,10):\r\n if c != b and c != a:\r\n for d in range(1,10):\r\n if d != a and d !=b and d !=c:\r\n if r1 == a+b and r2 == c+d and c1 == a+c and c2 == b+d and d1 ==a+d and d2 == b+c:\r\n print(a,b)\r\n print(c,d)\r\n found = True\r\n break\r\nif not found:\r\n print(-1)\r\n \r\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nfor a in range(1, 10):\r\n\tfor b in range(1, 10):\r\n\t\tfor c in range(1, 10):\r\n\t\t\tfor d in range(1, 10):\r\n\t\t\t\tif a + b == r1 and c + d == r2 and a + c == c1 and b + d == c2 and a + d == d1 and b + c == d2:\r\n\t\t\t\t\tif len(set([a, b, c, d])) == 4:\r\n\t\t\t\t\t\tprint(a, b)\r\n\t\t\t\t\t\tprint(c, d)\r\n\t\t\t\t\t\texit(0)\r\nprint(-1)", "a,b=list(map(int,input().split()))\r\nc,d=list(map(int,input().split()))\r\ne,f=list(map(int,input().split()))\r\ng,h,i,j=(a-d+e)//2*((a-d+e)//2==(c-b+e)//2),(a-c+f)//2*((a-c+f)//2==(d-b+f)//2),(c-e+b)//2,(d+e-a)//2\r\nif g not in range(1,10) or h not in range(1,10) or i not in range(1,10) or j not in range(1,10) or g==h or g==i or g==j or h==i or i==j or h==j:\r\n\tprint(-1)\r\nelse:\r\n\tprint(g,h)\r\n\tprint(i,j)", "from itertools import permutations\n\nr2, r1 = list(map(int, input().split()))\nc1, c2 = list(map(int, input().split()))\nd1, d2 = list(map(int, input().split()))\n\ns = [1, 2, 3, 4, 5, 6, 7, 8, 9]\nfor a in permutations(s):\n if a[0]+a[1] == r2 and a[2]+a[3] == r1 and a[0]+a[2] == c1 and a[3]+a[1] ==c2 and a[0]+a[3] ==d1 and a[2]+a[1] ==d2:\n print(f\"{a[0]} {a[1]}\")\n print(f\"{a[2]} {a[3]}\")\n exit()\nprint(-1)\n", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nfor i in range(1,10):\r\n for j in range(1,10):\r\n for k in range(1,10):\r\n for l in range(1,10):\r\n if i!=j and i!=k and i!=l and j!=k and j!=l and k!=l:\r\n if r1==i+j and r2==k+l and c1==i+k and c2==j+l and d1==i+l and d2==j+k:\r\n print(i,j)\r\n print(k,l)\r\n exit()\r\nprint(-1)", "r1, r2 = list(map(int, input().split()))\r\nc1, c2 = list(map(int, input().split()))\r\nd1, d2 = list(map(int, input().split()))\r\nx = [0] * 4; y = []; f = True\r\nx[2] = ((c2+d1)-r1) // 2\r\nx[3] = r2 - x[2]\r\nx[1] = c1 - x[3]\r\nx[0] = c2 - x[2]\r\nfor i in x:\r\n if i not in y:\r\n y.append(i)\r\nfor i in x:\r\n if i < 1 or i > 9:\r\n f = False\r\nif len(y) != 4 or f is False:\r\n print(-1)\r\nelse:\r\n print(str(x[1]) + \" \" + str(x[0]) + '\\n' + str(x[3]) + \" \" + str(x[2]))", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\nk = 0\r\n\r\nfrom itertools import permutations\r\n \r\n# Get all permutations of length 2\r\n# and length 2\r\nperm = permutations([1, 2, 3, 4, 5, 6, 7, 8, 9], 4)\r\n \r\n# Print the obtained permutations\r\nfor item in list(perm):\r\n #print (item)\r\n\r\n a = item[0]\r\n b = item[1]\r\n c = item[2]\r\n d = item[3]\r\n\r\n if a + b == r1 and c + d == r2 and a + c == c1 and b + d == c2 and a + d == d1 and b + c == d2:\r\n print (a, b)\r\n print (c, d)\r\n k += 1\r\n break \r\n\r\nif k == 0:\r\n print(-1)", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\ndef sol(r1, r2, c1, c2, d1, d2):\r\n for a in range(1,10):\r\n for b in range(1,10):\r\n for c in range(1, 10):\r\n for d in range(1, 10):\r\n if a+b == r1:\r\n if c+d == r2:\r\n if a+c == c1:\r\n if b+d == c2:\r\n if a+d == d1:\r\n if b+c == d2:\r\n if a != b and a != c and a != d and b != c and b != d and c != d:\r\n print(a, b)\r\n print(c, d)\r\n return\r\n print(-1)\r\n return\r\nsol(r1, r2, c1, c2, d1, d2)", "r1,r2 = map(int,input().split())\r\nc1,c2 = map(int,input().split())\r\nd1,d2 = map(int,input().split())\r\nc = abs(r1-c1-d2)//2\r\nb = abs(r2-c2-d2)//2\r\na = abs(r1-b)\r\nd = abs(c2-b)\r\nres = [a,b,c,d]\r\nif a+b != r1 or c+d != r2 or a+d != d1 or b+c != d2:\r\n print(-1)\r\nelse:\r\n for i in range(4):\r\n if res.count(res[i])>1 or res[i] >9 or res[i] < 1:\r\n print(-1)\r\n break\r\n else:\r\n print(a,b)\r\n print(c,d)\r\n", "r1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\ni=1\r\nwhile(i<10):\r\n j=1\r\n while(j<10):\r\n k=1\r\n while(k<10):\r\n l=1\r\n while(l<10):\r\n if((i+j)==r1 and (k+l)==r2 and (i+k)==c1 and (j+l)==c2 and (i+l)==d1 and (j+k)==d2 and j!=i and k!=i and k!=j and l!=i and l!=j and l!=k):\r\n print(i,j)\r\n print(k,l)\r\n exit()\r\n l+=1\r\n k+=1\r\n j+=1\r\n i+=1\r\nprint(\"-1\")", "r1, r2 = map(int, input().split(\" \"))\r\nc1, c2 = map(int, input().split(\" \"))\r\nd1, d2 = map(int, input().split(\" \"))\r\n\r\n\r\ndef check(result):\r\n bag = {1, 2, 3, 4, 5, 6, 7, 8, 9}\r\n for i in result:\r\n if i in bag:\r\n bag.remove(i)\r\n else:\r\n return False\r\n first = (result[2] + result[3]) == r2\r\n second = (result[1] + result[3]) == c2\r\n third = (result[1] + result[2]) == d2\r\n return first and second and third\r\n\r\n\r\nno_answer = True\r\nidx = 0\r\nresult = [0, 0, 0, 0]\r\nfor i in range(1, 10):\r\n result[0] = i\r\n result[1] = r1 - result[0]\r\n result[2] = c1 - result[0]\r\n result[3] = d1 - result[0]\r\n\r\n if check(result):\r\n print(result[0], result[1])\r\n print(result[2], result[3])\r\n no_answer = False\r\n break\r\nif no_answer:\r\n print(-1)\r\n", "r1,r2 = input().split()\r\nc1,c2 = input().split()\r\nd1,d2 = input().split()\r\nr1,r2,c1,c2,d1,d2 = int(r1),int(r2),int(c1),int(c2),int(d1),int(d2)\r\n \r\na1,a2,a3,a4 = r1+d1-c2, r1-d1+c2, 2*d2 - r1 + d1 -c2, c2-r1+d1\r\n \r\nif a1%2!=0:\r\n print(-1)\r\n \r\nelif a1==a2 or a1==a3 or a1==a4 or a2==a3 or a2==a4 or a3==a4:\r\n print(-1)\r\nelif a1<=0 or a2<=0 or a3<=0 or a4<=0:\r\n print(-1)\r\nelif a1>=19 or a2>=19 or a3>=19 or a4>=19:\r\n print(-1)\r\nelif a3+a4 != 2*r2:\r\n print(-1)\r\nelse:\r\n a1, a2, a3, a4 = a1//2 , a2//2, a3//2, a4//2 \r\n print(a1 , a2)\r\n print(a3, a4)", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\nx = (d1 + c1 - r2) // 2\r\ny = r1 - x\r\nz = c1 - x\r\nw = d1 - x\r\nif 1 <= x <= 9 and 1 <= y <= 9 and 1 <= z <= 9 and 1 <= w <= 9 and len(set([x, y, z, w])) == 4:\r\n print(x, y)\r\n print(z, w)\r\nelse:\r\n print(-1)", "\r\n\r\n\r\n\r\nr1,r2=map(int,input().split())\r\nc1,c2=map(int,input().split())\r\nd1,d2=map(int,input().split())\r\nx1=(d1+c1-r2)//2\r\nx2=r1-x1\r\nx3=d2-x2\r\nx4=r2-x3\r\n\r\nif 1<=x1<=9 and 1<=x2<=9 and 1<=x3<=9 and 1<=x4<=9 and len(set([x1,x2,x3,x4]))==4:\r\n\tprint(x1,x2)\r\n\tprint(x3,x4)\r\nelse:\r\n\tprint(-1)\r\n \r\n\r\n", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nsetrecursionlimit(10**7)\ndX= [ 0, 0, 1,-1, 1,-1, 1,-1]\ndY= [ 1,-1, 0, 0, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\nr1,r2=RI()\nc1,c2=RI()\nd1,d2=RI()\nfor a in range(1,10):\n x=(a,r1-a,c1-a,d1-a)\n if any(i<1 or i>9 for i in x) or any(x[i] in x[i+1:] for i in range(4)):\n continue\n if x[1]+x[3]==c2 and x[1]+x[2]==d2 and x[2]+x[3]==r2:\n print(*(x[:2]))\n print(*(x[2:]))\n exit(0)\nprint(-1)\n\n\n", "from itertools import product\r\n\r\n\r\ndef solve():\r\n r1, r2 = map(int, input().strip().split())\r\n l1, l2 = map(int, input().strip().split())\r\n d1, d2 = map(int, input().strip().split())\r\n for ul, ur, ll, lr in product(range(1, 10), repeat=4):\r\n if(len(set([ul, ur, ll, lr])) == 4):\r\n if (ul + ur == r1) and (ll + lr == r2) and (ul + ll == l1) and (ur + lr == l2) and (ul + lr == d1) and (ur + ll == d2):\r\n print(f'{ul} {ur}\\n{ll} {lr}')\r\n return\r\n print(-1)\r\n\r\n\r\nsolve()\r\n", "r1,r2 = map(int,input().split())\nc1,c2 = map(int,input().split())\nd1,d2 = map(int,input().split())\n\nsolution = -1\n\nfor i in range(1,10):\n for j in range(1,10):\n for k in range(1,10):\n for v in range(1,10):\n if len(set([i,j,k,v])) == 4:\n solved = (i + j == r1)\n solved = solved and (k + v == r2)\n solved = solved and (i + k == c1)\n solved = solved and (j + v == c2)\n solved = solved and (i + v == d1)\n solved = solved and (j + k == d2)\n if solved:\n solution = [i,j,k,v]\n break\n else:\n continue\n\nif solution == -1:\n print(\"-1\")\nelse:\n print(solution[0], solution[1])\n print(solution[2], solution[3])\n", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\nflag = False\r\nfor x in range(1, 10):\r\n for y in range(1, 10):\r\n for x1 in range(1, 10):\r\n for y1 in range(1, 10):\r\n if x + y == c1 and x1 + y1 == c2 and x + x1 == r1 and y + y1 == r2 \\\r\n and x + y1 == d1 and y + x1 == d2 and len(set(list((x, y, x1, y1)))) == 4:\r\n flag = True\r\n print(x, x1)\r\n print(y, y1)\r\n exit()\r\n\r\nif not flag:\r\n print(-1)", "arr = [list(map(int, input().split())) for _ in range(3)]\r\n\r\ndef check(a1, a2, a3, a4):\r\n return a1+a2==arr[0][0]\\\r\n and a3+a4==arr[0][1]\\\r\n and a1+a3==arr[1][0]\\\r\n and a2+a4==arr[1][1]\\\r\n and a1+a4==arr[2][0]\\\r\n and a2+a3==arr[2][1]\r\n\r\nrow1 = arr[0][0]\r\nrow2 = arr[0][1]\r\n\r\ncol1 = arr[1][0]\r\ncol2 = arr[2][1]\r\n\r\ndiag1 = arr[2][0]\r\ndiag2 = arr[2][1]\r\n\r\ndef solve():\r\n for a1 in range(1, 10):\r\n if a1 >= row1 or a1 >= col1: break\r\n for a2 in range(1, 10):\r\n if a2 == a1 or a1+a2!=row1: continue\r\n for a3 in range(1, 10):\r\n if a3 in [a1, a2] or a1+a3 != col1 or a2+a3 != diag2: continue\r\n for a4 in range(1, 10):\r\n if a4 in [a1, a2, a3]: continue\r\n if check(a1, a2, a3, a4):\r\n return [a1, a2, a3, a4]\r\n return []\r\n\r\n\r\n\r\nans = solve()\r\nif len(ans):\r\n print(ans[0], ans[1])\r\n print(ans[2], ans[3])\r\nelse:\r\n print(-1)", "r1,r2=map(int,input().split())\nc1,c2=map(int,input().split())\nd1,d2=map(int,input().split())\na=(d1+c1-r2)//2\nb=r1-a\nc=c1-a\nd=d1-a\nif 1<=a<=9 and 1<=b<=9 and 1<=c<=9 and 1<=d<=9 and len(set([a,b,c,d]))==4:\n\tprint(a,b)\n\tprint(c,d)\nelse:\n\tprint(-1)\n\t\t\t\t\t\t\t\t\t\t \t\t\t\t\t\t\t \t\t\t \t\t\t", "\"\"\"609C\"\"\"\r\n# import math\r\ndef main():\r\n\tr1,r2 = map(int,input().split())\r\n\tc1,c2 = map(int,input().split())\r\n\td1,d2 = map(int,input().split())\r\n\r\n\t# r1c1 = 0\r\n\tfor i in range(1,10):\r\n\t\tr1c1 = i \r\n\t\tr2c1 = c1 - r1c1\r\n\t\tr1c2 = r1 - r1c1\r\n\t\tr2c2 = d1 - r1c1\r\n\t\tif r2c1<=0 or r2c1>=10:\r\n\t\t\tcontinue\r\n\t\tif r1c2<=0 or r1c2>=10:\r\n\t\t\tcontinue\r\n\t\tif r2c2<=0 or r2c2>=10:\r\n\t\t\tcontinue\t\t\r\n\t\tif r2c1+r2c2 == r2 and d2==r1c2+r2c1 and c2==r2c2+r1c2:\r\n \t\t\tif len(set([r1c1,r2c2,r1c2,r2c1]))==4:\r\n \t\t\t\tprint(r1c1,r1c2)\r\n \t\t\t\tprint(r2c1,r2c2)\r\n \t\t\t\treturn\r\n\tprint(\"-1\")\r\n\treturn\r\n\r\nmain()\r\n\r\n\r\n\r\n# t= int(input())\r\n# while t:\r\n# \tmain()\r\n# \tt-=1", "gems = []\r\nfor i in range(3):\r\n gems += map(int, input().split())\r\ntmp0 = gems[0]\r\ntmp1 = gems[1] - 1\r\n# k = 1\r\n# g = 1\r\n\r\n\r\ndef solve(square=None):\r\n global tmp1, tmp0\r\n for j in range(1, gems[0]):\r\n tmp1 = gems[1] - 1\r\n tmp0 -= 1\r\n for b in range(1, gems[1]):\r\n square = [j, tmp0, b, tmp1]\r\n if square[0] + square[3] == gems[4] and square[1] + square[2] == gems[5] \\\r\n and square[0] + square[2] == gems[2] and square[1] + square[3] == gems[3]:\r\n return square\r\n tmp1 -= 1\r\n return [-1]\r\n\r\n\r\na = solve()\r\ncount = []\r\n\r\n\r\ndef check():\r\n if a == [-1]:\r\n return -1\r\n\r\n elif a != [-1]:\r\n for i in range(4):\r\n if a[i] > 9:\r\n return -1\r\n if a[i] not in count:\r\n count.append(a[i])\r\n\r\n if len(count) < 4:\r\n return -1\r\n\r\n return a\r\n\r\n\r\nif check() == -1:\r\n print(-1)\r\nelse:\r\n print(a[0], a[1])\r\n print(a[2], a[3])", "arr = [list(map(int, input().split())) for _ in range(3)]\r\n\r\ndef check(a1, a2, a3, a4):\r\n return a1+a2==arr[0][0]\\\r\n and a3+a4==arr[0][1]\\\r\n and a1+a3==arr[1][0]\\\r\n and a2+a4==arr[1][1]\\\r\n and a1+a4==arr[2][0]\\\r\n and a2+a3==arr[2][1]\r\n\r\ndef solve():\r\n for a1 in range(1, 10):\r\n for a2 in range(1, 10):\r\n if a2 == a1: continue\r\n for a3 in range(1, 10):\r\n if a3 in [a1, a2]: continue\r\n for a4 in range(1, 10):\r\n if a4 in [a1, a2, a3]: continue\r\n if check(a1, a2, a3, a4):\r\n return [a1, a2, a3, a4]\r\n return []\r\n\r\n\r\n\r\nans = solve()\r\nif len(ans):\r\n print(ans[0], ans[1])\r\n print(ans[2], ans[3])\r\nelse:\r\n print(-1)", "r1, r2 = map(int, input().split())\r\nc1, c2 = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\n\r\nnum = [1,2,3,4,5,6,7,8,9]\r\n\r\nfor i in range(1,10):\r\n x1 = i\r\n x2 = c1 - x1\r\n y1 = r1 - x1\r\n y2 = r2 - x2\r\n\r\n if(x1 != x2 and x1 != y1 and x1 != y2 and x2 != y1 and x2 != y2 and y1 != y2) and (x1 in num and x2 in num and y1 in num and y2 in num) and (d1 == (x1+y2) and d2 == (y1+x2)):\r\n print(x1, y1)\r\n print(x2, y2)\r\n quit()\r\nprint(-1)\r\n", "def readln(): return tuple(map(int, input().split()))\n\nr = readln()\nc = readln()\nd = readln()\nans = [-1, -1, -1, -1]\nfor i in range(1, 10):\n for j in range(1, 10):\n for k in range(1, 10):\n for m in range(1, 10):\n if len(set([i, j, k, m])) == 4 and r == (i + j, k + m) and c == (i + k, j + m) and d == (i + m, j + k):\n ans = [i, j, k, m]\nif ans[0] == -1:\n print(-1)\nelse:\n print(ans[0], ans[1])\n print(ans[2], ans[3])\n", "from itertools import product\r\nfrom math import ceil, gcd, sqrt\r\nimport string\r\nfrom decimal import Decimal\r\n\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [int(string[i: j]) for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\nr_1, r_2 = map(int, input().split())\r\nc_1, c_2 = map(int, input().split())\r\nd_1, d_2 = map(int, input().split())\r\n\r\nr1_possible = []\r\nr2_possible = []\r\nc1_possible = []\r\nc2_possible = []\r\nd1_possible = []\r\nd2_possible = []\r\na = []\r\nb = []\r\nbr = False\r\nfor i in range(1, 10):\r\n for j in range(1, 10):\r\n if i + j == r_1:\r\n r1_possible.append([i, j])\r\n if i + j == r_2:\r\n r2_possible.append([i, j])\r\n if i + j == c_1:\r\n c1_possible.append([i, j])\r\n if i + j == c_2:\r\n c2_possible.append([i, j])\r\n if i + j == d_1:\r\n d1_possible.append([i, j])\r\n if i + j == d_2:\r\n d2_possible.append([i, j])\r\n#print(r1_possible)\r\n#print(r2_possible)\r\n#print(c1_possible)\r\n#print(c2_possible)\r\n#print(d1_possible)3 7\r\n\r\n#print(d2_possible)\r\n#print()\r\nfor r1 in r1_possible:\r\n for r2 in r2_possible:\r\n c1 = [r1[0], r2[0]]\r\n c2 = [r1[1], r2[1]]\r\n d1 = [r1[0], r2[1]]\r\n d2 = [r1[1], r2[0]]\r\n #print(r1, r2, c1, c2, d1, d2, c1 in c1_possible, c2 in c2_possible, d1 in d1_possible, d2 in d2_possible)\r\n val = r1 + r2\r\n counter = [val.count(x) for x in val]\r\n if max(counter) > 1:\r\n continue\r\n if c1 in c1_possible and c2 in c2_possible and d1 in d1_possible and d2 in d2_possible:\r\n a = r1\r\n b = r2\r\n br = True\r\n break\r\n if br:\r\n break\r\nif br:\r\n print(*a)\r\n print(*b)\r\nelse:\r\n print(-1)", "def main():\n from itertools import permutations\n r1, r2, c1, c2, d1, d2 = (int(s) for _ in (1, 2, 3) for s in input().split())\n for a, b, c, d in permutations(range(1, 10), 4):\n if a + b == r1 and c + d == r2 and a + c == c1 and b + d == c2 and a + d == d1 and b + c == d2:\n print(a, b)\n print(c, d)\n break\n else:\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "# =========== IMPORTS ============#\r\n\r\n\r\n# =========== GLOBAL =============#\r\n\r\n\r\n# =========== FUNCTIONS ========= #\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n state = None # 'N' at the North kingdom - 'S' at the south kingdom\r\n pos = [0, 0]\r\n coins = 0\r\n\r\n for move in s:\r\n if move == 'U':\r\n pos[1] += 1\r\n else:\r\n pos[0] += 1\r\n\r\n cur_state = None\r\n if pos[0] > pos[1]:\r\n cur_state = 'S'\r\n elif pos[1] > pos[0]:\r\n cur_state = 'N'\r\n\r\n if state and cur_state:\r\n if state != cur_state:\r\n coins += 1\r\n\r\n if cur_state:\r\n state = cur_state\r\n\r\n print(coins)\r\n ", "# Fafa and the Gates\r\nn=int(input())\r\ns=input()\r\nx,y=0,0\r\nans=0\r\nfor i in range(n):\r\n\r\n if s[i]==\"U\":\r\n y+=1\r\n if s[i]==\"R\":\r\n x+=1\r\n if x==y:\r\n if i!=n-1 and s[i]==s[i+1]:\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nu,r,c=0,0,0\r\nfor i in range(len(s)-1):\r\n if s[i]==\"U\":\r\n u+=1\r\n else:\r\n r+=1\r\n if u==r and s[i]==s[i+1]:\r\n c+=1\r\nprint(c)\r\n", "def find_cost(moves):\n cost = 0\n curr_loc = [1, 0] if moves[0] == 'U' else [0, 1]\n curr_side = 1 if (curr_loc[0]-curr_loc[1]) > 0 else 0\n for move in moves[1:]:\n if(move == 'U'):\n new_loc = [curr_loc[0] + 1, curr_loc[1]]\n else:\n new_loc = [curr_loc[0], curr_loc[1] + 1]\n\n if(new_loc[0] - new_loc[1] > 0):\n new_side = 1\n elif (new_loc[0] - new_loc[1] < 0):\n new_side = 0\n else:\n new_side = curr_side\n if(new_side != curr_side):\n cost += 1\n curr_side = new_side\n curr_loc = new_loc\n return cost\n\nn = int(input())\ns = input()\nprint(find_cost(s))\n ", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda u: int(u) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda u: int(u) - 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\n5 1 4 3 2\r\n'''\r\ndef solve():\r\n n = II()\r\n cur = ''\r\n u, r = 0, 0\r\n s = I().strip()\r\n\r\n ans = 0\r\n for c in s:\r\n if c == 'U':\r\n u += 1\r\n if c == 'R':\r\n r += 1\r\n\r\n if u > r:\r\n if cur == 'R':\r\n ans += 1\r\n cur = 'U'\r\n if r > u:\r\n if cur == 'U':\r\n ans += 1\r\n cur = 'R'\r\n print(ans)\r\n\r\nsolve()", "n = int(input())\r\ns = input()\r\nx = 0; y = 0\r\ntax = 0\r\nfor i in range(len(s) - 1):\r\n if s[i] == 'U':\r\n y += 1\r\n if s[i] == 'R':\r\n x += 1\r\n if x == y and s[i + 1] == s[i]:\r\n tax += 1\r\nprint(tax)\r\n\r\n", "n = int(input())\r\ns = input()\r\nq = [0,0]\r\ncnt = 0\r\nflag = 0\r\nss = \"\"\r\nfor i in s:\r\n if (q[0]==q[1])and (q[0], q[1]!=0) and (i==ss):\r\n cnt+=1\r\n if(i==\"U\"):\r\n q[0]+=1\r\n \r\n else:\r\n q[1]+=1\r\n ss = i\r\nprint(cnt)\r\n", "\r\nn = int(input())\r\nmoves = input()\r\n\r\n# while n>0:\r\nx=y=coin = 0\r\nfor i in range(n-1):\r\n if moves[i] == 'U':\r\n y+=1\r\n # print(\"Y:\",y)\r\n else:\r\n x+=1\r\n # print(\"X:\",x)\r\n if x==y and moves[i] == moves[i+1]:\r\n coin+=1\r\n # n-=1\r\nprint(coin)", "N = int(input())\r\nS = input()\r\ncoordinate = [0,0]\r\ncounter = 0\r\n\r\nfor i in range(N):\r\n #finds new coordinate\r\n if S[i] == \"U\":\r\n coordinate[0] += 1\r\n elif S[i] == \"R\":\r\n coordinate[1] += 1\r\n\r\n #rest of program\r\n if i == 0:\r\n if coordinate[0] == 0:\r\n region1 = False\r\n else:\r\n region1 = True\r\n continue\r\n\r\n if region1 == True and coordinate[1] > coordinate[0]:\r\n counter += 1\r\n region1 = False\r\n elif region1 == False and coordinate[0] > coordinate[1]:\r\n counter += 1\r\n region1 = True\r\nprint(counter)\r\n", "def solve():\r\n n=int(input());s=input();x,y=0,0;c=0;above=False\r\n for i in s:\r\n if i==\"R\":x+=1\r\n else:y+=1\r\n if x>y and above==True:c+=1;above=False;continue\r\n if y>x and above==False:c+=1;above=True;continue\r\n print(c-1) if s[0]==\"U\" else print(c)\r\nsolve()", "n = int(input())\r\nmoves = input()\r\nx = 0\r\ny = 0\r\nans = 0\r\nfor i in range(n-1):\r\n if moves[i] == 'R':\r\n x += 1\r\n else:\r\n y += 1\r\n\r\n if (x == y and moves[i] == moves[i+1]):\r\n ans += 1\r\nprint(ans)\r\n", "import math\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n string = input()\r\n\r\n sign_arr = [0]\r\n current_position = (0, 0)\r\n for element in string:\r\n new_position = (\r\n current_position[0] + (1 if element == \"R\" else 0),\r\n current_position[1] + (1 if element == \"U\" else 0),\r\n )\r\n new_position_sign = new_position[1] - new_position[0]\r\n if new_position_sign == 0:\r\n sign_arr.append(0)\r\n elif new_position_sign > 0:\r\n sign_arr.append(1)\r\n else:\r\n sign_arr.append(-1)\r\n\r\n current_position = new_position\r\n\r\n counter = 0\r\n for i in range(len(sign_arr) - 2):\r\n test_arr = sign_arr[i : i + 3]\r\n if test_arr in [[-1, 0, 1], [1, 0, -1]]:\r\n counter += 1\r\n\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nstring = list(input())\r\n\r\ncurSide = \"\"\r\nalignment = 0\r\nresult = 0\r\n\r\nfor char in string:\r\n if char == \"R\":\r\n alignment += 1\r\n if alignment == 1 and curSide == \"U\":\r\n result += 1\r\n curSide = \"R\"\r\n else:\r\n alignment -= 1\r\n if alignment == -1 and curSide == \"R\":\r\n result += 1\r\n curSide = \"U\"\r\n\r\n if curSide == \"\":\r\n curSide = char\r\n\r\nprint(result)", "t=int(input())\r\ns=input()\r\nd={'U':0,'R':0}\r\nans=0\r\nprev=''\r\nfor each in s:\r\n if each==prev and d['U']==d['R']:\r\n ans+=1\r\n prev=each\r\n d[each]+=1\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nx, y = 0, 0\r\nans = 0\r\nfor i in range(n):\r\n if s[i] == 'U':\r\n y += 1\r\n else:\r\n x += 1\r\n if x == y and i != n-1:\r\n if s[i] == s[i+1]:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\ns=input()\r\n\r\n\r\ncount=0\r\n\r\ncpos=[0,0]\r\n\r\nppart=0\r\nif(s[0]=='U'):\r\n\tcpos[1]+=1;\r\n\tppart=1\r\nelse:\r\n\tcpos[0]+=1\r\n\tppart=0\r\n\r\nfor i in range(1,n):\r\n\tif(s[i]=='U'):\r\n\t\tcpos[1]+=1;\r\n\telse:\r\n\t\tcpos[0]+=1\r\n\r\n\tif(cpos[1]-cpos[0]>0):\r\n\t\tcpart=1\r\n\telif(cpos[1]-cpos[0]<0):\r\n\t\tcpart=0\r\n\telse:\r\n\t\tcpart=ppart\r\n\tif(cpart!=ppart):\r\n\t\tcount+=1;\r\n\t\tppart=cpart\r\n\r\n\r\n\r\nprint(count)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(S):\r\n answer = 0\r\n current = 0\r\n old_state = 0\r\n state = 0\r\n for c in S:\r\n if c=='U':\r\n current+=1\r\n else:\r\n current-=1\r\n \r\n if current > 0:\r\n state = 1\r\n elif current < 0:\r\n state = -1\r\n if old_state != 0 and state != old_state:\r\n answer+=1\r\n old_state = state\r\n return answer\r\n\r\nn = int(input())\r\nS = input().decode()[:-2]\r\nprint(process(S))", "def solve(n, moves):\r\n coins = r = u = 0\r\n\r\n i = 0\r\n while i < n - 1:\r\n if moves[i] == \"R\":\r\n r += 1\r\n else:\r\n u += 1\r\n\r\n if r == u and moves[i] == moves[i + 1]:\r\n coins += 1\r\n\r\n i += 1\r\n \r\n return coins\r\n\r\n\r\ndef main():\r\n print(\r\n solve(\r\n int(input()),\r\n input(),\r\n ),\r\n )\r\n\r\n\r\nmain()\r\n", "def solve(n: int, s: str) -> int:\r\n up,right=0,0\r\n last=\"\"\r\n count=0\r\n for i in s:\r\n if up==right and i==last:\r\n count+=1\r\n if i==\"U\":\r\n up+=1\r\n elif i==\"R\":\r\n right+=1\r\n last=i\r\n return (count)\r\n\r\n\r\nn=int(input())\r\ns=input()\r\nprint(solve(n, s))", "n = int(input())\nv = input()\npx = 0\npy = 0\non1 = v[0] == \"R\"\ns = 0\nfor i in v:\n if i == \"U\":\n if px == py and on1:\n on1 = False\n s += 1\n py += 1\n else:\n if px == py and not on1:\n on1 = True\n s += 1\n px += 1\nprint(s)\n", "n=int(input())\r\ns=[ss for ss in str(input())]\r\nx,y,c=0,0,0\r\nif s[0]=='R':x+=1\r\nelse:y+=1\r\nr=(1 if x>y else 2)\r\nfor i in range(1,n):\r\n if s[i]=='R':x+=1\r\n else:y+=1\r\n if x>y:nr=1\r\n elif x<y:nr=2\r\n else:nr=r\r\n if nr!=r:c+=1;r=nr\r\n \r\nprint(c)", "n=int(input())\r\ns=input()\r\ncount_=0;sign=0;coin=0\r\nif s[0]==\"U\":\r\n sign=1\r\n count_+=1\r\nelse:\r\n sign=-1\r\n count_-=1\r\nfor i in range(1,n):\r\n if count_==0:\r\n if sign==-1:\r\n if s[i]==\"U\":\r\n coin+=1\r\n sign=1\r\n count_+=1\r\n else:\r\n count_-=1\r\n else:\r\n if s[i]==\"R\":\r\n coin+=1\r\n sign=-1\r\n count_-=1\r\n else:\r\n count_+=1\r\n else:\r\n if s[i]==\"U\":\r\n count_+=1\r\n else:\r\n count_-=1\r\nprint(coin)\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\nx=[]\r\ny=[]\r\nx.extend([0]*(n+1))\r\ny.extend([0]*(n+1))\r\nfor i in range(1,n+1):\r\n if(s[i-1]=='U'):\r\n X=x[i-1]\r\n Y=y[i-1]\r\n #print(X,end=\" \")\r\n #print(Y,end=\" \")\r\n #print(i)\r\n x[i]=x[i-1]+0\r\n y[i]=y[i-1]+1\r\n elif(s[i-1]=='R'):\r\n X=x[i-1]\r\n Y=y[i-1]\r\n #print(X,end=\" \")\r\n #print(Y,end=\" \")\r\n #print(i)\r\n x[i]=x[i-1]+1\r\n y[i]=y[i-1]+0\r\n \r\n#print(x)\r\n#print(y)\r\nth=\"\"\r\nfor i in range(n+1):\r\n if(x[i]==y[i]):\r\n th+='n'\r\n elif(x[i]>y[i]):\r\n th+='d'\r\n else:\r\n th+='u'\r\n#print(th)\r\ncoins=0\r\nfor i in range(1,n):\r\n if(th[i]=='n'):\r\n if((th[i-1]=='u' and th[i+1]=='d') or (th[i-1]=='d' and th[i+1]=='u')):\r\n coins+=1\r\nprint(coins)", "length = int(input())\r\n\r\nmoves = list(input()) \r\n\r\nx , y , count = 0 , 0 , 0\r\n\r\nfor index in range(length - 1) :\r\n if moves[index] == \"U\" : y += 1\r\n else : x += 1\r\n if moves[index] == moves[index + 1] and x == y : count += 1 \r\nprint(count)", "import sys,math\r\nn=int(sys.stdin.readline())\r\ns=sys.stdin.readline().strip()\r\nans=0\r\nmove=0\r\narr=[0]*n\r\niter=0\r\nfor i in s:\r\n if i==\"U\":\r\n move-=1\r\n arr[iter]=move\r\n if iter>=2 and arr[iter-1]==0 and arr[iter-2]>0:\r\n ans+=1 \r\n else:\r\n move+=1\r\n arr[iter]=move\r\n if iter>=2 and arr[iter-1]==0 and arr[iter-2]<0:\r\n ans+=1\r\n iter+=1\r\nprint(ans)\r\n", "n = int(input())\n\ns = input()\n\npos = [0, 0]\n\nres = 0\nif s[0] == 'U': \n under = 1\nelse: \n under = 0\nfor c in s:\n if pos[0] == pos[1]: \n if under == 0 and c == 'U': \n under = 1\n res += 1\n elif under == 1 and c == 'R': \n under = 0\n res += 1\n if c == 'U': \n pos[1] += 1\n else: \n pos[0] += 1\nprint(res)\n", "n = int(input())\r\ns = input()\r\nx, y = 0, 0\r\nfee = 0\r\nif s[0]=='U':flag = 1\r\nelse: flag = 2\r\nfor i in range(n):\r\n if s[i]=='U':y += 1\r\n else: x += 1\r\n if y>x and flag==2:\r\n flag = 1\r\n fee += 1\r\n if x>y and flag==1:\r\n flag = 2\r\n fee += 1\r\nprint(fee)", "n = int(input())\r\nstring = input()\r\nUco = 0\r\nRco = 0\r\ncoins = 0\r\nif string[0] == 'U':\r\n Uco = 1 \r\nelse:\r\n Rco = 1\r\nfor index in range(1, len(string) - 1):\r\n if string[index] == 'U':\r\n Uco += 1 \r\n else:\r\n Rco += 1 \r\n if Uco == Rco:\r\n if string[index] == string[index + 1]:\r\n coins += 1\r\nprint(coins)", "n=int(input())\r\nstring=input()\r\nup,right=0,0\r\n\r\nlast=\"\"\r\ncount=0\r\nfor i in string:\r\n if up==right and i==last:\r\n count+=1\r\n if i==\"U\":\r\n up+=1\r\n elif i==\"R\":\r\n right+=1\r\n last=i\r\nprint(count)\r\n", "\ndef same(t,x):\n if t[0] == x:\n return 'U'\n else:\n return 'R'\n\n\ncont = 0\nimport sys\nn=sys.stdin.readline()\ns=sys.stdin.readline()\nx = 0\ny = 0\nt=[0,0]\n\nfor j in range(int(n)-1):\n if s[j]!='U':\n x+=1\n else:\n y+=1\n if x==y:\n if same(t,x)==s[j+1]:\n cont+=1\n t =[x,y]\nsys.stdout.write((str(cont)))\n\n\n\n", "n=int(input())\r\ns=input()\r\npos1,pos2=0,0\r\nres,checkU,checkF=0,0,0\r\nif s[0]=='U':\r\n checkF=1\r\n pos1=0\r\n pos2=1\r\nelse:\r\n checkU=1\r\n pos1=1\r\n pos2=0\r\nfor i in range(1,n):\r\n if s[i]=='U':\r\n pos2+=1\r\n else:\r\n pos1+=1\r\n if checkF==1:\r\n if pos2<pos1:\r\n res+=1\r\n checkF=0\r\n checkU=1\r\n else:\r\n if pos1<pos2:\r\n res+=1\r\n checkF=1\r\n checkU=0\r\nprint(res)", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\ndef above(p):\r\n return p[1] > p[0]\r\ndef under(p):\r\n return p[0] > p[1]\r\ndef on(x, y):\r\n return x == y\r\n\r\ndef test_case(casen):\r\n n = int(input())\r\n s = input()\r\n x, y = 0, 0\r\n path = [(x, y)]\r\n for c in s:\r\n if c == 'R':\r\n x += 1\r\n else:\r\n y += 1\r\n path.append((x, y))\r\n\r\n ans = 0\r\n# print(path)\r\n for i in range(1, len(path)-1):\r\n if (under(path[i-1]) and above(path[i+1])) or (above(path[i-1]) and under(path[i+1])):\r\n ans += 1\r\n return ans\r\n\r\ndef main():\r\n print(test_case(0))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = input().rstrip()\r\n\r\nx = 0\r\ny = 0\r\n\r\npx = 0\r\npy = 0\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n\r\n if data[i] == 'U':\r\n y += 1\r\n elif data[i] == 'R':\r\n x += 1\r\n\r\n if (px > py and x < y) or (px < py and x > y):\r\n cnt += 1\r\n\r\n if x != y:\r\n px = x\r\n py = y\r\n\r\nprint(cnt)", "n = int(input())\r\ns = input()\r\nx, y = 0,0\r\nans = 0\r\nu = 0\r\nr = 0\r\nfor i in range(len(s)-1):\r\n if s[i]==\"U\":\r\n u+=1\r\n else:\r\n r+=1\r\n if s[i]==s[i+1] and u==r: \r\n ans+=1\r\n \r\n\r\nprint(ans)", "i = int(input())\nd = list(input())\n\nx, y = 0, 0\n\nprev = \"\"\nc = 0\n\nfor char in d:\n if prev==char and x==y:\n c+=1\n \n if char==\"R\":\n x+=1\n else:\n y+=1\n\n prev = char\n\nprint(c)", "n = int(input())\r\nstrk = input()\r\ndomn_U = False\r\ndomn_R = False\r\nfafa = [0, 0]\r\ncoin = 0\r\n\r\nif strk[0] == 'U':\r\n domn_U = True\r\nelse:\r\n domn_R = True\r\n \r\nfor j in strk:\r\n if j == 'U':\r\n fafa[1] += 1\r\n else:\r\n fafa[0] += 1\r\n \r\n if fafa[0] != fafa[1] and sum(fafa) > 2:\r\n if domn_U and fafa[0] > fafa[1]:\r\n coin += 1\r\n domn_R = True\r\n domn_U = False\r\n continue\r\n if domn_R and fafa[0] < fafa[1]:\r\n coin += 1\r\n domn_R = False\r\n domn_U = True\r\n \r\nprint (coin)", "a=int(input())\r\nb=input()\r\nx=0\r\ny=0\r\ns=0\r\nif b[0]=='U':\r\n y=y+1\r\nif b[0]=='R':\r\n x=x+1\r\nfor i in range(1,a-1):\r\n if b[i]=='U':\r\n y=y+1\r\n if b[i]=='R':\r\n x=x+1\r\n if x==y:\r\n if b[i]=='U':\r\n if b[i+1]=='U':\r\n s=s+1\r\n if b[i]=='R':\r\n if b[i+1]=='R':\r\n s=s+1\r\nprint(s)", "n = int(input())\ns = input()\nx = 0\ny = 0\ncount = 0\na = False\nfor k, i in enumerate(s):\n if i == 'U':\n y += 1\n if i == 'R':\n x += 1\n if x == y:\n if k == len(s) - 1:\n pass\n else:\n if s[k + 1] == i:\n count += 1\nprint(count)\n", "def solve():\r\n size = int(input())\r\n s = input()\r\n result = 0\r\n t = 0\r\n \r\n for i in range(size - 1):\r\n if s[i] == 'U':\r\n t += 1\r\n else:\r\n t -= 1\r\n \r\n if not (t) and s[i] == s[i + 1]:\r\n result += 1\r\n \r\n print(result)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "def compute_quads(nx, ny):\r\n return 1 if x > y else 2 if y > x else 0\r\n\r\n\r\nn = int(input())\r\nmoves = list(input())\r\nx = 1 if moves[0] == 'R' else 0\r\ny = 1 if moves[0] == 'U' else 0\r\nquad, coins = compute_quads(x, y), 0\r\nfor i in range(1, n):\r\n x = x + 1 if moves[i] == 'R' else x\r\n y = y + 1 if moves[i] == 'U' else y\r\n if x != y:\r\n nq = compute_quads(x, y)\r\n if nq != quad:\r\n coins += 1\r\n quad = nq\r\nprint(coins)\r\n", "input()\r\ns=input()\r\na=p=0\r\nx=[0,0]\r\nfor c in s:\r\n a+=x[0]==x[1]and c==p;x[c<'U']+=1;p=c\r\nprint(a)", "N = int(input())\r\n\r\nstring = input()\r\n\r\nif N == 1:\r\n print(0)\r\n\r\nelse:\r\n count_r = 0\r\n count_u = 0\r\n Flag_R = False\r\n coins = 0\r\n\r\n if string[0] == \"R\":\r\n count_r = 1\r\n Flag_R = True\r\n else:\r\n count_u = 1\r\n\r\n for i in range(1,N):\r\n if string[i] == \"U\":\r\n count_u += 1\r\n else:\r\n count_r += 1\r\n\r\n if count_r > count_u and not(Flag_R):\r\n coins += 1\r\n Flag_R = True\r\n\r\n elif count_u > count_r and Flag_R:\r\n coins += 1\r\n Flag_R = False\r\n \r\n print(coins)", "x, y = 0, 0\r\ncounter = 0\r\nn = int(input())\r\naction = input()\r\nfor i in range(n):\r\n if i == 0:\r\n if action[i] == 'U':\r\n kingdom = 1\r\n else:\r\n kingdom = 0\r\n else:\r\n if x == y:\r\n if kingdom == 0 and action[i] == 'U':\r\n counter += 1\r\n elif kingdom == 1 and action[i] == 'R':\r\n counter += 1\r\n if x == y:\r\n if action[i] == 'U':\r\n kingdom = 1\r\n else:\r\n kingdom = 0\r\n if action[i] == 'U':\r\n y += 1\r\n else:\r\n x += 1\r\nprint(counter)", "def haha(n,s):\r\n t=0\r\n c=0\r\n prev = t\r\n prevprev = prev\r\n for i in range(n):\r\n if(s[i]=='U'):\r\n t+=1\r\n if(s[i]=='R'):\r\n t-=1\r\n if((t==-1 and prevprev == 1) or (t==1 and prevprev == -1)):\r\n c+=1\r\n prevprev = prev\r\n prev = t\r\n return c\r\n\r\n\r\n\r\nn=int(input())\r\ns=input()\r\nx=haha(n,s)\r\nprint(x)", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter, deque\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef region(x, y):\r\n if y > x:\r\n return 'a'\r\n return 'b'\r\ndef is_gate(x, y): \r\n return True if x==y else False\r\n\r\ndef main():\r\n n = I()\r\n s = S()\r\n if n == 1:\r\n return 0\r\n c = 0 \r\n coord = [1, 0] if s[0] == 'R' else [0, 1]\r\n cur = prev = region(*coord)\r\n for i in range(1, n):\r\n move = s[i]\r\n if move == 'U':\r\n coord[1] += 1\r\n else:\r\n coord[0] += 1\r\n if not is_gate(*coord):\r\n cur = region(*coord)\r\n if cur != prev:\r\n c+=1\r\n prev = cur \r\n return c\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n, s, x, y, passes, upKdm = input(), input(), 0, 0, 0, 2\r\n\r\nfor i in s:\r\n if i=='U': y+=1\r\n else: x+=1\r\n if upKdm == 2:\r\n upKdm = 1 if x>y else 0 if x<y else 2\r\n if upKdm and x>y:\r\n upKdm = 0\r\n passes += 1\r\n elif not upKdm and x<y:\r\n upKdm = 1\r\n passes += 1\r\nprint(passes-1)", "num_moves = int(input().strip())\nsequence = input().strip()\n\ntimes_to_pay = 0\npos = [0,0]\nregion = \"\"\n\nif sequence[0] == \"R\":\n pos[0] += 1\n region = \"0\"\nelse:\n pos[1] += 1\n region = \"1\"\n\nfor i in range(1, len(sequence)):\n new_region = \"\"\n if sequence[i] == \"R\":\n pos[0] += 1\n else:\n pos[1] += 1\n\n if pos[0] < pos[1]:\n new_region = \"1\"\n elif pos[0] > pos[1]:\n new_region = \"0\"\n else:\n new_region = region\n\n if new_region != region:\n times_to_pay += 1\n\n region = new_region\n\nprint(times_to_pay)", "n = int(input())\r\ns = str(input())\r\n\r\nflag = None\r\nx = 0\r\ny = 0\r\nres = 0\r\n\r\nfor i in s:\r\n if i == \"U\":\r\n y += 1\r\n else:\r\n x += 1\r\n\r\n if flag == None: \r\n if y > x:\r\n flag = \"up\"\r\n else:\r\n flag = \"down\"\r\n\r\n if x > y and flag == \"up\":\r\n res += 1\r\n flag = \"down\"\r\n elif y > x and flag == \"down\":\r\n res += 1\r\n flag = \"up\"\r\n\r\nprint(res)", "n = int(input())\r\ns = input()\r\n\r\nr,u,c = 0,0,0\r\nfor i in range(n-1):\r\n\tif (s[i]=='R'):\r\n\t\tr=r+1\r\n\t\tif (r==u and s[i]==s[i+1]):\r\n\t\t\tc=c+1\r\n\telif (s[i]=='U'):\r\n\t\tu=u+1\r\n\t\tif (r==u and s[i]==s[i+1]):\r\n\t\t\tc=c+1\r\nprint(c)", "\n\ndef howsilvercoin(n, mv):\n sides = 0\n coord = [0,0]\n coins = 0\n\n for m in moves:\n if m == \"U\":\n coord[1] += 1\n else:\n coord[0] += 1\n\n if coord[0] > coord[1]:\n if sides == 1:\n coins += 1\n sides = -1\n elif coord[0] < coord[1]:\n if sides == -1:\n coins += 1\n sides = 1\n\n return coins\n\n\nnum_moves = int(input())\nmoves = input()\n\nprint(howsilvercoin(num_moves,moves))\n \t\t \t\t \t \t \t\t\t\t \t\t \t \t \t\t\t", "n = int(input())\r\n\r\ns = input()\r\n\r\nres = 0\r\nk = True\r\nx = y = 0\r\nfor i in range(n):\r\n\tif x == y and x != 0:\r\n\t\tif k and s[i] == 'R':\r\n\t\t\tres += 1\r\n\t\t\t# print(\"coordinate\", x, y)\r\n\t\telif k == False and s[i] == 'U':\r\n\t\t\tres += 1\r\n\t\t\t# print(\"coordinate\", x, y)\r\n\tif s[i] == 'R':\r\n\t\tx += 1\r\n\telse:\r\n\t\ty += 1\r\n\tif y != x:\r\n\t\tk = (y > x)\r\n\t# print(\"coordinate\", x, y)\r\n\r\nprint(res)\r\n", "n = int(input())\r\ns = input()\r\ncur = [0,0]\r\nprev = [0,0]\r\ncoins = 0\r\nif n==1:\r\n print(0)\r\nelse:\r\n for i in range(0,n-1):\r\n prev = [cur[0],cur[1]]\r\n if s[i]=='R':\r\n cur=[cur[0]+1,cur[1]]\r\n elif s[i]=='U':\r\n cur=[cur[0],cur[1]+1]\r\n #print(i,cur[0]==cur[1],prev[0]==cur[0]-1,s[i+1]=='R') \r\n if cur[0]==cur[1] and prev[0]==cur[0]-1 and s[i+1]=='R':\r\n coins+=1\r\n elif cur[0]==cur[1] and prev[1]==cur[1]-1 and s[i+1]=='U':\r\n coins+=1\r\n print(coins)", "n=int(input())\r\ns=input()\r\nr=0\r\nu=0\r\nc=0\r\nfor i in range(0,n-1):\r\n if(s[i]=='R'):\r\n r+=1\r\n else:\r\n u+=1\r\n if(s[i]==s[i+1]):\r\n if(r==u):\r\n c+=1\r\nprint(c)\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n", "n = int(input())\r\n\r\narr = input()\r\n\r\ncoord = [0,0]\r\nans= 0\r\nif arr[0] == \"U\":\r\n kingdom = 2\r\nelse:\r\n kingdom = 1 \r\n \r\nfor i in range(n-1):\r\n if arr[i] == \"U\":\r\n coord[1]+= 1 \r\n else:\r\n coord[0]+= 1\r\n \r\n if coord[0] == coord[1]:\r\n if kingdom == 2 and arr[i+1] == \"R\":\r\n ans+=1 \r\n kingdom = 1\r\n elif kingdom == 1 and arr[i+1] == \"U\":\r\n ans+=1\r\n kingdom = 2\r\n else:\r\n continue\r\nprint (ans)", "n = int(input())\r\ns = str(input())\r\nx = 0\r\ny = 0\r\ncoins = 0\r\nfor i in range(n-1):\r\n if s[i]=='U':\r\n y+=1\r\n else:\r\n x+=1\r\n if x==y and s[i]==s[i+1]:\r\n coins+=1\r\nprint(coins)\r\n ", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\ns = list(input().rstrip())\r\nx = [0]\r\nfor i in s:\r\n x.append(x[-1] + 1 if i & 1 else x[-1] - 1)\r\nans = 0\r\nfor i in range(1, n):\r\n if x[i - 1] < x[i] == 0 < x[i + 1]:\r\n ans += 1\r\n elif x[i - 1] > x[i] == 0 > x[i + 1]:\r\n ans += 1\r\nprint(ans)", "n = int (input ()); s = input ()\r\nx, y = 0, 0; cost = 0; last = -1\r\nfor ch in s :\r\n if ch == 'R' : x += 1\r\n else : y += 1\r\n if x != y :\r\n if last == -1 : last = x > y\r\n elif last != (x > y) : last = x > y; cost += 1\r\nprint (cost)\r\n", "import math\r\nimport sys\r\nfrom collections import deque,OrderedDict,defaultdict\r\nimport heapq\r\nfrom collections import Counter\r\ndef inp(): return sys.stdin.readline().rstrip()\r\ndef mpp(): return map(int,inp().split())\r\ndef lis(): return list(mpp())\r\ndef yn(n):\r\n if n:\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\ndef fn(s,n): \r\n u=0\r\n r=0\r\n ans=0\r\n for i in range(n):\r\n if u==r and i!=0:\r\n if s[i]==s[i-1]:ans+=1\r\n if s[i]==\"U\":\r\n u+=1\r\n elif s[i]==\"R\":\r\n r+=1\r\n return ans\r\n\r\n\r\n\r\ndef main():\r\n n=int(inp())\r\n s=inp()\r\n print(fn(s,n))\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\nif __name__==\"__main__\":\r\n main()", "def check(i,j):\r\n if i==j: return -1\r\n elif i-j>0: return 1\r\n return 0\r\n\r\ndef solve(n,s):\r\n i=j=0\r\n prev = -1\r\n ans = 0\r\n \r\n for move in s:\r\n if move==\"U\":\r\n j += 1\r\n else: i += 1\r\n \r\n curr = check(i,j)\r\n if curr==-1: continue\r\n \r\n if prev==-1:\r\n prev = curr\r\n continue\r\n \r\n if prev!=curr:\r\n prev = curr\r\n ans += 1\r\n \r\n return ans\r\n \r\nif __name__==\"__main__\":\r\n n = int(input())\r\n s = input()\r\n \r\n ans = solve(n,s)\r\n print(ans)", "input();x=y=p=0\r\nfor i in input():\r\n\tif x==y!=0 and k==i:p+=1\r\n\tif i=='U':x+=1\r\n\telse:y+=1\r\n\tk=i\r\nprint(p)", "n=int(input())\r\ns=input()\r\nprev=[0,0]\r\nnext=[]\r\ncurr=[0,0]\r\nc=0\r\nfor i in range(n):\r\n if s[i]==\"R\":\r\n next=[curr[0]+1,curr[1]]\r\n else:\r\n next=[curr[0],curr[1]+1]\r\n it1=(prev[0])-(prev[1])\r\n it2=(next[0])-(next[1])\r\n if(((it1>0) and (it2<0)) or ((it1<0) and (it2>0))):\r\n c+=1\r\n prev=curr\r\n curr=next\r\nprint(c)", "n = int(input())\r\nway = input()\r\nx, y = 0, 0\r\nans = 0\r\nking = 0 if way[0] == \"U\" else 1\r\nfor i in range(n):\r\n if way[i] == \"U\":\r\n y += 1\r\n else:\r\n x += 1\r\n if x > y and not king:\r\n ans += 1\r\n king = 1\r\n if x < y and king:\r\n ans += 1\r\n king = 0\r\nprint(ans)\r\n", "n = int(input())\r\ns = str(input())\r\nx,y = 0,0\r\nans = 0\r\nprev_king = 0\r\npresent_king = 0\r\nfor i in range(n):\r\n if s[i]==\"U\":\r\n y+=1\r\n else:\r\n x+=1\r\n if x>y:\r\n prev_king = present_king\r\n present_king = 1\r\n elif x<y:\r\n prev_king = present_king\r\n present_king = -1\r\n else:\r\n prev_king = present_king\r\n if present_king*prev_king==-1:\r\n ans+=1\r\nprint(ans)\r\n", "moves_num = int(input())\r\nsequence=input()\r\nlast_move=''\r\nflag=0\r\nx,y=(0,0)\r\ncoins=0\r\nfor move in sequence:\r\n if flag==1 and x!=y:\r\n flag=0\r\n \r\n if move==\"U\":\r\n y+=1\r\n else:\r\n x+=1\r\n \r\n if move == last_move and flag == 1:\r\n coins+=1\r\n flag=0\r\n \r\n if x==y:\r\n last_move=move\r\n flag=1\r\n \r\n \r\nprint(coins) " ]

[ "import sys\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque\r\nfrom fractions import Fraction as f\r\nfrom copy import *\r\nfrom bisect import *\t\r\nfrom heapq import *\r\n#from math import *\r\nfrom itertools import permutations \r\n \r\ndef eprint(*args):\r\n print(*args, file=sys.stderr)\r\nzz=1\r\n \r\n#sys.setrecursionlimit(10**6)\r\nif zz:\r\n\tinput=sys.stdin.readline\r\nelse:\t\r\n\tsys.stdin=open('input.txt', 'r')\r\n\tsys.stdout=open('all.txt','w')\r\ndef li():\r\n\treturn [int(x) for x in input().split()]\r\ndef fi():\r\n\treturn int(input())\r\ndef si():\r\n\treturn list(input().rstrip())\t\r\ndef mi():\r\n\treturn \tmap(int,input().split())\t\r\ndef gh():\r\n\tsys.stdout.flush()\r\ndef graph(n,m):\r\n\tfor i in range(m):\r\n\t\tx,y=mi()\r\n\t\ta[x].append(y)\r\n\t\ta[y].append(x)\r\ndef bo(i):\r\n\treturn ord(i)-ord('a')\r\n\r\n\r\n\r\n\r\ndef can(mid):\r\n\td=[0,0]\r\n\tmini=n\r\n\tfor i in range(n):\r\n\t\tif i>=mid:\r\n\t\t\tmini=min(d[0],min(d[1],mini))\r\n\t\t\td[bo(a[i-mid])]-=1\r\n\t\td[bo(a[i])]+=1\r\n\t\t\r\n\tmini=min(d[0],min(d[1],mini))\t\r\n\treturn mini<=k\t\t\r\nn,k=mi()\r\na=si()\r\nl=0\r\nr=ans=n\r\nwhile l<=r:\r\n\tmid=(l+r)//2\r\n\tif can(mid):\r\n\t\tans=mid\r\n\t\tl=mid+1\r\n\telse:\r\n\t\tr=mid-1\r\nprint(ans)\t\t\t\r\n", "def max_beauty(n, k, s):\n max_beauty = 0\n window_start = 0\n a_count = 0\n b_count = 0\n\n for window_end in range(n):\n if s[window_end] == 'a':\n a_count += 1\n else:\n b_count += 1\n \n # Calculate the length of the current window\n window_length = window_end - window_start + 1\n \n # Calculate the number of characters to change to match the current window type\n to_change = min(a_count, b_count)\n \n # If we can change more characters than allowed, move the window's start\n while to_change > k:\n if s[window_start] == 'a':\n a_count -= 1\n else:\n b_count -= 1\n window_start += 1\n window_length -= 1\n to_change = min(a_count, b_count)\n \n # Update the maximum beauty\n max_beauty = max(max_beauty, window_length)\n \n return max_beauty\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the maximum beauty\nresult = max_beauty(n, k, s)\nprint(result)\n \t \t \t \t \t \t \t\t\t\t \t", "n,k=map(int,input().split())\r\ns=input()\r\ni,j=0,0 \r\nrm=k\r\nans=0\r\nwhile i<n and j<n:\r\n while j<n and (rm>0 or s[j]=='a'):\r\n if s[j]=='b': rm-=1\r\n j+=1\r\n ans=max(ans,j-i)\r\n if j==n: break\r\n while s[i]=='a':\r\n i+=1\r\n i+=1\r\n rm+=1\r\ni,j=0,0 \r\nrm=k\r\nwhile i<n and j<n:\r\n while j<n and (rm>0 or s[j]=='b'):\r\n if s[j]=='a': rm-=1\r\n j+=1\r\n ans=max(ans,j-i)\r\n if j==n: break\r\n while s[i]=='b':\r\n i+=1\r\n i+=1\r\n rm+=1\r\nprint(ans)\r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n", "def max_beauty(n, k, s):\n max_len = 0\n for c in ['a', 'b']:\n start = 0\n changes = 0\n for end in range(n):\n if s[end] != c:\n changes += 1\n while changes > k:\n if s[start] != c:\n changes -= 1\n start += 1\n max_len = max(max_len, end - start + 1)\n return max_len\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the result\nresult = max_beauty(n, k, s)\nprint(result)\n\n\t \t \t\t \t\t \t \t\t\t\t \t\t\t", "n,k=map(int,input().split())\r\ns=list(input())\r\naa=[0]*(n+1)\r\nbb=[0]*(n+1)\r\nres=1\r\na,b=0,0\r\nfor i in range(1,n+1):\r\n if s[i-1]==\"a\":\r\n a+=1\r\n aa[a]=i\r\n else:\r\n b+=1\r\n bb[b]=i\r\n res=max(res,i-(aa[max(a-k,0)]))\r\n res=max(res,i-(bb[max(b-k,0)]))\r\nprint(res)", "n,k=map(int,input().split())\r\ns=input()\r\na=0\r\nb=0\r\nc=0\r\nm=0\r\nfor i in s:\r\n\tif i=='a':\r\n\t\ta+=1\r\n\telse:\r\n\t\tb+=1\r\n\tif min(a,b)>k:\r\n\t\tif s[c]=='a':\r\n\t\t\ta-=1\r\n\t\telse:\r\n\t\t\tb-=1\r\n\t\tc+=1\r\n\telse:\r\n\t m+=1\r\nprint(m)", "n,s=list(map(int,input().split()))\r\ngiven=input()\r\n\r\ndef find(char):\r\n left=0\r\n unique=0\r\n long=0\r\n for right in range(n):\r\n if given[right]!=char:\r\n unique+=1\r\n while unique>s:\r\n if given[left]!=char:\r\n unique-=1\r\n left+=1\r\n long=max(right-left+1,long)\r\n return long\r\n\r\nprint(max(find(\"a\"),find(\"b\")))", "from collections import defaultdict\r\nMOD = 10000007\r\n\r\ndef max_substring_length(n, k, s):\r\n mp = defaultdict(int)\r\n ans = 0\r\n x = 0\r\n\r\n for i in range(n):\r\n mp[s[i]] += 1\r\n\r\n if min(mp['a'], mp['b']) > k:\r\n mp[s[x]] -= 1\r\n x += 1\r\n\r\n ans = max(ans, mp['a'] + mp['b'])\r\n\r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n s = input()\r\n\r\n result = max_substring_length(n, k, s)\r\n print(result)\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef solve(char, k):\r\n left = 0\r\n ans = 0\r\n count = 0\r\n \r\n for right in range(len(s)):\r\n if s[right] == char:\r\n count += 1\r\n \r\n if count > k:\r\n while count > k:\r\n count -= int(s[left] == char)\r\n left += 1\r\n ans = max(ans, right - left + 1)\r\n return ans\r\n \r\n \r\nif __name__ == \"__main__\":\r\n n, k = get_ints()\r\n s = get_string()\r\n print(max(solve('a', k), solve('b', k)))", "n,k=map(int,input().split())\r\ns=input()\r\n\r\ndef attempt(c):\r\n\tj=0\r\n\tu=k\r\n\tbest=0\r\n\tfor i in range(n):\r\n\t\twhile j<n and u-(s[j]!=c)>=0:\r\n\t\t\tu-=s[j]!=c\r\n\t\t\tj+=1\r\n\t\tbest=max(best,j-i)\r\n\t\tu+=s[i]!=c\r\n\treturn best\r\n\r\nans=max(attempt('a'),attempt('b'))\r\nprint(ans)", "n, k = map(int, input().split())\r\nst = input().strip()\r\nsma = smb = maxSoFar = l = 0\r\nkk = k\r\nfor r in range(n):\r\n if st[r] == 'b':\r\n if kk:kk -= 1\r\n else:\r\n while st[l] != 'b':\r\n maxSoFar -= 1\r\n l += 1\r\n l += 1\r\n maxSoFar -= 1\r\n maxSoFar += 1\r\n sma = max(sma, maxSoFar)\r\nkk = k\r\nl = maxSoFar = 0\r\nfor r in range(n):\r\n if st[r] == 'a':\r\n if kk:kk -= 1\r\n else:\r\n while st[l] != 'a':\r\n maxSoFar -= 1\r\n l += 1\r\n l += 1\r\n maxSoFar -= 1\r\n maxSoFar += 1\r\n smb = max(smb, maxSoFar)\r\nprint(max(sma, smb))", "def max_beauty(n, k, s):\n max_length = 0\n for c in ['a', 'b']:\n length = 0\n left = 0\n changes = k\n \n for right in range(n):\n if s[right] != c:\n changes -= 1\n \n while changes < 0:\n if s[left] != c:\n changes += 1\n left += 1\n \n length = max(length, right - left + 1)\n \n max_length = max(max_length, length)\n \n return max_length\n\nn, k = map(int, input().split())\ns = input()\n\nresult = max_beauty(n, k, s)\nprint(result)\n\n \t \t\t \t\t\t \t\t \t\t \t \t \t \t \t", "n,k = list(map(int,input().split()))\r\nst = input()\r\nans = 1\r\nfor i in ['a','b']:\r\n l=0\r\n r=0\r\n if st[l]!=i:\r\n s=1\r\n else:\r\n s=0\r\n while l<n:\r\n if s<=k:\r\n r+=1\r\n if r==n:\r\n break\r\n if st[r]!=i:\r\n s+=1\r\n else:\r\n l+=1\r\n if st[l-1]!=i:\r\n s-=1\r\n if s<=k:\r\n ans=max(r-l+1,ans)\r\nprint(ans)", "def max_beauty(n, k, string):\n max_length = 0\n max_beauty = 0\n freq = [0, 0] # Count of 'a' and 'b' characters in the window\n\n left = 0\n for right in range(n):\n freq[ord(string[right]) - ord('a')] += 1\n while min(freq) > k:\n freq[ord(string[left]) - ord('a')] -= 1\n left += 1\n max_beauty = max(max_beauty, right - left + 1)\n\n return max_beauty\n\n# Read input\nn, k = map(int, input().split())\nstring = input()\n\n# Calculate and print the result\nresult = max_beauty(n, k, string)\nprint(result)\n\n\t \t \t\t\t \t \t\t\t\t \t\t\t \t \t\t", "def main():\r\n n, k = map(int, input().split())\r\n s = input()\r\n a, b = 0, 0\r\n L = 0\r\n ans = 0\r\n for r in range(len(s)):\r\n if s[r] == 'a':\r\n a += 1\r\n else:\r\n b += 1\r\n while min(a, b) > k:\r\n if s[L] == 'a':\r\n a -= 1\r\n else:\r\n b -= 1\r\n L += 1\r\n ans = max(ans, r - L + 1)\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "input1=list(map(int,input().split()))\r\nstring=input()\r\nn,k=input1[0],input1[1]\r\n\r\nl=0\r\nres=0\r\ncnts={\"a\":0,\"b\":0}\r\nfor r in range(n):\r\n cnts[string[r]]+=1\r\n while cnts[\"a\"]>k and cnts[\"b\"]>k:\r\n cnts[string[l]]-=1\r\n l+=1\r\n res=max(res,r-l+1)\r\n \r\n\r\n\r\nprint(res)", "n, k = map(int, input().split())\ns = input()\n\nmax_beauty = 0\ncounts = {'a': 0, 'b': 0}\nleft = 0\n\nfor right in range(n):\n counts[s[right]] += 1\n \n while min(counts['a'], counts['b']) > k:\n counts[s[left]] -= 1\n left += 1\n \n max_beauty = max(max_beauty, right - left + 1)\n\nprint(max_beauty)\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\ns = input()\r\n\r\nl = 0\r\nres = 0\r\ncount = {}\r\nfor r in range(n):\r\n count[s[r]] = count.get(s[r], 0) + 1\r\n if (r-l+1) - max(count.values()) > k:\r\n count[s[l]] -= 1\r\n l += 1\r\n res = max(res, r-l+1)\r\nprint(res)", "import sys\nread = sys.stdin.readline\n\ndef run_case():\n n, k = map(int, input().split())\n str = input()\n ar = list(map(lambda x : 0 if x == 'a' else 1, str))\n\n res = 0\n l = 0\n cnt = [0, 0]\n for c in ar:\n cnt[c] += 1\n if min(cnt) > k:\n cnt[ar[l]] -= 1\n l += 1\n else:\n res += 1\n\n print(res)\n\nif __name__ == '__main__':\n run_case()\n\n", "n, k = map(int, input().split()) \r\nstring = input()\r\nif(n == 1):\r\n print(1)\r\nelse:\r\n left, right, max_length = -1, 0, 0\r\n dp = [0, 0]\r\n while(right < len(string)):\r\n dp[ord(string[right]) - ord('a')] += 1\r\n while(min(dp) > k):\r\n left += 1\r\n dp[ord(string[left]) - ord('a')] -=1\r\n max_length = max(max_length, right - left)\r\n right += 1\r\n print(max(max_length, right - left - 1))\r\n", "n,k = map(int,input().split())\r\ns = input()\r\na,b,t=0,0,0\r\nfor i in range(n):\r\n if s[i] == 'a':\r\n a += 1\r\n else:\r\n b += 1\r\n if min(a,b) > k:\r\n if s[t] == 'a':\r\n a -= 1\r\n else:\r\n b -= 1\r\n t += 1\r\nprint(n - t) ", "def vasya(t):\n i,j,mx,c=0,0,0,0\n while i<n:\n if s[i]!=t:\n c+=1\n i+=1\n while c>k and j<=i:\n if s[j]!=t:\n c-=1\n j+=1\n while i<n and s[i]==t:\n i+=1\n mx=max(i-j,mx)\n return mx\n\nn,k=map(int,input().split())\ns=input()\nprint(max(vasya('a'),vasya('b')))\n\n \t \t\t \t\t\t\t \t \t\t \t\t \t\t\t\t \t \t", "n,k = map(int,input().split())\nst = input()\nd={'a':0,'b':0}\nl= 0\nx= 0\nfor i in st:\n\td[i]+=1\n\tif min(d.values())>k:\n\t\td[st[l]]-=1\n\t\tl+=1\n\telse:\n\t\tx+=1\nprint(x)\n\t \t\t \t \t \t\t\t \t\t \t\t \t\t\t\t \t", "def max1(n, k, s):\n beauty = 0\n left = 0 \n count = [0, 0] \n\n for right in range(n):\n count[ord(s[right]) - ord('a')] += 1\n \n changes_needed = right - left + 1 - max(count)\n \n if changes_needed <= k:\n \n beauty = max(beauty, right - left + 1)\n else:\n count[ord(s[left]) - ord('a')] -= 1\n left += 1\n \n return beauty\n\nn, k = map(int, input().split())\ns = input()\nprint(max1(n, k, s))\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\ns = str(input())\r\nl = []\r\nfor i in s:\r\n\tl.append(i == \"a\")\r\ni1, i2 = 0, 1\r\nans = 1\r\ncola = int(l[0])\r\ncolb = int(not l[0])\r\nwhile i2 <= n:\r\n\tif min(cola, colb) > k:\r\n\t\tcola -= int(l[i1])\r\n\t\tcolb -= int(not l[i1])\r\n\t\ti1 += 1\r\n\telse:\r\n\t\tans = max(ans, i2 - i1)\r\n\t\ti2 += 1\r\n\t\tif i2 <= n:\r\n\t\t\tcola += int(l[i2 - 1])\r\n\t\t\tcolb += int(not l[i2 - 1])\r\nprint(ans)", "from typing import List\n\ndef check(s: str, x: str, m: int) -> int:\n n = len(s)\n i = j = cnt = ans = 0\n for i in range(n):\n if s[i] == x:\n cnt += 1\n if cnt > m:\n while cnt > m:\n if s[j] == x:\n cnt -= 1\n j += 1\n ans = max(ans, i-j+1)\n return ans\n\nwhile True:\n try:\n n, m = map(int, input().split())\n s = input().strip()\n print(max(check(s, 'b', m), check(s, 'a', m)))\n except EOFError:\n break\n\n \t \t \t\t \t\t \t \t\t \t \t\t\t\t \t\t\t\t \t", "def main():\r\n n,k = map(int, fin().split())\r\n *s, = fin()\r\n cnt = {'a':0, 'b':0}\r\n res = 0\r\n l = 0; r = 0\r\n while r<n:\r\n cnt[s[r]]+=1\r\n r+=1\r\n while l<=r and (cnt['a']>k and cnt['b']>k):\r\n cnt[s[l]]-=1\r\n l+=1\r\n res = max(res, r-l)\r\n fout(res)\r\n\r\n# FastIO\r\nfrom sys import stdin, stdout\r\ndef fin(): return stdin.readline().strip(\"\\r\\n\")\r\ndef fout(s): return stdout.write(str(s)+\"\\n\")\r\nif __name__ == \"__main__\":\r\n t = 1 or int(fin())\r\n for i in range(t): main()", "\n\ndef solve(num, m, s, c):\n best = 0\n length = 0 \n changed = 0\n i, j = 0, 0\n while j < num:\n if s[j] != c:\n changed += 1\n while changed > m:\n if s[i] != c:\n changed -= 1\n i += 1\n j += 1\n best = max(best, j-i)\n return best\nif __name__=='__main__':\n num, m = list(map(int, input().split()))\n s = input()\n print(max(solve(num, m, s, 'a'), solve(num, m, s, 'b')))\n \t\t\t\t\t\t \t \t \t \t\t\t \t \t", "n,k=map(int, input().split())\nst = input()\nj,h,m , ans = 0,0,0,0\nfor i in range(n):\n if st[i] == 'a':\n j+=1\n else:\n h+=1\n if j<=k or h<=k:\n ans=max(ans, i+1-m)\n else:\n if st[m] == 'a':\n j-=1\n else:\n h-=1 \n m+=1\nprint(ans) \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())\nl=[]\ne=list(map(str,input()))\ndef fun(x):\n \n st=0\n st1=0\n mc=0\n \n mc1=0\n c=0\n bc=0\n for end in range(len(e)):\n if(e[end]==x):\n c=c+1\n \n while(c>k):\n if(e[st]==x):\n c=c-1\n st=st+1\n \n \n mc=max(mc,end-st+1)\n \n \n l.append(mc)\n(fun('a'))\n(fun('b'))\nprint(max(l))\n\t\t\t\t\t \t\t\t\t\t \t\t\t\t\t \t\t \t", "n,k=map(int,input().split())\r\ns=input()\r\nans=0\r\na=0\r\nb=0\r\nj=0\r\nfor i in range(n):\r\n if(s[i]=='a'):\r\n a+=1\r\n else:\r\n b+=1\r\n if min(a,b)>k:\r\n if(s[j]=='a'):\r\n a-=1\r\n else:\r\n b-=1\r\n j+=1\r\n else:\r\n ans+=1\r\n\r\nprint(ans)", "n,k=input().split(\" \")\r\ns=input()\r\nn=int(n)\r\nk=int(k)\r\ndef find(x):\r\n j=c=ans=0\r\n for i in range(n):\r\n if s[i]==x:\r\n c+=1\r\n while c>k:\r\n if s[j]==x:\r\n c-=1\r\n j+=1\r\n ans=max(ans,i-j+1)\r\n return ans\r\nprint(max(find(\"a\"),find(\"b\")))", "n, k = [int(i) for i in input().split()]\r\ns = input()\r\nab = [0, 0]\r\nl = 0\r\nbest = 0\r\nfor r in range(n):\r\n if s[r] == 'a':\r\n ab[0] += 1\r\n else:\r\n ab[1] += 1\r\n \r\n while min(ab) > k:\r\n if s[l] == 'a':\r\n ab[0] -= 1\r\n else:\r\n ab[1] -= 1\r\n l += 1\r\n\r\n best = max(best, r - l + 1)\r\n\r\nprint(best)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k = map(int, input().split())\r\ns = list(input().rstrip())\r\ns = [i - 97 for i in s]\r\ncnt = [0] * 26\r\nl = 0\r\nans = 0\r\nfor r in range(n):\r\n cnt[s[r]] += 1\r\n while max(cnt) + k < r - l + 1:\r\n cnt[s[l]] -= 1\r\n l += 1\r\n ans = max(ans, r - l + 1)\r\nprint(ans)", "n, k = map(int, input().split())\r\ns = str(input())\r\n\r\ni, j = 0, 0\r\nmax_beauty = 1\r\ncost_a, cost_b = 0, 0 \r\nwhile j < n:\r\n if s[j] == 'a':\r\n cost_a += 1\r\n elif s[j] == 'b':\r\n cost_b += 1\r\n\r\n min_cost = min(cost_a, cost_b)\r\n if min_cost <= k:\r\n max_beauty = max(max_beauty, j-i+1)\r\n else:\r\n if s[i] == 'a':\r\n cost_a -= 1\r\n elif s[i] == 'b':\r\n cost_b -= 1\r\n i += 1\r\n j += 1\r\n\r\nprint(max_beauty)", "n,k = map(int,input().split())\r\ns = input() \r\n\r\nmx = 0\r\n\r\n# Case : 'a' \r\ni,j,cn = 0,0,0\r\nwhile(j<n):\r\n if(s[j] == 'b'):\r\n cn += 1\r\n while(cn>k):\r\n if(s[i] == 'b'):\r\n cn -= 1\r\n i += 1\r\n mx = max(j-i+1,mx)\r\n j += 1\r\n\r\n# Case : 'b'\r\ni,j,cn = 0,0,0\r\nwhile(j<n):\r\n if(s[j] == 'a'):\r\n cn += 1\r\n while(cn>k):\r\n if(s[i] == 'a'):\r\n cn -= 1\r\n i += 1\r\n mx = max(j-i+1,mx)\r\n j += 1\r\n\r\nprint(mx)", "import sys\nn, k = sys.stdin.readline().split(' ')\nn = int(n)\nk = int(k)\ns = sys.stdin.readline()\ndef solveSub(s: str, target: str, k: int, n: int) -> int:\n remainingK = k\n result = 1\n start = 0\n for end in range(n):\n if s[end] != target:\n remainingK -= 1\n if remainingK < 0:\n while start < n and s[start] == target:\n start += 1\n start += 1\n remainingK += 1\n result = max(result, end - start + 1)\n return result\n\nprint(max(solveSub(s, 'a', k, n), solveSub(s, 'b', k, n)))\n \t \t \t \t \t\t \t\t \t \t \t", "def max_beauty_string(n, k, s):\n left = 0\n max_beauty = 0\n char_count = {'a': 0, 'b': 0}\n\n for right in range(n):\n char_count[s[right]] += 1\n max_char_count = max(char_count.values())\n changes_required = (right - left + 1) - max_char_count\n\n while changes_required > k:\n char_count[s[left]] -= 1\n left += 1\n max_char_count = max(char_count.values())\n changes_required = (right - left + 1) - max_char_count\n\n max_beauty = max(max_beauty, right - left + 1)\n return max_beauty\n\nn, k = map(int, input().split())\ns = input()\nresult = max_beauty_string(n, k, s)\nprint(result)\n\n\t \t\t\t\t \t\t \t\t \t\t\t\t\t\t\t", "def findLen(A, n, k, ch):\r\n\tmaxlen = 1\r\n\tcnt = 0\r\n\tl = 0\r\n\tr = 0\r\n\twhile r < n:\r\n\t\tif A[r] != ch:\r\n\t\t\tcnt += 1\r\n\t\twhile cnt > k:\r\n\t\t\tif A[l] != ch:\r\n\t\t\t\tcnt -= 1\r\n\t\t\tl += 1\r\n\t\tmaxlen = max(maxlen, r - l + 1)\r\n\t\tr += 1\r\n\treturn maxlen\r\ndef answer(A, n, k):\r\n\tmaxlen = 1\r\n\tfor i in range(26):\r\n\t\tmaxlen = max(maxlen, findLen(A, n, k,\r\n\t\t\t\t\t\t\tchr(i + ord('A'))))\r\n\t\tmaxlen = max(maxlen, findLen(A, n, k,\r\n\t\t\t\t\t\t\tchr(i + ord('a'))))\r\n\treturn maxlen\r\nif __name__ == \"__main__\":\r\n n,k=map(int,input().split())\r\n s=input()\r\n print(answer(s,n,k))\r\n", "n, k = map(int, input().split())\ns = input()\n \na,b = [0],[0]\nfor i,c in enumerate(s):\n if c=='a':\n a.append(a[-1]+1)\n else:\n a.append(a[-1])\n if c=='b':\n b.append(b[-1]+1)\n else:\n b.append(b[-1])\n \nl,r = 0, n+1\nwhile l+1<r:\n m = (l+r)//2\n \n find = False\n for i in range(m, n+1):\n ta = a[i]-a[i-m]\n tb = b[i]-b[i-m]\n \n if ta<=k or tb<=k:\n find = True\n break\n if find:\n l = m\n else:\n r = m\nprint(l)\n \t\t\t\t \t \t\t\t\t\t \t \t", "def max_beauty(n, k, s):\n left = 0\n max_length = 0\n max_count = 0\n letter_count = {'a': 0, 'b': 0}\n \n for right in range(n):\n letter_count[s[right]] += 1\n max_count = max(max_count, letter_count[s[right]])\n \n while (right - left + 1) - max_count > k:\n letter_count[s[left]] -= 1\n left += 1\n \n max_length = max(max_length, right - left + 1)\n \n return max_length\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the result\nresult = max_beauty(n, k, s)\nprint(result)\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\ns = input()\r\na = b = c = t = 0\r\n\r\nfor z in s:\r\n if z == 'a':\r\n a += 1\r\n else:\r\n b += 1\r\n if min(a, b) <= k:\r\n c = max(c, a + b)\r\n else:\r\n if s[t] == 'a':\r\n a -= 1\r\n else:\r\n b -= 1\r\n t+=1\r\nprint(c)", "def find_max_value(main_sequence, secundary_sequence, main_sequence_is_even, main_sequence_sum, secundary_sequence_sum, k):\n max_value = 0\n j = 0\n for i in range(len(main_sequence)):\n start_value = 0\n final_value = 0\n j = max(i, j)\n if main_sequence_is_even:\n if i != 0:\n start_value = secundary_sequence_sum[i - 1]\n if j != 0:\n final_value = secundary_sequence_sum[j - 1]\n else:\n start_value = secundary_sequence_sum[i]\n final_value = secundary_sequence_sum[j]\n\n value_already_considered = final_value - start_value\n value_to_change = k - value_already_considered\n\n initial_current_value = 0 if i == 0 else main_sequence_sum[i - 1]\n final_current_value = main_sequence_sum[j] if j < len(main_sequence) else main_sequence_sum[j - 1]\n\n current_value = (final_current_value - initial_current_value) + value_already_considered\n while value_to_change > 0 and j < len(main_sequence):\n value_breaker = 0\n if main_sequence_is_even:\n if j < len(secundary_sequence):\n value_breaker = secundary_sequence[j]\n else:\n break\n else:\n if j < len(secundary_sequence) - 1:\n value_breaker = secundary_sequence[j + 1]\n else:\n break\n if value_breaker > value_to_change:\n current_value += value_to_change\n value_to_change = 0\n else:\n value_to_change -= value_breaker\n current_value += value_breaker\n j += 1\n if j < len(main_sequence):\n current_value += main_sequence[j]\n if i == 0 and j == len(main_sequence) - 1 and not main_sequence_is_even:\n left_value = min(value_to_change, secundary_sequence[0])\n value_to_change -= left_value\n current_value += left_value\n if current_value > max_value:\n max_value = current_value\n return max_value\n\nif __name__ == \"__main__\":\n n, k = map(int, input().split())\n string = input()\n sequence = []\n\n current_letter = string[0]\n currrent_value = 0\n for letter in string:\n if letter == current_letter:\n currrent_value += 1\n else:\n sequence.append(currrent_value)\n current_letter = letter\n currrent_value = 1\n sequence.append(currrent_value)\n sequence_even = []\n sequence_odd = []\n sequence_sum_even = []\n sequence_sum_odd = []\n\n value_even = 0\n value_odd = 0\n for i in range(len(sequence)):\n v = sequence[i]\n if i % 2 == 0:\n sequence_even.append(v)\n value_even += v\n sequence_sum_even.append(value_even)\n else:\n sequence_odd.append(v)\n value_odd += sequence[i]\n sequence_sum_odd.append(value_odd)\n \n i = 0\n j = 0 \n max_value_even = find_max_value(sequence_even, sequence_odd, True, sequence_sum_even, sequence_sum_odd, k)\n max_value_odd = find_max_value(sequence_odd, sequence_even, False, sequence_sum_odd, sequence_sum_even, k)\n\n print(max(max_value_even, max_value_odd))\n\n\n \n\n\n\n", "def max_beauty(n, k, s):\n left = 1 # Minimum possible beauty\n right = n # Maximum possible beauty\n max_length = 0\n\n while left <= right:\n mid = (left + right) // 2\n if is_possible(mid, k, s):\n max_length = mid\n left = mid + 1\n else:\n right = mid - 1\n\n return max_length\n\n\ndef is_possible(length, k, s):\n count_a = 0 # Count of 'a' in the current window\n count_b = 0 # Count of 'b' in the current window\n max_count = 0 # Maximum count of a single letter in the current window\n left = 0 # Left pointer for the sliding window\n\n for right in range(len(s)):\n if s[right] == 'a':\n count_a += 1\n else:\n count_b += 1\n\n max_count = max(max_count, count_a, count_b)\n\n # If the number of characters to change exceeds 'k', move the left pointer\n if (right - left + 1) - max_count > k:\n if s[left] == 'a':\n count_a -= 1\n else:\n count_b -= 1\n left += 1\n\n return (len(s) - left) >= length\n\n\n# Read input values\nn, k = map(int, input().split())\ns = input().strip()\n\n# Call max_beauty function\nresult = max_beauty(n, k, s)\n\n# Print the maximum beauty\nprint(result)\n\n \t \t\t\t \t\t\t \t \t\t \t \t \t\t\t\t\t \t", "def maxl(a, char, K):\n maxl = 0\n cur = 0\n count = 0\n\n left = 0\n for right in range(len(a)):\n count += (a[right] == char)\n\n while count > K:\n count -= (a[left] == char)\n left += 1\n\n cur = right - (left - 1)\n maxl = max(maxl, cur)\n\n return maxl\n\ndef main():\n N, K = map(int, input().split())\n a = input()\n\n res = max(maxl(a,'a',K), maxl(a,'b',K))\n print(res)\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t\t \t \t \t\t\t\t\t\t \t \t \t\t", "import sys\nread = sys.stdin.readline\n\ndef run_case():\n n, k = map(int, input().split())\n str = input()\n\n res = 0\n l = 0\n cnt = [0, 0]\n for c in str:\n t = 0 if c == 'a' else 1\n cnt[t] += 1\n if min(cnt) > k:\n t = 0 if str[l] == 'a' else 1\n cnt[t] -= 1\n l += 1\n else:\n res += 1\n\n print(res)\n\nif __name__ == '__main__':\n run_case()\n\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\na, b, j = 0, 0, 0\r\nfor i in range(n):\r\n if s[i] == 'a':\r\n a += 1\r\n else:\r\n b += 1\r\n if min(a, b) > k:\r\n if s[j] == 'a':\r\n a -= 1\r\n else:\r\n b -= 1\r\n j += 1\r\nprint(n - j)\r\n", "n,k = map(int,input().split())\r\ns = input()\r\na,b = 0,0\r\nj = 0\r\nans = 0\r\nfor i in s:\r\n\tif i=='a':\r\n\t\ta+=1\r\n\telse:\r\n\t\tb+=1\r\n\tif min(a,b)>k:\r\n\t\tif s[j]=='a':\r\n\t\t\ta-=1\r\n\t\telse:\r\n\t\t\tb-=1\r\n\t\tj += 1\r\n\telse:\r\n\t\tans += 1\r\nprint(ans)", "n,k = map(int,input().split())\ns = input()\nd={'a':0,'b':0}\nl= 0\na= 0\nfor i in s:\n\td[i]+=1\n\tif min(d.values())>k:\n\t\td[s[l]]-=1\n\t\tl+=1\n\telse:\n\t\ta+=1\nprint(a)\n\t \t \t \t \t \t \t \t\t\t\t \t \t \t\t\t \t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,K = map(int, input().split())\r\nS = input()\r\n\r\nA,B = [0],[0]\r\nfor i,c in enumerate(S):\r\n if c=='a':\r\n A.append(A[-1]+1)\r\n else:\r\n A.append(A[-1])\r\n if c=='b':\r\n B.append(B[-1]+1)\r\n else:\r\n B.append(B[-1])\r\n \r\nl,r=0,N+1\r\nwhile l+1<r:\r\n m = (l+r)//2\r\n \r\n find = False\r\n for i in range(m,N+1):\r\n ta = A[i]-A[i-m]\r\n tb = B[i]-B[i-m]\r\n \r\n if ta<=K or tb<=K:\r\n find = True\r\n break\r\n if find:\r\n l = m\r\n else:\r\n r = m\r\nprint(l)\r\n \r\n \r\n", "def max_beauty_string(n, k, s):\n max_beauty = 0 # Maximum beauty achieved\n for char in ['a', 'b']:\n left = 0 # Left pointer of the sliding window\n count = 0 # Count of characters changed\n \n for right in range(n):\n if s[right] != char:\n count += 1\n \n while count > k: # Adjusting the window to fit within k characters changed\n if s[left] != char:\n count -= 1\n left += 1\n \n max_beauty = max(max_beauty, right - left + 1)\n \n return max_beauty\n\n# Reading input\nn, k = map(int, input().split())\ns = input()\n\n# Calculating and printing the result\nresult = max_beauty_string(n, k, s)\nprint(result)\n\n\t \t \t \t \t \t \t \t \t\t\t \t \t", "n,k=map(int, input().split())\r\nxyz = input()\r\na,b,c , ans = 0,0,0,0\r\nfor i in range(n):\r\n if xyz[i] == 'a':\r\n a+=1\r\n else:\r\n b+=1\r\n if a<=k or b<=k:\r\n ans=max(ans, i+1-c)\r\n else:\r\n if xyz[c] == 'a':\r\n a-=1\r\n else:\r\n b-=1 \r\n c+=1\r\nprint(ans) \r\n\t\t", "def max_beauty(n, k, s):\n max_beauty = 0\n window_start = 0\n char_count = {'a': 0, 'b': 0}\n max_char_count = 0\n \n for window_end in range(n):\n char_count[s[window_end]] += 1\n max_char_count = max(max_char_count, char_count[s[window_end]])\n \n while (window_end - window_start + 1) - max_char_count > k:\n char_count[s[window_start]] -= 1\n window_start += 1\n \n max_beauty = max(max_beauty, window_end - window_start + 1)\n \n return max_beauty\nn, k = map(int, input().split())\ns = input()\n\nresult = max_beauty(n, k, s)\nprint(result)\n\n \t\t\t \t \t \t \t\t \t\t\t \t\t \t", "def max_beauty(n, k, string):\n max_len = 0\n left = 0\n a_count = 0\n b_count = 0\n\n for right in range(n):\n if string[right] == 'a':\n a_count += 1\n else:\n b_count += 1\n\n while min(a_count, b_count) > k:\n if string[left] == 'a':\n a_count -= 1\n else:\n b_count -= 1\n left += 1\n\n max_len = max(max_len, right - left + 1)\n\n return max_len\n\n# Read input\nn, k = map(int, input().split())\nstring = input()\n\n# Calculate and print the result\nresult = max_beauty(n, k, string)\nprint(result)\n\n \t \t\t\t\t\t\t \t \t\t\t \t\t \t\t \t", "def max_beauty(n, k, s):\n max_length = 0 # maximum length of substring with equal letters\n left = 0 # left pointer of the window\n counts = [0, 0] # counts of 'a' and 'b' characters in the current window\n \n for right in range(n):\n counts[ord(s[right]) - ord('a')] += 1\n \n while min(counts) > k:\n counts[ord(s[left]) - ord('a')] -= 1\n left += 1\n \n max_length = max(max_length, right - left + 1)\n \n return max_length\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the maximum beauty\nresult = max_beauty(n, k, s)\nprint(result)\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())\ns = input()\n\n\nan = 0\nt = 0\nle = 0\np = [0, 0]\n\nfor ri in range(n):\n p[s[ri] == 'a'] += 1\n t = max(t, p[s[ri] == 'a'])\n\n if (ri - le + 1) - t > k:\n p[s[le] == 'a'] -= 1\n le += 1\n\n\nprint(max(an, ri - le + 1))\n\t \t\t \t \t\t \t\t\t\t\t \t \t \t", "n,k = map(int,input().split())\ns = input()\ni = 0\nj = 0\nk1 = k\nk2 = k\nansa = 0\nansb = 0\nwhile j<n:\n if s[j]=='b':\n if k1:\n k1-=1\n \n else:\n while i<=j:\n \n if s[i]=='b':\n i+=1\n break\n i+=1\n winlen = j-i+1\n ansa = max(winlen,ansa)\n else:\n winlen = j-i+1\n ansa = max(winlen,ansa)\n j+=1\ni = 0\nj = 0\nwhile j<n:\n if s[j]=='a':\n if k2:\n k2-=1\n \n else:\n while i<=j:\n \n if s[i]=='a':\n i+=1\n break\n i+=1\n winlen = j-i+1\n ansb = max(winlen,ansb)\n else:\n winlen = j-i+1\n ansb = max(winlen,ansb)\n j+=1\nprint(max(ansa,ansb))\n\t \t \t\t \t \t\t \t\t\t\t\t \t \t", "n,k=map(int,input().split())\r\ns=input()\r\nj=0\r\ni=0\r\ndp=[0,0]\r\nans=0\r\ndp[ord(s[i])-ord('a')]+=1\r\nfor i in range(n):\r\n while j<n-1:\r\n if min(dp)<=k:\r\n j+=1\r\n dp[ord(s[j])-ord('a')]+=1\r\n else:\r\n break\r\n if j!=n-1 or k<min(dp):\r\n dp[ord(s[j])-ord('a')]-=1\r\n j-=1\r\n ans=max(ans,dp[0]+dp[1])\r\n dp[ord(s[i])-ord('a')]-=1\r\nprint(ans)\r\n\r\n", "n, k = list(map(int, input().split()))\r\ns = input()\r\nres = 0\r\ncount_a = 0\r\ncount_b = 0\r\nleft = 0\r\nright = 0\r\nwhile True:\r\n if s[right] == 'a':\r\n count_a += 1\r\n else:\r\n count_b += 1\r\n if count_a <= k or count_b <= k:\r\n if right - left + 1 > res:\r\n res = right - left + 1\r\n else:\r\n if s[left] == 'a':\r\n count_a -= 1\r\n else:\r\n count_b -= 1\r\n left += 1\r\n right += 1\r\n if n - left < res or right == n:\r\n break\r\nprint(res)", "n,k=map(int,input().split())\r\ns=input()\r\nmx=0\r\nac=0\r\nbc=0\r\nj=0\r\nfor i in range(len(s)):\r\n if(s[i]==\"a\"):\r\n ac+=1\r\n elif(s[i]==\"b\"):\r\n bc+=1\r\n if(ac-k<=0 or bc-k<=0):\r\n mx=ac+bc\r\n else:\r\n if(s[j]==\"a\"):\r\n ac-=1\r\n else:\r\n bc-=1\r\n j+=1\r\nprint(mx)\r\n \r\n ", "n,k = map(int,input().split())\r\ns = input()\r\nans = 0\r\nl = 0\r\nr_a = r_b = 0\r\ntmp_a = tmp_b = 0\r\nfor l in range(n):\r\n while r_a != n:\r\n if s[r_a] == 'b':\r\n if tmp_a == k:\r\n break\r\n tmp_a += 1\r\n r_a += 1\r\n while r_b != n:\r\n if s[r_b] == 'a':\r\n if tmp_b == k:\r\n break\r\n tmp_b += 1\r\n r_b += 1\r\n ans = max(ans,r_a-l,r_b-l);\r\n if s[l] == 'a':\r\n tmp_b -= 1\r\n else:\r\n tmp_a -= 1\r\nprint(ans)\r\n", "def solve(c,s):\r\n ln=len(s)\r\n dp=[0]*(ln+1)\r\n for i in range(ln):\r\n if s[i]=='a':\r\n dp[i+1]=dp[i]+1\r\n else:\r\n dp[i+1]=dp[i]\r\n lft=0\r\n rt=ln\r\n while lft<rt:\r\n md=(lft+rt+1)//2\r\n f=0\r\n for i in range(md, ln+1):\r\n tmp=dp[i]-dp[i-md]\r\n if tmp<=c or tmp>=md-c:\r\n f=1\r\n break\r\n if f==1:\r\n lft=md\r\n else:\r\n rt=md-1\r\n return lft\r\n\r\n\r\nn,c=map(int,input().split())\r\ns=input()\r\nprint(solve(c,s))\r\n", "def check_char_count(target_char):\r\n j = 0\r\n char_count = 0\r\n max_count = 0\r\n for i in range(n):\r\n if s[i] == target_char:\r\n char_count += 1\r\n if char_count > m:\r\n while char_count > m:\r\n if s[j] == target_char:\r\n char_count -= 1\r\n j += 1\r\n max_count = max(max_count, i - j + 1)\r\n return max_count\r\n\r\nwhile True:\r\n try:\r\n n, m = map(int, input().split())\r\n s = input()\r\n print(max(check_char_count('b'), check_char_count('a')))\r\n except EOFError:\r\n break\r\n", "n,p=map(int, input().split())\nst = input()\na,b,t , ans = 0,0,0,0\nfor i in range(n):\n if st[i] == 'a':\n a+=1\n else:\n b+=1\n if a<=p or b<=p:\n ans=max(ans, i+1-t)\n else:\n if st[t] == 'a':\n a-=1\n else:\n b-=1 \n t+=1\nprint(ans) \n\t\t \t \t \t\t\t\t\t \t\t\t\t\t \t\t \t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ns = input()[:-1]\r\n\r\nj, j1 = -1, -1\r\nc, c1 = 0, 0\r\nd, k1 = 0, k\r\nfor i in range(n):\r\n if s[i] == 'b':\r\n k -= 1\r\n while k < 0:\r\n j += 1\r\n if s[j] == 'b':\r\n k += 1\r\n c -= 1\r\n c += 1\r\n d = max(d, c)\r\n\r\n if s[i] == 'a':\r\n k1 -= 1\r\n while k1 < 0:\r\n j1 += 1\r\n if s[j1] == 'a':\r\n k1 += 1\r\n c1 -= 1\r\n c1 += 1\r\n d = max(d, c1, c)\r\n\r\nprint(d)", "n, k = map(int, input().split())\r\nstring = input()\r\nstart = 0\r\nmaxBeauty = 0\r\nnumOfA= 0\r\nnumOfB = 0\r\nfor i in range(n):\r\n if string[i] == \"a\":\r\n numOfA += 1\r\n else:\r\n numOfB += 1\r\n if numOfA <= k or numOfB <= k:\r\n maxBeauty = max(maxBeauty, i - start + 1)\r\n else:\r\n if string[start] == \"a\":\r\n numOfA -= 1\r\n else:\r\n numOfB -= 1\r\n start += 1\r\nprint(maxBeauty)", "def check(n,k,s,x):\r\n\tcnt, ans, j = 0, 0, 0\r\n\tfor i in range(n):\r\n\t\tif s[i] == x:\r\n\t\t\tcnt += 1\r\n\t\tif cnt > k:\r\n\t\t\twhile cnt > k:\r\n\t\t\t\tif s[j] == x:\r\n\t\t\t\t\tcnt -= 1\r\n\t\t\t\tj += 1\r\n\t\tans = max(ans, i - j + 1)\r\n\t\r\n\treturn ans\r\n\r\ndef solve():\r\n\tn, k = map(int, input().split())\r\n\ts = input()\r\n\tprint(max(check(n, k, s, 'a'), check(n, k, s, 'b')))\r\n\r\nsolve()\t\r\n\t\r\n\r\n\r\n", "def maximize_beauty(n, k, string):\n left = 0\n max_length = 0\n max_left = 0\n char_count = [0, 0] # count of 'a' and 'b' characters\n \n for right in range(n):\n char_count[ord(string[right]) - ord('a')] += 1\n \n while min(char_count) > k:\n char_count[ord(string[left]) - ord('a')] -= 1\n left += 1\n \n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n \n return max_length\n\n# Read input\nn, k = map(int, input().split())\nstring = input()\n\n# Calculate the maximum beauty\nmax_beauty = maximize_beauty(n, k, string)\n\n# Print the result\nprint(max_beauty)\n\n\n\t \t \t\t \t \t \t\t \t \t\t \t \t\t", "n,k=map(int,input().split())\r\ns=input()\r\nd={'a':0,'b':0}\r\nl=0\r\na=0\r\nfor i in s:\r\n\td[i]+=1\r\n\tif min(d.values())>k:d[s[l]]-=1;l+=1\r\n\telse:a+=1\r\nprint(a)", "def max_beauty_string(n, k, s):\n left = 0\n max_beauty = 0\n count = [0, 0] \n \n for right in range(n):\n count[ord(s[right]) - ord('a')] += 1\n \n while min(count) > k:\n count[ord(s[left]) - ord('a')] -= 1\n left += 1\n \n max_beauty = max(max_beauty, right - left + 1)\n \n return max_beauty\nn, k = map(int, input().split())\ns = input()\nresult = max_beauty_string(n, k, s)\nprint(result)\n\n\t\t\t \t\t\t\t\t \t\t \t \t \t\t \t\t\t", "n, k = map(int, input().split())\ns = input()\n\nleft = 0\nmax_length = 0\ncount = [0, 0] # Count of 'a' and 'b' characters within the current window\n\nfor right in range(n):\n count[ord(s[right]) - ord('a')] += 1\n while min(count) > k:\n count[ord(s[left]) - ord('a')] -= 1\n left += 1\n max_length = max(max_length, right - left + 1)\n\nprint(max_length)\n\n\t \t\t\t \t\t\t \t\t \t\t\t\t", "def solve(n, k, s, c):\r\n best = 0\r\n length = 0\r\n changed = 0\r\n i, j = 0, 0\r\n while j < n:\r\n if s[j] != c:\r\n changed += 1\r\n while changed > k:\r\n if s[i] != c:\r\n changed -= 1\r\n i += 1\r\n j += 1\r\n best = max(best, j-i)\r\n return best\r\n\r\nif __name__ == '__main__':\r\n n, k = list(map(int, input().split()))\r\n s = input()\r\n print(max(solve(n, k, s, 'a'), solve(n, k, s, 'b')))\r\n", "n, k = map(int, input().split())\r\ncounta, countb = 0, 0\r\ns = input()\r\nl, r = 0, 0\r\nmaxlength = 0\r\nwhile r < n:\r\n if s[r] == 'a': counta += 1\r\n else: countb += 1\r\n if counta <= k or countb <= k:\r\n maxlength = max(maxlength, r - l + 1)\r\n else:\r\n if s[l] == 'a': counta -= 1\r\n else: countb -= 1\r\n l += 1\r\n r += 1\r\nprint(maxlength)", "def max_beauty(n, k, s):\n max_length = 0\n max_count = 0\n start = 0\n count_a = 0\n count_b = 0\n\n for end in range(n):\n if s[end] == 'a':\n count_a += 1\n else:\n count_b += 1\n\n while min(count_a, count_b) > k:\n if s[start] == 'a':\n count_a -= 1\n else:\n count_b -= 1\n start += 1\n\n max_length = max(max_length, end - start + 1)\n\n return max_length\n\n\nn, k = map(int, input().split())\ns = input()\n\n\nresult = max_beauty(n, k, s)\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, k = map(int, input().split())\ns = input()\n\nmax_beauty = 0\nleft = 0\nchar_count = {'a': 0, 'b': 0}\n\nfor right in range(n):\n char_count[s[right]] += 1\n while min(char_count['a'], char_count['b']) > k:\n char_count[s[left]] -= 1\n left += 1\n max_beauty = max(max_beauty, right - left + 1)\n\nprint(max_beauty)\n\n\t\t\t \t\t\t \t \t \t \t\t\t\t \t \t \t\t", "n, k = map(int, input().strip().split())\r\ns = input().strip()\r\na, b = [0]*(n+1), [0]*(n+1)\r\nfor i in range(1, n+1):\r\n a[i] = a[i-1] + (s[i-1] == 'a')\r\n b[i] = b[i-1] + (s[i-1] == 'b')\r\n\r\nres = 0\r\nfor i in range(1, n+1):\r\n l = 1\r\n r = i\r\n while l < r:\r\n m = (l+r+1)//2\r\n if min(a[i] - a[i-m], b[i] - b[i-m]) > k:\r\n r = m-1\r\n else:\r\n l = m\r\n res = max(res, l)\r\nprint(res)\r\n", "def max_beauty(n, k, s):\n max_length = 0\n max_count = 0\n char_count = [0, 0] # Count of 'a' and 'b' characters\n left = 0\n \n for right in range(n):\n char_count[ord(s[right]) - ord('a')] += 1\n max_count = max(max_count, char_count[0], char_count[1])\n \n # Calculate the length of the current window\n window_length = right - left + 1\n \n # If the number of characters to change is greater than k,\n # move the window's starting point to the right\n if window_length - max_count > k:\n char_count[ord(s[left]) - ord('a')] -= 1\n left += 1\n \n max_length = max(max_length, right - left + 1)\n \n return max_length\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the maximum beauty\nresult = max_beauty(n, k, s)\nprint(result)\n\n \t\t\t \t\t \t\t \t \t \t \t", "import math\r\n\r\nn,k=map(int,input().split())\r\ns=str(input())\r\n\r\nd={\"a\":0,\"b\":0}\r\nmax_len=1\r\nr=0;l=0\r\n\r\nwhile r<n:\r\n d[s[r]]+=1\r\n r+=1\r\n if min(d[\"a\"],d[\"b\"])>k:\r\n for i in range(l,r):\r\n d[s[i]]-=1\r\n if min(d[\"a\"],d[\"b\"])<=k:\r\n l=i+1\r\n break\r\n #print(d,l,r)\r\n max_len=max(max_len,d[\"a\"]+d[\"b\"])\r\n \r\nprint(max_len)\r\n \r\n ", "n,k=input().split()\r\nstring=input()\r\nn,k=int(n),int(k)\r\n\r\ndef helper(char):\r\n window={}\r\n n=len(string)\r\n left=maximum_length=count_other=0\r\n for i in range(n):\r\n if string[i]!=char: count_other+=1\r\n window[string[i]]= 1+ window.get(string[i],0)\r\n while left<i and count_other>k:\r\n window[string[left]]-=1\r\n if string[left]!= char: count_other-=1\r\n left+=1\r\n maximum_length=max(maximum_length,i-left+1)\r\n\r\n \r\n return maximum_length\r\nprint(max(helper(\"a\"),helper(\"b\")))\r\n\r\n\r\n\r\n \r\n \r\n \r\n ", "n, k=[int(v) for v in input().split()]\r\ns=input()\r\nw=[[0, 0]]\r\nq={\"a\":0, \"b\":0}\r\nfor j in s:\r\n q[j]+=1\r\n w.append([q[\"a\"], q[\"b\"]])\r\nres=0\r\nfor j in range(n+1):\r\n l, r=j, n+1\r\n while r-l>1:\r\n m=(l+r)//2\r\n if min(w[m][0]-w[j][0], w[m][1]-w[j][1])<=k:\r\n l=m\r\n else:\r\n r=m\r\n res=max(l-j, res)\r\nprint(res)", "n,k = map(int,input().split())\r\n_string= input()\r\n\r\ncollect = {'a': 0, 'b': 0}\r\nleft = 0\r\nbeauty = 0\r\n\r\nfor c in _string:\r\n collect[c] += 1\r\n if min(collect.values()) > k:\r\n collect[_string[left]] -= 1\r\n left += 1\r\n else:\r\n beauty += 1\r\nprint(beauty)", "n, k = map(int, input().split())\ns = input()\na, b = 0, 0\nleft = 0\nmaxm = 0\nfor i in s:\n\tif i == 'a':\n\t\ta += 1\n\telse:\n\t\tb += 1\n\tif min(a, b) > k:\n\t\tif s[left] == 'a':\n\t\t\ta -= 1\n\t\telse:\n\t\t\tb -= 1\n\t\tleft += 1\n\telse:\n\t\tmaxm += 1\nprint(maxm)", "n,k=map(int,input().split())\r\nc=k\r\ns=input()\r\nL=0\r\nR=0\r\nans=0\r\na=0\r\nb=0\r\nwhile R<n and L<n:\r\n le=R-L+1\r\n if le >ans:\r\n if s[R]=='a':\r\n a+=1\r\n else:\r\n b+=1\r\n if a>b and b<=k:\r\n ans=le\r\n elif a<=b and a<=k:\r\n ans=le\r\n else:\r\n if s[L]=='a':\r\n a-=1\r\n else:\r\n b-=1\r\n L+=1\r\n R+=1 \r\nprint(ans)", "n, k = map(int, input().split())\ns = input()\n\nmax_beauty = 0\nstart = 0\ncounts = [0, 0] # counts[0] for 'a', counts[1] for 'b'\n\nfor end in range(n):\n counts[ord(s[end]) - ord('a')] += 1\n \n if min(counts) > k:\n counts[ord(s[start]) - ord('a')] -= 1\n start += 1\n \n max_beauty = max(max_beauty, end - start + 1)\n\nprint(max_beauty)\n \t \t\t\t\t \t \t\t \t \t \t \t\t \t \t", "n, k = map(int, input().split())\ns = input()\n\nmax_beauty = 1 # Minimum possible beauty is 1\n\n# Check for all possible substrings of equal letters and calculate the maximum beauty\nfor char in ['a', 'b']:\n left = 0\n changed = 0 # Count of characters changed\n for right in range(n):\n if s[right] != char:\n changed += 1\n while changed > k:\n if s[left] != char:\n changed -= 1\n left += 1\n max_beauty = max(max_beauty, right - left + 1)\n\nprint(max_beauty)\n\n\t \t\t\t \t \t \t\t\t\t \t \t \t \t", "n, k = map(int, input().split())\r\nword = input()\r\n\r\nmax_a = 0\r\nleft = 0\r\nb_count = 0\r\nfor right in range(n):\r\n if word[right] == 'b':\r\n b_count += 1\r\n while b_count > k:\r\n if word[left] == 'b':\r\n b_count -= 1\r\n left += 1\r\n max_a = max(max_a, right - left + 1)\r\n\r\nmax_b = 0\r\nleft = 0\r\na_count = 0\r\nfor right in range(n):\r\n if word[right] == 'a':\r\n a_count += 1\r\n while a_count > k:\r\n if word[left] == 'a':\r\n a_count -= 1\r\n left += 1\r\n max_b = max(max_b, right - left + 1)\r\n\r\nans = max(max_a, max_b)\r\nprint(ans)", "n,k=map(int,input().split())\r\ns=input()\r\nabs_mx=0\r\nfor studied in \"ab\":\r\n first=0\r\n last=0\r\n mx=0\r\n ln=0\r\n pos=k\r\n for i in range(n):\r\n ln+=1\r\n if s[i]!=studied:\r\n pos-=1\r\n \r\n if pos<0:\r\n ln-=1\r\n mx=max(mx,ln)\r\n if s[first]!=studied:pos+=1\r\n first+=1\r\n mx=max(mx,ln)\r\n abs_mx=max(abs_mx,mx)\r\nprint(abs_mx)\r\n\r\n\r\n", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nleft = 0\r\nright = 0\r\ncounts = [0, 0] # counts[0] is the count of 'a' characters, counts[1] is the count of 'b' characters\r\nmax_len = 0\r\n\r\nwhile right < n:\r\n c = s[right]\r\n counts[ord(c) - ord('a')] += 1\r\n right += 1\r\n\r\n while min(counts) > k:\r\n c = s[left]\r\n counts[ord(c) - ord('a')] -= 1\r\n left += 1\r\n\r\n max_len = max(max_len, right - left)\r\n\r\nprint(max_len)\r\n", "def get_max_window_length(string, changed_char, max_changes):\n max_window_length = 0\n window_length = 0\n no_of_changes = 0\n\n window_start = 0\n for window_end in range(len(string)):\n no_of_changes += (string[window_end] == changed_char)\n\n while no_of_changes > max_changes:\n no_of_changes -= (string[window_start] == changed_char)\n window_start += 1\n\n window_length = window_end - (window_start - 1)\n max_window_length = max(max_window_length, window_length)\n\n return max_window_length\n\ndef main():\n length, max_changes = map(int, input().split())\n string = input()\n\n beauty = max(get_max_window_length(string, 'a', max_changes), get_max_window_length(string, 'b', max_changes))\n\n print(beauty)\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t\t \t\t\t \t \t \t \t\t \t", "import re\n\ntheString = re.split(\"\\\\s\", input())\ntheNumber = int(theString[0])\nnumBads = int(theString[1])\ntheString = input()\n\ntheMax = 0\nbad = 0\nx = 0\ny = 0\nwhile x < len(theString) and y < len(theString):\n if theString[y] == \"b\":\n if bad < numBads:\n bad += 1\n y += 1\n else:\n while theString[x] != \"b\":\n x += 1\n x += 1\n y += 1\n else:\n y += 1\n if y-x > theMax:\n theMax = y-x\n \nx = 0\ny = 0\nbad = 0\nwhile x < len(theString) and y < len(theString):\n if theString[y] == \"a\":\n if bad < numBads:\n bad += 1\n y += 1\n else:\n while theString[x] != \"a\":\n x += 1\n x += 1\n y += 1\n else:\n y += 1\n if y-x > theMax:\n theMax = y-x\n \nprint(theMax)\n\t \t\t \t\t\t\t \t\t \t\t\t \t \t \t\t", "no = 0\nm = 0\nstr = \"\"\n\ndef check(c):\n global no\n global m\n global str\n j = 0\n count = 0\n a = 0\n for i in range(no):\n if str[i] == c:\n count += 1\n if count > m:\n while count > m:\n if str[j] == c:\n count -= 1\n j += 1\n a = max(a, i-j+1)\n return a\n\nwhile True:\n try:\n no, m = map(int, input().split())\n str = input()\n print(max(check('b'), check('a')))\n except:\n break\n\n \t \t \t\t \t \t\t \t \t\t \t \t\t \t \t", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn, k = iis()\r\ns = list(inp())\r\n\r\n\r\ndef want(char):\r\n l = 0\r\n r = 0\r\n ans = 0\r\n swapsDone = 0\r\n while l < n:\r\n while r < n and s[r] == char:\r\n r += 1\r\n if r >= n:\r\n ans = max(ans, r - l)\r\n break\r\n if swapsDone < k:\r\n r += 1\r\n swapsDone += 1\r\n continue\r\n ans = max(ans, r - l)\r\n if s[l] != char:\r\n swapsDone -= 1\r\n l += 1\r\n return ans\r\n\r\n\r\nprint(max(want(\"a\"), want(\"b\")))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn,k = [int(x) for x in input().split()]\r\ns = input()\r\n\r\nans = a = b = j = 0\r\n\r\nfor i in range(0,n):\r\n \r\n a += (s[i]=='a')\r\n b += (s[i]=='b')\r\n \r\n while min(a,b) > k:\r\n a -= (s[j]=='a')\r\n b -= (s[j]=='b')\r\n j += 1\r\n \r\n ans = max(ans,i-j+1)\r\n\r\nprint(ans)", "def max_beauty(n, k, s):\n max_length = 0 # Maximum length of a substring with equal letters\n max_beauty = 0 # Maximum beauty achievable\n \n left = 0 # Left pointer of the sliding window\n count = [0, 0] # Count of 'a's and 'b's in the current window\n \n for right in range(n):\n count[ord(s[right]) - ord('a')] += 1\n while min(count) > k:\n count[ord(s[left]) - ord('a')] -= 1\n left += 1\n \n max_length = max(max_length, right - left + 1)\n max_beauty = max(max_beauty, min(max_length + k, right - left + 1))\n \n return max_beauty\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the maximum beauty achiev\nresult = max_beauty(n, k, s)\nprint(result)\n\n\t \t\t \t \t\t \t\t \t\t\t \t \t\t\t \t\t \t", "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\ndef trance(a,p,k):\r\n sa,sb=a[:p].count('a'),a[:p].count('b')\r\n if sa<=k or sb<=k: return True\r\n for i in range(1,len(a)-p+1):\r\n sa-=int(a[i-1]=='a')\r\n sb-=int(a[i-1]=='b')\r\n sa+=int(a[i+p-1]=='a')\r\n sb+=int(a[i+p-1]=='b')\r\n if sa<=k or sb<=k: return True\r\nn,k=map(int,input().split())\r\na=[i for i in input()]\r\nind=[i for i in range(1,n+1)]\r\nl,r=0,n\r\nans=[]\r\nwhile l<=r:\r\n booley=trance(a,(l+r)//2,k)\r\n if booley:\r\n ans.append((l+r)//2)\r\n l=(l+r)//2+1\r\n else: r=(l+r)//2-1\r\nprint(max(ans))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn,k = map(int,input().split())\r\ns = input()\r\nans = 0\r\nj = 0\r\na = 0\r\nb = 0\r\n\r\nfor i in range(0,n):\r\n a += (s[i] == 'a')\r\n b += (s[i] == 'b')\r\n \r\n while(min(a,b) > k):\r\n a -= (s[j]=='a')\r\n b -= (s[j]=='b')\r\n j+=1\r\n \r\n ans = max(ans,i-j+1)\r\n\r\nprint(ans)", "def max_beauty(n, k, s):\n maxBeauty = 0\n countA = 0\n countB = 0\n left = 0\n\n for right in range(n):\n if s[right] == 'a':\n countA += 1\n else:\n countB += 1\n \n window_length = right - left + 1\n if min(countA, countB) <= k:\n maxBeauty = max(maxBeauty, window_length)\n else:\n if s[left] == 'a':\n countA -= 1\n else:\n countB -= 1\n left += 1\n \n return maxBeauty\n\n# Read input\nn, k = map(int, input().split())\ns = input().strip()\n\n# Calculate and print the result\nresult = max_beauty(n, k, s)\nprint(result)\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())\nst = input()\na,b,d,ans = 0,0,0,0\nfor i in range(n):\n if st[i] =='a':\n a+=1\n else:\n b+=1\n if a<=k or b<=k:\n ans = max(ans,i+1-d)\n else:\n if st[d] =='a':\n a -=1\n else:\n b -=1\n d +=1\nprint(ans)\n\n \t \t\t\t \t \t\t \t\t\t \t \t", "def bString(s, k):\n countMap = {}\n l = 0\n res = 0\n\n for r in range(len(s)):\n countMap[s[r]] = 1 + countMap.get(s[r], 0)\n while (r - l + 1) - max(countMap.values()) > k:\n countMap[s[l]] -= 1\n l +=1\n res = max(res, r - l + 1)\n return res\n\n\nn, k = map(int,input().split())\ns = input()\nprint(bString(s,k))\n\t \t \t \t \t\t \t\t\t \t \t \t", "n, k = map(int, input().split())\r\na = input()\r\ni = 0\r\nj = 0\r\nbest = 0\r\nd = {'a': 0, 'b': 0}\r\nfor j in range(n):\r\n d[a[j]] += 1\r\n while d['a'] > k and d['b'] > k:\r\n d[a[i]] -= 1\r\n i += 1\r\n best = max(best, j - i + 1)\r\nprint(best)", "n,k=map(int, input().split())\nxyz = input()\na,b,c , ans = 0,0,0,0\nfor i in range(n):\n if xyz[i] == 'a':\n a+=1\n else:\n b+=1\n if a<=k or b<=k:\n ans=max(ans, i+1-c)\n else:\n if xyz[c] == 'a':\n a-=1\n else:\n b-=1 \n c+=1\nprint(ans) \n\t\t\t\t \t \t\t \t \t \t \t \t\t \t \t\t", "def max_beauty(n, k, s):\n max_len = 0 # Initialize the maximum beauty\n a_count = 0 # Count of 'a' characters within the window\n b_count = 0 # Count of 'b' characters within the window\n left = 0 # Left endpoint of the window\n\n # Iterate through the string\n for right in range(n):\n if s[right] == 'a':\n a_count += 1\n else:\n b_count += 1\n\n # If the number of characters to change (k) is exceeded, move the left endpoint\n while min(a_count, b_count) > k:\n if s[left] == 'a':\n a_count -= 1\n else:\n b_count -= 1\n left += 1\n\n # Update the maximum beauty\n max_len = max(max_len, right - left + 1)\n\n return max_len\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the result\nresult = max_beauty(n, k, s)\nprint(result)\n\n\t \t\t\t\t\t \t \t\t \t\t\t\t\t \t \t\t\t", "n,k=[int(x) for x in input().split()]\r\nstring=input()\r\ncount=0\r\nmaxi=0\r\nfor x in [\"a\",\"b\"]:\r\n j=0\r\n count=0\r\n for i in range(n):\r\n if string[i]==x:\r\n count+=1\r\n if count>k:\r\n while count>k:\r\n if string[j]==x:\r\n count-=1\r\n j+=1\r\n maxi=max(i-j+1,maxi)\r\nprint(maxi)\r\n", "#Created By Minsol Jeong\n\n\ndef MaxCounter(s, k, ch):\n\n maxBeauty = 1\n foundCH = [i for i, x in enumerate(s) if x == ch]\n for i in range(len(foundCH) - k + 1):\n if k + i >= len(foundCH):\n maxCH = len(s[foundCH[i-1]:])-1\n elif i == 0:\n maxCH = len(s[:foundCH[k]])\n else:\n maxCH = len(s[foundCH[i - 1]:foundCH[k + i]]) - 1\n maxBeauty = max(maxCH, maxBeauty)\n return maxBeauty\n\ndef I3():\n # start = time.time()\n n, k = [int(x) for x in input().split()]\n s = input()\n a='a'\n b='b'\n maxBeauty = 1\n a_max = s.count(a)\n b_max = s.count(b)\n if a_max <= k or b_max <= k:\n maxBeauty = n\n\n else:\n maxBeauty = max(MaxCounter(s,k,a), MaxCounter(s,k,b))\n\n\n print(maxBeauty)\n\nif __name__ == '__main__':\n I3()\n \t \t\t\t \t \t\t \t\t \t \t\t \t\t", "def main():\n n, k = map(int, input().split())\n s = input()\n ans = 0\n\n dp = [0, 0]\n\n j = 0\n for i in range(n):\n dp[ord(s[i]) - ord('a')] += 1\n \n while min(dp[0], dp[1]) > k and j <= i: # if condition fails\n dp[ord(s[j]) - ord('a')] -= 1\n j += 1\n\n ans = max(ans, dp[0] + dp[1])\n\n print(ans)\n\nif __name__ == \"__main__\":\n main()\n", "n, k = map(int, input().split())\r\ns = input()\r\na = 0\r\nb = 0\r\nc = 0\r\nt = 0\r\nfor i in range(n):\r\n if s[i] == 'a':\r\n a += 1\r\n else:\r\n b += 1\r\n if min(a, b) <= k:\r\n c = max(c, a + b)\r\n else:\r\n if s[t] == 'a':\r\n t += 1\r\n a -= 1\r\n else:\r\n t += 1\r\n b -= 1\r\nprint(c)", "# your code goes here\nn,k=map(int,input().split())\ns=input()\nst,a,b,res=0,0,0,0\nfor i in s:\n\tif i=='a':\n\t\ta+=1\n\telse:\n\t\tb+=1\n\tif min(a,b)>k:\n\t\tif s[st]=='a':\n\t\t\ta-=1\n\t\telse:\n\t\t\tb-=1\n\t\tst+=1\n\telse:\n\t\tres+=1\nprint(res)\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\ns=input()\r\na=b=ans=j=0\r\nfor i in s:\r\n if i=='a':\r\n a+=1\r\n else:\r\n b+=1\r\n if min(a,b)>k:\r\n if s[j]=='a':\r\n a-=1\r\n else:\r\n b-=1\r\n j+=1\r\n else:\r\n ans+=1\r\nprint(ans)\r\n", "n, k = list(map(int, input().split()))\r\na = input()\r\n\r\nca = la = ra = ansa = 0\r\n\r\nwhile ra<n:\r\n if a[ra] == \"b\":\r\n ca+= 1\r\n if ca <= k:\r\n len = ra-la+1\r\n if len > ansa:\r\n ansa = len\r\n else:\r\n ra -= 1\r\n\r\n elif a[ra] == \"a\":\r\n len = ra-la+1\r\n if len>ansa:\r\n ansa = len\r\n\r\n while ca > k:\r\n if a[la] == \"b\":\r\n ca -= 2\r\n la += 1\r\n ra += 1\r\n\r\n\r\ncb = lb = rb = ansb = 0\r\n\r\nwhile rb<n:\r\n if a[rb] == \"a\":\r\n cb+= 1\r\n if cb <= k:\r\n len = rb-lb+1\r\n if len > ansb:\r\n ansb = len\r\n else:\r\n rb -= 1\r\n\r\n elif a[rb] == \"b\":\r\n len = rb-lb+1\r\n if len>ansb:\r\n ansb = len\r\n\r\n while cb > k:\r\n if a[lb] == \"a\":\r\n cb -= 2\r\n lb += 1\r\n rb += 1\r\n\r\nprint(max(ansa, ansb))", "from os import path\r\nimport sys,time, collections as c , math as m , pprint as p\r\nmaxx , localsys , mod = float('inf'), 0 , int(1e9 + 7) \r\nif (path.exists('input.txt')): sys.stdin=open('input.txt','r') ; sys.stdout=open('output.txt','w')\r\ninput = sys.stdin.readline\r\nn , k = map(int , input().split()) ; s = input().rstrip('\\n')\r\nans = a = b = j = 0\r\nfor i in range(n):\r\n a , b = (a+1 , b) if s[i] == 'a' else (a , b+1 )\r\n if min(a, b) > k :\r\n a , b = (a -1 , b) if s[j] == 'a' else (a , b -1) ; j+=1\r\n else:\r\n ans+=1\r\nprint(ans)\r\n", "def max_beauty(n, k, s):\n max_len = 0\n start = 0\n char_count = [0, 0] # Count of 'a' and 'b' characters in the current window\n\n for end in range(n):\n char_count[ord(s[end]) - ord('a')] += 1\n\n changes_needed = end - start + 1 - max(char_count)\n\n while changes_needed > k:\n char_count[ord(s[start]) - ord('a')] -= 1\n start += 1\n changes_needed = end - start + 1 - max(char_count)\n\n max_len = max(max_len, end - start + 1)\n\n return max_len\n\nn, k = map(int, input().split())\ns = input()\n\nresult = max_beauty(n, k, s)\nprint(result)\n\n\t\t \t \t \t \t\t \t\t \t\t \t \t \t\t", "l=input().split()\r\nn=int(l[0])\r\nk=int(l[1])\r\ns=input()\r\nmaxa=[]\r\ni=0\r\nj=0\r\nnumofs=0\r\nwhile(i<n):\r\n while(j<n and numofs<=k):\r\n if(s[j]=='a'):\r\n j+=1\r\n elif(numofs<k):\r\n numofs+=1\r\n j+=1\r\n else:\r\n break\r\n maxa.append(j-i+1)\r\n if(s[i]=='b'):\r\n numofs-=1\r\n i+=1\r\n else:\r\n i+=1\r\ni=0\r\nj=0\r\nnumofs=0\r\nwhile(i<n):\r\n while(j<n and numofs<=k):\r\n if(s[j]=='b'):\r\n j+=1\r\n elif(numofs<k):\r\n numofs+=1\r\n j+=1\r\n else:\r\n break\r\n maxa.append(j-i+1)\r\n if(s[i]=='a'):\r\n numofs-=1\r\n i+=1\r\n else:\r\n i+=1\r\nprint(max(maxa)-1)", "from collections import defaultdict\r\n\r\n\r\nn , k = list(map(int, input().split()))\r\nstring = input()\r\n\r\ndef solve(char):\r\n dictionary = defaultdict(int)\r\n maximum = 0\r\n start = 0\r\n\r\n for end in range(n):\r\n\r\n dictionary[string[end]] += 1\r\n\r\n while dictionary[char] > k:\r\n\r\n dictionary[string[start]] -= 1\r\n start += 1\r\n \r\n maximum = max(maximum , end - start + 1)\r\n return maximum\r\n\r\n\r\n\r\nprint(max(solve('a') , solve('b')))", "n, k = map(int, input().split())\ns = input()\nmax_beauty = 0\nfor c in ['a', 'b']:\n left = 0\n changed = 0\n for right in range(n):\n if s[right] != c:\n changed += 1\n while changed > k:\n if s[left] != c:\n changed -= 1\n left += 1\n max_beauty = max(max_beauty, right - left + 1)\nprint(max_beauty)\n\t\t\t\t \t \t \t\t \t\t \t\t\t\t \t\t \t \t \t", "def max_beauty_string(n, k, s):\n left = 0\n max_len = 0\n count_a = 0\n count_b = 0\n \n for right in range(n):\n if s[right] == 'a':\n count_a += 1\n else:\n count_b += 1\n \n while min(count_a, count_b) > k:\n if s[left] == 'a':\n count_a -= 1\n else:\n count_b -= 1\n left += 1\n \n max_len = max(max_len, right - left + 1)\n \n return max_len\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Find and print the maximum beauty of the string\nresult = max_beauty_string(n, k, s)\nprint(result)\n\n \t \t\t\t \t \t\t\t \t\t \t\t\t \t\t \t\t", "# longest substring with k filps\r\n\r\ndef longest(s,n,k):\r\n\td={'a':0,'b':0}\r\n\ti=j=m=l=0\r\n\tfor i in range(n):\r\n\t\td[s[i]]=d.get(s[i],0)+1\r\n\t\tmm=min(list(d.values()))\r\n\t\tif mm>k:\r\n\t\t\twhile j<n and mm>k:\r\n\t\t\t\td[s[j]]-=1\r\n\t\t\t\tj+=1\r\n\t\t\t\tmm=min(list(d.values()))\r\n\t\telse:\r\n\t\t\tif i-j+1>m:\r\n\t\t\t\tm=i-j+1\r\n\treturn m\r\n\r\nwhile 1:\r\n\ttry:\r\n\t\tn,k=map(int,input().split())\r\n\t\ts=input()\r\n\t\tprint(longest(s,n,k))\r\n\texcept:\r\n\t\tbreak", "n,k=map(int,input().split())\r\ns=input()\r\nprefix_a=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n if s[i-1]=='b':\r\n prefix_a[i]=1\r\n prefix_a[i]=prefix_a[i]+prefix_a[i-1]\r\ndic={}\r\nans=-1\r\ndic.update({0:0})\r\nfor i in range(1,n+1):\r\n if prefix_a[i]<=k:\r\n ans=max(ans,i)\r\n else: \r\n last=dic.get(prefix_a[i]-k,-1)\r\n if last!=-1: \r\n last=dic.get(prefix_a[i]-k)\r\n ans=max(i-last,ans)\r\n val=dic.get(prefix_a[i],-1)\r\n if val==-1:\r\n dic[prefix_a[i]]=i\r\nprefix_b=[0]*(n+1)\r\ndic={}\r\ndic.update({0:0})\r\nfor i in range(1,n+1):\r\n if s[i-1]=='a':\r\n prefix_b[i]=1\r\n prefix_b[i]=prefix_b[i]+prefix_b[i-1]\r\nfor i in range(1,n+1):\r\n if prefix_b[i]<=k:\r\n ans=max(ans,i)\r\n else:\r\n last=dic.get(prefix_b[i]-k,-1)\r\n if last!=-1: \r\n last=dic.get(prefix_b[i]-k)\r\n ans=max(i-last,ans)\r\n val=dic.get(prefix_b[i],-1)\r\n if val==-1:\r\n dic[prefix_b[i]]=i\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math;\r\nfrom math import gcd,sqrt,floor,factorial,ceil\r\nfrom bisect import bisect_left,bisect_right\r\nimport bisect;\r\nimport sys;\r\nfrom sys import stdin,stdout\r\nimport os\r\nsys.setrecursionlimit(pow(10,7))\r\nimport collections\r\nfrom collections import defaultdict,Counter\r\nfrom statistics import median\r\n# input=stdin.readline\r\n# print=stdout.write\r\nfrom queue import Queue\r\ninf = float(\"inf\")\r\nn,k=map(int,input().split())\r\ns=input()\r\nl=list(s)\r\na=\"a\";b=\"b\"\r\nm=[]\r\nfor i in l:\r\n if i==a:\r\n m.append(b)\r\n else:\r\n m.append(a)\r\nk1=k;\r\nk2=k;\r\nit1=0;\r\nit2=0;\r\n#change maximum a to b;\r\n\r\n\r\ndef fun(l):\r\n maxa=0\r\n k1 = k;\r\n k2 = k;\r\n it1 = 0;\r\n it2 = 0;\r\n while 0<=it1<n and it2<n:\r\n if l[it2]==b:\r\n pass;\r\n elif k1>0:\r\n k1-=1;\r\n else:\r\n while it1<n and l[it1]==b:\r\n it1+=1\r\n it1+=1\r\n length=it2-it1+1\r\n if maxa<length:\r\n maxa=length\r\n # print(it1,it2)\r\n it2+=1\r\n return maxa;\r\nmaxa1=fun(l)\r\nmaxa2=fun(m)\r\n# print(\"maxa\",maxa1,maxa2)\r\nans=max(maxa1,maxa2)\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\nmp = input()\r\n\r\nc = {'a': 0, 'b': 0}\r\naa = 0\r\nl = 0\r\n\r\nfor m in mp:\r\n c[m] += 1\r\n\r\n if min(c['a'], c['b']) > k:\r\n c[mp[l]] -= 1\r\n l += 1\r\n else:\r\n aa += 1\r\n\r\nprint(aa)\r\n", "n, k = map(int, input().split())\nst = input()\na, b, d, ans = 0, 0, 0, 0\nfor i in range(n):\n if st[i] == 'a':\n a += 1\n else:\n b += 1\n if a <= k or b <= k:\n ans = max(ans, i+1-d)\n else:\n if st[d] == 'a':\n a -= 1\n else:\n b -= 1\n d += 1\nprint(ans)\n\t \t \t \t \t\t\t \t\t\t\t \t\t\t \t\t\t \t", "def max_beauty(n, k, s):\n max_len = 0\n count_opposite = 0\n left = 0\n window = {} # Store the count of characters within the window\n\n for right in range(n):\n window[s[right]] = window.get(s[right], 0) + 1\n\n while min(window.get('a', 0), window.get('b', 0)) > k:\n window[s[left]] -= 1\n left += 1\n\n max_len = max(max_len, right - left + 1)\n\n return max_len\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the result\nresult = max_beauty(n, k, s)\nprint(result)\n\n\t\t\t\t \t\t \t \t\t\t \t \t\t \t\t", "def ConsecutiveString(present, k):\n max_length = 0\n max_substring = 0\n n = len(present)\n \n for char in ['a', 'b']:\n i = 0\n j = 0\n changes = 0\n\n while j < n:\n if present[j] != char:\n changes += 1\n\n while changes > k:\n if present[i] != char:\n changes -= 1\n i += 1\n max_length = max(max_length, j - i + 1)\n j += 1\n max_substring = max(max_substring, max_length)\n return max_substring\n\nn, k = map(int, input().split())\npresent = input()\nresult = ConsecutiveString(present, k)\nprint(result)\n \t\t\t \t \t\t\t \t \t \t \t \t\t \t\t", "# https://codeforces.com/problemset/problem/676/C\r\nimport sys\r\n\r\n_DEBUG = True\r\nif not _DEBUG:\r\n input = sys.stdin.readline\r\n\r\n\r\ndef solve(n, k, s):\r\n an = bn = ans = i = 0\r\n\r\n for e in s:\r\n if e == 'a':\r\n an += 1\r\n else:\r\n bn += 1\r\n\r\n while min(an, bn) > k:\r\n if s[i] == 'a':\r\n an -= 1\r\n else:\r\n bn -= 1\r\n i += 1\r\n ans = max(an + bn, ans)\r\n\r\n return ans\r\n\r\n\r\nassert solve(8, 1, 'aabaabaa') == 5\r\nassert solve(1, 0, 'a') == 1\r\nassert solve(4, 2, 'abba') == 4\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\n\r\nans = solve(n, k, s)\r\nprint(ans)\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\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 ** 5 + 7\r\n# for _ in range(int(get())):\r\n# n=int(get())\r\n# l=list(map(int,get().split()))\r\n# = map(int,get().split())\r\nn,k= map(int,get().split())\r\nl=get()\r\n\r\ni=0;j=0\r\nc=0\r\nans=0\r\nwhile i<n:\r\n if l[i]==\"a\":\r\n c+=1\r\n i+=1\r\n while c>k:\r\n if l[j]==\"a\":\r\n c-=1\r\n j+=1\r\n ans=max(i-j,ans)\r\ni=0;j=0\r\nc=0\r\nwhile i<n:\r\n if l[i]==\"b\":\r\n c+=1\r\n i+=1\r\n while c>k:\r\n if l[j]==\"b\":\r\n c-=1\r\n j+=1\r\n ans=max(i-j,ans)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n , k = map(int,input().split())\r\ns = input()\r\nif len(s) == 1 and k == 1:\r\n print(1)\r\nelif 'a' not in s or 'b' not in s:\r\n print(n)\r\nelse:\r\n maxi = 0\r\n count = 0\r\n l = 0\r\n window = {}\r\n for r in range(n):\r\n window[s[r]] = window.get(s[r], 0) + 1\r\n if (len(window.keys()) == 2):\r\n if (window['a'] <= k or window['b'] <= k):\r\n maxi = max(max_len, r - l + 1)\r\n if (window['a'] > k and window['b'] > k):\r\n window[s[l]] -= 1\r\n l += 1\r\n else:\r\n max_len = max(maxi, r - l + 1)\r\n\r\n print(maxi)", "def max_beauty_string(n, k, s):\n max_beauty = 0\n start = 0\n max_count = 0\n count = {'a': 0, 'b': 0}\n \n for end in range(n):\n count[s[end]] += 1\n max_count = max(max_count, count[s[end]])\n \n while (end - start + 1) - max_count > k:\n count[s[start]] -= 1\n start += 1\n \n max_beauty = max(max_beauty, min(max_count + k, end - start + 1))\n \n return max_beauty\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\nresult = max_beauty_string(n, k, s)\nprint(result)\n\n \t \t \t \t\t \t\t \t \t\t\t \t\t\t", "from collections import Counter\r\n\r\nn, k = input().split(' ')\r\nn, k = int(n), int(k)\r\ns = input()\r\n\r\ncounter = Counter()\r\nl, max_ocr, answer = 0, 0, 0\r\n\r\nfor r in range(n):\r\n counter[s[r]] += 1\r\n max_ocr = max(max_ocr, counter[s[r]])\r\n \r\n while r - l + 1 > max_ocr + k:\r\n counter[s[l]] -= 1\r\n l += 1\r\n \r\n answer = max(answer, r - l + 1)\r\n\r\nprint(answer)\r\n", "n,k=map(int,input().split())\r\nx=list(input())\r\ni,j,m,c=0,0,0,0\r\nwhile j<n:\r\n if c<=k:\r\n if x[j]==\"a\":\r\n m=max(j+1-i,m)\r\n else:\r\n c+=1\r\n if c<=k:\r\n m=max(j+1-i,m)\r\n j+=1\r\n else:\r\n if x[i]==\"b\":\r\n c-=1\r\n i+=1\r\nprint(\"\")\r\ni,j,c=0,0,0\r\nwhile j<n:\r\n if c<=k:\r\n if x[j]==\"b\":\r\n m=max(j+1-i,m)\r\n else:\r\n c+=1\r\n if c<=k:\r\n m=max(j+1-i,m)\r\n j+=1\r\n else:\r\n if x[i]==\"a\":\r\n c-=1\r\n i+=1\r\nprint(m)", "n,k=map(int,input().split())\r\na,b,l,ans=0,0,0,0\r\ns=input()\r\nfor r in range (n):\r\n if s[r]=='a':\r\n a+=1\r\n else:\r\n b+=1\r\n while a>k and b>k and l<n:\r\n if s[l]=='a':\r\n a-=1\r\n else:\r\n b-=1\r\n l+=1\r\n ans=max(ans, r-l+1)\r\nprint (ans)", "def max_beauty_string(n, k, s):\n max_beauty = 0\n max_count = 0\n count = {'a': 0, 'b': 0}\n left = 0\n\n for right in range(n):\n count[s[right]] += 1\n max_count = max(max_count, count[s[right]])\n\n while (right - left + 1) - max_count > k:\n count[s[left]] -= 1\n left += 1\n\n max_beauty = max(max_beauty, min(max_count + k, right - left + 1))\n\n return max_beauty\n\n# Read input\nn, k = map(int, input().split())\ns = input().strip()\n\n# Calculate and print the result\nresult = max_beauty_string(n, k, s)\nprint(result)\n\n\t \t \t\t \t\t\t \t \t \t \t \t\t\t\t\t \t", "\r\n\r\n\r\ndef find_max(n,m,t,char = 'a'):\r\n l=0\r\n r=0\r\n count= 0\r\n ans = 0\r\n num = 0\r\n\r\n while r<n:\r\n\r\n if t[r]==char:\r\n count+=1\r\n r+=1\r\n elif t[r]!=char and num<m:\r\n count+=1\r\n r+=1\r\n num+=1\r\n elif t[r]!=char and num >=m:\r\n ans = max(ans , count)\r\n\r\n if l==-1:\r\n l+=1\r\n else:\r\n if t[l]!=char:\r\n num-=1\r\n count-=1\r\n l+=1\r\n ans = max(count,ans)\r\n\r\n return ans\r\n\r\n\r\n\r\n \r\n\r\n\r\nn,m = map(int,input().split())\r\nt = input()\r\n\r\n\r\nans = max(find_max(n,m,t),find_max(n,m,t,'b'))\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys, math\r\nreader = (line.rstrip() for line in sys.stdin)\r\ninput = reader.__next__\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input()\r\n\r\ndef listStr():\r\n return list(input())\r\n\r\nimport collections as col\r\nimport math\r\n\r\ndef solve():\r\n N, K = getInts()\r\n S = [' '] + listStr()\r\n #for each A, how far can we go whilst encountering no more than K Bs, and vice versa\r\n A_count = [0]\r\n B_count = [0]\r\n curr_A = curr_B = 0\r\n AK_ind = N\r\n BK_ind = N\r\n for n in range(1,N+1):\r\n if S[n] == \"a\":\r\n curr_A += 1\r\n if curr_A == K+1 and AK_ind == N:\r\n AK_ind = n-1\r\n else:\r\n curr_B += 1\r\n if curr_B == K+1 and BK_ind == N:\r\n BK_ind = n-1\r\n A_count.append(curr_A)\r\n B_count.append(curr_B)\r\n #for the first value of A, find the longest possible substring. If we reach the end of the string at any time, break.\r\n if max(AK_ind,BK_ind) == N:\r\n return N\r\n best_A = BK_ind\r\n for n in range(2,N+1):\r\n if S[n-1] == 'a':\r\n continue\r\n BK_ind += 1\r\n while BK_ind < N and S[BK_ind+1] == 'a':\r\n BK_ind += 1\r\n best_A = max(best_A,BK_ind-n+1)\r\n if BK_ind == N:\r\n break\r\n best_B = AK_ind\r\n for n in range(2,N+1):\r\n if S[n-1] == 'b':\r\n continue\r\n AK_ind += 1\r\n while AK_ind < N and S[AK_ind+1] == 'b':\r\n AK_ind += 1\r\n best_B = max(best_B,AK_ind-n+1)\r\n if AK_ind == N:\r\n break\r\n return max(best_A, best_B)\r\n \r\nprint(solve())\r\n", "n,k = map(int,input().split())\r\ns = input()\r\na,b,l = 0,0,0\r\nans=0\r\nfor i in s:\r\n if i=='a':\r\n a+=1\r\n else:\r\n b+=1\r\n\r\n if min(a,b)>k:\r\n if s[l]=='a':\r\n a-=1\r\n else:\r\n b-=1\r\n l+=1\r\n else:\r\n ans+=1\r\nprint(ans)\r\n\r\n", "def count():\r\n global ca, cb\r\n if s[r] == \"a\":\r\n ca += 1\r\n else:\r\n cb += 1\r\nn, k = map(int, input().split())\r\ns = input()\r\nl = 0\r\nr = 0\r\nsm = 0\r\nmx = 0\r\nca = 0 \r\ncb = 0\r\ncount()\r\nwhile l < n:\r\n while min(ca, cb) <= k:\r\n sm += 1\r\n r += 1\r\n if r == n:\r\n break\r\n count()\r\n if sm > mx:\r\n mx = sm\r\n if r == n:\r\n break\r\n if s[l] == \"a\":\r\n ca -= 1\r\n else:\r\n cb -= 1\r\n sm -= 1\r\n l += 1\r\nprint(mx)\r\n", "n, k = map(int, input().split())\r\ns = input()\r\nd = {'a':0,'b':0}\r\nl = 0\r\na = 0\r\nfor i in s:\r\n\td[i] += 1\r\n\tif min(d.values()) > k:\r\n\t\td[s[l]] -= 1\r\n\t\tl += 1\r\n\telse:\r\n\t\ta += 1\r\nprint(a)", "def main():\n n, k = map(int, input().split())\n s = input()\n\n maxBeauty = 0\n left = 0\n maxCount = 0\n\n for right in range(n):\n if s[right] == 'a':\n maxCount += 1\n\n while right - left + 1 - maxCount > k:\n if s[left] == 'a':\n maxCount -= 1\n left += 1\n\n maxBeauty = max(maxBeauty, right - left + 1)\n\n left = 0\n maxCount = 0\n\n for right in range(n):\n if s[right] == 'b':\n maxCount += 1\n\n while right - left + 1 - maxCount > k:\n if s[left] == 'b':\n maxCount -= 1\n left += 1\n\n maxBeauty = max(maxBeauty, right - left + 1)\n\n print(maxBeauty)\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", "from sys import stdin\r\ninput = iter(stdin.readlines()).__next__\r\n\r\nn, k = map(int, input().split())\r\nstring = input().strip()\r\n\r\np1a, p1b, p2 = 0, 0, 0\r\nmax_length = 0\r\nchanged_a, changed_b = 0, 0\r\n\r\nwhile p2 < n:\r\n if string[p2] == 'b':\r\n changed_a += 1\r\n else:\r\n changed_b += 1\r\n\r\n if changed_a > k:\r\n while True:\r\n p1a += 1\r\n if string[p1a - 1] == 'b':\r\n break\r\n changed_a -= 1\r\n\r\n if changed_b > k:\r\n while True:\r\n p1b += 1\r\n if string[p1b - 1] == 'a':\r\n break\r\n changed_b -= 1\r\n\r\n p2 += 1\r\n\r\n max_length = max(max_length, p2 - p1a, p2 - p1b)\r\n\r\nprint(max_length)\r\n", "def find_max(n,k,s,char='a'):\r\n l=0\r\n r=0\r\n num=0\r\n ans=0\r\n cnt=0\r\n while r<n:\r\n if (s[r]!=char and num<k) :\r\n cnt+=1\r\n num+=1\r\n r+=1\r\n elif s[r]==char :\r\n cnt+=1\r\n r+=1\r\n elif s[r]!=char and num>=k :\r\n ans=max(ans,cnt)\r\n if l==-1 :\r\n l+=1\r\n else:\r\n if s[l]!=char:\r\n num-=1\r\n l+=1\r\n cnt-=1\r\n ans=max(cnt,ans)\r\n return(ans)\r\n\r\n\r\nn,k=map(int,input().split())\r\ns=input()\r\nans=max(find_max(n,k,s),find_max(n,k,s,'b'))\r\n\r\nprint(ans)\r\n", "n,k = map(int,input().split()); s=input()\r\nl=0; r=0; b=0; t=k\r\nres=0\r\nwhile r<n :\r\n if s[r] == 'b' : b+=1\r\n if b<=t : res= max(res, r-l+1)\r\n while b>t :\r\n if s[l] == 'b' : b-=1\r\n l+=1\r\n r+=1\r\nl=0; r=0; a=0; t=k \r\nwhile r<n :\r\n if s[r] == 'a' : a+=1\r\n if a<=t : res= max(res, r-l+1)\r\n while a>t :\r\n if s[l] == 'a' : a-=1\r\n l+=1\r\n r+=1\r\nprint(res)", "def sol(n,k,a,e):\r\n cnt=0\r\n l=0\r\n maxl=0\r\n for i in range(n):\r\n if a[i]!=e:\r\n cnt+=1\r\n while cnt>k:\r\n if a[l]!=e:\r\n cnt-=1\r\n l+=1\r\n maxl= max(maxl, i-l+1)\r\n return maxl \r\n\r\nn,k= map(int,input().split())\r\ns= input()\r\nmaxx=0\r\nfor e in 'ab':\r\n v= sol(n,k,s,e)\r\n maxx=max(maxx,v)\r\nprint(maxx)", "n,k=map(int,input().split())\r\ns=input()\r\nm=0\r\nc=0\r\nj=0\r\nfor i in range(n):\r\n if(s[i]=='a'):\r\n c+=1\r\n while(c>k):\r\n if(s[j]=='a'):\r\n c-=1\r\n j+=1\r\n m=max(i-j+1,m)\r\nc=0\r\nj=0\r\nfor i in range(n):\r\n if(s[i]=='b'):\r\n c+=1\r\n while(c>k):\r\n if(s[j]=='b'):\r\n c-=1\r\n j+=1\r\n m=max(i-j+1,m)\r\nprint(m)\r\n", "from collections import defaultdict\r\nimport heapq\r\n\r\ndef solve(char,k):\r\n start=0\r\n end=0\r\n ans=0\r\n while(end<n):\r\n if(s[end]==char):\r\n end+=1\r\n ans=max(ans,end-start)\r\n else:\r\n if(k>0):\r\n end+=1\r\n k-=1\r\n ans=max(ans,end-start)\r\n else:\r\n while(start<end and s[start]==char):\r\n start+=1\r\n start+=1\r\n ans=max(ans,end-start+1)\r\n end+=1\r\n return ans\r\n \r\n \r\n\r\nn,k=map(int,input().split())\r\ns=input()\r\nl=list(s)\r\nans=max(solve('a',k),solve('b',k)) \r\nprint(ans)", "n, k = map(int, input().split())\ns = input()\n\nmax_len = 1\nleft = 0\ncount = [0, 0] \n\nfor right in range(n):\n count[ord(s[right]) - ord('a')] += 1\n \n while min(count) > k:\n count[ord(s[left]) - ord('a')] -= 1\n left += 1\n \n max_len = max(max_len, right - left + 1)\n\nprint(max_len)\n \t\t\t\t \t\t \t \t \t\t\t\t\t\t\t \t \t", "\n\nn,k = map(int,input().split())\ns = input()\n\n\n\nmaxim = 0\n\n\ncount = {}\ncount['b'] = 0\ncount['a'] = 0\n\n\nl = 0\nr = 0\nwhile r<n:\n if s[r]=='b' and count['b']<k:\n count['b'] +=1\n maxim = max(maxim,r-l+1)\n r+=1\n\n\n \n elif s[r]=='a':\n count['a']+=1\n maxim = max(maxim,r-l+1)\n r+=1\n\n else:\n while count['b']>=k:\n count[s[l]]-=1\n l+=1\n \n\n\ncount = {}\ncount['b'] = 0\ncount['a'] = 0\n\n\nl = 0\nr = 0\n\nwhile r<n:\n if s[r]=='a' and count['a']<k:\n count['a'] +=1\n maxim = max(maxim,r-l+1)\n r+=1\n\n\n \n elif s[r]=='b':\n count['b']+=1\n maxim = max(maxim,r-l+1)\n r+=1\n\n else:\n while count['a']>=k:\n count[s[l]]-=1\n l+=1\n \n \n\n\nprint(maxim)\n", "def max_beauty(n, k, s):\n max_beauty = 0\n left_ptr = 0\n max_count = 0\n count = {'a': 0, 'b': 0}\n\n for right_ptr in range(n):\n count[s[right_ptr]] += 1\n max_count = max(max_count, count[s[right_ptr]])\n\n while (right_ptr - left_ptr + 1 - max_count) > k:\n count[s[left_ptr]] -= 1\n left_ptr += 1\n\n max_beauty = max(max_beauty, right_ptr - left_ptr + 1)\n\n return max_beauty\n\n\nn, k = map(int, input().split())\ns = input()\n\n\nprint(max_beauty(n, k, s))\n\t\t \t\t\t\t \t \t\t\t \t\t \t\t\t\t", "from sys import stdin, stdout\r\ndef input(): return stdin.buffer.readline()\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(map(int, input().split()))\r\n\r\ndef two_pointers(elem, s):\r\n res, cnt, j = 0, 0, 0\r\n for i in range(n):\r\n if s[i] == elem:\r\n cnt += 1\r\n\r\n while j < i and cnt > k:\r\n if s[j] == elem:\r\n cnt -= 1\r\n j += 1\r\n\r\n # print(i, j, cnt)\r\n\r\n if cnt <= k:\r\n res = max(i - j + 1, res)\r\n return res\r\n\r\n\r\nn, k = mi()\r\ns = stdin.readline()\r\n\r\nprint(max(two_pointers(\"a\", s), two_pointers(\"b\", s)))", "import sys\r\nfrom collections import deque\r\n\r\ndef answer(n, k, s):\r\n #Test string of a's.\r\n addr = deque([])\r\n #fill out addr queue.\r\n for i in range(n):\r\n if s[i] =='b':\r\n addr.append(i)\r\n if len(addr) <= k:\r\n return n\r\n addr.appendleft(-1)\r\n addr.append(n)\r\n faddr = k+1 #exclusive\r\n best_size = 0\r\n while faddr < len(addr):\r\n lpos = addr[faddr-k-1] + 1\r\n rpos = addr[faddr] - 1\r\n size = (rpos - lpos) + 1\r\n best_size = max(best_size, size)\r\n faddr += 1\r\n \r\n #Test string of b's.\r\n addr = deque([])\r\n #fill out addr queue.\r\n for i in range(n):\r\n if s[i] =='a':\r\n addr.append(i)\r\n if len(addr) <= k:\r\n return n\r\n addr.appendleft(-1)\r\n addr.append(n)\r\n faddr = k+1 #exclusive\r\n while faddr < len(addr):\r\n lpos = addr[faddr-k-1] + 1\r\n rpos = addr[faddr] - 1\r\n size = (rpos - lpos) + 1\r\n best_size = max(best_size, size)\r\n faddr += 1\r\n\r\n return best_size\r\n\r\n\r\ndef main():\r\n n, k = map(int, sys.stdin.readline().split())\r\n s = sys.stdin.readline().rstrip()\r\n print(answer(n, k, s))\r\n return\r\nmain()", "from sys import stdin,stdout\r\nimport math\r\ninput=stdin.readline\r\n##def print(x='',end='\\n'):\r\n## stdout.write(str(x)+end)\r\ndef check(s,c,n,k):\r\n j,cnt,ans=0,0,0\r\n for i in range(n):\r\n cnt+=int(s[i]==c)\r\n while j<=i and cnt>k:\r\n cnt-=int(s[j]==c)\r\n j+=1\r\n \r\n ans=max(ans,i-j+1)\r\n \r\n return ans\r\n\r\n\r\ndef solve():\r\n n,k=map(int,input().split())\r\n s=input()\r\n\r\n print(max(check(s,'a',n,k),check(s,'b',n,k)))\r\n \r\n \r\n\r\n\r\ntt=1\r\n#tt=int(input())\r\nfor __ in range(tt):\r\n solve()\r\n", "def max_substring_length(n, k, s):\n max_length = 0\n count_a = 0\n count_b = 0\n l = 0\n\n for r in range(n):\n if s[r] == 'a':\n count_a += 1\n else:\n count_b += 1\n\n if min(count_a, count_b) > k:\n if s[l] == 'a':\n count_a -= 1\n else:\n count_b -= 1\n l += 1\n\n max_length = max(max_length, r - l + 1)\n\n return max_length\n\nn, k = map(int, input().split())\ns = input()\n\nresult = max_substring_length(n, k, s)\nprint(result)\n\n\t \t \t\t\t \t\t \t \t \t \t \t", "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\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 ** 5 + 7\r\n# for _ in range(int(get())):\r\n# n=int(get())\r\n# l=list(map(int,get().split()))\r\n# = map(int,get().split())\r\nn,k= map(int,get().split())\r\nd={\"a\":0,\"b\":0}\r\nl=list(get())\r\nj=0;ans=0\r\nfor i in range(n):\r\n d[l[i]]+=1\r\n if min(d.values())>k:\r\n d[l[j]]-=1\r\n j+=1\r\n else:\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\n \r\ndef vasyaString():\r\n\r\n l, r = 0, 0\r\n \r\n a_counter = 0\r\n ans = 0\r\n while r < n:\r\n \r\n if s[r] == \"a\":\r\n a_counter += 1\r\n if a_counter <= k:\r\n ans = max(ans, (r - l + 1) )\r\n \r\n while a_counter > k:\r\n if s[l] == \"a\":\r\n a_counter -= 1\r\n l += 1\r\n \r\n r += 1\r\n \r\n l, r = 0, 0\r\n \r\n b_counter = 0\r\n while r < n:\r\n \r\n if s[r] == \"b\":\r\n b_counter += 1\r\n if b_counter <= k:\r\n ans = max(ans, (r - l + 1) )\r\n \r\n while b_counter > k:\r\n if s[l] == \"b\":\r\n b_counter -= 1\r\n l += 1\r\n \r\n r += 1\r\n return ans\r\n \r\n \r\nn, k = map(int, sys.stdin.readline().split())\r\ns = input()\r\n\r\nprint(vasyaString())", "n, k = map(int, input().split())\ns = input()\nleft = 0\nmax_length = 0\nchar_count = [0, 0]\nfor right in range(n):\n char_count[ord(s[right]) - ord('a')] += 1\n while min(char_count) > k:\n char_count[ord(s[left]) - ord('a')] -= 1\n left += 1\n max_length = max(max_length, right - left + 1)\nprint(max_length)\n \t \t \t\t\t\t \t\t\t\t \t\t \t \t", "import math\r\nfrom decimal import *\r\nimport random\r\nimport sys\r\n\r\nn, k = map(int, input().split())\r\ns = str(input())\r\nL, r, no = 0,0, 0\r\nans = 0\r\nwhile(r<n):\r\n if(s[r]=='a'):\r\n no+=1\r\n if(no>k):\r\n ans = max(ans, (r)-L)\r\n while(no>k):\r\n if(s[L]=='a'):\r\n no-=1\r\n L+=1\r\n ans = max(ans, (r+1)-L)\r\n else:\r\n ans = max(ans, (r+1)-L)\r\n r+=1\r\nL, r, no = 0,0,0\r\nwhile(r<n):\r\n if(s[r]=='b'):\r\n no+=1\r\n if(no>k):\r\n ans = max(ans, (r)-L)\r\n while(no>k):\r\n if(s[L]=='b'):\r\n no-=1\r\n L+=1\r\n ans = max(ans, (r+1)-L)\r\n else:\r\n ans = max(ans, (r+1)-L)\r\n r+=1\r\nprint(ans)\r\n", "R = lambda: map(int, input().split())\r\nn, k = R()\r\ns = input()\r\ndef c2change(tc):\r\n cnt = 0\r\n j = 0\r\n res = 0\r\n for i in range(n):\r\n cnt += s[i] == tc\r\n while cnt > k:\r\n cnt -= s[j] == tc\r\n j += 1\r\n res = max(res, i - j + 1)\r\n return res\r\nprint(max(c2change('a'), c2change('b')))", "n, k = map(int, input().split())\r\ns = input()\r\n\r\nleft = right = 0\r\nmax_len = 0\r\nfreq = {'a': 0, 'b': 0}\r\n\r\nwhile right < n:\r\n freq[s[right]] += 1\r\n while right - left + 1 - max(freq.values()) > k:\r\n freq[s[left]] -= 1\r\n left += 1\r\n max_len = max(max_len, right - left + 1)\r\n right += 1\r\n\r\nprint(max_len)", "n, k = [int(i) for i in input().split()]\r\ns = input()\r\n\r\nans = 0\r\nj = 0\r\ncount_a = 0\r\ncount_b = 0\r\nfor i in range(n):\r\n while j < n: \r\n if s[j] == 'a' and min(count_a + 1, count_b) <= k:\r\n count_a += 1\r\n j += 1\r\n elif s[j] == 'b' and min(count_a, count_b + 1) <= k:\r\n count_b += 1\r\n j += 1\r\n else:\r\n break\r\n \r\n\r\n if min(count_a, count_b) <= k:\r\n ans = max(ans, j - i)\r\n if s[i] == 'a':\r\n count_a -= 1\r\n else:\r\n count_b -= 1\r\n \r\nprint(ans)", "def max_string(n,k,s):\n left = 0\n a_count = 0\n b_count = 0\n max_length = 0\n for right in range(n):\n if s[right] == 'a':\n a_count += 1 \n else:\n b_count += 1 \n \n while min(a_count,b_count) > k:\n if s[left] == 'a':\n a_count -= 1 \n else:\n b_count -= 1 \n left += 1 \n max_length = max(max_length,right-left+1)\n return max_length\n \n \n \nn,k = map(int,input().split())\ns = input()\nprint(max_string(n,k,s))\n \t\t\t\t\t \t\t\t\t\t \t \t \t \t\t\t\t \t\t \t \t", "def max_beauty(n, k, s):\n left = right = 0\n max_beauty = 0\n char_count = {'a': 0, 'b': 0}\n max_char_count = 0\n\n while right < n:\n char_count[s[right]] += 1\n max_char_count = max(max_char_count, char_count[s[right]])\n\n \n chars_to_change = (right - left + 1) - max_char_count\n\n \n while chars_to_change > k:\n char_count[s[left]] -= 1\n left += 1\n chars_to_change = (right - left + 1) - max_char_count\n\n \n max_beauty = max(max_beauty, right - left + 1)\n\n right += 1\n\n return max_beauty\n\nn, k = map(int, input().split())\ns = input()\n\nresult = max_beauty(n, k, s)\nprint(result)\n\n \t\t \t \t \t \t\t\t \t \t \t\t \t", "from math import ceil\r\ndef mlt(): return map(int, input().split())\r\n\r\n\r\nx, y = mlt()\r\ns = list(input())\r\n\r\n\r\ndef f(s, c):\r\n\r\n a = 0\r\n b = 0\r\n l = 0\r\n r = 0\r\n\r\n mx = 0\r\n while l <= r and r < x:\r\n if s[r] == c:\r\n a += 1\r\n else:\r\n b += 1\r\n if b > y:\r\n while l <= r:\r\n if s[l] == c:\r\n a -= 1\r\n l += 1\r\n else:\r\n b -= 1\r\n l += 1\r\n if b == y:\r\n break\r\n mx = max(mx, r-l+1)\r\n r += 1\r\n return mx\r\n\r\n\r\nprint(max(f(s, 'b'), f(s, 'a')))\r\n", "class MyClass:\r\n def __init__(self, s,k,n):\r\n self.s = s\r\n self.k = k\r\n self.n = n\r\n\r\n def beutyString(self,ch):\r\n left = maxLength = countOther = 0\r\n\r\n for i in range(self.n):\r\n if self.s[i] != ch: countOther+=1\r\n while(left < i and countOther > self.k):\r\n if self.s[left] != ch: countOther-=1\r\n left+=1\r\n maxLength = max(maxLength,i-left+1)\r\n return maxLength\r\n\r\n \r\nn,k = input().split()\r\ns = input()\r\n\r\nobj1 = MyClass(s,int(k),int(n))\r\na = obj1.beutyString('a')\r\nb = obj1.beutyString(\"b\")\r\nprint(max(a,b))", "def maxBeauty(n, k, s):\n maxBeauty = 0\n left = 0\n freq = [0, 0]\n for right in range(n):\n freq[ord(s[right]) - ord('a')] += 1\n currentLength = right - left + 1\n maxFreq = max(freq)\n while currentLength - maxFreq > k:\n freq[ord(s[left]) - ord('a')] -= 1\n left += 1\n currentLength -= 1\n maxFreq = max(freq)\n maxBeauty = max(maxBeauty, currentLength)\n return maxBeauty\n\nn, k = map(int, input().split())\ns = input()\n\nresult = maxBeauty(n, k, s)\nprint(result)\n\t\t \t \t\t \t\t \t \t\t\t\t \t\t\t \t \t", "n, k = map(int, input().split())\ns = input()\n\nleft = right = 0\nchar_count = [0, 0] # Store the count of 'a' and 'b' in the current substring\nmax_beauty = 0\n\nwhile right < n:\n char_count[ord(s[right]) - ord('a')] += 1\n\n while min(char_count) > k:\n char_count[ord(s[left]) - ord('a')] -= 1\n left += 1\n\n max_beauty = max(max_beauty, right - left + 1)\n\n right += 1\n\nprint(max_beauty)\n\n\t \t \t \t \t\t \t\t \t \t\t \t\t\t \t\t", "def max_beauty(n, k, s):\n max_len = 0\n max_count = 0\n count = [0, 0]\n left = 0\n\n for right in range(n):\n count[ord(s[right]) - ord('a')] += 1\n max_count = max(count)\n\n window_len = right - left + 1\n\n if window_len - max_count > k:\n count[ord(s[left]) - ord('a')] -= 1\n left += 1\n\n max_len = max(max_len, right - left + 1)\n\n return max_len\n\nn, k = map(int, input().split())\ns = input()\n\nresult = max_beauty(n, k, s)\nprint(result)\n\n\t \t\t \t \t\t \t \t\t \t\t\t \t \t\t", "n, k = map(int, input().split())\ns = input()\n\nleft = 0\ncount = [0, 0] # count[0] stores the count of 'a's, count[1] stores the count of 'b's\nmax_beauty = 0\n\nfor right in range(n):\n count[ord(s[right]) - ord('a')] += 1\n \n # If the number of characters to be changed exceeds k, move the left pointer\n while min(count[0], count[1]) > k:\n count[ord(s[left]) - ord('a')] -= 1\n left += 1\n \n max_beauty = max(max_beauty, count[0] + count[1])\n\nprint(max_beauty)\n\n\t\t\t\t\t\t \t \t \t \t \t\t \t \t", "\n\ndef solve(num, k, s, c):\n best = 0\n length = 0 \n changed = 0\n i, j = 0, 0\n while j < num:\n if s[j] != c:\n changed += 1\n while changed > k:\n if s[i] != c:\n changed -= 1\n i += 1\n j += 1\n best = max(best, j-i)\n return best\nif __name__=='__main__':\n num, k = list(map(int, input().split()))\n s = input()\n print(max(solve(num, k, s, 'a'), solve(num, k, s, 'b')))\n \t\t\t\t \t \t \t \t \t \t\t \t\t", "n,k=map(int,input().split())\ns=input()\na=0\nb=0\nj=0\nans=0\nfor i in s:\n if i<'b':\n a+=1\n else:\n b+=1\n if min(a,b)>k:\n if s[j]<'b':\n a-=1\n else:\n b-=1\n j+=1\n else:\n ans+=1\nprint(ans)\n\n\t \t \t \t\t \t \t\t \t \t \t\t\t", "n, k = map(int, input().split())\ns = input()\n\ndef max_beauty(s, target_char, k):\n left = right = max_length = changed_count = 0\n \n while right < len(s):\n if s[right] != target_char:\n changed_count += 1\n \n while changed_count > k:\n if s[left] != target_char:\n changed_count -= 1\n left += 1\n \n max_length = max(max_length, right - left + 1)\n right += 1\n \n return max_length\n\nmax_a_beauty = max_beauty(s, 'a', k)\nmax_b_beauty = max_beauty(s, 'b', k)\n\nprint(max(max_a_beauty, max_b_beauty))\n\n \t\t \t \t \t\t\t \t\t\t \t \t\t\t", "\"\"\"Эта задача хорошо решается методом двух указателей.\n\nПусть указатель на левую границу l, а на правую r. Тогда для каждой\nпозиции l будем двигать правую границу до тех пор, пока на подстроке\nslsl + 1... sr можно провести не более k операций замены, чтоб эта\nподстрока была симпатичной. Для проверки потребуется завести частотный\nсловарь размером с алфавит строки, который будем пересчитывать вместе со\nсдвигом границ.\n\nАсимптотика решения: O(n * alphabet).\n\n\"\"\"\n# import pdb\nn, k = map(int, input().split())\ns = input()\n\ncount = {\n 'a': s.count('a'),\n 'b': s.count('b'),\n}\n\nr = n\nM = 0\nl = 0\nwhile l < n:\n # Move \"r\" to left\n while count['a'] > k and count['b'] > k:\n r -= 1\n count[s[r]] -= 1\n\n # Move \"r\" to right\n # This cycle can take 1 extra letter (so check it later)\n # bbabbabbba_\n # | |\n # L R\n while r < n and (count['a'] <= k or count['b'] <= k):\n count[s[r]] += 1\n r += 1\n\n if r-l > M:\n # (here... 1 extra letter)\n if count['a'] > k and count['b'] > k:\n M = r - l - 1\n else:\n M = r - l\n\n l += 1\n count[s[l-1]] -= 1\nprint(M)\n", "n, k = map(int, input().split())\nstring = input()\n\nmax_beauty = 0\ncount_a = 0\ncount_b = 0\nleft = 0\nright = 0\n\nwhile right < n:\n if string[right] == 'a':\n count_a += 1\n else:\n count_b += 1\n \n if min(count_a, count_b) > k:\n if string[left] == 'a':\n count_a -= 1\n else:\n count_b -= 1\n left += 1\n \n max_beauty = max(max_beauty, right - left + 1)\n right += 1\n\nprint(max_beauty)\n\n\t \t \t\t\t\t\t \t\t \t \t", "n,k=map(int,input().split())\ns=input()\na,b,d,ans=0,0,0,0\nfor i in range(n):\n if s[i]=='a':\n a+=1\n else:\n b+=1\n if a<=k or b<=k:\n ans=max(ans,i+1-d)\n else:\n if s[d]=='a':\n a-=1\n else:\n b-=1\n d+=1\nprint(ans)\n \t\t\t \t \t\t \t\t\t \t \t \t\t\t \t \t", "def maxBeauty(string, k):\r\n n = len(string)\r\n max_beauty = 0\r\n\r\n # Helper function to calculate the maximum substring length of a character\r\n def maxSubstringLength(char):\r\n max_len = 0\r\n left, right = 0, 0\r\n count = 0\r\n\r\n while right < n:\r\n if string[right] != char:\r\n count += 1\r\n\r\n while count > k:\r\n if string[left] != char:\r\n count -= 1\r\n left += 1\r\n\r\n max_len = max(max_len, right - left + 1)\r\n right += 1\r\n\r\n return max_len\r\n\r\n # Calculate the maximum beauty for 'a' and 'b'\r\n max_beauty = max(maxSubstringLength('a'), maxSubstringLength('b'))\r\n\r\n return max_beauty\r\n\r\n# Example usage:\r\nn, k = map(int, input().split())\r\nstring = input()\r\nresult = maxBeauty(string, k)\r\nprint(result)\r\n", "n, limit = input().split()\n\nlimit = int(limit)\n\nstring = input()\n\nstart = 0\nn_a = 0\nn_b = 0\n\nfor letter in string:\n if letter == 'a':\n n_a += 1\n else:\n n_b += 1\n if n_a > limit and n_b > limit:\n if string[start] == 'a':\n n_a -= 1\n else:\n n_b -= 1\n start += 1\n\nprint(n_a + n_b)\n \t\t \t\t\t\t\t\t\t\t \t \t \t\t\t \t\t \t\t \t\t", "def func(A,n,k,ch):\r\n i = 0\r\n j = 0\r\n cnt = 0\r\n maxlen = 1\r\n while i < n:\r\n if A[i] != ch:\r\n cnt += 1\r\n while cnt > k:\r\n if A[j] != ch:\r\n cnt -= 1\r\n j += 1\r\n maxlen = max(maxlen,i-j+1)\r\n i = i+1\r\n return maxlen\r\n\r\n\r\nn,k = map(int,input().split())\r\nA = str(input())\r\n\r\nm1 = func(A,n,k,'a')\r\nm2 = func(A,n,k,'b')\r\nans = max(m1,m2)\r\nprint(ans)", "# cache = {}\n\n# def gcdExtended(a, b):\n# try:\n# return cache[(a, b)]\n# except:\n# pass\n\n# if a == 0:\n# return b, 0, 1\n \n# gcd, x1, y1 = gcdExtended(b % a, a)\n \n# # Update x and y using results of recursive\n# # call\n# x = y1 - (b//a) * x1\n# y = x1\n \n# cache[(a, b)] = (gcd, x, y)\n# return gcd, x, y\n\n# def gcd(a, b):\n# g, _, _ = gcdExtended(a, b)\n# return g\n\n# def lcm(a, b):\n# return int(a*b / gcd(a, b))\n\n# mod = 998244353\n\n# # # # # # # # # # # # # # # # # # # # # # # # # # # # # \nimport bisect\n\ndef intarr():\n return map(int, input().split())\n\nif __name__ == \"__main__\":\n # cases = int(input())\n cases = 1\n for _ in range(cases):\n n, k = intarr()\n string = input()\n\n vars = \"ab\"\n ans = 0\n\n for x in vars:\n cnt = 0\n j = 0\n\n for i, ch in enumerate(string):\n if ch == x:\n cnt += 1\n \n while cnt > k:\n if string[j] == x:\n cnt -= 1\n j += 1\n \n ans = max(ans, i - j + 1)\n \n print(ans)\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, k = [int(i) for i in input().split()]\r\ns = input()\r\nDict = defaultdict(int)\r\nstart = 0\r\nend = 0\r\nans = 0\r\nwhile end < n:\r\n Dict[s[end]] += 1\r\n while (k - min(Dict[\"a\"], Dict[\"b\"])) < 0:\r\n Dict[s[start]] -= 1\r\n start += 1\r\n ans = max(ans, end-start+1)\r\n end += 1\r\nprint(ans)\r\n", "n,k = list(map(int,input().split()))\r\nstring = input()\r\n\r\nl=0\r\nr=0\r\nkk=k\r\nans = 0\r\nwhile r< n:\r\n\r\n if string[r]==\"b\":\r\n kk-=1\r\n\r\n while l<r and kk<0:\r\n if string[l]==\"b\":\r\n kk+=1\r\n l+=1\r\n\r\n ans =max(r-l+1,ans)\r\n\r\n\r\n r+=1\r\n\r\n\r\nl=0\r\nr=0\r\n\r\n\r\nwhile r< n:\r\n\r\n if string[r]==\"a\":\r\n k-=1\r\n\r\n while l<r and k<0:\r\n if string[l]==\"a\":\r\n k+=1\r\n l+=1\r\n\r\n ans =max(r-l+1,ans)\r\n\r\n\r\n r+=1\r\nprint(ans)\r\n", "inputs = [int(num) for num in input().split()]\nn = inputs[0]\nk = inputs[1]\ns = input()\ni=0\nj=0\nc=0\nmax1=0\ntemp =k\nwhile(j<len(s)):\n\tif(s[j]==\"a\"):\n\t\tc+=1\n\telse:\n\t\tif(temp>0):\n\t\t\ttemp -= 1\n\t\t\tc += 1\n\t\telse:\n\t\t\twhile(s[i]!=\"b\"):\n\t\t\t\ti += 1\n\t\t\t\tc -= 1\n\t\t\ti += 1\n\tif(c>max1):\n\t\tmax1 = c\n\tj += 1\nc=0\ntemp =k\ni=0\nj=0\nwhile(j<len(s)):\n\tif(s[j]==\"b\"):\n\t\tc+=1\n\telse:\n\t\tif(temp>0):\n\t\t\ttemp -= 1\n\t\t\tc += 1\n\t\telse:\n\t\t\twhile(s[i]!=\"a\"):\n\t\t\t\ti += 1\n\t\t\t\tc -= 1\n\t\t\ti += 1\n\tif(c>max1):\n\t\tmax1 = c\n\tj += 1\nprint(max1)\n \t \t \t\t\t \t \t\t \t \t\t\t \t\t\t", "def answer(change, string):\r\n print(max(achecker(string, change), bchecker(string, change)))\r\n\r\ndef achecker(string, change):\r\n result = 0\r\n right, left = 0, 0\r\n while right < len(string):\r\n while left < right and change < 0:\r\n if string[left] == \"b\":\r\n change += 1\r\n left += 1\r\n result = max(result, right-left)\r\n if string[right] == \"b\":\r\n change -= 1\r\n right += 1\r\n while change < 0 and left < right:\r\n if string[left] == \"b\":\r\n change += 1\r\n left += 1\r\n result = max(result, right-left)\r\n return result\r\n\r\ndef bchecker(string, change):\r\n result = 0\r\n right, left = 0, 0\r\n while right < len(string):\r\n while left < right and change < 0:\r\n if string[left] == \"a\":\r\n change += 1\r\n left += 1\r\n result = max(result, right-left)\r\n if string[right] == \"a\":\r\n change -= 1\r\n right += 1\r\n while change < 0 and left < right:\r\n if string[left] == \"a\":\r\n change += 1\r\n left += 1\r\n result = max(result, right-left)\r\n return result\r\nsize, change = map(int, input().split())\r\nstring = input()\r\nanswer(change, string)", "n,k = map(int,input().split())\r\npref = [0]\r\narr = [0 for i in range(n)]\r\ns = input()\r\nfor i in range(n):\r\n\tarr[i] = ord(s[i]) - ord('a')\r\n\tpref.append(pref[-1] + arr[i])\r\n\r\n\r\ndef sat(low,ind):\r\n\tglobal k\r\n\treturn (pref[ind+1] - pref[low] <= k) or (pref[ind+1] - pref[low] >= ind - low + 1 - k)\r\n\r\n\t\t\r\ndef bs(lo, hi):\r\n\t# print(lo,hi)\r\n\tret = -1\r\n\tlow = lo\r\n\twhile lo <= hi:\r\n\t\tmid = (lo + hi) // 2\r\n\t\tif sat(low,mid):\r\n\t\t\tret = max(ret, mid)\r\n\t\t\tlo = mid + 1\r\n\t\telse:\r\n\t\t\thi = mid - 1\r\n\t# print(ret)\r\n\treturn ret\r\n\r\nans = 0\r\nfor i in range(n):\r\n\tans = max(ans, bs(i,n-1) - i + 1)\r\nprint(ans)\t", "def max_beauty_string(n, k, s):\n max_beauty = 0\n left = 0\n max_count = 0\n count = {'a': 0, 'b': 0}\n\n for right in range(n):\n count[s[right]] += 1\n max_count = max(max_count, count[s[right]])\n\n # If the number of characters to change (k) is exceeded,\n # move the left pointer and update the count of characters.\n if (right - left + 1) - max_count > k:\n count[s[left]] -= 1\n left += 1\n\n max_beauty = max(max_beauty, right - left + 1)\n\n return max_beauty\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the maximum beauty\nresult = max_beauty_string(n, k, s)\nprint(result)\n\n \t \t \t \t \t\t \t\t \t\t \t \t\t\t", "\r\nimport math \r\nimport sys\r\ndef main(s,k):\r\n\r\n\r\n count_a=[] \r\n count_b=[]\r\n\r\n for i in range(len(s)):\r\n\r\n if i==0:\r\n if s[i]=='a':\r\n count_a.append(1)\r\n count_b.append(0)\r\n else:\r\n count_a.append(0)\r\n count_b.append(1) \r\n\r\n elif s[i]=='b':\r\n count_a.append(count_a[-1])\r\n count_b.append(count_b[-1]+1)\r\n else:\r\n count_a.append(count_a[-1]+1) \r\n count_b.append(count_b[-1])\r\n \r\n ans=0\r\n for i in range(len(s)):\r\n\r\n l=i \r\n r=len(s)-1 \r\n best=-1 \r\n\r\n while l<=r:\r\n\r\n m=(l+r)//2\r\n if i==0:\r\n l_val=0 \r\n else:\r\n l_val=count_a[i-1]\r\n val_a=count_a[m]-l_val \r\n if val_a==k:\r\n l=m+1 \r\n best=m \r\n elif val_a<k:\r\n l=m+1 \r\n best=m \r\n else:\r\n r=m-1 \r\n if best!=-1:\r\n ans=max(ans,best-i+1) \r\n \r\n l=i \r\n r=len(s)-1 \r\n best=-1 \r\n\r\n while l<=r:\r\n\r\n m=(l+r)//2\r\n if i==0:\r\n l_val=0 \r\n else:\r\n l_val=count_b[i-1]\r\n val_b=count_b[m]-l_val \r\n if val_b==k:\r\n l=m+1 \r\n best=m \r\n elif val_b<k:\r\n l=m+1 \r\n best=m \r\n else:\r\n r=m-1 \r\n \r\n if best!=-1:\r\n ans=max(ans,best-i+1) \r\n return ans\r\n \r\n \r\n\r\n \r\nn,k=list(map(int,input().split()))\r\ns=input()\r\nprint(main(s,k))\r\n \r\n \r\n \r\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\n\ndef main():\n n, k = list(map(int, input().split()))\n s = input().strip()\n i = 0\n hash_map = {'a':0, \"b\":0}\n cur = 0\n left = 0\n max_ = 0\n for right in range(n):\n \n hash_map[s[right]]+=1\n while left < right and min(hash_map['a'] , hash_map['b'])> k:\n hash_map[s[left]]-=1\n left+=1\n\n max_ = max(max_, right-left+1)\n print(max_)\n\n \n\n\n\n\n \n\n\n\n\nmain()", "n, k = map(int, input().split()) # Read n and k\ns = input() # Read the string\n\nleft = right = max_beauty = 0 # Initialize pointers and variables\ncount_a = count_b = 0 # Initialize counts of 'a' and 'b' characters\n\nwhile right < n:\n if s[right] == 'a':\n count_a += 1\n else:\n count_b += 1\n \n while min(count_a, count_b) > k:\n if s[left] == 'a':\n count_a -= 1\n else:\n count_b -= 1\n left += 1\n \n max_beauty = max(max_beauty, right - left + 1)\n right += 1\n\nprint(max_beauty) # Print the maximum beauty of the string\n\n \t\t\t \t \t\t \t\t \t \t \t\t", "n, k = map(int, input().split())\ns = input()\n\nmax_beauty = 0\nleft = 0\nfreq = [0, 0] # Frequency of 'a' and 'b' in the current window\n\nfor right in range(n):\n char_idx = ord(s[right]) - ord('a') # Convert character to 0 or 1 index\n freq[char_idx] += 1\n\n while right - left + 1 - max(freq) > k:\n left_char_idx = ord(s[left]) - ord('a')\n freq[left_char_idx] -= 1\n left += 1\n\n max_beauty = max(max_beauty, right - left + 1)\n\nprint(max_beauty)\n\n \t\t \t\t\t\t\t\t\t\t \t\t\t \t \t \t", "def max_beauty(n, k, s):\n left = 0\n max_length = 0\n max_count = 0\n changes = 0\n freq = [0, 0]\n\n for right in range(n):\n char = ord(s[right]) - ord('a')\n freq[char] += 1\n max_count = max(max_count, freq[char])\n changes = (right - left + 1) - max_count\n\n while changes > k:\n freq[ord(s[left]) - ord('a')] -= 1\n left += 1\n changes = (right - left + 1) - max_count\n\n max_length = max(max_length, right - left + 1)\n\n return max_length\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\n# Calculate and print the result\nresult = max_beauty(n, k, s)\nprint(result)\n\n \t \t \t \t\t\t \t \t \t \t\t\t \t", "n, k = map(int, input().split())\ns = input()\n\ndef max_window_with_char(ch):\n left, right, max_len = 0, 0, 0\n count = 0\n while right < n:\n if s[right] == ch:\n count += 1\n while count > k:\n if s[left] == ch:\n count -= 1\n left += 1\n max_len = max(max_len, right - left + 1)\n right += 1\n return max_len\n\nprint(max(max_window_with_char('a'), max_window_with_char('b')))\n \t \t\t \t \t \t \t \t\t\t \t\t\t \t", "n,k = map(int,input().split())\nword = str(input())\n\nleft = 0\nctr1 = 0\nctr2 = 0\nans = 0\n\nfor i in range(n):\n if word[i] == 'a':\n ctr1+=1\n else:\n ctr2+=1\n\n while ctr1 > k and ctr2 > k:\n if word[left] == 'a':\n ctr1 -= 1\n else:\n ctr2 -= 1\n left += 1\n ans = max(ans,i-left+1)\nprint(ans)\n \t\t \t \t \t \t \t \t \t\t\t\t\t\t", "def max_beauty_string(s, n, k):\n left = 0 # Left pointer of the window\n max_beauty = 0 # Maximum beauty of the string\n char_count = [0, 0] # Count of characters 'a' and 'b' in the current window\n \n for right in range(n):\n char_count[ord(s[right]) - ord('a')] += 1 # Update character count\n \n # Calculate the number of characters to change within the current window\n changes_required = right - left + 1 - max(char_count)\n \n # If the required changes exceed k, shrink the window\n while changes_required > k:\n char_count[ord(s[left]) - ord('a')] -= 1\n left += 1\n changes_required = right - left + 1 - max(char_count)\n \n max_beauty = max(max_beauty, right - left + 1)\n \n return max_beauty\n\n# Input\nn, k = map(int, input().split()) # Length of the string and maximum characters to change\ns = input() # The string itself\n\nresult = max_beauty_string(s, n, k)\nprint(result)\n\n \t \t\t \t \t \t \t\t \t\t \t", "from collections import Counter\r\nn,k=map(int,input().split())\r\ns=input()\r\nc=Counter()\r\ni=0\r\nc[s[0]]+=1\r\nm=1\r\nj=1\r\nans=1\r\nwhile j<n:\r\n c[s[j]]+=1\r\n m=max(c[s[j]],m)\r\n total=j-i+1-m\r\n if total<=k:\r\n ans=max(ans,j-i+1)\r\n else :\r\n while total>k:\r\n c[s[i]]-=1\r\n i+=1\r\n m=max(c.values())\r\n total=j-i+1-m\r\n if total<=k:\r\n ans=max(ans,j-i+1)\r\n j+=1\r\nprint(ans)\r\n ", "n,k=input().split(\" \")\ns=input()\nn=int(n)\nk=int(k)\ndef find(x):\n j=c=ans=0\n for i in range(n):\n if s[i]==x:\n c+=1\n while c>k:\n if s[j]==x:\n c-=1\n j+=1\n ans=max(ans,i-j+1)\n return ans\nprint(max(find(\"a\"),find(\"b\")))\n\t \t \t \t\t \t \t \t\t\t\t\t \t \t\t\t", "def Dascroreee(n, k, s):\n max_length = 0\n left = 0\n freq=[0, 0] \n max_freq=0\n for right in range(n):\n char=ord(s[right])- ord('a')\n freq[char] += 1 \n max_freq = max(max_freq, freq[char])\n \n while (right-left + 1- max_freq) > k:\n freq[ord(s[left])-ord('a')] -= 1\n left+= 1\n max_length= max(max_length, right - left + 1)\n return max_length\n\nn, k = map(int, input().split())\ns = input()\nprint(Dascroreee(n,k,s))\n\t\t \t \t\t \t \t\t \t \t \t \t\t \t\t", "n,k=map(int,input().split())\r\ns=input()\r\na,b,diff=0,0,0\r\nl1=[[0,0]]\r\nfor i in range(n):\r\n if s[i]=='a':\r\n a+=1\r\n else:\r\n b+=1\r\n l1.append([a,b])\r\nstart,ans=0,0\r\nfor i in range(1,n+1):\r\n a1=l1[i][0]\r\n diff=min(l1[i][0]-l1[start][0],\r\n l1[i][1]-l1[start][1])\r\n while diff>k:\r\n start+=1\r\n diff=min(l1[i][0]-l1[start][0],\r\n l1[i][1]-l1[start][1])\r\n ans=max(ans,i-start)\r\nprint(ans)\r\n", "n, k = map(int, input().split())\ns = input()\n\naCount = 0\nbCount = 0\nbegin = 0\nmaxLen = 0\n\nfor i in range(n):\n if s[i] == \"a\":\n aCount += 1\n else:\n bCount += 1\n\n if aCount <= k or bCount <= k:\n maxLen = max(maxLen, i - begin + 1)\n else:\n if s[begin] == \"a\":\n aCount -= 1\n else:\n bCount -= 1\n begin += 1\n\nprint(maxLen)\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\ns=input()\r\nj=0\r\nc=0\r\nans=0\r\nfor i in range(n):\r\n if(s[i]=='a'):\r\n c+=1\r\n while(j<n and c>k):\r\n if(s[j]=='a'):\r\n c-=1\r\n j+=1\r\n ans=max(ans,i-j+1)\r\nj=0\r\nc=0\r\nfor i in range(n):\r\n if(s[i]=='b'):\r\n c+=1\r\n while(j<n and c>k):\r\n if(s[j]=='b'):\r\n c-=1\r\n j+=1\r\n ans=max(ans,i-j+1)\r\nprint(ans)", "import sys, math, collections\r\n\r\n# input = sys.stdin.readline\r\n\r\nn, k = map(int, (input().split()))\r\ns = input()\r\nans = 0\r\nl1 = l2 = 0\r\ntemp = temp2 = 0\r\n\r\nfor r in range(n):\r\n temp += s[r] == 'a'\r\n temp2 += s[r] == 'b'\r\n while temp > k:\r\n temp -= s[l1] == 'a'\r\n l1 += 1\r\n while temp2 > k:\r\n temp2 -= s[l2] == 'b'\r\n l2 += 1\r\n ans = max(ans, r-l1+1, r-l2+1)\r\n\r\nprint(ans)\r\n ", "n,k = map(int,input().split())\ns = input()\na,b = 0,0\nj = 0\nans = 0\nfor i in s:\n\tif i=='a':\n\t\ta+=1\n\telse:\n\t\tb+=1\n\tif min(a,b)>k:\n\t\tif s[j]=='a':\n\t\t\ta-=1\n\t\telse:\n\t\t\tb-=1\n\t\tj += 1\n\telse:\n\t\tans += 1\nprint(ans)", "# n,k= [int(i) for i in input().split()]\r\nn,k = map(int,input().split())\r\ns=input()\r\n\r\nab='ab'\r\nres=0\r\nfor target in ab:\r\n l=0\r\n other=0\r\n \r\n for r in range(len(s)):\r\n if s[r]!=target:\r\n other+=1 \r\n while other>k and l<=r:\r\n if s[l]!=target:\r\n other-=1\r\n l+=1\r\n \r\n res=max(res,r-l+1)\r\nprint(res)\r\n\r\n", "from turtle import right\r\n\r\n\r\ndef helper(ch, k, beauty_str):\r\n left = 0\r\n countch = 0\r\n max_ch = 0\r\n for right in range(len(beauty_str)):\r\n if beauty_str[right] != ch:\r\n countch +=1\r\n while countch > k:\r\n max_ch = max(max_ch, right - left)\r\n if beauty_str[left] != ch:\r\n countch -=1\r\n left +=1\r\n \r\n max_ch = max(max_ch, right - left + 1)\r\n \r\n return max_ch\r\n \r\n \r\ndef solve(beauty_str,k,n):\r\n return max(helper('a',k,beauty_str), helper('b',k,beauty_str))\r\n \r\n \r\n\r\nn, k = [int(i) for i in input().split()]\r\nbeauty_str = input()\r\nprint(solve(beauty_str,k,n))", "n,k = map(int,input().split())\r\ns = input()\r\n\r\nleft = 0\r\nb = 0\r\nmaxx = 1\r\n\r\nfor right in range(n):\r\n if s[right] == 'b':\r\n b += 1\r\n\r\n while b > k:\r\n if s[left] == 'b':\r\n b -= 1\r\n left += 1\r\n\r\n maxx = max(maxx,right-left+1)\r\n\r\nleft = 0\r\na = 0\r\n\r\nfor right in range(n):\r\n if s[right] == 'a':\r\n a += 1\r\n\r\n while a > k:\r\n if s[left] == 'a':\r\n a -= 1\r\n \r\n left += 1\r\n\r\n maxx = max(maxx,right-left+1)\r\n\r\nprint(maxx)\r\n", "n, k = map(int, input().split())\ns = input()\n\nmax_beauty = 0\ncount_a = 0\ncount_b = 0\nleft = 0\n\nfor right in range(n):\n if s[right] == 'a':\n count_a += 1\n else:\n count_b += 1\n \n while min(count_a, count_b) > k:\n if s[left] == 'a':\n count_a -= 1\n else:\n count_b -= 1\n left += 1\n \n max_beauty = max(max_beauty, right - left + 1)\n\nprint(max_beauty)\n#34556\n\n\t\t\t \t\t\t\t \t\t\t \t \t \t\t \t \t \t", "def max_beauty_string(t, n, k):\n max_beauty = 0\n count = [0, 0] \n left = 0\n\n for right in range(n):\n count[ord(t[right]) - ord('a')] += 1\n\n while min(count) > k:\n count[ord(t[left]) - ord('a')] -= 1\n left += 1\n\n max_beauty = max(max_beauty, right - left + 1)\n\n return max_beauty\n\ndef main():\n n, k = map(int, input().split())\n t = input()\n\n result = max_beauty_string(t, n, k)\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", "n, k = map(int, input().split())\ns = input()\n\nleft = 0 # Left pointer of the sliding window\nchar_count = [0, 0] # Count of 'a' and 'b' characters in the current window\nmax_beauty = 0 # Maximum beauty achieved\n\nfor right in range(n):\n char_count[ord(s[right]) - ord('a')] += 1\n\n while min(char_count) > k: # Shrink the window if character count exceeds k\n char_count[ord(s[left]) - ord('a')] -= 1\n left += 1\n\n max_beauty = max(max_beauty, right - left + 1)\n\nprint(max_beauty)\n\n \t \t\t \t\t\t\t\t \t\t\t\t\t \t \t\t \t", "n,k = map(int, input().split())\ns = input()\nfreq = {'a':0, 'b':0}\nfor i in s:\n freq[i] = freq[i]+1\nchar = 'b' if freq['a']>freq['b'] else 'a'\nif k>=freq[char]:\n print(n)\n exit()\ncnts=[]\ncnt = 0\nfor i in s:\n if i!=char:\n cnt += 1\n else:\n cnts.append(cnt)\n cnt=0\nif cnt != 0:\n cnts.append(cnt)\n\ncnt_eq = []\ncnt = 0\nif freq['a']==freq['b']:\n for i in s:\n if i==char:\n cnt += 1\n else:\n cnt_eq.append(cnt)\n cnt=0\n if cnt != 0:\n cnt_eq.append(cnt)\n\n\ndef max_subarr(arr,k):\n init_sum = 0\n max_sum = 0\n if k==len(arr):\n return sum(arr)\n for i in range(len(arr)):\n if i < k:\n init_sum += arr[i]\n max_sum = init_sum\n else:\n init_sum += arr[i]-arr[i-k]\n max_sum = max(max_sum, init_sum)\n return max_sum\nprint(max(max_subarr(cnts,k+1), max_subarr(cnt_eq, k+1))+k)\n", "def answer():\n\n ans=0\n\n for x in range(26):\n\n i,j,count,ch=0,0,0,chr(97 + x)\n \n while(j < n):\n \n while(count <= k):\n if(j==n):\n j+=1\n break\n\n if(a[j] != ch):count += 1\n j+=1\n\n j-=1\n \n ans=max(ans,j - i)\n \n if(a[i] != ch):count -= 1\n i,j=i+1,j+1\n\n print(ans)\n\n\nn,k=map(int,input().split())\n\na=input()\n\nanswer()\n\n \t\t \t\t\t \t\t \t\t \t\t\t \t\t", "n,k = map(int,input().split())\r\ns=input()\r\n\r\na=0\r\nres=0\r\nb=0\r\nl=0\r\n \r\nfor r in range(len(s)):\r\n if s[r]=='a':\r\n a+=1\r\n else:\r\n b+=1\r\n while min(a,b)>k and l<=r:\r\n if s[l]=='a':\r\n a-=1\r\n else:\r\n b-=1\r\n l+=1\r\n \r\n res=max(res,r-l+1)\r\nprint(res)\r\n", "n,k=map(int,input().split())\r\nst=0\r\nend=1\r\ns=input()\r\nl=[0]*(n+1)\r\nfor i in range(len(s)):\r\n l[i+1]=1 if s[i]=='a' else 0\r\n#print(l)\r\nsu=0\r\nm=0\r\nwhile(end<n+1):\r\n su+=l[end]\r\n if su>k and end-st-su>k:\r\n st+=1\r\n su-=l[st]\r\n m=max(m,st-end)\r\n end+=1\r\n #print(end,st)\r\nm=max(m,end-st-1)\r\nprint(m)\r\n ", "n, k = map(int, input().split())\r\ns = input()\r\na, b = 0, 0\r\nj = 0\r\nans = 0\r\nfor i in s:\r\n if i == 'a':\r\n a += 1\r\n else:\r\n b += 1\r\n if min(a, b) > k:\r\n if s[j] == 'a':\r\n a -= 1\r\n else:\r\n b -= 1\r\n j += 1\r\n else:\r\n ans += 1\r\nprint(ans)\r\n", "n,k = map(int,input().split())\r\ns = input()\r\nd={'a':0,'b':0}\r\nl= 0\r\na= 0\r\nfor i in s:\r\n\td[i]+=1\r\n\r\n\tif min(d.values())>k:\r\n\r\n\t\td[s[l]]-=1\r\n\t\tl+=1\r\n\telse:\r\n\t\ta+=1\r\nprint(a)\r\n", "n,k=map(int,input().split())\r\ns=(input())\r\n\r\n# s,t=input().split()\r\n# arr=list(map(int,input().split()))\r\n\r\n# for _ in range(int(input())):\r\n# n=int(input())\r\ni=0;j=0;mp={\"a\":0,\"b\":0};mx=-1\r\nwhile j<n:\r\n mp[s[j]]+=1\r\n if mp[\"a\"]<=k or mp[\"b\"]<=k:\r\n mx=max(mx,mp[\"a\"]+mp[\"b\"])\r\n j+=1\r\n else:\r\n if mp[\"a\"]>k and mp[\"b\"]>k:\r\n mp[s[i]]-=1\r\n i+=1\r\n j+=1\r\nprint(mx)", "length, maxChars = list(map(int, input().split()))\r\ngivenString = input()\r\n\r\nfora = 0\r\nchanges = maxChars\r\nleft = 0\r\ncount = 0\r\nfor i in range(length):\r\n count += givenString[i] == \"a\"\r\n if (i - left + 1) - count <= maxChars:\r\n fora = max(fora, i - left + 1)\r\n else:\r\n while left < i and (i - left + 1) - count > maxChars:\r\n count -= givenString[left] == \"a\"\r\n left += 1\r\n\r\nforb = 0\r\nchanges = maxChars\r\nleft = 0\r\ncount = 0\r\nfor i in range(length):\r\n count += givenString[i] == \"b\"\r\n if (i - left + 1) - count <= maxChars:\r\n forb = max(forb, i - left + 1)\r\n else:\r\n while left < i and (i - left + 1) - count > maxChars:\r\n count -= givenString[left] == \"b\"\r\n left += 1\r\n\r\nprint(max(fora, forb))\r\n", "n, k = map(int, input().split())\ns = input()\ndp = [0, 0]\nans = 0\n\nfor i in range(n):\n dp[ord(s[i]) - ord('a')] += 1\n if min(dp) > k:\n dp[ord(s[i - ans]) - ord('a')] -= 1\n else:\n ans += 1\n\nprint(ans)\n\n \t\t\t \t\t\t \t\t\t\t \t\t \t\t\t \t \t", "def max_beauty_string(n, k, s):\n max_beauty = 0\n window_start = 0\n a_count = 0\n b_count = 0\n\n for window_end in range(n):\n if s[window_end] == 'a':\n a_count += 1\n else:\n b_count += 1\n\n # Check if we need to shrink the window\n while min(a_count, b_count) > k:\n if s[window_start] == 'a':\n a_count -= 1\n else:\n b_count -= 1\n window_start += 1\n\n max_beauty = max(max_beauty, window_end - window_start + 1)\n\n return max_beauty\n\n# Read input\nn, k = map(int, input().split())\ns = input()\n\nresult = max_beauty_string(n, k, s)\nprint(result)\n\n \t\t\t\t \t \t\t\t \t\t\t \t \t", "n, m = map(int, input().split())\r\ns = input()\r\nj = 0\r\nans = 0\r\nd = {\"a\": 0, \"b\": 0}\r\na = 0\r\nfor i in s:\r\n d[i] += 1\r\n a +=1\r\n if min(d.values()) > m:\r\n d[s[j]] -= 1\r\n j += 1\r\n else:\r\n ans= max(ans, a - j )\r\nprint(ans)\r\n", "def main():\n _, k = map(int, input().split())\n s = input()\n\n def longest(s, k):\n l = r = f = 0\n res = 0\n while r < len(s):\n if s[r] == 'a': res = max(res, r - l + 1)\n elif f < k:\n f += 1\n res = max(res, r - l + 1)\n else:\n while s[l] == 'a': l += 1\n l += 1\n f = k\n res = max(res, r - l + 1)\n r += 1\n return res\n\n t = str.maketrans('ab', 'ba')\n s2 = s.translate(t)\n print(max(longest(s, k), longest(s2, k)))\n\nmain()\n\n\t\t \t \t\t\t \t \t\t\t\t", "def find(s, n, k, constant):\r\n pref = [0]\r\n for x in s:\r\n if x==constant:\r\n pref.append(pref[-1]+1)\r\n else:\r\n pref.append(pref[-1])\r\n i, j = 1, 1\r\n ans = 0\r\n while i<=n and j<=n:\r\n nbs = pref[j] - pref[i-1]\r\n if nbs<=k:\r\n ans = max(ans, j-i+1)\r\n j += 1\r\n else:\r\n i += 1\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\ns = input()\r\nif k==0:\r\n ans = 0\r\n cnt = 1\r\n for i in range(1, len(s)):\r\n if s[i]==s[i-1]:\r\n cnt += 1\r\n else:\r\n ans = max(ans, cnt)\r\n cnt = 1\r\n ans = max(ans, cnt)\r\n print(ans)\r\nelse:\r\n ans = find(s, n, k, 'b')\r\n ans = max(ans, find(s, n, k, 'a'))\r\n print(ans)\r\n \r\n", "n, k = map(int, input().split())\ns = input()\n\nmax_beauty = 0\ncount = [0, 0]\nleft = 0\n\nfor right in range(n):\n count[ord(s[right]) - ord('a')] += 1\n \n while min(count) > k:\n count[ord(s[left]) - ord('a')] -= 1\n left += 1\n \n max_beauty = max(max_beauty, right - left + 1)\n\nprint(max_beauty)\n\n \t\t\t \t \t\t\t \t \t \t\t \t\t \t", "def maximum_beauty(n, k, s):\n max_beauty = 0\n max_count = 0\n left = 0\n count = [0] * 2\n\n for right in range(n):\n count[ord(s[right]) - ord('a')] += 1\n max_count = max(max_count, max(count))\n\n if (right - left + 1) - max_count > k:\n count[ord(s[left]) - ord('a')] -= 1\n left += 1\n\n max_beauty = max(max_beauty, right - left + 1)\n\n return max_beauty\n\ndef main():\n n, k = map(int, input().split())\n s = input()\n\n result = maximum_beauty(n, k, s)\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", "n, k = map(int, input().split())\ns = input()\nlp = rp = max_len = 0\ndata = [0, 0]\nwhile rp < n:\n while min(data) <= k:\n if s[rp] == 'a':\n data[0] += 1\n else:\n data[1] += 1\n if min(data) <= k:\n max_len = max(max_len, sum(data))\n if min(data) > k:\n break\n rp += 1\n if rp == n:\n max_len = max(max_len, sum(data))\n break\n while min(data) > k:\n if s[lp] == 'a':\n data[0] -= 1\n else:\n data[1] -= 1\n lp += 1\n rp += 1\nprint(max_len)\n", "# Wadea #\r\n \r\nn,k = map(int,input().split())\r\narr = list(input())\r\nr = 0\r\nl = 0\r\na = 0\r\nans = 0\r\nwhile r < n:\r\n if arr[r] == \"a\":\r\n a += 1\r\n if a <= k:\r\n ans = max(ans,(r-l+1))\r\n while a > k:\r\n if arr[l] == \"a\":\r\n a -= 1\r\n l += 1\r\n r += 1\r\nr = 0\r\nb = 0\r\nl = 0\r\nwhile r < n:\r\n if arr[r] == \"b\":\r\n b += 1\r\n if b <= k:\r\n ans = max(ans,r-l+1)\r\n while b > k:\r\n if arr[l] == \"b\":\r\n b -= 1\r\n l += 1\r\n r += 1\r\nprint(ans)\r\n", "n, k = map(int, input().split())\na = input().strip()\n\nlength = 0\n\nlo = 0\ncost = 0\nfor hi in range(n):\n if a[hi] == 'b':\n cost += 1\n\n if cost > k:\n while lo <= hi and cost > k:\n if a[lo] == 'b':\n cost -= 1\n lo += 1\n\n length = max(length, hi - lo + 1)\n\nlo = 0\ncost = 0\nfor hi in range(n):\n if a[hi] == 'a':\n cost += 1\n\n if cost > k:\n while lo <= hi and cost > k:\n if a[lo] == 'a':\n cost -= 1\n lo += 1\n\n length = max(length, hi - lo + 1)\n\nprint(length)\n", "def maximize_beauty(n, k, s):\n max_beauty = 0 \n \n for char in ('a', 'b'):\n left = 0 # Left pointer of the window\n count = 0 \n \n for right in range(n):\n if s[right] != char:\n count += 1\n \n while count > k:\n if s[left] != char:\n count -= 1\n left += 1\n \n max_beauty = max(max_beauty, right - left + 1)\n \n return max_beauty\n\nn, k = map(int, input().split())\ns = input()\n\nresult = maximize_beauty(n, k, s)\nprint(result)\n\n\t\t \t \t \t\t\t\t\t \t \t\t \t\t\t", "n, k = map(int, input().split())\ns = input()\n\nleft = 0\nmax_beauty = 0\na_count = 0\nb_count = 0\n\nfor right in range(n):\n if s[right] == 'a':\n a_count += 1\n else:\n b_count += 1\n\n while min(a_count, b_count) > k:\n if s[left] == 'a':\n a_count -= 1\n else:\n b_count -= 1\n left += 1\n\n max_beauty = max(max_beauty, a_count + b_count)\n\nprint(max_beauty)\n\n \t \t\t\t\t\t\t\t\t \t \t \t \t \t\t \t\t", "n,k = map(int,input().split())\r\nstring = input()\r\nans = 0\r\nfor ch in (\"a\",\"b\"):\r\n val = k\r\n start,end = 0,0\r\n count =0\r\n while start<n:\r\n if ch!=string[start]:\r\n val-=1\r\n while val<0:\r\n if string[end]!=ch:\r\n val+=1\r\n end+=1\r\n ans = max(ans,start-end+1)\r\n start+=1\r\nprint(ans)\r\n\r\n \r\n\r\n \r\n", "from collections import defaultdict, deque\r\nimport heapq\r\nimport sys\r\nimport threading\r\n\r\n\r\ndef solve(ch, n, k ,s):\r\n\r\n # # to a\r\n ans = 1\r\n j, c= 0, 0\r\n for i in range(n):\r\n if s[i] ==ch:\r\n c +=1\r\n if c > k:\r\n while c>k:\r\n if s[j]==ch:\r\n c -=1\r\n j += 1\r\n\r\n ans = max(ans, (i-j+1))\r\n\r\n # # to b\r\n # j, c, ans2= 0, 0, 1\r\n # for m in range(n):\r\n # if s[m] =='a':\r\n # c +=1\r\n # if c > k:\r\n # while c > k:\r\n # if s[j] =='a':\r\n # c -=1\r\n # j += 1\r\n # ans2 = max(ans2, (m - j )+ 1)\r\n return ans\r\n\r\n\r\n\r\n\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 main():\r\n n, k = invr()\r\n s = input()\r\n print(max(solve('a', n, k, s),solve('b', n, k, s)))\r\n\r\nthreading.stack_size(1 << 27)\r\nsys.setrecursionlimit(1 << 30)\r\nmain_thread = threading.Thread(target=main)\r\nmain_thread.start()\r\nmain_thread.join()", "def main():\n n, k = map(int, input().split())\n s = input()\n\n max_beauty = 0\n left = 0\n counts = [0, 0] # counts[0] for 'a', counts[1] for 'b'\n\n for right in range(n):\n counts[ord(s[right]) - ord('a')] += 1\n\n while min(counts[0], counts[1]) > k:\n counts[ord(s[left]) - ord('a')] -= 1\n left += 1\n\n max_beauty = max(max_beauty, right - left + 1)\n\n print(max_beauty)\n\nif __name__ == \"__main__\":\n main()\n\n\t \t\t \t \t \t \t \t\t", "n,k=list(map(int,input().split()))\r\nst=input()\r\nmaximum=1\r\nfor a in ['a','b']:\r\n l=0\r\n r=0\r\n s=1 if st[l]!=a else 0\r\n\r\n while l<n:\r\n\r\n if s<=k:\r\n r+=1\r\n if r==n:\r\n break\r\n if st[r]!=a:\r\n s+=1\r\n else:\r\n l+=1\r\n if st[l-1]!=a:\r\n s-=1\r\n if s<=k:\r\n maximum = max(r - l + 1, maximum)\r\n\r\n\r\nprint(maximum)", "n,k = map(int,input().split())\ns = input()\na,b,d,ans = 0,0,0,0\nfor i in range(n):\n if s[i] =='a':\n a+=1\n else:\n b+=1\n if a<=k or b<=k:\n ans = max(ans,i+1-d)\n else:\n if s[d] =='a':\n a -=1\n else:\n b -=1\n d +=1\nprint(ans)\n\n \t\t \t\t\t\t \t\t\t\t \t\t \t \t\t \t \t \t\t", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Vasya and String\"\r\n# Class: C\r\n\r\nimport sys\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, k = list(map(int, input().split()))\r\n s = input().strip()\r\n a = 0 ; b = 0 ; l = 0 ; r = 0 ; length = 0 ; z = 0\r\n for r in range(n):\r\n if s[r]==\"a\": a+=1\r\n else: b+=1\r\n length+=1\r\n while min(a, b)>k:\r\n if s[l]==\"a\": a -= 1\r\n else: b -= 1\r\n l += 1 ; length -= 1\r\n z = max(z, length)\r\n \r\n print(z)\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "n, m = input().split(' ')\r\nn, m = int(n), int(m)\r\nans = 0\r\ns = input()\r\nfor i in range(2):\r\n left, used = 0, 0\r\n for right in range(n):\r\n if ord(s[right]) != ord('a') + i:\r\n used += 1\r\n while used > m:\r\n if ord(s[left]) != ord('a') + i:\r\n used -= 1\r\n left += 1\r\n ans = max(ans, right - left + 1)\r\nprint(ans)", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef msi(): return map(str,input().split())\r\ndef li(): return list(mi())\r\n\r\nn,k=mi()\r\ns=si()\r\ncnt={'a':0,'b':0}\r\npre,ans=0,0\r\n\r\nfor i in range(n):\r\n cnt[s[i]]+=1\r\n \r\n if min(list(cnt.values()))>k:\r\n cnt[s[pre]]-=1\r\n pre+=1\r\n \r\n else:\r\n ans+=1\r\n \r\nprint(ans)\r\n ", "def max_beauty(n, k, s):\n max_length = 0\n max_count = 0\n char_count = [0, 0] \n left = 0\n for right in range(n):\n char_count [ord(s[right]) - ord('a')] += 1\n max_count = max(max_count, char_count [0], char_count [1])\n window_length = right - left + 1\n if window_length - max_count > k:\n char_count [ord(s[left])- ord('a')]-=1\n left += 1\n max_length = max(max_length, right - left + 1)\n return max_length\nn, k = map(int, input().split())\ns = input ()\nresult = max_beauty(n, k, s)\nprint (result)\n \t\t \t \t\t \t \t\t\t\t\t \t \t \t", "n,k=map(int,input().split())\r\ns=input()\r\ndp=[[0,0]for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n dp[i][0]+=dp[i-1][0]+(s[i-1]=='a')\r\n dp[i][1]+=dp[i-1][1]+(s[i-1]=='b')\r\ndp+=[int(1e10),int(1e10)]\r\nmx=0\r\nfor i in range(n):\r\n l=i-1\r\n r=n\r\n while l+1<r:\r\n mid=l+r>>1\r\n if dp[mid+1][0]-dp[i][0]>k:r=mid\r\n else:l=mid\r\n mx=max(l-i+1,mx)\r\n l=i-1\r\n r=n\r\n while l+1<r:\r\n mid=l+r>>1\r\n if dp[mid+1][1]-dp[i][1]>k:r=mid\r\n else:l=mid\r\n mx=max(l-i+1,mx)\r\nprint(mx)\r\n\r\n", "from collections import deque as dq\n\nn, k = map(int,input().split())\n\ns = input()\na = dq()\nb = dq()\n\nsa = -1\nsb = -1\nans = 0\n\nfor i in range(n): \n if s[i] == 'a': \n a.append(i)\n if len(a) > k: \n val = a.popleft()\n sb = val\n else: \n b.append(i)\n if len(b) > k: \n val = b.popleft() \n sa = val\n\n ans = max(ans, i-sa, i-sb)\n\nprint(ans)" ]

[ "from sys import stdin,stdout\r\nn,k = map(int,stdin.readline().split())\r\n\r\n#Nhap du lieu\r\na = list(map(int,stdin.readline().split()))\r\npref = [0]*(n+5)\r\npref[0] = a[0];\r\nfor i in range(1,n):\r\n\tpref[i] = pref[i-1] + a[i]\r\n#pref[i] la tong cua day a[1 -> i]\r\n#Xu li\r\n#Xet tat ca cac day a[i -> j] (j-i+1 >= k and j <= n) \r\n# k <= n - i + 1 <=> i <= n - k +1\r\n# j >= k+i - 1\r\nans = 0\r\nfor i in range(0,n-k+1):\r\n\tfor j in range(i+k-1,n):\r\n\t\tsum = pref[j] - pref[i] + a[i];\r\n\t\tans = max(ans, sum/(j-i+1))\r\nstdout.write(str(ans))", "\r\nrd = lambda: list(map(int, input().split()))\r\nn, k = rd()\r\na = rd()\r\nr = 0\r\ns = [0]\r\nfor x in a:\r\n s.append(s[-1] + x)\r\nfor i in range(n - k + 1):\r\n for j in range(i + k, min(n + 1, i + 2 * k)):\r\n r = max(r, (s[j] - s[i]) / (j - i))\r\nprint(r)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn,k = map(int,input().split())\r\na = [0] + list(map(int,input().split()))\r\nd = [0]*(n+1)\r\n\r\nfor i in range(1,n+1):\r\n d[i] = d[i-1] + a[i]\r\nTotal = d[n]\r\nans = -1e9\r\nfor i in range(k,n+1):\r\n if i-k>=0:\r\n for j in range(k,n+1):\r\n ans = max(ans,(d[i]-d[i-j])/j)\r\nprint(ans)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\n\r\np = []\r\n\r\na = [float(x) for x in input().split()]\r\np.append(int(0))\r\nfor i in range(1,len(a)+1):\r\n p.append(p[i-1]+a[i-1])\r\nmx = float(0)\r\nfor i in range(k, n+1):\r\n for j in range(0,n-i+1):\r\n cur = float((p[j+i] - p[j]) / float(i))\r\n mx = max(cur,mx)\r\nprint(mx)\r\n\r\n\r\n", "from sys import stdin\r\na,b=map(int,stdin.readline().split())\r\nc=list(map(int,stdin.readline().split()));ans=0\r\np=[0]\r\nfor i in range(a):p+=[p[-1]+c[i]]\r\nfor i in range(1,a-b+2):\r\n for j in range(b+i-1,a+1):ans=max(ans,(p[j]-p[i-1])/(j-i+1))\r\nprint(ans)", "from sys import stdin,stdout\r\nn,k = map(int,stdin.readline().split())\r\na = list(map(int,stdin.readline().split()))\r\npref = [0]*(n+5)\r\npref[0] = a[0];\r\nfor i in range(1,n):\r\n\tpref[i] = pref[i-1] + a[i]\r\nans = 0\r\nfor i in range(0,n-k+1):\r\n\tfor j in range(i+k-1,n):\r\n\t\tsum = pref[j] - pref[i] + a[i];\r\n\t\tans = max(ans, sum/(j-i+1))\r\nstdout.write(str(ans))", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ns = 0\r\nl = [0] + l\r\nfor i in range(n + 1):\r\n s += l[i]\r\n l[i] = s\r\n\r\ni = 0\r\nm = 0\r\nwhile i < n - k + 1:\r\n j = i + k\r\n while j <= min(n, i + 1 + 2 * k):\r\n t = l[j] - l[i]\r\n m = max(m, t / (j - i))\r\n j += 1\r\n i += 1\r\nprint(str(m))", "n,k = map(int, input().split())\nA = list(map(int, input().split()))\n\nfrom itertools import accumulate\nC = [0]+A\nC = list(accumulate(C))\n#print(C)\n\nans = -1\nfor i in range(n+1):\n if i+k > n:\n break\n for j in range(i+k, n+1):\n temp = (C[j]-C[i])/(j-i)\n ans = max(ans, temp)\nprint(ans)\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\np_a = [0, arr[0]]\r\nfor i in range(1, len(arr)):\r\n p_a.append(p_a[-1] + arr[i])\r\nmaxx = 0\r\nwhile k <= n:\r\n for i in range(n + 1 - k):\r\n t = (p_a[i + k] - p_a[i]) / k\r\n if t > maxx:\r\n maxx = t\r\n k += 1\r\nprint(maxx)\r\n", "def mp():return map(int,input().split())\r\ndef it():return int(input())\r\n\r\nn,k=mp()\r\nl=list(mp())\r\nans=0\r\nfor i in range(n):\r\n\tavg,count=0,0\r\n\tfor j in range(i,n):\r\n\t\tcount+=l[j]\r\n\t\tif j-i+1>=k:\r\n\t\t\tavg=count/(j-i+1)\r\n\t\tans=max(avg,ans)\r\nprint(ans)\r\n", "def max_heat_intensity(n, k, temperatures):\r\n arr = [0] * (n + 1)\r\n ans = 0.0\r\n\r\n for i in range(1, n + 1):\r\n arr[i] = arr[i - 1] + temperatures[i - 1]\r\n\r\n for i in range(k, n + 1):\r\n for j in range(i, n + 1):\r\n avg = (arr[j] - arr[j - i]) / i\r\n ans = max(avg, ans)\r\n\r\n return ans\r\n\r\nwhile True:\r\n try:\r\n n, k = map(int, input().split())\r\n temperatures = list(map(int, input().split()))\r\n\r\n result = max_heat_intensity(n, k, temperatures)\r\n print(f\"{result:.15f}\")\r\n\r\n except EOFError:\r\n break", "from itertools import accumulate\n\nn, k = map(int, input().split())\na = (0,) + tuple(map(int, input().split()))\n\nacc_map = tuple(accumulate(a, int.__add__))\n\noutput = 0\nfor period_length in range(k, n + 1):\n for period_start in range(0, n - period_length + 1):\n output = max(output, (acc_map[period_start + period_length] - acc_map[period_start]) / period_length)\n\nprint(output)\n# 1 2 3 4\n", "def main():\r\n n, k = map(int, input().split())\r\n temperatures = list(map(int, input().split()))\r\n\r\n def check(avg, k, n, temperatures):\r\n min_prefix_sum = 0\r\n cur_sum = 0\r\n for i in range(k):\r\n cur_sum += temperatures[i] - avg\r\n \r\n if cur_sum >= 0:\r\n return True\r\n\r\n for i in range(k, n):\r\n cur_sum += temperatures[i] - avg\r\n min_prefix_sum += temperatures[i - k] - avg\r\n if min_prefix_sum < 0:\r\n cur_sum -= min_prefix_sum\r\n min_prefix_sum = 0\r\n \r\n if cur_sum >= 0:\r\n return True\r\n \r\n return False\r\n\r\n def calculate_heat_intensity(n, k, temperatures):\r\n lower, upper = min(temperatures), max(temperatures)\r\n while upper - lower > 1e-9:\r\n mid = (lower + upper) / 2\r\n if check(mid, k, n, temperatures):\r\n lower = mid\r\n else:\r\n upper = mid\r\n\r\n return lower\r\n\r\n heat_intensity = calculate_heat_intensity(n, k, temperatures)\r\n print(f\"{heat_intensity:.15f}\")\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\nimport os\r\nfrom math import*\r\n\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nans=0\r\nfor i in range(n-k+1):\r\n\tvar=sum(arr[i:i+k])-arr[i+k-1]\r\n\tfor j in range(i+k-1,n):\r\n\t\tvar+=arr[j]\r\n\t\tvar1=var/(j-i+1)\r\n\t\tif ans<var1:\r\n\t\t\tans=var1\r\n\t\t#print(var1,ans)\r\nprint(ans)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n cum = [0]\r\n for a in A:\r\n cum.append(cum[-1] + a)\r\n max_ = 0\r\n for l in range(n):\r\n for r in range(l + k, n + 1):\r\n max_ = max(max_, (cum[r] - cum[l]) / (r - l))\r\n print(max_)\r\n \r\nfor _ in range(1):\r\n main()", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nm = -10000\r\nwhile i < len(l):\r\n j = i\r\n x = 1\r\n som = 0\r\n while j < len(l):\r\n if x < k:\r\n som += l[j]\r\n x = x + 1\r\n j = j + 1\r\n continue\r\n\r\n else:\r\n som += l[j]\r\n av = som/(j-i+1)\r\n if av > m:\r\n m = av\r\n\r\n j = j+1\r\n\r\n i += 1\r\n\r\nprint(m)", "#=============================================================================\r\n# @abhi_admin FB UserId: abhiavisekkr Email Id: [email protected]\r\n#=============================================================================\r\n#------------------------------Dependencies-----------------------------------\r\n#import sys\r\n#import math\r\n#import cmath\r\n#import array\r\n#import string\r\n#import functools #for .reduce()\r\n#import itertools \r\n\r\n\r\n#def get_s(): return sys.stdin.readline().strip() \r\n#def get_i(): return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\n#=============================================================================\r\n#----------------------------Keep-Calm-and-Code-------------------------------\r\n#=============================================================================\r\n\r\n\r\n\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nrsum = [0]\r\nmaxx = 0.0\r\n\r\nfor i in range(n): rsum.append(rsum[-1] + arr[i])\r\n#print(rsum)\r\n\r\nfor ki in range(k, n+1):\r\n for i in range(n-ki+1):\r\n tot = 0\r\n #print(i+ki, i)\r\n avg = (rsum[i+ki] - rsum[i])/ki\r\n #print(avg)\r\n maxx = max(maxx, avg)\r\nprint(maxx)\r\n\r\n\r\n\r\n#=============================================================================\r\n#-----------------------------ADMIN-ABHI-SHAKE--------------------------------\r\n#=============================================================================", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nif k==1:print(max(arr))\r\nelse:\r\n pref=[0]*n;pref[0]=arr[0]\r\n for i in range(1,n):pref[i]=pref[i-1]+arr[i]\r\n ans=0\r\n for i in range(k,n+1):\r\n for j in range(i-1,n):\r\n summ=pref[j]\r\n if j>=i:summ-=pref[j-i]\r\n ans=max(ans,summ/i)\r\n print(ans)\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\nd = {}\r\npref = [0]\r\nfor i in range(n):\r\n pref.append(pref[-1] + a[i])\r\nfor sc in range(k, n + 1):\r\n mx = 0\r\n for j in range(0, n - sc + 1):\r\n mx = max(mx, pref[j + sc] - pref[j])\r\n d[sc] = mx\r\nans = 0\r\nfor i, j in d.items():\r\n ans = max(ans, j / i)\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n S = 0\r\n for j in range(i, n):\r\n S += a[j]\r\n if j - i + 1 >= k:\r\n ans = max(ans, S / (j-i+1))\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\nfor i in range(1,n):\r\n a[i]+=a[i-1]\r\nfor i in range(k,n+1):\r\n for j in range(n-i+1):\r\n if j-1>=0:\r\n res=(a[j+i-1]-a[j-1])/i\r\n else:\r\n res=a[j+i-1]/i\r\n ans=max(ans,res)\r\nprint(ans)", "from itertools import accumulate\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(accumulate([0, *map(int, input().split())]))\r\nans = 0\r\nfor i in range(k, n + 1):\r\n for j in range(i - k + 1):\r\n ans = max(ans, (a[i] - a[j]) / (i - j))\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\navg=0\r\nfor i in range(n-k+1):\r\n\ts=sum(arr[i:i+k-1])\r\n\tfor j in range(k,n-i+1):\r\n\t\ts+=arr[i+j-1]\r\n\t\tif(s/j>avg):\r\n\t\t\tavg=s/j\r\nprint(avg)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n# sys.setrecursionlimit(400000)\r\ndef I(): return input().strip()\r\ndef II(): return int(input().strip())\r\ndef LI(): return [*map(int, input().strip().split())]\r\nimport copy, string, math, time, functools, random, fractions\r\nfrom heapq import heappush, heappop, heapify\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\n# from itertools import permutations, combinations, groupby\r\nfrom operator import itemgetter\r\nimport itertools\r\n\r\nfor _ in range(1):\r\n n,k = LI()\r\n l = LI()\r\n z = -1\r\n for i in range(n):\r\n sum = 0\r\n for j in range(i,n):\r\n sum += l[j]\r\n if j-i+1>=k:\r\n if float(sum)/(float(j-i+1))>z:\r\n z = float(sum)/float((j-i+1))\r\n print(z)\r\n", "import sys\r\nimport math\r\nimport collections\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 ans=0\r\n for i in range(n):\r\n val=arr[i]\r\n c=1\r\n sol=0\r\n if c >= k:\r\n sol = max(sol, val / c)\r\n for j in range(i+1,n):\r\n val+=arr[j]\r\n c+=1\r\n if c>=k:\r\n sol=max(sol,val/c)\r\n ans=max(sol,ans)\r\n print(ans)", "n, k = map(int, input().split())\r\nd = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n s = 0\r\n for j in range(i, n):\r\n s += d[j]\r\n if j - i + 1 < k:continue\r\n ans = max(s / (j - i + 1), ans)\r\nprint('{0:.6f}'.format(ans))\r\n\r\n \r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(len(a)):\r\n if i == 0 : b.append(a[i])\r\n else:\r\n b.append(b[-1]+a[i])\r\n\r\nnax = 0\r\nfor i in range(len(a)):\r\n if i + k - 1 > len(a)-1 : break\r\n for j in range(i+k-1,len(a)):\r\n nax = max(nax,(b[j]-b[i]+a[i])/(j-i+1))\r\n\r\nprint(nax)\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nfor i in range(1, n + 1):\r\n a[i] += a[i - 1]\r\nans = 0\r\nfor i in range(k, n + 1):\r\n for j in range(n - i + 1):\r\n ans = max(ans, (a[i + j] - a[j]) / i)\r\nprint(ans)", "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\n'''c'''\r\nn,K=rm()\r\na=rl()\r\nmaxi=0\r\nfor k in range(K,n+1):\r\n indpSum=sum(a[:k])\r\n maxi=max(indpSum/k,maxi)\r\n for i in range(k,n):\r\n indpSum=indpSum+a[i]-a[i-k]\r\n maxi=max(maxi,indpSum/k)\r\nprint(maxi)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nresult = 0\r\nfor i in range(n):\r\n s = sum(a[i : i + k])\r\n l = k\r\n result = max(result, s / l)\r\n for j in range(i + k, min(n, i + 2 * k)):\r\n s += a[j]\r\n l += 1\r\n result = max(result, s / l)\r\nprint(result)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\narr = [0] + arr\r\nfor i in range(len(arr)):\r\n if i > 0:\r\n arr[i] = arr[i] + arr[i - 1]\r\ni = 0\r\na = 0\r\nwhile i < len(arr) - k:\r\n j = k + i\r\n while j <= min(n,(i + 2 * k)):\r\n a = max(a,(arr[j] - arr[i])/(j - i))\r\n j += 1\r\n i += 1\r\nprint(a)", "import random\r\nimport sys\r\nfrom math import inf\r\nfrom typing import Callable\r\n\r\n\r\n# sys.setrecursionlimit(10**8)设置最大递归次数\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n self.seed = random.randint(0, 10 ** 9 + 7)\r\n self.dct = dict()\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 @staticmethod\r\n def ceil(a, b):\r\n return a // b + int(a % b != 0)\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 def add(self, x, cnt=1):\r\n self.dct[x ^ self.seed] = self.dct.get(x ^ self.seed, 0) + cnt\r\n return\r\n\r\n def rem(self, x, cnt=1):\r\n self.dct[x ^ self.seed] -= cnt\r\n return\r\n\r\n\r\nclass BinarySearch:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def find_int_left(low: int, high: int, check: Callable) -> int:\r\n # 模板: 整数范围内二分查找，选择最靠左满足check\r\n while low < high - 1:\r\n mid = low + (high - low) // 2\r\n if check(mid):\r\n high = mid\r\n else:\r\n low = mid\r\n return low if check(low) else high\r\n\r\n @staticmethod\r\n def find_int_right(low: int, high: int, check: Callable) -> int:\r\n # 模板: 整数范围内二分查找，选择最靠右满足check\r\n while low < high - 1:\r\n mid = low + (high - low) // 2\r\n if check(mid):\r\n low = mid\r\n else:\r\n high = mid\r\n return high if check(high) else low\r\n\r\n @staticmethod\r\n def find_float_left(low: float, high: float, check: Callable, error=1e-6) -> float:\r\n # 模板: 浮点数范围内二分查找, 选择最靠左满足check\r\n while low < high - error:\r\n mid = low + (high - low) / 2\r\n if check(mid):\r\n high = mid\r\n else:\r\n low = mid\r\n return low if check(low) else high\r\n\r\n @staticmethod\r\n def find_float_right(low: float, high: float, check: Callable, error=1e-6) -> float:\r\n # 模板: 浮点数范围内二分查找, 选择最靠右满足check\r\n while low < high - error:\r\n mid = low + (high - low) / 2\r\n if check(mid):\r\n low = mid\r\n else:\r\n high = mid\r\n return high if check(high) else low\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n, k = ac.read_ints()\r\n nums = ac.read_list_ints()\r\n\r\n def check(x):\r\n pre = [0]*(n+1)\r\n floor = inf\r\n j = 0\r\n for i in range(n):\r\n pre[i+1] = pre[i] + nums[i]\r\n cur = pre[i+1] - x*(i+1)\r\n while j <= i-k+1:\r\n y = pre[j] - x*j\r\n if y < floor:\r\n floor = y\r\n j += 1\r\n if cur >= floor:\r\n return True\r\n return False\r\n ac.st(BinarySearch().find_float_right(0, max(nums), check, error=1e-8))\r\n return\r\n\r\n\r\nSolution().main()\r\n", "# https://codeforces.com/contest/1003\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\npref_sum = [0] * (n + 1)\nfor i in range(n):\n pref_sum[i + 1] = pref_sum[i] + a[i]\n\nans = 0\nfor d in range(k, n + 1):\n for i in range(0, n + 1 - d):\n ans = max(ans, (pref_sum[i + d] - pref_sum[i]) / d)\nprint(ans)\n", "n, k = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\nfor i in range(n):\r\n a[i+1] += a[i]\r\nans = 0\r\nfor i in range(n-k+1):\r\n for j in range(i+k-1, n):\r\n tmp = (a[j+1]-a[i])/(j-i+1)\r\n if tmp>ans:\r\n ans = tmp\r\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nans = []\r\nfor l in range(k, n + 1):\r\n\tcand = [sum(a[:l])]\r\n\tfor i in range(l, n):\r\n\t\tcand.append(cand[-1] + a[i] - a[i - l])\r\n\tcand = max(cand) / l\r\n\tans.append(cand)\r\n\r\nprint(max(ans))", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\navg=0\r\nfor i in range(0,n-k+1):\r\n s=sum(a[i:i+k-1])\r\n p=k-1\r\n for j in range(i+k,n+1):\r\n s+=a[j-1]\r\n p+=1\r\n avg=max(avg,s/p)\r\nprint(avg)\r\n ", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 07/07/2020\r\n\r\nfrom sys import stdin,stdout\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn, k = iia()\r\narr = iia()\r\nres = float(\"-inf\")\r\nfor i in range(k, n + 1):\r\n tot = sum(arr[:i])\r\n res = max(res, tot / i)\r\n for j in range(i, n):\r\n tot += arr[j] - arr[j - i]\r\n res = max(res, tot / i)\r\n k += 1\r\nprint(round(res, 15))\r\n\r\n", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\npl = [l[0]]\r\nfor i in range(1,len(l)):\r\n pl.append(pl[-1]+l[i])\r\n# print(pl)\r\npl = [0]+pl\r\nans = []\r\nfor i in range(k,n+1):\r\n for j in range(i,n+1):\r\n ans.append((pl[j] - pl[j-i])/i)\r\n # print(ans)\r\nprint(max(ans))\r\n ", "import math\r\nfor _ in range(1):\r\n n,k=map(int,input().split())\r\n l=list(map(int,input().split()))\r\n ans=0\r\n for i in range(n):\r\n\t c=0\r\n\t sum1=0\r\n\t for j in range(i, n):\r\n\t\t sum1 += l[j]\r\n\t\t c+=1\r\n\t\t if c >= k:\r\n\t\t\t ans=max(ans,sum1/c)\r\nprint(ans) \r\n \r\n \r\n ", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\navg = 0\r\nfor i in range(n):\r\n cnt = 0\r\n sum = 0\r\n for j in range(i, n):\r\n sum += a[j]\r\n cnt += 1\r\n if cnt >= k:\r\n avg = max(avg, sum/cnt)\r\nprint(avg)", "from sys import *\r\n\r\nn, k = map(int, stdin.readline().split())\r\narr = list(map(int, stdin.readline().split()))\r\navg = 0\r\nfor i in range(n):\r\n\tcnt = 0\r\n\tsum = 0\r\n\tfor j in range(i, n):\r\n\t\tsum += arr[j]\r\n\t\tcnt += 1\r\n\t\tif cnt >= k:\r\n\t\t\tavg = max(avg, sum / cnt)\r\nprint(avg)", "def check(x,A):\r\n sum=0\r\n for i in range(x):\r\n sum+=A[i]\r\n ans = sum/x\r\n for i in range(x,n):\r\n sum-=A[i-x]\r\n sum+=A[i]\r\n a = sum/x\r\n if(a>ans):\r\n ans = a\r\n return ans\r\n \r\nn,k = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nf_ans = 0\r\nwhile(k<=n):\r\n ans = check(k,A)\r\n if(ans>f_ans):\r\n f_ans = ans\r\n k+=1\r\nprint(f_ans)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n# ----------------------- #\r\n\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nacc = [0] * (n+1)\r\nfor i in range(n):\r\n acc[i+1] = acc[i] + A[i]\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i+k, n+1):\r\n temp = acc[j] - acc[i]\r\n temp /= j - i\r\n ans = max(ans, temp)\r\nprint(ans)\r\n", "n, k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nthe_in = 0\r\nmax_in = 0\r\na1 = [0]*(n+1)\r\nfor i in range(1,n+1):\r\n a1[i] = a1[i-1] + a[i-1] \r\nfor j in range(n-k+1):\r\n for i in range(j+k-1,n):\r\n sum_a = a1[i+1] - a1[j] \r\n the_in = sum_a / (i - j +1)\r\n if the_in > max_in :\r\n max_in = the_in\r\nprint(max_in)", "def main():\r\n n,k=map(int,input().split( ))\r\n a=list(map(int,input().split( )))\r\n ans=-1*10**9+7\r\n for i in range(n):\r\n s=0\r\n for j in range(i,n):\r\n s+=a[j]\r\n if j-i+1>=k:\r\n\r\n ans=max(ans,s/(j-i+1))\r\n print(ans)\r\n\r\n \r\nmain()", "n,k = map(int,input().split(' '))\r\na = list(map(int,input().split(' ')))\r\nc = []\r\np = 0\r\nd = 0\r\ns = 0\r\nfor i in range(0,n):\r\n p = sum(a[i:i+k])\r\n d = k\r\n s = max(s,p/d)\r\n for j in range(i+k,min(n,i+2*k)):\r\n p += a[j]\r\n d += 1\r\n s = max(s,p/d)\r\n \r\nprint(s)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = -float('inf')\r\nb = []\r\nfor i in range(n):\r\n if i == 0:\r\n b.append(a[0])\r\n else:\r\n b.append(b[-1] + a[i])\r\nans = 0\r\nb = [0] + b\r\nfor x in range(len(b)-k):\r\n for y in range(x+k, len(b)):\r\n ans = max(ans, (b[y]-b[x])/(y-x))\r\nprint(ans)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,k=(int(i) for i in input().split())\r\nl=[int(i) for i in input().split()]\r\nl1=[]\r\nfor i in range(k,n+1):\r\n s=sum(l[:i])\r\n s1=s/i\r\n for j in range(i,n):\r\n s-=l[j-i]\r\n s+=l[j]\r\n s1=max(s1,s/i)\r\n l1.append(s1)\r\nprint(max(l1))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0]\r\nfor i in a:\r\n b.append(b[-1] + i)\r\nans = 0\r\nfor l in range(n):\r\n for r in range(l + k, n + 1):\r\n ans = max(ans, (b[r] - b[l]) / (r - l))\r\nprint(ans)", "import sys, heapq\r\n\r\nn, k = map(int, sys.stdin.readline().split())\r\narr = list(map(int, sys.stdin.readline().split()))\r\npf = [0] * (n + 1)\r\npf[0] = arr[0]\r\nfor i in range(1, n):\r\n pf[i] = pf[i - 1] + arr[i]\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n left = i\r\n right = j\r\n if right - left + 1 >= k:\r\n temp = pf[right] - pf[left - 1]\r\n ans = max(ans, temp / (right - left + 1))\r\nprint(ans)", "n, k = map(int, input().split())\r\nli = [int(num) for num in input().split(\" \", n - 1)]\r\nans = []\r\nfor i in range(0, n):\r\n su = 0\r\n for j in range(i, n):\r\n su += li[j]\r\n if (j - i + 1 >= k):\r\n ans.append(su / (j - i + 1))\r\nprint(max(ans))", "import sys \r\ninput = sys.stdin.readline \r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nfor i in range(1, n):\r\n a[i] += a[i - 1]\r\na.insert(0, 0)\r\nl = []\r\nfor i in range(k, n + 1):\r\n for j in range(i, n + 1):\r\n l.append((a[j] - a[j - i]) / i)\r\nprint(max(l))", "import itertools\r\n# import io, os\r\n\r\ndef gen_otr(l: list[int], k_x: int):\r\n len_l = len(l)\r\n while k_x <= len_l:\r\n for i in range(len_l - k_x + 1):\r\n # yield l[i:k_x + i]\r\n yield itertools.islice(l, i, k_x + i), k_x\r\n k_x += 1\r\n\r\n# sum([3, 4, 1]) / 3\r\n\r\ndef intensity(days_list: list[int], min_l_otr: int) -> float:\r\n lst_sred = [sum(otr) / len_otr for otr, len_otr in gen_otr(days_list, min_l_otr)]\r\n return max(lst_sred)\r\n\r\ndef intensity_2(days_list: list[int], min_l_otr: int) -> float:\r\n pref_sum_l = [0] \r\n for i, _ in enumerate(days_list):\r\n pref_sum_l.append(\r\n pref_sum_l[i] + days_list[i]\r\n )\r\n ans = 0\r\n for r, _ in enumerate(days_list):\r\n for l in range(r + 1):\r\n current_k = r - l + 1\r\n if current_k >= min_l_otr:\r\n ans = max(ans, (\r\n pref_sum_l[r + 1] - pref_sum_l[l]\r\n ) / current_k)\r\n\r\n return ans\r\n\r\n\r\nif __name__ == '__main__':\r\n # inp_line = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n inp_line = input\r\n _, k = (int(x) for x in inp_line().split())\r\n list_days = [int(x) for x in inp_line().split()]\r\n print(intensity_2(list_days, k))\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nd = [[0]*n for _ in range(n)]\r\n\r\nx = (k-1)*n + 1\r\nc = 1\r\nif k > 1:\r\n for i in range(n):\r\n for j in range(k-1):\r\n d[i][j] = c\r\n c += 1\r\nfor i in range(n):\r\n for j in range(k-1, n):\r\n d[i][j] = c\r\n c += 1\r\n\r\nprint(sum(d[i][k-1] for i in range(n)))\r\nfor i in d:\r\n print(' '.join(map(str, i)))", "import collections\nimport math\nimport copy\ndef main():\n #n = int(input())\n n,k = list(map(int,input().split()))\n #m = int(input())\n #a = list(map(int,input().split()))\n #b = list(map(int,input().split()))\n #a = list(map(int,input().split()))\n solution(n,k) \n\ndef solution(n,k):\n max_num = n*n-(n-k)\n column = [max_num]\n for i in range(1,n):\n column.append(max_num-i*(n-k+1))\n column = column[::-1]\n p = 1\n print(sum(column))\n for c in column:\n for _ in range(1,k):\n print(p,end=' ')\n p += 1\n print(c,end=' ')\n for t in range(1,n-k+1):\n print(c+t,end=' ')\n print()\n \n\n \n \n\n \n\n\n \n \n\n \n \n\n\nmain()", "N, K = map(int, input().split())\nmat = [[0] * N for _ in range(N)]\nfor i in range(N):\n for j in range(K-1):\n mat[i][j] = i * (K-1) + j + 1\nfor i in range(N):\n for j in range(N-K+1):\n mat[i][j+K-1] = N * (K-1) + i * (N - K + 1) + j + 1\nprint(sum(mat[i][K-1] for i in range(N)))\n[print(*row) for row in mat]\n", "n,k = map(int, input().strip().split(' '))\r\n#n=int(input())\r\n#lst = list(map(int, input().strip().split(' ')))\r\ni1=1\r\ni2=n*(k-1)+1\r\nl=i2+(n-1)*(n-k+1)\r\nprint((n*(i2+l))//2)\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if j<k:\r\n print(i1+(n*(j-1)),end=\" \")\r\n else:\r\n print(i2,end=\" \")\r\n i2+=1\r\n i1+=1\r\n print()\r\n", "n, k=map(int, input().split())\na=[i+1 for i in range(n*n)]\nb=[[0]]\nk-=1\nfor _ in range(n):\n b+=[ a[:k]+a[k-n:] ]\n a=a[k:k-n]\n b[0][0]+=b[-1][k]\nfor _ in b:\n print(*_)\n", "def solve():\r\n row,k=[int(x) for x in input().split()]\r\n matrix=[[0 for i in range(row)]for j in range(row)]\r\n val=row*row\r\n ans=0\r\n for i in range(0,row):\r\n for j in range(row-1,k-2,-1):\r\n matrix[i][j]=val\r\n val-=1\r\n ans+=(val+1)\r\n \r\n for i in range(0,row):\r\n for j in range(k-2,-1,-1):\r\n matrix[i][j]=val\r\n val-=1\r\n \r\n print(ans)\r\n for i in range(row):\r\n for j in range(row):\r\n print(matrix[i][j],end=\" \")\r\n print()\r\n \r\nsolve()", "n, k = map(int, input().split())\r\n\r\nans = list()\r\n\r\nleft = list()\r\n\r\nif k != 1:\r\n for idx in range(1, n * (k - 1) + 1, k - 1):\r\n left.append(list(range(idx, idx + k - 1)))\r\n\r\nright = list()\r\n\r\nsm = 0\r\n\r\nfor idx in range(n * (k - 1) + 1, n * n + 1, n - k + 1):\r\n sm += idx\r\n right.append(list(range(idx, idx + n - k + 1)))\r\n\r\nans = list()\r\n\r\nfor idx in range(n):\r\n if k == 1:\r\n ans.append(right[idx])\r\n else:\r\n ans.append(left[idx] + right[idx])\r\n\r\nprint(sm)\r\nfor v in ans:\r\n print(*v)\r\n", "n,k=[int(e) for e in input().split()]\r\na=[[0]*n for i in range(n)]\r\nL=1\r\nR=n*n\r\nfor i in range(n):\r\n a[i]=list(range(L,L+k-1))+list(range(R-(n-k),R+1))\r\n L+=k-1\r\n R-=n-k+1\r\nprint(sum(a[i][k-1] for i in range(n)))\r\nfor e in a:\r\n print(*e)", "n,k=map(int,input().split())\r\nans=[[0]*n for _ in range(n)]\r\nb=1\r\n\r\n\r\nfor i in range(n):\r\n for j in range(k-1):\r\n ans[i][j]=b\r\n b+=1\r\n \r\nfor i in range(n) :\r\n for j in range(k-1,n):\r\n ans[i][j]=b\r\n b+=1\r\nrans=0 \r\nfor i in range(n):\r\n rans+=ans[i][k-1]\r\nprint(rans)\r\nfor i in range(n):\r\n print(*ans[i])", "n, k = map(int, input().split())\r\nmat = [[0]*n for i in range(n)]\r\ncount = n * n\r\nfor i in range(n):\r\n for j in range(n-1, k-2,-1):\r\n mat[i][j] = count\r\n count -= 1\r\nsum = 0\r\nfor i in range(n):\r\n sum += mat[i][k-1]\r\n\r\nfor i in range(n):\r\n for j in range(k-2, -1, -1):\r\n mat[i][j] = count\r\n count -= 1\r\nprint(sum)\r\nfor l in mat:\r\n print(*l)\r\n\r\n", "import sys\r\nn,k=map(int,input().split())\r\narr=[0]*n\r\nfor i in range(n):\r\n arr[i]=[0 for x in range(n)]\r\nq=1\r\nfor i in range(n):\r\n for j in range(k-1):\r\n arr[i][j]=q\r\n q+=1\r\nfor i in range(n):\r\n for j in range(k-1,n):\r\n arr[i][j]=q\r\n q+=1\r\nans=0\r\nfor i in range(n):\r\n ans+=arr[i][k-1]\r\nprint(ans)\r\nfor i in arr:\r\n for j in i:\r\n sys.stdout.write(str(j)+\" \")\r\n sys.stdout.write(\"\\n\")", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\na,b=map(int,input().split())\nz=[];x=1;s=0\nfor i in \" \"*a:k=[1]*a;z+=[k]\nfor i in range(a):\n for j in range(b-1):z[i][j]=x;x+=1\nfor i in range(a):\n for j in range(b-1,a):z[i][j]=x;x+=1\nprint(sum(z[i][b-1] for i in range(a)))\nfor i in z:\n print(*i)\n", "#!/usr/bin/env python3\r\nimport sys\r\nsys.setrecursionlimit(300000)\r\n\r\ndef solve(n, k):\r\n ret = [[0] * n for _ in range(n)]\r\n kk = k - 1\r\n v = 1\r\n for r in range(n):\r\n for c in range(kk):\r\n ret[r][c] = v\r\n v += 1\r\n for r in range(n):\r\n for c in range(n - kk):\r\n ret[r][c + kk] = v\r\n v += 1\r\n s = 0\r\n for r in range(n):\r\n s += ret[r][k - 1]\r\n print(s)\r\n for r in ret:\r\n print(*r, sep = ' ')\r\n return ret\r\n\r\ndef main():\r\n def iterate_tokens():\r\n for line in sys.stdin:\r\n for word in line.split():\r\n yield word\r\n tokens = iterate_tokens()\r\n\r\n # process inputs1\r\n n, k = map(int, input().split())\r\n solve(n, k)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = map(int, input().split())\r\nx = n - k + 1\r\nfirst = n * n - x * n + 1\r\ntable = [[0]*n for i in range(n)]\r\na = 1\r\nk-=1\r\n\r\nfor i in range(n):\r\n for j in range(k):\r\n table[i][j] = a\r\n a += 1\r\nfor i in range(n):\r\n for j in range(k, n):\r\n table[i][j] = a\r\n a += 1\r\nres = 0\r\nfor i in range(n):\r\n res += table[i][k]\r\n \r\nprint(res)\r\nfor i in range(n):\r\n for j in range(n):\r\n print(table[i][j], end = ' ')\r\n print()\r\n ", "n, k = [int(t) for t in input().split()]\r\n\r\nmat = []\r\nfor row in range(n):\r\n left = [str(t) for t in range(n*(k-1) - row*(k-1) - (k-2), n*(k-1) - row*(k-1) + 1)]\r\n right = [str(t) for t in range(n**2 - row*(n-k+1) - (n-k+1)+1, n**2 - row*(n-k+1) +1)]\r\n mat.append(\" \".join(left) + \" \" + \" \".join(right))\r\n\r\nprint(sum([n**2 - i*(n-k+1) - (n-k) for i in range(n)]))\r\nprint(\"\\n\".join(mat))", "n, k=map(int, input().split())\r\na=[i+1 for i in range(n*n)]\r\nb=[[0]]\r\nk-=1\r\nfor _ in range(n):\r\n\tb+=[ a[:k]+a[k-n:] ]\r\n\ta=a[k:k-n]\r\n\tb[0][0]+=b[-1][k]\r\nfor _ in b:\r\n\tprint(*_)", "def main():\r\n n, k = map(int, input().split())\r\n matrix = [[0] * n for _ in range(n)]\r\n k -= 1\r\n\r\n x = 1\r\n\r\n kk = 0\r\n while kk < k:\r\n for i in range(n):\r\n matrix[i][kk] = x\r\n x += 1\r\n kk += 1\r\n\r\n for i in range(n):\r\n for j in range(k, n):\r\n matrix[i][j] = x\r\n x += 1\r\n\r\n print(sum(matrix[i][k] for i in range(n)))\r\n for r in matrix:\r\n print(*r)\r\n\r\n\r\nmain()\r\n", "n, k = map(int, input().split())\r\na = k - 1\r\nm = [n * [0] for _ in range(n)]\r\nc1 = 1\r\nc2 = (k - 1) * n + 1\r\ns = 0\r\nfor i in range(n):\r\n for j in range(a):\r\n m[i][j] = c1\r\n c1 += 1\r\n for j in range(k - 1, n):\r\n m[i][j] = c2\r\n c2 += 1\r\n s += m[i][k - 1]\r\nprint(s)\r\nfor i in range(n):\r\n print(*m[i])", "n,k=map(int,input().split())\r\nm=1\r\nq=n*(k-1) \r\nq+=1\r\nsu=n/2*((2*q)+((n-1)*(n-k+1)))\r\nprint(int(su))\r\nfor i in range(n):\r\n for j in range(n):\r\n if j<k-1:\r\n \r\n print(m,'',end='')\r\n m+=1\r\n elif j>=k-1:\r\n \r\n print(q,'',end='')\r\n q+=1 \r\n print('')", "n,k = map(int,input().split())\r\nc = [[0 for i in range(n)] for i in range(n)]\r\np = n-k\r\nz = pow(n,2)\r\nkth = [z-p]\r\nfor i in range(1,n):\r\n kth.append(kth[-1]-(p+1))\r\nkth.reverse()\r\nu = sum(kth)\r\nprint(u)\r\nfor i in range(n):\r\n c[i][k-1] = kth[i]\r\no = 1\r\nfor i in range(len(c)):\r\n for j in range(k,len(c[i])):\r\n c[i][j] = c[i][j-1]+1\r\n for j in range(k-1):\r\n c[i][j] = o\r\n o+=1\r\nfor i in range(len(c)):\r\n print(*c[i])\r\n", "n=5\r\nk=3\r\nn,k=map(int,input().split())\r\nsm=1\r\nlg=n**2\r\nsum=((n**2-(n-k)+n**2-(n-k)-(n-1)*(n-k+1))*n//2)\r\nprint(sum)\r\nfor i in range(n):\r\n for j in range(1,k):\r\n print(sm, end = \" \")\r\n sm+=1\r\n for j in range(k,n+1):\r\n print(lg-n+j, end=\" \")\r\n lg=lg-(n-k+1)\r\n print()\r\n", "n,column=map(int,input().split())\r\nsmall,large=1,n**2\r\ntable=[[[] for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(n-1,column-2,-1):table[i][j]=large;large-=1\r\n for x in range(column-1):table[i][x]=small;small+=1\r\ntotal=0\r\nfor k in table:total+=k[column-1]\r\nprint(total)\r\nfor l in table:print(' '.join(list(map(str,l))))", "R=range\r\np=''\r\nn,k=map(int,input().split())\r\ns=l=0\r\nr=n*n\r\nfor _ in R(n):\r\n\tv=[]\r\n\tfor m in R(k-1):l+=1;v+=[str(l)]\r\n\tr-=n-k+1;s+=r\r\n\tfor i in R(n-k+1):v+=[str(r+i+1)]\r\n\tp+='\\n'+' '.join(v)\r\nprint(str(s+n)+p)", "n,k=map(int,input().split())\r\nc=0\r\nans=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(k-1):\r\n c+=1\r\n ans[i][j]=c\r\nfinal=0\r\nfor i in range(n):\r\n for j in range(k-1,n):\r\n c+=1\r\n ans[i][j]=c\r\n final+=ans[i][k-1]\r\nprint(final)\r\nfor i in ans:\r\n print(*i)", "a, b = map(int, input().split(' '))\r\nans = [[0]*a for _ in range(a)]\r\ncurr = 1\r\nb-=1\r\nfor i in range(b):\r\n for j in range(a):\r\n ans[j][i] = curr\r\n curr+=1\r\n\r\nfor i in range(a):\r\n for j in range(a):\r\n if ans[i][j] == 0:\r\n ans[i][j] = curr\r\n curr+=1\r\n\r\ntot = 0\r\nfor i in range(a):\r\n tot += ans[i][b]\r\n\r\nprint(tot)\r\nfor i in ans:\r\n print(' '.join([str(x) for x in i]))\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n, k):\r\n M = [[None for j in range(n)] for i in range(n)]\r\n for i in range(1, (k-1)*n+1):\r\n x1 = (i-1)//(k-1)\r\n y1 = (i-1) % (k-1)\r\n M[x1][y1] = i\r\n for i in range((k-1)*n+1, n*n+1):\r\n x1 = (i-(k-1)*n-1)//(n-k+1)\r\n y1 = (i-(k-1)*n-1) % (n-k+1)\r\n # print(x1, y1)\r\n M[x1][y1+k-1] = i\r\n answer = 0\r\n for i in range(n):\r\n answer+=M[i][k-1]\r\n sys.stdout.write(f'{answer}\\n')\r\n for row in M:\r\n row = ' '.join(map(str, row))\r\n sys.stdout.write(f'{row}\\n')\r\n return\r\n\r\nn, k = [int(x) for x in input().split()]\r\nprocess(n, k)", "n, k = map(int, input().split())\r\narray = list()\r\narray1 = []\r\nd = 0\r\nfor c in range(n):\r\n array1 = []\r\n for f in range(n):\r\n array1.append(0)\r\n array.append(array1)\r\ncount = n * n\r\ncount1 = 1\r\nfor c in range(n):\r\n for d in range(n - k):\r\n array[c][n - d - 1] = count\r\n d = d + 1\r\n count = count - 1\r\n array[c][k - 1] = count\r\n count = count - 1\r\n for y in range(k - 1):\r\n array[c][y] = count1\r\n count1 = count1 + 1\r\nsumma = 0\r\nfor c in range(n):\r\n summa = summa + array[c][k - 1]\r\nprint(summa)\r\nfor c in range(n):\r\n for h in range(n):\r\n print(array[c][h], end=\" \")\r\n print()", "for t in range(1):\r\n n,k=map(int,input().split())\r\n number=[]\r\n for i in range(1,(n**2)+1):\r\n number.append(i)\r\n ans=[]\r\n small_a=number[0:n*(k-1)]\r\n for i in range(n):\r\n row=[0]*n\r\n for j in range(n-1,-1,-1):\r\n if j+1>=k:\r\n a=number.pop(-1)\r\n else:\r\n a=small_a.pop(-1)\r\n row[j]=a\r\n ans.append(row)\r\n suma=0\r\n for i in ans:\r\n ele=i[k-1]\r\n suma+=ele\r\n print(suma)\r\n for i in ans:\r\n print(*i)", "n, k = map(int, input().split())\r\nboard = [[0]*n for _ in range(n)]\r\nfor x in range(k-1):\r\n for y in range(n):\r\n board[y][x] = x*n+y+1\r\nval = n * (k-1)\r\nfor y in range(n):\r\n for x in range(k-1, n):\r\n val += 1\r\n board[y][x] = val\r\nprint(sum(row[k-1] for row in board))\r\nfor row in board:\r\n print(' '.join(map(str, row)))\r\n", "n,k = map(int, input().split())\r\n\r\na =[ [0]*n for p in range(0,n)]\r\nc = 1;\r\nfor i in range(0,n):\r\n for j in range(0, k-1):\r\n a[i][j] = c;\r\n c += 1\r\nsm = 0\r\nfor i in range(0,n):\r\n for j in range(k-1, n):\r\n a[i][j] = c;\r\n c += 1\r\n if j == k - 1:\r\n sm += a[i][j]\r\n\r\nprint(sm)\r\nfor i in range(0,n):\r\n for j in range(0, n):\r\n print(a[i][j],end = ' ')\r\n print('')\r\n \r\n", "#625C\r\nn, k = map(int, input().split())\r\nmatrix = [[0]*n for _ in range(n)]\r\nvalue = 1\r\nfor i in range(n):\r\n for j in range(k-1):\r\n matrix[i][j] = value\r\n value += 1\r\nfor i in range(n):\r\n for j in range(k-1,n):\r\n matrix[i][j] = value\r\n value += 1\r\nans = 0\r\nfor i in range(n):\r\n ans += matrix[i][k-1]\r\nprint(ans)\r\nfor i in range(n):\r\n for j in range(n):\r\n print(matrix[i][j], end=\" \")\r\n print()\r\n", "n, k = map(int, input().split())\r\ncur = n ** 2\r\na =[[-1000] * n for _ in range(n)]\r\nfor i in range(0, n):\r\n for j in range(n - 1, k - 2, -1):\r\n a[i][j] = cur\r\n cur -= 1\r\n\r\nfor i in range(n):\r\n for j in range(k - 2, -1, -1):\r\n a[i][j] = cur\r\n cur -= 1\r\n\r\ns = 0\r\nfor i in range(n):\r\n s += a[i][k - 1]\r\nprint(s)\r\nfor x in a:\r\n print(*x)", "n, k = map(int, input().split())\r\nt = [[0]*n for i in range(n)]\r\ns = 0\r\nv = 1\r\nfor y in range(n):\r\n for x in range(k-1):\r\n t[y][x] = v\r\n v += 1\r\nfor y in range(n):\r\n for x in range(k-1, n):\r\n t[y][x] = v\r\n v += 1\r\nfor y in range(n):\r\n s += t[y][k-1]\r\nprint(s)\r\nfor y in range(n):\r\n print(*t[y])", "def kspecial(n, k):\r\n j = n - k + 1\r\n return n*n*n - (n * (n+1) // 2)*j + n\r\n\r\n\r\ndef print_table(n):\r\n i1 = iter(range(1, n*(k-1)+1))\r\n i2 = iter(range(n*(k-1)+1, n*n+1))\r\n\r\n for r in range(n):\r\n l = []\r\n l.extend(next(i1) for _ in range(k-1))\r\n l.extend(next(i2) for _ in range(n-k+1))\r\n print(' '.join(map(str, l)))\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n print(kspecial(n, k))\r\n print_table(n)\r\n", "def main():\n n, k = map(int, input().split())\n k -= 1\n res = [[0] * n for _ in range(n)]\n i = 1\n for x in range(k):\n for y in range(n):\n res[y][x] = i\n i += 1\n for y in range(n):\n for x in range(k, n):\n res[y][x] = i\n i += 1\n print(sum(res[y][k] for y in range(n)))\n for row in res:\n print(*row)\n\n\nif __name__ == '__main__':\n main()\n", "n,k=map(int,input().split())\r\na=[]\r\nfor _ in range(n):\r\n\tl=[]\r\n\tfor _ in range(n):\r\n\t\tl.append(0)\r\n\ta.append(l)\r\nz=1\r\nfor i in range(k-1):\r\n\tfor j in range(n):\r\n\t\ta[j][i]=z\r\n\t\tz+=1\r\nfor i in range(n):\r\n\tfor j in range(k-1,n):\r\n\t\ta[i][j]=z\r\n\t\tz+=1\r\nz=0\r\nfor i in range(n):\r\n\tz+=a[i][k-1]\r\nprint(z)\r\nfor x in a:\r\n\tprint(*(i for i in x))", "if __name__=='__main__':\r\n n,k = map(int,input().split(' '))\r\n Sum = 0\r\n t,s =(),pow(n,2)\r\n for i in range(n):\r\n tmpt = ()\r\n for j in range(n-k+1):\r\n tmpt +=(s,)\r\n s -=1\r\n t += (tmpt,)\r\n Sum+=s\r\n print (Sum+n)\r\n #table\r\n s = 1\r\n for i in range(n):\r\n tn = ()\r\n for j in range(k-1):\r\n tn+=(s,)\r\n s+=1\r\n print (str(tn+t[i][::-1]).replace(',','').replace('(','').replace(')',''))\r\n \r\n \r\n'''\r\nC. K-special Tables\r\ntime limit per test\r\n2 seconds\r\nmemory limit per test\r\n256 megabytes\r\ninput\r\nstandard input\r\noutput\r\nstandard output\r\n\r\nPeople do many crazy things to stand out in a crowd. Some of them dance, some learn by heart rules of Russian language, some try to become an outstanding competitive programmers, while others collect funny math objects.\r\n\r\nAlis is among these collectors. Right now she wants to get one of k-special tables. In case you forget, the table n × n is called k-special if the following three conditions are satisfied:\r\n\r\n every integer from 1 to n2 appears in the table exactly once;\r\n in each row numbers are situated in increasing order;\r\n the sum of numbers in the k-th column is maximum possible. \r\n\r\nYour goal is to help Alice and find at least one k-special table of size n × n. Both rows and columns are numbered from 1 to n, with rows numbered from top to bottom and columns numbered from left to right.\r\nInput\r\n\r\nThe first line of the input contains two integers n and k (1 ≤ n ≤ 500, 1 ≤ k ≤ n) — the size of the table Alice is looking for and the column that should have maximum possible sum.\r\nOutput\r\n\r\nFirst print the sum of the integers in the k-th column of the required table.\r\n\r\nNext n lines should contain the description of the table itself: first line should contains n elements of the first row, second line should contain n elements of the second row and so on.\r\n\r\nIf there are multiple suitable table, you are allowed to print any.\r\nSample test(s)\r\nInput\r\n\r\n4 1\r\n\r\nOutput\r\n\r\n28\r\n1 2 3 4\r\n5 6 7 8\r\n9 10 11 12\r\n13 14 15 16\r\n\r\nInput\r\n\r\n5 3\r\n\r\nOutput\r\n\r\n85\r\n5 6 17 18 19\r\n9 10 23 24 25\r\n7 8 20 21 22\r\n3 4 14 15 16\r\n1 2 11 12 13\r\n'''\r\n", "n, k = map(int, input().split())\r\nres = list([0] * n for i in range(n))\r\nidx = 1\r\nfor i in range(n):\r\n for j in range(k-1):\r\n res[i][j] = idx\r\n idx += 1\r\nsum_res = 0\r\nfor i in range(n):\r\n for j in range(k-1, n):\r\n res[i][j] = idx\r\n idx += 1\r\n sum_res += res[i][k-1]\r\nprint(sum_res)\r\nfor i in res:\r\n print(*i)\r\n", "n, k = map(int, input().split())\nls = [0 for _ in range(n)]\nl = []\nfor _ in range(n):\n l.append(ls)\nx = 1\nfor i in range(n):\n kl = l[i].copy()\n for j in range(k-1):\n kl[j] = x\n x += 1\n l[i] = kl\nfor i in range(n):\n kl = l[i].copy()\n for j in range(k-1, n):\n kl[j] = x\n x += 1\n l[i] = kl\n\nsum = 0 \nfor i in range(n):\n sum += (l[i])[k-1]\nprint(sum)\n\nfor i in l:\n for j in i:\n print(j, end = \" \")\n print()\n\t \t \t\t \t\t\t\t \t\t\t \t \t \t", "import sys\r\ndef input(): return sys.stdin.readline().rstrip('\\n')\r\n\r\n\r\nn, k = map(int, input().split())\r\narray = [[0 for i in range(n)] for j in range(n)]\r\nnum = n ** 2\r\nk_array = [[0 for i in range(n - k + 1)] for j in range(n - k + 1)]\r\nstart = n ** 2 - ((n - k + 1) * n) + 1\r\nfor i in range(n):\r\n for j in range(k - 1, n):\r\n array[i][j] = start\r\n start += 1\r\nmin_start = 1\r\nfor i in range(n):\r\n for j in range(k - 1):\r\n array[i][j] = min_start\r\n min_start += 1\r\nkans = 0\r\nfor i in range(n):\r\n kans += array[i][k - 1]\r\nprint(kans)\r\nfor i in array:\r\n print(*i)\r\n", "s = list(map(int,input().split()))\r\nn = s[0]\r\nk = s[1]\r\nanswer = (((n*(k-1)+1)+(n**2-n+k))*n)//2\r\nprint(answer)\r\nfor i in range(n):\r\n for j in range(1,k):\r\n print(i*(k-1)+j, end = ' ')\r\n for j in range(k, n+1):\r\n if j != n:\r\n print(n*(k-1)+ i*(n-k+1)+j-k+1, end = ' ')\r\n else:\r\n print(n*(k-1)+ i*(n-k+1)+j-k+1)\r\n\r\n", "n, k = map(int, input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append([])\r\n for j in range(n):\r\n a[i].append(0)\r\nc = 1\r\nfor i in range(n):\r\n for j in range(k - 1):\r\n a[i][j] = c\r\n c += 1\r\nfor i in range(n):\r\n for j in range(k - 1, n):\r\n a[i][j] = c\r\n c += 1\r\nans = 0\r\nfor i in range(n):\r\n ans += a[i][k - 1]\r\nprint(ans)\r\nfor i in range(n):\r\n print (\" \".join(map(str, a[i])))\r\n", "def inp():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\nfrom sys import *\r\n\r\nn, m = inp()\r\nc2, arr, c3, sum = (n * (m - 1)), '', 0, 0\r\n\r\nfor i in range(n):\r\n arr += ' '.join([str(c3 + j) for j in range(1, m)]) + ' ' + ' '.join(\r\n [str(c2 + j) for j in range(1, (n - m) + 2)]) + '\\n'\r\n\r\n sum += c2 + 1\r\n c3 += m - 1\r\n c2 += n - (m - 1)\r\n\r\nprint(sum, arr, sep='\\n')\r\n", "readInts = lambda: map(int, input().split())\r\n\r\nn,k=readInts()\r\n\r\ng=[[0]*n for i in range(n)]\r\n\r\nnum=1\r\nfor i in range(n):\r\n for j in range (k-1):\r\n g[i][j]=num\r\n num=num+1\r\nsum=0\r\nfor i in range(n):\r\n for j in range (k-1,n):\r\n g[i][j]=num\r\n num=num+1\r\n sum=sum+g[i][k-1]\r\n\r\nprint(sum)\r\nfor i in range(n):\r\n print(*g[i])\r\n", "a,b=map(int,input().split())\r\ns=[[0 for n in range(a)] for n in range(a)]\r\nx=a*a\r\nres=0\r\nfor n in range(a):\r\n for k in range(a-b+1):\r\n s[n][k]=x\r\n x-=1\r\n res+=s[n][a-b]\r\n s[n]=s[n][::-1]\r\nx=1\r\nfor n in range(a):\r\n for k in range(b-1):\r\n s[n][k]=x\r\n x+=1\r\nprint(res)\r\nfor n in s:\r\n for k in n:\r\n print(k,end=' ')\r\n print()", "n, k = map(int, input().split())\r\nmatr = [[0] * n for i in range(n)]\r\np = 1\r\nfor i in range(n):\r\n for j in range(k - 1):\r\n matr[i][j] = p\r\n p += 1\r\nfor i in range(n):\r\n for j in range(k - 1, n):\r\n matr[i][j] = p\r\n p += 1\r\nst = 0\r\nfor i in range(n):\r\n st += matr[i][k - 1]\r\nprint(st)\r\nfor i in range(n):\r\n for j in range(n):\r\n print(matr[i][j], end = ' ')\r\n print()", "n, k = map(int, input().split())\r\na = [[0 for i in range(n)] for i in range(n)]\r\ncount = 1\r\nfor i in range(n):\r\n for j in range(k - 1):\r\n a[i][j] = count\r\n count += 1\r\nfor i in range(n):\r\n for j in range(k - 1, n):\r\n a[i][j] = count\r\n count += 1\r\nsum1 = 0\r\nfor i in range(n):\r\n sum1 += a[i][k - 1]\r\nprint(sum1)\r\nfor i in range(n):\r\n for j in range(n):\r\n print(a[i][j], end=\" \")\r\n print()", "s = (input()).split()\r\nn = int(s[0])\r\nk = int(s[1])\r\nx = (k - 1)*n + 1;\r\nans = x*n + (n - k + 1)*(n - 1)*n/2\r\nprint(int(ans))\r\nind1 = 1\r\nind2 = x\r\nfor i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n if (j < k):\r\n print(ind1, end = \" \")\r\n ind1 +=1\r\n else:\r\n print(ind2, end = \" \")\r\n ind2 += 1\r\n print()", "n, k = map(int, input().split())\r\nv, g, c = 0, [[None] * n for i in range(n)], n * n + 1\r\nfor i in range(n):\r\n c -= n - k + 1\r\n v += c\r\n g[n - 1 - i][k - 1] = c\r\n for j in range(n - k):\r\n g[n - 1 - i][k + j] = c + j + 1\r\nfor i in range(c - 1):\r\n x, y = divmod(i, k - 1)\r\n g[x][y] = i + 1\r\nprint(v)\r\nfor gi in g:\r\n print(' '.join(map(str, gi)))", "n,k=map(int,input().split(\" \"))\r\nans=[[0 for x in range(n)] for x in range(n)]\r\ncount=1\r\nfor x in range(n):\r\n for y in range(k-1):\r\n ans[x][y]=count\r\n count=count+1\r\nasn=0\r\nfor x in range(n):\r\n for y in range(k-1,n):\r\n ans[x][y]=count\r\n count=count+1\r\nfor x in range(n):\r\n asn=asn+ans[x][k-1]\r\nprint(asn)\r\nfor x in ans:\r\n print(*x)", "n, k = map(int, input().split())\r\na = [0] * n\r\nfor i in range(n):\r\n a[i] = [0] * n\r\nfor i in range(n):\r\n for j in range(k):\r\n a[i][j] = i * (k - 1) + j + 1\r\nfor i in range(n):\r\n for j in range(k - 1, n):\r\n a[i][j] = n * (k - 1) + (j - k + 2) + i * (n - k + 1)\r\nans = 0\r\nfor i in range(n):\r\n ans += a[i][k - 1]\r\nprint(ans)\r\nfor elem in a:\r\n print(' '.join(map(str, elem)))", "#from dust i have come dust i will be\r\n\r\nimport sys\r\n\r\nn,k=map(int,input().split())\r\na=[[0]*n for i in range(n)]\r\n\r\n#1st row, kth column\r\na[0][k-1]=n*n-n+k\r\n\r\n#rest of the kth column\r\nfor i in range(1,n):\r\n a[i][k-1]=a[i-1][k-1]-(n-k+1)\r\n\r\n\r\nfor i in range(n):\r\n x=a[i][k-1]+1\r\n for j in range(k,n):\r\n a[i][j]=x\r\n x+=1\r\n\r\nx=1\r\nfor i in range(n):\r\n for j in range(k-1):\r\n a[i][j]=x\r\n x+=1\r\n\r\ncnt=0\r\nfor i in range(n):\r\n cnt+=a[i][k-1]\r\n\r\nprint(cnt)\r\nfor i in range(n):\r\n for j in range(n):\r\n sys.stdout.write(str(a[i][j])+\" \")\r\n\r\n print()", "n, k = map(int, input().split())\r\na = []\r\nfor i in range(1, (n*(k-1)) + 1):\r\n a.append(i)\r\na = a[::-1]\r\nlst = []\r\nfor i in range((n*(k-1)) + 1, (n*n) + 1):\r\n lst.append(i)\r\nlst = lst[::-1]\r\ns = 0\r\nans = \"\"\r\nfor i in range(1, n + 1):\r\n for j in range(1, n + 1):\r\n if j < k:\r\n ans += str(a.pop()) + \" \"\r\n else:\r\n if j == k:\r\n s += lst[-1]\r\n ans += str(lst.pop()) + \" \"\r\n ans += \"\\n\"\r\nprint(s)\r\nprint(ans)", "n, k = map(int, input().split(' '))\r\na, x, y, s = [], 1, n * (k - 1) + 1, 0\r\nfor i in range(n):\r\n\ta.append([])\r\n\tfor j in range(k - 1):\r\n\t\ta[i].append(x)\r\n\t\tx += 1\r\n\tfor j in range(n - k + 1):\r\n\t\ta[i].append(y)\r\n\t\ty += 1\r\n\ts += a[i][k-1]\r\nprint(s)\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tprint(a[i][j], end=' ')\r\n\tprint()\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\n\r\ntable1 = []\r\np = 1\r\nfor i in range(n):\r\n table1.append([])\r\n for j in range(1, k):\r\n table1[i].append(p)\r\n p += 1\r\nfor i in range(n):\r\n for j in range(n - k + 1):\r\n table1[i].append(p)\r\n p += 1\r\ns = 0\r\nfor i in range(n):\r\n s += table1[i][k - 1]\r\nprint(s)\r\nfor i in range(n):\r\n print(' '.join([str(j) for j in table1[i]]))\r\n #for j in range(n):\r\n # print(table1[i][j], end = ' ')\r\n #print()\r\n#print('\\n'.join([' '.join([str(j) for j in i]) for i in table1]))\r\n", "n, k = [int(x) for x in input().split()]\r\ns = [x for x in range(1, (n) ** 2 + 1)]\r\ntab = []\r\nsm = 0\r\nl = n - k + 1\r\n\r\nfor i in range(n):\r\n t = s[:k - 1] + s[-l:]\r\n s = s[k - 1:-l]\r\n sm =sm + t[k-1]\r\n tab.append(t)\r\n \r\nprint(sm)\r\nfor i in range(n):\r\n for j in range(n):\r\n if (j != n-1): \r\n print(tab[i][j], end = \" \")\r\n else: \r\n print(tab[i][j])", "n, k = map(int, input().split())\r\n\r\nleft = 1\r\nright = n ** 2\r\n\r\nsum = right - (n - k)\r\ns = sum\r\nfor _ in range(n - 1):\r\n s -= (n - k + 1)\r\n sum += s\r\nprint(sum)\r\n\r\nfor _ in range(n):\r\n ans = []\r\n if k > 1:\r\n ans.append(' '.join(map(str, range(left, left + (k - 1)))))\r\n ans.append(' '.join(map(str, range(right - (n - k), right + 1))))\r\n print(' '.join(ans))\r\n left += (k - 1)\r\n right -= (n - k + 1)", "R = lambda : map(int, input().split())\nn,k = R()\n\nl = 0\nr = [[0 for _ in range(n)] for _ in range(n)]\n\nfor i in range(n):\n for j in range(k-1):\n l += 1\n r[i][j] = l\n\nfor i in range(n):\n for j in range(k-1,n):\n l += 1\n r[i][j] = l\n\n\ns = 0\nfor i in range(n):\n s += r[i][k-1]\nprint(s)\nfor i in range(n):\n print(*r[i])\n ", "n, k = list(map(int, input().split()))\r\ntabl = [[0 for i in range(n)] for i in range(n)]\r\nmaxx = n ** 2\r\nminn = 1\r\nsumm = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if j < k - 1:\r\n tabl[i][j] = minn\r\n minn += 1\r\n else:\r\n tabl[i][j] = maxx - (n - j) + 1\r\n maxx -= (n - k + 1)\r\n summ += tabl[i][k-1]\r\nprint(summ)\r\nfor i in range(n):\r\n print(*tabl[i])", "n,k = map(int,input().split())\r\nans = [[0 for i in range(n)]for i in range(n)]\r\n\r\n# arr = [i for i in range(1,n**2+1)]\r\n\r\n\r\ncurr = 0\r\ni = 1\r\nfor x in range(n):\r\n for j in range(k-1):\r\n ans[x][j] = i\r\n i += 1\r\nan = 0\r\nfor x in range(n):\r\n for j in range(k-1,n):\r\n ans[x][j] = i\r\n i += 1\r\n if j == k-1:\r\n an += ans[x][j]\r\nprint(an)\r\nfor i in range(n):\r\n print(*ans[i])\r\n", "inp = input()\r\ninp = inp.split()\r\nn = int(inp[0])\r\nk = int(inp[1])-1\r\n\r\nans = 0\r\ncount=1\r\ntable = [[0] * n for i in range(n)]\r\n\r\nfor i in range(k):\r\n for j in range(n):\r\n table[j][i]=count\r\n count = count + 1\r\n\r\nfor i in range(n):\r\n for j in range(k,n):\r\n table[i][j]=count\r\n count = count + 1\r\n\r\nfor i in range(n):\r\n ans = ans + table[i][k]\r\n\r\nprint (ans)\r\n\r\nfor i in table:\r\n for j in i:\r\n print (j, end=' ')\r\n print ()", "n, k = map(int, input().split())\r\na = [[0] * n for _ in range(n)]\r\ns = 0\r\nc = n * n\r\nfor i in range(n):\r\n for j in range(n - 1, k - 2, -1):\r\n a[i][j] = c\r\n if j == k - 1:\r\n s += c\r\n c -= 1\r\nfor i in range(n):\r\n for j in range(k - 2, -1, -1):\r\n a[i][j] = c\r\n c -= 1\r\nprint(s)\r\nprint('\\n'.join([' '.join(map(str, _)) for _ in a]))", "def solve(n,k):\r\n sum = ((n-1)*(n-1)+k*(n+1))*n // 2\r\n res = [[]]\r\n tmp = []\r\n for j in range(k-1):\r\n res[0].append(j+1)\r\n for j in range(n-k+1):\r\n res[0].append(j+1+n*(k-1))\r\n for i in range(n-1):\r\n for j in range(k-1):\r\n tmp.append(res[i][j]+k-1)\r\n for j in range(k-1,n,1):\r\n tmp.append(res[i][j]+n-k+1)\r\n res.append(tmp)\r\n tmp = []\r\n print(sum)\r\n return res\r\n \r\ns = [int(x) for x in input().split()]\r\nres = solve(s[0],s[1])\r\nfor x in res:\r\n for y in x[:-1]:\r\n print(y, end = ' ')\r\n print(x[-1])", "n, m = map(int, input().split())\nn1, n2 = 1, (m - 1) * n + 1\nans = 0\nprint(n * (n - 1) // 2 * (n - m + 1) + n2 * n)\nfor i in range(n):\n j = 0\n while j < m - 1:\n print(n1, end=' ')\n n1 += 1\n j += 1\n while j < n:\n print(n2, end=' ')\n n2 += 1\n j += 1\n print()", "from itertools import count\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 ans = [[0 for j in range(n)] for i in range(n)]\r\n for j in range(n - 1, k - 2, -1):\r\n cur = n ** 2 - (n - 1 - j)\r\n for i in range(n):\r\n ans[i][j] = cur\r\n cur -= (n - k + 1)\r\n c = count(1)\r\n for i in range(n):\r\n for j in range(k - 1):\r\n ans[i][j] = next(c)\r\n print(sum(ans[i][k - 1] for i in range(n)))\r\n for row in ans:\r\n print(*row)\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 = [int(x) for x in input().split(' ')]\r\nans = 0\r\ny = n*(k-1)+1\r\nx = 1\r\nbarr = []\r\nfor i in range(n):\r\n arr = []\r\n for j in range(k-1):\r\n arr.append(x)\r\n x += 1\r\n for j in range(k-1, n):\r\n arr.append(y)\r\n y += 1\r\n ans += arr[k-1]\r\n barr.append(' '.join(map(str, arr)))\r\nprint(ans)\r\nprint('\\n'.join(barr))", "import collections\r\nimport math\r\n\r\ndef is_prime(x): \r\n for i in range(2, math.ceil(math.sqrt(x))):\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\nn, k = map(int, input().split())\r\nT = [[0] * n for _ in range(n)]\r\nans = 0\r\ns = n * n\r\nfor i in range(n):\r\n for j in range(n - k + 1):\r\n T[i][n - j - 1] = s\r\n s -= 1\r\na = 1\r\nfor i in range(n):\r\n for j in range(k - 1):\r\n T[i][j] = a\r\n a += 1\r\nfor i in range(n):\r\n ans += T[i][k - 1]\r\nprint(ans)\r\nfor i in range(n):\r\n print(' '.join(map(str, T[i])))", "n,k=map(int,input().split())\r\nprint(n*(n*n +(k-2)*n+k+1)//2)\r\nt1=[([0]*n) for i in range(n)]\r\nfor j in range(k-1):\r\n for i in range(n):\r\n t1[i][j]=i+1+n*j\r\nfor i in range(n):\r\n for j in range(k-1,n):\r\n t1[i][j]=j+i*(n-k+1)+n*(k-1)+2-k\r\nfor i in range(n):\r\n print(' '.join(str(j) for j in t1[i]))\r\n" ]

[ "import sys\r\n\r\ndef check(text):\r\n legal = 'AHIMOTUVWXY'\r\n for i in text:\r\n if i not in legal:\r\n return False\r\n rev = list(text)\r\n rev.reverse()\r\n if text != ''.join(rev):\r\n return False\r\n return True\r\n\r\nif __name__ == '__main__':\r\n text = sys.stdin.readline().split()[0]\r\n if check(text):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "if __name__ == '__main__':\r\n t = input()\r\n s = \"AHIMOTUWVXY\"\r\n ans = 1\r\n\r\n for i in t:\r\n if s.find(i) == -1:\r\n ans = 0\r\n break\r\n print(\"YNEOS\"[not (ans and t == t[::-1])::2])", "a=input().upper()\r\nMirror=\"AHIMOTUVWXY\"\r\nif a==a[::-1]:\r\n x=\"True\"\r\n for i in a:\r\n if i in Mirror: pass\r\n else: x=\"FALSE\"; break\r\n if x==\"True\": print(\"YES\")\r\n else: print(\"NO\")\r\nelse: print(\"NO\")", "que='AHIMOTUVWXY'\r\ns=input()\r\ndef solve():\r\n for i in s:\r\n if i not in que:\r\n print(\"NO\")\r\n return\r\n for i in range(len(s)//2):\r\n if(s[i]!=s[-i-1]):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\nsolve()", "n=input()\r\ni=0\r\nk=len(n)-1\r\n_b=True\r\nwhile i<=k and _b:\r\n\tif n[i]==n[k] and n[i] in ['A','H','I','M','O','T','U','V','W','X','Y']:\r\n\t\t_b=True\r\n\t\ti+=1\r\n\t\tk-=1\r\n\telse:\r\n\t\t_b=False\r\nif _b: print('YES')\r\nelse: print('NO')", "name=str(input())\nd=True\nmirror=True\nletters=[\"B\",\"C\",\"D\",\"E\",\"F\",\"G\",\"J\",\"K\",\"L\",\"N\",\"P\",\"Q\",\"R\",\"S\",\"Z\"]\nfor l in letters:\n if(l in name):\n d=False\n\nif(d==False):\n print(\"NO\")\n\nelse:\n for i in range(int(len(name)/2)):\n if(name[i]!=name[len(name)-i-1]):\n mirror=False\n break\n if(mirror): \n print(\"YES\")\n else:\n print(\"NO\")\n", "s = input()\r\nb = s[::-1]\r\nl = [\"A\",\"H\",\"I\",\"M\",\"O\",\"T\",\"U\",\"V\",\"W\",\"X\",\"Y\"]\r\nif b==s:\r\n\tflag = 0\r\n\tfor i in set(s):\r\n\t\tif i not in l:\r\n\t\t\tprint(\"NO\")\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\tif flag==0:print(\"YES\")\r\nelse:print(\"NO\")\t\t\t ", "#!/usr/bin/env python3\n\ndef verify_palindrome(s):\n\tif s == s[::-1]:\n\t\treturn True\n\telse:\n\t\treturn False\n\n\ns = str(input())\n\nletters = \"BCDEFGJKLNPQRSZ\"\n\nflag = True\n\nfor letter in letters:\n\tif letter in s:\n\t\tflag = False;\n\t\tbreak\n\nif flag and verify_palindrome(s):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\n \t \t \t \t\t\t\t\t \t\t \t \t", "def ic(s):\r\n\tss=set('AHIMOTUVWXY')\r\n\tm=len(s)//2+1\r\n\tfor c in range(m):\r\n\t\tif s[c]!=s[-(c+1)] or s[c] not in ss:\r\n\t\t\treturn 0\r\n\treturn 1\r\n\r\ns='YES' if ic(input()) else 'NO'\r\nprint(s)", "t = input()\r\nd = (\"A\",\"H\",\"I\",\"M\",\"O\",\"T\",\"U\",\"V\",\"W\",\"X\",\"Y\")\r\nfor i in t:\r\n if i not in d:\r\n \tprint(\"NO\")\r\n \texit()\r\nif t == t[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "sym={\"A\", \"H\", \"I\", \"M\", \"O\",\"T\", \"U\", \"V\", \"W\", \"X\", \"Y\"}\r\ns=input()\r\nif s[::-1]==s:\r\n for x in s:\r\n if x not in sym:\r\n print(\"NO\")\r\n break\r\n \r\n else:\r\n print(\"YES\")\r\n \r\nelse:\r\n print(\"NO\")", "def solve(s):\r\n symmetric_letters = {'A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y'}\r\n n = len(s)\r\n\r\n for i in range(0, round(n / 2) + 1):\r\n left_char = s[i]\r\n right_char = s[n - i - 1]\r\n if left_char not in symmetric_letters \\\r\n or right_char not in symmetric_letters \\\r\n or left_char != right_char:\r\n return \"NO\"\r\n\r\n return \"YES\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n print(solve(s))\r\n", "s =list(input())\r\nif any(x in s for x in ['B', 'C', 'D', 'E', 'F', 'G', 'J', 'K', 'L', 'N', 'P', 'Q', 'R', 'S', 'Z']):\r\n print('NO')\r\nelif s == s[::-1]: print(\"YES\")\r\nelse: print('NO')", "s=input()\r\nflag=0\r\nfor i in range(len(s)):\r\n\tif s[i] not in 'AHIMTUOXVWY':\r\n\t\tflag=1\r\n\t\tbreak\r\n\tif s[i]!=s[-i-1]:\r\n\t\tflag=1\r\nif flag==0:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n = input()\nm = 'AHIMOTUVWXY'\nif n != n[::-1]:\n print('NO')\n exit()\nfor l in n[:(len(n) // 2) + 1]:\n if l not in m:\n print('NO')\n exit()\nprint('YES')", "s = input()\r\ntest = \"AHIMOTUVWXY\"\r\nk = True\r\nfor i in range(len(s)):\r\n if s[i] not in test:\r\n k = False\r\n\r\nif k and s == s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=\"AHIMOTUVWXY\"\ns=input()\nprint(('NO','YES')[s==s[::-1] and all(x in a for x in s)])\n\t\t\t\t \t \t \t\t \t\t \t\t \t \t \t \t\t", "import math , itertools , fractions , random\r\nfrom collections import Counter as cc\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());ars = lambda : list(map(str , input().split()))\r\n'''\r\n⠀⠀⠀⠀⠀⠀⠀⢀⣤⣴⣶⣶⣶⣶⣶⣦⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢀⣾⠟⠛⢿⣿⣿⣿⣿⣿⣿⣷⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢸⣿⣄⣀⣼⣿⣿⣿⣿⣿⣿⣿⠀⢀⣀⣀⣀⡀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠈⠉⠉⠉⠉⠉⠉⣿⣿⣿⣿⣿⠀⢸⣿⣿⣿⣿⣦⠀\r\n⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⢸⣿⣿⣿⣿⣿⡇\r\n⢰⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠿⠿⠿⠿⠿⠿⠋⠀⣼⣿⣿⣿⣿⣿⡇\r\n⢸⣿⣿⣿⣿⣿⡿⠉⢀⣠⣤⣤⣤⣤⣤⣤⣤⣴⣾⣿⣿⣿⣿⣿⣿⡇\r\n'''\r\nx= \"AHIMOTUVWXY\"\r\ns = si() ; c = 0 \r\nfor i in s : \r\n if i in x :c+=1 \r\nprint('YES' if c == len(s) and s == s[::-1] else 'NO' )\r\n'''\r\n⢸⣿⣿⣿⣿⣿⡇⠀⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀\r\n⠘⣿⣿⣿⣿⣿⡇⠀⣿⣿⣿⣿⣿⠛⠛⠛⠛⠛⠛⠛⠛⠛⠋⠁⠀⠀\r\n⠀⠈⠛⠻⠿⠿⠇⠀⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⣿⡇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣧⣀⣀⣿⠇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠘⢿⣿⣿⣿⣿⣿⣿⣿⡿⠋⠀⠀⠀⠀⠀⠀⠀\r\n'''", "\"\"\"\nhttps://codeforces.com/problemset/problem/420/A\n\"\"\"\nchaine = input()\n\n\ndef is_palindrome(c):\n return c == c[::-1]\n\n\ndef bonnes_lettres(c):\n lettres = \"AHIMOTUVWXY\"\n for l in c:\n if l not in lettres:\n return False\n return True\n\n\nif bonnes_lettres(chaine) and is_palindrome(chaine):\n print(\"YES\")\nelse:\n print(\"NO\")\n", "def reverse(s):\r\n temp_list = list(s)\r\n temp_list.reverse()\r\n return ''.join(temp_list)\r\nl = 'AHIMOTUVWXY'\r\n\r\ns = input()\r\nif s !=reverse(s):\r\n print('NO')\r\nelse:\r\n f = 0\r\n for i in s:\r\n if i not in l:\r\n f+=1\r\n break\r\n if f==1:\r\n print('NO')\r\n else:\r\n print('YES') \r\n ", "symmetric = 'AHIMOTUVWXY'\ns = input()\nif s == s[::-1] and all([x in symmetric for x in s]):\n print('YES')\nelse:\n print('NO')", "def main():\n s = input()\n\n if s.__contains__(\"B\") or s.__contains__(\"C\") or s.__contains__(\"D\") or s.__contains__(\"E\") or s.__contains__(\n \"F\") or s.__contains__(\"G\") or s.__contains__(\"J\") or s.__contains__(\"K\") or s.__contains__(\n \"L\") or s.__contains__(\"N\") or s.__contains__(\n \"P\") or s.__contains__(\"Q\") or s.__contains__(\"R\") or s.__contains__(\"S\") or s.__contains__(\"Z\"):\n print(\"NO\")\n elif s == s[::-1]:\n print(\"YES\")\n else:\n print(\"NO\")\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", "a = list(input())\r\nb = list(\"AHIMOTUVWXY\")\r\nflag = True\r\nfor i in a:\r\n if i not in b:\r\n flag = False\r\n break\r\nfor i in range(len(a)//2):\r\n if a[i] != a[len(a)-1-i]:\r\n flag = False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "mirrorLetters = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\n\npossible = True\nword = input()\nsizeWord = len(word)\nmiddleLetter = sizeWord // 2\n\nfor l in word:\n if l not in mirrorLetters:\n possible = False\n break\n\nif possible:\n # sizeWord even\n if sizeWord % 2 == 0:\n\n leftWord = word[:middleLetter]\n rightword = word[middleLetter:]\n rightword = rightword[::-1]\n\n # sizeWord odd\n else:\n leftWord = word[:middleLetter]\n rightword = word[middleLetter + 1:]\n rightword = rightword[::-1]\n \n if leftWord != rightword:\n possible = False\n\n\nif possible:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t \t\t \t \t\t \t \t\t \t\t", "ls = set(\"AHIMOTUVWXY\")\r\nss = list(input())\r\nif len(set(ss)-ls)==0:\r\n if ss[::-1]==ss:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "def main():\n s = input()\n print((\"NO\", \"YES\")[s == s[::-1] and all(c in \"AHIMOTUVWXY\" for c in s)])\n\n\nif __name__ == '__main__':\n main()\n", "from collections import Counter\n\n\ndef check_name(name):\n mirror_letters = ['A','H','I','M','O','T','U','V','W','X','Y']\n mirror_dict = Counter(mirror_letters)\n l = len(name)\n for i in range(1+(l//2)):\n if name[i] == name[l-i-1] and mirror_dict[name[i]] > 0:\n continue\n else:\n return False\n return True\n\nname = input()\nif check_name(name):\n print('YES')\nelse:\n print('NO')\n\t\t \t \t\t \t \t \t \t \t \t", "valid = 'AHIMOTUVWXY'\r\n\r\ns = input()\r\n\r\nf = True\r\nfor i in s:\r\n if i not in valid:\r\n f = False\r\n break\r\n\r\nif s != s[::-1]:\r\n f = False\r\n\r\nprint(\"YES\" if f else \"NO\")", "def isnorm(s):\r\n for i in range(len(s)):\r\n if set('AHIMOTUWVXY').isdisjoint(s[i]):\r\n return False\r\n return True\r\n\r\ndef palind(s):\r\n i = 0\r\n j = len(s) - 1\r\n while( i < j ):\r\n if s[i] != s[j]:\r\n return False\r\n i += 1\r\n j -= 1\r\n return True\r\n\r\ndef main():\r\n inp = input()\r\n if not palind(inp) or not isnorm(inp):\r\n return \"NO\"\r\n else:\r\n return \"YES\"\r\n\r\nprint( main() )\r\n", "s = input()\r\na = set([chr(i + ord('A')) for i in range(26)])\r\nb = set(s)\r\nc = set(['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y'])\r\na &= b\r\nif a<=c and s==s[::-1]:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "n=input();cnt=0;p=\"\";a=[\"A\",\"H\",\"I\",\"M\",\"O\",\"T\",\"U\",\"V\",\"W\",\"X\",\"Y\"]\r\nfor i in range(len(n)-1,-1,-1) :\r\n p=p+n[i]\r\n if n[i] in a :\r\n cnt+=1\r\nif cnt==len(n) and p==n :\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n", "s = input()\r\nflag = 1\r\nfor i in s:\r\n if i in \"AHIMOTUVWXY\":\r\n pass\r\n else:\r\n flag = 0\r\n break\r\nif flag==1:\r\n if s==s[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "# https://codeforces.com/contest/421/problem/B\r\n# 1000\r\ndef palin(n,k):\r\n for i in range(k//2):\r\n if n[i]!=n[k-i-1]:\r\n return False\r\n return True\r\ns=input()\r\nl=['A','H','W','I','M','Y','X','O','T','U','V']\r\nif palin(s,len(s)):\r\n for i in s:\r\n if i not in l:\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "# coding=utf-8\r\ns=input()\r\nflag=1\r\nfor i in range(len(s)//2):\r\n# print(s[i],end='****')\r\n if s[i]!=s[len(s)-i-1] or s[i] not in ['A','H','I','M','O','T','U','V','W','X','Y']:\r\n flag=0\r\n break\r\nif flag>0 and s[len(s)//2] in ['A','H','I','M','O','T','U','V','W','X','Y']:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\t \t\t \t \t \t\t\t \t \t\t\t\t\t \t \t", "def isMirror(s):\r\n symmetric_letters = {'A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y'}\r\n\r\n for i in range(0, int(len(s)/2)+1):\r\n left_char = s[i]\r\n right_char = s[len(s) - i - 1]\r\n\r\n if left_char != right_char or left_char not in symmetric_letters:\r\n return \"NO\"\r\n return \"YES\"\r\n\r\ns = input() \r\nprint(isMirror(s))# 1698167231.304009", "s=input()\r\nn=len(s)\r\ncheck=1\r\na=['A','H','I','M','O','T','U','V','W','X','Y']\r\nfor i in range(n//2):\r\n if s[i]!=s[n-1-i]:\r\n check=0\r\n break\r\n else:\r\n if s[i] not in a or s[n-1-i] not in a:\r\n check=0\r\n break\r\nif check==0:\r\n print('NO')\r\nelse:\r\n if n%2==0:\r\n print('YES')\r\n else:\r\n if s[n//2] not in a:\r\n print('NO')\r\n else:\r\n print('YES')", "s = input()\ndef solve(string):\n for i in s:\n if i not in \"AHIMOTUVWXY\":\n return(\"NO\")\n if s[::-1] == s:\n return(\"YES\")\n else:\n return(\"NO\")\nprint(solve(s))\n", "s=input()\r\nl=['A','H','I','M','O','T','U','V','W','X','Y']\r\nc=0\r\nfor i in s:\r\n if i in l:\r\n c+=1\r\n else:\r\n break\r\nif c==len(s):\r\n if s==s[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s = input().strip()\r\nfl = True\r\nfor i in s:\r\n if i not in 'AHIMOTUVWXY':\r\n fl = False\r\n break\r\nif (s == s[::-1] and fl):\r\n print('YES')\r\nelse:\r\n print('NO')", "l=input()\r\nprint([\"NO\",\"YES\"][all([p in\"AHIMOTUVWXY\"for p in l])and l==l[::-1]])", "if __name__ == '__main__':\n aux = input()\n validos = [\"A\", \"H\", 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\n\n for i in aux:\n if i not in validos:\n print(\"NO\")\n exit(0)\n\n if aux == aux[::-1]:\n print(\"YES\")\n else:\n print(\"NO\")\n\n \t \t \t\t \t \t\t\t\t \t\t\t \t \t\t\t", "str1 = str(input())\r\nstr2 = str1[::-1]\r\nop = ['A','H','I','M','O','T','U','V','W','X','Y']\r\nflag = 0\r\nif(str2 == str1):\r\n flag = 1\r\n for char in str1:\r\n if char not in op:\r\n flag = 0\r\nif flag == 1:\r\n print(\"YES\")\r\nelse:print(\"NO\")", "cup = set('AHIMOTUVWXY')\r\ns = input()\r\nls = list(s)\r\nls.reverse()\r\nt = ''.join(ls)\r\nif (s == t) and (set(s).issubset(cup)):\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nprint('YNEOS'[a!=a[::-1]or any(x not in 'AHIMOTUVWXY' for x in a)::2])", "s = input()\r\nfor i in s:\r\n if i not in 'AHIMOTUVWXY':\r\n print(\"NO\")\r\n exit(0)\r\nx = s[::-1]\r\nif s == x:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "s=input()\r\nM={\"A\",\"H\",\"I\",\"M\",\"O\",\"T\",\"U\",\"V\",\"W\",\"X\",\"Y\"}\r\nans=\"YES\"\r\nn=len(s)\r\nfor i in range(len(s)//2):\r\n x=s[i]\r\n y=s[n-i-1]\r\n if(x!=y or x not in M):\r\n ans=\"NO\"\r\n break\r\nif(n%2==1):\r\n if(s[n//2] not in M):\r\n ans=\"NO\"\r\nprint(ans)\r\n \r\n", "\n\ngood = set('AHIMOTUVWXY')\n\nin_str = input(\"\")\n\nstr_len = len(in_str)\n\nresult = \"\"\n\ni = 0\n\nwhile(i < str_len/2):\n if((in_str[i] in good) and (in_str[i] == in_str[-1-i])):\n i += 1\n else:\n result = \"NO\"\n break\n\nif(result != \"NO\"):\n result = \"YES\"\n\nprint(result)\n \n", "name = input()\r\ni = len(name)\r\nif len(set(name) - set(['A','H','I','M','O','T','U','V','W','X','Y'])) != 0:\r\n print('NO')\r\nelse:\r\n if i == 0:\r\n print('YES')\r\n if i%2 == 0:\r\n j = int(i/2)\r\n if name[:j] != name[j:][::-1]:\r\n print('NO')\r\n else:\r\n print('YES')\r\n else:\r\n j = int(i/2)\r\n if name[:j] != name[j+1:][::-1]:\r\n print('NO')\r\n else:\r\n print('YES')", "\r\ndef isval(text):\r\n\r\n\ttext_rev = text[::-1]\r\n\r\n\tif text == text_rev:\r\n\t\tfor i in text:\r\n\t\t\tif i == \"B\" or i == \"C\" or i == \"D\" or i == \"E\" or i == \"F\" or i == \"G\" or i == \"J\" or i == \"K\" or i == \"L\" or i == \"N\" or i == \"P\" or i == \"Q\" or i == \"R\" or i == \"S\" or i == \"Z\":\r\n\t\t\t\tprint(\"NO\")\r\n\t\t\t\treturn\r\n\t\tprint(\"YES\")\r\n\t\treturn\r\n\tprint(\"NO\")\r\n\treturn\r\n\r\ntext = str(input())\r\n\r\nisval(text)", "def check(word):\n permitted = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\n for l in word:\n if l not in permitted:\n return 'NO'\n return 'YES' if word == ''.join(reversed(word)) else 'NO'\n\n\n\n\nword = input()\nprint(check(word))\n\n \t\t \t \t\t \t \t\t \t\t \t\t \t \t", "def startup():\n nome = input()\n permitido = {caractere:1 for caractere in 'AHIMOTUVWXY'}\n espelho = nome[::-1]\n foi=1\n tamanho = len(nome)\n for count, c in enumerate(nome):\n if(count>tamanho/2):\n break\n try:\n permitido[c]+=1\n if(nome[count]!=espelho[count]):\n foi=0\n break\n except:\n foi=0\n break\n print('YES') if foi else print('NO')\nstartup()\n\t\t \t\t \t \t \t\t\t\t \t\t \t\t\t\t", "s = list(input())\n\nmirroredLetters = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\nisMirror = not len([x for x in s if x not in mirroredLetters])\nfor i in range(len(s) // 2):\n if s[i] != s[-(i+1)]:\n isMirror = False\n break\n\nif isMirror:\n print('YES')\nelse:\n print('NO')\n \t \t\t \t \t\t \t \t\t\t \t\t\t \t \t", "nama = input()\nstatus = False\nnama = list(nama)\nfor i in nama:\n if i==\"A\" or i==\"I\" or i==\"M\" or i==\"H\" or i==\"O\" or i==\"V\" or i == \"U\" or i==\"W\" or i==\"X\" or i==\"Y\" or i==\"T\":\n ind = nama.index(i)\n a = ind+1\n if i != nama[-a]:\n status = False\n break\n else:\n status = True\n else:\n status = False\n break\n\nif status:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t\t \t\t \t \t\t \t \t \t\t\t \t \t", "def palindrome(n):\r\n for i in range(0,len(n)):\r\n if n[i] != n[-(i+1)]:\r\n return 0\r\n return 1\r\n\r\nlessgo = ['a','h','i','m','o','t','u','v','w','x','y']\r\ni = list(input())\r\nfor j in range(len(i)):\r\n i[j] = i[j].lower()\r\n\r\nmir = 1\r\nfor j in range(len(i)):\r\n if i[j] not in lessgo:\r\n mir = 0\r\nif palindrome(i) == 1 and mir == 1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def checkLetters(word, mirroble_letters):\n for letter in word:\n if letter not in mirroble_letters:\n return False\n return True\n\n\ndef main():\n mirroble_letters = [\"A\", \"H\", \"I\", \"M\", \"O\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\"]\n word = [x for x in input()]\n middle = len(word)//2\n if len(word) % 2 == 2 and word[middle] not in mirroble_letters:\n print(\"NO\")\n exit()\n\n if len(word) % 2 == 2 and word[middle] in mirroble_letters:\n second_half.pop(0)\n\n if not checkLetters(word, mirroble_letters):\n print(\"NO\")\n exit()\n\n middle = len(word)//2\n first_half = word[:middle]\n second_half = word[middle:]\n\n if len(second_half) > len(first_half):\n second_half.pop(0)\n\n second_half = second_half[::-1]\n\n for index in range(len(first_half)):\n if first_half[index] != second_half[index] or first_half[index] not in mirroble_letters:\n print(\"NO\")\n exit()\n print(\"YES\")\n\n\nmain()\n\n \t\t\t\t \t \t\t\t \t\t\t\t \t", "s=str(input())\r\n\r\nflag=0\r\nfor i in s:\r\n if(i not in 'AHIMOTUVWXY'):\r\n flag=1\r\n break\r\n\r\nif(flag==1):\r\n print(\"NO\")\r\nelse:\r\n for i in range(0,len(s)):\r\n if(s[i]!=s[len(s)-1-i]):\r\n flag=1\r\n break\r\n if(flag==1):\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n", "n = input()\r\nz = n[::-1]\r\na = 'AHIMOTUYXWV'\r\nfor i in range(len(n)):\r\n if n[i] not in a:\r\n print('NO')\r\n exit(0)\r\nif n == z:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "x = input();\r\nis_mirror=\"YES\"\r\nbad_list=[\"B\",\"C\",\"D\",\"E\",\"F\",\"G\",\"J\",\"K\",\"L\",\"N\",\"P\",\"Q\",\"R\",\"S\",\"Z\"]\r\nfor letter in x:\r\n if letter in bad_list:\r\n is_mirror=\"NO\"\r\n break\r\nlist=[]\r\nif is_mirror==\"YES\":\r\n for letter in x:\r\n list.append(letter)\r\nn=len(list)\r\nfor i in range(n-1):\r\n if list[i]!=list[n-1-i]:\r\n is_mirror=\"NO\"\r\nprint(is_mirror)\r\n", "i=input()\r\nn=len(i)\r\nd=\"BCDEFGJKLNPQRSZ\"\r\nfor x in i:\r\n if x in d:\r\n print(\"NO\")\r\n break\r\nelse:\r\n for x in range(n // 2):\r\n if i[x] != i[n - x - 1]:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")", "from math import ceil\n\n\nw = str(input())\n\nnmr = \"BCDEFGJKLNPQRSZ\"\n\nif any(char in w for char in nmr):\n print(\"NO\")\n exit()\n\nif (len(w) % 2 == 0):\n fh = w[:int(len(w)/2)]\n if fh[::-1] == w[int(len(w)/2):]:\n print(\"YES\")\n else:\n print(\"NO\")\n exit()\n\n\nfh = w[:(ceil(len(w)/2)) - 1]\n\nif fh[::-1] == w[(ceil(len(w)/2)):]:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t \t \t\t\t\t \t \t\t\t", "from operator import le\nfrom string import ascii_uppercase as alc\nimport math\n\nis_same_on_mirror = {}\nfor letter in alc:\n is_same_on_mirror[letter] = False\n \nis_same_on_mirror['A'] = True\nis_same_on_mirror['H'] = True\nis_same_on_mirror['I'] = True\nis_same_on_mirror['M'] = True\nis_same_on_mirror['O'] = True\nis_same_on_mirror['T'] = True\nis_same_on_mirror['U'] = True\nis_same_on_mirror['V'] = True\nis_same_on_mirror['W'] = True\nis_same_on_mirror['X'] = True\nis_same_on_mirror['Y'] = True\n\nname = input()\nmatches = True\nfor i in range(int(math.ceil(len(name) / 2))):\n if (not is_same_on_mirror[name[i]] or name[i] != name[len(name) - i - 1]):\n matches = False\n break\n \nif (matches):\n print('YES')\nelse:\n print('NO')\n\t\t\t \t \t \t \t \t \t \t\t \t", "z = input()\r\nalps = \"AHIMOTUVWXY\"\r\nr = 1\r\nfor i in z:\r\n if i not in alps:\r\n r = 0\r\n break\r\n\r\nif r:\r\n if z == z[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nelse:\r\n print(\"NO\")", "s=input()\r\nl=['a','h','i','m','o','t','u','v','w','x','y']\r\nif s==s[::-1]:\r\n\tfor x in range(len(s)):\r\n\t\tif s[x].lower() not in l:\r\n\t\t\tprint('NO')\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint('YES')\r\nelse:\r\n\tprint('NO')", "a=\"AHIMOTUVWXY\"\nb=input()\nfor i in range((len(b)+1)//2):\n\tif (b[i]!=b[len(b)-1-i])or (not(b[i] in a))or (not(b[len(b)-1-i] in a)): \n\t\tprint(\"NO\")\n\t\texit()\nprint(\"YES\")\n\t\n", "# -*- coding: utf-8 -*-\n\nMIRROR_LETTERS = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\n\nname = list(input())\nans = True\n\nfor c in name:\n if c not in MIRROR_LETTERS:\n ans = False\n break\n\nif ans and name != name[ : :-1]:\n ans = False\n\nif ans:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t\t \t \t \t\t\t\t \t\t\t\t\t \t\t \t\t\t", "n=input()\r\nif(\"B\" in n or \"C\"in n or\"D\"in n or \"E\"in n or \"F\"in n or \"G\"in n or \"J\"in n or \"K\"in n or \"L\"in n or \"N\"in n or\r\n \"P\"in n or \"Q\"in n or \"R\"in n or \"S\"in n or \"Z\"in n ):\r\n print(\"NO\")\r\nelse:\r\n ans=\"YES\"\r\n for i in range(0,len(n)//2):\r\n if(n[i]!=n[len(n)-i-1]):\r\n ans=\"NO\"\r\n print(ans)\r\n ", "s=input()\r\nn=len(s)\r\nrev=s[::-1]\r\nflag=0\r\nl = 'AHIMOTUVWXY'\r\nfor i in s:\r\n if i not in l:\r\n flag=1\r\n print(\"NO\")\r\n break\r\nif(flag==0):\r\n if(s==rev):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n", "s = input()\r\nr = 1\r\nmid = (len(s)%2 == 0)*(len(s)//2) + (len(s)%2 !=0)*(len(s)//2 + 1)\r\nnon_mirror = 'BCDEFGJKLNPQRSZ'\r\nfor i in range (len(s)):\r\n if s[i] in non_mirror:\r\n r = 0\r\n break\r\nif r:\r\n for i in range(len(s)//2):\r\n if s[i] != s[-(i+1)]:\r\n r = 0\r\n break\r\n \r\nprint(['NO', 'YES'][r])\r\n\r\n", "s = input()\r\nif s == s[::-1] and not 'N' in s and not 'L' in s and not'G' in s and not 'F' in s and not 'R' in s and not 'S' in s and not 'C' in s and not 'Q' in s and not 'B' in s and not 'E' in s and not 'D' in s and not 'J' in s and not 'K' in s and not 'Z' in s and not 'P' in s:\r\n print('YES')\r\nelse:\r\n print('NO')", "def solve():\r\n s = input()\r\n good_chars = set(\"AHIMOTUVWXY\")\r\n for i in range(len(s) // 2 + 1):\r\n if s[i] not in good_chars or s[i] != s[-1 - i]:\r\n return \"NO\"\r\n return \"YES\" \r\nprint(solve())", "s = input()\r\na = ['A','H','I','M','O','T','U','V','W','X','Y']\r\nflag = 1\r\nfor i in s:\r\n\tif i not in a: flag=0;break\r\nif flag==1 and s == s[::-1]: print(\"YES\")\r\nelse: print(\"NO\")", "def ispalindrome(n): \r\n return n == n[::-1]\r\nn=input()\r\nl = ['A','H','I','M','O','T','U','V','W','X','Y']\r\nif(len(n)==1 and n[0] in l):\r\n print(\"YES\")\r\nelif(len(n)>1):\r\n flag = 0\r\n for i in range(len(n)):\r\n if(n[i] not in l):\r\n flag=1\r\n break;\r\n if(flag == 0 and ispalindrome(n)):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n\r\n \r\n", "name = input()\nmirror_letters = \"AHIMOTUVWXY\"\n\nif all(char in mirror_letters for char in name) and name == name[::-1]:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n\t\t\t \t\t \t\t\t\t \t \t \t \t \t", "from sys import stdin,stdout\r\nif __name__==\"__main__\":\r\n s=input()\r\n f=0\r\n t=\"AHIMOTUVWXY\"\r\n for i in s:\r\n if i not in t:\r\n print(\"NO\")\r\n f=1\r\n break\r\n r=s[::-1]\r\n # print(r)\r\n # if len(s)==1:print(\"NO\")\r\n if f==0:\r\n if s==r:print(\"YES\")\r\n else:print(\"NO\")", "name = input()\r\n\r\nmirrorLetters = ['A',\r\n'H',\r\n'I',\r\n'M',\r\n'O',\r\n'T',\r\n'U',\r\n'V',\r\n'W',\r\n'X',\r\n'Y']\r\nmirrored = True\r\nfor i in range(len(name)):\r\n\tif name[i] not in mirrorLetters:\r\n\t\tmirrored = False\r\n\r\nif mirrored:\r\n\tif name == ''.join(reversed(name)):\r\n\t print(\"YES\")\r\n\telse:\r\n\t print(\"NO\")\r\nelse:\r\n\tprint(\"NO\")", "s = input()\nr = 1\nmid = (len(s)%2 == 0)*(len(s)//2) + (len(s)%2 !=0)*(len(s)//2 + 1)\nnon_mirror = 'BCDEFGJKLNPQRSZ'\nfor i in range (len(s)):\n if s[i] in non_mirror:\n r = 0\n break\nif r:\n for i in range(len(s)//2):\n if s[i] != s[-(i+1)]:\n r = 0\n break\n \nprint(['NO', 'YES'][r])\n\n\t\t\t \t \t \t\t\t\t \t \t\t\t\t \t \t\t", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(s):\r\n for c in s:\r\n if c not in 'AHIMOTUVWXY':\r\n return False\r\n return s == s[::-1]\r\n\r\ndef main():\r\n if solve(input()):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = str(input())\r\nallowed = \"AHXOYWVMUIT\"\r\n\r\nflag = \"YES\"\r\nfor i in s:\r\n if i not in allowed:\r\n flag = \"NO\"\r\n break\r\n\r\n\r\nl, r = 0, len(s) - 1\r\nwhile l < r:\r\n if s[l] != s[r]:\r\n flag = \"NO\"\r\n break\r\n else:\r\n l += 1\r\n r -= 1\r\n\r\nprint(flag)", "word = input()\nalphabet = [\n 'A', 'B', 'C', 'D', \n 'E', 'F', 'G', 'H', \n 'I', 'J', 'K', 'L', \n 'M', 'N', 'O', 'P', \n 'Q', 'R', 'S', 'T', \n 'U', 'V', 'W', 'X', \n 'Y', 'Z'\n ]\n\nmirror_letters = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\n\ndef is_letters_mirror(word):\n result = True\n for letter in word:\n if letter not in mirror_letters:\n result = False\n return result\n return result\n\ndef is_parts_mirror(parts):\n result = False\n part_a, part_b = parts[0], parts[1][::-1]\n if part_a == part_b:\n result = True\n return result\n\nif len(word) == 1:\n result = 'NO'\n if word in mirror_letters:\n result = 'YES'\nelif len(word) == 2:\n condition_A = word[0] == word[1]\n condition_B = word[0] in mirror_letters and word[1] in mirror_letters\n if condition_A and condition_B:\n result = 'YES'\n else:\n result = 'NO'\nelse:\n result = 'NO'\n\n if len(word) % 2 == 0:\n parts = word[:len(word)//2], word[len(word)//2:]\n\n if is_letters_mirror(word) and is_parts_mirror(parts):\n result = 'YES'\n else:\n parts = word[:len(word)//2], word[len(word)//2+1:]\n\n if is_letters_mirror(word) and is_parts_mirror(parts):\n result = 'YES'\n\nprint(result)", "word = input().upper()\r\ncount = 0\r\nmirror = list(\"AHIMOTUVWXY\")\r\n \r\nfor i in word:\r\n if not i in mirror:\r\n count = 0\r\n break\r\n else:\r\n count = 1\r\n\r\nif count == 1:\r\n rev = word[::-1]\r\n if (rev == word):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") \r\nelse:\r\n print(\"NO\")", "allowed = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\r\n\r\n\r\ndef startap(s):\r\n flag = 0\r\n if len(set(allowed)) != len(set(allowed) | set(s)):\r\n flag = 1\r\n else:\r\n for i in range(len(s) // 2):\r\n if s[i] != s[-i - 1]:\r\n flag = 1\r\n break\r\n if flag == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\nprint(startap(input()))\r\n", "s=input()\nd=[\"A\",\"H\",\"I\",\"M\",\"O\",\"T\",\"U\",\"V\",\"W\",\"X\",\"Y\"]\nd=set(d)\nans=\"YES\"\nfor i in s:\n\tif i not in d:\n\t\tans=\"NO\"\n\t\tbreak\nif s!=s[::-1]:\n\tans=\"NO\"\nprint (ans)", "\nname = input()\n\nletters = \"AHIMOTUVWXY\"\n\nletters = list(letters)\nflag = 0\nfor letter in name:\n if not(letter in letters):\n print(\"NO\")\n flag = 1\n break\n\nreverse = name[::-1]\n\nif flag == 0:\n if reverse == name:\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", "cup = set('AHIMOTUVWXY')\r\ns = input()\r\nif not set(s).issubset(cup):\r\n print('NO')\r\n exit()\r\nls = list(s)\r\nls.reverse()\r\nt = ''.join(ls)\r\nif s == t:\r\n print('YES')\r\nelse:\r\n print('NO')", "name = str(input())\n\nnormal = 0\nbackwards = len(name)-1\n\nwhile(True):\n if (name[normal] == name[backwards]):\n if (name[normal] != 'A' and name[normal] != 'H' and name[normal] != 'I' and name[normal] != 'M' and name[normal] != 'O' and name[normal] != 'T' and name[normal] != 'U'\n and name[normal] != 'V' and name[normal] != 'W' and name[normal] != 'X' and name[normal] != 'Y'):\n print(\"NO\")\n break\n else:\n normal = normal + 1\n backwards = backwards-1\n else:\n print(\"NO\")\n break\n if (normal == backwards):\n if (name[normal] != 'A' and name[normal] != 'H' and name[normal] != 'I' and name[normal] != 'M' and name[normal] != 'O' and name[normal] != 'T' and name[normal] != 'U'\n and name[normal] != 'V' and name[normal] != 'W' and name[normal] != 'X' and name[normal] != 'Y'):\n print(\"NO\")\n break\n else:\n print(\"YES\")\n break\n elif (normal > backwards):\n print(\"YES\")\n break\n\n\n\n\n\n\t\t \t \t\t \t\t\t \t \t \t\t \t \t \t\t\t\t", "str = str(input())\r\nlung = len(str)\r\nn = ('A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y')\r\n\r\nfor i in range((lung + 1) // 2):\r\n if (str[i] != str[(lung- 1) - i] or not(str[i] in n)):\r\n lung = 0\r\nif lung != 0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def isSymmetric(letter):\n symmetricLetters = [\"A\", \"H\", \"I\", \"M\", \"O\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\"]\n if symmetricLetters.count(letter):\n return True\n else:\n return False\n\nname = input()\ninversed = name[::-1]\nanswer = \"YES\"\nif name == inversed:\n for i in inversed:\n if isSymmetric(i) == False:\n answer = \"NO\"\nelse:\n answer = \"NO\"\n\nprint(answer)\n\t \t\t \t\t \t\t \t\t\t \t\t \t\t\t \t \t", "l = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\r\n\r\ns = input()\r\n\r\nif s == s[::-1] and len(set(s) | set(l)) == len(l): print('YES')\r\nelse:print('NO')", "word = list(input())\npossible = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\n\ndone = False\n\nfor letter in word:\n if letter not in possible:\n done = True\n \nif not done:\n for i in range(len(word)):\n if word[i] != word[-i - 1]:\n done = True\n\nif done:\n print(\"NO\")\nelse:\n print(\"YES\")\n\t \t\t\t\t\t \t \t\t \t\t \t \t \t\t\t", "def espelho(entrada):\n letras_simetricas = [\"A\", \"H\", \"I\", \"M\", \"O\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\"];\n for i in range(len(entrada)//2 + 1):\n if((entrada[i] not in letras_simetricas) or (entrada[i] != entrada[-(i + 1)])):\n return False;\n return True;\n \ndef main():\n entrada = input();\n if(espelho(entrada)):\n print(\"YES\");\n else:\n print(\"NO\");\n\nmain()\n \t \t \t\t\t\t \t \t\t\t\t\t \t\t\t \t\t", "mirrors = set('AHIMOTUVWXY')\r\n\r\n\r\nx = input()\r\nif set(x) <= mirrors and x == x[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = input()\r\nfor i in range(len(a)):\r\n\tif a[i] != a[len(a) - i - 1] or a[i] not in ('A','H','I','M','O','T','U','V','W','X','Y'):\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "a = input()\r\nfor i in range(len(a)):\r\n\tif a[i] != a[-i-1] or a[i] not in 'AHIMOTUVWXY':\r\n\t\tprint(\"NO\")\r\n\t\texit()\r\nprint(\"YES\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\n\r\nl = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\r\nans = \"YES\"\r\nfor i in s:\r\n if i not in l:\r\n ans = \"NO\"\r\n break\r\nif ans == \"YES\":\r\n x = len(s)\r\n for i in range(x//2):\r\n if s[i] != s[x-1-i]:\r\n ans = 'NO'\r\n break\r\nprint(ans)", "str=input()\ndummy=1\nfor i in str:\n if (i=='A' or i=='H' or i=='I' or i=='M' or i=='O' or i=='T' or i=='U' or i=='V' or i=='W' or i=='X' or i=='Y'):\n continue\n else:\n dummy=0\n break\n\nif dummy==1 and str[::-1]==str:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t\t\t \t \t\t\t \t \t\t \t \t \t \t", "k=[\"W\",\"T\",\"Y\",\"U\",\"I\",\"O\",\"A\",\"H\",\"X\",\"V\",\"M\",\"o\",\"i\",\"v\",\"x\",\"w\"]\r\ns=input()\r\ncount=0\r\nfor i in range(((len(s)-1)//2)+1):\r\n if s[i]==s[-i-1] and s[i] in k and s[i-1] in k:\r\n count+=1\r\n \r\nif len(s)%2==0 and count == len(s)//2 and len(s)!=1:\r\n print(\"YES\")\r\nelif len(s)%2==1 and count==(len(s)+1)//2:\r\n print(\"YES\") \r\nelse:\r\n print(\"NO\") ", "l = 'AHIMOTUVWXY'\r\ns = input()\r\nif s != s[::-1]:\r\n print('NO')\r\nelse:\r\n f = 0\r\n for i in s:\r\n if i not in l:\r\n f=1\r\n break\r\n if f==1:\r\n print('NO')\r\n else:\r\n print('YES') \r\n", "s = input()\r\nmirror_letters = \"AHIMOTUVWXY\"\r\nif s == s[::-1]:\r\n for letter in s:\r\n if letter not in mirror_letters:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "name = input()\n\nvalid_letters = \"AHIMOTUVWXY\"\n\nfor i in name:\n if not i in valid_letters:\n print('NO')\n exit()\n\nreverted_name = name[::-1]\nif not reverted_name == name:\n print('NO')\n exit()\n\nprint('YES')\n\n\t \t \t \t \t\t \t\t\t \t \t\t \t", "def main():\r\n s=str(input())\r\n if s==s[::-1]:\r\n flag=1\r\n for i in range(len(s)):\r\n if s[i] not in \"AHIMOTUVWXY\":\r\n flag=0\r\n break\r\n else:\r\n flag=0\r\n if flag==1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "\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\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\nprint('YES' if (lambda i: set(i).issubset(set('AHIMOTUVWXY')) and i==i[::-1])(input()) else 'NO')", "s = input()\r\nk = 'AHIMOTUVWXY'\r\nr = True\r\nfor c in s:\r\n r &= c in k\r\n if not r: break\r\nif r and s == s[::-1]:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "symmetricalLetters = \"AHIMOTUVWXY\"\nname = input()\n\nfor letter in name:\n if letter not in symmetricalLetters:\n print(\"NO\")\n exit(0)\n\nif (name == name[::-1]):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t \t\t\t\t\t\t \t\t \t", "t = list(input())\r\nalpha = ['A','H','I','M','O','T','U','V','W','X','Y']\r\ncnt=0\r\nfor i in range(len(t)):\r\n if t[i] in alpha:\r\n cnt=cnt+1\r\nif cnt == len(t):\r\n if t == t[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\nr = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\r\nfor x in s:\r\n if x not in r:\r\n print('NO')\r\n exit(0)\r\nif s != s[::-1]:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n", "\r\nw = input()\r\n\r\nif (len(set(w).difference('AHIMOTUVWXY'))==0) and (w[::-1] == w):\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\n\nreversable = re.compile('[AHIMOTUVWXY]*')\n\nname = input()\nif name != name[::-1] or reversable.fullmatch(name) == None:\n print('NO')\nelse:\n print('YES')\n\n \t\t \t \t\t \t\t\t\t \t\t \t \t \t \t", "n = input()\r\nl1 = []\r\nl2 = []\r\ngg = True\r\nfor i in n:\r\n l1.append(i)\r\n l2.append(i)\r\nl2.reverse()\r\nfor i in range(len(l1)):\r\n if l1[i] != \"A\" and l1[i] != \"H\" and l1[i] != \"I\" and l1[i] != \"M\" and l1[i] != \"O\" and l1[i] != \"T\" and l1[i] != \"U\" and l1[i] != \"V\" and l1[i] != \"W\" and l1[i] != \"X\" and l1[i] != \"Y\":\r\n gg = False\r\nif gg and l1 == l2:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "st=input()\r\nse={'A','H','I','M','O','T','U','V','W','X','Y'}\r\nflag=True\r\nfor i in st:\r\n if(not(i in se)):\r\n flag=False\r\nif(flag and st==st[::-1]):\r\n print('YES')\r\nelse:\r\n print('NO')", "import re\n\ndef p(name):\n\ts, e = 0, len(name)-1\n\twhile s < e:\n\t\tif name[s] != name[e]:\n\t\t\treturn False\n\t\ts += 1\n\t\te -= 1\n\treturn True\n\nm1 = re.compile(r'[AHIMOTUVWXY]+\\Z')\nname = input()\nif m1.match(name) and p(name):\n\tprint('YES')\nelse:\n\tprint('NO')\n", "a=input()\nl=len(a)\nb=\"AHIMOTUVWXY\"\nc=0\nfor i in range(0,len(a)):\n for j in range(0,len(b)):\n if a[i]==b[j]:\n c=c+1\nif c!=len(a):\n print(\"NO\")\n exit()\nif a==a[::-1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t\t\t \t\t\t \t\t\t\t \t \t\t \t\t \t \t\t\t", "sl, s = 'AHIMOTUVWXY', input()\r\nprint('YES' if all(s[i] in sl and s[i] == s[len(s) - i - 1] for i in range(len(s))) else 'NO')", "s = input()\r\nvalid_set = set([\"A\", \"H\", \"I\", \"M\", \"O\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\"])\r\nvalid = True\r\nfor c in s:\r\n if c not in valid_set:\r\n valid = False\r\n break\r\nif valid and s == s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "#Ana Clara Lacaze\n#193858\n \nname = input()\nmirrorLetters = ['A','H','I','M','O','T','U','V','W','X','Y']\nisMirror = True\nfor letter in name:\n if letter not in mirrorLetters:\n isMirror = False \n break\nif isMirror and name==name[::-1]:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t \t \t \t \t\t\t\t\t \t \t\t \t", "inp = input()\r\n\r\nwhitelist = 'AHIMOTUVWXY'\r\n\r\ndef check1(inp):\r\n for ch in inp:\r\n if ch not in whitelist:\r\n return False\r\n return True\r\n\r\ndef check2(inp):\r\n n = len(inp)\r\n for i in range(n//2):\r\n if inp[i] != inp[n - i - 1]:\r\n return False\r\n return True\r\n\r\n\r\nif check1(inp) and check2(inp):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "mc = {'A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y'}\r\ndata = input()\r\nflag = True\r\nfor i in data:\r\n if i not in mc:\r\n flag = False\r\n break\r\n\r\nif flag and data == data[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\nprint('YES' if all(ch in 'AHIMOTUVWXY' for ch in s) and s==s[::-1] else 'NO')", "\ndef func():\n name = input()\n\n alw = 'AHIMOTUVWXY'\n\n if name.count(name[0]) == len(name):\n if name[0] in alw:\n print(\"YES\")\n return\n else:\n print(\"NO\")\n return\n \n for i in name:\n if i not in alw:\n print(\"NO\")\n return\n\n if name[::-1] == name:\n print(\"YES\")\n else:\n print(\"NO\")\n return\n\nfunc()\n\t \t \t \t \t \t\t\t \t \t\t\t \t", "s = input()\nc = False\nnr = [\"B\", \"C\", \"D\", \"E\", \"F\", \"G\", \"J\", \"K\", \"L\", \"N\", \"P\", \"Q\", \"R\", \"S\", \"Z\"]\n\nfor i in s:\n if i in nr:\n c = True\n\nif c:\n print(\"NO\")\nelif s == \"\".join(reversed(s)):\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=list(input())\r\nif t==t[::-1]:\r\n f=set(t)\r\n h=set(list('BCDEFGJKLNPQRSZ'))\r\n if f&h==set():\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')", "name = input()\nlenName = len(name)\nlenIt = lenName\n\nif lenName % 2 != 0:\n lenIt += 1\n\nj = lenName-1\nmirror = 1\nfor i in range(lenIt//2):\n if name[i] not in 'AHIMOTUVWXY' or name[i] != name[j]:\n mirror = 0\n break\n j -= 1\n\nif mirror:\n print('YES')\nelse:\n print('NO')\n\t \t\t \t \t \t\t \t \t\t \t \t \t \t", "the_same = [\"A\", \"I\", \"H\", \"M\", \"O\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\"]\r\nname = input() \r\nres = \"YES\"\r\nfor i in name : \r\n if i not in the_same : \r\n res = \"NO\"\r\n break\r\nif res == 'YES' and name == name[::-1] : \r\n print(\"YES\")\r\nelse: \r\n print(\"NO\") \r\n", "from sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\nexclusions = 'BCDEFGJKLNPQRSZ'\r\nst = stdin.readline().strip()\r\nl = len(st)\r\np = l // 2\r\nfor i in range(l):\r\n if st[i] in exclusions or (i <= p and st[i] != st[l - i - 1]):\r\n print('NO')\r\n exit()\r\n\r\nprint('YES')", "white_list = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\r\nname = input()\r\nis_wrong = False\r\n\r\nif len(set(white_list)) != len(set(white_list) | set(name)):\r\n is_wrong = True\r\nelse:\r\n for i in range(len(name) // 2):\r\n if name[i] != name[-(i+1)]:\r\n is_wrong = True\r\n break\r\n\r\nprint('NO' if is_wrong else 'YES')\r\n", "s = input()\r\na = ['A','H','I','M','O','T','U','V','W','Y','X']\r\nf=0\r\nfor i in s:\r\n if i not in a:\r\n f=1 \r\n break \r\nif f==0 and s==s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s = input()\nfor c in s:\n\tif not c in \"AHIMOTUVWXY\":\n\t\tprint(\"NO\")\n\t\tquit()\nif s == s[::-1]:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")\n", "w = input().upper()\r\nacceptable = \"AHIMOTUVWXY\"\r\n\r\nfor l in range(len(w)):\r\n if acceptable.find(w[l]) == -1 or w[l] != w[-l - 1]:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "# Source: https://usaco.guide/general/io\n#this comment is to increase the length to 50 characters,jfhjhbdwjhfbdjjsdsncsncb\n\n\nn = str(input())\n\nmirror = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\nstat = \"\"\nfor letter in list(n):\n if letter in mirror:\n stat\n continue\n elif letter not in mirror:\n stat = \"false\"\n break\nres = \"\"\nif stat != \"false\":\n for i in range(len(n)):\n if n[i]==n[-i-1]:\n res = \"True\"\n continue\n else:\n res = \"False\"\n break\nif res == \"True\":\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \n\n \t\t \t\t\t\t \t \t\t\t \t \t \t\t \t\t\t\t", "def cerminhuruf(kata):\n c = 0\n for i in kata:\n if i == \"A\" or i == \"H\" or i == \"I\" or i == \"M\" or i == \"O\" or i == \"T\" or i == \"U\" or i == \"V\" or i == \"W\" or i == \"X\" or i == \"Y\":\n c += 1\n if c == len(kata):\n return True\n else:\n return False\ndef kebalik(kata):\n kata2 = \"\"\n for i in range(len(kata)-1, -1, -1):\n kata2 += kata[i]\n return kata2 == kata\n\nkata = str(input())\nif cerminhuruf(kata) and kebalik(kata):\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t\t\t\t \t \t \t\t \t \t\t", "def f(s:str):\r\n n = {'B', 'C', 'D', 'E', 'F', 'G', 'J', 'K', 'L', 'N', 'P', 'Q', 'R', 'S', 'Z'}\r\n for i in s:\r\n if i in n:\r\n return 'NO'\r\n if s[::-1]==s:\r\n return 'YES'\r\n return 'NO'\r\n\r\nprint(f(input()))", "nome = input()\n\nresultado = True\n\nnonMirror = ['Q', 'E', 'R', 'P', 'S', 'D', 'F', 'G', 'J', 'K', 'L', 'Z', 'C', 'B', 'N']\n \nfor i in nome:\n if i in nonMirror:\n resultado = False\n\nif resultado:\n if str(nome) == \"\".join(reversed(nome)):\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")\n\t \t \t \t\t\t \t\t\t\t \t \t\t \t\t \t \t", "charset = \"BCDEFGJKLNPQRSZ\"\r\nflag = False\r\ne = input()\r\nfor i in e:\r\n if i in charset:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"NO\")\r\nelse:\r\n if e == e[::-1]:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \r\n \r\n", "s = input()\r\n\r\nl = {'A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y'}\r\n\r\ni = 0\r\nj = len(s) - 1\r\ny = True\r\nwhile i <= j:\r\n if s[i] != s[j] or s[i] not in l:\r\n y = False\r\n break\r\n i += 1\r\n j -= 1\r\n\r\nif y:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a = input()\r\n\r\nli = ['A','H','I','M','O','T','U','V','W','X','Y']\r\n\r\nyes = 0\r\n\r\nfor i in range(len(a)):\r\n\tif a[i] in li:\r\n\t\tpass\r\n\telse:\r\n\t\tyes = 1\r\n\t\tbreak\r\n\r\nif yes == 0 and a == a[::-1]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "s=input()\nvar=0\nc=0;\nif(s==s[::-1]):\n var=1\n if(var==1): \n l=['B','C','D','E','F','G','J','K','L','N','P','Q','R','S','Z']\n for i in range(len(l)):\n if (l[i] in s):\n print(\"NO\")\n c=-1\n break\n if(c==0):\n print(\"YES\")\nelif(s!=s[::-1]):\n print(\"NO\")\n\t \t \t\t \t\t \t\t\t \t\t \t \t\t \t", "n=input()\r\nif n==n[::-1] and \"Z\" not in n and \"S\" not in n and \"R\" not in n and \"Q\" not in n and \"P\" not in n and \"N\" not in n and \"L\" not in n and \"K\" not in n and \"J\" not in n and \"G\" not in n and \"F\" not in n and \"E\" not in n and \"D\" not in n and \"C\" not in n and \"B\" not in n: print(\"YES\")\r\nelse: print(\"NO\")", "mirror_letter = 'AHIMOTUVWXY'\r\n\r\ns = input()\r\nleft = s[:len(s) // 2]\r\nright = s[:-len(s) // 2 - (len(s) % 2 == 0):-1]\r\n\r\nif all([c in mirror_letter for c in s]) and left == right:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "l = [\"A\", \"H\", \"I\", \"M\", \"O\", \"T\", \"U\", \"V\", \"W\", \"X\", \"Y\"]\r\n\r\ns = input()\r\n\r\nx = \"YES\"\r\n\r\nfor i in s:\r\n\tif i not in l:\r\n\t\tx = \"NO\"\r\n\t\tbreak\r\n\t\t\r\nif s != s[::-1]:\r\n\tx = \"NO\"\r\n\t\r\nprint(x)", "\r\ndef cifre(s):\r\n l = [ 'B','C','D','E','F','G','J','K','L','N',\r\n 'P','Q','R','S','Z' ]\r\n for i in range(len(l)):\r\n if s !=s[::-1] or s.find(l[i])!=-1:\r\n return False\r\n return True\r\n\r\n\r\n\r\ns = input()\r\n\r\nif cifre(s):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "mirralpha = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\nw = input()\nrw = ''.join(reversed(w))\nif rw == w:\n\tvalid = True\n\tfor i in list(rw):\n\t\tisL = False\n\t\tfor j in mirralpha:\n\t\t\tif(i == j):\n\t\t\t\tisL = True\n\t\t\t\tbreak\n\n\t\tif(not isL):\n\t\t\tvalid = False\n\t\t\tbreak\n\n\tif(valid):\n\t\tprint(\"YES\")\n\telse:\n\t\tprint(\"NO\")\n\nelse:\n\tprint(\"NO\")", "s = str(input())\r\noutput = \"YES\"\r\nfor j in range(len(s)):\r\n if s[j] in ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']:\r\n continue\r\n else:\r\n output = \"NO\"\r\n break\r\np1, p2 = 0, len(s) - 1\r\nwhile p1 < p2:\r\n if s[p1] != s[p2]:\r\n output = \"NO\"\r\n break\r\n p1 += 1\r\n p2 -= 1\r\nprint(output)\r\n", "# Start Up name\nname = input()\nlenName = len(name)\nnumberAvaiable = name.count('A') + name.count('H') + name.count('I') + name.count('M') + name.count('O') + name.count('T') + name.count('U') + name.count('V') + name.count('W') + name.count('X') + name.count('Y')\nif numberAvaiable != lenName: print('NO')\nelse:\n if lenName%2 == 1: #tamanho impar\n for i in range(lenName//2+1):\n if name[i] != name[lenName-1-i]:\n print('NO')\n break\n if i == lenName//2: print('YES')\n\n else: #tamanho par\n for i in range(lenName//2):\n if name[i] != name[lenName-1-i]:\n print('NO')\n break\n if i == lenName//2-1: print('YES') \n \t\t\t\t \t \t\t \t \t\t \t", "A = \"AHIMOTUVWXY\"\r\n\r\ns = input()\r\n\r\nflag = True\r\nfor i in range(len(s)):\r\n if s[i] not in A:\r\n flag = False\r\n\r\nif flag and s == s[::-1]:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "s='AHIMOTUVWXY'\r\nk=input()\r\nif k==k[::-1]:\r\n for i in k:\r\n if i not in s:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "if __name__ == '__main__':\n # Ler entrada\n str_input = input()\n # Deve possuir apenas caracteres simétricos\n symmetrics = \"AHIMOTUVWXY\"\n for char in \"\".join(set(str_input)):\n if not char in symmetrics:\n print(\"NO\")\n exit(0)\n # Obter reverso\n rev_input = str_input[::-1]\n # Exibir resultado\n print(\"YES\" if str_input == rev_input else \"NO\")\n\n\t\t\t\t \t \t \t\t\t \t \t \t \t", "s = input()\r\nmirror = \"AHIMOTUVWXY\"\r\nflag = True\r\nfor i in range(len(s)//2+1):\r\n if(s[i]!=s[len(s)-1-i] or s[i] not in mirror):\r\n flag = False\r\n print(\"NO\")\r\n break\r\nif(flag):\r\n print(\"YES\")\r\n \r\n\r\n \r\n\r\n\r\n", "s = input()\r\nfor q in s:\r\n if q not in \"AHIMOTUVWXY\":\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\" if s==s[::-1] else \"NO\")", "s=input()\r\nif(s==s[::-1]):\r\n lent=len(s)\r\n for i in range(lent):\r\n if(s[i]=='A' or s[i]=='H' or s[i]=='I' or s[i]=='M' or s[i]=='O' or s[i]=='T' or s[i]=='U' or s[i]=='V' or s[i]=='W' or s[i]=='X' or s[i]=='Y'):\r\n pass\r\n else:\r\n print(\"NO\")\r\n exit()\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\nw = input()\r\ncomp = set(w)\r\nif len(comp.intersection('BCDEFGJKLNPQRSZ')) > 0:\r\n print('NO')\r\nelse:\r\n if w[::-1] == w:\r\n print('YES')\r\n else:\r\n print('NO')", "s=input()\r\nif s!=s[::-1]:\r\n\tprint('NO')\r\nelse:\r\n\tp='YES'\r\n\ts=set(s)\r\n\tl=['A','H','I','M','O','T','U','V','W','X','Y']\r\n\tfor i in s:\r\n\t\tif i not in l:\r\n\t\t\tp='NO'\r\n\t\t\tbreak\r\n\tprint(p)", "__author__ = 'Lipen'\r\n\r\nallowed = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\r\n\r\ndef main():\r\n s = input()\r\n n = len(s)\r\n\r\n if n==1:\r\n b = s[0] in allowed\r\n else:\r\n b = True\r\n m = n//2\r\n if n%2:\r\n m += 1\r\n for i in range(m):\r\n c1 = s[i]\r\n c2 = s[-i-1]\r\n if c1!=c2 or c1 not in allowed or c2 not in allowed:\r\n b = False\r\n break\r\n\r\n if b:\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nmain()", "import sys\n\nstr = input()\nl = len(str)\nrev = str[::-1]\nf = 1\nmaap = [1,0,0,0,0,0,0,1,1,0,0,0,1,0,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0]\nfor i in range(l):\n now = ord(str[i])\n now -= 65\n if maap[now] == 0:\n f = 0\n\n \n\nif str == rev and f ==1:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n\t \t\t \t\t\t \t\t \t \t\t \t\t\t\t\t\t\t\t", "s = input()\na = {'A','H','I','M','O','T','U','V','W','X','Y'}\nif s==s[::-1]:\n if len(set(s) - a)==0:\n print('YES')\n else:\n print('NO')\nelse:\n print('NO')\n", "s = input()\r\nprint(\"YES\" if s == s[::-1] and set(s) <= set(\"AHIMOTUVWXY\") else \"NO\")", "s = input()\r\nl = ['A', 'H', 'I', 'M', 'O', 'T', 'U', 'V', 'W', 'X', 'Y']\r\nif s[::-1] == s:\r\n for i in range(len(s)):\r\n if s[i] not in l:\r\n print('NO')\r\n exit()\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "vet = 'AHIMOTUVWXY'\nn = list(input().strip())\nres = []\nfor i in n:\n if i not in vet:\n res.append('NO')\nif n[::-1] == n:\n res.append('YES')\nelse:\n res.append('NO')\nprint(res[0])\n \t\t \t \t \t \t\t \t \t \t" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\nn = len(s)\r\npow2 = [1]\r\nfor _ in range(14):\r\n pow2.append(2 * pow2[-1])\r\nk = 0\r\nwhile pow2[k + 1] <= n:\r\n k += 1\r\nm = pow2[k]\r\npow2 = pow2[:k]\r\nl = n - m + 1\r\nx = [[] for _ in range(26)]\r\nfor i in range(n):\r\n x[s[i] - 97].append(i)\r\ndp = [1] * m\r\nans = []\r\nfor i in range(l):\r\n dp0 = [0] * m\r\n for j in range(26):\r\n ok = 0\r\n for u in x[j]:\r\n v = u - i\r\n if v >= m:\r\n break\r\n if v >= 0 and dp[v]:\r\n ok, dp0[v] = 1, 1\r\n if ok:\r\n ans.append(chr(j + 97))\r\n break\r\n for j in pow2:\r\n for u in range(j, m):\r\n if u & j:\r\n dp0[u] |= dp0[u ^ j]\r\n dp = dp0\r\nsys.stdout.write(\"\".join(ans))" ]

[ "a, b = map(int, input().split())\r\nm = []\r\nj = 0\r\nfor i in range(a, 1, -1):\r\n if j != b:\r\n m.append(i)\r\n j += 1\r\n if j == b:\r\n break\r\nprint(*m, end = ' ')\r\nv = []\r\nfor i in range(1, a-b+1):\r\n v.append(i)\r\nprint(*v)\r\n", "(n, k) = map(int, input().split(' '))\n\nnums = []\nfor i in range(0, k):\n nums.append(n - i)\n\nfor i in range(1, n - k + 1):\n nums.append(i)\n\nprint(' '.join(map(str, nums)))\n", "class CodeforcesTask285ASolution:\n def __init__(self):\n self.result = ''\n self.n_k = []\n\n def read_input(self):\n self.n_k = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n inc = [x for x in range(1, self.n_k[0] - self.n_k[1])]\n dc = [x for x in range(self.n_k[0] - self.n_k[1], self.n_k[0] + 1)][::-1]\n self.result = \" \".join([str(x) for x in inc + dc])\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask285ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def 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, k = input_ints()\r\n ans = []\r\n for i in range(k + 1):\r\n ans.append(k + 1 - i)\r\n for i in range(k + 2, n + 1):\r\n ans.append(i)\r\n output_list(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from sys import stdin,stdout\r\na,b=map(int,stdin.readline().split())\r\nlst=[i+1 for i in range(a)]\r\nlst.reverse()\r\nlst1=lst[:b]\r\nlst2=lst[b:]\r\nlst2.reverse()\r\nnew=lst1+lst2\r\nfor i in new:\r\n stdout.write(str(i)+' ')\r\n", "a,b=[int(i) for i in input().split()]\r\nl=list(range(1,a+1))[::-1]\r\nprint(*l[0:b]+l[b:][::-1])", "#https://codeforces.com/problemset/problem/285/A\r\nn , k =map(int,input().split())\r\nst =k+1 \r\nlater=st+1 \r\nwhile(st>0):\r\n print(st,end=\" \")\r\n st-=1\r\nwhile(later<=n):\r\n print(later,end=\" \")\r\n later+=1 \r\n", "n,k=map(int,input().split())\r\nans=[]\r\nfor i in range(1,n+1):\r\n ans.append(i)\r\n\r\nselect = ans[n-k-1:n]\r\nselect.reverse()\r\nprint(*ans[0:n-k-1],end=\" \")\r\nprint(*select)", "n,k=map(int,input().split())\r\na=[]\r\nfor i in range(1,n+1):\r\n a.append(i)\r\ns=a[:n-k]\r\nt=a[n-k:]\r\nt.sort(reverse=True)\r\nq=t+s\r\nprint(*q)\r\n\r\n", "n, k = [int(i) for i in input().split()]\r\n\r\narr = [i for i in range(1, n+1)]\r\n\r\narr.sort()\r\n\r\nfor i in range(n-1, n-k-1, -1):\r\n print(arr[i], end = \" \")\r\n\r\nfor i in range(n-k):\r\n print(arr[i], end = \" \")\r\nprint()", "n, k = map(int, input().split())\nout = [str(i) for i in range(1,n+1)]\nout[(n-k-1):] = out[(n-k-1):][::-1]\nprint(\" \".join(out))\n", "n, k = map(int, input().split())\n\nf = k\narr = []\nfor i in reversed(range(1, n + 1)):\n if k == 0: break\n arr.append(i)\n k -= 1\n\nfor i in range(1, n - f + 1):\n arr.append(i)\n\nprint(' '.join(str(i) for i in arr))\n\n\n \n \n \n", "A = [int(i) for i in input().split()]\r\nn = A[0]\r\nk = A[1]\r\ni = k+1\r\nwhile(i>0):\r\n print(i,end = \" \")\r\n i-=1\r\nfor i in range(k+2,n+1):\r\n print(i,end = \" \")\r\n", "n,k=map(int,input().split())\r\n\r\nl=[0]*n\r\nfor i in range(n,n-k,-1):\r\n l[n-i]=i\r\nfor i in range(1,n-k+1):\r\n l[i+k-1]=i\r\nfor i in range(n):\r\n print(l[i],end=\" \")", "from collections import defaultdict, deque, Counter\nfrom functools import lru_cache, reduce \nfrom heapq import heappush, heappop, heapify\nfrom bisect import bisect_right, bisect_left\nfrom random import randint\nfrom fractions import Fraction as frac\nimport math\nimport operator\nimport sys\n\n#sys.stdin = open(\"sleepy.in\", \"r\")\n#sys.stdout = open(\"sleepy.out\",\"w\")\n#input = sys.stdin.readline\n#print = sys.stdout.write\n\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\n\"\"\"\n# if in possition that it\n# as close as possible\n\"\"\"\ndef solution():\n n,k = map(int, input().split())\n # revers k + 1 amount fo them\n \n arr = list(range(1,n+1))\n k += 1\n arr = arr[:k][::-1] + arr[k:]\n return print(*arr)\n\n \n\n\n\ndef main():\n #test()\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n\n#import sys\n#import threading\n#sys.setrecursionlimit(10**6)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n \n \n \n\n\n\n # this is merg sort\n\n # this is recursion\n # swaping and checking if they are sorted orded\n\n # ## ## if not swap them and check and continue\n\n # I should have swap function\n\n # merge sort\n # left and right pointer\n # if imposible to sort\n", "a, b = map(int, input().split())\r\nfor i in range(a, a-b, -1):\r\n print(i, end = \" \")\r\nfor i in range(1, a-b+1):\r\n print(i, end=\" \")", "n,k = map(int, input().split())\r\n\r\nl = list(range(1,n+1))\r\n\r\nindex = n-1-k\r\np = l[index:][::-1]\r\nl = l [:index] + p\r\nfor i in l:\r\n print(i,end = \" \")\r\n \r\n", "n,k=[int(x) for x in input().split()]\r\nprint(' '.join([str(y) for y in list(range(1,n-k))+list(range(n,n-k-1,-1))]))", "def main():\r\n n, k = map(int, input().split())\r\n answ = []\r\n for i in range(1, n - k):\r\n answ.append(i)\r\n for i in range(0, k + 1):\r\n answ.append(n - i)\r\n print(\" \".join(map(str, answ)))\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(i)\r\ns=l[:n-k]\r\nr=l[n-k:]\r\nr.sort(reverse=True)\r\nprint(*(r+s))\r\n", "n,k=map(int,input().split())\r\nt=n\r\nout=[]\r\nfor i in range(k):\r\n\tout.append(n)\r\n\tn-=1\r\nfor i in range(t-k):\r\n\tout.append(i+1)\r\nprint(*out)", "n,k=map(int,input().strip().split())\r\nL=[]\r\nfor i in range(1,n+1):\r\n L.append(i)\r\n \r\nfor i in range(k):\r\n print(L[n-1-i],end=' ')\r\nfor i in range(n-k):\r\n print(L[i],end=' ')\r\n \r\n ", "# auth: starkizard\n# we need k elements that are greater than the next element\n# for n=5 k=2, 2 elements needed that must be greater than the next element\n# let's put them in the end, so we assign 3 greatest elements (2+1) elements x,y,z that x>y>z \n# and put rest elements in increasing order in the start\n# here answer would be 1 2 5 4 3 \n# here 5>4 and 4>3 thus we get our answer. using the same technique\nn,k=map(int,input().split())\nprint(* list(range(1,n-k))+list(range(n,n-k-1,-1)))", "n,k=list(map(int,input().split()))\r\nv=[]\r\nfor i in range(k):\r\n v.append(n-i)\r\nfor j in range(n-k):\r\n v.append(j+1)\r\nfor t in v:\r\n print(t,end=\" \")\r\n", "def main():\r\n n, k = [int(i) for i in input().split(' ')]\r\n for i in range(n - k - 1):\r\n print(i + 1, end=' ')\r\n for i in range(n, n - k - 1, -1):\r\n print(i, end=' ')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\nn, k = inp()\r\nfor i in range(n - k - 1):\r\n print(i + 1, end=' ')\r\nfor i in range(n, n - k-1, -1):\r\n print(i, end=' ')\r\n", "n,k=map(int,input().split())\r\na=[i for i in range(1,k+2)]\r\nb=[i for i in range(k+2,n+1)]\r\nl=a[::-1]+b\r\nprint(*l)\r\n", "n, k = input().split(\" \")\r\nn, k = int(n), int(k)\r\nword = \"\"\r\nfor i in range(n,n-k,-1):\r\n word += str(i)\r\n word += \" \"\r\n\r\nfor g in range(1,n-k+1):\r\n word += str(g)\r\n word += \" \"\r\n\r\nprint(word)", "n,k=map(int,input().split());s=[str(i+1)for i in range(n)];print(' '.join(s[n-k:][::-1]+s[:n-k]))\r\n", "from sys import stdin,stdout\r\ninput=stdin.readline \r\nimport math,bisect\r\n\r\nn,k=map(int,input().split())\r\nfor i in range(k+1,0,-1):\r\n\tprint(i,end=\" \")\r\nfor i in range(k+2,n+1):\r\n\tprint(i,end=\" \")\r\nprint()", "n,k = map(int, input().split())\r\n\r\nfor _ in range(k):\r\n \r\n print(n,end = \" \")\r\n \r\n n -= 1\r\n \r\nfor i in range(1,n+1):\r\n \r\n print(i,end = \" \")", "l=list(map(int,input().split()))\r\nwhile l[1]:\r\n print(l[0],end=' ')\r\n l[1]-=1\r\n l[0]-=1\r\nfor i in range(1,l[0]+1):\r\n print(i,end=' ')", "n,k=map(int,input().split())\r\nlastindex=n\r\narr=[]\r\nif k!=0:\r\n while k>=0:\r\n arr.append(lastindex)\r\n lastindex-=1\r\n k-=1\r\nnewarray=[]\r\nfor i in range(1,lastindex+1):\r\n newarray.append(i)\r\nprint(*(newarray+arr))\r\n\r\n\r\n\r\n \r\n", "# cook your dish here\nn,k=map(int,input().split())\n\nprint(''.join([str(i)+' ' for i in range(1,n-k)]+[str(n)]+[' '+str(i) for i in range(n-1,n-1-k,-1)]))\n ", "n,k = map(int,input().split())\r\nx = n\r\nfor i in range(k):\r\n\tprint(n,end=\" \")\r\n\tn-=1\r\ny = 1\r\nfor i in range(x-k):\r\n\tprint(y,end=\" \")\r\n\ty+=1", "a,b = map(int, input().split())\r\nq =[]\r\nif( b != 0):\r\n for i in range( 1 , a-b):\r\n q.append(i)\r\n for i in range( a , a-b-1 , -1 ):\r\n q.append( i)\r\n for i in q:\r\n print(i,end = \" \")\r\nelse:\r\n for i in range(1,a+1):\r\n print(i , end =\" \") \r\n ", "n, k = [int(x) for x in input().split()]\nfor i in range(n - k - 1):\n\tprint(i + 1, end = ' ')\nfor i in range(k + 1):\n\tprint(n - i, end = ' ')\nprint()\n", "n,k=map(int,input().strip().split())\n\nr=[a for a in range(n, 0, -1)]\n\n\nb=[k for k in r[:n-k]]\nb.sort()\nr=b+r[n-k: ] \n\nprint(*r)", "n, k = [int(j) for j in input().split()]\r\nnum = n\r\nfor j in range(k):\r\n print(num, end = ' ')\r\n num -= 1\r\nfor j in range(1, n - k + 1):\r\n print(j, end = ' ')\r\n", "n,k = [int(ch) for ch in input().split(' ')]\ninput = [i+1 for i in range(n)]\nidx = n-1-k\nleft = input[:n-1-k]\nright = input[n-1-k:]\nres = left + sorted(right,reverse=True)\nans = ''\nfor num in res:\n print(num,end=' ')\n\n\n", "n,k= map(int,input().split(\" \"))\r\n\r\nperm = [0 for i in range(n)]\r\n\r\nnum = n\r\n\r\nj = 1\r\nfor i in range(k):\r\n\tperm[n-i-1] = j\r\n\tj+=1 \r\n\r\nfor i in range(n-k-1,-1,-1):\r\n\tperm[i] = num\r\n\tnum-=1\r\n\r\nfor p in perm:\r\n\tprint(p,end=\" \")", "inputs = str(input()).split()\r\nperm_len = int(inputs[0])\r\ncoeff = int(inputs[1])\r\ndec_list = []\r\n\r\nfor i in range(perm_len, perm_len-coeff-1, -1):\r\n dec_list += [i]\r\n\r\nstart_len = perm_len - coeff - 1 \r\n\r\noutput = [i+1 for i in range(start_len)] + dec_list\r\noutput = [str(x) for x in output]\r\nprint(\" \".join(output))", "n, k = map(int, input().split())\r\ni = 0\r\nwhile(i < k):\r\n print(n - i, end = \" \")\r\n i += 1\r\ni = 1\r\nwhile(i <= n - k):\r\n print(i, end = \" \")\r\n i += 1", "n,k=map(int,input().split())\r\n\r\narr=[str(a) for a in range(1,n+1)]\r\n\r\narr1=[str(a) for a in range(n,n-k,-1)]\r\n\r\narr2=[str(a) for a in range(1,n-k+1)]\r\n\r\nif k==0:\r\n\tprint(\" \".join(arr))\r\nelse:\r\n\tprint(\" \".join(arr1+arr2))\r\n", "n,k = map(int,input().split())\r\nif k==0:\r\n\tprint(*[i for i in range(1,n+1)])\r\nelse:\r\n\tarr = [n]\r\n\tt = 0\r\n\tfor i in range(n-1,0,-1):\r\n\t\tif t==k-1:\r\n\t\t\tbreak\r\n\t\tarr.append(i)\r\n\t\tt+=1\r\n\tfor i in range(1,arr[-1]):\r\n\t\tarr.append(i)\r\n\tprint(*arr)\r\n", "n, k = map(int, input().split())\r\nprint(*range(1, n - k), *range(n, n - 1 - k, -1))", "n,k=map(int,input().split())\r\nl=[i for i in range(1,n-k)]\r\nll=[i for i in range(n,n-(k+1),-1)]\r\n\r\nans=l+ll\r\nprint(*ans)\r\n", "n, k = [int(i) for i in input().split()]\r\nprint(*[n + 1 - i if i <= k else i - k for i in range(1, n + 1)])\r\n", "def take_input(s): #for integer inputs\r\n if s == 1: return int(input())\r\n return map(int, input().split())\r\n\r\nn, k = take_input(2)\r\nfor i in range(k+1,0,-1):\r\n print(i, end = \" \")\r\nfor i in range(k+2,n+1):\r\n print(i, end = \" \")\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\ndef printer(ipos,x):\r\n\tfor i in range(ipos,x):\r\n\t\tprint(i,end=' ')\r\n\r\nn,k=map(int,input().split())\r\n\r\nif k==0:\r\n\tprinter(1,n+1)\r\nelse:\r\n\tfor i in range(k+1,0,-1):\r\n\t\tprint(i,end=' ')\r\n\tprinter(k+2,n+1)\r\n", "n, k = [int(x) for x in input().split(' ')]\n\nfor i in range(k + 1):\n print(k + 1 - i, end=\" \")\n\nfor i in range(k + 2, n + 1):\n print(i, end=\" \")", "ls = input().split(\" \")\nn = int(ls[0])\nk = int(ls[1])\nls.clear()\nls = [-1]*n\n\nfor i in range(0,k):\n ls[i] = n - i \n\nj = 1\nfor i in range(k, n):\n ls[i] = j\n j+=1\n\nfor i in ls:\n print(i , end = \" \")", "n,k=map(int,input().split())\r\nfor i in range(n,n-k,-1): print(i,end=\" \")\r\nfor i in range(1,n-k+1): print(i,end=\" \")\r\nprint()", "n, k = map(int, input().split())\r\n\r\nif k == 0:\r\n lst1 = []\r\n for b in range(1, n+1):\r\n lst1.append(b)\r\n res1 = [str(r) for r in lst1]\r\n print(' '.join(res1))\r\nelse:\r\n lst = []\r\n for x in range(k):\r\n lst.append(n - x)\r\n for y in range(k, n):\r\n lst.append(y - k + 1)\r\n res = [str(b) for b in lst]\r\n print(' '.join(res))\r\n\r\n", "n, k = map(int, input().split())\r\np = [str(x) for x in range(1, n + 1)]\r\np = p[k:0:-1] + ['1'] + p[k + 1:]\r\nprint(\" \".join(p))", "def reverse_with_start_end(A, start, end):\n\twhile (start < end):\n\t\tA[start] ^= A[end]\n\t\tA[end] ^= A[start]\n\t\tA[start] ^= A[end]\n\t\tstart +=1\n\t\tend -= 1\n\treturn A\nn, k = map(int, input().split())\nA = [i for i in range(1, n + 1)]\nA = reverse_with_start_end(A, 0, n - 1)\nA = reverse_with_start_end(A, k, n - 1)\nprint(*A)\n\n", "input1 = input().split()\ninput1 = list(map(int, input1))\nn = input1[0]\nk = input1[1]\n\nl1 = [i for i in range(n,0,-1)]\nx = l1[k::]\nx = x[::-1]\ns = l1[:k:] + x\ns = list(map(str, s))\ns = ' '.join(s)\nprint(s)", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,input().split()))\r\nfor _ in range(1):#nmbr()):\r\n n,k=lst()\r\n while k>0:\r\n stdout.write(str(n)+' ')\r\n n-=1\r\n k-=1\r\n for i in range(1,n+1):\r\n stdout.write(str(i) + ' ')", "nk=input().split()\r\nj=int(nk[0])\r\nfor i in range(int(nk[1])):\r\n print(j, end=' ')\r\n j-=1\r\nfor i in range(1, j+1):\r\n print(i, end=' ')", "def permutations(n,k,l):\r\n m=[]\r\n for i in range((n-1),((n-1)-k),-1):\r\n m.append(l[i])\r\n m.extend(l[:(n-k)])\r\n return(m)\r\nn,k=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(i)\r\nresult=permutations(n,k,l)\r\nfor i in result:\r\n print(i,end=\" \")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Feb 25 21:28:11 2021\r\n\r\n@author: Admin\r\n\"\"\"\r\n\r\nn,k = map(int,input().split())\r\narr = [0]*n\r\nfor i in range(n):\r\n if i < k:\r\n arr[i] = n-i\r\n else:\r\n arr[i] = i-k+1\r\nprint(*arr)", "''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''\r\n#codeforces285A\r\ngi = lambda : list(map(int,input().split()))\r\nn, k = gi()\r\nprint(\" \".join(map(str,list(range(n, n - k, -1)) + list(range(1, n - k + 1)))))", "n,k=map(int,input().split())\r\nl,r=list,range\r\na=l(r(n,n-k,-1))+l(r(1,n-k+1))\r\nprint(' '.join(map(str,a)))", "n,k=map(int,input().split())\r\nprint(*range(1,n-k),*range(n,n-1-k,-1))", "[n,k] = [int(i) for i in input().split()]\r\na = [i for i in range(n,n-k,-1)]\r\nb = [i for i in range(1,n-k+1,1)]\r\nprint(' '.join([str(i) for i in a] + [str(i) for i in b]))", "n, i = map(int, input().split())\r\nl = list(range(1, n + 1))\r\ni = -i-1\r\nl = l[-1:i:-1] + l[0:n + i +1]\r\nfor e in l:\r\n print(e, end=\" \")\r\n", "i=input().split()\r\nn,k=int(i[0]),int(i[1])\r\nfor i in range(n,n-k,-1):\r\n print(i,end=\" \")\r\nfor i in range(1,n-k+1):\r\n print(i,end=\" \")", "n, k = map(int, input().split())\r\n\r\nprint(*range(1,n-k), *range(n,n-k-1,-1))", "arr = input().split()\r\nn = int(arr[0])\r\nk = int(arr[1])\r\n\r\nj = 1\r\nans = ''\r\nptr = n\r\nfor i in range(k):\r\n\tans += str(ptr)\r\n\tans += ' '\r\n\tptr -= 1\r\nn -= k\r\nfor i in range(n):\r\n\tans += str(j)\r\n\tans += ' '\r\n\tj += 1\r\nprint(ans)", "s=list(map(int,input().split()))\r\nfor i in range(s[1]+1,0,-1):\r\n print(str(i)+' ',end='')\r\nfor i in range(s[1]+1,s[0],1):\r\n print(str(i+1)+' ',end='')", "k=list(map(int,input().split()))\r\nfor i in range(k[1]):\r\n print(k[0]-i,end=\" \")\r\nprint(\"1\",end=\" \")\r\nfor i in range(2,k[0]-k[1]+1):\r\n print(i,end=\" \")\r\nprint()", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\nfor i in range(1,n-k):\r\n print(i,end=\" \")\r\nfor i in range(n,n-k-1,-1):\r\n print(i,end=\" \")\r\n", "\"\"\"\nhttp://codeforces.com/problemset/problem/285/A\n\"\"\"\n\n[n, k] = [int(item) for item in input().split(' ')]\n\nincreasing = range(1, n + 1)\ndecreasing = reversed(increasing)\n\nindex = 0\nseq = []\nfor item in decreasing:\n if index >= k:\n break\n index += 1\n seq.append(item)\n\nfor item in increasing:\n if index >= n:\n break\n index += 1\n seq.append(item)\n\nprint(\" \".join(map(str,seq)))\n", "n,k = tuple(map(int, input().split()))\nfor i in range(k+1,0,-1):\n print(i,end=' ')\nfor i in range(k+2,n+1):\n print(i,end=' ')\n", "n,k = map(int,input().split())\r\nl = [i+1 for i in range(n)]\r\n\r\nprint(*(l[:k+1][::-1] + l[k+1:]))", "#for _ in range(int(input())):\r\n # n=int(input())\r\nn,k=map(int,input().split())\r\n#for i in range(n):\r\nfor i in range(k+1,0,-1):\r\n print(i,end=\" \")\r\nfor i in range(k+2,n+1,1):\r\n print(i,end=\" \")\r\nprint()\r\n", "import math\r\nimport sys\r\n\r\n#imgur.com/Pkt7iIf.png\r\n\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\nn, k = mi()\r\nj = n\r\nt = [n - i for i in range(k)] + [i for i in range(1, n - k + 1)]\r\nprint(' '.join(map(str, t)), end = ' ')\r\n", "# for _ in range(int(input())):\r\nn, k = map(int, input().split(\" \"))\r\nans = []\r\na = k\r\nnum = [i for i in range(1, n + 1)]\r\nfor i in range(1, a + 1):\r\n ans.append(num[-i])\r\ni = 0\r\nwhile len(ans) != n:\r\n ans.append(num[i])\r\n i += 1\r\nprint(*ans)", "#A. Slightly Decreasing Permutations\r\nn,k= map(int,input().split())\r\na = list(range(n,n-k,-1))\r\na += list(range(1,n-k+1))\r\nprint(*a)", "# A. Slightly Decreasing Permutations\r\n# https://codeforces.com/contest/285/problem/A\r\nn, k = map(int, input().split())\r\nA = [0] * n\r\ncurr_k = n\r\ncurr = 1\r\nfor i in range(n):\r\n if k > 0 :\r\n A[i] = curr_k\r\n k -= 1\r\n curr_k -= 1\r\n else:\r\n A[i] = curr\r\n curr += 1\r\nprint(*A)\r\n\r\n\"\"\"\r\n# B. Kuriyama Mirai's Stones\r\n# https://codeforces.com/problemset/problem/433/B\r\nn = int(input())\r\nA = [int(a) for a in input().split()]\r\nB = [0] * n\r\nC = [0] * n\r\n\r\nB[0] = A[0]\r\nfor i in range(n):\r\n B[i] = B[i - 1] + A[i]\r\n\r\nA.sort()\r\nC[0] = A[0]\r\nfor i in range(n):\r\n C[i] = C[i - 1] + A[i]\r\n\r\nfor _ in range(int(input())):\r\n t, l, r = map(int, input().split())\r\n if t == 1:\r\n if l >= 2:\r\n print(B[r - 1] - B[l - 2])\r\n else:\r\n print(B[r - 1])\r\n else:\r\n if l >= 2:\r\n print(C[r - 1] - C[l - 2])\r\n else:\r\n print(C[r - 1])\r\n\r\n\r\n# C. Building Permutation\r\n# https://codeforces.com/contest/285/problem/C\r\nA = [int(a) for a in input().split()]\r\nA.sort()\r\nans = 0\r\ncurr = 1\r\nfor i in range(int(input())):\r\n if A[i] < curr:\r\n ans += abs(curr - A[i])\r\n A[i] = curr\r\n elif A[i] > curr:\r\n ans += abs(A[i] - curr)\r\n A[i] = curr\r\n curr += 1\r\nprint(ans)\r\n\r\n\r\n# C. Djikstra.\r\n# https://codeforces.com/problemset/problem/20/C\r\n\"\"\"", "n,k = map(int,input().split())\r\nfor i in range(1,n-k):\r\n\tprint(i,end=' ')\r\nfor i in range(n,n-k-1,-1):\r\n\tprint(i,end=' ')", "n , k = map(int,input().split())\r\nprint(*([i for i in range(n,n-k,-1)]+[i for i in range(1,n-k+1)]))\r\n", "n, k = map(int,input().split())\nrow = []\n\nfor _ in range(k):\n row.append(n)\n n -=1\nfor i in range(1,n+1):\n row.append(i)\n\nprint(*row)", "n, k = map(int, input().split())\r\nlstrs = []\r\npos = k + 1\r\nwhile pos > 0:\r\n lstrs.append(str(pos))\r\n pos -= 1\r\nfor i in range(k + 2, n + 1):\r\n lstrs.append(str(i))\r\nprint(\" \".join(lstrs))", "from sys import stdin, stdout\nfrom heapq import heapify , heappush , heappop\nimport sys\nfrom collections import Counter,defaultdict,deque\nfrom copy import deepcopy\nimport math\nfrom itertools import permutations\n\nsys.setrecursionlimit(10 ** 5)\n\nmod = 10 **9 + 7\n\ndef gcd(a,b):\n if(b==0):\n return a\n else:\n return gcd(b,a%b)\n\ndef SieveOfEratosthenes(n):\n prime = [True for i in range(n + 1)]\n p = 2\n while (p * p <= n):\n if (prime[p] == True):\n for i in range(p * 2, n + 1, p):\n prime[i] = False\n p += 1\n prime[0]= False\n prime[1]= False\n ans = []\n for p in range(n + 1):\n if prime[p]:\n ans.append(p)\n return ans\n\n\ndef mapinput():\n return map(int, stdin.readline().split())\n\ndef strinput():\n return stdin.readline().strip()\n\ndef listinput():\n return list(map(int,stdin.readline().split()))\n\ndef intinput():\n return int(stdin.readline().strip())\n\ndef bins(lis , val):\n low = 0\n high = len(lis) - 1\n while low <= high:\n mid = (low + high)>>1\n if lis[mid][0] == val:\n return mid\n elif lis[mid][0] > val:\n high = mid - 1\n else:\n low = low + 1\n #print(\"ret\")\n return low \n\nfor test in range(1):\n def solve():\n n , k = mapinput()\n ans = [i for i in range(n,0,-1) ]\n k = n- k\n an = []\n while k > 1:\n an.append(ans.pop())\n k -= 1\n return an + ans\n\n print(*solve())\n \n\n\n \n\n\n \n", "n,k =map(int,input().split())\na = list(range(1,n+1))\nd = a[:k+1]\ni = a[k+1:]\nd.reverse()\nl = d + i\nprint(*l)", "inp = input().split()\r\nn = int(inp[0])\r\nk = int(inp[1])\r\nans = []\r\nfor i in range(n, n-k, -1):\r\n ans.append(i)\r\nfor i in range(1, n-k+1):\r\n ans.append(i)\r\na = ''\r\nfor i in range(len(ans)):\r\n a += str(ans[i])\r\n if i != len(ans) - 1:\r\n a += ' '\r\nprint(a)", "import sys\r\n\r\nn, k = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nj = 0\r\nresult = []\r\nfor i in range(n, 0, -1):\r\n if(j < k):\r\n result.append(str(i))\r\n j += 1\r\n else:\r\n break\r\n\r\nfor i in range(1, n - k + 1):\r\n result.append(str(i))\r\n \r\nprint(\" \".join(result))", "n, k = map(int, input().split())\r\n\r\nl_n = [str(x) for x in range(1, n + 1)]\r\n\r\nl_n = l_n[n : n - k - 1 : -1] + l_n[0 : n - k]\r\nprint(\" \".join(l_n))", "n,k=map(int,input().split())\r\nwhile k>0:\r\n print(n,end=\" \")\r\n n-=1\r\n k-=1\r\na=1\r\nwhile a<=n:\r\n print(a,end=\" \")\r\n a+=1", "n, k = map(int, input().split())\r\nfor i in range(n - k - 1):\r\n print(i + 1, end=\" \")\r\nfor i in reversed(range(n - k - 1, n)):\r\n print(i + 1, end=\" \")", "n, k = map(int, input().split())\nif k == 0:\n print(*[x for x in range(1, n + 1)])\nelse:\n coff = n - k + 1\n print(*[x for x in range(n, coff-1, -1)], end = ' ')\n print(*[x for x in range(1, coff)])\n", "# python3\r\nimport sys, threading, os.path\r\nimport collections, heapq, math,bisect\r\nimport string\r\nfrom platform import python_version\r\nimport itertools\r\nsys.setrecursionlimit(10**6)\r\nthreading.stack_size(2**27)\r\n\r\ndef main():\r\n if os.path.exists('input.txt'):\r\n input = open('input.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n #--------------------------------INPUT---------------------------------\r\n a,k= list(map(int, input.readline().split()))\r\n sol = []\r\n for i in list(range(k+1,0,-1))+list(range(k+2,a+1)):\r\n sol.append(i)\r\n output =' '.join(map(str, sol))\r\n #-------------------------------OUTPUT----------------------------------\r\n if os.path.exists('output.txt'):\r\n open('output.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n#threading.Thread(target=main).start()", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nfrom itertools import permutations\r\n\r\nn,k=R()\r\n\r\nfor i in range(1,n-k):\r\n print(i,end=' ')\r\n\r\nfor i in range(n,n-k-1,-1):\r\n print(i,end=' ')\r\n\r\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\n#input,print = stdin.readline,stdout.write\r\n\r\nn,k = list(map(int,input().split()))\r\nprint(*[i for i in range(k+1,0,-1)],*[i for i in range(k+2,n+1)])\r\n", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nn, k = map(int, inpu().split())\r\na = [n - i for i in range(k)] + [i for i in range(1, n - k + 1)]\r\nprin(' '.join(map(str, a)) + '\\n')", "n,k=list(map(int,input().split()))\r\n\r\narr=[]\r\nfor i in range(n,n-k+1-1,-1):\r\n arr.append(i)\r\n#print(*arr)\r\nfor i in range(1,n-k+1):\r\n arr.append(i)\r\nprint(*arr)\r\n", "n,k=map(int,input().split())\r\nfor i in range(n-k-1):\r\n print(i+1,end=' ')\r\nfor i in range(k+1):\r\n print(n-i,end=' ')", "n, k = [int(x) for x in input().split()]\r\n\r\nps = [str(i+1) for i in range(n)]\r\n\r\nfront = ps[:(n-k-1)]\r\nback = ps[-k-1:][::-1]\r\n\r\nxs = front + back\r\n\r\nprint(\" \".join(xs))", "n,k = list(map(int, input().split()))\r\nans = []\r\nfor i in range(k):\r\n ans.append(n-i)\r\nfor i in range(1,n-k+1):\r\n ans.append(i)\r\nprint(*ans)", "n, k = map(int, input().split())\n\nlis_1 = list(range(1, n-k))\nlis_2 = list(range(n, n-k-1, -1))\n\nlista = lis_1 + lis_2\n\nfor i in lista:\n print(i, end=' ')\n\n \t \t \t \t \t\t\t \t\t\t\t \t \t\t \t\t\t \t", "n,k=[int(x) for x in input().split(' ')]\nans=[str(x) for x in range(1,n+1)]\nk+=1\ntemp=ans[:n-k]\ntemp+=ans[n-k:][::-1]\nprint(' '.join(temp))", "x = input().split()\r\nn = int(x[0])\r\nk = int(x[1])\r\n\r\narr = []\r\nfor i in range(1,n+1):\r\n arr.append(i)\r\n\r\nif k == 0:\r\n for val in arr:\r\n print(val, end = ' ')\r\nelif k == n -1:\r\n arr = arr[::-1]\r\n for val in arr:\r\n print(val,end = ' ')\r\n # print(int(str(arr[::-1])))\r\nelse:\r\n temp = []\r\n while k > 0:\r\n temp.append(arr.pop())\r\n k-=1\r\n \r\n newarr = temp + arr\r\n for val in newarr:\r\n print(val,end = ' ')\r\n # print(int(str(newarr)))\r\n\r\n", "def solution():\r\n\tn,k=map(int,input().split())\r\n\tarr=[i for i in range(1,n+1)]\r\n\r\n\tsol=[]\r\n\twhile k:\r\n\t\tsol.append(arr.pop())\r\n\t\tk-=1\r\n\tsol+=arr\r\n\tprint(*sol)\r\n\t\r\n \r\n \r\n\treturn\r\n \r\n \r\n# t=int(input())\r\n# while t:\r\n# \tt-=1\r\nsolution()\r\n\t", "n,k = map(int,input().split())\r\nfor i in range(k):\r\n print(n-i,end=\" \")\r\nfor j in range(1,n-k+1):\r\n print(j,end=\" \")\r\n\r\n ", "n,k = map(int,input().rstrip().split())\r\n\r\nfor i in range(n,n-k,-1):\r\n print(i,end=\" \")\r\n\r\nfor i in range(1,n-k+1):\r\n print(i,end=\" \")", "n, k = map(int, input().split())\r\nfor i in range(k):\r\n print(n - i, end = \" \")\r\nfor i in range(n - k):\r\n print(i + 1, end = \" \")\r\n", "I=lambda:list(map(int,input().split()))\r\nn,m=I()\r\nl=list(range(1,n+1))\r\ntemp=l[:m+1]\r\nl=temp[::-1]+l[m+1:]\r\nprint(*l)", "a=list(map(int,input().split()))\r\nprint(' '.join(map(str,range(1,a[1]+2)[::-1])),' '.join(map(str,range(a[1]+2,a[0]+1))))\r\n", "n, k = [int(x) for x in input().split()]\nif n//2 >=k:\n arr = list(range(1,n+1))\n c = 0\n for i in range(0,n-1,2):\n if c == k:\n break\n arr[i] , arr[i+1] = arr[i+1] , arr[i]\n c += 1\n\nelse:\n arr = list(reversed(range(1, n + 1)))\n c = n-1\n for i in range(0,n-1,2):\n if c == k:\n break\n arr[i] , arr[i+1] = arr[i+1] , arr[i]\n c -= 1\n\nfor x in arr:\n print(x, end=' ')", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom posixpath import split\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\n\r\n\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\ndef solve():\r\n n,k=map(int,input().split())\r\n \r\n for i in range(k):\r\n print(n-i,end=\" \")\r\n for i in range(1,n-k+1):\r\n print(i,end=\" \")\r\n print()\r\n\r\n# f.truncate(0)\r\n# for _ in range(int(input())):\r\n# # s=input()\r\n# # n=int(input())\r\n# f.write(f\"Case #{_+1}: {solve()}\\n\")\r\n# f.close()\r\n# print(solve())\r\n\r\nif __name__ == \"__main__\":\r\n # for _ in range(int(input())):\r\n solve()", "n, k = map(int, input().split())\r\na = [x for x in range(1, n+1)]\r\nans = []\r\nfor i in range(k, -1, -1):\r\n ans .append(a[i])\r\nfor i in range(k+1, n):\r\n ans.append(a[i])\r\nprint(*ans)", "n, k = map(int, input().split())\n\np = []\nfor i in range(k + 1, 0, -1):\n p.append(i)\nfor i in range(k+2, n+1):\n p.append(i)\n\n# assert len(p) == n\n# s = 0\n# for i in range(n - 1):\n# if p[i] > p[i+1]:\n# s += 1\n# assert s == k\n\nprint(*p)\n", "def main():\r\n n, k = map(int, input().split())\r\n z = [f'{i}' for i in range(1, n + 1)]\r\n x = list(reversed(z))[:k]\r\n print((' '.join(x) + \" \" + ' '.join(z[:n - k])).strip())\r\n\r\nif __name__ == '__main__':\r\n main()", "n, k = map(int, input().split())\n\np = list(range(1, n-k)) + list(range(n, n-k-1, -1))\nfor n in p:\n print(n)", "n,k = map(int,input().split())\r\na = list(range(1,n+1))\r\na = a[:k+1][::-1]+a[k+1:]\r\nprint(*a)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(n, m):\r\n A = [0] * n\r\n for i in range(n):\r\n A[i] = i + 1\r\n B = []\r\n for i in range(m):\r\n B.append(A[-1])\r\n A.pop()\r\n return B + A\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n A = solve(n, m)\r\n print(' '.join(list(str(a) for a in A)))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int,input().split())\r\nif k is 0:\r\n for i in range(1,n+1):\r\n if i is n:\r\n print (i,end=\"\")\r\n else:\r\n print (i,end=\" \")\r\n \r\nelif k is n-1:\r\n for i in range(n,0,-1):\r\n if i is 1:\r\n print (i,end=\"\")\r\n else:\r\n print (i,end=\" \")\r\n\r\nelse:\r\n for i in range(n,n-k,-1):\r\n print (i,end = \" \")\r\n for i in range(1,n-k+1):\r\n if i is n-k:\r\n print (i,end=\"\")\r\n else:\r\n print (i,end=\" \")", "n,k=map(int,input().split())\r\nfor i in range(0,k):\r\n print(n-i,end=\" \")\r\nfor i in range(k,n):\r\n print(i-k+1,end=\" \")", "n, k = map(int, input().split())\n\nprint(*list(reversed(range(1, k + 2))) + list(range(k + 2, n + 1)))", "n,m=map(int,input().split())\r\nl=[i for i in range(1,n+1)]\r\nl1=[]\r\nwhile m>0 :\r\n l1.append(l[n-1])\r\n del(l[n-1])\r\n n=n-1\r\n \r\n m=m-1\r\nprint(*(l1+l))\r\n", "import string\n\nalphabet = list(string.ascii_lowercase)\ninf = 2**20\n\n\ndef print_sequence(s):\n print(*s, sep=' ')\n\n\ndef read_sequence():\n return list(map(int, input().split()))\n\n\ndef print_bool_result(res):\n if res:\n print('Yes')\n else:\n print('No')\n\nn, k = read_sequence()\nresult = [i + 1 for i in range(n - k - 1)] + [n - i for i in range(k + 1)]\nprint_sequence(result)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(i)\r\nl1=l[0:n-k-1]\r\nl.reverse()\r\nfor i in range(k+1):\r\n l1.append(l[i])\r\nfor i in l1:\r\n print(i,end=\" \")", "def input_list():\r\n return list(map(int, input().split()))\r\n\r\n\r\nn, k = input_list()\r\n\r\nlis1 = list(range(1, n + 1))\r\n\r\nif k != 0:\r\n s = lis1[n - k : ]\r\n s.reverse()\r\n final = s + lis1[:-k]\r\n print(*final)\r\nelse :\r\n print(*lis1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nd = list(range(1, n-k))\r\ne = list(range(n-k, n+1))[::-1]\r\nprint(' '.join(map(str, d+e)))", "l1=input().split()\r\nk=int(l1[1])\r\nn=int(l1[0])\r\nfor i in range(0,k):\r\n print(n-i,end=\" \")\r\nfor i in range(1,n-k+1):\r\n print(i,end=\" \")", "n,k=map(int,input().split())\r\ns=[str(i+1) for i in range(n)]\r\nprint(' '.join(s[n-k:][::-1]+s[:n-k])) \r\n\r\n\r\n#see output\r\n#start from n and go decreasing k times then start from 1 untill length of this array is n", "n,k=map(int,input().split())\r\narr=[int(i) for i in range(1,n+1)]\r\narr1=arr[:k+1]\r\narr1.sort(reverse=True)\r\narr2=arr[k+1:]\r\nprint(*arr1,end=\" \")\r\nif len(arr2)!=0:\r\n print(*arr2)\r\n\r\n", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n line = [str(it + 1) for it in range(n)]\r\n line = [str(it) for it in range(n, n - k, -1)] + [str(it) for it in range(1, n - k + 1)]\r\n print(' '.join(line))\r\n", "n,k=map(int,input().split())\r\nfor i in range(k):\r\n print(n,end=\" \")\r\n n=n-1\r\nfor i in range(1,n+1):\r\n print(i,end=\" \") ", "n, k = [int (x) for x in input().split()]\r\nlst=[]\r\nif(k==0):\r\n for i in range(1,n+1):\r\n lst.append(i)\r\nelif(k==n-1):\r\n for i in range(n,0,-1):\r\n lst.append(i)\r\nelse:\r\n for i in range(n,n-k,-1):\r\n lst.append(i)\r\n for i in range(1,n-k+1):\r\n lst.append(i)\r\nprint(*lst)", "a,b=list(map(int,input().split()))\n\nfor i in list(range(b+1,0,-1))+list(range(b+2,a+1)):\n print(i,end=' ')\n", "perm_length, factor = list(map(lambda x : int(x), input().split(\" \")))\r\na = ' '.join(map(lambda x : str(x), list(reversed(range(perm_length - factor + 1, perm_length+1)))))\r\nb = ' '.join(map(lambda x : str(x), list(range(1, perm_length - factor + 1))))\r\nprint(a+' '+b)", "n, k = map(int,input().split())\r\n\r\nfor i in range(k):\r\n print(n , end = ' ')\r\n n -=1\r\n\r\nfor i in range(1 , n + 1 ):\r\n print(i , end = ' ')\r\n\r\n\r\n\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,k=rinput()\r\na=[]\r\nfor i in range(n,n-k,-1):\r\n a.append(i)\r\n\r\nfor i in range(1,n-k+1):\r\n a.append(i)\r\n\r\nprint(*a)", "n,k = map(int,input().split())\r\n\r\nres = []\r\nfor i in range(k):\r\n res.append(n-i)\r\n\r\nfor j in range(1,n-k+1):\r\n res.append(j)\r\n\r\nprint(*res)", "n, k = [int(i) for i in input().split()]\r\nfor i in range(n, n-k, -1):\r\n print(i, end=' ')\r\nfor i in range(1, n - k + 1):\r\n print(i, end=' ')\r\n", "n,k = [int(x) for x in input().split()]\r\nprint(*[x for x in range(1,n-k)]+[x for x in range(n,n-k-1,-1)])\r\n", "t , n = list(map(int, input().split()))\r\n\r\nli = [i+1 for i in range(0, t, 1)]\r\n\r\nj = n\r\ni = 0\r\nwhile i < j :\r\n temp = li[i]\r\n li[i] = li[j]\r\n li[j] = temp\r\n\r\n i += 1\r\n j -= 1\r\n\r\nfor i in li:\r\n print(f\"{i}\", end=' ')\r\nprint(\"\\r\")\r\n", "n, k = map(int, input().strip().split())\r\nres = [''] * n\r\nfor i in range(n - k - 1):\r\n res[i] = (str(i + 1))\r\ndiff = n - 1\r\nfor i in range(n - k - 1, n):\r\n res[diff] = str(i + 1)\r\n diff -= 1\r\nprint(' '.join(res))", "n,k=map(int,input().split())\r\nfor i in range(k):print(n-i,end=' ')\r\nfor i in range(n-k):print(i+1,end=' ')", "n,k=map(int,input().split())\r\nz=[x for x in range(n,0,-1)]\r\nprint(*(z[k+1:][::-1]+z[:k+1]))", "n,k = map(int, input().split())\r\nprint(*(list(range(k+1,0,-1))+[i+k for i in range(2,n-k+1)]))", "n,k= map(int,input().split())\r\nfor i in range(k):\r\n print(n-i,end =\" \")\r\nfor j in range(n-k):\r\n print(j+1,end =\" \")\r\n", "n, k = map(int, input().split())\r\nq=[]\r\n\r\nfor i in range(n, n-k, -1):\r\n q.append(i)\r\nfor i in range(1, n-k+1):\r\n q.append(i)\r\nprint(*q)\r\n", "import sys\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappush, heappop\r\nfrom functools import lru_cache\r\nfrom math import floor, ceil, sqrt, gcd\r\nfrom string import ascii_lowercase\r\nfrom math import gcd\r\nfrom bisect import bisect_left, bisect, bisect_right\r\n\r\n\r\ndef read():\r\n return input().strip()\r\n\r\n\r\ndef read_int():\r\n return int(read())\r\n\r\n\r\ndef read_str_list():\r\n return read().split()\r\n\r\n\r\ndef read_numeric_list():\r\n return list(map(int, read_str_list()))\r\n\r\n\r\ndef solve(N, K):\r\n res = []\r\n\r\n for i in range(K):\r\n res.append(N-i)\r\n\r\n for i in range(1, N-K+1):\r\n res.append(i)\r\n\r\n return \" \".join(map(str, res))\r\n\r\n\r\nN, K = read_numeric_list()\r\n\r\nprint(solve(N, K))\r\n", "arr=[int(x) for x in input().split()]\r\nn,k=arr[0],arr[1]\r\nc=n-k-1\r\nans=[i+1 for i in range(c)]\r\nfor i in range(n,n-k-1,-1):\r\n ans.append(i)\r\nprint(*ans) ", "n,k = map(int,input().split())\nfor i in range(k):\n print(n,end=' ')\n n -= 1\nfor i in range(1,n+1):\n print(i,end=' ')\n", "import math\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n res = []\r\n if k == 0:\r\n res = [x for x in range(1, n+1)]\r\n else:\r\n res = [x for x in range(n, n-k, -1)] + [x for x in range(1, n-k+1)]\r\n print(' '.join(map(str, res)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k = map(int,input().split(' '))\n\na = [str(i) for i in range(1,n+1)]\nif k != 0:\n a = list(reversed(a[-k:])) + a[:-k]\n\nprint(' '.join(a))\n\n", "n,k=map(int, input().split())\nprint(*([i for i in range(n, n-k, -1)]+[i for i in range(1, n-k+1)]))\n", "n, k = map(int, input().split())\r\narr = [i for i in range(1, n + 1)]\r\narr.sort(reverse = True)\r\nif k == n - 1:\r\n\tarr.sort(reverse = True)\r\n\tprint(*arr)\r\nelse:\r\n\tnew_arr = arr[: k] + sorted(arr[k:])\r\n\tprint(*new_arr)\r\n\r\n", "a=list(map(int, input().split()))\r\nn=a[0]\r\nk=a[1]\r\nl=list(range(1,n+1))\r\np=n-k\r\nl1=l[:p]\r\nl2=l[p:]\r\nl2.reverse()\r\nl3=l2+l1\r\nprint(' '.join(map(str, l3)))", "n, k = map(int, input().split())\r\nli = [i for i in range(1, n+1)]\r\nres = []\r\ni = n - 1\r\nwhile k:\r\n res.append(li[i])\r\n i -= 1\r\n k -= 1\r\nres.extend(li[:i+1])\r\nprint(*res)", "n, k = map(int, input().split())\r\n\r\nfor i in range(k):\r\n print(n - i, end=\" \")\r\nprint(1, end=\" \")\r\nfor i in range(2, n - k + 1):\r\n print(i, end=\" \")\r\nprint()\r\n", "def solve() -> None:\n n, k = [int(x) for x in input().split()]\n p = list(range(1, n + 1))\n \n print(*p[:n - k - 1], *p[n - k - 1:][::-1])\n\nif __name__ == \"__main__\":\n\n t = 1\n # t = int(input())\n for _ in range(t):\n solve()\n\n# 1 2 3 4 5\n# 0 1 2 3 4", "def permutation(n , k):\r\n m = [i for i in range(1 , n + 1)]\r\n p = m[::-1]\r\n result = p[:k] + m[:(n - k)]\r\n return result\r\n \r\nif __name__ ==\"__main__\":\r\n temp = list(map(int , input().rstrip().split()))\r\n n = temp[0]\r\n k = temp[1]\r\n result = str()\r\n temp = permutation(n , k)\r\n for i in temp:\r\n result += str(i) + ' '\r\n print (result.rstrip())\r\n", "n, k=map(int,input().split())\na=list(range(n+1))\nf=a[1:n-k+1]\nd=a[-1:-k-1:-1]\nprint(' '.join(map(str,d)) +' '*(len(f) > 0 and len(d) > 0) + ' '.join(map(str,f)))\n", "n,k = [int(x) for x in input().split()]\r\n\r\nans = []\r\nlast = n\r\n\r\nidx = 0\r\nwhile idx != k:\r\n ans.append(last)\r\n last-=1\r\n idx+=1\r\n\r\nstart = 1\r\nwhile start <= last:\r\n ans.append(start)\r\n start+=1\r\n\r\nprint(*ans)", "n,k=map(int,input().split())\r\n\r\nfor i in range(0,k+1):\r\n print(k+1-i,end=\" \")\r\nfor i in range(1,n-k):\r\n print(k+1+i,end=\" \")", "n,k = map(int,input().split())\nx = k + 1\nfor i in range(1,n-k,1):\n print(i , end = \" \")\nfor j in range(n,n-k-1 , -1):\n print(j, end = \" \")", "#-------------------------------------------------------------------------------------------\n# Richard Mello\n# B - Slightly Decreasing Permutations \n#-------------------------------------------------------------------------------------------\n# Função principal\n#-------------------------------------------------------------------------------------------\n\ndef main():\n\t# Recebe\n\tn, k = [int(i) for i in input().split()]\n\n\t# Mostra a resposta\n\tvez = 1\n\tate = n\n\tcont = 0\n\t\n\twhile vez <= ate:\n\t\t# Se é pra inverter:\n\t\tif cont < k:\n\t\t\t# Mostra o ultimo\n\t\t\tprint(ate, end = ' ')\n\t\t\t# Diminui o limite\n\t\t\tate -= 1\n\t\t\t# E acrescenta o contador\n\t\t\tcont += 1\n\t\t# Se não é\n\t\telse:\n\t\t\t# Mostra o próximo\n\t\t\tprint(vez, end = ' ')\n\t\t\t# Sobe\n\t\t\tvez += 1\n\t\n\tprint()\n\nmain()\n\n#-------------------------------------------------------------------------------------------\n\n \t \t \t \t\t \t \t\t\t \t \t\t\t\t", "import sys; input = sys.stdin.buffer.readline\r\n\r\nn, k = map(int, input().split())\r\nA = list(range(1, k+2))\r\nB = list(range(k+2, n+1))\r\nA.reverse()\r\nP = A + B\r\n\r\nprint(*P)", "n, k = list(map(int, input().split()))\n\nvalues = list(range(1, n + 1))\nl = n - (k + 1)\nprint(*values[:l] + values[l:][::-1])\n", "n, k=map(int, input().split(\" \"))\r\n\r\na = []\r\nfor i in range(n):\r\n\ta.append(i+1)\r\n\r\nfor i in range(k):\r\n\tprint(n-i, end=\" \")\r\nfor i in range(n-k):\r\n\tprint(i+1, end=\" \")\r\n", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n line = list(range(n, n - k, -1)) + list(range(1, n - k + 1))\r\n print(' '.join(map(str, line)))\r\n", "# from dust i have come, dust i will be\r\n\r\nn, k = map(int, input().split())\r\n\r\ni = 1\r\ne = n - k - 1\r\n\r\nwhile i <= e:\r\n print(i, end = ' ')\r\n i += 1\r\n\r\nwhile k >= 0:\r\n print(n, end = ' ')\r\n n -= 1\r\n k -= 1", "def miis():\r\n return map(int, input().split())\r\n\r\nn, k = miis()\r\nfor i in range(k):\r\n print(n-i, end=' ')\r\nfor i in range(n-k):\r\n print(i+1, end=' ')\r\n", "n,k=map(int,input().split())\r\narr=[0]*(n)\r\nele=n\r\nfor i in range(k):\r\n\tarr[i]=ele\r\n\tele-=1\r\nele=1\r\nfor i in range(k,n):\r\n\tarr[i]=ele\r\n\tele+=1\r\n# print(arr)\r\nfor i in arr:\r\n\tprint(i,end=\" \")\r\nprint()", "n,k=map(int,input().split())\r\na=[*range(1,(n)+1)]\r\nprint(*(a[:n-1-k:-1]+a[:n-k]))", "n, k = map(int, input().split())\r\nans = list(range(1, n + 1))\r\nans[:k + 1] = ans[:k + 1][::-1]\r\nprint(*ans)", "n, k = map(int, input().split())\r\na = [k + 1]\r\nfor i in range(k):\r\n a.append(a[-1] - 1)\r\nif len(a) < n:\r\n a.append(k + 2)\r\n while len(a) < n:\r\n a.append(a[-1] + 1)\r\nprint(*a)", "def solve():\r\n n,k = map(int, input().split())\r\n a = []\r\n i=k+1\r\n while i > 0:\r\n a.append(i)\r\n i-=1\r\n for i in range(len(a)+1,n+1):\r\n a.append(i)\r\n print(*a)\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "# DO NOT EDIT THIS\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque, Counter, defaultdict\r\nimport heapq\r\nc = defaultdict(lambda : 0) # way faster than Counter\r\n\r\ndef inp(): return [int(k) for k in input().split()]\r\n\r\n# DO NOT EDIT THIS\r\n\r\nn, k = inp()\r\nbeginning, end = [int(k) for k in range(1, n - k)], [int(k) for k in range(n, n - k - 1, -1)]\r\nres = beginning + end\r\nprint(*res)\r\n\r\n", "from collections import Counter,defaultdict\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn,k=M()\r\nfor i in range(n,(n-k),-1):\r\n print(i,end=\" \")\r\nfor i in range(1,n-k+1):\r\n print(i,end=\" \")", "n,k=map(int,input().split())\r\na=[*range(1,n+1)]\r\nprint(*a[:n-k-1],*a[-1:-2-k:-1])", "n,k=map(int,input().split())\r\nl=[i for i in range(1,n+1)]\r\nfor i in l[n:(n-k)-1:-1]+l[:(n-k)]:\r\n print(i,end=\" \")", "import sys\r\ninpu = sys.stdin.readline\r\nprin = sys.stdout.write\r\nn, k = map(int, inpu().split())\r\na = [0]*n\r\nfor i in range(k) :\r\n a[i] = n - i\r\nfor i in range(1, n - k + 1) :\r\n a[k + i - 1] = i\r\nprin(' '.join(map(str, a)) + '\\n')", "n,k = map(int,input().strip().split())\r\na=list(range(1,n+1))\r\na[:k+1] = a[k::-1]\r\na=[str(i) for i in a]\r\nprint(' '.join(a))", "import os\r\nimport sys\r\nimport random\r\n\r\nn, k = map(int, input().split())\r\n\r\nif ((n-k)==1):\r\n c=n\r\n print (c)\r\n for i in range (1,n):\r\n c=c-1\r\n print(c)\r\n quit()\r\nc=1\r\nprint (c)\r\nfor i in range (1,n):\r\n if (i>(n-k-1)):\r\n c=c-1\r\n print (c)\r\n elif (i==(n-k-1)):\r\n c=n\r\n print(c)\r\n else :\r\n c=c+1\r\n print(c)\r\n", "n , k = map(int, input().split())\r\nl = []\r\nfor i in range(k):\r\n l.append(n-i)\r\nfor i in range(1,n-k+1):\r\n l.append(i)\r\nprint(*l)", "n,k=map(int,input().split())\r\na=[]\r\nfor i in range(1,n+1):\r\n a.append(i)\r\na=[]\r\nfor i in range(n-k-1):\r\n a.append(i+1)\r\nb=[]\r\nfor i in range(k+1):\r\n b.append(n-i)\r\na+=b\r\nfor i in a:\r\n print(i ,end=\" \")\r\n", "n,m=map(int,input().split(\" \"))\r\n\r\nidx=n\r\nfor i in range(m):\r\n print(idx,end=\" \")\r\n idx-=1\r\nidx=1;\r\n\r\nfor i in range(m+1,n+1):\r\n print(idx,end=\" \")\r\n idx+=1\r\n ", "def dec_premutations(k, n):\r\n\tarr = list(range(1, n+1))\r\n\ttemp = []\r\n\tfor i in range(k):\r\n\t\ttemp.append(arr[-(i+1)])\r\n\ttemp.extend(arr[:len(arr)-k])\r\n\tprint(*temp)\r\n\r\nn,k = map(int, input().split())\r\ndec_premutations(k,n)", "# n=int(input())\r\nn,k=map(int,input().split())\r\n\r\nfor i in range(k):\r\n\tprint(n-i)\r\n\r\nfor i in range(1,n-k+1):\r\n\tprint(i)\t", "n,k=[int(x) for x in input().split()]\r\nfor i in range(n,n-k,-1):\r\n print(str(i),end=\" \")\r\nfor i in range(1,n-k+1):\r\n if(i==(n-k)):\r\n print(str(i),end=\"\")\r\n else:\r\n print(str(i),end=\" \")\r\nprint()", "\r\n\r\nn, k = list(map(int, input().split()))\r\n\r\nans = []\r\nfor i in range(n):\r\n if i < k:\r\n ans.append(n-i)\r\n else:\r\n ans.append(i-k+1)\r\n \r\nprint(' '.join(map(str, ans)))", "n, k = map(int, input().split())\r\ni = 1\r\nwhile i < n + 1:\r\n if k:\r\n print(n, end=\" \")\r\n n -= 1\r\n k -= 1\r\n else:\r\n print(i, end=\" \")\r\n i += 1\r\n", "n, k = map(int, input().split())\r\nfor j in range(n, n-k, -1):\r\n print(j, end=\" \")\r\nfor i in range(1, n-k+1):\r\n print(i, end=\" \")\r\n\r\n###### thanking telegram for solutions ######\r\n'''__________ ____ ___ _____________ __.___ \r\n\\______ \\ | \\/ _____/ |/ _| |\r\n | _/ | /\\_____ \\| < | |\r\n | | \\ | / / \\ | \\| |\r\n |____|_ /______/ /_______ /____|__ \\___|\r\n'''\r\n", "a, b = input().split()\r\na = int(a)\r\nb = int(b)\r\ntemp = a - b\r\n\r\nans = []\r\nfor i in range(b):\r\n ans.append(a)\r\n a -= 1\r\n\r\nadd = 1\r\nfor i in range(temp):\r\n ans.append(add)\r\n add += 1\r\n\r\nfor item in ans:\r\n print(item, end = \" \")", "'''\r\nCreated on ١٣‏/١٢‏/٢٠١٤\r\n\r\n@author: mohamed265\r\n'''\r\nt = input().split()\r\nfor i in range(int(t[1])): print(int(t[0]) - i, end=' ')\r\nfor i in range(int(t[0]) - int(t[1])): print(i + 1, end=' ')", "n, k = map(int, input().split())\r\nR = []\r\nfor i in range(1, n - k):\r\n R.append(i)\r\n\r\nfor i in range(n, n - k - 1, -1):\r\n R.append(i)\r\n\r\nprint(\" \".join(map(str, R)))\r\n", "n,k=list(map(int, input().strip().split()))\r\nr,d=['']*n,n-1\r\nfor i in range(n-k-1):\r\n r[i]=(str(i+1))\r\nfor i in range(n-k-1,n):\r\n r[d]=str(i+1)\r\n d-=1\r\nprint(' '.join(r))", "import math\r\nfor _ in range(1):\r\n n,k=map(int,input().split())\r\n for i in range(k+1,0,-1):\r\n print(i,end=\" \")\r\n for j in range(k+2,n+1):\r\n print(j,end=\" \")\r\n \r\n \r\n \r\n ", "# https://codeforces.com/problemset/problem/285/A\n\nn, k = map(int, input().split())\nprint(*range(1, n - k), *range(n, n - 1 - k, -1))\n", "\r\ndef printer(s):\r\n for i in range(len(s)):\r\n if i == len(s) - 1:\r\n print(s[i])\r\n else:\r\n print(s[i], end=\" \")\r\n\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n a = []\r\n x = n\r\n for i in range(k):\r\n a.append(x)\r\n x -= 1\r\n y = 1\r\n for i in range(1, n - k + 1):\r\n a.append(y)\r\n y += 1\r\n printer(a)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "n,m = map( int, input().split())\r\n\r\naux = n - m\r\nwhile n > aux:\r\n\tprint(n, end=\" \")\r\n\tn -= 1\r\n\r\nn = 1\r\nwhile n <= aux:\r\n\tprint(n, end=\" \")\r\n\tn+=1\r\n\t", "n, k = map(int, input().split())\r\ni = -1\r\nfor i in range(k):\r\n print(n-i,end = ' ')\r\nfor i in range(i+1,n):\r\n print(i-k+1, end = ' ')", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,k=(int(i) for i in input().split())\r\nl=[i for i in range(1,n-k)]+[i for i in range(n,n-k-1,-1)]\r\nprint(*l)", "n,k = list(map(int, input().split()))\r\n\r\np=[]\r\n\r\nfor i in range(k):\r\n p.append(str(n-i))\r\nfor i in range(n-k):\r\n p.append(str(i+1))\r\n\r\nprint(\" \".join(p))", "def main():\r\n n, k = map(int, input().split())\r\n mn = 1\r\n mx = n\r\n\r\n res = []\r\n\r\n for i in range(n - k - 1):\r\n res.append(mn)\r\n mn += 1\r\n\r\n for i in range(k + 1):\r\n res.append(mx)\r\n mx -= 1\r\n\r\n print(*res)\r\n\r\n\r\nmain()\r\n\r\n", "n, k = map(int, input().split())\r\n\r\nif k == 0:\r\n # If k is 0, print the permutation from 1 to n\r\n result = list(range(1, n + 1))\r\nelse:\r\n # If k is not 0, create a decreasing subsequence of length k and fill the rest with increasing values\r\n result = list(range(n, n - k, -1)) + list(range(1, n - k + 1))\r\n\r\nprint(\" \".join(map(str, result)))", "n, k = list(map(int, input().split()))\r\nmass = [i for i in range(1, n + 1)]\r\nmass_r = mass[:k + 1][::-1]\r\nans = mass_r + mass[k + 1:]\r\nprint(*ans)", "n, k = [int(s) for s in input().split(' ')]\nfor i in range(1, n-k):\n print(i, end='')\n if i != n:\n print(' ', end='')\nfor i in range(n, n-k-1, -1):\n print(i, end='')\n if i != n-k:\n print(' ', end='')\nprint()", "n,m=list(map(int,input().split()))\r\n\r\nfor _ in range(m):\r\n print(n,end=\" \")\r\n n-=1\r\nfor i in range(1,n+1):\r\n print(i,end=\" \")", "n,k=map(int,input().split())\r\ni=n\r\nwhile(i>(n-k)):\r\n print(i,end=' ')\r\n i-=1\r\no=1\r\nwhile(o<=(n-k)):\r\n print(o,end=' ')\r\n o+=1", "n, k = map(int, input().split())\r\n\r\nfor i in range(k+1, 0, -1):\r\n print(i, end=\" \")\r\n\r\nfor j in range(k+2, n+1):\r\n print(j, end=\" \")\r\n " ]

[ "# ====== author: kuanc (www.hank.fyi) | created: 04/15/23 01:14:36 CST ====== #\r\nfrom sys import stdin, stderr, stdout, setrecursionlimit\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict, deque, Counter\r\nfrom itertools import accumulate, combinations, permutations, product\r\nfrom functools import lru_cache, cmp_to_key, reduce\r\nfrom heapq import heapify, heappush, heappop, heappushpop, heapreplace\r\nfrom inspect import currentframe\r\n# from pypyjit import set_param\r\n# set_param(\"max_unroll_recursion=-1\")\r\n# setrecursionlimit(300005)\r\norda = 97\r\nINF = 1 << 60\r\nMOD = 1000000007\r\nMOD2 = 998244353\r\ninput = lambda: stdin.readline().rstrip(\"\\r\\n\")\r\nlinen = lambda cf_: \"[L\" + str(cf_.f_back.f_lineno) + \"] \"\r\ndbg = lambda *A, **M: stderr.write(\"\\033[91m\" + \\\r\n M.get(\"sep\", \" \").join(map(str, A)) + M.get(\"end\", \"\\n\") + \"\\033[0m\")\r\ndbgl = lambda *A, **M: stderr.write(\"\\033[91m\" + linen(currentframe()) + \\\r\n M.get(\"sep\", \" \").join(map(str, A)) + M.get(\"end\", \"\\n\") + \"\\033[0m\")\r\n# ============================ START OF MY CODE ============================ #\r\n\r\nclass Mo:\r\n def __init__(self, arr):\r\n self.arr = arr\r\n self.n = len(arr)\r\n self.queries = []\r\n self.L = 0\r\n self.R = -1\r\n\r\n def add_query(self, ql, qr):\r\n # [ql, qr]\r\n self.queries.append((ql, qr))\r\n\r\n def _init(self):\r\n self.ans = [0 for _ in range(len(self.queries))]\r\n\r\n self.count = self.additional = 0\r\n self.deqs = [deque() for _ in range(100005)]\r\n self.freq = [0 for _ in range(100005)]\r\n self.freq2 = [0 for _ in range(100005)]\r\n\r\n def _add(self, idx, is_left):\r\n a = self.arr[idx]\r\n deq = self.deqs[a]\r\n\r\n if is_left:\r\n self.freq[a] += 1\r\n if self.freq[a] == 1:\r\n self.count += 1\r\n self.additional += 1\r\n if self.additional == 1:\r\n self.count -= 1\r\n\r\n deq.appendleft(idx)\r\n if len(deq) >= 3 and (deq[1] - deq[0] != deq[2] - deq[1]):\r\n self.freq2[a] += 1\r\n if self.freq2[a] == 1:\r\n self.additional -= 1\r\n if self.additional == 0:\r\n self.count += 1\r\n else:\r\n self.freq[a] += 1\r\n if self.freq[a] == 1:\r\n self.count += 1\r\n self.additional += 1\r\n if self.additional == 1:\r\n self.count -= 1\r\n\r\n deq.append(idx)\r\n if len(deq) >= 3 and (deq[-1] - deq[-2] != deq[-2] - deq[-3]):\r\n self.freq2[a] += 1\r\n if self.freq2[a] == 1:\r\n self.additional -= 1\r\n if self.additional == 0:\r\n self.count += 1\r\n\r\n def _rem(self, idx, is_left):\r\n a = self.arr[idx]\r\n deq = self.deqs[a]\r\n\r\n if is_left:\r\n self.freq[a] -= 1\r\n if self.freq[a] == 0:\r\n self.count -= 1\r\n self.additional -= 1\r\n if self.additional == 0:\r\n self.count += 1\r\n\r\n if len(deq) >= 3 and (deq[1] - deq[0] != deq[2] - deq[1]):\r\n self.freq2[a] -= 1\r\n if self.freq2[a] == 0:\r\n self.additional += 1\r\n if self.additional == 1:\r\n self.count -= 1\r\n deq.popleft()\r\n else:\r\n self.freq[a] -= 1\r\n if self.freq[a] == 0:\r\n self.count -= 1\r\n self.additional -= 1\r\n if self.additional == 0:\r\n self.count += 1\r\n\r\n if len(deq) >= 3 and (deq[-1] - deq[-2] != deq[-2] - deq[-3]):\r\n self.freq2[a] -= 1\r\n if self.freq2[a] == 0:\r\n self.additional += 1\r\n if self.additional == 1:\r\n self.count -= 1\r\n deq.pop()\r\n\r\n def _out(self, qidx):\r\n self.ans[qidx] = self.count + 1\r\n\r\n def _solve_query(self, ql, qr):\r\n for i in range(self.R + 1, qr + 1):\r\n self._add(i, False)\r\n for i in range(self.L - 1, ql - 1, -1):\r\n self._add(i, True)\r\n for i in range(self.R, qr, -1):\r\n self._rem(i, False)\r\n for i in range(self.L, ql):\r\n self._rem(i, True)\r\n\r\n self.L = ql\r\n self.R = qr\r\n\r\n def solve(self):\r\n self._init()\r\n\r\n queries = self.queries\r\n SZ = round(pow(len(queries), 0.5))\r\n NUM = (self.n + SZ - 1) // SZ\r\n BS = [[] for _ in range(NUM)]\r\n\r\n for qi, (ql, qr) in enumerate(queries):\r\n BS[ql // SZ].append(qi)\r\n\r\n for bi in range(NUM):\r\n BS[bi].sort(key=lambda qi: queries[qi][1], reverse=bool(bi & 1))\r\n\r\n for B in BS:\r\n for qi in B:\r\n ql, qr = queries[qi]\r\n self._solve_query(ql, qr)\r\n self._out(qi)\r\n\r\n return self.ans\r\n\r\n\r\n\r\ndef solve(_tc):\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n\r\n mo = Mo(A)\r\n q = int(input())\r\n for _ in range(q):\r\n l, r = map(int, input().split())\r\n l -= 1; r -= 1\r\n mo.add_query(l, r)\r\n\r\n ans = mo.solve()\r\n print(*ans, sep='\\n')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # _tcs = int(input())\r\n for _tc in range(1, vars().get(\"_tcs\", 1) + 1):\r\n dbg(\"=== Case {} ===\".format(str(_tc).rjust(2)))\r\n solve(_tc)\r\n" ]

[ "n = int(input()) \r\nbase = list(map(int, input().split())) \r\nstock = [0 for k in range(int(1e6+1))]\r\nfor zbi in base : \r\n stock[zbi] = 1 \r\nt = base[-1] \r\nfor k in range(2,n+1) : \r\n num = base[n-k]\r\n for i in range(2, (t//num)+1) : \r\n if stock[i*num] >= 1 : \r\n stock[num] = max(stock[num], 1 + stock[i*num] )\r\nprint(max(stock))", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\ndp=[0]*(10**6+1)\r\nfor i in range(n):\r\n dp[a[i]]=1\r\nfor i in range(n):\r\n if dp[a[i]]>0:\r\n for j in range(a[i]*2,10**6+1,a[i]):\r\n if dp[j]>0:\r\n dp[j]=max(dp[j],dp[a[i]]+1)\r\nprint(max(dp))", "#!/usr/bin/env python3\nimport os\nimport sys\nfrom io import BytesIO, IOBase\n\n\nclass FastO:\n def __init__(self, fd=1):\n stream = BytesIO()\n self.flush = lambda: os.write(fd, stream.getvalue()) and not stream.truncate(0) and stream.seek(0)\n self.write = lambda b: stream.write(b.encode())\n\n\nclass ostream:\n def __lshift__(self, a):\n sys.stdout.write(str(a))\n return self\n\n\nsys.stdout, cout = FastO(), ostream()\n\nnumbers, num, sign = [], 0, True\nfor char in os.read(0, os.fstat(0).st_size):\n if char >= 48:\n num = num * 10 + char - 48\n elif char == 45:\n sign = False\n elif char != 13:\n numbers.append(num if sign else -num)\n num, sign = 0, True\n\nif char >= 48:\n numbers.append(num if sign else -num)\n\ngetnum = iter(numbers).__next__\n\nn = getnum()\ndp = [0] * (10**6 + 1)\nfor _ in range(n):\n dp[getnum()] = 1\nfor i in reversed(range(10**6 + 1)):\n dp[i] = max((dp[x] + 1 for x in range(2 * i, 10**6 + 1, i) if dp[x]), default=1) if dp[i] else 0\n\ncout << max(dp)\n", "def abc(n, a):\r\n MAX = 10 ** 6 + 1\r\n L = [0] * MAX\r\n for v in a:\r\n L[v] = 1\r\n\r\n for i in range(n):\r\n if L[a[i]]:\r\n for x in range(a[i] * 2, MAX, a[i]):\r\n if L[x]:\r\n L[x] = max(L[x], L[a[i]] + 1)\r\n return max(L)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n result = abc(n, a)\r\n print(result)\r\n", "import sys\ninput = sys.stdin.readline\n\n\nn = int(input())\na = [int(i) for i in input().split()]\nm = a[-1]\ndp = [0]*(m + 1)\nbest = 1\nfor i in range(n - 1, -1, -1):\n x = a[i]\n dp[x] = 1\n y = 2*x\n while y <= m:\n dp[x] = max(dp[x], 1 + dp[y])\n y += x\n best = max(best, dp[x])\nprint(best)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nm = 1000001\r\nd = [1]*m\r\n\r\nfor i in range(n-1):\r\n for j in range(w[i]+w[i], m, w[i]):\r\n d[j] = max(d[j], d[w[i]]+1)\r\n\r\nprint(max(d[i] for i in w))", "n = int(input())\r\na = [int(v) for v in input().split()]\r\nMAX = 10**6 + 1\r\nL = [0] * MAX\r\nfor v in a:\r\n L[v] = 1\r\n \r\nfor i in range(n):\r\n if L[a[i]]:\r\n for x in range(a[i] * 2, MAX, a[i]):\r\n if L[x]:\r\n L[x] = max(L[x], L[a[i]] + 1)\r\nprint(max(L))", "R = lambda: map(int, input().split())\r\nn = int(input())\r\ndp = [0] * (10**6 + 1)\r\nfor x in R():\r\n dp[x] = 1\r\nfor i in range(10**6, -1, -1):\r\n if dp[i]:\r\n for x in range(i + i, 10**6 + 1, i):\r\n if dp[x]:\r\n dp[i] = max(dp[i], dp[x] + 1)\r\nprint(max(dp))", "n = int(input())\r\na = list(map(int, input().split()))\r\nMAX = 10**6+1\r\nL = [0]*MAX\r\nfor x in a:\r\n L[x] = 1\r\n\r\nfor i in range(n):\r\n if L[a[i]]:\r\n for x in range(a[i]*2, MAX, a[i]):\r\n if L[x]:\r\n L[x] = max(L[x], L[a[i]]+1)\r\nprint(max(L))", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=[0]*(10**6+1)\r\nfor aa in a:\r\n l[aa]=1\r\nfor i in range(n):\r\n if l[a[i]]:\r\n for x in range(a[i]*2,10**6+1,a[i]):\r\n if l[x]:\r\n l[x]=max(l[x],l[a[i]]+1)\r\nprint(max(l))", "import sys\nimport math\nfrom math import ceil, sqrt\nfrom functools import lru_cache\nfrom collections import deque\ninput = sys.stdin.readline\nsys.setrecursionlimit(10000)\ndef ii():\n return int(input())\ndef li():\n return list(map(lambda x: int(x), input().split()))\nBIG = int(1e6+1)\nn = ii()\nL = li()\nbest = 1\nans = [1]*BIG\nfor k in L:\n cur = 2*k\n val = ans[k]\n best = max(best, val)\n while cur < BIG:\n ans[cur] = max(ans[cur], 1+val)\n cur += k\nprint(best)\n", "N = int(input())\r\nList = [int(x) for x in input().split()]\r\nMAX = 1000001\r\ndp = [0] * MAX\r\nfor i in List:\r\n dp[i] += 1\r\nfor i in range(N):\r\n if(dp[List[i]]):\r\n for j in range(List[i]*2,MAX, List[i]):\r\n if(dp[j]):\r\n dp[j] = max(dp[j], dp[List[i]]+1)\r\nprint(max(dp))" ]

[ "from collections import defaultdict\r\n\r\n\r\nn=int(input())\r\ns1=input().strip()\r\ns2=input().strip()\r\ng=defaultdict(list)\r\ntq=[]\r\nfor i in range(n):\r\n ord1=ord(s1[i])-ord(\"a\")\r\n ord2=ord(s2[i])-ord(\"a\")\r\n g[ord1].append(ord2)\r\n tq.append(ord1)\r\n g[ord2].append(ord1)\r\n\r\nvis=[0]*26\r\n# vis[ord(s1[0])-ord(\"a\")]=1\r\nans=[]\r\nfor i in tq:\r\n if vis[i]==0:\r\n vis[i]=1\r\n q=[i]\r\n while q:\r\n t=q.pop(0)\r\n for i in g[t]:\r\n if vis[i]==0:\r\n vis[i]=1\r\n ans.append((chr(t+97),chr(i+97)))\r\n q.append(i)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)", "#\n# Joseph Matsushita\n# Problem H\n# \n# Runtime complexity:\n# This program runs in O(n) time. This is because the main loop iterates n times.\n# Every other operation runs on constant time because the union list is limited in size, and no more than\n# 25 spells can be created (at 25 spells, it will be possible to go from any char to any other char).\n# These limitations introduce a constant ceiling on the spell-adding operations, meaning that the only\n# significant constaint is the amount of times the loop iterates.\n#\n# Space complexity:\n# This program takes up O(n) space. The amount of space needed to contain the 2 inputted strings in 2n.\n# The union list has a constant amount of space, and every other variable takes up a constant amount of space.\n#\n# Argument:\n# You cannot do better than O(n) time for this problem. Unless you hit 25 spells before every letter pairing is\n# checked, you cannot be certain that new spells will not be required, and this demands that the program checks\n# every single letter pairing. (note: the program could be modified to end the loop early if 25 spells are reached).\n# Similarly, because the main constraint on space is getting the strings into the program, you cannot do better\n# than O(n) space.\n#\n\ndef join(f, t, l):\n for i in range(len(l)):\n if l[i] == f:\n l[i] = t\n return l\n\nn = input() #never actually used\ntolya = input()\nvalya = input()\n\nspell = []\ngroupcount = 0 #this is just so different groups don't collide\nunion = [0]*26 #each spot corresponds to a letter a-z\n\n#union[ord(tolya[i])-97] turns the char from a tolya's string into an int between 0-25\n#such that a = 0, b= 1, and so on until z = 25\n\nfor i in range(len(tolya)): #or valya, they have the same length\n #check that the spot has different chars\n if tolya[i] != valya[i]:\n if union[ord(tolya[i])-97] == 0 and union[ord(valya[i])-97] == 0: #neither char is part of a group\n groupcount += 1 #create a new group\n union[ord(tolya[i])-97] = union[ord(valya[i])-97] = groupcount\n spell.append(tolya[i] + ' ' + valya[i]) #add a new spell\n # if one char is part of a group and the other is not...\n elif union[ord(tolya[i])-97] == 0 and union[ord(valya[i])-97] != 0:\n union[ord(tolya[i])-97] = union[ord(valya[i])-97]\n spell.append(tolya[i] + ' ' + valya[i])\n elif union[ord(tolya[i])-97] != 0 and union[ord(valya[i])-97] == 0:\n union[ord(valya[i])-97] = union[ord(tolya[i])-97]\n spell.append(tolya[i] + ' ' + valya[i])\n elif union[ord(tolya[i])-97] != union[ord(valya[i])-97]: #both in groups, but not the same group\n union = join(union[ord(tolya[i])-97], union[ord(valya[i])-97], union)\n spell.append(tolya[i] + ' ' + valya[i])\n #last remaining possibility is that both chars are already in the same group\n\nprint(len(spell))\nfor i in spell:\n print(i)\n\t\t \t\t\t \t\t \t\t\t\t \t\t\t \t \t \t", "\r\nimport sys\r\nimport threading\r\n\r\n\r\ndef main():\r\n from collections import defaultdict\r\n \r\n n = int(input())\r\n valya = input()\r\n tayla = input()\r\n \r\n parent = {}\r\n size = defaultdict(int)\r\n \r\n def find_set(n):\r\n if parent[n] == n:\r\n return n\r\n parent[n] = find_set(parent[n])\r\n return parent[n]\r\n ans = []\r\n \r\n def merge(x, y):\r\n \r\n a = find_set(x)\r\n b = find_set(y)\r\n \r\n if a != b:\r\n if size[a] < size[b]:\r\n a, b = b, a\r\n parent[b] = a\r\n size[a] += size[b]\r\n size[b] = 0\r\n ans.append((x, y))\r\n \r\n for i in range(n):\r\n \r\n u, v = valya[i], tayla[i]\r\n if u not in parent:\r\n parent[u] = u\r\n if v not in parent:\r\n parent[v] = v\r\n \r\n merge(u, v)\r\n \r\n \r\n print(len(ans))\r\n for x, y in ans:\r\n print(x, y)\r\n\r\n\r\nthreading.stack_size(1 << 27)\r\nsys.setrecursionlimit(1 << 30)\r\nthreading.main_thread = threading.Thread(target=main)\r\nthreading.main_thread.start()\r\nthreading.main_thread.join()\r\n", "from collections import defaultdict\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na, b = input().strip(), input().strip()\r\n\r\nf = {}\r\ndef find(x):\r\n if f[x] != x: f[x] = find(f[x])\r\n return f[x]\r\ndef union(x, y):\r\n f[find(x)] = find(y)\r\n\r\nfor u, v in zip(a, b):\r\n if u != v:\r\n if u not in f: f[u] = u\r\n if v not in f: f[v] = v\r\n if find(u) != find(v):\r\n union(u, v)\r\n\r\nmp = defaultdict(list)\r\nfor c in f:\r\n mp[find(c)].append(c)\r\n\r\nprint(sum(len(x)-1 for x in mp.values()))\r\nfor x in mp.values():\r\n for i in range(1, len(x)):\r\n print(x[i], x[i-1])", "A='abcdefghijklmnopqrstuvwxyz'\r\nn=int(input());q={};d={};z=[]\r\nfor i in range(26):d[A[i]]=i;q[i]=A[i]\r\nfor a,b in zip(input(),input()):\r\n if d[a]!=d[b]:\r\n z+=(a,b),\r\n for i in q.pop(d[b]):d[i]=d[a];q[d[a]]+=i\r\nprint(len(z))\r\nfor i in z:print(*i)", "\r\ndef solve():\r\n def root(s):\r\n while s != a[s]:\r\n s = a[s]\r\n return s\r\n \r\n def union(x1, y1):\r\n x = root(x1)\r\n y = root(y1)\r\n if x == y:\r\n return\r\n ans.append((chr(x1+97), chr(y1+97)))\r\n\r\n if s[x] > s[y]:\r\n a[y] = x\r\n s[x] += s[y]\r\n else:\r\n a[x] = y\r\n s[y] += s[x]\r\n \r\n n = int(input())\r\n c = input()\r\n b = input()\r\n\r\n ans = []\r\n a = [i for i in range(26)]\r\n s = [1 for i in range(26)]\r\n for i,j in zip(c, b):\r\n union(ord(i)-97, ord(j)-97)\r\n print(len(ans))\r\n for i,j in ans:\r\n print(i, j)\r\n\r\n\r\n \r\nsolve()", "n = int(input())\r\ns = input()\r\nt = input()\r\n\r\nletras = set()\r\nfor i in range(n):\r\n letras.add(s[i])\r\n letras.add(t[i])\r\n\r\nletras = list(letras)\r\n\r\ngrafo = {} # diccionario lista de adyacencia\r\n\r\nfor i in range(len(letras)):\r\n grafo[letras[i]] = []\r\n\r\nfor i in range(n):\r\n if s[i]!=t[i]:\r\n grafo[s[i]].append(t[i])\r\n grafo[t[i]].append(s[i])\r\n\r\nvisitados = [False]*len(letras)\r\n\r\ndef dfs(v):\r\n # devuelve el arreglo de visitas\r\n visitados[letras.index(v)] = True\r\n visitas = [v]\r\n for u in grafo[v]:\r\n if not visitados[letras.index(u)]:\r\n visitas.extend(dfs(u))\r\n return visitas\r\n\r\ncomponentes = []\r\nfor i in range(len(letras)):\r\n if not visitados[i]:\r\n componentes.append(dfs(letras[i]))\r\n \r\npociones = []\r\nfor i in range(len(componentes)):\r\n for j in range(len(componentes[i])-1):\r\n pociones.append((componentes[i][j], componentes[i][j+1]))\r\n\r\nprint(len(pociones))\r\nfor i in range(len(pociones)):\r\n print(*pociones[i])", "def find(parents,node):\r\n if parents[node] != node:\r\n parents[node] = find(parents,parents[node])\r\n return parents[node]\r\ndef union(parents,a,b):\r\n parents[find(parents,a)] = parents[find(parents,b)]\r\ndef solve():\r\n t = eval(input())\r\n text1 = input()\r\n text2 = input()\r\n needed = []\r\n parents = [i for i in range(26)]\r\n for i in range(t):\r\n if text1[i] != text2[i]:\r\n a = ord(text1[i])-ord('a')\r\n b = ord(text2[i])-ord('a')\r\n if find(parents,a)!= find(parents,b):\r\n union(parents,a,b)\r\n needed.append([text1[i],text2[i]])\r\n print(len(needed))\r\n for a,b in needed:\r\n print(a,b)\r\n\r\nsolve()", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport string\r\nimport sys\r\nimport time\r\n\r\nsys.setrecursionlimit(9999)\r\n\r\nn = int(input())\r\ns1 = input()\r\ns2 = input()\r\n\r\ntree = {}\r\n\r\n\r\ndef find(st):\r\n tree.setdefault(st, st)\r\n if tree[st] != st:\r\n tree[st] = find(tree[st])\r\n return tree[st]\r\n\r\n\r\nfor i in range(n):\r\n if s1[i] != s2[i]:\r\n tree[find(s1[i])] = find(s2[i])\r\n\r\nans = {}\r\nfor i in range(n):\r\n f1 = find(s1[i])\r\n if f1 != s1[i]:\r\n ans[s1[i]] = f1\r\n f2 = find(s2[i])\r\n if f2 != s2[i]:\r\n ans[s2[i]] = f2\r\n\r\nprint(len(ans))\r\nfor k, v in ans.items():\r\n print(k, v)\r\n", "size = int(input())\na = input().strip()\nb = input().strip()\nadj = [set() for _ in range(26)]\ndiscovered = [False] * 26\n\nfor i in range(size):\n u = ord(a[i]) - ord('a')\n v = ord(b[i]) - ord('a')\n adj[u].add(v)\n adj[v].add(u)\n\nnum = 0\ntransforms = []\nfor i in range(26):\n if discovered[i]:\n continue\n discovered[i] = True\n c = 0\n q = [i]\n while len(q) != 0:\n u = q.pop(0)\n c += 1\n for v in adj[u]:\n if discovered[v]:\n continue\n discovered[v] = True\n q.append(v)\n transforms.append((u, v))\n num += c - 1\n\nprint(num)\nfor u, v in transforms:\n print(chr(u + ord('a')), chr(v + ord('a')))\n \t \t \t\t \t \t\t\t\t\t\t \t\t\t \t\t", "class UnionFind:\n def __init__(self, n):\n self.par = [-1]*n\n self.rank = [0]*n\n\n def Find(self, x):\n if self.par[x] < 0:\n return x\n else:\n self.par[x] = self.Find(self.par[x])\n return self.par[x]\n\n def Unite(self, x, y):\n x = self.Find(x)\n y = self.Find(y)\n\n if x != y:\n if self.rank[x] < self.rank[y]:\n self.par[y] += self.par[x]\n self.par[x] = y\n else:\n self.par[x] += self.par[y]\n self.par[y] = x\n if self.rank[x] == self.rank[y]:\n self.rank[x] += 1\n\n def Same(self, x, y):\n return self.Find(x) == self.Find(y)\n\n def Size(self, x):\n return -self.par[self.Find(x)]\n\nn = int(input())\ns = list(str(input()))\nt = list(str(input()))\n\ns = [ord(c)-ord('a') for c in s]\nt = [ord(c)-ord('a') for c in t]\n\nuf = UnionFind(26)\nans = []\nfor u, v in zip(s, t):\n if not uf.Same(u, v):\n ans.append((u, v))\n uf.Unite(u, v)\nprint(len(ans))\nfor u, v in ans:\n u = chr(u+ord('a'))\n v = chr(v+ord('a'))\n print(u, v)\n", "import sys\r\nimport math\r\nimport collections\r\nfrom heapq import heappush, heappop\r\ninput = sys.stdin.readline\r\n \r\nints = lambda: list(map(int, input().split()))\r\n\r\nclass UnionFind:\r\n def __init__(self, size):\r\n self.link = [i for i in range(size)]\r\n self.size = [1 for _ in range(size)]\r\n\r\n def find(self, a):\r\n while self.link[a] != a:\r\n a = self.link[a]\r\n return a\r\n\r\n def same(self, a, b):\r\n return self.find(a) == self.find(b)\r\n\r\n def join(self, a, b):\r\n a = self.find(a)\r\n b = self.find(b)\r\n if (self.size[a] > self.size[b]):\r\n a, b = b, a\r\n self.link[a] = b\r\n self.size[b] += self.size[a]\r\n return b\r\n\r\n\r\nn = int(input())\r\ns = input().strip()\r\nt = input().strip()\r\ndsu = UnionFind(26)\r\nspells = []\r\n\r\nfor i in range(n):\r\n c1, c2 = ord(s[i]) - ord('a'), ord(t[i]) - ord('a')\r\n if not dsu.same(c1, c2):\r\n dsu.join(c1, c2)\r\n spells.append((s[i], t[i]))\r\n\r\nprint(len(spells))\r\nfor spell in spells:\r\n print(spell[0], spell[1])", "import sys\r\n#sys.stdin = 0\r\ndef dfs(x):\r\n if(v[x] == 1):\r\n return\r\n v[x] = 1\r\n for i in g[x]:\r\n dfs(i)\r\n\r\nn = int(input())\r\na = input()\r\nb = input()\r\ng = [[] for i in range(26)]\r\ns = [[] for i in range(26)]\r\nfor i in range(n):\r\n v = [0] * 26\r\n dfs(ord(a[i]) - ord('a'))\r\n if(v[ord(b[i]) - ord('a')] != 1):\r\n g[ord(a[i]) - ord('a')]+=[ord(b[i]) - ord('a')]\r\n s[ord(a[i]) - ord('a')]+=[ord(b[i]) - ord('a')]\r\n g[ord(b[i]) - ord('a')]+=[ord(a[i]) - ord('a')]\r\nr = []\r\nfor i in range(26):\r\n for j in s[i]:\r\n r+=[[chr(i + ord('a')), chr(j + ord('a'))]]\r\nprint(len(r))\r\nfor i in r:\r\n print(*i)", "n = int(input())\r\ns = list(input())\r\nt = list(input())\r\nans = []\r\nfor i in range(n):\r\n a = s[i]\r\n b = t[i]\r\n if (a != b):\r\n ans += [[a, b]]\r\n for j in range(n):\r\n if (s[j] == a):\r\n s[j] = b\r\n if (t[j] == a):\r\n t[j] = b\r\n #print(a, b, s, t)\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = input()[:-1]\r\nb = input()[:-1]\r\nd = []\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n for s in d:\r\n if a[i] in s:\r\n s.add(b[i])\r\n break\r\n elif b[i] in s:\r\n s.add(a[i])\r\n break\r\n else:\r\n d.append({a[i], b[i]})\r\nq = []\r\nwhile d:\r\n s = d.pop()\r\n for i in s:\r\n ew = 0\r\n for j in d:\r\n if i in j:\r\n j |= s\r\n ew = 1\r\n break\r\n if ew == 1:\r\n break\r\n else:\r\n q.append(s)\r\nprint(sum(len(i)-1 for i in q))\r\nfor i in q:\r\n w = list(i)\r\n for j in range(len(w)-1):\r\n print(w[j], w[j+1])", "class UnionFind:\n def __init__(self, N):\n self.parent = [i for i in range(N)]\n\n def root(self, x):\n if self.parent[x] != x:\n self.parent[x] = self.root(self.parent[x])\n return self.parent[x]\n\n def same(self, x, y):\n return self.root(x) == self.root(y)\n\n def connect(self, x, y):\n rootX = self.root(x)\n rootY = self.root(y)\n if rootX != rootY:\n self.parent[rootY] = rootX\n\nn = int(input())\nvalya = input()\ntolya = input()\n\ngraph = UnionFind(26)\nspells = []\nfor i in range(n):\n if valya[i] == tolya[i]:\n continue\n Vnum = ord(valya[i]) - ord(\"a\")\n Tnum = ord(tolya[i]) - ord(\"a\")\n if graph.same(Vnum, Tnum):\n continue\n graph.connect(Vnum, Tnum)\n spells.append(valya[i] + \" \" + tolya[i])\nprint(len(spells))\nprint(\"\\n\".join(spells))\n \t \t \t\t \t\t\t\t \t \t \t\t\t\t\t\t\t\t", "class DSU: \r\n def __init__(self, n) -> None:\r\n self.n = n \r\n self.f = [-1 for _ in range (n)] \r\n self.spanningEdges = []\r\n\r\n def root (self, u):\r\n if self.f[u] < 0: return u \r\n self.f[u] = self.root(self.f[u]) \r\n return self.f[u]\r\n\r\n def doMerge(self, u, v): \r\n u = self.root(u) \r\n v = self.root(v) \r\n if u != v: \r\n self.spanningEdges.append([u, v])\r\n self.f[u] = v\r\n return True \r\n else:\r\n return False \r\n\r\nn = int(input()) \r\ns = input()\r\nt = input()\r\ndsu = DSU(26) \r\nfor i in range (n): \r\n dsu.doMerge(ord(s[i]) - 97, ord(t[i]) - 97) \r\nprint (len(dsu.spanningEdges)) \r\nfor edge in dsu.spanningEdges: \r\n print (\"{u} {v}\".format(u=chr(edge[0] + 97), v=chr(edge[1] + 97)))", "\nn = int(input())\ns1 = input()\ns2 = input()\n\nchars = set(s1)\nchars |= set(s2)\nm = len(chars)\n\nchar_idx = {}\nidx_char = [None]*m\nfor idx,ch in enumerate(chars):\n char_idx[ch] = idx\n idx_char[idx] = ch\n\ngraph = [set() for _ in range(m)]\nfor ch1,ch2 in zip(s1,s2):\n if ch1 != ch2:\n idx1 = char_idx[ch1]\n idx2 = char_idx[ch2]\n graph[idx1].add(idx2)\n graph[idx2].add(idx1)\n\nvisited = [False]*m\nresult = []\n\ndef DFS(u,pu):\n if pu != -1:\n result.append((idx_char[pu], idx_char[u]))\n visited[u] = True\n for v in graph[u]:\n if not visited[v]:\n DFS(v,u)\n\nfor u in range(m):\n if not visited[u]:\n DFS(u,-1)\n\nprint(len(result))\nfor u,v in result:\n print(u,v)\n", "n = int(input())\r\na = list(input())\r\nb = list(input())\r\na = [ord(i)-97 for i in a]\r\nb = [ord(i)-97 for i in b]\r\nparent = [i for i in range (26)]\r\ncnt = 0\r\nans = []\r\nfor i in range (n):\r\n if a[i]!=b[i]:\r\n pa = a[i]\r\n while(parent[pa] != pa):\r\n pa = parent[pa]\r\n pb = b[i]\r\n while(parent[pb] != pb):\r\n pb = parent[pb]\r\n if pa != pb:\r\n parent[pb] = pa\r\n cnt += 1\r\n ans.append([pb,pa])\r\nprint(cnt)\r\nfor i in range (len(ans)):\r\n print(chr(ans[i][0]+97),chr(ans[i][1]+97))", "n = int(input())\r\nv = [[] for i in range(27)]\r\na = str(input())\r\nb = str(input())\r\nkk = 0\r\nvis = [0] * 27\r\ntt =[]\r\ndef dfs(x):\r\n global kk,tt\r\n if vis[x]:return\r\n vis[x] = 1\r\n kk += 1\r\n for i in v[x]:\r\n if vis[i]:continue\r\n tt += [[chr(x + 96),chr(i + 96)]]\r\n dfs(i)\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n v[ord(a[i]) - 96] += [ord(b[i]) - 96] \r\n v[ord(b[i]) - 96] += [ord(a[i]) - 96]\r\nans = 0\r\nkk = 0\r\nfor i in range(1,27):\r\n if vis[i]:continue\r\n dfs(i)\r\n ans += kk - 1\r\n kk = 0\r\nprint(ans)\r\nfor a, b in tt:\r\n print(a, b )", "n = int(input())\r\nvalya = input()\r\ntolya = input()\r\n\r\nparent = [i for i in range(26)]\r\nrank = [1]*(26)\r\n \r\ndef find(x): \r\n if x != parent[x]:\r\n parent[x] = find(parent[x])\r\n\r\n return parent[x]\r\n \r\ndef union(a,b):\r\n root_a = find(a)\r\n root_b = find(b)\r\n \r\n if root_a == root_b:\r\n return \r\n \r\n if rank[root_a] < rank[root_b]:\r\n root_a,root_b = root_b,root_a\r\n \r\n parent[root_b] = root_a\r\n rank[root_a] += rank[root_b]\r\n ans.append((chr(a + ord('a')),chr(b + ord('a')))) \r\n return \r\n\r\nans = []\r\nfor i in range(n):\r\n union(ord(valya[i]) - ord('a'),ord(tolya[i]) - ord('a'))\r\n\r\nprint(len(ans))\r\n\r\nfor a,b in ans:\r\n print(a,b)\r\n\r\n\r\n\r\n", "import io\r\nimport os\r\nimport sys\r\n\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.cnt = n\r\n self.par = list(range(n))\r\n self.ext = [1] * (n) \r\n \r\n def find(self, u):\r\n while u != self.par[u]:\r\n u = self.par[u]\r\n return u\r\n \r\n def unite(self, u, v):\r\n u, v = self.find(u), self.find(v)\r\n if u == v:\r\n return False\r\n if self.ext[u] < self.ext[v]:\r\n u, v = v, u\r\n self.ext[u] += self.ext[v]\r\n self.par[v] = u\r\n self.cnt -= 1\r\n return True\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a, b = strput().rstrip(), strput().rstrip()\r\n dsu = UnionFind(26)\r\n res = []\r\n for i in range(n):\r\n if dsu.unite(ord(a[i])-97, ord(b[i])-97):\r\n res.append(str(a[i]+\" \"+b[i]))\r\n print(len(res))\r\n print(*res, sep='\\n')\r\n\r\n\r\nfastin = io.BytesIO(os.read(0, os.fstat(0).st_size))\r\ninput = (fastin if 'PyPy' in sys.version else sys.stdin).readline\r\n \r\ndef strput():\r\n return input().decode() if 'PyPy' in sys.version else input()\r\n \r\nif __name__ == \"__main__\":\r\n main()", "import sys,os\r\nfrom math import gcd,log \r\nfrom bisect import bisect as bi\r\nfrom collections import defaultdict,Counter\r\ninput=sys.stdin.readline\r\nI = lambda : list(map(int,input().split()))\r\nfrom heapq import heappush,heappop\r\nimport random as rd\r\n\r\ndef find(x):\r\n\tst = []\r\n\twhile x!=par[x]:\r\n\t\tst.append(x) \r\n\t\tx = par[x]\r\n\twhile st:\r\n\t\tpar[st.pop()]=x\r\n\treturn par[x]\r\n\r\ndef join(a,b):\r\n\tx=find(a);y=find(b)\r\n\tpar[x]=par[y]= min(x,y)\r\n\treturn x!=y\r\n\r\nn, = I()\r\ns = input().strip()\r\nt = input().strip()\r\npar = {i:i for i in 'abcdefghijklmnopqrstuvwxyz'}\r\nan = []\r\nfor i in range(n):\r\n\tif join(s[i],t[i]):\r\n\t\tan.append([s[i],t[i]])\r\nprint(len(an))\r\nfor i in an:\r\n\tprint(*i)", "n=int(input())\r\ns=[ord(el)-ord(\"a\") for el in input()]\r\np=[ord(el)-ord(\"a\") for el in input()]\r\nparent=[i for i in range(27)]\r\ndef find(x):\r\n st=[]\r\n while parent[x]!=x:\r\n st.append(x)\r\n x=parent[x]\r\n for el in st:\r\n parent[el]=x\r\n return x\r\n\r\nans=[]\r\n\r\nfor a,b in zip(s,p):\r\n if a==b:\r\n pass\r\n else:\r\n if find(a)==find(b):\r\n pass\r\n else:\r\n pa,pb=find(a),find(b)\r\n parent[find(a)]=find(b)\r\n ans.append((pa,pb))\r\nprint(len(ans))\r\nfor a,b in ans:\r\n print(chr(ord(\"a\")+a),chr(ord(\"a\")+b))\r\n", "n = int(input())\r\ns1 = list(input())\r\ns2 = list(input())\r\nans=[]\r\nfor i in range(n):\r\n a=s1[i]\r\n b=s2[i]\r\n if a!=b:\r\n ans.append([a,b])\r\n for i in range(n):\r\n if s1[i]==a:\r\n s1[i]=b\r\n if s2[i]==a:\r\n s2[i]=b\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i) \r\n\r\n", "\r\n# Ashutosh code\r\nn = int(input())\r\nt = list(input())\r\nv = list(input())\r\nmain = []\r\nextra = []\r\nans = 0\r\nj = 0\r\n\r\n\r\ndef find(a):\r\n for i in range(len(main)):\r\n if a in main[i]:\r\n return i\r\n else:\r\n return -1\r\n\r\n\r\nwhile (j < n):\r\n # print(\"hey\")\r\n if t[j] != v[j]:\r\n flag = True\r\n x = find(t[j])\r\n y = find(v[j])\r\n # print(x,y)\r\n if x == -1 and y == -1:\r\n main.append([t[j], v[j]])\r\n ans += 1\r\n elif x == -1 and y != -1:\r\n main[y].append(t[j])\r\n ans += 1\r\n elif y == -1 and x != -1:\r\n main[x].append(v[j])\r\n ans += 1\r\n elif y != -1 and x != -1 and x!=y:\r\n # print(y,main)\r\n for i in main[x]:\r\n main[y].append(i)\r\n del main[x]\r\n ans+=1\r\n j += 1\r\n# for i in range(len(main)):\r\n# ans+=len(main[i])-1\r\nprint(ans)\r\n# print(main)\r\nfor i in range(len(main)):\r\n for j in range(1, len(main[i])):\r\n print(main[i][0], main[i][j])", "from collections import defaultdict\r\nclass Graph:\r\n def __init__(self, vertices):\r\n self.V = vertices\r\n self.graph = defaultdict(set)\r\n self.dd = []\r\n\r\n def addEdge(self, u, v):\r\n self.graph[u].add(v)\r\n self.graph[v].add(u)\r\n \r\n\r\n def DFSUtil(self, v, visited):\r\n visited[v] = True\r\n self.dd[-1].append(v)\r\n # print(v, end = \" \")\r\n # l+=[v]\r\n for i in self.graph[v]:\r\n if visited[i] == False:\r\n self.DFSUtil(i, visited)\r\n\r\n # return l\r\n \r\n\r\n def fillOrder(self, v, visited, stack):\r\n visited[v] = True\r\n for i in self.graph[v]:\r\n if visited[i] == False:\r\n self.fillOrder(i, visited, stack)\r\n stack = stack.append(v)\r\n\r\n def getTranspose(self):\r\n g = Graph(self.V)\r\n for i in self.graph:\r\n for j in self.graph[i]:\r\n g.addEdge(j, i)\r\n return g\r\n\r\n def printSCCs(self):\r\n stack = []\r\n visited = [False]*(self.V)\r\n for i in range(self.V):\r\n if visited[i] == False:\r\n self.fillOrder(i, visited, stack)\r\n gr = self.getTranspose()\r\n visited = [False]*(self.V)\r\n while stack:\r\n i = stack.pop()\r\n if visited[i] == False:\r\n gr.dd.append([])\r\n # print(dd)\r\n gr.DFSUtil(i, visited)\r\n # print(\" \")\r\n # print(gr.dd)\r\n ans = 0\r\n for i in gr.dd:\r\n ans+=(len(i)-1)\r\n print(ans)\r\n for i in gr.dd:\r\n if(len(i)>1):\r\n for j in range(len(i)-1):\r\n print(chr(i[j]+97), chr(i[j+1]+97))\r\n\r\n\r\nn = int(input())\r\na = input()\r\nb = input()\r\nc = set()\r\nd = []\r\ng = Graph(26)\r\nfor i in range(n):\r\n g.addEdge(ord(a[i])-97, ord(b[i])-97)\r\n# print(g.graph)/\r\n# print(g.dd)\r\ng.printSCCs()\r\n", "\"\"\"\nSummary of my Code:\n- Uses Unionfind to see if character a and b are in the same graph\n- If it is, then you don't need mana to buy extra spells\n- Else you need a new spell\n\nRuntime Complexity:\n- I am not sure but unionfind => O(alpha(N))\n- inputs => O(1)\n- total => O(alpha(N)) * N because of the loop\n => O(N*alpha(N))\n\nSpace Complexity:\n- unionfind => O(N)\n- inputs => O(2 * N)\n- total => O(N) + O(2N) => O(N)\n\nWhy the chosen algorithm is good:\n- This has runtime of O(N * alpha(N)) which is fast enough\n for n = 10^5, as 10^5 * 5 < 10^7\n\"\"\"\n\nclass UnionFind:\n def __init__(self, N):\n self.parent = [i for i in range(N)]\n\n def root(self, x):\n if self.parent[x] != x:\n self.parent[x] = self.root(self.parent[x])\n return self.parent[x]\n\n def same(self, x, y):\n return self.root(x) == self.root(y)\n\n def connect(self, x, y):\n rootX = self.root(x)\n rootY = self.root(y)\n if rootX != rootY:\n self.parent[rootY] = rootX\n\nn = int(input())\nvalya = input()\ntolya = input()\n\ngraph = UnionFind(26)\nspells = []\nfor i in range(n):\n if valya[i] == tolya[i]:\n continue\n Vnum = ord(valya[i]) - ord(\"a\")\n Tnum = ord(tolya[i]) - ord(\"a\")\n if graph.same(Vnum, Tnum):\n continue\n graph.connect(Vnum, Tnum)\n spells.append(valya[i] + \" \" + tolya[i])\nprint(len(spells))\nprint(\"\\n\".join(spells))\n \t \t \t \t\t \t\t\t \t \t\t \t\t\t\t\t \t", "import math,sys,bisect,heapq,os\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\nfrom functools import lru_cache\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\ndef input(): return sys.stdin.readline().rstrip('\\r\\n')\r\n#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\naj = lambda: list(map(int, input().split()))\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\n\r\ndef solve():\r\n\r\n\tdef find(a):\r\n\t if par[a] < 0:\r\n\t return a\r\n\t par[a] = find(par[a])\r\n\t return par[a]\r\n\t \r\n\tdef merge(a,b):\r\n\t if a!=b:\r\n\t par[a] += par[b]\r\n\t par[b] = a\r\n\t \r\n\r\n\tn, = aj()\r\n\ts = input()\r\n\tt = input()\r\n\tpar = [-1 for i in range(26)]\r\n\tAns = []\r\n\tfor i,j in zip(s,t):\r\n\t\tif i != j:\r\n\t\t\ta = ord(i) - ord('a')\r\n\t\t\tb = ord(j) - ord('a')\r\n\t\t\taa = find(a)\r\n\t\t\tbb = find(b)\r\n\t\t\tif aa!= bb:\r\n\t\t\t\tmerge(aa,bb)\r\n\t\t\t\tAns.append((i,j))\r\n\tprint(len(Ans))\r\n\tfor i,j in Ans:\r\n\t\tprint(i,j)\r\n\r\n\r\n\r\ntry:\r\n\t#os.system(\"online_judge.py\")\r\n\tsys.stdin = open('input.txt', 'r') \r\n\tsys.stdout = open('output.txt', 'w')\r\nexcept:\r\n\tpass\r\n\r\nsolve()", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n#import sys\r\n#input = sys.stdin.buffer.readline\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n#######################################\r\nfrom itertools import permutations\r\nfrom collections import *\r\nfrom collections import deque\r\nfrom operator import itemgetter , attrgetter\r\nfrom decimal import *\r\nimport bisect\r\nimport math\r\nimport heapq as hq\r\n#import sympy\r\nMOD=10**9 +7\r\n\r\n\r\ndef is_prime(n):\r\n if n == 2 or n == 3: return True\r\n if n < 2 or n%2 == 0: return False\r\n if n < 9: return True\r\n if n%3 == 0: return False\r\n r = int(n**0.5)\r\n # since all primes > 3 are of the form 6n ± 1\r\n # start with f=5 (which is prime)\r\n # and test f, f+2 for being prime\r\n # then loop by 6.\r\n f = 5\r\n while f <= r:\r\n\r\n if n % f == 0: return False\r\n if n % (f+2) == 0: return False\r\n f += 6\r\n return True\r\n\r\ndef pow(a,b,m):\r\n ans=1\r\n while b:\r\n if b&1:\r\n ans=(ans*a)%m\r\n b//=2\r\n a=(a*a)%m\r\n return ans\r\n#vis=[]\r\n#graph=[]\r\n\r\ndef ispalindrome(s):\r\n if s[:]==s[::-1]:\r\n return 1\r\n return 0\r\ndp=[]\r\nlimit=[]\r\nv=[]\r\ndef dpdfs(u,t=-1):\r\n dp[0][u]=0\r\n dp[1][u]=0\r\n for i in v[u]:\r\n if i==t:\r\n\r\n continue\r\n if dp[1][i]==-1:\r\n dpdfs(i,u)\r\n dp[0][u]+=max(abs(limit[0][u]-limit[1][i])+dp[1][i],abs(limit[0][u]-limit[0][i])+dp[0][i])\r\n dp[1][u] += max(abs(limit[1][u] - limit[1][i]) + dp[1][i], abs(limit[1][u] - limit[0][i]) + dp[0][i])\r\nvis=[]\r\nf=0\r\ndef dfs(i):\r\n vis[i]=1\r\n act[i]=1\r\n for j in v[i]:\r\n if act[j]:\r\n f=1\r\n #print(-1)\r\n return -1\r\n if vis[j]==0:\r\n if dfs(j)==-1:\r\n return -1\r\n act[i]=0\r\n ans.append(i)\r\n return 0\r\nfrom queue import PriorityQueue\r\n\r\ndef z_algorithm(s):\r\n res = [0] * len(s)\r\n res[0] = len(s)\r\n i, j = 1, 0\r\n while i < len(s):\r\n while i + j < len(s) and s[j] == s[i + j]:\r\n j += 1\r\n res[i] = j\r\n if j == 0:\r\n i += 1\r\n continue\r\n k = 1\r\n while i + k < len(s) and k + res[k] < j:\r\n res[i + k] = res[k]\r\n k += 1\r\n i, j = i + k, j - k\r\n return res\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# Function to return LCM of two numbers\r\ndef lcm(a, b):\r\n return (a*b) / math.gcd(int(a), int(b))\r\n\r\n\r\ndef gcdExtended(a, b):\r\n # Base Case\r\n if a == 0:\r\n return b, 0, 1\r\n\r\n gcd, x1, y1 = gcdExtended(b % a, a)\r\n\r\n # Update x and y using results of recursive\r\n # call\r\n x = y1 - (b // a) * x1\r\n y = x1\r\n\r\n return gcd, x, y\r\ndef find_set(v):\r\n if v==parent[v]:\r\n return v\r\n parent[v]=find_set(parent[v])\r\n return parent[v]\r\ndef union_sets(a,b):\r\n a=find_set(a)\r\n b=find_set(b)\r\n if a!=b:\r\n if size[a]<size[b]:\r\n a,b=b,a\r\n parent[b]=a\r\n size[a]+=size[b]\r\nn=int(input())\r\ns1=input()\r\ns2=input()\r\nx=ord(\"a\")\r\nparent=[]\r\nsize=[0 for i in range(26)]\r\nfor i in range(26):\r\n\r\n parent.append(i)\r\nfor i in range(n):\r\n if s1[i]==s2[i]:\r\n continue\r\n a=ord(s1[i])-x\r\n b=ord(s2[i])-x\r\n\r\n union_sets(a,b)\r\n if size[a]==0:\r\n size[a]+=1\r\n if size[b]==0:\r\n size[b]+=1\r\nfor i in range(26):\r\n find_set(i)\r\nans=[]\r\nvis=[0 for i in range(26)]\r\n#print(parent)\r\nfor i in range(26):\r\n if vis[parent[i]] or size[i]==0:\r\n continue\r\n\r\n vis[parent[i]]=1\r\n prev=chr(x+i)\r\n for j in range(26):\r\n if i==j:\r\n continue\r\n if parent[j]==parent[i]:\r\n ans.append([prev,chr(x+j)])\r\n prev=chr(x+j)\r\n\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(*ans[i])\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import *\r\n\r\n\r\nclass Union:\r\n def __init__(self, graph):\r\n self.graph = graph\r\n\r\n def findRoot(self, node):\r\n if self.graph[node] != node:\r\n root = self.findRoot( self.graph[node] )\r\n self.graph[node] = root\r\n return self.graph[node]\r\n\r\n\r\n def union(self, node1, node2):\r\n root1 = self.findRoot(node1)\r\n root2 = self.findRoot(node2)\r\n self.graph[root1] = self.graph[root2]\r\n\r\n\r\n def isConnected(self, node1, node2):\r\n return self.findRoot(node1) == self.findRoot(node2)\r\n\r\ndef main(a,b):\r\n graph = [i for i in range(26)]\r\n un = Union(graph)\r\n changes = []\r\n for i in range(len(a)):\r\n x, y = ord(a[i]) - 97, ord(b[i]) - 97 \r\n if not un.isConnected(x, y): \r\n un.union(x, y)\r\n changes.append( (a[i], b[i]) )\r\n\r\n print(len(changes))\r\n for u,v in changes:\r\n print(u,v)\r\n\r\ninput()\r\na = input()\r\nb = input()\r\nmain(a,b)", "class DSU:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n self.size = [1] * n\r\n self.num_sets = n\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n a, b = self.find(a), self.find(b)\r\n if a != b:\r\n if self.size[a] < self.size[b]:\r\n a, b = b, a\r\n\r\n self.num_sets -= 1\r\n self.parent[b] = a\r\n self.size[a] += self.size[b]\r\n\r\n def set_size(self, a):\r\n return self.size[self.find(a)]\r\n\r\n def __len__(self):\r\n return self.num_sets\r\n\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n self.parent[self.find(b)] = self.find(a)\r\n\r\n\r\nn=int(input())\r\na=input()\r\nb=input()\r\ndef o(x):\r\n return ord(x)-ord('a')\r\ndef ro(x):\r\n return chr(ord('a')+x)\r\nd=DSU(30)\r\nres=[]\r\nfor i in range(n):\r\n fir=o(a[i])\r\n sec=o(b[i])\r\n if d.find(fir)!=d.find(sec):\r\n res.append((ro(d.find(fir)),ro(d.find(sec))))\r\n d.union(fir,sec)\r\nprint(len(res))\r\nfor i in res:print(*i)\r\n\r\n", "def findParent(V):\r\n while V!=P[V]:\r\n P[V]=P[P[V]]\r\n V=P[V]\r\n return V\r\n\r\ndef union(A,B):\r\n A=findParent(A)\r\n B=findParent(B)\r\n if R[A]>R[B]:\r\n P[B]=A\r\n elif R[B]>R[A]:\r\n P[A]=B\r\n else:\r\n P[B]=A\r\n R[A]+=1\r\n\r\nimport sys\r\ninput=sys.stdin.readline\r\nN=int(input())\r\nS1=input().strip()\r\nS2=input().strip()\r\nP=[i for i in range(26)]\r\nR=[0 for i in range(26)]\r\nANS=[];C=0\r\nfor i in range(N):\r\n F=S1[i];S=S2[i]\r\n A=ord(F)-97\r\n B=ord(S)-97\r\n if findParent(A)!=findParent(B):\r\n C+=1\r\n ANS.append([F,S])\r\n union(A,B)\r\nprint(C)\r\nfor i in ANS:\r\n print(*i)", "N = int(input())\nS = input().rstrip()\nT = input().rstrip()\n\nclass DSU:\n def __init__(self, N):\n self.p = [i for i in range(N)]\n def find(self, u):\n if u == self.p[u]:\n return u\n self.p[u] = self.find(self.p[u])\n return self.p[u]\n def join(self, u, v):\n u = self.find(u)\n v = self.find(v)\n self.p[v] = u\n def same(self, u, v):\n return self.find(u) == self.find(v)\n\ndsu = DSU(26)\nans = []\nfor s, t in zip(S, T):\n si = ord(s) - ord('a')\n ti = ord(t) - ord('a')\n if dsu.same(si, ti):\n continue\n dsu.join(si, ti)\n ans.append((s, t))\n\nprint(len(ans))\nprint(\"\\n\".join(map(lambda x: f\"{x[0]} {x[1]}\", ans)))\n", "#\n# Joseph Matsushita\n# Problem H\n# \n#\n\ndef join(f, t, l):\n for i in range(len(l)):\n if l[i] == f:\n l[i] = t\n return l\n\nn = input() #never actually used\ntolya = input()\nvalya = input()\n\nspell = []\ngroupcount = 0 #this is just so different groups don't collide\nunion = [0]*26 #each spot corresponds to a letter a-z\n\n#union[ord(tolya[i])-97] turns the char from a tolya's string into an int between 0-25\n#such that a = 0, b= 1, and so on until z = 25\n\nfor i in range(len(tolya)): #or valya, they have the same length\n #check that the spot has different chars\n if tolya[i] != valya[i]:\n if union[ord(tolya[i])-97] == 0 and union[ord(valya[i])-97] == 0: #neither char is part of a group\n groupcount += 1 #create a new group\n union[ord(tolya[i])-97] = union[ord(valya[i])-97] = groupcount\n spell.append(tolya[i] + ' ' + valya[i]) #add a new spell\n # if one char is part of a group and the other is not...\n elif union[ord(tolya[i])-97] == 0 and union[ord(valya[i])-97] != 0:\n union[ord(tolya[i])-97] = union[ord(valya[i])-97]\n spell.append(tolya[i] + ' ' + valya[i])\n elif union[ord(tolya[i])-97] != 0 and union[ord(valya[i])-97] == 0:\n union[ord(valya[i])-97] = union[ord(tolya[i])-97]\n spell.append(tolya[i] + ' ' + valya[i])\n elif union[ord(tolya[i])-97] != union[ord(valya[i])-97]: #both in groups, but not the same group\n union = join(union[ord(tolya[i])-97], union[ord(valya[i])-97], union)\n spell.append(tolya[i] + ' ' + valya[i])\n #last remaining possibility is that both chars are already in the same group\n\nprint(len(spell))\nfor i in spell:\n print(i)\n \t \t \t\t \t \t \t \t\t\t \t\t\t", "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\n\r\ndef dfs(parent, visited, flag):\r\n for child in graph[parent]:\r\n if child not in visited:\r\n flag = False\r\n if flag:\r\n visited.add(parent)\r\n return parent\r\n visited.add(parent)\r\n for neighbour in graph[parent]:\r\n if neighbour not in visited:\r\n answer.append([parent, dfs(neighbour, visited, True)])\r\n return parent\r\n \r\nn = inpNum()\r\nstring1 = input()\r\nstring2 = input()\r\nvisited = set()\r\ngraph= defaultdict(list)\r\nanswer = []\r\n\r\nfor i in range(n):\r\n if string1[i] != string2[i]:\r\n graph[string1[i]].append(string2[i])\r\n graph[string2[i]].append(string1[i])\r\n # else:\r\n # visited.add(string1[i])\r\nfor k in graph.keys():\r\n if k not in visited:\r\n dfs(k, visited, True)\r\nprint(len(answer))\r\nfor ans in answer:\r\n print(*ans)\r\n# print(answer)\r\n" ]

[ "import sys\r\nimport math\r\n\r\ndef main():\r\n n, si = map(int, input().split())\r\n s = float(si)\r\n x = []\r\n v = []\r\n dir = []\r\n ev = []\r\n\r\n EPS = 1e-8\r\n\r\n for _ in range(n):\r\n xi, vi, d = map(int, input().split())\r\n x.append(xi)\r\n v.append(vi)\r\n dir.append(d)\r\n ev.append(((xi, d), vi))\r\n\r\n ev.sort()\r\n l = 0.0\r\n A = 1000000.0\r\n r = A\r\n m0 = 1e7\r\n m1 = 1e7\r\n m0s = 1e7\r\n m1s = 1e7\r\n\r\n for i in range(n):\r\n if dir[i] == 1:\r\n m0 = min(m0, x[i] / v[i])\r\n m0s = min(m0s, x[i] / (s + v[i]))\r\n else:\r\n m1 = min(m1, (A - x[i]) / v[i])\r\n m1s = min(m1s, (A - x[i]) / (s + v[i]))\r\n\r\n for _ in range(50):\r\n m = (l + r) / 2\r\n\r\n if m0s > m or m1s > m:\r\n l = m\r\n continue\r\n\r\n if m0 <= m + EPS:\r\n if m1s <= m:\r\n r = m\r\n else:\r\n l = m\r\n continue\r\n\r\n if m1 <= m + EPS:\r\n if m0s <= m:\r\n r = m\r\n else:\r\n l = m\r\n continue\r\n\r\n can = False\r\n maxr = -1e18\r\n\r\n for x in ev:\r\n if x[0][1] == 1:\r\n d = x[0][0]\r\n v = x[1]\r\n if (v + s) * m < d + EPS:\r\n continue\r\n u = (m * (v + s) - d)\r\n maxr = math.floor(EPS + max(maxr, EPS + d + (1 - v / s) * u))\r\n else:\r\n d = A - x[0][0]\r\n v = x[1]\r\n if (v + s) * m < d + EPS:\r\n continue\r\n u = (m * (v + s) - d)\r\n if maxr + (1 - v / s) * u >= x[0][0]:\r\n can = True\r\n break\r\n\r\n if can:\r\n r = m\r\n else:\r\n l = m\r\n\r\n print(\"{:.10f}\".format(l))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\ndef main():\r\n num_elements, initial_speed = map(int, input().split())\r\n speed = float(initial_speed)\r\n positions = []\r\n velocities = []\r\n directions = []\r\n events = []\r\n epsilon = 1e-8\r\n for _ in range(num_elements):\r\n position_i, velocity_i, direction_i = map(int, input().split())\r\n positions.append(position_i)\r\n velocities.append(velocity_i)\r\n directions.append(direction_i)\r\n events.append(((position_i, direction_i), velocity_i))\r\n events.sort()\r\n left_bound = 0.0\r\n right_bound = 1000000.0\r\n min_left_speed = 1e7\r\n min_right_speed = 1e7\r\n min_left_speed_with_s = 1e7\r\n min_right_speed_with_s = 1e7\r\n for i in range(num_elements):\r\n if directions[i] == 1:\r\n min_left_speed = min(min_left_speed, positions[i] / velocities[i])\r\n min_left_speed_with_s = min(min_left_speed_with_s, positions[i] / (speed + velocities[i]))\r\n else:\r\n min_right_speed = min(min_right_speed, (1000000 - positions[i]) / velocities[i])\r\n min_right_speed_with_s = min(min_right_speed_with_s, (1000000 - positions[i]) / (speed + velocities[i]))\r\n for _ in range(50):\r\n middle_speed = (left_bound + right_bound) / 2\r\n if min_left_speed_with_s > middle_speed or min_right_speed_with_s > middle_speed:\r\n left_bound = middle_speed\r\n continue\r\n if min_left_speed <= middle_speed + epsilon:\r\n if min_right_speed_with_s <= middle_speed:\r\n right_bound = middle_speed\r\n else:\r\n left_bound = middle_speed\r\n continue\r\n if min_right_speed <= middle_speed + epsilon:\r\n if min_left_speed_with_s <= middle_speed:\r\n right_bound = middle_speed\r\n else:\r\n left_bound = middle_speed\r\n continue\r\n can_reach = False\r\n max_reached = -1e18\r\n for event in events:\r\n if event[0][1] == 1:\r\n distance = event[0][0]\r\n velocity = event[1]\r\n if (velocity + speed) * middle_speed < distance + epsilon:\r\n continue\r\n displacement = (middle_speed * (velocity + speed) - distance)\r\n max_reached = math.floor(epsilon + max(max_reached, epsilon + distance + (1 - velocity / speed) * displacement))\r\n else:\r\n distance = 1000000 - event[0][0]\r\n velocity = event[1]\r\n if (velocity + speed) * middle_speed < distance + epsilon:\r\n continue\r\n displacement = (middle_speed * (velocity + speed) - distance)\r\n if max_reached + (1 - velocity / speed) * displacement >= event[0][0]:\r\n can_reach = True\r\n break\r\n if can_reach:\r\n right_bound = middle_speed\r\n else:\r\n left_bound = middle_speed\r\n print(\"{:.10f}\".format(left_bound))\r\nif __name__ == \"__main__\":\r\n main()# 1695325990.260047" ]

[ "a = int(input())\r\nb = int(input())\r\nif a < b or ((a & 1) != (b & 1)):\r\n print(-1)\r\nelse:\r\n print((a - b) // 2, (a + b) // 2)", "a = int(input())\nb = int(input())\n\nx = (a - b) // 2\ny = a - x\nif x ^ y == b:\n print(x, y)\nelse:\n print(-1)\n", "import math\r\nfrom collections import defaultdict\r\nfrom sys import stdin\r\n\r\nR = lambda: map(int, stdin.readline().split())\r\na, b = int(input()), int(input())\r\ndp = [[[0, 0] for j in range(2)] for i in range(70)]\r\ndp[0][0][0] = dp[0][1][0] = 1\r\ntrace = defaultdict(tuple)\r\nfor i in range(65):\r\n ai, bi = (a >> i & 1), (b >> i & 1)\r\n for bt in range(2):\r\n for cy in range(2):\r\n if dp[i][bt][cy]:\r\n if ai == ((bi ^ bt & 1) + bt + cy) & 1:\r\n ncy = ((bi ^ bt & 1) + bt + cy) >> 1 & 1\r\n dp[i + 1][0][ncy] = dp[i + 1][1][ncy] = 1\r\n trace[tuple((i + 1, 0, ncy))] = trace[tuple((i + 1, 1, ncy))] = tuple((i, bt, cy))\r\n else:\r\n dp[i][bt][cy] = 0\r\ncur = tuple((64, 0, 0)) if dp[64][0][0] else tuple((64, 1, 0)) if dp[64][1][0] else 0\r\nif not cur:\r\n print(-1)\r\nelse:\r\n res = 0\r\n while cur:\r\n res = (cur[1] << cur[0]) | res\r\n cur = trace[cur]\r\n print(min(res, a - res), max(res, a - res), sep=' ')\r\n", "A = int(input())\r\nB = int(input())\r\nif((A-B) % 2 != 0):\r\n print(-1)\r\n exit()\r\nXAY = (A-B) >> 1\r\nres = 0\r\nr1 = XAY\r\nr2 = A - r1\r\nif(r1 < 0 or r2 < 0):\r\n print(-1)\r\n exit()\r\nif(A != r1 + r2 or B != (r1 ^ r2)):\r\n print(-1)\r\n exit()\r\nprint(r1,r2)", "a = int(input())\nb = int(input())\nk = a - b\nif k % 2:\n print(-1)\n exit(0)\nk >>= 1\nif k < 0:\n print(-1)\n exit(0)\nprint(k, a - k)", "a = int(input())\r\nb = int(input())\r\nx = int((a-b)/2)\r\ny = a-x\r\nif (2*x + b == a):\r\n\tprint(\"{} {}\".format(x, y))\r\nelse:\r\n\tprint(\"-1\")", "a = int(input())\r\nb = int(input())\r\nif a < b:\r\n print (-1)\r\nif (a - b) % 2 == 1:\r\n print (-1) \r\nelse:\r\n print ((a - b) // 2, (a + b) // 2)\r\n\r\n", "def find_X_and_Y(A, B):\r\n if A < B or (A - B) % 2 != 0:\r\n return -1\r\n\r\n X = (A - B) // 2\r\n Y = A - X\r\n return X, Y\r\n\r\n\r\nA = int(input())\r\nB = int(input())\r\n\r\nresult = find_X_and_Y(A, B)\r\n\r\nif result == -1:\r\n print(\"-1\")\r\nelse:\r\n print(result[0], result[1])\r\n\r\n\r\n", "a, b = int(input()), int(input())\r\nx, y = (a - b) >> 1, (a - b) // 2 + b\r\nif a < b or (a + b) & 1 or x & (a - x) != x:\r\n print(\"-1\")\r\nelse: print(x, y)", "A = int(input())\r\nB = int(input())\r\nx = (A - B)//2\r\ny = x ^ B\r\nif x + y == A and x ^ y == B:\r\n print(x,y)\r\nelse:\r\n print(-1)\r\n", "a, b = int(input()), int(input())\r\nif (a + b) % 2:\r\n print(-1)\r\nelse:\r\n print(abs(a - b) // 2, (a + b) // 2)", "S = int(input())\r\nX = int(input())\r\nif S < X or (S-X) % 2 == 1 :\r\n print(\"-1\")\r\nelse :\r\n print((S-X)//2, end = \" \")\r\n print(X ^ ((S-X)//2))\r\n\r\n\r\n\r\n\r\n#list = []\r\n#for x in range(47):\r\n# s = input()\r\n# list.append(s)\r\n\r\n#for i in list:\r\n# print('\"', end=\"\")\r\n# print(i,end=\"\")\r\n# print('\",')", "a = int(input())\r\nb = int(input())\r\n\r\ny = (a + b) // 2\r\nx = b ^ y\r\n\r\nif x + y == a and x ^ y == b:\r\n print(f'{x} {y}')\r\nelse:\r\n print('-1')", "x = int(input())\ny = int(input())\nif (x - y) % 2 == 0:\n print((x - y) // 2, (x + y) // 2, sep=' ', end='\\n')\nelse:\n print(-1)\n", "a=int(input())\r\nb=int(input())\r\nif(a<b or (a-b)%2!=0):\r\n print(-1)\r\nelse:\r\n v=(a-b)//2\r\n x=0\r\n y=0\r\n for i in range(64):\r\n if(v&(1<<i)!=0):\r\n x+=(1<<i)\r\n y+=(1<<i)\r\n \r\n ok=1\r\n for i in range(64):\r\n if(b&(1<<i)):\r\n if(y&(1<<i)):\r\n ok=0\r\n break\r\n else:\r\n y+=(1<<i)\r\n \r\n if(ok==0):\r\n print(-1)\r\n else:\r\n print(x,end=' ')\r\n print(y)", "# LUOGU_RID: 109995815\na = int(input())\r\nb = int(input())\r\n\r\nx = 0\r\ny = b\r\n\r\nc = a - b\r\nif (c < 0 or c & 1):\r\n\tprint(-1)\r\nelse:\r\n\tc //= 2\r\n\tfor i in range(64):\r\n\t\tif (c >> i & 1):\r\n\t\t\tx |= (1 << i)\r\n\t\t\ty |= (1 << i)\r\n\r\n\tprint(x , y)\r\n", "A = int(input())\r\nB = int(input())\r\n\r\nif (A-B) % 2 == 1 or A < B:\r\n print(-1)\r\nelse:\r\n X = (A - B) // 2\r\n Y = A - X\r\n if X ^ Y != B:\r\n print(-1)\r\n else:\r\n print(X, Y)\r\n", "a = int(input())\nb = int(input())\nif a < b :\n print(-1)\nelse:\n nda = (a-b)>>1\n xrr = b\n num1 = 0\n num2 = 0\n flag = True\n for i in range(0,64):\n bit1 = (nda >> i) & 1\n bit2 = (xrr >> i) & 1\n if bit1 == 0 and bit2 == 0:\n num1 += 0\n num2 += 0\n elif bit1 == 1 and bit2 == 0:\n num1 += (1<<i)\n num2 += (1<<i)\n elif bit1 == 0 and bit2 == 1:\n num2 += (1<<i)\n elif bit1 == 1 and bit2 == 1:\n flag = False\n break\n if flag:\n print(num1,num2,sep=\" \")\n else:\n print(-1)\n", "A=int(input())\r\nB=int(input())\r\nC=A-B\r\nif C&1 :\r\n print(-1)\r\nelse:\r\n C>>=1\r\n X=C;Y=C\r\n for i in range(0,64):\r\n if (B&(1<<i)):\r\n Y|=(1<<i)\r\n ans=X+Y\r\n if ans==A:\r\n print(X,end=\" \")\r\n print(Y)\r\n else:\r\n print(-1)\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nif(a>=b):\r\n if((a-b)%2==1):\r\n print(-1)\r\n exit(0) \r\n \r\n f=b\r\n s=(a-b)//2\r\n t=s\r\n if((f^s)==f+s):\r\n print(t,end=\" \")\r\n print(f+s)\r\n exit(0) \r\n if((f^t)==f+t):\r\n print(s,end=\" \")\r\n print(f+t)\r\n exit(0) \r\n if((t^s)==t+s):\r\n print(f,end=\" \")\r\n print(t+s)\r\n exit(0) \r\nprint(-1)\r\n ", "import sys\n\ndef solve():\n a, = rv()\n b, = rv()\n bbin = bin(b)[::-1]\n bl, x, y = [0] * 64, [0] * 64, [0] * 64\n for i in range(len(bbin) - 2): bl[i] = 1 if bbin[i] == '1' else 0\n for i in range(64):\n count = 0\n if bl[i] == 1: count += 1\n if count == 1:\n y[i] = 1\n else:\n pass\n x[i] = 2\n y[i] = 2\n xres, yres = 0, 0\n for i in range(64):\n xres += pow(2, i) if x[i] == 1 else 0\n yres += pow(2, i) if y[i] == 1 else 0\n for i in range(63, -1, -1):\n if x[i] == y[i] == 2:\n toadd = 2 * pow(2, i)\n if xres + yres + toadd <= a:\n x[i] = y[i] = 1\n xres += toadd // 2\n yres += toadd // 2\n else:\n x[i] = y[i] = 0\n if xres + yres == a: print(xres, yres)\n else: print(-1)\n\n\ndef prt(l): return print(' '.join(l))\ndef rv(): return map(int, input().split())\ndef rl(n): return [list(map(int, input().split())) for _ in range(n)]\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()\n\n\n", "a=int(input())\r\nb=int(input())\r\nc=(a-b)//2\r\nif a<b: print(-1)\r\nelse:\r\n if (c&(a-c))!=c:\r\n print(-1)\r\n else:\r\n print(str(c)+ \" \" + str(a-c))\r\n ", "_a = int(input())\n_b = int(input())\nA = bin(_a)[2:]\nB = bin(_b)[2:]\n\n\nif len(A) < len(B):\n A,B = B,A\nB = \"0\"*(len(A) - len(B)) + B\n\nX = \"\"\nY = \"\"\nneed_carry = False\nfor a,b in zip(A,B):\n if a + b == \"11\":\n X += \"0\"\n Y += \"1\"\n\n elif a + b == \"10\":\n if need_carry:\n X += \"1\"\n Y += \"1\"\n need_carry = True\n else:\n X += \"0\"\n Y += \"0\"\n need_carry = True\n\n elif a + b == \"01\":\n X += \"0\"\n Y += \"1\"\n\n elif a + b == \"00\":\n if need_carry:\n X += \"1\"\n Y += \"1\"\n need_carry = False\n else:\n X += \"0\"\n Y += \"0\"\n need_carry = False\n\nx = int(X, base=2)\ny = int(Y, base=2)\n\nif x+y == _a and x^y == _b:\n print (x,y)\nelse:\n print (\"-1\")\n\n\t \t\t \t\t\t \t\t\t\t\t \t \t", "a = int(input())\r\nb = int(input())\r\nif (a+b)%2!=0:\r\n print(-1)\r\nelse:\r\n print((a-b)//2 , (a+b)//2) \r\n", "a = int(input())\r\nb = int(input())\r\nd = a - b\r\nif (d < 0 or d % 2 == 1):\r\n print(-1)\r\nelse:\r\n x = d // 2\r\n y = b ^ x\r\n if (x + y == a):\r\n print(min(x, y), max(x, y))\r\n else:\r\n print(-1)", "a=int(input()) \r\nb=int(input())\r\nx=(a-b)//2 \r\ny=x+b\r\nif ((a-b)%2==1): print(-1)\r\nelse :\r\n print(x, y)", "S =int (input())\r\nX=int (input())\r\nA = (S - X)//2\r\na=0\r\nb=0\r\nok=1\r\nfor i in range (64):\r\n xnow=(X &(1<<i))\r\n anow=(A &(1<<i))\r\n if(xnow==0 and anow==0):pass\r\n elif(xnow>0 and anow==0):\r\n a = ((1 << i) | a)\r\n elif(xnow==0 and anow>0):\r\n a = ((1 << i) | a)\r\n b = ((1 << i) | b)\r\n else:\r\n print(-1)\r\n ok=0\r\nif(ok==1):\r\n print(b)\r\n print(a)\r\n\r\n\r\n", "a = int(input())\nb = int(input())\nA=a\n\nx = 0\ny = 0\nfor i in range(64):\n if b & (1 << i) != 0:\n y |= 1 << i\n else:\n if (a & (1 << (i+1))) != (b & (1 << (i+1))): # had a carry\n a ^= (1 << (i+1))\n x |= 1 << i\n y |= 1 << i\n\nif x ^ y == b and x + y == A:\n print(x, y)\nelse:\n print(-1)\n", "a = int((input()))\r\nb = int((input()))\r\nl = 0\r\nr = (1 << 64)\r\nans = 3\r\nwhile(l <= r):\r\n mid = (l+r)//2\r\n if((mid ^ b)+mid >= a):\r\n ans = mid\r\n r = mid - 1\r\n else: \r\n l = mid + 1\r\nx = ans\r\ny = (b ^ ans)\r\nif(x+y == a and (x ^ y) == b):\r\n print(x,y)\r\nelse:\r\n print(-1)", "A, B = int(input()), int(input())\nif A < B:\n print(-1)\nX = (A - B) // 2\nY = X + B\nif X + Y != A or X^Y != B:\n print(-1)\nelse:\n print(X, Y)", "a = int(input())\r\nb = int(input())\r\nif (a - b) % 2 == 1:\r\n print(\"-1\")\r\n exit(0)\r\nx = (a - b) // 2\r\ny = a - x\r\nprint(x, y)", "A = int(input())\r\nB = int(input())\r\nif A < B:\r\n print(-1)\r\nelse:\r\n v = A - B\r\n if v%2 :\r\n print(-1)\r\n else:\r\n v //=2\r\n if B&v:\r\n print(-1)\r\n else:\r\n print(f'{v} {v+B}')", "a=int(input())\r\nb=int(input())\r\nc=a-b\r\nif c<0 or c%2==1:\r\n print(\"-1\")\r\nelse:\r\n d=c//2\r\n print(str(d)+' '+str(a-d))\r\n", "import sys\r\nimport io, os\r\nimport math\r\nfrom heapq import *\r\nfrom bisect import *\r\ngcd = math.gcd\r\nsqrt = math.sqrt\r\nceil = math.ceil\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\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n d = a-b\r\n \r\n if d%2 or d<0:\r\n print(-1)\r\n return\r\n \r\n x = d//2\r\n y = b^x\r\n print(min(x,y),max(x,y))\r\nmain()" ]

[ "n = int(input())\r\nar = list(map(int,input().split()))\r\nar.sort()\r\nl = [abs(ar[i+1] - ar[i]) for i in range(0,n-1)]\r\nk = min(l)\r\nprint(k,l.count(k),sep = ' ')\r\n", "def solve():\n n = int(input().rstrip())\n ls = list(map(int, input().rstrip().split()))\n ls.sort()\n mindist = 102000134234\n for i in range(1, len(ls)):\n mindist = min(mindist, ls[i] - ls[i - 1])\n count = 0\n for i in range(1, len(ls)):\n if ls[i] - ls[i - 1] == mindist:\n count += 1\n print(mindist, count)\n\nsolve()\n", "#import sys\r\n#sys.stdin = open('in', 'r')\r\nn = int(input())\r\na = sorted([int(x) for x in input().split()])\r\n#n,m = map(int, input().split())\r\n\r\nr = 10**10\r\ncnt = 0\r\nfor i in range(n-1):\r\n if (a[i+1] - a[i]) < r:\r\n r = a[i+1] - a[i]\r\n cnt = 1\r\n elif (a[i+1] - a[i]) == r:\r\n cnt += 1\r\n\r\nprint(r, cnt)\r\n", "n = int(input())\r\nln = list(map(int, input().split()))\r\n\r\nln.sort()\r\n\r\nres = float('inf')\r\ncount = 0\r\n# print(ln)\r\nfor i in range(n-1):\r\n if ln[i+1] - ln[i] < res:\r\n res = ln[i+1] - ln[i]\r\n count = 0\r\n if ln[i+1] - ln[i] == res:\r\n count += 1\r\n\r\nprint(res, count)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nl2=[]\r\nfor i in range(1,n):\r\n l2.append(abs(l[i]-l[i-1]))\r\nprint(min(l2),l2.count(min(l2)))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nres=[]\r\nfor i in range(n-1):\r\n res.append(abs(a[i]-a[i+1]))\r\nm=min(res)\r\nc=0\r\nfor x in sorted(res):\r\n if x==m:\r\n c+=1\r\n else:\r\n break\r\nprint(m,c)\r\n", "N = int(input())\r\narray = list(map(int, input().split()))\r\narray.sort()\r\nminimum = abs(array[0] - array[-1])\r\nans_amount = 0\r\nfor i in range (N - 1):\r\n if (array[i + 1] - array[i] < minimum):\r\n ans_amount = 1\r\n minimum = array[i + 1] - array[i] \r\n elif (array[i + 1] - array[i] == minimum):\r\n ans_amount += 1\r\nprint(minimum, end = \" \")\r\nprint(ans_amount)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\nm=[]\r\nc=0\r\nfor i in range(len(a)-1):\r\n\tp=abs(a[i]-a[i+1])\r\n\tm.append(p)\r\ny=min(m)\r\nfor x in m:\r\n\tif y==x:\r\n\t\tc+=1\r\nprint(f\"{y} {c}\")", "lenn = int(input())\r\nlist1 = list(map(int,input().split()))\r\nlist1.sort()\r\ndiff = []\r\nfor i in range(lenn-1):\r\n diff.append(list1[i+1]-list1[i])\r\nprint(min(diff),diff.count(min(diff)))", "import sys, copy\r\n\r\nn = int(sys.stdin.readline())\r\narr = list(map(int, sys.stdin.readline().split()))\r\narr.sort()\r\nres = []\r\nnum = dict().fromkeys(set(arr), 0)\r\nfor i in range(n - 1):\r\n res.append(abs(arr[i] - arr[i + 1]))\r\nfor i in arr:\r\n num[i] += 1\r\ntemp = min(res)\r\nans = 0\r\nfor i in arr:\r\n if i - temp in num:\r\n ans += num[i - temp]\r\n if i + temp in num:\r\n ans += num[i + temp]\r\n\r\nprint(temp, ans // 2)", "n = int(input())\r\na = list(map(int, input().split()))\r\nminimum = abs(a[0]-a[1])\r\ncounter = 0\r\na.sort()\r\nfor i in range(1, n-1):\r\n if abs(a[i]-a[i+1]) < minimum:\r\n minimum = abs(a[i]-a[i+1])\r\nfor i in range(n-1):\r\n if abs(a[i]-a[i+1]) == minimum:\r\n counter += 1\r\nprint(minimum, counter, sep=\" \")", "n = int(input())\r\na = sorted(map(int, input().split()))\r\n\r\nmd = a[1] - a[0]\r\nmc = 1\r\nfor i in range(2, len(a)):\r\n cd = a[i] - a[i-1]\r\n if (cd == md):\r\n mc += 1\r\n elif (cd < md):\r\n md = cd\r\n mc = 1\r\n\r\nprint(\"{0} {1}\".format(md, mc))\r\n\r\n", "\ndef shortestPath(a):\n if len(a) <= 3:\n a.sort()\n d = 2_000_000_000\n for i in range(1, len(a)):\n d = min(d, a[i]-a[i-1])\n\n # print(d)\n return d\n\n else:\n mid = len(a)//2\n \n # divide=========\n left_a = a[:mid]\n right_a = a[mid:]\n #================\n\n\n # conquer ============\n p = shortestPath(left_a)\n q = shortestPath(right_a)\n # ====================\n\n\n # combine====================\n r = min(right_a) - max(left_a)\n\n return min(p, q, r)\n\n\n\ndef solve(n, a):\n a.sort()\n # print(a)\n d = shortestPath(a)\n\n cnt = 0\n for i in range(1, n):\n cnt += int(a[i]-a[i-1] == d)\n\n print(d, cnt)\n\n\ndef main():\n n = int(input())\n a = [int(x) for x in input().split(' ')]\n\n solve(n, a)\n\n\nif __name__ == \"__main__\":\n main()", "__author__ = 'Alexander'\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\na = sorted(a)\r\nb = [abs(a[i] - a[i+1]) for i in range(len(a)-1)]\r\nm = min(b)\r\ncount = b.count(m)\r\nprint(m, count)", "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\na.sort()\r\nmini = abs(a[1]-a[0])\r\nfor i in range(2,n):\r\n mini = min(mini, a[i]-a[i-1])\r\n\r\ncnt = 0\r\nfor i in range(1,n):\r\n if abs(a[i]-a[i-1])==mini:\r\n cnt+=1\r\n\r\nprint(mini, cnt)\r\n", "# - *- coding: utf- 8 - *-\r\n\"\"\"\r\nCreated on Mon Mar 27 20:38:27 2017\r\n\r\nName: MD. Khairul Basar\r\nPhone: 01760446942\r\nEmail: [email protected]\r\n\"\"\"\r\n\r\nn = int(input());\r\narr = list(map(int, input().split()));\r\narr = sorted(arr);\r\n\r\nminimum = int(10000000000);\r\nfor i in range(n-1):\r\n if(arr[i+1] - arr[i] < minimum):\r\n minimum = arr[i+1] - arr[i];\r\ncount = 0;\r\nfor i in range(n-1):\r\n if(arr[i+1] - arr[i] == minimum):\r\n count+=1;\r\nprint(minimum,count);", "input()\r\na=sorted(map(int,input().split()))\r\nb=10**10\r\nm=0\r\nfor i in range(1,len(a)):\r\n c=a[i]-a[i-1]\r\n if b==c:m+=1\r\n elif b>c:\r\n b=c\r\n m=1\r\nprint(b,m)\r\n", "n = int(input())\na = [int(i) for i in input().split()]\nmin = (10**9)*2\nx = 0\nt = a.sort(reverse = True)\nfor i in range(n-1):\n if abs(a[i] - a[i+1]) < min:\n min = abs(a[i] - a[i+1])\nfor i in range(n-1) :\n if abs(a[i] - a[i+1]) == min:\n x += 1\nprint(min,' ', x)\n ", "n = int(input())\r\na = sorted(map(int,input().split()))\r\ndi = [a[i]-a[i-1] for i in range(1,n)]\r\nmi = min(di)\r\nprint(mi,di.count(mi))", "n = int(input())\na = list(map(int, input().split()))\na.sort()\n#print(a)\ndis = 10000000000\nquantity = 0\nfor i in range(n-1):\n distance = abs(a[i]-a[i+1])\n if distance < dis:\n dis = distance\n quantity = 0\n if distance == dis:\n quantity += 1\n \nprint(dis, quantity)\n\n \n", "import sys\ninput=sys.stdin.readline\ndef main():\n\tn = int(input())\n\ta = list(map(int, input().split()))\n\ta.sort()\n\tm, nm = a[1]-a[0], 1\n\tfor i in range(1, n-1):\n\t\tif a[i+1]-a[i] < m:\n\t\t\tm, nm = a[i+1]-a[i], 1\n\t\telif a[i+1]-a[i]==m:\n\t\t\tnm +=1\n\tprint(m,nm)\nmain()\n\n", "a=input()\r\nl=input()\r\nl =[int(i) for i in l.split()]\r\nans=[]\r\na=sorted(l)\r\nfor x,y in zip(a,a[1:]):\r\n ans.append(abs(x-y))\r\nprint(min(ans) , ans.count(min(ans)))\r\n", "n=int(input())\r\na=[int(s) for s in input().split()]\r\na.sort()\r\nb=[a[i]-a[i-1] for i in range(1,n)]\r\nb.sort()\r\nm=b[0]\r\nk=b.count(m)\r\nprint(m,k)", "n = int(str(input()).strip())\r\na = sorted([int(x) for x in str(input()).split(' ')])\r\nmd = min([abs(a1 - a0) for a0, a1 in zip(a, a[1:])])\r\nprint(md, sum([md == abs(a1 - a0) for a0, a1 in zip(a, a[1:])]))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=[]\r\nfor i in range(n-1):\r\n b.append(abs(a[i]-a[i+1]))\r\nm=min(b)\r\nprint(m,b.count(m))\r\n", "a=int(input())\r\nlis=list(map(int,input().split()))\r\nlis.sort()\r\nl2=[]\r\nfor i in range(len(lis)-1):\r\n l2.append(abs(lis[i]-lis[i+1]))\r\nprint(min(l2),l2.count(min(l2)))", "R = int(input())\r\narra = list(map(int, input().split()))\r\narra.sort()\r\nsmol = arra[1] - arra[0]\r\na = 1\r\nfor i in range(1,R-1):\r\n if smol < arra[i+1] - arra[i]: continue\r\n elif smol == arra[i+1] - arra[i]: \r\n a = a + 1\r\n continue\r\n elif smol > arra[i+1] - arra[i]:\r\n smol = arra[i+1] - arra[i]\r\n a = 1\r\nprint(smol,a)", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nd = [arr[i] - arr[i-1] for i in range(1,n)]\r\nmd = min(d)\r\nprint(md,d.count(md))", "import sys\r\n\r\n# sys.stdin = open(\"1.in\", \"r\")\r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\n# print(a)\r\n\r\na.sort()\r\n\r\nmin_distance = sys.maxsize\r\nnum = 0\r\n\r\nfor i in range(1, n):\r\n distance = a[i]-a[i-1]\r\n if distance < min_distance:\r\n min_distance = distance\r\n num = 1\r\n elif distance == min_distance:\r\n num += 1\r\n\r\nprint(min_distance, num)\r\n\r\n \r\n\r\n", "import math\r\na = []\r\nresl = []\r\nresm = 10000000000000000\r\nresk = 1\r\nn = int(input())\r\ns = input().split()\r\na = [int(c) for c in s]\r\na.sort()\r\nfor i in range(len(a)-1):\r\n\tresl.append(int(math.fabs(a[i]-a[i + 1])))\r\nprint(str(min(resl)) + ' ' + str(resl.count(min(resl)))) \t\t\r\n\r\n\t\t", "import heapq\n\nN = int(input())\nAs = map(int, input().split())\n\nds = []\ndic = {}\nAs = list(sorted(As))\nfor i in range(N - 1):\n d = As[i + 1] - As[i]\n heapq.heappush(ds, d)\n if d in dic:\n dic[d] += 1\n else:\n dic[d] = 1\nd = heapq.heappop(ds)\nprint(' '.join(map(str, (d, dic[d]))))\n", "n = int(input())\na = [int(i) for i in input().split()]\na.sort()\n\nam = 0\nmin = 2000000000\n\nfor i in range(n - 1):\n if a[i + 1] - a[i] < min:\n am = 1\n min = a[i + 1] - a[i]\n elif a[i + 1] - a[i] == min:\n am += 1\n\nprint(min, am)", "n=int(input())\nr=list(map(int,input().split()))\nr.sort()\nm=min(r[i+1]-r[i] for i in range(n-1))\nd={}\nfor i in range(n-1):\n\tk=r[i+1]-r[i]\n\tif k not in d:\n\t\td[k]=0\n\td[k]+=1\nprint(m,d[m])", "def main():\r\n input()\r\n a = map(int, input().split())\r\n a = sorted(a)\r\n d = [a[i + 1] - a[i] for i in range(len(a) - 1)]\r\n\r\n m = int(2 * 1e9 + 1)\r\n c = 0\r\n\r\n for x in d:\r\n if x < m:\r\n m = x\r\n c = 1\r\n elif x == m:\r\n c += 1\r\n\r\n print(m, c)\r\n\r\n\r\nif __name__ == '__main__':\r\n # import sys\r\n # sys.stdin = open(\"A.txt\")\r\n main()\r\n\r\n", "n =int(input())\ntab = [int(i) for i in input().split()]\ntab.sort()\ndist = []\nfor i in range(n-1):\n\tdist.append(tab[i+1] - tab[i])\nx = min(dist)\ny = dist.count(x)\nprint(x, y)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\narr.sort()\r\nsu = [abs(arr[i]-arr[i+1]) for i in range(n-1)]\r\ny = min(su)\r\nx = su.count(y)\r\nprint(y,x)", "from operator import sub\r\nfrom bisect import bisect\r\nn = int(input())\r\na = sorted(map(int, input().split()))\r\nb = sorted(map(sub, a[1:], a))\r\nd = b[0]\r\ni = bisect(b, d)\r\nprint(d, i)\r\n", "from collections import deque\nfrom collections import Counter\nfrom sys import stdin\nlines = deque(line.strip() for line in stdin.readlines())\n\ndef nextline():\n return lines.popleft()\n\ndef types(cast):\n return tuple(int(x) for x in nextline().split())\n\ndef ints():\n return types(int)\n\ndef strs():\n return nextline().split()\n\ndef main():\n # lines will now contain all of the input's lines in a list\n (n,) = ints()\n coords = sorted(ints())\n counter = Counter(abs(coords[x]-coords[x+1]) for x in range(len(coords)-1))\n m = min(counter.keys())\n print(\"{} {}\".format(m, counter[m]))\n\nif __name__ == '__main__':\n main()\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na=sorted(a)\r\nm=1<<31\r\ni=1\r\n#print(a)\r\nfor j in range(n-1):\r\n d=abs(a[j]-a[j+1])\r\n if d<m:\r\n m=d\r\n i=1\r\n elif d==m:\r\n i+=1\r\n \r\nprint(m,i)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ncoun = []\r\nfor k in range(n - 1):\r\n coun.append(arr[k+1]-arr[k])\r\nzz = min(coun)\r\nprint(zz, coun.count(zz))", "n = int(input())\r\np = sorted(map(int,input().split()))\r\n\r\nd = p[1]-p[0]\r\nc = 1\r\nfor i in range(2,len(p)):\r\n if p[i] - p[i-1] < d:\r\n d = p[i]-p[i-1]\r\n c = 1\r\n elif p[i] - p[i-1] == d:\r\n c += 1\r\n\r\nprint(d,c)\r\n", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nb = []\r\nfor i in range(n-1):\r\n\tb.append(abs(a[i]-a[i+1]))\r\nm = min(b)\r\nc = b.count(m)\r\nprint(m,c)", "input()\r\n\r\nn = sorted(map(int, input().split()))\r\n\r\nm = -1\r\ncount = 0\r\nfor i in range(0, len(n) - 1):\r\n m1 = n[i+1] - n[i]\r\n \r\n if m == -1 or m1 < m:\r\n m = m1\r\n count = 1\r\n elif m1 == m:\r\n count += 1\r\n\r\nprint(m, count)", "n = int(input())\ndistances = [int(x) for x in input().split()]\ndistances.sort()\ncount = 0\nmin_distance = 10000000000\nfor i in range(n-1):\n temp = abs( distances[i] - distances[i+1])\n if temp < min_distance:\n min_distance = temp\n count = 1\n elif temp == min_distance:\n count += 1\n\nprint(f'{min_distance} {count}')", "n = int(input())\na = [int(x) for x in input().split()]\na.sort()\n\ndiffs = [a[i] - a[i-1] for i in range(1, n)]\ndiffs.sort()\n\ncur = 0\nwhile cur < n - 1 and diffs[cur] == diffs[0]:\n cur += 1\nprint(diffs[0], cur)\n", "n = int(input())\r\nA = list(map(int,input().split()))\r\n\r\nA.sort()\r\n\r\ndist = float(\"inf\")\r\ncnt = 0\r\n\r\nfor i in range(n-1):\r\n tmp = A[i+1]-A[i]\r\n if tmp < dist:\r\n dist = tmp\r\n cnt = 1\r\n elif tmp == dist:\r\n cnt += 1\r\n \r\nprint(dist, cnt)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nfrom random import choice\r\ndef quick(liste):\r\n if len(liste)<=1:\r\n return liste\r\n tes=choice(liste)\r\n kic=[i for i in liste if i<tes]\r\n ber=[k for k in liste if k==tes]\r\n boy=[m for m in liste if m>tes]\r\n return quick(kic) + ber +quick(boy)\r\n\r\nl=quick(l)\r\nmini=abs(l[0]-l[1])\r\nd={}\r\nfor i in range(len(l)-1):\r\n t=abs(l[i]-l[i+1])\r\n if t<mini:\r\n mini=t\r\n if t in d:\r\n d[t]+=1\r\n if not t in d:\r\n d[t]=1\r\nprint(mini,d[mini])\r\n\r\n", "import sys\nfrom collections import defaultdict\n\nlineno = 0\n\nfor line in sys.stdin:\n if lineno == 1:\n coords = sorted([int(i) for i in line.split()])\n lineno += 1\n if lineno == 2:\n break\n\nn = len(coords)\nc = 1\ni = 0\nj = len(coords) - 1\n\nd = defaultdict(int)\n\nfor i in range(n - 1):\n mi = abs(coords[i] - coords[i + 1])\n d[mi] += 1\n\nmi = min(list(d.keys()))\n\nprint(\"%d %d\" % (mi, d[mi]))\n\n", "n=int(input())\r\nl=input().split()\r\nli=[int(i) for i in l]\r\nli.sort()\r\nmaxa=10**10\r\nfor i in range(1,n):\r\n maxa=min(maxa,li[i]-li[i-1])\r\ncount=0\r\nfor i in range(1,n):\r\n if(li[i]-li[i-1]==maxa):\r\n count+=1\r\nprint(maxa,count)\r\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nmind=a[1]-a[0]\r\ncnt=1\r\nfor i in range(2,n):\r\n if a[i]-a[i-1]<mind:\r\n mind=a[i]-a[i-1]\r\n cnt=1\r\n elif a[i]-a[i-1]==mind:\r\n cnt+=1\r\nprint(str(mind)+\" \"+str(cnt))", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nlis1=[a[i]-a[i-1]for i in range(1,n)]\r\nprint(min(lis1),lis1.count(min(lis1)))", "n=int(input())\r\nm=10**10\r\nn=1\r\n*a,=map(int,input().split())\r\na.sort()\r\nfor i in range(1,len(a)):\r\n t=a[i]-a[i-1]\r\n if t<m:\r\n c=1\r\n m=t\r\n elif t==m:\r\n c+=1\r\nprint(m,c)\r\n", "# Codefores 792A\n\nn = int(input())\n\narr = [int(i) for i in input().split(' ')]\narr.sort()\n\nmin_l = arr[1] - arr[0]\nc = 1\n\nfor i in range(2, n):\n l = arr[i] - arr[i - 1]\n if l < min_l:\n min_l = l\n c = 1\n elif l == min_l:\n c += 1\n\nprint(min_l, c)", "n = int(input())\r\nl = sorted(list(map(int, input().split())))\r\n\r\nMIN = abs(l[0] - l[1]) \r\ncount = 0\r\n\r\nfor i in range(n-1):\r\n dist = abs(l[i] - l[i + 1])\r\n if dist < MIN:\r\n MIN = dist\r\n count = 1\r\n elif dist == MIN:\r\n count += 1\r\n\r\nprint(MIN, count)", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\nmod = 10**9 + 7\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\n\n\ndef main():\n n = I()\n a = sorted(LI())\n m = inf\n r = -1\n for i in range(1,n):\n t = a[i] - a[i-1]\n if t < m:\n m = t\n r = 1\n elif t == m:\n r += 1\n\n return '{} {}'.format(m,r)\n\n\nprint(main())\n", "import math\r\n\r\nn = int(input())\r\nb = []\r\na = sorted(list(map(int, input().split())))\r\nfor x in range(n - 1):\r\n b.append(abs(a[x] - a[x + 1]))\r\nm = min(b)\r\nprint(m, b.count(m))\r\n", "n = int(input())\r\nl = list(sorted(map(int,input().split())))\r\n\r\ncount , mi = 0 , 10000000000000\r\n\r\nfor i in range(n - 1):\r\n d = abs(l[i+1] - l[i])\r\n if d < mi :\r\n mi = d\r\n count = 1\r\n\r\n elif d == mi :\r\n count +=1\r\n\r\n\r\nprint(mi , count)\r\n\r\n\r\n\r\n\r\n", "n = eval (input())\narr = list(map(int, input().split(\" \")))\narr.sort()\nmi = 1e10\ncnt = 0\nfor i in range(0, n-1):\n\tmi = min(mi, abs(arr[i] - arr[i+1]));\nfor i in range(0, n-1):\n\tif abs(arr[i] - arr[i+1]) == mi:\n\t\tcnt = cnt + 1\nprint (mi, cnt)\n", "n=int(input())\nV=[int(x) for x in input().split()]\nV=sorted(V)\ncont=0\nmen=3000000000\nfor i in range(n-1):\n\tif abs(V[i]-V[i+1]) < men:\n\t\tmen=abs(V[i]-V[i+1])\n\t\tcont=1\n\telif abs(V[i]-V[i+1]) == men:\n\t\tcont+=1\nprint(men,cont)\n\t\n", "x=int(input())\r\ny=input()\r\na=[int(i) for i in y.split()]\r\na.sort()\r\nb=[]\r\ni=0\r\nwhile i<len(a)-1:\r\n b.append(abs(a[i]-a[i+1]))\r\n i+=1\r\nprint(min(b),b.count(min(b)))\r\n", "input()\r\nget=lambda:list(map(int,input().split()))\r\narr=get()\r\narr.sort()\r\nmind=float('inf')\r\nl=len(arr)\r\ni=0\r\nans=0\r\nwhile(i<l-1):\r\n tmpd=abs(arr[i]-arr[i+1])\r\n if tmpd<mind:\r\n mind=tmpd\r\n ans=1\r\n elif tmpd==mind:\r\n ans+=1 \r\n i+=1\r\nprint(mind,ans)\r\n", "from collections import defaultdict,OrderedDict,Counter\r\nfrom itertools import permutations,combinations\r\nfrom bisect import bisect_left,bisect_right\r\nfrom queue import Queue,PriorityQueue\r\nfrom heapq import heapify,heappop,heappush\r\nfrom math import gcd,sqrt,floor,factorial,ceil,log2,log10\r\n\r\nimport math\r\nimport bisect\r\nimport collections\r\nimport heapq\r\n\r\n# --------- Pre - Defined Functions --------\r\n\r\nmod = 10**9 + 7\r\n\r\n# def decToBin(n):\r\n# return bin(n).replace(\"0b\", \"\")\r\n \r\n# def binToDec(n):\r\n# return int(n,2)\r\n \r\n# def isPrime(n):\r\n# if n < 2:\r\n# return False\r\n# i = 2\r\n# while i*i <= n:\r\n# if n % i == 0:\r\n# return False\r\n# i += 1\r\n# return True\r\n\r\ninp1 = lambda: input()\r\ninp2 = lambda: int(input())\r\ninp3 = lambda: list(input())\r\ninp4 = lambda: map(int,input().split())\r\ninp5 = lambda: list(map(int,input().split()))\r\n\r\n# --------- Pre - Defined Functions --------\r\n\r\ndef binaryS(arr, n, k):\r\n # Generalise the common Binary Search algorithm.\r\n # Maintain 'l' and 'r' such that arr[l] < k and arr[r] >= k.\r\n # Assume float('-inf') at the start and float('inf') at the end.\r\n # This takes care of any possible edge cases that may occur.\r\n \r\n l, r = -1, n\r\n \r\n while l + 1 < r:\r\n m = l + (r - l) // 2\r\n \r\n if arr[m] < k:\r\n l = m\r\n else:\r\n r = m\r\n \r\n return r + 1\r\n\r\ndef binaryS1(arr, n, k):\r\n # Generalise the common Binary Search algorithm.\r\n # Maintain 'l' and 'r' such that arr[l] <= k and arr[r] > k.\r\n # Assume float('-inf') at the start and float('inf') at the end.\r\n # This takes care of any possible edge cases that may occur.\r\n \r\n l, r = -1, n\r\n \r\n while l + 1 < r:\r\n m = l + (r - l) // 2\r\n \r\n if arr[m] < k:\r\n l = m\r\n else:\r\n r = m\r\n \r\n return l + 1\r\n \r\n \r\n \r\n# for _ in range(inp2()):\r\nn = inp2()\r\narr = inp5()\r\n\r\ntemp, minm, count = sorted(arr), float('inf'), 0\r\n\r\nfor i in range(n-1):\r\n if temp[i+1] - temp[i] == minm:\r\n count += 1\r\n elif temp[i+1] - temp[i] < minm:\r\n minm = temp[i+1] - temp[i]\r\n count = 1\r\n\r\nprint(str(minm) + \" \" + str(count))\r\n \r\n\r\n\r\n \r\n \r\n ", "n = int(input())\na = [int(x) for x in input().split()]\na.sort()\nd = []\nfor i in range(1, n):\n d.append(a[i] - a[i-1])\nprint(min(d), d.count(min(d)))", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\nm = abs(l[0]-l[1])\r\n\r\nfor i in range(1,n-1):\r\n a = abs(l[i]-l[i+1])\r\n m = min(a,m)\r\n\r\nc = 0\r\nfor i in range(n-1):\r\n if abs(l[i]-l[i+1]) == m:\r\n c+=1\r\n\r\nprint(m,c)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=[]\r\nfor j in range(1,n):\r\n b.append(a[j]-a[j-1])\r\ncount=1\r\nb.sort()\r\nfor j in range(len(b)-1):\r\n if(b[j]==b[j+1]):\r\n count+=1\r\n else:\r\n break\r\nprint(b[0],count) ", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nc = 0\r\nm = 2000000005\r\nf = 0\r\nfor i in range(n - 1):\r\n if abs(a[i] - a[i+1]) < m:\r\n m = abs(a[i] - a[i+1])\r\n c = 1\r\n elif abs(a[i] - a[i+1]) == m:\r\n c += 1\r\n else:\r\n continue\r\nprint(m, c)\r\n", "import sys\r\nrln=sys.stdin.buffer.readline\r\nrl=lambda:rln().rstrip(b'\\r\\n').rstrip(b'\\n')\r\nri=lambda:int(rln())\r\nrif=lambda:[*map(int,rln().split())]\r\nrt=lambda:rl().decode()\r\nrtf=lambda:rln().decode().split()\r\ninf=float('inf')\r\ndir4=[(-1,0),(0,1),(1,0),(0,-1)]\r\ndir8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\nYES,NO,Yes,No,yes,no='YES','NO','Yes','No','yes','no'\r\n\r\nn=ri()\r\na=rif()\r\na.sort()\r\nmin_dist=inf\r\ncnt=0\r\nfor i in range(1,n):\r\n dist=a[i]-a[i-1]\r\n if dist<min_dist:\r\n min_dist=dist\r\n cnt=1\r\n elif min_dist==dist:\r\n cnt+=1\r\n\r\nprint(min_dist,cnt)\r\n", "i = int(input())\r\nl = sorted(list(map(int,input().split())))\r\nc = []\r\nfor x in range(1,i):\r\n c.append(abs(l[x]-l[x-1]))\r\nprint(min(c),c.count(min(c)))", "import sys\r\ninput=sys.stdin.readline\r\n\r\ndef bsearch(a,x): \r\n l=0\r\n r=len(a)-1\r\n if x<a[l]:\r\n return -1\r\n while l<=r:\r\n mid= l + (r-l)//2\r\n if a[mid]==x:\r\n return mid\r\n elif x<a[mid]:\r\n r=mid-1\r\n else:\r\n l=mid+1\r\n return -1\r\n\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nmn=1e15\r\np=0\r\nfor i in range(n-1):\r\n x=a[i+1]-a[i]\r\n mn=min(mn,x)\r\n \r\nfor i in range(n):\r\n x=bsearch(a,a[i]+mn)\r\n if x!=-1:\r\n p+=1\r\nprint(mn,p)", "cities = int(input())\ncity_coordinate = list(map(int, input().split(' ')))\n\ncity_coordinate.sort()\n\ndistance = []\n\nfor i in range(1, cities):\n distance.append(city_coordinate[i] - city_coordinate[i - 1])\n\nshortest_distance = min(distance)\nquantity_of_pairs = 0\n\nfor i in range(1, cities):\n if city_coordinate[i] - city_coordinate[i - 1] == shortest_distance:\n quantity_of_pairs += 1\n\nprint(shortest_distance, quantity_of_pairs)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nfrom collections import Counter\r\nC = Counter()\r\nfor i in range(n-1):\r\n d = A[i+1]-A[i]\r\n C[d] += 1\r\nC = list(C.items())\r\nC.sort()\r\nprint(*C[0])\r\n", "n = int(input())\r\nx = sorted(map(int, input().split()))\r\nd = [x[i] - x[i-1] for i in range(1, n)]\r\na = min(d)\r\nprint(a, d.count(a))\r\n\r\n", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\nn = int(input())\r\na = sorted(list(map(lambda v: int(v), input().split())))\r\nmd,c = abs(a[0]-a[1]),1\r\n\r\nfor i in range(1, n-1):\r\n d = abs(a[i]-a[i+1])\r\n if d==md: c+=1\r\n elif d<md: md,c = d,1\r\n\r\nprint(md, c)\r\n\r\n\r\n", "n = int(input())\r\nl = sorted(list(map(int , input().split())))\r\nans = []\r\nfor i in range(1,n):\r\n ans.append(l[i]-l[i-1])\r\nans = sorted(ans)\r\nprint(ans[0], ans.count(ans[0]))", "import sys\nimport collections\n\ncase = int(sys.stdin.readline());\ndist = [int(x) for x in sys.stdin.readline().split(\" \")]\ndist = sorted(dist)\n#print(dist)\nmini = float('inf');q=0;\nfor i in range(1,len(dist)):\n if dist[i] - dist[i-1] < mini:\n mini = dist[i] - dist[i-1];\n q=1;\n elif dist[i] - dist[i-1] == mini:\n q+=1;\n\nprint(mini,q)\n\n\t \t\t\t\t\t \t \t \t\t\t\t\t\t", "\nn = int(input())\nc = list(map(int, input().split()))\n\nc.sort()\n\ndist = 0\ncnt = 0\n\nfor i, _ in enumerate(c):\n if cnt == 0:\n dist = c[i+1] - c[i]\n cnt += 1\n else:\n d = c[i+1] - c[i]\n if d < dist:\n dist = d\n cnt = 1\n elif d == dist:\n cnt += 1\n if i+2 == n:\n break\n\nprint(dist, cnt)\n\n", "# coding=utf-8\r\n__author__ = 'Alexander'\r\n\r\nn = input()\r\nn = int(n)\r\n\r\ns = input()\r\na = list(map(int, s.split()))\r\n\r\na.sort()\r\n\r\nk = 0\r\nm = None\r\n\r\nfor i in range(n-1):\r\n d = a[i+1] - a[i]\r\n if m is None or d < m:\r\n k = 1\r\n m = d\r\n elif d == m:\r\n k += 1\r\n\r\nprint(m, k)\r\n", "n=int(input())\r\nk=0\r\na=list(map(int,input().split()))\r\nm=2*10**9\r\na=sorted(a)\r\nfor i in range(1,n):\r\n if m>a[i]-a[i-1]:\r\n m=a[i]-a[i-1]\r\n k=1\r\n else:\r\n if m==a[i]-a[i-1]:\r\n k+=1\r\nprint(str(m)+\" \"+str(k))\r\n", "\r\nn=int(input())\r\nli=list(map(int,input().split(\" \")))\r\nli.sort()\r\ncount=0\r\nminimum=pow(10,100)\r\ni=0\r\n\r\nwhile i<len(li)-1:\r\n if li[i+1]-li[i]<minimum:\r\n minimum=li[i+1]-li[i]\r\n count=1\r\n elif li[i+1]-li[i]==minimum:\r\n count+=1\r\n else:\r\n pass\r\n i+=1\r\n\r\nprint(minimum,count)", "n=int(input())\r\nz=(n-1)*[0]\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nfor i in range(n-1):\r\n z[i]=a[i+1]-a[i]\r\nprint(min(z),z.count(min(z)))\r\n", "#Educational Codeforces Round 18\r\n#https://codeforces.com/contest/792/problem/A\r\n\r\ndef cnt_req_edges(M,pos):\r\n cnt = 0 #counter for edges that are M distance apart\r\n for i in range(1,len(pos)):\r\n cnt += (M==pos[i]-pos[i-1])\r\n return cnt\r\n\r\n\r\ndef solve(n,a):\r\n M = 2000000000\r\n pos = sorted(a) #pos on axis in order\r\n\r\n for i in range(1,n):\r\n M = min(M,pos[i]-pos[i-1]) #obtain min dist\r\n\r\n return M,cnt_req_edges(M,pos)\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(x) for x in input().split(' ')]\r\n print(*solve(n,a))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\ndiff= 20000000000\r\nc=0\r\nfor i in range(1,n):\r\n if abs(a[i]-a[i-1]) < diff:\r\n diff=abs(a[i]-a[i-1])\r\nfor i in range(1, n):\r\n if abs(a[i]-a[i-1])== diff:\r\n c+=1\r\nprint(diff, c)", "from collections import defaultdict\ninput() # n\nnums = list(map(int, input().split()))\nnums.sort()\n\ndiff_dict = defaultdict(int)\n\nfor i in range(len(nums) - 1):\n diff_dict[abs(nums[i + 1] - nums[i])] += 1\n\nmin_diff = min(diff_dict)\nprint(str(min_diff) + \" \" + str(diff_dict[min_diff]))\n", "# n,t=map(int, input().split())\r\nn=(int)(input())\r\nl=list(map(int,input().split()))\r\nnl=list()\r\nl.sort()\r\nfor i in range(1,n):\r\n\r\n nl.append(abs(((l[i])-(l[i-1]))))\r\nnl.sort()\r\nc=0\r\nfor i in range(1,n):\r\n if abs((l[i])-(l[i-1])) == nl[0]:\r\n c+=1\r\nprint(nl[0],c,sep=' ')\r\n\r\n", "# РЕШЕНО\nn = int(input())\n\n# Минимальные расстояния будут в соседних по координатам городах. Мы можем\n# избежать полный перебор пар городов, если их отсортируем - тогда мы можем\n# проверять расстояния только между парами соседних гордов.\ncity_coords = sorted([int(x) for x in input().split()])\n\ndef min_dist(city_coords):\n distances = list()\n for i in range(len(city_coords)-1):\n distances.append(abs(city_coords[i] - city_coords[i+1]))\n minim = min(distances)\n count = distances.count(minim)\n return minim, count\n\nminim, count = min_dist(city_coords)\nprint(minim, count)", "n=int(input())\r\nL=input()\r\nl=L.split()\r\nl=[int(x) for x in l]\r\nl.sort()\r\nm=l[1]-l[0]\r\nfor i in range(n-1):\r\n if (l[i+1]-l[i])<m:\r\n m=(l[i+1]-l[i])\r\np=0\r\nfor i in range(n-1):\r\n if (l[i+1]-l[i])==m:\r\n p+=1\r\n \r\nprint (m,p,sep=\" \")\r\n", "n = int(input())\nx = sorted(list(map(int, input().split())))\na = []\nfor i in range(1, n):\n a.append([x[i - 1], x[i]])\na.sort(key=lambda x: x[1] - x[0])\ncur_min = a[0][1] - a[0][0]\ncur_cnt = 0\nfor j in range(len(a)):\n if a[j][1] - a[j][0] == cur_min:\n cur_cnt += 1\n else:\n break\nprint(cur_min, cur_cnt)\n", "n = int(input())\r\nr = lambda : list(map(int, input().split()))\r\narr = r()\r\nm = float('inf')\r\narr.sort()\r\nfor i in range(n-1):\r\n m = min(m , arr[i+1] - arr[i])\r\n\r\nc = 0\r\nfor i in range(n-1):\r\n if arr[i+1] - arr[i] == m:\r\n c += 1\r\n\r\nprint(m , c)", "n = int(input())\r\n*ar, = map(int,input().split())\r\nar.sort()\r\ntemp = []\r\nfor i in range(n-1):\r\n temp.append(ar[i+1]-ar[i])\r\n \r\nprint (min(temp), temp.count(min(temp)))\r\n", "from sys import stdin\r\n#from math import sqrt, gcd, log10, log, ceil, floor\r\ndef ii(): return int(stdin.readline())\r\ndef mi(): return map(int, stdin.readline().split())\r\ndef li(): return list(mi())\r\ndef si(): return stdin.readline()\r\nn=ii()\r\na=li()\r\na.sort()\r\nb=[]\r\nfor i in range(1, n):\r\n b.append(a[i]-a[i-1])\r\np=min(b)\r\nprint(p, b.count(p))", "n = int(input())\r\narr = sorted(list(map(int, input().split())))\r\ndictionary = {}\r\n\r\nfor i in range(1, n):\r\n x = arr[i] - arr[i-1]\r\n if x not in dictionary:\r\n dictionary[x] = 1\r\n else:\r\n dictionary[x] += 1\r\n\r\nkeys = sorted(dictionary.keys())\r\n\r\nprint(keys[0], dictionary[keys[0]])\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\n\r\n\r\nmn = 2 * 10**9 + 2\r\ncl = 0\r\nfor i in range(1, n):\r\n\tt = a[i]-a[i-1]\r\n\tif t<mn:\r\n\t\tcl = 1\r\n\t\tmn = t\r\n\telif t == mn:\r\n\t\tcl += 1\r\n\r\nprint(mn, cl)", "n = int(input())\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\npre = a[0]\r\nnum = float('inf')\r\npair = 0\r\nfor i in range(1, n):\r\n if num > abs(a[i] - pre):\r\n pair = 1\r\n num = abs(a[i] - pre)\r\n elif num == abs(a[i] - pre):\r\n pair += 1\r\n pre = a[i]\r\n\r\nprint(num, pair)", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nans,k=a[-1]-a[0],0\r\nfor i in range(1,n):\r\n d=a[i]-a[i-1]\r\n if d==ans:k+=1\r\n if d<ans:\r\n k=1\r\n ans=d\r\nprint(ans,k)", "import math\r\n\r\ndef main():\r\n t = int(input())\r\n\r\n arr = list(map(int, input().split()))\r\n\r\n arr.sort()\r\n\r\n \r\n\r\n min = abs(arr[0]-arr[1])\r\n\r\n flag = 0\r\n\r\n\r\n for j in range(len(arr)-1):\r\n if abs(arr[j]-arr[j+1])==min:\r\n\r\n flag +=1\r\n\r\n if abs(arr[j]-arr[j+1])<min:\r\n min = abs(arr[j]-arr[j+1])\r\n flag = 1\r\n print(min, flag)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "N = int(input())\r\nL = list(map(int, input().split()))\r\n\r\nL.sort()\r\n\r\nmi = None\r\n\r\nfor i in range(1, N):\r\n if not mi: mi = L[i] - L[i-1] \r\n else:\r\n mi = min(mi, L[i] - L[i-1])\r\n \r\nq = 0\r\n\r\nfor i in range(1, N):\r\n if L[i] - L[i-1] == mi:\r\n q += 1\r\n \r\nprint(str(mi) + ' ' + str(q)) ", "\r\n# Problem: A. New Bus Route\r\n# Contest: Codeforces - Educational Codeforces Round 18\r\n# URL: https://codeforces.com/contest/792/problem/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nfrom sys import stdin\r\ndef get_ints(): return list(map(int, stdin.readline().strip().split()))\r\n\r\nn = int(input())\r\nar = sorted(get_ints())\r\n\r\nmind = 99999999999\r\nfor i in range(n-1):\r\n\tmind = min(mind,abs(ar[i+1]-ar[i]))\r\n\r\nc = 0\r\nfor i in range(n-1):\r\n\tif abs(ar[i+1]-ar[i]) == mind:\r\n\t\tc+=1\r\nprint(mind,c)", "n=int(input())\r\nb=[int(i) for i in input().split()]\r\nb.sort()\r\np=[]\r\nfor i in range(1,n):\r\n p.append(abs(b[i]-b[i-1]))\r\nz=min(p)\r\nt=0\r\nfor i in range(1,n):\r\n if abs(b[i]-b[i-1])==z:\r\n t+=1\r\nprint(z,t)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nmn,cnt=int(1e10),0\r\nfor i in range(1,n):\r\n if (l[i]-l[i-1])<mn:\r\n mn=l[i]-l[i-1]\r\n cnt=1\r\n elif (l[i]-l[i-1])==mn:\r\n cnt+=1\r\nprint(mn,cnt)", "n = int(input())\narr = list(map(int, input().split()))\narr = sorted(arr)\narr = [abs(arr[i] - arr[i + 1]) for i in range(n - 1)]\nd = min(arr)\nc = arr.count(d)\n\nprint(d, c)\n", "MAX = 2e10\ndef solution(nums):\n dis = dict()\n dista = MAX\n for i in range(0,len(nums)-1):\n mini = abs(nums[i]-nums[i+1])\n if dis.get(mini) == None:\n dis[mini] = 1\n else:\n dis[mini] += 1\n\n dista = min(dista,mini)\n\n return \"{} {}\".format(dista, dis[dista])\n\ndef main():\n n = input()\n nums = sorted([int(x) for x in input().split()])\n print(solution(nums))\nmain()\n", "import math\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = sorted([int(i) for i in input().split(\" \")])\r\n hash_dif = {}\r\n for i in range(1, len(a)):\r\n x = a[i] - a[i - 1]\r\n if x in hash_dif:\r\n hash_dif[x] += 1\r\n else:\r\n hash_dif[x] = 1\r\n print(str(min(list(hash_dif))) + \" \" +str(hash_dif[min(list(hash_dif))]))\r\n\r\n\r\n\r\n\r\n\r\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()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()))\r\nw = [abs(j-i) for i, j in zip(w, w[1:])]\r\nc = min(w)\r\nprint(c, w.count(c))", "class CodeforcesTask792ASolution:\n def __init__(self):\n self.result = ''\n self.cities = 0\n self.cords = []\n\n def read_input(self):\n self.cities = int(input())\n self.cords = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n self.cords.sort()\n dists = [self.cords[x + 1] - self.cords[x] for x in range(self.cities - 1)]\n smallest_dist = min(dists)\n sm_dist_quant = dists.count(smallest_dist)\n self.result = \"{0} {1}\".format(smallest_dist, sm_dist_quant)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask792ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "#TLE in java so resubmitting in python\r\nn=int(input())\r\na=sorted(map(int,input().split()))\r\nd=[a[i]-a[i-1] for i in range(1,n) ]\r\nm=min(d)\r\nprint(m,d.count(m))", "\nn = int(input())\ncities = [int(i) for i in input().split()]\ncities.sort()\nsmallest = abs(cities[0] - cities[1])\ntimes = 0 \ni = 0 \nwhile i < len(cities) - 1:\n\n if (abs(cities[i] - cities[i+ 1]) < smallest):\n\n smallest = abs(cities[i] - cities[i+ 1])\n times =1\n elif (abs(cities[i] -cities[i+1]) == smallest):\n times += 1\n i +=1\n\nprint(str(smallest) + \" \" + str(times))\n \t\t\t \t \t\t\t\t \t \t \t \t\t\t\t\t", "n = int(input())\r\na = sorted(map(int,input().split()))\r\nd = [a[i]-a[i-1] for i in range(1,n)]\r\nm = min(d)\r\nprint (m,d.count(m))\r\n", "import sys\r\nimport bisect as bi\r\nimport math as mt\r\nimport collections as cc\r\nimport heapq as hp\r\nI=lambda:list(map(int,input().split()))\r\nn,=I()\r\nl=sorted(I())\r\nans={}\r\nfor i in range(n-1):\r\n x=abs(l[i]-l[i+1])\r\n ans[x]=ans.get(x,0)+1\r\ntemp=min(ans.keys())\r\nprint(temp,ans[temp])\r\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\na.sort()\r\nc=m=10000000000\r\nans=0\r\nfor i in range(n-1):\r\n c=a[i+1]-a[i]\r\n if c<m:\r\n m=c\r\nfor i in range(n-1):\r\n if a[i+1]-a[i]==m:\r\n ans+=1\r\nprint(m,ans)", "def main():\r\n n = int(input())\r\n cities = list(map(int, input().split()))\r\n\r\n cities.sort()\r\n \r\n minimum = float('inf')\r\n count = 0\r\n\r\n for i in range(len(cities)-1):\r\n dif = abs(cities[i]-cities[i+1])\r\n if dif == minimum:\r\n count += 1\r\n elif dif < minimum:\r\n minimum = dif\r\n count = 1\r\n\r\n print(minimum, count)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\nm = [10**19, 0]\r\n\r\nfor i in range(1,n):\r\n diff = a[i] - a[i-1]\r\n if diff<m[0]:\r\n m=[diff, 1]\r\n elif diff == m[0]:\r\n m[1]+=1\r\n\r\nprint(m[0], m[1])", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n n = len(A)\r\n A.sort()\r\n min_dist = 10 ** 18\r\n for i in range(1, n):\r\n dist = A[i] - A[i-1]\r\n min_dist = min(min_dist, dist)\r\n ans = 0\r\n for i in range(n):\r\n first = i + 1\r\n last = bisect.bisect_right(A, A[i] + min_dist, lo= i + 1)\r\n ans += last - first\r\n return (min_dist, ans)\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n ans = solve(A)\r\n print('%d %d' % (ans[0], ans[1]))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "v=[]\r\nn=int(input())\r\np=[int(x) for x in input().split()]\r\np.sort()\r\nfor i in range(n-1):\r\n d=p[i+1]-p[i]\r\n v.append(d)\r\nm=min(x for x in v)\r\nprint('%d %d'%(m,v.count(m)))", "inp=lambda:map(int,input().split())\r\nn = inp()\r\na=sorted(list(inp()))\r\na=[x-y for x,y in zip(a[1:], a[:len(a)-1])]\r\nprint(min(a), a.count(min(a)))", "from collections import defaultdict\r\n\r\nn = int(input())\r\nA = sorted(map(int, input().split()))\r\nc = defaultdict(int)\r\n\r\nfor i in range(n-1):\r\n c[abs(A[i+1]-A[i])] += 1\r\n\r\nr = min(c)\r\n\r\nprint(r, c[r])", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\nsys.setrecursionlimit(1000000)\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nd = 10**20\r\np = 0\r\nfor i in range(1, n):\r\n if a[i]-a[i-1] < d:\r\n d = a[i]-a[i-1]\r\n p = 1\r\n elif a[i]-a[i-1] == d:\r\n p += 1\r\nprint(d, p)", "n = int(input())\r\nstring = input()\r\nnumbers = sorted(map(int, string.split()))\r\nvalues = []\r\nfor x in range(n - 1, 0, -1):\r\n values.append(numbers[x] - numbers[x - 1])\r\na = min(values)\r\nprint(a, values.count(a))", "def solve():\r\n n = int(input())\r\n a = [int(x) for x in input().split(' ')]\r\n a.sort()\r\n d_dict = {}\r\n for i in range(1, n):\r\n d = a[i] - a[i - 1]\r\n if d in d_dict:\r\n d_dict[d] += 1\r\n else:\r\n d_dict[d] = 1\r\n m = min(d_dict.keys())\r\n x = d_dict[m]\r\n return m, x\r\n\r\nprint(*solve())\r\n\r\n", "import sys\n\na = input()\nb = sys.stdin.readline().split()\ncities = [int(elem) for elem in b]\n\ncities.sort()\ncities.reverse()\n\nlist_ = [abs(cities[i]-cities[i+1]) for i in range(0, len(cities)-1)]\nlist_.sort()\n\n\na = list_[0]\nS = 0\nfor i in range(0, len(list_)):\n\tif list_[i] == a:\n\t\tS += 1\n\telse:\n\t\tpass\n\nprint('{0} {1}'.format(a, S))\n\t\n", "n = int(input())\nan = [int(i) for i in input().strip().split(' ')]\n\nan.sort()\nmin_dist = float('inf')\nmin_count = 0\n\nfor i in range(n - 1):\n dist = abs(an[i] - an[i + 1])\n\n if dist < min_dist:\n min_dist = dist\n min_count = 1\n elif dist == min_dist:\n min_count += 1\n\nprint('%s %s' % (min_dist, min_count))\n", "n = int(input())\r\nspic = list(map(int, input().split()))\r\nspic = sorted(spic)\r\nmins = -1\r\ntec = 0\r\nfor i in range(1, n):\r\n if abs(spic[i] - spic[i - 1]) < mins or mins == -1:\r\n mins = abs(spic[i] - spic[i - 1])\r\n tec = 1\r\n elif abs(spic[i] - spic[i - 1]) == mins:\r\n tec += 1\r\nprint(mins, tec) ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\ncnt=0\r\nminn=float('inf')\r\nfor i in range(len(l)-1):\r\n if(minn==abs(l[i+1]-l[i])):\r\n cnt+=1\r\n elif(minn>abs(l[i+1]-l[i])):\r\n cnt=1\r\n minn=abs(l[i+1]-l[i])\r\nprint(minn,cnt)", "n = int(input())\r\na = sorted(map(int, input().split()))\r\ncount = 0\r\nbest = 2 * 10**9 + 1\r\nfor s1, s2 in zip(a, a[1:]):\r\n d = abs(s1 - s2)\r\n if d == best:\r\n count += 1\r\n elif d < best:\r\n count = 1\r\n best = d\r\n\r\nprint(best, count)", "N = int(input())\r\nX = sorted(list(map(int, input().split())))\r\nCount, Min = 0, 10 ** 10\r\nfor i in range(1, N):\r\n Min = min(Min, abs(X[i] - X[i - 1]))\r\n if Min == 1:\r\n break\r\nfor i in range(1, N):\r\n if abs(X[i] - X[i - 1]) == Min:\r\n Count += 1\r\nprint(Min, Count)\r\n", "#f = open('socdist2.in', 'r')\r\nn = int(input())\r\ncoords = list(sorted((map(int, input().split()))))\r\ndistances = []\r\nfor i in range(1, n):\r\n distances.append(coords[i] - coords[i - 1])\r\nans = min(distances)\r\nprint(ans, distances.count(ans))", "n=int(input())\na=sorted([int(f)for f in input().split()])\nm=1<<31\ni=1\nfor x in range(n-1):\n d=abs(a[x]-a[x+1])\n if d<m:\n m=d\n i=1\n elif d==m:\n i+=1\n \nprint(m,i)\n", "\n\nn = int(input())\n\ntab = sorted([int(x) for x in input().split()])\n\nmin_dist = 2 * 10**9 + 2\n\nfor i in range(n - 1):\n min_dist = min([min_dist, tab[i + 1] - tab[i]])\n\namount = 0\n\nfor i in range(n - 1):\n if tab[i + 1] - tab[i] == min_dist:\n amount += 1\n\nprint(min_dist, amount)\n", "\r\n\r\ndef solve(num):\r\n num = sorted(num)\r\n l_num = []\r\n for i in range(len(num) - 1):\r\n l_num.append(abs(num[i] - num[i + 1]))\r\n el_min = l_num[0]\r\n cnt_min = 1\r\n flag = True\r\n for el in l_num:\r\n if flag:\r\n flag = False\r\n continue\r\n if el < el_min:\r\n el_min = el\r\n cnt_min = 1\r\n continue\r\n if el == el_min:\r\n cnt_min += 1\r\n print(el_min, cnt_min)\r\n\r\n\r\ninput()\r\nsolve(list(map(int, input().split())))\r\n", "n = int(input())\na = sorted(list(map(int,input().split())))\nM = 1e12\nres = 1\nfor i in range(n-1):\n yy = a[i+1] - a[i]\n if yy < M:\n M = yy\n res = 1\n elif yy == M:res+=1\n \nprint(*[M,res])\n", "import math\r\nn=int(input())\r\narr=sorted(list(map(int,input().split())))\r\nmin_v=math.inf\r\ncnt=0\r\nfor i in range(n-1):\r\n\tx=abs(arr[i]-arr[i+1])\r\n\tif x<=min_v:\r\n\t\tif x==min_v:\r\n\t\t\tcnt+=1\r\n\t\telse:\r\n\t\t\tmin_v=x\r\n\t\t\tcnt=1\r\n\r\nprint(min_v,cnt)\r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nres=float(\"inf\")\r\ncount=0\r\nfor i in range(n-1):\r\n if arr[i+1]-arr[i]<res:\r\n count=1\r\n res=arr[i+1]-arr[i]\r\n elif arr[i+1]-arr[i]==res:\r\n count+=1\r\nprint(res,count)", "import sys\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort();\r\nb = []\r\nfor i in range(1,n):\r\n b.append(a[i] - a[i-1]);\r\nb.sort();\r\nnum = 1;\r\nfor i in range(1,n-1):\r\n if b[i] != b[i - 1]:\r\n break\r\n num+=1;\r\nprint(b[0],num)", "n = int(input())\r\na = list(map(int, input().split()))\r\ndictSome = {}\r\nsb = False\r\na.sort()\r\nfor i in range(0, len(a) - 1):\r\n k = abs(a[i] - a[i + 1])\r\n if k in dictSome.keys():\r\n dictSome[k] += 1\r\n else:\r\n dictSome[k] = 1\r\nprint(min(dictSome.keys()), dictSome[min(dictSome.keys())])\r\n", "n = int(input())\r\na = sorted(int(i) for i in input().split())\r\nb = [abs(a[i]-a[i+1]) for i in range(n-1)]\r\nm = min(b)\r\nc = b.count(m)\r\nprint(m, c)\r\n", "import sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\nn,=I()\nl=I()\nan={};l.sort()\nfor i in range(1,n):\n\td=l[i]-l[i-1]\n\tan[d]=an.get(d,0)+1\nx=min(an)\nprint(x,an[x])\n", "n = int(input())\narr = sorted(list(map(int,input().split())))\nmini = [arr[i] - arr[i-1] for i in range(1,n)]\nm = min(mini)\nprint(int(m),mini.count(m))\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nmin_dist = 10**10\r\nmin_count = 0\r\n\r\nl = a[0]\r\n\r\nfor r in a[1:]:\r\n if r - l < min_dist:\r\n min_dist = r - l\r\n min_count = 1\r\n elif r - l == min_dist:\r\n min_count += 1\r\n l = r\r\n\r\nprint(min_dist, min_count)\r\n", "n=int(input())\r\nlist1=list(map(int,input().split(' ')))\r\nlist1.sort()\r\nmin=list1[-1]-list1[0]\r\nfor i in range(0,n-1):\r\n if list1[i+1]-list1[i]<min:\r\n min=list1[i+1]-list1[i]\r\ncount=0\r\nfor i in range(0,n-1):\r\n if list1[i+1]-list1[i]==min:\r\n count+=1\r\nprint(min,count)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=[]\r\nfor i in range(1,n):\r\n b.append(a[i]-a[i-1])\r\nb.sort()\r\nc=b[0]\r\nd=b.count(c)\r\nprint(c,d)", "input()\r\na = sorted([int(i) for i in input().split()])\r\nbest = float('inf')\r\nquantity = 0\r\nfor i in range(1, len(a)):\r\n\tdiff = abs(a[i] - a[i - 1])\r\n\tif diff == best:\r\n\t\tquantity += 1\r\n\telif diff < best: \r\n\t\tquantity = 1\r\n\t\tbest = diff\r\nprint(best, quantity)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmin = 1000000000000000000\r\nfin = 0\r\nfor i in range (1, n):\r\n if (min > abs(a[i - 1] - a[i])):\r\n min = abs(a[i - 1] - a[i])\r\n fin = 0\r\n if (min == abs(a[i - 1] - a[i])):\r\n fin += 1\r\nprint(min, fin)", "from sys import stdin\r\nn=int(stdin.readline())\r\na=sorted(list(map(int,stdin.readline().split())))\r\nmn=10e9\r\ncount=0\r\nfor i in range(n-1):\r\n\tmn=min(mn,abs(a[i+1]-a[i]))\r\nfor i in range(n-1):\r\n\tcount+= (abs(a[i+1]-a[i])==mn)\r\n\t\t\t\r\nprint(mn,count)", "#!/usr/bin/python3\n# Copyright (C) 2017 Sayutin Dmitry.\n#\n# This program is free software; you can redistribute it and/or\n# modify it under the terms of the GNU General Public License as\n# published by the Free Software Foundation; version 3\n#\n# This program is distributed in the hope that it will be useful,\n# but WITHOUT ANY WARRANTY; without even the implied warranty of\n# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n# GNU General Public License for more details.\n#\n# You should have received a copy of the GNU General Public License\n# along with this program; If not, see <http://www.gnu.org/licenses/>.\n\ndef main():\n input()\n a = list(map(int, input().split()))\n a.sort()\n\n mn, cnt = 10 ** 18, 0\n for i in range(1, len(a)):\n f = a[i] - a[i - 1]\n if f == mn:\n cnt += 1\n if f < mn:\n mn, cnt = f, 1\n \n print(mn, cnt)\n\nmain()\n", "n = int(input())\r\nnum = list(map(int,input().split()))\r\nnum.sort()\r\nmn = 10000000000\r\nmc = 1\r\nfor i in range(1,n):\r\n val = abs(num[i]-num[i-1])\r\n if val<mn:\r\n mn = val\r\n mc = 1\r\n elif(val==mn):\r\n mc+=1\r\nprint(mn,mc) ", "n=int(input())\r\nm=sorted(map(int,input().split()))\r\nd = [m[i]-m[i-1] for i in range(1,n)]\r\na=min(d)\r\nprint(a, d.count(a))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=[]\r\nfor i in range(n-1):\r\n b.append(a[i+1]-a[i])\r\nprint(min(b),b.count(min(b)))", "n=int(input())\r\nar=list(map(int,input().split()))\r\nar.sort()\r\nmi=abs(ar[1]-ar[0])\r\ns=1\r\nfor x in range(1,n-1):\r\n if abs(ar[x+1]-ar[x])<mi:\r\n mi=abs(ar[x+1]-ar[x])\r\n s=1\r\n elif abs(ar[x+1]-ar[x])==mi:\r\n s+=1 \r\nprint(mi,s)", "n=int(input())\r\nb = list(map(int, input().split()))\r\nb.sort()\r\nm=[]\r\nfor i in range(n-1):\r\n m.append(b[i+1]-b[i])\r\nprint(min(m),m.count(min(m)))\r\n", "n = input()\r\na = sorted(map(int, input().strip().split()))\r\n\r\nd = [c2 - c1 for c1, c2 in zip(a, a[1:])]\r\nm = min(d)\r\n\r\nprint(f'{m} {d.count(m)}')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nm = 2 * pow(10, 9)\r\nfor i in range(n - 1):\r\n m = min(m, a[i + 1] - a[i])\r\nc = 0\r\nfor i in range(n - 1):\r\n if m == a[i + 1] - a[i]:\r\n c += 1\r\nprint(m, c)", "n = int(input())\r\nL = sorted(list(map(int,input().split())))\r\n\r\nd = [ abs(L[i] - L[i-1]) for i in range(1, n)]\r\na = min(d)\r\n# print(d, a)\r\nprint(a, d.count(a))\r\n\r\n", "n = int(input())\r\nL = list(map(int,input().split()))\r\nL.sort()\r\nd = [ abs(L[i] - L[i-1]) for i in range(1, n)]\r\na = min(d)\r\n\r\nprint(a, d.count(a))\r\n\r\n", "n = int(input())\narr = list(map(int,input().split()))\narg = []\narr.sort()\nfor i in range(1,len(arr)):\n arg.append(abs(arr[i]-arr[i-1]))\nx = min(arg)\nprint(x, arg.count(x))", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nk=0\r\nl=2000000000\r\nfor i in range(1,n):\r\n if l>a[i]-a[i-1]:\r\n l=a[i]-a[i-1]\r\n k=1\r\n elif l==a[i]-a[i-1]:\r\n k+=1\r\nprint(l,k)\r\n", "n = int(input())\r\na = sorted(map(int,input().split()))\r\nmn = 99999999999999\r\ncnt = 0\r\nfor i in range(1,n):\r\n diff = abs(a[i]-a[i-1])\r\n if diff==mn:\r\n cnt+=1\r\n if diff<mn:\r\n cnt=1\r\n mn=diff\r\nprint(mn,cnt)", "import sys\nimport math\ninputLines = sys.stdin.readlines()\ninput = list(map(int, inputLines[1].split(\" \")))\ninput.sort()\n\nsmallestDist = float('inf')\ncount = 0\nfor i in range(0, len(input)-1):\n dist = abs(input[i]-input[i+1])\n if dist < smallestDist:\n smallestDist = dist\n count = 1\n elif dist == smallestDist:\n count += 1\n\nprint(f'{smallestDist} {count}')", "a = int(input())\r\nsp = sorted(list(map(int, input().split())))\r\nsp1 = sp[1:]\r\ntot = []\r\nfor i, j in zip(sp, sp1):\r\n tot.append(abs(i - j))\r\nprint(min(tot), tot.count(min(tot)))", "n = int(input())\r\nt = [int(x) for x in input().split()]\r\nt.sort()\r\n\r\nk = t[n-1] - t[0]\r\nl = 0\r\nfor i in range(1, n):\r\n if t[i] - t[i-1] < k:\r\n k = t[i] - t[i-1]\r\nfor i in range(1, n):\r\n if t[i] - t[i-1] == k:\r\n l += 1\r\nprint(k, l)", "import sys\r\nn = int(input())\r\na = sorted(map(int, input().split()))\r\nv1, v2 = 10**18, 0\r\nfor i in range(1, n):\r\n if a[i] - a[i-1] < v1:\r\n v1 = a[i] - a[i-1]\r\n v2 = 1\r\n elif v1 == a[i] - a[i-1]:\r\n v2 += 1\r\n\r\nprint(v1, v2)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\nmmn = lst[1] - lst[0]\r\ncnt = 1\r\nfor i in range(n - 2):\r\n dif = lst[i + 2] - lst[i + 1]\r\n if dif < mmn:\r\n mmn = dif\r\n cnt = 1\r\n elif dif == mmn:\r\n cnt += 1\r\nprint(mmn, cnt)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\ncount = 0\r\nm = a[1]-a[0]\r\nfor i in range(2,n):\r\n if a[i]-a[i-1] < m:\r\n m = a[i]-a[i-1]\r\n\r\nfor i in range(1,n):\r\n if a[i]-a[i-1] == m:\r\n count += 1\r\n\r\nprint(m, count)", "n=int(input())\r\na=sorted(map(int, input().split()))\r\nm=min(a[i]-a[i-1] for i in range(1, n))\r\nprint(m, sum(a[i]-a[i-1]==m for i in range(1, n)))", "n = int(input())\nmn = 2 * 10 ** 9 + 1\na = [int(i) for i in input().split()]\na.sort()\ncnt = 0\nfor i in range(n-1):\n\tx = abs(a[i] - a[i+1])\n\tif x < mn:\n\t\tmn = x\n\t\tcnt = 1\n\telif x == mn:\n\t\tcnt = cnt + 1\n\nprint(mn, cnt)", "n = int(input())\r\n\r\na = list(map(int,input().split(' ')))\r\n\r\na = sorted(a)\r\n\r\nm = a[1]-a[0]\r\n\r\nfor i in range(2,len(a)):\r\n if a[i]-a[i-1] < m:\r\n m = a[i]-a[i-1]\r\n \r\ncount = 0\r\n \r\nfor i in range(1,len(a)):\r\n if a[i]-a[i-1] == m:\r\n count = count + 1\r\n \r\nprint(m,count) ", "n=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\nl1=[]\r\nfor i in range(n-1):\r\n l1.append(l[i+1]-l[i])\r\nm=min(l1)\r\nm1=l1.count(m)\r\nprint(m,m1)", "n = int(input())\r\na = list(map(int, input().strip().split()))\r\na.sort()\r\n\r\ndiff = []\r\nfor i in range(n-1):\r\n diff.append(a[i+1]-a[i])\r\n \r\nm = min(diff)\r\nc = 0\r\nfor i in range(n-1):\r\n if diff[i] == m:\r\n c+=1\r\nprint(str(m) + \" \" + str(c))", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\n\r\ndist = []\r\nfor i in range(1, n):\r\n dist.append(a[i] - a[i-1])\r\ndist.sort()\r\nlow = dist[0]\r\nans = 0\r\nwhile ans < len(dist) and dist[ans] == low:\r\n ans += 1\r\n \r\nprint(low, ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\ndiff=[]\r\na.sort()\r\nfor i in range(1 ,len(a)):\r\n diff.append(abs(a[i]-a[i-1]))\r\n\r\nx=min(diff)\r\nprint(x,diff.count(x))\r\n\r\n\r\n\r\n \r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nres = 0\r\nmin = 10**10\r\nfor i in range(1,len(a)):\r\n minimum = a[i]-a[i-1]\r\n if minimum <min:\r\n min = minimum\r\n res = 1\r\n elif minimum == min:\r\n res+=1\r\nprint(min, res)\r\n", "# #✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\n# ◕ █ █ █ █ /████\\ ██\\ █ /██\\ ██ ██\\ █ ◕\r\n# ◕ █ █ █ █ █\\ \\█ █\\█\\ █ /█/\\█\\ █\\█\\ █ ◕\r\n# ◕ █\\ /█ █ █ █ █ \\█\\ █ /█/ \\█\\ ██ █ \\█\\ █ ◕\r\n# ◕ █████ █ █ \\████\\ █ \\█\\ █ █/ \\█ ██ █ \\█\\ █ ◕\r\n# ◕ █/ \\█ █ █ \\█ █ \\█\\ █ ████████ ██ █ \\█\\ █ ◕\r\n# ◕ █ █ █\\ /█ █\\ /█ █ \\█\\█ █ █ ██ █ \\█\\█ ◕\r\n# ◕ █ █ \\██████/ \\████/ █ \\██ █ █ ██ █ \\██ ◕\r\n#✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧✧\r\na = int(input())\r\narr = sorted(list(map(int,input().split())))\r\nl = []\r\nfor i in range(a-1):\r\n l.append(max(arr[i],arr[i+1])-min(arr[i],arr[i+1]))\r\nprint(min(l),l.count(min(l)))", "from itertools import islice\ndef min_distance(cities):\n cities = sorted(cities)\n minimum = float('+inf')\n count = 0\n for A, B in zip(islice(cities,len(cities)-1), islice(cities,1, None)):\n # print(A, B)\n distance = abs(B-A)\n if distance < minimum:\n minimum = distance\n count = 1\n elif distance == minimum:\n count += 1\n return minimum, count\n\ndef main():\n count = int(input())\n cities = map(int, input().strip().split())\n distance, count = min_distance(cities)\n print(distance, count)\n\n\nif __name__ == '__main__':\n main()", "num = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nlst = []\r\nfor i in range(num-1):\r\n lst.append(arr[i+1] - arr[i])\r\n\r\nprint(min(lst),lst.count(min(lst)))\r\n\r\n\r\n", "n = int(input())\na = [int(x) for x in input().split()]\n\nmx = 10**100\nct = 0\n\na.sort()\nfor x, y in zip(a, a[1:]):\n if y - x < mx:\n mx = y - x\n ct = 1\n elif y - x == mx:\n ct += 1\n\nprint(mx, ct)\n", "n = int(input())\r\nai = list(map(int,input().split()))\r\nai.sort()\r\nmini = 10000000000000\r\nnum = 0\r\nfor i in range(n-1):\r\n num2 = ai[i + 1] - ai[i]\r\n if mini > num2:\r\n mini = num2\r\n num = 1\r\n elif mini == num2:\r\n num += 1\r\nprint(mini,num)\r\n", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nmini=10**10\r\nfor x in range(1, len(l)):\r\n\tmini=min(mini, l[x]-l[x-1])\r\nans=0\r\nfor x in range(1, len(l)):\r\n\tif l[x]-l[x-1]==mini:\r\n\t\tans+=1\r\nprint(mini, ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nm = 10**10\r\nc = 0\r\nfor i in range(n-1):\r\n\tif max(a[i],a[i+1])-min(a[i],a[i+1])<m:\r\n\t\tm = max(a[i],a[i+1])-min(a[i],a[i+1])\r\nfor i in range(n-1):\r\n\tif max(a[i],a[i+1])-min(a[i],a[i+1])==m:\r\n\t\tc += 1\r\nprint(m,c)", "import math\r\ninput1=list(map(int,input().split()))\r\ninput2=list(map(int,input().split()))\r\nmin=1e10\r\nquantity=0\r\ninput2.sort()\r\nfor i in range(len(input2)-1):\r\n if math.fabs(input2[i+1]-input2[i])<min:\r\n quantity=1\r\n min=math.fabs(input2[i+1]-input2[i])\r\n elif math.fabs(input2[i+1]-input2[i])==min:\r\n quantity+=1\r\nprint(str(int(min)) +\" \"+ str(quantity))\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n", "n=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nlst.sort()\r\nm=2*10**9\r\nt=0\r\nfor j in range(1,n):\r\n if lst[j]-lst[j-1]==m:\r\n t+=1\r\n elif lst[j]-lst[j-1]<m:\r\n t=1\r\n m=lst[j]-lst[j-1]\r\nprint(m,t,end=\" \")\r\n ", "from itertools import combinations\ninput()\ncities = sorted(map(int, input().split()))\nmin_dist = 10 ** 18\nmin_count = 0\nfor i in range(len(cities) - 1):\n if abs(cities[i + 1] - cities[i]) < min_dist:\n min_dist = abs(cities[i + 1] - cities[i])\n min_count = 1\n continue\n if abs(cities[i + 1] - cities[i]) == min_dist:\n min_count += 1\nprint(\"{} {}\".format(min_dist, min_count))\n", "n = int(input())\r\n*l, = map(int, input().split())\r\nl.sort()\r\nd = []\r\nfor i in range(n-1):\r\n d.append(l[i+1]-l[i])\r\n\r\nprint(min(d), d.count(min(d)))\r\n", "count = 1\r\n\r\nmin_d = 100000000000000000\r\n\r\nn = int(input())\r\ndata = list(map(int,input().split()))\r\n\r\ndata.sort()\r\n\r\nprev = data[0]\r\n\r\nfor el in data:\r\n if prev == el:\r\n continue\r\n\r\n if el - prev < min_d:\r\n min_d = el - prev\r\n count = 1\r\n elif el - prev == min_d:\r\n count+=1\r\n\r\n prev = el\r\n\r\nprint(min_d, count)\r\n", "x=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist2=[]\r\nlist1.sort()\r\nfor i in range(1,x):\r\n list2+=[abs(list1[i]-list1[i-1])]\r\nprint(min(list2),list2.count(min(list2)))", "n = int(input())\r\na = sorted(map(int, input().split()))\r\nfreq = {}\r\nfor i in range(1, n):\r\n x = a[i] - a[i-1]\r\n freq[x] = freq.get(x, 0) + 1\r\n\r\nmin_distance = min(freq.keys())\r\nprint(min_distance, freq[min_distance])\r\n", "n=eval(input())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\ndiff=a[1]-a[0]\r\nf=0\r\nfor i in range(1,n-1):\r\n\tif(a[i+1]-a[i]<diff):\r\n\t\tdiff=a[i+1]-a[i]\r\nfor i in range(n-1):\r\n\tif(a[i+1]-a[i]==diff):\r\n\t\tf+=1\r\nprint(diff,f)\r\n", "import math\nn=int(input())\n\ntemp=input()\ntab=temp.split(\" \")\ni=0\nwhile(i<len(tab)):\n tab[i] = int(tab[i])\n i+=1\ndiff = math.fabs(tab[0]-tab[-1])\nres=0\ntab.sort()\n\ni=1\nwhile(i<len(tab)):\n if(math.fabs(tab[i]-tab[i-1])<diff):\n res=1\n diff=math.fabs(tab[i]-tab[i-1])\n elif (math.fabs(tab[i]-tab[i-1]) == diff):\n res+=1\n i+=1\n\nprint(int(diff),res)\n\n\n", "n = int(input())\r\ncities = sorted(map(int, input().strip().split()))\r\n\r\ndistances = sorted([\r\n abs(cities[i] - cities[i+1]) for i in range(0, n-1)\r\n])\r\n\r\nprint(distances[0], len(list(filter(lambda x: x == distances[0], distances))))", "n = int(input())\r\ncities = sorted(map(int, input().split()))\r\nmn = float(\"inf\")\r\ncount = 0\r\n\r\nfor i in range(1, n):\r\n dist = cities[i] - cities[i - 1]\r\n if dist < mn:\r\n mn = dist\r\n count = 1\r\n elif dist == mn:\r\n count += 1\r\n \r\nprint(mn, count)", "from collections import Counter\r\nn, a = int(input()), sorted(map(int, input().split()))\r\nc = Counter(a[i + 1] - a[i] for i in range(n - 1))\r\nprint(min(c), c[min(c)])", "n = int(input())\r\nls = list(map(int, input().split()))\r\nls.sort()\r\nk=[]\r\nfor x in range(len(ls)-1):\r\n k.append(ls[x+1] - ls[x])\r\nprint (min(k), k.count(min(k)))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nm=3*1e9\r\nnb=0\r\nfor i in range (len(l)-1):\r\n if l[i+1]-l[i]==m:\r\n nb+=1\r\n if l[i+1]-l[i]<m:\r\n m=l[i+1]-l[i]\r\n nb=1\r\nprint(m,nb,sep=' ',end='\\n')\r\n", "n = int(input())\ncoord = list(map(int, input().split()))\ncoord.sort()\ndiff = []\nfor i in range(len(coord)-1):\n diff.append(coord[i+1] - coord[i])\ndiff.sort()\ncnt = 0\nfor i in range(len(diff)):\n if diff[i] == diff[0]:\n cnt += 1\nprint(diff[0], cnt)", "def main():\r\n\tn=int(input())\r\n\ta=list(map(int,input().split()))\r\n\ta.sort()\r\n\tc=[]\r\n\tfor i in range(n-1):\r\n\t\tc+=[a[i+1]-a[i]]\r\n\tprint(min(c),c.count(min(c)))\r\n\r\nif __name__=='__main__':\r\n\tmain()", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nl = sorted([int(i) for i in input().split()])\r\nres = 10**18\r\nans = 0\r\nfor i in range(n-1):\r\n t = l[i+1]-l[i]\r\n if t == res:\r\n ans += 1\r\n elif t < res:\r\n res = t\r\n ans = 1\r\nprint(res, ans)\r\n", "N = int(input())\npoints = [int(n) for n in input().split()]\n\npoints.sort()\n\npairs = 0\nmin_dist = float('inf')\n\ndistance = [points[i+1]-points[i] for i in range(N-1)]\n\nfor i in range(N-1):\n if distance[i] < min_dist:\n min_dist=distance[i]\n pairs = 1\n elif distance[i] == min_dist:\n pairs += 1\n\t\nprint(min_dist, pairs)\n", "import math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n\r\ndef mindist(n, list):\r\n list.sort()\r\n lista = []\r\n for i in range(n-1):\r\n lista.append(list[i+1] - list[i])\r\n mi = min(lista)\r\n count = lista.count(mi)\r\n return [mi, count]\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n list = list(map(int, input().rstrip().split()))\r\n [mi, count] = mindist(n, list)\r\n print(str(mi) + \" \" + str(count))", "import sys\r\n\r\ndef solve():\r\n n = int(input())\r\n a = sorted([int(i) for i in input().split()])\r\n\r\n cnt = 0\r\n min_d = 4 * 10**9\r\n\r\n for i in range(n - 1):\r\n if a[i + 1] - a[i] < min_d:\r\n cnt = 1\r\n min_d = a[i + 1] - a[i]\r\n elif a[i + 1] - a[i] == min_d:\r\n cnt += 1\r\n\r\n print(min_d, cnt)\r\n\r\n\r\ndef debug(x, table):\r\n for name, val in table.items():\r\n if x is val:\r\n print('DEBUG:{} -> {}'.format(name, val), file=sys.stderr)\r\n return None\r\n\r\nif __name__ == '__main__':\r\n solve()", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\ncount = 0\r\nres = 2 * 10 ** 9\r\nfor i in range(n - 1):\r\n if abs(a[i] - a[i + 1]) < res:\r\n res = abs(a[i] - a[i + 1])\r\nfor i in range(n - 1):\r\n if abs(a[i] - a[i + 1]) == res:\r\n count += 1\r\nprint(res, count)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nm=10**10\r\nc=1\r\nx=[]\r\nfor i in range(1,n):\r\n d=l[i]-l[i-1]\r\n x.append(d)\r\n if(d<m):\r\n m=d\r\nprint(m,x.count(m))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nlk = [None] * n\r\nfor i in range(n):\r\n lk[i] = [l[i],i+1]\r\nlk.sort()\r\n\r\nd = abs(lk[1][0] - lk[0][0])\r\n\r\nfor i in range(1,n):\r\n if(d > abs(lk[i-1][0] - lk[i][0])):\r\n d = abs(lk[i-1][0] - lk[i][0])\r\n \r\ncount = 0\r\n\r\nfor i in range(1,n):\r\n if(d == abs(lk[i-1][0] - lk[i][0])):\r\n count+=1\r\n \r\nprint(d,count)", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nc = 0\r\ndif = 10e9\r\ntry:\r\n for i in range(n):\r\n dif = min(dif,abs(a[i]-a[i+1]))\r\nexcept:\r\n pass\r\ntry:\r\n for i in range(n):\r\n if abs(a[i]-a[i+1]) == dif:\r\n c+=1\r\nexcept:\r\n pass\r\nprint(dif,c)", "import sys\r\nn=int(input ())\r\na=list(map(int, input ().split()))\r\na.sort()\r\nk=sys.maxsize\r\nc=0\r\nfor I in range(1,n):\r\n if k>a[I]-a[I-1]:\r\n k=a[I]-a[I-1]\r\nfor I in range(1,n):\r\n if k==a[I]-a[I-1]:\r\n c+=1\r\nprint(k,c)", "n=int(input())\r\nls=list(map(int,input().split()))\r\nls.sort()\r\nlz=ls.copy()\r\nfor i in range(1,n):\r\n lz[i]=abs(lz[i]-ls[i-1])\r\nx=min(lz[1:])\r\nprint(x,lz[1:].count(x))", "n=int(input())\r\nA=list(map(int,input().split()))\r\nA.sort()\r\nB=[]\r\nfor i in range(n-1):\r\n B.append(abs(A[i]-A[i+1]))\r\nm=min(B)\r\nans=0\r\nfor i in range(n-1):\r\n if abs(A[i]-A[i+1])==m:\r\n ans+=1\r\nprint(m,ans)", "n = int(input())\na = sorted(int(x) for x in input().split())\nmd = 9999999999\ncnt = 0\nfor x, y in zip(a, a[1:]):\n if y-x < md:\n cnt = 1\n md = y-x\n elif y-x == md:\n cnt += 1\nprint(md, cnt)\n", "n=input()\r\nL1=input().split()\r\nL=[]\r\nfor i in L1:\r\n L.append(int(i))\r\nds=[]\r\nd=10**10\r\n\r\nL.sort()\r\n\r\nfor i1 in range(0,len(L)-1):\r\n diff=L[i1+1]-L[i1]\r\n if diff<=d:\r\n d=diff\r\n ds.append(diff)\r\n\r\n#print(ds)\r\nnum=ds.count(d)\r\nprint(d,num)", "import math\r\nn = int(input())\r\ns = input()\r\narray = []\r\nresult = set()\r\nquantity = 1\r\nfor i in s.split():\r\n array.append(int(i))\r\narray = sorted(array)\r\nfor i in range(len(array) - 1):\r\n num = abs(array[i] - array[i + 1])\r\n if len(result) != 0:\r\n if num < min(result):\r\n quantity = 1\r\n result.add(num)\r\n elif num == min(result):\r\n quantity += 1\r\n else:\r\n result.add(num)\r\nprint(min(result) , quantity)\r\n", "n = int(input())\nip = input().split(' ')\nip2 = list(map(int, ip))\nips = sorted(ip2) \ntemp = float('inf')\nmim = 0\nfor x in range(len(ips)):\n if x != len(ips) - 1:\n if abs(ips[x] - ips[x+1]) < temp:\n temp = abs(ips[x] - ips[x+1])\n mim = 1\n elif abs(ips[x] - ips[x+1]) == temp:\n mim = mim + 1\nprint(temp, mim)\n\t\t \t \t\t\t \t \t \t \t\t \t\t\t\t", "R = int(input())\r\narra = list(map(int, input().split()))\r\narra.sort()\r\nsmol = arra[1] - arra[0]\r\na = 1\r\nfor i in range(1,R-1):\r\n if smol == arra[i+1] - arra[i]: a = a + 1\r\n elif smol > arra[i+1] - arra[i]: a = 1\r\n smol = min(smol,arra[i+1] - arra[i])\r\nprint(smol,a)", "n = int(input())\r\n\r\ncoord = sorted(tuple(map(int, input().split(\" \"))))\r\n\r\nlengths = []\r\n\r\nfor i in range(n - 1):\r\n lengths.append(abs(coord[i] - coord[i + 1]))\r\n\r\nlengths.sort()\r\n\r\nprint(str(lengths[0]) + \" \" + str(lengths.count(lengths[0])))", "'''\r\n// \r\n// \r\n// \r\n// \r\n// \r\n// 792-codeforces.c\r\n// Bang Bang Bang\r\n//\r\n// Created by Mohammad Shamim on 11/5/17.\r\n// Copyright (c) 2017 Mohammad Shamim. All rights reserved. :p\r\n//\r\n'''\r\n\r\nn=int(input())\r\nnum=list(map(int,input().split(' ')))\r\nnum.sort()\r\nc=1\r\nmin_dif=num[1]-num[0]\r\nfor i in range(2,n,1):\r\n dif=num[i]-num[i-1]\r\n if min_dif>dif:\r\n min_dif=dif\r\n c=1\r\n elif min_dif==dif:\r\n c+=1\r\nprint(min_dif,c)", "n= int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nfor i in range(1, n):\r\n if i==1:\r\n min=a[i]-a[i-1]\r\n countt=1\r\n else:\r\n if a[i]-a[i-1] < min:\r\n countt=1\r\n min=a[i]-a[i-1]\r\n else:\r\n if a[i]-a[i-1] == min:\r\n countt+=1\r\nprint(min, end=\" \")\r\nprint(countt)", "import sys\r\ninput = sys.stdin.readline\r\ndef solve():\r\n n = int(input())\r\n ls = list(map(int, input().split()))\r\n ls.sort()\r\n m = 10e9\r\n cnt = 0 \r\n for i in range(1 , n ): \r\n m = min(m , abs(ls[i] - ls[i-1]))\r\n for i in range(1 , n ): \r\n if abs(ls[i] - ls[i-1]) == m : \r\n cnt += 1\r\n print(m , cnt )\r\n#for _ in range(int(input())):\r\nsolve()", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nmn = a[1] - a[0]\r\nfor i in range(1, n):\r\n if(mn > a[i] - a[i - 1]):\r\n mn = a[i] - a[i - 1]\r\nres = 0\r\nfor i in range(1, n):\r\n if(a[i] - a[i-1] == mn):\r\n res += 1\r\nprint(mn, res)\r\n" ]

[ "replacements = {\r\n \"A\":\"+BF-AFA-FB+\",\r\n \"B\":\"-AF+BFB+FA-\",\r\n \"+\":\"+\",\r\n \"-\":\"-\",\r\n \"F\":\"F\",\r\n}\r\n\r\ndef curve_sequence(n):\r\n if n==0:\r\n yield \"A\"\r\n return\r\n for t in curve_sequence(n-1):\r\n yield from replacements[t]\r\n\r\na, b = map(int, input().split())\r\n\r\ndef location(a, b):\r\n i = 0\r\n x, y = 0, 0\r\n direction = 0\r\n for move in curve_sequence(a):\r\n if i == b:\r\n return x, y\r\n \r\n if move == \"+\":\r\n direction += 1\r\n direction %= 4\r\n elif move == \"-\":\r\n direction -= 1\r\n direction %= 4\r\n \r\n if move != \"F\":\r\n continue\r\n\r\n i += 1\r\n\r\n if direction == 0:\r\n x += 1\r\n elif direction == 1:\r\n y += 1\r\n elif direction == 2:\r\n x -= 1\r\n else:\r\n y -= 1\r\n \r\n\r\nprint(*location(a, b))\r\n", "def f(n, k):\r\n if not n: return [0, 0]\r\n t = 2**(n - 1); tt = t*t\r\n p, q = f(n - 1, k % tt)\r\n x = [q, p, t + p, 2*t - 1 - q][k//tt]\r\n y = [p, t + q, t + q, t - 1 - p][k//tt]\r\n return [x, y]\r\n\r\nprint(*f(*map(int, input().split())))", "def coords(d, n):\r\n x,y = 0,0\r\n for i in range(n):\r\n sect = 2**i\r\n sx = (d>>1)&1\r\n sy = (d^sx)&1\r\n x,y = rotate(x,y,sx,sy,sect)\r\n x+=sect*sx\r\n y+=sect*sy\r\n d//=4\r\n return x,y\r\n \r\n \r\ndef rotate(x, y, sx, sy, n):\r\n if sy == 0:\r\n if sx == 1:\r\n x, y = n-1 - x, n-1 - y\r\n x,y = y,x\r\n return x,y\r\n \r\nn, d = map(int, input().split())\r\nprint(*coords(d, n))\r\n ", "def f(a, b) :\r\n\tif (b == 0) : return (0, 0)\r\n\tx, y = f(a - 1, b % (4**(a - 1)))\r\n\tif (b < 4**(a - 1)) : return (y, x)\r\n\tif (b < 2 * 4**(a - 1)) : return (x, y + 2**(a - 1))\r\n\tif (b < 3 * 4**(a - 1)) : return (x + 2**(a - 1), y + 2**(a - 1))\r\n\treturn (2**a-1-y, 2**(a-1)-1-x)\r\na, b = [int(x) for x in input().split()]\r\na, b = f(a, b)\r\nprint(int(a), int(b))" ]

[ "# Problem: D. Book of Evil\r\n# Contest: Codeforces - Codeforces Round 196 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/337/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/337/D\r\n\r\n输入 n m(1≤m≤n≤1e5) d(0≤d≤n-1) 表示一棵 n 个节点的树，其中 m 个节点有怪物，这些怪物是由一个传送门生成的，传送门与任意怪物的距离不超过 d。\r\n然后输入 m 个互不相同的数，表示怪物所在节点编号（从 1 开始）。\r\n然后输入 n-1 行，每行两个节点编号，表示树的边。\r\n\r\n输出可能存在传送门的节点的个数。注意传送门只有一个。\r\n输入\r\n6 2 3\r\n1 2\r\n1 5\r\n2 3\r\n3 4\r\n4 5\r\n5 6\r\n输出 3\r\n\"\"\"\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, m, d = RI()\r\n monsters = {v - 1 for v in RI()}\r\n g = [[] for _ in range(n)]\r\n for _ in range(n - 1):\r\n u, v = RI()\r\n u -= 1\r\n v -= 1\r\n g[u].append(v)\r\n g[v].append(u)\r\n # down1[i]代表向下走最远的怪物距离i的最大值(在当前子树上的深度)\r\n up, down1, down2 = [-inf] * n, [-inf] * n, [-inf] * n\r\n\r\n @bootstrap\r\n def dfs(u, fa):\r\n if u in monsters:\r\n down1[u] = down2[u] = up[u] = 0\r\n for v in g[u]:\r\n if v == fa: continue\r\n yield dfs(v, u)\r\n c = down1[v] + 1\r\n if c > down1[u]:\r\n down2[u] = down1[u]\r\n down1[u] = c\r\n elif c > down2[u]:\r\n down2[u] = c\r\n yield\r\n\r\n @bootstrap\r\n def reroot(u, fa):\r\n for v in g[u]:\r\n if v == fa: continue\r\n if down1[v] + 1 == down1[u]:\r\n up[v] = max(up[u], down2[u]) + 1\r\n else:\r\n up[v] = max(up[u], down1[u]) + 1\r\n yield reroot(v, u)\r\n yield\r\n\r\n dfs(0, -1)\r\n reroot(0, -1)\r\n print(sum(max(x, y) <= d for x, y in zip(down1, up)))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "from sys import stdin\n\ndef line(): return stdin.readline().strip()\ndef rd(converter): return converter(line())\ndef rl(converter, delimeter = None): return list(map(converter, line().split(delimeter)))\ndef rls(num_lines, converter): return [rd(converter) for i in range(num_lines)]\ndef rg(num_lines, converter, delimeter = None): return [rl(converter,delimeter) for i in range(num_lines)]\n\nMULTIPLE_CASES = 0\n\ndef main():\n n,m,d = rl(int)\n p = rl(int)\n e = rg(n-1,int)\n\n g = [[] for i in range(n)]\n\n for v1,v2 in e:\n g[v1-1].append(v2-1)\n g[v2-1].append(v1-1)\n\n dfs = [(p[0]-1,0)]\n s = {p[0]-1}\n ps = {pv-1 for pv in p}\n f = p[0]-1\n fd = 0\n\n while dfs:\n v,di = dfs.pop()\n if di > fd and v in ps: f,fd = v,di\n\n for nei in g[v]:\n if nei in s: continue\n s.add(nei)\n dfs.append((nei,di+1))\n\n d1 = [-1]*n\n dfs = [(f,0)]\n s = {f}\n f2 = f\n fd2 = 0\n\n while dfs:\n v,di = dfs.pop()\n d1[v] = di\n if di > fd2 and v in ps: f2,fd2 = v,di\n\n for nei in g[v]:\n if nei in s: continue\n s.add(nei)\n dfs.append((nei,di+1))\n\n d2 = [-1]*n\n dfs = [(f2,0)]\n s = {f2}\n\n while dfs:\n v,di = dfs.pop()\n d2[v] = di\n\n for nei in g[v]:\n if nei in s: continue\n s.add(nei)\n dfs.append((nei,di+1))\n\n print(sum(max(d1v,d2v) <= d for d1v,d2v in zip(d1,d2)))\n\nfor i in range(rd(int) if MULTIPLE_CASES else 1): main()", "# Problem: D. Book of Evil\r\n# Contest: Codeforces - Codeforces Round 196 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/337/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache\r\nfrom types import GeneratorType\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/337/D\r\n\r\n输入 n m(1≤m≤n≤1e5) d(0≤d≤n-1) 表示一棵 n 个节点的树，其中 m 个节点有怪物，这些怪物是由一个传送门生成的，传送门与任意怪物的距离不超过 d。\r\n然后输入 m 个互不相同的数，表示怪物所在节点编号（从 1 开始）。\r\n然后输入 n-1 行，每行两个节点编号，表示树的边。\r\n\r\n输出可能存在传送门的节点的个数。注意传送门只有一个。\r\n输入\r\n6 2 3\r\n1 2\r\n1 5\r\n2 3\r\n3 4\r\n4 5\r\n5 6\r\n输出 3\r\n\"\"\"\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n\r\n# 1246 ms\r\ndef solve1():\r\n n, m, d = RI()\r\n monsters = {v - 1 for v in RI()}\r\n g = [[] for _ in range(n)]\r\n for _ in range(n - 1):\r\n u, v = RI()\r\n u -= 1\r\n v -= 1\r\n g[u].append(v)\r\n g[v].append(u)\r\n # down1[i]代表向下走最远的怪物距离i的最大值(在当前子树上的深度)\r\n up, down1, down2 = [-inf] * n, [-inf] * n, [-inf] * n\r\n\r\n @bootstrap\r\n def dfs(u, fa):\r\n if u in monsters:\r\n down1[u] = down2[u] = up[u] = 0\r\n for v in g[u]:\r\n if v == fa: continue\r\n yield dfs(v, u)\r\n c = down1[v] + 1\r\n if c > down1[u]:\r\n down2[u], down1[u] = down1[u], c\r\n elif c > down2[u]:\r\n down2[u] = c\r\n yield\r\n\r\n @bootstrap\r\n def reroot(u, fa):\r\n for v in g[u]:\r\n if v == fa: continue\r\n if down1[v] + 1 == down1[u]: # 当前子节点v在父节点u的最长路径上，走次大路径\r\n up[v] = max(up[u], down2[u]) + 1\r\n else:\r\n up[v] = max(up[u], down1[u]) + 1\r\n yield reroot(v, u)\r\n yield\r\n\r\n dfs(0, -1)\r\n reroot(0, -1)\r\n print(sum(max(x, y) <= d for x, y in zip(down1, up)))\r\n\r\n\r\n# ms\r\ndef solve():\r\n from typing import Callable, Generic, List, TypeVar\r\n\r\n T = TypeVar(\"T\")\r\n E = Callable[[int], T]\r\n \"\"\"identify element of op, and answer of leaf\"\"\"\r\n Op = Callable[[T, T], T]\r\n \"\"\"merge value of child node\"\"\"\r\n Composition = Callable[[T, int, int, int], T]\r\n \"\"\"return value from child node to parent node\"\"\"\r\n\r\n class Rerooting(Generic[T]):\r\n __slots__ = (\"g\", \"_n\", \"_decrement\", \"_root\", \"_parent\", \"_order\")\r\n\r\n def __init__(self, n: int, decrement: int = 0, edges=None):\r\n \"\"\"\r\n n: 节点个数\r\n decrement: 节点id可能需要偏移 (1-indexed则-1, 0-indexed则0)\r\n \"\"\"\r\n self.g = g = [[] for _ in range(n)]\r\n self._n = n\r\n self._decrement = decrement\r\n self._root = None # 一开始的根\r\n if edges:\r\n for u, v in edges:\r\n u -= decrement\r\n v -= decrement\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\n def add_edge(self, u: int, v: int):\r\n \"\"\"\r\n 无向树加边\r\n \"\"\"\r\n u -= self._decrement\r\n v -= self._decrement\r\n self.g[u].append(v)\r\n self.g[v].append(u)\r\n\r\n def rerooting(\r\n self, e: E[\"T\"], op: Op[\"T\"], composition: Composition[\"T\"], root=0\r\n ) -> List[\"T\"]:\r\n \"\"\"\r\n - e: 初始化每个节点的价值\r\n (root) -> res\r\n mergeの単位元\r\n 例:求最长路径 e=0\r\n\r\n - op: 两个子树答案如何组合或取舍\r\n (childRes1,childRes2) -> newRes\r\n 例:求最长路径 return max(childRes1,childRes2)\r\n\r\n - composition: 知道子子树答案和节点值，如何更新子树答案\r\n (from_res,fa,u,use_fa) -> new_res\r\n use_fa: 0表示用u更新fa的dp1,1表示用fa更新u的dp2\r\n 例:最长路径return from_res+1\r\n\r\n - root: 可能要设置初始根，默认是0\r\n <概要> 换根DP模板,用线性时间获取以每个节点为根整颗树的情况。\r\n 注意最终返回的dp[u]代表以u为根时，u的所有子树的最优情况(不包括u节点本身),因此如果要整颗子树情况，还要再额外计算。\r\n 1. 记录dp1,dp2。其中:\r\n dp1[u] 代表 以u为根的子树，它的孩子子树的最优值,即u节点本身不参与计算。注意，和我们一般定义的f[u]代表以u为根的子树2情况不同。\r\n dp2[v] 代表 除了v以外，它的兄弟子树的最优值。依然注意，v不参与，同时u也不参与(u是v的父节点)。\r\n 建议画图理解。\r\n 2. dp2[v]的含义后边将进行一次变动,变更为v的兄弟、u的父过来的路径,merge上u节点本身最后得出来的值。即v以父亲为邻居向外延伸的最优值(不含v，但含父)。\r\n 3. 同时dp1[u]的含义更新为目标的含义:以u为根，u的子节点们所在子树的最优情况。\r\n 4. 这样dp1,dp2将分别代表u的向下子树的最优,u除了向下子树以外的最优(一定从父节点来，但父节点可能从兄弟来或祖宗来)\r\n <步骤>\r\n 1. 先从任意root出发(一般是0),获取bfs层序。这里是为了方便dp，或者直接dfs树形DP其实也是可以的，但可能会爆栈。\r\n 2. 自底向上dp,用自身子树情况更新dp1,除自己外的兄弟子树情况更新dp2。\r\n 3. 自顶向下dp,变更dp2和dp1的含义。这时对于u来说存在三种子树(强烈建议画图观察):\r\n ① u本身的子树，它们的最优解已经存在于之前的dp1[u]。\r\n ② u的兄弟子树+fa,它们的最优解=composition(dp2[u],fa,u,use_fa=1)。\r\n ③ 连接到fa的最优子树+fa,最优解=composition(dp2[fa],fa,u,use_fa=1)。\r\n 注意这里的dp2含义已变更，由于我们是自顶向下计算，因此dp2[fa]已更新。\r\n ②和③可以写一起来更新dp2[u]\r\n\r\n 計算量 O(|V|) (Vは頂点数)\r\n 参照 https://qiita.com/keymoon/items/2a52f1b0fb7ef67fb89e\r\n \"\"\"\r\n # step1\r\n root -= self._decrement\r\n assert 0 <= root < self._n\r\n self._root = root\r\n g = self.g\r\n _fas = self._parent = [-1] * self._n # 记录每个节点的父节点\r\n _order = self._order = [root] # bfs记录遍历层序，便于后续dp\r\n q = deque([root])\r\n while q:\r\n u = q.popleft()\r\n for v in g[u]:\r\n if v == _fas[u]:\r\n continue\r\n _fas[v] = u\r\n _order.append(v)\r\n q.append(v)\r\n\r\n # step2\r\n dp1 = [e(i) for i in range(self._n)] # !子树部分的dp值,假设u是当前子树的根，vs是第一层儿子(它的非父邻居)，则dp1[u]=op(dp1(vs))\r\n dp2 = [e(i) for i in\r\n range(\r\n self._n)] # !非子树部分的dp值,假设u是当前子树的根，vs={v1,v2..vi..}是第一层儿子(它的非父邻居),则dp2[vi]=op(dp1(vs-vi)),即他的兄弟们\r\n\r\n for u in _order[::-1]: # 从下往上拓扑序dp\r\n res = e(u)\r\n for v in g[u]:\r\n if _fas[u] == v:\r\n continue\r\n dp2[v] = res\r\n res = op(res, composition(dp1[v], u, v, 0)) # op从下往上更新dp1\r\n # 由于最大可能在后边，因此还得倒序来一遍\r\n res = e(u)\r\n for v in g[u][::-1]:\r\n if _fas[u] == v:\r\n continue\r\n dp2[v] = op(res, dp2[v])\r\n res = op(res, composition(dp1[v], u, v, 0))\r\n dp1[u] = res\r\n\r\n # step3 自顶向下计算每个节点作为根时的dp1，dp2的含义变更为:dp2[u]为u的兄弟+父。这样对v来说dp1[u] = op(dp1[fa],dp1[u])\r\n\r\n for u in _order[1:]:\r\n fa = _fas[u]\r\n dp2[u] = composition(\r\n op(dp2[u], dp2[fa]), fa, u, 1\r\n ) # op从上往下更新dp2\r\n dp1[u] = op(dp1[u], dp2[u])\r\n\r\n return dp1\r\n\r\n def e(root: int) -> int:\r\n # 转移时单个点不管相邻子树的贡献\r\n # 例:最も遠い点までの距離を求める場合 e=0\r\n return 0 if root in monsters else -inf\r\n\r\n def op(child_res1: int, child_res2: int) -> int:\r\n # 如何组合/取舍两个子树的答案\r\n # 例：求最长路径 return max(childRes1,childRes2)\r\n return max(child_res1, child_res2)\r\n\r\n def composition(from_res: int, fa: int, u: int, use_fa: int = 0) -> int:\r\n # 知道子树的每个子树和节点值，如何更新子树答案;\r\n # 例子:求最长路径 return from_res+1\r\n if use_fa == 0: # cur -> parent\r\n return from_res + 1\r\n return from_res + 1\r\n\r\n n, m, d = RI()\r\n r = Rerooting(n)\r\n monsters = {v - 1 for v in RI()}\r\n g = [[] for _ in range(n)]\r\n for _ in range(n - 1):\r\n u, v = RI()\r\n u -= 1\r\n v -= 1\r\n r.add_edge(u, v)\r\n\r\n print(sum(x <= d for x in r.rerooting(e, op, composition)))\r\n\r\n\r\n# 716 ms\r\ndef solve2():\r\n n, m, d = RI()\r\n monsters = {v - 1 for v in RI()}\r\n g = [[] for _ in range(n)]\r\n for _ in range(n - 1):\r\n u, v = RI()\r\n u -= 1\r\n v -= 1\r\n g[u].append(v)\r\n g[v].append(u)\r\n # down1[i]代表向下走最远的怪物距离i的最大值(在当前子树上的深度)\r\n up, down1, down2 = [-inf] * n, [-inf] * n, [-inf] * n\r\n fas = [-1] * n\r\n order = []\r\n q = deque([0])\r\n while q:\r\n u = q.popleft()\r\n order.append(u)\r\n for v in g[u]:\r\n if v == fas[u]: continue\r\n fas[v] = u\r\n q.append(v)\r\n for u in order[::-1]:\r\n if u in monsters: up[u] = down1[u] = down2[u] = 0\r\n for v in g[u]:\r\n if v == fas[u]: continue\r\n c = down1[v] + 1\r\n if c > down1[u]:\r\n down1[u], down2[u] = c, down1[u]\r\n elif c > down2[u]:\r\n down2[u] = c\r\n for u in order:\r\n for v in g[u]:\r\n if v == fas[u]: continue\r\n if down1[v] + 1 == down1[u]:\r\n up[v] = max(up[u], down2[u]) + 1\r\n else:\r\n up[v] = max(up[u], down1[u]) + 1\r\n\r\n print(sum(max(x, y) <= d for x, y in zip(down1, up)))\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n" ]

[ "import io, os\r\ninput=io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn=int(input())\r\nw=[int(k) for k in input().decode('utf-8').split()]\r\neta=[1]\r\niota=[0 for j in range(n)]\r\nc=n-1\r\nfor j in range(n-1):\r\n iota[w[j]-1]=1\r\n while iota[c]==1:\r\n c-=1\r\n eta.append(j+1-(n-1-c)+1)\r\neta.append(1)\r\nprint(\" \".join([str(k) for k in eta]))", "import sys\r\nimport math\r\nfrom bisect import bisect_right as br\r\nfrom collections import deque\r\n#from decimal import Decimal\r\n\r\n#from statistics import mode\r\n\r\nfrom itertools import combinations as cb\r\n\r\n\r\ndef int_arr(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef str_arr(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\n\r\n# sys.stdin = open('Sorting the Coins/input.txt', 'r')\r\n# sys.stdout = open('Sorting the Coins/output.txt', 'w')\r\n\r\nn = int(input())\r\narr = int_arr()\r\ns = set()\r\nx = n+1\r\nsm = 0\r\nprint(1, end=' ')\r\n\r\nfor i in range(n):\r\n sm += 1\r\n s.add(arr[i])\r\n while x-1 in s:\r\n x -= 1\r\n sm -= 1\r\n print(sm+1, end=' ')\r\n", "n = int(input())\nA = list(map(int, input().split()))\n\nres = [1]\nR = set()\nr = n\n\nfor i, a in enumerate(A):\n R.add(a)\n if a == r:\n x = 0\n while (r-x-1) in R:\n x += 1\n r -= x+1\n res.append(res[i]-x)\n else:\n res.append(res[i]+1)\nprint(' '.join(map(str, res)))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=n\r\niss=set()\r\nans=[1]\r\nout=1\r\nfor i in range(n) :\r\n if l[i]==p :\r\n p-=1\r\n while p in iss :\r\n p-=1\r\n out-=1\r\n ans.append(out)\r\n else :\r\n iss.add(l[i])\r\n out+=1\r\n ans.append(out)\r\nprint(*ans)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "#!/usr/bin/env python3\n\nn = int(input())\nP = [int(p)-1 for p in input().split()]\nO = [False]*n\nX = n-1\nH = [1]\nfor i in range(len(P)-1):\n O[P[i]] = True\n while X>0 and O[X]:\n X -= 1\n H.append(1 + i+1 - (n-1-X))\nH.append(1)\nprint(' '.join(map(str,H)))\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nprint(1,end = \" \")\r\nptr = n-1\r\nv = [0]*n\r\nfor i in range(n):\r\n v[l[i]-1] = 1\r\n while(ptr>=0 and v[ptr]==1):ptr-=1\r\n print(i+1-(n-1-ptr)+1,end = \" \")", "n = int(input())\r\npositions = list(map(int, input().split()))\r\n\r\nhardness = [1] * (n + 2)\r\ncoin_swapped = [0] * (n + 2)\r\nsteps = 0\r\ncoins = n\r\n\r\nfor i in range(1, n + 1):\r\n coin_swapped[positions[i - 1]] = 1\r\n steps += 1\r\n while coins > 0 and coin_swapped[coins] == 1:\r\n coins -= 1\r\n steps -= 1\r\n hardness[i] = steps + 1\r\n\r\nfor i in range(n + 1):\r\n print(hardness[i], end=\" \")", "n=int(input())\r\na=[0]*n\r\np=list(map(lambda x:int(x)-1,input().split()))\r\nprint(1,end=' ')\r\nx=n-1\r\nfor i in range(n-1):\r\n a[p[i]]=1\r\n if p[i]==x:\r\n while a[x]:\r\n x-=1\r\n print(i-n+x+3,end=' ')\r\nprint(1)\r\n \r\n", "'''\r\nbasiccallu jistne conse pairs\r\n'''\r\n\r\ndef f(n,a):\r\n a=list(map(lambda s:s-1,a))\r\n ar=[0]*(n+1)\r\n l=0\r\n ans=[1]\r\n hi=(n-1)\r\n cnt=0\r\n for i in a:\r\n if i==hi:\r\n ar[i]=1\r\n hi-=1\r\n # print(hi)\r\n while ar[hi]==1:\r\n hi-=1\r\n cnt-=1\r\n else:\r\n ar[i]=1\r\n cnt+=1\r\n ans.append(cnt+1)\r\n return ans\r\na=int(input())\r\nls=list(map(int,input().strip().split()))\r\nprint(*f(a,ls))", "n=int(input())\r\na=[0]*n\r\np=list(map(int,input().split()))\r\ntmp=n-1\r\nans=['1']\r\ncurr=1\r\nfor i in range(n):\r\n a[p[i]-1]=1\r\n if p[i]-1==tmp:\r\n tmp-=1\r\n while tmp>=0 and a[tmp]==1:\r\n tmp-=1\r\n curr-=1\r\n else:\r\n curr+=1\r\n ans.append(str(curr))\r\nprint(' '.join(ans))", "n = int(input())\n\np = [int(x) for x in input().split()]\n\nmx = n\n\na = [0]*(n+1)\n\nans = [1]\n\nfor i in range(0, n):\n\n t = p[i]\n\n a[t] = 1\n\n while a[mx]==1 and mx>=1: mx-=1\n\n ans.append(i+1-(n-mx)+1)\n\nprint(' '.join(map(str, ans)))\n\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nj = n-1\r\nans = [1]*(n+1)\r\nmark = [0]*(n)\r\n\r\nfor i in range(n-1):\r\n \r\n mark[a[i]-1] = 1\r\n \r\n if a[i]-1 == j:\r\n while(j >-1 and mark[j] == 1):\r\n j -= 1\r\n\r\n ans[i+1] += (i+1) - (n-j-1)\r\n \r\nprint(*ans)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nprint (1,end=' ')\r\nl1=[]\r\nend=n-1\r\nfor i in range(n):\r\n l1.append(0)\r\nans=1\r\nfor i in range(n-1):\r\n l1[l[i]-1]=1\r\n if (l[i]-1!=end):\r\n ans+=1\r\n print (ans,end=\" \")\r\n else:\r\n for j in range(l[i]-2,-1,-1):\r\n if (l1[j]!=1):\r\n ans-=(end-j-1)\r\n end=j\r\n break\r\n print (ans,end=\" \")\r\nprint (1)", "n = int(input())\r\nx = [0]*n\r\na = 0\r\np = list(map(int, input().split()))\r\nz = n-1\r\nans = ['1']\r\nfor i in range(n):\r\n x[p[i]-1] = 1\r\n a += 1\r\n while z> -1 and x[z] == 1:\r\n z-=1\r\n a-=1\r\n ans.append(str(a+1))\r\nprint(' '.join(ans))", "n = int(input())\r\np=[0]*n\r\np=input().split()\r\nfor i in range (n):\r\n p[i]=int(p[i])\r\nmx = n\r\na = [0]*(n+1)\r\nans = [1]\r\nfor i in range(0, n):\r\n t = p[i]\r\n a[t] = 1\r\n while a[mx]==1 and mx>=1:\r\n mx-=1\r\n ans.append(i+1-(n-mx)+1)\r\nprint(' '.join(map(str, ans)))", "coinCount = int(input())\ncoins = [0] * coinCount\noperations = list(map(int, input().split()))[:coinCount]\nnumberOfReplacedCoins = 0\nindexOfLastOldCoin = coinCount - 1\nresults = [1]\nfor op in operations:\n\tindex = op - 1\n\t\n\tif coins[index] == 0:\n\t\tcoins[index] = 1\n\t\tnumberOfReplacedCoins += 1\n\n\tif numberOfReplacedCoins == coinCount:\n\t\tindexOfLastOldCoin = -1\n\n\twhile indexOfLastOldCoin >= 0 and coins[indexOfLastOldCoin] == 1:\n\t\tindexOfLastOldCoin -= 1\n\n\tcoinsAtRightEdge = coinCount - indexOfLastOldCoin - 1\n\thardness = 1 + numberOfReplacedCoins - coinsAtRightEdge\n\t\n\tresults.append(hardness)\n\nprint(\" \".join(map(str, results)))\n", "n = int(input())\r\ninput_ = list(map(int, input().split()))\r\npos = n\r\na = [0 for i in range(n+1)]\r\nres = 1\r\nans = [1]\r\nfor x in input_:\r\n a[x] = 1\r\n res += 1\r\n while a[pos]==1:\r\n pos -= 1\r\n res -= 1\r\n ans.append(res)\r\nprint(' '.join(map(str, ans)))", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\ntf = [0 for i in range(n+1)]\r\nptr=n\r\nfg=[1]\r\nfor i in range(1,n+1):\r\n val = l[i-1]\r\n tf[val]+=1\r\n \r\n while(tf[ptr]==1):\r\n ptr-=1\r\n \r\n fg.append((i+1)-(n-ptr))\r\n \r\nprint(*fg)", "n = int(input())\na = [int(i) for i in input().split()]\nlast = n\ncount = 1\nstate = [1 for i in range(n+1)]\nb=['1']\nfor i in a:\n\tif i<=n:\n\t\tstate[i]=0\n\t\tcount+=1\n\tif i==n:\n\t\twhile state[n]==0:\n\t\t\tcount-=1\n\t\t\tn-=1\n\tb.append(str(count))\nprint(\" \".join(b))\n \n", "\r\n\"\"\"\r\n\r\n\"\"\"\r\n\r\nimport sys\r\nfrom sys import stdin\r\n\r\nn = int(stdin.readline())\r\n\r\np = list(map(int,stdin.readline().split()))\r\n\r\nANS = [1]\r\n\r\nput = [False] * n\r\nstable = n\r\n\r\nfor i in range(n):\r\n\r\n p[i] -= 1\r\n put[p[i]] = True\r\n\r\n while stable != 0 and put[stable-1] == True:\r\n stable -= 1\r\n\r\n ANS.append( i+1 - (n-stable) + 1 )\r\n \r\n\r\nprint (\" \".join(map(str,ANS)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nflag = [1]*n\r\nr = n-1\r\ncnt = 0\r\n\r\nprint(1, end=' ')\r\n\r\nfor i in range(n-1):\r\n flag[p[i]-1] = 0\r\n \r\n while flag[r]==0:\r\n r -= 1\r\n cnt += 1\r\n \r\n print(i+2-cnt, end=' ')\r\n\r\nprint(1)", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\n\r\n\r\n\r\ndef process(P):\r\n answer = [1]\r\n curr = [0 for i in range(n+1)]\r\n final_block = n+1\r\n coin_count = 0\r\n for x in P:\r\n coin_count+=1\r\n curr[x] = 1\r\n while final_block > 0 and curr[final_block-1]==1:\r\n final_block-=1\r\n answer.append(coin_count-(n+1-final_block)+1)\r\n answer= ' '.join(map(str, answer))\r\n sys.stdout.write(f'{answer}\\n')\r\n return\r\n\r\nn = int(input())\r\nP = [int(x) for x in input().split()]\r\nprocess(P)", "n = int(input())\r\na = list(map(int, input().split()))\r\np = [0] * (n + 1)\r\nans = [1] * (n + 1)\r\nind = n\r\nfor i in range(n):\r\n p[a[i] - 1] = 1\r\n while ind > 0 and p[ind - 1] == 1:\r\n ind -= 1\r\n ans[i + 1] = 1 + (i + 1) - (n - ind)\r\nprint(' '.join(map(str, ans)))", "import sys\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\nn = int(input())\nans = [0 for _ in range(n + 1)]\nans[0] = 1\nans[-1] = 1\nsample = [0 for _ in range(n)]\nlast = n - 1\nq = list(map(int, input().split()))\nfor i in range(n - 1):\n\tx = q[i]\n\tsample[x-1] = 1\n\tif x - 1 == last:\n\t\twhile sample[x-1] != 0:\n\t\t\tx -= 1\n\t\tlast = x - 1\n\ttarget = n - i - 2\n\t#print(last, target)\n\tans[i + 1] = last - target + 1\nprint(*ans)\n\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=[0]*n\r\nidx=n\r\nans=[1]\r\nfor i,j in enumerate(l):\r\n s[j-1]=1\r\n if j==idx:\r\n while idx>0 and s[idx-1]==1:\r\n idx-=1\r\n ans+=[2+i+idx-n]\r\nprint(\" \".join(map(str,ans)))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\npos = n\r\na = [0 for i in range(n+1)]\r\nres = 1\r\nans = [1]\r\nfor x in arr:\r\n a[x] = 1\r\n res = res + 1\r\n while a[pos] == 1:\r\n pos = pos - 1\r\n res = res - 1\r\n ans.append(res)\r\nprint(' '.join(map(str, ans)))", "n = int(input())\r\np = map(int, input().split())\r\nresult = [1]\r\noccupied = [False for _ in range(n+1)]\r\nlast = n\r\nfor i in p:\r\n occupied[i] = True\r\n newResult = result[-1] + 1\r\n while occupied[last]:\r\n last -= 1\r\n newResult -= 1\r\n result.append(newResult)\r\nprint(*result, sep=' ')\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nx = n\r\nprint(1, end=' ')\r\nf = [0]*(n+1)\r\nc = 1\r\nfor i in w:\r\n if i == x:\r\n x -= 1\r\n while f[x] == 1:\r\n c -= 1\r\n x -= 1\r\n else:\r\n f[i] = 1\r\n c += 1\r\n print(c, end=' ')", "n=int(input())\nl=list(map(int,input().split()))\ns=[0]*n\nidx=n\nans=[1]\nfor i,j in enumerate(l):\n s[j-1]=1\n if j==idx:\n while idx>0 and s[idx-1]==1:\n idx-=1\n ans+=[2+i+idx-n]\nprint(\" \".join(map(str,ans)))\n\n", "n = int(input())\narr = list(map(int, input().split()))\nar2 = [False] * (n+2)\nar2[-1] = True\nres = [1]\nacc = 1\nptr = n\nfor e in arr:\n ar2[e] = True\n acc += 1\n while ar2[ptr]:\n ptr -= 1 \n res.append(acc - (n-ptr))\nprint(*res)\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 q = list(map(int, input().split()))\r\n d = [0 for i in range(n + 1)]\r\n d[-1] = 1\r\n\r\n ans = 1\r\n left = n\r\n print(1, end=\" \")\r\n\r\n for i in range(n):\r\n k = q[i] - 1\r\n d[k] = 1\r\n if k == left - 1:\r\n for j in range(left - 1, -1, -1):\r\n if d[j] == 1:\r\n left -= 1\r\n ans -= 1\r\n else:\r\n break\r\n\r\n ans += 1\r\n\r\n print(ans,end=\" \")\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())\r\np = list(map(int, input().split()))\r\n\r\nlp = n+1\r\nans = [1]\r\nvis = [0 for i in range(n)]\r\nans = [1]\r\ntop = n\r\nhardness = 1\r\nfor i in range(len(p)):\r\n vis[p[i]-1] = 1\r\n hardness += 1\r\n while vis[top-1] == 1 and top > 0:\r\n top -= 1\r\n hardness -=1\r\n ans.append(hardness)\r\n \r\nprint(' '.join([str(i) for i in ans]))", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nvalues = list(map(int, stdin.readline().split()))\r\nused = [0 for i in range(n)]\r\nright, cnt = n, 0\r\nans = 1\r\n\r\nstdout.write(str(ans) + ' ')\r\n\r\nfor v in values:\r\n used[v - 1] = 1\r\n ans += 1\r\n \r\n while right and used[right - 1]:\r\n ans -= 1\r\n right -= 1\r\n \r\n stdout.write(str(ans) + ' ')", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nans = [1]\r\nflag = [0]*(N+1)\r\ncur = N\r\ncnt=0\r\nfor a in A:\r\n flag[a]=1\r\n cnt += 1\r\n while flag[cur]:\r\n cur-=1\r\n cnt-=1\r\n ans.append(cnt+1)\r\n \r\nprint(*ans)\r\n " ]

[ "'''\r\nhttps://codeforc.es/contest/543/problem/C\r\n题意：“好记”字符串组：每个字符串都包含一个相对其他字符相同位置的唯一字符，\r\n给出修改每个位置字符需要的硬币数，求使得给定字符串组“好记”需要的最少硬币。\r\nf[mask]表示每一行的选择状态为mask时的解\r\n对于第j列、任意状态mask，枚举其选择的第一行（二进制中的最低位lowbit）的选择：\r\n1.将第low行修改为不存在于第j列中的一个字母，子问题为f[mask^(1<<low)]，即将mask中第low行取消选择\r\n2.修改与第low行（第j列）值相同的其他行\r\n'''\r\nI=input;R,G=lambda:map(int,I().split()),range;n,m=R();s=[I()for _ in G(n)]\r\na=[[*R()]for _ in G(n)];N=1<<n;f=[float('inf')]*(N);f[0]=0\r\nc=[[0]*m for _ in G(n)];sv=[[0]*m for _ in G(n)]\r\nfor i in G(n):\r\n for j in G(m):\r\n mx=0\r\n for k in G(n):\r\n if s[i][j]==s[k][j]:sv[i][j]|=1<<k;c[i][j]+=a[k][j];mx=max(mx,a[k][j])\r\n c[i][j]-=mx\r\nfor mask in G(1,N):\r\n lowbit=-1\r\n for i in G(n):\r\n if mask&(1<<i):lowbit=i;break\r\n for j in G(m):\r\n f[mask]=min(f[mask],f[mask^(1<<lowbit)]+a[lowbit][j])\r\n f[mask]=min(f[mask],f[mask&(mask^sv[lowbit][j])]+c[lowbit][j])\r\nprint(f[N-1])", "I=input;R,G=lambda:map(int,I().split()),range;n,m=R();s=[I()for _ in G(n)]\r\na=[[*R()]for _ in G(n)];N=1<<n;f=[float('inf')]*(N);f[0]=0\r\nc=[[0]*m for _ in G(n)];sv=[[0]*m for _ in G(n)]\r\nfor i in G(n):\r\n for j in G(m):\r\n v=0\r\n for k in G(n):\r\n if s[i][j]==s[k][j]:sv[i][j]|=(1<<k);c[i][j]+=a[k][j];v=max(v,a[k][j])\r\n c[i][j]-=v\r\nfor i in G(1,N):\r\n lowbit=-1\r\n for j in G(n):\r\n if i&(1<<j):lowbit=j;break\r\n for j in G(m):\r\n f[i]=min(f[i],f[i&(i^sv[lowbit][j])]+c[lowbit][j],f[i^(1<<lowbit)]+a[lowbit][j])\r\nprint(f[N-1])" ]

[ "a = input()\r\nb = input()\r\ncnt1 = a.count('1') + (a.count('1') % 2 == 1)\r\ncnt2 = b.count('1')\r\nprint('YES'if cnt1 >= cnt2 else'NO')\r\n", "a = input()\r\nb = input() # ris finale\r\nif a == b:\r\n print(\"YES\")\r\nelse:\r\n a1 = a.count(\"1\")\r\n b1 = b.count(\"1\")\r\n if a1 % 2 == 1:\r\n a1 += 1\r\n if a1 >= b1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def maxConsecutive(a):\r\n i = 1\r\n curr = 0\r\n if a[0] == '1':\r\n curr += 1\r\n ans = curr\r\n for i in range(len(a)):\r\n if a[i] == '1':\r\n curr += 1\r\n else:\r\n curr = 1\r\n ans = max(ans, curr)\r\n return ans\r\n\r\ndef countOne(a):\r\n ans = 0\r\n for i in range(len(a)):\r\n if a[i] == '1':\r\n ans += 1\r\n return ans\r\n\r\na = input()\r\nb = input()\r\nif countOne(a) + countOne(a)%2 >= countOne(b):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n# 101101\r\n# 01111", "a=input()\r\nb=input()\r\na1=a.count('1')\r\na1+=a1&1\r\nif(a1>=b.count('1')):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "from sys import stdin\nfrom collections import defaultdict, deque, Counter\nfrom math import floor, ceil, log, inf, sqrt\nfrom heapq import *\nfrom functools import lru_cache\nfrom bisect import bisect_left, bisect_right\nimport itertools\nimport random\nfrom string import ascii_lowercase\n\nA = stdin.readline().strip()\nB = stdin.readline().strip()\nA1s = A.count(\"1\")\nB1s = B.count(\"1\")\n\nif B1s == 0:\n print(\"YES\")\n quit()\n\nif A1s == 0:\n print(\"NO\" if B1s != 0 else \"YES\")\n quit()\n\nif A1s%2 == 0:\n if B1s > A1s:\n print(\"NO\")\n quit()\n\n print(\"YES\")\n quit()\nelse:\n if B1s > A1s + 1:\n print(\"NO\")\n quit()\n\n print(\"YES\")\n quit()\n\n\t \t \t \t\t\t\t\t\t\t \t \t\t \t\t\t\t\t \t\t", "a=input()\r\nprint('YES'if a.count('1')+(a.count('1')&1)>=input().count('1')else'NO')", "def yesOrNo(a,b):\n x = a.count('1')\n y = b.count('1')\n if x%2 == 1:\n x+=1\n if x < y:\n return \"NO\"\n else:\n return \"YES\"\na = input()\nb = input()\nprint(yesOrNo(a,b))\n", "a = input()\r\nb = input()\r\nx = a.count('1')\r\nx = x + x%2\r\nx -= b.count('1')\r\nprint(\"NO\" if x < 0 else \"YES\")", "a,b=input(),input()\r\nca,cb=a.count('1'),b.count('1')\r\nprint('YES' if ca+(ca&1)>=cb else 'NO')", "from functools import reduce\nA = list(input())\nB = list(input())\n\nnumA = reduce(lambda x,y: x+y, map(int, A))\nnumB = reduce(lambda x,y: x+y, map(int, B))\n\nif numA + (numA & 1) >= numB:\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", "a=input()\nb=input()\n\nacount=a.count('1')\nbcount=b.count('1')\n\nif (acount % 2 == 1):\n\tacount += 1\n\nif (acount >= bcount):\n\tprint('YES')\nelse:\n\tprint('NO')", "a = (input().count('1') + 1) // 2\r\nb = (input().count('1') + 1) // 2\r\nprint('YES' if a >= b else 'NO')", "a=input()\nb=input()\ntot1=0\ntot2=0\nfor i in a:\n\ttot1+=int(i)\nfor i in b:\n\ttot2+=int(i)\nif tot1+tot1%2>=tot2:\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "def count(s):\r\n cnt = 0\r\n for c in s:\r\n if c == '1':\r\n cnt += 1\r\n return cnt\r\na = count(input())\r\nb = count(input())\r\nif a % 2 == 1:\r\n a += 1\r\nif a >= b:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def main():\n a, b = (input().count('1') for _ in \"ab\")\n print((\"NO\", \"YES\")[a + (a & 1) >= b])\n\n\nif __name__ == '__main__':\n main()\n", "ax, bx = 0, 0\r\nfor c in input():\r\n if c == '1':\r\n ax += 1\r\nfor c in input():\r\n if c == '1':\r\n bx += 1\r\nprint(\"YES\" if bx <= ax + ax % 2 else \"NO\")", "a=input()\r\nb=input()\r\np=a.count('1')\r\nq=b.count('1')\r\nif(p%2==1):\r\n p+=1\r\nif(p>=q):\r\n print(\"YES\")\r\nelse:\r\n print('NO')", "a = input()\nb = input()\n\nprint('YES' if b.count('1') <= a.count('1') + (a.count('1') & 1) else 'NO')\n", "a=sum(map(int,list(input())))\r\nif a+a%2>=sum(map(int,list(input()))):\r\n print('YES')\r\nelse:\r\n print('NO')", "a = input()\r\nb = input()\r\nc = a.count(\"1\")\r\nd = b.count(\"1\")\r\nif(c+(c&1) >=d):\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "a, b = input(), input()\r\nax = sum([ord(c) - ord('0') for c in a])\r\nbx = sum([ord(c) - ord('0') for c in b])\r\nprint(\"YES\" if bx <= ax + ax % 2 else \"NO\")", "alice = input()\nbob = input()\n\na = alice.count('1') \nb = bob.count('1')\na += (a%2) # if it is odd, then add another one.\n\nprint(\"YES\" if a >= b else \"NO\")\n\n", "s1=input()\r\ns2=input()\r\na1=s1.count('1')\r\na1+=(a1)%2\r\nif a1>=s2.count('1'):print(\"YES\")\r\nelse:print(\"NO\")\r\n", "s=input()\r\nt=input()\r\na=s.count('1')\r\nb=t.count('1')\r\nif a%2==0:\r\n if b<=a:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n if b<=a+1:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\") ", "a = input().rstrip()\r\nb = input().rstrip()\r\ncnta = 0\r\ncntb = 0\r\nfor i in a:\r\n if i == \"1\":\r\n cnta += 1\r\nfor i in b:\r\n if i == \"1\":\r\n cntb += 1\r\nif cntb - cnta > 1 or (cntb - cnta == 1 and cnta % 2 == 0):\r\n print(\"NO\")\r\n exit()\r\nelse:\r\n print(\"YES\")", "A = list(input())\r\nB = list(input())\r\n\r\nzA = A.count('1')\r\nzA += zA & 1\r\n\r\nif zA >= B.count('1'):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = input().count('1')\r\nm = input().count('1')\r\nprint ('YNEOS'[n + (n & 1) < m::2])\r\n", "a, b = input(), input()\r\nca = a.count('1')\r\ncb = b.count('1')\r\nif ca + ca % 2 >= cb:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=input()\r\nb=input()\r\na1,b1=a.count(\"1\"),b.count(\"1\")\r\na1+=a1%2\r\nif a1>=b1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "s=input()\r\nl=input()\r\nif((s.count('1')+s.count('1')%2)>=l.count('1')):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n" ]

[ "INF = (1 << 62)\r\nN = 200005\r\nMOD = 1000000007\r\n\r\nflips = [[INF] * N for _ in range(2)]\r\nflip_intervals = [0] * N\r\ncooking_time, num_intervals = 0, 0\r\n\r\ndef solve():\r\n global cooking_time, num_intervals\r\n for i in range(N):\r\n flips[0][i] = INF\r\n flips[0][0] = 0\r\n cooking_time, num_intervals = map(int, input().split())\r\n \r\n for i in range(1, num_intervals + 1):\r\n interval_start, interval_end = map(int, input().split())\r\n \r\n for j in range(cooking_time + 1):\r\n flips[i % 2][j] = flips[(i + 1) % 2][j]\r\n \r\n head, tail = 1, 0\r\n for j in range(interval_end, -1, -1):\r\n while head <= tail and flips[(i + 1) % 2][flip_intervals[tail]] > flips[(i + 1) % 2][interval_end - j]:\r\n tail -= 1\r\n while head <= tail and flip_intervals[head] < interval_start - j:\r\n head += 1\r\n tail += 1\r\n flip_intervals[tail] = interval_end - j\r\n flips[i % 2][j] = min(flips[i % 2][j], flips[(i + 1) % 2][flip_intervals[head]] + 1)\r\n \r\n head, tail = 1, 0\r\n for j in range(min(cooking_time, interval_end) + 1):\r\n while head <= tail and flips[(i + 1) % 2][flip_intervals[tail]] > flips[(i + 1) % 2][j]:\r\n tail -= 1\r\n while head <= tail and flip_intervals[head] < j - interval_end + interval_start:\r\n head += 1\r\n tail += 1\r\n flip_intervals[tail] = j\r\n flips[i % 2][j] = min(flips[i % 2][j], flips[(i + 1) % 2][flip_intervals[head]] + 2)\r\n \r\n if flips[num_intervals % 2][cooking_time] == INF:\r\n print(\"Hungry\")\r\n else:\r\n print(\"Full\")\r\n print(flips[num_intervals % 2][cooking_time])\r\n\r\ndef main():\r\n T = 1\r\n while T > 0:\r\n solve()\r\n T -= 1\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nINF = (1 << 62)\r\nN = 200005\r\nMOD = 1000000007\r\n\r\nf = [[INF] * N for _ in range(2)]\r\nq = [0] * N\r\nn, k = 0, 0\r\n\r\ndef solve():\r\n global n, k\r\n for i in range(N):\r\n f[0][i] = INF\r\n f[0][0] = 0\r\n n, k = map(int, input().split())\r\n for i in range(1, k + 1):\r\n l, r = map(int, input().split())\r\n for j in range(n + 1):\r\n f[i % 2][j] = f[(i + 1) % 2][j]\r\n head, tail = 1, 0\r\n for j in range(r, -1, -1):\r\n while head <= tail and f[(i + 1) % 2][q[tail]] > f[(i + 1) % 2][r - j]:\r\n tail -= 1\r\n while head <= tail and q[head] < l - j:\r\n head += 1\r\n tail += 1\r\n q[tail] = r - j\r\n f[i % 2][j] = min(f[i % 2][j], f[(i + 1) % 2][q[head]] + 1)\r\n head, tail = 1, 0\r\n for j in range(min(n, r) + 1):\r\n while head <= tail and f[(i + 1) % 2][q[tail]] > f[(i + 1) % 2][j]:\r\n tail -= 1\r\n while head <= tail and q[head] < j - r + l:\r\n head += 1\r\n tail += 1\r\n q[tail] = j\r\n f[i % 2][j] = min(f[i % 2][j], f[(i + 1) % 2][q[head]] + 2)\r\n if f[k % 2][n] == INF:\r\n print(\"Hungry\")\r\n else:\r\n print(\"Full\")\r\n print(f[k % 2][n])\r\n\r\ndef main():\r\n T = 1\r\n while T > 0:\r\n solve()\r\n T -= 1\r\n\r\nif __name__ == \"__main__\":\r\n main()" ]

[ "n = int(input()); s = input(); m = int(input())\na = [0]*(n+2); b = [0]*(n+2); q = [0]*(n+1);\ndp = [(0, 0)]*(n+2)\n\nfor i in range(0, n):\n b[i] = b[i-2]+(s[i] == 'b')\n a[i] = a[i-2]+(s[i] == 'a')\n q[i] = q[i-1]+(s[i] == '?')\n\nfor i in range(n-1, -1, -1):\n if i+m-1 >= n:\n continue\n dp[i] = dp[i+1]\n i_b = 1 if m%2 == 1 else 2\n i_a = 1 if m%2 == 0 else 2\n \n if not (b[i+m-i_b]-b[i-2] or a[i+m-i_a]-a[i-1]):\n t, r = dp[i+m]\n dp[i] = min((t-1, r+q[i+m-1]-q[i-1]), dp[i])\nprint(dp[0][1])\n\n", "n = int(input())\r\ns = input()\r\nm = int(input())\r\n\r\ndp = [[0, 0] for _ in range(n+1)]\r\nc = [[0, 0] for _ in range(n+1)]\r\nq = [0] * (n+1)\r\n\r\nfor i in range(1, n+1):\r\n q[i] = q[i-1] + (s[i-1] == '?')\r\n if s[i-1] != 'b':\r\n c[i][1] = c[i-1][0] + 1\r\n if s[i-1] != 'a':\r\n c[i][0] = c[i-1][1] + 1\r\n if c[i][m&1] >= m:\r\n dp[i] = [dp[i-m][0] + 1, dp[i-m][1] - q[i] + q[i-m]]\r\n dp[i] = max(dp[i], dp[i-1])\r\n\r\nprint(-dp[n][1])", "n = int(input())\r\ns = input()\r\nm = int(input())\r\ndp = [[0, 0] for _ in range(n + 1)]\r\nc = [[0, 0] for _ in range(n + 1)]\r\nq = [0] * (n + 1)\r\nfor i in range(1, n + 1):\r\n q[i] = q[i-1] + (s[i - 1] == '?')\r\n if s[i - 1] != 'b':\r\n c[i][1] = c[i - 1][0] + 1\r\n if s[i-1] != 'a':\r\n c[i][0] = c[i - 1][1] + 1\r\n if c[i][m & 1] >= m:\r\n dp[i] = [dp[i - m][0] + 1, dp[i - m][1] - q[i] + q[i - m]]\r\n dp[i] = max(dp[i], dp[i - 1])\r\nprint(-dp[n][1])# 1691617187.1422298", "match = 0; nonmatch = 0; count = 0\r\ndef calc_match(s, t, p):\r\n global match\r\n global nonmatch\r\n global count\r\n if p == len(s)-len(t):\r\n return\r\n if p+len(t) < len(s):\r\n if s[p+len(t)] == '?':\r\n count -= 1\r\n elif s[p+len(t)] == t[-1]:\r\n match -= 1\r\n else:\r\n nonmatch -= 1\r\n match, nonmatch = nonmatch, match\r\n if p+len(t) < len(s):\r\n if s[p] == '?':\r\n count += 1\r\n elif s[p] == 'a':\r\n match += 1\r\n else:\r\n nonmatch += 1\r\ndef init_match(s, t):\r\n global match\r\n global nonmatch\r\n global count\r\n p = len(s)-len(t)\r\n for i in range(len(t)):\r\n if s[p+i] == '?':\r\n count += 1\r\n elif s[p+i] == t[i]:\r\n match += 1\r\n else:\r\n nonmatch += 1\r\nn = int(input())\r\ns = input()\r\nm = int(input())\r\nt = \"\"\r\nfor i in range(m):\r\n if i%2==0:\r\n t = t + 'a'\r\n else:\r\n t = t + 'b'\r\n \r\ninit_match(s,t)\r\n \r\ndp = []\r\nfor i in range(n+3):\r\n dp.append((0, 0))\r\n \r\np = n-m\r\nwhile p >= 0:\r\n calc_match(s, t, p)\r\n if nonmatch == 0:\r\n if dp[p+1][0] == dp[p+m][0]+1:\r\n dp[p] = (dp[p+1][0], min(dp[p+1][1], dp[p+m][1]+count))\r\n elif dp[p+1][0] > dp[p+m][0]+1:\r\n dp[p] = dp[p+1]\r\n else:\r\n dp[p] = (dp[p+m][0]+1, dp[p+m][1]+count)\r\n else:\r\n dp[p] = dp[p+1]\r\n p -= 1\r\n \r\nprint(dp[0][1])" ]

[ "n = int(input())\r\na = sorted(map(int, input().split()), reverse=1)\r\nif a[-1] == 0:\r\n k = sum(a)\r\n l1 = []\r\n l2 = []\r\n F = 1\r\n for i in range(n):\r\n if a[i] % 3 == 1:\r\n l1.append(a[i])\r\n elif a[i] % 3 == 2:\r\n l2.append(a[i])\r\n if k % 3 == 2:\r\n if l2:\r\n a.remove(l2[-1])\r\n elif len(l1) > 1:\r\n a.remove(l1[-1])\r\n a.remove(l1[-2])\r\n else:\r\n F = 0\r\n elif k % 3 == 1:\r\n if l1:\r\n a.remove(l1[-1])\r\n elif len(l2) > 1:\r\n a.remove(l2[-1])\r\n a.remove(l2[-2])\r\n else:\r\n F = 0\r\n if F:\r\n print(int(''.join([str(i) for i in a])))\r\n else:\r\n print(0)\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\na=[[],[],[]]\r\nc0=0\r\ns=0\r\nfor i in arr:\r\n s+=i\r\n if i==0:\r\n c0+=1\r\n a[i%3].append(i)\r\nif not c0:\r\n print(-1)\r\n exit()\r\na[0].sort(reverse=True)\r\na[1].sort(reverse=True)\r\na[2].sort(reverse=True)\r\ninc=[]\r\nif s%3:\r\n if len(a[s%3]):\r\n a[s%3].pop()\r\n elif len(a[3-s%3])>=2:\r\n a[3-s%3].pop()\r\n a[3-s%3].pop()\r\n elif len(a[0]):\r\n print(int(''.join(map(str,a[0]))))\r\n else:\r\n print(-1)\r\n exit()\r\ninc+=a[0]\r\ninc+=a[1]\r\ninc+=a[2]\r\ninc.sort(reverse=True)\r\nprint(int(''.join(map(str,inc))))", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n sum_val = sum(a)\r\n m = 0\r\n uno = []\r\n dos = []\r\n\r\n a.sort(reverse=True)\r\n\r\n if a[-1]:\r\n print(-1)\r\n return\r\n\r\n if sum_val % 3 == 0:\r\n if not a[0]:\r\n print(0)\r\n return\r\n\r\n for i in range(n):\r\n print(a[i], end=\"\")\r\n print()\r\n\r\n elif sum_val % 3 == 1:\r\n k = 0\r\n for i in range(n - 1, -1, -1):\r\n if a[i] % 3 == 2:\r\n dos.append(i)\r\n elif a[i] % 3 == 1:\r\n a[i] = -1\r\n k = 1\r\n break\r\n\r\n if not k:\r\n if len(dos) < 2:\r\n print(-1)\r\n return\r\n a[dos[0]] = -1\r\n a[dos[1]] = -1\r\n\r\n for i in range(n):\r\n if a[i] >= 0:\r\n uno.append(a[i])\r\n\r\n if uno[0] == 0:\r\n print(0)\r\n else:\r\n for i in range(len(uno)):\r\n print(uno[i], end=\"\")\r\n print()\r\n\r\n else:\r\n k = 0\r\n for i in range(n - 1, -1, -1):\r\n if a[i] % 3 == 1:\r\n uno.append(i)\r\n elif a[i] % 3 == 2:\r\n a[i] = -1\r\n k = 1\r\n break\r\n\r\n if not k:\r\n if len(uno) < 2:\r\n print(-1)\r\n return\r\n a[uno[0]] = -1\r\n a[uno[1]] = -1\r\n\r\n for i in range(n):\r\n if a[i] >= 0:\r\n dos.append(a[i])\r\n\r\n if dos[0] == 0:\r\n print(0)\r\n else:\r\n for i in range(len(dos)):\r\n print(dos[i], end=\"\")\r\n print()\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\n \r\nif a[0]!=0:\r\n print(-1)\r\n exit()\r\n \r\ns = sum(a)%3\r\n \r\nif s!=0:\r\n b = next((i for i, v in enumerate(a) if v%3==s), None)\r\n if b is None:\r\n del a[next((i for i, v in enumerate(a) if v%3==3-s), None)]\r\n del a[next((i for i, v in enumerate(a) if v%3==3-s), None)]\r\n else: \r\n del a[b]\r\n \r\na.reverse()\r\nif a[0]==0: \r\n print(0)\r\nelse: \r\n print(''.join(map(str,a)))", "# https://codeforces.com/problemset/problem/214/B\r\nn = int(input())\r\na = list(map(int,input().split()))\r\na.sort(reverse=True)\r\nif a[-1] != 0:\r\n print(-1)\r\n exit()\r\ntotal = sum(a)\r\nif total % 3 != 0:\r\n t = total%3\r\n for i in range(n - 1,-1,-1):\r\n if a[i]%3 == t:\r\n a = a[:i] + a[i + 1:]\r\n break\r\n else:\r\n cnt = 0\r\n for i in range(n - 1, -1, -1):\r\n if a[i] % 3 == 3 - t:\r\n a = a[:i] + a[i + 1:]\r\n cnt += 1\r\n if cnt == 2:\r\n break\r\nif a[0] == 0:\r\n print(0)\r\nelse:\r\n print(''.join([str(i) for i in a]))\r\n", "input()\r\na = sorted(map(int, input().split()))\r\nif a[0] != 0:\r\n a = [-1]\r\nelse:\r\n s = sum(a)\r\n if s % 3 != 0:\r\n flag = False\r\n for i in a:\r\n if i % 3 == s % 3:\r\n flag = True\r\n a.remove(i)\r\n break\r\n if(flag == False):\r\n for i in a:\r\n if i % 3:\r\n a.remove(i)\r\n break\r\n for i in a:\r\n if i % 3:\r\n a.remove(i)\r\n break\r\nwhile len(a) > 1 and a[-1] == 0:\r\n a.pop()\r\nprint(''.join(map(str, a[::-1])))\r\n" ]